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.
68 # if defined(BUGGY_MSC6)
69 /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */
70 # pragma optimize("a",off)
71 /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/
72 # pragma optimize("w",on )
73 # endif /* BUGGY_MSC6 */
80 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
81 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
82 ((*s) == '{' && regcurly(s)))
84 #define PERL_META "^$.[()|?+*\\"
86 #define META "^$.[()|?+*\\"
90 #undef SPSTART /* dratted cpp namespace... */
93 * Flags to be passed up and down.
95 #define WORST 0 /* Worst case. */
96 #define HASWIDTH 0x1 /* Known never to match null string. */
97 #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
98 #define SPSTART 0x4 /* Starts with * or +. */
99 #define TRYAGAIN 0x8 /* Weeded out a declaration. */
102 * Forward declarations for pregcomp()'s friends.
105 static char* regwhite _((char *, char *));
107 static regnode *reg _((I32, I32 *));
108 static regnode *reganode _((U8, U32));
109 static regnode *regatom _((I32 *));
110 static regnode *regbranch _((I32 *, I32));
111 static void regc _((U8, char *));
112 static regnode *regclass _((void));
113 STATIC I32 regcurly _((char *));
114 static regnode *reg_node _((U8));
115 static regnode *regpiece _((I32 *));
116 static void reginsert _((U8, regnode *));
117 static void regoptail _((regnode *, regnode *));
118 static void regset _((char *, I32));
119 static void regtail _((regnode *, regnode *));
120 static char* nextchar _((void));
123 /* Length of a variant. */
132 I32 last_end; /* min value, <0 unless valid. */
135 SV **longest; /* Either &l_fixed, or &l_float. */
139 I32 offset_float_min;
140 I32 offset_float_max;
145 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
147 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
148 #define SF_BEFORE_SEOL 0x1
149 #define SF_BEFORE_MEOL 0x2
150 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
151 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
153 #define SF_FIX_SHIFT_EOL (+2)
154 #define SF_FL_SHIFT_EOL (+4)
156 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
157 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
159 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
160 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
161 #define SF_IS_INF 0x40
162 #define SF_HAS_PAR 0x80
163 #define SF_IN_PAR 0x100
164 #define SF_HAS_EVAL 0x200
165 #define SCF_DO_SUBSTR 0x400
168 scan_commit(scan_data_t *data)
170 STRLEN l = SvCUR(data->last_found);
171 STRLEN old_l = SvCUR(*data->longest);
173 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
174 sv_setsv(*data->longest, data->last_found);
175 if (*data->longest == data->longest_fixed) {
176 data->offset_fixed = l ? data->last_start_min : data->pos_min;
177 if (data->flags & SF_BEFORE_EOL)
179 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
181 data->flags &= ~SF_FIX_BEFORE_EOL;
183 data->offset_float_min = l ? data->last_start_min : data->pos_min;
184 data->offset_float_max = (l
185 ? data->last_start_max
186 : data->pos_min + data->pos_delta);
187 if (data->flags & SF_BEFORE_EOL)
189 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
191 data->flags &= ~SF_FL_BEFORE_EOL;
194 SvCUR_set(data->last_found, 0);
196 data->flags &= ~SF_BEFORE_EOL;
199 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
200 to the position after last scanned or to NULL. */
203 study_chunk(regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
204 /* scanp: Start here (read-write). */
205 /* deltap: Write maxlen-minlen here. */
206 /* last: Stop before this one. */
208 I32 min = 0, pars = 0, code;
209 regnode *scan = *scanp, *next;
211 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
212 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
213 scan_data_t data_fake;
215 while (scan && OP(scan) != END && scan < last) {
216 /* Peephole optimizer: */
218 if (regkind[(U8)OP(scan)] == EXACT) {
219 regnode *n = regnext(scan);
222 regnode *stop = scan;
225 next = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
226 /* Skip NOTHING, merge EXACT*. */
228 ( regkind[(U8)OP(n)] == NOTHING ||
229 (stringok && (OP(n) == OP(scan))))
231 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
232 if (OP(n) == TAIL || n > next)
234 if (regkind[(U8)OP(n)] == NOTHING) {
235 NEXT_OFF(scan) += NEXT_OFF(n);
236 next = n + NODE_STEP_REGNODE;
243 int oldl = *OPERAND(scan);
244 regnode *nnext = regnext(n);
246 if (oldl + *OPERAND(n) > U8_MAX)
248 NEXT_OFF(scan) += NEXT_OFF(n);
249 *OPERAND(scan) += *OPERAND(n);
250 next = n + (*OPERAND(n) + 2 - 1)/sizeof(regnode) + 2;
251 /* Now we can overwrite *n : */
252 Move(OPERAND(n) + 1, OPERAND(scan) + oldl + 1,
253 *OPERAND(n) + 1, char);
263 n = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
265 if (regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
274 if (OP(scan) != CURLYX) {
275 int max = (reg_off_by_arg[OP(scan)] ? I32_MAX : U16_MAX);
276 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
280 /* Skip NOTHING and LONGJMP. */
281 while ((n = regnext(n))
282 && ((regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
283 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
286 if (reg_off_by_arg[OP(scan)])
289 NEXT_OFF(scan) = off;
291 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
292 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
293 next = regnext(scan);
296 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
297 I32 max1 = 0, min1 = I32_MAX, num = 0;
299 if (flags & SCF_DO_SUBSTR)
301 while (OP(scan) == code) {
302 I32 deltanext, minnext;
306 next = regnext(scan);
307 scan = NEXTOPER(scan);
309 scan = NEXTOPER(scan);
310 /* We suppose the run is continuous, last=next...*/
311 minnext = study_chunk(&scan, &deltanext, next,
315 if (max1 < minnext + deltanext)
316 max1 = minnext + deltanext;
317 if (deltanext == I32_MAX)
320 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
322 if (data && (data_fake.flags & SF_HAS_EVAL))
323 data->flags |= SF_HAS_EVAL;
327 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
329 if (flags & SCF_DO_SUBSTR) {
330 data->pos_min += min1;
331 data->pos_delta += max1 - min1;
332 if (max1 != min1 || is_inf)
333 data->longest = &(data->longest_float);
336 delta += max1 - min1;
337 } else if (code == BRANCHJ) /* single branch is optimized. */
338 scan = NEXTOPER(NEXTOPER(scan));
339 else /* single branch is optimized. */
340 scan = NEXTOPER(scan);
342 } else if (OP(scan) == EXACT) {
343 min += *OPERAND(scan);
344 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
345 I32 l = *OPERAND(scan);
347 /* The code below prefers earlier match for fixed
348 offset, later match for variable offset. */
349 if (data->last_end == -1) { /* Update the start info. */
350 data->last_start_min = data->pos_min;
351 data->last_start_max = is_inf
352 ? I32_MAX : data->pos_min + data->pos_delta;
354 sv_catpvn(data->last_found, (char *)(OPERAND(scan)+1), l);
355 data->last_end = data->pos_min + l;
356 data->pos_min += l; /* As in the first entry. */
357 data->flags &= ~SF_BEFORE_EOL;
359 } else if (regkind[(U8)OP(scan)] == EXACT) {
360 if (flags & SCF_DO_SUBSTR)
362 min += *OPERAND(scan);
363 if (data && (flags & SCF_DO_SUBSTR))
364 data->pos_min += *OPERAND(scan);
365 } else if (strchr(varies,OP(scan))) {
366 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
367 regnode *oscan = scan;
369 switch (regkind[(U8)OP(scan)]) {
371 scan = NEXTOPER(scan);
374 if (flags & SCF_DO_SUBSTR) {
375 next = NEXTOPER(scan);
376 if (OP(next) == EXACT) {
378 maxcount = REG_INFTY;
379 next = regnext(scan);
380 scan = NEXTOPER(scan);
384 if (flags & SCF_DO_SUBSTR)
390 scan = regnext(scan);
391 if (flags & SCF_DO_SUBSTR) {
393 data->longest = &(data->longest_float);
395 goto optimize_curly_tail;
397 mincount = ARG1(scan);
398 maxcount = ARG2(scan);
399 next = regnext(scan);
400 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
402 if (flags & SCF_DO_SUBSTR) {
403 if (mincount == 0) scan_commit(data);
404 pos_before = data->pos_min;
408 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
410 data->flags |= SF_IS_INF;
412 /* This will finish on WHILEM, setting scan, or on NULL: */
413 minnext = study_chunk(&scan, &deltanext, last, data,
415 ? (flags & ~SCF_DO_SUBSTR) : flags);
416 if (!scan) /* It was not CURLYX, but CURLY. */
418 if (dowarn && (minnext + deltanext == 0)
419 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR)))
420 warn("Strange *+?{} on zero-length expression");
421 min += minnext * mincount;
422 is_inf |= (maxcount == REG_INFTY && (minnext + deltanext) > 0
423 || deltanext == I32_MAX);
424 delta += (minnext + deltanext) * maxcount - minnext * mincount;
426 /* Try powerful optimization CURLYX => CURLYN. */
427 #ifdef REGALIGN_STRUCT
428 if ( OP(oscan) == CURLYX && data
429 && data->flags & SF_IN_PAR
430 && !(data->flags & SF_HAS_EVAL)
431 && !deltanext && minnext == 1 ) {
432 /* Try to optimize to CURLYN. */
433 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
434 regnode *nxt1 = nxt, *nxt2;
438 if (!strchr(simple,OP(nxt))
439 && !(regkind[(U8)OP(nxt)] == EXACT
440 && *OPERAND(nxt) == 1))
444 if (OP(nxt) != CLOSE)
446 /* Now we know that nxt2 is the only contents: */
447 oscan->flags = ARG(nxt);
449 OP(nxt1) = NOTHING; /* was OPEN. */
451 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
452 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
453 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
454 OP(nxt) = OPTIMIZED; /* was CLOSE. */
455 OP(nxt + 1) = OPTIMIZED; /* was count. */
456 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
462 /* Try optimization CURLYX => CURLYM. */
463 if ( OP(oscan) == CURLYX && data
464 #ifdef REGALIGN_STRUCT
465 && !(data->flags & SF_HAS_PAR)
467 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
469 && !(data->flags & SF_HAS_EVAL)
471 /* XXXX How to optimize if data == 0? */
472 /* Optimize to a simpler form. */
473 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
477 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
478 && (OP(nxt2) != WHILEM))
480 OP(nxt2) = SUCCEED; /* Whas WHILEM */
481 #ifdef REGALIGN_STRUCT
482 /* Need to optimize away parenths. */
483 if (data->flags & SF_IN_PAR) {
484 /* Set the parenth number. */
485 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
487 if (OP(nxt) != CLOSE)
488 FAIL("panic opt close");
489 oscan->flags = ARG(nxt);
490 OP(nxt1) = OPTIMIZED; /* was OPEN. */
491 OP(nxt) = OPTIMIZED; /* was CLOSE. */
493 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
494 OP(nxt + 1) = OPTIMIZED; /* was count. */
495 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
496 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
499 while ( nxt1 && (OP(nxt1) != WHILEM)) {
500 regnode *nnxt = regnext(nxt1);
503 if (reg_off_by_arg[OP(nxt1)])
504 ARG_SET(nxt1, nxt2 - nxt1);
505 else if (nxt2 - nxt1 < U16_MAX)
506 NEXT_OFF(nxt1) = nxt2 - nxt1;
508 OP(nxt) = NOTHING; /* Cannot beautify */
513 /* Optimize again: */
514 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
519 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
521 if (flags & SCF_DO_SUBSTR) {
522 SV *last_str = Nullsv;
523 int counted = mincount != 0;
525 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
526 I32 b = pos_before >= data->last_start_min
527 ? pos_before : data->last_start_min;
529 char *s = SvPV(data->last_found, l);
531 l -= b - data->last_start_min;
532 /* Get the added string: */
533 last_str = newSVpv(s + b - data->last_start_min, l);
534 if (deltanext == 0 && pos_before == b) {
535 /* What was added is a constant string */
537 SvGROW(last_str, (mincount * l) + 1);
538 repeatcpy(SvPVX(last_str) + l,
539 SvPVX(last_str), l, mincount - 1);
540 SvCUR(last_str) *= mincount;
541 /* Add additional parts. */
542 SvCUR_set(data->last_found,
543 SvCUR(data->last_found) - l);
544 sv_catsv(data->last_found, last_str);
545 data->last_end += l * (mincount - 1);
549 /* It is counted once already... */
550 data->pos_min += minnext * (mincount - counted);
551 data->pos_delta += - counted * deltanext +
552 (minnext + deltanext) * maxcount - minnext * mincount;
553 if (mincount != maxcount) {
555 if (mincount && last_str) {
556 sv_setsv(data->last_found, last_str);
557 data->last_end = data->pos_min;
558 data->last_start_min =
559 data->pos_min - SvCUR(last_str);
560 data->last_start_max = is_inf
562 : data->pos_min + data->pos_delta
565 data->longest = &(data->longest_float);
568 if (data && (fl & SF_HAS_EVAL))
569 data->flags |= SF_HAS_EVAL;
572 if (OP(oscan) != CURLYX) {
573 while (regkind[(U8)OP(next = regnext(oscan))] == NOTHING
575 NEXT_OFF(oscan) += NEXT_OFF(next);
579 default: /* REF only? */
580 if (flags & SCF_DO_SUBSTR) {
582 data->longest = &(data->longest_float);
587 } else if (strchr(simple,OP(scan))) {
588 if (flags & SCF_DO_SUBSTR) {
593 } else if (regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
594 data->flags |= (OP(scan) == MEOL
597 } else if (regkind[(U8)OP(scan)] == BRANCHJ
598 && (scan->flags || data)
599 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
600 I32 deltanext, minnext;
604 next = regnext(scan);
605 nscan = NEXTOPER(NEXTOPER(scan));
606 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, 0);
609 FAIL("variable length lookbehind not implemented");
610 } else if (minnext > U8_MAX) {
611 FAIL2("lookbehind longer than %d not implemented", U8_MAX);
613 scan->flags = minnext;
615 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
617 if (data && (data_fake.flags & SF_HAS_EVAL))
618 data->flags |= SF_HAS_EVAL;
619 } else if (OP(scan) == OPEN) {
621 } else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
622 #ifdef REGALIGN_STRUCT
623 next = regnext(scan);
625 if ( next && (OP(next) != WHILEM) && next < last)
627 is_par = 0; /* Disable optimization */
628 } else if (OP(scan) == EVAL) {
630 data->flags |= SF_HAS_EVAL;
632 /* Else: zero-length, ignore. */
633 scan = regnext(scan);
638 *deltap = is_inf ? I32_MAX : delta;
639 if (flags & SCF_DO_SUBSTR && is_inf)
640 data->pos_delta = I32_MAX - data->pos_min;
643 if (is_par && pars==1 && data) {
644 data->flags |= SF_IN_PAR;
645 data->flags &= ~SF_HAS_PAR;
646 } else if (pars && data) {
647 data->flags |= SF_HAS_PAR;
648 data->flags &= ~SF_IN_PAR;
654 add_data(I32 n, char *s)
658 sizeof(*rx->data) + sizeof(void*) * (rx->data->count + n - 1),
659 char, struct reg_data);
660 Renew(rx->data->what, rx->data->count + n, U8);
661 rx->data->count += n;
663 Newc(1207, rx->data, sizeof(*rx->data) + sizeof(void*) * (n - 1),
664 char, struct reg_data);
665 New(1208, rx->data->what, n, U8);
668 Copy(s, rx->data->what + rx->data->count - n, n, U8);
669 return rx->data->count - n;
673 - pregcomp - compile a regular expression into internal code
675 * We can't allocate space until we know how big the compiled form will be,
676 * but we can't compile it (and thus know how big it is) until we've got a
677 * place to put the code. So we cheat: we compile it twice, once with code
678 * generation turned off and size counting turned on, and once "for real".
679 * This also means that we don't allocate space until we are sure that the
680 * thing really will compile successfully, and we never have to move the
681 * code and thus invalidate pointers into it. (Note that it has to be in
682 * one piece because free() must be able to free it all.) [NB: not true in perl]
684 * Beware that the optimization-preparation code in here knows about some
685 * of the structure of the compiled regexp. [I'll say.]
688 pregcomp(char *exp, char *xend, PMOP *pm)
702 FAIL("NULL regexp argument");
704 regprecomp = savepvn(exp, xend - exp);
705 DEBUG_r(PerlIO_printf(Perl_debug_log, "compiling RE `%*s'\n",
706 xend - exp, regprecomp));
707 regflags = pm->op_pmflags;
711 seen_zerolen = *exp == '^' ? -1 : 0;
714 /* First pass: determine size, legality. */
721 regc((U8)MAGIC, (char*)regcode);
722 if (reg(0, &flags) == NULL) {
723 Safefree(regprecomp);
727 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %d ", regsize));
732 char *s = PerlEnv_getenv("TERMCAP_COLORS");
736 colors[0] = s = savepv(s);
740 FAIL("Not enough TABs in TERMCAP_COLORS");
749 PerlIO_printf(Perl_debug_log, "%s%s%s%s",
750 colors[0],colors[1],colors[2],colors[3]);
754 /* Small enough for pointer-storage convention?
755 If extralen==0, this means that we will not need long jumps. */
756 #ifndef REGALIGN_STRUCT
757 if (regsize >= 0x10000L && extralen)
758 FAIL("regexp too big");
760 if (regsize >= 0x10000L && extralen)
766 /* Allocate space and initialize. */
767 Newc(1001, r, sizeof(regexp) + (unsigned)regsize * sizeof(regnode),
770 FAIL("regexp out of space");
772 r->prelen = xend - exp;
773 r->precomp = regprecomp;
774 r->subbeg = r->subbase = NULL;
777 /* Second pass: emit code. */
782 regcode = r->program;
783 regc((U8)MAGIC, (char*) regcode++);
785 if (reg(0, &flags) == NULL)
788 /* Dig out information for optimizations. */
789 pm->op_pmflags = regflags;
791 r->regstclass = NULL;
792 r->naughty = regnaughty >= 10; /* Probably an expensive pattern. */
793 scan = r->program + 1; /* First BRANCH. */
794 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
797 STRLEN longest_float_length, longest_fixed_length;
799 StructCopy(&zero_scan_data, &data, scan_data_t);
801 /* Skip introductions and multiplicators >= 1. */
802 while ((OP(first) == OPEN && (sawopen = 1)) ||
803 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
804 (OP(first) == PLUS) ||
805 (OP(first) == MINMOD) ||
806 (regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
807 if (OP(first) == PLUS)
810 first += regarglen[(U8)OP(first)];
811 first = NEXTOPER(first);
814 /* Starting-point info. */
816 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
817 else if (strchr(simple+2,OP(first)))
818 r->regstclass = first;
819 else if (regkind[(U8)OP(first)] == BOUND ||
820 regkind[(U8)OP(first)] == NBOUND)
821 r->regstclass = first;
822 else if (regkind[(U8)OP(first)] == BOL) {
823 r->reganch |= (OP(first) == MBOL ? ROPT_ANCH_MBOL: ROPT_ANCH_BOL);
824 first = NEXTOPER(first);
827 else if (OP(first) == GPOS) {
828 r->reganch |= ROPT_ANCH_GPOS;
829 first = NEXTOPER(first);
832 else if ((OP(first) == STAR &&
833 regkind[(U8)OP(NEXTOPER(first))] == ANY) &&
834 !(r->reganch & ROPT_ANCH) )
836 /* turn .* into ^.* with an implied $*=1 */
837 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
838 first = NEXTOPER(first);
841 if (sawplus && (!sawopen || !regsawback))
842 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
844 /* Scan is after the zeroth branch, first is atomic matcher. */
845 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
848 * If there's something expensive in the r.e., find the
849 * longest literal string that must appear and make it the
850 * regmust. Resolve ties in favor of later strings, since
851 * the regstart check works with the beginning of the r.e.
852 * and avoiding duplication strengthens checking. Not a
853 * strong reason, but sufficient in the absence of others.
854 * [Now we resolve ties in favor of the earlier string if
855 * it happens that c_offset_min has been invalidated, since the
856 * earlier string may buy us something the later one won't.]
860 data.longest_fixed = newSVpv("",0);
861 data.longest_float = newSVpv("",0);
862 data.last_found = newSVpv("",0);
863 data.longest = &(data.longest_fixed);
866 minlen = study_chunk(&first, &fake, scan + regsize, /* Up to end */
867 &data, SCF_DO_SUBSTR);
868 if ( regnpar == 1 && data.longest == &(data.longest_fixed)
869 && data.last_start_min == 0 && data.last_end > 0
871 && (!(regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
872 r->reganch |= ROPT_CHECK_ALL;
874 SvREFCNT_dec(data.last_found);
876 longest_float_length = SvCUR(data.longest_float);
877 if (longest_float_length
878 || (data.flags & SF_FL_BEFORE_EOL
879 && (!(data.flags & SF_FL_BEFORE_MEOL)
880 || (regflags & PMf_MULTILINE)))) {
881 if (SvCUR(data.longest_fixed)
882 && data.offset_fixed == data.offset_float_min)
883 goto remove; /* Like in (a)+. */
885 r->float_substr = data.longest_float;
886 r->float_min_offset = data.offset_float_min;
887 r->float_max_offset = data.offset_float_max;
888 fbm_compile(r->float_substr);
889 BmUSEFUL(r->float_substr) = 100;
890 if (data.flags & SF_FL_BEFORE_EOL /* Cannot have SEOL and MULTI */
891 && (!(data.flags & SF_FL_BEFORE_MEOL)
892 || (regflags & PMf_MULTILINE)))
893 SvTAIL_on(r->float_substr);
896 r->float_substr = Nullsv;
897 SvREFCNT_dec(data.longest_float);
898 longest_float_length = 0;
901 longest_fixed_length = SvCUR(data.longest_fixed);
902 if (longest_fixed_length
903 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
904 && (!(data.flags & SF_FIX_BEFORE_MEOL)
905 || (regflags & PMf_MULTILINE)))) {
906 r->anchored_substr = data.longest_fixed;
907 r->anchored_offset = data.offset_fixed;
908 fbm_compile(r->anchored_substr);
909 BmUSEFUL(r->anchored_substr) = 100;
910 if (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
911 && (!(data.flags & SF_FIX_BEFORE_MEOL)
912 || (regflags & PMf_MULTILINE)))
913 SvTAIL_on(r->anchored_substr);
915 r->anchored_substr = Nullsv;
916 SvREFCNT_dec(data.longest_fixed);
917 longest_fixed_length = 0;
920 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
921 if (longest_fixed_length > longest_float_length) {
922 r->check_substr = r->anchored_substr;
923 r->check_offset_min = r->check_offset_max = r->anchored_offset;
924 if (r->reganch & ROPT_ANCH_SINGLE)
925 r->reganch |= ROPT_NOSCAN;
927 r->check_substr = r->float_substr;
928 r->check_offset_min = data.offset_float_min;
929 r->check_offset_max = data.offset_float_max;
932 /* Several toplevels. Best we can is to set minlen. */
935 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
936 scan = r->program + 1;
937 minlen = study_chunk(&scan, &fake, scan + regsize, NULL, 0);
938 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
941 r->nparens = regnpar - 1;
943 if (regseen & REG_SEEN_GPOS)
944 r->reganch |= ROPT_GPOS_SEEN;
945 if (regseen & REG_SEEN_LOOKBEHIND)
946 r->reganch |= ROPT_LOOKBEHIND_SEEN;
947 Newz(1002, r->startp, regnpar, char*);
948 Newz(1002, r->endp, regnpar, char*);
954 - reg - regular expression, i.e. main body or parenthesized thing
956 * Caller must absorb opening parenthesis.
958 * Combining parenthesis handling with the base level of regular expression
959 * is a trifle forced, but the need to tie the tails of the branches to what
960 * follows makes it hard to avoid.
963 reg(I32 paren, I32 *flagp)
964 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
966 register regnode *ret; /* Will be the head of the group. */
967 register regnode *br;
968 register regnode *lastbr;
969 register regnode *ender = 0;
970 register I32 parno = 0;
971 I32 flags, oregflags = regflags, have_branch = 0, open = 0;
974 *flagp = HASWIDTH; /* Tentatively. */
976 /* Make an OPEN node, if parenthesized. */
978 if (*regparse == '?') {
981 ret = NULL; /* For look-ahead/behind. */
984 #ifndef REGALIGN_STRUCT
985 FAIL("lookbehind non-implemented without REGALIGN_STRUCT");
987 regseen |= REG_SEEN_LOOKBEHIND;
988 if (*regparse == '!')
990 if (*regparse != '=' && *regparse != '!')
1001 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1004 while (*regparse && *regparse != ')')
1006 if (*regparse != ')')
1007 FAIL("Sequence (?#... not terminated");
1014 I32 count = 1, n = 0;
1018 OP_4tree *sop, *rop;
1021 while (count && (c = *regparse)) {
1022 if (c == '\\' && regparse[1])
1030 if (*regparse != ')')
1031 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1035 if (regparse - 1 - s)
1036 sv = newSVpv(s, regparse - 1 - s);
1038 sv = newSVpv("", 0);
1040 rop = sv_compile_2op(sv, &sop, "re", &av);
1042 n = add_data(3, "nso");
1043 rx->data->data[n] = (void*)rop;
1044 rx->data->data[n+1] = (void*)av;
1045 rx->data->data[n+2] = (void*)sop;
1047 } else { /* First pass */
1049 FAIL("Eval-group in insecure regular expression");
1053 return reganode(EVAL, n);
1057 if (regparse[0] == '?') {
1058 if (regparse[1] == '=' || regparse[1] == '!'
1059 || regparse[1] == '<'
1060 || regparse[1] == '{') { /* Lookahead or eval. */
1063 ret = reg_node(LOGICAL);
1064 regtail(ret, reg(1, &flag));
1067 } else if (regparse[0] >= '1' && regparse[0] <= '9' ) {
1068 parno = atoi(regparse++);
1070 while (isDIGIT(*regparse))
1072 ret = reganode(GROUPP, parno);
1073 if ((c = *nextchar()) != ')')
1074 FAIL2("Switch (?(number%c not recognized", c);
1076 regtail(ret, reganode(IFTHEN, 0));
1077 br = regbranch(&flags, 1);
1079 br = reganode(LONGJMP, 0);
1081 regtail(br, reganode(LONGJMP, 0));
1084 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1085 regbranch(&flags, 1);
1086 regtail(ret, lastbr);
1091 FAIL("Switch (?(condition)... contains too many branches");
1092 ender = reg_node(TAIL);
1095 regtail(lastbr, ender);
1096 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1098 regtail(ret, ender);
1101 FAIL2("Unknown condition for (?(%.2s", regparse);
1105 FAIL("Sequence (? incomplete");
1109 while (*regparse && strchr("iogcmsx", *regparse))
1110 pmflag(®flags, *regparse++);
1112 if (*regparse != ')')
1113 FAIL2("Sequence (?%c...) not recognized", *regparse);
1122 ret = reganode(OPEN, parno);
1128 /* Pick up the branches, linking them together. */
1129 br = regbranch(&flags, 1);
1132 if (*regparse == '|') {
1133 if (!SIZE_ONLY && extralen) {
1134 reginsert(BRANCHJ, br);
1136 reginsert(BRANCH, br);
1139 extralen += 1; /* For BRANCHJ-BRANCH. */
1140 } else if (paren == ':') {
1141 *flagp |= flags&SIMPLE;
1143 if (open) { /* Starts with OPEN. */
1144 regtail(ret, br); /* OPEN -> first. */
1145 } else if (paren != '?') /* Not Conditional */
1147 if (!(flags&HASWIDTH))
1148 *flagp &= ~HASWIDTH;
1149 *flagp |= flags&SPSTART;
1151 while (*regparse == '|') {
1152 if (!SIZE_ONLY && extralen) {
1153 ender = reganode(LONGJMP,0);
1154 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1157 extralen += 2; /* Account for LONGJMP. */
1159 br = regbranch(&flags, 0);
1162 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1164 if (!(flags&HASWIDTH))
1165 *flagp &= ~HASWIDTH;
1166 *flagp |= flags&SPSTART;
1169 if (have_branch || paren != ':') {
1170 /* Make a closing node, and hook it on the end. */
1173 ender = reg_node(TAIL);
1176 ender = reganode(CLOSE, parno);
1183 ender = reg_node(SUCCEED);
1184 *flagp &= ~HASWIDTH;
1187 ender = reg_node(END);
1190 regtail(lastbr, ender);
1193 /* Hook the tails of the branches to the closing node. */
1194 for (br = ret; br != NULL; br = regnext(br)) {
1195 regoptail(br, ender);
1202 static char parens[] = "=!<,>";
1204 if (paren && (p = strchr(parens, paren))) {
1205 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1206 int flag = (p - parens) > 1;
1209 node = SUSPEND, flag = 0;
1210 reginsert(node,ret);
1211 #ifdef REGALIGN_STRUCT
1214 regtail(ret, reg_node(TAIL));
1218 /* Check for proper termination. */
1219 if (paren && (regparse >= regxend || *nextchar() != ')')) {
1220 FAIL("unmatched () in regexp");
1221 } else if (!paren && regparse < regxend) {
1222 if (*regparse == ')') {
1223 FAIL("unmatched () in regexp");
1225 FAIL("junk on end of regexp"); /* "Can't happen". */
1229 regflags = oregflags;
1236 - regbranch - one alternative of an | operator
1238 * Implements the concatenation operator.
1241 regbranch(I32 *flagp, I32 first)
1243 register regnode *ret;
1244 register regnode *chain = NULL;
1245 register regnode *latest;
1246 I32 flags = 0, c = 0;
1251 if (!SIZE_ONLY && extralen)
1252 ret = reganode(BRANCHJ,0);
1254 ret = reg_node(BRANCH);
1257 if (!first && SIZE_ONLY)
1258 extralen += 1; /* BRANCHJ */
1260 *flagp = WORST; /* Tentatively. */
1264 while (regparse < regxend && *regparse != '|' && *regparse != ')') {
1266 latest = regpiece(&flags);
1267 if (latest == NULL) {
1268 if (flags & TRYAGAIN)
1271 } else if (ret == NULL)
1273 *flagp |= flags&HASWIDTH;
1274 if (chain == NULL) /* First piece. */
1275 *flagp |= flags&SPSTART;
1278 regtail(chain, latest);
1283 if (chain == NULL) { /* Loop ran zero times. */
1284 chain = reg_node(NOTHING);
1289 *flagp |= flags&SIMPLE;
1296 - regpiece - something followed by possible [*+?]
1298 * Note that the branching code sequences used for ? and the general cases
1299 * of * and + are somewhat optimized: they use the same NOTHING node as
1300 * both the endmarker for their branch list and the body of the last branch.
1301 * It might seem that this node could be dispensed with entirely, but the
1302 * endmarker role is not redundant.
1305 regpiece(I32 *flagp)
1307 register regnode *ret;
1309 register char *next;
1311 char *origparse = regparse;
1314 I32 max = REG_INFTY;
1316 ret = regatom(&flags);
1318 if (flags & TRYAGAIN)
1325 if (op == '{' && regcurly(regparse)) {
1326 next = regparse + 1;
1328 while (isDIGIT(*next) || *next == ',') {
1337 if (*next == '}') { /* got one */
1341 min = atoi(regparse);
1347 if (!max && *maxpos != '0')
1348 max = REG_INFTY; /* meaning "infinity" */
1349 else if (max >= REG_INFTY)
1350 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
1355 if ((flags&SIMPLE)) {
1356 regnaughty += 2 + regnaughty / 2;
1357 reginsert(CURLY, ret);
1360 regnaughty += 4 + regnaughty; /* compound interest */
1361 regtail(ret, reg_node(WHILEM));
1362 if (!SIZE_ONLY && extralen) {
1363 reginsert(LONGJMP,ret);
1364 reginsert(NOTHING,ret);
1365 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1367 reginsert(CURLYX,ret);
1368 if (!SIZE_ONLY && extralen)
1369 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1370 regtail(ret, reg_node(NOTHING));
1374 #ifdef REGALIGN_STRUCT
1379 *flagp = (WORST|HASWIDTH);
1380 if (max && max < min)
1381 FAIL("Can't do {n,m} with n > m");
1396 #if 0 /* Now runtime fix should be reliable. */
1397 if (!(flags&HASWIDTH) && op != '?')
1398 FAIL("regexp *+ operand could be empty");
1403 *flagp = (op != '+') ? (WORST|SPSTART) : (WORST|HASWIDTH);
1405 if (op == '*' && (flags&SIMPLE)) {
1406 reginsert(STAR, ret);
1407 #ifdef REGALIGN_STRUCT
1412 else if (op == '*') {
1415 } else if (op == '+' && (flags&SIMPLE)) {
1416 reginsert(PLUS, ret);
1417 #ifdef REGALIGN_STRUCT
1422 else if (op == '+') {
1425 } else if (op == '?') {
1430 if (dowarn && !SIZE_ONLY && !(flags&HASWIDTH) && max > 10000) {
1431 warn("%.*s matches null string many times",
1432 regparse - origparse, origparse);
1435 if (*regparse == '?') {
1437 reginsert(MINMOD, ret);
1439 regtail(ret, ret + NODE_STEP_REGNODE);
1441 regtail(ret, ret + 3);
1444 if (ISMULT2(regparse))
1445 FAIL("nested *?+ in regexp");
1451 - regatom - the lowest level
1453 * Optimization: gobbles an entire sequence of ordinary characters so that
1454 * it can turn them into a single node, which is smaller to store and
1455 * faster to run. Backslashed characters are exceptions, each becoming a
1456 * separate node; the code is simpler that way and it's not worth fixing.
1458 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1463 register regnode *ret = 0;
1466 *flagp = WORST; /* Tentatively. */
1469 switch (*regparse) {
1473 if (regflags & PMf_MULTILINE)
1474 ret = reg_node(MBOL);
1475 else if (regflags & PMf_SINGLELINE)
1476 ret = reg_node(SBOL);
1478 ret = reg_node(BOL);
1484 if (regflags & PMf_MULTILINE)
1485 ret = reg_node(MEOL);
1486 else if (regflags & PMf_SINGLELINE)
1487 ret = reg_node(SEOL);
1489 ret = reg_node(EOL);
1493 if (regflags & PMf_SINGLELINE)
1494 ret = reg_node(SANY);
1496 ret = reg_node(ANY);
1498 *flagp |= HASWIDTH|SIMPLE;
1503 *flagp |= HASWIDTH|SIMPLE;
1507 ret = reg(1, &flags);
1509 if (flags & TRYAGAIN)
1513 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
1517 if (flags & TRYAGAIN) {
1521 FAIL2("internal urp in regexp at /%s/", regparse);
1522 /* Supposed to be caught earlier. */
1525 if (!regcurly(regparse)) {
1533 FAIL("?+*{} follows nothing in regexp");
1536 switch (*++regparse) {
1539 ret = reg_node(SBOL);
1544 ret = reg_node(GPOS);
1545 regseen |= REG_SEEN_GPOS;
1550 ret = reg_node(SEOL);
1555 ret = reg_node((regflags & PMf_LOCALE) ? ALNUML : ALNUM);
1556 *flagp |= HASWIDTH|SIMPLE;
1560 ret = reg_node((regflags & PMf_LOCALE) ? NALNUML : NALNUM);
1561 *flagp |= HASWIDTH|SIMPLE;
1566 ret = reg_node((regflags & PMf_LOCALE) ? BOUNDL : BOUND);
1572 ret = reg_node((regflags & PMf_LOCALE) ? NBOUNDL : NBOUND);
1577 ret = reg_node((regflags & PMf_LOCALE) ? SPACEL : SPACE);
1578 *flagp |= HASWIDTH|SIMPLE;
1582 ret = reg_node((regflags & PMf_LOCALE) ? NSPACEL : NSPACE);
1583 *flagp |= HASWIDTH|SIMPLE;
1587 ret = reg_node(DIGIT);
1588 *flagp |= HASWIDTH|SIMPLE;
1592 ret = reg_node(NDIGIT);
1593 *flagp |= HASWIDTH|SIMPLE;
1606 case '1': case '2': case '3': case '4':
1607 case '5': case '6': case '7': case '8': case '9':
1609 I32 num = atoi(regparse);
1611 if (num > 9 && num >= regnpar)
1615 ret = reganode((regflags & PMf_FOLD)
1616 ? ((regflags & PMf_LOCALE) ? REFFL : REFF)
1619 while (isDIGIT(*regparse))
1627 if (regparse >= regxend)
1628 FAIL("trailing \\ in regexp");
1636 if (regflags & PMf_EXTENDED) {
1637 while (regparse < regxend && *regparse != '\n') regparse++;
1638 if (regparse < regxend)
1653 ret = reg_node((regflags & PMf_FOLD)
1654 ? ((regflags & PMf_LOCALE) ? EXACTFL : EXACTF)
1656 s = (char *) OPERAND(ret);
1657 regc(0, s++); /* save spot for len */
1658 for (len = 0, p = regparse - 1;
1659 len < 127 && p < regxend;
1664 if (regflags & PMf_EXTENDED)
1665 p = regwhite(p, regxend);
1715 ender = scan_hex(++p, 2, &numlen);
1720 ender = UCHARAT(p++);
1721 ender = toCTRL(ender);
1723 case '0': case '1': case '2': case '3':case '4':
1724 case '5': case '6': case '7': case '8':case '9':
1726 (isDIGIT(p[1]) && atoi(p) >= regnpar) ) {
1727 ender = scan_oct(p, 3, &numlen);
1737 FAIL("trailing \\ in regexp");
1748 if (regflags & PMf_EXTENDED)
1749 p = regwhite(p, regxend);
1750 if (ISMULT2(p)) { /* Back off on ?+*. */
1765 FAIL("internal disaster in regexp");
1771 *OPERAND(ret) = len;
1774 #ifdef REGALIGN_STRUCT
1775 regsize += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1778 regcode += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1788 regwhite(char *p, char *e)
1793 else if (*p == '#') {
1796 } while (p < e && *p != '\n');
1805 regset(char *opnd, register I32 c)
1810 opnd[1 + (c >> 3)] |= (1 << (c & 7));
1816 register char *opnd, *s;
1818 register I32 lastclass = 1234;
1819 register I32 range = 0;
1820 register regnode *ret;
1824 s = opnd = (char *) OPERAND(regcode);
1825 ret = reg_node(ANYOF);
1826 for (Class = 0; Class < 33; Class++)
1828 if (*regparse == '^') { /* Complement of range. */
1832 *opnd |= ANYOF_INVERT;
1835 regcode += ANY_SKIP;
1836 if (regflags & PMf_FOLD)
1837 *opnd |= ANYOF_FOLD;
1838 if (regflags & PMf_LOCALE)
1839 *opnd |= ANYOF_LOCALE;
1841 regsize += ANY_SKIP;
1843 if (*regparse == ']' || *regparse == '-')
1844 goto skipcond; /* allow 1st char to be ] or - */
1845 while (regparse < regxend && *regparse != ']') {
1847 Class = UCHARAT(regparse++);
1848 if (Class == '[' && regparse + 1 < regxend &&
1849 /* I smell either [: or [= or [. -- POSIX has been here, right? */
1850 (*regparse == ':' || *regparse == '=' || *regparse == '.')) {
1851 char posixccc = *regparse;
1852 char* posixccs = regparse++;
1854 while (regparse < regxend && *regparse != posixccc)
1856 if (regparse == regxend)
1857 /* Grandfather lone [:, [=, [. */
1858 regparse = posixccs;
1860 regparse++; /* skip over the posixccc */
1861 if (*regparse == ']') {
1862 /* Not Implemented Yet.
1863 * (POSIX Extended Character Classes, that is)
1864 * The text between e.g. [: and :] would start
1865 * at posixccs + 1 and stop at regparse - 2. */
1866 if (dowarn && !SIZE_ONLY)
1867 warn("Character class syntax [%c %c] is reserved for future extensions", posixccc, posixccc);
1868 regparse++; /* skip over the ending ] */
1872 if (Class == '\\') {
1873 Class = UCHARAT(regparse++);
1876 if (regflags & PMf_LOCALE) {
1878 *opnd |= ANYOF_ALNUML;
1881 for (Class = 0; Class < 256; Class++)
1883 regset(opnd, Class);
1888 if (regflags & PMf_LOCALE) {
1890 *opnd |= ANYOF_NALNUML;
1893 for (Class = 0; Class < 256; Class++)
1894 if (!isALNUM(Class))
1895 regset(opnd, Class);
1900 if (regflags & PMf_LOCALE) {
1902 *opnd |= ANYOF_SPACEL;
1905 for (Class = 0; Class < 256; Class++)
1907 regset(opnd, Class);
1912 if (regflags & PMf_LOCALE) {
1914 *opnd |= ANYOF_NSPACEL;
1917 for (Class = 0; Class < 256; Class++)
1918 if (!isSPACE(Class))
1919 regset(opnd, Class);
1924 for (Class = '0'; Class <= '9'; Class++)
1925 regset(opnd, Class);
1929 for (Class = 0; Class < '0'; Class++)
1930 regset(opnd, Class);
1931 for (Class = '9' + 1; Class < 256; Class++)
1932 regset(opnd, Class);
1957 Class = scan_hex(regparse, 2, &numlen);
1961 Class = UCHARAT(regparse++);
1962 Class = toCTRL(Class);
1964 case '0': case '1': case '2': case '3': case '4':
1965 case '5': case '6': case '7': case '8': case '9':
1966 Class = scan_oct(--regparse, 3, &numlen);
1972 if (lastclass > Class)
1973 FAIL("invalid [] range in regexp");
1978 if (*regparse == '-' && regparse+1 < regxend &&
1979 regparse[1] != ']') {
1982 continue; /* do it next time */
1985 for ( ; lastclass <= Class; lastclass++)
1986 regset(opnd, lastclass);
1989 if (*regparse != ']')
1990 FAIL("unmatched [] in regexp");
1998 char* retval = regparse++;
2001 if (*regparse == '(' && regparse[1] == '?' &&
2002 regparse[2] == '#') {
2003 while (*regparse && *regparse != ')')
2008 if (regflags & PMf_EXTENDED) {
2009 if (isSPACE(*regparse)) {
2013 else if (*regparse == '#') {
2014 while (*regparse && *regparse != '\n')
2025 - reg_node - emit a node
2027 STATIC regnode * /* Location. */
2030 register regnode *ret;
2031 register regnode *ptr;
2035 SIZE_ALIGN(regsize);
2036 #ifdef REGALIGN_STRUCT
2044 NODE_ALIGN_FILL(ret);
2046 FILL_ADVANCE_NODE(ptr, op);
2053 - reganode - emit a node with an argument
2055 STATIC regnode * /* Location. */
2056 reganode(U8 op, U32 arg)
2058 register regnode *ret;
2059 register regnode *ptr;
2063 SIZE_ALIGN(regsize);
2072 NODE_ALIGN_FILL(ret);
2074 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
2081 - regc - emit (if appropriate) a byte of code
2091 - reginsert - insert an operator in front of already-emitted operand
2093 * Means relocating the operand.
2096 reginsert(U8 op, regnode *opnd)
2098 register regnode *src;
2099 register regnode *dst;
2100 register regnode *place;
2101 register int offset = regarglen[(U8)op];
2103 /* (regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
2106 regsize += NODE_STEP_REGNODE + offset;
2111 regcode += NODE_STEP_REGNODE + offset;
2114 StructCopy(--src, --dst, regnode);
2116 place = opnd; /* Op node, where operand used to be. */
2117 src = NEXTOPER(place);
2118 FILL_ADVANCE_NODE(place, op);
2119 Zero(src, offset, regnode);
2120 #if defined(REGALIGN) && !defined(REGALIGN_STRUCT)
2121 src[offset + 1] = '\177';
2126 - regtail - set the next-pointer at the end of a node chain of p to val.
2129 regtail(regnode *p, regnode *val)
2131 register regnode *scan;
2132 register regnode *temp;
2133 register I32 offset;
2138 /* Find last node. */
2141 temp = regnext(scan);
2148 # ifdef REGALIGN_STRUCT
2149 if (reg_off_by_arg[OP(scan)]) {
2150 ARG_SET(scan, val - scan);
2152 NEXT_OFF(scan) = val - scan;
2155 offset = val - scan;
2157 *(short*)(scan+1) = offset;
2161 if (OP(scan) == BACK)
2162 offset = scan - val;
2164 offset = val - scan;
2165 *(scan+1) = (offset>>8)&0377;
2166 *(scan+2) = offset&0377;
2171 - regoptail - regtail on operand of first argument; nop if operandless
2174 regoptail(regnode *p, regnode *val)
2176 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
2177 if (p == NULL || SIZE_ONLY)
2179 if (regkind[(U8)OP(p)] == BRANCH) {
2180 regtail(NEXTOPER(p), val);
2181 } else if ( regkind[(U8)OP(p)] == BRANCHJ) {
2182 regtail(NEXTOPER(NEXTOPER(p)), val);
2188 - regcurly - a little FSA that accepts {\d+,?\d*}
2191 regcurly(register char *s)
2211 dumpuntil(regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
2213 register char op = EXACT; /* Arbitrary non-END op. */
2214 register regnode *next, *onode;
2216 while (op != END && (!last || node < last)) {
2217 /* While that wasn't END last time... */
2223 next = regnext(node);
2225 if (OP(node) == OPTIMIZED)
2228 PerlIO_printf(Perl_debug_log, "%4d%*s%s", node - start,
2229 2*l + 1, "", SvPVX(sv));
2230 if (next == NULL) /* Next ptr. */
2231 PerlIO_printf(Perl_debug_log, "(0)");
2233 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
2234 (void)PerlIO_putc(Perl_debug_log, '\n');
2236 if (regkind[(U8)op] == BRANCHJ) {
2237 register regnode *nnode = (OP(next) == LONGJMP
2240 if (last && nnode > last)
2242 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
2243 } else if (regkind[(U8)op] == BRANCH) {
2244 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
2245 } else if ( op == CURLY) { /* `next' might be very big: optimizer */
2246 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2247 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
2248 } else if (regkind[(U8)op] == CURLY && op != CURLYX) {
2249 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2251 } else if ( op == PLUS || op == STAR) {
2252 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
2253 } else if (op == ANYOF) {
2254 node = NEXTOPER(node);
2256 } else if (regkind[(U8)op] == EXACT) {
2257 /* Literal string, where present. */
2258 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2259 node = NEXTOPER(node);
2261 node = NEXTOPER(node);
2262 node += regarglen[(U8)op];
2264 if (op == CURLYX || op == OPEN)
2266 else if (op == WHILEM)
2273 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
2278 SV *sv = sv_newmortal();
2280 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
2282 /* Header fields of interest. */
2283 if (r->anchored_substr)
2284 PerlIO_printf(Perl_debug_log, "anchored `%s%s%s'%s at %d ",
2286 SvPVX(r->anchored_substr),
2288 SvTAIL(r->anchored_substr) ? "$" : "",
2289 r->anchored_offset);
2290 if (r->float_substr)
2291 PerlIO_printf(Perl_debug_log, "floating `%s%s%s'%s at %d..%u ",
2293 SvPVX(r->float_substr),
2295 SvTAIL(r->float_substr) ? "$" : "",
2296 r->float_min_offset, r->float_max_offset);
2297 if (r->check_substr)
2298 PerlIO_printf(Perl_debug_log,
2299 r->check_substr == r->float_substr
2300 ? "(checking floating" : "(checking anchored");
2301 if (r->reganch & ROPT_NOSCAN)
2302 PerlIO_printf(Perl_debug_log, " noscan");
2303 if (r->reganch & ROPT_CHECK_ALL)
2304 PerlIO_printf(Perl_debug_log, " isall");
2305 if (r->check_substr)
2306 PerlIO_printf(Perl_debug_log, ") ");
2308 if (r->regstclass) {
2309 regprop(sv, r->regstclass);
2310 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
2312 if (r->reganch & ROPT_ANCH) {
2313 PerlIO_printf(Perl_debug_log, "anchored");
2314 if (r->reganch & ROPT_ANCH_BOL)
2315 PerlIO_printf(Perl_debug_log, "(BOL)");
2316 if (r->reganch & ROPT_ANCH_MBOL)
2317 PerlIO_printf(Perl_debug_log, "(MBOL)");
2318 if (r->reganch & ROPT_ANCH_GPOS)
2319 PerlIO_printf(Perl_debug_log, "(GPOS)");
2320 PerlIO_putc(Perl_debug_log, ' ');
2322 if (r->reganch & ROPT_GPOS_SEEN)
2323 PerlIO_printf(Perl_debug_log, "GPOS ");
2324 if (r->reganch & ROPT_SKIP)
2325 PerlIO_printf(Perl_debug_log, "plus ");
2326 if (r->reganch & ROPT_IMPLICIT)
2327 PerlIO_printf(Perl_debug_log, "implicit ");
2328 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
2329 PerlIO_printf(Perl_debug_log, "\n");
2333 - regprop - printable representation of opcode
2336 regprop(SV *sv, regnode *o)
2338 register char *p = 0;
2373 sv_catpvf(sv, "EXACT <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2376 sv_catpvf(sv, "EXACTF <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2379 sv_catpvf(sv, "EXACTFL <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2406 sv_catpvf(sv, "CURLY {%d,%d}", ARG1(o), ARG2(o));
2409 #ifdef REGALIGN_STRUCT
2410 sv_catpvf(sv, "CURLYM[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2412 sv_catpvf(sv, "CURLYM {%d,%d}", ARG1(o), ARG2(o));
2416 #ifdef REGALIGN_STRUCT
2417 sv_catpvf(sv, "CURLYN[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2419 sv_catpvf(sv, "CURLYN {%d,%d}", ARG1(o), ARG2(o));
2423 sv_catpvf(sv, "CURLYX {%d,%d}", ARG1(o), ARG2(o));
2426 sv_catpvf(sv, "REF%d", ARG(o));
2429 sv_catpvf(sv, "REFF%d", ARG(o));
2432 sv_catpvf(sv, "REFFL%d", ARG(o));
2435 sv_catpvf(sv, "OPEN%d", ARG(o));
2438 sv_catpvf(sv, "CLOSE%d", ARG(o));
2454 #ifdef REGALIGN_STRUCT
2455 sv_catpvf(sv, "UNLESSM[-%d]", o->flags);
2461 #ifdef REGALIGN_STRUCT
2462 sv_catpvf(sv, "IFMATCH[-%d]", o->flags);
2516 sv_catpvf(sv, "GROUPP%d", ARG(o));
2531 FAIL("corrupted regexp opcode");
2536 #endif /* DEBUGGING */
2539 pregfree(struct regexp *r)
2541 if (!r || (--r->refcnt > 0))
2544 Safefree(r->precomp);
2546 Safefree(r->subbase);
2547 if (r->anchored_substr)
2548 SvREFCNT_dec(r->anchored_substr);
2549 if (r->float_substr)
2550 SvREFCNT_dec(r->float_substr);
2552 int n = r->data->count;
2554 switch (r->data->what[n]) {
2556 SvREFCNT_dec((SV*)r->data->data[n]);
2559 op_free((OP_4tree*)r->data->data[n]);
2564 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
2567 Safefree(r->data->what);
2570 Safefree(r->startp);
2576 - regnext - dig the "next" pointer out of a node
2578 * [Note, when REGALIGN is defined there are two places in regmatch()
2579 * that bypass this code for speed.]
2582 regnext(register regnode *p)
2584 register I32 offset;
2589 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
2605 re_croak2(const char* pat1,const char* pat2,...)
2609 re_croak2(const char* pat1,const char* pat2, va_alist)
2616 STRLEN l1 = strlen(pat1);
2617 STRLEN l2 = strlen(pat2);
2625 Copy(pat1, buf, l1 , char);
2626 Copy(pat2, buf + l1, l2 , char);
2627 buf[l1 + l2 + 1] = '\n';
2628 buf[l1 + l2 + 2] = '\0';
2630 va_start(args, pat2);
2634 message = mess(buf, &args);
2636 l1 = strlen(message);
2639 Copy(message, buf, l1 , char);
2640 buf[l1] = '\0'; /* Overwrite \n */