This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
regex: Add pseudo-Posix class: 'cased'
[perl5.git] / regcomp.h
CommitLineData
a0d0e21e 1/* regcomp.h
d6376244 2 *
4bb101f2 3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
663f364b 4 * 2000, 2001, 2002, 2003, 2005, 2006, 2007, by Larry Wall and others
d6376244
JH
5 *
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.
8 *
a687059c 9 */
e1d1eefb 10#include "regcharclass.h"
a687059c 11
58e23c8d 12/* Convert branch sequences to more efficient trie ops? */
07be1b83 13#define PERL_ENABLE_TRIE_OPTIMISATION 1
58e23c8d 14
486ec47a 15/* Be really aggressive about optimising patterns with trie sequences? */
07be1b83 16#define PERL_ENABLE_EXTENDED_TRIE_OPTIMISATION 1
58e23c8d
YO
17
18/* Should the optimiser take positive assertions into account? */
68ba3a3f 19#define PERL_ENABLE_POSITIVE_ASSERTION_STUDY 0
58e23c8d
YO
20
21/* Not for production use: */
07be1b83 22#define PERL_ENABLE_EXPERIMENTAL_REGEX_OPTIMISATIONS 0
58e23c8d 23
7122b237
YO
24/* Activate offsets code - set to if 1 to enable */
25#ifdef DEBUGGING
26#define RE_TRACK_PATTERN_OFFSETS
27#endif
28
b9b4dddf
YO
29/* Unless the next line is uncommented it is illegal to combine lazy
30 matching with possessive matching. Frankly it doesn't make much sense
31 to allow it as X*?+ matches nothing, X+?+ matches a single char only,
32 and X{min,max}?+ matches min times only.
33 */
34/* #define REG_ALLOW_MINMOD_SUSPEND */
07be1b83 35
a687059c
LW
36/*
37 * The "internal use only" fields in regexp.h are present to pass info from
38 * compile to execute that permits the execute phase to run lots faster on
39 * simple cases. They are:
40 *
bd61b366 41 * regstart sv that must begin a match; NULL if none obvious
a687059c
LW
42 * reganch is the match anchored (at beginning-of-line only)?
43 * regmust string (pointer into program) that match must include, or NULL
79072805 44 * [regmust changed to SV* for bminstr()--law]
a687059c
LW
45 * regmlen length of regmust string
46 * [regmlen not used currently]
47 *
48 * Regstart and reganch permit very fast decisions on suitable starting points
49 * for a match, cutting down the work a lot. Regmust permits fast rejection
50 * of lines that cannot possibly match. The regmust tests are costly enough
e50aee73 51 * that pregcomp() supplies a regmust only if the r.e. contains something
a687059c
LW
52 * potentially expensive (at present, the only such thing detected is * or +
53 * at the start of the r.e., which can involve a lot of backup). Regmlen is
e50aee73 54 * supplied because the test in pregexec() needs it and pregcomp() is computing
a687059c
LW
55 * it anyway.
56 * [regmust is now supplied always. The tests that use regmust have a
57 * heuristic that disables the test if it usually matches.]
58 *
59 * [In fact, we now use regmust in many cases to locate where the search
60 * starts in the string, so if regback is >= 0, the regmust search is never
61 * wasted effort. The regback variable says how many characters back from
62 * where regmust matched is the earliest possible start of the match.
63 * For instance, /[a-z].foo/ has a regmust of 'foo' and a regback of 2.]
64 */
65
66/*
67 * Structure for regexp "program". This is essentially a linear encoding
68 * of a nondeterministic finite-state machine (aka syntax charts or
69 * "railroad normal form" in parsing technology). Each node is an opcode
70 * plus a "next" pointer, possibly plus an operand. "Next" pointers of
71 * all nodes except BRANCH implement concatenation; a "next" pointer with
72 * a BRANCH on both ends of it is connecting two alternatives. (Here we
73 * have one of the subtle syntax dependencies: an individual BRANCH (as
74 * opposed to a collection of them) is never concatenated with anything
75 * because of operator precedence.) The operand of some types of node is
76 * a literal string; for others, it is a node leading into a sub-FSM. In
77 * particular, the operand of a BRANCH node is the first node of the branch.
78 * (NB this is *not* a tree structure: the tail of the branch connects
a3621e74
YO
79 * to the thing following the set of BRANCHes.) The opcodes are defined
80 * in regnodes.h which is generated from regcomp.sym by regcomp.pl.
a687059c
LW
81 */
82
a687059c
LW
83/*
84 * A node is one char of opcode followed by two chars of "next" pointer.
85 * "Next" pointers are stored as two 8-bit pieces, high order first. The
86 * value is a positive offset from the opcode of the node containing it.
87 * An operand, if any, simply follows the node. (Note that much of the
88 * code generation knows about this implicit relationship.)
89 *
90 * Using two bytes for the "next" pointer is vast overkill for most things,
91 * but allows patterns to get big without disasters.
92 *
e91177ed 93 * [The "next" pointer is always aligned on an even
a687059c
LW
94 * boundary, and reads the offset directly as a short. Also, there is no
95 * special test to reverse the sign of BACK pointers since the offset is
96 * stored negative.]
97 */
785a26d5
YO
98
99/* This is the stuff that used to live in regexp.h that was truly
100 private to the engine itself. It now lives here. */
101
28d8d7f4 102
785a26d5
YO
103
104 typedef struct regexp_internal {
1f1031fe 105 int name_list_idx; /* Optional data index of an array of paren names */
7122b237
YO
106 union {
107 U32 *offsets; /* offset annotations 20001228 MJD
108 data about mapping the program to the
109 string -
110 offsets[0] is proglen when this is used
111 */
112 U32 proglen;
113 } u;
114
6d5c990f
RGS
115 regnode *regstclass; /* Optional startclass as identified or constructed
116 by the optimiser */
117 struct reg_data *data; /* Additional miscellaneous data used by the program.
118 Used to make it easier to clone and free arbitrary
119 data that the regops need. Often the ARG field of
120 a regop is an index into this structure */
3d2bd50a
DM
121 struct reg_code_block *code_blocks;/* positions of literal (?{}) */
122 int num_code_blocks; /* size of code_blocks[] */
6d5c990f
RGS
123 regnode program[1]; /* Unwarranted chumminess with compiler. */
124} regexp_internal;
125
126#define RXi_SET(x,y) (x)->pprivate = (void*)(y)
127#define RXi_GET(x) ((regexp_internal *)((x)->pprivate))
128#define RXi_GET_DECL(r,ri) regexp_internal *ri = RXi_GET(r)
785a26d5
YO
129/*
130 * Flags stored in regexp->intflags
131 * These are used only internally to the regexp engine
132 *
133 * See regexp.h for flags used externally to the regexp engine
134 */
135#define PREGf_SKIP 0x00000001
136#define PREGf_IMPLICIT 0x00000002 /* Converted .* to ^.* */
137#define PREGf_NAUGHTY 0x00000004 /* how exponential is this pattern? */
138#define PREGf_VERBARG_SEEN 0x00000008
139#define PREGf_CUTGROUP_SEEN 0x00000010
732caac7 140#define PREGf_USE_RE_EVAL 0x00000020 /* compiled with "use re 'eval'" */
785a26d5
YO
141
142
143/* this is where the old regcomp.h started */
a687059c 144
c277df42 145struct regnode_string {
cd439c50 146 U8 str_len;
c277df42
IZ
147 U8 type;
148 U16 next_off;
cd439c50 149 char string[1];
c277df42 150};
a687059c 151
6bda09f9
YO
152/* Argument bearing node - workhorse,
153 arg1 is often for the data field */
c277df42
IZ
154struct regnode_1 {
155 U8 flags;
156 U8 type;
157 U16 next_off;
158 U32 arg1;
159};
160
6bda09f9
YO
161/* Similar to a regnode_1 but with an extra signed argument */
162struct regnode_2L {
163 U8 flags;
164 U8 type;
165 U16 next_off;
166 U32 arg1;
167 I32 arg2;
168};
169
170/* 'Two field' -- Two 16 bit unsigned args */
c277df42
IZ
171struct regnode_2 {
172 U8 flags;
173 U8 type;
174 U16 next_off;
175 U16 arg1;
176 U16 arg2;
177};
178
6bda09f9 179
936ed897 180#define ANYOF_BITMAP_SIZE 32 /* 256 b/(8 b/B) */
936ed897 181
786e8c11 182/* also used by trie */
936ed897
IZ
183struct regnode_charclass {
184 U8 flags;
185 U8 type;
186 U16 next_off;
bf3f2d85 187 U32 arg1; /* used as ptr in S_regclass */
19103b91 188 char bitmap[ANYOF_BITMAP_SIZE]; /* only compile-time */
936ed897
IZ
189};
190
bf3f2d85
KW
191/* has runtime (locale) \d, \w, ..., [:posix:] classes */
192struct regnode_charclass_class {
193 U8 flags; /* ANYOF_CLASS bit must go here */
936ed897
IZ
194 U8 type;
195 U16 next_off;
bf3f2d85 196 U32 arg1; /* used as ptr in S_regclass */
19103b91 197 char bitmap[ANYOF_BITMAP_SIZE]; /* both compile-time */
9cf78fa0 198 U32 classflags; /* and run-time */
936ed897
IZ
199};
200
9c7e81e8
AD
201/* XXX fix this description.
202 Impose a limit of REG_INFTY on various pattern matching operations
203 to limit stack growth and to avoid "infinite" recursions.
204*/
205/* The default size for REG_INFTY is I16_MAX, which is the same as
206 SHORT_MAX (see perl.h). Unfortunately I16 isn't necessarily 16 bits
207 (see handy.h). On the Cray C90, sizeof(short)==4 and hence I16_MAX is
208 ((1<<31)-1), while on the Cray T90, sizeof(short)==8 and I16_MAX is
209 ((1<<63)-1). To limit stack growth to reasonable sizes, supply a
210 smaller default.
211 --Andy Dougherty 11 June 1998
212*/
213#if SHORTSIZE > 2
214# ifndef REG_INFTY
215# define REG_INFTY ((1<<15)-1)
216# endif
217#endif
218
219#ifndef REG_INFTY
83cfe48c
IZ
220# define REG_INFTY I16_MAX
221#endif
a687059c 222
e91177ed
IZ
223#define ARG_VALUE(arg) (arg)
224#define ARG__SET(arg,val) ((arg) = (val))
c277df42 225
e8e3b0fb
JH
226#undef ARG
227#undef ARG1
228#undef ARG2
229
c277df42
IZ
230#define ARG(p) ARG_VALUE(ARG_LOC(p))
231#define ARG1(p) ARG_VALUE(ARG1_LOC(p))
232#define ARG2(p) ARG_VALUE(ARG2_LOC(p))
6bda09f9 233#define ARG2L(p) ARG_VALUE(ARG2L_LOC(p))
786e8c11 234
c277df42
IZ
235#define ARG_SET(p, val) ARG__SET(ARG_LOC(p), (val))
236#define ARG1_SET(p, val) ARG__SET(ARG1_LOC(p), (val))
237#define ARG2_SET(p, val) ARG__SET(ARG2_LOC(p), (val))
6bda09f9 238#define ARG2L_SET(p, val) ARG__SET(ARG2L_LOC(p), (val))
c277df42 239
e8e3b0fb
JH
240#undef NEXT_OFF
241#undef NODE_ALIGN
242
075abff3
AL
243#define NEXT_OFF(p) ((p)->next_off)
244#define NODE_ALIGN(node)
245#define NODE_ALIGN_FILL(node) ((node)->flags = 0xde) /* deadbeef */
a687059c 246
c277df42
IZ
247#define SIZE_ALIGN NODE_ALIGN
248
e8e3b0fb
JH
249#undef OP
250#undef OPERAND
251#undef MASK
252#undef STRING
253
e91177ed 254#define OP(p) ((p)->type)
b988e673
KW
255#define FLAGS(p) ((p)->flags) /* Caution: Doesn't apply to all \
256 regnode types. For some, it's the \
257 character set of the regnode */
e91177ed 258#define OPERAND(p) (((struct regnode_string *)p)->string)
cd439c50
IZ
259#define MASK(p) ((char*)OPERAND(p))
260#define STR_LEN(p) (((struct regnode_string *)p)->str_len)
261#define STRING(p) (((struct regnode_string *)p)->string)
262#define STR_SZ(l) ((l + sizeof(regnode) - 1) / sizeof(regnode))
263#define NODE_SZ_STR(p) (STR_SZ(STR_LEN(p))+1)
264
e8e3b0fb
JH
265#undef NODE_ALIGN
266#undef ARG_LOC
267#undef NEXTOPER
268#undef PREVOPER
269
e91177ed
IZ
270#define NODE_ALIGN(node)
271#define ARG_LOC(p) (((struct regnode_1 *)p)->arg1)
272#define ARG1_LOC(p) (((struct regnode_2 *)p)->arg1)
273#define ARG2_LOC(p) (((struct regnode_2 *)p)->arg2)
6bda09f9 274#define ARG2L_LOC(p) (((struct regnode_2L *)p)->arg2)
786e8c11 275
e91177ed
IZ
276#define NODE_STEP_REGNODE 1 /* sizeof(regnode)/sizeof(regnode) */
277#define EXTRA_STEP_2ARGS EXTRA_SIZE(struct regnode_2)
278
279#define NODE_STEP_B 4
c277df42
IZ
280
281#define NEXTOPER(p) ((p) + NODE_STEP_REGNODE)
282#define PREVOPER(p) ((p) - NODE_STEP_REGNODE)
283
e91177ed 284#define FILL_ADVANCE_NODE(ptr, op) STMT_START { \
c277df42 285 (ptr)->type = op; (ptr)->next_off = 0; (ptr)++; } STMT_END
e91177ed 286#define FILL_ADVANCE_NODE_ARG(ptr, op, arg) STMT_START { \
c277df42 287 ARG_SET(ptr, arg); FILL_ADVANCE_NODE(ptr, op); (ptr) += 1; } STMT_END
a687059c 288
22c35a8c 289#define REG_MAGIC 0234
a687059c 290
830247a4 291#define SIZE_ONLY (RExC_emit == &PL_regdummy)
c277df42 292
137165a6
KW
293/* If the bitmap doesn't fully represent what this ANYOF node can match, the
294 * ARG is set to this special value (since 0, 1, ... are legal, but will never
295 * reach this high). */
296#define ANYOF_NONBITMAP_EMPTY ((U32) -1)
297
298/* The information used to be stored as as combination of the ANYOF_UTF8 and
299 * ANYOF_NONBITMAP_NON_UTF8 bits in the flags field, but was moved out of there
300 * to free up a bit for other uses. This tries to hide the change from
301 * existing code as much as possible. Now, the data structure that goes in ARG
302 * is not allocated unless it is needed, and that is what is used to determine
303 * if there is something outside the bitmap. The code now assumes that if
304 * that structure exists, that any UTF-8 encoded string should be tried against
305 * it, but a non-UTF8-encoded string will be tried only if the
306 * ANYOF_NONBITMAP_NON_UTF8 bit is also set. */
307#define ANYOF_NONBITMAP(node) (ARG(node) != ANYOF_NONBITMAP_EMPTY)
308
899d20b9
KW
309/* Flags for node->flags of ANYOF. These are in short supply, but there is one
310 * currently available. If more than this are needed, the ANYOF_LOCALE and
9ffd0d41 311 * ANYOF_CLASS bits could be shared, making a space penalty for all locale nodes.
899d20b9
KW
312 * Also, the UNICODE_ALL bit could be freed up by resorting to creating a swash
313 * containing everything above 255. This introduces a performance penalty.
314 * Better would be to split it off into a separate node, which actually would
315 * improve performance a bit by allowing regexec.c to test for a UTF-8
316 * character being above 255 without having to call a function nor calculate
317 * its code point value. However, this solution might need to have a second
318 * node type, ANYOF_SYNTHETIC_ABOVE_LATIN1_ALL */
b8c5462f 319
a4e790c1 320#define ANYOF_LOCALE 0x01 /* /l modifier */
39065660
KW
321
322/* The fold is calculated and stored in the bitmap where possible at compile
538b546e
KW
323 * time. However under locale, the actual folding varies depending on
324 * what the locale is at the time of execution, so it has to be deferred until
325 * then */
acf67047 326#define ANYOF_LOC_FOLD 0x02
39065660
KW
327
328#define ANYOF_INVERT 0x04
1984f6a0 329
dd58aee1
KW
330/* Set if this is a struct regnode_charclass_class vs a regnode_charclass. This
331 * is used for runtime \d, \w, [:posix:], ..., which are used only in locale
332 * and the optimizer's synthetic start class. Non-locale \d, etc are resolved
9ffd0d41
KW
333 * at compile-time. Could be shared with ANYOF_LOCALE, forcing all locale
334 * nodes to be large */
335#define ANYOF_CLASS 0x08
acf67047 336#define ANYOF_LARGE ANYOF_CLASS /* Same; name retained for back compat */
c8d3cd88 337
899d20b9 338/* Unused: 0x10. When using, be sure to change ANYOF_FLAGS_ALL below */
f4244008 339
ef87b810
KW
340/* Can match something outside the bitmap that isn't in utf8 */
341#define ANYOF_NONBITMAP_NON_UTF8 0x20
342
61ef9872
KW
343/* Matches every code point 0x100 and above*/
344#define ANYOF_UNICODE_ALL 0x40
ffc61ed2 345
11454c59
KW
346/* Match all Latin1 characters that aren't ASCII when the target string is not
347 * in utf8. */
348#define ANYOF_NON_UTF8_LATIN1_ALL 0x80
349
899d20b9 350#define ANYOF_FLAGS_ALL (0xff & ~0x10)
653099ff 351
ace6b0e4
KW
352/* These are the flags that ANYOF_INVERT being set or not doesn't affect
353 * whether they are operative or not. e.g., the node still has LOCALE
354 * regardless of being inverted; whereas ANYOF_UNICODE_ALL means something
355 * different if inverted */
356#define INVERSION_UNAFFECTED_FLAGS (ANYOF_LOCALE \
538b546e 357 |ANYOF_LOC_FOLD \
ace6b0e4 358 |ANYOF_CLASS \
ace6b0e4
KW
359 |ANYOF_NONBITMAP_NON_UTF8)
360
936ed897 361/* Character classes for node->classflags of ANYOF */
653099ff 362/* Should be synchronized with a table in regprop() */
575a8a29 363/* 2n should be the normal one, paired with its complement at 2n+1 */
b8c5462f 364
08ada29e
KW
365#define ANYOF_ALPHA ((_CC_ALPHA) * 2)
366#define ANYOF_NALPHA ((ANYOF_ALPHA) + 1)
e8d596e0
KW
367#define ANYOF_ALPHANUMERIC ((_CC_ALPHANUMERIC) * 2) /* [[:alnum:]] isalnum(3), utf8::IsAlnum */
368#define ANYOF_NALPHANUMERIC ((ANYOF_ALPHANUMERIC) + 1)
08ada29e
KW
369#define ANYOF_ASCII ((_CC_ASCII) * 2)
370#define ANYOF_NASCII ((ANYOF_ASCII) + 1)
e8d596e0
KW
371#define ANYOF_BLANK ((_CC_BLANK) * 2) /* GNU extension: space and tab: non-vertical space */
372#define ANYOF_NBLANK ((ANYOF_BLANK) + 1)
b0d691b2
KW
373#define ANYOF_CASED ((_CC_CASED) * 2) /* Pseudo class for [:lower:] or
374 [:upper:] under /i */
375#define ANYOF_NCASED ((ANYOF_CASED) + 1)
08ada29e
KW
376#define ANYOF_CNTRL ((_CC_CNTRL) * 2)
377#define ANYOF_NCNTRL ((ANYOF_CNTRL) + 1)
e8d596e0
KW
378#define ANYOF_DIGIT ((_CC_DIGIT) * 2) /* \d */
379#define ANYOF_NDIGIT ((ANYOF_DIGIT) + 1)
08ada29e
KW
380#define ANYOF_GRAPH ((_CC_GRAPH) * 2)
381#define ANYOF_NGRAPH ((ANYOF_GRAPH) + 1)
382#define ANYOF_LOWER ((_CC_LOWER) * 2)
383#define ANYOF_NLOWER ((ANYOF_LOWER) + 1)
384#define ANYOF_PRINT ((_CC_PRINT) * 2)
385#define ANYOF_NPRINT ((ANYOF_PRINT) + 1)
e8d596e0
KW
386#define ANYOF_PSXSPC ((_CC_PSXSPC) * 2) /* POSIX space: \s plus the vertical tab */
387#define ANYOF_NPSXSPC ((ANYOF_PSXSPC) + 1)
08ada29e
KW
388#define ANYOF_PUNCT ((_CC_PUNCT) * 2)
389#define ANYOF_NPUNCT ((ANYOF_PUNCT) + 1)
e8d596e0
KW
390#define ANYOF_SPACE ((_CC_SPACE) * 2) /* \s */
391#define ANYOF_NSPACE ((ANYOF_SPACE) + 1)
08ada29e
KW
392#define ANYOF_UPPER ((_CC_UPPER) * 2)
393#define ANYOF_NUPPER ((ANYOF_UPPER) + 1)
e8d596e0
KW
394#define ANYOF_WORDCHAR ((_CC_WORDCHAR) * 2) /* \w, PL_utf8_alnum, utf8::IsWord, ALNUM */
395#define ANYOF_NWORDCHAR ((ANYOF_WORDCHAR) + 1)
08ada29e
KW
396#define ANYOF_XDIGIT ((_CC_XDIGIT) * 2)
397#define ANYOF_NXDIGIT ((ANYOF_XDIGIT) + 1)
b8c5462f 398
87cad4c0 399/* pseudo classes below this, not stored in the class bitmap, but used as flags
e1d1eefb
YO
400 during compilation of char classes */
401
b2ef2e34
KW
402#define ANYOF_VERTWS ((_CC_VERTSPACE) * 2)
403#define ANYOF_NVERTWS ((ANYOF_VERTWS)+1)
e1d1eefb 404
b2ef2e34
KW
405/* It is best if this is the last one, as all above it are stored as bits in a
406 * bitmap, and it isn't part of that bitmap */
407#if _CC_VERTSPACE != _HIGHEST_REGCOMP_DOT_H_SYNC
408# error Problem with handy.h _HIGHEST_REGCOMP_DOT_H_SYNC #define
409#endif
410
411#define ANYOF_MAX (ANYOF_VERTWS) /* So upper loop limit is written:
412 * '< ANYOF_MAX'
413 * Hence doesn't include VERTWS, as that
414 * is a pseudo class */
415#if (ANYOF_MAX > 32) /* Must fit in 32-bit word */
416# error Problem with handy.h _CC_foo #defines
a0947d7b
KW
417#endif
418
b2ef2e34 419#define ANYOF_HORIZWS ((ANYOF_MAX)+2) /* = (ANYOF_NVERTWS + 1) */
87cad4c0
KW
420#define ANYOF_NHORIZWS ((ANYOF_MAX)+3)
421
422#define ANYOF_UNIPROP ((ANYOF_MAX)+4) /* Used to indicate a Unicode
423 property: \p{} or \P{} */
f39a4dc2 424
b8c5462f
JH
425/* Backward source code compatibility. */
426
427#define ANYOF_ALNUML ANYOF_ALNUM
428#define ANYOF_NALNUML ANYOF_NALNUM
429#define ANYOF_SPACEL ANYOF_SPACE
430#define ANYOF_NSPACEL ANYOF_NSPACE
8ebfc29a
KW
431#define ANYOF_ALNUM ANYOF_WORDCHAR
432#define ANYOF_NALNUM ANYOF_NWORDCHAR
b8c5462f
JH
433
434/* Utility macros for the bitmap and classes of ANYOF */
435
936ed897
IZ
436#define ANYOF_SIZE (sizeof(struct regnode_charclass))
437#define ANYOF_CLASS_SIZE (sizeof(struct regnode_charclass_class))
b8c5462f 438
936ed897 439#define ANYOF_FLAGS(p) ((p)->flags)
b8c5462f
JH
440
441#define ANYOF_BIT(c) (1 << ((c) & 7))
442
9cf78fa0
KW
443#define ANYOF_CLASS_SET(p, c) (((struct regnode_charclass_class*) (p))->classflags |= (1U << (c)))
444#define ANYOF_CLASS_CLEAR(p, c) (((struct regnode_charclass_class*) (p))->classflags &= ~ (1U <<(c)))
445#define ANYOF_CLASS_TEST(p, c) (((struct regnode_charclass_class*) (p))->classflags & (1U << (c)))
b8c5462f 446
9cf78fa0
KW
447#define ANYOF_CLASS_ZERO(ret) STMT_START { ((struct regnode_charclass_class*) (ret))->classflags = 0; } STMT_END
448
449/* Shifts a bit to get, eg. 0x4000_0000, then subtracts 1 to get 0x3FFF_FFFF */
450#define ANYOF_CLASS_SETALL(ret) STMT_START { ((struct regnode_charclass_class*) (ret))->classflags = ((1U << ((ANYOF_MAX) - 1))) - 1; } STMT_END
451
452#define ANYOF_CLASS_OR(source, dest) STMT_START { (dest)->classflags |= source->classflags ; } STMT_END
936ed897 453
9cf78fa0 454#define ANYOF_BITMAP_ZERO(ret) Zero(((struct regnode_charclass*)(ret))->bitmap, ANYOF_BITMAP_SIZE, char)
936ed897 455#define ANYOF_BITMAP(p) (((struct regnode_charclass*)(p))->bitmap)
786e8c11 456#define ANYOF_BITMAP_BYTE(p, c) (ANYOF_BITMAP(p)[(((U8)(c)) >> 3) & 31])
b8c5462f
JH
457#define ANYOF_BITMAP_SET(p, c) (ANYOF_BITMAP_BYTE(p, c) |= ANYOF_BIT(c))
458#define ANYOF_BITMAP_CLEAR(p,c) (ANYOF_BITMAP_BYTE(p, c) &= ~ANYOF_BIT(c))
459#define ANYOF_BITMAP_TEST(p, c) (ANYOF_BITMAP_BYTE(p, c) & ANYOF_BIT(c))
460
f8bef550
NC
461#define ANYOF_BITMAP_SETALL(p) \
462 memset (ANYOF_BITMAP(p), 255, ANYOF_BITMAP_SIZE)
463#define ANYOF_BITMAP_CLEARALL(p) \
464 Zero (ANYOF_BITMAP(p), ANYOF_BITMAP_SIZE)
465/* Check that all 256 bits are all set. Used in S_cl_is_anything() */
c355c09a 466#define ANYOF_BITMAP_TESTALLSET(p) /* Assumes sizeof(p) == 32 */ \
f8bef550
NC
467 memEQ (ANYOF_BITMAP(p), "\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377", ANYOF_BITMAP_SIZE)
468
936ed897
IZ
469#define ANYOF_SKIP ((ANYOF_SIZE - 1)/sizeof(regnode))
470#define ANYOF_CLASS_SKIP ((ANYOF_CLASS_SIZE - 1)/sizeof(regnode))
3a15e693 471
9cf78fa0 472#define ANYOF_CLASS_TEST_ANY_SET(p) \
b25a1036 473 ((ANYOF_FLAGS(p) & ANYOF_CLASS) \
9cf78fa0 474 && (((struct regnode_charclass_class*)(p))->classflags))
dd58aee1
KW
475/*#define ANYOF_CLASS_ADD_SKIP (ANYOF_CLASS_SKIP - ANYOF_SKIP)
476 * */
c277df42 477
786e8c11 478
a687059c
LW
479/*
480 * Utility definitions.
481 */
2304df62 482#ifndef CHARMASK
075abff3 483# define UCHARAT(p) ((int)*(const U8*)(p))
a687059c 484#else
075abff3 485# define UCHARAT(p) ((int)*(p)&CHARMASK)
a687059c 486#endif
a687059c 487
c277df42
IZ
488#define EXTRA_SIZE(guy) ((sizeof(guy)-1)/sizeof(struct regnode))
489
3dab1dad
YO
490#define REG_SEEN_ZERO_LEN 0x00000001
491#define REG_SEEN_LOOKBEHIND 0x00000002
492#define REG_SEEN_GPOS 0x00000004
471f5387 493/* spare */
3dab1dad 494#define REG_SEEN_CANY 0x00000010
cce850e4 495#define REG_SEEN_SANY REG_SEEN_CANY /* src bckwrd cmpt */
6bda09f9 496#define REG_SEEN_RECURSE 0x00000020
eaf3ca90 497#define REG_TOP_LEVEL_BRANCHES 0x00000040
e2e6a0f1 498#define REG_SEEN_VERBARG 0x00000080
5d458dd8 499#define REG_SEEN_CUTGROUP 0x00000100
bcdf7404 500#define REG_SEEN_RUN_ON_COMMENT 0x00000200
bb914485 501#define REG_SEEN_EXACTF_SHARP_S 0x00000400
d09b2d29 502
73c4f7a1
GS
503START_EXTERN_C
504
be8e71aa
YO
505#ifdef PLUGGABLE_RE_EXTENSION
506#include "re_nodes.h"
507#else
d09b2d29 508#include "regnodes.h"
be8e71aa 509#endif
d09b2d29 510
f9f4320a
YO
511#ifndef PLUGGABLE_RE_EXTENSION
512#ifndef DOINIT
513EXTCONST regexp_engine PL_core_reg_engine;
514#else /* DOINIT */
515EXTCONST regexp_engine PL_core_reg_engine = {
fe578d7f 516 Perl_re_compile,
2fdbfb4d 517 Perl_regexec_flags,
f9f4320a
YO
518 Perl_re_intuit_start,
519 Perl_re_intuit_string,
2fdbfb4d
AB
520 Perl_regfree_internal,
521 Perl_reg_numbered_buff_fetch,
522 Perl_reg_numbered_buff_store,
523 Perl_reg_numbered_buff_length,
192b9cd1
AB
524 Perl_reg_named_buff,
525 Perl_reg_named_buff_iter,
49d7dfbc 526 Perl_reg_qr_package,
f9f4320a 527#if defined(USE_ITHREADS)
3c13cae6 528 Perl_regdupe_internal,
f9f4320a 529#endif
3c13cae6 530 Perl_re_op_compile
f9f4320a
YO
531};
532#endif /* DOINIT */
533#endif /* PLUGGABLE_RE_EXTENSION */
534
535
73c4f7a1 536END_EXTERN_C
cad2e5aa 537
cad2e5aa 538
261faec3
MJD
539/* .what is a character array with one character for each member of .data
540 * The character describes the function of the corresponding .data item:
af534a04 541 * a - AV for paren_name_list under DEBUGGING
0111c4fd 542 * f - start-class data for regstclass optimization
68e2671b 543 * l - start op for literal (?{EVAL}) item
d63c20f2 544 * L - start op for literal (?{EVAL}) item, with separate CV (qr//)
b30fcab9 545 * r - pointer to an embedded code-containing qr, e.g. /ab$qr/
38a44b82 546 * s - swash for Unicode-style character class, and the multicharacter
9e55ce06
JH
547 * strings resulting from casefolding the single-character entries
548 * in the character class
a3621e74 549 * t - trie struct
55eed653 550 * u - trie struct's widecharmap (a HV, so can't share, must dup)
2b8b4781 551 * also used for revcharmap and words under DEBUGGING
07be1b83 552 * T - aho-trie struct
81714fb9 553 * S - sv for named capture lookup
261faec3 554 * 20010712 mjd@plover.com
c3613ed7 555 * (Remember to update re_dup() and pregfree() if you add any items.)
261faec3 556 */
cad2e5aa
JH
557struct reg_data {
558 U32 count;
559 U8 *what;
560 void* data[1];
561};
562
a1cac82e
NC
563/* Code in S_to_utf8_substr() and S_to_byte_substr() in regexec.c accesses
564 anchored* and float* via array indexes 0 and 1. */
cad2e5aa 565#define anchored_substr substrs->data[0].substr
33b8afdf 566#define anchored_utf8 substrs->data[0].utf8_substr
cad2e5aa 567#define anchored_offset substrs->data[0].min_offset
1de06328
YO
568#define anchored_end_shift substrs->data[0].end_shift
569
cad2e5aa 570#define float_substr substrs->data[1].substr
33b8afdf 571#define float_utf8 substrs->data[1].utf8_substr
cad2e5aa
JH
572#define float_min_offset substrs->data[1].min_offset
573#define float_max_offset substrs->data[1].max_offset
1de06328
YO
574#define float_end_shift substrs->data[1].end_shift
575
cad2e5aa 576#define check_substr substrs->data[2].substr
33b8afdf 577#define check_utf8 substrs->data[2].utf8_substr
cad2e5aa
JH
578#define check_offset_min substrs->data[2].min_offset
579#define check_offset_max substrs->data[2].max_offset
1de06328 580#define check_end_shift substrs->data[2].end_shift
a3621e74 581
8d919b0a
FC
582#define RX_ANCHORED_SUBSTR(rx) (ReANY(rx)->anchored_substr)
583#define RX_ANCHORED_UTF8(rx) (ReANY(rx)->anchored_utf8)
584#define RX_FLOAT_SUBSTR(rx) (ReANY(rx)->float_substr)
585#define RX_FLOAT_UTF8(rx) (ReANY(rx)->float_utf8)
a3621e74
YO
586
587/* trie related stuff */
5d9a96ca 588
a3621e74
YO
589/* a transition record for the state machine. the
590 check field determines which state "owns" the
591 transition. the char the transition is for is
592 determined by offset from the owning states base
593 field. the next field determines which state
594 is to be transitioned to if any.
595*/
596struct _reg_trie_trans {
597 U32 next;
598 U32 check;
599};
600
601/* a transition list element for the list based representation */
602struct _reg_trie_trans_list_elem {
603 U16 forid;
604 U32 newstate;
605};
606typedef struct _reg_trie_trans_list_elem reg_trie_trans_le;
607
608/* a state for compressed nodes. base is an offset
609 into an array of reg_trie_trans array. If wordnum is
610 nonzero the state is accepting. if base is zero then
611 the state has no children (and will be accepting)
612*/
613struct _reg_trie_state {
614 U16 wordnum;
615 union {
616 U32 base;
617 reg_trie_trans_le* list;
618 } trans;
619};
620
2e64971a
DM
621/* info per word; indexed by wordnum */
622typedef struct {
623 U16 prev; /* previous word in acceptance chain; eg in
624 * zzz|abc|ab/ after matching the chars abc, the
625 * accepted word is #2, and the previous accepted
626 * word is #3 */
627 U32 len; /* how many chars long is this word? */
628 U32 accept; /* accept state for this word */
629} reg_trie_wordinfo;
a3621e74
YO
630
631
a3621e74
YO
632typedef struct _reg_trie_state reg_trie_state;
633typedef struct _reg_trie_trans reg_trie_trans;
634
635
636/* anything in here that needs to be freed later
23eab42c
NC
637 should be dealt with in pregfree.
638 refcount is first in both this and _reg_ac_data to allow a space
639 optimisation in Perl_regdupe. */
a3621e74 640struct _reg_trie_data {
23eab42c 641 U32 refcount; /* number of times this trie is referenced */
786e8c11
YO
642 U32 lasttrans; /* last valid transition element */
643 U16 *charmap; /* byte to charid lookup array */
786e8c11
YO
644 reg_trie_state *states; /* state data */
645 reg_trie_trans *trans; /* array of transition elements */
646 char *bitmap; /* stclass bitmap */
786e8c11
YO
647 U16 *jump; /* optional 1 indexed array of offsets before tail
648 for the node following a given word. */
2e64971a 649 reg_trie_wordinfo *wordinfo; /* array of info per word */
1b5c067c
NC
650 U16 uniquecharcount; /* unique chars in trie (width of trans table) */
651 U32 startstate; /* initial state - used for common prefix optimisation */
652 STRLEN minlen; /* minimum length of words in trie - build/opt only? */
653 STRLEN maxlen; /* maximum length of words in trie - build/opt only? */
2e64971a 654 U32 prefixlen; /* #chars in common prefix */
1e2e3d02
YO
655 U32 statecount; /* Build only - number of states in the states array
656 (including the unused zero state) */
786e8c11 657 U32 wordcount; /* Build only */
a3621e74 658#ifdef DEBUGGING
786e8c11 659 STRLEN charcount; /* Build only */
a3621e74
YO
660#endif
661};
2b8b4781
NC
662/* There is one (3 under DEBUGGING) pointers that logically belong in this
663 structure, but are held outside as they need duplication on thread cloning,
664 whereas the rest of the structure can be read only:
665 HV *widecharmap; code points > 255 to charid
666#ifdef DEBUGGING
667 AV *words; Array of words contained in trie, for dumping
668 AV *revcharmap; Map of each charid back to its character representation
669#endif
670*/
671
672#define TRIE_WORDS_OFFSET 2
673
a3621e74
YO
674typedef struct _reg_trie_data reg_trie_data;
675
23eab42c
NC
676/* refcount is first in both this and _reg_trie_data to allow a space
677 optimisation in Perl_regdupe. */
07be1b83 678struct _reg_ac_data {
23eab42c 679 U32 refcount;
1b5c067c 680 U32 trie;
07be1b83
YO
681 U32 *fail;
682 reg_trie_state *states;
07be1b83
YO
683};
684typedef struct _reg_ac_data reg_ac_data;
685
486ec47a 686/* ANY_BIT doesn't use the structure, so we can borrow it here.
3dab1dad
YO
687 This is simpler than refactoring all of it as wed end up with
688 three different sets... */
689
690#define TRIE_BITMAP(p) (((reg_trie_data *)(p))->bitmap)
786e8c11 691#define TRIE_BITMAP_BYTE(p, c) (TRIE_BITMAP(p)[(((U8)(c)) >> 3) & 31])
5dfe062f
YO
692#define TRIE_BITMAP_SET(p, c) (TRIE_BITMAP_BYTE(p, c) |= ANYOF_BIT((U8)c))
693#define TRIE_BITMAP_CLEAR(p,c) (TRIE_BITMAP_BYTE(p, c) &= ~ANYOF_BIT((U8)c))
694#define TRIE_BITMAP_TEST(p, c) (TRIE_BITMAP_BYTE(p, c) & ANYOF_BIT((U8)c))
3dab1dad 695
1de06328
YO
696#define IS_ANYOF_TRIE(op) ((op)==TRIEC || (op)==AHOCORASICKC)
697#define IS_TRIE_AC(op) ((op)>=AHOCORASICK)
698
699
786e8c11
YO
700#define BITMAP_BYTE(p, c) (((U8*)p)[(((U8)(c)) >> 3) & 31])
701#define BITMAP_TEST(p, c) (BITMAP_BYTE(p, c) & ANYOF_BIT((U8)c))
3dab1dad 702
a3621e74
YO
703/* these defines assume uniquecharcount is the correct variable, and state may be evaluated twice */
704#define TRIE_NODENUM(state) (((state)-1)/(trie->uniquecharcount)+1)
705#define SAFE_TRIE_NODENUM(state) ((state) ? (((state)-1)/(trie->uniquecharcount)+1) : (state))
706#define TRIE_NODEIDX(state) ((state) ? (((state)-1)*(trie->uniquecharcount)+1) : (state))
707
3dab1dad 708#ifdef DEBUGGING
3dab1dad 709#define TRIE_CHARCOUNT(trie) ((trie)->charcount)
3dab1dad 710#else
3dab1dad 711#define TRIE_CHARCOUNT(trie) (trie_charcount)
3dab1dad 712#endif
a3621e74 713
0111c4fd
RGS
714#define RE_TRIE_MAXBUF_INIT 65536
715#define RE_TRIE_MAXBUF_NAME "\022E_TRIE_MAXBUF"
a3621e74
YO
716#define RE_DEBUG_FLAGS "\022E_DEBUG_FLAGS"
717
be8e71aa
YO
718/*
719
720RE_DEBUG_FLAGS is used to control what debug output is emitted
721its divided into three groups of options, some of which interact.
722The three groups are: Compile, Execute, Extra. There is room for a
723further group, as currently only the low three bytes are used.
724
725 Compile Options:
07be1b83 726
be8e71aa
YO
727 PARSE
728 PEEP
729 TRIE
730 PROGRAM
731 OFFSETS
a3621e74 732
be8e71aa 733 Execute Options:
a3621e74 734
be8e71aa
YO
735 INTUIT
736 MATCH
737 TRIE
a3621e74 738
be8e71aa 739 Extra Options
a3621e74 740
be8e71aa
YO
741 TRIE
742 OFFSETS
743
744If you modify any of these make sure you make corresponding changes to
745re.pm, especially to the documentation.
a3621e74 746
be8e71aa
YO
747*/
748
749
750/* Compile */
751#define RE_DEBUG_COMPILE_MASK 0x0000FF
752#define RE_DEBUG_COMPILE_PARSE 0x000001
753#define RE_DEBUG_COMPILE_OPTIMISE 0x000002
754#define RE_DEBUG_COMPILE_TRIE 0x000004
755#define RE_DEBUG_COMPILE_DUMP 0x000008
f7819f85 756#define RE_DEBUG_COMPILE_FLAGS 0x000010
be8e71aa
YO
757
758/* Execute */
759#define RE_DEBUG_EXECUTE_MASK 0x00FF00
760#define RE_DEBUG_EXECUTE_INTUIT 0x000100
761#define RE_DEBUG_EXECUTE_MATCH 0x000200
762#define RE_DEBUG_EXECUTE_TRIE 0x000400
763
764/* Extra */
765#define RE_DEBUG_EXTRA_MASK 0xFF0000
766#define RE_DEBUG_EXTRA_TRIE 0x010000
767#define RE_DEBUG_EXTRA_OFFSETS 0x020000
a5ca303d
YO
768#define RE_DEBUG_EXTRA_OFFDEBUG 0x040000
769#define RE_DEBUG_EXTRA_STATE 0x080000
770#define RE_DEBUG_EXTRA_OPTIMISE 0x100000
e7707071 771#define RE_DEBUG_EXTRA_BUFFERS 0x400000
2c296965 772#define RE_DEBUG_EXTRA_GPOS 0x800000
24b23f37
YO
773/* combined */
774#define RE_DEBUG_EXTRA_STACK 0x280000
be8e71aa 775
e68ec53f 776#define RE_DEBUG_FLAG(x) (re_debug_flags & x)
be8e71aa
YO
777/* Compile */
778#define DEBUG_COMPILE_r(x) DEBUG_r( \
e68ec53f 779 if (re_debug_flags & RE_DEBUG_COMPILE_MASK) x )
be8e71aa 780#define DEBUG_PARSE_r(x) DEBUG_r( \
e68ec53f 781 if (re_debug_flags & RE_DEBUG_COMPILE_PARSE) x )
be8e71aa 782#define DEBUG_OPTIMISE_r(x) DEBUG_r( \
e68ec53f 783 if (re_debug_flags & RE_DEBUG_COMPILE_OPTIMISE) x )
be8e71aa 784#define DEBUG_PARSE_r(x) DEBUG_r( \
e68ec53f 785 if (re_debug_flags & RE_DEBUG_COMPILE_PARSE) x )
be8e71aa 786#define DEBUG_DUMP_r(x) DEBUG_r( \
e68ec53f 787 if (re_debug_flags & RE_DEBUG_COMPILE_DUMP) x )
be8e71aa 788#define DEBUG_TRIE_COMPILE_r(x) DEBUG_r( \
e68ec53f 789 if (re_debug_flags & RE_DEBUG_COMPILE_TRIE) x )
f7819f85
A
790#define DEBUG_FLAGS_r(x) DEBUG_r( \
791 if (re_debug_flags & RE_DEBUG_COMPILE_FLAGS) x )
be8e71aa
YO
792/* Execute */
793#define DEBUG_EXECUTE_r(x) DEBUG_r( \
e68ec53f 794 if (re_debug_flags & RE_DEBUG_EXECUTE_MASK) x )
be8e71aa 795#define DEBUG_INTUIT_r(x) DEBUG_r( \
e68ec53f 796 if (re_debug_flags & RE_DEBUG_EXECUTE_INTUIT) x )
be8e71aa 797#define DEBUG_MATCH_r(x) DEBUG_r( \
e68ec53f 798 if (re_debug_flags & RE_DEBUG_EXECUTE_MATCH) x )
be8e71aa 799#define DEBUG_TRIE_EXECUTE_r(x) DEBUG_r( \
e68ec53f 800 if (re_debug_flags & RE_DEBUG_EXECUTE_TRIE) x )
be8e71aa
YO
801
802/* Extra */
803#define DEBUG_EXTRA_r(x) DEBUG_r( \
e68ec53f 804 if (re_debug_flags & RE_DEBUG_EXTRA_MASK) x )
a5ca303d
YO
805#define DEBUG_OFFSETS_r(x) DEBUG_r( \
806 if (re_debug_flags & RE_DEBUG_EXTRA_OFFSETS) x )
ab3bbdeb
YO
807#define DEBUG_STATE_r(x) DEBUG_r( \
808 if (re_debug_flags & RE_DEBUG_EXTRA_STATE) x )
24b23f37
YO
809#define DEBUG_STACK_r(x) DEBUG_r( \
810 if (re_debug_flags & RE_DEBUG_EXTRA_STACK) x )
e7707071
YO
811#define DEBUG_BUFFERS_r(x) DEBUG_r( \
812 if (re_debug_flags & RE_DEBUG_EXTRA_BUFFERS) x )
813
a5ca303d
YO
814#define DEBUG_OPTIMISE_MORE_r(x) DEBUG_r( \
815 if ((RE_DEBUG_EXTRA_OPTIMISE|RE_DEBUG_COMPILE_OPTIMISE) == \
816 (re_debug_flags & (RE_DEBUG_EXTRA_OPTIMISE|RE_DEBUG_COMPILE_OPTIMISE)) ) x )
07be1b83 817#define MJD_OFFSET_DEBUG(x) DEBUG_r( \
a5ca303d 818 if (re_debug_flags & RE_DEBUG_EXTRA_OFFDEBUG) \
be8e71aa
YO
819 Perl_warn_nocontext x )
820#define DEBUG_TRIE_COMPILE_MORE_r(x) DEBUG_TRIE_COMPILE_r( \
e68ec53f 821 if (re_debug_flags & RE_DEBUG_EXTRA_TRIE) x )
be8e71aa 822#define DEBUG_TRIE_EXECUTE_MORE_r(x) DEBUG_TRIE_EXECUTE_r( \
e68ec53f 823 if (re_debug_flags & RE_DEBUG_EXTRA_TRIE) x )
be8e71aa
YO
824
825#define DEBUG_TRIE_r(x) DEBUG_r( \
e68ec53f 826 if (re_debug_flags & (RE_DEBUG_COMPILE_TRIE \
be8e71aa 827 | RE_DEBUG_EXECUTE_TRIE )) x )
2c296965
YO
828#define DEBUG_GPOS_r(x) DEBUG_r( \
829 if (re_debug_flags & RE_DEBUG_EXTRA_GPOS) x )
be8e71aa
YO
830
831/* initialization */
595598ee
KW
832/* get_sv() can return NULL during global destruction. re_debug_flags can get
833 * clobbered by a longjmp, so must be initialized */
e68ec53f
YO
834#define GET_RE_DEBUG_FLAGS DEBUG_r({ \
835 SV * re_debug_flags_sv = NULL; \
595598ee 836 re_debug_flags = 0; \
e68ec53f
YO
837 re_debug_flags_sv = get_sv(RE_DEBUG_FLAGS, 1); \
838 if (re_debug_flags_sv) { \
8e9a8a48 839 if (!SvIOK(re_debug_flags_sv)) \
e68ec53f 840 sv_setuv(re_debug_flags_sv, RE_DEBUG_COMPILE_DUMP | RE_DEBUG_EXECUTE_MASK ); \
8e9a8a48 841 re_debug_flags=SvIV(re_debug_flags_sv); \
e68ec53f
YO
842 }\
843})
a3621e74
YO
844
845#ifdef DEBUGGING
ab3bbdeb 846
cb65b687
DM
847#define GET_RE_DEBUG_FLAGS_DECL VOL IV re_debug_flags = 0; \
848 PERL_UNUSED_VAR(re_debug_flags); GET_RE_DEBUG_FLAGS;
ab3bbdeb
YO
849
850#define RE_PV_COLOR_DECL(rpv,rlen,isuni,dsv,pv,l,m,c1,c2) \
851 const char * const rpv = \
ddc5bc0f 852 pv_pretty((dsv), (pv), (l), (m), \
ab3bbdeb 853 PL_colors[(c1)],PL_colors[(c2)], \
c89df6cf 854 PERL_PV_ESCAPE_RE|PERL_PV_ESCAPE_NONASCII |((isuni) ? PERL_PV_ESCAPE_UNI : 0) ); \
0df25f3d 855 const int rlen = SvCUR(dsv)
ab3bbdeb
YO
856
857#define RE_SV_ESCAPE(rpv,isuni,dsv,sv,m) \
858 const char * const rpv = \
ddc5bc0f 859 pv_pretty((dsv), (SvPV_nolen_const(sv)), (SvCUR(sv)), (m), \
ab3bbdeb 860 PL_colors[(c1)],PL_colors[(c2)], \
c89df6cf 861 PERL_PV_ESCAPE_RE|PERL_PV_ESCAPE_NONASCII |((isuni) ? PERL_PV_ESCAPE_UNI : 0) )
ab3bbdeb
YO
862
863#define RE_PV_QUOTED_DECL(rpv,isuni,dsv,pv,l,m) \
864 const char * const rpv = \
ddc5bc0f 865 pv_pretty((dsv), (pv), (l), (m), \
ab3bbdeb 866 PL_colors[0], PL_colors[1], \
c89df6cf 867 ( PERL_PV_PRETTY_QUOTE | PERL_PV_ESCAPE_RE | PERL_PV_ESCAPE_NONASCII | PERL_PV_PRETTY_ELLIPSES | \
ab3bbdeb 868 ((isuni) ? PERL_PV_ESCAPE_UNI : 0)) \
0a0e9afc 869 )
ab3bbdeb
YO
870
871#define RE_SV_DUMPLEN(ItEm) (SvCUR(ItEm) - (SvTAIL(ItEm)!=0))
872#define RE_SV_TAIL(ItEm) (SvTAIL(ItEm) ? "$" : "")
873
874#else /* if not DEBUGGING */
875
a3621e74 876#define GET_RE_DEBUG_FLAGS_DECL
ab3bbdeb
YO
877#define RE_PV_COLOR_DECL(rpv,rlen,isuni,dsv,pv,l,m,c1,c2)
878#define RE_SV_ESCAPE(rpv,isuni,dsv,sv,m)
879#define RE_PV_QUOTED_DECL(rpv,isuni,dsv,pv,l,m)
880#define RE_SV_DUMPLEN(ItEm)
881#define RE_SV_TAIL(ItEm)
882
883#endif /* DEBUG RELATED DEFINES */
a3621e74 884
e9a8c099
MHM
885/*
886 * Local variables:
887 * c-indentation-style: bsd
888 * c-basic-offset: 4
14d04a33 889 * indent-tabs-mode: nil
e9a8c099
MHM
890 * End:
891 *
14d04a33 892 * ex: set ts=8 sts=4 sw=4 et:
e9a8c099 893 */