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));
134 static void re_croak2 _((const char* pat1,const char* pat2,...)) __attribute__((noreturn));
137 static I32 seen_zerolen;
146 /* Length of a variant. */
154 I32 last_end; /* min value, <0 unless valid. */
157 SV **longest; /* Either &l_fixed, or &l_float. */
161 I32 offset_float_min;
162 I32 offset_float_max;
166 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
168 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
169 #define SF_BEFORE_SEOL 0x1
170 #define SF_BEFORE_MEOL 0x2
171 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
172 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
174 #define SF_FIX_SHIFT_EOL (+2)
175 #define SF_FL_SHIFT_EOL (+4)
177 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
178 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
180 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
181 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
182 #define SF_IS_INF 0x40
183 #define SF_HAS_PAR 0x80
184 #define SF_IN_PAR 0x100
185 #define SF_HAS_EVAL 0x200
186 #define SCF_DO_SUBSTR 0x400
189 scan_commit(scan_data_t *data)
191 STRLEN l = SvCUR(data->last_found);
192 STRLEN old_l = SvCUR(*data->longest);
194 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
195 sv_setsv(*data->longest, data->last_found);
196 if (*data->longest == data->longest_fixed) {
197 data->offset_fixed = l ? data->last_start_min : data->pos_min;
198 if (data->flags & SF_BEFORE_EOL)
200 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
202 data->flags &= ~SF_FIX_BEFORE_EOL;
204 data->offset_float_min = l ? data->last_start_min : data->pos_min;
205 data->offset_float_max = (l
206 ? data->last_start_max
207 : data->pos_min + data->pos_delta);
208 if (data->flags & SF_BEFORE_EOL)
210 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
212 data->flags &= ~SF_FL_BEFORE_EOL;
215 SvCUR_set(data->last_found, 0);
217 data->flags &= ~SF_BEFORE_EOL;
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 && (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 (data && (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 && (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. */
816 /* XXXX To minimize changes to RE engine we always allocate
817 3-units-long substrs field. */
818 Newz(1004, r->substrs, 1, struct reg_substr_data);
820 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
823 STRLEN longest_float_length, longest_fixed_length;
825 StructCopy(&zero_scan_data, &data, scan_data_t);
827 /* Skip introductions and multiplicators >= 1. */
828 while ((OP(first) == OPEN && (sawopen = 1)) ||
829 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
830 (OP(first) == PLUS) ||
831 (OP(first) == MINMOD) ||
832 (regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
833 if (OP(first) == PLUS)
836 first += regarglen[(U8)OP(first)];
837 first = NEXTOPER(first);
840 /* Starting-point info. */
842 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
843 else if (strchr(simple+2,OP(first)))
844 r->regstclass = first;
845 else if (regkind[(U8)OP(first)] == BOUND ||
846 regkind[(U8)OP(first)] == NBOUND)
847 r->regstclass = first;
848 else if (regkind[(U8)OP(first)] == BOL) {
849 r->reganch |= (OP(first) == MBOL ? ROPT_ANCH_MBOL: ROPT_ANCH_BOL);
850 first = NEXTOPER(first);
853 else if (OP(first) == GPOS) {
854 r->reganch |= ROPT_ANCH_GPOS;
855 first = NEXTOPER(first);
858 else if ((OP(first) == STAR &&
859 regkind[(U8)OP(NEXTOPER(first))] == ANY) &&
860 !(r->reganch & ROPT_ANCH) )
862 /* turn .* into ^.* with an implied $*=1 */
863 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
864 first = NEXTOPER(first);
867 if (sawplus && (!sawopen || !regsawback))
868 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
870 /* Scan is after the zeroth branch, first is atomic matcher. */
871 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
874 * If there's something expensive in the r.e., find the
875 * longest literal string that must appear and make it the
876 * regmust. Resolve ties in favor of later strings, since
877 * the regstart check works with the beginning of the r.e.
878 * and avoiding duplication strengthens checking. Not a
879 * strong reason, but sufficient in the absence of others.
880 * [Now we resolve ties in favor of the earlier string if
881 * it happens that c_offset_min has been invalidated, since the
882 * earlier string may buy us something the later one won't.]
886 data.longest_fixed = newSVpv("",0);
887 data.longest_float = newSVpv("",0);
888 data.last_found = newSVpv("",0);
889 data.longest = &(data.longest_fixed);
892 minlen = study_chunk(&first, &fake, scan + regsize, /* Up to end */
893 &data, SCF_DO_SUBSTR);
894 if ( regnpar == 1 && data.longest == &(data.longest_fixed)
895 && data.last_start_min == 0 && data.last_end > 0
897 && (!(regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
898 r->reganch |= ROPT_CHECK_ALL;
900 SvREFCNT_dec(data.last_found);
902 longest_float_length = SvCUR(data.longest_float);
903 if (longest_float_length
904 || (data.flags & SF_FL_BEFORE_EOL
905 && (!(data.flags & SF_FL_BEFORE_MEOL)
906 || (regflags & PMf_MULTILINE)))) {
907 if (SvCUR(data.longest_fixed)
908 && data.offset_fixed == data.offset_float_min)
909 goto remove; /* Like in (a)+. */
911 r->float_substr = data.longest_float;
912 r->float_min_offset = data.offset_float_min;
913 r->float_max_offset = data.offset_float_max;
914 fbm_compile(r->float_substr, 0);
915 BmUSEFUL(r->float_substr) = 100;
916 if (data.flags & SF_FL_BEFORE_EOL /* Cannot have SEOL and MULTI */
917 && (!(data.flags & SF_FL_BEFORE_MEOL)
918 || (regflags & PMf_MULTILINE)))
919 SvTAIL_on(r->float_substr);
922 r->float_substr = Nullsv;
923 SvREFCNT_dec(data.longest_float);
924 longest_float_length = 0;
927 longest_fixed_length = SvCUR(data.longest_fixed);
928 if (longest_fixed_length
929 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
930 && (!(data.flags & SF_FIX_BEFORE_MEOL)
931 || (regflags & PMf_MULTILINE)))) {
932 r->anchored_substr = data.longest_fixed;
933 r->anchored_offset = data.offset_fixed;
934 fbm_compile(r->anchored_substr, 0);
935 BmUSEFUL(r->anchored_substr) = 100;
936 if (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
937 && (!(data.flags & SF_FIX_BEFORE_MEOL)
938 || (regflags & PMf_MULTILINE)))
939 SvTAIL_on(r->anchored_substr);
941 r->anchored_substr = Nullsv;
942 SvREFCNT_dec(data.longest_fixed);
943 longest_fixed_length = 0;
946 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
947 if (longest_fixed_length > longest_float_length) {
948 r->check_substr = r->anchored_substr;
949 r->check_offset_min = r->check_offset_max = r->anchored_offset;
950 if (r->reganch & ROPT_ANCH_SINGLE)
951 r->reganch |= ROPT_NOSCAN;
953 r->check_substr = r->float_substr;
954 r->check_offset_min = data.offset_float_min;
955 r->check_offset_max = data.offset_float_max;
958 /* Several toplevels. Best we can is to set minlen. */
961 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
962 scan = r->program + 1;
963 minlen = study_chunk(&scan, &fake, scan + regsize, NULL, 0);
964 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
967 r->nparens = regnpar - 1;
969 if (regseen & REG_SEEN_GPOS)
970 r->reganch |= ROPT_GPOS_SEEN;
971 if (regseen & REG_SEEN_LOOKBEHIND)
972 r->reganch |= ROPT_LOOKBEHIND_SEEN;
973 Newz(1002, r->startp, regnpar, char*);
974 Newz(1002, r->endp, regnpar, char*);
980 - reg - regular expression, i.e. main body or parenthesized thing
982 * Caller must absorb opening parenthesis.
984 * Combining parenthesis handling with the base level of regular expression
985 * is a trifle forced, but the need to tie the tails of the branches to what
986 * follows makes it hard to avoid.
989 reg(I32 paren, I32 *flagp)
990 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
992 register regnode *ret; /* Will be the head of the group. */
993 register regnode *br;
994 register regnode *lastbr;
995 register regnode *ender = 0;
996 register I32 parno = 0;
997 I32 flags, oregflags = regflags, have_branch = 0, open = 0;
1000 *flagp = HASWIDTH; /* Tentatively. */
1002 /* Make an OPEN node, if parenthesized. */
1004 if (*regparse == '?') {
1006 paren = *regparse++;
1007 ret = NULL; /* For look-ahead/behind. */
1010 #ifndef REGALIGN_STRUCT
1011 FAIL("lookbehind non-implemented without REGALIGN_STRUCT");
1013 regseen |= REG_SEEN_LOOKBEHIND;
1014 if (*regparse == '!')
1016 if (*regparse != '=' && *regparse != '!')
1027 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1030 while (*regparse && *regparse != ')')
1032 if (*regparse != ')')
1033 FAIL("Sequence (?#... not terminated");
1040 I32 count = 1, n = 0;
1044 OP_4tree *sop, *rop;
1047 while (count && (c = *regparse)) {
1048 if (c == '\\' && regparse[1])
1056 if (*regparse != ')')
1057 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1061 if (regparse - 1 - s)
1062 sv = newSVpv(s, regparse - 1 - s);
1064 sv = newSVpv("", 0);
1066 rop = sv_compile_2op(sv, &sop, "re", &av);
1068 n = add_data(3, "nso");
1069 rx->data->data[n] = (void*)rop;
1070 rx->data->data[n+1] = (void*)av;
1071 rx->data->data[n+2] = (void*)sop;
1073 } else { /* First pass */
1075 FAIL("Eval-group in insecure regular expression");
1079 return reganode(EVAL, n);
1083 if (regparse[0] == '?') {
1084 if (regparse[1] == '=' || regparse[1] == '!'
1085 || regparse[1] == '<'
1086 || regparse[1] == '{') { /* Lookahead or eval. */
1089 ret = reg_node(LOGICAL);
1090 regtail(ret, reg(1, &flag));
1093 } else if (regparse[0] >= '1' && regparse[0] <= '9' ) {
1094 parno = atoi(regparse++);
1096 while (isDIGIT(*regparse))
1098 ret = reganode(GROUPP, parno);
1099 if ((c = *nextchar()) != ')')
1100 FAIL2("Switch (?(number%c not recognized", c);
1102 regtail(ret, reganode(IFTHEN, 0));
1103 br = regbranch(&flags, 1);
1105 br = reganode(LONGJMP, 0);
1107 regtail(br, reganode(LONGJMP, 0));
1110 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1111 regbranch(&flags, 1);
1112 regtail(ret, lastbr);
1117 FAIL("Switch (?(condition)... contains too many branches");
1118 ender = reg_node(TAIL);
1121 regtail(lastbr, ender);
1122 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1124 regtail(ret, ender);
1127 FAIL2("Unknown condition for (?(%.2s", regparse);
1131 FAIL("Sequence (? incomplete");
1135 while (*regparse && strchr("iogcmsx", *regparse))
1136 pmflag(®flags, *regparse++);
1138 if (*regparse != ')')
1139 FAIL2("Sequence (?%c...) not recognized", *regparse);
1148 ret = reganode(OPEN, parno);
1154 /* Pick up the branches, linking them together. */
1155 br = regbranch(&flags, 1);
1158 if (*regparse == '|') {
1159 if (!SIZE_ONLY && extralen) {
1160 reginsert(BRANCHJ, br);
1162 reginsert(BRANCH, br);
1165 extralen += 1; /* For BRANCHJ-BRANCH. */
1166 } else if (paren == ':') {
1167 *flagp |= flags&SIMPLE;
1169 if (open) { /* Starts with OPEN. */
1170 regtail(ret, br); /* OPEN -> first. */
1171 } else if (paren != '?') /* Not Conditional */
1173 if (!(flags&HASWIDTH))
1174 *flagp &= ~HASWIDTH;
1175 *flagp |= flags&SPSTART;
1177 while (*regparse == '|') {
1178 if (!SIZE_ONLY && extralen) {
1179 ender = reganode(LONGJMP,0);
1180 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1183 extralen += 2; /* Account for LONGJMP. */
1185 br = regbranch(&flags, 0);
1188 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1190 if (!(flags&HASWIDTH))
1191 *flagp &= ~HASWIDTH;
1192 *flagp |= flags&SPSTART;
1195 if (have_branch || paren != ':') {
1196 /* Make a closing node, and hook it on the end. */
1199 ender = reg_node(TAIL);
1202 ender = reganode(CLOSE, parno);
1209 ender = reg_node(SUCCEED);
1210 *flagp &= ~HASWIDTH;
1213 ender = reg_node(END);
1216 regtail(lastbr, ender);
1219 /* Hook the tails of the branches to the closing node. */
1220 for (br = ret; br != NULL; br = regnext(br)) {
1221 regoptail(br, ender);
1228 static char parens[] = "=!<,>";
1230 if (paren && (p = strchr(parens, paren))) {
1231 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1232 int flag = (p - parens) > 1;
1235 node = SUSPEND, flag = 0;
1236 reginsert(node,ret);
1237 #ifdef REGALIGN_STRUCT
1240 regtail(ret, reg_node(TAIL));
1244 /* Check for proper termination. */
1245 if (paren && (regparse >= regxend || *nextchar() != ')')) {
1246 FAIL("unmatched () in regexp");
1247 } else if (!paren && regparse < regxend) {
1248 if (*regparse == ')') {
1249 FAIL("unmatched () in regexp");
1251 FAIL("junk on end of regexp"); /* "Can't happen". */
1255 regflags = oregflags;
1262 - regbranch - one alternative of an | operator
1264 * Implements the concatenation operator.
1267 regbranch(I32 *flagp, I32 first)
1269 register regnode *ret;
1270 register regnode *chain = NULL;
1271 register regnode *latest;
1272 I32 flags = 0, c = 0;
1277 if (!SIZE_ONLY && extralen)
1278 ret = reganode(BRANCHJ,0);
1280 ret = reg_node(BRANCH);
1283 if (!first && SIZE_ONLY)
1284 extralen += 1; /* BRANCHJ */
1286 *flagp = WORST; /* Tentatively. */
1290 while (regparse < regxend && *regparse != '|' && *regparse != ')') {
1292 latest = regpiece(&flags);
1293 if (latest == NULL) {
1294 if (flags & TRYAGAIN)
1297 } else if (ret == NULL)
1299 *flagp |= flags&HASWIDTH;
1300 if (chain == NULL) /* First piece. */
1301 *flagp |= flags&SPSTART;
1304 regtail(chain, latest);
1309 if (chain == NULL) { /* Loop ran zero times. */
1310 chain = reg_node(NOTHING);
1315 *flagp |= flags&SIMPLE;
1322 - regpiece - something followed by possible [*+?]
1324 * Note that the branching code sequences used for ? and the general cases
1325 * of * and + are somewhat optimized: they use the same NOTHING node as
1326 * both the endmarker for their branch list and the body of the last branch.
1327 * It might seem that this node could be dispensed with entirely, but the
1328 * endmarker role is not redundant.
1331 regpiece(I32 *flagp)
1333 register regnode *ret;
1335 register char *next;
1337 char *origparse = regparse;
1340 I32 max = REG_INFTY;
1342 ret = regatom(&flags);
1344 if (flags & TRYAGAIN)
1351 if (op == '{' && regcurly(regparse)) {
1352 next = regparse + 1;
1354 while (isDIGIT(*next) || *next == ',') {
1363 if (*next == '}') { /* got one */
1367 min = atoi(regparse);
1373 if (!max && *maxpos != '0')
1374 max = REG_INFTY; /* meaning "infinity" */
1375 else if (max >= REG_INFTY)
1376 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
1381 if ((flags&SIMPLE)) {
1382 regnaughty += 2 + regnaughty / 2;
1383 reginsert(CURLY, ret);
1386 regnaughty += 4 + regnaughty; /* compound interest */
1387 regtail(ret, reg_node(WHILEM));
1388 if (!SIZE_ONLY && extralen) {
1389 reginsert(LONGJMP,ret);
1390 reginsert(NOTHING,ret);
1391 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1393 reginsert(CURLYX,ret);
1394 if (!SIZE_ONLY && extralen)
1395 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1396 regtail(ret, reg_node(NOTHING));
1400 #ifdef REGALIGN_STRUCT
1405 *flagp = (WORST|HASWIDTH);
1406 if (max && max < min)
1407 FAIL("Can't do {n,m} with n > m");
1422 #if 0 /* Now runtime fix should be reliable. */
1423 if (!(flags&HASWIDTH) && op != '?')
1424 FAIL("regexp *+ operand could be empty");
1429 *flagp = (op != '+') ? (WORST|SPSTART) : (WORST|HASWIDTH);
1431 if (op == '*' && (flags&SIMPLE)) {
1432 reginsert(STAR, ret);
1433 #ifdef REGALIGN_STRUCT
1438 else if (op == '*') {
1441 } else if (op == '+' && (flags&SIMPLE)) {
1442 reginsert(PLUS, ret);
1443 #ifdef REGALIGN_STRUCT
1448 else if (op == '+') {
1451 } else if (op == '?') {
1456 if (dowarn && !SIZE_ONLY && !(flags&HASWIDTH) && max > 10000) {
1457 warn("%.*s matches null string many times",
1458 regparse - origparse, origparse);
1461 if (*regparse == '?') {
1463 reginsert(MINMOD, ret);
1465 regtail(ret, ret + NODE_STEP_REGNODE);
1467 regtail(ret, ret + 3);
1470 if (ISMULT2(regparse))
1471 FAIL("nested *?+ in regexp");
1477 - regatom - the lowest level
1479 * Optimization: gobbles an entire sequence of ordinary characters so that
1480 * it can turn them into a single node, which is smaller to store and
1481 * faster to run. Backslashed characters are exceptions, each becoming a
1482 * separate node; the code is simpler that way and it's not worth fixing.
1484 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1489 register regnode *ret = 0;
1492 *flagp = WORST; /* Tentatively. */
1495 switch (*regparse) {
1499 if (regflags & PMf_MULTILINE)
1500 ret = reg_node(MBOL);
1501 else if (regflags & PMf_SINGLELINE)
1502 ret = reg_node(SBOL);
1504 ret = reg_node(BOL);
1510 if (regflags & PMf_MULTILINE)
1511 ret = reg_node(MEOL);
1512 else if (regflags & PMf_SINGLELINE)
1513 ret = reg_node(SEOL);
1515 ret = reg_node(EOL);
1519 if (regflags & PMf_SINGLELINE)
1520 ret = reg_node(SANY);
1522 ret = reg_node(ANY);
1524 *flagp |= HASWIDTH|SIMPLE;
1529 *flagp |= HASWIDTH|SIMPLE;
1533 ret = reg(1, &flags);
1535 if (flags & TRYAGAIN)
1539 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
1543 if (flags & TRYAGAIN) {
1547 FAIL2("internal urp in regexp at /%s/", regparse);
1548 /* Supposed to be caught earlier. */
1551 if (!regcurly(regparse)) {
1559 FAIL("?+*{} follows nothing in regexp");
1562 switch (*++regparse) {
1565 ret = reg_node(SBOL);
1570 ret = reg_node(GPOS);
1571 regseen |= REG_SEEN_GPOS;
1576 ret = reg_node(SEOL);
1581 ret = reg_node((regflags & PMf_LOCALE) ? ALNUML : ALNUM);
1582 *flagp |= HASWIDTH|SIMPLE;
1586 ret = reg_node((regflags & PMf_LOCALE) ? NALNUML : NALNUM);
1587 *flagp |= HASWIDTH|SIMPLE;
1592 ret = reg_node((regflags & PMf_LOCALE) ? BOUNDL : BOUND);
1598 ret = reg_node((regflags & PMf_LOCALE) ? NBOUNDL : NBOUND);
1603 ret = reg_node((regflags & PMf_LOCALE) ? SPACEL : SPACE);
1604 *flagp |= HASWIDTH|SIMPLE;
1608 ret = reg_node((regflags & PMf_LOCALE) ? NSPACEL : NSPACE);
1609 *flagp |= HASWIDTH|SIMPLE;
1613 ret = reg_node(DIGIT);
1614 *flagp |= HASWIDTH|SIMPLE;
1618 ret = reg_node(NDIGIT);
1619 *flagp |= HASWIDTH|SIMPLE;
1632 case '1': case '2': case '3': case '4':
1633 case '5': case '6': case '7': case '8': case '9':
1635 I32 num = atoi(regparse);
1637 if (num > 9 && num >= regnpar)
1641 ret = reganode((regflags & PMf_FOLD)
1642 ? ((regflags & PMf_LOCALE) ? REFFL : REFF)
1645 while (isDIGIT(*regparse))
1653 if (regparse >= regxend)
1654 FAIL("trailing \\ in regexp");
1662 if (regflags & PMf_EXTENDED) {
1663 while (regparse < regxend && *regparse != '\n') regparse++;
1664 if (regparse < regxend)
1679 ret = reg_node((regflags & PMf_FOLD)
1680 ? ((regflags & PMf_LOCALE) ? EXACTFL : EXACTF)
1682 s = (char *) OPERAND(ret);
1683 regc(0, s++); /* save spot for len */
1684 for (len = 0, p = regparse - 1;
1685 len < 127 && p < regxend;
1690 if (regflags & PMf_EXTENDED)
1691 p = regwhite(p, regxend);
1741 ender = scan_hex(++p, 2, &numlen);
1746 ender = UCHARAT(p++);
1747 ender = toCTRL(ender);
1749 case '0': case '1': case '2': case '3':case '4':
1750 case '5': case '6': case '7': case '8':case '9':
1752 (isDIGIT(p[1]) && atoi(p) >= regnpar) ) {
1753 ender = scan_oct(p, 3, &numlen);
1763 FAIL("trailing \\ in regexp");
1774 if (regflags & PMf_EXTENDED)
1775 p = regwhite(p, regxend);
1776 if (ISMULT2(p)) { /* Back off on ?+*. */
1791 FAIL("internal disaster in regexp");
1797 *OPERAND(ret) = len;
1800 #ifdef REGALIGN_STRUCT
1801 regsize += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1804 regcode += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1814 regwhite(char *p, char *e)
1819 else if (*p == '#') {
1822 } while (p < e && *p != '\n');
1831 regset(char *opnd, register I32 c)
1836 opnd[1 + (c >> 3)] |= (1 << (c & 7));
1842 register char *opnd, *s;
1844 register I32 lastclass = 1234;
1845 register I32 range = 0;
1846 register regnode *ret;
1850 s = opnd = (char *) OPERAND(regcode);
1851 ret = reg_node(ANYOF);
1852 for (Class = 0; Class < 33; Class++)
1854 if (*regparse == '^') { /* Complement of range. */
1858 *opnd |= ANYOF_INVERT;
1861 regcode += ANY_SKIP;
1862 if (regflags & PMf_FOLD)
1863 *opnd |= ANYOF_FOLD;
1864 if (regflags & PMf_LOCALE)
1865 *opnd |= ANYOF_LOCALE;
1867 regsize += ANY_SKIP;
1869 if (*regparse == ']' || *regparse == '-')
1870 goto skipcond; /* allow 1st char to be ] or - */
1871 while (regparse < regxend && *regparse != ']') {
1873 Class = UCHARAT(regparse++);
1874 if (Class == '[' && regparse + 1 < regxend &&
1875 /* I smell either [: or [= or [. -- POSIX has been here, right? */
1876 (*regparse == ':' || *regparse == '=' || *regparse == '.')) {
1877 char posixccc = *regparse;
1878 char* posixccs = regparse++;
1880 while (regparse < regxend && *regparse != posixccc)
1882 if (regparse == regxend)
1883 /* Grandfather lone [:, [=, [. */
1884 regparse = posixccs;
1886 regparse++; /* skip over the posixccc */
1887 if (*regparse == ']') {
1888 /* Not Implemented Yet.
1889 * (POSIX Extended Character Classes, that is)
1890 * The text between e.g. [: and :] would start
1891 * at posixccs + 1 and stop at regparse - 2. */
1892 if (dowarn && !SIZE_ONLY)
1893 warn("Character class syntax [%c %c] is reserved for future extensions", posixccc, posixccc);
1894 regparse++; /* skip over the ending ] */
1898 if (Class == '\\') {
1899 Class = UCHARAT(regparse++);
1902 if (regflags & PMf_LOCALE) {
1904 *opnd |= ANYOF_ALNUML;
1907 for (Class = 0; Class < 256; Class++)
1909 regset(opnd, Class);
1914 if (regflags & PMf_LOCALE) {
1916 *opnd |= ANYOF_NALNUML;
1919 for (Class = 0; Class < 256; Class++)
1920 if (!isALNUM(Class))
1921 regset(opnd, Class);
1926 if (regflags & PMf_LOCALE) {
1928 *opnd |= ANYOF_SPACEL;
1931 for (Class = 0; Class < 256; Class++)
1933 regset(opnd, Class);
1938 if (regflags & PMf_LOCALE) {
1940 *opnd |= ANYOF_NSPACEL;
1943 for (Class = 0; Class < 256; Class++)
1944 if (!isSPACE(Class))
1945 regset(opnd, Class);
1950 for (Class = '0'; Class <= '9'; Class++)
1951 regset(opnd, Class);
1955 for (Class = 0; Class < '0'; Class++)
1956 regset(opnd, Class);
1957 for (Class = '9' + 1; Class < 256; Class++)
1958 regset(opnd, Class);
1983 Class = scan_hex(regparse, 2, &numlen);
1987 Class = UCHARAT(regparse++);
1988 Class = toCTRL(Class);
1990 case '0': case '1': case '2': case '3': case '4':
1991 case '5': case '6': case '7': case '8': case '9':
1992 Class = scan_oct(--regparse, 3, &numlen);
1998 if (lastclass > Class)
1999 FAIL("invalid [] range in regexp");
2004 if (*regparse == '-' && regparse+1 < regxend &&
2005 regparse[1] != ']') {
2008 continue; /* do it next time */
2011 for ( ; lastclass <= Class; lastclass++)
2012 regset(opnd, lastclass);
2015 if (*regparse != ']')
2016 FAIL("unmatched [] in regexp");
2024 char* retval = regparse++;
2027 if (*regparse == '(' && regparse[1] == '?' &&
2028 regparse[2] == '#') {
2029 while (*regparse && *regparse != ')')
2034 if (regflags & PMf_EXTENDED) {
2035 if (isSPACE(*regparse)) {
2039 else if (*regparse == '#') {
2040 while (*regparse && *regparse != '\n')
2051 - reg_node - emit a node
2053 static regnode * /* Location. */
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 reganode(U8 op, U32 arg)
2084 register regnode *ret;
2085 register regnode *ptr;
2089 SIZE_ALIGN(regsize);
2098 NODE_ALIGN_FILL(ret);
2100 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
2107 - regc - emit (if appropriate) a byte of code
2117 - reginsert - insert an operator in front of already-emitted operand
2119 * Means relocating the operand.
2122 reginsert(U8 op, regnode *opnd)
2124 register regnode *src;
2125 register regnode *dst;
2126 register regnode *place;
2127 register int offset = regarglen[(U8)op];
2129 /* (regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
2132 regsize += NODE_STEP_REGNODE + offset;
2137 regcode += NODE_STEP_REGNODE + offset;
2140 StructCopy(--src, --dst, regnode);
2142 place = opnd; /* Op node, where operand used to be. */
2143 src = NEXTOPER(place);
2144 FILL_ADVANCE_NODE(place, op);
2145 Zero(src, offset, regnode);
2146 #if defined(REGALIGN) && !defined(REGALIGN_STRUCT)
2147 src[offset + 1] = '\177';
2152 - regtail - set the next-pointer at the end of a node chain of p to val.
2155 regtail(regnode *p, regnode *val)
2157 register regnode *scan;
2158 register regnode *temp;
2159 register I32 offset;
2164 /* Find last node. */
2167 temp = regnext(scan);
2174 # ifdef REGALIGN_STRUCT
2175 if (reg_off_by_arg[OP(scan)]) {
2176 ARG_SET(scan, val - scan);
2178 NEXT_OFF(scan) = val - scan;
2181 offset = val - scan;
2183 *(short*)(scan+1) = offset;
2187 if (OP(scan) == BACK)
2188 offset = scan - val;
2190 offset = val - scan;
2191 *(scan+1) = (offset>>8)&0377;
2192 *(scan+2) = offset&0377;
2197 - regoptail - regtail on operand of first argument; nop if operandless
2200 regoptail(regnode *p, regnode *val)
2202 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
2203 if (p == NULL || SIZE_ONLY)
2205 if (regkind[(U8)OP(p)] == BRANCH) {
2206 regtail(NEXTOPER(p), val);
2207 } else if ( regkind[(U8)OP(p)] == BRANCHJ) {
2208 regtail(NEXTOPER(NEXTOPER(p)), val);
2214 - regcurly - a little FSA that accepts {\d+,?\d*}
2217 regcurly(register char *s)
2237 dumpuntil(regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
2239 register char op = EXACT; /* Arbitrary non-END op. */
2240 register regnode *next, *onode;
2242 while (op != END && (!last || node < last)) {
2243 /* While that wasn't END last time... */
2249 next = regnext(node);
2251 if (OP(node) == OPTIMIZED)
2254 PerlIO_printf(Perl_debug_log, "%4d%*s%s", node - start,
2255 2*l + 1, "", SvPVX(sv));
2256 if (next == NULL) /* Next ptr. */
2257 PerlIO_printf(Perl_debug_log, "(0)");
2259 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
2260 (void)PerlIO_putc(Perl_debug_log, '\n');
2262 if (regkind[(U8)op] == BRANCHJ) {
2263 register regnode *nnode = (OP(next) == LONGJMP
2266 if (last && nnode > last)
2268 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
2269 } else if (regkind[(U8)op] == BRANCH) {
2270 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
2271 } else if ( op == CURLY) { /* `next' might be very big: optimizer */
2272 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2273 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
2274 } else if (regkind[(U8)op] == CURLY && op != CURLYX) {
2275 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2277 } else if ( op == PLUS || op == STAR) {
2278 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
2279 } else if (op == ANYOF) {
2280 node = NEXTOPER(node);
2282 } else if (regkind[(U8)op] == EXACT) {
2283 /* Literal string, where present. */
2284 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2285 node = NEXTOPER(node);
2287 node = NEXTOPER(node);
2288 node += regarglen[(U8)op];
2290 if (op == CURLYX || op == OPEN)
2292 else if (op == WHILEM)
2299 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
2304 SV *sv = sv_newmortal();
2306 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
2308 /* Header fields of interest. */
2309 if (r->anchored_substr)
2310 PerlIO_printf(Perl_debug_log, "anchored `%s%s%s'%s at %d ",
2312 SvPVX(r->anchored_substr),
2314 SvTAIL(r->anchored_substr) ? "$" : "",
2315 r->anchored_offset);
2316 if (r->float_substr)
2317 PerlIO_printf(Perl_debug_log, "floating `%s%s%s'%s at %d..%u ",
2319 SvPVX(r->float_substr),
2321 SvTAIL(r->float_substr) ? "$" : "",
2322 r->float_min_offset, r->float_max_offset);
2323 if (r->check_substr)
2324 PerlIO_printf(Perl_debug_log,
2325 r->check_substr == r->float_substr
2326 ? "(checking floating" : "(checking anchored");
2327 if (r->reganch & ROPT_NOSCAN)
2328 PerlIO_printf(Perl_debug_log, " noscan");
2329 if (r->reganch & ROPT_CHECK_ALL)
2330 PerlIO_printf(Perl_debug_log, " isall");
2331 if (r->check_substr)
2332 PerlIO_printf(Perl_debug_log, ") ");
2334 if (r->regstclass) {
2335 regprop(sv, r->regstclass);
2336 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
2338 if (r->reganch & ROPT_ANCH) {
2339 PerlIO_printf(Perl_debug_log, "anchored");
2340 if (r->reganch & ROPT_ANCH_BOL)
2341 PerlIO_printf(Perl_debug_log, "(BOL)");
2342 if (r->reganch & ROPT_ANCH_MBOL)
2343 PerlIO_printf(Perl_debug_log, "(MBOL)");
2344 if (r->reganch & ROPT_ANCH_GPOS)
2345 PerlIO_printf(Perl_debug_log, "(GPOS)");
2346 PerlIO_putc(Perl_debug_log, ' ');
2348 if (r->reganch & ROPT_GPOS_SEEN)
2349 PerlIO_printf(Perl_debug_log, "GPOS ");
2350 if (r->reganch & ROPT_SKIP)
2351 PerlIO_printf(Perl_debug_log, "plus ");
2352 if (r->reganch & ROPT_IMPLICIT)
2353 PerlIO_printf(Perl_debug_log, "implicit ");
2354 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
2355 PerlIO_printf(Perl_debug_log, "\n");
2359 - regprop - printable representation of opcode
2362 regprop(SV *sv, regnode *o)
2364 register char *p = 0;
2399 sv_catpvf(sv, "EXACT <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2402 sv_catpvf(sv, "EXACTF <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2405 sv_catpvf(sv, "EXACTFL <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2432 sv_catpvf(sv, "CURLY {%d,%d}", ARG1(o), ARG2(o));
2435 #ifdef REGALIGN_STRUCT
2436 sv_catpvf(sv, "CURLYM[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2438 sv_catpvf(sv, "CURLYM {%d,%d}", ARG1(o), ARG2(o));
2442 #ifdef REGALIGN_STRUCT
2443 sv_catpvf(sv, "CURLYN[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2445 sv_catpvf(sv, "CURLYN {%d,%d}", ARG1(o), ARG2(o));
2449 sv_catpvf(sv, "CURLYX {%d,%d}", ARG1(o), ARG2(o));
2452 sv_catpvf(sv, "REF%d", ARG(o));
2455 sv_catpvf(sv, "REFF%d", ARG(o));
2458 sv_catpvf(sv, "REFFL%d", ARG(o));
2461 sv_catpvf(sv, "OPEN%d", ARG(o));
2464 sv_catpvf(sv, "CLOSE%d", ARG(o));
2480 #ifdef REGALIGN_STRUCT
2481 sv_catpvf(sv, "UNLESSM[-%d]", o->flags);
2487 #ifdef REGALIGN_STRUCT
2488 sv_catpvf(sv, "IFMATCH[-%d]", o->flags);
2542 sv_catpvf(sv, "GROUPP%d", ARG(o));
2557 FAIL("corrupted regexp opcode");
2562 #endif /* DEBUGGING */
2565 pregfree(struct regexp *r)
2567 if (!r || (--r->refcnt > 0))
2570 Safefree(r->precomp);
2572 Safefree(r->subbase);
2574 Safefree(r->substrs);
2575 if (r->anchored_substr)
2576 SvREFCNT_dec(r->anchored_substr);
2577 if (r->float_substr)
2578 SvREFCNT_dec(r->float_substr);
2580 int n = r->data->count;
2582 switch (r->data->what[n]) {
2584 SvREFCNT_dec((SV*)r->data->data[n]);
2587 op_free((OP_4tree*)r->data->data[n]);
2592 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
2595 Safefree(r->data->what);
2598 Safefree(r->startp);
2604 - regnext - dig the "next" pointer out of a node
2606 * [Note, when REGALIGN is defined there are two places in regmatch()
2607 * that bypass this code for speed.]
2610 regnext(register regnode *p)
2612 register I32 offset;
2617 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
2633 re_croak2(const char* pat1,const char* pat2,...)
2637 re_croak2(const char* pat1,const char* pat2, va_alist)
2644 STRLEN l1 = strlen(pat1);
2645 STRLEN l2 = strlen(pat2);
2653 Copy(pat1, buf, l1 , char);
2654 Copy(pat2, buf + l1, l2 , char);
2655 buf[l1 + l2 + 1] = '\n';
2656 buf[l1 + l2 + 2] = '\0';
2658 va_start(args, pat2);
2662 message = mess(buf, &args);
2664 l1 = strlen(message);
2667 Copy(message, buf, l1 , char);
2668 buf[l1] = '\0'; /* Overwrite \n */