3 * Copyright (C) 1993, 1994, 1996, 1997, 1999, 2000, 2001, 2003,
4 * 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.
12 * Definitions etc. for regexp(3) routines.
14 * Caveat: this is V8 regexp(3) [actually, a reimplementation thereof],
15 * not the System V one.
17 #ifndef PLUGGABLE_RE_EXTENSION
18 /* we don't want to include this stuff if we are inside Nicholas'
19 * pluggable regex engine code */
27 typedef struct regnode regnode;
29 struct reg_substr_data;
35 typedef struct regexp_paren_ofs {
40 #ifdef PERL_OLD_COPY_ON_WRITE
41 #define SV_SAVED_COPY SV *saved_copy; /* If non-NULL, SV which is COW from original */
46 typedef struct regexp {
48 const struct regexp_engine* engine; /* what created this regexp? */
49 I32 refcnt; /* Refcount of this regexp */
51 /* The original string as passed to the compilation routine */
52 char *precomp; /* pre-compilation regular expression */
53 I32 prelen; /* length of precomp */
55 /* Used for generic optimisations by the perl core.
56 All engines are expected to provide this information. */
57 U32 extflags; /* Flags used both externally and internally */
58 I32 minlen; /* mininum possible length of string to match */
59 I32 minlenret; /* mininum possible length of $& */
60 U32 gofs; /* chars left of pos that we search from */
61 U32 nparens; /* number of capture buffers */
62 HV *paren_names; /* Optional hash of paren names */
63 struct reg_substr_data *substrs; /* substring data about strings that must appear
64 in the final match, used for optimisations */
66 /* Data about the last/current match. Used by the core and therefore
67 must be populated by all engines. */
68 char *subbeg; /* saved or original string
69 so \digit works forever. */
70 I32 sublen; /* Length of string pointed by subbeg */
71 I32 *startp; /* Array of offsets from start of string (@-) */
72 I32 *endp; /* Array of offsets from start of string (@+) */
74 SV_SAVED_COPY /* If non-NULL, SV which is COW from original */
75 U32 lastparen; /* last open paren matched */
76 U32 lastcloseparen; /* last close paren matched */
78 /* Perl Regex Engine specific data. Other engines shouldn't need
79 to touch this. Should be refactored out into a different structure
80 and accessed via the *pprivate field. (except intflags) */
81 U32 intflags; /* Internal flags */
82 void *pprivate; /* Data private to the regex engine which
83 created this object. Perl will never mess with
84 this member at all. */
85 regexp_paren_ofs *swap; /* Swap copy of *startp / *endp */
86 U32 *offsets; /* offset annotations 20001228 MJD
87 data about mapping the program to the
89 regnode *regstclass; /* Optional startclass as identified or constructed
91 struct reg_data *data; /* Additional miscellaneous data used by the program.
92 Used to make it easier to clone and free arbitrary
93 data that the regops need. Often the ARG field of
94 a regop is an index into this structure */
95 regnode program[1]; /* Unwarranted chumminess with compiler. */
99 typedef struct re_scream_pos_data_s
101 char **scream_olds; /* match pos */
102 I32 *scream_pos; /* Internal iterator of scream. */
103 } re_scream_pos_data;
105 typedef struct regexp_engine {
106 regexp* (*comp) (pTHX_ char* exp, char* xend, PMOP* pm);
107 I32 (*exec) (pTHX_ regexp* prog, char* stringarg, char* strend,
108 char* strbeg, I32 minend, SV* screamer,
109 void* data, U32 flags);
110 char* (*intuit) (pTHX_ regexp *prog, SV *sv, char *strpos,
111 char *strend, U32 flags,
112 struct re_scream_pos_data_s *data);
113 SV* (*checkstr) (pTHX_ regexp *prog);
114 void (*free) (pTHX_ struct regexp* r);
115 char* (*as_str) (pTHX_ MAGIC *mg, STRLEN *lp, U32 *flags, I32 *haseval);
117 regexp* (*dupe) (pTHX_ const regexp *r, CLONE_PARAMS *param);
122 * Flags stored in regexp->intflags
123 * These are used only internally to the regexp engine
125 #define PREGf_SKIP 0x00000001
126 #define PREGf_IMPLICIT 0x00000002 /* Converted .* to ^.* */
127 #define PREGf_NAUGHTY 0x00000004 /* how exponential is this pattern? */
128 #define PREGf_VERBARG_SEEN 0x00000008
129 #define PREGf_CUTGROUP_SEEN 0x00000010
132 /* Flags stored in regexp->extflags
133 * These are used by code external to the regexp engine
136 /* Anchor and GPOS related stuff */
137 #define RXf_ANCH_BOL 0x00000001
138 #define RXf_ANCH_MBOL 0x00000002
139 #define RXf_ANCH_SBOL 0x00000004
140 #define RXf_ANCH_GPOS 0x00000008
141 #define RXf_GPOS_SEEN 0x00000010
142 #define RXf_GPOS_FLOAT 0x00000020
144 #define RXf_ANCH (RXf_ANCH_BOL|RXf_ANCH_MBOL|RXf_ANCH_GPOS|RXf_ANCH_SBOL)
145 #define RXf_GPOS_CHECK (RXf_GPOS_SEEN|RXf_ANCH_GPOS)
146 #define RXf_ANCH_SINGLE (RXf_ANCH_SBOL|RXf_ANCH_GPOS)
148 * 0xF800 of extflags is used by PMf_COMPILETIME
149 * These are the regex equivelent of the PMf_xyz stuff defined
152 #define RXf_PMf_LOCALE 0x00000800
153 #define RXf_PMf_MULTILINE 0x00001000
154 #define RXf_PMf_SINGLELINE 0x00002000
155 #define RXf_PMf_FOLD 0x00004000
156 #define RXf_PMf_EXTENDED 0x00008000
157 #define RXf_PMf_COMPILETIME (RXf_PMf_MULTILINE|RXf_PMf_SINGLELINE|RXf_PMf_LOCALE|RXf_PMf_FOLD|RXf_PMf_EXTENDED)
159 /* What we have seen */
161 #define RXf_LOOKBEHIND_SEEN 0x00020000
162 #define RXf_EVAL_SEEN 0x00040000
163 #define RXf_CANY_SEEN 0x00080000
166 #define RXf_NOSCAN 0x00100000
167 #define RXf_CHECK_ALL 0x00200000
170 #define RXf_UTF8 0x00400000
171 #define RXf_MATCH_UTF8 0x00800000
174 #define RXf_USE_INTUIT_NOML 0x01000000
175 #define RXf_USE_INTUIT_ML 0x02000000
176 #define RXf_INTUIT_TAIL 0x04000000
178 #define RXf_USE_INTUIT (RXf_USE_INTUIT_NOML|RXf_USE_INTUIT_ML)
180 /* Copy and tainted info */
181 #define RXf_COPY_DONE 0x10000000
182 #define RXf_TAINTED_SEEN 0x20000000
186 #define RX_HAS_CUTGROUP(prog) ((prog)->intflags & PREGf_CUTGROUP_SEEN)
187 #define RX_MATCH_TAINTED(prog) ((prog)->extflags & RXf_TAINTED_SEEN)
188 #define RX_MATCH_TAINTED_on(prog) ((prog)->extflags |= RXf_TAINTED_SEEN)
189 #define RX_MATCH_TAINTED_off(prog) ((prog)->extflags &= ~RXf_TAINTED_SEEN)
190 #define RX_MATCH_TAINTED_set(prog, t) ((t) \
191 ? RX_MATCH_TAINTED_on(prog) \
192 : RX_MATCH_TAINTED_off(prog))
194 #define RX_MATCH_COPIED(prog) ((prog)->extflags & RXf_COPY_DONE)
195 #define RX_MATCH_COPIED_on(prog) ((prog)->extflags |= RXf_COPY_DONE)
196 #define RX_MATCH_COPIED_off(prog) ((prog)->extflags &= ~RXf_COPY_DONE)
197 #define RX_MATCH_COPIED_set(prog,t) ((t) \
198 ? RX_MATCH_COPIED_on(prog) \
199 : RX_MATCH_COPIED_off(prog))
201 #endif /* PLUGGABLE_RE_EXTENSION */
203 /* Stuff that needs to be included in the plugable extension goes below here */
205 #ifdef PERL_OLD_COPY_ON_WRITE
206 #define RX_MATCH_COPY_FREE(rx) \
207 STMT_START {if (rx->saved_copy) { \
208 SV_CHECK_THINKFIRST_COW_DROP(rx->saved_copy); \
210 if (RX_MATCH_COPIED(rx)) { \
211 Safefree(rx->subbeg); \
212 RX_MATCH_COPIED_off(rx); \
215 #define RX_MATCH_COPY_FREE(rx) \
216 STMT_START {if (RX_MATCH_COPIED(rx)) { \
217 Safefree(rx->subbeg); \
218 RX_MATCH_COPIED_off(rx); \
222 #define RX_MATCH_UTF8(prog) ((prog)->extflags & RXf_MATCH_UTF8)
223 #define RX_MATCH_UTF8_on(prog) ((prog)->extflags |= RXf_MATCH_UTF8)
224 #define RX_MATCH_UTF8_off(prog) ((prog)->extflags &= ~RXf_MATCH_UTF8)
225 #define RX_MATCH_UTF8_set(prog, t) ((t) \
226 ? (RX_MATCH_UTF8_on(prog), (PL_reg_match_utf8 = 1)) \
227 : (RX_MATCH_UTF8_off(prog), (PL_reg_match_utf8 = 0)))
229 #define REXEC_COPY_STR 0x01 /* Need to copy the string. */
230 #define REXEC_CHECKED 0x02 /* check_substr already checked. */
231 #define REXEC_SCREAM 0x04 /* use scream table. */
232 #define REXEC_IGNOREPOS 0x08 /* \G matches at start. */
233 #define REXEC_NOT_FIRST 0x10 /* This is another iteration of //g. */
235 #define ReREFCNT_inc(re) ((void)(re && re->refcnt++), re)
236 #define ReREFCNT_dec(re) CALLREGFREE(re)
238 #define FBMcf_TAIL_DOLLAR 1
239 #define FBMcf_TAIL_DOLLARM 2
240 #define FBMcf_TAIL_Z 4
241 #define FBMcf_TAIL_z 8
242 #define FBMcf_TAIL (FBMcf_TAIL_DOLLAR|FBMcf_TAIL_DOLLARM|FBMcf_TAIL_Z|FBMcf_TAIL_z)
244 #define FBMrf_MULTILINE 1
246 /* an accepting state/position*/
247 struct _reg_trie_accepted {
251 typedef struct _reg_trie_accepted reg_trie_accepted;
253 /* some basic information about the current match that is created by
254 * Perl_regexec_flags and then passed to regtry(), regmatch() etc */
266 /* structures for holding and saving the state maintained by regmatch() */
268 #define MAX_RECURSE_EVAL_NOCHANGE_DEPTH 50
270 typedef I32 CHECKPOINT;
272 typedef struct regmatch_state {
273 int resume_state; /* where to jump to on return */
274 char *locinput; /* where to backtrack in string on failure */
278 /* this is a fake union member that matches the first element
279 * of each member that needs to store positive backtrack
282 struct regmatch_state *prev_yes_state;
286 /* this first element must match u.yes */
287 struct regmatch_state *prev_yes_state;
288 reg_trie_accepted *accept_buff;
289 U32 accepted; /* how many accepting states we have seen */
290 U16 *jump; /* positive offsets from me */
291 regnode *B; /* node following the trie */
292 regnode *me; /* Which node am I - needed for jump tries*/
296 /* this first element must match u.yes */
297 struct regmatch_state *prev_yes_state;
298 struct regmatch_state *prev_eval;
299 struct regmatch_state *prev_curlyx;
301 U32 toggle_reg_flags; /* what bits in PL_reg_flags to
302 flip when transitioning between
303 inner and outer rexen */
304 CHECKPOINT cp; /* remember current savestack indexes */
306 regnode *B; /* the node following us */
307 U32 close_paren; /* which close bracket is our end */
311 /* this first element must match u.yes */
312 struct regmatch_state *prev_yes_state;
313 struct regmatch_state *prev_curlyx; /* previous cur_curlyx */
314 CHECKPOINT cp; /* remember current savestack index */
316 int parenfloor;/* how far back to strip paren data */
317 int min; /* the minimal number of A's to match */
318 int max; /* the maximal number of A's to match */
319 regnode *A, *B; /* the nodes corresponding to /A*B/ */
321 /* these two are modified by WHILEM */
322 int count; /* how many instances of A we've matched */
323 char *lastloc;/* where previous A matched (0-len detect) */
327 /* this first element must match u.yes */
328 struct regmatch_state *prev_yes_state;
329 struct regmatch_state *save_curlyx;
330 CHECKPOINT cp; /* remember current savestack indexes */
332 char *save_lastloc; /* previous curlyx.lastloc */
338 /* this first element must match u.yes */
339 struct regmatch_state *prev_yes_state;
341 regnode *next_branch; /* next branch node */
346 /* this first element must match u.yes */
347 struct regmatch_state *prev_yes_state;
348 I32 c1, c2; /* case fold search */
350 I32 alen; /* length of first-matched A string */
353 regnode *A, *B; /* the nodes corresponding to /A*B/ */
354 regnode *me; /* the curlym node */
360 I32 c1, c2; /* case fold search */
361 char *maxpos; /* highest possible point in string to match */
362 char *oldloc; /* the previous locinput */
364 int min, max; /* {m,n} */
365 regnode *A, *B; /* the nodes corresponding to /A*B/ */
366 } curly; /* and CURLYN/PLUS/STAR */
369 /* this first element must match u.yes */
370 struct regmatch_state *prev_yes_state;
372 I32 logical; /* saved copy of 'logical' var */
373 regnode *me; /* the IFMATCH/SUSPEND/UNLESSM node */
374 } ifmatch; /* and SUSPEND/UNLESSM */
377 /* this first element must match u.yes */
378 struct regmatch_state *prev_yes_state;
379 struct regmatch_state *prev_mark;
386 /* how many regmatch_state structs to allocate as a single slab.
387 * We do it in 4K blocks for efficiency. The "3" is 2 for the next/prev
388 * pointers, plus 1 for any mythical malloc overhead. */
390 #define PERL_REGMATCH_SLAB_SLOTS \
391 ((4096 - 3 * sizeof (void*)) / sizeof(regmatch_state))
393 typedef struct regmatch_slab {
394 regmatch_state states[PERL_REGMATCH_SLAB_SLOTS];
395 struct regmatch_slab *prev, *next;
398 #define PL_reg_flags PL_reg_state.re_state_reg_flags
399 #define PL_bostr PL_reg_state.re_state_bostr
400 #define PL_reginput PL_reg_state.re_state_reginput
401 #define PL_regeol PL_reg_state.re_state_regeol
402 #define PL_regstartp PL_reg_state.re_state_regstartp
403 #define PL_regendp PL_reg_state.re_state_regendp
404 #define PL_reglastparen PL_reg_state.re_state_reglastparen
405 #define PL_reglastcloseparen PL_reg_state.re_state_reglastcloseparen
406 #define PL_reg_start_tmp PL_reg_state.re_state_reg_start_tmp
407 #define PL_reg_start_tmpl PL_reg_state.re_state_reg_start_tmpl
408 #define PL_reg_eval_set PL_reg_state.re_state_reg_eval_set
409 #define PL_reg_match_utf8 PL_reg_state.re_state_reg_match_utf8
410 #define PL_reg_magic PL_reg_state.re_state_reg_magic
411 #define PL_reg_oldpos PL_reg_state.re_state_reg_oldpos
412 #define PL_reg_oldcurpm PL_reg_state.re_state_reg_oldcurpm
413 #define PL_reg_curpm PL_reg_state.re_state_reg_curpm
414 #define PL_reg_oldsaved PL_reg_state.re_state_reg_oldsaved
415 #define PL_reg_oldsavedlen PL_reg_state.re_state_reg_oldsavedlen
416 #define PL_reg_maxiter PL_reg_state.re_state_reg_maxiter
417 #define PL_reg_leftiter PL_reg_state.re_state_reg_leftiter
418 #define PL_reg_poscache PL_reg_state.re_state_reg_poscache
419 #define PL_reg_poscache_size PL_reg_state.re_state_reg_poscache_size
420 #define PL_regsize PL_reg_state.re_state_regsize
421 #define PL_reg_starttry PL_reg_state.re_state_reg_starttry
422 #define PL_nrs PL_reg_state.re_state_nrs
424 struct re_save_state {
425 U32 re_state_reg_flags; /* from regexec.c */
426 char *re_state_bostr;
427 char *re_state_reginput; /* String-input pointer. */
428 char *re_state_regeol; /* End of input, for $ check. */
429 I32 *re_state_regstartp; /* Pointer to startp array. */
430 I32 *re_state_regendp; /* Ditto for endp. */
431 U32 *re_state_reglastparen; /* Similarly for lastparen. */
432 U32 *re_state_reglastcloseparen; /* Similarly for lastcloseparen. */
433 char **re_state_reg_start_tmp; /* from regexec.c */
434 U32 re_state_reg_start_tmpl; /* from regexec.c */
435 I32 re_state_reg_eval_set; /* from regexec.c */
436 bool re_state_reg_match_utf8; /* from regexec.c */
437 MAGIC *re_state_reg_magic; /* from regexec.c */
438 I32 re_state_reg_oldpos; /* from regexec.c */
439 PMOP *re_state_reg_oldcurpm; /* from regexec.c */
440 PMOP *re_state_reg_curpm; /* from regexec.c */
441 char *re_state_reg_oldsaved; /* old saved substr during match */
442 STRLEN re_state_reg_oldsavedlen; /* old length of saved substr during match */
443 I32 re_state_reg_maxiter; /* max wait until caching pos */
444 I32 re_state_reg_leftiter; /* wait until caching pos */
445 char *re_state_reg_poscache; /* cache of pos of WHILEM */
446 STRLEN re_state_reg_poscache_size; /* size of pos cache of WHILEM */
447 U32 re_state_regsize; /* from regexec.c */
448 char *re_state_reg_starttry; /* from regexec.c */
449 #ifdef PERL_OLD_COPY_ON_WRITE
450 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 */
454 #define SAVESTACK_ALLOC_FOR_RE_SAVE_STATE \
455 (1 + ((sizeof(struct re_save_state) - 1) / sizeof(*PL_savestack)))
458 * c-indentation-style: bsd
460 * indent-tabs-mode: t
463 * ex: set ts=8 sts=4 sw=4 noet: