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.
22 #ifdef PERL_EXT_RE_BUILD
23 /* need to replace pregcomp et al, so enable that */
24 # ifndef PERL_IN_XSUB_RE
25 # define PERL_IN_XSUB_RE
27 /* need access to debugger hooks */
33 #ifdef PERL_IN_XSUB_RE
34 /* We *really* need to overwrite these symbols: */
35 # define Perl_pregcomp my_regcomp
36 # define Perl_regdump my_regdump
37 # define Perl_regprop my_regprop
38 /* *These* symbols are masked to allow static link. */
39 # define Perl_pregfree my_regfree
40 # define Perl_regnext my_regnext
41 # define save_re_context my_save_re_context
46 * pregcomp and pregexec -- regsub and regerror are not used in perl
48 * Copyright (c) 1986 by University of Toronto.
49 * Written by Henry Spencer. Not derived from licensed software.
51 * Permission is granted to anyone to use this software for any
52 * purpose on any computer system, and to redistribute it freely,
53 * subject to the following restrictions:
55 * 1. The author is not responsible for the consequences of use of
56 * this software, no matter how awful, even if they arise
59 * 2. The origin of this software must not be misrepresented, either
60 * by explicit claim or by omission.
62 * 3. Altered versions must be plainly marked as such, and must not
63 * be misrepresented as being the original software.
66 **** Alterations to Henry's code are...
68 **** Copyright (c) 1991-1998, Larry Wall
70 **** You may distribute under the terms of either the GNU General Public
71 **** License or the Artistic License, as specified in the README file.
74 * Beware that some of this code is subtly aware of the way operator
75 * precedence is structured in regular expressions. Serious changes in
76 * regular-expression syntax might require a total rethink.
81 #ifndef PERL_IN_XSUB_RE
93 # if defined(BUGGY_MSC6)
94 /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */
95 # pragma optimize("a",off)
96 /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/
97 # pragma optimize("w",on )
98 # endif /* BUGGY_MSC6 */
102 #define STATIC static
105 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
106 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
107 ((*s) == '{' && regcurly(s)))
109 #define PERL_META "^$.[()|?+*\\"
111 #define META "^$.[()|?+*\\"
115 #undef SPSTART /* dratted cpp namespace... */
118 * Flags to be passed up and down.
120 #define WORST 0 /* Worst case. */
121 #define HASWIDTH 0x1 /* Known to match non-null strings. */
122 #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
123 #define SPSTART 0x4 /* Starts with * or +. */
124 #define TRYAGAIN 0x8 /* Weeded out a declaration. */
127 * Forward declarations for pregcomp()'s friends.
131 static regnode *reg _((I32, I32 *));
132 static regnode *reganode _((U8, U32));
133 static regnode *regatom _((I32 *));
134 static regnode *regbranch _((I32 *, I32));
135 static void regc _((U8, char *));
136 static void reguni _((UV, char *, I32*));
137 static regnode *regclass _((void));
138 static regnode *regclassutf8 _((void));
139 STATIC I32 regcurly _((char *));
140 static regnode *reg_node _((U8));
141 static regnode *regpiece _((I32 *));
142 static void reginsert _((U8, regnode *));
143 static void regoptail _((regnode *, regnode *));
144 static void regtail _((regnode *, regnode *));
145 static char* regwhite _((char *, char *));
146 static char* nextchar _((void));
147 static void re_croak2 _((const char* pat1,const char* pat2,...)) __attribute__((noreturn));
150 /* Length of a variant. */
156 I32 pos_min; /* CC */
157 I32 pos_delta; /* CC */
159 I32 last_end; /* min value, <0 unless valid. */
160 I32 last_start_min; /* CC */
161 I32 last_start_max; /* CC */
162 SV **longest; /* Either &l_fixed, or &l_float. */
164 I32 offset_fixed; /* CC */
166 I32 offset_float_min; /* CC */
167 I32 offset_float_max; /* CC */
172 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
174 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
175 #define SF_BEFORE_SEOL 0x1
176 #define SF_BEFORE_MEOL 0x2
177 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
178 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
181 # define SF_FIX_SHIFT_EOL (0+2)
182 # define SF_FL_SHIFT_EOL (0+4)
184 # define SF_FIX_SHIFT_EOL (+2)
185 # define SF_FL_SHIFT_EOL (+4)
188 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
189 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
191 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
192 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
193 #define SF_IS_INF 0x40
194 #define SF_HAS_PAR 0x80
195 #define SF_IN_PAR 0x100
196 #define SF_HAS_EVAL 0x200
197 #define SCF_DO_SUBSTR 0x400
200 #define UTF (PL_reg_flags & RF_utf8)
201 #define LOC (PL_regflags & PMf_LOCALE)
202 #define FOLD (PL_regflags & PMf_FOLD)
204 #define CHR_SVLEN(sv) (UTF ? sv_len_utf8(sv) : SvCUR(sv))
205 #define CHR_DIST(a,b) (UTF ? utf8_distance(a,b) : a - b)
208 scan_commit(scan_data_t *data)
211 STRLEN l = CHR_SVLEN(data->last_found);
212 STRLEN old_l = CHR_SVLEN(*data->longest);
214 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
215 sv_setsv(*data->longest, data->last_found);
216 if (*data->longest == data->longest_fixed) {
217 data->offset_fixed = l ? data->last_start_min : data->pos_min;
218 if (data->flags & SF_BEFORE_EOL)
220 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
222 data->flags &= ~SF_FIX_BEFORE_EOL;
225 data->offset_float_min = l ? data->last_start_min : data->pos_min;
226 data->offset_float_max = (l
227 ? data->last_start_max
228 : data->pos_min + data->pos_delta);
229 if (data->flags & SF_BEFORE_EOL)
231 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
233 data->flags &= ~SF_FL_BEFORE_EOL;
236 SvCUR_set(data->last_found, 0);
238 data->flags &= ~SF_BEFORE_EOL;
241 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
242 to the position after last scanned or to NULL. */
245 study_chunk(regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
246 /* scanp: Start here (read-write). */
247 /* deltap: Write maxlen-minlen here. */
248 /* last: Stop before this one. */
251 I32 min = 0, pars = 0, code;
252 regnode *scan = *scanp, *next;
254 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
255 int is_inf_internal = 0; /* The studied chunk is infinite */
256 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
257 scan_data_t data_fake;
259 while (scan && OP(scan) != END && scan < last) {
260 /* Peephole optimizer: */
262 if (regkind[(U8)OP(scan)] == EXACT) {
263 regnode *n = regnext(scan);
266 regnode *stop = scan;
269 next = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
270 /* Skip NOTHING, merge EXACT*. */
272 ( regkind[(U8)OP(n)] == NOTHING ||
273 (stringok && (OP(n) == OP(scan))))
275 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
276 if (OP(n) == TAIL || n > next)
278 if (regkind[(U8)OP(n)] == NOTHING) {
279 NEXT_OFF(scan) += NEXT_OFF(n);
280 next = n + NODE_STEP_REGNODE;
288 int oldl = *OPERAND(scan);
289 regnode *nnext = regnext(n);
291 if (oldl + *OPERAND(n) > U8_MAX)
293 NEXT_OFF(scan) += NEXT_OFF(n);
294 *OPERAND(scan) += *OPERAND(n);
295 next = n + (*OPERAND(n) + 2 - 1)/sizeof(regnode) + 2;
296 /* Now we can overwrite *n : */
297 Move(OPERAND(n) + 1, OPERAND(scan) + oldl + 1,
298 *OPERAND(n) + 1, char);
308 n = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
310 /* Purify reports a benign UMR here sometimes, because we
311 * don't initialize the OP() slot of a node when that node
312 * is occupied by just the trailing null of the string in
314 if (regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
323 if (OP(scan) != CURLYX) {
324 int max = (reg_off_by_arg[OP(scan)]
326 /* I32 may be smaller than U16 on CRAYs! */
327 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
328 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
332 /* Skip NOTHING and LONGJMP. */
333 while ((n = regnext(n))
334 && ((regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
335 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
338 if (reg_off_by_arg[OP(scan)])
341 NEXT_OFF(scan) = off;
343 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
344 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
345 next = regnext(scan);
348 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
349 I32 max1 = 0, min1 = I32_MAX, num = 0;
351 if (flags & SCF_DO_SUBSTR)
353 while (OP(scan) == code) {
354 I32 deltanext, minnext;
358 next = regnext(scan);
359 scan = NEXTOPER(scan);
361 scan = NEXTOPER(scan);
362 /* We suppose the run is continuous, last=next...*/
363 minnext = study_chunk(&scan, &deltanext, next,
367 if (max1 < minnext + deltanext)
368 max1 = minnext + deltanext;
369 if (deltanext == I32_MAX)
370 is_inf = is_inf_internal = 1;
372 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
374 if (data && (data_fake.flags & SF_HAS_EVAL))
375 data->flags |= SF_HAS_EVAL;
379 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
381 if (flags & SCF_DO_SUBSTR) {
382 data->pos_min += min1;
383 data->pos_delta += max1 - min1;
384 if (max1 != min1 || is_inf)
385 data->longest = &(data->longest_float);
388 delta += max1 - min1;
390 else if (code == BRANCHJ) /* single branch is optimized. */
391 scan = NEXTOPER(NEXTOPER(scan));
392 else /* single branch is optimized. */
393 scan = NEXTOPER(scan);
396 else if (OP(scan) == EXACT) {
397 I32 l = *OPERAND(scan);
399 unsigned char *s = (unsigned char *)(OPERAND(scan)+1);
400 unsigned char *e = s + l;
409 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
410 /* The code below prefers earlier match for fixed
411 offset, later match for variable offset. */
412 if (data->last_end == -1) { /* Update the start info. */
413 data->last_start_min = data->pos_min;
414 data->last_start_max = is_inf
415 ? I32_MAX : data->pos_min + data->pos_delta;
417 sv_catpvn(data->last_found, (char *)(OPERAND(scan)+1), *OPERAND(scan));
418 data->last_end = data->pos_min + l;
419 data->pos_min += l; /* As in the first entry. */
420 data->flags &= ~SF_BEFORE_EOL;
423 else if (regkind[(U8)OP(scan)] == EXACT) {
424 I32 l = *OPERAND(scan);
425 if (flags & SCF_DO_SUBSTR)
428 unsigned char *s = (unsigned char *)(OPERAND(scan)+1);
429 unsigned char *e = s + l;
438 if (data && (flags & SCF_DO_SUBSTR))
441 else if (strchr(varies,OP(scan))) {
442 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
443 regnode *oscan = scan;
445 switch (regkind[(U8)OP(scan)]) {
447 scan = NEXTOPER(scan);
450 if (flags & SCF_DO_SUBSTR) {
451 next = NEXTOPER(scan);
452 if (OP(next) == EXACT) {
454 maxcount = REG_INFTY;
455 next = regnext(scan);
456 scan = NEXTOPER(scan);
460 if (flags & SCF_DO_SUBSTR)
465 is_inf = is_inf_internal = 1;
466 scan = regnext(scan);
467 if (flags & SCF_DO_SUBSTR) {
469 data->longest = &(data->longest_float);
471 goto optimize_curly_tail;
473 mincount = ARG1(scan);
474 maxcount = ARG2(scan);
475 next = regnext(scan);
476 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
478 if (flags & SCF_DO_SUBSTR) {
479 if (mincount == 0) scan_commit(data);
480 pos_before = data->pos_min;
484 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
486 data->flags |= SF_IS_INF;
488 /* This will finish on WHILEM, setting scan, or on NULL: */
489 minnext = study_chunk(&scan, &deltanext, last, data,
491 ? (flags & ~SCF_DO_SUBSTR) : flags);
492 if (!scan) /* It was not CURLYX, but CURLY. */
494 if (ckWARN(WARN_UNSAFE) && (minnext + deltanext == 0)
495 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
496 && maxcount <= 10000) /* Complement check for big count */
497 warner(WARN_UNSAFE, "Strange *+?{} on zero-length expression");
498 min += minnext * mincount;
499 is_inf_internal |= (maxcount == REG_INFTY
500 && (minnext + deltanext) > 0
501 || deltanext == I32_MAX);
502 is_inf |= is_inf_internal;
503 delta += (minnext + deltanext) * maxcount - minnext * mincount;
505 /* Try powerful optimization CURLYX => CURLYN. */
506 if ( OP(oscan) == CURLYX && data
507 && data->flags & SF_IN_PAR
508 && !(data->flags & SF_HAS_EVAL)
509 && !deltanext && minnext == 1 ) {
510 /* Try to optimize to CURLYN. */
511 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
512 regnode *nxt1 = nxt, *nxt2;
516 if (!strchr(simple,OP(nxt))
517 && !(regkind[(U8)OP(nxt)] == EXACT
518 && *OPERAND(nxt) == 1))
522 if (OP(nxt) != CLOSE)
524 /* Now we know that nxt2 is the only contents: */
525 oscan->flags = ARG(nxt);
527 OP(nxt1) = NOTHING; /* was OPEN. */
529 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
530 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
531 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
532 OP(nxt) = OPTIMIZED; /* was CLOSE. */
533 OP(nxt + 1) = OPTIMIZED; /* was count. */
534 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
539 /* Try optimization CURLYX => CURLYM. */
540 if ( OP(oscan) == CURLYX && data
541 && !(data->flags & SF_HAS_PAR)
542 && !(data->flags & SF_HAS_EVAL)
544 /* XXXX How to optimize if data == 0? */
545 /* Optimize to a simpler form. */
546 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
550 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
551 && (OP(nxt2) != WHILEM))
553 OP(nxt2) = SUCCEED; /* Whas WHILEM */
554 /* Need to optimize away parenths. */
555 if (data->flags & SF_IN_PAR) {
556 /* Set the parenth number. */
557 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
559 if (OP(nxt) != CLOSE)
560 FAIL("panic opt close");
561 oscan->flags = ARG(nxt);
562 OP(nxt1) = OPTIMIZED; /* was OPEN. */
563 OP(nxt) = OPTIMIZED; /* was CLOSE. */
565 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
566 OP(nxt + 1) = OPTIMIZED; /* was count. */
567 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
568 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
571 while ( nxt1 && (OP(nxt1) != WHILEM)) {
572 regnode *nnxt = regnext(nxt1);
575 if (reg_off_by_arg[OP(nxt1)])
576 ARG_SET(nxt1, nxt2 - nxt1);
577 else if (nxt2 - nxt1 < U16_MAX)
578 NEXT_OFF(nxt1) = nxt2 - nxt1;
580 OP(nxt) = NOTHING; /* Cannot beautify */
585 /* Optimize again: */
586 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
591 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
593 if (flags & SCF_DO_SUBSTR) {
594 SV *last_str = Nullsv;
595 int counted = mincount != 0;
597 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
598 I32 b = pos_before >= data->last_start_min
599 ? pos_before : data->last_start_min;
601 char *s = SvPV(data->last_found, l);
602 I32 old = b - data->last_start_min;
605 old = utf8_hop((U8*)s, old) - (U8*)s;
608 /* Get the added string: */
609 last_str = newSVpv(s + old, l);
610 if (deltanext == 0 && pos_before == b) {
611 /* What was added is a constant string */
613 SvGROW(last_str, (mincount * l) + 1);
614 repeatcpy(SvPVX(last_str) + l,
615 SvPVX(last_str), l, mincount - 1);
616 SvCUR(last_str) *= mincount;
617 /* Add additional parts. */
618 SvCUR_set(data->last_found,
619 SvCUR(data->last_found) - l);
620 sv_catsv(data->last_found, last_str);
621 data->last_end += l * (mincount - 1);
625 /* It is counted once already... */
626 data->pos_min += minnext * (mincount - counted);
627 data->pos_delta += - counted * deltanext +
628 (minnext + deltanext) * maxcount - minnext * mincount;
629 if (mincount != maxcount) {
631 if (mincount && last_str) {
632 sv_setsv(data->last_found, last_str);
633 data->last_end = data->pos_min;
634 data->last_start_min =
635 data->pos_min - CHR_SVLEN(last_str);
636 data->last_start_max = is_inf
638 : data->pos_min + data->pos_delta
639 - CHR_SVLEN(last_str);
641 data->longest = &(data->longest_float);
643 SvREFCNT_dec(last_str);
645 if (data && (fl & SF_HAS_EVAL))
646 data->flags |= SF_HAS_EVAL;
648 if (OP(oscan) != CURLYX) {
649 while (regkind[(U8)OP(next = regnext(oscan))] == NOTHING
651 NEXT_OFF(oscan) += NEXT_OFF(next);
654 default: /* REF only? */
655 if (flags & SCF_DO_SUBSTR) {
657 data->longest = &(data->longest_float);
659 is_inf = is_inf_internal = 1;
663 else if (strchr(simple,OP(scan)) || regkind[(U8)OP(scan)] == ANYUTF8) {
664 if (flags & SCF_DO_SUBSTR) {
670 else if (regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
671 data->flags |= (OP(scan) == MEOL
675 else if (regkind[(U8)OP(scan)] == BRANCHJ
676 && (scan->flags || data)
677 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
678 I32 deltanext, minnext;
682 next = regnext(scan);
683 nscan = NEXTOPER(NEXTOPER(scan));
684 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, 0);
687 FAIL("variable length lookbehind not implemented");
689 else if (minnext > U8_MAX) {
690 FAIL2("lookbehind longer than %d not implemented", U8_MAX);
692 scan->flags = minnext;
694 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
696 if (data && (data_fake.flags & SF_HAS_EVAL))
697 data->flags |= SF_HAS_EVAL;
699 else if (OP(scan) == OPEN) {
702 else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
703 next = regnext(scan);
705 if ( next && (OP(next) != WHILEM) && next < last)
706 is_par = 0; /* Disable optimization */
708 else if (OP(scan) == EVAL) {
710 data->flags |= SF_HAS_EVAL;
712 else if (OP(scan) == LOGICAL && scan->flags == 2) { /* Embedded */
713 if (flags & SCF_DO_SUBSTR) {
715 data->longest = &(data->longest_float);
717 is_inf = is_inf_internal = 1;
719 /* Else: zero-length, ignore. */
720 scan = regnext(scan);
725 *deltap = is_inf_internal ? I32_MAX : delta;
726 if (flags & SCF_DO_SUBSTR && is_inf)
727 data->pos_delta = I32_MAX - data->pos_min;
730 if (is_par && pars==1 && data) {
731 data->flags |= SF_IN_PAR;
732 data->flags &= ~SF_HAS_PAR;
734 else if (pars && data) {
735 data->flags |= SF_HAS_PAR;
736 data->flags &= ~SF_IN_PAR;
742 add_data(I32 n, char *s)
745 if (PL_regcomp_rx->data) {
746 Renewc(PL_regcomp_rx->data,
747 sizeof(*PL_regcomp_rx->data) + sizeof(void*) * (PL_regcomp_rx->data->count + n - 1),
748 char, struct reg_data);
749 Renew(PL_regcomp_rx->data->what, PL_regcomp_rx->data->count + n, U8);
750 PL_regcomp_rx->data->count += n;
753 Newc(1207, PL_regcomp_rx->data, sizeof(*PL_regcomp_rx->data) + sizeof(void*) * (n - 1),
754 char, struct reg_data);
755 New(1208, PL_regcomp_rx->data->what, n, U8);
756 PL_regcomp_rx->data->count = n;
758 Copy(s, PL_regcomp_rx->data->what + PL_regcomp_rx->data->count - n, n, U8);
759 return PL_regcomp_rx->data->count - n;
763 - pregcomp - compile a regular expression into internal code
765 * We can't allocate space until we know how big the compiled form will be,
766 * but we can't compile it (and thus know how big it is) until we've got a
767 * place to put the code. So we cheat: we compile it twice, once with code
768 * generation turned off and size counting turned on, and once "for real".
769 * This also means that we don't allocate space until we are sure that the
770 * thing really will compile successfully, and we never have to move the
771 * code and thus invalidate pointers into it. (Note that it has to be in
772 * one piece because free() must be able to free it all.) [NB: not true in perl]
774 * Beware that the optimization-preparation code in here knows about some
775 * of the structure of the compiled regexp. [I'll say.]
778 pregcomp(char *exp, char *xend, PMOP *pm)
793 FAIL("NULL regexp argument");
795 if (PL_curcop == &compiling ? (PL_hints & HINT_UTF8) : IN_UTF8)
796 PL_reg_flags |= RF_utf8;
800 PL_regprecomp = savepvn(exp, xend - exp);
804 char *s = PerlEnv_getenv("PERL_RE_COLORS");
807 PL_colors[0] = s = savepv(s);
824 DEBUG_r(PerlIO_printf(Perl_debug_log, "%sCompiling%s RE `%s%*s%s'\n",
825 PL_colors[4],PL_colors[5],PL_colors[0],
826 xend - exp, PL_regprecomp, PL_colors[1]));
827 PL_regflags = pm->op_pmflags;
831 PL_seen_zerolen = *exp == '^' ? -1 : 0;
835 /* First pass: determine size, legality. */
836 PL_regcomp_parse = exp;
841 PL_regcode = &PL_regdummy;
842 regc((U8)MAGIC, (char*)PL_regcode);
843 if (reg(0, &flags) == NULL) {
844 Safefree(PL_regprecomp);
845 PL_regprecomp = Nullch;
848 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %d ", PL_regsize));
850 /* Small enough for pointer-storage convention?
851 If extralen==0, this means that we will not need long jumps. */
852 if (PL_regsize >= 0x10000L && PL_extralen)
853 PL_regsize += PL_extralen;
857 /* Allocate space and initialize. */
858 Newc(1001, r, sizeof(regexp) + (unsigned)PL_regsize * sizeof(regnode),
861 FAIL("regexp out of space");
863 r->prelen = xend - exp;
864 r->precomp = PL_regprecomp;
865 r->subbeg = r->subbase = NULL;
866 r->nparens = PL_regnpar - 1; /* set early to validate backrefs */
869 /* Second pass: emit code. */
870 PL_regcomp_parse = exp;
874 PL_regcode = r->program;
875 /* Store the count of eval-groups for security checks: */
876 PL_regcode->next_off = ((PL_seen_evals > U16_MAX) ? U16_MAX : PL_seen_evals);
877 regc((U8)MAGIC, (char*) PL_regcode++);
879 if (reg(0, &flags) == NULL)
882 /* Dig out information for optimizations. */
883 r->reganch = pm->op_pmflags & PMf_COMPILETIME;
884 pm->op_pmflags = PL_regflags;
886 r->reganch |= ROPT_UTF8;
887 r->regstclass = NULL;
888 if (PL_regnaughty >= 10) /* Probably an expensive pattern. */
889 r->reganch |= ROPT_NAUGHTY;
890 scan = r->program + 1; /* First BRANCH. */
892 /* XXXX To minimize changes to RE engine we always allocate
893 3-units-long substrs field. */
894 Newz(1004, r->substrs, 1, struct reg_substr_data);
896 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
899 STRLEN longest_float_length, longest_fixed_length;
901 StructCopy(&zero_scan_data, &data, scan_data_t);
903 /* Skip introductions and multiplicators >= 1. */
904 while ((OP(first) == OPEN && (sawopen = 1)) ||
905 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
906 (OP(first) == PLUS) ||
907 (OP(first) == MINMOD) ||
908 (regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
909 if (OP(first) == PLUS)
912 first += regarglen[(U8)OP(first)];
913 first = NEXTOPER(first);
916 /* Starting-point info. */
918 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
919 else if (strchr(simple+4,OP(first)))
920 r->regstclass = first;
921 else if (regkind[(U8)OP(first)] == BOUND ||
922 regkind[(U8)OP(first)] == NBOUND)
923 r->regstclass = first;
924 else if (regkind[(U8)OP(first)] == BOL) {
925 r->reganch |= (OP(first) == MBOL ? ROPT_ANCH_MBOL: ROPT_ANCH_BOL);
926 first = NEXTOPER(first);
929 else if (OP(first) == GPOS) {
930 r->reganch |= ROPT_ANCH_GPOS;
931 first = NEXTOPER(first);
934 else if ((OP(first) == STAR &&
935 regkind[(U8)OP(NEXTOPER(first))] == ANY) &&
936 !(r->reganch & ROPT_ANCH) )
938 /* turn .* into ^.* with an implied $*=1 */
939 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
940 first = NEXTOPER(first);
943 if (sawplus && (!sawopen || !PL_regsawback))
944 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
946 /* Scan is after the zeroth branch, first is atomic matcher. */
947 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
950 * If there's something expensive in the r.e., find the
951 * longest literal string that must appear and make it the
952 * regmust. Resolve ties in favor of later strings, since
953 * the regstart check works with the beginning of the r.e.
954 * and avoiding duplication strengthens checking. Not a
955 * strong reason, but sufficient in the absence of others.
956 * [Now we resolve ties in favor of the earlier string if
957 * it happens that c_offset_min has been invalidated, since the
958 * earlier string may buy us something the later one won't.]
962 data.longest_fixed = newSVpv("",0);
963 data.longest_float = newSVpv("",0);
964 data.last_found = newSVpv("",0);
965 data.longest = &(data.longest_fixed);
968 minlen = study_chunk(&first, &fake, scan + PL_regsize, /* Up to end */
969 &data, SCF_DO_SUBSTR);
970 if ( PL_regnpar == 1 && data.longest == &(data.longest_fixed)
971 && data.last_start_min == 0 && data.last_end > 0
973 && (!(PL_regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
974 r->reganch |= ROPT_CHECK_ALL;
976 SvREFCNT_dec(data.last_found);
978 longest_float_length = CHR_SVLEN(data.longest_float);
979 if (longest_float_length
980 || (data.flags & SF_FL_BEFORE_EOL
981 && (!(data.flags & SF_FL_BEFORE_MEOL)
982 || (PL_regflags & PMf_MULTILINE)))) {
983 if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */
984 && data.offset_fixed == data.offset_float_min
985 && SvCUR(data.longest_fixed) == SvCUR(data.longest_float))
986 goto remove_float; /* As in (a)+. */
988 r->float_substr = data.longest_float;
989 r->float_min_offset = data.offset_float_min;
990 r->float_max_offset = data.offset_float_max;
991 fbm_compile(r->float_substr, 0);
992 BmUSEFUL(r->float_substr) = 100;
993 if (data.flags & SF_FL_BEFORE_EOL /* Cannot have SEOL and MULTI */
994 && (!(data.flags & SF_FL_BEFORE_MEOL)
995 || (PL_regflags & PMf_MULTILINE)))
996 SvTAIL_on(r->float_substr);
1000 r->float_substr = Nullsv;
1001 SvREFCNT_dec(data.longest_float);
1002 longest_float_length = 0;
1005 longest_fixed_length = CHR_SVLEN(data.longest_fixed);
1006 if (longest_fixed_length
1007 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
1008 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1009 || (PL_regflags & PMf_MULTILINE)))) {
1010 r->anchored_substr = data.longest_fixed;
1011 r->anchored_offset = data.offset_fixed;
1012 fbm_compile(r->anchored_substr, 0);
1013 BmUSEFUL(r->anchored_substr) = 100;
1014 if (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
1015 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1016 || (PL_regflags & PMf_MULTILINE)))
1017 SvTAIL_on(r->anchored_substr);
1020 r->anchored_substr = Nullsv;
1021 SvREFCNT_dec(data.longest_fixed);
1022 longest_fixed_length = 0;
1025 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
1026 if (longest_fixed_length > longest_float_length) {
1027 r->check_substr = r->anchored_substr;
1028 r->check_offset_min = r->check_offset_max = r->anchored_offset;
1029 if (r->reganch & ROPT_ANCH_SINGLE)
1030 r->reganch |= ROPT_NOSCAN;
1033 r->check_substr = r->float_substr;
1034 r->check_offset_min = data.offset_float_min;
1035 r->check_offset_max = data.offset_float_max;
1039 /* Several toplevels. Best we can is to set minlen. */
1042 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
1043 scan = r->program + 1;
1044 minlen = study_chunk(&scan, &fake, scan + PL_regsize, NULL, 0);
1045 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
1049 if (PL_regseen & REG_SEEN_GPOS)
1050 r->reganch |= ROPT_GPOS_SEEN;
1051 if (PL_regseen & REG_SEEN_LOOKBEHIND)
1052 r->reganch |= ROPT_LOOKBEHIND_SEEN;
1053 if (PL_regseen & REG_SEEN_EVAL)
1054 r->reganch |= ROPT_EVAL_SEEN;
1055 Newz(1002, r->startp, PL_regnpar, char*);
1056 Newz(1002, r->endp, PL_regnpar, char*);
1057 DEBUG_r(regdump(r));
1062 - reg - regular expression, i.e. main body or parenthesized thing
1064 * Caller must absorb opening parenthesis.
1066 * Combining parenthesis handling with the base level of regular expression
1067 * is a trifle forced, but the need to tie the tails of the branches to what
1068 * follows makes it hard to avoid.
1071 reg(I32 paren, I32 *flagp)
1072 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
1075 register regnode *ret; /* Will be the head of the group. */
1076 register regnode *br;
1077 register regnode *lastbr;
1078 register regnode *ender = 0;
1079 register I32 parno = 0;
1080 I32 flags, oregflags = PL_regflags, have_branch = 0, open = 0;
1083 *flagp = 0; /* Tentatively. */
1085 /* Make an OPEN node, if parenthesized. */
1087 if (*PL_regcomp_parse == '?') {
1088 U16 posflags = 0, negflags = 0;
1089 U16 *flagsp = &posflags;
1093 paren = *PL_regcomp_parse++;
1094 ret = NULL; /* For look-ahead/behind. */
1097 PL_regseen |= REG_SEEN_LOOKBEHIND;
1098 if (*PL_regcomp_parse == '!')
1100 if (*PL_regcomp_parse != '=' && *PL_regcomp_parse != '!')
1111 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1114 while (*PL_regcomp_parse && *PL_regcomp_parse != ')')
1116 if (*PL_regcomp_parse != ')')
1117 FAIL("Sequence (?#... not terminated");
1123 paren = *PL_regcomp_parse++;
1128 I32 count = 1, n = 0;
1130 char *s = PL_regcomp_parse;
1132 OP_4tree *sop, *rop;
1135 PL_regseen |= REG_SEEN_EVAL;
1136 while (count && (c = *PL_regcomp_parse)) {
1137 if (c == '\\' && PL_regcomp_parse[1])
1145 if (*PL_regcomp_parse != ')')
1146 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1150 if (PL_regcomp_parse - 1 - s)
1151 sv = newSVpv(s, PL_regcomp_parse - 1 - s);
1153 sv = newSVpv("", 0);
1155 rop = sv_compile_2op(sv, &sop, "re", &av);
1157 n = add_data(3, "nso");
1158 PL_regcomp_rx->data->data[n] = (void*)rop;
1159 PL_regcomp_rx->data->data[n+1] = (void*)av;
1160 PL_regcomp_rx->data->data[n+2] = (void*)sop;
1163 else { /* First pass */
1164 if (PL_reginterp_cnt < ++PL_seen_evals && PL_curcop != &compiling)
1165 /* No compiled RE interpolated, has runtime
1166 components ===> unsafe. */
1167 FAIL("Eval-group not allowed at runtime, use re 'eval'");
1169 FAIL("Eval-group in insecure regular expression");
1174 ret = reg_node(LOGICAL);
1177 regtail(ret, reganode(EVAL, n));
1180 return reganode(EVAL, n);
1184 if (PL_regcomp_parse[0] == '?') {
1185 if (PL_regcomp_parse[1] == '=' || PL_regcomp_parse[1] == '!'
1186 || PL_regcomp_parse[1] == '<'
1187 || PL_regcomp_parse[1] == '{') { /* Lookahead or eval. */
1190 ret = reg_node(LOGICAL);
1193 regtail(ret, reg(1, &flag));
1197 else if (PL_regcomp_parse[0] >= '1' && PL_regcomp_parse[0] <= '9' ) {
1198 parno = atoi(PL_regcomp_parse++);
1200 while (isDIGIT(*PL_regcomp_parse))
1202 ret = reganode(GROUPP, parno);
1203 if ((c = *nextchar()) != ')')
1204 FAIL2("Switch (?(number%c not recognized", c);
1206 regtail(ret, reganode(IFTHEN, 0));
1207 br = regbranch(&flags, 1);
1209 br = reganode(LONGJMP, 0);
1211 regtail(br, reganode(LONGJMP, 0));
1214 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1215 regbranch(&flags, 1);
1216 regtail(ret, lastbr);
1222 FAIL("Switch (?(condition)... contains too many branches");
1223 ender = reg_node(TAIL);
1226 regtail(lastbr, ender);
1227 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1230 regtail(ret, ender);
1234 FAIL2("Unknown condition for (?(%.2s", PL_regcomp_parse);
1238 FAIL("Sequence (? incomplete");
1243 while (*PL_regcomp_parse && strchr("iogcmsx", *PL_regcomp_parse)) {
1244 if (*PL_regcomp_parse != 'o')
1245 pmflag(flagsp, *PL_regcomp_parse);
1248 if (*PL_regcomp_parse == '-') {
1253 PL_regflags |= posflags;
1254 PL_regflags &= ~negflags;
1255 if (*PL_regcomp_parse == ':') {
1261 if (*PL_regcomp_parse != ')')
1262 FAIL2("Sequence (?%c...) not recognized", *PL_regcomp_parse);
1271 ret = reganode(OPEN, parno);
1278 /* Pick up the branches, linking them together. */
1279 br = regbranch(&flags, 1);
1282 if (*PL_regcomp_parse == '|') {
1283 if (!SIZE_ONLY && PL_extralen) {
1284 reginsert(BRANCHJ, br);
1287 reginsert(BRANCH, br);
1290 PL_extralen += 1; /* For BRANCHJ-BRANCH. */
1292 else if (paren == ':') {
1293 *flagp |= flags&SIMPLE;
1295 if (open) { /* Starts with OPEN. */
1296 regtail(ret, br); /* OPEN -> first. */
1298 else if (paren != '?') /* Not Conditional */
1302 *flagp |= flags&SPSTART;
1304 while (*PL_regcomp_parse == '|') {
1305 if (!SIZE_ONLY && PL_extralen) {
1306 ender = reganode(LONGJMP,0);
1307 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1310 PL_extralen += 2; /* Account for LONGJMP. */
1312 br = regbranch(&flags, 0);
1315 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1319 *flagp |= flags&SPSTART;
1322 if (have_branch || paren != ':') {
1323 /* Make a closing node, and hook it on the end. */
1326 ender = reg_node(TAIL);
1329 ender = reganode(CLOSE, parno);
1335 *flagp &= ~HASWIDTH;
1338 ender = reg_node(SUCCEED);
1341 ender = reg_node(END);
1344 regtail(lastbr, ender);
1347 /* Hook the tails of the branches to the closing node. */
1348 for (br = ret; br != NULL; br = regnext(br)) {
1349 regoptail(br, ender);
1356 static char parens[] = "=!<,>";
1358 if (paren && (p = strchr(parens, paren))) {
1359 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1360 int flag = (p - parens) > 1;
1363 node = SUSPEND, flag = 0;
1364 reginsert(node,ret);
1366 regtail(ret, reg_node(TAIL));
1370 /* Check for proper termination. */
1371 if (paren && (PL_regcomp_parse >= PL_regxend || *nextchar() != ')')) {
1372 FAIL("unmatched () in regexp");
1374 else if (!paren && PL_regcomp_parse < PL_regxend) {
1375 if (*PL_regcomp_parse == ')') {
1376 FAIL("unmatched () in regexp");
1379 FAIL("junk on end of regexp"); /* "Can't happen". */
1383 PL_regflags = oregflags;
1390 - regbranch - one alternative of an | operator
1392 * Implements the concatenation operator.
1395 regbranch(I32 *flagp, I32 first)
1398 register regnode *ret;
1399 register regnode *chain = NULL;
1400 register regnode *latest;
1401 I32 flags = 0, c = 0;
1406 if (!SIZE_ONLY && PL_extralen)
1407 ret = reganode(BRANCHJ,0);
1409 ret = reg_node(BRANCH);
1412 if (!first && SIZE_ONLY)
1413 PL_extralen += 1; /* BRANCHJ */
1415 *flagp = WORST; /* Tentatively. */
1419 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '|' && *PL_regcomp_parse != ')') {
1421 latest = regpiece(&flags);
1422 if (latest == NULL) {
1423 if (flags & TRYAGAIN)
1427 else if (ret == NULL)
1429 *flagp |= flags&HASWIDTH;
1430 if (chain == NULL) /* First piece. */
1431 *flagp |= flags&SPSTART;
1434 regtail(chain, latest);
1439 if (chain == NULL) { /* Loop ran zero times. */
1440 chain = reg_node(NOTHING);
1445 *flagp |= flags&SIMPLE;
1452 - regpiece - something followed by possible [*+?]
1454 * Note that the branching code sequences used for ? and the general cases
1455 * of * and + are somewhat optimized: they use the same NOTHING node as
1456 * both the endmarker for their branch list and the body of the last branch.
1457 * It might seem that this node could be dispensed with entirely, but the
1458 * endmarker role is not redundant.
1461 regpiece(I32 *flagp)
1464 register regnode *ret;
1466 register char *next;
1468 char *origparse = PL_regcomp_parse;
1471 I32 max = REG_INFTY;
1473 ret = regatom(&flags);
1475 if (flags & TRYAGAIN)
1480 op = *PL_regcomp_parse;
1482 if (op == '{' && regcurly(PL_regcomp_parse)) {
1483 next = PL_regcomp_parse + 1;
1485 while (isDIGIT(*next) || *next == ',') {
1494 if (*next == '}') { /* got one */
1498 min = atoi(PL_regcomp_parse);
1502 maxpos = PL_regcomp_parse;
1504 if (!max && *maxpos != '0')
1505 max = REG_INFTY; /* meaning "infinity" */
1506 else if (max >= REG_INFTY)
1507 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
1508 PL_regcomp_parse = next;
1512 if ((flags&SIMPLE)) {
1513 PL_regnaughty += 2 + PL_regnaughty / 2;
1514 reginsert(CURLY, ret);
1517 PL_regnaughty += 4 + PL_regnaughty; /* compound interest */
1518 regtail(ret, reg_node(WHILEM));
1519 if (!SIZE_ONLY && PL_extralen) {
1520 reginsert(LONGJMP,ret);
1521 reginsert(NOTHING,ret);
1522 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1524 reginsert(CURLYX,ret);
1525 if (!SIZE_ONLY && PL_extralen)
1526 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1527 regtail(ret, reg_node(NOTHING));
1537 if (max && max < min)
1538 FAIL("Can't do {n,m} with n > m");
1553 #if 0 /* Now runtime fix should be reliable. */
1554 if (!(flags&HASWIDTH) && op != '?')
1555 FAIL("regexp *+ operand could be empty");
1560 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
1562 if (op == '*' && (flags&SIMPLE)) {
1563 reginsert(STAR, ret);
1567 else if (op == '*') {
1571 else if (op == '+' && (flags&SIMPLE)) {
1572 reginsert(PLUS, ret);
1576 else if (op == '+') {
1580 else if (op == '?') {
1585 if (ckWARN(WARN_UNSAFE) && !SIZE_ONLY && !(flags&HASWIDTH) && max > 10000) {
1586 warner(WARN_UNSAFE, "%.*s matches null string many times",
1587 PL_regcomp_parse - origparse, origparse);
1590 if (*PL_regcomp_parse == '?') {
1592 reginsert(MINMOD, ret);
1593 regtail(ret, ret + NODE_STEP_REGNODE);
1595 if (ISMULT2(PL_regcomp_parse))
1596 FAIL("nested *?+ in regexp");
1602 - regatom - the lowest level
1604 * Optimization: gobbles an entire sequence of ordinary characters so that
1605 * it can turn them into a single node, which is smaller to store and
1606 * faster to run. Backslashed characters are exceptions, each becoming a
1607 * separate node; the code is simpler that way and it's not worth fixing.
1609 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1615 register regnode *ret = 0;
1618 *flagp = WORST; /* Tentatively. */
1621 switch (*PL_regcomp_parse) {
1625 if (PL_regflags & PMf_MULTILINE)
1626 ret = reg_node(MBOL);
1627 else if (PL_regflags & PMf_SINGLELINE)
1628 ret = reg_node(SBOL);
1630 ret = reg_node(BOL);
1633 if (PL_regcomp_parse[1])
1636 if (PL_regflags & PMf_MULTILINE)
1637 ret = reg_node(MEOL);
1638 else if (PL_regflags & PMf_SINGLELINE)
1639 ret = reg_node(SEOL);
1641 ret = reg_node(EOL);
1646 if (PL_regflags & PMf_SINGLELINE)
1647 ret = reg_node(SANYUTF8);
1649 ret = reg_node(ANYUTF8);
1653 if (PL_regflags & PMf_SINGLELINE)
1654 ret = reg_node(SANY);
1656 ret = reg_node(ANY);
1657 *flagp |= HASWIDTH|SIMPLE;
1663 ret = (UTF ? regclassutf8() : regclass());
1664 if (*PL_regcomp_parse != ']')
1665 FAIL("unmatched [] in regexp");
1667 *flagp |= HASWIDTH|SIMPLE;
1671 ret = reg(1, &flags);
1673 if (flags & TRYAGAIN)
1677 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
1681 if (flags & TRYAGAIN) {
1685 FAIL2("internal urp in regexp at /%s/", PL_regcomp_parse);
1686 /* Supposed to be caught earlier. */
1689 if (!regcurly(PL_regcomp_parse)) {
1697 FAIL("?+*{} follows nothing in regexp");
1700 switch (*++PL_regcomp_parse) {
1703 ret = reg_node(SBOL);
1708 ret = reg_node(GPOS);
1709 PL_regseen |= REG_SEEN_GPOS;
1714 ret = reg_node(SEOL);
1719 ret = reg_node(EOS);
1721 PL_seen_zerolen++; /* Do not optimize RE away */
1725 ret = reg_node(SANY);
1726 *flagp |= HASWIDTH|SIMPLE;
1730 ret = reg_node(CLUMP);
1733 if (UTF && !PL_utf8_mark)
1734 is_utf8_mark((U8*)"~"); /* preload table */
1739 ? (LOC ? ALNUMLUTF8 : ALNUMUTF8)
1740 : (LOC ? ALNUML : ALNUM));
1741 *flagp |= HASWIDTH|SIMPLE;
1743 if (UTF && !PL_utf8_alnum)
1744 is_utf8_alnum((U8*)"a"); /* preload table */
1749 ? (LOC ? NALNUMLUTF8 : NALNUMUTF8)
1750 : (LOC ? NALNUML : NALNUM));
1751 *flagp |= HASWIDTH|SIMPLE;
1753 if (UTF && !PL_utf8_alnum)
1754 is_utf8_alnum((U8*)"a"); /* preload table */
1760 ? (LOC ? BOUNDLUTF8 : BOUNDUTF8)
1761 : (LOC ? BOUNDL : BOUND));
1764 if (UTF && !PL_utf8_alnum)
1765 is_utf8_alnum((U8*)"a"); /* preload table */
1771 ? (LOC ? NBOUNDLUTF8 : NBOUNDUTF8)
1772 : (LOC ? NBOUNDL : NBOUND));
1775 if (UTF && !PL_utf8_alnum)
1776 is_utf8_alnum((U8*)"a"); /* preload table */
1781 ? (LOC ? SPACELUTF8 : SPACEUTF8)
1782 : (LOC ? SPACEL : SPACE));
1783 *flagp |= HASWIDTH|SIMPLE;
1785 if (UTF && !PL_utf8_space)
1786 is_utf8_space((U8*)" "); /* preload table */
1791 ? (LOC ? NSPACELUTF8 : NSPACEUTF8)
1792 : (LOC ? NSPACEL : NSPACE));
1793 *flagp |= HASWIDTH|SIMPLE;
1795 if (UTF && !PL_utf8_space)
1796 is_utf8_space((U8*)" "); /* preload table */
1799 ret = reg_node(UTF ? DIGITUTF8 : DIGIT);
1800 *flagp |= HASWIDTH|SIMPLE;
1802 if (UTF && !PL_utf8_digit)
1803 is_utf8_digit((U8*)"1"); /* preload table */
1806 ret = reg_node(UTF ? NDIGITUTF8 : NDIGIT);
1807 *flagp |= HASWIDTH|SIMPLE;
1809 if (UTF && !PL_utf8_digit)
1810 is_utf8_digit((U8*)"1"); /* preload table */
1814 { /* a lovely hack--pretend we saw [\pX] instead */
1815 char* oldregxend = PL_regxend;
1817 if (PL_regcomp_parse[1] == '{') {
1818 PL_regxend = strchr(PL_regcomp_parse, '}');
1820 FAIL("Missing right brace on \\p{}");
1824 PL_regxend = PL_regcomp_parse + 2;
1827 ret = regclassutf8();
1829 PL_regxend = oldregxend;
1832 *flagp |= HASWIDTH|SIMPLE;
1845 case '1': case '2': case '3': case '4':
1846 case '5': case '6': case '7': case '8': case '9':
1848 I32 num = atoi(PL_regcomp_parse);
1850 if (num > 9 && num >= PL_regnpar)
1853 if (!SIZE_ONLY && num > PL_regcomp_rx->nparens)
1854 FAIL("reference to nonexistent group");
1857 ? (LOC ? REFFL : REFF)
1860 while (isDIGIT(*PL_regcomp_parse))
1868 if (PL_regcomp_parse >= PL_regxend)
1869 FAIL("trailing \\ in regexp");
1877 if (PL_regflags & PMf_EXTENDED) {
1878 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '\n') PL_regcomp_parse++;
1879 if (PL_regcomp_parse < PL_regxend)
1895 ? (LOC ? EXACTFL : EXACTF)
1897 s = (char *) OPERAND(ret);
1898 regc(0, s++); /* save spot for len */
1899 for (len = 0, p = PL_regcomp_parse - 1;
1900 len < 127 && p < PL_regxend;
1905 if (PL_regflags & PMf_EXTENDED)
1906 p = regwhite(p, PL_regxend);
1960 char* e = strchr(p, '}');
1963 FAIL("Missing right brace on \\x{}");
1965 ender = scan_hex(p + 1, e - p, &numlen);
1966 if (numlen + len >= 127) { /* numlen is generous */
1973 FAIL("Can't use \\x{} without 'use utf8' declaration");
1976 ender = scan_hex(p, 2, &numlen);
1982 ender = UCHARAT(p++);
1983 ender = toCTRL(ender);
1985 case '0': case '1': case '2': case '3':case '4':
1986 case '5': case '6': case '7': case '8':case '9':
1988 (isDIGIT(p[1]) && atoi(p) >= PL_regnpar) ) {
1989 ender = scan_oct(p, 3, &numlen);
1998 if (p >= PL_regxend)
1999 FAIL("trailing \\ in regexp");
2002 goto normal_default;
2007 if ((*p & 0xc0) == 0xc0 && UTF) {
2008 ender = utf8_to_uv((U8*)p, &numlen);
2015 if (PL_regflags & PMf_EXTENDED)
2016 p = regwhite(p, PL_regxend);
2019 ender = toLOWER_LC_uni(ender);
2021 ender = toLOWER_uni(ender);
2023 if (ISMULT2(p)) { /* Back off on ?+*. */
2026 else if (ender >= 0x80 && UTF) {
2027 reguni(ender, s, &numlen);
2037 if (ender >= 0x80 && UTF) {
2038 reguni(ender, s, &numlen);
2046 PL_regcomp_parse = p - 1;
2049 FAIL("internal disaster in regexp");
2055 *OPERAND(ret) = len;
2058 PL_regsize += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2061 PL_regcode += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2071 regwhite(char *p, char *e)
2076 else if (*p == '#') {
2079 } while (p < e && *p != '\n');
2091 register char *opnd, *s;
2093 register I32 lastvalue = 1234;
2094 register I32 range = 0;
2095 register regnode *ret;
2099 s = opnd = (char *) OPERAND(PL_regcode);
2100 ret = reg_node(ANYOF);
2101 for (value = 0; value < 33; value++)
2103 if (*PL_regcomp_parse == '^') { /* Complement of range. */
2107 *opnd |= ANYOF_INVERT;
2110 PL_regcode += ANY_SKIP;
2112 *opnd |= ANYOF_FOLD;
2114 *opnd |= ANYOF_LOCALE;
2117 PL_regsize += ANY_SKIP;
2119 if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-')
2120 goto skipcond; /* allow 1st char to be ] or - */
2121 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') {
2123 value = UCHARAT(PL_regcomp_parse++);
2124 if (value == '[' && PL_regcomp_parse + 1 < PL_regxend &&
2125 /* I smell either [: or [= or [. -- POSIX has been here, right? */
2126 (*PL_regcomp_parse == ':' || *PL_regcomp_parse == '=' || *PL_regcomp_parse == '.')) {
2127 char posixccc = *PL_regcomp_parse;
2128 char* posixccs = PL_regcomp_parse++;
2130 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != posixccc)
2132 if (PL_regcomp_parse == PL_regxend)
2133 /* Grandfather lone [:, [=, [. */
2134 PL_regcomp_parse = posixccs;
2136 PL_regcomp_parse++; /* skip over the posixccc */
2137 if (*PL_regcomp_parse == ']') {
2138 /* Not Implemented Yet.
2139 * (POSIX Extended Character Classes, that is)
2140 * The text between e.g. [: and :] would start
2141 * at posixccs + 1 and stop at regcomp_parse - 2. */
2142 if (ckWARN(WARN_UNSAFE) && !SIZE_ONLY)
2144 "Character class syntax [%c %c] is reserved for future extensions", posixccc, posixccc);
2145 PL_regcomp_parse++; /* skip over the ending ] */
2149 if (value == '\\') {
2150 value = UCHARAT(PL_regcomp_parse++);
2155 *opnd |= ANYOF_ALNUML;
2157 for (value = 0; value < 256; value++)
2159 ANYOF_SET(opnd, value);
2167 *opnd |= ANYOF_NALNUML;
2169 for (value = 0; value < 256; value++)
2170 if (!isALNUM(value))
2171 ANYOF_SET(opnd, value);
2179 *opnd |= ANYOF_SPACEL;
2181 for (value = 0; value < 256; value++)
2183 ANYOF_SET(opnd, value);
2191 *opnd |= ANYOF_NSPACEL;
2193 for (value = 0; value < 256; value++)
2194 if (!isSPACE(value))
2195 ANYOF_SET(opnd, value);
2202 for (value = '0'; value <= '9'; value++)
2203 ANYOF_SET(opnd, value);
2209 for (value = 0; value < '0'; value++)
2210 ANYOF_SET(opnd, value);
2211 for (value = '9' + 1; value < 256; value++)
2212 ANYOF_SET(opnd, value);
2238 value = scan_hex(PL_regcomp_parse, 2, &numlen);
2239 PL_regcomp_parse += numlen;
2242 value = UCHARAT(PL_regcomp_parse++);
2243 value = toCTRL(value);
2245 case '0': case '1': case '2': case '3': case '4':
2246 case '5': case '6': case '7': case '8': case '9':
2247 value = scan_oct(--PL_regcomp_parse, 3, &numlen);
2248 PL_regcomp_parse += numlen;
2253 if (lastvalue > value)
2254 FAIL("invalid [] range in regexp");
2259 if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend &&
2260 PL_regcomp_parse[1] != ']') {
2263 continue; /* do it next time */
2268 if ((isLOWER(lastvalue) && isLOWER(value)) ||
2269 (isUPPER(lastvalue) && isUPPER(value))) {
2270 if (isLOWER(lastvalue)) {
2271 for (i = lastvalue; i <= value; i++)
2275 for (i = lastvalue; i <= value; i++)
2282 for ( ; lastvalue <= value; lastvalue++)
2283 ANYOF_SET(opnd, lastvalue);
2287 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
2288 if (!SIZE_ONLY && (*opnd & (0xFF ^ ANYOF_INVERT)) == ANYOF_FOLD) {
2289 for (value = 0; value < 256; ++value) {
2290 if (ANYOF_TEST(opnd, value)) {
2291 I32 cf = fold[value];
2292 ANYOF_SET(opnd, cf);
2295 *opnd &= ~ANYOF_FOLD;
2297 /* optimize inverted simple patterns (e.g. [^a-z]) */
2298 if (!SIZE_ONLY && (*opnd & 0xFF) == ANYOF_INVERT) {
2299 for (value = 0; value < 32; ++value)
2300 opnd[1 + value] ^= 0xFF;
2309 register char *opnd, *e;
2311 register U32 lastvalue = 123456;
2312 register I32 range = 0;
2313 register regnode *ret;
2320 if (*PL_regcomp_parse == '^') { /* Complement of range. */
2324 flags |= ANYOF_INVERT;
2328 flags |= ANYOF_FOLD;
2330 flags |= ANYOF_LOCALE;
2331 listsv = newSVpv("# comment\n",0);
2334 if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-')
2335 goto skipcond; /* allow 1st char to be ] or - */
2337 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') {
2339 value = utf8_to_uv((U8*)PL_regcomp_parse, &numlen);
2340 PL_regcomp_parse += numlen;
2342 if (value == '[' && PL_regcomp_parse + 1 < PL_regxend &&
2343 /* I smell either [: or [= or [. -- POSIX has been here, right? */
2344 (*PL_regcomp_parse == ':' || *PL_regcomp_parse == '=' || *PL_regcomp_parse == '.')) {
2345 char posixccc = *PL_regcomp_parse;
2346 char* posixccs = PL_regcomp_parse++;
2348 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != posixccc)
2350 if (PL_regcomp_parse == PL_regxend)
2351 /* Grandfather lone [:, [=, [. */
2352 PL_regcomp_parse = posixccs;
2354 PL_regcomp_parse++; /* skip over the posixccc */
2355 if (*PL_regcomp_parse == ']') {
2356 /* Not Implemented Yet.
2357 * (POSIX Extended Character Classes, that is)
2358 * The text between e.g. [: and :] would start
2359 * at posixccs + 1 and stop at regcomp_parse - 2. */
2360 if (ckWARN(WARN_UNSAFE) && !SIZE_ONLY)
2362 "Character class syntax [%c %c] is reserved for future extensions", posixccc, posixccc);
2363 PL_regcomp_parse++; /* skip over the ending ] */
2368 if (value == '\\') {
2369 value = utf8_to_uv((U8*)PL_regcomp_parse, &numlen);
2370 PL_regcomp_parse += numlen;
2375 flags |= ANYOF_ALNUML;
2377 sv_catpvf(listsv, "+utf8::IsAlnum\n");
2384 flags |= ANYOF_NALNUML;
2387 "-utf8::IsAlpha\n-utf8::IsDigit\n0000\t%04x\n%04x\tffff\n",
2396 flags |= ANYOF_SPACEL;
2397 sv_catpvf(listsv, "+utf8::IsSpace\n");
2399 is_utf8_space((U8*)" ");
2406 flags |= ANYOF_NSPACEL;
2408 "!utf8::IsSpace\n");
2410 is_utf8_space((U8*)" ");
2416 sv_catpvf(listsv, "+utf8::IsDigit\n");
2423 "!utf8::IsDigit\n");
2429 if (*PL_regcomp_parse == '{') {
2430 e = strchr(PL_regcomp_parse++, '}');
2432 FAIL("Missing right brace on \\p{}");
2433 n = e - PL_regcomp_parse;
2436 e = PL_regcomp_parse;
2441 sv_catpvf(listsv, "+utf8::%.*s\n", n, PL_regcomp_parse);
2444 "!utf8::%.*s\n", n, PL_regcomp_parse);
2446 PL_regcomp_parse = e + 1;
2471 if (*PL_regcomp_parse == '{') {
2472 e = strchr(PL_regcomp_parse++, '}');
2474 FAIL("Missing right brace on \\x{}");
2475 value = scan_hex(PL_regcomp_parse + 1, e - PL_regcomp_parse, &numlen);
2476 PL_regcomp_parse = e + 1;
2479 value = scan_hex(PL_regcomp_parse, 2, &numlen);
2480 PL_regcomp_parse += numlen;
2484 value = UCHARAT(PL_regcomp_parse++);
2485 value = toCTRL(value);
2487 case '0': case '1': case '2': case '3': case '4':
2488 case '5': case '6': case '7': case '8': case '9':
2489 value = scan_oct(--PL_regcomp_parse, 3, &numlen);
2490 PL_regcomp_parse += numlen;
2495 if (lastvalue > value)
2496 FAIL("invalid [] range in regexp");
2498 sv_catpvf(listsv, "%04x\t%04x\n", lastvalue, value);
2504 if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend &&
2505 PL_regcomp_parse[1] != ']') {
2508 continue; /* do it next time */
2511 sv_catpvf(listsv, "%04x\n", value);
2515 ret = reganode(ANYOFUTF8, 0);
2518 SV *rv = swash_init("utf8", "", listsv, 1, 0);
2519 SvREFCNT_dec(listsv);
2520 n = add_data(1,"s");
2521 PL_regcomp_rx->data->data[n] = (void*)rv;
2522 ARG1_SET(ret, flags);
2533 char* retval = PL_regcomp_parse++;
2536 if (*PL_regcomp_parse == '(' && PL_regcomp_parse[1] == '?' &&
2537 PL_regcomp_parse[2] == '#') {
2538 while (*PL_regcomp_parse && *PL_regcomp_parse != ')')
2543 if (PL_regflags & PMf_EXTENDED) {
2544 if (isSPACE(*PL_regcomp_parse)) {
2548 else if (*PL_regcomp_parse == '#') {
2549 while (*PL_regcomp_parse && *PL_regcomp_parse != '\n')
2560 - reg_node - emit a node
2562 STATIC regnode * /* Location. */
2566 register regnode *ret;
2567 register regnode *ptr;
2571 SIZE_ALIGN(PL_regsize);
2576 NODE_ALIGN_FILL(ret);
2578 FILL_ADVANCE_NODE(ptr, op);
2585 - reganode - emit a node with an argument
2587 STATIC regnode * /* Location. */
2588 reganode(U8 op, U32 arg)
2591 register regnode *ret;
2592 register regnode *ptr;
2596 SIZE_ALIGN(PL_regsize);
2601 NODE_ALIGN_FILL(ret);
2603 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
2610 - regc - emit (if appropriate) a Unicode character
2613 reguni(UV uv, char* s, I32* lenp)
2618 *lenp = uv_to_utf8(tmpbuf, uv) - tmpbuf;
2621 *lenp = uv_to_utf8((U8*)s, uv) - (U8*)s;
2626 - regc - emit (if appropriate) a byte of code
2637 - reginsert - insert an operator in front of already-emitted operand
2639 * Means relocating the operand.
2642 reginsert(U8 op, regnode *opnd)
2645 register regnode *src;
2646 register regnode *dst;
2647 register regnode *place;
2648 register int offset = regarglen[(U8)op];
2650 /* (regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
2653 PL_regsize += NODE_STEP_REGNODE + offset;
2658 PL_regcode += NODE_STEP_REGNODE + offset;
2661 StructCopy(--src, --dst, regnode);
2663 place = opnd; /* Op node, where operand used to be. */
2664 src = NEXTOPER(place);
2665 FILL_ADVANCE_NODE(place, op);
2666 Zero(src, offset, regnode);
2670 - regtail - set the next-pointer at the end of a node chain of p to val.
2673 regtail(regnode *p, regnode *val)
2676 register regnode *scan;
2677 register regnode *temp;
2678 register I32 offset;
2683 /* Find last node. */
2686 temp = regnext(scan);
2692 if (reg_off_by_arg[OP(scan)]) {
2693 ARG_SET(scan, val - scan);
2696 NEXT_OFF(scan) = val - scan;
2701 - regoptail - regtail on operand of first argument; nop if operandless
2704 regoptail(regnode *p, regnode *val)
2707 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
2708 if (p == NULL || SIZE_ONLY)
2710 if (regkind[(U8)OP(p)] == BRANCH) {
2711 regtail(NEXTOPER(p), val);
2713 else if ( regkind[(U8)OP(p)] == BRANCHJ) {
2714 regtail(NEXTOPER(NEXTOPER(p)), val);
2721 - regcurly - a little FSA that accepts {\d+,?\d*}
2724 regcurly(register char *s)
2743 dumpuntil(regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
2746 register char op = EXACT; /* Arbitrary non-END op. */
2747 register regnode *next, *onode;
2749 while (op != END && (!last || node < last)) {
2750 /* While that wasn't END last time... */
2756 next = regnext(node);
2758 if (OP(node) == OPTIMIZED)
2761 PerlIO_printf(Perl_debug_log, "%4d:%*s%s", node - start,
2762 2*l + 1, "", SvPVX(sv));
2763 if (next == NULL) /* Next ptr. */
2764 PerlIO_printf(Perl_debug_log, "(0)");
2766 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
2767 (void)PerlIO_putc(Perl_debug_log, '\n');
2769 if (regkind[(U8)op] == BRANCHJ) {
2770 register regnode *nnode = (OP(next) == LONGJMP
2773 if (last && nnode > last)
2775 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
2777 else if (regkind[(U8)op] == BRANCH) {
2778 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
2780 else if ( op == CURLY) { /* `next' might be very big: optimizer */
2781 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2782 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
2784 else if (regkind[(U8)op] == CURLY && op != CURLYX) {
2785 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2788 else if ( op == PLUS || op == STAR) {
2789 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
2791 else if (op == ANYOF) {
2792 node = NEXTOPER(node);
2795 else if (regkind[(U8)op] == EXACT) {
2796 /* Literal string, where present. */
2797 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2798 node = NEXTOPER(node);
2801 node = NEXTOPER(node);
2802 node += regarglen[(U8)op];
2804 if (op == CURLYX || op == OPEN)
2806 else if (op == WHILEM)
2809 #endif /* DEBUGGING */
2814 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
2821 SV *sv = sv_newmortal();
2823 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
2825 /* Header fields of interest. */
2826 if (r->anchored_substr)
2827 PerlIO_printf(Perl_debug_log, "anchored `%s%s%s'%s at %d ",
2829 SvPVX(r->anchored_substr),
2831 SvTAIL(r->anchored_substr) ? "$" : "",
2832 r->anchored_offset);
2833 if (r->float_substr)
2834 PerlIO_printf(Perl_debug_log, "floating `%s%s%s'%s at %d..%u ",
2836 SvPVX(r->float_substr),
2838 SvTAIL(r->float_substr) ? "$" : "",
2839 r->float_min_offset, r->float_max_offset);
2840 if (r->check_substr)
2841 PerlIO_printf(Perl_debug_log,
2842 r->check_substr == r->float_substr
2843 ? "(checking floating" : "(checking anchored");
2844 if (r->reganch & ROPT_NOSCAN)
2845 PerlIO_printf(Perl_debug_log, " noscan");
2846 if (r->reganch & ROPT_CHECK_ALL)
2847 PerlIO_printf(Perl_debug_log, " isall");
2848 if (r->check_substr)
2849 PerlIO_printf(Perl_debug_log, ") ");
2851 if (r->regstclass) {
2852 regprop(sv, r->regstclass);
2853 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
2855 if (r->reganch & ROPT_ANCH) {
2856 PerlIO_printf(Perl_debug_log, "anchored");
2857 if (r->reganch & ROPT_ANCH_BOL)
2858 PerlIO_printf(Perl_debug_log, "(BOL)");
2859 if (r->reganch & ROPT_ANCH_MBOL)
2860 PerlIO_printf(Perl_debug_log, "(MBOL)");
2861 if (r->reganch & ROPT_ANCH_GPOS)
2862 PerlIO_printf(Perl_debug_log, "(GPOS)");
2863 PerlIO_putc(Perl_debug_log, ' ');
2865 if (r->reganch & ROPT_GPOS_SEEN)
2866 PerlIO_printf(Perl_debug_log, "GPOS ");
2867 if (r->reganch & ROPT_SKIP)
2868 PerlIO_printf(Perl_debug_log, "plus ");
2869 if (r->reganch & ROPT_IMPLICIT)
2870 PerlIO_printf(Perl_debug_log, "implicit ");
2871 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
2872 if (r->reganch & ROPT_EVAL_SEEN)
2873 PerlIO_printf(Perl_debug_log, "with eval ");
2874 PerlIO_printf(Perl_debug_log, "\n");
2875 #endif /* DEBUGGING */
2879 - regprop - printable representation of opcode
2882 regprop(SV *sv, regnode *o)
2886 register char *p = 0;
2888 sv_setpvn(sv, "", 0);
2933 sv_catpvf(sv, "EXACT <%s%s%s>", PL_colors[0], OPERAND(o) + 1, PL_colors[1]);
2936 sv_catpvf(sv, "EXACTF <%s%s%s>", PL_colors[0], OPERAND(o) + 1, PL_colors[1]);
2939 sv_catpvf(sv, "EXACTFL <%s%s%s>", PL_colors[0], OPERAND(o) + 1, PL_colors[1]);
2966 sv_catpvf(sv, "CURLY {%d,%d}", ARG1(o), ARG2(o));
2969 sv_catpvf(sv, "CURLYM[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2972 sv_catpvf(sv, "CURLYN[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2975 sv_catpvf(sv, "CURLYX {%d,%d}", ARG1(o), ARG2(o));
2978 sv_catpvf(sv, "REF%d", ARG(o));
2981 sv_catpvf(sv, "REFF%d", ARG(o));
2984 sv_catpvf(sv, "REFFL%d", ARG(o));
2987 sv_catpvf(sv, "OPEN%d", ARG(o));
2990 sv_catpvf(sv, "CLOSE%d", ARG(o));
3006 sv_catpvf(sv, "UNLESSM[-%d]", o->flags);
3009 sv_catpvf(sv, "IFMATCH[-%d]", o->flags);
3060 sv_catpvf(sv, "GROUPP%d", ARG(o));
3063 sv_catpvf(sv, "LOGICAL[%d]", o->flags);
3075 FAIL("corrupted regexp opcode");
3079 #endif /* DEBUGGING */
3083 pregfree(struct regexp *r)
3086 if (!r || (--r->refcnt > 0))
3089 Safefree(r->precomp);
3091 Safefree(r->subbase);
3093 if (r->anchored_substr)
3094 SvREFCNT_dec(r->anchored_substr);
3095 if (r->float_substr)
3096 SvREFCNT_dec(r->float_substr);
3097 Safefree(r->substrs);
3100 int n = r->data->count;
3102 switch (r->data->what[n]) {
3104 SvREFCNT_dec((SV*)r->data->data[n]);
3107 op_free((OP_4tree*)r->data->data[n]);
3112 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
3115 Safefree(r->data->what);
3118 Safefree(r->startp);
3124 - regnext - dig the "next" pointer out of a node
3126 * [Note, when REGALIGN is defined there are two places in regmatch()
3127 * that bypass this code for speed.]
3130 regnext(register regnode *p)
3133 register I32 offset;
3135 if (p == &PL_regdummy)
3138 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
3146 re_croak2(const char* pat1,const char* pat2,...)
3149 STRLEN l1 = strlen(pat1);
3150 STRLEN l2 = strlen(pat2);
3158 Copy(pat1, buf, l1 , char);
3159 Copy(pat2, buf + l1, l2 , char);
3160 buf[l1 + l2] = '\n';
3161 buf[l1 + l2 + 1] = '\0';
3162 va_start(args, pat2);
3163 message = mess(buf, &args);
3165 l1 = strlen(message);
3168 Copy(message, buf, l1 , char);
3169 buf[l1] = '\0'; /* Overwrite \n */
3173 /* XXX Here's a total kludge. But we need to re-enter for swash routines. */
3176 save_re_context(void)
3180 SAVEPPTR(PL_regprecomp); /* uncompiled string. */
3181 SAVEI32(PL_regnpar); /* () count. */
3182 SAVEI32(PL_regsize); /* Code size. */
3183 SAVEI16(PL_regflags); /* are we folding, multilining? */
3184 SAVEPPTR(PL_reginput); /* String-input pointer. */
3185 SAVEPPTR(PL_regbol); /* Beginning of input, for ^ check. */
3186 SAVEPPTR(PL_regeol); /* End of input, for $ check. */
3187 SAVESPTR(PL_regstartp); /* Pointer to startp array. */
3188 SAVESPTR(PL_regendp); /* Ditto for endp. */
3189 SAVESPTR(PL_reglastparen); /* Similarly for lastparen. */
3190 SAVEPPTR(PL_regtill); /* How far we are required to go. */
3191 SAVEI32(PL_regprev); /* char before regbol, \n if none */
3192 SAVESPTR(PL_reg_start_tmp); /* from regexec.c */
3193 PL_reg_start_tmp = 0;
3194 SAVEFREEPV(PL_reg_start_tmp);
3195 SAVEI32(PL_reg_start_tmpl); /* from regexec.c */
3196 PL_reg_start_tmpl = 0;
3197 SAVESPTR(PL_regdata);
3198 SAVEI32(PL_reg_flags); /* from regexec.c */
3199 SAVEI32(PL_reg_eval_set); /* from regexec.c */
3200 SAVEI32(PL_regnarrate); /* from regexec.c */
3201 SAVESPTR(PL_regprogram); /* from regexec.c */
3202 SAVEINT(PL_regindent); /* from regexec.c */
3203 SAVESPTR(PL_regcc); /* from regexec.c */
3204 SAVESPTR(PL_curcop);
3205 SAVESPTR(PL_regcomp_rx); /* from regcomp.c */
3206 SAVEI32(PL_regseen); /* from regcomp.c */
3207 SAVEI32(PL_regsawback); /* Did we see \1, ...? */
3208 SAVEI32(PL_regnaughty); /* How bad is this pattern? */
3209 SAVESPTR(PL_regcode); /* Code-emit pointer; ®dummy = don't */
3210 SAVEPPTR(PL_regxend); /* End of input for compile */
3211 SAVEPPTR(PL_regcomp_parse); /* Input-scan pointer. */