5 * "A fair jaw-cracker dwarf-language must be." --Samwise Gamgee
8 /* NOTE: this is derived from Henry Spencer's regexp code, and should not
9 * confused with the original package (see point 3 below). Thanks, Henry!
12 /* Additional note: this code is very heavily munged from Henry's version
13 * in places. In some spots I've traded clarity for efficiency, so don't
14 * blame Henry for some of the lack of readability.
17 /* The names of the functions have been changed from regcomp and
18 * regexec to pregcomp and pregexec in order to avoid conflicts
19 * with the POSIX routines of the same names.
24 * pregcomp and pregexec -- regsub and regerror are not used in perl
26 * Copyright (c) 1986 by University of Toronto.
27 * Written by Henry Spencer. Not derived from licensed software.
29 * Permission is granted to anyone to use this software for any
30 * purpose on any computer system, and to redistribute it freely,
31 * subject to the following restrictions:
33 * 1. The author is not responsible for the consequences of use of
34 * this software, no matter how awful, even if they arise
37 * 2. The origin of this software must not be misrepresented, either
38 * by explicit claim or by omission.
40 * 3. Altered versions must be plainly marked as such, and must not
41 * be misrepresented as being the original software.
44 **** Alterations to Henry's code are...
46 **** Copyright (c) 1991-1997, Larry Wall
48 **** You may distribute under the terms of either the GNU General Public
49 **** License or the Artistic License, as specified in the README file.
52 * Beware that some of this code is subtly aware of the way operator
53 * precedence is structured in regular expressions. Serious changes in
54 * regular-expression syntax might require a total rethink.
68 # if defined(BUGGY_MSC6)
69 /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */
70 # pragma optimize("a",off)
71 /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/
72 # pragma optimize("w",on )
73 # endif /* BUGGY_MSC6 */
80 #define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
81 #define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
82 ((*s) == '{' && regcurly(s)))
84 #define PERL_META "^$.[()|?+*\\"
86 #define META "^$.[()|?+*\\"
90 #undef SPSTART /* dratted cpp namespace... */
93 * Flags to be passed up and down.
95 #define WORST 0 /* Worst case. */
96 #define HASWIDTH 0x1 /* Known never to match null string. */
97 #define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
98 #define SPSTART 0x4 /* Starts with * or +. */
99 #define TRYAGAIN 0x8 /* Weeded out a declaration. */
102 * Forward declarations for pregcomp()'s friends.
105 static char* regwhite _((char *, char *));
107 static regnode *reg _((I32, I32 *));
108 static regnode *reganode _((U8, U32));
109 static regnode *regatom _((I32 *));
110 static regnode *regbranch _((I32 *, I32));
111 static void regc _((U8, char *));
112 static regnode *regclass _((void));
113 STATIC I32 regcurly _((char *));
114 static regnode *reg_node _((U8));
115 static regnode *regpiece _((I32 *));
116 static void reginsert _((U8, regnode *));
117 static void regoptail _((regnode *, regnode *));
118 static void regset _((char *, I32));
119 static void regtail _((regnode *, regnode *));
120 static char* nextchar _((void));
122 static void re_croak2 _((const char* pat1,const char* pat2,...)) __attribute__((noreturn));
125 /* Length of a variant. */
134 I32 last_end; /* min value, <0 unless valid. */
137 SV **longest; /* Either &l_fixed, or &l_float. */
141 I32 offset_float_min;
142 I32 offset_float_max;
147 static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
149 #define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
150 #define SF_BEFORE_SEOL 0x1
151 #define SF_BEFORE_MEOL 0x2
152 #define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
153 #define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
155 #define SF_FIX_SHIFT_EOL (+2)
156 #define SF_FL_SHIFT_EOL (+4)
158 #define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
159 #define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
161 #define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
162 #define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
163 #define SF_IS_INF 0x40
164 #define SF_HAS_PAR 0x80
165 #define SF_IN_PAR 0x100
166 #define SF_HAS_EVAL 0x200
167 #define SCF_DO_SUBSTR 0x400
170 scan_commit(scan_data_t *data)
172 STRLEN l = SvCUR(data->last_found);
173 STRLEN old_l = SvCUR(*data->longest);
175 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
176 sv_setsv(*data->longest, data->last_found);
177 if (*data->longest == data->longest_fixed) {
178 data->offset_fixed = l ? data->last_start_min : data->pos_min;
179 if (data->flags & SF_BEFORE_EOL)
181 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
183 data->flags &= ~SF_FIX_BEFORE_EOL;
185 data->offset_float_min = l ? data->last_start_min : data->pos_min;
186 data->offset_float_max = (l
187 ? data->last_start_max
188 : data->pos_min + data->pos_delta);
189 if (data->flags & SF_BEFORE_EOL)
191 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
193 data->flags &= ~SF_FL_BEFORE_EOL;
196 SvCUR_set(data->last_found, 0);
198 data->flags &= ~SF_BEFORE_EOL;
201 /* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
202 to the position after last scanned or to NULL. */
205 study_chunk(regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
206 /* scanp: Start here (read-write). */
207 /* deltap: Write maxlen-minlen here. */
208 /* last: Stop before this one. */
210 I32 min = 0, pars = 0, code;
211 regnode *scan = *scanp, *next;
213 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
214 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
215 scan_data_t data_fake;
217 while (scan && OP(scan) != END && scan < last) {
218 /* Peephole optimizer: */
220 if (regkind[(U8)OP(scan)] == EXACT) {
221 regnode *n = regnext(scan);
224 regnode *stop = scan;
227 next = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
228 /* Skip NOTHING, merge EXACT*. */
230 ( regkind[(U8)OP(n)] == NOTHING ||
231 (stringok && (OP(n) == OP(scan))))
233 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
234 if (OP(n) == TAIL || n > next)
236 if (regkind[(U8)OP(n)] == NOTHING) {
237 NEXT_OFF(scan) += NEXT_OFF(n);
238 next = n + NODE_STEP_REGNODE;
245 int oldl = *OPERAND(scan);
246 regnode *nnext = regnext(n);
248 if (oldl + *OPERAND(n) > U8_MAX)
250 NEXT_OFF(scan) += NEXT_OFF(n);
251 *OPERAND(scan) += *OPERAND(n);
252 next = n + (*OPERAND(n) + 2 - 1)/sizeof(regnode) + 2;
253 /* Now we can overwrite *n : */
254 Move(OPERAND(n) + 1, OPERAND(scan) + oldl + 1,
255 *OPERAND(n) + 1, char);
265 n = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
267 if (regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
276 if (OP(scan) != CURLYX) {
277 int max = (reg_off_by_arg[OP(scan)] ? I32_MAX : U16_MAX);
278 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
282 /* Skip NOTHING and LONGJMP. */
283 while ((n = regnext(n))
284 && ((regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
285 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
288 if (reg_off_by_arg[OP(scan)])
291 NEXT_OFF(scan) = off;
293 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
294 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
295 next = regnext(scan);
298 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
299 I32 max1 = 0, min1 = I32_MAX, num = 0;
301 if (flags & SCF_DO_SUBSTR)
303 while (OP(scan) == code) {
304 I32 deltanext, minnext;
308 next = regnext(scan);
309 scan = NEXTOPER(scan);
311 scan = NEXTOPER(scan);
312 /* We suppose the run is continuous, last=next...*/
313 minnext = study_chunk(&scan, &deltanext, next,
317 if (max1 < minnext + deltanext)
318 max1 = minnext + deltanext;
319 if (deltanext == I32_MAX)
322 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
324 if (data && (data_fake.flags & SF_HAS_EVAL))
325 data->flags |= SF_HAS_EVAL;
329 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
331 if (flags & SCF_DO_SUBSTR) {
332 data->pos_min += min1;
333 data->pos_delta += max1 - min1;
334 if (max1 != min1 || is_inf)
335 data->longest = &(data->longest_float);
338 delta += max1 - min1;
339 } else if (code == BRANCHJ) /* single branch is optimized. */
340 scan = NEXTOPER(NEXTOPER(scan));
341 else /* single branch is optimized. */
342 scan = NEXTOPER(scan);
344 } else if (OP(scan) == EXACT) {
345 min += *OPERAND(scan);
346 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
347 I32 l = *OPERAND(scan);
349 /* The code below prefers earlier match for fixed
350 offset, later match for variable offset. */
351 if (data->last_end == -1) { /* Update the start info. */
352 data->last_start_min = data->pos_min;
353 data->last_start_max = is_inf
354 ? I32_MAX : data->pos_min + data->pos_delta;
356 sv_catpvn(data->last_found, (char *)(OPERAND(scan)+1), l);
357 data->last_end = data->pos_min + l;
358 data->pos_min += l; /* As in the first entry. */
359 data->flags &= ~SF_BEFORE_EOL;
361 } else if (regkind[(U8)OP(scan)] == EXACT) {
362 if (flags & SCF_DO_SUBSTR)
364 min += *OPERAND(scan);
365 if (data && (flags & SCF_DO_SUBSTR))
366 data->pos_min += *OPERAND(scan);
367 } else if (strchr(varies,OP(scan))) {
368 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
369 regnode *oscan = scan;
371 switch (regkind[(U8)OP(scan)]) {
373 scan = NEXTOPER(scan);
376 if (flags & SCF_DO_SUBSTR) {
377 next = NEXTOPER(scan);
378 if (OP(next) == EXACT) {
380 maxcount = REG_INFTY;
381 next = regnext(scan);
382 scan = NEXTOPER(scan);
386 if (flags & SCF_DO_SUBSTR)
392 scan = regnext(scan);
393 if (flags & SCF_DO_SUBSTR) {
395 data->longest = &(data->longest_float);
397 goto optimize_curly_tail;
399 mincount = ARG1(scan);
400 maxcount = ARG2(scan);
401 next = regnext(scan);
402 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
404 if (flags & SCF_DO_SUBSTR) {
405 if (mincount == 0) scan_commit(data);
406 pos_before = data->pos_min;
410 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
412 data->flags |= SF_IS_INF;
414 /* This will finish on WHILEM, setting scan, or on NULL: */
415 minnext = study_chunk(&scan, &deltanext, last, data,
417 ? (flags & ~SCF_DO_SUBSTR) : flags);
418 if (!scan) /* It was not CURLYX, but CURLY. */
420 if (dowarn && (minnext + deltanext == 0)
421 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR)))
422 warn("Strange *+?{} on zero-length expression");
423 min += minnext * mincount;
424 is_inf |= (maxcount == REG_INFTY && (minnext + deltanext) > 0
425 || deltanext == I32_MAX);
426 delta += (minnext + deltanext) * maxcount - minnext * mincount;
428 /* Try powerful optimization CURLYX => CURLYN. */
429 #ifdef REGALIGN_STRUCT
430 if ( OP(oscan) == CURLYX && data
431 && data->flags & SF_IN_PAR
432 && !(data->flags & SF_HAS_EVAL)
433 && !deltanext && minnext == 1 ) {
434 /* Try to optimize to CURLYN. */
435 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
436 regnode *nxt1 = nxt, *nxt2;
440 if (!strchr(simple,OP(nxt))
441 && !(regkind[(U8)OP(nxt)] == EXACT
442 && *OPERAND(nxt) == 1))
446 if (OP(nxt) != CLOSE)
448 /* Now we know that nxt2 is the only contents: */
449 oscan->flags = ARG(nxt);
451 OP(nxt1) = NOTHING; /* was OPEN. */
453 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
454 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
455 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
456 OP(nxt) = OPTIMIZED; /* was CLOSE. */
457 OP(nxt + 1) = OPTIMIZED; /* was count. */
458 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
464 /* Try optimization CURLYX => CURLYM. */
465 if ( OP(oscan) == CURLYX && data
466 #ifdef REGALIGN_STRUCT
467 && !(data->flags & SF_HAS_PAR)
469 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
471 && !(data->flags & SF_HAS_EVAL)
473 /* XXXX How to optimize if data == 0? */
474 /* Optimize to a simpler form. */
475 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
479 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
480 && (OP(nxt2) != WHILEM))
482 OP(nxt2) = SUCCEED; /* Whas WHILEM */
483 #ifdef REGALIGN_STRUCT
484 /* Need to optimize away parenths. */
485 if (data->flags & SF_IN_PAR) {
486 /* Set the parenth number. */
487 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
489 if (OP(nxt) != CLOSE)
490 FAIL("panic opt close");
491 oscan->flags = ARG(nxt);
492 OP(nxt1) = OPTIMIZED; /* was OPEN. */
493 OP(nxt) = OPTIMIZED; /* was CLOSE. */
495 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
496 OP(nxt + 1) = OPTIMIZED; /* was count. */
497 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
498 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
501 while ( nxt1 && (OP(nxt1) != WHILEM)) {
502 regnode *nnxt = regnext(nxt1);
505 if (reg_off_by_arg[OP(nxt1)])
506 ARG_SET(nxt1, nxt2 - nxt1);
507 else if (nxt2 - nxt1 < U16_MAX)
508 NEXT_OFF(nxt1) = nxt2 - nxt1;
510 OP(nxt) = NOTHING; /* Cannot beautify */
515 /* Optimize again: */
516 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
521 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
523 if (flags & SCF_DO_SUBSTR) {
524 SV *last_str = Nullsv;
525 int counted = mincount != 0;
527 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
528 I32 b = pos_before >= data->last_start_min
529 ? pos_before : data->last_start_min;
531 char *s = SvPV(data->last_found, l);
533 l -= b - data->last_start_min;
534 /* Get the added string: */
535 last_str = newSVpv(s + b - data->last_start_min, l);
536 if (deltanext == 0 && pos_before == b) {
537 /* What was added is a constant string */
539 SvGROW(last_str, (mincount * l) + 1);
540 repeatcpy(SvPVX(last_str) + l,
541 SvPVX(last_str), l, mincount - 1);
542 SvCUR(last_str) *= mincount;
543 /* Add additional parts. */
544 SvCUR_set(data->last_found,
545 SvCUR(data->last_found) - l);
546 sv_catsv(data->last_found, last_str);
547 data->last_end += l * (mincount - 1);
551 /* It is counted once already... */
552 data->pos_min += minnext * (mincount - counted);
553 data->pos_delta += - counted * deltanext +
554 (minnext + deltanext) * maxcount - minnext * mincount;
555 if (mincount != maxcount) {
557 if (mincount && last_str) {
558 sv_setsv(data->last_found, last_str);
559 data->last_end = data->pos_min;
560 data->last_start_min =
561 data->pos_min - SvCUR(last_str);
562 data->last_start_max = is_inf
564 : data->pos_min + data->pos_delta
567 data->longest = &(data->longest_float);
570 if (data && (fl & SF_HAS_EVAL))
571 data->flags |= SF_HAS_EVAL;
574 if (OP(oscan) != CURLYX) {
575 while (regkind[(U8)OP(next = regnext(oscan))] == NOTHING
577 NEXT_OFF(oscan) += NEXT_OFF(next);
581 default: /* REF only? */
582 if (flags & SCF_DO_SUBSTR) {
584 data->longest = &(data->longest_float);
589 } else if (strchr(simple,OP(scan))) {
590 if (flags & SCF_DO_SUBSTR) {
595 } else if (regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
596 data->flags |= (OP(scan) == MEOL
599 } else if (regkind[(U8)OP(scan)] == BRANCHJ
600 && (scan->flags || data)
601 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
602 I32 deltanext, minnext;
606 next = regnext(scan);
607 nscan = NEXTOPER(NEXTOPER(scan));
608 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, 0);
611 FAIL("variable length lookbehind not implemented");
612 } else if (minnext > U8_MAX) {
613 FAIL2("lookbehind longer than %d not implemented", U8_MAX);
615 scan->flags = minnext;
617 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
619 if (data && (data_fake.flags & SF_HAS_EVAL))
620 data->flags |= SF_HAS_EVAL;
621 } else if (OP(scan) == OPEN) {
623 } else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
624 #ifdef REGALIGN_STRUCT
625 next = regnext(scan);
627 if ( next && (OP(next) != WHILEM) && next < last)
629 is_par = 0; /* Disable optimization */
630 } else if (OP(scan) == EVAL) {
632 data->flags |= SF_HAS_EVAL;
634 /* Else: zero-length, ignore. */
635 scan = regnext(scan);
640 *deltap = is_inf ? I32_MAX : delta;
641 if (flags & SCF_DO_SUBSTR && is_inf)
642 data->pos_delta = I32_MAX - data->pos_min;
645 if (is_par && pars==1 && data) {
646 data->flags |= SF_IN_PAR;
647 data->flags &= ~SF_HAS_PAR;
648 } else if (pars && data) {
649 data->flags |= SF_HAS_PAR;
650 data->flags &= ~SF_IN_PAR;
656 add_data(I32 n, char *s)
660 sizeof(*rx->data) + sizeof(void*) * (rx->data->count + n - 1),
661 char, struct reg_data);
662 Renew(rx->data->what, rx->data->count + n, U8);
663 rx->data->count += n;
665 Newc(1207, rx->data, sizeof(*rx->data) + sizeof(void*) * (n - 1),
666 char, struct reg_data);
667 New(1208, rx->data->what, n, U8);
670 Copy(s, rx->data->what + rx->data->count - n, n, U8);
671 return rx->data->count - n;
675 - pregcomp - compile a regular expression into internal code
677 * We can't allocate space until we know how big the compiled form will be,
678 * but we can't compile it (and thus know how big it is) until we've got a
679 * place to put the code. So we cheat: we compile it twice, once with code
680 * generation turned off and size counting turned on, and once "for real".
681 * This also means that we don't allocate space until we are sure that the
682 * thing really will compile successfully, and we never have to move the
683 * code and thus invalidate pointers into it. (Note that it has to be in
684 * one piece because free() must be able to free it all.) [NB: not true in perl]
686 * Beware that the optimization-preparation code in here knows about some
687 * of the structure of the compiled regexp. [I'll say.]
690 pregcomp(char *exp, char *xend, PMOP *pm)
704 FAIL("NULL regexp argument");
706 regprecomp = savepvn(exp, xend - exp);
707 DEBUG_r(PerlIO_printf(Perl_debug_log, "compiling RE `%*s'\n",
708 xend - exp, regprecomp));
709 regflags = pm->op_pmflags;
713 seen_zerolen = *exp == '^' ? -1 : 0;
716 /* First pass: determine size, legality. */
723 regc((U8)MAGIC, (char*)regcode);
724 if (reg(0, &flags) == NULL) {
725 Safefree(regprecomp);
729 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %d ", regsize));
734 char *s = PerlEnv_getenv("TERMCAP_COLORS");
738 colors[0] = s = savepv(s);
742 FAIL("Not enough TABs in TERMCAP_COLORS");
751 PerlIO_printf(Perl_debug_log, "%s%s%s%s",
752 colors[0],colors[1],colors[2],colors[3]);
756 /* Small enough for pointer-storage convention?
757 If extralen==0, this means that we will not need long jumps. */
758 #ifndef REGALIGN_STRUCT
759 if (regsize >= 0x10000L && extralen)
760 FAIL("regexp too big");
762 if (regsize >= 0x10000L && extralen)
768 /* Allocate space and initialize. */
769 Newc(1001, r, sizeof(regexp) + (unsigned)regsize * sizeof(regnode),
772 FAIL("regexp out of space");
774 r->prelen = xend - exp;
775 r->precomp = regprecomp;
776 r->subbeg = r->subbase = NULL;
779 /* Second pass: emit code. */
784 regcode = r->program;
785 regc((U8)MAGIC, (char*) regcode++);
787 if (reg(0, &flags) == NULL)
790 /* Dig out information for optimizations. */
791 pm->op_pmflags = regflags;
793 r->regstclass = NULL;
794 r->naughty = regnaughty >= 10; /* Probably an expensive pattern. */
795 scan = r->program + 1; /* First BRANCH. */
797 /* XXXX To minimize changes to RE engine we always allocate
798 3-units-long substrs field. */
799 Newz(1004, r->substrs, 1, struct reg_substr_data);
801 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
804 STRLEN longest_float_length, longest_fixed_length;
806 StructCopy(&zero_scan_data, &data, scan_data_t);
808 /* Skip introductions and multiplicators >= 1. */
809 while ((OP(first) == OPEN && (sawopen = 1)) ||
810 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
811 (OP(first) == PLUS) ||
812 (OP(first) == MINMOD) ||
813 (regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
814 if (OP(first) == PLUS)
817 first += regarglen[(U8)OP(first)];
818 first = NEXTOPER(first);
821 /* Starting-point info. */
823 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
824 else if (strchr(simple+2,OP(first)))
825 r->regstclass = first;
826 else if (regkind[(U8)OP(first)] == BOUND ||
827 regkind[(U8)OP(first)] == NBOUND)
828 r->regstclass = first;
829 else if (regkind[(U8)OP(first)] == BOL) {
830 r->reganch |= (OP(first) == MBOL ? ROPT_ANCH_MBOL: ROPT_ANCH_BOL);
831 first = NEXTOPER(first);
834 else if (OP(first) == GPOS) {
835 r->reganch |= ROPT_ANCH_GPOS;
836 first = NEXTOPER(first);
839 else if ((OP(first) == STAR &&
840 regkind[(U8)OP(NEXTOPER(first))] == ANY) &&
841 !(r->reganch & ROPT_ANCH) )
843 /* turn .* into ^.* with an implied $*=1 */
844 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
845 first = NEXTOPER(first);
848 if (sawplus && (!sawopen || !regsawback))
849 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
851 /* Scan is after the zeroth branch, first is atomic matcher. */
852 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
855 * If there's something expensive in the r.e., find the
856 * longest literal string that must appear and make it the
857 * regmust. Resolve ties in favor of later strings, since
858 * the regstart check works with the beginning of the r.e.
859 * and avoiding duplication strengthens checking. Not a
860 * strong reason, but sufficient in the absence of others.
861 * [Now we resolve ties in favor of the earlier string if
862 * it happens that c_offset_min has been invalidated, since the
863 * earlier string may buy us something the later one won't.]
867 data.longest_fixed = newSVpv("",0);
868 data.longest_float = newSVpv("",0);
869 data.last_found = newSVpv("",0);
870 data.longest = &(data.longest_fixed);
873 minlen = study_chunk(&first, &fake, scan + regsize, /* Up to end */
874 &data, SCF_DO_SUBSTR);
875 if ( regnpar == 1 && data.longest == &(data.longest_fixed)
876 && data.last_start_min == 0 && data.last_end > 0
878 && (!(regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
879 r->reganch |= ROPT_CHECK_ALL;
881 SvREFCNT_dec(data.last_found);
883 longest_float_length = SvCUR(data.longest_float);
884 if (longest_float_length
885 || (data.flags & SF_FL_BEFORE_EOL
886 && (!(data.flags & SF_FL_BEFORE_MEOL)
887 || (regflags & PMf_MULTILINE)))) {
888 if (SvCUR(data.longest_fixed)
889 && data.offset_fixed == data.offset_float_min)
890 goto remove; /* Like in (a)+. */
892 r->float_substr = data.longest_float;
893 r->float_min_offset = data.offset_float_min;
894 r->float_max_offset = data.offset_float_max;
895 fbm_compile(r->float_substr, 0);
896 BmUSEFUL(r->float_substr) = 100;
897 if (data.flags & SF_FL_BEFORE_EOL /* Cannot have SEOL and MULTI */
898 && (!(data.flags & SF_FL_BEFORE_MEOL)
899 || (regflags & PMf_MULTILINE)))
900 SvTAIL_on(r->float_substr);
903 r->float_substr = Nullsv;
904 SvREFCNT_dec(data.longest_float);
905 longest_float_length = 0;
908 longest_fixed_length = SvCUR(data.longest_fixed);
909 if (longest_fixed_length
910 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
911 && (!(data.flags & SF_FIX_BEFORE_MEOL)
912 || (regflags & PMf_MULTILINE)))) {
913 r->anchored_substr = data.longest_fixed;
914 r->anchored_offset = data.offset_fixed;
915 fbm_compile(r->anchored_substr, 0);
916 BmUSEFUL(r->anchored_substr) = 100;
917 if (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
918 && (!(data.flags & SF_FIX_BEFORE_MEOL)
919 || (regflags & PMf_MULTILINE)))
920 SvTAIL_on(r->anchored_substr);
922 r->anchored_substr = Nullsv;
923 SvREFCNT_dec(data.longest_fixed);
924 longest_fixed_length = 0;
927 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
928 if (longest_fixed_length > longest_float_length) {
929 r->check_substr = r->anchored_substr;
930 r->check_offset_min = r->check_offset_max = r->anchored_offset;
931 if (r->reganch & ROPT_ANCH_SINGLE)
932 r->reganch |= ROPT_NOSCAN;
934 r->check_substr = r->float_substr;
935 r->check_offset_min = data.offset_float_min;
936 r->check_offset_max = data.offset_float_max;
939 /* Several toplevels. Best we can is to set minlen. */
942 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
943 scan = r->program + 1;
944 minlen = study_chunk(&scan, &fake, scan + regsize, NULL, 0);
945 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
948 r->nparens = regnpar - 1;
950 if (regseen & REG_SEEN_GPOS)
951 r->reganch |= ROPT_GPOS_SEEN;
952 if (regseen & REG_SEEN_LOOKBEHIND)
953 r->reganch |= ROPT_LOOKBEHIND_SEEN;
954 Newz(1002, r->startp, regnpar, char*);
955 Newz(1002, r->endp, regnpar, char*);
961 - reg - regular expression, i.e. main body or parenthesized thing
963 * Caller must absorb opening parenthesis.
965 * Combining parenthesis handling with the base level of regular expression
966 * is a trifle forced, but the need to tie the tails of the branches to what
967 * follows makes it hard to avoid.
970 reg(I32 paren, I32 *flagp)
971 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
973 register regnode *ret; /* Will be the head of the group. */
974 register regnode *br;
975 register regnode *lastbr;
976 register regnode *ender = 0;
977 register I32 parno = 0;
978 I32 flags, oregflags = regflags, have_branch = 0, open = 0;
981 *flagp = HASWIDTH; /* Tentatively. */
983 /* Make an OPEN node, if parenthesized. */
985 if (*regparse == '?') {
988 ret = NULL; /* For look-ahead/behind. */
991 #ifndef REGALIGN_STRUCT
992 FAIL("lookbehind non-implemented without REGALIGN_STRUCT");
994 regseen |= REG_SEEN_LOOKBEHIND;
995 if (*regparse == '!')
997 if (*regparse != '=' && *regparse != '!')
1008 FAIL2("Sequence (?%c...) not implemented", (int)paren);
1011 while (*regparse && *regparse != ')')
1013 if (*regparse != ')')
1014 FAIL("Sequence (?#... not terminated");
1021 I32 count = 1, n = 0;
1025 OP_4tree *sop, *rop;
1028 while (count && (c = *regparse)) {
1029 if (c == '\\' && regparse[1])
1037 if (*regparse != ')')
1038 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1042 if (regparse - 1 - s)
1043 sv = newSVpv(s, regparse - 1 - s);
1045 sv = newSVpv("", 0);
1047 rop = sv_compile_2op(sv, &sop, "re", &av);
1049 n = add_data(3, "nso");
1050 rx->data->data[n] = (void*)rop;
1051 rx->data->data[n+1] = (void*)av;
1052 rx->data->data[n+2] = (void*)sop;
1054 } else { /* First pass */
1056 FAIL("Eval-group in insecure regular expression");
1060 return reganode(EVAL, n);
1064 if (regparse[0] == '?') {
1065 if (regparse[1] == '=' || regparse[1] == '!'
1066 || regparse[1] == '<'
1067 || regparse[1] == '{') { /* Lookahead or eval. */
1070 ret = reg_node(LOGICAL);
1071 regtail(ret, reg(1, &flag));
1074 } else if (regparse[0] >= '1' && regparse[0] <= '9' ) {
1075 parno = atoi(regparse++);
1077 while (isDIGIT(*regparse))
1079 ret = reganode(GROUPP, parno);
1080 if ((c = *nextchar()) != ')')
1081 FAIL2("Switch (?(number%c not recognized", c);
1083 regtail(ret, reganode(IFTHEN, 0));
1084 br = regbranch(&flags, 1);
1086 br = reganode(LONGJMP, 0);
1088 regtail(br, reganode(LONGJMP, 0));
1091 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1092 regbranch(&flags, 1);
1093 regtail(ret, lastbr);
1098 FAIL("Switch (?(condition)... contains too many branches");
1099 ender = reg_node(TAIL);
1102 regtail(lastbr, ender);
1103 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
1105 regtail(ret, ender);
1108 FAIL2("Unknown condition for (?(%.2s", regparse);
1112 FAIL("Sequence (? incomplete");
1116 while (*regparse && strchr("iogcmsx", *regparse))
1117 pmflag(®flags, *regparse++);
1119 if (*regparse != ')')
1120 FAIL2("Sequence (?%c...) not recognized", *regparse);
1129 ret = reganode(OPEN, parno);
1135 /* Pick up the branches, linking them together. */
1136 br = regbranch(&flags, 1);
1139 if (*regparse == '|') {
1140 if (!SIZE_ONLY && extralen) {
1141 reginsert(BRANCHJ, br);
1143 reginsert(BRANCH, br);
1146 extralen += 1; /* For BRANCHJ-BRANCH. */
1147 } else if (paren == ':') {
1148 *flagp |= flags&SIMPLE;
1150 if (open) { /* Starts with OPEN. */
1151 regtail(ret, br); /* OPEN -> first. */
1152 } else if (paren != '?') /* Not Conditional */
1154 if (!(flags&HASWIDTH))
1155 *flagp &= ~HASWIDTH;
1156 *flagp |= flags&SPSTART;
1158 while (*regparse == '|') {
1159 if (!SIZE_ONLY && extralen) {
1160 ender = reganode(LONGJMP,0);
1161 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1164 extralen += 2; /* Account for LONGJMP. */
1166 br = regbranch(&flags, 0);
1169 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1171 if (!(flags&HASWIDTH))
1172 *flagp &= ~HASWIDTH;
1173 *flagp |= flags&SPSTART;
1176 if (have_branch || paren != ':') {
1177 /* Make a closing node, and hook it on the end. */
1180 ender = reg_node(TAIL);
1183 ender = reganode(CLOSE, parno);
1190 ender = reg_node(SUCCEED);
1191 *flagp &= ~HASWIDTH;
1194 ender = reg_node(END);
1197 regtail(lastbr, ender);
1200 /* Hook the tails of the branches to the closing node. */
1201 for (br = ret; br != NULL; br = regnext(br)) {
1202 regoptail(br, ender);
1209 static char parens[] = "=!<,>";
1211 if (paren && (p = strchr(parens, paren))) {
1212 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1213 int flag = (p - parens) > 1;
1216 node = SUSPEND, flag = 0;
1217 reginsert(node,ret);
1218 #ifdef REGALIGN_STRUCT
1221 regtail(ret, reg_node(TAIL));
1225 /* Check for proper termination. */
1226 if (paren && (regparse >= regxend || *nextchar() != ')')) {
1227 FAIL("unmatched () in regexp");
1228 } else if (!paren && regparse < regxend) {
1229 if (*regparse == ')') {
1230 FAIL("unmatched () in regexp");
1232 FAIL("junk on end of regexp"); /* "Can't happen". */
1236 regflags = oregflags;
1243 - regbranch - one alternative of an | operator
1245 * Implements the concatenation operator.
1248 regbranch(I32 *flagp, I32 first)
1250 register regnode *ret;
1251 register regnode *chain = NULL;
1252 register regnode *latest;
1253 I32 flags = 0, c = 0;
1258 if (!SIZE_ONLY && extralen)
1259 ret = reganode(BRANCHJ,0);
1261 ret = reg_node(BRANCH);
1264 if (!first && SIZE_ONLY)
1265 extralen += 1; /* BRANCHJ */
1267 *flagp = WORST; /* Tentatively. */
1271 while (regparse < regxend && *regparse != '|' && *regparse != ')') {
1273 latest = regpiece(&flags);
1274 if (latest == NULL) {
1275 if (flags & TRYAGAIN)
1278 } else if (ret == NULL)
1280 *flagp |= flags&HASWIDTH;
1281 if (chain == NULL) /* First piece. */
1282 *flagp |= flags&SPSTART;
1285 regtail(chain, latest);
1290 if (chain == NULL) { /* Loop ran zero times. */
1291 chain = reg_node(NOTHING);
1296 *flagp |= flags&SIMPLE;
1303 - regpiece - something followed by possible [*+?]
1305 * Note that the branching code sequences used for ? and the general cases
1306 * of * and + are somewhat optimized: they use the same NOTHING node as
1307 * both the endmarker for their branch list and the body of the last branch.
1308 * It might seem that this node could be dispensed with entirely, but the
1309 * endmarker role is not redundant.
1312 regpiece(I32 *flagp)
1314 register regnode *ret;
1316 register char *next;
1318 char *origparse = regparse;
1321 I32 max = REG_INFTY;
1323 ret = regatom(&flags);
1325 if (flags & TRYAGAIN)
1332 if (op == '{' && regcurly(regparse)) {
1333 next = regparse + 1;
1335 while (isDIGIT(*next) || *next == ',') {
1344 if (*next == '}') { /* got one */
1348 min = atoi(regparse);
1354 if (!max && *maxpos != '0')
1355 max = REG_INFTY; /* meaning "infinity" */
1356 else if (max >= REG_INFTY)
1357 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
1362 if ((flags&SIMPLE)) {
1363 regnaughty += 2 + regnaughty / 2;
1364 reginsert(CURLY, ret);
1367 regnaughty += 4 + regnaughty; /* compound interest */
1368 regtail(ret, reg_node(WHILEM));
1369 if (!SIZE_ONLY && extralen) {
1370 reginsert(LONGJMP,ret);
1371 reginsert(NOTHING,ret);
1372 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1374 reginsert(CURLYX,ret);
1375 if (!SIZE_ONLY && extralen)
1376 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1377 regtail(ret, reg_node(NOTHING));
1381 #ifdef REGALIGN_STRUCT
1386 *flagp = (WORST|HASWIDTH);
1387 if (max && max < min)
1388 FAIL("Can't do {n,m} with n > m");
1403 #if 0 /* Now runtime fix should be reliable. */
1404 if (!(flags&HASWIDTH) && op != '?')
1405 FAIL("regexp *+ operand could be empty");
1410 *flagp = (op != '+') ? (WORST|SPSTART) : (WORST|HASWIDTH);
1412 if (op == '*' && (flags&SIMPLE)) {
1413 reginsert(STAR, ret);
1414 #ifdef REGALIGN_STRUCT
1419 else if (op == '*') {
1422 } else if (op == '+' && (flags&SIMPLE)) {
1423 reginsert(PLUS, ret);
1424 #ifdef REGALIGN_STRUCT
1429 else if (op == '+') {
1432 } else if (op == '?') {
1437 if (dowarn && !SIZE_ONLY && !(flags&HASWIDTH) && max > 10000) {
1438 warn("%.*s matches null string many times",
1439 regparse - origparse, origparse);
1442 if (*regparse == '?') {
1444 reginsert(MINMOD, ret);
1446 regtail(ret, ret + NODE_STEP_REGNODE);
1448 regtail(ret, ret + 3);
1451 if (ISMULT2(regparse))
1452 FAIL("nested *?+ in regexp");
1458 - regatom - the lowest level
1460 * Optimization: gobbles an entire sequence of ordinary characters so that
1461 * it can turn them into a single node, which is smaller to store and
1462 * faster to run. Backslashed characters are exceptions, each becoming a
1463 * separate node; the code is simpler that way and it's not worth fixing.
1465 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1470 register regnode *ret = 0;
1473 *flagp = WORST; /* Tentatively. */
1476 switch (*regparse) {
1480 if (regflags & PMf_MULTILINE)
1481 ret = reg_node(MBOL);
1482 else if (regflags & PMf_SINGLELINE)
1483 ret = reg_node(SBOL);
1485 ret = reg_node(BOL);
1491 if (regflags & PMf_MULTILINE)
1492 ret = reg_node(MEOL);
1493 else if (regflags & PMf_SINGLELINE)
1494 ret = reg_node(SEOL);
1496 ret = reg_node(EOL);
1500 if (regflags & PMf_SINGLELINE)
1501 ret = reg_node(SANY);
1503 ret = reg_node(ANY);
1505 *flagp |= HASWIDTH|SIMPLE;
1510 *flagp |= HASWIDTH|SIMPLE;
1514 ret = reg(1, &flags);
1516 if (flags & TRYAGAIN)
1520 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
1524 if (flags & TRYAGAIN) {
1528 FAIL2("internal urp in regexp at /%s/", regparse);
1529 /* Supposed to be caught earlier. */
1532 if (!regcurly(regparse)) {
1540 FAIL("?+*{} follows nothing in regexp");
1543 switch (*++regparse) {
1546 ret = reg_node(SBOL);
1551 ret = reg_node(GPOS);
1552 regseen |= REG_SEEN_GPOS;
1557 ret = reg_node(SEOL);
1562 ret = reg_node((regflags & PMf_LOCALE) ? ALNUML : ALNUM);
1563 *flagp |= HASWIDTH|SIMPLE;
1567 ret = reg_node((regflags & PMf_LOCALE) ? NALNUML : NALNUM);
1568 *flagp |= HASWIDTH|SIMPLE;
1573 ret = reg_node((regflags & PMf_LOCALE) ? BOUNDL : BOUND);
1579 ret = reg_node((regflags & PMf_LOCALE) ? NBOUNDL : NBOUND);
1584 ret = reg_node((regflags & PMf_LOCALE) ? SPACEL : SPACE);
1585 *flagp |= HASWIDTH|SIMPLE;
1589 ret = reg_node((regflags & PMf_LOCALE) ? NSPACEL : NSPACE);
1590 *flagp |= HASWIDTH|SIMPLE;
1594 ret = reg_node(DIGIT);
1595 *flagp |= HASWIDTH|SIMPLE;
1599 ret = reg_node(NDIGIT);
1600 *flagp |= HASWIDTH|SIMPLE;
1613 case '1': case '2': case '3': case '4':
1614 case '5': case '6': case '7': case '8': case '9':
1616 I32 num = atoi(regparse);
1618 if (num > 9 && num >= regnpar)
1622 ret = reganode((regflags & PMf_FOLD)
1623 ? ((regflags & PMf_LOCALE) ? REFFL : REFF)
1626 while (isDIGIT(*regparse))
1634 if (regparse >= regxend)
1635 FAIL("trailing \\ in regexp");
1643 if (regflags & PMf_EXTENDED) {
1644 while (regparse < regxend && *regparse != '\n') regparse++;
1645 if (regparse < regxend)
1660 ret = reg_node((regflags & PMf_FOLD)
1661 ? ((regflags & PMf_LOCALE) ? EXACTFL : EXACTF)
1663 s = (char *) OPERAND(ret);
1664 regc(0, s++); /* save spot for len */
1665 for (len = 0, p = regparse - 1;
1666 len < 127 && p < regxend;
1671 if (regflags & PMf_EXTENDED)
1672 p = regwhite(p, regxend);
1722 ender = scan_hex(++p, 2, &numlen);
1727 ender = UCHARAT(p++);
1728 ender = toCTRL(ender);
1730 case '0': case '1': case '2': case '3':case '4':
1731 case '5': case '6': case '7': case '8':case '9':
1733 (isDIGIT(p[1]) && atoi(p) >= regnpar) ) {
1734 ender = scan_oct(p, 3, &numlen);
1744 FAIL("trailing \\ in regexp");
1755 if (regflags & PMf_EXTENDED)
1756 p = regwhite(p, regxend);
1757 if (ISMULT2(p)) { /* Back off on ?+*. */
1772 FAIL("internal disaster in regexp");
1778 *OPERAND(ret) = len;
1781 #ifdef REGALIGN_STRUCT
1782 regsize += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1785 regcode += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
1795 regwhite(char *p, char *e)
1800 else if (*p == '#') {
1803 } while (p < e && *p != '\n');
1812 regset(char *opnd, register I32 c)
1817 opnd[1 + (c >> 3)] |= (1 << (c & 7));
1823 register char *opnd, *s;
1825 register I32 lastclass = 1234;
1826 register I32 range = 0;
1827 register regnode *ret;
1831 s = opnd = (char *) OPERAND(regcode);
1832 ret = reg_node(ANYOF);
1833 for (Class = 0; Class < 33; Class++)
1835 if (*regparse == '^') { /* Complement of range. */
1839 *opnd |= ANYOF_INVERT;
1842 regcode += ANY_SKIP;
1843 if (regflags & PMf_FOLD)
1844 *opnd |= ANYOF_FOLD;
1845 if (regflags & PMf_LOCALE)
1846 *opnd |= ANYOF_LOCALE;
1848 regsize += ANY_SKIP;
1850 if (*regparse == ']' || *regparse == '-')
1851 goto skipcond; /* allow 1st char to be ] or - */
1852 while (regparse < regxend && *regparse != ']') {
1854 Class = UCHARAT(regparse++);
1855 if (Class == '[' && regparse + 1 < regxend &&
1856 /* I smell either [: or [= or [. -- POSIX has been here, right? */
1857 (*regparse == ':' || *regparse == '=' || *regparse == '.')) {
1858 char posixccc = *regparse;
1859 char* posixccs = regparse++;
1861 while (regparse < regxend && *regparse != posixccc)
1863 if (regparse == regxend)
1864 /* Grandfather lone [:, [=, [. */
1865 regparse = posixccs;
1867 regparse++; /* skip over the posixccc */
1868 if (*regparse == ']') {
1869 /* Not Implemented Yet.
1870 * (POSIX Extended Character Classes, that is)
1871 * The text between e.g. [: and :] would start
1872 * at posixccs + 1 and stop at regparse - 2. */
1873 if (dowarn && !SIZE_ONLY)
1874 warn("Character class syntax [%c %c] is reserved for future extensions", posixccc, posixccc);
1875 regparse++; /* skip over the ending ] */
1879 if (Class == '\\') {
1880 Class = UCHARAT(regparse++);
1883 if (regflags & PMf_LOCALE) {
1885 *opnd |= ANYOF_ALNUML;
1888 for (Class = 0; Class < 256; Class++)
1890 regset(opnd, Class);
1895 if (regflags & PMf_LOCALE) {
1897 *opnd |= ANYOF_NALNUML;
1900 for (Class = 0; Class < 256; Class++)
1901 if (!isALNUM(Class))
1902 regset(opnd, Class);
1907 if (regflags & PMf_LOCALE) {
1909 *opnd |= ANYOF_SPACEL;
1912 for (Class = 0; Class < 256; Class++)
1914 regset(opnd, Class);
1919 if (regflags & PMf_LOCALE) {
1921 *opnd |= ANYOF_NSPACEL;
1924 for (Class = 0; Class < 256; Class++)
1925 if (!isSPACE(Class))
1926 regset(opnd, Class);
1931 for (Class = '0'; Class <= '9'; Class++)
1932 regset(opnd, Class);
1936 for (Class = 0; Class < '0'; Class++)
1937 regset(opnd, Class);
1938 for (Class = '9' + 1; Class < 256; Class++)
1939 regset(opnd, Class);
1964 Class = scan_hex(regparse, 2, &numlen);
1968 Class = UCHARAT(regparse++);
1969 Class = toCTRL(Class);
1971 case '0': case '1': case '2': case '3': case '4':
1972 case '5': case '6': case '7': case '8': case '9':
1973 Class = scan_oct(--regparse, 3, &numlen);
1979 if (lastclass > Class)
1980 FAIL("invalid [] range in regexp");
1985 if (*regparse == '-' && regparse+1 < regxend &&
1986 regparse[1] != ']') {
1989 continue; /* do it next time */
1992 for ( ; lastclass <= Class; lastclass++)
1993 regset(opnd, lastclass);
1996 if (*regparse != ']')
1997 FAIL("unmatched [] in regexp");
2005 char* retval = regparse++;
2008 if (*regparse == '(' && regparse[1] == '?' &&
2009 regparse[2] == '#') {
2010 while (*regparse && *regparse != ')')
2015 if (regflags & PMf_EXTENDED) {
2016 if (isSPACE(*regparse)) {
2020 else if (*regparse == '#') {
2021 while (*regparse && *regparse != '\n')
2032 - reg_node - emit a node
2034 STATIC regnode * /* Location. */
2037 register regnode *ret;
2038 register regnode *ptr;
2042 SIZE_ALIGN(regsize);
2043 #ifdef REGALIGN_STRUCT
2051 NODE_ALIGN_FILL(ret);
2053 FILL_ADVANCE_NODE(ptr, op);
2060 - reganode - emit a node with an argument
2062 STATIC regnode * /* Location. */
2063 reganode(U8 op, U32 arg)
2065 register regnode *ret;
2066 register regnode *ptr;
2070 SIZE_ALIGN(regsize);
2079 NODE_ALIGN_FILL(ret);
2081 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
2088 - regc - emit (if appropriate) a byte of code
2098 - reginsert - insert an operator in front of already-emitted operand
2100 * Means relocating the operand.
2103 reginsert(U8 op, regnode *opnd)
2105 register regnode *src;
2106 register regnode *dst;
2107 register regnode *place;
2108 register int offset = regarglen[(U8)op];
2110 /* (regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
2113 regsize += NODE_STEP_REGNODE + offset;
2118 regcode += NODE_STEP_REGNODE + offset;
2121 StructCopy(--src, --dst, regnode);
2123 place = opnd; /* Op node, where operand used to be. */
2124 src = NEXTOPER(place);
2125 FILL_ADVANCE_NODE(place, op);
2126 Zero(src, offset, regnode);
2127 #if defined(REGALIGN) && !defined(REGALIGN_STRUCT)
2128 src[offset + 1] = '\177';
2133 - regtail - set the next-pointer at the end of a node chain of p to val.
2136 regtail(regnode *p, regnode *val)
2138 register regnode *scan;
2139 register regnode *temp;
2140 register I32 offset;
2145 /* Find last node. */
2148 temp = regnext(scan);
2155 # ifdef REGALIGN_STRUCT
2156 if (reg_off_by_arg[OP(scan)]) {
2157 ARG_SET(scan, val - scan);
2159 NEXT_OFF(scan) = val - scan;
2162 offset = val - scan;
2164 *(short*)(scan+1) = offset;
2168 if (OP(scan) == BACK)
2169 offset = scan - val;
2171 offset = val - scan;
2172 *(scan+1) = (offset>>8)&0377;
2173 *(scan+2) = offset&0377;
2178 - regoptail - regtail on operand of first argument; nop if operandless
2181 regoptail(regnode *p, regnode *val)
2183 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
2184 if (p == NULL || SIZE_ONLY)
2186 if (regkind[(U8)OP(p)] == BRANCH) {
2187 regtail(NEXTOPER(p), val);
2188 } else if ( regkind[(U8)OP(p)] == BRANCHJ) {
2189 regtail(NEXTOPER(NEXTOPER(p)), val);
2195 - regcurly - a little FSA that accepts {\d+,?\d*}
2198 regcurly(register char *s)
2218 dumpuntil(regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
2220 register char op = EXACT; /* Arbitrary non-END op. */
2221 register regnode *next, *onode;
2223 while (op != END && (!last || node < last)) {
2224 /* While that wasn't END last time... */
2230 next = regnext(node);
2232 if (OP(node) == OPTIMIZED)
2235 PerlIO_printf(Perl_debug_log, "%4d%*s%s", node - start,
2236 2*l + 1, "", SvPVX(sv));
2237 if (next == NULL) /* Next ptr. */
2238 PerlIO_printf(Perl_debug_log, "(0)");
2240 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
2241 (void)PerlIO_putc(Perl_debug_log, '\n');
2243 if (regkind[(U8)op] == BRANCHJ) {
2244 register regnode *nnode = (OP(next) == LONGJMP
2247 if (last && nnode > last)
2249 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
2250 } else if (regkind[(U8)op] == BRANCH) {
2251 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
2252 } else if ( op == CURLY) { /* `next' might be very big: optimizer */
2253 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2254 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
2255 } else if (regkind[(U8)op] == CURLY && op != CURLYX) {
2256 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2258 } else if ( op == PLUS || op == STAR) {
2259 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
2260 } else if (op == ANYOF) {
2261 node = NEXTOPER(node);
2263 } else if (regkind[(U8)op] == EXACT) {
2264 /* Literal string, where present. */
2265 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2266 node = NEXTOPER(node);
2268 node = NEXTOPER(node);
2269 node += regarglen[(U8)op];
2271 if (op == CURLYX || op == OPEN)
2273 else if (op == WHILEM)
2280 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
2285 SV *sv = sv_newmortal();
2287 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
2289 /* Header fields of interest. */
2290 if (r->anchored_substr)
2291 PerlIO_printf(Perl_debug_log, "anchored `%s%s%s'%s at %d ",
2293 SvPVX(r->anchored_substr),
2295 SvTAIL(r->anchored_substr) ? "$" : "",
2296 r->anchored_offset);
2297 if (r->float_substr)
2298 PerlIO_printf(Perl_debug_log, "floating `%s%s%s'%s at %d..%u ",
2300 SvPVX(r->float_substr),
2302 SvTAIL(r->float_substr) ? "$" : "",
2303 r->float_min_offset, r->float_max_offset);
2304 if (r->check_substr)
2305 PerlIO_printf(Perl_debug_log,
2306 r->check_substr == r->float_substr
2307 ? "(checking floating" : "(checking anchored");
2308 if (r->reganch & ROPT_NOSCAN)
2309 PerlIO_printf(Perl_debug_log, " noscan");
2310 if (r->reganch & ROPT_CHECK_ALL)
2311 PerlIO_printf(Perl_debug_log, " isall");
2312 if (r->check_substr)
2313 PerlIO_printf(Perl_debug_log, ") ");
2315 if (r->regstclass) {
2316 regprop(sv, r->regstclass);
2317 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
2319 if (r->reganch & ROPT_ANCH) {
2320 PerlIO_printf(Perl_debug_log, "anchored");
2321 if (r->reganch & ROPT_ANCH_BOL)
2322 PerlIO_printf(Perl_debug_log, "(BOL)");
2323 if (r->reganch & ROPT_ANCH_MBOL)
2324 PerlIO_printf(Perl_debug_log, "(MBOL)");
2325 if (r->reganch & ROPT_ANCH_GPOS)
2326 PerlIO_printf(Perl_debug_log, "(GPOS)");
2327 PerlIO_putc(Perl_debug_log, ' ');
2329 if (r->reganch & ROPT_GPOS_SEEN)
2330 PerlIO_printf(Perl_debug_log, "GPOS ");
2331 if (r->reganch & ROPT_SKIP)
2332 PerlIO_printf(Perl_debug_log, "plus ");
2333 if (r->reganch & ROPT_IMPLICIT)
2334 PerlIO_printf(Perl_debug_log, "implicit ");
2335 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
2336 PerlIO_printf(Perl_debug_log, "\n");
2340 - regprop - printable representation of opcode
2343 regprop(SV *sv, regnode *o)
2345 register char *p = 0;
2380 sv_catpvf(sv, "EXACT <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2383 sv_catpvf(sv, "EXACTF <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2386 sv_catpvf(sv, "EXACTFL <%s%s%s>", colors[0], OPERAND(o) + 1, colors[1]);
2413 sv_catpvf(sv, "CURLY {%d,%d}", ARG1(o), ARG2(o));
2416 #ifdef REGALIGN_STRUCT
2417 sv_catpvf(sv, "CURLYM[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2419 sv_catpvf(sv, "CURLYM {%d,%d}", ARG1(o), ARG2(o));
2423 #ifdef REGALIGN_STRUCT
2424 sv_catpvf(sv, "CURLYN[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
2426 sv_catpvf(sv, "CURLYN {%d,%d}", ARG1(o), ARG2(o));
2430 sv_catpvf(sv, "CURLYX {%d,%d}", ARG1(o), ARG2(o));
2433 sv_catpvf(sv, "REF%d", ARG(o));
2436 sv_catpvf(sv, "REFF%d", ARG(o));
2439 sv_catpvf(sv, "REFFL%d", ARG(o));
2442 sv_catpvf(sv, "OPEN%d", ARG(o));
2445 sv_catpvf(sv, "CLOSE%d", ARG(o));
2461 #ifdef REGALIGN_STRUCT
2462 sv_catpvf(sv, "UNLESSM[-%d]", o->flags);
2468 #ifdef REGALIGN_STRUCT
2469 sv_catpvf(sv, "IFMATCH[-%d]", o->flags);
2523 sv_catpvf(sv, "GROUPP%d", ARG(o));
2538 FAIL("corrupted regexp opcode");
2543 #endif /* DEBUGGING */
2546 pregfree(struct regexp *r)
2548 if (!r || (--r->refcnt > 0))
2551 Safefree(r->precomp);
2553 Safefree(r->subbase);
2555 Safefree(r->substrs);
2556 if (r->anchored_substr)
2557 SvREFCNT_dec(r->anchored_substr);
2558 if (r->float_substr)
2559 SvREFCNT_dec(r->float_substr);
2561 int n = r->data->count;
2563 switch (r->data->what[n]) {
2565 SvREFCNT_dec((SV*)r->data->data[n]);
2568 op_free((OP_4tree*)r->data->data[n]);
2573 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
2576 Safefree(r->data->what);
2579 Safefree(r->startp);
2585 - regnext - dig the "next" pointer out of a node
2587 * [Note, when REGALIGN is defined there are two places in regmatch()
2588 * that bypass this code for speed.]
2591 regnext(register regnode *p)
2593 register I32 offset;
2598 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
2614 re_croak2(const char* pat1,const char* pat2,...)
2618 re_croak2(const char* pat1,const char* pat2, va_alist)
2625 STRLEN l1 = strlen(pat1);
2626 STRLEN l2 = strlen(pat2);
2634 Copy(pat1, buf, l1 , char);
2635 Copy(pat2, buf + l1, l2 , char);
2636 buf[l1 + l2 + 1] = '\n';
2637 buf[l1 + l2 + 2] = '\0';
2639 va_start(args, pat2);
2643 message = mess(buf, &args);
2645 l1 = strlen(message);
2648 Copy(message, buf, l1 , char);
2649 buf[l1] = '\0'; /* Overwrite \n */