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 */
28 # if defined(PERL_EXT_RE_DEBUG) && !defined(DEBUGGING)
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 # define Perl_pregfree my_regfree
39 # define Perl_re_intuit_string my_re_intuit_string
40 /* *These* symbols are masked to allow static link. */
41 # define Perl_regnext my_regnext
42 # define Perl_save_re_context my_save_re_context
43 # define Perl_reginitcolors my_reginitcolors
45 # define PERL_NO_GET_CONTEXT
50 * pregcomp and pregexec -- regsub and regerror are not used in perl
52 * Copyright (c) 1986 by University of Toronto.
53 * Written by Henry Spencer. Not derived from licensed software.
55 * Permission is granted to anyone to use this software for any
56 * purpose on any computer system, and to redistribute it freely,
57 * subject to the following restrictions:
59 * 1. The author is not responsible for the consequences of use of
60 * this software, no matter how awful, even if they arise
63 * 2. The origin of this software must not be misrepresented, either
64 * by explicit claim or by omission.
66 * 3. Altered versions must be plainly marked as such, and must not
67 * be misrepresented as being the original software.
70 **** Alterations to Henry's code are...
72 **** Copyright (c) 1991-1999, Larry Wall
74 **** You may distribute under the terms of either the GNU General Public
75 **** License or the Artistic License, as specified in the README file.
78 * Beware that some of this code is subtly aware of the way operator
79 * precedence is structured in regular expressions. Serious changes in
80 * regular-expression syntax might require a total rethink.
83 #define PERL_IN_REGCOMP_C
86 #ifdef PERL_IN_XSUB_RE
87 # if defined(PERL_CAPI) || defined(PERL_OBJECT)
102 # if defined(BUGGY_MSC6)
103 /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */
104 # pragma optimize("a",off)
105 /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/
106 # pragma optimize("w",on )
107 # endif /* BUGGY_MSC6 */
111 #define STATIC static
114 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
115 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
116 ((*s) == '{' && regcurly(s)))
118 #define PERL_META "^$.[()|?+*\\"
120 #define META "^$.[()|?+*\\"
124 #undef SPSTART /* dratted cpp namespace... */
127 * Flags to be passed up and down.
129 #define WORST 0 /* Worst case. */
130 #define HASWIDTH 0x1 /* Known to match non-null strings. */
131 #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
132 #define SPSTART 0x4 /* Starts with * or +. */
133 #define TRYAGAIN 0x8 /* Weeded out a declaration. */
135 /* Length of a variant. */
137 typedef struct scan_data_t {
143 I32 last_end; /* min value, <0 unless valid. */
146 SV **longest; /* Either &l_fixed, or &l_float. */
150 I32 offset_float_min;
151 I32 offset_float_max;
157 * Forward declarations for pregcomp()'s friends.
160 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
163 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
164 #define SF_BEFORE_SEOL 0x1
165 #define SF_BEFORE_MEOL 0x2
166 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
167 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
170 # define SF_FIX_SHIFT_EOL (0+2)
171 # define SF_FL_SHIFT_EOL (0+4)
173 # define SF_FIX_SHIFT_EOL (+2)
174 # define SF_FL_SHIFT_EOL (+4)
177 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
178 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
180 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
181 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
182 #define SF_IS_INF 0x40
183 #define SF_HAS_PAR 0x80
184 #define SF_IN_PAR 0x100
185 #define SF_HAS_EVAL 0x200
186 #define SCF_DO_SUBSTR 0x400
189 #define UTF (PL_reg_flags & RF_utf8)
190 #define LOC (PL_regflags & PMf_LOCALE)
191 #define FOLD (PL_regflags & PMf_FOLD)
193 #define OOB_CHAR8 1234
194 #define OOB_UTF8 123456
196 #define CHR_SVLEN(sv) (UTF ? sv_len_utf8(sv) : SvCUR(sv))
197 #define CHR_DIST(a,b) (UTF ? utf8_distance(a,b) : a - b)
199 static void clear_re(pTHXo_ void *r);
202 S_scan_commit(pTHX_ scan_data_t *data)
205 STRLEN l = CHR_SVLEN(data->last_found);
206 STRLEN old_l = CHR_SVLEN(*data->longest);
208 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
209 sv_setsv(*data->longest, data->last_found);
210 if (*data->longest == data->longest_fixed) {
211 data->offset_fixed = l ? data->last_start_min : data->pos_min;
212 if (data->flags & SF_BEFORE_EOL)
214 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
216 data->flags &= ~SF_FIX_BEFORE_EOL;
219 data->offset_float_min = l ? data->last_start_min : data->pos_min;
220 data->offset_float_max = (l
221 ? data->last_start_max
222 : data->pos_min + data->pos_delta);
223 if (data->flags & SF_BEFORE_EOL)
225 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
227 data->flags &= ~SF_FL_BEFORE_EOL;
230 SvCUR_set(data->last_found, 0);
232 data->flags &= ~SF_BEFORE_EOL;
235 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
236 to the position after last scanned or to NULL. */
239 S_study_chunk(pTHX_ regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
240 /* scanp: Start here (read-write). */
241 /* deltap: Write maxlen-minlen here. */
242 /* last: Stop before this one. */
245 I32 min = 0, pars = 0, code;
246 regnode *scan = *scanp, *next;
248 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
249 int is_inf_internal = 0; /* The studied chunk is infinite */
250 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
251 scan_data_t data_fake;
253 while (scan && OP(scan) != END && scan < last) {
254 /* Peephole optimizer: */
256 if (PL_regkind[(U8)OP(scan)] == EXACT) {
257 regnode *n = regnext(scan);
260 regnode *stop = scan;
263 next = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
264 /* Skip NOTHING, merge EXACT*. */
266 ( PL_regkind[(U8)OP(n)] == NOTHING ||
267 (stringok && (OP(n) == OP(scan))))
269 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
270 if (OP(n) == TAIL || n > next)
272 if (PL_regkind[(U8)OP(n)] == NOTHING) {
273 NEXT_OFF(scan) += NEXT_OFF(n);
274 next = n + NODE_STEP_REGNODE;
282 int oldl = *OPERAND(scan);
283 regnode *nnext = regnext(n);
285 if (oldl + *OPERAND(n) > U8_MAX)
287 NEXT_OFF(scan) += NEXT_OFF(n);
288 *OPERAND(scan) += *OPERAND(n);
289 next = n + (*OPERAND(n) + 2 - 1)/sizeof(regnode) + 2;
290 /* Now we can overwrite *n : */
291 Move(OPERAND(n) + 1, OPERAND(scan) + oldl + 1,
292 *OPERAND(n) + 1, char);
302 n = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
304 /* Purify reports a benign UMR here sometimes, because we
305 * don't initialize the OP() slot of a node when that node
306 * is occupied by just the trailing null of the string in
308 if (PL_regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
317 if (OP(scan) != CURLYX) {
318 int max = (reg_off_by_arg[OP(scan)]
320 /* I32 may be smaller than U16 on CRAYs! */
321 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
322 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
326 /* Skip NOTHING and LONGJMP. */
327 while ((n = regnext(n))
328 && ((PL_regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
329 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
332 if (reg_off_by_arg[OP(scan)])
335 NEXT_OFF(scan) = off;
337 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
338 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
339 next = regnext(scan);
342 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
343 I32 max1 = 0, min1 = I32_MAX, num = 0;
345 if (flags & SCF_DO_SUBSTR)
347 while (OP(scan) == code) {
348 I32 deltanext, minnext;
353 data_fake.whilem_c = data->whilem_c;
354 next = regnext(scan);
355 scan = NEXTOPER(scan);
357 scan = NEXTOPER(scan);
358 /* We suppose the run is continuous, last=next...*/
359 minnext = study_chunk(&scan, &deltanext, next,
363 if (max1 < minnext + deltanext)
364 max1 = minnext + deltanext;
365 if (deltanext == I32_MAX)
366 is_inf = is_inf_internal = 1;
368 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
370 if (data && (data_fake.flags & SF_HAS_EVAL))
371 data->flags |= SF_HAS_EVAL;
373 data->whilem_c = data_fake.whilem_c;
377 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
379 if (flags & SCF_DO_SUBSTR) {
380 data->pos_min += min1;
381 data->pos_delta += max1 - min1;
382 if (max1 != min1 || is_inf)
383 data->longest = &(data->longest_float);
386 delta += max1 - min1;
388 else if (code == BRANCHJ) /* single branch is optimized. */
389 scan = NEXTOPER(NEXTOPER(scan));
390 else /* single branch is optimized. */
391 scan = NEXTOPER(scan);
394 else if (OP(scan) == EXACT) {
395 I32 l = *OPERAND(scan);
397 unsigned char *s = (unsigned char *)(OPERAND(scan)+1);
398 unsigned char *e = s + l;
407 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
408 /* The code below prefers earlier match for fixed
409 offset, later match for variable offset. */
410 if (data->last_end == -1) { /* Update the start info. */
411 data->last_start_min = data->pos_min;
412 data->last_start_max = is_inf
413 ? I32_MAX : data->pos_min + data->pos_delta;
415 sv_catpvn(data->last_found, (char *)(OPERAND(scan)+1), *OPERAND(scan));
416 data->last_end = data->pos_min + l;
417 data->pos_min += l; /* As in the first entry. */
418 data->flags &= ~SF_BEFORE_EOL;
421 else if (PL_regkind[(U8)OP(scan)] == EXACT) {
422 I32 l = *OPERAND(scan);
423 if (flags & SCF_DO_SUBSTR)
426 unsigned char *s = (unsigned char *)(OPERAND(scan)+1);
427 unsigned char *e = s + l;
436 if (data && (flags & SCF_DO_SUBSTR))
439 else if (strchr((char*)PL_varies,OP(scan))) {
440 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
441 regnode *oscan = scan;
443 switch (PL_regkind[(U8)OP(scan)]) {
445 scan = NEXTOPER(scan);
448 if (flags & SCF_DO_SUBSTR) {
449 next = NEXTOPER(scan);
450 if (OP(next) == EXACT) {
452 maxcount = REG_INFTY;
453 next = regnext(scan);
454 scan = NEXTOPER(scan);
458 if (flags & SCF_DO_SUBSTR)
463 is_inf = is_inf_internal = 1;
464 scan = regnext(scan);
465 if (flags & SCF_DO_SUBSTR) {
467 data->longest = &(data->longest_float);
469 goto optimize_curly_tail;
471 mincount = ARG1(scan);
472 maxcount = ARG2(scan);
473 next = regnext(scan);
474 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
476 if (flags & SCF_DO_SUBSTR) {
477 if (mincount == 0) scan_commit(data);
478 pos_before = data->pos_min;
482 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
484 data->flags |= SF_IS_INF;
486 /* This will finish on WHILEM, setting scan, or on NULL: */
487 minnext = study_chunk(&scan, &deltanext, last, data,
489 ? (flags & ~SCF_DO_SUBSTR) : flags);
490 if (!scan) /* It was not CURLYX, but CURLY. */
492 if (ckWARN(WARN_UNSAFE) && (minnext + deltanext == 0)
493 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
494 && maxcount <= REG_INFTY/3) /* Complement check for big count */
495 Perl_warner(aTHX_ WARN_UNSAFE,
496 "Strange *+?{} on zero-length expression");
497 min += minnext * mincount;
498 is_inf_internal |= (maxcount == REG_INFTY
499 && (minnext + deltanext) > 0
500 || deltanext == I32_MAX);
501 is_inf |= is_inf_internal;
502 delta += (minnext + deltanext) * maxcount - minnext * mincount;
504 /* Try powerful optimization CURLYX => CURLYN. */
505 if ( OP(oscan) == CURLYX && data
506 && data->flags & SF_IN_PAR
507 && !(data->flags & SF_HAS_EVAL)
508 && !deltanext && minnext == 1 ) {
509 /* Try to optimize to CURLYN. */
510 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
511 regnode *nxt1 = nxt, *nxt2;
515 if (!strchr((char*)PL_simple,OP(nxt))
516 && !(PL_regkind[(U8)OP(nxt)] == EXACT
517 && *OPERAND(nxt) == 1))
521 if (OP(nxt) != CLOSE)
523 /* Now we know that nxt2 is the only contents: */
524 oscan->flags = ARG(nxt);
526 OP(nxt1) = NOTHING; /* was OPEN. */
528 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
529 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
530 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
531 OP(nxt) = OPTIMIZED; /* was CLOSE. */
532 OP(nxt + 1) = OPTIMIZED; /* was count. */
533 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
538 /* Try optimization CURLYX => CURLYM. */
539 if ( OP(oscan) == CURLYX && data
540 && !(data->flags & SF_HAS_PAR)
541 && !(data->flags & SF_HAS_EVAL)
543 /* XXXX How to optimize if data == 0? */
544 /* Optimize to a simpler form. */
545 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
549 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
550 && (OP(nxt2) != WHILEM))
552 OP(nxt2) = SUCCEED; /* Whas WHILEM */
553 /* Need to optimize away parenths. */
554 if (data->flags & SF_IN_PAR) {
555 /* Set the parenth number. */
556 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
558 if (OP(nxt) != CLOSE)
559 FAIL("panic opt close");
560 oscan->flags = ARG(nxt);
561 OP(nxt1) = OPTIMIZED; /* was OPEN. */
562 OP(nxt) = OPTIMIZED; /* was CLOSE. */
564 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
565 OP(nxt + 1) = OPTIMIZED; /* was count. */
566 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
567 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
570 while ( nxt1 && (OP(nxt1) != WHILEM)) {
571 regnode *nnxt = regnext(nxt1);
574 if (reg_off_by_arg[OP(nxt1)])
575 ARG_SET(nxt1, nxt2 - nxt1);
576 else if (nxt2 - nxt1 < U16_MAX)
577 NEXT_OFF(nxt1) = nxt2 - nxt1;
579 OP(nxt) = NOTHING; /* Cannot beautify */
584 /* Optimize again: */
585 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
590 else if (OP(oscan) == CURLYX && data && ++data->whilem_c < 16) {
591 /* This stays as CURLYX, and can put the count/of pair. */
592 /* Find WHILEM (as in regexec.c) */
593 regnode *nxt = oscan + NEXT_OFF(oscan);
595 if (OP(PREVOPER(nxt)) == NOTHING) /* LONGJMP */
597 PREVOPER(nxt)->flags = data->whilem_c
598 | (PL_reg_whilem_seen << 4); /* On WHILEM */
600 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
602 if (flags & SCF_DO_SUBSTR) {
603 SV *last_str = Nullsv;
604 int counted = mincount != 0;
606 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
607 I32 b = pos_before >= data->last_start_min
608 ? pos_before : data->last_start_min;
610 char *s = SvPV(data->last_found, l);
611 I32 old = b - data->last_start_min;
614 old = utf8_hop((U8*)s, old) - (U8*)s;
617 /* Get the added string: */
618 last_str = newSVpvn(s + old, l);
619 if (deltanext == 0 && pos_before == b) {
620 /* What was added is a constant string */
622 SvGROW(last_str, (mincount * l) + 1);
623 repeatcpy(SvPVX(last_str) + l,
624 SvPVX(last_str), l, mincount - 1);
625 SvCUR(last_str) *= mincount;
626 /* Add additional parts. */
627 SvCUR_set(data->last_found,
628 SvCUR(data->last_found) - l);
629 sv_catsv(data->last_found, last_str);
630 data->last_end += l * (mincount - 1);
634 /* It is counted once already... */
635 data->pos_min += minnext * (mincount - counted);
636 data->pos_delta += - counted * deltanext +
637 (minnext + deltanext) * maxcount - minnext * mincount;
638 if (mincount != maxcount) {
640 if (mincount && last_str) {
641 sv_setsv(data->last_found, last_str);
642 data->last_end = data->pos_min;
643 data->last_start_min =
644 data->pos_min - CHR_SVLEN(last_str);
645 data->last_start_max = is_inf
647 : data->pos_min + data->pos_delta
648 - CHR_SVLEN(last_str);
650 data->longest = &(data->longest_float);
652 SvREFCNT_dec(last_str);
654 if (data && (fl & SF_HAS_EVAL))
655 data->flags |= SF_HAS_EVAL;
657 if (OP(oscan) != CURLYX) {
658 while (PL_regkind[(U8)OP(next = regnext(oscan))] == NOTHING
660 NEXT_OFF(oscan) += NEXT_OFF(next);
663 default: /* REF only? */
664 if (flags & SCF_DO_SUBSTR) {
666 data->longest = &(data->longest_float);
668 is_inf = is_inf_internal = 1;
672 else if (strchr((char*)PL_simple,OP(scan)) || PL_regkind[(U8)OP(scan)] == ANYUTF8) {
673 if (flags & SCF_DO_SUBSTR) {
679 else if (PL_regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
680 data->flags |= (OP(scan) == MEOL
684 else if (PL_regkind[(U8)OP(scan)] == BRANCHJ
685 && (scan->flags || data)
686 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
687 I32 deltanext, minnext;
692 data_fake.whilem_c = data->whilem_c;
693 next = regnext(scan);
694 nscan = NEXTOPER(NEXTOPER(scan));
695 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, 0);
698 FAIL("variable length lookbehind not implemented");
700 else if (minnext > U8_MAX) {
702 FAIL2("lookbehind longer than %" PERL_PRIu64 " not implemented", (UV)U8_MAX);
704 FAIL2("lookbehind longer than %d not implemented", U8_MAX);
707 scan->flags = minnext;
709 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
711 if (data && (data_fake.flags & SF_HAS_EVAL))
712 data->flags |= SF_HAS_EVAL;
714 data->whilem_c = data_fake.whilem_c;
716 else if (OP(scan) == OPEN) {
719 else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
720 next = regnext(scan);
722 if ( next && (OP(next) != WHILEM) && next < last)
723 is_par = 0; /* Disable optimization */
725 else if (OP(scan) == EVAL) {
727 data->flags |= SF_HAS_EVAL;
729 else if (OP(scan) == LOGICAL && scan->flags == 2) { /* Embedded */
730 if (flags & SCF_DO_SUBSTR) {
732 data->longest = &(data->longest_float);
734 is_inf = is_inf_internal = 1;
736 /* Else: zero-length, ignore. */
737 scan = regnext(scan);
742 *deltap = is_inf_internal ? I32_MAX : delta;
743 if (flags & SCF_DO_SUBSTR && is_inf)
744 data->pos_delta = I32_MAX - data->pos_min;
747 if (is_par && pars==1 && data) {
748 data->flags |= SF_IN_PAR;
749 data->flags &= ~SF_HAS_PAR;
751 else if (pars && data) {
752 data->flags |= SF_HAS_PAR;
753 data->flags &= ~SF_IN_PAR;
759 S_add_data(pTHX_ I32 n, char *s)
762 if (PL_regcomp_rx->data) {
763 Renewc(PL_regcomp_rx->data,
764 sizeof(*PL_regcomp_rx->data) + sizeof(void*) * (PL_regcomp_rx->data->count + n - 1),
765 char, struct reg_data);
766 Renew(PL_regcomp_rx->data->what, PL_regcomp_rx->data->count + n, U8);
767 PL_regcomp_rx->data->count += n;
770 Newc(1207, PL_regcomp_rx->data, sizeof(*PL_regcomp_rx->data) + sizeof(void*) * (n - 1),
771 char, struct reg_data);
772 New(1208, PL_regcomp_rx->data->what, n, U8);
773 PL_regcomp_rx->data->count = n;
775 Copy(s, PL_regcomp_rx->data->what + PL_regcomp_rx->data->count - n, n, U8);
776 return PL_regcomp_rx->data->count - n;
780 Perl_reginitcolors(pTHX)
784 char *s = PerlEnv_getenv("PERL_RE_COLORS");
787 PL_colors[0] = s = savepv(s);
795 PL_colors[i] = s = "";
805 - pregcomp - compile a regular expression into internal code
807 * We can't allocate space until we know how big the compiled form will be,
808 * but we can't compile it (and thus know how big it is) until we've got a
809 * place to put the code. So we cheat: we compile it twice, once with code
810 * generation turned off and size counting turned on, and once "for real".
811 * This also means that we don't allocate space until we are sure that the
812 * thing really will compile successfully, and we never have to move the
813 * code and thus invalidate pointers into it. (Note that it has to be in
814 * one piece because free() must be able to free it all.) [NB: not true in perl]
816 * Beware that the optimization-preparation code in here knows about some
817 * of the structure of the compiled regexp. [I'll say.]
820 Perl_pregcomp(pTHX_ char *exp, char *xend, PMOP *pm)
836 FAIL("NULL regexp argument");
838 if (PL_curcop == &PL_compiling ? (PL_hints & HINT_UTF8) : IN_UTF8)
839 PL_reg_flags |= RF_utf8;
843 PL_regprecomp = savepvn(exp, xend - exp);
844 DEBUG_r(if (!PL_colorset) reginitcolors());
845 DEBUG_r(PerlIO_printf(Perl_debug_log, "%sCompiling REx%s `%s%*s%s'\n",
846 PL_colors[4],PL_colors[5],PL_colors[0],
847 xend - exp, PL_regprecomp, PL_colors[1]));
848 PL_regflags = pm->op_pmflags;
852 PL_seen_zerolen = *exp == '^' ? -1 : 0;
856 /* First pass: determine size, legality. */
857 PL_regcomp_parse = exp;
862 PL_regcode = &PL_regdummy;
863 PL_reg_whilem_seen = 0;
864 regc((U8)REG_MAGIC, (char*)PL_regcode);
865 if (reg(0, &flags) == NULL) {
866 Safefree(PL_regprecomp);
867 PL_regprecomp = Nullch;
870 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %d ", PL_regsize));
872 /* Small enough for pointer-storage convention?
873 If extralen==0, this means that we will not need long jumps. */
874 if (PL_regsize >= 0x10000L && PL_extralen)
875 PL_regsize += PL_extralen;
878 if (PL_reg_whilem_seen > 15)
879 PL_reg_whilem_seen = 15;
881 /* Allocate space and initialize. */
882 Newc(1001, r, sizeof(regexp) + (unsigned)PL_regsize * sizeof(regnode),
885 FAIL("regexp out of space");
887 r->prelen = xend - exp;
888 r->precomp = PL_regprecomp;
890 r->reganch = pm->op_pmflags & PMf_COMPILETIME;
891 r->nparens = PL_regnpar - 1; /* set early to validate backrefs */
893 r->substrs = 0; /* Useful during FAIL. */
894 r->startp = 0; /* Useful during FAIL. */
895 r->endp = 0; /* Useful during FAIL. */
899 /* Second pass: emit code. */
900 PL_regcomp_parse = exp;
904 PL_regcode = r->program;
905 /* Store the count of eval-groups for security checks: */
906 PL_regcode->next_off = ((PL_seen_evals > U16_MAX) ? U16_MAX : PL_seen_evals);
907 regc((U8)REG_MAGIC, (char*) PL_regcode++);
909 if (reg(0, &flags) == NULL)
912 /* Dig out information for optimizations. */
913 r->reganch = pm->op_pmflags & PMf_COMPILETIME; /* Again? */
914 pm->op_pmflags = PL_regflags;
916 r->reganch |= ROPT_UTF8;
917 r->regstclass = NULL;
918 if (PL_regnaughty >= 10) /* Probably an expensive pattern. */
919 r->reganch |= ROPT_NAUGHTY;
920 scan = r->program + 1; /* First BRANCH. */
922 /* XXXX To minimize changes to RE engine we always allocate
923 3-units-long substrs field. */
924 Newz(1004, r->substrs, 1, struct reg_substr_data);
926 StructCopy(&zero_scan_data, &data, scan_data_t);
927 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
929 STRLEN longest_float_length, longest_fixed_length;
932 /* Skip introductions and multiplicators >= 1. */
933 while ((OP(first) == OPEN && (sawopen = 1)) ||
934 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
935 (OP(first) == PLUS) ||
936 (OP(first) == MINMOD) ||
937 (PL_regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
938 if (OP(first) == PLUS)
941 first += regarglen[(U8)OP(first)];
942 first = NEXTOPER(first);
945 /* Starting-point info. */
947 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
948 else if (strchr((char*)PL_simple+4,OP(first)))
949 r->regstclass = first;
950 else if (PL_regkind[(U8)OP(first)] == BOUND ||
951 PL_regkind[(U8)OP(first)] == NBOUND)
952 r->regstclass = first;
953 else if (PL_regkind[(U8)OP(first)] == BOL) {
954 r->reganch |= (OP(first) == MBOL
959 first = NEXTOPER(first);
962 else if (OP(first) == GPOS) {
963 r->reganch |= ROPT_ANCH_GPOS;
964 first = NEXTOPER(first);
967 else if ((OP(first) == STAR &&
968 PL_regkind[(U8)OP(NEXTOPER(first))] == REG_ANY) &&
969 !(r->reganch & ROPT_ANCH) )
971 /* turn .* into ^.* with an implied $*=1 */
972 int type = OP(NEXTOPER(first));
974 if (type == REG_ANY || type == ANYUTF8)
975 type = ROPT_ANCH_MBOL;
977 type = ROPT_ANCH_SBOL;
979 r->reganch |= type | ROPT_IMPLICIT;
980 first = NEXTOPER(first);
983 if (sawplus && (!sawopen || !PL_regsawback)
984 && !(PL_regseen & REG_SEEN_EVAL)) /* May examine pos and $& */
985 /* x+ must match at the 1st pos of run of x's */
986 r->reganch |= ROPT_SKIP;
988 /* Scan is after the zeroth branch, first is atomic matcher. */
989 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
992 * If there's something expensive in the r.e., find the
993 * longest literal string that must appear and make it the
994 * regmust. Resolve ties in favor of later strings, since
995 * the regstart check works with the beginning of the r.e.
996 * and avoiding duplication strengthens checking. Not a
997 * strong reason, but sufficient in the absence of others.
998 * [Now we resolve ties in favor of the earlier string if
999 * it happens that c_offset_min has been invalidated, since the
1000 * earlier string may buy us something the later one won't.]
1004 data.longest_fixed = newSVpvn("",0);
1005 data.longest_float = newSVpvn("",0);
1006 data.last_found = newSVpvn("",0);
1007 data.longest = &(data.longest_fixed);
1010 minlen = study_chunk(&first, &fake, scan + PL_regsize, /* Up to end */
1011 &data, SCF_DO_SUBSTR);
1012 if ( PL_regnpar == 1 && data.longest == &(data.longest_fixed)
1013 && data.last_start_min == 0 && data.last_end > 0
1015 && (!(PL_regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
1016 r->reganch |= ROPT_CHECK_ALL;
1018 SvREFCNT_dec(data.last_found);
1020 longest_float_length = CHR_SVLEN(data.longest_float);
1021 if (longest_float_length
1022 || (data.flags & SF_FL_BEFORE_EOL
1023 && (!(data.flags & SF_FL_BEFORE_MEOL)
1024 || (PL_regflags & PMf_MULTILINE)))) {
1027 if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */
1028 && data.offset_fixed == data.offset_float_min
1029 && SvCUR(data.longest_fixed) == SvCUR(data.longest_float))
1030 goto remove_float; /* As in (a)+. */
1032 r->float_substr = data.longest_float;
1033 r->float_min_offset = data.offset_float_min;
1034 r->float_max_offset = data.offset_float_max;
1035 t = (data.flags & SF_FL_BEFORE_EOL /* Can't have SEOL and MULTI */
1036 && (!(data.flags & SF_FL_BEFORE_MEOL)
1037 || (PL_regflags & PMf_MULTILINE)));
1038 fbm_compile(r->float_substr, t ? FBMcf_TAIL : 0);
1042 r->float_substr = Nullsv;
1043 SvREFCNT_dec(data.longest_float);
1044 longest_float_length = 0;
1047 longest_fixed_length = CHR_SVLEN(data.longest_fixed);
1048 if (longest_fixed_length
1049 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
1050 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1051 || (PL_regflags & PMf_MULTILINE)))) {
1054 r->anchored_substr = data.longest_fixed;
1055 r->anchored_offset = data.offset_fixed;
1056 t = (data.flags & SF_FIX_BEFORE_EOL /* Can't have SEOL and MULTI */
1057 && (!(data.flags & SF_FIX_BEFORE_MEOL)
1058 || (PL_regflags & PMf_MULTILINE)));
1059 fbm_compile(r->anchored_substr, t ? FBMcf_TAIL : 0);
1062 r->anchored_substr = Nullsv;
1063 SvREFCNT_dec(data.longest_fixed);
1064 longest_fixed_length = 0;
1067 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
1068 if (longest_fixed_length > longest_float_length) {
1069 r->check_substr = r->anchored_substr;
1070 r->check_offset_min = r->check_offset_max = r->anchored_offset;
1071 if (r->reganch & ROPT_ANCH_SINGLE)
1072 r->reganch |= ROPT_NOSCAN;
1075 r->check_substr = r->float_substr;
1076 r->check_offset_min = data.offset_float_min;
1077 r->check_offset_max = data.offset_float_max;
1079 if (r->check_substr) {
1080 r->reganch |= RE_USE_INTUIT;
1081 if (SvTAIL(r->check_substr))
1082 r->reganch |= RE_INTUIT_TAIL;
1086 /* Several toplevels. Best we can is to set minlen. */
1089 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
1090 scan = r->program + 1;
1091 minlen = study_chunk(&scan, &fake, scan + PL_regsize, &data, 0);
1092 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
1096 if (PL_regseen & REG_SEEN_GPOS)
1097 r->reganch |= ROPT_GPOS_SEEN;
1098 if (PL_regseen & REG_SEEN_LOOKBEHIND)
1099 r->reganch |= ROPT_LOOKBEHIND_SEEN;
1100 if (PL_regseen & REG_SEEN_EVAL)
1101 r->reganch |= ROPT_EVAL_SEEN;
1102 Newz(1002, r->startp, PL_regnpar, I32);
1103 Newz(1002, r->endp, PL_regnpar, I32);
1104 DEBUG_r(regdump(r));
1109 - reg - regular expression, i.e. main body or parenthesized thing
1111 * Caller must absorb opening parenthesis.
1113 * Combining parenthesis handling with the base level of regular expression
1114 * is a trifle forced, but the need to tie the tails of the branches to what
1115 * follows makes it hard to avoid.
1118 S_reg(pTHX_ I32 paren, I32 *flagp)
1119 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
1122 register regnode *ret; /* Will be the head of the group. */
1123 register regnode *br;
1124 register regnode *lastbr;
1125 register regnode *ender = 0;
1126 register I32 parno = 0;
1127 I32 flags, oregflags = PL_regflags, have_branch = 0, open = 0;
1130 *flagp = 0; /* Tentatively. */
1132 /* Make an OPEN node, if parenthesized. */
1134 if (*PL_regcomp_parse == '?') {
1135 U16 posflags = 0, negflags = 0;
1136 U16 *flagsp = &posflags;
1140 paren = *PL_regcomp_parse++;
1141 ret = NULL; /* For look-ahead/behind. */
1144 PL_regseen |= REG_SEEN_LOOKBEHIND;
1145 if (*PL_regcomp_parse == '!')
1147 if (*PL_regcomp_parse != '=' && *PL_regcomp_parse != '!')
1158 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1161 while (*PL_regcomp_parse && *PL_regcomp_parse != ')')
1163 if (*PL_regcomp_parse != ')')
1164 FAIL("Sequence (?#... not terminated");
1170 paren = *PL_regcomp_parse++;
1175 I32 count = 1, n = 0;
1177 char *s = PL_regcomp_parse;
1179 OP_4tree *sop, *rop;
1182 PL_regseen |= REG_SEEN_EVAL;
1183 while (count && (c = *PL_regcomp_parse)) {
1184 if (c == '\\' && PL_regcomp_parse[1])
1192 if (*PL_regcomp_parse != ')')
1193 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1197 if (PL_regcomp_parse - 1 - s)
1198 sv = newSVpvn(s, PL_regcomp_parse - 1 - s);
1200 sv = newSVpvn("", 0);
1202 rop = sv_compile_2op(sv, &sop, "re", &av);
1204 n = add_data(3, "nop");
1205 PL_regcomp_rx->data->data[n] = (void*)rop;
1206 PL_regcomp_rx->data->data[n+1] = (void*)sop;
1207 PL_regcomp_rx->data->data[n+2] = (void*)av;
1210 else { /* First pass */
1211 if (PL_reginterp_cnt < ++PL_seen_evals
1212 && PL_curcop != &PL_compiling)
1213 /* No compiled RE interpolated, has runtime
1214 components ===> unsafe. */
1215 FAIL("Eval-group not allowed at runtime, use re 'eval'");
1217 FAIL("Eval-group in insecure regular expression");
1222 ret = reg_node(LOGICAL);
1225 regtail(ret, reganode(EVAL, n));
1228 return reganode(EVAL, n);
1232 if (PL_regcomp_parse[0] == '?') {
1233 if (PL_regcomp_parse[1] == '=' || PL_regcomp_parse[1] == '!'
1234 || PL_regcomp_parse[1] == '<'
1235 || PL_regcomp_parse[1] == '{') { /* Lookahead or eval. */
1238 ret = reg_node(LOGICAL);
1241 regtail(ret, reg(1, &flag));
1245 else if (PL_regcomp_parse[0] >= '1' && PL_regcomp_parse[0] <= '9' ) {
1246 parno = atoi(PL_regcomp_parse++);
1248 while (isDIGIT(*PL_regcomp_parse))
1250 ret = reganode(GROUPP, parno);
1251 if ((c = *nextchar()) != ')')
1252 FAIL2("Switch (?(number%c not recognized", c);
1254 regtail(ret, reganode(IFTHEN, 0));
1255 br = regbranch(&flags, 1);
1257 br = reganode(LONGJMP, 0);
1259 regtail(br, reganode(LONGJMP, 0));
1264 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1265 regbranch(&flags, 1);
1266 regtail(ret, lastbr);
1274 FAIL("Switch (?(condition)... contains too many branches");
1275 ender = reg_node(TAIL);
1278 regtail(lastbr, ender);
1279 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1282 regtail(ret, ender);
1286 FAIL2("Unknown condition for (?(%.2s", PL_regcomp_parse);
1290 FAIL("Sequence (? incomplete");
1295 while (*PL_regcomp_parse && strchr("iogcmsx", *PL_regcomp_parse)) {
1296 if (*PL_regcomp_parse != 'o')
1297 pmflag(flagsp, *PL_regcomp_parse);
1300 if (*PL_regcomp_parse == '-') {
1305 PL_regflags |= posflags;
1306 PL_regflags &= ~negflags;
1307 if (*PL_regcomp_parse == ':') {
1313 if (*PL_regcomp_parse != ')')
1314 FAIL2("Sequence (?%c...) not recognized", *PL_regcomp_parse);
1323 ret = reganode(OPEN, parno);
1330 /* Pick up the branches, linking them together. */
1331 br = regbranch(&flags, 1);
1334 if (*PL_regcomp_parse == '|') {
1335 if (!SIZE_ONLY && PL_extralen) {
1336 reginsert(BRANCHJ, br);
1339 reginsert(BRANCH, br);
1342 PL_extralen += 1; /* For BRANCHJ-BRANCH. */
1344 else if (paren == ':') {
1345 *flagp |= flags&SIMPLE;
1347 if (open) { /* Starts with OPEN. */
1348 regtail(ret, br); /* OPEN -> first. */
1350 else if (paren != '?') /* Not Conditional */
1354 *flagp |= flags&SPSTART;
1356 while (*PL_regcomp_parse == '|') {
1357 if (!SIZE_ONLY && PL_extralen) {
1358 ender = reganode(LONGJMP,0);
1359 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1362 PL_extralen += 2; /* Account for LONGJMP. */
1364 br = regbranch(&flags, 0);
1367 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1371 *flagp |= flags&SPSTART;
1374 if (have_branch || paren != ':') {
1375 /* Make a closing node, and hook it on the end. */
1378 ender = reg_node(TAIL);
1381 ender = reganode(CLOSE, parno);
1387 *flagp &= ~HASWIDTH;
1390 ender = reg_node(SUCCEED);
1393 ender = reg_node(END);
1396 regtail(lastbr, ender);
1399 /* Hook the tails of the branches to the closing node. */
1400 for (br = ret; br != NULL; br = regnext(br)) {
1401 regoptail(br, ender);
1408 static char parens[] = "=!<,>";
1410 if (paren && (p = strchr(parens, paren))) {
1411 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1412 int flag = (p - parens) > 1;
1415 node = SUSPEND, flag = 0;
1416 reginsert(node,ret);
1418 regtail(ret, reg_node(TAIL));
1422 /* Check for proper termination. */
1424 PL_regflags = oregflags;
1425 if (PL_regcomp_parse >= PL_regxend || *nextchar() != ')') {
1426 FAIL("unmatched () in regexp");
1429 else if (!paren && PL_regcomp_parse < PL_regxend) {
1430 if (*PL_regcomp_parse == ')') {
1431 FAIL("unmatched () in regexp");
1434 FAIL("junk on end of regexp"); /* "Can't happen". */
1442 - regbranch - one alternative of an | operator
1444 * Implements the concatenation operator.
1447 S_regbranch(pTHX_ I32 *flagp, I32 first)
1450 register regnode *ret;
1451 register regnode *chain = NULL;
1452 register regnode *latest;
1453 I32 flags = 0, c = 0;
1458 if (!SIZE_ONLY && PL_extralen)
1459 ret = reganode(BRANCHJ,0);
1461 ret = reg_node(BRANCH);
1464 if (!first && SIZE_ONLY)
1465 PL_extralen += 1; /* BRANCHJ */
1467 *flagp = WORST; /* Tentatively. */
1471 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '|' && *PL_regcomp_parse != ')') {
1473 latest = regpiece(&flags);
1474 if (latest == NULL) {
1475 if (flags & TRYAGAIN)
1479 else if (ret == NULL)
1481 *flagp |= flags&HASWIDTH;
1482 if (chain == NULL) /* First piece. */
1483 *flagp |= flags&SPSTART;
1486 regtail(chain, latest);
1491 if (chain == NULL) { /* Loop ran zero times. */
1492 chain = reg_node(NOTHING);
1497 *flagp |= flags&SIMPLE;
1504 - regpiece - something followed by possible [*+?]
1506 * Note that the branching code sequences used for ? and the general cases
1507 * of * and + are somewhat optimized: they use the same NOTHING node as
1508 * both the endmarker for their branch list and the body of the last branch.
1509 * It might seem that this node could be dispensed with entirely, but the
1510 * endmarker role is not redundant.
1513 S_regpiece(pTHX_ I32 *flagp)
1516 register regnode *ret;
1518 register char *next;
1520 char *origparse = PL_regcomp_parse;
1523 I32 max = REG_INFTY;
1525 ret = regatom(&flags);
1527 if (flags & TRYAGAIN)
1532 op = *PL_regcomp_parse;
1534 if (op == '{' && regcurly(PL_regcomp_parse)) {
1535 next = PL_regcomp_parse + 1;
1537 while (isDIGIT(*next) || *next == ',') {
1546 if (*next == '}') { /* got one */
1550 min = atoi(PL_regcomp_parse);
1554 maxpos = PL_regcomp_parse;
1556 if (!max && *maxpos != '0')
1557 max = REG_INFTY; /* meaning "infinity" */
1558 else if (max >= REG_INFTY)
1559 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
1560 PL_regcomp_parse = next;
1564 if ((flags&SIMPLE)) {
1565 PL_regnaughty += 2 + PL_regnaughty / 2;
1566 reginsert(CURLY, ret);
1569 regnode *w = reg_node(WHILEM);
1573 if (!SIZE_ONLY && PL_extralen) {
1574 reginsert(LONGJMP,ret);
1575 reginsert(NOTHING,ret);
1576 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1578 reginsert(CURLYX,ret);
1579 if (!SIZE_ONLY && PL_extralen)
1580 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1581 regtail(ret, reg_node(NOTHING));
1583 PL_reg_whilem_seen++, PL_extralen += 3;
1584 PL_regnaughty += 4 + PL_regnaughty; /* compound interest */
1592 if (max && max < min)
1593 FAIL("Can't do {n,m} with n > m");
1608 #if 0 /* Now runtime fix should be reliable. */
1609 if (!(flags&HASWIDTH) && op != '?')
1610 FAIL("regexp *+ operand could be empty");
1615 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
1617 if (op == '*' && (flags&SIMPLE)) {
1618 reginsert(STAR, ret);
1622 else if (op == '*') {
1626 else if (op == '+' && (flags&SIMPLE)) {
1627 reginsert(PLUS, ret);
1631 else if (op == '+') {
1635 else if (op == '?') {
1640 if (ckWARN(WARN_UNSAFE) && !SIZE_ONLY && !(flags&HASWIDTH) && max > REG_INFTY/3) {
1641 Perl_warner(aTHX_ WARN_UNSAFE, "%.*s matches null string many times",
1642 PL_regcomp_parse - origparse, origparse);
1645 if (*PL_regcomp_parse == '?') {
1647 reginsert(MINMOD, ret);
1648 regtail(ret, ret + NODE_STEP_REGNODE);
1650 if (ISMULT2(PL_regcomp_parse))
1651 FAIL("nested *?+ in regexp");
1657 - regatom - the lowest level
1659 * Optimization: gobbles an entire sequence of ordinary characters so that
1660 * it can turn them into a single node, which is smaller to store and
1661 * faster to run. Backslashed characters are exceptions, each becoming a
1662 * separate node; the code is simpler that way and it's not worth fixing.
1664 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1667 S_regatom(pTHX_ I32 *flagp)
1670 register regnode *ret = 0;
1673 *flagp = WORST; /* Tentatively. */
1676 switch (*PL_regcomp_parse) {
1680 if (PL_regflags & PMf_MULTILINE)
1681 ret = reg_node(MBOL);
1682 else if (PL_regflags & PMf_SINGLELINE)
1683 ret = reg_node(SBOL);
1685 ret = reg_node(BOL);
1688 if (PL_regcomp_parse[1])
1691 if (PL_regflags & PMf_MULTILINE)
1692 ret = reg_node(MEOL);
1693 else if (PL_regflags & PMf_SINGLELINE)
1694 ret = reg_node(SEOL);
1696 ret = reg_node(EOL);
1701 if (PL_regflags & PMf_SINGLELINE)
1702 ret = reg_node(SANYUTF8);
1704 ret = reg_node(ANYUTF8);
1708 if (PL_regflags & PMf_SINGLELINE)
1709 ret = reg_node(SANY);
1711 ret = reg_node(REG_ANY);
1712 *flagp |= HASWIDTH|SIMPLE;
1718 ret = (UTF ? regclassutf8() : regclass());
1719 if (*PL_regcomp_parse != ']')
1720 FAIL("unmatched [] in regexp");
1722 *flagp |= HASWIDTH|SIMPLE;
1726 ret = reg(1, &flags);
1728 if (flags & TRYAGAIN)
1732 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
1736 if (flags & TRYAGAIN) {
1740 FAIL2("internal urp in regexp at /%s/", PL_regcomp_parse);
1741 /* Supposed to be caught earlier. */
1744 if (!regcurly(PL_regcomp_parse)) {
1752 FAIL("?+*{} follows nothing in regexp");
1755 switch (*++PL_regcomp_parse) {
1758 ret = reg_node(SBOL);
1763 ret = reg_node(GPOS);
1764 PL_regseen |= REG_SEEN_GPOS;
1769 ret = reg_node(SEOL);
1774 ret = reg_node(EOS);
1776 PL_seen_zerolen++; /* Do not optimize RE away */
1780 ret = reg_node(SANY);
1781 *flagp |= HASWIDTH|SIMPLE;
1785 ret = reg_node(CLUMP);
1788 if (UTF && !PL_utf8_mark)
1789 is_utf8_mark((U8*)"~"); /* preload table */
1794 ? (LOC ? ALNUMLUTF8 : ALNUMUTF8)
1795 : (LOC ? ALNUML : ALNUM));
1796 *flagp |= HASWIDTH|SIMPLE;
1798 if (UTF && !PL_utf8_alnum)
1799 is_utf8_alnum((U8*)"a"); /* preload table */
1804 ? (LOC ? NALNUMLUTF8 : NALNUMUTF8)
1805 : (LOC ? NALNUML : NALNUM));
1806 *flagp |= HASWIDTH|SIMPLE;
1808 if (UTF && !PL_utf8_alnum)
1809 is_utf8_alnum((U8*)"a"); /* preload table */
1813 PL_regseen |= REG_SEEN_LOOKBEHIND;
1816 ? (LOC ? BOUNDLUTF8 : BOUNDUTF8)
1817 : (LOC ? BOUNDL : BOUND));
1820 if (UTF && !PL_utf8_alnum)
1821 is_utf8_alnum((U8*)"a"); /* preload table */
1825 PL_regseen |= REG_SEEN_LOOKBEHIND;
1828 ? (LOC ? NBOUNDLUTF8 : NBOUNDUTF8)
1829 : (LOC ? NBOUNDL : NBOUND));
1832 if (UTF && !PL_utf8_alnum)
1833 is_utf8_alnum((U8*)"a"); /* preload table */
1838 ? (LOC ? SPACELUTF8 : SPACEUTF8)
1839 : (LOC ? SPACEL : SPACE));
1840 *flagp |= HASWIDTH|SIMPLE;
1842 if (UTF && !PL_utf8_space)
1843 is_utf8_space((U8*)" "); /* preload table */
1848 ? (LOC ? NSPACELUTF8 : NSPACEUTF8)
1849 : (LOC ? NSPACEL : NSPACE));
1850 *flagp |= HASWIDTH|SIMPLE;
1852 if (UTF && !PL_utf8_space)
1853 is_utf8_space((U8*)" "); /* preload table */
1856 ret = reg_node(UTF ? DIGITUTF8 : DIGIT);
1857 *flagp |= HASWIDTH|SIMPLE;
1859 if (UTF && !PL_utf8_digit)
1860 is_utf8_digit((U8*)"1"); /* preload table */
1863 ret = reg_node(UTF ? NDIGITUTF8 : NDIGIT);
1864 *flagp |= HASWIDTH|SIMPLE;
1866 if (UTF && !PL_utf8_digit)
1867 is_utf8_digit((U8*)"1"); /* preload table */
1871 { /* a lovely hack--pretend we saw [\pX] instead */
1872 char* oldregxend = PL_regxend;
1874 if (PL_regcomp_parse[1] == '{') {
1875 PL_regxend = strchr(PL_regcomp_parse, '}');
1877 FAIL("Missing right brace on \\p{}");
1881 PL_regxend = PL_regcomp_parse + 2;
1884 ret = regclassutf8();
1886 PL_regxend = oldregxend;
1889 *flagp |= HASWIDTH|SIMPLE;
1902 case '1': case '2': case '3': case '4':
1903 case '5': case '6': case '7': case '8': case '9':
1905 I32 num = atoi(PL_regcomp_parse);
1907 if (num > 9 && num >= PL_regnpar)
1910 if (!SIZE_ONLY && num > PL_regcomp_rx->nparens)
1911 FAIL("reference to nonexistent group");
1914 ? (LOC ? REFFL : REFF)
1917 while (isDIGIT(*PL_regcomp_parse))
1925 if (PL_regcomp_parse >= PL_regxend)
1926 FAIL("trailing \\ in regexp");
1929 /* Do not generate `unrecognized' warnings here, we fall
1930 back into the quick-grab loop below */
1936 if (PL_regflags & PMf_EXTENDED) {
1937 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '\n') PL_regcomp_parse++;
1938 if (PL_regcomp_parse < PL_regxend)
1954 ? (LOC ? EXACTFL : EXACTF)
1956 s = (char *) OPERAND(ret);
1957 regc(0, s++); /* save spot for len */
1958 for (len = 0, p = PL_regcomp_parse - 1;
1959 len < 127 && p < PL_regxend;
1964 if (PL_regflags & PMf_EXTENDED)
1965 p = regwhite(p, PL_regxend);
2019 char* e = strchr(p, '}');
2022 FAIL("Missing right brace on \\x{}");
2024 ender = scan_hex(p + 1, e - p, &numlen);
2025 if (numlen + len >= 127) { /* numlen is generous */
2032 FAIL("Can't use \\x{} without 'use utf8' declaration");
2035 ender = scan_hex(p, 2, &numlen);
2041 ender = UCHARAT(p++);
2042 ender = toCTRL(ender);
2044 case '0': case '1': case '2': case '3':case '4':
2045 case '5': case '6': case '7': case '8':case '9':
2047 (isDIGIT(p[1]) && atoi(p) >= PL_regnpar) ) {
2048 ender = scan_oct(p, 3, &numlen);
2057 if (p >= PL_regxend)
2058 FAIL("trailing \\ in regexp");
2061 if (!SIZE_ONLY && ckWARN(WARN_UNSAFE) && isALPHA(*p))
2062 Perl_warner(aTHX_ WARN_UNSAFE,
2063 "/%.127s/: Unrecognized escape \\%c passed through",
2066 goto normal_default;
2071 if ((*p & 0xc0) == 0xc0 && UTF) {
2072 ender = utf8_to_uv((U8*)p, &numlen);
2079 if (PL_regflags & PMf_EXTENDED)
2080 p = regwhite(p, PL_regxend);
2083 ender = toLOWER_LC_uni(ender);
2085 ender = toLOWER_uni(ender);
2087 if (ISMULT2(p)) { /* Back off on ?+*. */
2090 else if (ender >= 0x80 && UTF) {
2091 reguni(ender, s, &numlen);
2101 if (ender >= 0x80 && UTF) {
2102 reguni(ender, s, &numlen);
2110 PL_regcomp_parse = p - 1;
2113 FAIL("internal disaster in regexp");
2119 *OPERAND(ret) = len;
2122 PL_regsize += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2125 PL_regcode += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2135 S_regwhite(pTHX_ char *p, char *e)
2140 else if (*p == '#') {
2143 } while (p < e && *p != '\n');
2151 /* Parse POSIX character classes: [[:foo:]], [[=foo=]], [[.foo.]].
2152 Character classes ([:foo:]) can also be negated ([:^foo:]).
2153 Returns a named class id (ANYOF_XXX) if successful, -1 otherwise.
2154 Equivalence classes ([=foo=]) and composites ([.foo.]) are parsed,
2155 but trigger warnings because they are currently unimplemented. */
2157 S_regpposixcc(pTHX_ I32 value)
2161 I32 namedclass = -1;
2163 if (value == '[' && PL_regcomp_parse + 1 < PL_regxend &&
2164 /* I smell either [: or [= or [. -- POSIX has been here, right? */
2165 (*PL_regcomp_parse == ':' ||
2166 *PL_regcomp_parse == '=' ||
2167 *PL_regcomp_parse == '.')) {
2168 char c = *PL_regcomp_parse;
2169 char* s = PL_regcomp_parse++;
2171 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != c)
2173 if (PL_regcomp_parse == PL_regxend)
2174 /* Grandfather lone [:, [=, [. */
2175 PL_regcomp_parse = s;
2177 char* t = PL_regcomp_parse++; /* skip over the c */
2179 if (*PL_regcomp_parse == ']') {
2180 PL_regcomp_parse++; /* skip over the ending ] */
2183 I32 complement = *posixcc == '^' ? *posixcc++ : 0;
2184 I32 skip = 5; /* the most common skip */
2188 if (strnEQ(posixcc, "alnum", 5))
2190 complement ? ANYOF_NALNUMC : ANYOF_ALNUMC;
2191 else if (strnEQ(posixcc, "alpha", 5))
2193 complement ? ANYOF_NALPHA : ANYOF_ALPHA;
2194 else if (strnEQ(posixcc, "ascii", 5))
2196 complement ? ANYOF_NASCII : ANYOF_ASCII;
2199 if (strnEQ(posixcc, "cntrl", 5))
2201 complement ? ANYOF_NCNTRL : ANYOF_CNTRL;
2204 if (strnEQ(posixcc, "digit", 5))
2206 complement ? ANYOF_NDIGIT : ANYOF_DIGIT;
2209 if (strnEQ(posixcc, "graph", 5))
2211 complement ? ANYOF_NGRAPH : ANYOF_GRAPH;
2214 if (strnEQ(posixcc, "lower", 5))
2216 complement ? ANYOF_NLOWER : ANYOF_LOWER;
2219 if (strnEQ(posixcc, "print", 5))
2221 complement ? ANYOF_NPRINT : ANYOF_PRINT;
2222 else if (strnEQ(posixcc, "punct", 5))
2224 complement ? ANYOF_NPUNCT : ANYOF_PUNCT;
2227 if (strnEQ(posixcc, "space", 5))
2229 complement ? ANYOF_NSPACE : ANYOF_SPACE;
2231 if (strnEQ(posixcc, "upper", 5))
2233 complement ? ANYOF_NUPPER : ANYOF_UPPER;
2235 case 'w': /* this is not POSIX, this is the Perl \w */
2236 if (strnEQ(posixcc, "word", 4)) {
2238 complement ? ANYOF_NALNUM : ANYOF_ALNUM;
2243 if (strnEQ(posixcc, "xdigit", 6)) {
2245 complement ? ANYOF_NXDIGIT : ANYOF_XDIGIT;
2250 if ((namedclass == -1 ||
2251 !(posixcc + skip + 2 < PL_regxend &&
2252 (posixcc[skip] == ':' &&
2253 posixcc[skip + 1] == ']'))))
2254 Perl_croak(aTHX_ "Character class [:%.*s:] unknown",
2256 } else if (ckWARN(WARN_UNSAFE) && !SIZE_ONLY)
2257 /* [[=foo=]] and [[.foo.]] are still future. */
2258 Perl_warner(aTHX_ WARN_UNSAFE,
2259 "Character class syntax [%c %c] is reserved for future extensions", c, c);
2261 /* Maternal grandfather:
2262 * "[:" ending in ":" but not in ":]" */
2263 PL_regcomp_parse = s;
2272 S_checkposixcc(pTHX)
2274 if (ckWARN(WARN_UNSAFE) && !SIZE_ONLY &&
2275 (*PL_regcomp_parse == ':' ||
2276 *PL_regcomp_parse == '=' ||
2277 *PL_regcomp_parse == '.')) {
2278 char *s = PL_regcomp_parse;
2281 while(*s && isALNUM(*s))
2283 if (*s && c == *s && s[1] == ']') {
2284 Perl_warner(aTHX_ WARN_UNSAFE,
2285 "Character class syntax [%c %c] belongs inside character classes", c, c);
2286 if (c == '=' || c == '.')
2287 Perl_warner(aTHX_ WARN_UNSAFE,
2288 "Character class syntax [%c %c] is reserved for future extensions", c, c);
2297 register char *opnd, *s;
2299 register I32 lastvalue = OOB_CHAR8;
2300 register I32 range = 0;
2301 register regnode *ret;
2306 s = opnd = (char *) OPERAND(PL_regcode);
2307 ret = reg_node(ANYOF);
2308 for (value = 0; value < ANYOF_SIZE; value++)
2310 if (*PL_regcomp_parse == '^') { /* Complement of range. */
2314 ANYOF_FLAGS(opnd) |= ANYOF_INVERT;
2317 PL_regcode += ANY_SKIP;
2319 ANYOF_FLAGS(opnd) |= ANYOF_FOLD;
2321 ANYOF_FLAGS(opnd) |= ANYOF_LOCALE;
2324 PL_regsize += ANY_SKIP;
2329 if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-')
2330 goto skipcond; /* allow 1st char to be ] or - */
2331 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') {
2334 value = UCHARAT(PL_regcomp_parse++);
2336 namedclass = regpposixcc(value);
2337 else if (value == '\\') {
2338 value = UCHARAT(PL_regcomp_parse++);
2340 case 'w': namedclass = ANYOF_ALNUM; break;
2341 case 'W': namedclass = ANYOF_NALNUM; break;
2342 case 's': namedclass = ANYOF_SPACE; break;
2343 case 'S': namedclass = ANYOF_NSPACE; break;
2344 case 'd': namedclass = ANYOF_DIGIT; break;
2345 case 'D': namedclass = ANYOF_NDIGIT; break;
2346 case 'n': value = '\n'; break;
2347 case 'r': value = '\r'; break;
2348 case 't': value = '\t'; break;
2349 case 'f': value = '\f'; break;
2350 case 'b': value = '\b'; break;
2351 case 'e': value = '\033'; break;
2352 case 'a': value = '\007'; break;
2354 value = scan_hex(PL_regcomp_parse, 2, &numlen);
2355 PL_regcomp_parse += numlen;
2358 value = UCHARAT(PL_regcomp_parse++);
2359 value = toCTRL(value);
2361 case '0': case '1': case '2': case '3': case '4':
2362 case '5': case '6': case '7': case '8': case '9':
2363 value = scan_oct(--PL_regcomp_parse, 3, &numlen);
2364 PL_regcomp_parse += numlen;
2368 if (!SIZE_ONLY && namedclass > -1) {
2369 switch (namedclass) {
2372 ANYOF_CLASS_SET(opnd, ANYOF_ALNUM);
2374 for (value = 0; value < 256; value++)
2376 ANYOF_BITMAP_SET(opnd, value);
2381 ANYOF_CLASS_SET(opnd, ANYOF_NALNUM);
2383 for (value = 0; value < 256; value++)
2384 if (!isALNUM(value))
2385 ANYOF_BITMAP_SET(opnd, value);
2390 ANYOF_CLASS_SET(opnd, ANYOF_SPACE);
2392 for (value = 0; value < 256; value++)
2394 ANYOF_BITMAP_SET(opnd, value);
2399 ANYOF_CLASS_SET(opnd, ANYOF_NSPACE);
2401 for (value = 0; value < 256; value++)
2402 if (!isSPACE(value))
2403 ANYOF_BITMAP_SET(opnd, value);
2408 ANYOF_CLASS_SET(opnd, ANYOF_DIGIT);
2410 for (value = '0'; value <= '9'; value++)
2411 ANYOF_BITMAP_SET(opnd, value);
2416 ANYOF_CLASS_SET(opnd, ANYOF_NDIGIT);
2418 for (value = 0; value < '0'; value++)
2419 ANYOF_BITMAP_SET(opnd, value);
2420 for (value = '9' + 1; value < 256; value++)
2421 ANYOF_BITMAP_SET(opnd, value);
2426 ANYOF_CLASS_SET(opnd, ANYOF_NALNUMC);
2428 for (value = 0; value < 256; value++)
2429 if (!isALNUMC(value))
2430 ANYOF_BITMAP_SET(opnd, value);
2435 ANYOF_CLASS_SET(opnd, ANYOF_ALNUMC);
2437 for (value = 0; value < 256; value++)
2438 if (isALNUMC(value))
2439 ANYOF_BITMAP_SET(opnd, value);
2444 ANYOF_CLASS_SET(opnd, ANYOF_ALPHA);
2446 for (value = 0; value < 256; value++)
2448 ANYOF_BITMAP_SET(opnd, value);
2453 ANYOF_CLASS_SET(opnd, ANYOF_NALPHA);
2455 for (value = 0; value < 256; value++)
2456 if (!isALPHA(value))
2457 ANYOF_BITMAP_SET(opnd, value);
2462 ANYOF_CLASS_SET(opnd, ANYOF_ASCII);
2464 for (value = 0; value < 128; value++)
2465 ANYOF_BITMAP_SET(opnd, value);
2470 ANYOF_CLASS_SET(opnd, ANYOF_NASCII);
2472 for (value = 128; value < 256; value++)
2473 ANYOF_BITMAP_SET(opnd, value);
2478 ANYOF_CLASS_SET(opnd, ANYOF_CNTRL);
2480 for (value = 0; value < 256; value++)
2482 ANYOF_BITMAP_SET(opnd, value);
2484 lastvalue = OOB_CHAR8;
2488 ANYOF_CLASS_SET(opnd, ANYOF_NCNTRL);
2490 for (value = 0; value < 256; value++)
2491 if (!isCNTRL(value))
2492 ANYOF_BITMAP_SET(opnd, value);
2497 ANYOF_CLASS_SET(opnd, ANYOF_GRAPH);
2499 for (value = 0; value < 256; value++)
2501 ANYOF_BITMAP_SET(opnd, value);
2506 ANYOF_CLASS_SET(opnd, ANYOF_NGRAPH);
2508 for (value = 0; value < 256; value++)
2509 if (!isGRAPH(value))
2510 ANYOF_BITMAP_SET(opnd, value);
2515 ANYOF_CLASS_SET(opnd, ANYOF_LOWER);
2517 for (value = 0; value < 256; value++)
2519 ANYOF_BITMAP_SET(opnd, value);
2524 ANYOF_CLASS_SET(opnd, ANYOF_NLOWER);
2526 for (value = 0; value < 256; value++)
2527 if (!isLOWER(value))
2528 ANYOF_BITMAP_SET(opnd, value);
2533 ANYOF_CLASS_SET(opnd, ANYOF_PRINT);
2535 for (value = 0; value < 256; value++)
2537 ANYOF_BITMAP_SET(opnd, value);
2542 ANYOF_CLASS_SET(opnd, ANYOF_NPRINT);
2544 for (value = 0; value < 256; value++)
2545 if (!isPRINT(value))
2546 ANYOF_BITMAP_SET(opnd, value);
2551 ANYOF_CLASS_SET(opnd, ANYOF_PUNCT);
2553 for (value = 0; value < 256; value++)
2555 ANYOF_BITMAP_SET(opnd, value);
2560 ANYOF_CLASS_SET(opnd, ANYOF_NPUNCT);
2562 for (value = 0; value < 256; value++)
2563 if (!isPUNCT(value))
2564 ANYOF_BITMAP_SET(opnd, value);
2569 ANYOF_CLASS_SET(opnd, ANYOF_UPPER);
2571 for (value = 0; value < 256; value++)
2573 ANYOF_BITMAP_SET(opnd, value);
2578 ANYOF_CLASS_SET(opnd, ANYOF_NUPPER);
2580 for (value = 0; value < 256; value++)
2581 if (!isUPPER(value))
2582 ANYOF_BITMAP_SET(opnd, value);
2587 ANYOF_CLASS_SET(opnd, ANYOF_XDIGIT);
2589 for (value = 0; value < 256; value++)
2590 if (isXDIGIT(value))
2591 ANYOF_BITMAP_SET(opnd, value);
2596 ANYOF_CLASS_SET(opnd, ANYOF_NXDIGIT);
2598 for (value = 0; value < 256; value++)
2599 if (!isXDIGIT(value))
2600 ANYOF_BITMAP_SET(opnd, value);
2604 FAIL("invalid [::] class in regexp");
2608 ANYOF_FLAGS(opnd) |= ANYOF_CLASS;
2609 lastvalue = OOB_CHAR8;
2613 if (lastvalue > value)
2614 FAIL("invalid [] range in regexp");
2619 if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend &&
2620 PL_regcomp_parse[1] != ']') {
2623 continue; /* do it next time */
2628 if ((isLOWER(lastvalue) && isLOWER(value)) ||
2629 (isUPPER(lastvalue) && isUPPER(value)))
2632 if (isLOWER(lastvalue)) {
2633 for (i = lastvalue; i <= value; i++)
2635 ANYOF_BITMAP_SET(opnd, i);
2637 for (i = lastvalue; i <= value; i++)
2639 ANYOF_BITMAP_SET(opnd, i);
2644 for ( ; lastvalue <= value; lastvalue++)
2645 ANYOF_BITMAP_SET(opnd, lastvalue);
2649 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
2651 (ANYOF_FLAGS(opnd) & (ANYOF_FLAGS_ALL ^ ANYOF_INVERT)) == ANYOF_FOLD) {
2652 for (value = 0; value < 256; ++value) {
2653 if (ANYOF_BITMAP_TEST(opnd, value)) {
2654 I32 cf = PL_fold[value];
2655 ANYOF_BITMAP_SET(opnd, cf);
2658 ANYOF_FLAGS(opnd) &= ~ANYOF_FOLD;
2660 /* optimize inverted simple patterns (e.g. [^a-z]) */
2661 if (!SIZE_ONLY && (ANYOF_FLAGS(opnd) & ANYOF_FLAGS_ALL) == ANYOF_INVERT) {
2662 for (value = 0; value < ANYOF_BITMAP_SIZE; ++value)
2663 opnd[ANYOF_BITMAP_OFFSET + value] ^= ANYOF_FLAGS_ALL;
2664 ANYOF_FLAGS(opnd) = 0;
2670 S_regclassutf8(pTHX)
2673 register char *opnd, *e;
2675 register U32 lastvalue = OOB_UTF8;
2676 register I32 range = 0;
2677 register regnode *ret;
2684 if (*PL_regcomp_parse == '^') { /* Complement of range. */
2688 flags |= ANYOF_INVERT;
2692 flags |= ANYOF_FOLD;
2694 flags |= ANYOF_LOCALE;
2695 listsv = newSVpvn("# comment\n",10);
2700 if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-')
2701 goto skipcond; /* allow 1st char to be ] or - */
2703 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') {
2706 value = utf8_to_uv((U8*)PL_regcomp_parse, &numlen);
2707 PL_regcomp_parse += numlen;
2710 namedclass = regpposixcc(value);
2711 else if (value == '\\') {
2712 value = utf8_to_uv((U8*)PL_regcomp_parse, &numlen);
2713 PL_regcomp_parse += numlen;
2715 case 'w': namedclass = ANYOF_ALNUM; break;
2716 case 'W': namedclass = ANYOF_NALNUM; break;
2717 case 's': namedclass = ANYOF_SPACE; break;
2718 case 'S': namedclass = ANYOF_NSPACE; break;
2719 case 'd': namedclass = ANYOF_DIGIT; break;
2720 case 'D': namedclass = ANYOF_NDIGIT; break;
2723 if (*PL_regcomp_parse == '{') {
2724 e = strchr(PL_regcomp_parse++, '}');
2726 FAIL("Missing right brace on \\p{}");
2727 n = e - PL_regcomp_parse;
2730 e = PL_regcomp_parse;
2735 Perl_sv_catpvf(aTHX_ listsv,
2736 "+utf8::%.*s\n", n, PL_regcomp_parse);
2738 Perl_sv_catpvf(aTHX_ listsv,
2739 "!utf8::%.*s\n", n, PL_regcomp_parse);
2741 PL_regcomp_parse = e + 1;
2742 lastvalue = OOB_UTF8;
2744 case 'n': value = '\n'; break;
2745 case 'r': value = '\r'; break;
2746 case 't': value = '\t'; break;
2747 case 'f': value = '\f'; break;
2748 case 'b': value = '\b'; break;
2749 case 'e': value = '\033'; break;
2750 case 'a': value = '\007'; break;
2752 if (*PL_regcomp_parse == '{') {
2753 e = strchr(PL_regcomp_parse++, '}');
2755 FAIL("Missing right brace on \\x{}");
2756 value = scan_hex(PL_regcomp_parse,
2757 e - PL_regcomp_parse,
2759 PL_regcomp_parse = e + 1;
2762 value = scan_hex(PL_regcomp_parse, 2, &numlen);
2763 PL_regcomp_parse += numlen;
2767 value = UCHARAT(PL_regcomp_parse++);
2768 value = toCTRL(value);
2770 case '0': case '1': case '2': case '3': case '4':
2771 case '5': case '6': case '7': case '8': case '9':
2772 value = scan_oct(--PL_regcomp_parse, 3, &numlen);
2773 PL_regcomp_parse += numlen;
2777 if (!SIZE_ONLY && namedclass > -1) {
2778 switch (namedclass) {
2780 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsWord\n"); break;
2782 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsWord\n"); break;
2784 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlnum\n"); break;
2786 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlnum\n"); break;
2788 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsAlpha\n"); break;
2790 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsAlpha\n"); break;
2792 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsASCII\n"); break;
2794 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsASCII\n"); break;
2796 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsCntrl\n"); break;
2798 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsCntrl\n"); break;
2800 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsGraph\n"); break;
2802 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsGraph\n"); break;
2804 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsDigit\n"); break;
2806 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsDigit\n"); break;
2808 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsLower\n"); break;
2810 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsLower\n"); break;
2812 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPrint\n"); break;
2814 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPrint\n"); break;
2816 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsPunct\n"); break;
2818 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsPunct\n"); break;
2820 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsSpace\n"); break;
2822 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsSpace\n"); break;
2824 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsUpper\n"); break;
2826 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsUpper\n"); break;
2828 Perl_sv_catpvf(aTHX_ listsv, "+utf8::IsXDigit\n"); break;
2830 Perl_sv_catpvf(aTHX_ listsv, "!utf8::IsXDigit\n"); break;
2835 if (lastvalue > value)
2836 FAIL("invalid [] range in regexp");
2839 Perl_sv_catpvf(aTHX_ listsv, "%04" PERL_PRIx64 "\t%04" PERL_PRIx64 "\n", (UV)lastvalue, (UV)value);
2842 Perl_sv_catpvf(aTHX_ listsv, "%04x\t%04x\n", lastvalue, value);
2849 if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend &&
2850 PL_regcomp_parse[1] != ']') {
2853 continue; /* do it next time */
2857 Perl_sv_catpvf(aTHX_ listsv, "%04" PERL_PRIx64 "\n", (UV)value);
2860 Perl_sv_catpvf(aTHX_ listsv, "%04x\n", value);
2865 ret = reganode(ANYOFUTF8, 0);
2868 SV *rv = swash_init("utf8", "", listsv, 1, 0);
2869 SvREFCNT_dec(listsv);
2870 n = add_data(1,"s");
2871 PL_regcomp_rx->data->data[n] = (void*)rv;
2872 ARG1_SET(ret, flags);
2883 char* retval = PL_regcomp_parse++;
2886 if (*PL_regcomp_parse == '(' && PL_regcomp_parse[1] == '?' &&
2887 PL_regcomp_parse[2] == '#') {
2888 while (*PL_regcomp_parse && *PL_regcomp_parse != ')')
2893 if (PL_regflags & PMf_EXTENDED) {
2894 if (isSPACE(*PL_regcomp_parse)) {
2898 else if (*PL_regcomp_parse == '#') {
2899 while (*PL_regcomp_parse && *PL_regcomp_parse != '\n')
2910 - reg_node - emit a node
2912 STATIC regnode * /* Location. */
2913 S_reg_node(pTHX_ U8 op)
2916 register regnode *ret;
2917 register regnode *ptr;
2921 SIZE_ALIGN(PL_regsize);
2926 NODE_ALIGN_FILL(ret);
2928 FILL_ADVANCE_NODE(ptr, op);
2935 - reganode - emit a node with an argument
2937 STATIC regnode * /* Location. */
2938 S_reganode(pTHX_ U8 op, U32 arg)
2941 register regnode *ret;
2942 register regnode *ptr;
2946 SIZE_ALIGN(PL_regsize);
2951 NODE_ALIGN_FILL(ret);
2953 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
2960 - regc - emit (if appropriate) a Unicode character
2963 S_reguni(pTHX_ UV uv, char* s, I32* lenp)
2968 *lenp = uv_to_utf8(tmpbuf, uv) - tmpbuf;
2971 *lenp = uv_to_utf8((U8*)s, uv) - (U8*)s;
2976 - regc - emit (if appropriate) a byte of code
2979 S_regc(pTHX_ U8 b, char* s)
2987 - reginsert - insert an operator in front of already-emitted operand
2989 * Means relocating the operand.
2992 S_reginsert(pTHX_ U8 op, regnode *opnd)
2995 register regnode *src;
2996 register regnode *dst;
2997 register regnode *place;
2998 register int offset = regarglen[(U8)op];
3000 /* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
3003 PL_regsize += NODE_STEP_REGNODE + offset;
3008 PL_regcode += NODE_STEP_REGNODE + offset;
3011 StructCopy(--src, --dst, regnode);
3013 place = opnd; /* Op node, where operand used to be. */
3014 src = NEXTOPER(place);
3015 FILL_ADVANCE_NODE(place, op);
3016 Zero(src, offset, regnode);
3020 - regtail - set the next-pointer at the end of a node chain of p to val.
3023 S_regtail(pTHX_ regnode *p, regnode *val)
3026 register regnode *scan;
3027 register regnode *temp;
3028 register I32 offset;
3033 /* Find last node. */
3036 temp = regnext(scan);
3042 if (reg_off_by_arg[OP(scan)]) {
3043 ARG_SET(scan, val - scan);
3046 NEXT_OFF(scan) = val - scan;
3051 - regoptail - regtail on operand of first argument; nop if operandless
3054 S_regoptail(pTHX_ regnode *p, regnode *val)
3057 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
3058 if (p == NULL || SIZE_ONLY)
3060 if (PL_regkind[(U8)OP(p)] == BRANCH) {
3061 regtail(NEXTOPER(p), val);
3063 else if ( PL_regkind[(U8)OP(p)] == BRANCHJ) {
3064 regtail(NEXTOPER(NEXTOPER(p)), val);
3071 - regcurly - a little FSA that accepts {\d+,?\d*}
3074 S_regcurly(pTHX_ register char *s)
3093 S_dumpuntil(pTHX_ regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
3096 register U8 op = EXACT; /* Arbitrary non-END op. */
3097 register regnode *next, *onode;
3099 while (op != END && (!last || node < last)) {
3100 /* While that wasn't END last time... */
3106 next = regnext(node);
3108 if (OP(node) == OPTIMIZED)
3111 PerlIO_printf(Perl_debug_log, "%4d:%*s%s", node - start,
3112 2*l + 1, "", SvPVX(sv));
3113 if (next == NULL) /* Next ptr. */
3114 PerlIO_printf(Perl_debug_log, "(0)");
3116 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
3117 (void)PerlIO_putc(Perl_debug_log, '\n');
3119 if (PL_regkind[(U8)op] == BRANCHJ) {
3120 register regnode *nnode = (OP(next) == LONGJMP
3123 if (last && nnode > last)
3125 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
3127 else if (PL_regkind[(U8)op] == BRANCH) {
3128 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
3130 else if ( op == CURLY) { /* `next' might be very big: optimizer */
3131 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
3132 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
3134 else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) {
3135 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
3138 else if ( op == PLUS || op == STAR) {
3139 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
3141 else if (op == ANYOF) {
3142 node = NEXTOPER(node);
3145 else if (PL_regkind[(U8)op] == EXACT) {
3146 /* Literal string, where present. */
3147 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
3148 node = NEXTOPER(node);
3151 node = NEXTOPER(node);
3152 node += regarglen[(U8)op];
3154 if (op == CURLYX || op == OPEN)
3156 else if (op == WHILEM)
3159 #endif /* DEBUGGING */
3164 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
3167 Perl_regdump(pTHX_ regexp *r)
3171 SV *sv = sv_newmortal();
3173 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
3175 /* Header fields of interest. */
3176 if (r->anchored_substr)
3177 PerlIO_printf(Perl_debug_log, "anchored `%s%.*s%s'%s at %d ",
3179 SvCUR(r->anchored_substr) - (SvTAIL(r->anchored_substr)!=0),
3180 SvPVX(r->anchored_substr),
3182 SvTAIL(r->anchored_substr) ? "$" : "",
3183 r->anchored_offset);
3184 if (r->float_substr)
3185 PerlIO_printf(Perl_debug_log, "floating `%s%.*s%s'%s at %d..%u ",
3187 SvCUR(r->float_substr) - (SvTAIL(r->float_substr)!=0),
3188 SvPVX(r->float_substr),
3190 SvTAIL(r->float_substr) ? "$" : "",
3191 r->float_min_offset, r->float_max_offset);
3192 if (r->check_substr)
3193 PerlIO_printf(Perl_debug_log,
3194 r->check_substr == r->float_substr
3195 ? "(checking floating" : "(checking anchored");
3196 if (r->reganch & ROPT_NOSCAN)
3197 PerlIO_printf(Perl_debug_log, " noscan");
3198 if (r->reganch & ROPT_CHECK_ALL)
3199 PerlIO_printf(Perl_debug_log, " isall");
3200 if (r->check_substr)
3201 PerlIO_printf(Perl_debug_log, ") ");
3203 if (r->regstclass) {
3204 regprop(sv, r->regstclass);
3205 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
3207 if (r->reganch & ROPT_ANCH) {
3208 PerlIO_printf(Perl_debug_log, "anchored");
3209 if (r->reganch & ROPT_ANCH_BOL)
3210 PerlIO_printf(Perl_debug_log, "(BOL)");
3211 if (r->reganch & ROPT_ANCH_MBOL)
3212 PerlIO_printf(Perl_debug_log, "(MBOL)");
3213 if (r->reganch & ROPT_ANCH_SBOL)
3214 PerlIO_printf(Perl_debug_log, "(SBOL)");
3215 if (r->reganch & ROPT_ANCH_GPOS)
3216 PerlIO_printf(Perl_debug_log, "(GPOS)");
3217 PerlIO_putc(Perl_debug_log, ' ');
3219 if (r->reganch & ROPT_GPOS_SEEN)
3220 PerlIO_printf(Perl_debug_log, "GPOS ");
3221 if (r->reganch & ROPT_SKIP)
3222 PerlIO_printf(Perl_debug_log, "plus ");
3223 if (r->reganch & ROPT_IMPLICIT)
3224 PerlIO_printf(Perl_debug_log, "implicit ");
3225 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
3226 if (r->reganch & ROPT_EVAL_SEEN)
3227 PerlIO_printf(Perl_debug_log, "with eval ");
3228 PerlIO_printf(Perl_debug_log, "\n");
3229 #endif /* DEBUGGING */
3233 - regprop - printable representation of opcode
3236 Perl_regprop(pTHX_ SV *sv, regnode *o)
3242 sv_setpvn(sv, "", 0);
3243 if (OP(o) >= reg_num) /* regnode.type is unsigned */
3244 FAIL("corrupted regexp opcode");
3245 sv_catpv(sv, (char*)reg_name[OP(o)]); /* Take off const! */
3247 k = PL_regkind[(U8)OP(o)];
3250 Perl_sv_catpvf(aTHX_ sv, " <%s%s%s>", PL_colors[0], OPERAND(o) + 1, PL_colors[1]);
3251 else if (k == CURLY) {
3252 if (OP(o) == CURLYM || OP(o) == CURLYN)
3253 Perl_sv_catpvf(aTHX_ sv, "[%d]", o->flags); /* Parenth number */
3254 Perl_sv_catpvf(aTHX_ sv, " {%d,%d}", ARG1(o), ARG2(o));
3256 else if (k == WHILEM && o->flags) /* Ordinal/of */
3257 Perl_sv_catpvf(aTHX_ sv, "[%d/%d]", o->flags & 0xf, o->flags>>4);
3258 else if (k == REF || k == OPEN || k == CLOSE || k == GROUPP )
3259 Perl_sv_catpvf(aTHX_ sv, "%d", ARG(o)); /* Parenth number */
3260 else if (k == LOGICAL)
3261 Perl_sv_catpvf(aTHX_ sv, "[%d]", ARG(o)); /* 2: embedded, otherwise 1 */
3262 else if (k == BRANCHJ && (OP(o) == UNLESSM || OP(o) == IFMATCH))
3263 Perl_sv_catpvf(aTHX_ sv, "[-%d]", o->flags);
3264 #endif /* DEBUGGING */
3268 Perl_re_intuit_string(pTHX_ regexp *prog)
3269 { /* Assume that RE_INTUIT is set */
3272 char *s = SvPV(prog->check_substr,n_a);
3274 if (!PL_colorset) reginitcolors();
3275 PerlIO_printf(Perl_debug_log,
3276 "%sUsing REx substr:%s `%s%.60s%s%s'\n",
3277 PL_colors[4],PL_colors[5],PL_colors[0],
3280 (strlen(s) > 60 ? "..." : ""));
3283 return prog->check_substr;
3287 Perl_pregfree(pTHX_ struct regexp *r)
3290 DEBUG_r(if (!PL_colorset) reginitcolors());
3291 DEBUG_r(PerlIO_printf(Perl_debug_log,
3292 "%sFreeing REx:%s `%s%.60s%s%s'\n",
3293 PL_colors[4],PL_colors[5],PL_colors[0],
3296 (strlen(r->precomp) > 60 ? "..." : "")));
3299 if (!r || (--r->refcnt > 0))
3302 Safefree(r->precomp);
3303 if (RX_MATCH_COPIED(r))
3304 Safefree(r->subbeg);
3306 if (r->anchored_substr)
3307 SvREFCNT_dec(r->anchored_substr);
3308 if (r->float_substr)
3309 SvREFCNT_dec(r->float_substr);
3310 Safefree(r->substrs);
3313 int n = r->data->count;
3314 AV* new_comppad = NULL;
3319 switch (r->data->what[n]) {
3321 SvREFCNT_dec((SV*)r->data->data[n]);
3324 new_comppad = (AV*)r->data->data[n];
3327 if (new_comppad == NULL)
3328 Perl_croak(aTHX_ "panic: pregfree comppad");
3329 old_comppad = PL_comppad;
3330 old_curpad = PL_curpad;
3331 PL_comppad = new_comppad;
3332 PL_curpad = AvARRAY(new_comppad);
3333 op_free((OP_4tree*)r->data->data[n]);
3334 PL_comppad = old_comppad;
3335 PL_curpad = old_curpad;
3336 SvREFCNT_dec((SV*)new_comppad);
3342 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
3345 Safefree(r->data->what);
3348 Safefree(r->startp);
3354 - regnext - dig the "next" pointer out of a node
3356 * [Note, when REGALIGN is defined there are two places in regmatch()
3357 * that bypass this code for speed.]
3360 Perl_regnext(pTHX_ register regnode *p)
3363 register I32 offset;
3365 if (p == &PL_regdummy)
3368 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
3376 S_re_croak2(pTHX_ const char* pat1,const char* pat2,...)
3379 STRLEN l1 = strlen(pat1);
3380 STRLEN l2 = strlen(pat2);
3389 Copy(pat1, buf, l1 , char);
3390 Copy(pat2, buf + l1, l2 , char);
3391 buf[l1 + l2] = '\n';
3392 buf[l1 + l2 + 1] = '\0';
3394 /* ANSI variant takes additional second argument */
3395 va_start(args, pat2);
3399 msv = mess(buf, &args);
3401 message = SvPV(msv,l1);
3404 Copy(message, buf, l1 , char);
3405 buf[l1] = '\0'; /* Overwrite \n */
3406 Perl_croak(aTHX_ "%s", buf);
3409 /* XXX Here's a total kludge. But we need to re-enter for swash routines. */
3412 Perl_save_re_context(pTHX)
3416 SAVEPPTR(PL_regprecomp); /* uncompiled string. */
3417 SAVEI32(PL_regnpar); /* () count. */
3418 SAVEI32(PL_regsize); /* Code size. */
3419 SAVEI16(PL_regflags); /* are we folding, multilining? */
3420 SAVEPPTR(PL_reginput); /* String-input pointer. */
3421 SAVEPPTR(PL_regbol); /* Beginning of input, for ^ check. */
3422 SAVEPPTR(PL_regeol); /* End of input, for $ check. */
3423 SAVESPTR(PL_regstartp); /* Pointer to startp array. */
3424 SAVESPTR(PL_regendp); /* Ditto for endp. */
3425 SAVESPTR(PL_reglastparen); /* Similarly for lastparen. */
3426 SAVEPPTR(PL_regtill); /* How far we are required to go. */
3427 SAVEI32(PL_regprev); /* char before regbol, \n if none */
3428 SAVESPTR(PL_reg_start_tmp); /* from regexec.c */
3429 PL_reg_start_tmp = 0;
3430 SAVEFREEPV(PL_reg_start_tmp);
3431 SAVEI32(PL_reg_start_tmpl); /* from regexec.c */
3432 PL_reg_start_tmpl = 0;
3433 SAVESPTR(PL_regdata);
3434 SAVEI32(PL_reg_flags); /* from regexec.c */
3435 SAVEI32(PL_reg_eval_set); /* from regexec.c */
3436 SAVEI32(PL_regnarrate); /* from regexec.c */
3437 SAVESPTR(PL_regprogram); /* from regexec.c */
3438 SAVEINT(PL_regindent); /* from regexec.c */
3439 SAVESPTR(PL_regcc); /* from regexec.c */
3440 SAVESPTR(PL_curcop);
3441 SAVESPTR(PL_regcomp_rx); /* from regcomp.c */
3442 SAVEI32(PL_regseen); /* from regcomp.c */
3443 SAVEI32(PL_regsawback); /* Did we see \1, ...? */
3444 SAVEI32(PL_regnaughty); /* How bad is this pattern? */
3445 SAVESPTR(PL_regcode); /* Code-emit pointer; ®dummy = don't */
3446 SAVEPPTR(PL_regxend); /* End of input for compile */
3447 SAVEPPTR(PL_regcomp_parse); /* Input-scan pointer. */
3448 SAVESPTR(PL_reg_call_cc); /* from regexec.c */
3449 SAVESPTR(PL_reg_re); /* from regexec.c */
3450 SAVEPPTR(PL_reg_ganch); /* from regexec.c */
3451 SAVESPTR(PL_reg_sv); /* from regexec.c */
3452 SAVESPTR(PL_reg_magic); /* from regexec.c */
3453 SAVEI32(PL_reg_oldpos); /* from regexec.c */
3454 SAVESPTR(PL_reg_oldcurpm); /* from regexec.c */
3455 SAVESPTR(PL_reg_curpm); /* from regexec.c */
3457 SAVEPPTR(PL_reg_starttry); /* from regexec.c */
3469 clear_re(pTHXo_ void *r)
3471 ReREFCNT_dec((regexp *)r);