3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2005, 2006, 2007, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
10 #include "regcharclass.h"
12 /* Convert branch sequences to more efficient trie ops? */
13 #define PERL_ENABLE_TRIE_OPTIMISATION 1
15 /* Be really aggressive about optimising patterns with trie sequences? */
16 #define PERL_ENABLE_EXTENDED_TRIE_OPTIMISATION 1
18 /* Should the optimiser take positive assertions into account? */
19 #define PERL_ENABLE_POSITIVE_ASSERTION_STUDY 0
21 /* Not for production use: */
22 #define PERL_ENABLE_EXPERIMENTAL_REGEX_OPTIMISATIONS 0
24 /* Activate offsets code - set to if 1 to enable */
26 #define RE_TRACK_PATTERN_OFFSETS
30 * The "internal use only" fields in regexp.h are present to pass info from
31 * compile to execute that permits the execute phase to run lots faster on
32 * simple cases. They are:
34 * regstart sv that must begin a match; NULL if none obvious
35 * reganch is the match anchored (at beginning-of-line only)?
36 * regmust string (pointer into program) that match must include, or NULL
37 * [regmust changed to SV* for bminstr()--law]
38 * regmlen length of regmust string
39 * [regmlen not used currently]
41 * Regstart and reganch permit very fast decisions on suitable starting points
42 * for a match, cutting down the work a lot. Regmust permits fast rejection
43 * of lines that cannot possibly match. The regmust tests are costly enough
44 * that pregcomp() supplies a regmust only if the r.e. contains something
45 * potentially expensive (at present, the only such thing detected is * or +
46 * at the start of the r.e., which can involve a lot of backup). Regmlen is
47 * supplied because the test in pregexec() needs it and pregcomp() is computing
49 * [regmust is now supplied always. The tests that use regmust have a
50 * heuristic that disables the test if it usually matches.]
52 * [In fact, we now use regmust in many cases to locate where the search
53 * starts in the string, so if regback is >= 0, the regmust search is never
54 * wasted effort. The regback variable says how many characters back from
55 * where regmust matched is the earliest possible start of the match.
56 * For instance, /[a-z].foo/ has a regmust of 'foo' and a regback of 2.]
60 * Structure for regexp "program". This is essentially a linear encoding
61 * of a nondeterministic finite-state machine (aka syntax charts or
62 * "railroad normal form" in parsing technology). Each node is an opcode
63 * plus a "next" pointer, possibly plus an operand. "Next" pointers of
64 * all nodes except BRANCH implement concatenation; a "next" pointer with
65 * a BRANCH on both ends of it is connecting two alternatives. (Here we
66 * have one of the subtle syntax dependencies: an individual BRANCH (as
67 * opposed to a collection of them) is never concatenated with anything
68 * because of operator precedence.) The operand of some types of node is
69 * a literal string; for others, it is a node leading into a sub-FSM. In
70 * particular, the operand of a BRANCH node is the first node of the branch.
71 * (NB this is *not* a tree structure: the tail of the branch connects
72 * to the thing following the set of BRANCHes.) The opcodes are defined
73 * in regnodes.h which is generated from regcomp.sym by regcomp.pl.
77 * A node is one char of opcode followed by two chars of "next" pointer.
78 * "Next" pointers are stored as two 8-bit pieces, high order first. The
79 * value is a positive offset from the opcode of the node containing it.
80 * An operand, if any, simply follows the node. (Note that much of the
81 * code generation knows about this implicit relationship.)
83 * Using two bytes for the "next" pointer is vast overkill for most things,
84 * but allows patterns to get big without disasters.
86 * [The "next" pointer is always aligned on an even
87 * boundary, and reads the offset directly as a short.]
90 /* This is the stuff that used to live in regexp.h that was truly
91 private to the engine itself. It now lives here. */
95 typedef struct regexp_internal {
96 int name_list_idx; /* Optional data index of an array of paren names */
98 U32 *offsets; /* offset annotations 20001228 MJD
99 data about mapping the program to the
101 offsets[0] is proglen when this is used
106 regnode *regstclass; /* Optional startclass as identified or constructed
108 struct reg_data *data; /* Additional miscellaneous data used by the program.
109 Used to make it easier to clone and free arbitrary
110 data that the regops need. Often the ARG field of
111 a regop is an index into this structure */
112 struct reg_code_block *code_blocks;/* positions of literal (?{}) */
113 int num_code_blocks; /* size of code_blocks[] */
114 regnode program[1]; /* Unwarranted chumminess with compiler. */
117 #define RXi_SET(x,y) (x)->pprivate = (void*)(y)
118 #define RXi_GET(x) ((regexp_internal *)((x)->pprivate))
119 #define RXi_GET_DECL(r,ri) regexp_internal *ri = RXi_GET(r)
121 * Flags stored in regexp->intflags
122 * These are used only internally to the regexp engine
124 * See regexp.h for flags used externally to the regexp engine
126 #define RXp_INTFLAGS(rx) ((rx)->intflags)
127 #define RX_INTFLAGS(prog) RXp_INTFLAGS(ReANY(prog))
129 #define PREGf_SKIP 0x00000001
130 #define PREGf_IMPLICIT 0x00000002 /* Converted .* to ^.* */
131 #define PREGf_NAUGHTY 0x00000004 /* how exponential is this pattern? */
132 #define PREGf_VERBARG_SEEN 0x00000008
133 #define PREGf_CUTGROUP_SEEN 0x00000010
134 #define PREGf_USE_RE_EVAL 0x00000020 /* compiled with "use re 'eval'" */
135 /* these used to be extflags, but are now intflags */
136 #define PREGf_NOSCAN 0x00000040
138 #define PREGf_GPOS_SEEN 0x00000100
139 #define PREGf_GPOS_FLOAT 0x00000200
141 #define PREGf_ANCH_MBOL 0x00000400
142 #define PREGf_ANCH_SBOL 0x00000800
143 #define PREGf_ANCH_GPOS 0x00001000
146 ( PREGf_ANCH_SBOL | PREGf_ANCH_GPOS | PREGf_ANCH_MBOL )
148 /* this is where the old regcomp.h started */
150 struct regnode_string {
157 /* Argument bearing node - workhorse,
158 arg1 is often for the data field */
166 /* Similar to a regnode_1 but with an extra signed argument */
175 /* 'Two field' -- Two 16 bit unsigned args */
184 /* This give the number of code points that can be in the bitmap of an ANYOF
185 * node. The shift number must currently be one of: 8..12. It can't be less
186 * than 8 (256) because some code relies on it being at least that. Above 12
187 * (4096), and you start running into warnings that some data structure widths
188 * have been exceeded, though the test suite as of this writing still passes
189 * for up through 16, which is as high as anyone would ever want to go,
190 * encompassing all of the Unicode BMP, and thus including all the economically
191 * important world scripts. At 12 most of them are: including Arabic,
192 * Cyrillic, Greek, Hebrew, Indian subcontinent, Latin, and Thai; but not Han,
193 * Japanese, nor Korean. (The regarglen structure in regnodes.h is a U8, and
194 * the trie types TRIEC and AHOCORASICKC are larger than U8 for shift values
195 * below above 12.) Be sure to benchmark before changing, as larger sizes do
196 * significantly slow down the test suite */
197 #define NUM_ANYOF_CODE_POINTS (1 << 8)
199 #define ANYOF_BITMAP_SIZE (NUM_ANYOF_CODE_POINTS / 8) /* 8 bits/Byte */
201 /* Note that these form structs which are supersets of the next smaller one, by
202 * appending fields. Alignment problems can occur if one of those optional
203 * fields requires stricter alignment than the base struct. And formal
204 * parameters that can really be two or more of the structs should be
205 * declared as the smallest one it could be. See commit message for
206 * 7dcac5f6a5195002b55c935ee1d67f67e1df280b. Regnode allocation is done
207 * without regard to alignment, and changing it to would also require changing
208 * the code that inserts and deletes regnodes. The basic single-argument
209 * regnode has a U32, which is what reganode() allocates as a unit. Therefore
210 * no field can require stricter alignment than U32. */
212 /* also used by trie */
213 struct regnode_charclass {
217 U32 arg1; /* set by set_ANYOF_arg() */
218 char bitmap[ANYOF_BITMAP_SIZE]; /* only compile-time */
221 /* has runtime (locale) \d, \w, ..., [:posix:] classes */
222 struct regnode_charclass_class {
223 U8 flags; /* ANYOF_MATCHES_POSIXL bit must go here */
227 char bitmap[ANYOF_BITMAP_SIZE]; /* both compile-time ... */
228 U32 classflags; /* and run-time */
231 /* A synthetic start class (SSC); is a regnode_charclass_posixl_fold, plus an
232 * extra SV*, used only during its construction and which is not used by
233 * regexec.c. Note that the 'next_off' field is unused, as the SSC stands
234 * alone, so there is never a next node. Also, there is no alignment issue,
235 * because these are declared or allocated as a complete unit so the compiler
236 * takes care of alignment. This is unlike the other regnodes which are
237 * allocated in terms of multiples of a single-argument regnode. SSC nodes can
238 * have a pointer field because there is no alignment issue, and because it is
239 * set to NULL after construction, before any cloning of the pattern */
241 U8 flags; /* ANYOF_MATCHES_POSIXL bit must go here */
245 char bitmap[ANYOF_BITMAP_SIZE]; /* both compile-time ... */
246 U32 classflags; /* ... and run-time */
248 /* Auxiliary, only used during construction; NULL afterwards: list of code
253 /* We take advantage of 'next_off' not otherwise being used in the SSC by
254 * actually using it: by setting it to 1. This allows us to test and
255 * distinguish between an SSC and other ANYOF node types, as 'next_off' cannot
256 * otherwise be 1, because it is the offset to the next regnode expressed in
257 * units of regnodes. Since an ANYOF node contains extra fields, it adds up
258 * to 12 regnode units on 32-bit systems, (hence the minimum this can be (if
259 * not 0) is 11 there. Even if things get tightly packed on a 64-bit system,
260 * it still would be more than 1. */
261 #define set_ANYOF_SYNTHETIC(n) STMT_START{ OP(n) = ANYOF; \
264 #define is_ANYOF_SYNTHETIC(n) (OP(n) == ANYOF && NEXT_OFF(n) == 1)
266 /* XXX fix this description.
267 Impose a limit of REG_INFTY on various pattern matching operations
268 to limit stack growth and to avoid "infinite" recursions.
270 /* The default size for REG_INFTY is I16_MAX, which is the same as
271 SHORT_MAX (see perl.h). Unfortunately I16 isn't necessarily 16 bits
272 (see handy.h). On the Cray C90, sizeof(short)==4 and hence I16_MAX is
273 ((1<<31)-1), while on the Cray T90, sizeof(short)==8 and I16_MAX is
274 ((1<<63)-1). To limit stack growth to reasonable sizes, supply a
276 --Andy Dougherty 11 June 1998
280 # define REG_INFTY ((1<<15)-1)
285 # define REG_INFTY I16_MAX
288 #define ARG_VALUE(arg) (arg)
289 #define ARG__SET(arg,val) ((arg) = (val))
295 #define ARG(p) ARG_VALUE(ARG_LOC(p))
296 #define ARG1(p) ARG_VALUE(ARG1_LOC(p))
297 #define ARG2(p) ARG_VALUE(ARG2_LOC(p))
298 #define ARG2L(p) ARG_VALUE(ARG2L_LOC(p))
300 #define ARG_SET(p, val) ARG__SET(ARG_LOC(p), (val))
301 #define ARG1_SET(p, val) ARG__SET(ARG1_LOC(p), (val))
302 #define ARG2_SET(p, val) ARG__SET(ARG2_LOC(p), (val))
303 #define ARG2L_SET(p, val) ARG__SET(ARG2L_LOC(p), (val))
308 #define NEXT_OFF(p) ((p)->next_off)
309 #define NODE_ALIGN(node)
310 /* the following define was set to 0xde in 075abff3
311 * as part of some linting logic. I have set it to 0
312 * as otherwise in every place where we /might/ set flags
313 * we have to set it 0 explicitly, which duplicates
314 * assignments and IMO adds an unacceptable level of
315 * surprise to working in the regex engine. If this
316 * is changed from 0 then at the very least make sure
317 * that SBOL for /^/ sets the flags to 0 explicitly.
319 #define NODE_ALIGN_FILL(node) ((node)->flags = 0)
321 #define SIZE_ALIGN NODE_ALIGN
328 #define OP(p) ((p)->type)
329 #define FLAGS(p) ((p)->flags) /* Caution: Doesn't apply to all \
330 regnode types. For some, it's the \
331 character set of the regnode */
332 #define OPERAND(p) (((struct regnode_string *)p)->string)
333 #define MASK(p) ((char*)OPERAND(p))
334 #define STR_LEN(p) (((struct regnode_string *)p)->str_len)
335 #define STRING(p) (((struct regnode_string *)p)->string)
336 #define STR_SZ(l) ((l + sizeof(regnode) - 1) / sizeof(regnode))
337 #define NODE_SZ_STR(p) (STR_SZ(STR_LEN(p))+1)
344 #define NODE_ALIGN(node)
345 #define ARG_LOC(p) (((struct regnode_1 *)p)->arg1)
346 #define ARG1_LOC(p) (((struct regnode_2 *)p)->arg1)
347 #define ARG2_LOC(p) (((struct regnode_2 *)p)->arg2)
348 #define ARG2L_LOC(p) (((struct regnode_2L *)p)->arg2)
350 #define NODE_STEP_REGNODE 1 /* sizeof(regnode)/sizeof(regnode) */
351 #define EXTRA_STEP_2ARGS EXTRA_SIZE(struct regnode_2)
353 #define NODE_STEP_B 4
355 #define NEXTOPER(p) ((p) + NODE_STEP_REGNODE)
356 #define PREVOPER(p) ((p) - NODE_STEP_REGNODE)
358 #define FILL_ADVANCE_NODE(ptr, op) STMT_START { \
359 (ptr)->type = op; (ptr)->next_off = 0; (ptr)++; } STMT_END
360 #define FILL_ADVANCE_NODE_ARG(ptr, op, arg) STMT_START { \
361 ARG_SET(ptr, arg); FILL_ADVANCE_NODE(ptr, op); (ptr) += 1; } STMT_END
362 #define FILL_ADVANCE_NODE_2L_ARG(ptr, op, arg1, arg2) \
364 ARG_SET(ptr, arg1); \
365 ARG2L_SET(ptr, arg2); \
366 FILL_ADVANCE_NODE(ptr, op); \
370 #define REG_MAGIC 0234
372 #define SIZE_ONLY (RExC_emit == (regnode *) & RExC_emit_dummy)
373 #define PASS1 SIZE_ONLY
374 #define PASS2 (! SIZE_ONLY)
376 /* If the bitmap fully represents what this ANYOF node can match, the
377 * ARG is set to this special value (since 0, 1, ... are legal, but will never
378 * reach this high). */
379 #define ANYOF_ONLY_HAS_BITMAP ((U32) -1)
381 /* Flags for node->flags of ANYOF. These are in short supply, with none
382 * currently available. The ABOVE_BITMAP_ALL bit could be freed up
383 * by resorting to creating a swash containing everything above 255. This
384 * introduces a performance penalty. An option that wouldn't slow things down
385 * would be to split one of the two LOC flags out into a separate
386 * node, like what was done with ANYOF_NON_UTF8_NON_ASCII_ALL in commit
387 * 34fdef848b1687b91892ba55e9e0c3430e0770f6 (but which was reverted because it
388 * wasn't the best option available at the time), and using a LOC flag is
389 * probably better than that commit anyway. But it could be reinstated if we
390 * need a bit. The LOC flags are only for /l nodes; the reverted commit was
391 * only for /d, so there are no combinatorial issues. The LOC flag to use is
392 * probably the POSIXL one. Now that there is an ANYOFL (locale) node, another
393 * option would be to make all of those include the POSIXL data structure,
394 * which would get rid of needing a separate POSIXL flag. But it would
395 * increase the size of all such nodes, so it's probably not as atractive as
396 * having an ANYOF_POSIXL node type. But if we did do it, note that not all 32
397 * bits of that extra space are used, one bit of that could be set aside for
398 * the LOC_FOLD flag, yielding yet another bit. This would require extra code
399 * for masking, so again not the most attractive solution.
401 * Several flags are not used in synthetic start class (SSC) nodes, so could be
402 * shared should new flags be needed for SSCs, like SSC_MATCHES_EMPTY_STRING
405 /* regexec.c is expecting this to be in the low bit */
406 #define ANYOF_INVERT 0x01
408 /* For the SSC node only, which cannot be inverted, so is shared with that bit.
409 * This is used only during regex compilation. */
410 #define SSC_MATCHES_EMPTY_STRING ANYOF_INVERT
412 /* Are there things outside the bitmap that will match only if the target
413 * string is encoded in UTF-8? (This is not set if ANYOF_ABOVE_BITMAP_ALL is
415 #define ANYOF_HAS_UTF8_NONBITMAP_MATCHES 0x02
417 /* The fold is calculated and stored in the bitmap where possible at compile
418 * time. However under locale, the actual folding varies depending on
419 * what the locale is at the time of execution, so it has to be deferred until
421 #define ANYOF_LOC_FOLD 0x04
423 /* Set if this is a regnode_charclass_posixl vs a regnode_charclass. This
424 * is used for runtime \d, \w, [:posix:], ..., which are used only in locale
425 * and the optimizer's synthetic start class. Non-locale \d, etc are resolved
427 #define ANYOF_MATCHES_POSIXL 0x08
429 /* Should we raise a warning if matching against an above-Unicode code point?
431 #define ANYOF_WARN_SUPER 0x10
433 /* Can match something outside the bitmap that isn't in utf8 */
434 #define ANYOF_HAS_NONBITMAP_NON_UTF8_MATCHES 0x20
436 /* Matches every code point NUM_ANYOF_CODE_POINTS and above*/
437 #define ANYOF_MATCHES_ALL_ABOVE_BITMAP 0x40
439 /* Match all Latin1 characters that aren't ASCII when the target string is not
441 #define ANYOF_MATCHES_ALL_NON_UTF8_NON_ASCII 0x80
443 #define ANYOF_FLAGS_ALL (0xff)
445 #define ANYOF_LOCALE_FLAGS (ANYOF_LOC_FOLD | ANYOF_MATCHES_POSIXL)
447 /* These are the flags that apply to both regular ANYOF nodes and synthetic
448 * start class nodes during construction of the SSC. During finalization of
449 * the SSC, other of the flags could be added to it */
450 #define ANYOF_COMMON_FLAGS (ANYOF_WARN_SUPER|ANYOF_HAS_UTF8_NONBITMAP_MATCHES)
452 /* Character classes for node->classflags of ANYOF */
453 /* Should be synchronized with a table in regprop() */
454 /* 2n should be the normal one, paired with its complement at 2n+1 */
456 #define ANYOF_ALPHA ((_CC_ALPHA) * 2)
457 #define ANYOF_NALPHA ((ANYOF_ALPHA) + 1)
458 #define ANYOF_ALPHANUMERIC ((_CC_ALPHANUMERIC) * 2) /* [[:alnum:]] isalnum(3), utf8::IsAlnum */
459 #define ANYOF_NALPHANUMERIC ((ANYOF_ALPHANUMERIC) + 1)
460 #define ANYOF_ASCII ((_CC_ASCII) * 2)
461 #define ANYOF_NASCII ((ANYOF_ASCII) + 1)
462 #define ANYOF_BLANK ((_CC_BLANK) * 2) /* GNU extension: space and tab: non-vertical space */
463 #define ANYOF_NBLANK ((ANYOF_BLANK) + 1)
464 #define ANYOF_CASED ((_CC_CASED) * 2) /* Pseudo class for [:lower:] or
465 [:upper:] under /i */
466 #define ANYOF_NCASED ((ANYOF_CASED) + 1)
467 #define ANYOF_CNTRL ((_CC_CNTRL) * 2)
468 #define ANYOF_NCNTRL ((ANYOF_CNTRL) + 1)
469 #define ANYOF_DIGIT ((_CC_DIGIT) * 2) /* \d */
470 #define ANYOF_NDIGIT ((ANYOF_DIGIT) + 1)
471 #define ANYOF_GRAPH ((_CC_GRAPH) * 2)
472 #define ANYOF_NGRAPH ((ANYOF_GRAPH) + 1)
473 #define ANYOF_LOWER ((_CC_LOWER) * 2)
474 #define ANYOF_NLOWER ((ANYOF_LOWER) + 1)
475 #define ANYOF_PRINT ((_CC_PRINT) * 2)
476 #define ANYOF_NPRINT ((ANYOF_PRINT) + 1)
477 #define ANYOF_PUNCT ((_CC_PUNCT) * 2)
478 #define ANYOF_NPUNCT ((ANYOF_PUNCT) + 1)
479 #define ANYOF_SPACE ((_CC_SPACE) * 2) /* \s */
480 #define ANYOF_NSPACE ((ANYOF_SPACE) + 1)
481 #define ANYOF_UPPER ((_CC_UPPER) * 2)
482 #define ANYOF_NUPPER ((ANYOF_UPPER) + 1)
483 #define ANYOF_WORDCHAR ((_CC_WORDCHAR) * 2) /* \w, PL_utf8_alnum, utf8::IsWord, ALNUM */
484 #define ANYOF_NWORDCHAR ((ANYOF_WORDCHAR) + 1)
485 #define ANYOF_XDIGIT ((_CC_XDIGIT) * 2)
486 #define ANYOF_NXDIGIT ((ANYOF_XDIGIT) + 1)
488 /* pseudo classes below this, not stored in the class bitmap, but used as flags
489 during compilation of char classes */
491 #define ANYOF_VERTWS ((_CC_VERTSPACE) * 2)
492 #define ANYOF_NVERTWS ((ANYOF_VERTWS)+1)
494 /* It is best if this is the last one, as all above it are stored as bits in a
495 * bitmap, and it isn't part of that bitmap */
496 #if _CC_VERTSPACE != _HIGHEST_REGCOMP_DOT_H_SYNC
497 # error Problem with handy.h _HIGHEST_REGCOMP_DOT_H_SYNC #define
500 #define ANYOF_POSIXL_MAX (ANYOF_VERTWS) /* So upper loop limit is written:
502 * Hence doesn't include VERTWS, as that
503 * is a pseudo class */
504 #define ANYOF_MAX ANYOF_POSIXL_MAX
506 #if (ANYOF_POSIXL_MAX > 32) /* Must fit in 32-bit word */
507 # error Problem with handy.h _CC_foo #defines
510 #define ANYOF_HORIZWS ((ANYOF_POSIXL_MAX)+2) /* = (ANYOF_NVERTWS + 1) */
511 #define ANYOF_NHORIZWS ((ANYOF_POSIXL_MAX)+3)
513 #define ANYOF_UNIPROP ((ANYOF_POSIXL_MAX)+4) /* Used to indicate a Unicode
514 property: \p{} or \P{} */
516 /* Backward source code compatibility. */
518 #define ANYOF_ALNUML ANYOF_ALNUM
519 #define ANYOF_NALNUML ANYOF_NALNUM
520 #define ANYOF_SPACEL ANYOF_SPACE
521 #define ANYOF_NSPACEL ANYOF_NSPACE
522 #define ANYOF_ALNUM ANYOF_WORDCHAR
523 #define ANYOF_NALNUM ANYOF_NWORDCHAR
525 /* Utility macros for the bitmap and classes of ANYOF */
527 #define ANYOF_FLAGS(p) ((p)->flags)
529 #define ANYOF_BIT(c) (1U << ((c) & 7))
531 #define ANYOF_POSIXL_SET(p, c) (((regnode_charclass_posixl*) (p))->classflags |= (1U << (c)))
532 #define ANYOF_CLASS_SET(p, c) ANYOF_POSIXL_SET((p), (c))
534 #define ANYOF_POSIXL_CLEAR(p, c) (((regnode_charclass_posixl*) (p))->classflags &= ~ (1U <<(c)))
535 #define ANYOF_CLASS_CLEAR(p, c) ANYOF_POSIXL_CLEAR((p), (c))
537 #define ANYOF_POSIXL_TEST(p, c) (((regnode_charclass_posixl*) (p))->classflags & (1U << (c)))
538 #define ANYOF_CLASS_TEST(p, c) ANYOF_POSIXL_TEST((p), (c))
540 #define ANYOF_POSIXL_ZERO(ret) STMT_START { ((regnode_charclass_posixl*) (ret))->classflags = 0; } STMT_END
541 #define ANYOF_CLASS_ZERO(ret) ANYOF_POSIXL_ZERO(ret)
543 /* Shifts a bit to get, eg. 0x4000_0000, then subtracts 1 to get 0x3FFF_FFFF */
544 #define ANYOF_POSIXL_SETALL(ret) STMT_START { ((regnode_charclass_posixl*) (ret))->classflags = ((1U << ((ANYOF_POSIXL_MAX) - 1))) - 1; } STMT_END
545 #define ANYOF_CLASS_SETALL(ret) ANYOF_POSIXL_SETALL(ret)
547 #define ANYOF_POSIXL_TEST_ANY_SET(p) \
548 ((ANYOF_FLAGS(p) & ANYOF_MATCHES_POSIXL) \
549 && (((regnode_charclass_posixl*)(p))->classflags))
550 #define ANYOF_CLASS_TEST_ANY_SET(p) ANYOF_POSIXL_TEST_ANY_SET(p)
552 /* Since an SSC always has this field, we don't have to test for that; nor do
553 * we want to because the bit isn't set for SSC during its construction */
554 #define ANYOF_POSIXL_SSC_TEST_ANY_SET(p) \
555 cBOOL(((regnode_ssc*)(p))->classflags)
556 #define ANYOF_POSIXL_SSC_TEST_ALL_SET(p) /* Are all bits set? */ \
557 (((regnode_ssc*) (p))->classflags \
558 == ((1U << ((ANYOF_POSIXL_MAX) - 1))) - 1)
560 #define ANYOF_POSIXL_TEST_ALL_SET(p) \
561 ((ANYOF_FLAGS(p) & ANYOF_MATCHES_POSIXL) \
562 && ((regnode_charclass_posixl*) (p))->classflags \
563 == ((1U << ((ANYOF_POSIXL_MAX) - 1))) - 1)
565 #define ANYOF_POSIXL_OR(source, dest) STMT_START { (dest)->classflags |= (source)->classflags ; } STMT_END
566 #define ANYOF_CLASS_OR(source, dest) ANYOF_POSIXL_OR((source), (dest))
568 #define ANYOF_POSIXL_AND(source, dest) STMT_START { (dest)->classflags &= (source)->classflags ; } STMT_END
570 #define ANYOF_BITMAP_ZERO(ret) Zero(((struct regnode_charclass*)(ret))->bitmap, ANYOF_BITMAP_SIZE, char)
571 #define ANYOF_BITMAP(p) (((struct regnode_charclass*)(p))->bitmap)
572 #define ANYOF_BITMAP_BYTE(p, c) (ANYOF_BITMAP(p)[(((U8)(c)) >> 3) & 31])
573 #define ANYOF_BITMAP_SET(p, c) (ANYOF_BITMAP_BYTE(p, c) |= ANYOF_BIT(c))
574 #define ANYOF_BITMAP_CLEAR(p,c) (ANYOF_BITMAP_BYTE(p, c) &= ~ANYOF_BIT(c))
575 #define ANYOF_BITMAP_TEST(p, c) cBOOL(ANYOF_BITMAP_BYTE(p, c) & ANYOF_BIT(c))
577 #define ANYOF_BITMAP_SETALL(p) \
578 memset (ANYOF_BITMAP(p), 255, ANYOF_BITMAP_SIZE)
579 #define ANYOF_BITMAP_CLEARALL(p) \
580 Zero (ANYOF_BITMAP(p), ANYOF_BITMAP_SIZE)
582 #define ANYOF_SKIP EXTRA_SIZE(struct regnode_charclass)
583 #define ANYOF_POSIXL_SKIP EXTRA_SIZE(regnode_charclass_posixl)
586 * Utility definitions.
589 # define UCHARAT(p) ((int)*(const U8*)(p))
591 # define UCHARAT(p) ((int)*(p)&CHARMASK)
594 #define EXTRA_SIZE(guy) ((sizeof(guy)-1)/sizeof(struct regnode))
596 #define REG_ZERO_LEN_SEEN 0x00000001
597 #define REG_LOOKBEHIND_SEEN 0x00000002
598 #define REG_GPOS_SEEN 0x00000004
600 #define REG_RECURSE_SEEN 0x00000020
601 #define REG_TOP_LEVEL_BRANCHES_SEEN 0x00000040
602 #define REG_VERBARG_SEEN 0x00000080
603 #define REG_CUTGROUP_SEEN 0x00000100
604 #define REG_RUN_ON_COMMENT_SEEN 0x00000200
605 #define REG_UNFOLDED_MULTI_SEEN 0x00000400
606 #define REG_GOSTART_SEEN 0x00000800
607 #define REG_UNBOUNDED_QUANTIFIER_SEEN 0x00001000
612 #ifdef PLUGGABLE_RE_EXTENSION
613 #include "re_nodes.h"
615 #include "regnodes.h"
618 #ifndef PLUGGABLE_RE_EXTENSION
620 EXTCONST regexp_engine PL_core_reg_engine;
622 EXTCONST regexp_engine PL_core_reg_engine = {
625 Perl_re_intuit_start,
626 Perl_re_intuit_string,
627 Perl_regfree_internal,
628 Perl_reg_numbered_buff_fetch,
629 Perl_reg_numbered_buff_store,
630 Perl_reg_numbered_buff_length,
632 Perl_reg_named_buff_iter,
634 #if defined(USE_ITHREADS)
635 Perl_regdupe_internal,
640 #endif /* PLUGGABLE_RE_EXTENSION */
646 /* .what is a character array with one character for each member of .data
647 * The character describes the function of the corresponding .data item:
648 * a - AV for paren_name_list under DEBUGGING
649 * f - start-class data for regstclass optimization
650 * l - start op for literal (?{EVAL}) item
651 * L - start op for literal (?{EVAL}) item, with separate CV (qr//)
652 * r - pointer to an embedded code-containing qr, e.g. /ab$qr/
653 * s - swash for Unicode-style character class, and the multicharacter
654 * strings resulting from casefolding the single-character entries
655 * in the character class
657 * u - trie struct's widecharmap (a HV, so can't share, must dup)
658 * also used for revcharmap and words under DEBUGGING
659 * T - aho-trie struct
660 * S - sv for named capture lookup
661 * 20010712 mjd@plover.com
662 * (Remember to update re_dup() and pregfree() if you add any items.)
670 /* Code in S_to_utf8_substr() and S_to_byte_substr() in regexec.c accesses
671 anchored* and float* via array indexes 0 and 1. */
672 #define anchored_substr substrs->data[0].substr
673 #define anchored_utf8 substrs->data[0].utf8_substr
674 #define anchored_offset substrs->data[0].min_offset
675 #define anchored_end_shift substrs->data[0].end_shift
677 #define float_substr substrs->data[1].substr
678 #define float_utf8 substrs->data[1].utf8_substr
679 #define float_min_offset substrs->data[1].min_offset
680 #define float_max_offset substrs->data[1].max_offset
681 #define float_end_shift substrs->data[1].end_shift
683 #define check_substr substrs->data[2].substr
684 #define check_utf8 substrs->data[2].utf8_substr
685 #define check_offset_min substrs->data[2].min_offset
686 #define check_offset_max substrs->data[2].max_offset
687 #define check_end_shift substrs->data[2].end_shift
689 #define RX_ANCHORED_SUBSTR(rx) (ReANY(rx)->anchored_substr)
690 #define RX_ANCHORED_UTF8(rx) (ReANY(rx)->anchored_utf8)
691 #define RX_FLOAT_SUBSTR(rx) (ReANY(rx)->float_substr)
692 #define RX_FLOAT_UTF8(rx) (ReANY(rx)->float_utf8)
694 /* trie related stuff */
696 /* a transition record for the state machine. the
697 check field determines which state "owns" the
698 transition. the char the transition is for is
699 determined by offset from the owning states base
700 field. the next field determines which state
701 is to be transitioned to if any.
703 struct _reg_trie_trans {
708 /* a transition list element for the list based representation */
709 struct _reg_trie_trans_list_elem {
713 typedef struct _reg_trie_trans_list_elem reg_trie_trans_le;
715 /* a state for compressed nodes. base is an offset
716 into an array of reg_trie_trans array. If wordnum is
717 nonzero the state is accepting. if base is zero then
718 the state has no children (and will be accepting)
720 struct _reg_trie_state {
724 reg_trie_trans_le* list;
728 /* info per word; indexed by wordnum */
730 U16 prev; /* previous word in acceptance chain; eg in
731 * zzz|abc|ab/ after matching the chars abc, the
732 * accepted word is #2, and the previous accepted
734 U32 len; /* how many chars long is this word? */
735 U32 accept; /* accept state for this word */
739 typedef struct _reg_trie_state reg_trie_state;
740 typedef struct _reg_trie_trans reg_trie_trans;
743 /* anything in here that needs to be freed later
744 should be dealt with in pregfree.
745 refcount is first in both this and _reg_ac_data to allow a space
746 optimisation in Perl_regdupe. */
747 struct _reg_trie_data {
748 U32 refcount; /* number of times this trie is referenced */
749 U32 lasttrans; /* last valid transition element */
750 U16 *charmap; /* byte to charid lookup array */
751 reg_trie_state *states; /* state data */
752 reg_trie_trans *trans; /* array of transition elements */
753 char *bitmap; /* stclass bitmap */
754 U16 *jump; /* optional 1 indexed array of offsets before tail
755 for the node following a given word. */
756 reg_trie_wordinfo *wordinfo; /* array of info per word */
757 U16 uniquecharcount; /* unique chars in trie (width of trans table) */
758 U32 startstate; /* initial state - used for common prefix optimisation */
759 STRLEN minlen; /* minimum length of words in trie - build/opt only? */
760 STRLEN maxlen; /* maximum length of words in trie - build/opt only? */
761 U32 prefixlen; /* #chars in common prefix */
762 U32 statecount; /* Build only - number of states in the states array
763 (including the unused zero state) */
764 U32 wordcount; /* Build only */
766 STRLEN charcount; /* Build only */
769 /* There is one (3 under DEBUGGING) pointers that logically belong in this
770 structure, but are held outside as they need duplication on thread cloning,
771 whereas the rest of the structure can be read only:
772 HV *widecharmap; code points > 255 to charid
774 AV *words; Array of words contained in trie, for dumping
775 AV *revcharmap; Map of each charid back to its character representation
779 #define TRIE_WORDS_OFFSET 2
781 typedef struct _reg_trie_data reg_trie_data;
783 /* refcount is first in both this and _reg_trie_data to allow a space
784 optimisation in Perl_regdupe. */
785 struct _reg_ac_data {
789 reg_trie_state *states;
791 typedef struct _reg_ac_data reg_ac_data;
793 /* ANY_BIT doesn't use the structure, so we can borrow it here.
794 This is simpler than refactoring all of it as wed end up with
795 three different sets... */
797 #define TRIE_BITMAP(p) (((reg_trie_data *)(p))->bitmap)
798 #define TRIE_BITMAP_BYTE(p, c) (TRIE_BITMAP(p)[(((U8)(c)) >> 3) & 31])
799 #define TRIE_BITMAP_SET(p, c) (TRIE_BITMAP_BYTE(p, c) |= ANYOF_BIT((U8)c))
800 #define TRIE_BITMAP_CLEAR(p,c) (TRIE_BITMAP_BYTE(p, c) &= ~ANYOF_BIT((U8)c))
801 #define TRIE_BITMAP_TEST(p, c) (TRIE_BITMAP_BYTE(p, c) & ANYOF_BIT((U8)c))
803 #define IS_ANYOF_TRIE(op) ((op)==TRIEC || (op)==AHOCORASICKC)
804 #define IS_TRIE_AC(op) ((op)>=AHOCORASICK)
807 #define BITMAP_BYTE(p, c) (((U8*)p)[(((U8)(c)) >> 3) & 31])
808 #define BITMAP_TEST(p, c) (BITMAP_BYTE(p, c) & ANYOF_BIT((U8)c))
810 /* these defines assume uniquecharcount is the correct variable, and state may be evaluated twice */
811 #define TRIE_NODENUM(state) (((state)-1)/(trie->uniquecharcount)+1)
812 #define SAFE_TRIE_NODENUM(state) ((state) ? (((state)-1)/(trie->uniquecharcount)+1) : (state))
813 #define TRIE_NODEIDX(state) ((state) ? (((state)-1)*(trie->uniquecharcount)+1) : (state))
816 #define TRIE_CHARCOUNT(trie) ((trie)->charcount)
818 #define TRIE_CHARCOUNT(trie) (trie_charcount)
821 #define RE_TRIE_MAXBUF_INIT 65536
822 #define RE_TRIE_MAXBUF_NAME "\022E_TRIE_MAXBUF"
823 #define RE_DEBUG_FLAGS "\022E_DEBUG_FLAGS"
827 RE_DEBUG_FLAGS is used to control what debug output is emitted
828 its divided into three groups of options, some of which interact.
829 The three groups are: Compile, Execute, Extra. There is room for a
830 further group, as currently only the low three bytes are used.
851 If you modify any of these make sure you make corresponding changes to
852 re.pm, especially to the documentation.
858 #define RE_DEBUG_COMPILE_MASK 0x0000FF
859 #define RE_DEBUG_COMPILE_PARSE 0x000001
860 #define RE_DEBUG_COMPILE_OPTIMISE 0x000002
861 #define RE_DEBUG_COMPILE_TRIE 0x000004
862 #define RE_DEBUG_COMPILE_DUMP 0x000008
863 #define RE_DEBUG_COMPILE_FLAGS 0x000010
864 #define RE_DEBUG_COMPILE_TEST 0x000020
867 #define RE_DEBUG_EXECUTE_MASK 0x00FF00
868 #define RE_DEBUG_EXECUTE_INTUIT 0x000100
869 #define RE_DEBUG_EXECUTE_MATCH 0x000200
870 #define RE_DEBUG_EXECUTE_TRIE 0x000400
873 #define RE_DEBUG_EXTRA_MASK 0xFF0000
874 #define RE_DEBUG_EXTRA_TRIE 0x010000
875 #define RE_DEBUG_EXTRA_OFFSETS 0x020000
876 #define RE_DEBUG_EXTRA_OFFDEBUG 0x040000
877 #define RE_DEBUG_EXTRA_STATE 0x080000
878 #define RE_DEBUG_EXTRA_OPTIMISE 0x100000
879 #define RE_DEBUG_EXTRA_BUFFERS 0x400000
880 #define RE_DEBUG_EXTRA_GPOS 0x800000
882 #define RE_DEBUG_EXTRA_STACK 0x280000
884 #define RE_DEBUG_FLAG(x) (re_debug_flags & x)
886 #define DEBUG_COMPILE_r(x) DEBUG_r( \
887 if (re_debug_flags & RE_DEBUG_COMPILE_MASK) x )
888 #define DEBUG_PARSE_r(x) DEBUG_r( \
889 if (re_debug_flags & RE_DEBUG_COMPILE_PARSE) x )
890 #define DEBUG_OPTIMISE_r(x) DEBUG_r( \
891 if (re_debug_flags & RE_DEBUG_COMPILE_OPTIMISE) x )
892 #define DEBUG_PARSE_r(x) DEBUG_r( \
893 if (re_debug_flags & RE_DEBUG_COMPILE_PARSE) x )
894 #define DEBUG_DUMP_r(x) DEBUG_r( \
895 if (re_debug_flags & RE_DEBUG_COMPILE_DUMP) x )
896 #define DEBUG_TRIE_COMPILE_r(x) DEBUG_r( \
897 if (re_debug_flags & RE_DEBUG_COMPILE_TRIE) x )
898 #define DEBUG_FLAGS_r(x) DEBUG_r( \
899 if (re_debug_flags & RE_DEBUG_COMPILE_FLAGS) x )
900 #define DEBUG_TEST_r(x) DEBUG_r( \
901 if (re_debug_flags & RE_DEBUG_COMPILE_TEST) x )
903 #define DEBUG_EXECUTE_r(x) DEBUG_r( \
904 if (re_debug_flags & RE_DEBUG_EXECUTE_MASK) x )
905 #define DEBUG_INTUIT_r(x) DEBUG_r( \
906 if (re_debug_flags & RE_DEBUG_EXECUTE_INTUIT) x )
907 #define DEBUG_MATCH_r(x) DEBUG_r( \
908 if (re_debug_flags & RE_DEBUG_EXECUTE_MATCH) x )
909 #define DEBUG_TRIE_EXECUTE_r(x) DEBUG_r( \
910 if (re_debug_flags & RE_DEBUG_EXECUTE_TRIE) x )
913 #define DEBUG_EXTRA_r(x) DEBUG_r( \
914 if (re_debug_flags & RE_DEBUG_EXTRA_MASK) x )
915 #define DEBUG_OFFSETS_r(x) DEBUG_r( \
916 if (re_debug_flags & RE_DEBUG_EXTRA_OFFSETS) x )
917 #define DEBUG_STATE_r(x) DEBUG_r( \
918 if (re_debug_flags & RE_DEBUG_EXTRA_STATE) x )
919 #define DEBUG_STACK_r(x) DEBUG_r( \
920 if (re_debug_flags & RE_DEBUG_EXTRA_STACK) x )
921 #define DEBUG_BUFFERS_r(x) DEBUG_r( \
922 if (re_debug_flags & RE_DEBUG_EXTRA_BUFFERS) x )
924 #define DEBUG_OPTIMISE_MORE_r(x) DEBUG_r( \
925 if ((RE_DEBUG_EXTRA_OPTIMISE|RE_DEBUG_COMPILE_OPTIMISE) == \
926 (re_debug_flags & (RE_DEBUG_EXTRA_OPTIMISE|RE_DEBUG_COMPILE_OPTIMISE)) ) x )
927 #define MJD_OFFSET_DEBUG(x) DEBUG_r( \
928 if (re_debug_flags & RE_DEBUG_EXTRA_OFFDEBUG) \
929 Perl_warn_nocontext x )
930 #define DEBUG_TRIE_COMPILE_MORE_r(x) DEBUG_TRIE_COMPILE_r( \
931 if (re_debug_flags & RE_DEBUG_EXTRA_TRIE) x )
932 #define DEBUG_TRIE_EXECUTE_MORE_r(x) DEBUG_TRIE_EXECUTE_r( \
933 if (re_debug_flags & RE_DEBUG_EXTRA_TRIE) x )
935 #define DEBUG_TRIE_r(x) DEBUG_r( \
936 if (re_debug_flags & (RE_DEBUG_COMPILE_TRIE \
937 | RE_DEBUG_EXECUTE_TRIE )) x )
938 #define DEBUG_GPOS_r(x) DEBUG_r( \
939 if (re_debug_flags & RE_DEBUG_EXTRA_GPOS) x )
942 /* get_sv() can return NULL during global destruction. */
943 #define GET_RE_DEBUG_FLAGS DEBUG_r({ \
944 SV * re_debug_flags_sv = NULL; \
945 re_debug_flags_sv = get_sv(RE_DEBUG_FLAGS, 1); \
946 if (re_debug_flags_sv) { \
947 if (!SvIOK(re_debug_flags_sv)) \
948 sv_setuv(re_debug_flags_sv, RE_DEBUG_COMPILE_DUMP | RE_DEBUG_EXECUTE_MASK ); \
949 re_debug_flags=SvIV(re_debug_flags_sv); \
955 #define GET_RE_DEBUG_FLAGS_DECL VOL IV re_debug_flags = 0; \
956 PERL_UNUSED_VAR(re_debug_flags); GET_RE_DEBUG_FLAGS;
958 #define RE_PV_COLOR_DECL(rpv,rlen,isuni,dsv,pv,l,m,c1,c2) \
959 const char * const rpv = \
960 pv_pretty((dsv), (pv), (l), (m), \
961 PL_colors[(c1)],PL_colors[(c2)], \
962 PERL_PV_ESCAPE_RE|PERL_PV_ESCAPE_NONASCII |((isuni) ? PERL_PV_ESCAPE_UNI : 0) ); \
963 const int rlen = SvCUR(dsv)
965 #define RE_SV_ESCAPE(rpv,isuni,dsv,sv,m) \
966 const char * const rpv = \
967 pv_pretty((dsv), (SvPV_nolen_const(sv)), (SvCUR(sv)), (m), \
968 PL_colors[(c1)],PL_colors[(c2)], \
969 PERL_PV_ESCAPE_RE|PERL_PV_ESCAPE_NONASCII |((isuni) ? PERL_PV_ESCAPE_UNI : 0) )
971 #define RE_PV_QUOTED_DECL(rpv,isuni,dsv,pv,l,m) \
972 const char * const rpv = \
973 pv_pretty((dsv), (pv), (l), (m), \
974 PL_colors[0], PL_colors[1], \
975 ( PERL_PV_PRETTY_QUOTE | PERL_PV_ESCAPE_RE | PERL_PV_ESCAPE_NONASCII | PERL_PV_PRETTY_ELLIPSES | \
976 ((isuni) ? PERL_PV_ESCAPE_UNI : 0)) \
979 #define RE_SV_DUMPLEN(ItEm) (SvCUR(ItEm) - (SvTAIL(ItEm)!=0))
980 #define RE_SV_TAIL(ItEm) (SvTAIL(ItEm) ? "$" : "")
982 #else /* if not DEBUGGING */
984 #define GET_RE_DEBUG_FLAGS_DECL
985 #define RE_PV_COLOR_DECL(rpv,rlen,isuni,dsv,pv,l,m,c1,c2)
986 #define RE_SV_ESCAPE(rpv,isuni,dsv,sv,m)
987 #define RE_PV_QUOTED_DECL(rpv,isuni,dsv,pv,l,m)
988 #define RE_SV_DUMPLEN(ItEm)
989 #define RE_SV_TAIL(ItEm)
991 #endif /* DEBUG RELATED DEFINES */
994 TRADITIONAL_BOUND = _CC_WORDCHAR,
1001 * ex: set ts=8 sts=4 sw=4 et: