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;
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)
174 # define SF_FIX_SHIFT_EOL (0+2)
175 # define SF_FL_SHIFT_EOL (0+4)
177 # define SF_FIX_SHIFT_EOL (+2)
178 # define SF_FL_SHIFT_EOL (+4)
181 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
182 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
184 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
185 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
186 #define SF_IS_INF 0x40
187 #define SF_HAS_PAR 0x80
188 #define SF_IN_PAR 0x100
189 #define SF_HAS_EVAL 0x200
190 #define SCF_DO_SUBSTR 0x400
193 scan_commit(scan_data_t *data)
195 STRLEN l = SvCUR(data->last_found);
196 STRLEN old_l = SvCUR(*data->longest);
198 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
199 sv_setsv(*data->longest, data->last_found);
200 if (*data->longest == data->longest_fixed) {
201 data->offset_fixed = l ? data->last_start_min : data->pos_min;
202 if (data->flags & SF_BEFORE_EOL)
204 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
206 data->flags &= ~SF_FIX_BEFORE_EOL;
208 data->offset_float_min = l ? data->last_start_min : data->pos_min;
209 data->offset_float_max = (l
210 ? data->last_start_max
211 : data->pos_min + data->pos_delta);
212 if (data->flags & SF_BEFORE_EOL)
214 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
216 data->flags &= ~SF_FL_BEFORE_EOL;
219 SvCUR_set(data->last_found, 0);
221 data->flags &= ~SF_BEFORE_EOL;
224 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
225 to the position after last scanned or to NULL. */
228 study_chunk(regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
229 /* scanp: Start here (read-write). */
230 /* deltap: Write maxlen-minlen here. */
231 /* last: Stop before this one. */
233 I32 min = 0, pars = 0, code;
234 regnode *scan = *scanp, *next;
236 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
237 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
238 scan_data_t data_fake;
240 while (scan && OP(scan) != END && scan < last) {
241 /* Peephole optimizer: */
243 if (regkind[(U8)OP(scan)] == EXACT) {
244 regnode *n = regnext(scan);
247 regnode *stop = scan;
250 next = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
251 /* Skip NOTHING, merge EXACT*. */
253 ( regkind[(U8)OP(n)] == NOTHING ||
254 (stringok && (OP(n) == OP(scan))))
256 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
257 if (OP(n) == TAIL || n > next)
259 if (regkind[(U8)OP(n)] == NOTHING) {
260 NEXT_OFF(scan) += NEXT_OFF(n);
261 next = n + NODE_STEP_REGNODE;
268 int oldl = *OPERAND(scan);
269 regnode *nnext = regnext(n);
271 if (oldl + *OPERAND(n) > U8_MAX)
273 NEXT_OFF(scan) += NEXT_OFF(n);
274 *OPERAND(scan) += *OPERAND(n);
275 next = n + (*OPERAND(n) + 2 - 1)/sizeof(regnode) + 2;
276 /* Now we can overwrite *n : */
277 Move(OPERAND(n) + 1, OPERAND(scan) + oldl + 1,
278 *OPERAND(n) + 1, char);
288 n = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
290 if (regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
299 if (OP(scan) != CURLYX) {
300 int max = (reg_off_by_arg[OP(scan)] ? I32_MAX : U16_MAX);
301 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
305 /* Skip NOTHING and LONGJMP. */
306 while ((n = regnext(n))
307 && ((regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
308 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
311 if (reg_off_by_arg[OP(scan)])
314 NEXT_OFF(scan) = off;
316 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
317 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
318 next = regnext(scan);
321 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
322 I32 max1 = 0, min1 = I32_MAX, num = 0;
324 if (flags & SCF_DO_SUBSTR)
326 while (OP(scan) == code) {
327 I32 deltanext, minnext;
331 next = regnext(scan);
332 scan = NEXTOPER(scan);
334 scan = NEXTOPER(scan);
335 /* We suppose the run is continuous, last=next...*/
336 minnext = study_chunk(&scan, &deltanext, next,
340 if (max1 < minnext + deltanext)
341 max1 = minnext + deltanext;
342 if (deltanext == I32_MAX)
345 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
347 if (data && (data_fake.flags & SF_HAS_EVAL))
348 data->flags |= SF_HAS_EVAL;
352 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
354 if (flags & SCF_DO_SUBSTR) {
355 data->pos_min += min1;
356 data->pos_delta += max1 - min1;
357 if (max1 != min1 || is_inf)
358 data->longest = &(data->longest_float);
361 delta += max1 - min1;
362 } else if (code == BRANCHJ) /* single branch is optimized. */
363 scan = NEXTOPER(NEXTOPER(scan));
364 else /* single branch is optimized. */
365 scan = NEXTOPER(scan);
367 } else if (OP(scan) == EXACT) {
368 min += *OPERAND(scan);
369 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
370 I32 l = *OPERAND(scan);
372 /* The code below prefers earlier match for fixed
373 offset, later match for variable offset. */
374 if (data->last_end == -1) { /* Update the start info. */
375 data->last_start_min = data->pos_min;
376 data->last_start_max = is_inf
377 ? I32_MAX : data->pos_min + data->pos_delta;
379 sv_catpvn(data->last_found, (char *)(OPERAND(scan)+1), l);
380 data->last_end = data->pos_min + l;
381 data->pos_min += l; /* As in the first entry. */
382 data->flags &= ~SF_BEFORE_EOL;
384 } else if (regkind[(U8)OP(scan)] == EXACT) {
385 if (flags & SCF_DO_SUBSTR)
387 min += *OPERAND(scan);
388 if (data && (flags & SCF_DO_SUBSTR))
389 data->pos_min += *OPERAND(scan);
390 } else if (strchr(varies,OP(scan))) {
391 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
392 regnode *oscan = scan;
394 switch (regkind[(U8)OP(scan)]) {
396 scan = NEXTOPER(scan);
399 if (flags & SCF_DO_SUBSTR) {
400 next = NEXTOPER(scan);
401 if (OP(next) == EXACT) {
403 maxcount = REG_INFTY;
404 next = regnext(scan);
405 scan = NEXTOPER(scan);
409 if (flags & SCF_DO_SUBSTR)
415 scan = regnext(scan);
416 if (flags & SCF_DO_SUBSTR) {
418 data->longest = &(data->longest_float);
420 goto optimize_curly_tail;
422 mincount = ARG1(scan);
423 maxcount = ARG2(scan);
424 next = regnext(scan);
425 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
427 if (flags & SCF_DO_SUBSTR) {
428 if (mincount == 0) scan_commit(data);
429 pos_before = data->pos_min;
433 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
435 data->flags |= SF_IS_INF;
437 /* This will finish on WHILEM, setting scan, or on NULL: */
438 minnext = study_chunk(&scan, &deltanext, last, data,
440 ? (flags & ~SCF_DO_SUBSTR) : flags);
441 if (!scan) /* It was not CURLYX, but CURLY. */
443 if (dowarn && (minnext + deltanext == 0)
444 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR)))
445 warn("Strange *+?{} on zero-length expression");
446 min += minnext * mincount;
447 is_inf |= (maxcount == REG_INFTY && (minnext + deltanext) > 0
448 || deltanext == I32_MAX);
449 delta += (minnext + deltanext) * maxcount - minnext * mincount;
451 /* Try powerful optimization CURLYX => CURLYN. */
452 #ifdef REGALIGN_STRUCT
453 if ( OP(oscan) == CURLYX && data
454 && data->flags & SF_IN_PAR
455 && !(data->flags & SF_HAS_EVAL)
456 && !deltanext && minnext == 1 ) {
457 /* Try to optimize to CURLYN. */
458 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
459 regnode *nxt1 = nxt, *nxt2;
463 if (!strchr(simple,OP(nxt))
464 && !(regkind[(U8)OP(nxt)] == EXACT
465 && *OPERAND(nxt) == 1))
469 if (OP(nxt) != CLOSE)
471 /* Now we know that nxt2 is the only contents: */
472 oscan->flags = ARG(nxt);
474 OP(nxt1) = NOTHING; /* was OPEN. */
476 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
477 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
478 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
479 OP(nxt) = OPTIMIZED; /* was CLOSE. */
480 OP(nxt + 1) = OPTIMIZED; /* was count. */
481 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
487 /* Try optimization CURLYX => CURLYM. */
488 if ( OP(oscan) == CURLYX && data
489 #ifdef REGALIGN_STRUCT
490 && !(data->flags & SF_HAS_PAR)
492 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
494 && !(data->flags & SF_HAS_EVAL)
496 /* XXXX How to optimize if data == 0? */
497 /* Optimize to a simpler form. */
498 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
502 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
503 && (OP(nxt2) != WHILEM))
505 OP(nxt2) = SUCCEED; /* Whas WHILEM */
506 #ifdef REGALIGN_STRUCT
507 /* Need to optimize away parenths. */
508 if (data->flags & SF_IN_PAR) {
509 /* Set the parenth number. */
510 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
512 if (OP(nxt) != CLOSE)
513 FAIL("panic opt close");
514 oscan->flags = ARG(nxt);
515 OP(nxt1) = OPTIMIZED; /* was OPEN. */
516 OP(nxt) = OPTIMIZED; /* was CLOSE. */
518 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
519 OP(nxt + 1) = OPTIMIZED; /* was count. */
520 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
521 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
524 while ( nxt1 && (OP(nxt1) != WHILEM)) {
525 regnode *nnxt = regnext(nxt1);
528 if (reg_off_by_arg[OP(nxt1)])
529 ARG_SET(nxt1, nxt2 - nxt1);
530 else if (nxt2 - nxt1 < U16_MAX)
531 NEXT_OFF(nxt1) = nxt2 - nxt1;
533 OP(nxt) = NOTHING; /* Cannot beautify */
538 /* Optimize again: */
539 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
544 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
546 if (flags & SCF_DO_SUBSTR) {
547 SV *last_str = Nullsv;
548 int counted = mincount != 0;
550 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
551 I32 b = pos_before >= data->last_start_min
552 ? pos_before : data->last_start_min;
554 char *s = SvPV(data->last_found, l);
556 l -= b - data->last_start_min;
557 /* Get the added string: */
558 last_str = newSVpv(s + b - data->last_start_min, l);
559 if (deltanext == 0 && pos_before == b) {
560 /* What was added is a constant string */
562 SvGROW(last_str, (mincount * l) + 1);
563 repeatcpy(SvPVX(last_str) + l,
564 SvPVX(last_str), l, mincount - 1);
565 SvCUR(last_str) *= mincount;
566 /* Add additional parts. */
567 SvCUR_set(data->last_found,
568 SvCUR(data->last_found) - l);
569 sv_catsv(data->last_found, last_str);
570 data->last_end += l * (mincount - 1);
574 /* It is counted once already... */
575 data->pos_min += minnext * (mincount - counted);
576 data->pos_delta += - counted * deltanext +
577 (minnext + deltanext) * maxcount - minnext * mincount;
578 if (mincount != maxcount) {
580 if (mincount && last_str) {
581 sv_setsv(data->last_found, last_str);
582 data->last_end = data->pos_min;
583 data->last_start_min =
584 data->pos_min - SvCUR(last_str);
585 data->last_start_max = is_inf
587 : data->pos_min + data->pos_delta
590 data->longest = &(data->longest_float);
593 if (data && (fl & SF_HAS_EVAL))
594 data->flags |= SF_HAS_EVAL;
597 if (OP(oscan) != CURLYX) {
598 while (regkind[(U8)OP(next = regnext(oscan))] == NOTHING
600 NEXT_OFF(oscan) += NEXT_OFF(next);
604 default: /* REF only? */
605 if (flags & SCF_DO_SUBSTR) {
607 data->longest = &(data->longest_float);
612 } else if (strchr(simple,OP(scan))) {
613 if (flags & SCF_DO_SUBSTR) {
618 } else if (regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
619 data->flags |= (OP(scan) == MEOL
622 } else if (regkind[(U8)OP(scan)] == BRANCHJ
623 && (scan->flags || data)
624 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
625 I32 deltanext, minnext;
629 next = regnext(scan);
630 nscan = NEXTOPER(NEXTOPER(scan));
631 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, 0);
634 FAIL("variable length lookbehind not implemented");
635 } else if (minnext > U8_MAX) {
636 FAIL2("lookbehind longer than %d not implemented", U8_MAX);
638 scan->flags = minnext;
640 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
642 if (data && (data_fake.flags & SF_HAS_EVAL))
643 data->flags |= SF_HAS_EVAL;
644 } else if (OP(scan) == OPEN) {
646 } else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
647 #ifdef REGALIGN_STRUCT
648 next = regnext(scan);
650 if ( next && (OP(next) != WHILEM) && next < last)
652 is_par = 0; /* Disable optimization */
653 } else if (OP(scan) == EVAL) {
655 data->flags |= SF_HAS_EVAL;
657 /* Else: zero-length, ignore. */
658 scan = regnext(scan);
663 *deltap = is_inf ? I32_MAX : delta;
664 if (flags & SCF_DO_SUBSTR && is_inf)
665 data->pos_delta = I32_MAX - data->pos_min;
668 if (is_par && pars==1 && data) {
669 data->flags |= SF_IN_PAR;
670 data->flags &= ~SF_HAS_PAR;
671 } else if (pars && data) {
672 data->flags |= SF_HAS_PAR;
673 data->flags &= ~SF_IN_PAR;
679 add_data(I32 n, char *s)
683 sizeof(*rx->data) + sizeof(void*) * (rx->data->count + n - 1),
684 char, struct reg_data);
685 Renew(rx->data->what, rx->data->count + n, U8);
686 rx->data->count += n;
688 Newc(1207, rx->data, sizeof(*rx->data) + sizeof(void*) * (n - 1),
689 char, struct reg_data);
690 New(1208, rx->data->what, n, U8);
693 Copy(s, rx->data->what + rx->data->count - n, n, U8);
694 return rx->data->count - n;
698 - pregcomp - compile a regular expression into internal code
700 * We can't allocate space until we know how big the compiled form will be,
701 * but we can't compile it (and thus know how big it is) until we've got a
702 * place to put the code. So we cheat: we compile it twice, once with code
703 * generation turned off and size counting turned on, and once "for real".
704 * This also means that we don't allocate space until we are sure that the
705 * thing really will compile successfully, and we never have to move the
706 * code and thus invalidate pointers into it. (Note that it has to be in
707 * one piece because free() must be able to free it all.) [NB: not true in perl]
709 * Beware that the optimization-preparation code in here knows about some
710 * of the structure of the compiled regexp. [I'll say.]
713 pregcomp(char *exp, char *xend, PMOP *pm)
727 FAIL("NULL regexp argument");
729 regprecomp = savepvn(exp, xend - exp);
730 DEBUG_r(PerlIO_printf(Perl_debug_log, "compiling RE `%*s'\n",
731 xend - exp, regprecomp));
732 regflags = pm->op_pmflags;
736 seen_zerolen = *exp == '^' ? -1 : 0;
739 /* First pass: determine size, legality. */
746 regc((U8)MAGIC, (char*)regcode);
747 if (reg(0, &flags) == NULL) {
748 Safefree(regprecomp);
752 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %d ", regsize));
757 char *s = PerlEnv_getenv("TERMCAP_COLORS");
761 colors[0] = s = savepv(s);
765 FAIL("Not enough TABs in TERMCAP_COLORS");
774 PerlIO_printf(Perl_debug_log, "%s%s%s%s",
775 colors[0],colors[1],colors[2],colors[3]);
779 /* Small enough for pointer-storage convention?
780 If extralen==0, this means that we will not need long jumps. */
781 #ifndef REGALIGN_STRUCT
782 if (regsize >= 0x10000L && extralen)
783 FAIL("regexp too big");
785 if (regsize >= 0x10000L && extralen)
791 /* Allocate space and initialize. */
792 Newc(1001, r, sizeof(regexp) + (unsigned)regsize * sizeof(regnode),
795 FAIL("regexp out of space");
797 r->prelen = xend - exp;
798 r->precomp = regprecomp;
799 r->subbeg = r->subbase = NULL;
802 /* Second pass: emit code. */
807 regcode = r->program;
808 regc((U8)MAGIC, (char*) regcode++);
810 if (reg(0, &flags) == NULL)
813 /* Dig out information for optimizations. */
814 pm->op_pmflags = regflags;
816 r->regstclass = NULL;
817 r->naughty = regnaughty >= 10; /* Probably an expensive pattern. */
818 scan = r->program + 1; /* First BRANCH. */
820 /* XXXX To minimize changes to RE engine we always allocate
821 3-units-long substrs field. */
822 Newz(1004, r->substrs, 1, struct reg_substr_data);
824 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
827 STRLEN longest_float_length, longest_fixed_length;
829 StructCopy(&zero_scan_data, &data, scan_data_t);
831 /* Skip introductions and multiplicators >= 1. */
832 while ((OP(first) == OPEN && (sawopen = 1)) ||
833 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
834 (OP(first) == PLUS) ||
835 (OP(first) == MINMOD) ||
836 (regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
837 if (OP(first) == PLUS)
840 first += regarglen[(U8)OP(first)];
841 first = NEXTOPER(first);
844 /* Starting-point info. */
846 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
847 else if (strchr(simple+2,OP(first)))
848 r->regstclass = first;
849 else if (regkind[(U8)OP(first)] == BOUND ||
850 regkind[(U8)OP(first)] == NBOUND)
851 r->regstclass = first;
852 else if (regkind[(U8)OP(first)] == BOL) {
853 r->reganch |= (OP(first) == MBOL ? ROPT_ANCH_MBOL: ROPT_ANCH_BOL);
854 first = NEXTOPER(first);
857 else if (OP(first) == GPOS) {
858 r->reganch |= ROPT_ANCH_GPOS;
859 first = NEXTOPER(first);
862 else if ((OP(first) == STAR &&
863 regkind[(U8)OP(NEXTOPER(first))] == ANY) &&
864 !(r->reganch & ROPT_ANCH) )
866 /* turn .* into ^.* with an implied $*=1 */
867 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
868 first = NEXTOPER(first);
871 if (sawplus && (!sawopen || !regsawback))
872 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
874 /* Scan is after the zeroth branch, first is atomic matcher. */
875 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
878 * If there's something expensive in the r.e., find the
879 * longest literal string that must appear and make it the
880 * regmust. Resolve ties in favor of later strings, since
881 * the regstart check works with the beginning of the r.e.
882 * and avoiding duplication strengthens checking. Not a
883 * strong reason, but sufficient in the absence of others.
884 * [Now we resolve ties in favor of the earlier string if
885 * it happens that c_offset_min has been invalidated, since the
886 * earlier string may buy us something the later one won't.]
890 data.longest_fixed = newSVpv("",0);
891 data.longest_float = newSVpv("",0);
892 data.last_found = newSVpv("",0);
893 data.longest = &(data.longest_fixed);
896 minlen = study_chunk(&first, &fake, scan + regsize, /* Up to end */
897 &data, SCF_DO_SUBSTR);
898 if ( regnpar == 1 && data.longest == &(data.longest_fixed)
899 && data.last_start_min == 0 && data.last_end > 0
901 && (!(regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
902 r->reganch |= ROPT_CHECK_ALL;
904 SvREFCNT_dec(data.last_found);
906 longest_float_length = SvCUR(data.longest_float);
907 if (longest_float_length
908 || (data.flags & SF_FL_BEFORE_EOL
909 && (!(data.flags & SF_FL_BEFORE_MEOL)
910 || (regflags & PMf_MULTILINE)))) {
911 if (SvCUR(data.longest_fixed)
912 && data.offset_fixed == data.offset_float_min)
913 goto remove; /* Like in (a)+. */
915 r->float_substr = data.longest_float;
916 r->float_min_offset = data.offset_float_min;
917 r->float_max_offset = data.offset_float_max;
918 fbm_compile(r->float_substr, 0);
919 BmUSEFUL(r->float_substr) = 100;
920 if (data.flags & SF_FL_BEFORE_EOL /* Cannot have SEOL and MULTI */
921 && (!(data.flags & SF_FL_BEFORE_MEOL)
922 || (regflags & PMf_MULTILINE)))
923 SvTAIL_on(r->float_substr);
926 r->float_substr = Nullsv;
927 SvREFCNT_dec(data.longest_float);
928 longest_float_length = 0;
931 longest_fixed_length = SvCUR(data.longest_fixed);
932 if (longest_fixed_length
933 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
934 && (!(data.flags & SF_FIX_BEFORE_MEOL)
935 || (regflags & PMf_MULTILINE)))) {
936 r->anchored_substr = data.longest_fixed;
937 r->anchored_offset = data.offset_fixed;
938 fbm_compile(r->anchored_substr, 0);
939 BmUSEFUL(r->anchored_substr) = 100;
940 if (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
941 && (!(data.flags & SF_FIX_BEFORE_MEOL)
942 || (regflags & PMf_MULTILINE)))
943 SvTAIL_on(r->anchored_substr);
945 r->anchored_substr = Nullsv;
946 SvREFCNT_dec(data.longest_fixed);
947 longest_fixed_length = 0;
950 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
951 if (longest_fixed_length > longest_float_length) {
952 r->check_substr = r->anchored_substr;
953 r->check_offset_min = r->check_offset_max = r->anchored_offset;
954 if (r->reganch & ROPT_ANCH_SINGLE)
955 r->reganch |= ROPT_NOSCAN;
957 r->check_substr = r->float_substr;
958 r->check_offset_min = data.offset_float_min;
959 r->check_offset_max = data.offset_float_max;
962 /* Several toplevels. Best we can is to set minlen. */
965 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
966 scan = r->program + 1;
967 minlen = study_chunk(&scan, &fake, scan + regsize, NULL, 0);
968 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
971 r->nparens = regnpar - 1;
973 if (regseen & REG_SEEN_GPOS)
974 r->reganch |= ROPT_GPOS_SEEN;
975 if (regseen & REG_SEEN_LOOKBEHIND)
976 r->reganch |= ROPT_LOOKBEHIND_SEEN;
977 Newz(1002, r->startp, regnpar, char*);
978 Newz(1002, r->endp, regnpar, char*);
984 - reg - regular expression, i.e. main body or parenthesized thing
986 * Caller must absorb opening parenthesis.
988 * Combining parenthesis handling with the base level of regular expression
989 * is a trifle forced, but the need to tie the tails of the branches to what
990 * follows makes it hard to avoid.
993 reg(I32 paren, I32 *flagp)
994 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
996 register regnode *ret; /* Will be the head of the group. */
997 register regnode *br;
998 register regnode *lastbr;
999 register regnode *ender = 0;
1000 register I32 parno = 0;
1001 I32 flags, oregflags = regflags, have_branch = 0, open = 0;
1004 *flagp = HASWIDTH; /* Tentatively. */
1006 /* Make an OPEN node, if parenthesized. */
1008 if (*regparse == '?') {
1010 paren = *regparse++;
1011 ret = NULL; /* For look-ahead/behind. */
1014 #ifndef REGALIGN_STRUCT
1015 FAIL("lookbehind non-implemented without REGALIGN_STRUCT");
1017 regseen |= REG_SEEN_LOOKBEHIND;
1018 if (*regparse == '!')
1020 if (*regparse != '=' && *regparse != '!')
1031 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1034 while (*regparse && *regparse != ')')
1036 if (*regparse != ')')
1037 FAIL("Sequence (?#... not terminated");
1044 I32 count = 1, n = 0;
1048 OP_4tree *sop, *rop;
1051 while (count && (c = *regparse)) {
1052 if (c == '\\' && regparse[1])
1060 if (*regparse != ')')
1061 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1065 if (regparse - 1 - s)
1066 sv = newSVpv(s, regparse - 1 - s);
1068 sv = newSVpv("", 0);
1070 rop = sv_compile_2op(sv, &sop, "re", &av);
1072 n = add_data(3, "nso");
1073 rx->data->data[n] = (void*)rop;
1074 rx->data->data[n+1] = (void*)av;
1075 rx->data->data[n+2] = (void*)sop;
1077 } else { /* First pass */
1079 FAIL("Eval-group in insecure regular expression");
1083 return reganode(EVAL, n);
1087 if (regparse[0] == '?') {
1088 if (regparse[1] == '=' || regparse[1] == '!'
1089 || regparse[1] == '<'
1090 || regparse[1] == '{') { /* Lookahead or eval. */
1093 ret = reg_node(LOGICAL);
1094 regtail(ret, reg(1, &flag));
1097 } else if (regparse[0] >= '1' && regparse[0] <= '9' ) {
1098 parno = atoi(regparse++);
1100 while (isDIGIT(*regparse))
1102 ret = reganode(GROUPP, parno);
1103 if ((c = *nextchar()) != ')')
1104 FAIL2("Switch (?(number%c not recognized", c);
1106 regtail(ret, reganode(IFTHEN, 0));
1107 br = regbranch(&flags, 1);
1109 br = reganode(LONGJMP, 0);
1111 regtail(br, reganode(LONGJMP, 0));
1114 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1115 regbranch(&flags, 1);
1116 regtail(ret, lastbr);
1121 FAIL("Switch (?(condition)... contains too many branches");
1122 ender = reg_node(TAIL);
1125 regtail(lastbr, ender);
1126 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1128 regtail(ret, ender);
1131 FAIL2("Unknown condition for (?(%.2s", regparse);
1135 FAIL("Sequence (? incomplete");
1139 while (*regparse && strchr("iogcmsx", *regparse))
1140 pmflag(®flags, *regparse++);
1142 if (*regparse != ')')
1143 FAIL2("Sequence (?%c...) not recognized", *regparse);
1152 ret = reganode(OPEN, parno);
1158 /* Pick up the branches, linking them together. */
1159 br = regbranch(&flags, 1);
1162 if (*regparse == '|') {
1163 if (!SIZE_ONLY && extralen) {
1164 reginsert(BRANCHJ, br);
1166 reginsert(BRANCH, br);
1169 extralen += 1; /* For BRANCHJ-BRANCH. */
1170 } else if (paren == ':') {
1171 *flagp |= flags&SIMPLE;
1173 if (open) { /* Starts with OPEN. */
1174 regtail(ret, br); /* OPEN -> first. */
1175 } else if (paren != '?') /* Not Conditional */
1177 if (!(flags&HASWIDTH))
1178 *flagp &= ~HASWIDTH;
1179 *flagp |= flags&SPSTART;
1181 while (*regparse == '|') {
1182 if (!SIZE_ONLY && extralen) {
1183 ender = reganode(LONGJMP,0);
1184 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1187 extralen += 2; /* Account for LONGJMP. */
1189 br = regbranch(&flags, 0);
1192 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1194 if (!(flags&HASWIDTH))
1195 *flagp &= ~HASWIDTH;
1196 *flagp |= flags&SPSTART;
1199 if (have_branch || paren != ':') {
1200 /* Make a closing node, and hook it on the end. */
1203 ender = reg_node(TAIL);
1206 ender = reganode(CLOSE, parno);
1213 ender = reg_node(SUCCEED);
1214 *flagp &= ~HASWIDTH;
1217 ender = reg_node(END);
1220 regtail(lastbr, ender);
1223 /* Hook the tails of the branches to the closing node. */
1224 for (br = ret; br != NULL; br = regnext(br)) {
1225 regoptail(br, ender);
1232 static char parens[] = "=!<,>";
1234 if (paren && (p = strchr(parens, paren))) {
1235 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1236 int flag = (p - parens) > 1;
1239 node = SUSPEND, flag = 0;
1240 reginsert(node,ret);
1241 #ifdef REGALIGN_STRUCT
1244 regtail(ret, reg_node(TAIL));
1248 /* Check for proper termination. */
1249 if (paren && (regparse >= regxend || *nextchar() != ')')) {
1250 FAIL("unmatched () in regexp");
1251 } else if (!paren && regparse < regxend) {
1252 if (*regparse == ')') {
1253 FAIL("unmatched () in regexp");
1255 FAIL("junk on end of regexp"); /* "Can't happen". */
1259 regflags = oregflags;
1266 - regbranch - one alternative of an | operator
1268 * Implements the concatenation operator.
1271 regbranch(I32 *flagp, I32 first)
1273 register regnode *ret;
1274 register regnode *chain = NULL;
1275 register regnode *latest;
1276 I32 flags = 0, c = 0;
1281 if (!SIZE_ONLY && extralen)
1282 ret = reganode(BRANCHJ,0);
1284 ret = reg_node(BRANCH);
1287 if (!first && SIZE_ONLY)
1288 extralen += 1; /* BRANCHJ */
1290 *flagp = WORST; /* Tentatively. */
1294 while (regparse < regxend && *regparse != '|' && *regparse != ')') {
1296 latest = regpiece(&flags);
1297 if (latest == NULL) {
1298 if (flags & TRYAGAIN)
1301 } else if (ret == NULL)
1303 *flagp |= flags&HASWIDTH;
1304 if (chain == NULL) /* First piece. */
1305 *flagp |= flags&SPSTART;
1308 regtail(chain, latest);
1313 if (chain == NULL) { /* Loop ran zero times. */
1314 chain = reg_node(NOTHING);
1319 *flagp |= flags&SIMPLE;
1326 - regpiece - something followed by possible [*+?]
1328 * Note that the branching code sequences used for ? and the general cases
1329 * of * and + are somewhat optimized: they use the same NOTHING node as
1330 * both the endmarker for their branch list and the body of the last branch.
1331 * It might seem that this node could be dispensed with entirely, but the
1332 * endmarker role is not redundant.
1335 regpiece(I32 *flagp)
1337 register regnode *ret;
1339 register char *next;
1341 char *origparse = regparse;
1344 I32 max = REG_INFTY;
1346 ret = regatom(&flags);
1348 if (flags & TRYAGAIN)
1355 if (op == '{' && regcurly(regparse)) {
1356 next = regparse + 1;
1358 while (isDIGIT(*next) || *next == ',') {
1367 if (*next == '}') { /* got one */
1371 min = atoi(regparse);
1377 if (!max && *maxpos != '0')
1378 max = REG_INFTY; /* meaning "infinity" */
1379 else if (max >= REG_INFTY)
1380 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
1385 if ((flags&SIMPLE)) {
1386 regnaughty += 2 + regnaughty / 2;
1387 reginsert(CURLY, ret);
1390 regnaughty += 4 + regnaughty; /* compound interest */
1391 regtail(ret, reg_node(WHILEM));
1392 if (!SIZE_ONLY && extralen) {
1393 reginsert(LONGJMP,ret);
1394 reginsert(NOTHING,ret);
1395 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1397 reginsert(CURLYX,ret);
1398 if (!SIZE_ONLY && extralen)
1399 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1400 regtail(ret, reg_node(NOTHING));
1404 #ifdef REGALIGN_STRUCT
1409 *flagp = (WORST|HASWIDTH);
1410 if (max && max < min)
1411 FAIL("Can't do {n,m} with n > m");
1426 #if 0 /* Now runtime fix should be reliable. */
1427 if (!(flags&HASWIDTH) && op != '?')
1428 FAIL("regexp *+ operand could be empty");
1433 *flagp = (op != '+') ? (WORST|SPSTART) : (WORST|HASWIDTH);
1435 if (op == '*' && (flags&SIMPLE)) {
1436 reginsert(STAR, ret);
1437 #ifdef REGALIGN_STRUCT
1442 else if (op == '*') {
1445 } else if (op == '+' && (flags&SIMPLE)) {
1446 reginsert(PLUS, ret);
1447 #ifdef REGALIGN_STRUCT
1452 else if (op == '+') {
1455 } else if (op == '?') {
1460 if (dowarn && !SIZE_ONLY && !(flags&HASWIDTH) && max > 10000) {
1461 warn("%.*s matches null string many times",
1462 regparse - origparse, origparse);
1465 if (*regparse == '?') {
1467 reginsert(MINMOD, ret);
1469 regtail(ret, ret + NODE_STEP_REGNODE);
1471 regtail(ret, ret + 3);
1474 if (ISMULT2(regparse))
1475 FAIL("nested *?+ in regexp");
1481 - regatom - the lowest level
1483 * Optimization: gobbles an entire sequence of ordinary characters so that
1484 * it can turn them into a single node, which is smaller to store and
1485 * faster to run. Backslashed characters are exceptions, each becoming a
1486 * separate node; the code is simpler that way and it's not worth fixing.
1488 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1493 register regnode *ret = 0;
1496 *flagp = WORST; /* Tentatively. */
1499 switch (*regparse) {
1503 if (regflags & PMf_MULTILINE)
1504 ret = reg_node(MBOL);
1505 else if (regflags & PMf_SINGLELINE)
1506 ret = reg_node(SBOL);
1508 ret = reg_node(BOL);
1514 if (regflags & PMf_MULTILINE)
1515 ret = reg_node(MEOL);
1516 else if (regflags & PMf_SINGLELINE)
1517 ret = reg_node(SEOL);
1519 ret = reg_node(EOL);
1523 if (regflags & PMf_SINGLELINE)
1524 ret = reg_node(SANY);
1526 ret = reg_node(ANY);
1528 *flagp |= HASWIDTH|SIMPLE;
1533 *flagp |= HASWIDTH|SIMPLE;
1537 ret = reg(1, &flags);
1539 if (flags & TRYAGAIN)
1543 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
1547 if (flags & TRYAGAIN) {
1551 FAIL2("internal urp in regexp at /%s/", regparse);
1552 /* Supposed to be caught earlier. */
1555 if (!regcurly(regparse)) {
1563 FAIL("?+*{} follows nothing in regexp");
1566 switch (*++regparse) {
1569 ret = reg_node(SBOL);
1574 ret = reg_node(GPOS);
1575 regseen |= REG_SEEN_GPOS;
1580 ret = reg_node(SEOL);
1585 ret = reg_node((regflags & PMf_LOCALE) ? ALNUML : ALNUM);
1586 *flagp |= HASWIDTH|SIMPLE;
1590 ret = reg_node((regflags & PMf_LOCALE) ? NALNUML : NALNUM);
1591 *flagp |= HASWIDTH|SIMPLE;
1596 ret = reg_node((regflags & PMf_LOCALE) ? BOUNDL : BOUND);
1602 ret = reg_node((regflags & PMf_LOCALE) ? NBOUNDL : NBOUND);
1607 ret = reg_node((regflags & PMf_LOCALE) ? SPACEL : SPACE);
1608 *flagp |= HASWIDTH|SIMPLE;
1612 ret = reg_node((regflags & PMf_LOCALE) ? NSPACEL : NSPACE);
1613 *flagp |= HASWIDTH|SIMPLE;
1617 ret = reg_node(DIGIT);
1618 *flagp |= HASWIDTH|SIMPLE;
1622 ret = reg_node(NDIGIT);
1623 *flagp |= HASWIDTH|SIMPLE;
1636 case '1': case '2': case '3': case '4':
1637 case '5': case '6': case '7': case '8': case '9':
1639 I32 num = atoi(regparse);
1641 if (num > 9 && num >= regnpar)
1645 ret = reganode((regflags & PMf_FOLD)
1646 ? ((regflags & PMf_LOCALE) ? REFFL : REFF)
1649 while (isDIGIT(*regparse))
1657 if (regparse >= regxend)
1658 FAIL("trailing \\ in regexp");
1666 if (regflags & PMf_EXTENDED) {
1667 while (regparse < regxend && *regparse != '\n') regparse++;
1668 if (regparse < regxend)
1683 ret = reg_node((regflags & PMf_FOLD)
1684 ? ((regflags & PMf_LOCALE) ? EXACTFL : EXACTF)
1686 s = (char *) OPERAND(ret);
1687 regc(0, s++); /* save spot for len */
1688 for (len = 0, p = regparse - 1;
1689 len < 127 && p < regxend;
1694 if (regflags & PMf_EXTENDED)
1695 p = regwhite(p, regxend);
1745 ender = scan_hex(++p, 2, &numlen);
1750 ender = UCHARAT(p++);
1751 ender = toCTRL(ender);
1753 case '0': case '1': case '2': case '3':case '4':
1754 case '5': case '6': case '7': case '8':case '9':
1756 (isDIGIT(p[1]) && atoi(p) >= regnpar) ) {
1757 ender = scan_oct(p, 3, &numlen);
1767 FAIL("trailing \\ in regexp");
1778 if (regflags & PMf_EXTENDED)
1779 p = regwhite(p, regxend);
1780 if (ISMULT2(p)) { /* Back off on ?+*. */
1795 FAIL("internal disaster in regexp");
1801 *OPERAND(ret) = len;
1804 #ifdef REGALIGN_STRUCT
1805 regsize += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1808 regcode += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1818 regwhite(char *p, char *e)
1823 else if (*p == '#') {
1826 } while (p < e && *p != '\n');
1835 regset(char *opnd, register I32 c)
1840 opnd[1 + (c >> 3)] |= (1 << (c & 7));
1846 register char *opnd, *s;
1848 register I32 lastclass = 1234;
1849 register I32 range = 0;
1850 register regnode *ret;
1854 s = opnd = (char *) OPERAND(regcode);
1855 ret = reg_node(ANYOF);
1856 for (Class = 0; Class < 33; Class++)
1858 if (*regparse == '^') { /* Complement of range. */
1862 *opnd |= ANYOF_INVERT;
1865 regcode += ANY_SKIP;
1866 if (regflags & PMf_FOLD)
1867 *opnd |= ANYOF_FOLD;
1868 if (regflags & PMf_LOCALE)
1869 *opnd |= ANYOF_LOCALE;
1871 regsize += ANY_SKIP;
1873 if (*regparse == ']' || *regparse == '-')
1874 goto skipcond; /* allow 1st char to be ] or - */
1875 while (regparse < regxend && *regparse != ']') {
1877 Class = UCHARAT(regparse++);
1878 if (Class == '[' && regparse + 1 < regxend &&
1879 /* I smell either [: or [= or [. -- POSIX has been here, right? */
1880 (*regparse == ':' || *regparse == '=' || *regparse == '.')) {
1881 char posixccc = *regparse;
1882 char* posixccs = regparse++;
1884 while (regparse < regxend && *regparse != posixccc)
1886 if (regparse == regxend)
1887 /* Grandfather lone [:, [=, [. */
1888 regparse = posixccs;
1890 regparse++; /* skip over the posixccc */
1891 if (*regparse == ']') {
1892 /* Not Implemented Yet.
1893 * (POSIX Extended Character Classes, that is)
1894 * The text between e.g. [: and :] would start
1895 * at posixccs + 1 and stop at regparse - 2. */
1896 if (dowarn && !SIZE_ONLY)
1897 warn("Character class syntax [%c %c] is reserved for future extensions", posixccc, posixccc);
1898 regparse++; /* skip over the ending ] */
1902 if (Class == '\\') {
1903 Class = UCHARAT(regparse++);
1906 if (regflags & PMf_LOCALE) {
1908 *opnd |= ANYOF_ALNUML;
1911 for (Class = 0; Class < 256; Class++)
1913 regset(opnd, Class);
1918 if (regflags & PMf_LOCALE) {
1920 *opnd |= ANYOF_NALNUML;
1923 for (Class = 0; Class < 256; Class++)
1924 if (!isALNUM(Class))
1925 regset(opnd, Class);
1930 if (regflags & PMf_LOCALE) {
1932 *opnd |= ANYOF_SPACEL;
1935 for (Class = 0; Class < 256; Class++)
1937 regset(opnd, Class);
1942 if (regflags & PMf_LOCALE) {
1944 *opnd |= ANYOF_NSPACEL;
1947 for (Class = 0; Class < 256; Class++)
1948 if (!isSPACE(Class))
1949 regset(opnd, Class);
1954 for (Class = '0'; Class <= '9'; Class++)
1955 regset(opnd, Class);
1959 for (Class = 0; Class < '0'; Class++)
1960 regset(opnd, Class);
1961 for (Class = '9' + 1; Class < 256; Class++)
1962 regset(opnd, Class);
1987 Class = scan_hex(regparse, 2, &numlen);
1991 Class = UCHARAT(regparse++);
1992 Class = toCTRL(Class);
1994 case '0': case '1': case '2': case '3': case '4':
1995 case '5': case '6': case '7': case '8': case '9':
1996 Class = scan_oct(--regparse, 3, &numlen);
2002 if (lastclass > Class)
2003 FAIL("invalid [] range in regexp");
2008 if (*regparse == '-' && regparse+1 < regxend &&
2009 regparse[1] != ']') {
2012 continue; /* do it next time */
2015 for ( ; lastclass <= Class; lastclass++)
2016 regset(opnd, lastclass);
2019 if (*regparse != ']')
2020 FAIL("unmatched [] in regexp");
2028 char* retval = regparse++;
2031 if (*regparse == '(' && regparse[1] == '?' &&
2032 regparse[2] == '#') {
2033 while (*regparse && *regparse != ')')
2038 if (regflags & PMf_EXTENDED) {
2039 if (isSPACE(*regparse)) {
2043 else if (*regparse == '#') {
2044 while (*regparse && *regparse != '\n')
2055 - reg_node - emit a node
2057 static regnode * /* Location. */
2060 register regnode *ret;
2061 register regnode *ptr;
2065 SIZE_ALIGN(regsize);
2066 #ifdef REGALIGN_STRUCT
2074 NODE_ALIGN_FILL(ret);
2076 FILL_ADVANCE_NODE(ptr, op);
2083 - reganode - emit a node with an argument
2085 static regnode * /* Location. */
2086 reganode(U8 op, U32 arg)
2088 register regnode *ret;
2089 register regnode *ptr;
2093 SIZE_ALIGN(regsize);
2102 NODE_ALIGN_FILL(ret);
2104 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
2111 - regc - emit (if appropriate) a byte of code
2121 - reginsert - insert an operator in front of already-emitted operand
2123 * Means relocating the operand.
2126 reginsert(U8 op, regnode *opnd)
2128 register regnode *src;
2129 register regnode *dst;
2130 register regnode *place;
2131 register int offset = regarglen[(U8)op];
2133 /* (regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
2136 regsize += NODE_STEP_REGNODE + offset;
2141 regcode += NODE_STEP_REGNODE + offset;
2144 StructCopy(--src, --dst, regnode);
2146 place = opnd; /* Op node, where operand used to be. */
2147 src = NEXTOPER(place);
2148 FILL_ADVANCE_NODE(place, op);
2149 Zero(src, offset, regnode);
2150 #if defined(REGALIGN) && !defined(REGALIGN_STRUCT)
2151 src[offset + 1] = '\177';
2156 - regtail - set the next-pointer at the end of a node chain of p to val.
2159 regtail(regnode *p, regnode *val)
2161 register regnode *scan;
2162 register regnode *temp;
2163 register I32 offset;
2168 /* Find last node. */
2171 temp = regnext(scan);
2178 # ifdef REGALIGN_STRUCT
2179 if (reg_off_by_arg[OP(scan)]) {
2180 ARG_SET(scan, val - scan);
2182 NEXT_OFF(scan) = val - scan;
2185 offset = val - scan;
2187 *(short*)(scan+1) = offset;
2191 if (OP(scan) == BACK)
2192 offset = scan - val;
2194 offset = val - scan;
2195 *(scan+1) = (offset>>8)&0377;
2196 *(scan+2) = offset&0377;
2201 - regoptail - regtail on operand of first argument; nop if operandless
2204 regoptail(regnode *p, regnode *val)
2206 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
2207 if (p == NULL || SIZE_ONLY)
2209 if (regkind[(U8)OP(p)] == BRANCH) {
2210 regtail(NEXTOPER(p), val);
2211 } else if ( regkind[(U8)OP(p)] == BRANCHJ) {
2212 regtail(NEXTOPER(NEXTOPER(p)), val);
2218 - regcurly - a little FSA that accepts {\d+,?\d*}
2221 regcurly(register char *s)
2241 dumpuntil(regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
2243 register char op = EXACT; /* Arbitrary non-END op. */
2244 register regnode *next, *onode;
2246 while (op != END && (!last || node < last)) {
2247 /* While that wasn't END last time... */
2253 next = regnext(node);
2255 if (OP(node) == OPTIMIZED)
2258 PerlIO_printf(Perl_debug_log, "%4d%*s%s", node - start,
2259 2*l + 1, "", SvPVX(sv));
2260 if (next == NULL) /* Next ptr. */
2261 PerlIO_printf(Perl_debug_log, "(0)");
2263 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
2264 (void)PerlIO_putc(Perl_debug_log, '\n');
2266 if (regkind[(U8)op] == BRANCHJ) {
2267 register regnode *nnode = (OP(next) == LONGJMP
2270 if (last && nnode > last)
2272 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
2273 } else if (regkind[(U8)op] == BRANCH) {
2274 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
2275 } else if ( op == CURLY) { /* `next' might be very big: optimizer */
2276 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2277 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
2278 } else if (regkind[(U8)op] == CURLY && op != CURLYX) {
2279 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2281 } else if ( op == PLUS || op == STAR) {
2282 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
2283 } else if (op == ANYOF) {
2284 node = NEXTOPER(node);
2286 } else if (regkind[(U8)op] == EXACT) {
2287 /* Literal string, where present. */
2288 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2289 node = NEXTOPER(node);
2291 node = NEXTOPER(node);
2292 node += regarglen[(U8)op];
2294 if (op == CURLYX || op == OPEN)
2296 else if (op == WHILEM)
2303 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
2308 SV *sv = sv_newmortal();
2310 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
2312 /* Header fields of interest. */
2313 if (r->anchored_substr)
2314 PerlIO_printf(Perl_debug_log, "anchored `%s%s%s'%s at %d ",
2316 SvPVX(r->anchored_substr),
2318 SvTAIL(r->anchored_substr) ? "$" : "",
2319 r->anchored_offset);
2320 if (r->float_substr)
2321 PerlIO_printf(Perl_debug_log, "floating `%s%s%s'%s at %d..%u ",
2323 SvPVX(r->float_substr),
2325 SvTAIL(r->float_substr) ? "$" : "",
2326 r->float_min_offset, r->float_max_offset);
2327 if (r->check_substr)
2328 PerlIO_printf(Perl_debug_log,
2329 r->check_substr == r->float_substr
2330 ? "(checking floating" : "(checking anchored");
2331 if (r->reganch & ROPT_NOSCAN)
2332 PerlIO_printf(Perl_debug_log, " noscan");
2333 if (r->reganch & ROPT_CHECK_ALL)
2334 PerlIO_printf(Perl_debug_log, " isall");
2335 if (r->check_substr)
2336 PerlIO_printf(Perl_debug_log, ") ");
2338 if (r->regstclass) {
2339 regprop(sv, r->regstclass);
2340 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
2342 if (r->reganch & ROPT_ANCH) {
2343 PerlIO_printf(Perl_debug_log, "anchored");
2344 if (r->reganch & ROPT_ANCH_BOL)
2345 PerlIO_printf(Perl_debug_log, "(BOL)");
2346 if (r->reganch & ROPT_ANCH_MBOL)
2347 PerlIO_printf(Perl_debug_log, "(MBOL)");
2348 if (r->reganch & ROPT_ANCH_GPOS)
2349 PerlIO_printf(Perl_debug_log, "(GPOS)");
2350 PerlIO_putc(Perl_debug_log, ' ');
2352 if (r->reganch & ROPT_GPOS_SEEN)
2353 PerlIO_printf(Perl_debug_log, "GPOS ");
2354 if (r->reganch & ROPT_SKIP)
2355 PerlIO_printf(Perl_debug_log, "plus ");
2356 if (r->reganch & ROPT_IMPLICIT)
2357 PerlIO_printf(Perl_debug_log, "implicit ");
2358 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
2359 PerlIO_printf(Perl_debug_log, "\n");
2363 - regprop - printable representation of opcode
2366 regprop(SV *sv, regnode *o)
2368 register char *p = 0;
2403 sv_catpvf(sv, "EXACT <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2406 sv_catpvf(sv, "EXACTF <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2409 sv_catpvf(sv, "EXACTFL <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2436 sv_catpvf(sv, "CURLY {%d,%d}", ARG1(o), ARG2(o));
2439 #ifdef REGALIGN_STRUCT
2440 sv_catpvf(sv, "CURLYM[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2442 sv_catpvf(sv, "CURLYM {%d,%d}", ARG1(o), ARG2(o));
2446 #ifdef REGALIGN_STRUCT
2447 sv_catpvf(sv, "CURLYN[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2449 sv_catpvf(sv, "CURLYN {%d,%d}", ARG1(o), ARG2(o));
2453 sv_catpvf(sv, "CURLYX {%d,%d}", ARG1(o), ARG2(o));
2456 sv_catpvf(sv, "REF%d", ARG(o));
2459 sv_catpvf(sv, "REFF%d", ARG(o));
2462 sv_catpvf(sv, "REFFL%d", ARG(o));
2465 sv_catpvf(sv, "OPEN%d", ARG(o));
2468 sv_catpvf(sv, "CLOSE%d", ARG(o));
2484 #ifdef REGALIGN_STRUCT
2485 sv_catpvf(sv, "UNLESSM[-%d]", o->flags);
2491 #ifdef REGALIGN_STRUCT
2492 sv_catpvf(sv, "IFMATCH[-%d]", o->flags);
2546 sv_catpvf(sv, "GROUPP%d", ARG(o));
2561 FAIL("corrupted regexp opcode");
2566 #endif /* DEBUGGING */
2569 pregfree(struct regexp *r)
2571 if (!r || (--r->refcnt > 0))
2574 Safefree(r->precomp);
2576 Safefree(r->subbase);
2578 Safefree(r->substrs);
2579 if (r->anchored_substr)
2580 SvREFCNT_dec(r->anchored_substr);
2581 if (r->float_substr)
2582 SvREFCNT_dec(r->float_substr);
2584 int n = r->data->count;
2586 switch (r->data->what[n]) {
2588 SvREFCNT_dec((SV*)r->data->data[n]);
2591 op_free((OP_4tree*)r->data->data[n]);
2596 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
2599 Safefree(r->data->what);
2602 Safefree(r->startp);
2608 - regnext - dig the "next" pointer out of a node
2610 * [Note, when REGALIGN is defined there are two places in regmatch()
2611 * that bypass this code for speed.]
2614 regnext(register regnode *p)
2616 register I32 offset;
2621 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
2637 re_croak2(const char* pat1,const char* pat2,...)
2641 re_croak2(const char* pat1,const char* pat2, va_alist)
2648 STRLEN l1 = strlen(pat1);
2649 STRLEN l2 = strlen(pat2);
2657 Copy(pat1, buf, l1 , char);
2658 Copy(pat2, buf + l1, l2 , char);
2659 buf[l1 + l2 + 1] = '\n';
2660 buf[l1 + l2 + 2] = '\0';
2662 va_start(args, pat2);
2666 message = mess(buf, &args);
2668 l1 = strlen(message);
2671 Copy(message, buf, l1 , char);
2672 buf[l1] = '\0'; /* Overwrite \n */