| 1 | /* regexp.h |
| 2 | * |
| 3 | * Copyright (C) 1993, 1994, 1996, 1997, 1999, 2000, 2001, 2003, |
| 4 | * 2005, 2006, 2007, 2008 by Larry Wall and others |
| 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 | * |
| 9 | */ |
| 10 | |
| 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 | */ |
| 17 | #ifndef PLUGGABLE_RE_EXTENSION |
| 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'*/ |
| 20 | |
| 21 | struct regnode { |
| 22 | U8 flags; |
| 23 | U8 type; |
| 24 | U16 next_off; |
| 25 | }; |
| 26 | |
| 27 | typedef struct regnode regnode; |
| 28 | |
| 29 | struct reg_substr_data; |
| 30 | |
| 31 | struct reg_data; |
| 32 | |
| 33 | struct regexp_engine; |
| 34 | struct regexp; |
| 35 | |
| 36 | struct reg_substr_datum { |
| 37 | I32 min_offset; |
| 38 | I32 max_offset; |
| 39 | SV *substr; /* non-utf8 variant */ |
| 40 | SV *utf8_substr; /* utf8 variant */ |
| 41 | I32 end_shift; |
| 42 | }; |
| 43 | struct reg_substr_data { |
| 44 | struct reg_substr_datum data[3]; /* Actual array */ |
| 45 | }; |
| 46 | |
| 47 | #ifdef PERL_OLD_COPY_ON_WRITE |
| 48 | #define SV_SAVED_COPY SV *saved_copy; /* If non-NULL, SV which is COW from original */ |
| 49 | #else |
| 50 | #define SV_SAVED_COPY |
| 51 | #endif |
| 52 | |
| 53 | typedef struct regexp_paren_pair { |
| 54 | I32 start; |
| 55 | I32 end; |
| 56 | } regexp_paren_pair; |
| 57 | |
| 58 | /* |
| 59 | The regexp/REGEXP struct, see L<perlreapi> for further documentation |
| 60 | on the individual fields. The struct is ordered so that the most |
| 61 | commonly used fields are placed at the start. |
| 62 | |
| 63 | Any patch that adds items to this struct will need to include |
| 64 | changes to F<sv.c> (C<Perl_re_dup()>) and F<regcomp.c> |
| 65 | (C<pregfree()>). This involves freeing or cloning items in the |
| 66 | regexp's data array based on the data item's type. |
| 67 | */ |
| 68 | |
| 69 | #define _REGEXP_COMMON \ |
| 70 | /* what engine created this regexp? */ \ |
| 71 | const struct regexp_engine* engine; \ |
| 72 | REGEXP *mother_re; /* what re is this a lightweight copy of? */ \ |
| 73 | HV *paren_names; /* Optional hash of paren names */ \ |
| 74 | /* Information about the match that the perl core uses to */ \ |
| 75 | /* manage things */ \ |
| 76 | U32 extflags; /* Flags used both externally and internally */ \ |
| 77 | I32 minlen; /* mininum possible length of string to match */\ |
| 78 | I32 minlenret; /* mininum possible length of $& */ \ |
| 79 | U32 gofs; /* chars left of pos that we search from */ \ |
| 80 | /* substring data about strings that must appear in the */ \ |
| 81 | /* final match, used for optimisations */ \ |
| 82 | struct reg_substr_data *substrs; \ |
| 83 | U32 nparens; /* number of capture buffers */ \ |
| 84 | /* private engine specific data */ \ |
| 85 | U32 intflags; /* Engine Specific Internal flags */ \ |
| 86 | void *pprivate; /* Data private to the regex engine which */ \ |
| 87 | /* created this object. */ \ |
| 88 | /* Data about the last/current match. These are modified */ \ |
| 89 | /* during matching */ \ |
| 90 | U32 lastparen; /* last open paren matched */ \ |
| 91 | U32 lastcloseparen; /* last close paren matched */ \ |
| 92 | regexp_paren_pair *swap; /* Unused: 5.10.1 and later */ \ |
| 93 | /* Array of offsets for (@-) and (@+) */ \ |
| 94 | regexp_paren_pair *offs; \ |
| 95 | /* saved or original string so \digit works forever. */ \ |
| 96 | char *subbeg; \ |
| 97 | SV_SAVED_COPY /* If non-NULL, SV which is COW from original */\ |
| 98 | I32 sublen; /* Length of string pointed by subbeg */ \ |
| 99 | /* Information about the match that isn't often used */ \ |
| 100 | /* offset from wrapped to the start of precomp */ \ |
| 101 | PERL_BITFIELD32 pre_prefix:4; \ |
| 102 | /* number of eval groups in the pattern - for security checks */\ |
| 103 | PERL_BITFIELD32 seen_evals:28 |
| 104 | |
| 105 | typedef struct regexp { |
| 106 | _XPV_HEAD; |
| 107 | _REGEXP_COMMON; |
| 108 | } regexp; |
| 109 | |
| 110 | #define RXp_PAREN_NAMES(rx) ((rx)->paren_names) |
| 111 | |
| 112 | /* used for high speed searches */ |
| 113 | typedef struct re_scream_pos_data_s |
| 114 | { |
| 115 | char **scream_olds; /* match pos */ |
| 116 | I32 *scream_pos; /* Internal iterator of scream. */ |
| 117 | } re_scream_pos_data; |
| 118 | |
| 119 | /* regexp_engine structure. This is the dispatch table for regexes. |
| 120 | * Any regex engine implementation must be able to build one of these. |
| 121 | */ |
| 122 | typedef struct regexp_engine { |
| 123 | REGEXP* (*comp) (pTHX_ SV * const pattern, U32 flags); |
| 124 | I32 (*exec) (pTHX_ REGEXP * const rx, char* stringarg, char* strend, |
| 125 | char* strbeg, I32 minend, SV* screamer, |
| 126 | void* data, U32 flags); |
| 127 | char* (*intuit) (pTHX_ REGEXP * const rx, SV *sv, char *strpos, |
| 128 | char *strend, const U32 flags, |
| 129 | re_scream_pos_data *data); |
| 130 | SV* (*checkstr) (pTHX_ REGEXP * const rx); |
| 131 | void (*free) (pTHX_ REGEXP * const rx); |
| 132 | void (*numbered_buff_FETCH) (pTHX_ REGEXP * const rx, const I32 paren, |
| 133 | SV * const sv); |
| 134 | void (*numbered_buff_STORE) (pTHX_ REGEXP * const rx, const I32 paren, |
| 135 | SV const * const value); |
| 136 | I32 (*numbered_buff_LENGTH) (pTHX_ REGEXP * const rx, const SV * const sv, |
| 137 | const I32 paren); |
| 138 | SV* (*named_buff) (pTHX_ REGEXP * const rx, SV * const key, |
| 139 | SV * const value, const U32 flags); |
| 140 | SV* (*named_buff_iter) (pTHX_ REGEXP * const rx, const SV * const lastkey, |
| 141 | const U32 flags); |
| 142 | SV* (*qr_package)(pTHX_ REGEXP * const rx); |
| 143 | #ifdef USE_ITHREADS |
| 144 | void* (*dupe) (pTHX_ REGEXP * const rx, CLONE_PARAMS *param); |
| 145 | #endif |
| 146 | } regexp_engine; |
| 147 | |
| 148 | /* |
| 149 | These are passed to the numbered capture variable callbacks as the |
| 150 | paren name. >= 1 is reserved for actual numbered captures, i.e. $1, |
| 151 | $2 etc. |
| 152 | */ |
| 153 | #define RX_BUFF_IDX_PREMATCH -2 /* $` / ${^PREMATCH} */ |
| 154 | #define RX_BUFF_IDX_POSTMATCH -1 /* $' / ${^POSTMATCH} */ |
| 155 | #define RX_BUFF_IDX_FULLMATCH 0 /* $& / ${^MATCH} */ |
| 156 | |
| 157 | /* |
| 158 | Flags that are passed to the named_buff and named_buff_iter |
| 159 | callbacks above. Those routines are called from universal.c via the |
| 160 | Tie::Hash::NamedCapture interface for %+ and %- and the re:: |
| 161 | functions in the same file. |
| 162 | */ |
| 163 | |
| 164 | /* The Tie::Hash::NamedCapture operation this is part of, if any */ |
| 165 | #define RXapif_FETCH 0x0001 |
| 166 | #define RXapif_STORE 0x0002 |
| 167 | #define RXapif_DELETE 0x0004 |
| 168 | #define RXapif_CLEAR 0x0008 |
| 169 | #define RXapif_EXISTS 0x0010 |
| 170 | #define RXapif_SCALAR 0x0020 |
| 171 | #define RXapif_FIRSTKEY 0x0040 |
| 172 | #define RXapif_NEXTKEY 0x0080 |
| 173 | |
| 174 | /* Whether %+ or %- is being operated on */ |
| 175 | #define RXapif_ONE 0x0100 /* %+ */ |
| 176 | #define RXapif_ALL 0x0200 /* %- */ |
| 177 | |
| 178 | /* Whether this is being called from a re:: function */ |
| 179 | #define RXapif_REGNAME 0x0400 |
| 180 | #define RXapif_REGNAMES 0x0800 |
| 181 | #define RXapif_REGNAMES_COUNT 0x1000 |
| 182 | |
| 183 | /* |
| 184 | =head1 REGEXP Functions |
| 185 | |
| 186 | =for apidoc Am|REGEXP *|SvRX|SV *sv |
| 187 | |
| 188 | Convenience macro to get the REGEXP from a SV. This is approximately |
| 189 | equivalent to the following snippet: |
| 190 | |
| 191 | if (SvMAGICAL(sv)) |
| 192 | mg_get(sv); |
| 193 | if (SvROK(sv) && |
| 194 | (tmpsv = (SV*)SvRV(sv)) && |
| 195 | SvTYPE(tmpsv) == SVt_PVMG && |
| 196 | (tmpmg = mg_find(tmpsv, PERL_MAGIC_qr))) |
| 197 | { |
| 198 | return (REGEXP *)tmpmg->mg_obj; |
| 199 | } |
| 200 | |
| 201 | NULL will be returned if a REGEXP* is not found. |
| 202 | |
| 203 | =for apidoc Am|bool|SvRXOK|SV* sv |
| 204 | |
| 205 | Returns a boolean indicating whether the SV contains qr magic |
| 206 | (PERL_MAGIC_qr). |
| 207 | |
| 208 | If you want to do something with the REGEXP* later use SvRX instead |
| 209 | and check for NULL. |
| 210 | |
| 211 | =cut |
| 212 | */ |
| 213 | |
| 214 | #define SvRX(sv) (Perl_get_re_arg(aTHX_ sv)) |
| 215 | #define SvRXOK(sv) (Perl_get_re_arg(aTHX_ sv) ? TRUE : FALSE) |
| 216 | |
| 217 | |
| 218 | /* Flags stored in regexp->extflags |
| 219 | * These are used by code external to the regexp engine |
| 220 | * |
| 221 | * Note that flags starting with RXf_PMf_ have exact equivalents |
| 222 | * stored in op_pmflags and which are defined in op.h, they are defined |
| 223 | * numerically here only for clarity. |
| 224 | * |
| 225 | * NOTE: if you modify any RXf flags you should run regen.pl or regcomp.pl |
| 226 | * so that regnodes.h is updated with the changes. |
| 227 | * |
| 228 | */ |
| 229 | |
| 230 | /* 0x3F of extflags is used by (RXf_)PMf_COMPILETIME |
| 231 | * If you change these you need to change the equivalent flags in op.h, and |
| 232 | * vice versa. */ |
| 233 | #define RXf_PMf_MULTILINE 0x00000001 /* /m */ |
| 234 | #define RXf_PMf_SINGLELINE 0x00000002 /* /s */ |
| 235 | #define RXf_PMf_FOLD 0x00000004 /* /i */ |
| 236 | #define RXf_PMf_EXTENDED 0x00000008 /* /x */ |
| 237 | #define RXf_PMf_KEEPCOPY 0x00000010 /* /p */ |
| 238 | #define RXf_PMf_LOCALE 0x00000020 /* use locale */ |
| 239 | /* these flags are transfered from the PMOP->op_pmflags member during compilation */ |
| 240 | #define RXf_PMf_STD_PMMOD_SHIFT 0 |
| 241 | #define RXf_PMf_STD_PMMOD (RXf_PMf_MULTILINE|RXf_PMf_SINGLELINE|RXf_PMf_FOLD|RXf_PMf_EXTENDED) |
| 242 | #define RXf_PMf_COMPILETIME (RXf_PMf_MULTILINE|RXf_PMf_SINGLELINE|RXf_PMf_LOCALE|RXf_PMf_FOLD|RXf_PMf_EXTENDED|RXf_PMf_KEEPCOPY) |
| 243 | |
| 244 | #define CASE_STD_PMMOD_FLAGS_PARSE_SET(pmfl) \ |
| 245 | case IGNORE_PAT_MOD: *(pmfl) |= RXf_PMf_FOLD; break; \ |
| 246 | case MULTILINE_PAT_MOD: *(pmfl) |= RXf_PMf_MULTILINE; break; \ |
| 247 | case SINGLE_PAT_MOD: *(pmfl) |= RXf_PMf_SINGLELINE; break; \ |
| 248 | case XTENDED_PAT_MOD: *(pmfl) |= RXf_PMf_EXTENDED; break |
| 249 | |
| 250 | /* chars and strings used as regex pattern modifiers |
| 251 | * Singlular is a 'c'har, plural is a "string" |
| 252 | * |
| 253 | * NOTE, KEEPCOPY was originally 'k', but was changed to 'p' for preserve |
| 254 | * for compatibility reasons with Regexp::Common which highjacked (?k:...) |
| 255 | * for its own uses. So 'k' is out as well. |
| 256 | */ |
| 257 | #define EXEC_PAT_MOD 'e' |
| 258 | #define KEEPCOPY_PAT_MOD 'p' |
| 259 | #define ONCE_PAT_MOD 'o' |
| 260 | #define GLOBAL_PAT_MOD 'g' |
| 261 | #define CONTINUE_PAT_MOD 'c' |
| 262 | #define MULTILINE_PAT_MOD 'm' |
| 263 | #define SINGLE_PAT_MOD 's' |
| 264 | #define IGNORE_PAT_MOD 'i' |
| 265 | #define XTENDED_PAT_MOD 'x' |
| 266 | #define NONDESTRUCT_PAT_MOD 'r' |
| 267 | |
| 268 | #define ONCE_PAT_MODS "o" |
| 269 | #define KEEPCOPY_PAT_MODS "p" |
| 270 | #define EXEC_PAT_MODS "e" |
| 271 | #define LOOP_PAT_MODS "gc" |
| 272 | #define NONDESTRUCT_PAT_MODS "r" |
| 273 | |
| 274 | #define STD_PAT_MODS "msix" |
| 275 | |
| 276 | #define INT_PAT_MODS STD_PAT_MODS KEEPCOPY_PAT_MODS |
| 277 | |
| 278 | #define EXT_PAT_MODS ONCE_PAT_MODS KEEPCOPY_PAT_MODS |
| 279 | #define QR_PAT_MODS STD_PAT_MODS EXT_PAT_MODS |
| 280 | #define M_PAT_MODS QR_PAT_MODS LOOP_PAT_MODS |
| 281 | #define S_PAT_MODS M_PAT_MODS EXEC_PAT_MODS NONDESTRUCT_PAT_MODS |
| 282 | |
| 283 | /* |
| 284 | * NOTE: if you modify any RXf flags you should run regen.pl or regcomp.pl |
| 285 | * so that regnodes.h is updated with the changes. |
| 286 | * |
| 287 | */ |
| 288 | |
| 289 | /* Anchor and GPOS related stuff */ |
| 290 | #define RXf_ANCH_BOL 0x00000100 |
| 291 | #define RXf_ANCH_MBOL 0x00000200 |
| 292 | #define RXf_ANCH_SBOL 0x00000400 |
| 293 | #define RXf_ANCH_GPOS 0x00000800 |
| 294 | #define RXf_GPOS_SEEN 0x00001000 |
| 295 | #define RXf_GPOS_FLOAT 0x00002000 |
| 296 | /* two bits here */ |
| 297 | #define RXf_ANCH (RXf_ANCH_BOL|RXf_ANCH_MBOL|RXf_ANCH_GPOS|RXf_ANCH_SBOL) |
| 298 | #define RXf_GPOS_CHECK (RXf_GPOS_SEEN|RXf_ANCH_GPOS) |
| 299 | #define RXf_ANCH_SINGLE (RXf_ANCH_SBOL|RXf_ANCH_GPOS) |
| 300 | |
| 301 | /* What we have seen */ |
| 302 | #define RXf_LOOKBEHIND_SEEN 0x00004000 |
| 303 | #define RXf_EVAL_SEEN 0x00008000 |
| 304 | #define RXf_CANY_SEEN 0x00010000 |
| 305 | |
| 306 | /* Special */ |
| 307 | #define RXf_NOSCAN 0x00020000 |
| 308 | #define RXf_CHECK_ALL 0x00040000 |
| 309 | |
| 310 | /* UTF8 related */ |
| 311 | #define RXf_MATCH_UTF8 0x00100000 |
| 312 | |
| 313 | /* Intuit related */ |
| 314 | #define RXf_USE_INTUIT_NOML 0x00200000 |
| 315 | #define RXf_USE_INTUIT_ML 0x00400000 |
| 316 | #define RXf_INTUIT_TAIL 0x00800000 |
| 317 | |
| 318 | /* |
| 319 | Set in Perl_pmruntime if op_flags & OPf_SPECIAL, i.e. split. Will |
| 320 | be used by regex engines to check whether they should set |
| 321 | RXf_SKIPWHITE |
| 322 | */ |
| 323 | #define RXf_SPLIT 0x01000000 |
| 324 | |
| 325 | #define RXf_USE_INTUIT (RXf_USE_INTUIT_NOML|RXf_USE_INTUIT_ML) |
| 326 | |
| 327 | /* Copy and tainted info */ |
| 328 | #define RXf_COPY_DONE 0x02000000 |
| 329 | #define RXf_TAINTED_SEEN 0x04000000 |
| 330 | #define RXf_TAINTED 0x08000000 /* this pattern is tainted */ |
| 331 | |
| 332 | /* Flags indicating special patterns */ |
| 333 | #define RXf_START_ONLY 0x10000000 /* Pattern is /^/ */ |
| 334 | #define RXf_SKIPWHITE 0x20000000 /* Pattern is for a split / / */ |
| 335 | #define RXf_WHITE 0x40000000 /* Pattern is /\s+/ */ |
| 336 | #define RXf_NULL 0x80000000 /* Pattern is // */ |
| 337 | |
| 338 | /* |
| 339 | * NOTE: if you modify any RXf flags you should run regen.pl or regcomp.pl |
| 340 | * so that regnodes.h is updated with the changes. |
| 341 | * |
| 342 | */ |
| 343 | |
| 344 | #define RX_HAS_CUTGROUP(prog) ((prog)->intflags & PREGf_CUTGROUP_SEEN) |
| 345 | #define RXp_MATCH_TAINTED(prog) (RXp_EXTFLAGS(prog) & RXf_TAINTED_SEEN) |
| 346 | #define RX_MATCH_TAINTED(prog) (RX_EXTFLAGS(prog) & RXf_TAINTED_SEEN) |
| 347 | #define RX_MATCH_TAINTED_on(prog) (RX_EXTFLAGS(prog) |= RXf_TAINTED_SEEN) |
| 348 | #define RX_MATCH_TAINTED_off(prog) (RX_EXTFLAGS(prog) &= ~RXf_TAINTED_SEEN) |
| 349 | #define RX_MATCH_TAINTED_set(prog, t) ((t) \ |
| 350 | ? RX_MATCH_TAINTED_on(prog) \ |
| 351 | : RX_MATCH_TAINTED_off(prog)) |
| 352 | |
| 353 | #define RXp_MATCH_COPIED(prog) (RXp_EXTFLAGS(prog) & RXf_COPY_DONE) |
| 354 | #define RX_MATCH_COPIED(prog) (RX_EXTFLAGS(prog) & RXf_COPY_DONE) |
| 355 | #define RXp_MATCH_COPIED_on(prog) (RXp_EXTFLAGS(prog) |= RXf_COPY_DONE) |
| 356 | #define RX_MATCH_COPIED_on(prog) (RX_EXTFLAGS(prog) |= RXf_COPY_DONE) |
| 357 | #define RXp_MATCH_COPIED_off(prog) (RXp_EXTFLAGS(prog) &= ~RXf_COPY_DONE) |
| 358 | #define RX_MATCH_COPIED_off(prog) (RX_EXTFLAGS(prog) &= ~RXf_COPY_DONE) |
| 359 | #define RX_MATCH_COPIED_set(prog,t) ((t) \ |
| 360 | ? RX_MATCH_COPIED_on(prog) \ |
| 361 | : RX_MATCH_COPIED_off(prog)) |
| 362 | |
| 363 | #define RXp_EXTFLAGS(rx) ((rx)->extflags) |
| 364 | |
| 365 | /* For source compatibility. We used to store these explicitly. */ |
| 366 | #define RX_PRECOMP(prog) (RX_WRAPPED(prog) + ((struct regexp *)SvANY(prog))->pre_prefix) |
| 367 | #define RX_PRECOMP_const(prog) (RX_WRAPPED_const(prog) + ((struct regexp *)SvANY(prog))->pre_prefix) |
| 368 | /* FIXME? Are we hardcoding too much here and constraining plugin extension |
| 369 | writers? Specifically, the value 1 assumes that the wrapped version always |
| 370 | has exactly one character at the end, a ')'. Will that always be true? */ |
| 371 | #define RX_PRELEN(prog) (RX_WRAPLEN(prog) - ((struct regexp *)SvANY(prog))->pre_prefix - 1) |
| 372 | #define RX_WRAPPED(prog) SvPVX(prog) |
| 373 | #define RX_WRAPPED_const(prog) SvPVX_const(prog) |
| 374 | #define RX_WRAPLEN(prog) SvCUR(prog) |
| 375 | #define RX_CHECK_SUBSTR(prog) (((struct regexp *)SvANY(prog))->check_substr) |
| 376 | #define RX_REFCNT(prog) SvREFCNT(prog) |
| 377 | #if defined(__GNUC__) && !defined(PERL_GCC_BRACE_GROUPS_FORBIDDEN) |
| 378 | # define RX_EXTFLAGS(prog) \ |
| 379 | (*({ \ |
| 380 | const REGEXP *const _rx_extflags = (prog); \ |
| 381 | assert(SvTYPE(_rx_extflags) == SVt_REGEXP); \ |
| 382 | &RXp_EXTFLAGS(SvANY(_rx_extflags)); \ |
| 383 | })) |
| 384 | # define RX_ENGINE(prog) \ |
| 385 | (*({ \ |
| 386 | const REGEXP *const _rx_engine = (prog); \ |
| 387 | assert(SvTYPE(_rx_engine) == SVt_REGEXP); \ |
| 388 | &SvANY(_rx_engine)->engine; \ |
| 389 | })) |
| 390 | # define RX_SUBBEG(prog) \ |
| 391 | (*({ \ |
| 392 | const REGEXP *const _rx_subbeg = (prog); \ |
| 393 | assert(SvTYPE(_rx_subbeg) == SVt_REGEXP); \ |
| 394 | &SvANY(_rx_subbeg)->subbeg; \ |
| 395 | })) |
| 396 | # define RX_OFFS(prog) \ |
| 397 | (*({ \ |
| 398 | const REGEXP *const _rx_offs = (prog); \ |
| 399 | assert(SvTYPE(_rx_offs) == SVt_REGEXP); \ |
| 400 | &SvANY(_rx_offs)->offs; \ |
| 401 | })) |
| 402 | # define RX_NPARENS(prog) \ |
| 403 | (*({ \ |
| 404 | const REGEXP *const _rx_nparens = (prog); \ |
| 405 | assert(SvTYPE(_rx_nparens) == SVt_REGEXP); \ |
| 406 | &SvANY(_rx_nparens)->nparens; \ |
| 407 | })) |
| 408 | #else |
| 409 | # define RX_EXTFLAGS(prog) RXp_EXTFLAGS((struct regexp *)SvANY(prog)) |
| 410 | # define RX_ENGINE(prog) (((struct regexp *)SvANY(prog))->engine) |
| 411 | # define RX_SUBBEG(prog) (((struct regexp *)SvANY(prog))->subbeg) |
| 412 | # define RX_OFFS(prog) (((struct regexp *)SvANY(prog))->offs) |
| 413 | # define RX_NPARENS(prog) (((struct regexp *)SvANY(prog))->nparens) |
| 414 | #endif |
| 415 | #define RX_SUBLEN(prog) (((struct regexp *)SvANY(prog))->sublen) |
| 416 | #define RX_MINLEN(prog) (((struct regexp *)SvANY(prog))->minlen) |
| 417 | #define RX_MINLENRET(prog) (((struct regexp *)SvANY(prog))->minlenret) |
| 418 | #define RX_GOFS(prog) (((struct regexp *)SvANY(prog))->gofs) |
| 419 | #define RX_LASTPAREN(prog) (((struct regexp *)SvANY(prog))->lastparen) |
| 420 | #define RX_LASTCLOSEPAREN(prog) (((struct regexp *)SvANY(prog))->lastcloseparen) |
| 421 | #define RX_SEEN_EVALS(prog) (((struct regexp *)SvANY(prog))->seen_evals) |
| 422 | #define RX_SAVED_COPY(prog) (((struct regexp *)SvANY(prog))->saved_copy) |
| 423 | |
| 424 | #endif /* PLUGGABLE_RE_EXTENSION */ |
| 425 | |
| 426 | /* Stuff that needs to be included in the plugable extension goes below here */ |
| 427 | |
| 428 | #ifdef PERL_OLD_COPY_ON_WRITE |
| 429 | #define RX_MATCH_COPY_FREE(rx) \ |
| 430 | STMT_START {if (RX_SAVED_COPY(rx)) { \ |
| 431 | SV_CHECK_THINKFIRST_COW_DROP(RX_SAVED_COPY(rx)); \ |
| 432 | } \ |
| 433 | if (RX_MATCH_COPIED(rx)) { \ |
| 434 | Safefree(RX_SUBBEG(rx)); \ |
| 435 | RX_MATCH_COPIED_off(rx); \ |
| 436 | }} STMT_END |
| 437 | #else |
| 438 | #define RX_MATCH_COPY_FREE(rx) \ |
| 439 | STMT_START {if (RX_MATCH_COPIED(rx)) { \ |
| 440 | Safefree(RX_SUBBEG(rx)); \ |
| 441 | RX_MATCH_COPIED_off(rx); \ |
| 442 | }} STMT_END |
| 443 | #endif |
| 444 | |
| 445 | #define RXp_MATCH_UTF8(prog) (RXp_EXTFLAGS(prog) & RXf_MATCH_UTF8) |
| 446 | #define RX_MATCH_UTF8(prog) (RX_EXTFLAGS(prog) & RXf_MATCH_UTF8) |
| 447 | #define RX_MATCH_UTF8_on(prog) (RX_EXTFLAGS(prog) |= RXf_MATCH_UTF8) |
| 448 | #define RX_MATCH_UTF8_off(prog) (RX_EXTFLAGS(prog) &= ~RXf_MATCH_UTF8) |
| 449 | #define RX_MATCH_UTF8_set(prog, t) ((t) \ |
| 450 | ? (RX_MATCH_UTF8_on(prog), (PL_reg_match_utf8 = 1)) \ |
| 451 | : (RX_MATCH_UTF8_off(prog), (PL_reg_match_utf8 = 0))) |
| 452 | |
| 453 | /* Whether the pattern stored at RX_WRAPPED is in UTF-8 */ |
| 454 | #define RX_UTF8(prog) SvUTF8(prog) |
| 455 | |
| 456 | #define REXEC_COPY_STR 0x01 /* Need to copy the string. */ |
| 457 | #define REXEC_CHECKED 0x02 /* check_substr already checked. */ |
| 458 | #define REXEC_SCREAM 0x04 /* use scream table. */ |
| 459 | #define REXEC_IGNOREPOS 0x08 /* \G matches at start. */ |
| 460 | #define REXEC_NOT_FIRST 0x10 /* This is another iteration of //g. */ |
| 461 | |
| 462 | #if defined(__GNUC__) && !defined(PERL_GCC_BRACE_GROUPS_FORBIDDEN) |
| 463 | # define ReREFCNT_inc(re) \ |
| 464 | ({ \ |
| 465 | /* This is here to generate a casting warning if incorrect. */ \ |
| 466 | REGEXP *const _rerefcnt_inc = (re); \ |
| 467 | assert(SvTYPE(_rerefcnt_inc) == SVt_REGEXP); \ |
| 468 | SvREFCNT_inc(_rerefcnt_inc); \ |
| 469 | _rerefcnt_inc; \ |
| 470 | }) |
| 471 | # define ReREFCNT_dec(re) \ |
| 472 | ({ \ |
| 473 | /* This is here to generate a casting warning if incorrect. */ \ |
| 474 | REGEXP *const _rerefcnt_dec = (re); \ |
| 475 | SvREFCNT_dec(_rerefcnt_dec); \ |
| 476 | }) |
| 477 | #else |
| 478 | # define ReREFCNT_dec(re) SvREFCNT_dec(re) |
| 479 | # define ReREFCNT_inc(re) ((REGEXP *) SvREFCNT_inc(re)) |
| 480 | #endif |
| 481 | |
| 482 | /* FIXME for plugins. */ |
| 483 | |
| 484 | #define FBMcf_TAIL_DOLLAR 1 |
| 485 | #define FBMcf_TAIL_DOLLARM 2 |
| 486 | #define FBMcf_TAIL_Z 4 |
| 487 | #define FBMcf_TAIL_z 8 |
| 488 | #define FBMcf_TAIL (FBMcf_TAIL_DOLLAR|FBMcf_TAIL_DOLLARM|FBMcf_TAIL_Z|FBMcf_TAIL_z) |
| 489 | |
| 490 | #define FBMrf_MULTILINE 1 |
| 491 | |
| 492 | /* some basic information about the current match that is created by |
| 493 | * Perl_regexec_flags and then passed to regtry(), regmatch() etc */ |
| 494 | |
| 495 | typedef struct { |
| 496 | REGEXP *prog; |
| 497 | char *bol; |
| 498 | char *till; |
| 499 | SV *sv; |
| 500 | char *ganch; |
| 501 | char *cutpoint; |
| 502 | } regmatch_info; |
| 503 | |
| 504 | |
| 505 | /* structures for holding and saving the state maintained by regmatch() */ |
| 506 | |
| 507 | #ifndef MAX_RECURSE_EVAL_NOCHANGE_DEPTH |
| 508 | #define MAX_RECURSE_EVAL_NOCHANGE_DEPTH 1000 |
| 509 | #endif |
| 510 | |
| 511 | typedef I32 CHECKPOINT; |
| 512 | |
| 513 | typedef struct regmatch_state { |
| 514 | int resume_state; /* where to jump to on return */ |
| 515 | char *locinput; /* where to backtrack in string on failure */ |
| 516 | |
| 517 | union { |
| 518 | |
| 519 | /* this is a fake union member that matches the first element |
| 520 | * of each member that needs to store positive backtrack |
| 521 | * information */ |
| 522 | struct { |
| 523 | struct regmatch_state *prev_yes_state; |
| 524 | } yes; |
| 525 | |
| 526 | /* branchlike members */ |
| 527 | /* this is a fake union member that matches the first elements |
| 528 | * of each member that needs to behave like a branch */ |
| 529 | struct { |
| 530 | /* this first element must match u.yes */ |
| 531 | struct regmatch_state *prev_yes_state; |
| 532 | U32 lastparen; |
| 533 | CHECKPOINT cp; |
| 534 | |
| 535 | } branchlike; |
| 536 | |
| 537 | struct { |
| 538 | /* the first elements must match u.branchlike */ |
| 539 | struct regmatch_state *prev_yes_state; |
| 540 | U32 lastparen; |
| 541 | CHECKPOINT cp; |
| 542 | |
| 543 | regnode *next_branch; /* next branch node */ |
| 544 | } branch; |
| 545 | |
| 546 | struct { |
| 547 | /* the first elements must match u.branchlike */ |
| 548 | struct regmatch_state *prev_yes_state; |
| 549 | U32 lastparen; |
| 550 | CHECKPOINT cp; |
| 551 | |
| 552 | U32 accepted; /* how many accepting states left */ |
| 553 | U16 *jump; /* positive offsets from me */ |
| 554 | regnode *B; /* node following the trie */ |
| 555 | regnode *me; /* Which node am I - needed for jump tries*/ |
| 556 | U8 *firstpos;/* pos in string of first trie match */ |
| 557 | U32 firstchars;/* len in chars of firstpos from start */ |
| 558 | U16 nextword;/* next word to try */ |
| 559 | U16 topword; /* longest accepted word */ |
| 560 | bool longfold;/* saw a fold with a 1->n char mapping */ |
| 561 | } trie; |
| 562 | |
| 563 | /* special types - these members are used to store state for special |
| 564 | regops like eval, if/then, lookaround and the markpoint state */ |
| 565 | struct { |
| 566 | /* this first element must match u.yes */ |
| 567 | struct regmatch_state *prev_yes_state; |
| 568 | struct regmatch_state *prev_eval; |
| 569 | struct regmatch_state *prev_curlyx; |
| 570 | REGEXP *prev_rex; |
| 571 | U32 toggle_reg_flags; /* what bits in PL_reg_flags to |
| 572 | flip when transitioning between |
| 573 | inner and outer rexen */ |
| 574 | CHECKPOINT cp; /* remember current savestack indexes */ |
| 575 | CHECKPOINT lastcp; |
| 576 | U32 close_paren; /* which close bracket is our end */ |
| 577 | regnode *B; /* the node following us */ |
| 578 | } eval; |
| 579 | |
| 580 | struct { |
| 581 | /* this first element must match u.yes */ |
| 582 | struct regmatch_state *prev_yes_state; |
| 583 | I32 wanted; |
| 584 | I32 logical; /* saved copy of 'logical' var */ |
| 585 | regnode *me; /* the IFMATCH/SUSPEND/UNLESSM node */ |
| 586 | } ifmatch; /* and SUSPEND/UNLESSM */ |
| 587 | |
| 588 | struct { |
| 589 | /* this first element must match u.yes */ |
| 590 | struct regmatch_state *prev_yes_state; |
| 591 | struct regmatch_state *prev_mark; |
| 592 | SV* mark_name; |
| 593 | char *mark_loc; |
| 594 | } mark; |
| 595 | |
| 596 | struct { |
| 597 | int val; |
| 598 | } keeper; |
| 599 | |
| 600 | /* quantifiers - these members are used for storing state for |
| 601 | for the regops used to implement quantifiers */ |
| 602 | struct { |
| 603 | /* this first element must match u.yes */ |
| 604 | struct regmatch_state *prev_yes_state; |
| 605 | struct regmatch_state *prev_curlyx; /* previous cur_curlyx */ |
| 606 | regnode *me; /* the CURLYX node */ |
| 607 | regnode *B; /* the B node in /A*B/ */ |
| 608 | CHECKPOINT cp; /* remember current savestack index */ |
| 609 | bool minmod; |
| 610 | int parenfloor;/* how far back to strip paren data */ |
| 611 | |
| 612 | /* these two are modified by WHILEM */ |
| 613 | int count; /* how many instances of A we've matched */ |
| 614 | char *lastloc;/* where previous A matched (0-len detect) */ |
| 615 | } curlyx; |
| 616 | |
| 617 | struct { |
| 618 | /* this first element must match u.yes */ |
| 619 | struct regmatch_state *prev_yes_state; |
| 620 | struct regmatch_state *save_curlyx; |
| 621 | CHECKPOINT cp; /* remember current savestack indexes */ |
| 622 | CHECKPOINT lastcp; |
| 623 | char *save_lastloc; /* previous curlyx.lastloc */ |
| 624 | I32 cache_offset; |
| 625 | I32 cache_mask; |
| 626 | } whilem; |
| 627 | |
| 628 | struct { |
| 629 | /* this first element must match u.yes */ |
| 630 | struct regmatch_state *prev_yes_state; |
| 631 | I32 c1, c2; /* case fold search */ |
| 632 | CHECKPOINT cp; |
| 633 | I32 alen; /* length of first-matched A string */ |
| 634 | I32 count; |
| 635 | bool minmod; |
| 636 | regnode *A, *B; /* the nodes corresponding to /A*B/ */ |
| 637 | regnode *me; /* the curlym node */ |
| 638 | } curlym; |
| 639 | |
| 640 | struct { |
| 641 | U32 paren; |
| 642 | CHECKPOINT cp; |
| 643 | I32 c1, c2; /* case fold search */ |
| 644 | char *maxpos; /* highest possible point in string to match */ |
| 645 | char *oldloc; /* the previous locinput */ |
| 646 | int count; |
| 647 | int min, max; /* {m,n} */ |
| 648 | regnode *A, *B; /* the nodes corresponding to /A*B/ */ |
| 649 | } curly; /* and CURLYN/PLUS/STAR */ |
| 650 | |
| 651 | } u; |
| 652 | } regmatch_state; |
| 653 | |
| 654 | /* how many regmatch_state structs to allocate as a single slab. |
| 655 | * We do it in 4K blocks for efficiency. The "3" is 2 for the next/prev |
| 656 | * pointers, plus 1 for any mythical malloc overhead. */ |
| 657 | |
| 658 | #define PERL_REGMATCH_SLAB_SLOTS \ |
| 659 | ((4096 - 3 * sizeof (void*)) / sizeof(regmatch_state)) |
| 660 | |
| 661 | typedef struct regmatch_slab { |
| 662 | regmatch_state states[PERL_REGMATCH_SLAB_SLOTS]; |
| 663 | struct regmatch_slab *prev, *next; |
| 664 | } regmatch_slab; |
| 665 | |
| 666 | #define PL_reg_flags PL_reg_state.re_state_reg_flags |
| 667 | #define PL_bostr PL_reg_state.re_state_bostr |
| 668 | #define PL_reginput PL_reg_state.re_state_reginput |
| 669 | #define PL_regeol PL_reg_state.re_state_regeol |
| 670 | #define PL_regoffs PL_reg_state.re_state_regoffs |
| 671 | #define PL_reglastparen PL_reg_state.re_state_reglastparen |
| 672 | #define PL_reglastcloseparen PL_reg_state.re_state_reglastcloseparen |
| 673 | #define PL_reg_start_tmp PL_reg_state.re_state_reg_start_tmp |
| 674 | #define PL_reg_start_tmpl PL_reg_state.re_state_reg_start_tmpl |
| 675 | #define PL_reg_eval_set PL_reg_state.re_state_reg_eval_set |
| 676 | #define PL_reg_match_utf8 PL_reg_state.re_state_reg_match_utf8 |
| 677 | #define PL_reg_magic PL_reg_state.re_state_reg_magic |
| 678 | #define PL_reg_oldpos PL_reg_state.re_state_reg_oldpos |
| 679 | #define PL_reg_oldcurpm PL_reg_state.re_state_reg_oldcurpm |
| 680 | #define PL_reg_curpm PL_reg_state.re_state_reg_curpm |
| 681 | #define PL_reg_oldsaved PL_reg_state.re_state_reg_oldsaved |
| 682 | #define PL_reg_oldsavedlen PL_reg_state.re_state_reg_oldsavedlen |
| 683 | #define PL_reg_maxiter PL_reg_state.re_state_reg_maxiter |
| 684 | #define PL_reg_leftiter PL_reg_state.re_state_reg_leftiter |
| 685 | #define PL_reg_poscache PL_reg_state.re_state_reg_poscache |
| 686 | #define PL_reg_poscache_size PL_reg_state.re_state_reg_poscache_size |
| 687 | #define PL_regsize PL_reg_state.re_state_regsize |
| 688 | #define PL_reg_starttry PL_reg_state.re_state_reg_starttry |
| 689 | #define PL_nrs PL_reg_state.re_state_nrs |
| 690 | |
| 691 | struct re_save_state { |
| 692 | U32 re_state_reg_flags; /* from regexec.c */ |
| 693 | U32 re_state_reg_start_tmpl; /* from regexec.c */ |
| 694 | I32 re_state_reg_eval_set; /* from regexec.c */ |
| 695 | bool re_state_reg_match_utf8; /* from regexec.c */ |
| 696 | char *re_state_bostr; |
| 697 | char *re_state_reginput; /* String-input pointer. */ |
| 698 | char *re_state_regeol; /* End of input, for $ check. */ |
| 699 | regexp_paren_pair *re_state_regoffs; /* Pointer to start/end pairs */ |
| 700 | U32 *re_state_reglastparen; /* Similarly for lastparen. */ |
| 701 | U32 *re_state_reglastcloseparen; /* Similarly for lastcloseparen. */ |
| 702 | char **re_state_reg_start_tmp; /* from regexec.c */ |
| 703 | MAGIC *re_state_reg_magic; /* from regexec.c */ |
| 704 | PMOP *re_state_reg_oldcurpm; /* from regexec.c */ |
| 705 | PMOP *re_state_reg_curpm; /* from regexec.c */ |
| 706 | char *re_state_reg_oldsaved; /* old saved substr during match */ |
| 707 | STRLEN re_state_reg_oldsavedlen; /* old length of saved substr during match */ |
| 708 | STRLEN re_state_reg_poscache_size; /* size of pos cache of WHILEM */ |
| 709 | I32 re_state_reg_oldpos; /* from regexec.c */ |
| 710 | I32 re_state_reg_maxiter; /* max wait until caching pos */ |
| 711 | I32 re_state_reg_leftiter; /* wait until caching pos */ |
| 712 | U32 re_state_regsize; /* from regexec.c */ |
| 713 | char *re_state_reg_poscache; /* cache of pos of WHILEM */ |
| 714 | char *re_state_reg_starttry; /* from regexec.c */ |
| 715 | #ifdef PERL_OLD_COPY_ON_WRITE |
| 716 | 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 */ |
| 717 | #endif |
| 718 | }; |
| 719 | |
| 720 | #define SAVESTACK_ALLOC_FOR_RE_SAVE_STATE \ |
| 721 | (1 + ((sizeof(struct re_save_state) - 1) / sizeof(*PL_savestack))) |
| 722 | |
| 723 | /* |
| 724 | * Local variables: |
| 725 | * c-indentation-style: bsd |
| 726 | * c-basic-offset: 4 |
| 727 | * indent-tabs-mode: t |
| 728 | * End: |
| 729 | * |
| 730 | * ex: set ts=8 sts=4 sw=4 noet: |
| 731 | */ |