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 Perl_save_re_context my_save_re_context
42 # define Perl_reginitcolors my_reginitcolors
47 * pregcomp and pregexec -- regsub and regerror are not used in perl
49 * Copyright (c) 1986 by University of Toronto.
50 * Written by Henry Spencer. Not derived from licensed software.
52 * Permission is granted to anyone to use this software for any
53 * purpose on any computer system, and to redistribute it freely,
54 * subject to the following restrictions:
56 * 1. The author is not responsible for the consequences of use of
57 * this software, no matter how awful, even if they arise
60 * 2. The origin of this software must not be misrepresented, either
61 * by explicit claim or by omission.
63 * 3. Altered versions must be plainly marked as such, and must not
64 * be misrepresented as being the original software.
67 **** Alterations to Henry's code are...
69 **** Copyright (c) 1991-1998, Larry Wall
71 **** You may distribute under the terms of either the GNU General Public
72 **** License or the Artistic License, as specified in the README file.
75 * Beware that some of this code is subtly aware of the way operator
76 * precedence is structured in regular expressions. Serious changes in
77 * regular-expression syntax might require a total rethink.
82 #ifndef PERL_IN_XSUB_RE
94 # if defined(BUGGY_MSC6)
95 /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */
96 # pragma optimize("a",off)
97 /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/
98 # pragma optimize("w",on )
99 # endif /* BUGGY_MSC6 */
103 #define STATIC static
106 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
107 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
108 ((*s) == '{' && regcurly(s)))
110 #define PERL_META "^$.[()|?+*\\"
112 #define META "^$.[()|?+*\\"
116 #undef SPSTART /* dratted cpp namespace... */
119 * Flags to be passed up and down.
121 #define WORST 0 /* Worst case. */
122 #define HASWIDTH 0x1 /* Known to match non-null strings. */
123 #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
124 #define SPSTART 0x4 /* Starts with * or +. */
125 #define TRYAGAIN 0x8 /* Weeded out a declaration. */
128 * Forward declarations for pregcomp()'s friends.
132 static regnode *reg _((I32, I32 *));
133 static regnode *reganode _((U8, U32));
134 static regnode *regatom _((I32 *));
135 static regnode *regbranch _((I32 *, I32));
136 static void regc _((U8, char *));
137 static void reguni _((UV, char *, I32*));
138 static regnode *regclass _((void));
139 static regnode *regclassutf8 _((void));
140 STATIC I32 regcurly _((char *));
141 static regnode *reg_node _((U8));
142 static regnode *regpiece _((I32 *));
143 static void reginsert _((U8, regnode *));
144 static void regoptail _((regnode *, regnode *));
145 static void regtail _((regnode *, regnode *));
146 static char* regwhite _((char *, char *));
147 static char* nextchar _((void));
148 static void re_croak2 _((const char* pat1,const char* pat2,...)) __attribute__((noreturn));
149 static char* regpposixcc _((I32 value));
152 /* Length of a variant. */
158 I32 pos_min; /* CC */
159 I32 pos_delta; /* CC */
161 I32 last_end; /* min value, <0 unless valid. */
162 I32 last_start_min; /* CC */
163 I32 last_start_max; /* CC */
164 SV **longest; /* Either &l_fixed, or &l_float. */
166 I32 offset_fixed; /* CC */
168 I32 offset_float_min; /* CC */
169 I32 offset_float_max; /* CC */
174 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
176 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
177 #define SF_BEFORE_SEOL 0x1
178 #define SF_BEFORE_MEOL 0x2
179 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
180 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
183 # define SF_FIX_SHIFT_EOL (0+2)
184 # define SF_FL_SHIFT_EOL (0+4)
186 # define SF_FIX_SHIFT_EOL (+2)
187 # define SF_FL_SHIFT_EOL (+4)
190 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
191 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
193 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
194 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
195 #define SF_IS_INF 0x40
196 #define SF_HAS_PAR 0x80
197 #define SF_IN_PAR 0x100
198 #define SF_HAS_EVAL 0x200
199 #define SCF_DO_SUBSTR 0x400
202 #define UTF (PL_reg_flags & RF_utf8)
203 #define LOC (PL_regflags & PMf_LOCALE)
204 #define FOLD (PL_regflags & PMf_FOLD)
206 #define CHR_SVLEN(sv) (UTF ? sv_len_utf8(sv) : SvCUR(sv))
207 #define CHR_DIST(a,b) (UTF ? utf8_distance(a,b) : a - b)
210 scan_commit(scan_data_t *data)
213 STRLEN l = CHR_SVLEN(data->last_found);
214 STRLEN old_l = CHR_SVLEN(*data->longest);
216 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
217 sv_setsv(*data->longest, data->last_found);
218 if (*data->longest == data->longest_fixed) {
219 data->offset_fixed = l ? data->last_start_min : data->pos_min;
220 if (data->flags & SF_BEFORE_EOL)
222 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
224 data->flags &= ~SF_FIX_BEFORE_EOL;
227 data->offset_float_min = l ? data->last_start_min : data->pos_min;
228 data->offset_float_max = (l
229 ? data->last_start_max
230 : data->pos_min + data->pos_delta);
231 if (data->flags & SF_BEFORE_EOL)
233 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
235 data->flags &= ~SF_FL_BEFORE_EOL;
238 SvCUR_set(data->last_found, 0);
240 data->flags &= ~SF_BEFORE_EOL;
243 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
244 to the position after last scanned or to NULL. */
247 study_chunk(regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
248 /* scanp: Start here (read-write). */
249 /* deltap: Write maxlen-minlen here. */
250 /* last: Stop before this one. */
253 I32 min = 0, pars = 0, code;
254 regnode *scan = *scanp, *next;
256 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
257 int is_inf_internal = 0; /* The studied chunk is infinite */
258 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
259 scan_data_t data_fake;
261 while (scan && OP(scan) != END && scan < last) {
262 /* Peephole optimizer: */
264 if (PL_regkind[(U8)OP(scan)] == EXACT) {
265 regnode *n = regnext(scan);
268 regnode *stop = scan;
271 next = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
272 /* Skip NOTHING, merge EXACT*. */
274 ( PL_regkind[(U8)OP(n)] == NOTHING ||
275 (stringok && (OP(n) == OP(scan))))
277 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
278 if (OP(n) == TAIL || n > next)
280 if (PL_regkind[(U8)OP(n)] == NOTHING) {
281 NEXT_OFF(scan) += NEXT_OFF(n);
282 next = n + NODE_STEP_REGNODE;
290 int oldl = *OPERAND(scan);
291 regnode *nnext = regnext(n);
293 if (oldl + *OPERAND(n) > U8_MAX)
295 NEXT_OFF(scan) += NEXT_OFF(n);
296 *OPERAND(scan) += *OPERAND(n);
297 next = n + (*OPERAND(n) + 2 - 1)/sizeof(regnode) + 2;
298 /* Now we can overwrite *n : */
299 Move(OPERAND(n) + 1, OPERAND(scan) + oldl + 1,
300 *OPERAND(n) + 1, char);
310 n = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
312 /* Purify reports a benign UMR here sometimes, because we
313 * don't initialize the OP() slot of a node when that node
314 * is occupied by just the trailing null of the string in
316 if (PL_regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
325 if (OP(scan) != CURLYX) {
326 int max = (reg_off_by_arg[OP(scan)]
328 /* I32 may be smaller than U16 on CRAYs! */
329 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
330 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
334 /* Skip NOTHING and LONGJMP. */
335 while ((n = regnext(n))
336 && ((PL_regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
337 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
340 if (reg_off_by_arg[OP(scan)])
343 NEXT_OFF(scan) = off;
345 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
346 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
347 next = regnext(scan);
350 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
351 I32 max1 = 0, min1 = I32_MAX, num = 0;
353 if (flags & SCF_DO_SUBSTR)
355 while (OP(scan) == code) {
356 I32 deltanext, minnext;
360 next = regnext(scan);
361 scan = NEXTOPER(scan);
363 scan = NEXTOPER(scan);
364 /* We suppose the run is continuous, last=next...*/
365 minnext = study_chunk(&scan, &deltanext, next,
369 if (max1 < minnext + deltanext)
370 max1 = minnext + deltanext;
371 if (deltanext == I32_MAX)
372 is_inf = is_inf_internal = 1;
374 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
376 if (data && (data_fake.flags & SF_HAS_EVAL))
377 data->flags |= SF_HAS_EVAL;
381 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
383 if (flags & SCF_DO_SUBSTR) {
384 data->pos_min += min1;
385 data->pos_delta += max1 - min1;
386 if (max1 != min1 || is_inf)
387 data->longest = &(data->longest_float);
390 delta += max1 - min1;
392 else if (code == BRANCHJ) /* single branch is optimized. */
393 scan = NEXTOPER(NEXTOPER(scan));
394 else /* single branch is optimized. */
395 scan = NEXTOPER(scan);
398 else if (OP(scan) == EXACT) {
399 I32 l = *OPERAND(scan);
401 unsigned char *s = (unsigned char *)(OPERAND(scan)+1);
402 unsigned char *e = s + l;
411 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
412 /* The code below prefers earlier match for fixed
413 offset, later match for variable offset. */
414 if (data->last_end == -1) { /* Update the start info. */
415 data->last_start_min = data->pos_min;
416 data->last_start_max = is_inf
417 ? I32_MAX : data->pos_min + data->pos_delta;
419 sv_catpvn(data->last_found, (char *)(OPERAND(scan)+1), *OPERAND(scan));
420 data->last_end = data->pos_min + l;
421 data->pos_min += l; /* As in the first entry. */
422 data->flags &= ~SF_BEFORE_EOL;
425 else if (PL_regkind[(U8)OP(scan)] == EXACT) {
426 I32 l = *OPERAND(scan);
427 if (flags & SCF_DO_SUBSTR)
430 unsigned char *s = (unsigned char *)(OPERAND(scan)+1);
431 unsigned char *e = s + l;
440 if (data && (flags & SCF_DO_SUBSTR))
443 else if (strchr(PL_varies,OP(scan))) {
444 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
445 regnode *oscan = scan;
447 switch (PL_regkind[(U8)OP(scan)]) {
449 scan = NEXTOPER(scan);
452 if (flags & SCF_DO_SUBSTR) {
453 next = NEXTOPER(scan);
454 if (OP(next) == EXACT) {
456 maxcount = REG_INFTY;
457 next = regnext(scan);
458 scan = NEXTOPER(scan);
462 if (flags & SCF_DO_SUBSTR)
467 is_inf = is_inf_internal = 1;
468 scan = regnext(scan);
469 if (flags & SCF_DO_SUBSTR) {
471 data->longest = &(data->longest_float);
473 goto optimize_curly_tail;
475 mincount = ARG1(scan);
476 maxcount = ARG2(scan);
477 next = regnext(scan);
478 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
480 if (flags & SCF_DO_SUBSTR) {
481 if (mincount == 0) scan_commit(data);
482 pos_before = data->pos_min;
486 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
488 data->flags |= SF_IS_INF;
490 /* This will finish on WHILEM, setting scan, or on NULL: */
491 minnext = study_chunk(&scan, &deltanext, last, data,
493 ? (flags & ~SCF_DO_SUBSTR) : flags);
494 if (!scan) /* It was not CURLYX, but CURLY. */
496 if (ckWARN(WARN_UNSAFE) && (minnext + deltanext == 0)
497 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
498 && maxcount <= REG_INFTY/3) /* Complement check for big count */
499 warner(WARN_UNSAFE, "Strange *+?{} on zero-length expression");
500 min += minnext * mincount;
501 is_inf_internal |= (maxcount == REG_INFTY
502 && (minnext + deltanext) > 0
503 || deltanext == I32_MAX);
504 is_inf |= is_inf_internal;
505 delta += (minnext + deltanext) * maxcount - minnext * mincount;
507 /* Try powerful optimization CURLYX => CURLYN. */
508 if ( OP(oscan) == CURLYX && data
509 && data->flags & SF_IN_PAR
510 && !(data->flags & SF_HAS_EVAL)
511 && !deltanext && minnext == 1 ) {
512 /* Try to optimize to CURLYN. */
513 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
514 regnode *nxt1 = nxt, *nxt2;
518 if (!strchr(PL_simple,OP(nxt))
519 && !(PL_regkind[(U8)OP(nxt)] == EXACT
520 && *OPERAND(nxt) == 1))
524 if (OP(nxt) != CLOSE)
526 /* Now we know that nxt2 is the only contents: */
527 oscan->flags = ARG(nxt);
529 OP(nxt1) = NOTHING; /* was OPEN. */
531 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
532 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
533 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
534 OP(nxt) = OPTIMIZED; /* was CLOSE. */
535 OP(nxt + 1) = OPTIMIZED; /* was count. */
536 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
541 /* Try optimization CURLYX => CURLYM. */
542 if ( OP(oscan) == CURLYX && data
543 && !(data->flags & SF_HAS_PAR)
544 && !(data->flags & SF_HAS_EVAL)
546 /* XXXX How to optimize if data == 0? */
547 /* Optimize to a simpler form. */
548 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
552 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
553 && (OP(nxt2) != WHILEM))
555 OP(nxt2) = SUCCEED; /* Whas WHILEM */
556 /* Need to optimize away parenths. */
557 if (data->flags & SF_IN_PAR) {
558 /* Set the parenth number. */
559 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
561 if (OP(nxt) != CLOSE)
562 FAIL("panic opt close");
563 oscan->flags = ARG(nxt);
564 OP(nxt1) = OPTIMIZED; /* was OPEN. */
565 OP(nxt) = OPTIMIZED; /* was CLOSE. */
567 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
568 OP(nxt + 1) = OPTIMIZED; /* was count. */
569 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
570 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
573 while ( nxt1 && (OP(nxt1) != WHILEM)) {
574 regnode *nnxt = regnext(nxt1);
577 if (reg_off_by_arg[OP(nxt1)])
578 ARG_SET(nxt1, nxt2 - nxt1);
579 else if (nxt2 - nxt1 < U16_MAX)
580 NEXT_OFF(nxt1) = nxt2 - nxt1;
582 OP(nxt) = NOTHING; /* Cannot beautify */
587 /* Optimize again: */
588 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
593 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
595 if (flags & SCF_DO_SUBSTR) {
596 SV *last_str = Nullsv;
597 int counted = mincount != 0;
599 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
600 I32 b = pos_before >= data->last_start_min
601 ? pos_before : data->last_start_min;
603 char *s = SvPV(data->last_found, l);
604 I32 old = b - data->last_start_min;
607 old = utf8_hop((U8*)s, old) - (U8*)s;
610 /* Get the added string: */
611 last_str = newSVpv(s + old, l);
612 if (deltanext == 0 && pos_before == b) {
613 /* What was added is a constant string */
615 SvGROW(last_str, (mincount * l) + 1);
616 repeatcpy(SvPVX(last_str) + l,
617 SvPVX(last_str), l, mincount - 1);
618 SvCUR(last_str) *= mincount;
619 /* Add additional parts. */
620 SvCUR_set(data->last_found,
621 SvCUR(data->last_found) - l);
622 sv_catsv(data->last_found, last_str);
623 data->last_end += l * (mincount - 1);
627 /* It is counted once already... */
628 data->pos_min += minnext * (mincount - counted);
629 data->pos_delta += - counted * deltanext +
630 (minnext + deltanext) * maxcount - minnext * mincount;
631 if (mincount != maxcount) {
633 if (mincount && last_str) {
634 sv_setsv(data->last_found, last_str);
635 data->last_end = data->pos_min;
636 data->last_start_min =
637 data->pos_min - CHR_SVLEN(last_str);
638 data->last_start_max = is_inf
640 : data->pos_min + data->pos_delta
641 - CHR_SVLEN(last_str);
643 data->longest = &(data->longest_float);
645 SvREFCNT_dec(last_str);
647 if (data && (fl & SF_HAS_EVAL))
648 data->flags |= SF_HAS_EVAL;
650 if (OP(oscan) != CURLYX) {
651 while (PL_regkind[(U8)OP(next = regnext(oscan))] == NOTHING
653 NEXT_OFF(oscan) += NEXT_OFF(next);
656 default: /* REF only? */
657 if (flags & SCF_DO_SUBSTR) {
659 data->longest = &(data->longest_float);
661 is_inf = is_inf_internal = 1;
665 else if (strchr(PL_simple,OP(scan)) || PL_regkind[(U8)OP(scan)] == ANYUTF8) {
666 if (flags & SCF_DO_SUBSTR) {
672 else if (PL_regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
673 data->flags |= (OP(scan) == MEOL
677 else if (PL_regkind[(U8)OP(scan)] == BRANCHJ
678 && (scan->flags || data)
679 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
680 I32 deltanext, minnext;
684 next = regnext(scan);
685 nscan = NEXTOPER(NEXTOPER(scan));
686 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, 0);
689 FAIL("variable length lookbehind not implemented");
691 else if (minnext > U8_MAX) {
692 FAIL2("lookbehind longer than %d not implemented", U8_MAX);
694 scan->flags = minnext;
696 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
698 if (data && (data_fake.flags & SF_HAS_EVAL))
699 data->flags |= SF_HAS_EVAL;
701 else if (OP(scan) == OPEN) {
704 else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
705 next = regnext(scan);
707 if ( next && (OP(next) != WHILEM) && next < last)
708 is_par = 0; /* Disable optimization */
710 else if (OP(scan) == EVAL) {
712 data->flags |= SF_HAS_EVAL;
714 else if (OP(scan) == LOGICAL && scan->flags == 2) { /* Embedded */
715 if (flags & SCF_DO_SUBSTR) {
717 data->longest = &(data->longest_float);
719 is_inf = is_inf_internal = 1;
721 /* Else: zero-length, ignore. */
722 scan = regnext(scan);
727 *deltap = is_inf_internal ? I32_MAX : delta;
728 if (flags & SCF_DO_SUBSTR && is_inf)
729 data->pos_delta = I32_MAX - data->pos_min;
732 if (is_par && pars==1 && data) {
733 data->flags |= SF_IN_PAR;
734 data->flags &= ~SF_HAS_PAR;
736 else if (pars && data) {
737 data->flags |= SF_HAS_PAR;
738 data->flags &= ~SF_IN_PAR;
744 add_data(I32 n, char *s)
747 if (PL_regcomp_rx->data) {
748 Renewc(PL_regcomp_rx->data,
749 sizeof(*PL_regcomp_rx->data) + sizeof(void*) * (PL_regcomp_rx->data->count + n - 1),
750 char, struct reg_data);
751 Renew(PL_regcomp_rx->data->what, PL_regcomp_rx->data->count + n, U8);
752 PL_regcomp_rx->data->count += n;
755 Newc(1207, PL_regcomp_rx->data, sizeof(*PL_regcomp_rx->data) + sizeof(void*) * (n - 1),
756 char, struct reg_data);
757 New(1208, PL_regcomp_rx->data->what, n, U8);
758 PL_regcomp_rx->data->count = n;
760 Copy(s, PL_regcomp_rx->data->what + PL_regcomp_rx->data->count - n, n, U8);
761 return PL_regcomp_rx->data->count - n;
769 char *s = PerlEnv_getenv("PERL_RE_COLORS");
772 PL_colors[0] = s = savepv(s);
780 PL_colors[i] = s = "";
790 - pregcomp - compile a regular expression into internal code
792 * We can't allocate space until we know how big the compiled form will be,
793 * but we can't compile it (and thus know how big it is) until we've got a
794 * place to put the code. So we cheat: we compile it twice, once with code
795 * generation turned off and size counting turned on, and once "for real".
796 * This also means that we don't allocate space until we are sure that the
797 * thing really will compile successfully, and we never have to move the
798 * code and thus invalidate pointers into it. (Note that it has to be in
799 * one piece because free() must be able to free it all.) [NB: not true in perl]
801 * Beware that the optimization-preparation code in here knows about some
802 * of the structure of the compiled regexp. [I'll say.]
805 pregcomp(char *exp, char *xend, PMOP *pm)
820 FAIL("NULL regexp argument");
822 if (PL_curcop == &PL_compiling ? (PL_hints & HINT_UTF8) : IN_UTF8)
823 PL_reg_flags |= RF_utf8;
827 PL_regprecomp = savepvn(exp, xend - exp);
828 DEBUG_r(if (!PL_colorset) reginitcolors());
829 DEBUG_r(PerlIO_printf(Perl_debug_log, "%sCompiling%s RE `%s%*s%s'\n",
830 PL_colors[4],PL_colors[5],PL_colors[0],
831 xend - exp, PL_regprecomp, PL_colors[1]));
832 PL_regflags = pm->op_pmflags;
836 PL_seen_zerolen = *exp == '^' ? -1 : 0;
840 /* First pass: determine size, legality. */
841 PL_regcomp_parse = exp;
846 PL_regcode = &PL_regdummy;
847 regc((U8)REG_MAGIC, (char*)PL_regcode);
848 if (reg(0, &flags) == NULL) {
849 Safefree(PL_regprecomp);
850 PL_regprecomp = Nullch;
853 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %d ", PL_regsize));
855 /* Small enough for pointer-storage convention?
856 If extralen==0, this means that we will not need long jumps. */
857 if (PL_regsize >= 0x10000L && PL_extralen)
858 PL_regsize += PL_extralen;
862 /* Allocate space and initialize. */
863 Newc(1001, r, sizeof(regexp) + (unsigned)PL_regsize * sizeof(regnode),
866 FAIL("regexp out of space");
868 r->prelen = xend - exp;
869 r->precomp = PL_regprecomp;
870 r->subbeg = r->subbase = NULL;
871 r->nparens = PL_regnpar - 1; /* set early to validate backrefs */
874 /* Second pass: emit code. */
875 PL_regcomp_parse = exp;
879 PL_regcode = r->program;
880 /* Store the count of eval-groups for security checks: */
881 PL_regcode->next_off = ((PL_seen_evals > U16_MAX) ? U16_MAX : PL_seen_evals);
882 regc((U8)REG_MAGIC, (char*) PL_regcode++);
884 if (reg(0, &flags) == NULL)
887 /* Dig out information for optimizations. */
888 r->reganch = pm->op_pmflags & PMf_COMPILETIME;
889 pm->op_pmflags = PL_regflags;
891 r->reganch |= ROPT_UTF8;
892 r->regstclass = NULL;
893 if (PL_regnaughty >= 10) /* Probably an expensive pattern. */
894 r->reganch |= ROPT_NAUGHTY;
895 scan = r->program + 1; /* First BRANCH. */
897 /* XXXX To minimize changes to RE engine we always allocate
898 3-units-long substrs field. */
899 Newz(1004, r->substrs, 1, struct reg_substr_data);
901 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
904 STRLEN longest_float_length, longest_fixed_length;
906 StructCopy(&zero_scan_data, &data, scan_data_t);
908 /* Skip introductions and multiplicators >= 1. */
909 while ((OP(first) == OPEN && (sawopen = 1)) ||
910 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
911 (OP(first) == PLUS) ||
912 (OP(first) == MINMOD) ||
913 (PL_regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
914 if (OP(first) == PLUS)
917 first += regarglen[(U8)OP(first)];
918 first = NEXTOPER(first);
921 /* Starting-point info. */
923 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
924 else if (strchr(PL_simple+4,OP(first)))
925 r->regstclass = first;
926 else if (PL_regkind[(U8)OP(first)] == BOUND ||
927 PL_regkind[(U8)OP(first)] == NBOUND)
928 r->regstclass = first;
929 else if (PL_regkind[(U8)OP(first)] == BOL) {
930 r->reganch |= (OP(first) == MBOL ? ROPT_ANCH_MBOL: ROPT_ANCH_BOL);
931 first = NEXTOPER(first);
934 else if (OP(first) == GPOS) {
935 r->reganch |= ROPT_ANCH_GPOS;
936 first = NEXTOPER(first);
939 else if ((OP(first) == STAR &&
940 PL_regkind[(U8)OP(NEXTOPER(first))] == REG_ANY) &&
941 !(r->reganch & ROPT_ANCH) )
943 /* turn .* into ^.* with an implied $*=1 */
944 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
945 first = NEXTOPER(first);
948 if (sawplus && (!sawopen || !PL_regsawback))
949 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
951 /* Scan is after the zeroth branch, first is atomic matcher. */
952 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
955 * If there's something expensive in the r.e., find the
956 * longest literal string that must appear and make it the
957 * regmust. Resolve ties in favor of later strings, since
958 * the regstart check works with the beginning of the r.e.
959 * and avoiding duplication strengthens checking. Not a
960 * strong reason, but sufficient in the absence of others.
961 * [Now we resolve ties in favor of the earlier string if
962 * it happens that c_offset_min has been invalidated, since the
963 * earlier string may buy us something the later one won't.]
967 data.longest_fixed = newSVpv("",0);
968 data.longest_float = newSVpv("",0);
969 data.last_found = newSVpv("",0);
970 data.longest = &(data.longest_fixed);
973 minlen = study_chunk(&first, &fake, scan + PL_regsize, /* Up to end */
974 &data, SCF_DO_SUBSTR);
975 if ( PL_regnpar == 1 && data.longest == &(data.longest_fixed)
976 && data.last_start_min == 0 && data.last_end > 0
978 && (!(PL_regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
979 r->reganch |= ROPT_CHECK_ALL;
981 SvREFCNT_dec(data.last_found);
983 longest_float_length = CHR_SVLEN(data.longest_float);
984 if (longest_float_length
985 || (data.flags & SF_FL_BEFORE_EOL
986 && (!(data.flags & SF_FL_BEFORE_MEOL)
987 || (PL_regflags & PMf_MULTILINE)))) {
988 if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */
989 && data.offset_fixed == data.offset_float_min
990 && SvCUR(data.longest_fixed) == SvCUR(data.longest_float))
991 goto remove_float; /* As in (a)+. */
993 r->float_substr = data.longest_float;
994 r->float_min_offset = data.offset_float_min;
995 r->float_max_offset = data.offset_float_max;
996 fbm_compile(r->float_substr, 0);
997 BmUSEFUL(r->float_substr) = 100;
998 if (data.flags & SF_FL_BEFORE_EOL /* Cannot have SEOL and MULTI */
999 && (!(data.flags & SF_FL_BEFORE_MEOL)
1000 || (PL_regflags & PMf_MULTILINE)))
1001 SvTAIL_on(r->float_substr);
1005 r->float_substr = Nullsv;
1006 SvREFCNT_dec(data.longest_float);
1007 longest_float_length = 0;
1010 longest_fixed_length = CHR_SVLEN(data.longest_fixed);
1011 if (longest_fixed_length
1012 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
1013 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1014 || (PL_regflags & PMf_MULTILINE)))) {
1015 r->anchored_substr = data.longest_fixed;
1016 r->anchored_offset = data.offset_fixed;
1017 fbm_compile(r->anchored_substr, 0);
1018 BmUSEFUL(r->anchored_substr) = 100;
1019 if (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
1020 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1021 || (PL_regflags & PMf_MULTILINE)))
1022 SvTAIL_on(r->anchored_substr);
1025 r->anchored_substr = Nullsv;
1026 SvREFCNT_dec(data.longest_fixed);
1027 longest_fixed_length = 0;
1030 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
1031 if (longest_fixed_length > longest_float_length) {
1032 r->check_substr = r->anchored_substr;
1033 r->check_offset_min = r->check_offset_max = r->anchored_offset;
1034 if (r->reganch & ROPT_ANCH_SINGLE)
1035 r->reganch |= ROPT_NOSCAN;
1038 r->check_substr = r->float_substr;
1039 r->check_offset_min = data.offset_float_min;
1040 r->check_offset_max = data.offset_float_max;
1044 /* Several toplevels. Best we can is to set minlen. */
1047 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
1048 scan = r->program + 1;
1049 minlen = study_chunk(&scan, &fake, scan + PL_regsize, NULL, 0);
1050 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
1054 if (PL_regseen & REG_SEEN_GPOS)
1055 r->reganch |= ROPT_GPOS_SEEN;
1056 if (PL_regseen & REG_SEEN_LOOKBEHIND)
1057 r->reganch |= ROPT_LOOKBEHIND_SEEN;
1058 if (PL_regseen & REG_SEEN_EVAL)
1059 r->reganch |= ROPT_EVAL_SEEN;
1060 Newz(1002, r->startp, PL_regnpar, char*);
1061 Newz(1002, r->endp, PL_regnpar, char*);
1062 DEBUG_r(regdump(r));
1067 - reg - regular expression, i.e. main body or parenthesized thing
1069 * Caller must absorb opening parenthesis.
1071 * Combining parenthesis handling with the base level of regular expression
1072 * is a trifle forced, but the need to tie the tails of the branches to what
1073 * follows makes it hard to avoid.
1076 reg(I32 paren, I32 *flagp)
1077 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
1080 register regnode *ret; /* Will be the head of the group. */
1081 register regnode *br;
1082 register regnode *lastbr;
1083 register regnode *ender = 0;
1084 register I32 parno = 0;
1085 I32 flags, oregflags = PL_regflags, have_branch = 0, open = 0;
1088 *flagp = 0; /* Tentatively. */
1090 /* Make an OPEN node, if parenthesized. */
1092 if (*PL_regcomp_parse == '?') {
1093 U16 posflags = 0, negflags = 0;
1094 U16 *flagsp = &posflags;
1098 paren = *PL_regcomp_parse++;
1099 ret = NULL; /* For look-ahead/behind. */
1102 PL_regseen |= REG_SEEN_LOOKBEHIND;
1103 if (*PL_regcomp_parse == '!')
1105 if (*PL_regcomp_parse != '=' && *PL_regcomp_parse != '!')
1116 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1119 while (*PL_regcomp_parse && *PL_regcomp_parse != ')')
1121 if (*PL_regcomp_parse != ')')
1122 FAIL("Sequence (?#... not terminated");
1128 paren = *PL_regcomp_parse++;
1133 I32 count = 1, n = 0;
1135 char *s = PL_regcomp_parse;
1137 OP_4tree *sop, *rop;
1140 PL_regseen |= REG_SEEN_EVAL;
1141 while (count && (c = *PL_regcomp_parse)) {
1142 if (c == '\\' && PL_regcomp_parse[1])
1150 if (*PL_regcomp_parse != ')')
1151 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1155 if (PL_regcomp_parse - 1 - s)
1156 sv = newSVpv(s, PL_regcomp_parse - 1 - s);
1158 sv = newSVpv("", 0);
1160 rop = sv_compile_2op(sv, &sop, "re", &av);
1162 n = add_data(3, "nso");
1163 PL_regcomp_rx->data->data[n] = (void*)rop;
1164 PL_regcomp_rx->data->data[n+1] = (void*)av;
1165 PL_regcomp_rx->data->data[n+2] = (void*)sop;
1168 else { /* First pass */
1169 if (PL_reginterp_cnt < ++PL_seen_evals
1170 && PL_curcop != &PL_compiling)
1171 /* No compiled RE interpolated, has runtime
1172 components ===> unsafe. */
1173 FAIL("Eval-group not allowed at runtime, use re 'eval'");
1175 FAIL("Eval-group in insecure regular expression");
1180 ret = reg_node(LOGICAL);
1183 regtail(ret, reganode(EVAL, n));
1186 return reganode(EVAL, n);
1190 if (PL_regcomp_parse[0] == '?') {
1191 if (PL_regcomp_parse[1] == '=' || PL_regcomp_parse[1] == '!'
1192 || PL_regcomp_parse[1] == '<'
1193 || PL_regcomp_parse[1] == '{') { /* Lookahead or eval. */
1196 ret = reg_node(LOGICAL);
1199 regtail(ret, reg(1, &flag));
1203 else if (PL_regcomp_parse[0] >= '1' && PL_regcomp_parse[0] <= '9' ) {
1204 parno = atoi(PL_regcomp_parse++);
1206 while (isDIGIT(*PL_regcomp_parse))
1208 ret = reganode(GROUPP, parno);
1209 if ((c = *nextchar()) != ')')
1210 FAIL2("Switch (?(number%c not recognized", c);
1212 regtail(ret, reganode(IFTHEN, 0));
1213 br = regbranch(&flags, 1);
1215 br = reganode(LONGJMP, 0);
1217 regtail(br, reganode(LONGJMP, 0));
1222 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1223 regbranch(&flags, 1);
1224 regtail(ret, lastbr);
1232 FAIL("Switch (?(condition)... contains too many branches");
1233 ender = reg_node(TAIL);
1236 regtail(lastbr, ender);
1237 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1240 regtail(ret, ender);
1244 FAIL2("Unknown condition for (?(%.2s", PL_regcomp_parse);
1248 FAIL("Sequence (? incomplete");
1253 while (*PL_regcomp_parse && strchr("iogcmsx", *PL_regcomp_parse)) {
1254 if (*PL_regcomp_parse != 'o')
1255 pmflag(flagsp, *PL_regcomp_parse);
1258 if (*PL_regcomp_parse == '-') {
1263 PL_regflags |= posflags;
1264 PL_regflags &= ~negflags;
1265 if (*PL_regcomp_parse == ':') {
1271 if (*PL_regcomp_parse != ')')
1272 FAIL2("Sequence (?%c...) not recognized", *PL_regcomp_parse);
1281 ret = reganode(OPEN, parno);
1288 /* Pick up the branches, linking them together. */
1289 br = regbranch(&flags, 1);
1292 if (*PL_regcomp_parse == '|') {
1293 if (!SIZE_ONLY && PL_extralen) {
1294 reginsert(BRANCHJ, br);
1297 reginsert(BRANCH, br);
1300 PL_extralen += 1; /* For BRANCHJ-BRANCH. */
1302 else if (paren == ':') {
1303 *flagp |= flags&SIMPLE;
1305 if (open) { /* Starts with OPEN. */
1306 regtail(ret, br); /* OPEN -> first. */
1308 else if (paren != '?') /* Not Conditional */
1312 *flagp |= flags&SPSTART;
1314 while (*PL_regcomp_parse == '|') {
1315 if (!SIZE_ONLY && PL_extralen) {
1316 ender = reganode(LONGJMP,0);
1317 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1320 PL_extralen += 2; /* Account for LONGJMP. */
1322 br = regbranch(&flags, 0);
1325 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1329 *flagp |= flags&SPSTART;
1332 if (have_branch || paren != ':') {
1333 /* Make a closing node, and hook it on the end. */
1336 ender = reg_node(TAIL);
1339 ender = reganode(CLOSE, parno);
1345 *flagp &= ~HASWIDTH;
1348 ender = reg_node(SUCCEED);
1351 ender = reg_node(END);
1354 regtail(lastbr, ender);
1357 /* Hook the tails of the branches to the closing node. */
1358 for (br = ret; br != NULL; br = regnext(br)) {
1359 regoptail(br, ender);
1366 static char parens[] = "=!<,>";
1368 if (paren && (p = strchr(parens, paren))) {
1369 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1370 int flag = (p - parens) > 1;
1373 node = SUSPEND, flag = 0;
1374 reginsert(node,ret);
1376 regtail(ret, reg_node(TAIL));
1380 /* Check for proper termination. */
1381 if (paren && (PL_regcomp_parse >= PL_regxend || *nextchar() != ')')) {
1382 FAIL("unmatched () in regexp");
1384 else if (!paren && PL_regcomp_parse < PL_regxend) {
1385 if (*PL_regcomp_parse == ')') {
1386 FAIL("unmatched () in regexp");
1389 FAIL("junk on end of regexp"); /* "Can't happen". */
1393 PL_regflags = oregflags;
1400 - regbranch - one alternative of an | operator
1402 * Implements the concatenation operator.
1405 regbranch(I32 *flagp, I32 first)
1408 register regnode *ret;
1409 register regnode *chain = NULL;
1410 register regnode *latest;
1411 I32 flags = 0, c = 0;
1416 if (!SIZE_ONLY && PL_extralen)
1417 ret = reganode(BRANCHJ,0);
1419 ret = reg_node(BRANCH);
1422 if (!first && SIZE_ONLY)
1423 PL_extralen += 1; /* BRANCHJ */
1425 *flagp = WORST; /* Tentatively. */
1429 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '|' && *PL_regcomp_parse != ')') {
1431 latest = regpiece(&flags);
1432 if (latest == NULL) {
1433 if (flags & TRYAGAIN)
1437 else if (ret == NULL)
1439 *flagp |= flags&HASWIDTH;
1440 if (chain == NULL) /* First piece. */
1441 *flagp |= flags&SPSTART;
1444 regtail(chain, latest);
1449 if (chain == NULL) { /* Loop ran zero times. */
1450 chain = reg_node(NOTHING);
1455 *flagp |= flags&SIMPLE;
1462 - regpiece - something followed by possible [*+?]
1464 * Note that the branching code sequences used for ? and the general cases
1465 * of * and + are somewhat optimized: they use the same NOTHING node as
1466 * both the endmarker for their branch list and the body of the last branch.
1467 * It might seem that this node could be dispensed with entirely, but the
1468 * endmarker role is not redundant.
1471 regpiece(I32 *flagp)
1474 register regnode *ret;
1476 register char *next;
1478 char *origparse = PL_regcomp_parse;
1481 I32 max = REG_INFTY;
1483 ret = regatom(&flags);
1485 if (flags & TRYAGAIN)
1490 op = *PL_regcomp_parse;
1492 if (op == '{' && regcurly(PL_regcomp_parse)) {
1493 next = PL_regcomp_parse + 1;
1495 while (isDIGIT(*next) || *next == ',') {
1504 if (*next == '}') { /* got one */
1508 min = atoi(PL_regcomp_parse);
1512 maxpos = PL_regcomp_parse;
1514 if (!max && *maxpos != '0')
1515 max = REG_INFTY; /* meaning "infinity" */
1516 else if (max >= REG_INFTY)
1517 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
1518 PL_regcomp_parse = next;
1522 if ((flags&SIMPLE)) {
1523 PL_regnaughty += 2 + PL_regnaughty / 2;
1524 reginsert(CURLY, ret);
1527 PL_regnaughty += 4 + PL_regnaughty; /* compound interest */
1528 regtail(ret, reg_node(WHILEM));
1529 if (!SIZE_ONLY && PL_extralen) {
1530 reginsert(LONGJMP,ret);
1531 reginsert(NOTHING,ret);
1532 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1534 reginsert(CURLYX,ret);
1535 if (!SIZE_ONLY && PL_extralen)
1536 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1537 regtail(ret, reg_node(NOTHING));
1547 if (max && max < min)
1548 FAIL("Can't do {n,m} with n > m");
1563 #if 0 /* Now runtime fix should be reliable. */
1564 if (!(flags&HASWIDTH) && op != '?')
1565 FAIL("regexp *+ operand could be empty");
1570 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
1572 if (op == '*' && (flags&SIMPLE)) {
1573 reginsert(STAR, ret);
1577 else if (op == '*') {
1581 else if (op == '+' && (flags&SIMPLE)) {
1582 reginsert(PLUS, ret);
1586 else if (op == '+') {
1590 else if (op == '?') {
1595 if (ckWARN(WARN_UNSAFE) && !SIZE_ONLY && !(flags&HASWIDTH) && max > REG_INFTY/3) {
1596 warner(WARN_UNSAFE, "%.*s matches null string many times",
1597 PL_regcomp_parse - origparse, origparse);
1600 if (*PL_regcomp_parse == '?') {
1602 reginsert(MINMOD, ret);
1603 regtail(ret, ret + NODE_STEP_REGNODE);
1605 if (ISMULT2(PL_regcomp_parse))
1606 FAIL("nested *?+ in regexp");
1612 - regatom - the lowest level
1614 * Optimization: gobbles an entire sequence of ordinary characters so that
1615 * it can turn them into a single node, which is smaller to store and
1616 * faster to run. Backslashed characters are exceptions, each becoming a
1617 * separate node; the code is simpler that way and it's not worth fixing.
1619 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1625 register regnode *ret = 0;
1628 *flagp = WORST; /* Tentatively. */
1631 switch (*PL_regcomp_parse) {
1635 if (PL_regflags & PMf_MULTILINE)
1636 ret = reg_node(MBOL);
1637 else if (PL_regflags & PMf_SINGLELINE)
1638 ret = reg_node(SBOL);
1640 ret = reg_node(BOL);
1643 if (PL_regcomp_parse[1])
1646 if (PL_regflags & PMf_MULTILINE)
1647 ret = reg_node(MEOL);
1648 else if (PL_regflags & PMf_SINGLELINE)
1649 ret = reg_node(SEOL);
1651 ret = reg_node(EOL);
1656 if (PL_regflags & PMf_SINGLELINE)
1657 ret = reg_node(SANYUTF8);
1659 ret = reg_node(ANYUTF8);
1663 if (PL_regflags & PMf_SINGLELINE)
1664 ret = reg_node(SANY);
1666 ret = reg_node(REG_ANY);
1667 *flagp |= HASWIDTH|SIMPLE;
1673 ret = (UTF ? regclassutf8() : regclass());
1674 if (*PL_regcomp_parse != ']')
1675 FAIL("unmatched [] in regexp");
1677 *flagp |= HASWIDTH|SIMPLE;
1681 ret = reg(1, &flags);
1683 if (flags & TRYAGAIN)
1687 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
1691 if (flags & TRYAGAIN) {
1695 FAIL2("internal urp in regexp at /%s/", PL_regcomp_parse);
1696 /* Supposed to be caught earlier. */
1699 if (!regcurly(PL_regcomp_parse)) {
1707 FAIL("?+*{} follows nothing in regexp");
1710 switch (*++PL_regcomp_parse) {
1713 ret = reg_node(SBOL);
1718 ret = reg_node(GPOS);
1719 PL_regseen |= REG_SEEN_GPOS;
1724 ret = reg_node(SEOL);
1729 ret = reg_node(EOS);
1731 PL_seen_zerolen++; /* Do not optimize RE away */
1735 ret = reg_node(SANY);
1736 *flagp |= HASWIDTH|SIMPLE;
1740 ret = reg_node(CLUMP);
1743 if (UTF && !PL_utf8_mark)
1744 is_utf8_mark((U8*)"~"); /* preload table */
1749 ? (LOC ? ALNUMLUTF8 : ALNUMUTF8)
1750 : (LOC ? ALNUML : ALNUM));
1751 *flagp |= HASWIDTH|SIMPLE;
1753 if (UTF && !PL_utf8_alnum)
1754 is_utf8_alnum((U8*)"a"); /* preload table */
1759 ? (LOC ? NALNUMLUTF8 : NALNUMUTF8)
1760 : (LOC ? NALNUML : NALNUM));
1761 *flagp |= HASWIDTH|SIMPLE;
1763 if (UTF && !PL_utf8_alnum)
1764 is_utf8_alnum((U8*)"a"); /* preload table */
1770 ? (LOC ? BOUNDLUTF8 : BOUNDUTF8)
1771 : (LOC ? BOUNDL : BOUND));
1774 if (UTF && !PL_utf8_alnum)
1775 is_utf8_alnum((U8*)"a"); /* preload table */
1781 ? (LOC ? NBOUNDLUTF8 : NBOUNDUTF8)
1782 : (LOC ? NBOUNDL : NBOUND));
1785 if (UTF && !PL_utf8_alnum)
1786 is_utf8_alnum((U8*)"a"); /* preload table */
1791 ? (LOC ? SPACELUTF8 : SPACEUTF8)
1792 : (LOC ? SPACEL : SPACE));
1793 *flagp |= HASWIDTH|SIMPLE;
1795 if (UTF && !PL_utf8_space)
1796 is_utf8_space((U8*)" "); /* preload table */
1801 ? (LOC ? NSPACELUTF8 : NSPACEUTF8)
1802 : (LOC ? NSPACEL : NSPACE));
1803 *flagp |= HASWIDTH|SIMPLE;
1805 if (UTF && !PL_utf8_space)
1806 is_utf8_space((U8*)" "); /* preload table */
1809 ret = reg_node(UTF ? DIGITUTF8 : DIGIT);
1810 *flagp |= HASWIDTH|SIMPLE;
1812 if (UTF && !PL_utf8_digit)
1813 is_utf8_digit((U8*)"1"); /* preload table */
1816 ret = reg_node(UTF ? NDIGITUTF8 : NDIGIT);
1817 *flagp |= HASWIDTH|SIMPLE;
1819 if (UTF && !PL_utf8_digit)
1820 is_utf8_digit((U8*)"1"); /* preload table */
1824 { /* a lovely hack--pretend we saw [\pX] instead */
1825 char* oldregxend = PL_regxend;
1827 if (PL_regcomp_parse[1] == '{') {
1828 PL_regxend = strchr(PL_regcomp_parse, '}');
1830 FAIL("Missing right brace on \\p{}");
1834 PL_regxend = PL_regcomp_parse + 2;
1837 ret = regclassutf8();
1839 PL_regxend = oldregxend;
1842 *flagp |= HASWIDTH|SIMPLE;
1855 case '1': case '2': case '3': case '4':
1856 case '5': case '6': case '7': case '8': case '9':
1858 I32 num = atoi(PL_regcomp_parse);
1860 if (num > 9 && num >= PL_regnpar)
1863 if (!SIZE_ONLY && num > PL_regcomp_rx->nparens)
1864 FAIL("reference to nonexistent group");
1867 ? (LOC ? REFFL : REFF)
1870 while (isDIGIT(*PL_regcomp_parse))
1878 if (PL_regcomp_parse >= PL_regxend)
1879 FAIL("trailing \\ in regexp");
1882 /* Do not generate `unrecognized' warnings here, we fall
1883 back into the quick-grab loop below */
1889 if (PL_regflags & PMf_EXTENDED) {
1890 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '\n') PL_regcomp_parse++;
1891 if (PL_regcomp_parse < PL_regxend)
1907 ? (LOC ? EXACTFL : EXACTF)
1909 s = (char *) OPERAND(ret);
1910 regc(0, s++); /* save spot for len */
1911 for (len = 0, p = PL_regcomp_parse - 1;
1912 len < 127 && p < PL_regxend;
1917 if (PL_regflags & PMf_EXTENDED)
1918 p = regwhite(p, PL_regxend);
1972 char* e = strchr(p, '}');
1975 FAIL("Missing right brace on \\x{}");
1977 ender = scan_hex(p + 1, e - p, &numlen);
1978 if (numlen + len >= 127) { /* numlen is generous */
1985 FAIL("Can't use \\x{} without 'use utf8' declaration");
1988 ender = scan_hex(p, 2, &numlen);
1994 ender = UCHARAT(p++);
1995 ender = toCTRL(ender);
1997 case '0': case '1': case '2': case '3':case '4':
1998 case '5': case '6': case '7': case '8':case '9':
2000 (isDIGIT(p[1]) && atoi(p) >= PL_regnpar) ) {
2001 ender = scan_oct(p, 3, &numlen);
2010 if (p >= PL_regxend)
2011 FAIL("trailing \\ in regexp");
2014 if (!SIZE_ONLY && ckWARN(WARN_UNSAFE) && isALPHA(*p))
2016 "/%.127s/: Unrecognized escape \\%c passed through",
2019 goto normal_default;
2024 if ((*p & 0xc0) == 0xc0 && UTF) {
2025 ender = utf8_to_uv((U8*)p, &numlen);
2032 if (PL_regflags & PMf_EXTENDED)
2033 p = regwhite(p, PL_regxend);
2036 ender = toLOWER_LC_uni(ender);
2038 ender = toLOWER_uni(ender);
2040 if (ISMULT2(p)) { /* Back off on ?+*. */
2043 else if (ender >= 0x80 && UTF) {
2044 reguni(ender, s, &numlen);
2054 if (ender >= 0x80 && UTF) {
2055 reguni(ender, s, &numlen);
2063 PL_regcomp_parse = p - 1;
2066 FAIL("internal disaster in regexp");
2072 *OPERAND(ret) = len;
2075 PL_regsize += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2078 PL_regcode += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2088 regwhite(char *p, char *e)
2093 else if (*p == '#') {
2096 } while (p < e && *p != '\n');
2104 /* parse POSIX character classes like [[:foo:]] */
2106 regpposixcc(I32 value)
2111 if (value == '[' && PL_regcomp_parse + 1 < PL_regxend &&
2112 /* I smell either [: or [= or [. -- POSIX has been here, right? */
2113 (*PL_regcomp_parse == ':' ||
2114 *PL_regcomp_parse == '=' ||
2115 *PL_regcomp_parse == '.')) {
2116 char c = *PL_regcomp_parse;
2117 char* s = PL_regcomp_parse++;
2119 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != c)
2121 if (PL_regcomp_parse == PL_regxend)
2122 /* Grandfather lone [:, [=, [. */
2123 PL_regcomp_parse = s;
2125 PL_regcomp_parse++; /* skip over the c */
2126 if (*PL_regcomp_parse == ']') {
2127 /* Not Implemented Yet.
2128 * (POSIX Extended Character Classes, that is)
2129 * The text between e.g. [: and :] would start
2130 * at s + 1 and stop at regcomp_parse - 2. */
2131 if (ckWARN(WARN_UNSAFE) && !SIZE_ONLY)
2133 "Character class syntax [%c %c] is reserved for future extensions", c, c);
2134 PL_regcomp_parse++; /* skip over the ending ] */
2147 register char *opnd, *s;
2149 register I32 lastvalue = 1234;
2150 register I32 range = 0;
2151 register regnode *ret;
2155 s = opnd = (char *) OPERAND(PL_regcode);
2156 ret = reg_node(ANYOF);
2157 for (value = 0; value < 33; value++)
2159 if (*PL_regcomp_parse == '^') { /* Complement of range. */
2163 *opnd |= ANYOF_INVERT;
2166 PL_regcode += ANY_SKIP;
2168 *opnd |= ANYOF_FOLD;
2170 *opnd |= ANYOF_LOCALE;
2173 PL_regsize += ANY_SKIP;
2175 if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-')
2176 goto skipcond; /* allow 1st char to be ] or - */
2177 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') {
2179 value = UCHARAT(PL_regcomp_parse++);
2181 (void)regpposixcc(value); /* ignore the return value for now */
2182 else if (value == '\\') {
2183 value = UCHARAT(PL_regcomp_parse++);
2188 *opnd |= ANYOF_ALNUML;
2190 for (value = 0; value < 256; value++)
2192 ANYOF_SET(opnd, value);
2200 *opnd |= ANYOF_NALNUML;
2202 for (value = 0; value < 256; value++)
2203 if (!isALNUM(value))
2204 ANYOF_SET(opnd, value);
2212 *opnd |= ANYOF_SPACEL;
2214 for (value = 0; value < 256; value++)
2216 ANYOF_SET(opnd, value);
2224 *opnd |= ANYOF_NSPACEL;
2226 for (value = 0; value < 256; value++)
2227 if (!isSPACE(value))
2228 ANYOF_SET(opnd, value);
2235 for (value = '0'; value <= '9'; value++)
2236 ANYOF_SET(opnd, value);
2242 for (value = 0; value < '0'; value++)
2243 ANYOF_SET(opnd, value);
2244 for (value = '9' + 1; value < 256; value++)
2245 ANYOF_SET(opnd, value);
2271 value = scan_hex(PL_regcomp_parse, 2, &numlen);
2272 PL_regcomp_parse += numlen;
2275 value = UCHARAT(PL_regcomp_parse++);
2276 value = toCTRL(value);
2278 case '0': case '1': case '2': case '3': case '4':
2279 case '5': case '6': case '7': case '8': case '9':
2280 value = scan_oct(--PL_regcomp_parse, 3, &numlen);
2281 PL_regcomp_parse += numlen;
2286 if (lastvalue > value)
2287 FAIL("invalid [] range in regexp");
2292 if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend &&
2293 PL_regcomp_parse[1] != ']') {
2296 continue; /* do it next time */
2301 if ((isLOWER(lastvalue) && isLOWER(value)) ||
2302 (isUPPER(lastvalue) && isUPPER(value)))
2305 if (isLOWER(lastvalue)) {
2306 for (i = lastvalue; i <= value; i++)
2310 for (i = lastvalue; i <= value; i++)
2317 for ( ; lastvalue <= value; lastvalue++)
2318 ANYOF_SET(opnd, lastvalue);
2322 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
2323 if (!SIZE_ONLY && (*opnd & (0xFF ^ ANYOF_INVERT)) == ANYOF_FOLD) {
2324 for (value = 0; value < 256; ++value) {
2325 if (ANYOF_TEST(opnd, value)) {
2326 I32 cf = PL_fold[value];
2327 ANYOF_SET(opnd, cf);
2330 *opnd &= ~ANYOF_FOLD;
2332 /* optimize inverted simple patterns (e.g. [^a-z]) */
2333 if (!SIZE_ONLY && (*opnd & 0xFF) == ANYOF_INVERT) {
2334 for (value = 0; value < 32; ++value)
2335 opnd[1 + value] ^= 0xFF;
2344 register char *opnd, *e;
2346 register U32 lastvalue = 123456;
2347 register I32 range = 0;
2348 register regnode *ret;
2355 if (*PL_regcomp_parse == '^') { /* Complement of range. */
2359 flags |= ANYOF_INVERT;
2363 flags |= ANYOF_FOLD;
2365 flags |= ANYOF_LOCALE;
2366 listsv = newSVpv("# comment\n",0);
2369 if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-')
2370 goto skipcond; /* allow 1st char to be ] or - */
2372 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') {
2374 value = utf8_to_uv((U8*)PL_regcomp_parse, &numlen);
2375 PL_regcomp_parse += numlen;
2378 (void)regpposixcc(value); /* ignore the return value for now */
2379 else if (value == '\\') {
2380 value = utf8_to_uv((U8*)PL_regcomp_parse, &numlen);
2381 PL_regcomp_parse += numlen;
2386 flags |= ANYOF_ALNUML;
2388 sv_catpvf(listsv, "+utf8::IsAlnum\n");
2395 flags |= ANYOF_NALNUML;
2398 "-utf8::IsAlpha\n-utf8::IsDigit\n0000\t%04x\n%04x\tffff\n",
2407 flags |= ANYOF_SPACEL;
2408 sv_catpvf(listsv, "+utf8::IsSpace\n");
2410 is_utf8_space((U8*)" ");
2417 flags |= ANYOF_NSPACEL;
2419 "!utf8::IsSpace\n");
2421 is_utf8_space((U8*)" ");
2427 sv_catpvf(listsv, "+utf8::IsDigit\n");
2434 "!utf8::IsDigit\n");
2440 if (*PL_regcomp_parse == '{') {
2441 e = strchr(PL_regcomp_parse++, '}');
2443 FAIL("Missing right brace on \\p{}");
2444 n = e - PL_regcomp_parse;
2447 e = PL_regcomp_parse;
2452 sv_catpvf(listsv, "+utf8::%.*s\n", n, PL_regcomp_parse);
2455 "!utf8::%.*s\n", n, PL_regcomp_parse);
2457 PL_regcomp_parse = e + 1;
2482 if (*PL_regcomp_parse == '{') {
2483 e = strchr(PL_regcomp_parse++, '}');
2485 FAIL("Missing right brace on \\x{}");
2486 value = scan_hex(PL_regcomp_parse + 1, e - PL_regcomp_parse, &numlen);
2487 PL_regcomp_parse = e + 1;
2490 value = scan_hex(PL_regcomp_parse, 2, &numlen);
2491 PL_regcomp_parse += numlen;
2495 value = UCHARAT(PL_regcomp_parse++);
2496 value = toCTRL(value);
2498 case '0': case '1': case '2': case '3': case '4':
2499 case '5': case '6': case '7': case '8': case '9':
2500 value = scan_oct(--PL_regcomp_parse, 3, &numlen);
2501 PL_regcomp_parse += numlen;
2506 if (lastvalue > value)
2507 FAIL("invalid [] range in regexp");
2509 sv_catpvf(listsv, "%04x\t%04x\n", lastvalue, value);
2515 if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend &&
2516 PL_regcomp_parse[1] != ']') {
2519 continue; /* do it next time */
2522 sv_catpvf(listsv, "%04x\n", value);
2526 ret = reganode(ANYOFUTF8, 0);
2529 SV *rv = swash_init("utf8", "", listsv, 1, 0);
2530 SvREFCNT_dec(listsv);
2531 n = add_data(1,"s");
2532 PL_regcomp_rx->data->data[n] = (void*)rv;
2533 ARG1_SET(ret, flags);
2544 char* retval = PL_regcomp_parse++;
2547 if (*PL_regcomp_parse == '(' && PL_regcomp_parse[1] == '?' &&
2548 PL_regcomp_parse[2] == '#') {
2549 while (*PL_regcomp_parse && *PL_regcomp_parse != ')')
2554 if (PL_regflags & PMf_EXTENDED) {
2555 if (isSPACE(*PL_regcomp_parse)) {
2559 else if (*PL_regcomp_parse == '#') {
2560 while (*PL_regcomp_parse && *PL_regcomp_parse != '\n')
2571 - reg_node - emit a node
2573 STATIC regnode * /* Location. */
2577 register regnode *ret;
2578 register regnode *ptr;
2582 SIZE_ALIGN(PL_regsize);
2587 NODE_ALIGN_FILL(ret);
2589 FILL_ADVANCE_NODE(ptr, op);
2596 - reganode - emit a node with an argument
2598 STATIC regnode * /* Location. */
2599 reganode(U8 op, U32 arg)
2602 register regnode *ret;
2603 register regnode *ptr;
2607 SIZE_ALIGN(PL_regsize);
2612 NODE_ALIGN_FILL(ret);
2614 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
2621 - regc - emit (if appropriate) a Unicode character
2624 reguni(UV uv, char* s, I32* lenp)
2629 *lenp = uv_to_utf8(tmpbuf, uv) - tmpbuf;
2632 *lenp = uv_to_utf8((U8*)s, uv) - (U8*)s;
2637 - regc - emit (if appropriate) a byte of code
2648 - reginsert - insert an operator in front of already-emitted operand
2650 * Means relocating the operand.
2653 reginsert(U8 op, regnode *opnd)
2656 register regnode *src;
2657 register regnode *dst;
2658 register regnode *place;
2659 register int offset = regarglen[(U8)op];
2661 /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
2664 PL_regsize += NODE_STEP_REGNODE + offset;
2669 PL_regcode += NODE_STEP_REGNODE + offset;
2672 StructCopy(--src, --dst, regnode);
2674 place = opnd; /* Op node, where operand used to be. */
2675 src = NEXTOPER(place);
2676 FILL_ADVANCE_NODE(place, op);
2677 Zero(src, offset, regnode);
2681 - regtail - set the next-pointer at the end of a node chain of p to val.
2684 regtail(regnode *p, regnode *val)
2687 register regnode *scan;
2688 register regnode *temp;
2689 register I32 offset;
2694 /* Find last node. */
2697 temp = regnext(scan);
2703 if (reg_off_by_arg[OP(scan)]) {
2704 ARG_SET(scan, val - scan);
2707 NEXT_OFF(scan) = val - scan;
2712 - regoptail - regtail on operand of first argument; nop if operandless
2715 regoptail(regnode *p, regnode *val)
2718 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
2719 if (p == NULL || SIZE_ONLY)
2721 if (PL_regkind[(U8)OP(p)] == BRANCH) {
2722 regtail(NEXTOPER(p), val);
2724 else if ( PL_regkind[(U8)OP(p)] == BRANCHJ) {
2725 regtail(NEXTOPER(NEXTOPER(p)), val);
2732 - regcurly - a little FSA that accepts {\d+,?\d*}
2735 regcurly(register char *s)
2754 dumpuntil(regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
2757 register char op = EXACT; /* Arbitrary non-END op. */
2758 register regnode *next, *onode;
2760 while (op != END && (!last || node < last)) {
2761 /* While that wasn't END last time... */
2767 next = regnext(node);
2769 if (OP(node) == OPTIMIZED)
2772 PerlIO_printf(Perl_debug_log, "%4d:%*s%s", node - start,
2773 2*l + 1, "", SvPVX(sv));
2774 if (next == NULL) /* Next ptr. */
2775 PerlIO_printf(Perl_debug_log, "(0)");
2777 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
2778 (void)PerlIO_putc(Perl_debug_log, '\n');
2780 if (PL_regkind[(U8)op] == BRANCHJ) {
2781 register regnode *nnode = (OP(next) == LONGJMP
2784 if (last && nnode > last)
2786 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
2788 else if (PL_regkind[(U8)op] == BRANCH) {
2789 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
2791 else if ( op == CURLY) { /* `next' might be very big: optimizer */
2792 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2793 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
2795 else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) {
2796 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2799 else if ( op == PLUS || op == STAR) {
2800 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
2802 else if (op == ANYOF) {
2803 node = NEXTOPER(node);
2806 else if (PL_regkind[(U8)op] == EXACT) {
2807 /* Literal string, where present. */
2808 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2809 node = NEXTOPER(node);
2812 node = NEXTOPER(node);
2813 node += regarglen[(U8)op];
2815 if (op == CURLYX || op == OPEN)
2817 else if (op == WHILEM)
2820 #endif /* DEBUGGING */
2825 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
2832 SV *sv = sv_newmortal();
2834 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
2836 /* Header fields of interest. */
2837 if (r->anchored_substr)
2838 PerlIO_printf(Perl_debug_log, "anchored `%s%s%s'%s at %d ",
2840 SvPVX(r->anchored_substr),
2842 SvTAIL(r->anchored_substr) ? "$" : "",
2843 r->anchored_offset);
2844 if (r->float_substr)
2845 PerlIO_printf(Perl_debug_log, "floating `%s%s%s'%s at %d..%u ",
2847 SvPVX(r->float_substr),
2849 SvTAIL(r->float_substr) ? "$" : "",
2850 r->float_min_offset, r->float_max_offset);
2851 if (r->check_substr)
2852 PerlIO_printf(Perl_debug_log,
2853 r->check_substr == r->float_substr
2854 ? "(checking floating" : "(checking anchored");
2855 if (r->reganch & ROPT_NOSCAN)
2856 PerlIO_printf(Perl_debug_log, " noscan");
2857 if (r->reganch & ROPT_CHECK_ALL)
2858 PerlIO_printf(Perl_debug_log, " isall");
2859 if (r->check_substr)
2860 PerlIO_printf(Perl_debug_log, ") ");
2862 if (r->regstclass) {
2863 regprop(sv, r->regstclass);
2864 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
2866 if (r->reganch & ROPT_ANCH) {
2867 PerlIO_printf(Perl_debug_log, "anchored");
2868 if (r->reganch & ROPT_ANCH_BOL)
2869 PerlIO_printf(Perl_debug_log, "(BOL)");
2870 if (r->reganch & ROPT_ANCH_MBOL)
2871 PerlIO_printf(Perl_debug_log, "(MBOL)");
2872 if (r->reganch & ROPT_ANCH_GPOS)
2873 PerlIO_printf(Perl_debug_log, "(GPOS)");
2874 PerlIO_putc(Perl_debug_log, ' ');
2876 if (r->reganch & ROPT_GPOS_SEEN)
2877 PerlIO_printf(Perl_debug_log, "GPOS ");
2878 if (r->reganch & ROPT_SKIP)
2879 PerlIO_printf(Perl_debug_log, "plus ");
2880 if (r->reganch & ROPT_IMPLICIT)
2881 PerlIO_printf(Perl_debug_log, "implicit ");
2882 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
2883 if (r->reganch & ROPT_EVAL_SEEN)
2884 PerlIO_printf(Perl_debug_log, "with eval ");
2885 PerlIO_printf(Perl_debug_log, "\n");
2886 #endif /* DEBUGGING */
2890 - regprop - printable representation of opcode
2893 regprop(SV *sv, regnode *o)
2897 register char *p = 0;
2899 sv_setpvn(sv, "", 0);
2944 sv_catpvf(sv, "EXACT <%s%s%s>", PL_colors[0], OPERAND(o) + 1, PL_colors[1]);
2947 sv_catpvf(sv, "EXACTF <%s%s%s>", PL_colors[0], OPERAND(o) + 1, PL_colors[1]);
2950 sv_catpvf(sv, "EXACTFL <%s%s%s>", PL_colors[0], OPERAND(o) + 1, PL_colors[1]);
2977 sv_catpvf(sv, "CURLY {%d,%d}", ARG1(o), ARG2(o));
2980 sv_catpvf(sv, "CURLYM[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2983 sv_catpvf(sv, "CURLYN[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2986 sv_catpvf(sv, "CURLYX {%d,%d}", ARG1(o), ARG2(o));
2989 sv_catpvf(sv, "REF%d", ARG(o));
2992 sv_catpvf(sv, "REFF%d", ARG(o));
2995 sv_catpvf(sv, "REFFL%d", ARG(o));
2998 sv_catpvf(sv, "OPEN%d", ARG(o));
3001 sv_catpvf(sv, "CLOSE%d", ARG(o));
3017 sv_catpvf(sv, "UNLESSM[-%d]", o->flags);
3020 sv_catpvf(sv, "IFMATCH[-%d]", o->flags);
3071 sv_catpvf(sv, "GROUPP%d", ARG(o));
3074 sv_catpvf(sv, "LOGICAL[%d]", o->flags);
3086 FAIL("corrupted regexp opcode");
3090 #endif /* DEBUGGING */
3094 pregfree(struct regexp *r)
3097 if (!r || (--r->refcnt > 0))
3100 Safefree(r->precomp);
3102 Safefree(r->subbase);
3104 if (r->anchored_substr)
3105 SvREFCNT_dec(r->anchored_substr);
3106 if (r->float_substr)
3107 SvREFCNT_dec(r->float_substr);
3108 Safefree(r->substrs);
3111 int n = r->data->count;
3113 switch (r->data->what[n]) {
3115 SvREFCNT_dec((SV*)r->data->data[n]);
3118 op_free((OP_4tree*)r->data->data[n]);
3123 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
3126 Safefree(r->data->what);
3129 Safefree(r->startp);
3135 - regnext - dig the "next" pointer out of a node
3137 * [Note, when REGALIGN is defined there are two places in regmatch()
3138 * that bypass this code for speed.]
3141 regnext(register regnode *p)
3144 register I32 offset;
3146 if (p == &PL_regdummy)
3149 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
3157 re_croak2(const char* pat1,const char* pat2,...)
3160 STRLEN l1 = strlen(pat1);
3161 STRLEN l2 = strlen(pat2);
3169 Copy(pat1, buf, l1 , char);
3170 Copy(pat2, buf + l1, l2 , char);
3171 buf[l1 + l2] = '\n';
3172 buf[l1 + l2 + 1] = '\0';
3173 va_start(args, pat2);
3174 message = mess(buf, &args);
3176 l1 = strlen(message);
3179 Copy(message, buf, l1 , char);
3180 buf[l1] = '\0'; /* Overwrite \n */
3184 /* XXX Here's a total kludge. But we need to re-enter for swash routines. */
3187 save_re_context(void)
3191 SAVEPPTR(PL_regprecomp); /* uncompiled string. */
3192 SAVEI32(PL_regnpar); /* () count. */
3193 SAVEI32(PL_regsize); /* Code size. */
3194 SAVEI16(PL_regflags); /* are we folding, multilining? */
3195 SAVEPPTR(PL_reginput); /* String-input pointer. */
3196 SAVEPPTR(PL_regbol); /* Beginning of input, for ^ check. */
3197 SAVEPPTR(PL_regeol); /* End of input, for $ check. */
3198 SAVESPTR(PL_regstartp); /* Pointer to startp array. */
3199 SAVESPTR(PL_regendp); /* Ditto for endp. */
3200 SAVESPTR(PL_reglastparen); /* Similarly for lastparen. */
3201 SAVEPPTR(PL_regtill); /* How far we are required to go. */
3202 SAVEI32(PL_regprev); /* char before regbol, \n if none */
3203 SAVESPTR(PL_reg_start_tmp); /* from regexec.c */
3204 PL_reg_start_tmp = 0;
3205 SAVEFREEPV(PL_reg_start_tmp);
3206 SAVEI32(PL_reg_start_tmpl); /* from regexec.c */
3207 PL_reg_start_tmpl = 0;
3208 SAVESPTR(PL_regdata);
3209 SAVEI32(PL_reg_flags); /* from regexec.c */
3210 SAVEI32(PL_reg_eval_set); /* from regexec.c */
3211 SAVEI32(PL_regnarrate); /* from regexec.c */
3212 SAVESPTR(PL_regprogram); /* from regexec.c */
3213 SAVEINT(PL_regindent); /* from regexec.c */
3214 SAVESPTR(PL_regcc); /* from regexec.c */
3215 SAVESPTR(PL_curcop);
3216 SAVESPTR(PL_regcomp_rx); /* from regcomp.c */
3217 SAVEI32(PL_regseen); /* from regcomp.c */
3218 SAVEI32(PL_regsawback); /* Did we see \1, ...? */
3219 SAVEI32(PL_regnaughty); /* How bad is this pattern? */
3220 SAVESPTR(PL_regcode); /* Code-emit pointer; ®dummy = don't */
3221 SAVEPPTR(PL_regxend); /* End of input for compile */
3222 SAVEPPTR(PL_regcomp_parse); /* Input-scan pointer. */
3223 SAVESPTR(PL_reg_call_cc); /* from regexec.c */
3224 SAVESPTR(PL_reg_re); /* from regexec.c */
3225 SAVEPPTR(PL_reg_ganch); /* from regexec.c */
3226 SAVESPTR(PL_reg_sv); /* from regexec.c */
3227 SAVESPTR(PL_reg_magic); /* from regexec.c */
3228 SAVEI32(PL_reg_oldpos); /* from regexec.c */
3229 SAVESPTR(PL_reg_oldcurpm); /* from regexec.c */
3230 SAVESPTR(PL_reg_curpm); /* from regexec.c */
3232 SAVEPPTR(PL_reg_starttry); /* from regexec.c */