/[pcre]/code/tags/pcre-4.0/internal.h
ViewVC logotype

Contents of /code/tags/pcre-4.0/internal.h

Parent Directory Parent Directory | Revision Log Revision Log


Revision 64 - (show annotations) (download)
Sat Feb 24 21:40:05 2007 UTC (7 years, 5 months ago) by nigel
File MIME type: text/plain
File size: 27936 byte(s)
Tag code/trunk as code/tags/pcre-4.0.

1 /*************************************************
2 * Perl-Compatible Regular Expressions *
3 *************************************************/
4
5
6 /* This is a library of functions to support regular expressions whose syntax
7 and semantics are as close as possible to those of the Perl 5 language. See
8 the file Tech.Notes for some information on the internals.
9
10 Written by: Philip Hazel <ph10@cam.ac.uk>
11
12 Copyright (c) 1997-2003 University of Cambridge
13
14 -----------------------------------------------------------------------------
15 Permission is granted to anyone to use this software for any purpose on any
16 computer system, and to redistribute it freely, subject to the following
17 restrictions:
18
19 1. This software is distributed in the hope that it will be useful,
20 but WITHOUT ANY WARRANTY; without even the implied warranty of
21 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
22
23 2. The origin of this software must not be misrepresented, either by
24 explicit claim or by omission.
25
26 3. Altered versions must be plainly marked as such, and must not be
27 misrepresented as being the original software.
28
29 4. If PCRE is embedded in any software that is released under the GNU
30 General Purpose Licence (GPL), then the terms of that licence shall
31 supersede any condition above with which it is incompatible.
32 -----------------------------------------------------------------------------
33 */
34
35 /* This header contains definitions that are shared between the different
36 modules, but which are not relevant to the outside. */
37
38 /* Get the definitions provided by running "configure" */
39
40 #include "config.h"
41
42 /* When compiling for use with the Virtual Pascal compiler, these functions
43 need to have their names changed. PCRE must be compiled with the -DVPCOMPAT
44 option on the command line. */
45
46 #ifdef VPCOMPAT
47 #define strncmp(s1,s2,m) _strncmp(s1,s2,m)
48 #define memcpy(d,s,n) _memcpy(d,s,n)
49 #define memmove(d,s,n) _memmove(d,s,n)
50 #define memset(s,c,n) _memset(s,c,n)
51 #else /* VPCOMPAT */
52
53 /* To cope with SunOS4 and other systems that lack memmove() but have bcopy(),
54 define a macro for memmove() if HAVE_MEMMOVE is false, provided that HAVE_BCOPY
55 is set. Otherwise, include an emulating function for those systems that have
56 neither (there some non-Unix environments where this is the case). This assumes
57 that all calls to memmove are moving strings upwards in store, which is the
58 case in PCRE. */
59
60 #if ! HAVE_MEMMOVE
61 #undef memmove /* some systems may have a macro */
62 #if HAVE_BCOPY
63 #define memmove(a, b, c) bcopy(b, a, c)
64 #else /* HAVE_BCOPY */
65 void *
66 pcre_memmove(unsigned char *dest, const unsigned char *src, size_t n)
67 {
68 int i;
69 dest += n;
70 src += n;
71 for (i = 0; i < n; ++i) *(--dest) = *(--src);
72 }
73 #define memmove(a, b, c) pcre_memmove(a, b, c)
74 #endif /* not HAVE_BCOPY */
75 #endif /* not HAVE_MEMMOVE */
76 #endif /* not VPCOMPAT */
77
78
79 /* PCRE keeps offsets in its compiled code as 2-byte quantities by default.
80 These are used, for example, to link from the start of a subpattern to its
81 alternatives and its end. The use of 2 bytes per offset limits the size of the
82 compiled regex to around 64K, which is big enough for almost everybody.
83 However, I received a request for an even bigger limit. For this reason, and
84 also to make the code easier to maintain, the storing and loading of offsets
85 from the byte string is now handled by the macros that are defined here.
86
87 The macros are controlled by the value of LINK_SIZE. This defaults to 2 in
88 the config.h file, but can be overridden by using -D on the command line. This
89 is automated on Unix systems via the "configure" command. */
90
91 #if LINK_SIZE == 2
92
93 #define PUT(a,n,d) \
94 (a[n] = (d) >> 8), \
95 (a[(n)+1] = (d) & 255)
96
97 #define GET(a,n) \
98 (((a)[n] << 8) | (a)[(n)+1])
99
100 #define MAX_PATTERN_SIZE (1 << 16)
101
102
103 #elif LINK_SIZE == 3
104
105 #define PUT(a,n,d) \
106 (a[n] = (d) >> 16), \
107 (a[(n)+1] = (d) >> 8), \
108 (a[(n)+2] = (d) & 255)
109
110 #define GET(a,n) \
111 (((a)[n] << 16) | ((a)[(n)+1] << 8) | (a)[(n)+2])
112
113 #define MAX_PATTERN_SIZE (1 << 24)
114
115
116 #elif LINK_SIZE == 4
117
118 #define PUT(a,n,d) \
119 (a[n] = (d) >> 24), \
120 (a[(n)+1] = (d) >> 16), \
121 (a[(n)+2] = (d) >> 8), \
122 (a[(n)+3] = (d) & 255)
123
124 #define GET(a,n) \
125 (((a)[n] << 24) | ((a)[(n)+1] << 16) | ((a)[(n)+2] << 8) | (a)[(n)+3])
126
127 #define MAX_PATTERN_SIZE (1 << 30) /* Keep it positive */
128
129
130 #else
131 #error LINK_SIZE must be either 2, 3, or 4
132 #endif
133
134
135 /* Convenience macro defined in terms of the others */
136
137 #define PUTINC(a,n,d) PUT(a,n,d), a += LINK_SIZE
138
139
140 /* PCRE uses some other 2-byte quantities that do not change when the size of
141 offsets changes. There are used for repeat counts and for other things such as
142 capturing parenthesis numbers in back references. */
143
144 #define PUT2(a,n,d) \
145 a[n] = (d) >> 8; \
146 a[(n)+1] = (d) & 255
147
148 #define GET2(a,n) \
149 (((a)[n] << 8) | (a)[(n)+1])
150
151 #define PUT2INC(a,n,d) PUT2(a,n,d), a += 2
152
153
154 /* Standard C headers plus the external interface definition */
155
156 #include <ctype.h>
157 #include <limits.h>
158 #include <stddef.h>
159 #include <stdio.h>
160 #include <stdlib.h>
161 #include <string.h>
162
163 #ifndef PCRE_SPY
164 #define PCRE_DEFINITION /* Win32 __declspec(export) trigger for .dll */
165 #endif
166
167 #include "pcre.h"
168
169 /* In case there is no definition of offsetof() provided - though any proper
170 Standard C system should have one. */
171
172 #ifndef offsetof
173 #define offsetof(p_type,field) ((size_t)&(((p_type *)0)->field))
174 #endif
175
176 /* These are the public options that can change during matching. */
177
178 #define PCRE_IMS (PCRE_CASELESS|PCRE_MULTILINE|PCRE_DOTALL)
179
180 /* Private options flags start at the most significant end of the four bytes,
181 but skip the top bit so we can use ints for convenience without getting tangled
182 with negative values. The public options defined in pcre.h start at the least
183 significant end. Make sure they don't overlap, though now that we have expanded
184 to four bytes there is plenty of space. */
185
186 #define PCRE_FIRSTSET 0x40000000 /* first_byte is set */
187 #define PCRE_REQCHSET 0x20000000 /* req_byte is set */
188 #define PCRE_STARTLINE 0x10000000 /* start after \n for multiline */
189 #define PCRE_ICHANGED 0x08000000 /* i option changes within regex */
190
191 /* Options for the "extra" block produced by pcre_study(). */
192
193 #define PCRE_STUDY_MAPPED 0x01 /* a map of starting chars exists */
194
195 /* Masks for identifying the public options which are permitted at compile
196 time, run time or study time, respectively. */
197
198 #define PUBLIC_OPTIONS \
199 (PCRE_CASELESS|PCRE_EXTENDED|PCRE_ANCHORED|PCRE_MULTILINE| \
200 PCRE_DOTALL|PCRE_DOLLAR_ENDONLY|PCRE_EXTRA|PCRE_UNGREEDY|PCRE_UTF8| \
201 PCRE_NO_AUTO_CAPTURE)
202
203 #define PUBLIC_EXEC_OPTIONS \
204 (PCRE_ANCHORED|PCRE_NOTBOL|PCRE_NOTEOL|PCRE_NOTEMPTY)
205
206 #define PUBLIC_STUDY_OPTIONS 0 /* None defined */
207
208 /* Magic number to provide a small check against being handed junk. */
209
210 #define MAGIC_NUMBER 0x50435245UL /* 'PCRE' */
211
212 /* Negative values for the firstchar and reqchar variables */
213
214 #define REQ_UNSET (-2)
215 #define REQ_NONE (-1)
216
217 /* Flags added to firstchar or reqchar */
218
219 #define REQ_CASELESS 0x0100 /* indicates caselessness */
220 #define REQ_EOL 0x0200 /* indicates reqchar followed by $ */
221
222 /* Miscellaneous definitions */
223
224 typedef int BOOL;
225
226 #define FALSE 0
227 #define TRUE 1
228
229 /* Escape items that are just an encoding of a particular data value. Note that
230 ESC_n is defined as yet another macro, which is set in config.h to either \n
231 (the default) or \r (which some people want). */
232
233 #ifndef ESC_e
234 #define ESC_e 27
235 #endif
236
237 #ifndef ESC_f
238 #define ESC_f '\f'
239 #endif
240
241 #ifndef ESC_n
242 #define ESC_n NEWLINE
243 #endif
244
245 #ifndef ESC_r
246 #define ESC_r '\r'
247 #endif
248
249 #ifndef ESC_t
250 #define ESC_t '\t'
251 #endif
252
253 /* These are escaped items that aren't just an encoding of a particular data
254 value such as \n. They must have non-zero values, as check_escape() returns
255 their negation. Also, they must appear in the same order as in the opcode
256 definitions below, up to ESC_z. There's a dummy for OP_ANY because it
257 corresponds to "." rather than an escape sequence. The final one must be
258 ESC_REF as subsequent values are used for \1, \2, \3, etc. There is are two
259 tests in the code for an escape greater than ESC_b and less than ESC_Z to
260 detect the types that may be repeated. These are the types that consume a
261 character. If any new escapes are put in between that don't consume a
262 character, that code will have to change. */
263
264 enum { ESC_A = 1, ESC_G, ESC_B, ESC_b, ESC_D, ESC_d, ESC_S, ESC_s, ESC_W,
265 ESC_w, ESC_dum1, ESC_C, ESC_Z, ESC_z, ESC_E, ESC_Q, ESC_REF };
266
267 /* Flag bits and data types for the extended class (OP_XCLASS) for classes that
268 contain UTF-8 characters with values greater than 255. */
269
270 #define XCL_NOT 0x01 /* Flag: this is a negative class */
271 #define XCL_MAP 0x02 /* Flag: a 32-byte map is present */
272
273 #define XCL_END 0 /* Marks end of individual items */
274 #define XCL_SINGLE 1 /* Single item (one multibyte char) follows */
275 #define XCL_RANGE 2 /* A range (two multibyte chars) follows */
276
277
278 /* Opcode table: OP_BRA must be last, as all values >= it are used for brackets
279 that extract substrings. Starting from 1 (i.e. after OP_END), the values up to
280 OP_EOD must correspond in order to the list of escapes immediately above.
281 Note that whenever this list is updated, the two macro definitions that follow
282 must also be updated to match. */
283
284 enum {
285 OP_END, /* 0 End of pattern */
286
287 /* Values corresponding to backslashed metacharacters */
288
289 OP_SOD, /* 1 Start of data: \A */
290 OP_SOM, /* 2 Start of match (subject + offset): \G */
291 OP_NOT_WORD_BOUNDARY, /* 3 \B */
292 OP_WORD_BOUNDARY, /* 4 \b */
293 OP_NOT_DIGIT, /* 5 \D */
294 OP_DIGIT, /* 6 \d */
295 OP_NOT_WHITESPACE, /* 7 \S */
296 OP_WHITESPACE, /* 8 \s */
297 OP_NOT_WORDCHAR, /* 9 \W */
298 OP_WORDCHAR, /* 10 \w */
299 OP_ANY, /* 11 Match any character */
300 OP_ANYBYTE, /* 12 Match any byte (\C); different to OP_ANY for UTF-8 */
301 OP_EODN, /* 13 End of data or \n at end of data: \Z. */
302 OP_EOD, /* 14 End of data: \z */
303
304 OP_OPT, /* 15 Set runtime options */
305 OP_CIRC, /* 16 Start of line - varies with multiline switch */
306 OP_DOLL, /* 17 End of line - varies with multiline switch */
307 OP_CHARS, /* 18 Match string of characters */
308 OP_NOT, /* 19 Match anything but the following char */
309
310 OP_STAR, /* 20 The maximizing and minimizing versions of */
311 OP_MINSTAR, /* 21 all these opcodes must come in pairs, with */
312 OP_PLUS, /* 22 the minimizing one second. */
313 OP_MINPLUS, /* 23 This first set applies to single characters */
314 OP_QUERY, /* 24 */
315 OP_MINQUERY, /* 25 */
316 OP_UPTO, /* 26 From 0 to n matches */
317 OP_MINUPTO, /* 27 */
318 OP_EXACT, /* 28 Exactly n matches */
319
320 OP_NOTSTAR, /* 29 The maximizing and minimizing versions of */
321 OP_NOTMINSTAR, /* 30 all these opcodes must come in pairs, with */
322 OP_NOTPLUS, /* 31 the minimizing one second. */
323 OP_NOTMINPLUS, /* 32 This set applies to "not" single characters */
324 OP_NOTQUERY, /* 33 */
325 OP_NOTMINQUERY, /* 34 */
326 OP_NOTUPTO, /* 35 From 0 to n matches */
327 OP_NOTMINUPTO, /* 36 */
328 OP_NOTEXACT, /* 37 Exactly n matches */
329
330 OP_TYPESTAR, /* 38 The maximizing and minimizing versions of */
331 OP_TYPEMINSTAR, /* 39 all these opcodes must come in pairs, with */
332 OP_TYPEPLUS, /* 40 the minimizing one second. These codes must */
333 OP_TYPEMINPLUS, /* 41 be in exactly the same order as those above. */
334 OP_TYPEQUERY, /* 42 This set applies to character types such as \d */
335 OP_TYPEMINQUERY, /* 43 */
336 OP_TYPEUPTO, /* 44 From 0 to n matches */
337 OP_TYPEMINUPTO, /* 45 */
338 OP_TYPEEXACT, /* 46 Exactly n matches */
339
340 OP_CRSTAR, /* 47 The maximizing and minimizing versions of */
341 OP_CRMINSTAR, /* 48 all these opcodes must come in pairs, with */
342 OP_CRPLUS, /* 49 the minimizing one second. These codes must */
343 OP_CRMINPLUS, /* 50 be in exactly the same order as those above. */
344 OP_CRQUERY, /* 51 These are for character classes and back refs */
345 OP_CRMINQUERY, /* 52 */
346 OP_CRRANGE, /* 53 These are different to the three seta above. */
347 OP_CRMINRANGE, /* 54 */
348
349 OP_CLASS, /* 55 Match a character class, chars < 256 only */
350 OP_NCLASS, /* 56 Same, but the bitmap was created from a negative
351 class - the difference is relevant only when a UTF-8
352 character > 255 is encountered. */
353
354 OP_XCLASS, /* 56 Extended class for handling UTF-8 chars within the
355 class. This does both positive and negative. */
356
357 OP_REF, /* 57 Match a back reference */
358 OP_RECURSE, /* 58 Match a numbered subpattern (possibly recursive) */
359 OP_CALLOUT, /* 59 Call out to external function if provided */
360
361 OP_ALT, /* 60 Start of alternation */
362 OP_KET, /* 61 End of group that doesn't have an unbounded repeat */
363 OP_KETRMAX, /* 62 These two must remain together and in this */
364 OP_KETRMIN, /* 63 order. They are for groups the repeat for ever. */
365
366 /* The assertions must come before ONCE and COND */
367
368 OP_ASSERT, /* 64 Positive lookahead */
369 OP_ASSERT_NOT, /* 65 Negative lookahead */
370 OP_ASSERTBACK, /* 66 Positive lookbehind */
371 OP_ASSERTBACK_NOT, /* 67 Negative lookbehind */
372 OP_REVERSE, /* 68 Move pointer back - used in lookbehind assertions */
373
374 /* ONCE and COND must come after the assertions, with ONCE first, as there's
375 a test for >= ONCE for a subpattern that isn't an assertion. */
376
377 OP_ONCE, /* 69 Once matched, don't back up into the subpattern */
378 OP_COND, /* 70 Conditional group */
379 OP_CREF, /* 71 Used to hold an extraction string number (cond ref) */
380
381 OP_BRAZERO, /* 72 These two must remain together and in this */
382 OP_BRAMINZERO, /* 73 order. */
383
384 OP_BRANUMBER, /* 74 Used for extracting brackets whose number is greater
385 than can fit into an opcode. */
386
387 OP_BRA /* 75 This and greater values are used for brackets that
388 extract substrings up to a basic limit. After that,
389 use is made of OP_BRANUMBER. */
390 };
391
392 /* WARNING: There is an implicit assumption in study.c that all opcodes are
393 less than 128 in value. This makes handling UTF-8 character sequences easier.
394 */
395
396
397 /* This macro defines textual names for all the opcodes. There are used only
398 for debugging, in pcre.c when DEBUG is defined, and also in pcretest.c. The
399 macro is referenced only in printint.c. */
400
401 #define OP_NAME_LIST \
402 "End", "\\A", "\\G", "\\B", "\\b", "\\D", "\\d", \
403 "\\S", "\\s", "\\W", "\\w", "Any", "Anybyte", "\\Z", "\\z", \
404 "Opt", "^", "$", "chars", "not", \
405 "*", "*?", "+", "+?", "?", "??", "{", "{", "{", \
406 "*", "*?", "+", "+?", "?", "??", "{", "{", "{", \
407 "*", "*?", "+", "+?", "?", "??", "{", "{", "{", \
408 "*", "*?", "+", "+?", "?", "??", "{", "{", \
409 "class", "nclass", "xclass", "Ref", "Recurse", "Callout", \
410 "Alt", "Ket", "KetRmax", "KetRmin", "Assert", "Assert not", \
411 "AssertB", "AssertB not", "Reverse", "Once", "Cond", "Cond ref",\
412 "Brazero", "Braminzero", "Branumber", "Bra"
413
414
415 /* This macro defines the length of fixed length operations in the compiled
416 regex. The lengths are used when searching for specific things, and also in the
417 debugging printing of a compiled regex. We use a macro so that it can be
418 incorporated both into pcre.c and pcretest.c without being publicly exposed.
419
420 As things have been extended, some of these are no longer fixed lenths, but are
421 minima instead. For example, the length of a single-character repeat may vary
422 in UTF-8 mode. The code that uses this table must know about such things. */
423
424 #define OP_LENGTHS \
425 1, /* End */ \
426 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* \A, \G, \B, \B, \D, \d, \S, \s, \W, \w */ \
427 1, 1, 1, 1, 2, 1, 1, /* Any, Anybyte, \Z, \z, Opt, ^, $ */ \
428 2, /* Chars - the minimum length */ \
429 2, /* not */ \
430 /* Positive single-char repeats */ \
431 2, 2, 2, 2, 2, 2, /* *, *?, +, +?, ?, ?? ** These are */ \
432 4, 4, 4, /* upto, minupto, exact ** minima */ \
433 /* Negative single-char repeats */ \
434 2, 2, 2, 2, 2, 2, /* NOT *, *?, +, +?, ?, ?? */ \
435 4, 4, 4, /* NOT upto, minupto, exact */ \
436 /* Positive type repeats */ \
437 2, 2, 2, 2, 2, 2, /* Type *, *?, +, +?, ?, ?? */ \
438 4, 4, 4, /* Type upto, minupto, exact */ \
439 /* Character class & ref repeats */ \
440 1, 1, 1, 1, 1, 1, /* *, *?, +, +?, ?, ?? */ \
441 5, 5, /* CRRANGE, CRMINRANGE */ \
442 33, /* CLASS */ \
443 33, /* NCLASS */ \
444 0, /* XCLASS - variable length */ \
445 3, /* REF */ \
446 1+LINK_SIZE, /* RECURSE */ \
447 2, /* CALLOUT */ \
448 1+LINK_SIZE, /* Alt */ \
449 1+LINK_SIZE, /* Ket */ \
450 1+LINK_SIZE, /* KetRmax */ \
451 1+LINK_SIZE, /* KetRmin */ \
452 1+LINK_SIZE, /* Assert */ \
453 1+LINK_SIZE, /* Assert not */ \
454 1+LINK_SIZE, /* Assert behind */ \
455 1+LINK_SIZE, /* Assert behind not */ \
456 1+LINK_SIZE, /* Reverse */ \
457 1+LINK_SIZE, /* Once */ \
458 1+LINK_SIZE, /* COND */ \
459 3, /* CREF */ \
460 1, 1, /* BRAZERO, BRAMINZERO */ \
461 3, /* BRANUMBER */ \
462 1+LINK_SIZE /* BRA */ \
463
464
465 /* The highest extraction number before we have to start using additional
466 bytes. (Originally PCRE didn't have support for extraction counts highter than
467 this number.) The value is limited by the number of opcodes left after OP_BRA,
468 i.e. 255 - OP_BRA. We actually set it a bit lower to leave room for additional
469 opcodes. */
470
471 #define EXTRACT_BASIC_MAX 150
472
473 /* A magic value for OP_CREF to indicate the "in recursion" condition. */
474
475 #define CREF_RECURSE 0xffff
476
477 /* The texts of compile-time error messages are defined as macros here so that
478 they can be accessed by the POSIX wrapper and converted into error codes. Yes,
479 I could have used error codes in the first place, but didn't feel like changing
480 just to accommodate the POSIX wrapper. */
481
482 #define ERR1 "\\ at end of pattern"
483 #define ERR2 "\\c at end of pattern"
484 #define ERR3 "unrecognized character follows \\"
485 #define ERR4 "numbers out of order in {} quantifier"
486 #define ERR5 "number too big in {} quantifier"
487 #define ERR6 "missing terminating ] for character class"
488 #define ERR7 "invalid escape sequence in character class"
489 #define ERR8 "range out of order in character class"
490 #define ERR9 "nothing to repeat"
491 #define ERR10 "operand of unlimited repeat could match the empty string"
492 #define ERR11 "internal error: unexpected repeat"
493 #define ERR12 "unrecognized character after (?"
494 #define ERR13 "POSIX named classes are supported only within a class"
495 #define ERR14 "missing )"
496 #define ERR15 "reference to non-existent subpattern"
497 #define ERR16 "erroffset passed as NULL"
498 #define ERR17 "unknown option bit(s) set"
499 #define ERR18 "missing ) after comment"
500 #define ERR19 "parentheses nested too deeply"
501 #define ERR20 "regular expression too large"
502 #define ERR21 "failed to get memory"
503 #define ERR22 "unmatched parentheses"
504 #define ERR23 "internal error: code overflow"
505 #define ERR24 "unrecognized character after (?<"
506 #define ERR25 "lookbehind assertion is not fixed length"
507 #define ERR26 "malformed number after (?("
508 #define ERR27 "conditional group contains more than two branches"
509 #define ERR28 "assertion expected after (?("
510 #define ERR29 "(?R or (?digits must be followed by )"
511 #define ERR30 "unknown POSIX class name"
512 #define ERR31 "POSIX collating elements are not supported"
513 #define ERR32 "this version of PCRE is not compiled with PCRE_UTF8 support"
514 #define ERR33 "spare error"
515 #define ERR34 "character value in \\x{...} sequence is too large"
516 #define ERR35 "invalid condition (?(0)"
517 #define ERR36 "\\C not allowed in lookbehind assertion"
518 #define ERR37 "PCRE does not support \\L, \\l, \\N, \\P, \\p, \\U, \\u, or \\X"
519 #define ERR38 "number after (?C is > 255"
520 #define ERR39 "closing ) for (?C expected"
521 #define ERR40 "recursive call could loop indefinitely"
522 #define ERR41 "unrecognized character after (?P"
523 #define ERR42 "syntax error after (?P"
524 #define ERR43 "two named groups have the same name"
525
526 /* All character handling must be done as unsigned characters. Otherwise there
527 are problems with top-bit-set characters and functions such as isspace().
528 However, we leave the interface to the outside world as char *, because that
529 should make things easier for callers. We define a short type for unsigned char
530 to save lots of typing. I tried "uchar", but it causes problems on Digital
531 Unix, where it is defined in sys/types, so use "uschar" instead. */
532
533 typedef unsigned char uschar;
534
535 /* The real format of the start of the pcre block; the index of names and the
536 code vector run on as long as necessary after the end. */
537
538 typedef struct real_pcre {
539 unsigned long int magic_number;
540 size_t size; /* Total that was malloced */
541 const unsigned char *tables; /* Pointer to tables */
542 unsigned long int options;
543 unsigned short int top_bracket;
544 unsigned short int top_backref;
545 unsigned short int first_byte;
546 unsigned short int req_byte;
547 unsigned short int name_entry_size; /* Size of any name items; 0 => none */
548 unsigned short int name_count; /* Number of name items */
549 } real_pcre;
550
551 /* The format of the block used to store data from pcre_study(). */
552
553 typedef struct pcre_study_data {
554 size_t size; /* Total that was malloced */
555 uschar options;
556 uschar start_bits[32];
557 } pcre_study_data;
558
559 /* Structure for passing "static" information around between the functions
560 doing the compiling, so that they are thread-safe. */
561
562 typedef struct compile_data {
563 const uschar *lcc; /* Points to lower casing table */
564 const uschar *fcc; /* Points to case-flipping table */
565 const uschar *cbits; /* Points to character type table */
566 const uschar *ctypes; /* Points to table of type maps */
567 const uschar *start_code; /* The start of the compiled code */
568 uschar *name_table; /* The name/number table */
569 int names_found; /* Number of entries so far */
570 int name_entry_size; /* Size of each entry */
571 int top_backref; /* Maximum back reference */
572 unsigned int backref_map; /* Bitmap of low back refs */
573 } compile_data;
574
575 /* Structure for maintaining a chain of pointers to the currently incomplete
576 branches, for testing for left recursion. */
577
578 typedef struct branch_chain {
579 struct branch_chain *outer;
580 uschar *current;
581 } branch_chain;
582
583 /* Structure for items in a linked list that represents an explicit recursive
584 call within the pattern. */
585
586 typedef struct recursion_info {
587 struct recursion_info *prev; /* Previous recursion record (or NULL) */
588 int group_num; /* Number of group that was called */
589 const uschar *after_call; /* "Return value": points after the call in the expr */
590 const uschar *save_start; /* Old value of md->start_match */
591 int *offset_save; /* Pointer to start of saved offsets */
592 int saved_max; /* Number of saved offsets */
593 } recursion_info;
594
595 /* Structure for passing "static" information around between the functions
596 doing the matching, so that they are thread-safe. */
597
598 typedef struct match_data {
599 int match_call_count; /* As it says */
600 int match_limit; /* As it says */
601 int *offset_vector; /* Offset vector */
602 int offset_end; /* One past the end */
603 int offset_max; /* The maximum usable for return data */
604 const uschar *lcc; /* Points to lower casing table */
605 const uschar *ctypes; /* Points to table of type maps */
606 BOOL offset_overflow; /* Set if too many extractions */
607 BOOL notbol; /* NOTBOL flag */
608 BOOL noteol; /* NOTEOL flag */
609 BOOL utf8; /* UTF8 flag */
610 BOOL endonly; /* Dollar not before final \n */
611 BOOL notempty; /* Empty string match not wanted */
612 const uschar *start_code; /* For use when recursing */
613 const uschar *start_subject; /* Start of the subject string */
614 const uschar *end_subject; /* End of the subject string */
615 const uschar *start_match; /* Start of this match attempt */
616 const uschar *end_match_ptr; /* Subject position at end match */
617 int end_offset_top; /* Highwater mark at end of match */
618 int capture_last; /* Most recent capture number */
619 int start_offset; /* The start offset value */
620 recursion_info *recursive; /* Linked list of recursion data */
621 void *callout_data; /* To pass back to callouts */
622 } match_data;
623
624 /* Bit definitions for entries in the pcre_ctypes table. */
625
626 #define ctype_space 0x01
627 #define ctype_letter 0x02
628 #define ctype_digit 0x04
629 #define ctype_xdigit 0x08
630 #define ctype_word 0x10 /* alphameric or '_' */
631 #define ctype_meta 0x80 /* regexp meta char or zero (end pattern) */
632
633 /* Offsets for the bitmap tables in pcre_cbits. Each table contains a set
634 of bits for a class map. Some classes are built by combining these tables. */
635
636 #define cbit_space 0 /* [:space:] or \s */
637 #define cbit_xdigit 32 /* [:xdigit:] */
638 #define cbit_digit 64 /* [:digit:] or \d */
639 #define cbit_upper 96 /* [:upper:] */
640 #define cbit_lower 128 /* [:lower:] */
641 #define cbit_word 160 /* [:word:] or \w */
642 #define cbit_graph 192 /* [:graph:] */
643 #define cbit_print 224 /* [:print:] */
644 #define cbit_punct 256 /* [:punct:] */
645 #define cbit_cntrl 288 /* [:cntrl:] */
646 #define cbit_length 320 /* Length of the cbits table */
647
648 /* Offsets of the various tables from the base tables pointer, and
649 total length. */
650
651 #define lcc_offset 0
652 #define fcc_offset 256
653 #define cbits_offset 512
654 #define ctypes_offset (cbits_offset + cbit_length)
655 #define tables_length (ctypes_offset + 256)
656
657 /* End of internal.h */

webmaster@exim.org
ViewVC Help
Powered by ViewVC 1.1.12