projects / p5sagit/p5-mst-13.2.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | history | HEAD
*.pod changes based on the FAQ
[p5sagit/p5-mst-13.2.git] / regcomp.c
CommitLineData
a0d0e21e 1/* regcomp.c
2 */
3
4/*
5 * "A fair jaw-cracker dwarf-language must be." --Samwise Gamgee
6 */
7
a687059c 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!
10 */
11
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.
15 */
16
e50aee73 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.
20*/
21
f0fcb552 22/*SUPPRESS 112*/
a687059c 23/*
e50aee73 24 * pregcomp and pregexec -- regsub and regerror are not used in perl
a687059c 25 *
26 * Copyright (c) 1986 by University of Toronto.
27 * Written by Henry Spencer. Not derived from licensed software.
28 *
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:
32 *
33 * 1. The author is not responsible for the consequences of use of
34 * this software, no matter how awful, even if they arise
35 * from defects in it.
36 *
37 * 2. The origin of this software must not be misrepresented, either
38 * by explicit claim or by omission.
39 *
40 * 3. Altered versions must be plainly marked as such, and must not
41 * be misrepresented as being the original software.
42 *
43 *
44 **** Alterations to Henry's code are...
45 ****
9607fc9c 46 **** Copyright (c) 1991-1997, Larry Wall
a687059c 47 ****
9ef589d8 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.
50
a687059c 51 *
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.
55 */
56#include "EXTERN.h"
57#include "perl.h"
58#include "INTERN.h"
59#include "regcomp.h"
60
fe14fcc3 61#ifdef MSDOS
62# if defined(BUGGY_MSC6)
63 /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */
64 # pragma optimize("a",off)
65 /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/
66 # pragma optimize("w",on )
67# endif /* BUGGY_MSC6 */
68#endif /* MSDOS */
69
a687059c 70#ifndef STATIC
71#define STATIC static
72#endif
73
74#define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
75#define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
76 ((*s) == '{' && regcurly(s)))
2b69d0c2 77#ifdef atarist
78#define PERL_META "^$.[()|?+*\\"
79#else
a687059c 80#define META "^$.[()|?+*\\"
2b69d0c2 81#endif
a687059c 82
35c8bce7 83#ifdef SPSTART
84#undef SPSTART /* dratted cpp namespace... */
85#endif
a687059c 86/*
87 * Flags to be passed up and down.
88 */
a687059c 89#define WORST 0 /* Worst case. */
a0d0e21e 90#define HASWIDTH 0x1 /* Known never to match null string. */
91#define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
92#define SPSTART 0x4 /* Starts with * or +. */
93#define TRYAGAIN 0x8 /* Weeded out a declaration. */
a687059c 94
95/*
e50aee73 96 * Forward declarations for pregcomp()'s friends.
a687059c 97 */
a0d0e21e 98
99static char *reg _((I32, I32 *));
100static char *reganode _((char, unsigned short));
101static char *regatom _((I32 *));
102static char *regbranch _((I32 *));
103static void regc _((char));
104static char *regclass _((void));
105STATIC I32 regcurly _((char *));
106static char *regnode _((char));
107static char *regpiece _((I32 *));
108static void reginsert _((char, char *));
109static void regoptail _((char *, char *));
bbce6d69 110static void regset _((char *, I32));
a0d0e21e 111static void regtail _((char *, char *));
5b5a24f7 112static char* regwhite _((char *, char *));
a0d0e21e 113static char* nextchar _((void));
a687059c 114
115/*
e50aee73 116 - pregcomp - compile a regular expression into internal code
a687059c 117 *
118 * We can't allocate space until we know how big the compiled form will be,
119 * but we can't compile it (and thus know how big it is) until we've got a
120 * place to put the code. So we cheat: we compile it twice, once with code
121 * generation turned off and size counting turned on, and once "for real".
122 * This also means that we don't allocate space until we are sure that the
123 * thing really will compile successfully, and we never have to move the
124 * code and thus invalidate pointers into it. (Note that it has to be in
125 * one piece because free() must be able to free it all.) [NB: not true in perl]
126 *
127 * Beware that the optimization-preparation code in here knows about some
128 * of the structure of the compiled regexp. [I'll say.]
129 */
130regexp *
e50aee73 131pregcomp(exp,xend,pm)
a0d0e21e 132char* exp;
133char* xend;
134PMOP* pm;
a687059c 135{
a0d0e21e 136 register regexp *r;
137 register char *scan;
138 register SV *longish;
139 SV *longest;
140 register I32 len;
141 register char *first;
142 I32 flags;
143 I32 backish;
144 I32 backest;
145 I32 curback;
146 I32 minlen = 0;
147 I32 sawplus = 0;
148 I32 sawopen = 0;
47109bfb 149#define MAX_REPEAT_DEPTH 12
150 struct {
151 char *opcode;
152 I32 count;
153 } repeat_stack[MAX_REPEAT_DEPTH];
154 I32 repeat_depth = 0;
155 I32 repeat_count = 1; /* We start unmultiplied. */
a0d0e21e 156
157 if (exp == NULL)
158 croak("NULL regexp argument");
159
bbce6d69 160 regprecomp = savepvn(exp, xend - exp);
a0d0e21e 161 regflags = pm->op_pmflags;
bbce6d69 162 regsawback = 0;
163
164 /* First pass: determine size, legality. */
a0d0e21e 165 regparse = exp;
166 regxend = xend;
a0d0e21e 167 regnaughty = 0;
a0d0e21e 168 regnpar = 1;
169 regsize = 0L;
170 regcode = &regdummy;
171 regc((char)MAGIC);
172 if (reg(0, &flags) == NULL) {
173 Safefree(regprecomp);
174 regprecomp = Nullch;
175 return(NULL);
176 }
177
178 /* Small enough for pointer-storage convention? */
179 if (regsize >= 32767L) /* Probably could be 65535L. */
180 FAIL("regexp too big");
181
bbce6d69 182 /* Allocate space and initialize. */
a0d0e21e 183 Newc(1001, r, sizeof(regexp) + (unsigned)regsize, char, regexp);
184 if (r == NULL)
185 FAIL("regexp out of space");
bbce6d69 186 r->prelen = xend - exp;
a0d0e21e 187 r->precomp = regprecomp;
188 r->subbeg = r->subbase = NULL;
bbce6d69 189
190 /* Second pass: emit code. */
a0d0e21e 191 regparse = exp;
bbce6d69 192 regxend = xend;
193 regnaughty = 0;
a0d0e21e 194 regnpar = 1;
195 regcode = r->program;
196 regc((char)MAGIC);
197 if (reg(0, &flags) == NULL)
198 return(NULL);
199
200 /* Dig out information for optimizations. */
201 pm->op_pmflags = regflags;
a0d0e21e 202 r->regstart = Nullsv; /* Worst-case defaults. */
203 r->reganch = 0;
204 r->regmust = Nullsv;
205 r->regback = -1;
206 r->regstclass = Nullch;
207 r->naughty = regnaughty >= 10; /* Probably an expensive pattern. */
208 scan = r->program+1; /* First BRANCH. */
209 if (OP(regnext(scan)) == END) {/* Only one top-level choice. */
210 scan = NEXTOPER(scan);
211
212 first = scan;
213 while ((OP(first) == OPEN && (sawopen = 1)) ||
214 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
215 (OP(first) == PLUS) ||
216 (OP(first) == MINMOD) ||
217 (regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
218 if (OP(first) == PLUS)
219 sawplus = 1;
220 else
221 first += regarglen[(U8)OP(first)];
222 first = NEXTOPER(first);
a687059c 223 }
224
a0d0e21e 225 /* Starting-point info. */
226 again:
bbce6d69 227 if (OP(first) == EXACT) {
a0d0e21e 228 r->regstart = newSVpv(OPERAND(first)+1,*OPERAND(first));
bbce6d69 229 if (SvCUR(r->regstart) > !sawstudy)
230 fbm_compile(r->regstart);
231 (void)SvUPGRADE(r->regstart, SVt_PVBM);
a0d0e21e 232 }
233 else if (strchr(simple+2,OP(first)))
234 r->regstclass = first;
bbce6d69 235 else if (regkind[(U8)OP(first)] == BOUND ||
236 regkind[(U8)OP(first)] == NBOUND)
a0d0e21e 237 r->regstclass = first;
238 else if (regkind[(U8)OP(first)] == BOL) {
774d564b 239 r->reganch |= ROPT_ANCH_BOL;
a0d0e21e 240 first = NEXTOPER(first);
774d564b 241 goto again;
242 }
243 else if (OP(first) == GPOS) {
244 r->reganch |= ROPT_ANCH_GPOS;
245 first = NEXTOPER(first);
246 goto again;
a0d0e21e 247 }
248 else if ((OP(first) == STAR &&
249 regkind[(U8)OP(NEXTOPER(first))] == ANY) &&
250 !(r->reganch & ROPT_ANCH) )
251 {
252 /* turn .* into ^.* with an implied $*=1 */
774d564b 253 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
a0d0e21e 254 first = NEXTOPER(first);
774d564b 255 goto again;
a0d0e21e 256 }
257 if (sawplus && (!sawopen || !regsawback))
258 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
259
760ac839 260 DEBUG_r(PerlIO_printf(Perl_debug_log, "first %d next %d offset %d\n",
a0d0e21e 261 OP(first), OP(NEXTOPER(first)), first - scan));
262 /*
263 * If there's something expensive in the r.e., find the
264 * longest literal string that must appear and make it the
265 * regmust. Resolve ties in favor of later strings, since
266 * the regstart check works with the beginning of the r.e.
267 * and avoiding duplication strengthens checking. Not a
268 * strong reason, but sufficient in the absence of others.
269 * [Now we resolve ties in favor of the earlier string if
270 * it happens that curback has been invalidated, since the
271 * earlier string may buy us something the later one won't.]
272 */
273 longish = newSVpv("",0);
274 longest = newSVpv("",0);
275 len = 0;
276 minlen = 0;
277 curback = 0;
278 backish = 0;
279 backest = 0;
280 while (OP(scan) != END) {
281 if (OP(scan) == BRANCH) {
282 if (OP(regnext(scan)) == BRANCH) {
283 curback = -30000;
284 while (OP(scan) == BRANCH)
285 scan = regnext(scan);
00bf170e 286 }
a0d0e21e 287 else /* single branch is ok */
288 scan = NEXTOPER(scan);
748a9306 289 continue;
a0d0e21e 290 }
291 if (OP(scan) == UNLESSM) {
292 curback = -30000;
293 scan = regnext(scan);
748a9306 294 continue;
a0d0e21e 295 }
bbce6d69 296 if (OP(scan) == EXACT) {
a0d0e21e 297 char *t;
a687059c 298
a0d0e21e 299 first = scan;
47109bfb 300 while ((t = regnext(scan)) && OP(t) == CLOSE)
a0d0e21e 301 scan = t;
47109bfb 302 minlen += *OPERAND(first) * repeat_count;
a0d0e21e 303 if (curback - backish == len) {
304 sv_catpvn(longish, OPERAND(first)+1,
305 *OPERAND(first));
306 len += *OPERAND(first);
307 curback += *OPERAND(first);
308 first = regnext(scan);
2b69d0c2 309 }
a0d0e21e 310 else if (*OPERAND(first) >= len + (curback >= 0)) {
311 len = *OPERAND(first);
312 sv_setpvn(longish, OPERAND(first)+1,len);
313 backish = curback;
314 curback += len;
315 first = regnext(scan);
9ef589d8 316 }
a0d0e21e 317 else
318 curback += *OPERAND(first);
319 }
320 else if (strchr(varies,OP(scan))) {
47109bfb 321 int tcount;
322 char *next;
323
324 if (repeat_depth < MAX_REPEAT_DEPTH
325 && ((OP(scan) == PLUS
326 && (tcount = 1)
327 && (next = NEXTOPER(scan)))
328 || (regkind[(U8)OP(scan)] == CURLY
329 && (tcount = ARG1(scan))
330 && (next = NEXTOPER(scan)+4))))
331 {
332 /* We treat (abc)+ as (abc)(abc)*. */
333
334 /* Mark the place to return back. */
335 repeat_stack[repeat_depth].opcode = regnext(scan);
336 repeat_stack[repeat_depth].count = repeat_count;
337 repeat_depth++;
338 repeat_count *= tcount;
339
340 /* Go deeper: */
341 scan = next;
342 continue;
343 }
344 else {
345 curback = -30000;
346 len = 0;
347 if (SvCUR(longish) > SvCUR(longest)) {
348 sv_setsv(longest,longish);
349 backest = backish;
350 }
351 sv_setpvn(longish,"",0);
352 }
353 }
354 else if (strchr(simple,OP(scan))) {
355 curback++;
356 minlen += repeat_count;
a687059c 357 len = 0;
a0d0e21e 358 if (SvCUR(longish) > SvCUR(longest)) {
79072805 359 sv_setsv(longest,longish);
34de22dd 360 backest = backish;
361 }
a0d0e21e 362 sv_setpvn(longish,"",0);
a0d0e21e 363 }
47109bfb 364 scan = regnext(scan);
365 if (!scan) { /* Go up PLUS or CURLY. */
366 if (!repeat_depth--)
367 croak("panic: re scan");
368 scan = repeat_stack[repeat_depth].opcode;
369 repeat_count = repeat_stack[repeat_depth].count;
370 /* Need to submit the longest string found: */
371 curback = -30000;
a0d0e21e 372 len = 0;
373 if (SvCUR(longish) > SvCUR(longest)) {
374 sv_setsv(longest,longish);
375 backest = backish;
fe14fcc3 376 }
a0d0e21e 377 sv_setpvn(longish,"",0);
378 }
a687059c 379 }
380
a0d0e21e 381 /* Prefer earlier on tie, unless we can tail match latter */
382
47109bfb 383 if (SvCUR(longish) + (first && regkind[(U8)OP(first)] == EOL)
bbce6d69 384 > SvCUR(longest))
a0d0e21e 385 {
386 sv_setsv(longest,longish);
387 backest = backish;
388 }
389 else
390 sv_setpvn(longish,"",0);
391 if (SvCUR(longest)
bbce6d69 392 && (!r->regstart
393 || !fbm_instr((unsigned char*) SvPVX(r->regstart),
394 (unsigned char *) (SvPVX(r->regstart)
395 + SvCUR(r->regstart)),
396 longest)))
a0d0e21e 397 {
398 r->regmust = longest;
399 if (backest < 0)
400 backest = -1;
401 r->regback = backest;
47109bfb 402 if (SvCUR(longest) > !(sawstudy ||
403 (first && regkind[(U8)OP(first)] == EOL)))
bbce6d69 404 fbm_compile(r->regmust);
a0d0e21e 405 (void)SvUPGRADE(r->regmust, SVt_PVBM);
406 BmUSEFUL(r->regmust) = 100;
47109bfb 407 if (first && regkind[(U8)OP(first)] == EOL && SvCUR(longish))
a0d0e21e 408 SvTAIL_on(r->regmust);
409 }
410 else {
411 SvREFCNT_dec(longest);
412 longest = Nullsv;
413 }
414 SvREFCNT_dec(longish);
415 }
416
a0d0e21e 417 r->nparens = regnpar - 1;
418 r->minlen = minlen;
419 Newz(1002, r->startp, regnpar, char*);
420 Newz(1002, r->endp, regnpar, char*);
421 DEBUG_r(regdump(r));
422 return(r);
a687059c 423}
424
425/*
426 - reg - regular expression, i.e. main body or parenthesized thing
427 *
428 * Caller must absorb opening parenthesis.
429 *
430 * Combining parenthesis handling with the base level of regular expression
431 * is a trifle forced, but the need to tie the tails of the branches to what
432 * follows makes it hard to avoid.
433 */
434static char *
435reg(paren, flagp)
79072805 436I32 paren; /* Parenthesized? */
437I32 *flagp;
a687059c 438{
a0d0e21e 439 register char *ret;
440 register char *br;
441 register char *ender = 0;
442 register I32 parno = 0;
443 I32 flags;
444
445 *flagp = HASWIDTH; /* Tentatively. */
446
447 /* Make an OPEN node, if parenthesized. */
448 if (paren) {
449 if (*regparse == '?') {
450 regparse++;
748a9306 451 paren = *regparse++;
a0d0e21e 452 ret = NULL;
453 switch (paren) {
454 case ':':
455 case '=':
456 case '!':
457 break;
458 case '$':
459 case '@':
ff0cee69 460 croak("Sequence (?%c...) not implemented", (int)paren);
a0d0e21e 461 break;
462 case '#':
463 while (*regparse && *regparse != ')')
464 regparse++;
465 if (*regparse != ')')
748a9306 466 croak("Sequence (?#... not terminated");
a0d0e21e 467 nextchar();
468 *flagp = TRYAGAIN;
469 return NULL;
470 default:
471 --regparse;
472 while (*regparse && strchr("iogmsx", *regparse))
473 pmflag(&regflags, *regparse++);
474 if (*regparse != ')')
475 croak("Sequence (?%c...) not recognized", *regparse);
476 nextchar();
477 *flagp = TRYAGAIN;
478 return NULL;
479 }
480 }
481 else {
482 parno = regnpar;
483 regnpar++;
484 ret = reganode(OPEN, parno);
485 }
486 } else
487 ret = NULL;
488
489 /* Pick up the branches, linking them together. */
490 br = regbranch(&flags);
491 if (br == NULL)
492 return(NULL);
493 if (ret != NULL)
494 regtail(ret, br); /* OPEN -> first. */
495 else
496 ret = br;
497 if (!(flags&HASWIDTH))
498 *flagp &= ~HASWIDTH;
499 *flagp |= flags&SPSTART;
500 while (*regparse == '|') {
501 nextchar();
a687059c 502 br = regbranch(&flags);
503 if (br == NULL)
a0d0e21e 504 return(NULL);
505 regtail(ret, br); /* BRANCH -> BRANCH. */
a687059c 506 if (!(flags&HASWIDTH))
a0d0e21e 507 *flagp &= ~HASWIDTH;
a687059c 508 *flagp |= flags&SPSTART;
a0d0e21e 509 }
510
511 /* Make a closing node, and hook it on the end. */
512 switch (paren) {
513 case ':':
514 ender = regnode(NOTHING);
515 break;
516 case 1:
517 ender = reganode(CLOSE, parno);
518 break;
519 case '=':
520 case '!':
521 ender = regnode(SUCCEED);
522 *flagp &= ~HASWIDTH;
523 break;
524 case 0:
525 ender = regnode(END);
526 break;
527 }
528 regtail(ret, ender);
529
530 /* Hook the tails of the branches to the closing node. */
531 for (br = ret; br != NULL; br = regnext(br))
532 regoptail(br, ender);
533
534 if (paren == '=') {
535 reginsert(IFMATCH,ret);
536 regtail(ret, regnode(NOTHING));
537 }
538 else if (paren == '!') {
539 reginsert(UNLESSM,ret);
540 regtail(ret, regnode(NOTHING));
541 }
542
543 /* Check for proper termination. */
4633a7c4 544 if (paren && (regparse >= regxend || *nextchar() != ')')) {
a0d0e21e 545 FAIL("unmatched () in regexp");
546 } else if (!paren && regparse < regxend) {
547 if (*regparse == ')') {
548 FAIL("unmatched () in regexp");
549 } else
550 FAIL("junk on end of regexp"); /* "Can't happen". */
551 /* NOTREACHED */
552 }
a687059c 553
a0d0e21e 554 return(ret);
a687059c 555}
556
557/*
558 - regbranch - one alternative of an | operator
559 *
560 * Implements the concatenation operator.
561 */
562static char *
563regbranch(flagp)
79072805 564I32 *flagp;
a687059c 565{
a0d0e21e 566 register char *ret;
567 register char *chain;
568 register char *latest;
569 I32 flags = 0;
570
571 *flagp = WORST; /* Tentatively. */
572
573 ret = regnode(BRANCH);
574 chain = NULL;
575 regparse--;
576 nextchar();
577 while (regparse < regxend && *regparse != '|' && *regparse != ')') {
578 flags &= ~TRYAGAIN;
579 latest = regpiece(&flags);
580 if (latest == NULL) {
581 if (flags & TRYAGAIN)
582 continue;
583 return(NULL);
584 }
585 *flagp |= flags&HASWIDTH;
586 if (chain == NULL) /* First piece. */
587 *flagp |= flags&SPSTART;
588 else {
589 regnaughty++;
590 regtail(chain, latest);
a687059c 591 }
a0d0e21e 592 chain = latest;
593 }
594 if (chain == NULL) /* Loop ran zero times. */
595 (void) regnode(NOTHING);
a687059c 596
a0d0e21e 597 return(ret);
a687059c 598}
599
600/*
601 - regpiece - something followed by possible [*+?]
602 *
603 * Note that the branching code sequences used for ? and the general cases
604 * of * and + are somewhat optimized: they use the same NOTHING node as
605 * both the endmarker for their branch list and the body of the last branch.
606 * It might seem that this node could be dispensed with entirely, but the
607 * endmarker role is not redundant.
608 */
609static char *
610regpiece(flagp)
79072805 611I32 *flagp;
a687059c 612{
a0d0e21e 613 register char *ret;
614 register char op;
615 register char *next;
616 I32 flags;
617 char *origparse = regparse;
618 char *maxpos;
619 I32 min;
620 I32 max = 32767;
621
622 ret = regatom(&flags);
623 if (ret == NULL) {
624 if (flags & TRYAGAIN)
625 *flagp |= TRYAGAIN;
626 return(NULL);
627 }
628
629 op = *regparse;
630 if (op == '(' && regparse[1] == '?' && regparse[2] == '#') {
631 while (op && op != ')')
632 op = *++regparse;
633 if (op) {
634 nextchar();
635 op = *regparse;
636 }
637 }
638
639 if (op == '{' && regcurly(regparse)) {
640 next = regparse + 1;
641 maxpos = Nullch;
642 while (isDIGIT(*next) || *next == ',') {
643 if (*next == ',') {
644 if (maxpos)
645 break;
646 else
647 maxpos = next;
a687059c 648 }
a0d0e21e 649 next++;
650 }
651 if (*next == '}') { /* got one */
652 if (!maxpos)
653 maxpos = next;
654 regparse++;
655 min = atoi(regparse);
656 if (*maxpos == ',')
657 maxpos++;
658 else
659 maxpos = regparse;
660 max = atoi(maxpos);
661 if (!max && *maxpos != '0')
662 max = 32767; /* meaning "infinity" */
663 regparse = next;
664 nextchar();
665
666 do_curly:
667 if ((flags&SIMPLE)) {
668 regnaughty += 2 + regnaughty / 2;
669 reginsert(CURLY, ret);
670 }
671 else {
672 regnaughty += 4 + regnaughty; /* compound interest */
673 regtail(ret, regnode(WHILEM));
674 reginsert(CURLYX,ret);
675 regtail(ret, regnode(NOTHING));
676 }
677
678 if (min > 0)
679 *flagp = (WORST|HASWIDTH);
680 if (max && max < min)
681 croak("Can't do {n,m} with n > m");
682 if (regcode != &regdummy) {
00bf170e 683#ifdef REGALIGN
a0d0e21e 684 *(unsigned short *)(ret+3) = min;
685 *(unsigned short *)(ret+5) = max;
00bf170e 686#else
a0d0e21e 687 ret[3] = min >> 8; ret[4] = min & 0377;
688 ret[5] = max >> 8; ret[6] = max & 0377;
00bf170e 689#endif
a687059c 690 }
a687059c 691
a0d0e21e 692 goto nest_check;
a687059c 693 }
a0d0e21e 694 }
a687059c 695
a0d0e21e 696 if (!ISMULT1(op)) {
697 *flagp = flags;
a687059c 698 return(ret);
a0d0e21e 699 }
700 nextchar();
701
702 *flagp = (op != '+') ? (WORST|SPSTART) : (WORST|HASWIDTH);
703
704 if (op == '*' && (flags&SIMPLE)) {
705 reginsert(STAR, ret);
706 regnaughty += 4;
707 }
708 else if (op == '*') {
709 min = 0;
710 goto do_curly;
711 } else if (op == '+' && (flags&SIMPLE)) {
712 reginsert(PLUS, ret);
713 regnaughty += 3;
714 }
715 else if (op == '+') {
716 min = 1;
717 goto do_curly;
718 } else if (op == '?') {
719 min = 0; max = 1;
720 goto do_curly;
721 }
722 nest_check:
723 if (dowarn && regcode != &regdummy && !(flags&HASWIDTH) && max > 10000) {
724 warn("%.*s matches null string many times",
725 regparse - origparse, origparse);
726 }
727
728 if (*regparse == '?') {
729 nextchar();
730 reginsert(MINMOD, ret);
731#ifdef REGALIGN
732 regtail(ret, ret + 4);
733#else
734 regtail(ret, ret + 3);
735#endif
736 }
737 if (ISMULT2(regparse))
738 FAIL("nested *?+ in regexp");
739
740 return(ret);
a687059c 741}
742
743/*
744 - regatom - the lowest level
745 *
746 * Optimization: gobbles an entire sequence of ordinary characters so that
747 * it can turn them into a single node, which is smaller to store and
748 * faster to run. Backslashed characters are exceptions, each becoming a
749 * separate node; the code is simpler that way and it's not worth fixing.
750 *
751 * [Yes, it is worth fixing, some scripts can run twice the speed.]
752 */
753static char *
754regatom(flagp)
79072805 755I32 *flagp;
a687059c 756{
a0d0e21e 757 register char *ret = 0;
758 I32 flags;
759
760 *flagp = WORST; /* Tentatively. */
761
762tryagain:
763 switch (*regparse) {
764 case '^':
765 nextchar();
766 if (regflags & PMf_MULTILINE)
767 ret = regnode(MBOL);
768 else if (regflags & PMf_SINGLELINE)
769 ret = regnode(SBOL);
770 else
771 ret = regnode(BOL);
772 break;
773 case '$':
774 nextchar();
775 if (regflags & PMf_MULTILINE)
776 ret = regnode(MEOL);
777 else if (regflags & PMf_SINGLELINE)
778 ret = regnode(SEOL);
779 else
780 ret = regnode(EOL);
781 break;
782 case '.':
783 nextchar();
784 if (regflags & PMf_SINGLELINE)
785 ret = regnode(SANY);
786 else
787 ret = regnode(ANY);
788 regnaughty++;
789 *flagp |= HASWIDTH|SIMPLE;
790 break;
791 case '[':
792 regparse++;
793 ret = regclass();
794 *flagp |= HASWIDTH|SIMPLE;
795 break;
796 case '(':
797 nextchar();
798 ret = reg(1, &flags);
799 if (ret == NULL) {
800 if (flags & TRYAGAIN)
801 goto tryagain;
802 return(NULL);
803 }
804 *flagp |= flags&(HASWIDTH|SPSTART);
805 break;
806 case '|':
807 case ')':
808 if (flags & TRYAGAIN) {
809 *flagp |= TRYAGAIN;
810 return NULL;
811 }
812 croak("internal urp in regexp at /%s/", regparse);
813 /* Supposed to be caught earlier. */
814 break;
85afd4ae 815 case '{':
816 if (!regcurly(regparse)) {
817 regparse++;
818 goto defchar;
819 }
820 /* FALL THROUGH */
a0d0e21e 821 case '?':
822 case '+':
823 case '*':
3115e423 824 FAIL("?+*{} follows nothing in regexp");
a0d0e21e 825 break;
826 case '\\':
827 switch (*++regparse) {
828 case 'A':
829 ret = regnode(SBOL);
830 *flagp |= SIMPLE;
831 nextchar();
832 break;
833 case 'G':
774d564b 834 ret = regnode(GPOS);
a0d0e21e 835 *flagp |= SIMPLE;
836 nextchar();
837 break;
838 case 'Z':
839 ret = regnode(SEOL);
840 *flagp |= SIMPLE;
841 nextchar();
842 break;
843 case 'w':
bbce6d69 844 ret = regnode((regflags & PMf_LOCALE) ? ALNUML : ALNUM);
a0d0e21e 845 *flagp |= HASWIDTH|SIMPLE;
846 nextchar();
847 break;
848 case 'W':
bbce6d69 849 ret = regnode((regflags & PMf_LOCALE) ? NALNUML : NALNUM);
a0d0e21e 850 *flagp |= HASWIDTH|SIMPLE;
851 nextchar();
852 break;
853 case 'b':
bbce6d69 854 ret = regnode((regflags & PMf_LOCALE) ? BOUNDL : BOUND);
a0d0e21e 855 *flagp |= SIMPLE;
856 nextchar();
857 break;
858 case 'B':
bbce6d69 859 ret = regnode((regflags & PMf_LOCALE) ? NBOUNDL : NBOUND);
a0d0e21e 860 *flagp |= SIMPLE;
861 nextchar();
862 break;
863 case 's':
bbce6d69 864 ret = regnode((regflags & PMf_LOCALE) ? SPACEL : SPACE);
a0d0e21e 865 *flagp |= HASWIDTH|SIMPLE;
866 nextchar();
867 break;
868 case 'S':
bbce6d69 869 ret = regnode((regflags & PMf_LOCALE) ? NSPACEL : NSPACE);
a0d0e21e 870 *flagp |= HASWIDTH|SIMPLE;
871 nextchar();
872 break;
873 case 'd':
874 ret = regnode(DIGIT);
875 *flagp |= HASWIDTH|SIMPLE;
876 nextchar();
877 break;
878 case 'D':
879 ret = regnode(NDIGIT);
880 *flagp |= HASWIDTH|SIMPLE;
881 nextchar();
882 break;
883 case 'n':
884 case 'r':
885 case 't':
886 case 'f':
887 case 'e':
888 case 'a':
889 case 'x':
890 case 'c':
891 case '0':
892 goto defchar;
893 case '1': case '2': case '3': case '4':
894 case '5': case '6': case '7': case '8': case '9':
895 {
896 I32 num = atoi(regparse);
897
898 if (num > 9 && num >= regnpar)
899 goto defchar;
900 else {
901 regsawback = 1;
902 ret = reganode(REF, num);
903 *flagp |= HASWIDTH;
904 while (isDIGIT(*regparse))
a687059c 905 regparse++;
a0d0e21e 906 regparse--;
907 nextchar();
908 }
909 }
910 break;
911 case '\0':
912 if (regparse >= regxend)
913 FAIL("trailing \\ in regexp");
914 /* FALL THROUGH */
915 default:
916 goto defchar;
917 }
918 break;
4633a7c4 919
920 case '#':
921 if (regflags & PMf_EXTENDED) {
922 while (regparse < regxend && *regparse != '\n') regparse++;
923 if (regparse < regxend)
924 goto tryagain;
925 }
926 /* FALL THROUGH */
927
a0d0e21e 928 default: {
929 register I32 len;
930 register char ender;
931 register char *p;
932 char *oldp;
933 I32 numlen;
934
935 regparse++;
936
937 defchar:
bbce6d69 938 ret = regnode((regflags & PMf_FOLD)
939 ? ((regflags & PMf_LOCALE) ? EXACTFL : EXACTF)
940 : EXACT);
a0d0e21e 941 regc(0); /* save spot for len */
942 for (len = 0, p = regparse - 1;
943 len < 127 && p < regxend;
944 len++)
945 {
946 oldp = p;
5b5a24f7 947
948 if (regflags & PMf_EXTENDED)
949 p = regwhite(p, regxend);
a0d0e21e 950 switch (*p) {
951 case '^':
952 case '$':
953 case '.':
954 case '[':
955 case '(':
956 case ')':
957 case '|':
958 goto loopdone;
959 case '\\':
960 switch (*++p) {
961 case 'A':
962 case 'G':
963 case 'Z':
964 case 'w':
965 case 'W':
966 case 'b':
967 case 'B':
968 case 's':
969 case 'S':
970 case 'd':
971 case 'D':
972 --p;
973 goto loopdone;
974 case 'n':
975 ender = '\n';
976 p++;
a687059c 977 break;
a0d0e21e 978 case 'r':
979 ender = '\r';
980 p++;
a687059c 981 break;
a0d0e21e 982 case 't':
983 ender = '\t';
984 p++;
a687059c 985 break;
a0d0e21e 986 case 'f':
987 ender = '\f';
988 p++;
a687059c 989 break;
a0d0e21e 990 case 'e':
991 ender = '\033';
992 p++;
a687059c 993 break;
a0d0e21e 994 case 'a':
995 ender = '\007';
996 p++;
a687059c 997 break;
a0d0e21e 998 case 'x':
999 ender = scan_hex(++p, 2, &numlen);
1000 p += numlen;
a687059c 1001 break;
a0d0e21e 1002 case 'c':
1003 p++;
bbce6d69 1004 ender = UCHARAT(p++);
1005 ender = toCTRL(ender);
a687059c 1006 break;
a0d0e21e 1007 case '0': case '1': case '2': case '3':case '4':
1008 case '5': case '6': case '7': case '8':case '9':
1009 if (*p == '0' ||
1010 (isDIGIT(p[1]) && atoi(p) >= regnpar) ) {
1011 ender = scan_oct(p, 3, &numlen);
1012 p += numlen;
1013 }
1014 else {
1015 --p;
1016 goto loopdone;
a687059c 1017 }
1018 break;
a0d0e21e 1019 case '\0':
1020 if (p >= regxend)
a687059c 1021 FAIL("trailing \\ in regexp");
1022 /* FALL THROUGH */
a0d0e21e 1023 default:
1024 ender = *p++;
1025 break;
1026 }
1027 break;
a687059c 1028 default:
a0d0e21e 1029 ender = *p++;
1030 break;
a687059c 1031 }
5b5a24f7 1032 if (regflags & PMf_EXTENDED)
1033 p = regwhite(p, regxend);
a0d0e21e 1034 if (ISMULT2(p)) { /* Back off on ?+*. */
1035 if (len)
1036 p = oldp;
1037 else {
1038 len++;
1039 regc(ender);
1040 }
1041 break;
a687059c 1042 }
a0d0e21e 1043 regc(ender);
1044 }
1045 loopdone:
1046 regparse = p - 1;
1047 nextchar();
1048 if (len < 0)
1049 FAIL("internal disaster in regexp");
1050 if (len > 0)
1051 *flagp |= HASWIDTH;
1052 if (len == 1)
1053 *flagp |= SIMPLE;
1054 if (regcode != &regdummy)
1055 *OPERAND(ret) = len;
1056 regc('\0');
a687059c 1057 }
a0d0e21e 1058 break;
1059 }
a687059c 1060
a0d0e21e 1061 return(ret);
a687059c 1062}
1063
5b5a24f7 1064static char *
1065regwhite(p, e)
1066char *p;
1067char *e;
1068{
1069 while (p < e) {
1070 if (isSPACE(*p))
1071 ++p;
1072 else if (*p == '#') {
1073 do {
1074 p++;
1075 } while (p < e && *p != '\n');
1076 }
1077 else
1078 break;
1079 }
1080 return p;
1081}
1082
a687059c 1083static void
bbce6d69 1084regset(opnd, c)
1085char *opnd;
79072805 1086register I32 c;
a687059c 1087{
bbce6d69 1088 if (opnd == &regdummy)
1089 return;
1090 c &= 0xFF;
1091 opnd[1 + (c >> 3)] |= (1 << (c & 7));
a687059c 1092}
1093
1094static char *
1095regclass()
1096{
bbce6d69 1097 register char *opnd;
a0d0e21e 1098 register I32 class;
1099 register I32 lastclass = 1234;
1100 register I32 range = 0;
1101 register char *ret;
1102 register I32 def;
1103 I32 numlen;
1104
1105 ret = regnode(ANYOF);
bbce6d69 1106 opnd = regcode;
1107 for (class = 0; class < 33; class++)
1108 regc(0);
a0d0e21e 1109 if (*regparse == '^') { /* Complement of range. */
1110 regnaughty++;
1111 regparse++;
bbce6d69 1112 if (opnd != &regdummy)
1113 *opnd |= ANYOF_INVERT;
1114 }
1115 if (opnd != &regdummy) {
1116 if (regflags & PMf_FOLD)
1117 *opnd |= ANYOF_FOLD;
1118 if (regflags & PMf_LOCALE)
1119 *opnd |= ANYOF_LOCALE;
a0d0e21e 1120 }
a0d0e21e 1121 if (*regparse == ']' || *regparse == '-')
1122 goto skipcond; /* allow 1st char to be ] or - */
1123 while (regparse < regxend && *regparse != ']') {
1124 skipcond:
1125 class = UCHARAT(regparse++);
1126 if (class == '\\') {
1127 class = UCHARAT(regparse++);
1128 switch (class) {
1129 case 'w':
bbce6d69 1130 if (regflags & PMf_LOCALE) {
1131 if (opnd != &regdummy)
1132 *opnd |= ANYOF_ALNUML;
1133 }
1134 else {
1135 for (class = 0; class < 256; class++)
1136 if (isALNUM(class))
1137 regset(opnd, class);
1138 }
a0d0e21e 1139 lastclass = 1234;
1140 continue;
1141 case 'W':
bbce6d69 1142 if (regflags & PMf_LOCALE) {
1143 if (opnd != &regdummy)
1144 *opnd |= ANYOF_NALNUML;
1145 }
1146 else {
1147 for (class = 0; class < 256; class++)
1148 if (!isALNUM(class))
1149 regset(opnd, class);
1150 }
a0d0e21e 1151 lastclass = 1234;
1152 continue;
1153 case 's':
bbce6d69 1154 if (regflags & PMf_LOCALE) {
1155 if (opnd != &regdummy)
1156 *opnd |= ANYOF_SPACEL;
1157 }
1158 else {
1159 for (class = 0; class < 256; class++)
1160 if (isSPACE(class))
1161 regset(opnd, class);
1162 }
a0d0e21e 1163 lastclass = 1234;
1164 continue;
1165 case 'S':
bbce6d69 1166 if (regflags & PMf_LOCALE) {
1167 if (opnd != &regdummy)
1168 *opnd |= ANYOF_NSPACEL;
1169 }
1170 else {
1171 for (class = 0; class < 256; class++)
1172 if (!isSPACE(class))
1173 regset(opnd, class);
1174 }
a0d0e21e 1175 lastclass = 1234;
1176 continue;
1177 case 'd':
1178 for (class = '0'; class <= '9'; class++)
bbce6d69 1179 regset(opnd, class);
a0d0e21e 1180 lastclass = 1234;
1181 continue;
1182 case 'D':
1183 for (class = 0; class < '0'; class++)
bbce6d69 1184 regset(opnd, class);
a0d0e21e 1185 for (class = '9' + 1; class < 256; class++)
bbce6d69 1186 regset(opnd, class);
a0d0e21e 1187 lastclass = 1234;
1188 continue;
1189 case 'n':
1190 class = '\n';
1191 break;
1192 case 'r':
1193 class = '\r';
1194 break;
1195 case 't':
1196 class = '\t';
1197 break;
1198 case 'f':
1199 class = '\f';
1200 break;
1201 case 'b':
1202 class = '\b';
1203 break;
1204 case 'e':
1205 class = '\033';
1206 break;
1207 case 'a':
1208 class = '\007';
1209 break;
1210 case 'x':
1211 class = scan_hex(regparse, 2, &numlen);
1212 regparse += numlen;
1213 break;
1214 case 'c':
bbce6d69 1215 class = UCHARAT(regparse++);
1216 class = toCTRL(class);
a0d0e21e 1217 break;
1218 case '0': case '1': case '2': case '3': case '4':
1219 case '5': case '6': case '7': case '8': case '9':
1220 class = scan_oct(--regparse, 3, &numlen);
1221 regparse += numlen;
1222 break;
1223 }
1224 }
1225 if (range) {
1226 if (lastclass > class)
1227 FAIL("invalid [] range in regexp");
1228 range = 0;
1229 }
1230 else {
1231 lastclass = class;
1232 if (*regparse == '-' && regparse+1 < regxend &&
1233 regparse[1] != ']') {
a687059c 1234 regparse++;
a0d0e21e 1235 range = 1;
1236 continue; /* do it next time */
1237 }
a687059c 1238 }
bbce6d69 1239 for ( ; lastclass <= class; lastclass++)
1240 regset(opnd, lastclass);
a0d0e21e 1241 lastclass = class;
1242 }
1243 if (*regparse != ']')
1244 FAIL("unmatched [] in regexp");
1245 nextchar();
1246 return ret;
1247}
1248
1249static char*
1250nextchar()
1251{
1252 char* retval = regparse++;
1253
4633a7c4 1254 for (;;) {
1255 if (*regparse == '(' && regparse[1] == '?' &&
1256 regparse[2] == '#') {
1257 while (*regparse && *regparse != ')')
748a9306 1258 regparse++;
4633a7c4 1259 regparse++;
1260 continue;
1261 }
1262 if (regflags & PMf_EXTENDED) {
1263 if (isSPACE(*regparse)) {
748a9306 1264 regparse++;
1265 continue;
1266 }
1267 else if (*regparse == '#') {
1268 while (*regparse && *regparse != '\n')
1269 regparse++;
1270 regparse++;
1271 continue;
1272 }
748a9306 1273 }
4633a7c4 1274 return retval;
a0d0e21e 1275 }
a687059c 1276}
1277
1278/*
a0d0e21e 1279- regnode - emit a node
1280*/
1281#ifdef CAN_PROTOTYPE
1282static char * /* Location. */
1283regnode(char op)
1284#else
a687059c 1285static char * /* Location. */
1286regnode(op)
1287char op;
a0d0e21e 1288#endif
a687059c 1289{
a0d0e21e 1290 register char *ret;
1291 register char *ptr;
a687059c 1292
a0d0e21e 1293 ret = regcode;
1294 if (ret == &regdummy) {
a687059c 1295#ifdef REGALIGN
a0d0e21e 1296 if (!(regsize & 1))
1297 regsize++;
a687059c 1298#endif
a0d0e21e 1299 regsize += 3;
1300 return(ret);
1301 }
a687059c 1302
1303#ifdef REGALIGN
1304#ifndef lint
a0d0e21e 1305 if (!((long)ret & 1))
1306 *ret++ = 127;
a687059c 1307#endif
1308#endif
a0d0e21e 1309 ptr = ret;
1310 *ptr++ = op;
1311 *ptr++ = '\0'; /* Null "next" pointer. */
1312 *ptr++ = '\0';
1313 regcode = ptr;
a687059c 1314
a0d0e21e 1315 return(ret);
a687059c 1316}
1317
1318/*
a0d0e21e 1319- reganode - emit a node with an argument
1320*/
1321#ifdef CAN_PROTOTYPE
1322static char * /* Location. */
1323reganode(char op, unsigned short arg)
1324#else
fe14fcc3 1325static char * /* Location. */
1326reganode(op, arg)
1327char op;
1328unsigned short arg;
a0d0e21e 1329#endif
fe14fcc3 1330{
a0d0e21e 1331 register char *ret;
1332 register char *ptr;
fe14fcc3 1333
a0d0e21e 1334 ret = regcode;
1335 if (ret == &regdummy) {
fe14fcc3 1336#ifdef REGALIGN
a0d0e21e 1337 if (!(regsize & 1))
1338 regsize++;
fe14fcc3 1339#endif
a0d0e21e 1340 regsize += 5;
1341 return(ret);
1342 }
fe14fcc3 1343
1344#ifdef REGALIGN
1345#ifndef lint
a0d0e21e 1346 if (!((long)ret & 1))
1347 *ret++ = 127;
fe14fcc3 1348#endif
1349#endif
a0d0e21e 1350 ptr = ret;
1351 *ptr++ = op;
1352 *ptr++ = '\0'; /* Null "next" pointer. */
1353 *ptr++ = '\0';
fe14fcc3 1354#ifdef REGALIGN
a0d0e21e 1355 *(unsigned short *)(ret+3) = arg;
fe14fcc3 1356#else
a0d0e21e 1357 ret[3] = arg >> 8; ret[4] = arg & 0377;
fe14fcc3 1358#endif
a0d0e21e 1359 ptr += 2;
1360 regcode = ptr;
fe14fcc3 1361
a0d0e21e 1362 return(ret);
fe14fcc3 1363}
1364
1365/*
a0d0e21e 1366- regc - emit (if appropriate) a byte of code
1367*/
1368#ifdef CAN_PROTOTYPE
1369static void
1370regc(char b)
1371#else
a687059c 1372static void
1373regc(b)
1374char b;
a0d0e21e 1375#endif
a687059c 1376{
a0d0e21e 1377 if (regcode != &regdummy)
1378 *regcode++ = b;
1379 else
1380 regsize++;
a687059c 1381}
1382
1383/*
a0d0e21e 1384- reginsert - insert an operator in front of already-emitted operand
1385*
1386* Means relocating the operand.
1387*/
1388#ifdef CAN_PROTOTYPE
1389static void
1390reginsert(char op, char *opnd)
1391#else
a687059c 1392static void
1393reginsert(op, opnd)
1394char op;
1395char *opnd;
a0d0e21e 1396#endif
a687059c 1397{
a0d0e21e 1398 register char *src;
1399 register char *dst;
1400 register char *place;
1401 register int offset = (regkind[(U8)op] == CURLY ? 4 : 0);
a687059c 1402
a0d0e21e 1403 if (regcode == &regdummy) {
a687059c 1404#ifdef REGALIGN
a0d0e21e 1405 regsize += 4 + offset;
a687059c 1406#else
a0d0e21e 1407 regsize += 3 + offset;
a687059c 1408#endif
a0d0e21e 1409 return;
1410 }
a687059c 1411
a0d0e21e 1412 src = regcode;
a687059c 1413#ifdef REGALIGN
a0d0e21e 1414 regcode += 4 + offset;
a687059c 1415#else
a0d0e21e 1416 regcode += 3 + offset;
a687059c 1417#endif
a0d0e21e 1418 dst = regcode;
1419 while (src > opnd)
1420 *--dst = *--src;
1421
1422 place = opnd; /* Op node, where operand used to be. */
1423 *place++ = op;
1424 *place++ = '\0';
1425 *place++ = '\0';
1426 while (offset-- > 0)
a687059c 1427 *place++ = '\0';
2b69d0c2 1428#ifdef REGALIGN
a0d0e21e 1429 *place++ = '\177';
2b69d0c2 1430#endif
a687059c 1431}
1432
1433/*
a0d0e21e 1434- regtail - set the next-pointer at the end of a node chain
1435*/
a687059c 1436static void
1437regtail(p, val)
1438char *p;
1439char *val;
1440{
a0d0e21e 1441 register char *scan;
1442 register char *temp;
1443 register I32 offset;
1444
1445 if (p == &regdummy)
1446 return;
1447
1448 /* Find last node. */
1449 scan = p;
1450 for (;;) {
1451 temp = regnext(scan);
1452 if (temp == NULL)
1453 break;
1454 scan = temp;
1455 }
a687059c 1456
1457#ifdef REGALIGN
a0d0e21e 1458 offset = val - scan;
a687059c 1459#ifndef lint
a0d0e21e 1460 *(short*)(scan+1) = offset;
a687059c 1461#else
a0d0e21e 1462 offset = offset;
a687059c 1463#endif
1464#else
a0d0e21e 1465 if (OP(scan) == BACK)
1466 offset = scan - val;
1467 else
1468 offset = val - scan;
1469 *(scan+1) = (offset>>8)&0377;
1470 *(scan+2) = offset&0377;
a687059c 1471#endif
1472}
1473
1474/*
a0d0e21e 1475- regoptail - regtail on operand of first argument; nop if operandless
1476*/
a687059c 1477static void
1478regoptail(p, val)
1479char *p;
1480char *val;
1481{
a0d0e21e 1482 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
1483 if (p == NULL || p == &regdummy || regkind[(U8)OP(p)] != BRANCH)
1484 return;
1485 regtail(NEXTOPER(p), val);
a687059c 1486}
1487
1488/*
1489 - regcurly - a little FSA that accepts {\d+,?\d*}
1490 */
79072805 1491STATIC I32
a687059c 1492regcurly(s)
1493register char *s;
1494{
1495 if (*s++ != '{')
1496 return FALSE;
f0fcb552 1497 if (!isDIGIT(*s))
a687059c 1498 return FALSE;
f0fcb552 1499 while (isDIGIT(*s))
a687059c 1500 s++;
1501 if (*s == ',')
1502 s++;
f0fcb552 1503 while (isDIGIT(*s))
a687059c 1504 s++;
1505 if (*s != '}')
1506 return FALSE;
1507 return TRUE;
1508}
1509
1510#ifdef DEBUGGING
1511
1512/*
fd181c75 1513 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
a687059c 1514 */
1515void
1516regdump(r)
1517regexp *r;
1518{
a0d0e21e 1519 register char *s;
bbce6d69 1520 register char op = EXACT; /* Arbitrary non-END op. */
a0d0e21e 1521 register char *next;
a687059c 1522
1523
a0d0e21e 1524 s = r->program + 1;
1525 while (op != END) { /* While that wasn't END last time... */
a687059c 1526#ifdef REGALIGN
a0d0e21e 1527 if (!((long)s & 1))
1528 s++;
a687059c 1529#endif
a0d0e21e 1530 op = OP(s);
760ac839 1531 PerlIO_printf(Perl_debug_log, "%2d%s", s-r->program, regprop(s)); /* Where, what. */
a0d0e21e 1532 next = regnext(s);
1533 s += regarglen[(U8)op];
1534 if (next == NULL) /* Next ptr. */
760ac839 1535 PerlIO_printf(Perl_debug_log, "(0)");
a0d0e21e 1536 else
760ac839 1537 PerlIO_printf(Perl_debug_log, "(%d)", (s-r->program)+(next-s));
a0d0e21e 1538 s += 3;
1539 if (op == ANYOF) {
bbce6d69 1540 s += 33;
a687059c 1541 }
bbce6d69 1542 if (regkind[(U8)op] == EXACT) {
a0d0e21e 1543 /* Literal string, where present. */
1544 s++;
760ac839 1545 (void)PerlIO_putc(Perl_debug_log, ' ');
1546 (void)PerlIO_putc(Perl_debug_log, '<');
a0d0e21e 1547 while (*s != '\0') {
760ac839 1548 (void)PerlIO_putc(Perl_debug_log,*s);
a0d0e21e 1549 s++;
1550 }
760ac839 1551 (void)PerlIO_putc(Perl_debug_log, '>');
a0d0e21e 1552 s++;
1553 }
760ac839 1554 (void)PerlIO_putc(Perl_debug_log, '\n');
a0d0e21e 1555 }
1556
1557 /* Header fields of interest. */
1558 if (r->regstart)
760ac839 1559 PerlIO_printf(Perl_debug_log, "start `%s' ", SvPVX(r->regstart));
a0d0e21e 1560 if (r->regstclass)
760ac839 1561 PerlIO_printf(Perl_debug_log, "stclass `%s' ", regprop(r->regstclass));
774d564b 1562 if (r->reganch & ROPT_ANCH) {
1563 PerlIO_printf(Perl_debug_log, "anchored");
1564 if (r->reganch & ROPT_ANCH_BOL)
1565 PerlIO_printf(Perl_debug_log, "(BOL)");
1566 if (r->reganch & ROPT_ANCH_GPOS)
1567 PerlIO_printf(Perl_debug_log, "(GPOS)");
1568 PerlIO_putc(Perl_debug_log, ' ');
1569 }
a0d0e21e 1570 if (r->reganch & ROPT_SKIP)
760ac839 1571 PerlIO_printf(Perl_debug_log, "plus ");
a0d0e21e 1572 if (r->reganch & ROPT_IMPLICIT)
760ac839 1573 PerlIO_printf(Perl_debug_log, "implicit ");
a0d0e21e 1574 if (r->regmust != NULL)
760ac839 1575 PerlIO_printf(Perl_debug_log, "must have \"%s\" back %ld ", SvPVX(r->regmust),
a0d0e21e 1576 (long) r->regback);
760ac839 1577 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
1578 PerlIO_printf(Perl_debug_log, "\n");
a687059c 1579}
1580
1581/*
a0d0e21e 1582- regprop - printable representation of opcode
1583*/
a687059c 1584char *
1585regprop(op)
1586char *op;
1587{
a0d0e21e 1588 register char *p = 0;
1589
1590 (void) strcpy(buf, ":");
1591
1592 switch (OP(op)) {
1593 case BOL:
1594 p = "BOL";
1595 break;
1596 case MBOL:
1597 p = "MBOL";
1598 break;
1599 case SBOL:
1600 p = "SBOL";
1601 break;
1602 case EOL:
1603 p = "EOL";
1604 break;
1605 case MEOL:
1606 p = "MEOL";
1607 break;
1608 case SEOL:
1609 p = "SEOL";
1610 break;
1611 case ANY:
1612 p = "ANY";
1613 break;
1614 case SANY:
1615 p = "SANY";
1616 break;
1617 case ANYOF:
1618 p = "ANYOF";
1619 break;
1620 case BRANCH:
1621 p = "BRANCH";
1622 break;
bbce6d69 1623 case EXACT:
1624 p = "EXACT";
1625 break;
1626 case EXACTF:
1627 p = "EXACTF";
1628 break;
1629 case EXACTFL:
1630 p = "EXACTFL";
a0d0e21e 1631 break;
1632 case NOTHING:
1633 p = "NOTHING";
1634 break;
1635 case BACK:
1636 p = "BACK";
1637 break;
1638 case END:
1639 p = "END";
1640 break;
a0d0e21e 1641 case BOUND:
1642 p = "BOUND";
1643 break;
bbce6d69 1644 case BOUNDL:
1645 p = "BOUNDL";
1646 break;
a0d0e21e 1647 case NBOUND:
1648 p = "NBOUND";
1649 break;
bbce6d69 1650 case NBOUNDL:
1651 p = "NBOUNDL";
a0d0e21e 1652 break;
1653 case CURLY:
1654 (void)sprintf(buf+strlen(buf), "CURLY {%d,%d}", ARG1(op),ARG2(op));
1655 p = NULL;
1656 break;
1657 case CURLYX:
1658 (void)sprintf(buf+strlen(buf), "CURLYX {%d,%d}", ARG1(op),ARG2(op));
1659 p = NULL;
1660 break;
1661 case REF:
1662 (void)sprintf(buf+strlen(buf), "REF%d", ARG1(op));
1663 p = NULL;
1664 break;
1665 case OPEN:
1666 (void)sprintf(buf+strlen(buf), "OPEN%d", ARG1(op));
1667 p = NULL;
1668 break;
1669 case CLOSE:
1670 (void)sprintf(buf+strlen(buf), "CLOSE%d", ARG1(op));
1671 p = NULL;
1672 break;
1673 case STAR:
1674 p = "STAR";
1675 break;
1676 case PLUS:
1677 p = "PLUS";
1678 break;
1679 case MINMOD:
1680 p = "MINMOD";
1681 break;
774d564b 1682 case GPOS:
1683 p = "GPOS";
a0d0e21e 1684 break;
1685 case UNLESSM:
1686 p = "UNLESSM";
1687 break;
1688 case IFMATCH:
1689 p = "IFMATCH";
1690 break;
1691 case SUCCEED:
1692 p = "SUCCEED";
1693 break;
1694 case WHILEM:
1695 p = "WHILEM";
1696 break;
bbce6d69 1697 case DIGIT:
1698 p = "DIGIT";
1699 break;
1700 case NDIGIT:
1701 p = "NDIGIT";
1702 break;
1703 case ALNUM:
1704 p = "ALNUM";
1705 break;
1706 case NALNUM:
1707 p = "NALNUM";
1708 break;
1709 case SPACE:
1710 p = "SPACE";
1711 break;
1712 case NSPACE:
1713 p = "NSPACE";
1714 break;
1715 case ALNUML:
1716 p = "ALNUML";
1717 break;
1718 case NALNUML:
1719 p = "NALNUML";
1720 break;
1721 case SPACEL:
1722 p = "SPACEL";
1723 break;
1724 case NSPACEL:
1725 p = "NSPACEL";
1726 break;
a0d0e21e 1727 default:
1728 FAIL("corrupted regexp opcode");
1729 }
1730 if (p != NULL)
1731 (void) strcat(buf, p);
1732 return(buf);
a687059c 1733}
1734#endif /* DEBUGGING */
1735
2b69d0c2 1736void
e50aee73 1737pregfree(r)
a687059c 1738struct regexp *r;
1739{
a0d0e21e 1740 if (!r)
1741 return;
1742 if (r->precomp) {
1743 Safefree(r->precomp);
1744 r->precomp = Nullch;
1745 }
1746 if (r->subbase) {
1747 Safefree(r->subbase);
1748 r->subbase = Nullch;
1749 }
1750 if (r->regmust) {
1751 SvREFCNT_dec(r->regmust);
1752 r->regmust = Nullsv;
1753 }
1754 if (r->regstart) {
1755 SvREFCNT_dec(r->regstart);
1756 r->regstart = Nullsv;
1757 }
1758 Safefree(r->startp);
1759 Safefree(r->endp);
1760 Safefree(r);
a687059c 1761}
Unnamed repository; edit this file to name it for gitweb.