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));
151 /* Length of a variant. */
157 I32 pos_min; /* CC */
158 I32 pos_delta; /* CC */
160 I32 last_end; /* min value, <0 unless valid. */
161 I32 last_start_min; /* CC */
162 I32 last_start_max; /* CC */
163 SV **longest; /* Either &l_fixed, or &l_float. */
165 I32 offset_fixed; /* CC */
167 I32 offset_float_min; /* CC */
168 I32 offset_float_max; /* CC */
173 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
175 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
176 #define SF_BEFORE_SEOL 0x1
177 #define SF_BEFORE_MEOL 0x2
178 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
179 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
182 # define SF_FIX_SHIFT_EOL (0+2)
183 # define SF_FL_SHIFT_EOL (0+4)
185 # define SF_FIX_SHIFT_EOL (+2)
186 # define SF_FL_SHIFT_EOL (+4)
189 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
190 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
192 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
193 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
194 #define SF_IS_INF 0x40
195 #define SF_HAS_PAR 0x80
196 #define SF_IN_PAR 0x100
197 #define SF_HAS_EVAL 0x200
198 #define SCF_DO_SUBSTR 0x400
201 #define UTF (PL_reg_flags & RF_utf8)
202 #define LOC (PL_regflags & PMf_LOCALE)
203 #define FOLD (PL_regflags & PMf_FOLD)
205 #define CHR_SVLEN(sv) (UTF ? sv_len_utf8(sv) : SvCUR(sv))
206 #define CHR_DIST(a,b) (UTF ? utf8_distance(a,b) : a - b)
209 scan_commit(scan_data_t *data)
212 STRLEN l = CHR_SVLEN(data->last_found);
213 STRLEN old_l = CHR_SVLEN(*data->longest);
215 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
216 sv_setsv(*data->longest, data->last_found);
217 if (*data->longest == data->longest_fixed) {
218 data->offset_fixed = l ? data->last_start_min : data->pos_min;
219 if (data->flags & SF_BEFORE_EOL)
221 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
223 data->flags &= ~SF_FIX_BEFORE_EOL;
226 data->offset_float_min = l ? data->last_start_min : data->pos_min;
227 data->offset_float_max = (l
228 ? data->last_start_max
229 : data->pos_min + data->pos_delta);
230 if (data->flags & SF_BEFORE_EOL)
232 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
234 data->flags &= ~SF_FL_BEFORE_EOL;
237 SvCUR_set(data->last_found, 0);
239 data->flags &= ~SF_BEFORE_EOL;
242 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
243 to the position after last scanned or to NULL. */
246 study_chunk(regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
247 /* scanp: Start here (read-write). */
248 /* deltap: Write maxlen-minlen here. */
249 /* last: Stop before this one. */
252 I32 min = 0, pars = 0, code;
253 regnode *scan = *scanp, *next;
255 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
256 int is_inf_internal = 0; /* The studied chunk is infinite */
257 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
258 scan_data_t data_fake;
260 while (scan && OP(scan) != END && scan < last) {
261 /* Peephole optimizer: */
263 if (PL_regkind[(U8)OP(scan)] == EXACT) {
264 regnode *n = regnext(scan);
267 regnode *stop = scan;
270 next = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
271 /* Skip NOTHING, merge EXACT*. */
273 ( PL_regkind[(U8)OP(n)] == NOTHING ||
274 (stringok && (OP(n) == OP(scan))))
276 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
277 if (OP(n) == TAIL || n > next)
279 if (PL_regkind[(U8)OP(n)] == NOTHING) {
280 NEXT_OFF(scan) += NEXT_OFF(n);
281 next = n + NODE_STEP_REGNODE;
289 int oldl = *OPERAND(scan);
290 regnode *nnext = regnext(n);
292 if (oldl + *OPERAND(n) > U8_MAX)
294 NEXT_OFF(scan) += NEXT_OFF(n);
295 *OPERAND(scan) += *OPERAND(n);
296 next = n + (*OPERAND(n) + 2 - 1)/sizeof(regnode) + 2;
297 /* Now we can overwrite *n : */
298 Move(OPERAND(n) + 1, OPERAND(scan) + oldl + 1,
299 *OPERAND(n) + 1, char);
309 n = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
311 /* Purify reports a benign UMR here sometimes, because we
312 * don't initialize the OP() slot of a node when that node
313 * is occupied by just the trailing null of the string in
315 if (PL_regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
324 if (OP(scan) != CURLYX) {
325 int max = (reg_off_by_arg[OP(scan)]
327 /* I32 may be smaller than U16 on CRAYs! */
328 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
329 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
333 /* Skip NOTHING and LONGJMP. */
334 while ((n = regnext(n))
335 && ((PL_regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
336 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
339 if (reg_off_by_arg[OP(scan)])
342 NEXT_OFF(scan) = off;
344 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
345 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
346 next = regnext(scan);
349 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
350 I32 max1 = 0, min1 = I32_MAX, num = 0;
352 if (flags & SCF_DO_SUBSTR)
354 while (OP(scan) == code) {
355 I32 deltanext, minnext;
359 next = regnext(scan);
360 scan = NEXTOPER(scan);
362 scan = NEXTOPER(scan);
363 /* We suppose the run is continuous, last=next...*/
364 minnext = study_chunk(&scan, &deltanext, next,
368 if (max1 < minnext + deltanext)
369 max1 = minnext + deltanext;
370 if (deltanext == I32_MAX)
371 is_inf = is_inf_internal = 1;
373 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
375 if (data && (data_fake.flags & SF_HAS_EVAL))
376 data->flags |= SF_HAS_EVAL;
380 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
382 if (flags & SCF_DO_SUBSTR) {
383 data->pos_min += min1;
384 data->pos_delta += max1 - min1;
385 if (max1 != min1 || is_inf)
386 data->longest = &(data->longest_float);
389 delta += max1 - min1;
391 else if (code == BRANCHJ) /* single branch is optimized. */
392 scan = NEXTOPER(NEXTOPER(scan));
393 else /* single branch is optimized. */
394 scan = NEXTOPER(scan);
397 else if (OP(scan) == EXACT) {
398 I32 l = *OPERAND(scan);
400 unsigned char *s = (unsigned char *)(OPERAND(scan)+1);
401 unsigned char *e = s + l;
410 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
411 /* The code below prefers earlier match for fixed
412 offset, later match for variable offset. */
413 if (data->last_end == -1) { /* Update the start info. */
414 data->last_start_min = data->pos_min;
415 data->last_start_max = is_inf
416 ? I32_MAX : data->pos_min + data->pos_delta;
418 sv_catpvn(data->last_found, (char *)(OPERAND(scan)+1), *OPERAND(scan));
419 data->last_end = data->pos_min + l;
420 data->pos_min += l; /* As in the first entry. */
421 data->flags &= ~SF_BEFORE_EOL;
424 else if (PL_regkind[(U8)OP(scan)] == EXACT) {
425 I32 l = *OPERAND(scan);
426 if (flags & SCF_DO_SUBSTR)
429 unsigned char *s = (unsigned char *)(OPERAND(scan)+1);
430 unsigned char *e = s + l;
439 if (data && (flags & SCF_DO_SUBSTR))
442 else if (strchr(PL_varies,OP(scan))) {
443 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
444 regnode *oscan = scan;
446 switch (PL_regkind[(U8)OP(scan)]) {
448 scan = NEXTOPER(scan);
451 if (flags & SCF_DO_SUBSTR) {
452 next = NEXTOPER(scan);
453 if (OP(next) == EXACT) {
455 maxcount = REG_INFTY;
456 next = regnext(scan);
457 scan = NEXTOPER(scan);
461 if (flags & SCF_DO_SUBSTR)
466 is_inf = is_inf_internal = 1;
467 scan = regnext(scan);
468 if (flags & SCF_DO_SUBSTR) {
470 data->longest = &(data->longest_float);
472 goto optimize_curly_tail;
474 mincount = ARG1(scan);
475 maxcount = ARG2(scan);
476 next = regnext(scan);
477 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
479 if (flags & SCF_DO_SUBSTR) {
480 if (mincount == 0) scan_commit(data);
481 pos_before = data->pos_min;
485 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
487 data->flags |= SF_IS_INF;
489 /* This will finish on WHILEM, setting scan, or on NULL: */
490 minnext = study_chunk(&scan, &deltanext, last, data,
492 ? (flags & ~SCF_DO_SUBSTR) : flags);
493 if (!scan) /* It was not CURLYX, but CURLY. */
495 if (ckWARN(WARN_UNSAFE) && (minnext + deltanext == 0)
496 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
497 && maxcount <= REG_INFTY/3) /* Complement check for big count */
498 warner(WARN_UNSAFE, "Strange *+?{} on zero-length expression");
499 min += minnext * mincount;
500 is_inf_internal |= (maxcount == REG_INFTY
501 && (minnext + deltanext) > 0
502 || deltanext == I32_MAX);
503 is_inf |= is_inf_internal;
504 delta += (minnext + deltanext) * maxcount - minnext * mincount;
506 /* Try powerful optimization CURLYX => CURLYN. */
507 if ( OP(oscan) == CURLYX && data
508 && data->flags & SF_IN_PAR
509 && !(data->flags & SF_HAS_EVAL)
510 && !deltanext && minnext == 1 ) {
511 /* Try to optimize to CURLYN. */
512 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
513 regnode *nxt1 = nxt, *nxt2;
517 if (!strchr(PL_simple,OP(nxt))
518 && !(PL_regkind[(U8)OP(nxt)] == EXACT
519 && *OPERAND(nxt) == 1))
523 if (OP(nxt) != CLOSE)
525 /* Now we know that nxt2 is the only contents: */
526 oscan->flags = ARG(nxt);
528 OP(nxt1) = NOTHING; /* was OPEN. */
530 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
531 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
532 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
533 OP(nxt) = OPTIMIZED; /* was CLOSE. */
534 OP(nxt + 1) = OPTIMIZED; /* was count. */
535 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
540 /* Try optimization CURLYX => CURLYM. */
541 if ( OP(oscan) == CURLYX && data
542 && !(data->flags & SF_HAS_PAR)
543 && !(data->flags & SF_HAS_EVAL)
545 /* XXXX How to optimize if data == 0? */
546 /* Optimize to a simpler form. */
547 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
551 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
552 && (OP(nxt2) != WHILEM))
554 OP(nxt2) = SUCCEED; /* Whas WHILEM */
555 /* Need to optimize away parenths. */
556 if (data->flags & SF_IN_PAR) {
557 /* Set the parenth number. */
558 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
560 if (OP(nxt) != CLOSE)
561 FAIL("panic opt close");
562 oscan->flags = ARG(nxt);
563 OP(nxt1) = OPTIMIZED; /* was OPEN. */
564 OP(nxt) = OPTIMIZED; /* was CLOSE. */
566 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
567 OP(nxt + 1) = OPTIMIZED; /* was count. */
568 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
569 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
572 while ( nxt1 && (OP(nxt1) != WHILEM)) {
573 regnode *nnxt = regnext(nxt1);
576 if (reg_off_by_arg[OP(nxt1)])
577 ARG_SET(nxt1, nxt2 - nxt1);
578 else if (nxt2 - nxt1 < U16_MAX)
579 NEXT_OFF(nxt1) = nxt2 - nxt1;
581 OP(nxt) = NOTHING; /* Cannot beautify */
586 /* Optimize again: */
587 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
592 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
594 if (flags & SCF_DO_SUBSTR) {
595 SV *last_str = Nullsv;
596 int counted = mincount != 0;
598 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
599 I32 b = pos_before >= data->last_start_min
600 ? pos_before : data->last_start_min;
602 char *s = SvPV(data->last_found, l);
603 I32 old = b - data->last_start_min;
606 old = utf8_hop((U8*)s, old) - (U8*)s;
609 /* Get the added string: */
610 last_str = newSVpv(s + old, l);
611 if (deltanext == 0 && pos_before == b) {
612 /* What was added is a constant string */
614 SvGROW(last_str, (mincount * l) + 1);
615 repeatcpy(SvPVX(last_str) + l,
616 SvPVX(last_str), l, mincount - 1);
617 SvCUR(last_str) *= mincount;
618 /* Add additional parts. */
619 SvCUR_set(data->last_found,
620 SvCUR(data->last_found) - l);
621 sv_catsv(data->last_found, last_str);
622 data->last_end += l * (mincount - 1);
626 /* It is counted once already... */
627 data->pos_min += minnext * (mincount - counted);
628 data->pos_delta += - counted * deltanext +
629 (minnext + deltanext) * maxcount - minnext * mincount;
630 if (mincount != maxcount) {
632 if (mincount && last_str) {
633 sv_setsv(data->last_found, last_str);
634 data->last_end = data->pos_min;
635 data->last_start_min =
636 data->pos_min - CHR_SVLEN(last_str);
637 data->last_start_max = is_inf
639 : data->pos_min + data->pos_delta
640 - CHR_SVLEN(last_str);
642 data->longest = &(data->longest_float);
644 SvREFCNT_dec(last_str);
646 if (data && (fl & SF_HAS_EVAL))
647 data->flags |= SF_HAS_EVAL;
649 if (OP(oscan) != CURLYX) {
650 while (PL_regkind[(U8)OP(next = regnext(oscan))] == NOTHING
652 NEXT_OFF(oscan) += NEXT_OFF(next);
655 default: /* REF only? */
656 if (flags & SCF_DO_SUBSTR) {
658 data->longest = &(data->longest_float);
660 is_inf = is_inf_internal = 1;
664 else if (strchr(PL_simple,OP(scan)) || PL_regkind[(U8)OP(scan)] == ANYUTF8) {
665 if (flags & SCF_DO_SUBSTR) {
671 else if (PL_regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
672 data->flags |= (OP(scan) == MEOL
676 else if (PL_regkind[(U8)OP(scan)] == BRANCHJ
677 && (scan->flags || data)
678 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
679 I32 deltanext, minnext;
683 next = regnext(scan);
684 nscan = NEXTOPER(NEXTOPER(scan));
685 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, 0);
688 FAIL("variable length lookbehind not implemented");
690 else if (minnext > U8_MAX) {
691 FAIL2("lookbehind longer than %d not implemented", U8_MAX);
693 scan->flags = minnext;
695 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
697 if (data && (data_fake.flags & SF_HAS_EVAL))
698 data->flags |= SF_HAS_EVAL;
700 else if (OP(scan) == OPEN) {
703 else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
704 next = regnext(scan);
706 if ( next && (OP(next) != WHILEM) && next < last)
707 is_par = 0; /* Disable optimization */
709 else if (OP(scan) == EVAL) {
711 data->flags |= SF_HAS_EVAL;
713 else if (OP(scan) == LOGICAL && scan->flags == 2) { /* Embedded */
714 if (flags & SCF_DO_SUBSTR) {
716 data->longest = &(data->longest_float);
718 is_inf = is_inf_internal = 1;
720 /* Else: zero-length, ignore. */
721 scan = regnext(scan);
726 *deltap = is_inf_internal ? I32_MAX : delta;
727 if (flags & SCF_DO_SUBSTR && is_inf)
728 data->pos_delta = I32_MAX - data->pos_min;
731 if (is_par && pars==1 && data) {
732 data->flags |= SF_IN_PAR;
733 data->flags &= ~SF_HAS_PAR;
735 else if (pars && data) {
736 data->flags |= SF_HAS_PAR;
737 data->flags &= ~SF_IN_PAR;
743 add_data(I32 n, char *s)
746 if (PL_regcomp_rx->data) {
747 Renewc(PL_regcomp_rx->data,
748 sizeof(*PL_regcomp_rx->data) + sizeof(void*) * (PL_regcomp_rx->data->count + n - 1),
749 char, struct reg_data);
750 Renew(PL_regcomp_rx->data->what, PL_regcomp_rx->data->count + n, U8);
751 PL_regcomp_rx->data->count += n;
754 Newc(1207, PL_regcomp_rx->data, sizeof(*PL_regcomp_rx->data) + sizeof(void*) * (n - 1),
755 char, struct reg_data);
756 New(1208, PL_regcomp_rx->data->what, n, U8);
757 PL_regcomp_rx->data->count = n;
759 Copy(s, PL_regcomp_rx->data->what + PL_regcomp_rx->data->count - n, n, U8);
760 return PL_regcomp_rx->data->count - n;
768 char *s = PerlEnv_getenv("PERL_RE_COLORS");
771 PL_colors[0] = s = savepv(s);
779 PL_colors[i] = s = "";
789 - pregcomp - compile a regular expression into internal code
791 * We can't allocate space until we know how big the compiled form will be,
792 * but we can't compile it (and thus know how big it is) until we've got a
793 * place to put the code. So we cheat: we compile it twice, once with code
794 * generation turned off and size counting turned on, and once "for real".
795 * This also means that we don't allocate space until we are sure that the
796 * thing really will compile successfully, and we never have to move the
797 * code and thus invalidate pointers into it. (Note that it has to be in
798 * one piece because free() must be able to free it all.) [NB: not true in perl]
800 * Beware that the optimization-preparation code in here knows about some
801 * of the structure of the compiled regexp. [I'll say.]
804 pregcomp(char *exp, char *xend, PMOP *pm)
819 FAIL("NULL regexp argument");
821 if (PL_curcop == &PL_compiling ? (PL_hints & HINT_UTF8) : IN_UTF8)
822 PL_reg_flags |= RF_utf8;
826 PL_regprecomp = savepvn(exp, xend - exp);
827 DEBUG_r(if (!PL_colorset) reginitcolors());
828 DEBUG_r(PerlIO_printf(Perl_debug_log, "%sCompiling%s RE `%s%*s%s'\n",
829 PL_colors[4],PL_colors[5],PL_colors[0],
830 xend - exp, PL_regprecomp, PL_colors[1]));
831 PL_regflags = pm->op_pmflags;
835 PL_seen_zerolen = *exp == '^' ? -1 : 0;
839 /* First pass: determine size, legality. */
840 PL_regcomp_parse = exp;
845 PL_regcode = &PL_regdummy;
846 regc((U8)REG_MAGIC, (char*)PL_regcode);
847 if (reg(0, &flags) == NULL) {
848 Safefree(PL_regprecomp);
849 PL_regprecomp = Nullch;
852 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %d ", PL_regsize));
854 /* Small enough for pointer-storage convention?
855 If extralen==0, this means that we will not need long jumps. */
856 if (PL_regsize >= 0x10000L && PL_extralen)
857 PL_regsize += PL_extralen;
861 /* Allocate space and initialize. */
862 Newc(1001, r, sizeof(regexp) + (unsigned)PL_regsize * sizeof(regnode),
865 FAIL("regexp out of space");
867 r->prelen = xend - exp;
868 r->precomp = PL_regprecomp;
869 r->subbeg = r->subbase = NULL;
870 r->nparens = PL_regnpar - 1; /* set early to validate backrefs */
873 /* Second pass: emit code. */
874 PL_regcomp_parse = exp;
878 PL_regcode = r->program;
879 /* Store the count of eval-groups for security checks: */
880 PL_regcode->next_off = ((PL_seen_evals > U16_MAX) ? U16_MAX : PL_seen_evals);
881 regc((U8)REG_MAGIC, (char*) PL_regcode++);
883 if (reg(0, &flags) == NULL)
886 /* Dig out information for optimizations. */
887 r->reganch = pm->op_pmflags & PMf_COMPILETIME;
888 pm->op_pmflags = PL_regflags;
890 r->reganch |= ROPT_UTF8;
891 r->regstclass = NULL;
892 if (PL_regnaughty >= 10) /* Probably an expensive pattern. */
893 r->reganch |= ROPT_NAUGHTY;
894 scan = r->program + 1; /* First BRANCH. */
896 /* XXXX To minimize changes to RE engine we always allocate
897 3-units-long substrs field. */
898 Newz(1004, r->substrs, 1, struct reg_substr_data);
900 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
903 STRLEN longest_float_length, longest_fixed_length;
905 StructCopy(&zero_scan_data, &data, scan_data_t);
907 /* Skip introductions and multiplicators >= 1. */
908 while ((OP(first) == OPEN && (sawopen = 1)) ||
909 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
910 (OP(first) == PLUS) ||
911 (OP(first) == MINMOD) ||
912 (PL_regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
913 if (OP(first) == PLUS)
916 first += regarglen[(U8)OP(first)];
917 first = NEXTOPER(first);
920 /* Starting-point info. */
922 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
923 else if (strchr(PL_simple+4,OP(first)))
924 r->regstclass = first;
925 else if (PL_regkind[(U8)OP(first)] == BOUND ||
926 PL_regkind[(U8)OP(first)] == NBOUND)
927 r->regstclass = first;
928 else if (PL_regkind[(U8)OP(first)] == BOL) {
929 r->reganch |= (OP(first) == MBOL ? ROPT_ANCH_MBOL: ROPT_ANCH_BOL);
930 first = NEXTOPER(first);
933 else if (OP(first) == GPOS) {
934 r->reganch |= ROPT_ANCH_GPOS;
935 first = NEXTOPER(first);
938 else if ((OP(first) == STAR &&
939 PL_regkind[(U8)OP(NEXTOPER(first))] == REG_ANY) &&
940 !(r->reganch & ROPT_ANCH) )
942 /* turn .* into ^.* with an implied $*=1 */
943 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
944 first = NEXTOPER(first);
947 if (sawplus && (!sawopen || !PL_regsawback))
948 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
950 /* Scan is after the zeroth branch, first is atomic matcher. */
951 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
954 * If there's something expensive in the r.e., find the
955 * longest literal string that must appear and make it the
956 * regmust. Resolve ties in favor of later strings, since
957 * the regstart check works with the beginning of the r.e.
958 * and avoiding duplication strengthens checking. Not a
959 * strong reason, but sufficient in the absence of others.
960 * [Now we resolve ties in favor of the earlier string if
961 * it happens that c_offset_min has been invalidated, since the
962 * earlier string may buy us something the later one won't.]
966 data.longest_fixed = newSVpv("",0);
967 data.longest_float = newSVpv("",0);
968 data.last_found = newSVpv("",0);
969 data.longest = &(data.longest_fixed);
972 minlen = study_chunk(&first, &fake, scan + PL_regsize, /* Up to end */
973 &data, SCF_DO_SUBSTR);
974 if ( PL_regnpar == 1 && data.longest == &(data.longest_fixed)
975 && data.last_start_min == 0 && data.last_end > 0
977 && (!(PL_regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
978 r->reganch |= ROPT_CHECK_ALL;
980 SvREFCNT_dec(data.last_found);
982 longest_float_length = CHR_SVLEN(data.longest_float);
983 if (longest_float_length
984 || (data.flags & SF_FL_BEFORE_EOL
985 && (!(data.flags & SF_FL_BEFORE_MEOL)
986 || (PL_regflags & PMf_MULTILINE)))) {
987 if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */
988 && data.offset_fixed == data.offset_float_min
989 && SvCUR(data.longest_fixed) == SvCUR(data.longest_float))
990 goto remove_float; /* As in (a)+. */
992 r->float_substr = data.longest_float;
993 r->float_min_offset = data.offset_float_min;
994 r->float_max_offset = data.offset_float_max;
995 fbm_compile(r->float_substr, 0);
996 BmUSEFUL(r->float_substr) = 100;
997 if (data.flags & SF_FL_BEFORE_EOL /* Cannot have SEOL and MULTI */
998 && (!(data.flags & SF_FL_BEFORE_MEOL)
999 || (PL_regflags & PMf_MULTILINE)))
1000 SvTAIL_on(r->float_substr);
1004 r->float_substr = Nullsv;
1005 SvREFCNT_dec(data.longest_float);
1006 longest_float_length = 0;
1009 longest_fixed_length = CHR_SVLEN(data.longest_fixed);
1010 if (longest_fixed_length
1011 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
1012 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1013 || (PL_regflags & PMf_MULTILINE)))) {
1014 r->anchored_substr = data.longest_fixed;
1015 r->anchored_offset = data.offset_fixed;
1016 fbm_compile(r->anchored_substr, 0);
1017 BmUSEFUL(r->anchored_substr) = 100;
1018 if (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
1019 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1020 || (PL_regflags & PMf_MULTILINE)))
1021 SvTAIL_on(r->anchored_substr);
1024 r->anchored_substr = Nullsv;
1025 SvREFCNT_dec(data.longest_fixed);
1026 longest_fixed_length = 0;
1029 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
1030 if (longest_fixed_length > longest_float_length) {
1031 r->check_substr = r->anchored_substr;
1032 r->check_offset_min = r->check_offset_max = r->anchored_offset;
1033 if (r->reganch & ROPT_ANCH_SINGLE)
1034 r->reganch |= ROPT_NOSCAN;
1037 r->check_substr = r->float_substr;
1038 r->check_offset_min = data.offset_float_min;
1039 r->check_offset_max = data.offset_float_max;
1043 /* Several toplevels. Best we can is to set minlen. */
1046 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
1047 scan = r->program + 1;
1048 minlen = study_chunk(&scan, &fake, scan + PL_regsize, NULL, 0);
1049 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
1053 if (PL_regseen & REG_SEEN_GPOS)
1054 r->reganch |= ROPT_GPOS_SEEN;
1055 if (PL_regseen & REG_SEEN_LOOKBEHIND)
1056 r->reganch |= ROPT_LOOKBEHIND_SEEN;
1057 if (PL_regseen & REG_SEEN_EVAL)
1058 r->reganch |= ROPT_EVAL_SEEN;
1059 Newz(1002, r->startp, PL_regnpar, char*);
1060 Newz(1002, r->endp, PL_regnpar, char*);
1061 DEBUG_r(regdump(r));
1066 - reg - regular expression, i.e. main body or parenthesized thing
1068 * Caller must absorb opening parenthesis.
1070 * Combining parenthesis handling with the base level of regular expression
1071 * is a trifle forced, but the need to tie the tails of the branches to what
1072 * follows makes it hard to avoid.
1075 reg(I32 paren, I32 *flagp)
1076 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
1079 register regnode *ret; /* Will be the head of the group. */
1080 register regnode *br;
1081 register regnode *lastbr;
1082 register regnode *ender = 0;
1083 register I32 parno = 0;
1084 I32 flags, oregflags = PL_regflags, have_branch = 0, open = 0;
1087 *flagp = 0; /* Tentatively. */
1089 /* Make an OPEN node, if parenthesized. */
1091 if (*PL_regcomp_parse == '?') {
1092 U16 posflags = 0, negflags = 0;
1093 U16 *flagsp = &posflags;
1097 paren = *PL_regcomp_parse++;
1098 ret = NULL; /* For look-ahead/behind. */
1101 PL_regseen |= REG_SEEN_LOOKBEHIND;
1102 if (*PL_regcomp_parse == '!')
1104 if (*PL_regcomp_parse != '=' && *PL_regcomp_parse != '!')
1115 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1118 while (*PL_regcomp_parse && *PL_regcomp_parse != ')')
1120 if (*PL_regcomp_parse != ')')
1121 FAIL("Sequence (?#... not terminated");
1127 paren = *PL_regcomp_parse++;
1132 I32 count = 1, n = 0;
1134 char *s = PL_regcomp_parse;
1136 OP_4tree *sop, *rop;
1139 PL_regseen |= REG_SEEN_EVAL;
1140 while (count && (c = *PL_regcomp_parse)) {
1141 if (c == '\\' && PL_regcomp_parse[1])
1149 if (*PL_regcomp_parse != ')')
1150 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1154 if (PL_regcomp_parse - 1 - s)
1155 sv = newSVpv(s, PL_regcomp_parse - 1 - s);
1157 sv = newSVpv("", 0);
1159 rop = sv_compile_2op(sv, &sop, "re", &av);
1161 n = add_data(3, "nso");
1162 PL_regcomp_rx->data->data[n] = (void*)rop;
1163 PL_regcomp_rx->data->data[n+1] = (void*)av;
1164 PL_regcomp_rx->data->data[n+2] = (void*)sop;
1167 else { /* First pass */
1168 if (PL_reginterp_cnt < ++PL_seen_evals
1169 && PL_curcop != &PL_compiling)
1170 /* No compiled RE interpolated, has runtime
1171 components ===> unsafe. */
1172 FAIL("Eval-group not allowed at runtime, use re 'eval'");
1174 FAIL("Eval-group in insecure regular expression");
1179 ret = reg_node(LOGICAL);
1182 regtail(ret, reganode(EVAL, n));
1185 return reganode(EVAL, n);
1189 if (PL_regcomp_parse[0] == '?') {
1190 if (PL_regcomp_parse[1] == '=' || PL_regcomp_parse[1] == '!'
1191 || PL_regcomp_parse[1] == '<'
1192 || PL_regcomp_parse[1] == '{') { /* Lookahead or eval. */
1195 ret = reg_node(LOGICAL);
1198 regtail(ret, reg(1, &flag));
1202 else if (PL_regcomp_parse[0] >= '1' && PL_regcomp_parse[0] <= '9' ) {
1203 parno = atoi(PL_regcomp_parse++);
1205 while (isDIGIT(*PL_regcomp_parse))
1207 ret = reganode(GROUPP, parno);
1208 if ((c = *nextchar()) != ')')
1209 FAIL2("Switch (?(number%c not recognized", c);
1211 regtail(ret, reganode(IFTHEN, 0));
1212 br = regbranch(&flags, 1);
1214 br = reganode(LONGJMP, 0);
1216 regtail(br, reganode(LONGJMP, 0));
1221 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1222 regbranch(&flags, 1);
1223 regtail(ret, lastbr);
1231 FAIL("Switch (?(condition)... contains too many branches");
1232 ender = reg_node(TAIL);
1235 regtail(lastbr, ender);
1236 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1239 regtail(ret, ender);
1243 FAIL2("Unknown condition for (?(%.2s", PL_regcomp_parse);
1247 FAIL("Sequence (? incomplete");
1252 while (*PL_regcomp_parse && strchr("iogcmsx", *PL_regcomp_parse)) {
1253 if (*PL_regcomp_parse != 'o')
1254 pmflag(flagsp, *PL_regcomp_parse);
1257 if (*PL_regcomp_parse == '-') {
1262 PL_regflags |= posflags;
1263 PL_regflags &= ~negflags;
1264 if (*PL_regcomp_parse == ':') {
1270 if (*PL_regcomp_parse != ')')
1271 FAIL2("Sequence (?%c...) not recognized", *PL_regcomp_parse);
1280 ret = reganode(OPEN, parno);
1287 /* Pick up the branches, linking them together. */
1288 br = regbranch(&flags, 1);
1291 if (*PL_regcomp_parse == '|') {
1292 if (!SIZE_ONLY && PL_extralen) {
1293 reginsert(BRANCHJ, br);
1296 reginsert(BRANCH, br);
1299 PL_extralen += 1; /* For BRANCHJ-BRANCH. */
1301 else if (paren == ':') {
1302 *flagp |= flags&SIMPLE;
1304 if (open) { /* Starts with OPEN. */
1305 regtail(ret, br); /* OPEN -> first. */
1307 else if (paren != '?') /* Not Conditional */
1311 *flagp |= flags&SPSTART;
1313 while (*PL_regcomp_parse == '|') {
1314 if (!SIZE_ONLY && PL_extralen) {
1315 ender = reganode(LONGJMP,0);
1316 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1319 PL_extralen += 2; /* Account for LONGJMP. */
1321 br = regbranch(&flags, 0);
1324 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1328 *flagp |= flags&SPSTART;
1331 if (have_branch || paren != ':') {
1332 /* Make a closing node, and hook it on the end. */
1335 ender = reg_node(TAIL);
1338 ender = reganode(CLOSE, parno);
1344 *flagp &= ~HASWIDTH;
1347 ender = reg_node(SUCCEED);
1350 ender = reg_node(END);
1353 regtail(lastbr, ender);
1356 /* Hook the tails of the branches to the closing node. */
1357 for (br = ret; br != NULL; br = regnext(br)) {
1358 regoptail(br, ender);
1365 static char parens[] = "=!<,>";
1367 if (paren && (p = strchr(parens, paren))) {
1368 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1369 int flag = (p - parens) > 1;
1372 node = SUSPEND, flag = 0;
1373 reginsert(node,ret);
1375 regtail(ret, reg_node(TAIL));
1379 /* Check for proper termination. */
1380 if (paren && (PL_regcomp_parse >= PL_regxend || *nextchar() != ')')) {
1381 FAIL("unmatched () in regexp");
1383 else if (!paren && PL_regcomp_parse < PL_regxend) {
1384 if (*PL_regcomp_parse == ')') {
1385 FAIL("unmatched () in regexp");
1388 FAIL("junk on end of regexp"); /* "Can't happen". */
1392 PL_regflags = oregflags;
1399 - regbranch - one alternative of an | operator
1401 * Implements the concatenation operator.
1404 regbranch(I32 *flagp, I32 first)
1407 register regnode *ret;
1408 register regnode *chain = NULL;
1409 register regnode *latest;
1410 I32 flags = 0, c = 0;
1415 if (!SIZE_ONLY && PL_extralen)
1416 ret = reganode(BRANCHJ,0);
1418 ret = reg_node(BRANCH);
1421 if (!first && SIZE_ONLY)
1422 PL_extralen += 1; /* BRANCHJ */
1424 *flagp = WORST; /* Tentatively. */
1428 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '|' && *PL_regcomp_parse != ')') {
1430 latest = regpiece(&flags);
1431 if (latest == NULL) {
1432 if (flags & TRYAGAIN)
1436 else if (ret == NULL)
1438 *flagp |= flags&HASWIDTH;
1439 if (chain == NULL) /* First piece. */
1440 *flagp |= flags&SPSTART;
1443 regtail(chain, latest);
1448 if (chain == NULL) { /* Loop ran zero times. */
1449 chain = reg_node(NOTHING);
1454 *flagp |= flags&SIMPLE;
1461 - regpiece - something followed by possible [*+?]
1463 * Note that the branching code sequences used for ? and the general cases
1464 * of * and + are somewhat optimized: they use the same NOTHING node as
1465 * both the endmarker for their branch list and the body of the last branch.
1466 * It might seem that this node could be dispensed with entirely, but the
1467 * endmarker role is not redundant.
1470 regpiece(I32 *flagp)
1473 register regnode *ret;
1475 register char *next;
1477 char *origparse = PL_regcomp_parse;
1480 I32 max = REG_INFTY;
1482 ret = regatom(&flags);
1484 if (flags & TRYAGAIN)
1489 op = *PL_regcomp_parse;
1491 if (op == '{' && regcurly(PL_regcomp_parse)) {
1492 next = PL_regcomp_parse + 1;
1494 while (isDIGIT(*next) || *next == ',') {
1503 if (*next == '}') { /* got one */
1507 min = atoi(PL_regcomp_parse);
1511 maxpos = PL_regcomp_parse;
1513 if (!max && *maxpos != '0')
1514 max = REG_INFTY; /* meaning "infinity" */
1515 else if (max >= REG_INFTY)
1516 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
1517 PL_regcomp_parse = next;
1521 if ((flags&SIMPLE)) {
1522 PL_regnaughty += 2 + PL_regnaughty / 2;
1523 reginsert(CURLY, ret);
1526 PL_regnaughty += 4 + PL_regnaughty; /* compound interest */
1527 regtail(ret, reg_node(WHILEM));
1528 if (!SIZE_ONLY && PL_extralen) {
1529 reginsert(LONGJMP,ret);
1530 reginsert(NOTHING,ret);
1531 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1533 reginsert(CURLYX,ret);
1534 if (!SIZE_ONLY && PL_extralen)
1535 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1536 regtail(ret, reg_node(NOTHING));
1546 if (max && max < min)
1547 FAIL("Can't do {n,m} with n > m");
1562 #if 0 /* Now runtime fix should be reliable. */
1563 if (!(flags&HASWIDTH) && op != '?')
1564 FAIL("regexp *+ operand could be empty");
1569 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
1571 if (op == '*' && (flags&SIMPLE)) {
1572 reginsert(STAR, ret);
1576 else if (op == '*') {
1580 else if (op == '+' && (flags&SIMPLE)) {
1581 reginsert(PLUS, ret);
1585 else if (op == '+') {
1589 else if (op == '?') {
1594 if (ckWARN(WARN_UNSAFE) && !SIZE_ONLY && !(flags&HASWIDTH) && max > REG_INFTY/3) {
1595 warner(WARN_UNSAFE, "%.*s matches null string many times",
1596 PL_regcomp_parse - origparse, origparse);
1599 if (*PL_regcomp_parse == '?') {
1601 reginsert(MINMOD, ret);
1602 regtail(ret, ret + NODE_STEP_REGNODE);
1604 if (ISMULT2(PL_regcomp_parse))
1605 FAIL("nested *?+ in regexp");
1611 - regatom - the lowest level
1613 * Optimization: gobbles an entire sequence of ordinary characters so that
1614 * it can turn them into a single node, which is smaller to store and
1615 * faster to run. Backslashed characters are exceptions, each becoming a
1616 * separate node; the code is simpler that way and it's not worth fixing.
1618 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1624 register regnode *ret = 0;
1627 *flagp = WORST; /* Tentatively. */
1630 switch (*PL_regcomp_parse) {
1634 if (PL_regflags & PMf_MULTILINE)
1635 ret = reg_node(MBOL);
1636 else if (PL_regflags & PMf_SINGLELINE)
1637 ret = reg_node(SBOL);
1639 ret = reg_node(BOL);
1642 if (PL_regcomp_parse[1])
1645 if (PL_regflags & PMf_MULTILINE)
1646 ret = reg_node(MEOL);
1647 else if (PL_regflags & PMf_SINGLELINE)
1648 ret = reg_node(SEOL);
1650 ret = reg_node(EOL);
1655 if (PL_regflags & PMf_SINGLELINE)
1656 ret = reg_node(SANYUTF8);
1658 ret = reg_node(ANYUTF8);
1662 if (PL_regflags & PMf_SINGLELINE)
1663 ret = reg_node(SANY);
1665 ret = reg_node(REG_ANY);
1666 *flagp |= HASWIDTH|SIMPLE;
1672 ret = (UTF ? regclassutf8() : regclass());
1673 if (*PL_regcomp_parse != ']')
1674 FAIL("unmatched [] in regexp");
1676 *flagp |= HASWIDTH|SIMPLE;
1680 ret = reg(1, &flags);
1682 if (flags & TRYAGAIN)
1686 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
1690 if (flags & TRYAGAIN) {
1694 FAIL2("internal urp in regexp at /%s/", PL_regcomp_parse);
1695 /* Supposed to be caught earlier. */
1698 if (!regcurly(PL_regcomp_parse)) {
1706 FAIL("?+*{} follows nothing in regexp");
1709 switch (*++PL_regcomp_parse) {
1712 ret = reg_node(SBOL);
1717 ret = reg_node(GPOS);
1718 PL_regseen |= REG_SEEN_GPOS;
1723 ret = reg_node(SEOL);
1728 ret = reg_node(EOS);
1730 PL_seen_zerolen++; /* Do not optimize RE away */
1734 ret = reg_node(SANY);
1735 *flagp |= HASWIDTH|SIMPLE;
1739 ret = reg_node(CLUMP);
1742 if (UTF && !PL_utf8_mark)
1743 is_utf8_mark((U8*)"~"); /* preload table */
1748 ? (LOC ? ALNUMLUTF8 : ALNUMUTF8)
1749 : (LOC ? ALNUML : ALNUM));
1750 *flagp |= HASWIDTH|SIMPLE;
1752 if (UTF && !PL_utf8_alnum)
1753 is_utf8_alnum((U8*)"a"); /* preload table */
1758 ? (LOC ? NALNUMLUTF8 : NALNUMUTF8)
1759 : (LOC ? NALNUML : NALNUM));
1760 *flagp |= HASWIDTH|SIMPLE;
1762 if (UTF && !PL_utf8_alnum)
1763 is_utf8_alnum((U8*)"a"); /* preload table */
1769 ? (LOC ? BOUNDLUTF8 : BOUNDUTF8)
1770 : (LOC ? BOUNDL : BOUND));
1773 if (UTF && !PL_utf8_alnum)
1774 is_utf8_alnum((U8*)"a"); /* preload table */
1780 ? (LOC ? NBOUNDLUTF8 : NBOUNDUTF8)
1781 : (LOC ? NBOUNDL : NBOUND));
1784 if (UTF && !PL_utf8_alnum)
1785 is_utf8_alnum((U8*)"a"); /* preload table */
1790 ? (LOC ? SPACELUTF8 : SPACEUTF8)
1791 : (LOC ? SPACEL : SPACE));
1792 *flagp |= HASWIDTH|SIMPLE;
1794 if (UTF && !PL_utf8_space)
1795 is_utf8_space((U8*)" "); /* preload table */
1800 ? (LOC ? NSPACELUTF8 : NSPACEUTF8)
1801 : (LOC ? NSPACEL : NSPACE));
1802 *flagp |= HASWIDTH|SIMPLE;
1804 if (UTF && !PL_utf8_space)
1805 is_utf8_space((U8*)" "); /* preload table */
1808 ret = reg_node(UTF ? DIGITUTF8 : DIGIT);
1809 *flagp |= HASWIDTH|SIMPLE;
1811 if (UTF && !PL_utf8_digit)
1812 is_utf8_digit((U8*)"1"); /* preload table */
1815 ret = reg_node(UTF ? NDIGITUTF8 : NDIGIT);
1816 *flagp |= HASWIDTH|SIMPLE;
1818 if (UTF && !PL_utf8_digit)
1819 is_utf8_digit((U8*)"1"); /* preload table */
1823 { /* a lovely hack--pretend we saw [\pX] instead */
1824 char* oldregxend = PL_regxend;
1826 if (PL_regcomp_parse[1] == '{') {
1827 PL_regxend = strchr(PL_regcomp_parse, '}');
1829 FAIL("Missing right brace on \\p{}");
1833 PL_regxend = PL_regcomp_parse + 2;
1836 ret = regclassutf8();
1838 PL_regxend = oldregxend;
1841 *flagp |= HASWIDTH|SIMPLE;
1854 case '1': case '2': case '3': case '4':
1855 case '5': case '6': case '7': case '8': case '9':
1857 I32 num = atoi(PL_regcomp_parse);
1859 if (num > 9 && num >= PL_regnpar)
1862 if (!SIZE_ONLY && num > PL_regcomp_rx->nparens)
1863 FAIL("reference to nonexistent group");
1866 ? (LOC ? REFFL : REFF)
1869 while (isDIGIT(*PL_regcomp_parse))
1877 if (PL_regcomp_parse >= PL_regxend)
1878 FAIL("trailing \\ in regexp");
1881 /* Do not generate `unrecognized' warnings here, we fall
1882 back into the quick-grab loop below */
1888 if (PL_regflags & PMf_EXTENDED) {
1889 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '\n') PL_regcomp_parse++;
1890 if (PL_regcomp_parse < PL_regxend)
1906 ? (LOC ? EXACTFL : EXACTF)
1908 s = (char *) OPERAND(ret);
1909 regc(0, s++); /* save spot for len */
1910 for (len = 0, p = PL_regcomp_parse - 1;
1911 len < 127 && p < PL_regxend;
1916 if (PL_regflags & PMf_EXTENDED)
1917 p = regwhite(p, PL_regxend);
1971 char* e = strchr(p, '}');
1974 FAIL("Missing right brace on \\x{}");
1976 ender = scan_hex(p + 1, e - p, &numlen);
1977 if (numlen + len >= 127) { /* numlen is generous */
1984 FAIL("Can't use \\x{} without 'use utf8' declaration");
1987 ender = scan_hex(p, 2, &numlen);
1993 ender = UCHARAT(p++);
1994 ender = toCTRL(ender);
1996 case '0': case '1': case '2': case '3':case '4':
1997 case '5': case '6': case '7': case '8':case '9':
1999 (isDIGIT(p[1]) && atoi(p) >= PL_regnpar) ) {
2000 ender = scan_oct(p, 3, &numlen);
2009 if (p >= PL_regxend)
2010 FAIL("trailing \\ in regexp");
2013 if (!SIZE_ONLY && ckWARN(WARN_UNSAFE) && isALPHA(*p))
2015 "/%.127s/: Unrecognized escape \\%c passed through",
2018 goto normal_default;
2023 if ((*p & 0xc0) == 0xc0 && UTF) {
2024 ender = utf8_to_uv((U8*)p, &numlen);
2031 if (PL_regflags & PMf_EXTENDED)
2032 p = regwhite(p, PL_regxend);
2035 ender = toLOWER_LC_uni(ender);
2037 ender = toLOWER_uni(ender);
2039 if (ISMULT2(p)) { /* Back off on ?+*. */
2042 else if (ender >= 0x80 && UTF) {
2043 reguni(ender, s, &numlen);
2053 if (ender >= 0x80 && UTF) {
2054 reguni(ender, s, &numlen);
2062 PL_regcomp_parse = p - 1;
2065 FAIL("internal disaster in regexp");
2071 *OPERAND(ret) = len;
2074 PL_regsize += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2077 PL_regcode += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2087 regwhite(char *p, char *e)
2092 else if (*p == '#') {
2095 } while (p < e && *p != '\n');
2103 /* parse POSIX character classes like [[:foo:]] */
2105 regpposixcc(I32 value)
2110 if (value == '[' && PL_regcomp_parse + 1 < PL_regxend &&
2111 /* I smell either [: or [= or [. -- POSIX has been here, right? */
2112 (*PL_regcomp_parse == ':' ||
2113 *PL_regcomp_parse == '=' ||
2114 *PL_regcomp_parse == '.')) {
2115 char c = *PL_regcomp_parse;
2116 char* s = PL_regcomp_parse++;
2118 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != c)
2120 if (PL_regcomp_parse == PL_regxend)
2121 /* Grandfather lone [:, [=, [. */
2122 PL_regcomp_parse = s;
2124 PL_regcomp_parse++; /* skip over the c */
2125 if (*PL_regcomp_parse == ']') {
2126 /* Not Implemented Yet.
2127 * (POSIX Extended Character Classes, that is)
2128 * The text between e.g. [: and :] would start
2129 * at s + 1 and stop at regcomp_parse - 2. */
2130 if (ckWARN(WARN_UNSAFE) && !SIZE_ONLY)
2132 "Character class syntax [%c %c] is reserved for future extensions", c, c);
2133 PL_regcomp_parse++; /* skip over the ending ] */
2146 register char *opnd, *s;
2148 register I32 lastvalue = 1234;
2149 register I32 range = 0;
2150 register regnode *ret;
2154 s = opnd = (char *) OPERAND(PL_regcode);
2155 ret = reg_node(ANYOF);
2156 for (value = 0; value < 33; value++)
2158 if (*PL_regcomp_parse == '^') { /* Complement of range. */
2162 *opnd |= ANYOF_INVERT;
2165 PL_regcode += ANY_SKIP;
2167 *opnd |= ANYOF_FOLD;
2169 *opnd |= ANYOF_LOCALE;
2172 PL_regsize += ANY_SKIP;
2174 if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-')
2175 goto skipcond; /* allow 1st char to be ] or - */
2176 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') {
2178 value = UCHARAT(PL_regcomp_parse++);
2180 (void)regpposixcc(value); /* ignore the return value for now */
2181 else if (value == '\\') {
2182 value = UCHARAT(PL_regcomp_parse++);
2187 *opnd |= ANYOF_ALNUML;
2189 for (value = 0; value < 256; value++)
2191 ANYOF_SET(opnd, value);
2199 *opnd |= ANYOF_NALNUML;
2201 for (value = 0; value < 256; value++)
2202 if (!isALNUM(value))
2203 ANYOF_SET(opnd, value);
2211 *opnd |= ANYOF_SPACEL;
2213 for (value = 0; value < 256; value++)
2215 ANYOF_SET(opnd, value);
2223 *opnd |= ANYOF_NSPACEL;
2225 for (value = 0; value < 256; value++)
2226 if (!isSPACE(value))
2227 ANYOF_SET(opnd, value);
2234 for (value = '0'; value <= '9'; value++)
2235 ANYOF_SET(opnd, value);
2241 for (value = 0; value < '0'; value++)
2242 ANYOF_SET(opnd, value);
2243 for (value = '9' + 1; value < 256; value++)
2244 ANYOF_SET(opnd, value);
2270 value = scan_hex(PL_regcomp_parse, 2, &numlen);
2271 PL_regcomp_parse += numlen;
2274 value = UCHARAT(PL_regcomp_parse++);
2275 value = toCTRL(value);
2277 case '0': case '1': case '2': case '3': case '4':
2278 case '5': case '6': case '7': case '8': case '9':
2279 value = scan_oct(--PL_regcomp_parse, 3, &numlen);
2280 PL_regcomp_parse += numlen;
2285 if (lastvalue > value)
2286 FAIL("invalid [] range in regexp");
2291 if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend &&
2292 PL_regcomp_parse[1] != ']') {
2295 continue; /* do it next time */
2300 if ((isLOWER(lastvalue) && isLOWER(value)) ||
2301 (isUPPER(lastvalue) && isUPPER(value)))
2304 if (isLOWER(lastvalue)) {
2305 for (i = lastvalue; i <= value; i++)
2309 for (i = lastvalue; i <= value; i++)
2316 for ( ; lastvalue <= value; lastvalue++)
2317 ANYOF_SET(opnd, lastvalue);
2321 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
2322 if (!SIZE_ONLY && (*opnd & (0xFF ^ ANYOF_INVERT)) == ANYOF_FOLD) {
2323 for (value = 0; value < 256; ++value) {
2324 if (ANYOF_TEST(opnd, value)) {
2325 I32 cf = PL_fold[value];
2326 ANYOF_SET(opnd, cf);
2329 *opnd &= ~ANYOF_FOLD;
2331 /* optimize inverted simple patterns (e.g. [^a-z]) */
2332 if (!SIZE_ONLY && (*opnd & 0xFF) == ANYOF_INVERT) {
2333 for (value = 0; value < 32; ++value)
2334 opnd[1 + value] ^= 0xFF;
2343 register char *opnd, *e;
2345 register U32 lastvalue = 123456;
2346 register I32 range = 0;
2347 register regnode *ret;
2354 if (*PL_regcomp_parse == '^') { /* Complement of range. */
2358 flags |= ANYOF_INVERT;
2362 flags |= ANYOF_FOLD;
2364 flags |= ANYOF_LOCALE;
2365 listsv = newSVpv("# comment\n",0);
2368 if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-')
2369 goto skipcond; /* allow 1st char to be ] or - */
2371 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') {
2373 value = utf8_to_uv((U8*)PL_regcomp_parse, &numlen);
2374 PL_regcomp_parse += numlen;
2377 (void)regpposixcc(value); /* ignore the return value for now */
2378 else if (value == '\\') {
2379 value = utf8_to_uv((U8*)PL_regcomp_parse, &numlen);
2380 PL_regcomp_parse += numlen;
2385 flags |= ANYOF_ALNUML;
2387 sv_catpvf(listsv, "+utf8::IsAlnum\n");
2394 flags |= ANYOF_NALNUML;
2397 "-utf8::IsAlpha\n-utf8::IsDigit\n0000\t%04x\n%04x\tffff\n",
2406 flags |= ANYOF_SPACEL;
2407 sv_catpvf(listsv, "+utf8::IsSpace\n");
2409 is_utf8_space((U8*)" ");
2416 flags |= ANYOF_NSPACEL;
2418 "!utf8::IsSpace\n");
2420 is_utf8_space((U8*)" ");
2426 sv_catpvf(listsv, "+utf8::IsDigit\n");
2433 "!utf8::IsDigit\n");
2439 if (*PL_regcomp_parse == '{') {
2440 e = strchr(PL_regcomp_parse++, '}');
2442 FAIL("Missing right brace on \\p{}");
2443 n = e - PL_regcomp_parse;
2446 e = PL_regcomp_parse;
2451 sv_catpvf(listsv, "+utf8::%.*s\n", n, PL_regcomp_parse);
2454 "!utf8::%.*s\n", n, PL_regcomp_parse);
2456 PL_regcomp_parse = e + 1;
2481 if (*PL_regcomp_parse == '{') {
2482 e = strchr(PL_regcomp_parse++, '}');
2484 FAIL("Missing right brace on \\x{}");
2485 value = scan_hex(PL_regcomp_parse + 1, e - PL_regcomp_parse, &numlen);
2486 PL_regcomp_parse = e + 1;
2489 value = scan_hex(PL_regcomp_parse, 2, &numlen);
2490 PL_regcomp_parse += numlen;
2494 value = UCHARAT(PL_regcomp_parse++);
2495 value = toCTRL(value);
2497 case '0': case '1': case '2': case '3': case '4':
2498 case '5': case '6': case '7': case '8': case '9':
2499 value = scan_oct(--PL_regcomp_parse, 3, &numlen);
2500 PL_regcomp_parse += numlen;
2505 if (lastvalue > value)
2506 FAIL("invalid [] range in regexp");
2508 sv_catpvf(listsv, "%04x\t%04x\n", lastvalue, value);
2514 if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend &&
2515 PL_regcomp_parse[1] != ']') {
2518 continue; /* do it next time */
2521 sv_catpvf(listsv, "%04x\n", value);
2525 ret = reganode(ANYOFUTF8, 0);
2528 SV *rv = swash_init("utf8", "", listsv, 1, 0);
2529 SvREFCNT_dec(listsv);
2530 n = add_data(1,"s");
2531 PL_regcomp_rx->data->data[n] = (void*)rv;
2532 ARG1_SET(ret, flags);
2543 char* retval = PL_regcomp_parse++;
2546 if (*PL_regcomp_parse == '(' && PL_regcomp_parse[1] == '?' &&
2547 PL_regcomp_parse[2] == '#') {
2548 while (*PL_regcomp_parse && *PL_regcomp_parse != ')')
2553 if (PL_regflags & PMf_EXTENDED) {
2554 if (isSPACE(*PL_regcomp_parse)) {
2558 else if (*PL_regcomp_parse == '#') {
2559 while (*PL_regcomp_parse && *PL_regcomp_parse != '\n')
2570 - reg_node - emit a node
2572 STATIC regnode * /* Location. */
2576 register regnode *ret;
2577 register regnode *ptr;
2581 SIZE_ALIGN(PL_regsize);
2586 NODE_ALIGN_FILL(ret);
2588 FILL_ADVANCE_NODE(ptr, op);
2595 - reganode - emit a node with an argument
2597 STATIC regnode * /* Location. */
2598 reganode(U8 op, U32 arg)
2601 register regnode *ret;
2602 register regnode *ptr;
2606 SIZE_ALIGN(PL_regsize);
2611 NODE_ALIGN_FILL(ret);
2613 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
2620 - regc - emit (if appropriate) a Unicode character
2623 reguni(UV uv, char* s, I32* lenp)
2628 *lenp = uv_to_utf8(tmpbuf, uv) - tmpbuf;
2631 *lenp = uv_to_utf8((U8*)s, uv) - (U8*)s;
2636 - regc - emit (if appropriate) a byte of code
2647 - reginsert - insert an operator in front of already-emitted operand
2649 * Means relocating the operand.
2652 reginsert(U8 op, regnode *opnd)
2655 register regnode *src;
2656 register regnode *dst;
2657 register regnode *place;
2658 register int offset = regarglen[(U8)op];
2660 /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
2663 PL_regsize += NODE_STEP_REGNODE + offset;
2668 PL_regcode += NODE_STEP_REGNODE + offset;
2671 StructCopy(--src, --dst, regnode);
2673 place = opnd; /* Op node, where operand used to be. */
2674 src = NEXTOPER(place);
2675 FILL_ADVANCE_NODE(place, op);
2676 Zero(src, offset, regnode);
2680 - regtail - set the next-pointer at the end of a node chain of p to val.
2683 regtail(regnode *p, regnode *val)
2686 register regnode *scan;
2687 register regnode *temp;
2688 register I32 offset;
2693 /* Find last node. */
2696 temp = regnext(scan);
2702 if (reg_off_by_arg[OP(scan)]) {
2703 ARG_SET(scan, val - scan);
2706 NEXT_OFF(scan) = val - scan;
2711 - regoptail - regtail on operand of first argument; nop if operandless
2714 regoptail(regnode *p, regnode *val)
2717 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
2718 if (p == NULL || SIZE_ONLY)
2720 if (PL_regkind[(U8)OP(p)] == BRANCH) {
2721 regtail(NEXTOPER(p), val);
2723 else if ( PL_regkind[(U8)OP(p)] == BRANCHJ) {
2724 regtail(NEXTOPER(NEXTOPER(p)), val);
2731 - regcurly - a little FSA that accepts {\d+,?\d*}
2734 regcurly(register char *s)
2753 dumpuntil(regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
2756 register char op = EXACT; /* Arbitrary non-END op. */
2757 register regnode *next, *onode;
2759 while (op != END && (!last || node < last)) {
2760 /* While that wasn't END last time... */
2766 next = regnext(node);
2768 if (OP(node) == OPTIMIZED)
2771 PerlIO_printf(Perl_debug_log, "%4d:%*s%s", node - start,
2772 2*l + 1, "", SvPVX(sv));
2773 if (next == NULL) /* Next ptr. */
2774 PerlIO_printf(Perl_debug_log, "(0)");
2776 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
2777 (void)PerlIO_putc(Perl_debug_log, '\n');
2779 if (PL_regkind[(U8)op] == BRANCHJ) {
2780 register regnode *nnode = (OP(next) == LONGJMP
2783 if (last && nnode > last)
2785 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
2787 else if (PL_regkind[(U8)op] == BRANCH) {
2788 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
2790 else if ( op == CURLY) { /* `next' might be very big: optimizer */
2791 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2792 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
2794 else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) {
2795 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2798 else if ( op == PLUS || op == STAR) {
2799 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
2801 else if (op == ANYOF) {
2802 node = NEXTOPER(node);
2805 else if (PL_regkind[(U8)op] == EXACT) {
2806 /* Literal string, where present. */
2807 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2808 node = NEXTOPER(node);
2811 node = NEXTOPER(node);
2812 node += regarglen[(U8)op];
2814 if (op == CURLYX || op == OPEN)
2816 else if (op == WHILEM)
2819 #endif /* DEBUGGING */
2824 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
2831 SV *sv = sv_newmortal();
2833 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
2835 /* Header fields of interest. */
2836 if (r->anchored_substr)
2837 PerlIO_printf(Perl_debug_log, "anchored `%s%s%s'%s at %d ",
2839 SvPVX(r->anchored_substr),
2841 SvTAIL(r->anchored_substr) ? "$" : "",
2842 r->anchored_offset);
2843 if (r->float_substr)
2844 PerlIO_printf(Perl_debug_log, "floating `%s%s%s'%s at %d..%u ",
2846 SvPVX(r->float_substr),
2848 SvTAIL(r->float_substr) ? "$" : "",
2849 r->float_min_offset, r->float_max_offset);
2850 if (r->check_substr)
2851 PerlIO_printf(Perl_debug_log,
2852 r->check_substr == r->float_substr
2853 ? "(checking floating" : "(checking anchored");
2854 if (r->reganch & ROPT_NOSCAN)
2855 PerlIO_printf(Perl_debug_log, " noscan");
2856 if (r->reganch & ROPT_CHECK_ALL)
2857 PerlIO_printf(Perl_debug_log, " isall");
2858 if (r->check_substr)
2859 PerlIO_printf(Perl_debug_log, ") ");
2861 if (r->regstclass) {
2862 regprop(sv, r->regstclass);
2863 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
2865 if (r->reganch & ROPT_ANCH) {
2866 PerlIO_printf(Perl_debug_log, "anchored");
2867 if (r->reganch & ROPT_ANCH_BOL)
2868 PerlIO_printf(Perl_debug_log, "(BOL)");
2869 if (r->reganch & ROPT_ANCH_MBOL)
2870 PerlIO_printf(Perl_debug_log, "(MBOL)");
2871 if (r->reganch & ROPT_ANCH_GPOS)
2872 PerlIO_printf(Perl_debug_log, "(GPOS)");
2873 PerlIO_putc(Perl_debug_log, ' ');
2875 if (r->reganch & ROPT_GPOS_SEEN)
2876 PerlIO_printf(Perl_debug_log, "GPOS ");
2877 if (r->reganch & ROPT_SKIP)
2878 PerlIO_printf(Perl_debug_log, "plus ");
2879 if (r->reganch & ROPT_IMPLICIT)
2880 PerlIO_printf(Perl_debug_log, "implicit ");
2881 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
2882 if (r->reganch & ROPT_EVAL_SEEN)
2883 PerlIO_printf(Perl_debug_log, "with eval ");
2884 PerlIO_printf(Perl_debug_log, "\n");
2885 #endif /* DEBUGGING */
2889 - regprop - printable representation of opcode
2892 regprop(SV *sv, regnode *o)
2896 register char *p = 0;
2898 sv_setpvn(sv, "", 0);
2943 sv_catpvf(sv, "EXACT <%s%s%s>", PL_colors[0], OPERAND(o) + 1, PL_colors[1]);
2946 sv_catpvf(sv, "EXACTF <%s%s%s>", PL_colors[0], OPERAND(o) + 1, PL_colors[1]);
2949 sv_catpvf(sv, "EXACTFL <%s%s%s>", PL_colors[0], OPERAND(o) + 1, PL_colors[1]);
2976 sv_catpvf(sv, "CURLY {%d,%d}", ARG1(o), ARG2(o));
2979 sv_catpvf(sv, "CURLYM[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2982 sv_catpvf(sv, "CURLYN[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2985 sv_catpvf(sv, "CURLYX {%d,%d}", ARG1(o), ARG2(o));
2988 sv_catpvf(sv, "REF%d", ARG(o));
2991 sv_catpvf(sv, "REFF%d", ARG(o));
2994 sv_catpvf(sv, "REFFL%d", ARG(o));
2997 sv_catpvf(sv, "OPEN%d", ARG(o));
3000 sv_catpvf(sv, "CLOSE%d", ARG(o));
3016 sv_catpvf(sv, "UNLESSM[-%d]", o->flags);
3019 sv_catpvf(sv, "IFMATCH[-%d]", o->flags);
3070 sv_catpvf(sv, "GROUPP%d", ARG(o));
3073 sv_catpvf(sv, "LOGICAL[%d]", o->flags);
3085 FAIL("corrupted regexp opcode");
3089 #endif /* DEBUGGING */
3093 pregfree(struct regexp *r)
3096 if (!r || (--r->refcnt > 0))
3099 Safefree(r->precomp);
3101 Safefree(r->subbase);
3103 if (r->anchored_substr)
3104 SvREFCNT_dec(r->anchored_substr);
3105 if (r->float_substr)
3106 SvREFCNT_dec(r->float_substr);
3107 Safefree(r->substrs);
3110 int n = r->data->count;
3112 switch (r->data->what[n]) {
3114 SvREFCNT_dec((SV*)r->data->data[n]);
3117 op_free((OP_4tree*)r->data->data[n]);
3122 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
3125 Safefree(r->data->what);
3128 Safefree(r->startp);
3134 - regnext - dig the "next" pointer out of a node
3136 * [Note, when REGALIGN is defined there are two places in regmatch()
3137 * that bypass this code for speed.]
3140 regnext(register regnode *p)
3143 register I32 offset;
3145 if (p == &PL_regdummy)
3148 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
3156 re_croak2(const char* pat1,const char* pat2,...)
3159 STRLEN l1 = strlen(pat1);
3160 STRLEN l2 = strlen(pat2);
3168 Copy(pat1, buf, l1 , char);
3169 Copy(pat2, buf + l1, l2 , char);
3170 buf[l1 + l2] = '\n';
3171 buf[l1 + l2 + 1] = '\0';
3172 va_start(args, pat2);
3173 message = mess(buf, &args);
3175 l1 = strlen(message);
3178 Copy(message, buf, l1 , char);
3179 buf[l1] = '\0'; /* Overwrite \n */
3183 /* XXX Here's a total kludge. But we need to re-enter for swash routines. */
3186 save_re_context(void)
3190 SAVEPPTR(PL_regprecomp); /* uncompiled string. */
3191 SAVEI32(PL_regnpar); /* () count. */
3192 SAVEI32(PL_regsize); /* Code size. */
3193 SAVEI16(PL_regflags); /* are we folding, multilining? */
3194 SAVEPPTR(PL_reginput); /* String-input pointer. */
3195 SAVEPPTR(PL_regbol); /* Beginning of input, for ^ check. */
3196 SAVEPPTR(PL_regeol); /* End of input, for $ check. */
3197 SAVESPTR(PL_regstartp); /* Pointer to startp array. */
3198 SAVESPTR(PL_regendp); /* Ditto for endp. */
3199 SAVESPTR(PL_reglastparen); /* Similarly for lastparen. */
3200 SAVEPPTR(PL_regtill); /* How far we are required to go. */
3201 SAVEI32(PL_regprev); /* char before regbol, \n if none */
3202 SAVESPTR(PL_reg_start_tmp); /* from regexec.c */
3203 PL_reg_start_tmp = 0;
3204 SAVEFREEPV(PL_reg_start_tmp);
3205 SAVEI32(PL_reg_start_tmpl); /* from regexec.c */
3206 PL_reg_start_tmpl = 0;
3207 SAVESPTR(PL_regdata);
3208 SAVEI32(PL_reg_flags); /* from regexec.c */
3209 SAVEI32(PL_reg_eval_set); /* from regexec.c */
3210 SAVEI32(PL_regnarrate); /* from regexec.c */
3211 SAVESPTR(PL_regprogram); /* from regexec.c */
3212 SAVEINT(PL_regindent); /* from regexec.c */
3213 SAVESPTR(PL_regcc); /* from regexec.c */
3214 SAVESPTR(PL_curcop);
3215 SAVESPTR(PL_regcomp_rx); /* from regcomp.c */
3216 SAVEI32(PL_regseen); /* from regcomp.c */
3217 SAVEI32(PL_regsawback); /* Did we see \1, ...? */
3218 SAVEI32(PL_regnaughty); /* How bad is this pattern? */
3219 SAVESPTR(PL_regcode); /* Code-emit pointer; ®dummy = don't */
3220 SAVEPPTR(PL_regxend); /* End of input for compile */
3221 SAVEPPTR(PL_regcomp_parse); /* Input-scan pointer. */
3222 SAVESPTR(PL_reg_call_cc); /* from regexec.c */
3223 SAVESPTR(PL_reg_re); /* from regexec.c */
3224 SAVEPPTR(PL_reg_ganch); /* from regexec.c */
3225 SAVESPTR(PL_reg_sv); /* from regexec.c */
3226 SAVESPTR(PL_reg_magic); /* from regexec.c */
3227 SAVEI32(PL_reg_oldpos); /* from regexec.c */
3228 SAVESPTR(PL_reg_oldcurpm); /* from regexec.c */
3229 SAVESPTR(PL_reg_curpm); /* from regexec.c */
3231 SAVEPPTR(PL_reg_starttry); /* from regexec.c */