projects / p5sagit/p5-mst-13.2.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | history | HEAD
add $config_args to perl -V display (suggested by Ilya Zakharevich)
[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
b9d5759e 22#ifdef PERL_EXT_RE_BUILD
23/* need to replace pregcomp et al, so enable that */
24# ifndef PERL_IN_XSUB_RE
25# define PERL_IN_XSUB_RE
26# endif
27/* need access to debugger hooks */
28# ifndef DEBUGGING
29# define DEBUGGING
30# endif
31#endif
32
33#ifdef PERL_IN_XSUB_RE
d06ea78c 34/* We *really* need to overwrite these symbols: */
56953603 35# define Perl_pregcomp my_regcomp
36# define Perl_regdump my_regdump
37# define Perl_regprop my_regprop
d06ea78c 38/* *These* symbols are masked to allow static link. */
39# define Perl_pregfree my_regfree
40# define Perl_regnext my_regnext
f0b8d043 41# define Perl_save_re_context my_save_re_context
d88dccdf 42# define Perl_reginitcolors my_reginitcolors
56953603 43#endif
44
f0fcb552 45/*SUPPRESS 112*/
a687059c 46/*
e50aee73 47 * pregcomp and pregexec -- regsub and regerror are not used in perl
a687059c 48 *
49 * Copyright (c) 1986 by University of Toronto.
50 * Written by Henry Spencer. Not derived from licensed software.
51 *
52 * Permission is granted to anyone to use this software for any
53 * purpose on any computer system, and to redistribute it freely,
54 * subject to the following restrictions:
55 *
56 * 1. The author is not responsible for the consequences of use of
57 * this software, no matter how awful, even if they arise
58 * from defects in it.
59 *
60 * 2. The origin of this software must not be misrepresented, either
61 * by explicit claim or by omission.
62 *
63 * 3. Altered versions must be plainly marked as such, and must not
64 * be misrepresented as being the original software.
65 *
66 *
67 **** Alterations to Henry's code are...
68 ****
a0ed51b3 69 **** Copyright (c) 1991-1998, Larry Wall
a687059c 70 ****
9ef589d8 71 **** You may distribute under the terms of either the GNU General Public
72 **** License or the Artistic License, as specified in the README file.
73
a687059c 74 *
75 * Beware that some of this code is subtly aware of the way operator
76 * precedence is structured in regular expressions. Serious changes in
77 * regular-expression syntax might require a total rethink.
78 */
79#include "EXTERN.h"
80#include "perl.h"
d06ea78c 81
b9d5759e 82#ifndef PERL_IN_XSUB_RE
d06ea78c 83# include "INTERN.h"
84#endif
c277df42 85
86#define REG_COMP_C
a687059c 87#include "regcomp.h"
88
d4cce5f1 89#ifdef op
11343788 90#undef op
d4cce5f1 91#endif /* op */
11343788 92
fe14fcc3 93#ifdef MSDOS
94# if defined(BUGGY_MSC6)
95 /* MSC 6.00A breaks on op/regexp.t test 85 unless we turn this off */
96 # pragma optimize("a",off)
97 /* But MSC 6.00A is happy with 'w', for aliases only across function calls*/
98 # pragma optimize("w",on )
99# endif /* BUGGY_MSC6 */
100#endif /* MSDOS */
101
a687059c 102#ifndef STATIC
103#define STATIC static
104#endif
105
106#define ISMULT1(c) ((c) == '*' || (c) == '+' || (c) == '?')
107#define ISMULT2(s) ((*s) == '*' || (*s) == '+' || (*s) == '?' || \
108 ((*s) == '{' && regcurly(s)))
2b69d0c2 109#ifdef atarist
110#define PERL_META "^$.[()|?+*\\"
111#else
a687059c 112#define META "^$.[()|?+*\\"
2b69d0c2 113#endif
a687059c 114
35c8bce7 115#ifdef SPSTART
116#undef SPSTART /* dratted cpp namespace... */
117#endif
a687059c 118/*
119 * Flags to be passed up and down.
120 */
a687059c 121#define WORST 0 /* Worst case. */
821b33a5 122#define HASWIDTH 0x1 /* Known to match non-null strings. */
a0d0e21e 123#define SIMPLE 0x2 /* Simple enough to be STAR/PLUS operand. */
124#define SPSTART 0x4 /* Starts with * or +. */
125#define TRYAGAIN 0x8 /* Weeded out a declaration. */
a687059c 126
127/*
e50aee73 128 * Forward declarations for pregcomp()'s friends.
a687059c 129 */
a0d0e21e 130
76e3520e 131#ifndef PERL_OBJECT
c277df42 132static regnode *reg _((I32, I32 *));
133static regnode *reganode _((U8, U32));
134static regnode *regatom _((I32 *));
135static regnode *regbranch _((I32 *, I32));
136static void regc _((U8, char *));
a0ed51b3 137static void reguni _((UV, char *, I32*));
c277df42 138static regnode *regclass _((void));
a0ed51b3 139static regnode *regclassutf8 _((void));
a0d0e21e 140STATIC I32 regcurly _((char *));
c277df42 141static regnode *reg_node _((U8));
142static regnode *regpiece _((I32 *));
143static void reginsert _((U8, regnode *));
144static void regoptail _((regnode *, regnode *));
c277df42 145static void regtail _((regnode *, regnode *));
873ef191 146static char* regwhite _((char *, char *));
a0d0e21e 147static char* nextchar _((void));
3bd495df 148static void re_croak2 _((const char* pat1,const char* pat2,...)) __attribute__((noreturn));
76e3520e 149#endif
a687059c 150
c277df42 151/* Length of a variant. */
152
76e3520e 153#ifndef PERL_OBJECT
c277df42 154typedef struct {
155 I32 len_min;
156 I32 len_delta;
a0ed51b3 157 I32 pos_min; /* CC */
158 I32 pos_delta; /* CC */
c277df42 159 SV *last_found;
160 I32 last_end; /* min value, <0 unless valid. */
a0ed51b3 161 I32 last_start_min; /* CC */
162 I32 last_start_max; /* CC */
c277df42 163 SV **longest; /* Either &l_fixed, or &l_float. */
164 SV *longest_fixed;
a0ed51b3 165 I32 offset_fixed; /* CC */
c277df42 166 SV *longest_float;
a0ed51b3 167 I32 offset_float_min; /* CC */
168 I32 offset_float_max; /* CC */
c277df42 169 I32 flags;
170} scan_data_t;
76e3520e 171#endif
c277df42 172
173static scan_data_t zero_scan_data = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
174
175#define SF_BEFORE_EOL (SF_BEFORE_SEOL|SF_BEFORE_MEOL)
176#define SF_BEFORE_SEOL 0x1
177#define SF_BEFORE_MEOL 0x2
178#define SF_FIX_BEFORE_EOL (SF_FIX_BEFORE_SEOL|SF_FIX_BEFORE_MEOL)
179#define SF_FL_BEFORE_EOL (SF_FL_BEFORE_SEOL|SF_FL_BEFORE_MEOL)
180
09b7f37c 181#ifdef NO_UNARY_PLUS
182# define SF_FIX_SHIFT_EOL (0+2)
183# define SF_FL_SHIFT_EOL (0+4)
184#else
185# define SF_FIX_SHIFT_EOL (+2)
186# define SF_FL_SHIFT_EOL (+4)
187#endif
c277df42 188
189#define SF_FIX_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FIX_SHIFT_EOL)
190#define SF_FIX_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FIX_SHIFT_EOL)
191
192#define SF_FL_BEFORE_SEOL (SF_BEFORE_SEOL << SF_FL_SHIFT_EOL)
193#define SF_FL_BEFORE_MEOL (SF_BEFORE_MEOL << SF_FL_SHIFT_EOL) /* 0x20 */
194#define SF_IS_INF 0x40
195#define SF_HAS_PAR 0x80
196#define SF_IN_PAR 0x100
197#define SF_HAS_EVAL 0x200
4bfe0158 198#define SCF_DO_SUBSTR 0x400
c277df42 199
a0ed51b3 200#define RF_utf8 8
201#define UTF (PL_reg_flags & RF_utf8)
202#define LOC (PL_regflags & PMf_LOCALE)
203#define FOLD (PL_regflags & PMf_FOLD)
204
205#define CHR_SVLEN(sv) (UTF ? sv_len_utf8(sv) : SvCUR(sv))
206#define CHR_DIST(a,b) (UTF ? utf8_distance(a,b) : a - b)
207
76e3520e 208STATIC void
c277df42 209scan_commit(scan_data_t *data)
210{
c485e607 211 dTHR;
a0ed51b3 212 STRLEN l = CHR_SVLEN(data->last_found);
213 STRLEN old_l = CHR_SVLEN(*data->longest);
c277df42 214
215 if ((l >= old_l) && ((l > old_l) || (data->flags & SF_BEFORE_EOL))) {
216 sv_setsv(*data->longest, data->last_found);
217 if (*data->longest == data->longest_fixed) {
218 data->offset_fixed = l ? data->last_start_min : data->pos_min;
219 if (data->flags & SF_BEFORE_EOL)
220 data->flags
221 |= ((data->flags & SF_BEFORE_EOL) << SF_FIX_SHIFT_EOL);
222 else
223 data->flags &= ~SF_FIX_BEFORE_EOL;
a0ed51b3 224 }
225 else {
c277df42 226 data->offset_float_min = l ? data->last_start_min : data->pos_min;
227 data->offset_float_max = (l
228 ? data->last_start_max
229 : data->pos_min + data->pos_delta);
230 if (data->flags & SF_BEFORE_EOL)
231 data->flags
232 |= ((data->flags & SF_BEFORE_EOL) << SF_FL_SHIFT_EOL);
233 else
234 data->flags &= ~SF_FL_BEFORE_EOL;
235 }
236 }
237 SvCUR_set(data->last_found, 0);
238 data->last_end = -1;
239 data->flags &= ~SF_BEFORE_EOL;
240}
241
c277df42 242/* Stops at toplevel WHILEM as well as at `last'. At end *scanp is set
243 to the position after last scanned or to NULL. */
244
76e3520e 245STATIC I32
c277df42 246study_chunk(regnode **scanp, I32 *deltap, regnode *last, scan_data_t *data, U32 flags)
247 /* scanp: Start here (read-write). */
248 /* deltap: Write maxlen-minlen here. */
249 /* last: Stop before this one. */
250{
5c0ca799 251 dTHR;
c277df42 252 I32 min = 0, pars = 0, code;
253 regnode *scan = *scanp, *next;
254 I32 delta = 0;
255 int is_inf = (flags & SCF_DO_SUBSTR) && (data->flags & SF_IS_INF);
aca2d497 256 int is_inf_internal = 0; /* The studied chunk is infinite */
c277df42 257 I32 is_par = OP(scan) == OPEN ? ARG(scan) : 0;
258 scan_data_t data_fake;
259
260 while (scan && OP(scan) != END && scan < last) {
261 /* Peephole optimizer: */
262
22c35a8c 263 if (PL_regkind[(U8)OP(scan)] == EXACT) {
c277df42 264 regnode *n = regnext(scan);
265 U32 stringok = 1;
266#ifdef DEBUGGING
267 regnode *stop = scan;
268#endif
269
270 next = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
271 /* Skip NOTHING, merge EXACT*. */
272 while (n &&
22c35a8c 273 ( PL_regkind[(U8)OP(n)] == NOTHING ||
c277df42 274 (stringok && (OP(n) == OP(scan))))
275 && NEXT_OFF(n)
276 && NEXT_OFF(scan) + NEXT_OFF(n) < I16_MAX) {
277 if (OP(n) == TAIL || n > next)
278 stringok = 0;
22c35a8c 279 if (PL_regkind[(U8)OP(n)] == NOTHING) {
c277df42 280 NEXT_OFF(scan) += NEXT_OFF(n);
281 next = n + NODE_STEP_REGNODE;
282#ifdef DEBUGGING
283 if (stringok)
284 stop = n;
285#endif
286 n = regnext(n);
a0ed51b3 287 }
288 else {
c277df42 289 int oldl = *OPERAND(scan);
290 regnode *nnext = regnext(n);
291
292 if (oldl + *OPERAND(n) > U8_MAX)
293 break;
294 NEXT_OFF(scan) += NEXT_OFF(n);
295 *OPERAND(scan) += *OPERAND(n);
296 next = n + (*OPERAND(n) + 2 - 1)/sizeof(regnode) + 2;
297 /* Now we can overwrite *n : */
298 Move(OPERAND(n) + 1, OPERAND(scan) + oldl + 1,
299 *OPERAND(n) + 1, char);
300#ifdef DEBUGGING
301 if (stringok)
302 stop = next - 1;
303#endif
304 n = nnext;
305 }
306 }
307#ifdef DEBUGGING
308 /* Allow dumping */
309 n = scan + (*OPERAND(scan) + 2 - 1)/sizeof(regnode) + 2;
310 while (n <= stop) {
ca04da08 311 /* Purify reports a benign UMR here sometimes, because we
312 * don't initialize the OP() slot of a node when that node
313 * is occupied by just the trailing null of the string in
314 * an EXACT node */
22c35a8c 315 if (PL_regkind[(U8)OP(n)] != NOTHING || OP(n) == NOTHING) {
c277df42 316 OP(n) = OPTIMIZED;
317 NEXT_OFF(n) = 0;
318 }
319 n++;
320 }
321#endif
322
323 }
324 if (OP(scan) != CURLYX) {
048cfca1 325 int max = (reg_off_by_arg[OP(scan)]
326 ? I32_MAX
327 /* I32 may be smaller than U16 on CRAYs! */
328 : (I32_MAX < U16_MAX ? I32_MAX : U16_MAX));
c277df42 329 int off = (reg_off_by_arg[OP(scan)] ? ARG(scan) : NEXT_OFF(scan));
330 int noff;
331 regnode *n = scan;
332
333 /* Skip NOTHING and LONGJMP. */
334 while ((n = regnext(n))
22c35a8c 335 && ((PL_regkind[(U8)OP(n)] == NOTHING && (noff = NEXT_OFF(n)))
c277df42 336 || ((OP(n) == LONGJMP) && (noff = ARG(n))))
337 && off + noff < max)
338 off += noff;
339 if (reg_off_by_arg[OP(scan)])
340 ARG(scan) = off;
341 else
342 NEXT_OFF(scan) = off;
343 }
344 if (OP(scan) == BRANCH || OP(scan) == BRANCHJ
345 || OP(scan) == IFTHEN || OP(scan) == SUSPEND) {
346 next = regnext(scan);
347 code = OP(scan);
348
349 if (OP(next) == code || code == IFTHEN || code == SUSPEND) {
350 I32 max1 = 0, min1 = I32_MAX, num = 0;
351
352 if (flags & SCF_DO_SUBSTR)
353 scan_commit(data);
354 while (OP(scan) == code) {
355 I32 deltanext, minnext;
356
357 num++;
358 data_fake.flags = 0;
359 next = regnext(scan);
360 scan = NEXTOPER(scan);
361 if (code != BRANCH)
362 scan = NEXTOPER(scan);
363 /* We suppose the run is continuous, last=next...*/
364 minnext = study_chunk(&scan, &deltanext, next,
365 &data_fake, 0);
366 if (min1 > minnext)
367 min1 = minnext;
368 if (max1 < minnext + deltanext)
369 max1 = minnext + deltanext;
370 if (deltanext == I32_MAX)
aca2d497 371 is_inf = is_inf_internal = 1;
c277df42 372 scan = next;
373 if (data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
374 pars++;
405ff068 375 if (data && (data_fake.flags & SF_HAS_EVAL))
c277df42 376 data->flags |= SF_HAS_EVAL;
377 if (code == SUSPEND)
378 break;
379 }
380 if (code == IFTHEN && num < 2) /* Empty ELSE branch */
381 min1 = 0;
382 if (flags & SCF_DO_SUBSTR) {
383 data->pos_min += min1;
384 data->pos_delta += max1 - min1;
385 if (max1 != min1 || is_inf)
386 data->longest = &(data->longest_float);
387 }
388 min += min1;
389 delta += max1 - min1;
a0ed51b3 390 }
391 else if (code == BRANCHJ) /* single branch is optimized. */
c277df42 392 scan = NEXTOPER(NEXTOPER(scan));
393 else /* single branch is optimized. */
394 scan = NEXTOPER(scan);
395 continue;
a0ed51b3 396 }
397 else if (OP(scan) == EXACT) {
398 I32 l = *OPERAND(scan);
399 if (UTF) {
400 unsigned char *s = (unsigned char *)(OPERAND(scan)+1);
401 unsigned char *e = s + l;
402 I32 newl = 0;
403 while (s < e) {
404 newl++;
405 s += UTF8SKIP(s);
406 }
407 l = newl;
408 }
409 min += l;
c277df42 410 if (flags & SCF_DO_SUBSTR) { /* Update longest substr. */
c277df42 411 /* The code below prefers earlier match for fixed
412 offset, later match for variable offset. */
413 if (data->last_end == -1) { /* Update the start info. */
414 data->last_start_min = data->pos_min;
415 data->last_start_max = is_inf
416 ? I32_MAX : data->pos_min + data->pos_delta;
417 }
a0ed51b3 418 sv_catpvn(data->last_found, (char *)(OPERAND(scan)+1), *OPERAND(scan));
c277df42 419 data->last_end = data->pos_min + l;
420 data->pos_min += l; /* As in the first entry. */
421 data->flags &= ~SF_BEFORE_EOL;
422 }
a0ed51b3 423 }
22c35a8c 424 else if (PL_regkind[(U8)OP(scan)] == EXACT) {
a0ed51b3 425 I32 l = *OPERAND(scan);
c277df42 426 if (flags & SCF_DO_SUBSTR)
427 scan_commit(data);
a0ed51b3 428 if (UTF) {
429 unsigned char *s = (unsigned char *)(OPERAND(scan)+1);
430 unsigned char *e = s + l;
431 I32 newl = 0;
432 while (s < e) {
433 newl++;
434 s += UTF8SKIP(s);
435 }
436 l = newl;
437 }
438 min += l;
c277df42 439 if (data && (flags & SCF_DO_SUBSTR))
a0ed51b3 440 data->pos_min += l;
441 }
22c35a8c 442 else if (strchr(PL_varies,OP(scan))) {
c277df42 443 I32 mincount, maxcount, minnext, deltanext, pos_before, fl;
444 regnode *oscan = scan;
445
22c35a8c 446 switch (PL_regkind[(U8)OP(scan)]) {
c277df42 447 case WHILEM:
448 scan = NEXTOPER(scan);
449 goto finish;
450 case PLUS:
451 if (flags & SCF_DO_SUBSTR) {
452 next = NEXTOPER(scan);
453 if (OP(next) == EXACT) {
454 mincount = 1;
455 maxcount = REG_INFTY;
456 next = regnext(scan);
457 scan = NEXTOPER(scan);
458 goto do_curly;
459 }
460 }
461 if (flags & SCF_DO_SUBSTR)
462 data->pos_min++;
463 min++;
464 /* Fall through. */
465 case STAR:
aca2d497 466 is_inf = is_inf_internal = 1;
c277df42 467 scan = regnext(scan);
468 if (flags & SCF_DO_SUBSTR) {
469 scan_commit(data);
470 data->longest = &(data->longest_float);
471 }
472 goto optimize_curly_tail;
473 case CURLY:
474 mincount = ARG1(scan);
475 maxcount = ARG2(scan);
476 next = regnext(scan);
477 scan = NEXTOPER(scan) + EXTRA_STEP_2ARGS;
478 do_curly:
479 if (flags & SCF_DO_SUBSTR) {
480 if (mincount == 0) scan_commit(data);
481 pos_before = data->pos_min;
482 }
483 if (data) {
484 fl = data->flags;
485 data->flags &= ~(SF_HAS_PAR|SF_IN_PAR|SF_HAS_EVAL);
486 if (is_inf)
487 data->flags |= SF_IS_INF;
488 }
489 /* This will finish on WHILEM, setting scan, or on NULL: */
490 minnext = study_chunk(&scan, &deltanext, last, data,
491 mincount == 0
492 ? (flags & ~SCF_DO_SUBSTR) : flags);
493 if (!scan) /* It was not CURLYX, but CURLY. */
494 scan = next;
599cee73 495 if (ckWARN(WARN_UNSAFE) && (minnext + deltanext == 0)
821b33a5 496 && !(data->flags & (SF_HAS_PAR|SF_IN_PAR))
17feb5d5 497 && maxcount <= REG_INFTY/3) /* Complement check for big count */
599cee73 498 warner(WARN_UNSAFE, "Strange *+?{} on zero-length expression");
c277df42 499 min += minnext * mincount;
aca2d497 500 is_inf_internal |= (maxcount == REG_INFTY
501 && (minnext + deltanext) > 0
502 || deltanext == I32_MAX);
503 is_inf |= is_inf_internal;
c277df42 504 delta += (minnext + deltanext) * maxcount - minnext * mincount;
505
506 /* Try powerful optimization CURLYX => CURLYN. */
c277df42 507 if ( OP(oscan) == CURLYX && data
508 && data->flags & SF_IN_PAR
509 && !(data->flags & SF_HAS_EVAL)
510 && !deltanext && minnext == 1 ) {
511 /* Try to optimize to CURLYN. */
512 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS;
513 regnode *nxt1 = nxt, *nxt2;
514
515 /* Skip open. */
516 nxt = regnext(nxt);
22c35a8c 517 if (!strchr(PL_simple,OP(nxt))
518 && !(PL_regkind[(U8)OP(nxt)] == EXACT
c277df42 519 && *OPERAND(nxt) == 1))
520 goto nogo;
521 nxt2 = nxt;
522 nxt = regnext(nxt);
523 if (OP(nxt) != CLOSE)
524 goto nogo;
525 /* Now we know that nxt2 is the only contents: */
526 oscan->flags = ARG(nxt);
527 OP(oscan) = CURLYN;
528 OP(nxt1) = NOTHING; /* was OPEN. */
529#ifdef DEBUGGING
530 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
531 NEXT_OFF(nxt1+ 1) = 0; /* just for consistancy. */
532 NEXT_OFF(nxt2) = 0; /* just for consistancy with CURLY. */
533 OP(nxt) = OPTIMIZED; /* was CLOSE. */
534 OP(nxt + 1) = OPTIMIZED; /* was count. */
535 NEXT_OFF(nxt+ 1) = 0; /* just for consistancy. */
536#endif
537 }
c277df42 538 nogo:
539
540 /* Try optimization CURLYX => CURLYM. */
541 if ( OP(oscan) == CURLYX && data
c277df42 542 && !(data->flags & SF_HAS_PAR)
c277df42 543 && !(data->flags & SF_HAS_EVAL)
544 && !deltanext ) {
545 /* XXXX How to optimize if data == 0? */
546 /* Optimize to a simpler form. */
547 regnode *nxt = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN */
548 regnode *nxt2;
549
550 OP(oscan) = CURLYM;
551 while ( (nxt2 = regnext(nxt)) /* skip over embedded stuff*/
552 && (OP(nxt2) != WHILEM))
553 nxt = nxt2;
554 OP(nxt2) = SUCCEED; /* Whas WHILEM */
c277df42 555 /* Need to optimize away parenths. */
556 if (data->flags & SF_IN_PAR) {
557 /* Set the parenth number. */
558 regnode *nxt1 = NEXTOPER(oscan) + EXTRA_STEP_2ARGS; /* OPEN*/
559
560 if (OP(nxt) != CLOSE)
561 FAIL("panic opt close");
562 oscan->flags = ARG(nxt);
563 OP(nxt1) = OPTIMIZED; /* was OPEN. */
564 OP(nxt) = OPTIMIZED; /* was CLOSE. */
565#ifdef DEBUGGING
566 OP(nxt1 + 1) = OPTIMIZED; /* was count. */
567 OP(nxt + 1) = OPTIMIZED; /* was count. */
568 NEXT_OFF(nxt1 + 1) = 0; /* just for consistancy. */
569 NEXT_OFF(nxt + 1) = 0; /* just for consistancy. */
570#endif
571#if 0
572 while ( nxt1 && (OP(nxt1) != WHILEM)) {
573 regnode *nnxt = regnext(nxt1);
574
575 if (nnxt == nxt) {
576 if (reg_off_by_arg[OP(nxt1)])
577 ARG_SET(nxt1, nxt2 - nxt1);
578 else if (nxt2 - nxt1 < U16_MAX)
579 NEXT_OFF(nxt1) = nxt2 - nxt1;
580 else
581 OP(nxt) = NOTHING; /* Cannot beautify */
582 }
583 nxt1 = nnxt;
584 }
585#endif
586 /* Optimize again: */
587 study_chunk(&nxt1, &deltanext, nxt, NULL, 0);
a0ed51b3 588 }
589 else
c277df42 590 oscan->flags = 0;
c277df42 591 }
592 if (data && fl & (SF_HAS_PAR|SF_IN_PAR))
593 pars++;
594 if (flags & SCF_DO_SUBSTR) {
595 SV *last_str = Nullsv;
596 int counted = mincount != 0;
597
598 if (data->last_end > 0 && mincount != 0) { /* Ends with a string. */
599 I32 b = pos_before >= data->last_start_min
600 ? pos_before : data->last_start_min;
601 STRLEN l;
602 char *s = SvPV(data->last_found, l);
a0ed51b3 603 I32 old = b - data->last_start_min;
604
605 if (UTF)
606 old = utf8_hop((U8*)s, old) - (U8*)s;
c277df42 607
a0ed51b3 608 l -= old;
c277df42 609 /* Get the added string: */
a0ed51b3 610 last_str = newSVpv(s + old, l);
c277df42 611 if (deltanext == 0 && pos_before == b) {
612 /* What was added is a constant string */
613 if (mincount > 1) {
614 SvGROW(last_str, (mincount * l) + 1);
615 repeatcpy(SvPVX(last_str) + l,
616 SvPVX(last_str), l, mincount - 1);
617 SvCUR(last_str) *= mincount;
618 /* Add additional parts. */
619 SvCUR_set(data->last_found,
620 SvCUR(data->last_found) - l);
621 sv_catsv(data->last_found, last_str);
622 data->last_end += l * (mincount - 1);
623 }
624 }
625 }
626 /* It is counted once already... */
627 data->pos_min += minnext * (mincount - counted);
628 data->pos_delta += - counted * deltanext +
629 (minnext + deltanext) * maxcount - minnext * mincount;
630 if (mincount != maxcount) {
631 scan_commit(data);
632 if (mincount && last_str) {
633 sv_setsv(data->last_found, last_str);
634 data->last_end = data->pos_min;
635 data->last_start_min =
a0ed51b3 636 data->pos_min - CHR_SVLEN(last_str);
c277df42 637 data->last_start_max = is_inf
638 ? I32_MAX
639 : data->pos_min + data->pos_delta
a0ed51b3 640 - CHR_SVLEN(last_str);
c277df42 641 }
642 data->longest = &(data->longest_float);
643 }
aca2d497 644 SvREFCNT_dec(last_str);
c277df42 645 }
405ff068 646 if (data && (fl & SF_HAS_EVAL))
c277df42 647 data->flags |= SF_HAS_EVAL;
648 optimize_curly_tail:
c277df42 649 if (OP(oscan) != CURLYX) {
22c35a8c 650 while (PL_regkind[(U8)OP(next = regnext(oscan))] == NOTHING
c277df42 651 && NEXT_OFF(next))
652 NEXT_OFF(oscan) += NEXT_OFF(next);
653 }
c277df42 654 continue;
655 default: /* REF only? */
656 if (flags & SCF_DO_SUBSTR) {
657 scan_commit(data);
658 data->longest = &(data->longest_float);
659 }
aca2d497 660 is_inf = is_inf_internal = 1;
c277df42 661 break;
662 }
a0ed51b3 663 }
22c35a8c 664 else if (strchr(PL_simple,OP(scan)) || PL_regkind[(U8)OP(scan)] == ANYUTF8) {
c277df42 665 if (flags & SCF_DO_SUBSTR) {
666 scan_commit(data);
667 data->pos_min++;
668 }
669 min++;
a0ed51b3 670 }
22c35a8c 671 else if (PL_regkind[(U8)OP(scan)] == EOL && flags & SCF_DO_SUBSTR) {
c277df42 672 data->flags |= (OP(scan) == MEOL
673 ? SF_BEFORE_MEOL
674 : SF_BEFORE_SEOL);
a0ed51b3 675 }
22c35a8c 676 else if (PL_regkind[(U8)OP(scan)] == BRANCHJ
c277df42 677 && (scan->flags || data)
678 && (OP(scan) == IFMATCH || OP(scan) == UNLESSM)) {
679 I32 deltanext, minnext;
680 regnode *nscan;
681
682 data_fake.flags = 0;
683 next = regnext(scan);
684 nscan = NEXTOPER(NEXTOPER(scan));
685 minnext = study_chunk(&nscan, &deltanext, last, &data_fake, 0);
686 if (scan->flags) {
687 if (deltanext) {
688 FAIL("variable length lookbehind not implemented");
a0ed51b3 689 }
690 else if (minnext > U8_MAX) {
c277df42 691 FAIL2("lookbehind longer than %d not implemented", U8_MAX);
692 }
693 scan->flags = minnext;
694 }
695 if (data && data_fake.flags & (SF_HAS_PAR|SF_IN_PAR))
696 pars++;
405ff068 697 if (data && (data_fake.flags & SF_HAS_EVAL))
c277df42 698 data->flags |= SF_HAS_EVAL;
a0ed51b3 699 }
700 else if (OP(scan) == OPEN) {
c277df42 701 pars++;
a0ed51b3 702 }
703 else if (OP(scan) == CLOSE && ARG(scan) == is_par) {
c277df42 704 next = regnext(scan);
705
706 if ( next && (OP(next) != WHILEM) && next < last)
c277df42 707 is_par = 0; /* Disable optimization */
a0ed51b3 708 }
709 else if (OP(scan) == EVAL) {
c277df42 710 if (data)
711 data->flags |= SF_HAS_EVAL;
712 }
0f5d15d6 713 else if (OP(scan) == LOGICAL && scan->flags == 2) { /* Embedded */
714 if (flags & SCF_DO_SUBSTR) {
715 scan_commit(data);
716 data->longest = &(data->longest_float);
717 }
718 is_inf = is_inf_internal = 1;
719 }
c277df42 720 /* Else: zero-length, ignore. */
721 scan = regnext(scan);
722 }
723
724 finish:
725 *scanp = scan;
aca2d497 726 *deltap = is_inf_internal ? I32_MAX : delta;
c277df42 727 if (flags & SCF_DO_SUBSTR && is_inf)
728 data->pos_delta = I32_MAX - data->pos_min;
729 if (is_par > U8_MAX)
730 is_par = 0;
731 if (is_par && pars==1 && data) {
732 data->flags |= SF_IN_PAR;
733 data->flags &= ~SF_HAS_PAR;
a0ed51b3 734 }
735 else if (pars && data) {
c277df42 736 data->flags |= SF_HAS_PAR;
737 data->flags &= ~SF_IN_PAR;
738 }
739 return min;
740}
741
76e3520e 742STATIC I32
c277df42 743add_data(I32 n, char *s)
744{
5c0ca799 745 dTHR;
3280af22 746 if (PL_regcomp_rx->data) {
747 Renewc(PL_regcomp_rx->data,
748 sizeof(*PL_regcomp_rx->data) + sizeof(void*) * (PL_regcomp_rx->data->count + n - 1),
c277df42 749 char, struct reg_data);
3280af22 750 Renew(PL_regcomp_rx->data->what, PL_regcomp_rx->data->count + n, U8);
751 PL_regcomp_rx->data->count += n;
a0ed51b3 752 }
753 else {
3280af22 754 Newc(1207, PL_regcomp_rx->data, sizeof(*PL_regcomp_rx->data) + sizeof(void*) * (n - 1),
c277df42 755 char, struct reg_data);
3280af22 756 New(1208, PL_regcomp_rx->data->what, n, U8);
757 PL_regcomp_rx->data->count = n;
c277df42 758 }
3280af22 759 Copy(s, PL_regcomp_rx->data->what + PL_regcomp_rx->data->count - n, n, U8);
760 return PL_regcomp_rx->data->count - n;
c277df42 761}
762
d88dccdf 763void
764reginitcolors(void)
765{
766 dTHR;
767 int i = 0;
768 char *s = PerlEnv_getenv("PERL_RE_COLORS");
769
770 if (s) {
771 PL_colors[0] = s = savepv(s);
772 while (++i < 6) {
773 s = strchr(s, '\t');
774 if (s) {
775 *s = '\0';
776 PL_colors[i] = ++s;
777 }
778 else
779 PL_colors[i] = "";
780 }
781 } else {
782 while (i < 6)
783 PL_colors[i++] = "";
784 }
785 PL_colorset = 1;
786}
787
a687059c 788/*
e50aee73 789 - pregcomp - compile a regular expression into internal code
a687059c 790 *
791 * We can't allocate space until we know how big the compiled form will be,
792 * but we can't compile it (and thus know how big it is) until we've got a
793 * place to put the code. So we cheat: we compile it twice, once with code
794 * generation turned off and size counting turned on, and once "for real".
795 * This also means that we don't allocate space until we are sure that the
796 * thing really will compile successfully, and we never have to move the
797 * code and thus invalidate pointers into it. (Note that it has to be in
798 * one piece because free() must be able to free it all.) [NB: not true in perl]
799 *
800 * Beware that the optimization-preparation code in here knows about some
801 * of the structure of the compiled regexp. [I'll say.]
802 */
803regexp *
8ac85365 804pregcomp(char *exp, char *xend, PMOP *pm)
a687059c 805{
5c0ca799 806 dTHR;
a0d0e21e 807 register regexp *r;
c277df42 808 regnode *scan;
809 SV **longest;
810 SV *longest_fixed;
811 SV *longest_float;
812 regnode *first;
a0d0e21e 813 I32 flags;
a0d0e21e 814 I32 minlen = 0;
815 I32 sawplus = 0;
816 I32 sawopen = 0;
817
818 if (exp == NULL)
c277df42 819 FAIL("NULL regexp argument");
a0d0e21e 820
e24b16f9 821 if (PL_curcop == &PL_compiling ? (PL_hints & HINT_UTF8) : IN_UTF8)
a0ed51b3 822 PL_reg_flags |= RF_utf8;
823 else
824 PL_reg_flags = 0;
825
3280af22 826 PL_regprecomp = savepvn(exp, xend - exp);
8d300b32 827 DEBUG_r(
d88dccdf 828 if (!PL_colorset)
829 reginitcolors();
830 PerlIO_printf(Perl_debug_log, "%sCompiling%s RE `%s%*s%s'\n",
831 PL_colors[4],PL_colors[5],PL_colors[0],
832 xend - exp, PL_regprecomp, PL_colors[1]));
3280af22 833 PL_regflags = pm->op_pmflags;
834 PL_regsawback = 0;
bbce6d69 835
3280af22 836 PL_regseen = 0;
837 PL_seen_zerolen = *exp == '^' ? -1 : 0;
838 PL_seen_evals = 0;
839 PL_extralen = 0;
c277df42 840
bbce6d69 841 /* First pass: determine size, legality. */
3280af22 842 PL_regcomp_parse = exp;
843 PL_regxend = xend;
844 PL_regnaughty = 0;
845 PL_regnpar = 1;
846 PL_regsize = 0L;
847 PL_regcode = &PL_regdummy;
22c35a8c 848 regc((U8)REG_MAGIC, (char*)PL_regcode);
a0d0e21e 849 if (reg(0, &flags) == NULL) {
3280af22 850 Safefree(PL_regprecomp);
851 PL_regprecomp = Nullch;
a0d0e21e 852 return(NULL);
853 }
3280af22 854 DEBUG_r(PerlIO_printf(Perl_debug_log, "size %d ", PL_regsize));
c277df42 855
c277df42 856 /* Small enough for pointer-storage convention?
857 If extralen==0, this means that we will not need long jumps. */
3280af22 858 if (PL_regsize >= 0x10000L && PL_extralen)
859 PL_regsize += PL_extralen;
c277df42 860 else
3280af22 861 PL_extralen = 0;
a0d0e21e 862
bbce6d69 863 /* Allocate space and initialize. */
3280af22 864 Newc(1001, r, sizeof(regexp) + (unsigned)PL_regsize * sizeof(regnode),
c277df42 865 char, regexp);
a0d0e21e 866 if (r == NULL)
867 FAIL("regexp out of space");
c277df42 868 r->refcnt = 1;
bbce6d69 869 r->prelen = xend - exp;
3280af22 870 r->precomp = PL_regprecomp;
a0d0e21e 871 r->subbeg = r->subbase = NULL;
3280af22 872 r->nparens = PL_regnpar - 1; /* set early to validate backrefs */
873 PL_regcomp_rx = r;
bbce6d69 874
875 /* Second pass: emit code. */
3280af22 876 PL_regcomp_parse = exp;
877 PL_regxend = xend;
878 PL_regnaughty = 0;
879 PL_regnpar = 1;
880 PL_regcode = r->program;
2cd61cdb 881 /* Store the count of eval-groups for security checks: */
3280af22 882 PL_regcode->next_off = ((PL_seen_evals > U16_MAX) ? U16_MAX : PL_seen_evals);
22c35a8c 883 regc((U8)REG_MAGIC, (char*) PL_regcode++);
c277df42 884 r->data = 0;
a0d0e21e 885 if (reg(0, &flags) == NULL)
886 return(NULL);
887
888 /* Dig out information for optimizations. */
8782bef2 889 r->reganch = pm->op_pmflags & PMf_COMPILETIME;
3280af22 890 pm->op_pmflags = PL_regflags;
a0ed51b3 891 if (UTF)
892 r->reganch |= ROPT_UTF8;
c277df42 893 r->regstclass = NULL;
a0ed51b3 894 if (PL_regnaughty >= 10) /* Probably an expensive pattern. */
895 r->reganch |= ROPT_NAUGHTY;
c277df42 896 scan = r->program + 1; /* First BRANCH. */
2779dcf1 897
898 /* XXXX To minimize changes to RE engine we always allocate
899 3-units-long substrs field. */
900 Newz(1004, r->substrs, 1, struct reg_substr_data);
901
c277df42 902 if (OP(scan) != BRANCH) { /* Only one top-level choice. */
903 scan_data_t data;
904 I32 fake;
c5254dd6 905 STRLEN longest_float_length, longest_fixed_length;
a0d0e21e 906
c277df42 907 StructCopy(&zero_scan_data, &data, scan_data_t);
a0d0e21e 908 first = scan;
c277df42 909 /* Skip introductions and multiplicators >= 1. */
a0d0e21e 910 while ((OP(first) == OPEN && (sawopen = 1)) ||
911 (OP(first) == BRANCH && OP(regnext(first)) != BRANCH) ||
912 (OP(first) == PLUS) ||
913 (OP(first) == MINMOD) ||
22c35a8c 914 (PL_regkind[(U8)OP(first)] == CURLY && ARG1(first) > 0) ) {
a0d0e21e 915 if (OP(first) == PLUS)
916 sawplus = 1;
917 else
918 first += regarglen[(U8)OP(first)];
919 first = NEXTOPER(first);
a687059c 920 }
921
a0d0e21e 922 /* Starting-point info. */
923 again:
c277df42 924 if (OP(first) == EXACT); /* Empty, get anchored substr later. */
22c35a8c 925 else if (strchr(PL_simple+4,OP(first)))
a0d0e21e 926 r->regstclass = first;
22c35a8c 927 else if (PL_regkind[(U8)OP(first)] == BOUND ||
928 PL_regkind[(U8)OP(first)] == NBOUND)
a0d0e21e 929 r->regstclass = first;
22c35a8c 930 else if (PL_regkind[(U8)OP(first)] == BOL) {
c277df42 931 r->reganch |= (OP(first) == MBOL ? ROPT_ANCH_MBOL: ROPT_ANCH_BOL);
a0d0e21e 932 first = NEXTOPER(first);
774d564b 933 goto again;
934 }
935 else if (OP(first) == GPOS) {
936 r->reganch |= ROPT_ANCH_GPOS;
937 first = NEXTOPER(first);
938 goto again;
a0d0e21e 939 }
940 else if ((OP(first) == STAR &&
22c35a8c 941 PL_regkind[(U8)OP(NEXTOPER(first))] == REG_ANY) &&
a0d0e21e 942 !(r->reganch & ROPT_ANCH) )
943 {
944 /* turn .* into ^.* with an implied $*=1 */
774d564b 945 r->reganch |= ROPT_ANCH_BOL | ROPT_IMPLICIT;
a0d0e21e 946 first = NEXTOPER(first);
774d564b 947 goto again;
a0d0e21e 948 }
3280af22 949 if (sawplus && (!sawopen || !PL_regsawback))
a0d0e21e 950 r->reganch |= ROPT_SKIP; /* x+ must match 1st of run */
951
c277df42 952 /* Scan is after the zeroth branch, first is atomic matcher. */
953 DEBUG_r(PerlIO_printf(Perl_debug_log, "first at %d\n",
954 first - scan + 1));
a0d0e21e 955 /*
956 * If there's something expensive in the r.e., find the
957 * longest literal string that must appear and make it the
958 * regmust. Resolve ties in favor of later strings, since
959 * the regstart check works with the beginning of the r.e.
960 * and avoiding duplication strengthens checking. Not a
961 * strong reason, but sufficient in the absence of others.
962 * [Now we resolve ties in favor of the earlier string if
c277df42 963 * it happens that c_offset_min has been invalidated, since the
a0d0e21e 964 * earlier string may buy us something the later one won't.]
965 */
a0d0e21e 966 minlen = 0;
a687059c 967
c277df42 968 data.longest_fixed = newSVpv("",0);
969 data.longest_float = newSVpv("",0);
970 data.last_found = newSVpv("",0);
971 data.longest = &(data.longest_fixed);
972 first = scan;
973
3280af22 974 minlen = study_chunk(&first, &fake, scan + PL_regsize, /* Up to end */
c277df42 975 &data, SCF_DO_SUBSTR);
3280af22 976 if ( PL_regnpar == 1 && data.longest == &(data.longest_fixed)
c277df42 977 && data.last_start_min == 0 && data.last_end > 0
3280af22 978 && !PL_seen_zerolen
979 && (!(PL_regseen & REG_SEEN_GPOS) || (r->reganch & ROPT_ANCH_GPOS)))
c277df42 980 r->reganch |= ROPT_CHECK_ALL;
981 scan_commit(&data);
982 SvREFCNT_dec(data.last_found);
983
a0ed51b3 984 longest_float_length = CHR_SVLEN(data.longest_float);
c5254dd6 985 if (longest_float_length
c277df42 986 || (data.flags & SF_FL_BEFORE_EOL
987 && (!(data.flags & SF_FL_BEFORE_MEOL)
3280af22 988 || (PL_regflags & PMf_MULTILINE)))) {
a0ed51b3 989 if (SvCUR(data.longest_fixed) /* ok to leave SvCUR */
aca2d497 990 && data.offset_fixed == data.offset_float_min
991 && SvCUR(data.longest_fixed) == SvCUR(data.longest_float))
992 goto remove_float; /* As in (a)+. */
993
c277df42 994 r->float_substr = data.longest_float;
995 r->float_min_offset = data.offset_float_min;
996 r->float_max_offset = data.offset_float_max;
2779dcf1 997 fbm_compile(r->float_substr, 0);
c277df42 998 BmUSEFUL(r->float_substr) = 100;
999 if (data.flags & SF_FL_BEFORE_EOL /* Cannot have SEOL and MULTI */
1000 && (!(data.flags & SF_FL_BEFORE_MEOL)
3280af22 1001 || (PL_regflags & PMf_MULTILINE)))
c277df42 1002 SvTAIL_on(r->float_substr);
a0ed51b3 1003 }
1004 else {
aca2d497 1005 remove_float:
c277df42 1006 r->float_substr = Nullsv;
1007 SvREFCNT_dec(data.longest_float);
c5254dd6 1008 longest_float_length = 0;
a0d0e21e 1009 }
c277df42 1010
a0ed51b3 1011 longest_fixed_length = CHR_SVLEN(data.longest_fixed);
c5254dd6 1012 if (longest_fixed_length
c277df42 1013 || (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
1014 && (!(data.flags & SF_FIX_BEFORE_MEOL)
3280af22 1015 || (PL_regflags & PMf_MULTILINE)))) {
c277df42 1016 r->anchored_substr = data.longest_fixed;
1017 r->anchored_offset = data.offset_fixed;
2779dcf1 1018 fbm_compile(r->anchored_substr, 0);
c277df42 1019 BmUSEFUL(r->anchored_substr) = 100;
1020 if (data.flags & SF_FIX_BEFORE_EOL /* Cannot have SEOL and MULTI */
1021 && (!(data.flags & SF_FIX_BEFORE_MEOL)
3280af22 1022 || (PL_regflags & PMf_MULTILINE)))
c277df42 1023 SvTAIL_on(r->anchored_substr);
a0ed51b3 1024 }
1025 else {
c277df42 1026 r->anchored_substr = Nullsv;
1027 SvREFCNT_dec(data.longest_fixed);
c5254dd6 1028 longest_fixed_length = 0;
a0d0e21e 1029 }
c277df42 1030
1031 /* A temporary algorithm prefers floated substr to fixed one to dig more info. */
c5254dd6 1032 if (longest_fixed_length > longest_float_length) {
c277df42 1033 r->check_substr = r->anchored_substr;
1034 r->check_offset_min = r->check_offset_max = r->anchored_offset;
1035 if (r->reganch & ROPT_ANCH_SINGLE)
1036 r->reganch |= ROPT_NOSCAN;
a0ed51b3 1037 }
1038 else {
c277df42 1039 r->check_substr = r->float_substr;
1040 r->check_offset_min = data.offset_float_min;
1041 r->check_offset_max = data.offset_float_max;
a0d0e21e 1042 }
a0ed51b3 1043 }
1044 else {
c277df42 1045 /* Several toplevels. Best we can is to set minlen. */
1046 I32 fake;
1047
1048 DEBUG_r(PerlIO_printf(Perl_debug_log, "\n"));
1049 scan = r->program + 1;
3280af22 1050 minlen = study_chunk(&scan, &fake, scan + PL_regsize, NULL, 0);
c277df42 1051 r->check_substr = r->anchored_substr = r->float_substr = Nullsv;
a0d0e21e 1052 }
1053
a0d0e21e 1054 r->minlen = minlen;
3280af22 1055 if (PL_regseen & REG_SEEN_GPOS)
c277df42 1056 r->reganch |= ROPT_GPOS_SEEN;
3280af22 1057 if (PL_regseen & REG_SEEN_LOOKBEHIND)
c277df42 1058 r->reganch |= ROPT_LOOKBEHIND_SEEN;
3280af22 1059 if (PL_regseen & REG_SEEN_EVAL)
ce862d02 1060 r->reganch |= ROPT_EVAL_SEEN;
3280af22 1061 Newz(1002, r->startp, PL_regnpar, char*);
1062 Newz(1002, r->endp, PL_regnpar, char*);
a0d0e21e 1063 DEBUG_r(regdump(r));
1064 return(r);
a687059c 1065}
1066
1067/*
1068 - reg - regular expression, i.e. main body or parenthesized thing
1069 *
1070 * Caller must absorb opening parenthesis.
1071 *
1072 * Combining parenthesis handling with the base level of regular expression
1073 * is a trifle forced, but the need to tie the tails of the branches to what
1074 * follows makes it hard to avoid.
1075 */
76e3520e 1076STATIC regnode *
8ac85365 1077reg(I32 paren, I32 *flagp)
c277df42 1078 /* paren: Parenthesized? 0=top, 1=(, inside: changed to letter. */
a687059c 1079{
5c0ca799 1080 dTHR;
c277df42 1081 register regnode *ret; /* Will be the head of the group. */
1082 register regnode *br;
1083 register regnode *lastbr;
1084 register regnode *ender = 0;
a0d0e21e 1085 register I32 parno = 0;
3280af22 1086 I32 flags, oregflags = PL_regflags, have_branch = 0, open = 0;
c277df42 1087 char c;
a0d0e21e 1088
821b33a5 1089 *flagp = 0; /* Tentatively. */
a0d0e21e 1090
1091 /* Make an OPEN node, if parenthesized. */
1092 if (paren) {
3280af22 1093 if (*PL_regcomp_parse == '?') {
ca9dfc88 1094 U16 posflags = 0, negflags = 0;
1095 U16 *flagsp = &posflags;
0f5d15d6 1096 int logical = 0;
ca9dfc88 1097
3280af22 1098 PL_regcomp_parse++;
1099 paren = *PL_regcomp_parse++;
c277df42 1100 ret = NULL; /* For look-ahead/behind. */
a0d0e21e 1101 switch (paren) {
c277df42 1102 case '<':
3280af22 1103 PL_regseen |= REG_SEEN_LOOKBEHIND;
1104 if (*PL_regcomp_parse == '!')
c277df42 1105 paren = ',';
3280af22 1106 if (*PL_regcomp_parse != '=' && *PL_regcomp_parse != '!')
c277df42 1107 goto unknown;
3280af22 1108 PL_regcomp_parse++;
a0d0e21e 1109 case '=':
1110 case '!':
3280af22 1111 PL_seen_zerolen++;
c277df42 1112 case ':':
1113 case '>':
a0d0e21e 1114 break;
1115 case '$':
1116 case '@':
c277df42 1117 FAIL2("Sequence (?%c...) not implemented", (int)paren);
a0d0e21e 1118 break;
1119 case '#':
3280af22 1120 while (*PL_regcomp_parse && *PL_regcomp_parse != ')')
1121 PL_regcomp_parse++;
1122 if (*PL_regcomp_parse != ')')
c277df42 1123 FAIL("Sequence (?#... not terminated");
a0d0e21e 1124 nextchar();
1125 *flagp = TRYAGAIN;
1126 return NULL;
0f5d15d6 1127 case 'p':
1128 logical = 1;
1129 paren = *PL_regcomp_parse++;
1130 /* FALL THROUGH */
c277df42 1131 case '{':
1132 {
1133 dTHR;
1134 I32 count = 1, n = 0;
1135 char c;
3280af22 1136 char *s = PL_regcomp_parse;
c277df42 1137 SV *sv;
1138 OP_4tree *sop, *rop;
1139
3280af22 1140 PL_seen_zerolen++;
1141 PL_regseen |= REG_SEEN_EVAL;
1142 while (count && (c = *PL_regcomp_parse)) {
1143 if (c == '\\' && PL_regcomp_parse[1])
1144 PL_regcomp_parse++;
c277df42 1145 else if (c == '{')
1146 count++;
1147 else if (c == '}')
1148 count--;
3280af22 1149 PL_regcomp_parse++;
c277df42 1150 }
3280af22 1151 if (*PL_regcomp_parse != ')')
c277df42 1152 FAIL("Sequence (?{...}) not terminated or not {}-balanced");
1153 if (!SIZE_ONLY) {
1154 AV *av;
1155
3280af22 1156 if (PL_regcomp_parse - 1 - s)
1157 sv = newSVpv(s, PL_regcomp_parse - 1 - s);
c277df42 1158 else
1159 sv = newSVpv("", 0);
1160
1161 rop = sv_compile_2op(sv, &sop, "re", &av);
1162
1163 n = add_data(3, "nso");
3280af22 1164 PL_regcomp_rx->data->data[n] = (void*)rop;
1165 PL_regcomp_rx->data->data[n+1] = (void*)av;
1166 PL_regcomp_rx->data->data[n+2] = (void*)sop;
c277df42 1167 SvREFCNT_dec(sv);
a0ed51b3 1168 }
e24b16f9 1169 else { /* First pass */
1170 if (PL_reginterp_cnt < ++PL_seen_evals
1171 && PL_curcop != &PL_compiling)
2cd61cdb 1172 /* No compiled RE interpolated, has runtime
1173 components ===> unsafe. */
1174 FAIL("Eval-group not allowed at runtime, use re 'eval'");
3280af22 1175 if (PL_tainted)
cc6b7395 1176 FAIL("Eval-group in insecure regular expression");
c277df42 1177 }
1178
1179 nextchar();
0f5d15d6 1180 if (logical) {
1181 ret = reg_node(LOGICAL);
1182 if (!SIZE_ONLY)
1183 ret->flags = 2;
1184 regtail(ret, reganode(EVAL, n));
1185 return ret;
1186 }
c277df42 1187 return reganode(EVAL, n);
1188 }
1189 case '(':
1190 {
3280af22 1191 if (PL_regcomp_parse[0] == '?') {
1192 if (PL_regcomp_parse[1] == '=' || PL_regcomp_parse[1] == '!'
1193 || PL_regcomp_parse[1] == '<'
1194 || PL_regcomp_parse[1] == '{') { /* Lookahead or eval. */
c277df42 1195 I32 flag;
1196
1197 ret = reg_node(LOGICAL);
0f5d15d6 1198 if (!SIZE_ONLY)
1199 ret->flags = 1;
c277df42 1200 regtail(ret, reg(1, &flag));
1201 goto insert_if;
1202 }
a0ed51b3 1203 }
1204 else if (PL_regcomp_parse[0] >= '1' && PL_regcomp_parse[0] <= '9' ) {
3280af22 1205 parno = atoi(PL_regcomp_parse++);
c277df42 1206
3280af22 1207 while (isDIGIT(*PL_regcomp_parse))
1208 PL_regcomp_parse++;
c277df42 1209 ret = reganode(GROUPP, parno);
1210 if ((c = *nextchar()) != ')')
1211 FAIL2("Switch (?(number%c not recognized", c);
1212 insert_if:
1213 regtail(ret, reganode(IFTHEN, 0));
1214 br = regbranch(&flags, 1);
1215 if (br == NULL)
1216 br = reganode(LONGJMP, 0);
1217 else
1218 regtail(br, reganode(LONGJMP, 0));
1219 c = *nextchar();
d1b80229 1220 if (flags&HASWIDTH)
1221 *flagp |= HASWIDTH;
c277df42 1222 if (c == '|') {
1223 lastbr = reganode(IFTHEN, 0); /* Fake one for optimizer. */
1224 regbranch(&flags, 1);
1225 regtail(ret, lastbr);
d1b80229 1226 if (flags&HASWIDTH)
1227 *flagp |= HASWIDTH;
c277df42 1228 c = *nextchar();
a0ed51b3 1229 }
1230 else
c277df42 1231 lastbr = NULL;
1232 if (c != ')')
1233 FAIL("Switch (?(condition)... contains too many branches");
1234 ender = reg_node(TAIL);
1235 regtail(br, ender);
1236 if (lastbr) {
1237 regtail(lastbr, ender);
1238 regtail(NEXTOPER(NEXTOPER(lastbr)), ender);
a0ed51b3 1239 }
1240 else
c277df42 1241 regtail(ret, ender);
1242 return ret;
a0ed51b3 1243 }
1244 else {
3280af22 1245 FAIL2("Unknown condition for (?(%.2s", PL_regcomp_parse);
c277df42 1246 }
1247 }
1b1626e4 1248 case 0:
c277df42 1249 FAIL("Sequence (? incomplete");
1b1626e4 1250 break;
a0d0e21e 1251 default:
3280af22 1252 --PL_regcomp_parse;
ca9dfc88 1253 parse_flags:
3280af22 1254 while (*PL_regcomp_parse && strchr("iogcmsx", *PL_regcomp_parse)) {
1255 if (*PL_regcomp_parse != 'o')
1256 pmflag(flagsp, *PL_regcomp_parse);
1257 ++PL_regcomp_parse;
ca9dfc88 1258 }
3280af22 1259 if (*PL_regcomp_parse == '-') {
ca9dfc88 1260 flagsp = &negflags;
3280af22 1261 ++PL_regcomp_parse;
ca9dfc88 1262 goto parse_flags;
48c036b1 1263 }
3280af22 1264 PL_regflags |= posflags;
1265 PL_regflags &= ~negflags;
1266 if (*PL_regcomp_parse == ':') {
1267 PL_regcomp_parse++;
ca9dfc88 1268 paren = ':';
1269 break;
1270 }
c277df42 1271 unknown:
3280af22 1272 if (*PL_regcomp_parse != ')')
1273 FAIL2("Sequence (?%c...) not recognized", *PL_regcomp_parse);
a0d0e21e 1274 nextchar();
1275 *flagp = TRYAGAIN;
1276 return NULL;
1277 }
1278 }
1279 else {
3280af22 1280 parno = PL_regnpar;
1281 PL_regnpar++;
a0d0e21e 1282 ret = reganode(OPEN, parno);
c277df42 1283 open = 1;
a0d0e21e 1284 }
a0ed51b3 1285 }
1286 else
a0d0e21e 1287 ret = NULL;
1288
1289 /* Pick up the branches, linking them together. */
c277df42 1290 br = regbranch(&flags, 1);
a0d0e21e 1291 if (br == NULL)
1292 return(NULL);
3280af22 1293 if (*PL_regcomp_parse == '|') {
1294 if (!SIZE_ONLY && PL_extralen) {
c277df42 1295 reginsert(BRANCHJ, br);
a0ed51b3 1296 }
1297 else
c277df42 1298 reginsert(BRANCH, br);
1299 have_branch = 1;
1300 if (SIZE_ONLY)
3280af22 1301 PL_extralen += 1; /* For BRANCHJ-BRANCH. */
a0ed51b3 1302 }
1303 else if (paren == ':') {
c277df42 1304 *flagp |= flags&SIMPLE;
1305 }
1306 if (open) { /* Starts with OPEN. */
1307 regtail(ret, br); /* OPEN -> first. */
a0ed51b3 1308 }
1309 else if (paren != '?') /* Not Conditional */
a0d0e21e 1310 ret = br;
821b33a5 1311 if (flags&HASWIDTH)
1312 *flagp |= HASWIDTH;
a0d0e21e 1313 *flagp |= flags&SPSTART;
c277df42 1314 lastbr = br;
3280af22 1315 while (*PL_regcomp_parse == '|') {
1316 if (!SIZE_ONLY && PL_extralen) {
c277df42 1317 ender = reganode(LONGJMP,0);
1318 regtail(NEXTOPER(NEXTOPER(lastbr)), ender); /* Append to the previous. */
1319 }
1320 if (SIZE_ONLY)
3280af22 1321 PL_extralen += 2; /* Account for LONGJMP. */
a0d0e21e 1322 nextchar();
c277df42 1323 br = regbranch(&flags, 0);
a687059c 1324 if (br == NULL)
a0d0e21e 1325 return(NULL);
c277df42 1326 regtail(lastbr, br); /* BRANCH -> BRANCH. */
1327 lastbr = br;
821b33a5 1328 if (flags&HASWIDTH)
1329 *flagp |= HASWIDTH;
a687059c 1330 *flagp |= flags&SPSTART;
a0d0e21e 1331 }
1332
c277df42 1333 if (have_branch || paren != ':') {
1334 /* Make a closing node, and hook it on the end. */
1335 switch (paren) {
1336 case ':':
1337 ender = reg_node(TAIL);
1338 break;
1339 case 1:
1340 ender = reganode(CLOSE, parno);
1341 break;
1342 case '<':
c277df42 1343 case ',':
1344 case '=':
1345 case '!':
c277df42 1346 *flagp &= ~HASWIDTH;
821b33a5 1347 /* FALL THROUGH */
1348 case '>':
1349 ender = reg_node(SUCCEED);
c277df42 1350 break;
1351 case 0:
1352 ender = reg_node(END);
1353 break;
1354 }
1355 regtail(lastbr, ender);
a0d0e21e 1356
c277df42 1357 if (have_branch) {
1358 /* Hook the tails of the branches to the closing node. */
1359 for (br = ret; br != NULL; br = regnext(br)) {
1360 regoptail(br, ender);
1361 }
1362 }
a0d0e21e 1363 }
c277df42 1364
1365 {
1366 char *p;
1367 static char parens[] = "=!<,>";
1368
1369 if (paren && (p = strchr(parens, paren))) {
1370 int node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
1371 int flag = (p - parens) > 1;
1372
1373 if (paren == '>')
1374 node = SUSPEND, flag = 0;
1375 reginsert(node,ret);
c277df42 1376 ret->flags = flag;
c277df42 1377 regtail(ret, reg_node(TAIL));
1378 }
a0d0e21e 1379 }
1380
1381 /* Check for proper termination. */
3280af22 1382 if (paren && (PL_regcomp_parse >= PL_regxend || *nextchar() != ')')) {
a0d0e21e 1383 FAIL("unmatched () in regexp");
a0ed51b3 1384 }
1385 else if (!paren && PL_regcomp_parse < PL_regxend) {
3280af22 1386 if (*PL_regcomp_parse == ')') {
a0d0e21e 1387 FAIL("unmatched () in regexp");
a0ed51b3 1388 }
1389 else
a0d0e21e 1390 FAIL("junk on end of regexp"); /* "Can't happen". */
1391 /* NOTREACHED */
1392 }
c277df42 1393 if (paren != 0) {
3280af22 1394 PL_regflags = oregflags;
c277df42 1395 }
a687059c 1396
a0d0e21e 1397 return(ret);
a687059c 1398}
1399
1400/*
1401 - regbranch - one alternative of an | operator
1402 *
1403 * Implements the concatenation operator.
1404 */
76e3520e 1405STATIC regnode *
c277df42 1406regbranch(I32 *flagp, I32 first)
a687059c 1407{
5c0ca799 1408 dTHR;
c277df42 1409 register regnode *ret;
1410 register regnode *chain = NULL;
1411 register regnode *latest;
1412 I32 flags = 0, c = 0;
a0d0e21e 1413
c277df42 1414 if (first)
1415 ret = NULL;
1416 else {
3280af22 1417 if (!SIZE_ONLY && PL_extralen)
c277df42 1418 ret = reganode(BRANCHJ,0);
1419 else
1420 ret = reg_node(BRANCH);
1421 }
1422
1423 if (!first && SIZE_ONLY)
3280af22 1424 PL_extralen += 1; /* BRANCHJ */
c277df42 1425
1426 *flagp = WORST; /* Tentatively. */
a0d0e21e 1427
3280af22 1428 PL_regcomp_parse--;
a0d0e21e 1429 nextchar();
3280af22 1430 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '|' && *PL_regcomp_parse != ')') {
a0d0e21e 1431 flags &= ~TRYAGAIN;
1432 latest = regpiece(&flags);
1433 if (latest == NULL) {
1434 if (flags & TRYAGAIN)
1435 continue;
1436 return(NULL);
a0ed51b3 1437 }
1438 else if (ret == NULL)
c277df42 1439 ret = latest;
a0d0e21e 1440 *flagp |= flags&HASWIDTH;
c277df42 1441 if (chain == NULL) /* First piece. */
a0d0e21e 1442 *flagp |= flags&SPSTART;
1443 else {
3280af22 1444 PL_regnaughty++;
a0d0e21e 1445 regtail(chain, latest);
a687059c 1446 }
a0d0e21e 1447 chain = latest;
c277df42 1448 c++;
1449 }
1450 if (chain == NULL) { /* Loop ran zero times. */
1451 chain = reg_node(NOTHING);
1452 if (ret == NULL)
1453 ret = chain;
1454 }
1455 if (c == 1) {
1456 *flagp |= flags&SIMPLE;
a0d0e21e 1457 }
a687059c 1458
a0d0e21e 1459 return(ret);
a687059c 1460}
1461
1462/*
1463 - regpiece - something followed by possible [*+?]
1464 *
1465 * Note that the branching code sequences used for ? and the general cases
1466 * of * and + are somewhat optimized: they use the same NOTHING node as
1467 * both the endmarker for their branch list and the body of the last branch.
1468 * It might seem that this node could be dispensed with entirely, but the
1469 * endmarker role is not redundant.
1470 */
76e3520e 1471STATIC regnode *
8ac85365 1472regpiece(I32 *flagp)
a687059c 1473{
5c0ca799 1474 dTHR;
c277df42 1475 register regnode *ret;
a0d0e21e 1476 register char op;
1477 register char *next;
1478 I32 flags;
3280af22 1479 char *origparse = PL_regcomp_parse;
a0d0e21e 1480 char *maxpos;
1481 I32 min;
c277df42 1482 I32 max = REG_INFTY;
a0d0e21e 1483
1484 ret = regatom(&flags);
1485 if (ret == NULL) {
1486 if (flags & TRYAGAIN)
1487 *flagp |= TRYAGAIN;
1488 return(NULL);
1489 }
1490
3280af22 1491 op = *PL_regcomp_parse;
a0d0e21e 1492
3280af22 1493 if (op == '{' && regcurly(PL_regcomp_parse)) {
1494 next = PL_regcomp_parse + 1;
a0d0e21e 1495 maxpos = Nullch;
1496 while (isDIGIT(*next) || *next == ',') {
1497 if (*next == ',') {
1498 if (maxpos)
1499 break;
1500 else
1501 maxpos = next;
a687059c 1502 }
a0d0e21e 1503 next++;
1504 }
1505 if (*next == '}') { /* got one */
1506 if (!maxpos)
1507 maxpos = next;
3280af22 1508 PL_regcomp_parse++;
1509 min = atoi(PL_regcomp_parse);
a0d0e21e 1510 if (*maxpos == ',')
1511 maxpos++;
1512 else
3280af22 1513 maxpos = PL_regcomp_parse;
a0d0e21e 1514 max = atoi(maxpos);
1515 if (!max && *maxpos != '0')
c277df42 1516 max = REG_INFTY; /* meaning "infinity" */
1517 else if (max >= REG_INFTY)
1518 FAIL2("Quantifier in {,} bigger than %d", REG_INFTY - 1);
3280af22 1519 PL_regcomp_parse = next;
a0d0e21e 1520 nextchar();
1521
1522 do_curly:
1523 if ((flags&SIMPLE)) {
3280af22 1524 PL_regnaughty += 2 + PL_regnaughty / 2;
a0d0e21e 1525 reginsert(CURLY, ret);
1526 }
1527 else {
3280af22 1528 PL_regnaughty += 4 + PL_regnaughty; /* compound interest */
c277df42 1529 regtail(ret, reg_node(WHILEM));
3280af22 1530 if (!SIZE_ONLY && PL_extralen) {
c277df42 1531 reginsert(LONGJMP,ret);
1532 reginsert(NOTHING,ret);
1533 NEXT_OFF(ret) = 3; /* Go over LONGJMP. */
1534 }
a0d0e21e 1535 reginsert(CURLYX,ret);
3280af22 1536 if (!SIZE_ONLY && PL_extralen)
c277df42 1537 NEXT_OFF(ret) = 3; /* Go over NOTHING to LONGJMP. */
1538 regtail(ret, reg_node(NOTHING));
1539 if (SIZE_ONLY)
3280af22 1540 PL_extralen += 3;
a0d0e21e 1541 }
c277df42 1542 ret->flags = 0;
a0d0e21e 1543
1544 if (min > 0)
821b33a5 1545 *flagp = WORST;
1546 if (max > 0)
1547 *flagp |= HASWIDTH;
a0d0e21e 1548 if (max && max < min)
c277df42 1549 FAIL("Can't do {n,m} with n > m");
1550 if (!SIZE_ONLY) {
1551 ARG1_SET(ret, min);
1552 ARG2_SET(ret, max);
a687059c 1553 }
a687059c 1554
a0d0e21e 1555 goto nest_check;
a687059c 1556 }
a0d0e21e 1557 }
a687059c 1558
a0d0e21e 1559 if (!ISMULT1(op)) {
1560 *flagp = flags;
a687059c 1561 return(ret);
a0d0e21e 1562 }
bb20fd44 1563
c277df42 1564#if 0 /* Now runtime fix should be reliable. */
bb20fd44 1565 if (!(flags&HASWIDTH) && op != '?')
c277df42 1566 FAIL("regexp *+ operand could be empty");
1567#endif
bb20fd44 1568
a0d0e21e 1569 nextchar();
1570
821b33a5 1571 *flagp = (op != '+') ? (WORST|SPSTART|HASWIDTH) : (WORST|HASWIDTH);
a0d0e21e 1572
1573 if (op == '*' && (flags&SIMPLE)) {
1574 reginsert(STAR, ret);
c277df42 1575 ret->flags = 0;
3280af22 1576 PL_regnaughty += 4;
a0d0e21e 1577 }
1578 else if (op == '*') {
1579 min = 0;
1580 goto do_curly;
a0ed51b3 1581 }
1582 else if (op == '+' && (flags&SIMPLE)) {
a0d0e21e 1583 reginsert(PLUS, ret);
c277df42 1584 ret->flags = 0;
3280af22 1585 PL_regnaughty += 3;
a0d0e21e 1586 }
1587 else if (op == '+') {
1588 min = 1;
1589 goto do_curly;
a0ed51b3 1590 }
1591 else if (op == '?') {
a0d0e21e 1592 min = 0; max = 1;
1593 goto do_curly;
1594 }
1595 nest_check:
17feb5d5 1596 if (ckWARN(WARN_UNSAFE) && !SIZE_ONLY && !(flags&HASWIDTH) && max > REG_INFTY/3) {
599cee73 1597 warner(WARN_UNSAFE, "%.*s matches null string many times",
3280af22 1598 PL_regcomp_parse - origparse, origparse);
a0d0e21e 1599 }
1600
3280af22 1601 if (*PL_regcomp_parse == '?') {
a0d0e21e 1602 nextchar();
1603 reginsert(MINMOD, ret);
c277df42 1604 regtail(ret, ret + NODE_STEP_REGNODE);
a0d0e21e 1605 }
3280af22 1606 if (ISMULT2(PL_regcomp_parse))
a0d0e21e 1607 FAIL("nested *?+ in regexp");
1608
1609 return(ret);
a687059c 1610}
1611
1612/*
1613 - regatom - the lowest level
1614 *
1615 * Optimization: gobbles an entire sequence of ordinary characters so that
1616 * it can turn them into a single node, which is smaller to store and
1617 * faster to run. Backslashed characters are exceptions, each becoming a
1618 * separate node; the code is simpler that way and it's not worth fixing.
1619 *
1620 * [Yes, it is worth fixing, some scripts can run twice the speed.]
1621 */
76e3520e 1622STATIC regnode *
8ac85365 1623regatom(I32 *flagp)
a687059c 1624{
5c0ca799 1625 dTHR;
c277df42 1626 register regnode *ret = 0;
a0d0e21e 1627 I32 flags;
1628
1629 *flagp = WORST; /* Tentatively. */
1630
1631tryagain:
3280af22 1632 switch (*PL_regcomp_parse) {
a0d0e21e 1633 case '^':
3280af22 1634 PL_seen_zerolen++;
a0d0e21e 1635 nextchar();
3280af22 1636 if (PL_regflags & PMf_MULTILINE)
c277df42 1637 ret = reg_node(MBOL);
3280af22 1638 else if (PL_regflags & PMf_SINGLELINE)
c277df42 1639 ret = reg_node(SBOL);
a0d0e21e 1640 else
c277df42 1641 ret = reg_node(BOL);
a0d0e21e 1642 break;
1643 case '$':
3280af22 1644 if (PL_regcomp_parse[1])
1645 PL_seen_zerolen++;
a0d0e21e 1646 nextchar();
3280af22 1647 if (PL_regflags & PMf_MULTILINE)
c277df42 1648 ret = reg_node(MEOL);
3280af22 1649 else if (PL_regflags & PMf_SINGLELINE)
c277df42 1650 ret = reg_node(SEOL);
a0d0e21e 1651 else
c277df42 1652 ret = reg_node(EOL);
a0d0e21e 1653 break;
1654 case '.':
1655 nextchar();
a0ed51b3 1656 if (UTF) {
1657 if (PL_regflags & PMf_SINGLELINE)
1658 ret = reg_node(SANYUTF8);
1659 else
1660 ret = reg_node(ANYUTF8);
1661 *flagp |= HASWIDTH;
1662 }
1663 else {
1664 if (PL_regflags & PMf_SINGLELINE)
1665 ret = reg_node(SANY);
1666 else
22c35a8c 1667 ret = reg_node(REG_ANY);
a0ed51b3 1668 *flagp |= HASWIDTH|SIMPLE;
1669 }
3280af22 1670 PL_regnaughty++;
a0d0e21e 1671 break;
1672 case '[':
3280af22 1673 PL_regcomp_parse++;
a0ed51b3 1674 ret = (UTF ? regclassutf8() : regclass());
a14b48bc 1675 if (*PL_regcomp_parse != ']')
1676 FAIL("unmatched [] in regexp");
1677 nextchar();
a0d0e21e 1678 *flagp |= HASWIDTH|SIMPLE;
1679 break;
1680 case '(':
1681 nextchar();
1682 ret = reg(1, &flags);
1683 if (ret == NULL) {
1684 if (flags & TRYAGAIN)
1685 goto tryagain;
1686 return(NULL);
1687 }
c277df42 1688 *flagp |= flags&(HASWIDTH|SPSTART|SIMPLE);
a0d0e21e 1689 break;
1690 case '|':
1691 case ')':
1692 if (flags & TRYAGAIN) {
1693 *flagp |= TRYAGAIN;
1694 return NULL;
1695 }
3280af22 1696 FAIL2("internal urp in regexp at /%s/", PL_regcomp_parse);
a0d0e21e 1697 /* Supposed to be caught earlier. */
1698 break;
85afd4ae 1699 case '{':
3280af22 1700 if (!regcurly(PL_regcomp_parse)) {
1701 PL_regcomp_parse++;
85afd4ae 1702 goto defchar;
1703 }
1704 /* FALL THROUGH */
a0d0e21e 1705 case '?':
1706 case '+':
1707 case '*':
3115e423 1708 FAIL("?+*{} follows nothing in regexp");
a0d0e21e 1709 break;
1710 case '\\':
3280af22 1711 switch (*++PL_regcomp_parse) {
a0d0e21e 1712 case 'A':
3280af22 1713 PL_seen_zerolen++;
c277df42 1714 ret = reg_node(SBOL);
a0d0e21e 1715 *flagp |= SIMPLE;
1716 nextchar();
1717 break;
1718 case 'G':
c277df42 1719 ret = reg_node(GPOS);
3280af22 1720 PL_regseen |= REG_SEEN_GPOS;
a0d0e21e 1721 *flagp |= SIMPLE;
1722 nextchar();
1723 break;
1724 case 'Z':
c277df42 1725 ret = reg_node(SEOL);
a0d0e21e 1726 *flagp |= SIMPLE;
1727 nextchar();
1728 break;
b85d18e9 1729 case 'z':
1730 ret = reg_node(EOS);
1731 *flagp |= SIMPLE;
3280af22 1732 PL_seen_zerolen++; /* Do not optimize RE away */
b85d18e9 1733 nextchar();
1734 break;
a0ed51b3 1735 case 'C':
1736 ret = reg_node(SANY);
1737 *flagp |= HASWIDTH|SIMPLE;
1738 nextchar();
1739 break;
1740 case 'X':
1741 ret = reg_node(CLUMP);
1742 *flagp |= HASWIDTH;
1743 nextchar();
1744 if (UTF && !PL_utf8_mark)
dfe13c55 1745 is_utf8_mark((U8*)"~"); /* preload table */
a0ed51b3 1746 break;
a0d0e21e 1747 case 'w':
a0ed51b3 1748 ret = reg_node(
1749 UTF
1750 ? (LOC ? ALNUMLUTF8 : ALNUMUTF8)
1751 : (LOC ? ALNUML : ALNUM));
a0d0e21e 1752 *flagp |= HASWIDTH|SIMPLE;
1753 nextchar();
a0ed51b3 1754 if (UTF && !PL_utf8_alnum)
dfe13c55 1755 is_utf8_alnum((U8*)"a"); /* preload table */
a0d0e21e 1756 break;
1757 case 'W':
a0ed51b3 1758 ret = reg_node(
1759 UTF
1760 ? (LOC ? NALNUMLUTF8 : NALNUMUTF8)
1761 : (LOC ? NALNUML : NALNUM));
a0d0e21e 1762 *flagp |= HASWIDTH|SIMPLE;
1763 nextchar();
a0ed51b3 1764 if (UTF && !PL_utf8_alnum)
dfe13c55 1765 is_utf8_alnum((U8*)"a"); /* preload table */
a0d0e21e 1766 break;
1767 case 'b':
3280af22 1768 PL_seen_zerolen++;
a0ed51b3 1769 ret = reg_node(
1770 UTF
1771 ? (LOC ? BOUNDLUTF8 : BOUNDUTF8)
1772 : (LOC ? BOUNDL : BOUND));
a0d0e21e 1773 *flagp |= SIMPLE;
1774 nextchar();
a0ed51b3 1775 if (UTF && !PL_utf8_alnum)
dfe13c55 1776 is_utf8_alnum((U8*)"a"); /* preload table */
a0d0e21e 1777 break;
1778 case 'B':
3280af22 1779 PL_seen_zerolen++;
a0ed51b3 1780 ret = reg_node(
1781 UTF
1782 ? (LOC ? NBOUNDLUTF8 : NBOUNDUTF8)
1783 : (LOC ? NBOUNDL : NBOUND));
a0d0e21e 1784 *flagp |= SIMPLE;
1785 nextchar();
a0ed51b3 1786 if (UTF && !PL_utf8_alnum)
dfe13c55 1787 is_utf8_alnum((U8*)"a"); /* preload table */
a0d0e21e 1788 break;
1789 case 's':
a0ed51b3 1790 ret = reg_node(
1791 UTF
1792 ? (LOC ? SPACELUTF8 : SPACEUTF8)
1793 : (LOC ? SPACEL : SPACE));
a0d0e21e 1794 *flagp |= HASWIDTH|SIMPLE;
1795 nextchar();
a0ed51b3 1796 if (UTF && !PL_utf8_space)
dfe13c55 1797 is_utf8_space((U8*)" "); /* preload table */
a0d0e21e 1798 break;
1799 case 'S':
a0ed51b3 1800 ret = reg_node(
1801 UTF
1802 ? (LOC ? NSPACELUTF8 : NSPACEUTF8)
1803 : (LOC ? NSPACEL : NSPACE));
a0d0e21e 1804 *flagp |= HASWIDTH|SIMPLE;
1805 nextchar();
a0ed51b3 1806 if (UTF && !PL_utf8_space)
dfe13c55 1807 is_utf8_space((U8*)" "); /* preload table */
a0d0e21e 1808 break;
1809 case 'd':
a0ed51b3 1810 ret = reg_node(UTF ? DIGITUTF8 : DIGIT);
a0d0e21e 1811 *flagp |= HASWIDTH|SIMPLE;
1812 nextchar();
a0ed51b3 1813 if (UTF && !PL_utf8_digit)
dfe13c55 1814 is_utf8_digit((U8*)"1"); /* preload table */
a0d0e21e 1815 break;
1816 case 'D':
a0ed51b3 1817 ret = reg_node(UTF ? NDIGITUTF8 : NDIGIT);
a0d0e21e 1818 *flagp |= HASWIDTH|SIMPLE;
1819 nextchar();
a0ed51b3 1820 if (UTF && !PL_utf8_digit)
dfe13c55 1821 is_utf8_digit((U8*)"1"); /* preload table */
a0d0e21e 1822 break;
a14b48bc 1823 case 'p':
1824 case 'P':
1825 { /* a lovely hack--pretend we saw [\pX] instead */
1826 char* oldregxend = PL_regxend;
1827
1828 if (PL_regcomp_parse[1] == '{') {
1829 PL_regxend = strchr(PL_regcomp_parse, '}');
1830 if (!PL_regxend)
1831 FAIL("Missing right brace on \\p{}");
1832 PL_regxend++;
1833 }
1834 else
1835 PL_regxend = PL_regcomp_parse + 2;
1836 PL_regcomp_parse--;
1837
1838 ret = regclassutf8();
1839
1840 PL_regxend = oldregxend;
1841 PL_regcomp_parse--;
1842 nextchar();
1843 *flagp |= HASWIDTH|SIMPLE;
1844 }
1845 break;
a0d0e21e 1846 case 'n':
1847 case 'r':
1848 case 't':
1849 case 'f':
1850 case 'e':
1851 case 'a':
1852 case 'x':
1853 case 'c':
1854 case '0':
1855 goto defchar;
1856 case '1': case '2': case '3': case '4':
1857 case '5': case '6': case '7': case '8': case '9':
1858 {
3280af22 1859 I32 num = atoi(PL_regcomp_parse);
a0d0e21e 1860
3280af22 1861 if (num > 9 && num >= PL_regnpar)
a0d0e21e 1862 goto defchar;
1863 else {
3280af22 1864 if (!SIZE_ONLY && num > PL_regcomp_rx->nparens)
ef64f398 1865 FAIL("reference to nonexistent group");
3280af22 1866 PL_regsawback = 1;
a0ed51b3 1867 ret = reganode(FOLD
1868 ? (LOC ? REFFL : REFF)
c8756f30 1869 : REF, num);
a0d0e21e 1870 *flagp |= HASWIDTH;
3280af22 1871 while (isDIGIT(*PL_regcomp_parse))
1872 PL_regcomp_parse++;
1873 PL_regcomp_parse--;
a0d0e21e 1874 nextchar();
1875 }
1876 }
1877 break;
1878 case '\0':
3280af22 1879 if (PL_regcomp_parse >= PL_regxend)
a0d0e21e 1880 FAIL("trailing \\ in regexp");
1881 /* FALL THROUGH */
1882 default:
1883 goto defchar;
1884 }
1885 break;
4633a7c4 1886
1887 case '#':
3280af22 1888 if (PL_regflags & PMf_EXTENDED) {
1889 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != '\n') PL_regcomp_parse++;
1890 if (PL_regcomp_parse < PL_regxend)
4633a7c4 1891 goto tryagain;
1892 }
1893 /* FALL THROUGH */
1894
a0d0e21e 1895 default: {
1896 register I32 len;
a0ed51b3 1897 register UV ender;
a0d0e21e 1898 register char *p;
c277df42 1899 char *oldp, *s;
a0d0e21e 1900 I32 numlen;
1901
3280af22 1902 PL_regcomp_parse++;
a0d0e21e 1903
1904 defchar:
a0ed51b3 1905 ret = reg_node(FOLD
1906 ? (LOC ? EXACTFL : EXACTF)
bbce6d69 1907 : EXACT);
161b471a 1908 s = (char *) OPERAND(ret);
c277df42 1909 regc(0, s++); /* save spot for len */
3280af22 1910 for (len = 0, p = PL_regcomp_parse - 1;
1911 len < 127 && p < PL_regxend;
a0d0e21e 1912 len++)
1913 {
1914 oldp = p;
5b5a24f7 1915
3280af22 1916 if (PL_regflags & PMf_EXTENDED)
1917 p = regwhite(p, PL_regxend);
a0d0e21e 1918 switch (*p) {
1919 case '^':
1920 case '$':
1921 case '.':
1922 case '[':
1923 case '(':
1924 case ')':
1925 case '|':
1926 goto loopdone;
1927 case '\\':
1928 switch (*++p) {
1929 case 'A':
1930 case 'G':
1931 case 'Z':
b85d18e9 1932 case 'z':
a0d0e21e 1933 case 'w':
1934 case 'W':
1935 case 'b':
1936 case 'B':
1937 case 's':
1938 case 'S':
1939 case 'd':
1940 case 'D':
a14b48bc 1941 case 'p':
1942 case 'P':
a0d0e21e 1943 --p;
1944 goto loopdone;
1945 case 'n':
1946 ender = '\n';
1947 p++;
a687059c 1948 break;
a0d0e21e 1949 case 'r':
1950 ender = '\r';
1951 p++;
a687059c 1952 break;
a0d0e21e 1953 case 't':
1954 ender = '\t';
1955 p++;
a687059c 1956 break;
a0d0e21e 1957 case 'f':
1958 ender = '\f';
1959 p++;
a687059c 1960 break;
a0d0e21e 1961 case 'e':
1962 ender = '\033';
1963 p++;
a687059c 1964 break;
a0d0e21e 1965 case 'a':
1966 ender = '\007';
1967 p++;
a687059c 1968 break;
a0d0e21e 1969 case 'x':
a0ed51b3 1970 if (*++p == '{') {
1971 char* e = strchr(p, '}');
1972
1973 if (!e)
1974 FAIL("Missing right brace on \\x{}");
1975 else if (UTF) {
1976 ender = scan_hex(p + 1, e - p, &numlen);
1977 if (numlen + len >= 127) { /* numlen is generous */
1978 p--;
1979 goto loopdone;
1980 }
1981 p = e + 1;
1982 }
1983 else
1984 FAIL("Can't use \\x{} without 'use utf8' declaration");
1985 }
1986 else {
1987 ender = scan_hex(p, 2, &numlen);
1988 p += numlen;
1989 }
a687059c 1990 break;
a0d0e21e 1991 case 'c':
1992 p++;
bbce6d69 1993 ender = UCHARAT(p++);
1994 ender = toCTRL(ender);
a687059c 1995 break;
a0d0e21e 1996 case '0': case '1': case '2': case '3':case '4':
1997 case '5': case '6': case '7': case '8':case '9':
1998 if (*p == '0' ||
3280af22 1999 (isDIGIT(p[1]) && atoi(p) >= PL_regnpar) ) {
a0d0e21e 2000 ender = scan_oct(p, 3, &numlen);
2001 p += numlen;
2002 }
2003 else {
2004 --p;
2005 goto loopdone;
a687059c 2006 }
2007 break;
a0d0e21e 2008 case '\0':
3280af22 2009 if (p >= PL_regxend)
a687059c 2010 FAIL("trailing \\ in regexp");
2011 /* FALL THROUGH */
a0d0e21e 2012 default:
a0ed51b3 2013 goto normal_default;
a0d0e21e 2014 }
2015 break;
a687059c 2016 default:
a0ed51b3 2017 normal_default:
2018 if ((*p & 0xc0) == 0xc0 && UTF) {
dfe13c55 2019 ender = utf8_to_uv((U8*)p, &numlen);
a0ed51b3 2020 p += numlen;
2021 }
2022 else
2023 ender = *p++;
a0d0e21e 2024 break;
a687059c 2025 }
3280af22 2026 if (PL_regflags & PMf_EXTENDED)
2027 p = regwhite(p, PL_regxend);
a0ed51b3 2028 if (UTF && FOLD) {
2029 if (LOC)
2030 ender = toLOWER_LC_uni(ender);
2031 else
2032 ender = toLOWER_uni(ender);
2033 }
a0d0e21e 2034 if (ISMULT2(p)) { /* Back off on ?+*. */
2035 if (len)
2036 p = oldp;
a0ed51b3 2037 else if (ender >= 0x80 && UTF) {
2038 reguni(ender, s, &numlen);
2039 s += numlen;
2040 len += numlen;
2041 }
a0d0e21e 2042 else {
2043 len++;
c277df42 2044 regc(ender, s++);
a0d0e21e 2045 }
2046 break;
a687059c 2047 }
a0ed51b3 2048 if (ender >= 0x80 && UTF) {
2049 reguni(ender, s, &numlen);
2050 s += numlen;
2051 len += numlen - 1;
2052 }
2053 else
2054 regc(ender, s++);
a0d0e21e 2055 }
2056 loopdone:
3280af22 2057 PL_regcomp_parse = p - 1;
a0d0e21e 2058 nextchar();
2059 if (len < 0)
2060 FAIL("internal disaster in regexp");
2061 if (len > 0)
2062 *flagp |= HASWIDTH;
2063 if (len == 1)
2064 *flagp |= SIMPLE;
c277df42 2065 if (!SIZE_ONLY)
a0d0e21e 2066 *OPERAND(ret) = len;
c277df42 2067 regc('\0', s++);
2068 if (SIZE_ONLY) {
3280af22 2069 PL_regsize += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
a0ed51b3 2070 }
2071 else {
3280af22 2072 PL_regcode += (len + 2 + sizeof(regnode) - 1) / sizeof(regnode);
c277df42 2073 }
a687059c 2074 }
a0d0e21e 2075 break;
2076 }
a687059c 2077
a0d0e21e 2078 return(ret);
a687059c 2079}
2080
873ef191 2081STATIC char *
8ac85365 2082regwhite(char *p, char *e)
5b5a24f7 2083{
2084 while (p < e) {
2085 if (isSPACE(*p))
2086 ++p;
2087 else if (*p == '#') {
2088 do {
2089 p++;
2090 } while (p < e && *p != '\n');
2091 }
2092 else
2093 break;
2094 }
2095 return p;
2096}
2097
76e3520e 2098STATIC regnode *
8ac85365 2099regclass(void)
a687059c 2100{
5c0ca799 2101 dTHR;
c277df42 2102 register char *opnd, *s;
a0ed51b3 2103 register I32 value;
2104 register I32 lastvalue = 1234;
a0d0e21e 2105 register I32 range = 0;
c277df42 2106 register regnode *ret;
a0d0e21e 2107 register I32 def;
2108 I32 numlen;
2109
3280af22 2110 s = opnd = (char *) OPERAND(PL_regcode);
c277df42 2111 ret = reg_node(ANYOF);
a0ed51b3 2112 for (value = 0; value < 33; value++)
c277df42 2113 regc(0, s++);
3280af22 2114 if (*PL_regcomp_parse == '^') { /* Complement of range. */
2115 PL_regnaughty++;
2116 PL_regcomp_parse++;
c277df42 2117 if (!SIZE_ONLY)
bbce6d69 2118 *opnd |= ANYOF_INVERT;
2119 }
c277df42 2120 if (!SIZE_ONLY) {
3280af22 2121 PL_regcode += ANY_SKIP;
a0ed51b3 2122 if (FOLD)
bbce6d69 2123 *opnd |= ANYOF_FOLD;
a0ed51b3 2124 if (LOC)
bbce6d69 2125 *opnd |= ANYOF_LOCALE;
a0ed51b3 2126 }
2127 else {
3280af22 2128 PL_regsize += ANY_SKIP;
a0d0e21e 2129 }
3280af22 2130 if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-')
a0d0e21e 2131 goto skipcond; /* allow 1st char to be ] or - */
3280af22 2132 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') {
a0d0e21e 2133 skipcond:
a0ed51b3 2134 value = UCHARAT(PL_regcomp_parse++);
2135 if (value == '[' && PL_regcomp_parse + 1 < PL_regxend &&
4599a1de 2136 /* I smell either [: or [= or [. -- POSIX has been here, right? */
3280af22 2137 (*PL_regcomp_parse == ':' || *PL_regcomp_parse == '=' || *PL_regcomp_parse == '.')) {
2138 char posixccc = *PL_regcomp_parse;
2139 char* posixccs = PL_regcomp_parse++;
4599a1de 2140
3280af22 2141 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != posixccc)
2142 PL_regcomp_parse++;
2143 if (PL_regcomp_parse == PL_regxend)
4599a1de 2144 /* Grandfather lone [:, [=, [. */
3280af22 2145 PL_regcomp_parse = posixccs;
4599a1de 2146 else {
3280af22 2147 PL_regcomp_parse++; /* skip over the posixccc */
2148 if (*PL_regcomp_parse == ']') {
4599a1de 2149 /* Not Implemented Yet.
2150 * (POSIX Extended Character Classes, that is)
2151 * The text between e.g. [: and :] would start
77d41b28 2152 * at posixccs + 1 and stop at regcomp_parse - 2. */
599cee73 2153 if (ckWARN(WARN_UNSAFE) && !SIZE_ONLY)
2154 warner(WARN_UNSAFE,
2155 "Character class syntax [%c %c] is reserved for future extensions", posixccc, posixccc);
3280af22 2156 PL_regcomp_parse++; /* skip over the ending ] */
4599a1de 2157 }
2158 }
2159 }
a0ed51b3 2160 if (value == '\\') {
2161 value = UCHARAT(PL_regcomp_parse++);
2162 switch (value) {
a0d0e21e 2163 case 'w':
ae5c130c 2164 if (!SIZE_ONLY) {
a0ed51b3 2165 if (LOC)
bbce6d69 2166 *opnd |= ANYOF_ALNUML;
ae5c130c 2167 else {
a0ed51b3 2168 for (value = 0; value < 256; value++)
2169 if (isALNUM(value))
2170 ANYOF_SET(opnd, value);
ae5c130c 2171 }
bbce6d69 2172 }
a0ed51b3 2173 lastvalue = 1234;
a0d0e21e 2174 continue;
2175 case 'W':
ae5c130c 2176 if (!SIZE_ONLY) {
a0ed51b3 2177 if (LOC)
bbce6d69 2178 *opnd |= ANYOF_NALNUML;
ae5c130c 2179 else {
a0ed51b3 2180 for (value = 0; value < 256; value++)
2181 if (!isALNUM(value))
2182 ANYOF_SET(opnd, value);
ae5c130c 2183 }
bbce6d69 2184 }
a0ed51b3 2185 lastvalue = 1234;
a0d0e21e 2186 continue;
2187 case 's':
ae5c130c 2188 if (!SIZE_ONLY) {
a0ed51b3 2189 if (LOC)
bbce6d69 2190 *opnd |= ANYOF_SPACEL;
ae5c130c 2191 else {
a0ed51b3 2192 for (value = 0; value < 256; value++)
2193 if (isSPACE(value))
2194 ANYOF_SET(opnd, value);
ae5c130c 2195 }
bbce6d69 2196 }
a0ed51b3 2197 lastvalue = 1234;
a0d0e21e 2198 continue;
2199 case 'S':
ae5c130c 2200 if (!SIZE_ONLY) {
a0ed51b3 2201 if (LOC)
bbce6d69 2202 *opnd |= ANYOF_NSPACEL;
ae5c130c 2203 else {
a0ed51b3 2204 for (value = 0; value < 256; value++)
2205 if (!isSPACE(value))
2206 ANYOF_SET(opnd, value);
ae5c130c 2207 }
bbce6d69 2208 }
a0ed51b3 2209 lastvalue = 1234;
a0d0e21e 2210 continue;
2211 case 'd':
ae5c130c 2212 if (!SIZE_ONLY) {
a0ed51b3 2213 for (value = '0'; value <= '9'; value++)
2214 ANYOF_SET(opnd, value);
ae5c130c 2215 }
a0ed51b3 2216 lastvalue = 1234;
a0d0e21e 2217 continue;
2218 case 'D':
ae5c130c 2219 if (!SIZE_ONLY) {
a0ed51b3 2220 for (value = 0; value < '0'; value++)
2221 ANYOF_SET(opnd, value);
2222 for (value = '9' + 1; value < 256; value++)
2223 ANYOF_SET(opnd, value);
ae5c130c 2224 }
a0ed51b3 2225 lastvalue = 1234;
a0d0e21e 2226 continue;
2227 case 'n':
a0ed51b3 2228 value = '\n';
a0d0e21e 2229 break;
2230 case 'r':
a0ed51b3 2231 value = '\r';
a0d0e21e 2232 break;
2233 case 't':
a0ed51b3 2234 value = '\t';
a0d0e21e 2235 break;
2236 case 'f':
a0ed51b3 2237 value = '\f';
a0d0e21e 2238 break;
2239 case 'b':
a0ed51b3 2240 value = '\b';
a0d0e21e 2241 break;
2242 case 'e':
a0ed51b3 2243 value = '\033';
a0d0e21e 2244 break;
2245 case 'a':
a0ed51b3 2246 value = '\007';
a0d0e21e 2247 break;
2248 case 'x':
a0ed51b3 2249 value = scan_hex(PL_regcomp_parse, 2, &numlen);
3280af22 2250 PL_regcomp_parse += numlen;
a0d0e21e 2251 break;
2252 case 'c':
a0ed51b3 2253 value = UCHARAT(PL_regcomp_parse++);
2254 value = toCTRL(value);
a0d0e21e 2255 break;
2256 case '0': case '1': case '2': case '3': case '4':
2257 case '5': case '6': case '7': case '8': case '9':
a0ed51b3 2258 value = scan_oct(--PL_regcomp_parse, 3, &numlen);
3280af22 2259 PL_regcomp_parse += numlen;
a0d0e21e 2260 break;
2261 }
2262 }
2263 if (range) {
a0ed51b3 2264 if (lastvalue > value)
a0d0e21e 2265 FAIL("invalid [] range in regexp");
2266 range = 0;
2267 }
2268 else {
a0ed51b3 2269 lastvalue = value;
3280af22 2270 if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend &&
2271 PL_regcomp_parse[1] != ']') {
2272 PL_regcomp_parse++;
a0d0e21e 2273 range = 1;
2274 continue; /* do it next time */
2275 }
a687059c 2276 }
ae5c130c 2277 if (!SIZE_ONLY) {
8ada0baa 2278#ifndef ASCIIish
2279 if ((isLOWER(lastvalue) && isLOWER(value)) ||
c8dba6f3 2280 (isUPPER(lastvalue) && isUPPER(value)))
2281 {
2282 I32 i;
8ada0baa 2283 if (isLOWER(lastvalue)) {
2284 for (i = lastvalue; i <= value; i++)
2285 if (isLOWER(i))
2286 ANYOF_SET(opnd, i);
2287 } else {
2288 for (i = lastvalue; i <= value; i++)
2289 if (isUPPER(i))
2290 ANYOF_SET(opnd, i);
2291 }
2292 }
2293 else
2294#endif
2295 for ( ; lastvalue <= value; lastvalue++)
2296 ANYOF_SET(opnd, lastvalue);
2297 }
a0ed51b3 2298 lastvalue = value;
a0d0e21e 2299 }
ae5c130c 2300 /* optimize case-insensitive simple patterns (e.g. /[a-z]/i) */
2301 if (!SIZE_ONLY && (*opnd & (0xFF ^ ANYOF_INVERT)) == ANYOF_FOLD) {
a0ed51b3 2302 for (value = 0; value < 256; ++value) {
2303 if (ANYOF_TEST(opnd, value)) {
22c35a8c 2304 I32 cf = PL_fold[value];
ae5c130c 2305 ANYOF_SET(opnd, cf);
2306 }
2307 }
2308 *opnd &= ~ANYOF_FOLD;
2309 }
2310 /* optimize inverted simple patterns (e.g. [^a-z]) */
2311 if (!SIZE_ONLY && (*opnd & 0xFF) == ANYOF_INVERT) {
a0ed51b3 2312 for (value = 0; value < 32; ++value)
2313 opnd[1 + value] ^= 0xFF;
ae5c130c 2314 *opnd = 0;
2315 }
a0d0e21e 2316 return ret;
2317}
2318
a0ed51b3 2319STATIC regnode *
2320regclassutf8(void)
2321{
2322 register char *opnd, *e;
2323 register U32 value;
2324 register U32 lastvalue = 123456;
2325 register I32 range = 0;
2326 register regnode *ret;
2327 I32 numlen;
2328 I32 n;
2329 SV *listsv;
2330 U8 flags = 0;
c485e607 2331 dTHR;
a0ed51b3 2332
2333 if (*PL_regcomp_parse == '^') { /* Complement of range. */
2334 PL_regnaughty++;
2335 PL_regcomp_parse++;
2336 if (!SIZE_ONLY)
2337 flags |= ANYOF_INVERT;
2338 }
2339 if (!SIZE_ONLY) {
2340 if (FOLD)
2341 flags |= ANYOF_FOLD;
2342 if (LOC)
2343 flags |= ANYOF_LOCALE;
2344 listsv = newSVpv("# comment\n",0);
2345 }
2346
2347 if (*PL_regcomp_parse == ']' || *PL_regcomp_parse == '-')
2348 goto skipcond; /* allow 1st char to be ] or - */
2349
2350 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != ']') {
2351 skipcond:
dfe13c55 2352 value = utf8_to_uv((U8*)PL_regcomp_parse, &numlen);
a0ed51b3 2353 PL_regcomp_parse += numlen;
2354
2355 if (value == '[' && PL_regcomp_parse + 1 < PL_regxend &&
2356 /* I smell either [: or [= or [. -- POSIX has been here, right? */
2357 (*PL_regcomp_parse == ':' || *PL_regcomp_parse == '=' || *PL_regcomp_parse == '.')) {
2358 char posixccc = *PL_regcomp_parse;
2359 char* posixccs = PL_regcomp_parse++;
2360
2361 while (PL_regcomp_parse < PL_regxend && *PL_regcomp_parse != posixccc)
2362 PL_regcomp_parse++;
2363 if (PL_regcomp_parse == PL_regxend)
2364 /* Grandfather lone [:, [=, [. */
2365 PL_regcomp_parse = posixccs;
2366 else {
2367 PL_regcomp_parse++; /* skip over the posixccc */
2368 if (*PL_regcomp_parse == ']') {
2369 /* Not Implemented Yet.
2370 * (POSIX Extended Character Classes, that is)
2371 * The text between e.g. [: and :] would start
2372 * at posixccs + 1 and stop at regcomp_parse - 2. */
599cee73 2373 if (ckWARN(WARN_UNSAFE) && !SIZE_ONLY)
2374 warner(WARN_UNSAFE,
2375 "Character class syntax [%c %c] is reserved for future extensions", posixccc, posixccc);
a0ed51b3 2376 PL_regcomp_parse++; /* skip over the ending ] */
2377 }
2378 }
2379 }
2380
2381 if (value == '\\') {
dfe13c55 2382 value = utf8_to_uv((U8*)PL_regcomp_parse, &numlen);
a0ed51b3 2383 PL_regcomp_parse += numlen;
2384 switch (value) {
2385 case 'w':
2386 if (!SIZE_ONLY) {
2387 if (LOC)
2388 flags |= ANYOF_ALNUML;
2389
2390 sv_catpvf(listsv, "+utf8::IsAlnum\n");
2391 }
2392 lastvalue = 123456;
2393 continue;
2394 case 'W':
2395 if (!SIZE_ONLY) {
2396 if (LOC)
2397 flags |= ANYOF_NALNUML;
2398
2399 sv_catpvf(listsv,
2400 "-utf8::IsAlpha\n-utf8::IsDigit\n0000\t%04x\n%04x\tffff\n",
2401 '_' - 1,
2402 '_' + 1);
2403 }
2404 lastvalue = 123456;
2405 continue;
2406 case 's':
2407 if (!SIZE_ONLY) {
2408 if (LOC)
2409 flags |= ANYOF_SPACEL;
2410 sv_catpvf(listsv, "+utf8::IsSpace\n");
2411 if (!PL_utf8_space)
dfe13c55 2412 is_utf8_space((U8*)" ");
a0ed51b3 2413 }
2414 lastvalue = 123456;
2415 continue;
2416 case 'S':
2417 if (!SIZE_ONLY) {
2418 if (LOC)
2419 flags |= ANYOF_NSPACEL;
2420 sv_catpvf(listsv,
2421 "!utf8::IsSpace\n");
2422 if (!PL_utf8_space)
dfe13c55 2423 is_utf8_space((U8*)" ");
a0ed51b3 2424 }
2425 lastvalue = 123456;
2426 continue;
2427 case 'd':
2428 if (!SIZE_ONLY) {
2429 sv_catpvf(listsv, "+utf8::IsDigit\n");
2430 }
2431 lastvalue = 123456;
2432 continue;
2433 case 'D':
2434 if (!SIZE_ONLY) {
2435 sv_catpvf(listsv,
2436 "!utf8::IsDigit\n");
2437 }
2438 lastvalue = 123456;
2439 continue;
2440 case 'p':
2441 case 'P':
2442 if (*PL_regcomp_parse == '{') {
2443 e = strchr(PL_regcomp_parse++, '}');
2444 if (!e)
2445 FAIL("Missing right brace on \\p{}");
2446 n = e - PL_regcomp_parse;
2447 }
2448 else {
2449 e = PL_regcomp_parse;
2450 n = 1;
2451 }
2452 if (!SIZE_ONLY) {
2453 if (value == 'p')
2454 sv_catpvf(listsv, "+utf8::%.*s\n", n, PL_regcomp_parse);
2455 else
2456 sv_catpvf(listsv,
2457 "!utf8::%.*s\n", n, PL_regcomp_parse);
2458 }
2459 PL_regcomp_parse = e + 1;
2460 lastvalue = 123456;
2461 continue;
2462 case 'n':
2463 value = '\n';
2464 break;
2465 case 'r':
2466 value = '\r';
2467 break;
2468 case 't':
2469 value = '\t';
2470 break;
2471 case 'f':
2472 value = '\f';
2473 break;
2474 case 'b':
2475 value = '\b';
2476 break;
2477 case 'e':
2478 value = '\033';
2479 break;
2480 case 'a':
2481 value = '\007';
2482 break;
2483 case 'x':
2484 if (*PL_regcomp_parse == '{') {
2485 e = strchr(PL_regcomp_parse++, '}');
2486 if (!e)
2487 FAIL("Missing right brace on \\x{}");
2488 value = scan_hex(PL_regcomp_parse + 1, e - PL_regcomp_parse, &numlen);
2489 PL_regcomp_parse = e + 1;
2490 }
2491 else {
2492 value = scan_hex(PL_regcomp_parse, 2, &numlen);
2493 PL_regcomp_parse += numlen;
2494 }
2495 break;
2496 case 'c':
2497 value = UCHARAT(PL_regcomp_parse++);
2498 value = toCTRL(value);
2499 break;
2500 case '0': case '1': case '2': case '3': case '4':
2501 case '5': case '6': case '7': case '8': case '9':
2502 value = scan_oct(--PL_regcomp_parse, 3, &numlen);
2503 PL_regcomp_parse += numlen;
2504 break;
2505 }
2506 }
2507 if (range) {
2508 if (lastvalue > value)
2509 FAIL("invalid [] range in regexp");
2510 if (!SIZE_ONLY)
2511 sv_catpvf(listsv, "%04x\t%04x\n", lastvalue, value);
2512 lastvalue = value;
2513 range = 0;
2514 }
2515 else {
2516 lastvalue = value;
2517 if (*PL_regcomp_parse == '-' && PL_regcomp_parse+1 < PL_regxend &&
2518 PL_regcomp_parse[1] != ']') {
2519 PL_regcomp_parse++;
2520 range = 1;
2521 continue; /* do it next time */
2522 }
2523 if (!SIZE_ONLY)
2524 sv_catpvf(listsv, "%04x\n", value);
2525 }
2526 }
a0ed51b3 2527
2528 ret = reganode(ANYOFUTF8, 0);
2529
2530 if (!SIZE_ONLY) {
2531 SV *rv = swash_init("utf8", "", listsv, 1, 0);
2532 SvREFCNT_dec(listsv);
2533 n = add_data(1,"s");
2534 PL_regcomp_rx->data->data[n] = (void*)rv;
2535 ARG1_SET(ret, flags);
2536 ARG2_SET(ret, n);
2537 }
2538
2539 return ret;
2540}
2541
76e3520e 2542STATIC char*
8ac85365 2543nextchar(void)
a0d0e21e 2544{
5c0ca799 2545 dTHR;
3280af22 2546 char* retval = PL_regcomp_parse++;
a0d0e21e 2547
4633a7c4 2548 for (;;) {
3280af22 2549 if (*PL_regcomp_parse == '(' && PL_regcomp_parse[1] == '?' &&
2550 PL_regcomp_parse[2] == '#') {
2551 while (*PL_regcomp_parse && *PL_regcomp_parse != ')')
2552 PL_regcomp_parse++;
2553 PL_regcomp_parse++;
4633a7c4 2554 continue;
2555 }
3280af22 2556 if (PL_regflags & PMf_EXTENDED) {
2557 if (isSPACE(*PL_regcomp_parse)) {
2558 PL_regcomp_parse++;
748a9306 2559 continue;
2560 }
3280af22 2561 else if (*PL_regcomp_parse == '#') {
2562 while (*PL_regcomp_parse && *PL_regcomp_parse != '\n')
2563 PL_regcomp_parse++;
2564 PL_regcomp_parse++;
748a9306 2565 continue;
2566 }
748a9306 2567 }
4633a7c4 2568 return retval;
a0d0e21e 2569 }
a687059c 2570}
2571
2572/*
c277df42 2573- reg_node - emit a node
a0d0e21e 2574*/
76e3520e 2575STATIC regnode * /* Location. */
c277df42 2576reg_node(U8 op)
a687059c 2577{
5c0ca799 2578 dTHR;
c277df42 2579 register regnode *ret;
2580 register regnode *ptr;
a687059c 2581
3280af22 2582 ret = PL_regcode;
c277df42 2583 if (SIZE_ONLY) {
6b88bc9c 2584 SIZE_ALIGN(PL_regsize);
3280af22 2585 PL_regsize += 1;
a0d0e21e 2586 return(ret);
2587 }
a687059c 2588
c277df42 2589 NODE_ALIGN_FILL(ret);
a0d0e21e 2590 ptr = ret;
c277df42 2591 FILL_ADVANCE_NODE(ptr, op);
3280af22 2592 PL_regcode = ptr;
a687059c 2593
a0d0e21e 2594 return(ret);
a687059c 2595}
2596
2597/*
a0d0e21e 2598- reganode - emit a node with an argument
2599*/
76e3520e 2600STATIC regnode * /* Location. */
c277df42 2601reganode(U8 op, U32 arg)
fe14fcc3 2602{
5c0ca799 2603 dTHR;
c277df42 2604 register regnode *ret;
2605 register regnode *ptr;
fe14fcc3 2606
3280af22 2607 ret = PL_regcode;
c277df42 2608 if (SIZE_ONLY) {
6b88bc9c 2609 SIZE_ALIGN(PL_regsize);
3280af22 2610 PL_regsize += 2;
a0d0e21e 2611 return(ret);
2612 }
fe14fcc3 2613
c277df42 2614 NODE_ALIGN_FILL(ret);
a0d0e21e 2615 ptr = ret;
c277df42 2616 FILL_ADVANCE_NODE_ARG(ptr, op, arg);
3280af22 2617 PL_regcode = ptr;
fe14fcc3 2618
a0d0e21e 2619 return(ret);
fe14fcc3 2620}
2621
2622/*
a0ed51b3 2623- regc - emit (if appropriate) a Unicode character
2624*/
2625STATIC void
2626reguni(UV uv, char* s, I32* lenp)
2627{
c485e607 2628 dTHR;
a0ed51b3 2629 if (SIZE_ONLY) {
dfe13c55 2630 U8 tmpbuf[10];
a0ed51b3 2631 *lenp = uv_to_utf8(tmpbuf, uv) - tmpbuf;
2632 }
2633 else
dfe13c55 2634 *lenp = uv_to_utf8((U8*)s, uv) - (U8*)s;
a0ed51b3 2635
2636}
2637
2638/*
a0d0e21e 2639- regc - emit (if appropriate) a byte of code
2640*/
76e3520e 2641STATIC void
c277df42 2642regc(U8 b, char* s)
a687059c 2643{
5c0ca799 2644 dTHR;
c277df42 2645 if (!SIZE_ONLY)
2646 *s = b;
a687059c 2647}
2648
2649/*
a0d0e21e 2650- reginsert - insert an operator in front of already-emitted operand
2651*
2652* Means relocating the operand.
2653*/
76e3520e 2654STATIC void
c277df42 2655reginsert(U8 op, regnode *opnd)
a687059c 2656{
5c0ca799 2657 dTHR;
c277df42 2658 register regnode *src;
2659 register regnode *dst;
2660 register regnode *place;
2661 register int offset = regarglen[(U8)op];
2662
22c35a8c 2663/* (PL_regkind[(U8)op] == CURLY ? EXTRA_STEP_2ARGS : 0); */
c277df42 2664
2665 if (SIZE_ONLY) {
3280af22 2666 PL_regsize += NODE_STEP_REGNODE + offset;
a0d0e21e 2667 return;
2668 }
a687059c 2669
3280af22 2670 src = PL_regcode;
2671 PL_regcode += NODE_STEP_REGNODE + offset;
2672 dst = PL_regcode;
a0d0e21e 2673 while (src > opnd)
c277df42 2674 StructCopy(--src, --dst, regnode);
a0d0e21e 2675
2676 place = opnd; /* Op node, where operand used to be. */
c277df42 2677 src = NEXTOPER(place);
2678 FILL_ADVANCE_NODE(place, op);
2679 Zero(src, offset, regnode);
a687059c 2680}
2681
2682/*
c277df42 2683- regtail - set the next-pointer at the end of a node chain of p to val.
a0d0e21e 2684*/
76e3520e 2685STATIC void
c277df42 2686regtail(regnode *p, regnode *val)
a687059c 2687{
5c0ca799 2688 dTHR;
c277df42 2689 register regnode *scan;
2690 register regnode *temp;
a0d0e21e 2691 register I32 offset;
2692
c277df42 2693 if (SIZE_ONLY)
a0d0e21e 2694 return;
2695
2696 /* Find last node. */
2697 scan = p;
2698 for (;;) {
2699 temp = regnext(scan);
2700 if (temp == NULL)
2701 break;
2702 scan = temp;
2703 }
a687059c 2704
c277df42 2705 if (reg_off_by_arg[OP(scan)]) {
2706 ARG_SET(scan, val - scan);
a0ed51b3 2707 }
2708 else {
c277df42 2709 NEXT_OFF(scan) = val - scan;
2710 }
a687059c 2711}
2712
2713/*
a0d0e21e 2714- regoptail - regtail on operand of first argument; nop if operandless
2715*/
76e3520e 2716STATIC void
c277df42 2717regoptail(regnode *p, regnode *val)
a687059c 2718{
5c0ca799 2719 dTHR;
a0d0e21e 2720 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
c277df42 2721 if (p == NULL || SIZE_ONLY)
2722 return;
22c35a8c 2723 if (PL_regkind[(U8)OP(p)] == BRANCH) {
c277df42 2724 regtail(NEXTOPER(p), val);
a0ed51b3 2725 }
22c35a8c 2726 else if ( PL_regkind[(U8)OP(p)] == BRANCHJ) {
c277df42 2727 regtail(NEXTOPER(NEXTOPER(p)), val);
a0ed51b3 2728 }
2729 else
a0d0e21e 2730 return;
a687059c 2731}
2732
2733/*
2734 - regcurly - a little FSA that accepts {\d+,?\d*}
2735 */
79072805 2736STATIC I32
8ac85365 2737regcurly(register char *s)
a687059c 2738{
2739 if (*s++ != '{')
2740 return FALSE;
f0fcb552 2741 if (!isDIGIT(*s))
a687059c 2742 return FALSE;
f0fcb552 2743 while (isDIGIT(*s))
a687059c 2744 s++;
2745 if (*s == ',')
2746 s++;
f0fcb552 2747 while (isDIGIT(*s))
a687059c 2748 s++;
2749 if (*s != '}')
2750 return FALSE;
2751 return TRUE;
2752}
2753
a687059c 2754
76e3520e 2755STATIC regnode *
c277df42 2756dumpuntil(regnode *start, regnode *node, regnode *last, SV* sv, I32 l)
2757{
35ff7856 2758#ifdef DEBUGGING
c277df42 2759 register char op = EXACT; /* Arbitrary non-END op. */
2760 register regnode *next, *onode;
2761
2762 while (op != END && (!last || node < last)) {
2763 /* While that wasn't END last time... */
2764
2765 NODE_ALIGN(node);
2766 op = OP(node);
2767 if (op == CLOSE)
2768 l--;
2769 next = regnext(node);
2770 /* Where, what. */
2771 if (OP(node) == OPTIMIZED)
2772 goto after_print;
2773 regprop(sv, node);
54dc92de 2774 PerlIO_printf(Perl_debug_log, "%4d:%*s%s", node - start,
c277df42 2775 2*l + 1, "", SvPVX(sv));
2776 if (next == NULL) /* Next ptr. */
2777 PerlIO_printf(Perl_debug_log, "(0)");
2778 else
2779 PerlIO_printf(Perl_debug_log, "(%d)", next - start);
2780 (void)PerlIO_putc(Perl_debug_log, '\n');
2781 after_print:
22c35a8c 2782 if (PL_regkind[(U8)op] == BRANCHJ) {
c277df42 2783 register regnode *nnode = (OP(next) == LONGJMP
2784 ? regnext(next)
2785 : next);
2786 if (last && nnode > last)
2787 nnode = last;
2788 node = dumpuntil(start, NEXTOPER(NEXTOPER(node)), nnode, sv, l + 1);
a0ed51b3 2789 }
22c35a8c 2790 else if (PL_regkind[(U8)op] == BRANCH) {
c277df42 2791 node = dumpuntil(start, NEXTOPER(node), next, sv, l + 1);
a0ed51b3 2792 }
2793 else if ( op == CURLY) { /* `next' might be very big: optimizer */
c277df42 2794 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2795 NEXTOPER(node) + EXTRA_STEP_2ARGS + 1, sv, l + 1);
a0ed51b3 2796 }
22c35a8c 2797 else if (PL_regkind[(U8)op] == CURLY && op != CURLYX) {
c277df42 2798 node = dumpuntil(start, NEXTOPER(node) + EXTRA_STEP_2ARGS,
2799 next, sv, l + 1);
a0ed51b3 2800 }
2801 else if ( op == PLUS || op == STAR) {
c277df42 2802 node = dumpuntil(start, NEXTOPER(node), NEXTOPER(node) + 1, sv, l + 1);
a0ed51b3 2803 }
2804 else if (op == ANYOF) {
c277df42 2805 node = NEXTOPER(node);
2806 node += ANY_SKIP;
a0ed51b3 2807 }
22c35a8c 2808 else if (PL_regkind[(U8)op] == EXACT) {
c277df42 2809 /* Literal string, where present. */
2810 node += ((*OPERAND(node)) + 2 + sizeof(regnode) - 1) / sizeof(regnode);
2811 node = NEXTOPER(node);
a0ed51b3 2812 }
2813 else {
c277df42 2814 node = NEXTOPER(node);
2815 node += regarglen[(U8)op];
2816 }
2817 if (op == CURLYX || op == OPEN)
2818 l++;
2819 else if (op == WHILEM)
2820 l--;
2821 }
17c3b450 2822#endif /* DEBUGGING */
c277df42 2823 return node;
2824}
2825
a687059c 2826/*
fd181c75 2827 - regdump - dump a regexp onto Perl_debug_log in vaguely comprehensible form
a687059c 2828 */
2829void
8ac85365 2830regdump(regexp *r)
a687059c 2831{
35ff7856 2832#ifdef DEBUGGING
5c0ca799 2833 dTHR;
46fc3d4c 2834 SV *sv = sv_newmortal();
a687059c 2835
c277df42 2836 (void)dumpuntil(r->program, r->program + 1, NULL, sv, 0);
a0d0e21e 2837
2838 /* Header fields of interest. */
c277df42 2839 if (r->anchored_substr)
2840 PerlIO_printf(Perl_debug_log, "anchored `%s%s%s'%s at %d ",
3280af22 2841 PL_colors[0],
c277df42 2842 SvPVX(r->anchored_substr),
3280af22 2843 PL_colors[1],
c277df42 2844 SvTAIL(r->anchored_substr) ? "$" : "",
2845 r->anchored_offset);
2846 if (r->float_substr)
2847 PerlIO_printf(Perl_debug_log, "floating `%s%s%s'%s at %d..%u ",
3280af22 2848 PL_colors[0],
c277df42 2849 SvPVX(r->float_substr),
3280af22 2850 PL_colors[1],
c277df42 2851 SvTAIL(r->float_substr) ? "$" : "",
2852 r->float_min_offset, r->float_max_offset);
2853 if (r->check_substr)
2854 PerlIO_printf(Perl_debug_log,
2855 r->check_substr == r->float_substr
2856 ? "(checking floating" : "(checking anchored");
2857 if (r->reganch & ROPT_NOSCAN)
2858 PerlIO_printf(Perl_debug_log, " noscan");
2859 if (r->reganch & ROPT_CHECK_ALL)
2860 PerlIO_printf(Perl_debug_log, " isall");
2861 if (r->check_substr)
2862 PerlIO_printf(Perl_debug_log, ") ");
2863
46fc3d4c 2864 if (r->regstclass) {
2865 regprop(sv, r->regstclass);
2866 PerlIO_printf(Perl_debug_log, "stclass `%s' ", SvPVX(sv));
2867 }
774d564b 2868 if (r->reganch & ROPT_ANCH) {
2869 PerlIO_printf(Perl_debug_log, "anchored");
2870 if (r->reganch & ROPT_ANCH_BOL)
2871 PerlIO_printf(Perl_debug_log, "(BOL)");
c277df42 2872 if (r->reganch & ROPT_ANCH_MBOL)
2873 PerlIO_printf(Perl_debug_log, "(MBOL)");
774d564b 2874 if (r->reganch & ROPT_ANCH_GPOS)
2875 PerlIO_printf(Perl_debug_log, "(GPOS)");
2876 PerlIO_putc(Perl_debug_log, ' ');
2877 }
c277df42 2878 if (r->reganch & ROPT_GPOS_SEEN)
2879 PerlIO_printf(Perl_debug_log, "GPOS ");
a0d0e21e 2880 if (r->reganch & ROPT_SKIP)
760ac839 2881 PerlIO_printf(Perl_debug_log, "plus ");
a0d0e21e 2882 if (r->reganch & ROPT_IMPLICIT)
760ac839 2883 PerlIO_printf(Perl_debug_log, "implicit ");
760ac839 2884 PerlIO_printf(Perl_debug_log, "minlen %ld ", (long) r->minlen);
ce862d02 2885 if (r->reganch & ROPT_EVAL_SEEN)
2886 PerlIO_printf(Perl_debug_log, "with eval ");
760ac839 2887 PerlIO_printf(Perl_debug_log, "\n");
17c3b450 2888#endif /* DEBUGGING */
a687059c 2889}
2890
2891/*
a0d0e21e 2892- regprop - printable representation of opcode
2893*/
46fc3d4c 2894void
c277df42 2895regprop(SV *sv, regnode *o)
a687059c 2896{
35ff7856 2897#ifdef DEBUGGING
5c0ca799 2898 dTHR;
a0d0e21e 2899 register char *p = 0;
2900
54dc92de 2901 sv_setpvn(sv, "", 0);
11343788 2902 switch (OP(o)) {
a0d0e21e 2903 case BOL:
2904 p = "BOL";
2905 break;
2906 case MBOL:
2907 p = "MBOL";
2908 break;
2909 case SBOL:
2910 p = "SBOL";
2911 break;
2912 case EOL:
2913 p = "EOL";
2914 break;
b85d18e9 2915 case EOS:
2916 p = "EOS";
2917 break;
a0d0e21e 2918 case MEOL:
2919 p = "MEOL";
2920 break;
2921 case SEOL:
2922 p = "SEOL";
2923 break;
22c35a8c 2924 case REG_ANY:
a0d0e21e 2925 p = "ANY";
2926 break;
2927 case SANY:
2928 p = "SANY";
2929 break;
a0ed51b3 2930 case ANYUTF8:
2931 p = "ANYUTF8";
2932 break;
2933 case SANYUTF8:
2934 p = "SANYUTF8";
2935 break;
2936 case ANYOFUTF8:
2937 p = "ANYOFUTF8";
2938 break;
a0d0e21e 2939 case ANYOF:
2940 p = "ANYOF";
2941 break;
2942 case BRANCH:
2943 p = "BRANCH";
2944 break;
bbce6d69 2945 case EXACT:
3280af22 2946 sv_catpvf(sv, "EXACT <%s%s%s>", PL_colors[0], OPERAND(o) + 1, PL_colors[1]);
bbce6d69 2947 break;
2948 case EXACTF:
3280af22 2949 sv_catpvf(sv, "EXACTF <%s%s%s>", PL_colors[0], OPERAND(o) + 1, PL_colors[1]);
bbce6d69 2950 break;
2951 case EXACTFL:
3280af22 2952 sv_catpvf(sv, "EXACTFL <%s%s%s>", PL_colors[0], OPERAND(o) + 1, PL_colors[1]);
a0d0e21e 2953 break;
2954 case NOTHING:
2955 p = "NOTHING";
2956 break;
c277df42 2957 case TAIL:
2958 p = "TAIL";
2959 break;
a0d0e21e 2960 case BACK:
2961 p = "BACK";
2962 break;
2963 case END:
2964 p = "END";
2965 break;
a0d0e21e 2966 case BOUND:
2967 p = "BOUND";
2968 break;
bbce6d69 2969 case BOUNDL:
2970 p = "BOUNDL";
2971 break;
a0d0e21e 2972 case NBOUND:
2973 p = "NBOUND";
2974 break;
bbce6d69 2975 case NBOUNDL:
2976 p = "NBOUNDL";
a0d0e21e 2977 break;
2978 case CURLY:
5dc0d613 2979 sv_catpvf(sv, "CURLY {%d,%d}", ARG1(o), ARG2(o));
a0d0e21e 2980 break;
c277df42 2981 case CURLYM:
c277df42 2982 sv_catpvf(sv, "CURLYM[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
c277df42 2983 break;
2984 case CURLYN:
c277df42 2985 sv_catpvf(sv, "CURLYN[%d] {%d,%d}", o->flags, ARG1(o), ARG2(o));
c277df42 2986 break;
a0d0e21e 2987 case CURLYX:
5dc0d613 2988 sv_catpvf(sv, "CURLYX {%d,%d}", ARG1(o), ARG2(o));
a0d0e21e 2989 break;
2990 case REF:
c277df42 2991 sv_catpvf(sv, "REF%d", ARG(o));
a0d0e21e 2992 break;
c8756f30 2993 case REFF:
c277df42 2994 sv_catpvf(sv, "REFF%d", ARG(o));
c8756f30 2995 break;
2996 case REFFL:
c277df42 2997 sv_catpvf(sv, "REFFL%d", ARG(o));
c8756f30 2998 break;
a0d0e21e 2999 case OPEN:
c277df42 3000 sv_catpvf(sv, "OPEN%d", ARG(o));
a0d0e21e 3001 break;
3002 case CLOSE:
c277df42 3003 sv_catpvf(sv, "CLOSE%d", ARG(o));
a0d0e21e 3004 p = NULL;
3005 break;
3006 case STAR:
3007 p = "STAR";
3008 break;
3009 case PLUS:
3010 p = "PLUS";
3011 break;
3012 case MINMOD:
3013 p = "MINMOD";
3014 break;
774d564b 3015 case GPOS:
3016 p = "GPOS";
a0d0e21e 3017 break;
3018 case UNLESSM:
c277df42 3019 sv_catpvf(sv, "UNLESSM[-%d]", o->flags);
a0d0e21e 3020 break;
3021 case IFMATCH:
c277df42 3022 sv_catpvf(sv, "IFMATCH[-%d]", o->flags);
a0d0e21e 3023 break;
3024 case SUCCEED:
3025 p = "SUCCEED";
3026 break;
3027 case WHILEM:
3028 p = "WHILEM";
3029 break;
bbce6d69 3030 case DIGIT:
3031 p = "DIGIT";
3032 break;
3033 case NDIGIT:
3034 p = "NDIGIT";
3035 break;
3036 case ALNUM:
3037 p = "ALNUM";
3038 break;
3039 case NALNUM:
3040 p = "NALNUM";
3041 break;
3042 case SPACE:
3043 p = "SPACE";
3044 break;
3045 case NSPACE:
3046 p = "NSPACE";
3047 break;
3048 case ALNUML:
3049 p = "ALNUML";
3050 break;
3051 case NALNUML:
3052 p = "NALNUML";
3053 break;
3054 case SPACEL:
3055 p = "SPACEL";
3056 break;
3057 case NSPACEL:
3058 p = "NSPACEL";
3059 break;
c277df42 3060 case EVAL:
3061 p = "EVAL";
3062 break;
3063 case LONGJMP:
3064 p = "LONGJMP";
3065 break;
3066 case BRANCHJ:
3067 p = "BRANCHJ";
3068 break;
3069 case IFTHEN:
3070 p = "IFTHEN";
3071 break;
3072 case GROUPP:
3073 sv_catpvf(sv, "GROUPP%d", ARG(o));
3074 break;
3075 case LOGICAL:
0f5d15d6 3076 sv_catpvf(sv, "LOGICAL[%d]", o->flags);
c277df42 3077 break;
3078 case SUSPEND:
3079 p = "SUSPEND";
3080 break;
3081 case RENUM:
3082 p = "RENUM";
3083 break;
3084 case OPTIMIZED:
3085 p = "OPTIMIZED";
3086 break;
a0d0e21e 3087 default:
3088 FAIL("corrupted regexp opcode");
3089 }
46fc3d4c 3090 if (p)
3091 sv_catpv(sv, p);
17c3b450 3092#endif /* DEBUGGING */
35ff7856 3093}
a687059c 3094
2b69d0c2 3095void
8ac85365 3096pregfree(struct regexp *r)
a687059c 3097{
5c0ca799 3098 dTHR;
c277df42 3099 if (!r || (--r->refcnt > 0))
a0d0e21e 3100 return;
c277df42 3101 if (r->precomp)
a0d0e21e 3102 Safefree(r->precomp);
c277df42 3103 if (r->subbase)
a0d0e21e 3104 Safefree(r->subbase);
a193d654 3105 if (r->substrs) {
3106 if (r->anchored_substr)
3107 SvREFCNT_dec(r->anchored_substr);
3108 if (r->float_substr)
3109 SvREFCNT_dec(r->float_substr);
2779dcf1 3110 Safefree(r->substrs);
a193d654 3111 }
c277df42 3112 if (r->data) {
3113 int n = r->data->count;
3114 while (--n >= 0) {
3115 switch (r->data->what[n]) {
3116 case 's':
3117 SvREFCNT_dec((SV*)r->data->data[n]);
3118 break;
3119 case 'o':
3120 op_free((OP_4tree*)r->data->data[n]);
3121 break;
3122 case 'n':
3123 break;
3124 default:
3125 FAIL2("panic: regfree data code '%c'", r->data->what[n]);
3126 }
3127 }
3128 Safefree(r->data->what);
3129 Safefree(r->data);
a0d0e21e 3130 }
3131 Safefree(r->startp);
3132 Safefree(r->endp);
3133 Safefree(r);
a687059c 3134}
c277df42 3135
3136/*
3137 - regnext - dig the "next" pointer out of a node
3138 *
3139 * [Note, when REGALIGN is defined there are two places in regmatch()
3140 * that bypass this code for speed.]
3141 */
3142regnode *
3143regnext(register regnode *p)
3144{
5c0ca799 3145 dTHR;
c277df42 3146 register I32 offset;
3147
3280af22 3148 if (p == &PL_regdummy)
c277df42 3149 return(NULL);
3150
3151 offset = (reg_off_by_arg[OP(p)] ? ARG(p) : NEXT_OFF(p));
3152 if (offset == 0)
3153 return(NULL);
3154
c277df42 3155 return(p+offset);
c277df42 3156}
3157
01f988be 3158STATIC void
c277df42 3159re_croak2(const char* pat1,const char* pat2,...)
c277df42 3160{
3161 va_list args;
3162 STRLEN l1 = strlen(pat1);
3163 STRLEN l2 = strlen(pat2);
3164 char buf[512];
3165 char *message;
3166
3167 if (l1 > 510)
3168 l1 = 510;
3169 if (l1 + l2 > 510)
3170 l2 = 510 - l1;
3171 Copy(pat1, buf, l1 , char);
3172 Copy(pat2, buf + l1, l2 , char);
3b818b81 3173 buf[l1 + l2] = '\n';
3174 buf[l1 + l2 + 1] = '\0';
c277df42 3175 va_start(args, pat2);
c277df42 3176 message = mess(buf, &args);
3177 va_end(args);
3178 l1 = strlen(message);
3179 if (l1 > 512)
3180 l1 = 512;
3181 Copy(message, buf, l1 , char);
3182 buf[l1] = '\0'; /* Overwrite \n */
3183 croak("%s", buf);
3184}
a0ed51b3 3185
3186/* XXX Here's a total kludge. But we need to re-enter for swash routines. */
3187
3188void
3189save_re_context(void)
c485e607 3190{
3191 dTHR;
a0ed51b3 3192 SAVEPPTR(PL_bostr);
3193 SAVEPPTR(PL_regprecomp); /* uncompiled string. */
3194 SAVEI32(PL_regnpar); /* () count. */
3195 SAVEI32(PL_regsize); /* Code size. */
3196 SAVEI16(PL_regflags); /* are we folding, multilining? */
3197 SAVEPPTR(PL_reginput); /* String-input pointer. */
3198 SAVEPPTR(PL_regbol); /* Beginning of input, for ^ check. */
3199 SAVEPPTR(PL_regeol); /* End of input, for $ check. */
3200 SAVESPTR(PL_regstartp); /* Pointer to startp array. */
3201 SAVESPTR(PL_regendp); /* Ditto for endp. */
3202 SAVESPTR(PL_reglastparen); /* Similarly for lastparen. */
3203 SAVEPPTR(PL_regtill); /* How far we are required to go. */
3204 SAVEI32(PL_regprev); /* char before regbol, \n if none */
3205 SAVESPTR(PL_reg_start_tmp); /* from regexec.c */
3206 PL_reg_start_tmp = 0;
3207 SAVEFREEPV(PL_reg_start_tmp);
3208 SAVEI32(PL_reg_start_tmpl); /* from regexec.c */
3209 PL_reg_start_tmpl = 0;
3210 SAVESPTR(PL_regdata);
3211 SAVEI32(PL_reg_flags); /* from regexec.c */
3212 SAVEI32(PL_reg_eval_set); /* from regexec.c */
3213 SAVEI32(PL_regnarrate); /* from regexec.c */
3214 SAVESPTR(PL_regprogram); /* from regexec.c */
3215 SAVEINT(PL_regindent); /* from regexec.c */
3216 SAVESPTR(PL_regcc); /* from regexec.c */
3217 SAVESPTR(PL_curcop);
3218 SAVESPTR(PL_regcomp_rx); /* from regcomp.c */
3219 SAVEI32(PL_regseen); /* from regcomp.c */
3220 SAVEI32(PL_regsawback); /* Did we see \1, ...? */
3221 SAVEI32(PL_regnaughty); /* How bad is this pattern? */
3222 SAVESPTR(PL_regcode); /* Code-emit pointer; &regdummy = don't */
3223 SAVEPPTR(PL_regxend); /* End of input for compile */
3224 SAVEPPTR(PL_regcomp_parse); /* Input-scan pointer. */
3225}
Unnamed repository; edit this file to name it for gitweb.