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