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 regtail _((regnode *, regnode *));
131 static char* regwhite _((char *, char *));
132 static char* nextchar _((void));
133 static void re_croak2 _((const char* pat1,const char* pat2,...)) __attribute__((noreturn));
136 static I32 seen_zerolen;
144 /* Length of a variant. */
152 I32 last_end; /* min value, <0 unless valid. */
155 SV **longest; /* Either &l_fixed, or &l_float. */
159 I32 offset_float_min;
160 I32 offset_float_max;
164 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
166 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
167 #define SF_BEFORE_SEOL 0x1
168 #define SF_BEFORE_MEOL 0x2
169 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
170 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
173 # define SF_FIX_SHIFT_EOL (0+2)
174 # define SF_FL_SHIFT_EOL (0+4)
176 # define SF_FIX_SHIFT_EOL (+2)
177 # define SF_FL_SHIFT_EOL (+4)
180 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
181 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
183 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
184 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
185 #define SF_IS_INF 0x40
186 #define SF_HAS_PAR 0x80
187 #define SF_IN_PAR 0x100
188 #define SF_HAS_EVAL 0x200
189 #define SCF_DO_SUBSTR 0x400
192 scan_commit(scan_data_t *data)
194 STRLEN l = SvCUR(data->last_found);
195 STRLEN old_l = SvCUR(*data->longest);
197 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
198 sv_setsv(*data->longest, data->last_found);
199 if (*data->longest == data->longest_fixed) {
200 data->offset_fixed = l ? data->last_start_min : data->pos_min;
201 if (data->flags & SF_BEFORE_EOL)
203 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
205 data->flags &= ~SF_FIX_BEFORE_EOL;
207 data->offset_float_min = l ? data->last_start_min : data->pos_min;
208 data->offset_float_max = (l
209 ? data->last_start_max
210 : data->pos_min + data->pos_delta);
211 if (data->flags & SF_BEFORE_EOL)
213 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
215 data->flags &= ~SF_FL_BEFORE_EOL;
218 SvCUR_set(data->last_found, 0);
220 data->flags &= ~SF_BEFORE_EOL;
223 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
224 to the position after last scanned or to NULL. */
227 study_chunk(regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
228 /* scanp: Start here (read-write). */
229 /* deltap: Write maxlen-minlen here. */
230 /* last: Stop before this one. */
232 I32 min = 0, pars = 0, code;
233 regnode *scan = *scanp, *next;
235 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
236 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
237 scan_data_t data_fake;
239 while (scan && OP(scan) != END && scan < last) {
240 /* Peephole optimizer: */
242 if (regkind[(U8)OP(scan)] == EXACT) {
243 regnode *n = regnext(scan);
246 regnode *stop = scan;
249 next = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
250 /* Skip NOTHING, merge EXACT*. */
252 ( regkind[(U8)OP(n)] == NOTHING ||
253 (stringok && (OP(n) == OP(scan))))
255 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
256 if (OP(n) == TAIL || n > next)
258 if (regkind[(U8)OP(n)] == NOTHING) {
259 NEXT_OFF(scan) += NEXT_OFF(n);
260 next = n + NODE_STEP_REGNODE;
267 int oldl = *OPERAND(scan);
268 regnode *nnext = regnext(n);
270 if (oldl + *OPERAND(n) > U8_MAX)
272 NEXT_OFF(scan) += NEXT_OFF(n);
273 *OPERAND(scan) += *OPERAND(n);
274 next = n + (*OPERAND(n) + 2 - 1)/sizeof(regnode) + 2;
275 /* Now we can overwrite *n : */
276 Move(OPERAND(n) + 1, OPERAND(scan) + oldl + 1,
277 *OPERAND(n) + 1, char);
287 n = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
289 if (regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
298 if (OP(scan) != CURLYX) {
299 int max = (reg_off_by_arg[OP(scan)] ? I32_MAX : U16_MAX);
300 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
304 /* Skip NOTHING and LONGJMP. */
305 while ((n = regnext(n))
306 && ((regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
307 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
310 if (reg_off_by_arg[OP(scan)])
313 NEXT_OFF(scan) = off;
315 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
316 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
317 next = regnext(scan);
320 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
321 I32 max1 = 0, min1 = I32_MAX, num = 0;
323 if (flags & SCF_DO_SUBSTR)
325 while (OP(scan) == code) {
326 I32 deltanext, minnext;
330 next = regnext(scan);
331 scan = NEXTOPER(scan);
333 scan = NEXTOPER(scan);
334 /* We suppose the run is continuous, last=next...*/
335 minnext = study_chunk(&scan, &deltanext, next,
339 if (max1 < minnext + deltanext)
340 max1 = minnext + deltanext;
341 if (deltanext == I32_MAX)
344 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
346 if (data && (data_fake.flags & SF_HAS_EVAL))
347 data->flags |= SF_HAS_EVAL;
351 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
353 if (flags & SCF_DO_SUBSTR) {
354 data->pos_min += min1;
355 data->pos_delta += max1 - min1;
356 if (max1 != min1 || is_inf)
357 data->longest = &(data->longest_float);
360 delta += max1 - min1;
361 } else if (code == BRANCHJ) /* single branch is optimized. */
362 scan = NEXTOPER(NEXTOPER(scan));
363 else /* single branch is optimized. */
364 scan = NEXTOPER(scan);
366 } else if (OP(scan) == EXACT) {
367 min += *OPERAND(scan);
368 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
369 I32 l = *OPERAND(scan);
371 /* The code below prefers earlier match for fixed
372 offset, later match for variable offset. */
373 if (data->last_end == -1) { /* Update the start info. */
374 data->last_start_min = data->pos_min;
375 data->last_start_max = is_inf
376 ? I32_MAX : data->pos_min + data->pos_delta;
378 sv_catpvn(data->last_found, (char *)(OPERAND(scan)+1), l);
379 data->last_end = data->pos_min + l;
380 data->pos_min += l; /* As in the first entry. */
381 data->flags &= ~SF_BEFORE_EOL;
383 } else if (regkind[(U8)OP(scan)] == EXACT) {
384 if (flags & SCF_DO_SUBSTR)
386 min += *OPERAND(scan);
387 if (data && (flags & SCF_DO_SUBSTR))
388 data->pos_min += *OPERAND(scan);
389 } else if (strchr(varies,OP(scan))) {
390 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
391 regnode *oscan = scan;
393 switch (regkind[(U8)OP(scan)]) {
395 scan = NEXTOPER(scan);
398 if (flags & SCF_DO_SUBSTR) {
399 next = NEXTOPER(scan);
400 if (OP(next) == EXACT) {
402 maxcount = REG_INFTY;
403 next = regnext(scan);
404 scan = NEXTOPER(scan);
408 if (flags & SCF_DO_SUBSTR)
414 scan = regnext(scan);
415 if (flags & SCF_DO_SUBSTR) {
417 data->longest = &(data->longest_float);
419 goto optimize_curly_tail;
421 mincount = ARG1(scan);
422 maxcount = ARG2(scan);
423 next = regnext(scan);
424 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
426 if (flags & SCF_DO_SUBSTR) {
427 if (mincount == 0) scan_commit(data);
428 pos_before = data->pos_min;
432 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
434 data->flags |= SF_IS_INF;
436 /* This will finish on WHILEM, setting scan, or on NULL: */
437 minnext = study_chunk(&scan, &deltanext, last, data,
439 ? (flags & ~SCF_DO_SUBSTR) : flags);
440 if (!scan) /* It was not CURLYX, but CURLY. */
442 if (dowarn && (minnext + deltanext == 0)
443 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR)))
444 warn("Strange *+?{} on zero-length expression");
445 min += minnext * mincount;
446 is_inf |= (maxcount == REG_INFTY && (minnext + deltanext) > 0
447 || deltanext == I32_MAX);
448 delta += (minnext + deltanext) * maxcount - minnext * mincount;
450 /* Try powerful optimization CURLYX => CURLYN. */
451 #ifdef REGALIGN_STRUCT
452 if ( OP(oscan) == CURLYX && data
453 && data->flags & SF_IN_PAR
454 && !(data->flags & SF_HAS_EVAL)
455 && !deltanext && minnext == 1 ) {
456 /* Try to optimize to CURLYN. */
457 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
458 regnode *nxt1 = nxt, *nxt2;
462 if (!strchr(simple,OP(nxt))
463 && !(regkind[(U8)OP(nxt)] == EXACT
464 && *OPERAND(nxt) == 1))
468 if (OP(nxt) != CLOSE)
470 /* Now we know that nxt2 is the only contents: */
471 oscan->flags = ARG(nxt);
473 OP(nxt1) = NOTHING; /* was OPEN. */
475 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
476 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
477 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
478 OP(nxt) = OPTIMIZED; /* was CLOSE. */
479 OP(nxt + 1) = OPTIMIZED; /* was count. */
480 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
486 /* Try optimization CURLYX => CURLYM. */
487 if ( OP(oscan) == CURLYX && data
488 #ifdef REGALIGN_STRUCT
489 && !(data->flags & SF_HAS_PAR)
491 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
493 && !(data->flags & SF_HAS_EVAL)
495 /* XXXX How to optimize if data == 0? */
496 /* Optimize to a simpler form. */
497 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
501 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
502 && (OP(nxt2) != WHILEM))
504 OP(nxt2) = SUCCEED; /* Whas WHILEM */
505 #ifdef REGALIGN_STRUCT
506 /* Need to optimize away parenths. */
507 if (data->flags & SF_IN_PAR) {
508 /* Set the parenth number. */
509 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
511 if (OP(nxt) != CLOSE)
512 FAIL("panic opt close");
513 oscan->flags = ARG(nxt);
514 OP(nxt1) = OPTIMIZED; /* was OPEN. */
515 OP(nxt) = OPTIMIZED; /* was CLOSE. */
517 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
518 OP(nxt + 1) = OPTIMIZED; /* was count. */
519 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
520 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
523 while ( nxt1 && (OP(nxt1) != WHILEM)) {
524 regnode *nnxt = regnext(nxt1);
527 if (reg_off_by_arg[OP(nxt1)])
528 ARG_SET(nxt1, nxt2 - nxt1);
529 else if (nxt2 - nxt1 < U16_MAX)
530 NEXT_OFF(nxt1) = nxt2 - nxt1;
532 OP(nxt) = NOTHING; /* Cannot beautify */
537 /* Optimize again: */
538 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
543 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
545 if (flags & SCF_DO_SUBSTR) {
546 SV *last_str = Nullsv;
547 int counted = mincount != 0;
549 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
550 I32 b = pos_before >= data->last_start_min
551 ? pos_before : data->last_start_min;
553 char *s = SvPV(data->last_found, l);
555 l -= b - data->last_start_min;
556 /* Get the added string: */
557 last_str = newSVpv(s + b - data->last_start_min, l);
558 if (deltanext == 0 && pos_before == b) {
559 /* What was added is a constant string */
561 SvGROW(last_str, (mincount * l) + 1);
562 repeatcpy(SvPVX(last_str) + l,
563 SvPVX(last_str), l, mincount - 1);
564 SvCUR(last_str) *= mincount;
565 /* Add additional parts. */
566 SvCUR_set(data->last_found,
567 SvCUR(data->last_found) - l);
568 sv_catsv(data->last_found, last_str);
569 data->last_end += l * (mincount - 1);
573 /* It is counted once already... */
574 data->pos_min += minnext * (mincount - counted);
575 data->pos_delta += - counted * deltanext +
576 (minnext + deltanext) * maxcount - minnext * mincount;
577 if (mincount != maxcount) {
579 if (mincount && last_str) {
580 sv_setsv(data->last_found, last_str);
581 data->last_end = data->pos_min;
582 data->last_start_min =
583 data->pos_min - SvCUR(last_str);
584 data->last_start_max = is_inf
586 : data->pos_min + data->pos_delta
589 data->longest = &(data->longest_float);
592 if (data && (fl & SF_HAS_EVAL))
593 data->flags |= SF_HAS_EVAL;
596 if (OP(oscan) != CURLYX) {
597 while (regkind[(U8)OP(next = regnext(oscan))] == NOTHING
599 NEXT_OFF(oscan) += NEXT_OFF(next);
603 default: /* REF only? */
604 if (flags & SCF_DO_SUBSTR) {
606 data->longest = &(data->longest_float);
611 } else if (strchr(simple,OP(scan))) {
612 if (flags & SCF_DO_SUBSTR) {
617 } else if (regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
618 data->flags |= (OP(scan) == MEOL
621 } else if (regkind[(U8)OP(scan)] == BRANCHJ
622 && (scan->flags || data)
623 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
624 I32 deltanext, minnext;
628 next = regnext(scan);
629 nscan = NEXTOPER(NEXTOPER(scan));
630 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, 0);
633 FAIL("variable length lookbehind not implemented");
634 } else if (minnext > U8_MAX) {
635 FAIL2("lookbehind longer than %d not implemented", U8_MAX);
637 scan->flags = minnext;
639 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
641 if (data && (data_fake.flags & SF_HAS_EVAL))
642 data->flags |= SF_HAS_EVAL;
643 } else if (OP(scan) == OPEN) {
645 } else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
646 #ifdef REGALIGN_STRUCT
647 next = regnext(scan);
649 if ( next && (OP(next) != WHILEM) && next < last)
651 is_par = 0; /* Disable optimization */
652 } else if (OP(scan) == EVAL) {
654 data->flags |= SF_HAS_EVAL;
656 /* Else: zero-length, ignore. */
657 scan = regnext(scan);
662 *deltap = is_inf ? I32_MAX : delta;
663 if (flags & SCF_DO_SUBSTR && is_inf)
664 data->pos_delta = I32_MAX - data->pos_min;
667 if (is_par && pars==1 && data) {
668 data->flags |= SF_IN_PAR;
669 data->flags &= ~SF_HAS_PAR;
670 } else if (pars && data) {
671 data->flags |= SF_HAS_PAR;
672 data->flags &= ~SF_IN_PAR;
678 add_data(I32 n, char *s)
682 sizeof(*rx->data) + sizeof(void*) * (rx->data->count + n - 1),
683 char, struct reg_data);
684 Renew(rx->data->what, rx->data->count + n, U8);
685 rx->data->count += n;
687 Newc(1207, rx->data, sizeof(*rx->data) + sizeof(void*) * (n - 1),
688 char, struct reg_data);
689 New(1208, rx->data->what, n, U8);
692 Copy(s, rx->data->what + rx->data->count - n, n, U8);
693 return rx->data->count - n;
697 - pregcomp - compile a regular expression into internal code
699 * We can't allocate space until we know how big the compiled form will be,
700 * but we can't compile it (and thus know how big it is) until we've got a
701 * place to put the code. So we cheat: we compile it twice, once with code
702 * generation turned off and size counting turned on, and once "for real".
703 * This also means that we don't allocate space until we are sure that the
704 * thing really will compile successfully, and we never have to move the
705 * code and thus invalidate pointers into it. (Note that it has to be in
706 * one piece because free() must be able to free it all.) [NB: not true in perl]
708 * Beware that the optimization-preparation code in here knows about some
709 * of the structure of the compiled regexp. [I'll say.]
712 pregcomp(char *exp, char *xend, PMOP *pm)
726 FAIL("NULL regexp argument");
728 regprecomp = savepvn(exp, xend - exp);
729 DEBUG_r(PerlIO_printf(Perl_debug_log, "compiling RE `%*s'\n",
730 xend - exp, regprecomp));
731 regflags = pm->op_pmflags;
735 seen_zerolen = *exp == '^' ? -1 : 0;
738 /* First pass: determine size, legality. */
745 regc((U8)MAGIC, (char*)regcode);
746 if (reg(0, &flags) == NULL) {
747 Safefree(regprecomp);
751 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %d ", regsize));
756 char *s = PerlEnv_getenv("TERMCAP_COLORS");
760 colors[0] = s = savepv(s);
764 FAIL("Not enough TABs in TERMCAP_COLORS");
773 PerlIO_printf(Perl_debug_log, "%s%s%s%s",
774 colors[0],colors[1],colors[2],colors[3]);
778 /* Small enough for pointer-storage convention?
779 If extralen==0, this means that we will not need long jumps. */
780 #ifndef REGALIGN_STRUCT
781 if (regsize >= 0x10000L && extralen)
782 FAIL("regexp too big");
784 if (regsize >= 0x10000L && extralen)
790 /* Allocate space and initialize. */
791 Newc(1001, r, sizeof(regexp) + (unsigned)regsize * sizeof(regnode),
794 FAIL("regexp out of space");
796 r->prelen = xend - exp;
797 r->precomp = regprecomp;
798 r->subbeg = r->subbase = NULL;
801 /* Second pass: emit code. */
806 regcode = r->program;
807 regc((U8)MAGIC, (char*) regcode++);
809 if (reg(0, &flags) == NULL)
812 /* Dig out information for optimizations. */
813 pm->op_pmflags = regflags;
815 r->regstclass = NULL;
816 r->naughty = regnaughty >= 10; /* Probably an expensive pattern. */
817 scan = r->program + 1; /* First BRANCH. */
819 /* XXXX To minimize changes to RE engine we always allocate
820 3-units-long substrs field. */
821 Newz(1004, r->substrs, 1, struct reg_substr_data);
823 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
826 STRLEN longest_float_length, longest_fixed_length;
828 StructCopy(&zero_scan_data, &data, scan_data_t);
830 /* Skip introductions and multiplicators >= 1. */
831 while ((OP(first) == OPEN && (sawopen = 1)) ||
832 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
833 (OP(first) == PLUS) ||
834 (OP(first) == MINMOD) ||
835 (regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
836 if (OP(first) == PLUS)
839 first += regarglen[(U8)OP(first)];
840 first = NEXTOPER(first);
843 /* Starting-point info. */
845 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
846 else if (strchr(simple+2,OP(first)))
847 r->regstclass = first;
848 else if (regkind[(U8)OP(first)] == BOUND ||
849 regkind[(U8)OP(first)] == NBOUND)
850 r->regstclass = first;
851 else if (regkind[(U8)OP(first)] == BOL) {
852 r->reganch |= (OP(first) == MBOL ? ROPT_ANCH_MBOL: ROPT_ANCH_BOL);
853 first = NEXTOPER(first);
856 else if (OP(first) == GPOS) {
857 r->reganch |= ROPT_ANCH_GPOS;
858 first = NEXTOPER(first);
861 else if ((OP(first) == STAR &&
862 regkind[(U8)OP(NEXTOPER(first))] == ANY) &&
863 !(r->reganch & ROPT_ANCH) )
865 /* turn .* into ^.* with an implied $*=1 */
866 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
867 first = NEXTOPER(first);
870 if (sawplus && (!sawopen || !regsawback))
871 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
873 /* Scan is after the zeroth branch, first is atomic matcher. */
874 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
877 * If there's something expensive in the r.e., find the
878 * longest literal string that must appear and make it the
879 * regmust. Resolve ties in favor of later strings, since
880 * the regstart check works with the beginning of the r.e.
881 * and avoiding duplication strengthens checking. Not a
882 * strong reason, but sufficient in the absence of others.
883 * [Now we resolve ties in favor of the earlier string if
884 * it happens that c_offset_min has been invalidated, since the
885 * earlier string may buy us something the later one won't.]
889 data.longest_fixed = newSVpv("",0);
890 data.longest_float = newSVpv("",0);
891 data.last_found = newSVpv("",0);
892 data.longest = &(data.longest_fixed);
895 minlen = study_chunk(&first, &fake, scan + regsize, /* Up to end */
896 &data, SCF_DO_SUBSTR);
897 if ( regnpar == 1 && data.longest == &(data.longest_fixed)
898 && data.last_start_min == 0 && data.last_end > 0
900 && (!(regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
901 r->reganch |= ROPT_CHECK_ALL;
903 SvREFCNT_dec(data.last_found);
905 longest_float_length = SvCUR(data.longest_float);
906 if (longest_float_length
907 || (data.flags & SF_FL_BEFORE_EOL
908 && (!(data.flags & SF_FL_BEFORE_MEOL)
909 || (regflags & PMf_MULTILINE)))) {
910 if (SvCUR(data.longest_fixed)
911 && data.offset_fixed == data.offset_float_min)
912 goto remove; /* Like in (a)+. */
914 r->float_substr = data.longest_float;
915 r->float_min_offset = data.offset_float_min;
916 r->float_max_offset = data.offset_float_max;
917 fbm_compile(r->float_substr, 0);
918 BmUSEFUL(r->float_substr) = 100;
919 if (data.flags & SF_FL_BEFORE_EOL /* Cannot have SEOL and MULTI */
920 && (!(data.flags & SF_FL_BEFORE_MEOL)
921 || (regflags & PMf_MULTILINE)))
922 SvTAIL_on(r->float_substr);
925 r->float_substr = Nullsv;
926 SvREFCNT_dec(data.longest_float);
927 longest_float_length = 0;
930 longest_fixed_length = SvCUR(data.longest_fixed);
931 if (longest_fixed_length
932 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
933 && (!(data.flags & SF_FIX_BEFORE_MEOL)
934 || (regflags & PMf_MULTILINE)))) {
935 r->anchored_substr = data.longest_fixed;
936 r->anchored_offset = data.offset_fixed;
937 fbm_compile(r->anchored_substr, 0);
938 BmUSEFUL(r->anchored_substr) = 100;
939 if (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
940 && (!(data.flags & SF_FIX_BEFORE_MEOL)
941 || (regflags & PMf_MULTILINE)))
942 SvTAIL_on(r->anchored_substr);
944 r->anchored_substr = Nullsv;
945 SvREFCNT_dec(data.longest_fixed);
946 longest_fixed_length = 0;
949 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
950 if (longest_fixed_length > longest_float_length) {
951 r->check_substr = r->anchored_substr;
952 r->check_offset_min = r->check_offset_max = r->anchored_offset;
953 if (r->reganch & ROPT_ANCH_SINGLE)
954 r->reganch |= ROPT_NOSCAN;
956 r->check_substr = r->float_substr;
957 r->check_offset_min = data.offset_float_min;
958 r->check_offset_max = data.offset_float_max;
961 /* Several toplevels. Best we can is to set minlen. */
964 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
965 scan = r->program + 1;
966 minlen = study_chunk(&scan, &fake, scan + regsize, NULL, 0);
967 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
970 r->nparens = regnpar - 1;
972 if (regseen & REG_SEEN_GPOS)
973 r->reganch |= ROPT_GPOS_SEEN;
974 if (regseen & REG_SEEN_LOOKBEHIND)
975 r->reganch |= ROPT_LOOKBEHIND_SEEN;
976 Newz(1002, r->startp, regnpar, char*);
977 Newz(1002, r->endp, regnpar, char*);
983 - reg - regular expression, i.e. main body or parenthesized thing
985 * Caller must absorb opening parenthesis.
987 * Combining parenthesis handling with the base level of regular expression
988 * is a trifle forced, but the need to tie the tails of the branches to what
989 * follows makes it hard to avoid.
992 reg(I32 paren, I32 *flagp)
993 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
995 register regnode *ret; /* Will be the head of the group. */
996 register regnode *br;
997 register regnode *lastbr;
998 register regnode *ender = 0;
999 register I32 parno = 0;
1000 I32 flags, oregflags = regflags, have_branch = 0, open = 0;
1003 *flagp = HASWIDTH; /* Tentatively. */
1005 /* Make an OPEN node, if parenthesized. */
1007 if (*regparse == '?') {
1009 paren = *regparse++;
1010 ret = NULL; /* For look-ahead/behind. */
1013 #ifndef REGALIGN_STRUCT
1014 FAIL("lookbehind non-implemented without REGALIGN_STRUCT");
1016 regseen |= REG_SEEN_LOOKBEHIND;
1017 if (*regparse == '!')
1019 if (*regparse != '=' && *regparse != '!')
1030 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1033 while (*regparse && *regparse != ')')
1035 if (*regparse != ')')
1036 FAIL("Sequence (?#... not terminated");
1043 I32 count = 1, n = 0;
1047 OP_4tree *sop, *rop;
1050 while (count && (c = *regparse)) {
1051 if (c == '\\' && regparse[1])
1059 if (*regparse != ')')
1060 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1064 if (regparse - 1 - s)
1065 sv = newSVpv(s, regparse - 1 - s);
1067 sv = newSVpv("", 0);
1069 rop = sv_compile_2op(sv, &sop, "re", &av);
1071 n = add_data(3, "nso");
1072 rx->data->data[n] = (void*)rop;
1073 rx->data->data[n+1] = (void*)av;
1074 rx->data->data[n+2] = (void*)sop;
1076 } else { /* First pass */
1078 FAIL("Eval-group in insecure regular expression");
1082 return reganode(EVAL, n);
1086 if (regparse[0] == '?') {
1087 if (regparse[1] == '=' || regparse[1] == '!'
1088 || regparse[1] == '<'
1089 || regparse[1] == '{') { /* Lookahead or eval. */
1092 ret = reg_node(LOGICAL);
1093 regtail(ret, reg(1, &flag));
1096 } else if (regparse[0] >= '1' && regparse[0] <= '9' ) {
1097 parno = atoi(regparse++);
1099 while (isDIGIT(*regparse))
1101 ret = reganode(GROUPP, parno);
1102 if ((c = *nextchar()) != ')')
1103 FAIL2("Switch (?(number%c not recognized", c);
1105 regtail(ret, reganode(IFTHEN, 0));
1106 br = regbranch(&flags, 1);
1108 br = reganode(LONGJMP, 0);
1110 regtail(br, reganode(LONGJMP, 0));
1113 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1114 regbranch(&flags, 1);
1115 regtail(ret, lastbr);
1120 FAIL("Switch (?(condition)... contains too many branches");
1121 ender = reg_node(TAIL);
1124 regtail(lastbr, ender);
1125 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1127 regtail(ret, ender);
1130 FAIL2("Unknown condition for (?(%.2s", regparse);
1134 FAIL("Sequence (? incomplete");
1138 while (*regparse && strchr("iogcmsx", *regparse)) {
1139 if (*regparse != 'o')
1140 pmflag(®flags, *regparse);
1144 if (*regparse != ')')
1145 FAIL2("Sequence (?%c...) not recognized", *regparse);
1154 ret = reganode(OPEN, parno);
1160 /* Pick up the branches, linking them together. */
1161 br = regbranch(&flags, 1);
1164 if (*regparse == '|') {
1165 if (!SIZE_ONLY && extralen) {
1166 reginsert(BRANCHJ, br);
1168 reginsert(BRANCH, br);
1171 extralen += 1; /* For BRANCHJ-BRANCH. */
1172 } else if (paren == ':') {
1173 *flagp |= flags&SIMPLE;
1175 if (open) { /* Starts with OPEN. */
1176 regtail(ret, br); /* OPEN -> first. */
1177 } else if (paren != '?') /* Not Conditional */
1179 if (!(flags&HASWIDTH))
1180 *flagp &= ~HASWIDTH;
1181 *flagp |= flags&SPSTART;
1183 while (*regparse == '|') {
1184 if (!SIZE_ONLY && extralen) {
1185 ender = reganode(LONGJMP,0);
1186 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1189 extralen += 2; /* Account for LONGJMP. */
1191 br = regbranch(&flags, 0);
1194 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1196 if (!(flags&HASWIDTH))
1197 *flagp &= ~HASWIDTH;
1198 *flagp |= flags&SPSTART;
1201 if (have_branch || paren != ':') {
1202 /* Make a closing node, and hook it on the end. */
1205 ender = reg_node(TAIL);
1208 ender = reganode(CLOSE, parno);
1215 ender = reg_node(SUCCEED);
1216 *flagp &= ~HASWIDTH;
1219 ender = reg_node(END);
1222 regtail(lastbr, ender);
1225 /* Hook the tails of the branches to the closing node. */
1226 for (br = ret; br != NULL; br = regnext(br)) {
1227 regoptail(br, ender);
1234 static char parens[] = "=!<,>";
1236 if (paren && (p = strchr(parens, paren))) {
1237 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1238 int flag = (p - parens) > 1;
1241 node = SUSPEND, flag = 0;
1242 reginsert(node,ret);
1243 #ifdef REGALIGN_STRUCT
1246 regtail(ret, reg_node(TAIL));
1250 /* Check for proper termination. */
1251 if (paren && (regparse >= regxend || *nextchar() != ')')) {
1252 FAIL("unmatched () in regexp");
1253 } else if (!paren && regparse < regxend) {
1254 if (*regparse == ')') {
1255 FAIL("unmatched () in regexp");
1257 FAIL("junk on end of regexp"); /* "Can't happen". */
1261 regflags = oregflags;
1268 - regbranch - one alternative of an | operator
1270 * Implements the concatenation operator.
1273 regbranch(I32 *flagp, I32 first)
1275 register regnode *ret;
1276 register regnode *chain = NULL;
1277 register regnode *latest;
1278 I32 flags = 0, c = 0;
1283 if (!SIZE_ONLY && extralen)
1284 ret = reganode(BRANCHJ,0);
1286 ret = reg_node(BRANCH);
1289 if (!first && SIZE_ONLY)
1290 extralen += 1; /* BRANCHJ */
1292 *flagp = WORST; /* Tentatively. */
1296 while (regparse < regxend && *regparse != '|' && *regparse != ')') {
1298 latest = regpiece(&flags);
1299 if (latest == NULL) {
1300 if (flags & TRYAGAIN)
1303 } else if (ret == NULL)
1305 *flagp |= flags&HASWIDTH;
1306 if (chain == NULL) /* First piece. */
1307 *flagp |= flags&SPSTART;
1310 regtail(chain, latest);
1315 if (chain == NULL) { /* Loop ran zero times. */
1316 chain = reg_node(NOTHING);
1321 *flagp |= flags&SIMPLE;
1328 - regpiece - something followed by possible [*+?]
1330 * Note that the branching code sequences used for ? and the general cases
1331 * of * and + are somewhat optimized: they use the same NOTHING node as
1332 * both the endmarker for their branch list and the body of the last branch.
1333 * It might seem that this node could be dispensed with entirely, but the
1334 * endmarker role is not redundant.
1337 regpiece(I32 *flagp)
1339 register regnode *ret;
1341 register char *next;
1343 char *origparse = regparse;
1346 I32 max = REG_INFTY;
1348 ret = regatom(&flags);
1350 if (flags & TRYAGAIN)
1357 if (op == '{' && regcurly(regparse)) {
1358 next = regparse + 1;
1360 while (isDIGIT(*next) || *next == ',') {
1369 if (*next == '}') { /* got one */
1373 min = atoi(regparse);
1379 if (!max && *maxpos != '0')
1380 max = REG_INFTY; /* meaning "infinity" */
1381 else if (max >= REG_INFTY)
1382 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
1387 if ((flags&SIMPLE)) {
1388 regnaughty += 2 + regnaughty / 2;
1389 reginsert(CURLY, ret);
1392 regnaughty += 4 + regnaughty; /* compound interest */
1393 regtail(ret, reg_node(WHILEM));
1394 if (!SIZE_ONLY && extralen) {
1395 reginsert(LONGJMP,ret);
1396 reginsert(NOTHING,ret);
1397 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1399 reginsert(CURLYX,ret);
1400 if (!SIZE_ONLY && extralen)
1401 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1402 regtail(ret, reg_node(NOTHING));
1406 #ifdef REGALIGN_STRUCT
1411 *flagp = (WORST|HASWIDTH);
1412 if (max && max < min)
1413 FAIL("Can't do {n,m} with n > m");
1428 #if 0 /* Now runtime fix should be reliable. */
1429 if (!(flags&HASWIDTH) && op != '?')
1430 FAIL("regexp *+ operand could be empty");
1435 *flagp = (op != '+') ? (WORST|SPSTART) : (WORST|HASWIDTH);
1437 if (op == '*' && (flags&SIMPLE)) {
1438 reginsert(STAR, ret);
1439 #ifdef REGALIGN_STRUCT
1444 else if (op == '*') {
1447 } else if (op == '+' && (flags&SIMPLE)) {
1448 reginsert(PLUS, ret);
1449 #ifdef REGALIGN_STRUCT
1454 else if (op == '+') {
1457 } else if (op == '?') {
1462 if (dowarn && !SIZE_ONLY && !(flags&HASWIDTH) && max > 10000) {
1463 warn("%.*s matches null string many times",
1464 regparse - origparse, origparse);
1467 if (*regparse == '?') {
1469 reginsert(MINMOD, ret);
1471 regtail(ret, ret + NODE_STEP_REGNODE);
1473 regtail(ret, ret + 3);
1476 if (ISMULT2(regparse))
1477 FAIL("nested *?+ in regexp");
1483 - regatom - the lowest level
1485 * Optimization: gobbles an entire sequence of ordinary characters so that
1486 * it can turn them into a single node, which is smaller to store and
1487 * faster to run. Backslashed characters are exceptions, each becoming a
1488 * separate node; the code is simpler that way and it's not worth fixing.
1490 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1495 register regnode *ret = 0;
1498 *flagp = WORST; /* Tentatively. */
1501 switch (*regparse) {
1505 if (regflags & PMf_MULTILINE)
1506 ret = reg_node(MBOL);
1507 else if (regflags & PMf_SINGLELINE)
1508 ret = reg_node(SBOL);
1510 ret = reg_node(BOL);
1516 if (regflags & PMf_MULTILINE)
1517 ret = reg_node(MEOL);
1518 else if (regflags & PMf_SINGLELINE)
1519 ret = reg_node(SEOL);
1521 ret = reg_node(EOL);
1525 if (regflags & PMf_SINGLELINE)
1526 ret = reg_node(SANY);
1528 ret = reg_node(ANY);
1530 *flagp |= HASWIDTH|SIMPLE;
1535 *flagp |= HASWIDTH|SIMPLE;
1539 ret = reg(1, &flags);
1541 if (flags & TRYAGAIN)
1545 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
1549 if (flags & TRYAGAIN) {
1553 FAIL2("internal urp in regexp at /%s/", regparse);
1554 /* Supposed to be caught earlier. */
1557 if (!regcurly(regparse)) {
1565 FAIL("?+*{} follows nothing in regexp");
1568 switch (*++regparse) {
1571 ret = reg_node(SBOL);
1576 ret = reg_node(GPOS);
1577 regseen |= REG_SEEN_GPOS;
1582 ret = reg_node(SEOL);
1587 ret = reg_node((regflags & PMf_LOCALE) ? ALNUML : ALNUM);
1588 *flagp |= HASWIDTH|SIMPLE;
1592 ret = reg_node((regflags & PMf_LOCALE) ? NALNUML : NALNUM);
1593 *flagp |= HASWIDTH|SIMPLE;
1598 ret = reg_node((regflags & PMf_LOCALE) ? BOUNDL : BOUND);
1604 ret = reg_node((regflags & PMf_LOCALE) ? NBOUNDL : NBOUND);
1609 ret = reg_node((regflags & PMf_LOCALE) ? SPACEL : SPACE);
1610 *flagp |= HASWIDTH|SIMPLE;
1614 ret = reg_node((regflags & PMf_LOCALE) ? NSPACEL : NSPACE);
1615 *flagp |= HASWIDTH|SIMPLE;
1619 ret = reg_node(DIGIT);
1620 *flagp |= HASWIDTH|SIMPLE;
1624 ret = reg_node(NDIGIT);
1625 *flagp |= HASWIDTH|SIMPLE;
1638 case '1': case '2': case '3': case '4':
1639 case '5': case '6': case '7': case '8': case '9':
1641 I32 num = atoi(regparse);
1643 if (num > 9 && num >= regnpar)
1647 ret = reganode((regflags & PMf_FOLD)
1648 ? ((regflags & PMf_LOCALE) ? REFFL : REFF)
1651 while (isDIGIT(*regparse))
1659 if (regparse >= regxend)
1660 FAIL("trailing \\ in regexp");
1668 if (regflags & PMf_EXTENDED) {
1669 while (regparse < regxend && *regparse != '\n') regparse++;
1670 if (regparse < regxend)
1685 ret = reg_node((regflags & PMf_FOLD)
1686 ? ((regflags & PMf_LOCALE) ? EXACTFL : EXACTF)
1688 s = (char *) OPERAND(ret);
1689 regc(0, s++); /* save spot for len */
1690 for (len = 0, p = regparse - 1;
1691 len < 127 && p < regxend;
1696 if (regflags & PMf_EXTENDED)
1697 p = regwhite(p, regxend);
1747 ender = scan_hex(++p, 2, &numlen);
1752 ender = UCHARAT(p++);
1753 ender = toCTRL(ender);
1755 case '0': case '1': case '2': case '3':case '4':
1756 case '5': case '6': case '7': case '8':case '9':
1758 (isDIGIT(p[1]) && atoi(p) >= regnpar) ) {
1759 ender = scan_oct(p, 3, &numlen);
1769 FAIL("trailing \\ in regexp");
1780 if (regflags & PMf_EXTENDED)
1781 p = regwhite(p, regxend);
1782 if (ISMULT2(p)) { /* Back off on ?+*. */
1797 FAIL("internal disaster in regexp");
1803 *OPERAND(ret) = len;
1806 #ifdef REGALIGN_STRUCT
1807 regsize += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1810 regcode += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1820 regwhite(char *p, char *e)
1825 else if (*p == '#') {
1828 } while (p < e && *p != '\n');
1839 register char *opnd, *s;
1841 register I32 lastclass = 1234;
1842 register I32 range = 0;
1843 register regnode *ret;
1847 s = opnd = (char *) OPERAND(regcode);
1848 ret = reg_node(ANYOF);
1849 for (Class = 0; Class < 33; Class++)
1851 if (*regparse == '^') { /* Complement of range. */
1855 *opnd |= ANYOF_INVERT;
1858 regcode += ANY_SKIP;
1859 if (regflags & PMf_FOLD)
1860 *opnd |= ANYOF_FOLD;
1861 if (regflags & PMf_LOCALE)
1862 *opnd |= ANYOF_LOCALE;
1864 regsize += ANY_SKIP;
1866 if (*regparse == ']' || *regparse == '-')
1867 goto skipcond; /* allow 1st char to be ] or - */
1868 while (regparse < regxend && *regparse != ']') {
1870 Class = UCHARAT(regparse++);
1871 if (Class == '[' && regparse + 1 < regxend &&
1872 /* I smell either [: or [= or [. -- POSIX has been here, right? */
1873 (*regparse == ':' || *regparse == '=' || *regparse == '.')) {
1874 char posixccc = *regparse;
1875 char* posixccs = regparse++;
1877 while (regparse < regxend && *regparse != posixccc)
1879 if (regparse == regxend)
1880 /* Grandfather lone [:, [=, [. */
1881 regparse = posixccs;
1883 regparse++; /* skip over the posixccc */
1884 if (*regparse == ']') {
1885 /* Not Implemented Yet.
1886 * (POSIX Extended Character Classes, that is)
1887 * The text between e.g. [: and :] would start
1888 * at posixccs + 1 and stop at regparse - 2. */
1889 if (dowarn && !SIZE_ONLY)
1890 warn("Character class syntax [%c %c] is reserved for future extensions", posixccc, posixccc);
1891 regparse++; /* skip over the ending ] */
1895 if (Class == '\\') {
1896 Class = UCHARAT(regparse++);
1900 if (regflags & PMf_LOCALE)
1901 *opnd |= ANYOF_ALNUML;
1903 for (Class = 0; Class < 256; Class++)
1905 ANYOF_SET(opnd, Class);
1912 if (regflags & PMf_LOCALE)
1913 *opnd |= ANYOF_NALNUML;
1915 for (Class = 0; Class < 256; Class++)
1916 if (!isALNUM(Class))
1917 ANYOF_SET(opnd, Class);
1924 if (regflags & PMf_LOCALE)
1925 *opnd |= ANYOF_SPACEL;
1927 for (Class = 0; Class < 256; Class++)
1929 ANYOF_SET(opnd, Class);
1936 if (regflags & PMf_LOCALE)
1937 *opnd |= ANYOF_NSPACEL;
1939 for (Class = 0; Class < 256; Class++)
1940 if (!isSPACE(Class))
1941 ANYOF_SET(opnd, Class);
1948 for (Class = '0'; Class <= '9'; Class++)
1949 ANYOF_SET(opnd, Class);
1955 for (Class = 0; Class < '0'; Class++)
1956 ANYOF_SET(opnd, Class);
1957 for (Class = '9' + 1; Class < 256; Class++)
1958 ANYOF_SET(opnd, Class);
1984 Class = scan_hex(regparse, 2, &numlen);
1988 Class = UCHARAT(regparse++);
1989 Class = toCTRL(Class);
1991 case '0': case '1': case '2': case '3': case '4':
1992 case '5': case '6': case '7': case '8': case '9':
1993 Class = scan_oct(--regparse, 3, &numlen);
1999 if (lastclass > Class)
2000 FAIL("invalid [] range in regexp");
2005 if (*regparse == '-' && regparse+1 < regxend &&
2006 regparse[1] != ']') {
2009 continue; /* do it next time */
2013 for ( ; lastclass <= Class; lastclass++)
2014 ANYOF_SET(opnd, lastclass);
2018 if (*regparse != ']')
2019 FAIL("unmatched [] in regexp");
2021 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
2022 if (!SIZE_ONLY && (*opnd & (0xFF ^ ANYOF_INVERT)) == ANYOF_FOLD) {
2023 for (Class = 0; Class < 256; ++Class) {
2024 if (ANYOF_TEST(opnd, Class)) {
2025 I32 cf = fold[Class];
2026 ANYOF_SET(opnd, cf);
2029 *opnd &= ~ANYOF_FOLD;
2031 /* optimize inverted simple patterns (e.g. [^a-z]) */
2032 if (!SIZE_ONLY && (*opnd & 0xFF) == ANYOF_INVERT) {
2033 for (Class = 0; Class < 32; ++Class)
2034 opnd[1 + Class] ^= 0xFF;
2043 char* retval = regparse++;
2046 if (*regparse == '(' && regparse[1] == '?' &&
2047 regparse[2] == '#') {
2048 while (*regparse && *regparse != ')')
2053 if (regflags & PMf_EXTENDED) {
2054 if (isSPACE(*regparse)) {
2058 else if (*regparse == '#') {
2059 while (*regparse && *regparse != '\n')
2070 - reg_node - emit a node
2072 static regnode * /* Location. */
2075 register regnode *ret;
2076 register regnode *ptr;
2080 SIZE_ALIGN(regsize);
2081 #ifdef REGALIGN_STRUCT
2089 NODE_ALIGN_FILL(ret);
2091 FILL_ADVANCE_NODE(ptr, op);
2098 - reganode - emit a node with an argument
2100 static regnode * /* Location. */
2101 reganode(U8 op, U32 arg)
2103 register regnode *ret;
2104 register regnode *ptr;
2108 SIZE_ALIGN(regsize);
2117 NODE_ALIGN_FILL(ret);
2119 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
2126 - regc - emit (if appropriate) a byte of code
2136 - reginsert - insert an operator in front of already-emitted operand
2138 * Means relocating the operand.
2141 reginsert(U8 op, regnode *opnd)
2143 register regnode *src;
2144 register regnode *dst;
2145 register regnode *place;
2146 register int offset = regarglen[(U8)op];
2148 /* (regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
2151 regsize += NODE_STEP_REGNODE + offset;
2156 regcode += NODE_STEP_REGNODE + offset;
2159 StructCopy(--src, --dst, regnode);
2161 place = opnd; /* Op node, where operand used to be. */
2162 src = NEXTOPER(place);
2163 FILL_ADVANCE_NODE(place, op);
2164 Zero(src, offset, regnode);
2165 #if defined(REGALIGN) && !defined(REGALIGN_STRUCT)
2166 src[offset + 1] = '\177';
2171 - regtail - set the next-pointer at the end of a node chain of p to val.
2174 regtail(regnode *p, regnode *val)
2176 register regnode *scan;
2177 register regnode *temp;
2178 register I32 offset;
2183 /* Find last node. */
2186 temp = regnext(scan);
2193 # ifdef REGALIGN_STRUCT
2194 if (reg_off_by_arg[OP(scan)]) {
2195 ARG_SET(scan, val - scan);
2197 NEXT_OFF(scan) = val - scan;
2200 offset = val - scan;
2202 *(short*)(scan+1) = offset;
2206 if (OP(scan) == BACK)
2207 offset = scan - val;
2209 offset = val - scan;
2210 *(scan+1) = (offset>>8)&0377;
2211 *(scan+2) = offset&0377;
2216 - regoptail - regtail on operand of first argument; nop if operandless
2219 regoptail(regnode *p, regnode *val)
2221 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
2222 if (p == NULL || SIZE_ONLY)
2224 if (regkind[(U8)OP(p)] == BRANCH) {
2225 regtail(NEXTOPER(p), val);
2226 } else if ( regkind[(U8)OP(p)] == BRANCHJ) {
2227 regtail(NEXTOPER(NEXTOPER(p)), val);
2233 - regcurly - a little FSA that accepts {\d+,?\d*}
2236 regcurly(register char *s)
2255 dumpuntil(regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
2258 register char op = EXACT; /* Arbitrary non-END op. */
2259 register regnode *next, *onode;
2261 while (op != END && (!last || node < last)) {
2262 /* While that wasn't END last time... */
2268 next = regnext(node);
2270 if (OP(node) == OPTIMIZED)
2273 PerlIO_printf(Perl_debug_log, "%4d%*s%s", node - start,
2274 2*l + 1, "", SvPVX(sv));
2275 if (next == NULL) /* Next ptr. */
2276 PerlIO_printf(Perl_debug_log, "(0)");
2278 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
2279 (void)PerlIO_putc(Perl_debug_log, '\n');
2281 if (regkind[(U8)op] == BRANCHJ) {
2282 register regnode *nnode = (OP(next) == LONGJMP
2285 if (last && nnode > last)
2287 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
2288 } else if (regkind[(U8)op] == BRANCH) {
2289 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
2290 } else if ( op == CURLY) { /* `next' might be very big: optimizer */
2291 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2292 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
2293 } else if (regkind[(U8)op] == CURLY && op != CURLYX) {
2294 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2296 } else if ( op == PLUS || op == STAR) {
2297 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
2298 } else if (op == ANYOF) {
2299 node = NEXTOPER(node);
2301 } else if (regkind[(U8)op] == EXACT) {
2302 /* Literal string, where present. */
2303 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2304 node = NEXTOPER(node);
2306 node = NEXTOPER(node);
2307 node += regarglen[(U8)op];
2309 if (op == CURLYX || op == OPEN)
2311 else if (op == WHILEM)
2314 #endif /* DEBUGGING */
2319 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
2325 SV *sv = sv_newmortal();
2327 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
2329 /* Header fields of interest. */
2330 if (r->anchored_substr)
2331 PerlIO_printf(Perl_debug_log, "anchored `%s%s%s'%s at %d ",
2333 SvPVX(r->anchored_substr),
2335 SvTAIL(r->anchored_substr) ? "$" : "",
2336 r->anchored_offset);
2337 if (r->float_substr)
2338 PerlIO_printf(Perl_debug_log, "floating `%s%s%s'%s at %d..%u ",
2340 SvPVX(r->float_substr),
2342 SvTAIL(r->float_substr) ? "$" : "",
2343 r->float_min_offset, r->float_max_offset);
2344 if (r->check_substr)
2345 PerlIO_printf(Perl_debug_log,
2346 r->check_substr == r->float_substr
2347 ? "(checking floating" : "(checking anchored");
2348 if (r->reganch & ROPT_NOSCAN)
2349 PerlIO_printf(Perl_debug_log, " noscan");
2350 if (r->reganch & ROPT_CHECK_ALL)
2351 PerlIO_printf(Perl_debug_log, " isall");
2352 if (r->check_substr)
2353 PerlIO_printf(Perl_debug_log, ") ");
2355 if (r->regstclass) {
2356 regprop(sv, r->regstclass);
2357 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
2359 if (r->reganch & ROPT_ANCH) {
2360 PerlIO_printf(Perl_debug_log, "anchored");
2361 if (r->reganch & ROPT_ANCH_BOL)
2362 PerlIO_printf(Perl_debug_log, "(BOL)");
2363 if (r->reganch & ROPT_ANCH_MBOL)
2364 PerlIO_printf(Perl_debug_log, "(MBOL)");
2365 if (r->reganch & ROPT_ANCH_GPOS)
2366 PerlIO_printf(Perl_debug_log, "(GPOS)");
2367 PerlIO_putc(Perl_debug_log, ' ');
2369 if (r->reganch & ROPT_GPOS_SEEN)
2370 PerlIO_printf(Perl_debug_log, "GPOS ");
2371 if (r->reganch & ROPT_SKIP)
2372 PerlIO_printf(Perl_debug_log, "plus ");
2373 if (r->reganch & ROPT_IMPLICIT)
2374 PerlIO_printf(Perl_debug_log, "implicit ");
2375 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
2376 PerlIO_printf(Perl_debug_log, "\n");
2377 #endif /* DEBUGGING */
2381 - regprop - printable representation of opcode
2384 regprop(SV *sv, regnode *o)
2387 register char *p = 0;
2422 sv_catpvf(sv, "EXACT <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2425 sv_catpvf(sv, "EXACTF <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2428 sv_catpvf(sv, "EXACTFL <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2455 sv_catpvf(sv, "CURLY {%d,%d}", ARG1(o), ARG2(o));
2458 #ifdef REGALIGN_STRUCT
2459 sv_catpvf(sv, "CURLYM[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2461 sv_catpvf(sv, "CURLYM {%d,%d}", ARG1(o), ARG2(o));
2465 #ifdef REGALIGN_STRUCT
2466 sv_catpvf(sv, "CURLYN[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2468 sv_catpvf(sv, "CURLYN {%d,%d}", ARG1(o), ARG2(o));
2472 sv_catpvf(sv, "CURLYX {%d,%d}", ARG1(o), ARG2(o));
2475 sv_catpvf(sv, "REF%d", ARG(o));
2478 sv_catpvf(sv, "REFF%d", ARG(o));
2481 sv_catpvf(sv, "REFFL%d", ARG(o));
2484 sv_catpvf(sv, "OPEN%d", ARG(o));
2487 sv_catpvf(sv, "CLOSE%d", ARG(o));
2503 #ifdef REGALIGN_STRUCT
2504 sv_catpvf(sv, "UNLESSM[-%d]", o->flags);
2510 #ifdef REGALIGN_STRUCT
2511 sv_catpvf(sv, "IFMATCH[-%d]", o->flags);
2565 sv_catpvf(sv, "GROUPP%d", ARG(o));
2580 FAIL("corrupted regexp opcode");
2584 #endif /* DEBUGGING */
2588 pregfree(struct regexp *r)
2590 if (!r || (--r->refcnt > 0))
2593 Safefree(r->precomp);
2595 Safefree(r->subbase);
2597 if (r->anchored_substr)
2598 SvREFCNT_dec(r->anchored_substr);
2599 if (r->float_substr)
2600 SvREFCNT_dec(r->float_substr);
2601 Safefree(r->substrs);
2604 int n = r->data->count;
2606 switch (r->data->what[n]) {
2608 SvREFCNT_dec((SV*)r->data->data[n]);
2611 op_free((OP_4tree*)r->data->data[n]);
2616 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
2619 Safefree(r->data->what);
2622 Safefree(r->startp);
2628 - regnext - dig the "next" pointer out of a node
2630 * [Note, when REGALIGN is defined there are two places in regmatch()
2631 * that bypass this code for speed.]
2634 regnext(register regnode *p)
2636 register I32 offset;
2641 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
2656 re_croak2(const char* pat1,const char* pat2,...)
2659 STRLEN l1 = strlen(pat1);
2660 STRLEN l2 = strlen(pat2);
2668 Copy(pat1, buf, l1 , char);
2669 Copy(pat2, buf + l1, l2 , char);
2670 buf[l1 + l2 + 1] = '\n';
2671 buf[l1 + l2 + 2] = '\0';
2672 va_start(args, pat2);
2673 message = mess(buf, &args);
2675 l1 = strlen(message);
2678 Copy(message, buf, l1 , char);
2679 buf[l1] = '\0'; /* Overwrite \n */