(?p{}) has been deprecated for a long time.
[p5sagit/p5-mst-13.2.git] / regexp.h
CommitLineData
a0d0e21e 1/* regexp.h
d6376244 2 *
4bb101f2 3 * Copyright (C) 1993, 1994, 1996, 1997, 1999, 2000, 2001, 2003,
699a97de 4 * 2005, 2006 by Larry Wall and others
d6376244 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 *
a0d0e21e 9 */
10
378cc40b 11/*
12 * Definitions etc. for regexp(3) routines.
13 *
14 * Caveat: this is V8 regexp(3) [actually, a reimplementation thereof],
15 * not the System V one.
16 */
be8e71aa 17#ifndef PLUGGABLE_RE_EXTENSION
785a26d5 18/* we don't want to include this stuff if we are inside of
19 an external regex engine based on the core one - like re 'debug'*/
378cc40b 20
c277df42 21struct regnode {
22 U8 flags;
23 U8 type;
24 U16 next_off;
25};
26
27typedef struct regnode regnode;
28
cad2e5aa 29struct reg_substr_data;
2779dcf1 30
0ee3c8d0 31struct reg_data;
32
f9f4320a 33struct regexp_engine;
bbe252da 34
785a26d5 35struct reg_substr_datum {
36 I32 min_offset;
37 I32 max_offset;
38 SV *substr; /* non-utf8 variant */
39 SV *utf8_substr; /* utf8 variant */
40 I32 end_shift;
41};
42struct reg_substr_data {
43 struct reg_substr_datum data[3]; /* Actual array */
44};
f9f4320a 45
f8c7b90f 46#ifdef PERL_OLD_COPY_ON_WRITE
bbe252da 47#define SV_SAVED_COPY SV *saved_copy; /* If non-NULL, SV which is COW from original */
48#else
49#define SV_SAVED_COPY
ed252734 50#endif
f8149455 51/* this is ordered such that the most commonly used
52 fields are at the start of the struct */
bbe252da 53typedef struct regexp {
f8149455 54 /* what engine created this regexp? */
55 const struct regexp_engine* engine;
56
57 /* Information about the match that the perl core uses to manage things */
bbe252da 58 U32 extflags; /* Flags used both externally and internally */
de8c5301 59 I32 minlen; /* mininum possible length of string to match */
60 I32 minlenret; /* mininum possible length of $& */
58e23c8d 61 U32 gofs; /* chars left of pos that we search from */
f8149455 62 struct reg_substr_data *substrs; /* substring data about strings that must appear
bbe252da 63 in the final match, used for optimisations */
f8149455 64 U32 nparens; /* number of capture buffers */
bbe252da 65
f8149455 66 /* private engine specific data */
67 U32 intflags; /* Engine Specific Internal flags */
68 void *pprivate; /* Data private to the regex engine which
69 created this object. */
70
71 /* Data about the last/current match. These are modified during matching*/
72 U32 lastparen; /* last open paren matched */
73 U32 lastcloseparen; /* last close paren matched */
74 I32 *startp; /* Array of offsets from start of string (@-) */
75 I32 *endp; /* Array of offsets from start of string (@+) */
bbe252da 76 char *subbeg; /* saved or original string
77 so \digit works forever. */
78 I32 sublen; /* Length of string pointed by subbeg */
bbe252da 79 SV_SAVED_COPY /* If non-NULL, SV which is COW from original */
f8149455 80
81
82 /* Information about the match that isn't often used */
83 char *precomp; /* pre-compilation regular expression */
84 I32 prelen; /* length of precomp */
bcdf7404 85 char *wrapped; /* wrapped version of the pattern */
86 I32 wraplen; /* length of wrapped */
f8149455 87 I32 seen_evals; /* number of eval groups in the pattern - for security checks */
88 HV *paren_names; /* Optional hash of paren names */
89
90 /* Refcount of this regexp */
91 I32 refcnt; /* Refcount of this regexp */
f8fc2ecf 92} regexp;
93
785a26d5 94/* used for high speed searches */
f9f4320a 95typedef struct re_scream_pos_data_s
96{
97 char **scream_olds; /* match pos */
98 I32 *scream_pos; /* Internal iterator of scream. */
99} re_scream_pos_data;
100
785a26d5 101/* regexp_engine structure. This is the dispatch table for regexes.
102 * Any regex engine implementation must be able to build one of these.
103 */
f9f4320a 104typedef struct regexp_engine {
f2f78491 105 regexp* (*comp) (pTHX_ char* exp, char* xend, PMOP* pm);
106 I32 (*exec) (pTHX_ regexp* prog, char* stringarg, char* strend,
f9f4320a 107 char* strbeg, I32 minend, SV* screamer,
108 void* data, U32 flags);
f2f78491 109 char* (*intuit) (pTHX_ regexp *prog, SV *sv, char *strpos,
110 char *strend, U32 flags,
111 struct re_scream_pos_data_s *data);
112 SV* (*checkstr) (pTHX_ regexp *prog);
113 void (*free) (pTHX_ struct regexp* r);
93b32b6d 114 SV* (*numbered_buff_get) (pTHX_ const REGEXP * const rx, I32 paren, SV* usesv);
115 SV* (*named_buff_get)(pTHX_ const REGEXP * const rx, SV* namesv, U32 flags);
f2f78491 116#ifdef USE_ITHREADS
f8149455 117 void* (*dupe) (pTHX_ const regexp *r, CLONE_PARAMS *param);
f9f4320a 118#endif
119} regexp_engine;
120
bbe252da 121/* Flags stored in regexp->extflags
122 * These are used by code external to the regexp engine
e357fc67 123 *
124 * Note that flags starting with RXf_PMf_ have exact equivalents
125 * stored in op_pmflags and which are defined in op.h, they are defined
126 * numerically here only for clarity.
bbe252da 127 */
128
129/* Anchor and GPOS related stuff */
130#define RXf_ANCH_BOL 0x00000001
131#define RXf_ANCH_MBOL 0x00000002
132#define RXf_ANCH_SBOL 0x00000004
133#define RXf_ANCH_GPOS 0x00000008
134#define RXf_GPOS_SEEN 0x00000010
135#define RXf_GPOS_FLOAT 0x00000020
e357fc67 136/* two bits here */
bbe252da 137#define RXf_ANCH (RXf_ANCH_BOL|RXf_ANCH_MBOL|RXf_ANCH_GPOS|RXf_ANCH_SBOL)
138#define RXf_GPOS_CHECK (RXf_GPOS_SEEN|RXf_ANCH_GPOS)
e357fc67 139#define RXf_ANCH_SINGLE (RXf_ANCH_SBOL|RXf_ANCH_GPOS)
140
141/* Flags indicating special patterns */
142#define RXf_START_ONLY 0x00000200 /* Pattern is /^/ */
143#define RXf_WHITE 0x00000400 /* Pattern is /\s+/ */
144
bcdf7404 145/* 0x1F800 of extflags is used by (RXf_)PMf_COMPILETIME */
e357fc67 146#define RXf_PMf_LOCALE 0x00000800 /* use locale */
147#define RXf_PMf_MULTILINE 0x00001000 /* /m */
148#define RXf_PMf_SINGLELINE 0x00002000 /* /s */
149#define RXf_PMf_FOLD 0x00004000 /* /i */
150#define RXf_PMf_EXTENDED 0x00008000 /* /x */
cde0cee5 151#define RXf_PMf_KEEPCOPY 0x00010000 /* /k */
e357fc67 152/* these flags are transfered from the PMOP->op_pmflags member during compilation */
cde0cee5 153#define RXf_PMf_STD_PMMOD (RXf_PMf_MULTILINE|RXf_PMf_SINGLELINE|RXf_PMf_FOLD|RXf_PMf_EXTENDED)
154#define RXf_PMf_COMPILETIME (RXf_PMf_MULTILINE|RXf_PMf_SINGLELINE|RXf_PMf_LOCALE|RXf_PMf_FOLD|RXf_PMf_EXTENDED|RXf_PMf_KEEPCOPY)
155
a20207d7 156#define CASE_STD_PMMOD_FLAGS_PARSE_SET(pmfl) \
157 case IGNORE_PAT_MOD: *(pmfl) |= RXf_PMf_FOLD; break; \
158 case MULTILINE_PAT_MOD: *(pmfl) |= RXf_PMf_MULTILINE; break; \
159 case SINGLE_PAT_MOD: *(pmfl) |= RXf_PMf_SINGLELINE; break; \
160 case XTENDED_PAT_MOD: *(pmfl) |= RXf_PMf_EXTENDED; break
bbe252da 161
bcdf7404 162/* chars and strings used as regex pattern modifiers
163 * Singlular is a 'c'har, plural is a "string"
87e95b7f 164 *
165 * NOTE, KEEPCOPY was originally 'k', but was changed to 'p' for preserve
166 * for compatibility reasons with Regexp::Common which highjacked (?k:...)
167 * for its own uses. So 'k' is out as well.
bcdf7404 168 */
169#define EXEC_PAT_MOD 'e'
87e95b7f 170#define KEEPCOPY_PAT_MOD 'p'
bcdf7404 171#define ONCE_PAT_MOD 'o'
172#define GLOBAL_PAT_MOD 'g'
173#define CONTINUE_PAT_MOD 'c'
174#define MULTILINE_PAT_MOD 'm'
175#define SINGLE_PAT_MOD 's'
176#define IGNORE_PAT_MOD 'i'
177#define XTENDED_PAT_MOD 'x'
178
179#define ONCE_PAT_MODS "o"
87e95b7f 180#define KEEPCOPY_PAT_MODS "p"
bcdf7404 181#define EXEC_PAT_MODS "e"
182#define LOOP_PAT_MODS "gc"
183
184#define STD_PAT_MODS "msix"
185
186#define INT_PAT_MODS STD_PAT_MODS KEEPCOPY_PAT_MODS
187
188#define EXT_PAT_MODS ONCE_PAT_MODS KEEPCOPY_PAT_MODS
189#define QR_PAT_MODS STD_PAT_MODS EXT_PAT_MODS
190#define M_PAT_MODS QR_PAT_MODS LOOP_PAT_MODS
191#define S_PAT_MODS M_PAT_MODS EXEC_PAT_MODS
192
193
bbe252da 194/* What we have seen */
bbe252da 195#define RXf_LOOKBEHIND_SEEN 0x00020000
196#define RXf_EVAL_SEEN 0x00040000
197#define RXf_CANY_SEEN 0x00080000
198
199/* Special */
200#define RXf_NOSCAN 0x00100000
201#define RXf_CHECK_ALL 0x00200000
202
203/* UTF8 related */
204#define RXf_UTF8 0x00400000
205#define RXf_MATCH_UTF8 0x00800000
206
207/* Intuit related */
208#define RXf_USE_INTUIT_NOML 0x01000000
209#define RXf_USE_INTUIT_ML 0x02000000
210#define RXf_INTUIT_TAIL 0x04000000
211/* one bit here */
212#define RXf_USE_INTUIT (RXf_USE_INTUIT_NOML|RXf_USE_INTUIT_ML)
213
214/* Copy and tainted info */
215#define RXf_COPY_DONE 0x10000000
216#define RXf_TAINTED_SEEN 0x20000000
217/* two bits here */
218
219
220#define RX_HAS_CUTGROUP(prog) ((prog)->intflags & PREGf_CUTGROUP_SEEN)
221#define RX_MATCH_TAINTED(prog) ((prog)->extflags & RXf_TAINTED_SEEN)
222#define RX_MATCH_TAINTED_on(prog) ((prog)->extflags |= RXf_TAINTED_SEEN)
223#define RX_MATCH_TAINTED_off(prog) ((prog)->extflags &= ~RXf_TAINTED_SEEN)
72311751 224#define RX_MATCH_TAINTED_set(prog, t) ((t) \
225 ? RX_MATCH_TAINTED_on(prog) \
226 : RX_MATCH_TAINTED_off(prog))
c277df42 227
bbe252da 228#define RX_MATCH_COPIED(prog) ((prog)->extflags & RXf_COPY_DONE)
229#define RX_MATCH_COPIED_on(prog) ((prog)->extflags |= RXf_COPY_DONE)
230#define RX_MATCH_COPIED_off(prog) ((prog)->extflags &= ~RXf_COPY_DONE)
cf93c79d 231#define RX_MATCH_COPIED_set(prog,t) ((t) \
232 ? RX_MATCH_COPIED_on(prog) \
233 : RX_MATCH_COPIED_off(prog))
f9f4320a 234
be8e71aa 235#endif /* PLUGGABLE_RE_EXTENSION */
236
237/* Stuff that needs to be included in the plugable extension goes below here */
238
f8c7b90f 239#ifdef PERL_OLD_COPY_ON_WRITE
ed252734 240#define RX_MATCH_COPY_FREE(rx) \
241 STMT_START {if (rx->saved_copy) { \
242 SV_CHECK_THINKFIRST_COW_DROP(rx->saved_copy); \
243 } \
244 if (RX_MATCH_COPIED(rx)) { \
245 Safefree(rx->subbeg); \
246 RX_MATCH_COPIED_off(rx); \
247 }} STMT_END
248#else
249#define RX_MATCH_COPY_FREE(rx) \
250 STMT_START {if (RX_MATCH_COPIED(rx)) { \
251 Safefree(rx->subbeg); \
252 RX_MATCH_COPIED_off(rx); \
253 }} STMT_END
254#endif
255
bbe252da 256#define RX_MATCH_UTF8(prog) ((prog)->extflags & RXf_MATCH_UTF8)
257#define RX_MATCH_UTF8_on(prog) ((prog)->extflags |= RXf_MATCH_UTF8)
258#define RX_MATCH_UTF8_off(prog) ((prog)->extflags &= ~RXf_MATCH_UTF8)
a30b2f1f 259#define RX_MATCH_UTF8_set(prog, t) ((t) \
260 ? (RX_MATCH_UTF8_on(prog), (PL_reg_match_utf8 = 1)) \
261 : (RX_MATCH_UTF8_off(prog), (PL_reg_match_utf8 = 0)))
262
cad2e5aa 263#define REXEC_COPY_STR 0x01 /* Need to copy the string. */
264#define REXEC_CHECKED 0x02 /* check_substr already checked. */
265#define REXEC_SCREAM 0x04 /* use scream table. */
266#define REXEC_IGNOREPOS 0x08 /* \G matches at start. */
cf93c79d 267#define REXEC_NOT_FIRST 0x10 /* This is another iteration of //g. */
c277df42 268
155aba94 269#define ReREFCNT_inc(re) ((void)(re && re->refcnt++), re)
f9f4320a 270#define ReREFCNT_dec(re) CALLREGFREE(re)
cf93c79d 271
272#define FBMcf_TAIL_DOLLAR 1
cad2e5aa 273#define FBMcf_TAIL_DOLLARM 2
274#define FBMcf_TAIL_Z 4
275#define FBMcf_TAIL_z 8
276#define FBMcf_TAIL (FBMcf_TAIL_DOLLAR|FBMcf_TAIL_DOLLARM|FBMcf_TAIL_Z|FBMcf_TAIL_z)
cf93c79d 277
278#define FBMrf_MULTILINE 1
cad2e5aa 279
5d9a96ca 280/* an accepting state/position*/
281struct _reg_trie_accepted {
282 U8 *endpos;
283 U16 wordnum;
284};
285typedef struct _reg_trie_accepted reg_trie_accepted;
286
3b0527fe 287/* some basic information about the current match that is created by
288 * Perl_regexec_flags and then passed to regtry(), regmatch() etc */
289
290typedef struct {
291 regexp *prog;
292 char *bol;
293 char *till;
294 SV *sv;
295 char *ganch;
24b23f37 296 char *cutpoint;
3b0527fe 297} regmatch_info;
298
5d9a96ca 299
300/* structures for holding and saving the state maintained by regmatch() */
301
d56b3014 302#ifndef MAX_RECURSE_EVAL_NOCHANGE_DEPTH
4b196cd4 303#define MAX_RECURSE_EVAL_NOCHANGE_DEPTH 1000
d56b3014 304#endif
6bda09f9 305
5d9a96ca 306typedef I32 CHECKPOINT;
307
a0374537 308typedef struct regmatch_state {
40a82448 309 int resume_state; /* where to jump to on return */
24d3c4a9 310 char *locinput; /* where to backtrack in string on failure */
e822a8b4 311
312 union {
77cb431f 313
314 /* this is a fake union member that matches the first element
315 * of each member that needs to store positive backtrack
316 * information */
317 struct {
318 struct regmatch_state *prev_yes_state;
319 } yes;
320
fae667d5 321 /* branchlike members */
322 /* this is a fake union member that matches the first elements
323 * of each member that needs to behave like a branch */
324 struct {
5d458dd8 325 /* this first element must match u.yes */
326 struct regmatch_state *prev_yes_state;
fae667d5 327 U32 lastparen;
328 CHECKPOINT cp;
329
330 } branchlike;
331
332 struct {
333 /* the first elements must match u.branchlike */
334 struct regmatch_state *prev_yes_state;
335 U32 lastparen;
336 CHECKPOINT cp;
337
338 regnode *next_branch; /* next branch node */
339 } branch;
340
341 struct {
342 /* the first elements must match u.branchlike */
343 struct regmatch_state *prev_yes_state;
344 U32 lastparen;
345 CHECKPOINT cp;
346
347 reg_trie_accepted *accept_buff; /* accepting states we have seen */
166ba7cd 348 U32 accepted; /* how many accepting states we have seen */
7f69552c 349 U16 *jump; /* positive offsets from me */
166ba7cd 350 regnode *B; /* node following the trie */
7f69552c 351 regnode *me; /* Which node am I - needed for jump tries*/
e822a8b4 352 } trie;
353
fae667d5 354 /* special types - these members are used to store state for special
355 regops like eval, if/then, lookaround and the markpoint state */
e822a8b4 356 struct {
77cb431f 357 /* this first element must match u.yes */
358 struct regmatch_state *prev_yes_state;
faec1544 359 struct regmatch_state *prev_eval;
360 struct regmatch_state *prev_curlyx;
aa283a38 361 regexp *prev_rex;
faec1544 362 U32 toggle_reg_flags; /* what bits in PL_reg_flags to
363 flip when transitioning between
364 inner and outer rexen */
aa283a38 365 CHECKPOINT cp; /* remember current savestack indexes */
366 CHECKPOINT lastcp;
40a82448 367 regnode *B; /* the node following us */
6bda09f9 368 U32 close_paren; /* which close bracket is our end */
e822a8b4 369 } eval;
370
371 struct {
c476f425 372 /* this first element must match u.yes */
262b90c4 373 struct regmatch_state *prev_yes_state;
fae667d5 374 I32 wanted;
375 I32 logical; /* saved copy of 'logical' var */
376 regnode *me; /* the IFMATCH/SUSPEND/UNLESSM node */
377 } ifmatch; /* and SUSPEND/UNLESSM */
378
379 struct {
380 /* this first element must match u.yes */
381 struct regmatch_state *prev_yes_state;
382 struct regmatch_state *prev_mark;
383 SV* mark_name;
384 char *mark_loc;
385 } mark;
386
387 struct {
388 int val;
389 } keeper;
390
391 /* quantifiers - these members are used for storing state for
392 for the regops used to implement quantifiers */
393 struct {
394 /* this first element must match u.yes */
395 struct regmatch_state *prev_yes_state;
c476f425 396 struct regmatch_state *prev_curlyx; /* previous cur_curlyx */
397 CHECKPOINT cp; /* remember current savestack index */
398 bool minmod;
a0374537 399 int parenfloor;/* how far back to strip paren data */
c476f425 400 int min; /* the minimal number of A's to match */
401 int max; /* the maximal number of A's to match */
402 regnode *A, *B; /* the nodes corresponding to /A*B/ */
403
404 /* these two are modified by WHILEM */
405 int count; /* how many instances of A we've matched */
406 char *lastloc;/* where previous A matched (0-len detect) */
e822a8b4 407 } curlyx;
408
409 struct {
c476f425 410 /* this first element must match u.yes */
262b90c4 411 struct regmatch_state *prev_yes_state;
c476f425 412 struct regmatch_state *save_curlyx;
413 CHECKPOINT cp; /* remember current savestack indexes */
414 CHECKPOINT lastcp;
415 char *save_lastloc; /* previous curlyx.lastloc */
416 I32 cache_offset;
417 I32 cache_mask;
e822a8b4 418 } whilem;
419
420 struct {
5d458dd8 421 /* this first element must match u.yes */
422 struct regmatch_state *prev_yes_state;
e822a8b4 423 I32 c1, c2; /* case fold search */
40a82448 424 CHECKPOINT cp;
425 I32 alen; /* length of first-matched A string */
426 I32 count;
0cadcf80 427 bool minmod;
40a82448 428 regnode *A, *B; /* the nodes corresponding to /A*B/ */
429 regnode *me; /* the curlym node */
e822a8b4 430 } curlym;
431
432 struct {
3b6647e0 433 U32 paren;
c255a977 434 CHECKPOINT cp;
e822a8b4 435 I32 c1, c2; /* case fold search */
c255a977 436 char *maxpos; /* highest possible point in string to match */
437 char *oldloc; /* the previous locinput */
e822a8b4 438 int count;
c255a977 439 int min, max; /* {m,n} */
440 regnode *A, *B; /* the nodes corresponding to /A*B/ */
441 } curly; /* and CURLYN/PLUS/STAR */
dad79028 442
d8319b27 443 } u;
5d9a96ca 444} regmatch_state;
445
446/* how many regmatch_state structs to allocate as a single slab.
447 * We do it in 4K blocks for efficiency. The "3" is 2 for the next/prev
448 * pointers, plus 1 for any mythical malloc overhead. */
449
450#define PERL_REGMATCH_SLAB_SLOTS \
451 ((4096 - 3 * sizeof (void*)) / sizeof(regmatch_state))
452
453typedef struct regmatch_slab {
454 regmatch_state states[PERL_REGMATCH_SLAB_SLOTS];
455 struct regmatch_slab *prev, *next;
456} regmatch_slab;
1ade1aa1 457
46ab3289 458#define PL_reg_flags PL_reg_state.re_state_reg_flags
459#define PL_bostr PL_reg_state.re_state_bostr
460#define PL_reginput PL_reg_state.re_state_reginput
46ab3289 461#define PL_regeol PL_reg_state.re_state_regeol
462#define PL_regstartp PL_reg_state.re_state_regstartp
463#define PL_regendp PL_reg_state.re_state_regendp
464#define PL_reglastparen PL_reg_state.re_state_reglastparen
465#define PL_reglastcloseparen PL_reg_state.re_state_reglastcloseparen
46ab3289 466#define PL_reg_start_tmp PL_reg_state.re_state_reg_start_tmp
467#define PL_reg_start_tmpl PL_reg_state.re_state_reg_start_tmpl
468#define PL_reg_eval_set PL_reg_state.re_state_reg_eval_set
46ab3289 469#define PL_reg_match_utf8 PL_reg_state.re_state_reg_match_utf8
470#define PL_reg_magic PL_reg_state.re_state_reg_magic
471#define PL_reg_oldpos PL_reg_state.re_state_reg_oldpos
472#define PL_reg_oldcurpm PL_reg_state.re_state_reg_oldcurpm
473#define PL_reg_curpm PL_reg_state.re_state_reg_curpm
474#define PL_reg_oldsaved PL_reg_state.re_state_reg_oldsaved
475#define PL_reg_oldsavedlen PL_reg_state.re_state_reg_oldsavedlen
476#define PL_reg_maxiter PL_reg_state.re_state_reg_maxiter
477#define PL_reg_leftiter PL_reg_state.re_state_reg_leftiter
478#define PL_reg_poscache PL_reg_state.re_state_reg_poscache
479#define PL_reg_poscache_size PL_reg_state.re_state_reg_poscache_size
480#define PL_regsize PL_reg_state.re_state_regsize
481#define PL_reg_starttry PL_reg_state.re_state_reg_starttry
482#define PL_nrs PL_reg_state.re_state_nrs
483
1ade1aa1 484struct re_save_state {
485 U32 re_state_reg_flags; /* from regexec.c */
486 char *re_state_bostr;
487 char *re_state_reginput; /* String-input pointer. */
1ade1aa1 488 char *re_state_regeol; /* End of input, for $ check. */
489 I32 *re_state_regstartp; /* Pointer to startp array. */
490 I32 *re_state_regendp; /* Ditto for endp. */
491 U32 *re_state_reglastparen; /* Similarly for lastparen. */
492 U32 *re_state_reglastcloseparen; /* Similarly for lastcloseparen. */
1ade1aa1 493 char **re_state_reg_start_tmp; /* from regexec.c */
494 U32 re_state_reg_start_tmpl; /* from regexec.c */
495 I32 re_state_reg_eval_set; /* from regexec.c */
1ade1aa1 496 bool re_state_reg_match_utf8; /* from regexec.c */
497 MAGIC *re_state_reg_magic; /* from regexec.c */
498 I32 re_state_reg_oldpos; /* from regexec.c */
499 PMOP *re_state_reg_oldcurpm; /* from regexec.c */
500 PMOP *re_state_reg_curpm; /* from regexec.c */
501 char *re_state_reg_oldsaved; /* old saved substr during match */
502 STRLEN re_state_reg_oldsavedlen; /* old length of saved substr during match */
503 I32 re_state_reg_maxiter; /* max wait until caching pos */
504 I32 re_state_reg_leftiter; /* wait until caching pos */
505 char *re_state_reg_poscache; /* cache of pos of WHILEM */
506 STRLEN re_state_reg_poscache_size; /* size of pos cache of WHILEM */
3b6647e0 507 U32 re_state_regsize; /* from regexec.c */
1ade1aa1 508 char *re_state_reg_starttry; /* from regexec.c */
509#ifdef PERL_OLD_COPY_ON_WRITE
46ab3289 510 SV *re_state_nrs; /* was placeholder: unused since 5.8.0 (5.7.2 patch #12027 for bug ID 20010815.012). Used to save rx->saved_copy */
1ade1aa1 511#endif
512};
513
514#define SAVESTACK_ALLOC_FOR_RE_SAVE_STATE \
515 (1 + ((sizeof(struct re_save_state) - 1) / sizeof(*PL_savestack)))
cde0cee5 516
1ade1aa1 517/*
518 * Local variables:
519 * c-indentation-style: bsd
520 * c-basic-offset: 4
521 * indent-tabs-mode: t
522 * End:
523 *
524 * ex: set ts=8 sts=4 sw=4 noet:
525 */