/[pcre]/code/trunk/pcre_internal.h
ViewVC logotype

Contents of /code/trunk/pcre_internal.h

Parent Directory Parent Directory | Revision Log Revision Log


Revision 189 - (hide annotations) (download)
Thu Jul 5 11:50:49 2007 UTC (7 years, 2 months ago) by ph10
File MIME type: text/plain
File size: 45024 byte(s)
Change #include <pcre.h> to #include "pcre.h" in pcre_internal.h (an error that 
crept in at 7.1).

1 nigel 77 /*************************************************
2     * Perl-Compatible Regular Expressions *
3     *************************************************/
4    
5    
6     /* PCRE 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.
8    
9     Written by Philip Hazel
10 ph10 117 Copyright (c) 1997-2007 University of Cambridge
11 nigel 77
12     -----------------------------------------------------------------------------
13     Redistribution and use in source and binary forms, with or without
14     modification, are permitted provided that the following conditions are met:
15    
16     * Redistributions of source code must retain the above copyright notice,
17     this list of conditions and the following disclaimer.
18    
19     * Redistributions in binary form must reproduce the above copyright
20     notice, this list of conditions and the following disclaimer in the
21     documentation and/or other materials provided with the distribution.
22    
23     * Neither the name of the University of Cambridge nor the names of its
24     contributors may be used to endorse or promote products derived from
25     this software without specific prior written permission.
26    
27     THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
28     AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29     IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30     ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
31     LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
32     CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
33     SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
34     INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
35     CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
36     ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
37     POSSIBILITY OF SUCH DAMAGE.
38     -----------------------------------------------------------------------------
39     */
40    
41     /* This header contains definitions that are shared between the different
42     modules, but which are not relevant to the exported API. This includes some
43     functions whose names all begin with "_pcre_". */
44    
45 nigel 85 #ifndef PCRE_INTERNAL_H
46     #define PCRE_INTERNAL_H
47 nigel 77
48     /* Define DEBUG to get debugging output on stdout. */
49    
50 nigel 85 #if 0
51 nigel 77 #define DEBUG
52 nigel 85 #endif
53 nigel 77
54     /* Use a macro for debugging printing, 'cause that eliminates the use of #ifdef
55     inline, and there are *still* stupid compilers about that don't like indented
56     pre-processor statements, or at least there were when I first wrote this. After
57 nigel 93 all, it had only been about 10 years then...
58 nigel 77
59 nigel 93 It turns out that the Mac Debugging.h header also defines the macro DPRINTF, so
60     be absolutely sure we get our version. */
61    
62     #undef DPRINTF
63 nigel 77 #ifdef DEBUG
64     #define DPRINTF(p) printf p
65     #else
66 nigel 93 #define DPRINTF(p) /* Nothing */
67 nigel 77 #endif
68    
69    
70     /* Get the definitions provided by running "configure" */
71    
72     #include "config.h"
73    
74     /* Standard C headers plus the external interface definition. The only time
75     setjmp and stdarg are used is when NO_RECURSE is set. */
76    
77     #include <ctype.h>
78     #include <limits.h>
79     #include <setjmp.h>
80     #include <stdarg.h>
81     #include <stddef.h>
82     #include <stdio.h>
83     #include <stdlib.h>
84     #include <string.h>
85    
86 ph10 145 /* When compiling a DLL for Windows, the exported symbols have to be declared
87     using some MS magic. I found some useful information on this web page:
88     http://msdn2.microsoft.com/en-us/library/y4h7bcy6(VS.80).aspx. According to the
89 ph10 154 information there, using __declspec(dllexport) without "extern" we have a
90 ph10 145 definition; with "extern" we have a declaration. The settings here override the
91     setting in pcre.h (which is included below); it defines only PCRE_EXP_DECL,
92 ph10 154 which is all that is needed for applications (they just import the symbols). We
93     use:
94 ph10 145
95     PCRE_EXP_DECL for declarations
96     PCRE_EXP_DEFN for definitions of exported functions
97     PCRE_EXP_DATA_DEFN for definitions of exported variables
98    
99     The reason for the two DEFN macros is that in non-Windows environments, one
100     does not want to have "extern" before variable definitions because it leads to
101     compiler warnings. So we distinguish between functions and variables. In
102     Windows, the two should always be the same.
103    
104     The reason for wrapping this in #ifndef PCRE_EXP_DECL is so that pcretest,
105     which is an application, but needs to import this file in order to "peek" at
106 ph10 154 internals, can #include pcre.h first to get an application's-eye view.
107 ph10 145
108     In principle, people compiling for non-Windows, non-Unix-like (i.e. uncommon,
109     special-purpose environments) might want to stick other stuff in front of
110     exported symbols. That's why, in the non-Windows case, we set PCRE_EXP_DEFN and
111     PCRE_EXP_DATA_DEFN only if they are not already set. */
112    
113     #ifndef PCRE_EXP_DECL
114     # ifdef _WIN32
115     # ifdef DLL_EXPORT
116     # define PCRE_EXP_DECL extern __declspec(dllexport)
117     # define PCRE_EXP_DEFN __declspec(dllexport)
118     # define PCRE_EXP_DATA_DEFN __declspec(dllexport)
119     # else
120     # define PCRE_EXP_DECL extern
121     # define PCRE_EXP_DEFN
122     # define PCRE_EXP_DATA_DEFN
123     # endif
124     #
125     # else
126     # ifdef __cplusplus
127     # define PCRE_EXP_DECL extern "C"
128     # else
129     # define PCRE_EXP_DECL extern
130     # endif
131     # ifndef PCRE_EXP_DEFN
132     # define PCRE_EXP_DEFN PCRE_EXP_DECL
133     # endif
134     # ifndef PCRE_EXP_DATA_DEFN
135     # define PCRE_EXP_DATA_DEFN
136     # endif
137     # endif
138 nigel 77 #endif
139    
140     /* We need to have types that specify unsigned 16-bit and 32-bit integers. We
141     cannot determine these outside the compilation (e.g. by running a program as
142     part of "configure") because PCRE is often cross-compiled for use on other
143     systems. Instead we make use of the maximum sizes that are available at
144     preprocessor time in standard C environments. */
145    
146     #if USHRT_MAX == 65535
147     typedef unsigned short pcre_uint16;
148     #elif UINT_MAX == 65535
149     typedef unsigned int pcre_uint16;
150     #else
151     #error Cannot determine a type for 16-bit unsigned integers
152     #endif
153    
154     #if UINT_MAX == 4294967295
155     typedef unsigned int pcre_uint32;
156     #elif ULONG_MAX == 4294967295
157     typedef unsigned long int pcre_uint32;
158     #else
159     #error Cannot determine a type for 32-bit unsigned integers
160     #endif
161    
162     /* All character handling must be done as unsigned characters. Otherwise there
163     are problems with top-bit-set characters and functions such as isspace().
164     However, we leave the interface to the outside world as char *, because that
165     should make things easier for callers. We define a short type for unsigned char
166     to save lots of typing. I tried "uchar", but it causes problems on Digital
167     Unix, where it is defined in sys/types, so use "uschar" instead. */
168    
169     typedef unsigned char uschar;
170    
171 nigel 93 /* This is an unsigned int value that no character can ever have. UTF-8
172     characters only go up to 0x7fffffff (though Unicode doesn't go beyond
173     0x0010ffff). */
174 nigel 91
175 nigel 93 #define NOTACHAR 0xffffffff
176    
177     /* PCRE is able to support several different kinds of newline (CR, LF, CRLF,
178 ph10 149 "any" and "anycrlf" at present). The following macros are used to package up
179     testing for newlines. NLBLOCK, PSSTART, and PSEND are defined in the various
180     modules to indicate in which datablock the parameters exist, and what the
181     start/end of string field names are. */
182 nigel 93
183 ph10 149 #define NLTYPE_FIXED 0 /* Newline is a fixed length string */
184     #define NLTYPE_ANY 1 /* Newline is any Unicode line ending */
185     #define NLTYPE_ANYCRLF 2 /* Newline is CR, LF, or CRLF */
186 nigel 93
187     /* This macro checks for a newline at the given position */
188    
189 nigel 91 #define IS_NEWLINE(p) \
190 nigel 93 ((NLBLOCK->nltype != NLTYPE_FIXED)? \
191     ((p) < NLBLOCK->PSEND && \
192 ph10 149 _pcre_is_newline((p), NLBLOCK->nltype, NLBLOCK->PSEND, &(NLBLOCK->nllen),\
193     utf8)) \
194 nigel 93 : \
195     ((p) <= NLBLOCK->PSEND - NLBLOCK->nllen && \
196     (p)[0] == NLBLOCK->nl[0] && \
197     (NLBLOCK->nllen == 1 || (p)[1] == NLBLOCK->nl[1]) \
198     ) \
199     )
200 nigel 91
201 nigel 93 /* This macro checks for a newline immediately preceding the given position */
202    
203     #define WAS_NEWLINE(p) \
204     ((NLBLOCK->nltype != NLTYPE_FIXED)? \
205     ((p) > NLBLOCK->PSSTART && \
206 ph10 149 _pcre_was_newline((p), NLBLOCK->nltype, NLBLOCK->PSSTART, \
207     &(NLBLOCK->nllen), utf8)) \
208 nigel 93 : \
209     ((p) >= NLBLOCK->PSSTART + NLBLOCK->nllen && \
210     (p)[-NLBLOCK->nllen] == NLBLOCK->nl[0] && \
211     (NLBLOCK->nllen == 1 || (p)[-NLBLOCK->nllen+1] == NLBLOCK->nl[1]) \
212     ) \
213     )
214    
215 nigel 87 /* When PCRE is compiled as a C++ library, the subject pointer can be replaced
216     with a custom type. This makes it possible, for example, to allow pcre_exec()
217     to process subject strings that are discontinuous by using a smart pointer
218     class. It must always be possible to inspect all of the subject string in
219     pcre_exec() because of the way it backtracks. Two macros are required in the
220     normal case, for sign-unspecified and unsigned char pointers. The former is
221     used for the external interface and appears in pcre.h, which is why its name
222     must begin with PCRE_. */
223    
224     #ifdef CUSTOM_SUBJECT_PTR
225     #define PCRE_SPTR CUSTOM_SUBJECT_PTR
226     #define USPTR CUSTOM_SUBJECT_PTR
227     #else
228     #define PCRE_SPTR const char *
229     #define USPTR const unsigned char *
230     #endif
231    
232 ph10 145
233    
234 nigel 85 /* Include the public PCRE header and the definitions of UCP character property
235     values. */
236 nigel 77
237 ph10 189 #include "pcre.h"
238 nigel 77 #include "ucp.h"
239    
240     /* When compiling for use with the Virtual Pascal compiler, these functions
241     need to have their names changed. PCRE must be compiled with the -DVPCOMPAT
242     option on the command line. */
243    
244     #ifdef VPCOMPAT
245 ph10 101 #define strlen(s) _strlen(s)
246 nigel 77 #define strncmp(s1,s2,m) _strncmp(s1,s2,m)
247 ph10 101 #define memcmp(s,c,n) _memcmp(s,c,n)
248 nigel 77 #define memcpy(d,s,n) _memcpy(d,s,n)
249     #define memmove(d,s,n) _memmove(d,s,n)
250     #define memset(s,c,n) _memset(s,c,n)
251     #else /* VPCOMPAT */
252    
253     /* To cope with SunOS4 and other systems that lack memmove() but have bcopy(),
254     define a macro for memmove() if HAVE_MEMMOVE is false, provided that HAVE_BCOPY
255     is set. Otherwise, include an emulating function for those systems that have
256 ph10 118 neither (there some non-Unix environments where this is the case). */
257 nigel 77
258 ph10 137 #ifndef HAVE_MEMMOVE
259 nigel 77 #undef memmove /* some systems may have a macro */
260 ph10 137 #ifdef HAVE_BCOPY
261 nigel 77 #define memmove(a, b, c) bcopy(b, a, c)
262     #else /* HAVE_BCOPY */
263 nigel 91 static void *
264 ph10 108 pcre_memmove(void *d, const void *s, size_t n)
265 nigel 77 {
266 nigel 87 size_t i;
267 ph10 108 unsigned char *dest = (unsigned char *)d;
268     const unsigned char *src = (const unsigned char *)s;
269 ph10 118 if (dest > src)
270     {
271     dest += n;
272     src += n;
273     for (i = 0; i < n; ++i) *(--dest) = *(--src);
274     return (void *)dest;
275     }
276     else
277     {
278     for (i = 0; i < n; ++i) *dest++ = *src++;
279 ph10 123 return (void *)(dest - n);
280     }
281 nigel 77 }
282     #define memmove(a, b, c) pcre_memmove(a, b, c)
283     #endif /* not HAVE_BCOPY */
284     #endif /* not HAVE_MEMMOVE */
285     #endif /* not VPCOMPAT */
286    
287    
288     /* PCRE keeps offsets in its compiled code as 2-byte quantities (always stored
289     in big-endian order) by default. These are used, for example, to link from the
290     start of a subpattern to its alternatives and its end. The use of 2 bytes per
291     offset limits the size of the compiled regex to around 64K, which is big enough
292     for almost everybody. However, I received a request for an even bigger limit.
293     For this reason, and also to make the code easier to maintain, the storing and
294     loading of offsets from the byte string is now handled by the macros that are
295     defined here.
296    
297     The macros are controlled by the value of LINK_SIZE. This defaults to 2 in
298     the config.h file, but can be overridden by using -D on the command line. This
299     is automated on Unix systems via the "configure" command. */
300    
301     #if LINK_SIZE == 2
302    
303     #define PUT(a,n,d) \
304     (a[n] = (d) >> 8), \
305     (a[(n)+1] = (d) & 255)
306    
307     #define GET(a,n) \
308     (((a)[n] << 8) | (a)[(n)+1])
309    
310     #define MAX_PATTERN_SIZE (1 << 16)
311    
312    
313     #elif LINK_SIZE == 3
314    
315     #define PUT(a,n,d) \
316     (a[n] = (d) >> 16), \
317     (a[(n)+1] = (d) >> 8), \
318     (a[(n)+2] = (d) & 255)
319    
320     #define GET(a,n) \
321     (((a)[n] << 16) | ((a)[(n)+1] << 8) | (a)[(n)+2])
322    
323     #define MAX_PATTERN_SIZE (1 << 24)
324    
325    
326     #elif LINK_SIZE == 4
327    
328     #define PUT(a,n,d) \
329     (a[n] = (d) >> 24), \
330     (a[(n)+1] = (d) >> 16), \
331     (a[(n)+2] = (d) >> 8), \
332     (a[(n)+3] = (d) & 255)
333    
334     #define GET(a,n) \
335     (((a)[n] << 24) | ((a)[(n)+1] << 16) | ((a)[(n)+2] << 8) | (a)[(n)+3])
336    
337     #define MAX_PATTERN_SIZE (1 << 30) /* Keep it positive */
338    
339    
340     #else
341     #error LINK_SIZE must be either 2, 3, or 4
342     #endif
343    
344    
345     /* Convenience macro defined in terms of the others */
346    
347     #define PUTINC(a,n,d) PUT(a,n,d), a += LINK_SIZE
348    
349    
350     /* PCRE uses some other 2-byte quantities that do not change when the size of
351     offsets changes. There are used for repeat counts and for other things such as
352     capturing parenthesis numbers in back references. */
353    
354     #define PUT2(a,n,d) \
355     a[n] = (d) >> 8; \
356     a[(n)+1] = (d) & 255
357    
358     #define GET2(a,n) \
359     (((a)[n] << 8) | (a)[(n)+1])
360    
361     #define PUT2INC(a,n,d) PUT2(a,n,d), a += 2
362    
363    
364     /* When UTF-8 encoding is being used, a character is no longer just a single
365     byte. The macros for character handling generate simple sequences when used in
366     byte-mode, and more complicated ones for UTF-8 characters. */
367    
368     #ifndef SUPPORT_UTF8
369     #define GETCHAR(c, eptr) c = *eptr;
370     #define GETCHARTEST(c, eptr) c = *eptr;
371     #define GETCHARINC(c, eptr) c = *eptr++;
372     #define GETCHARINCTEST(c, eptr) c = *eptr++;
373     #define GETCHARLEN(c, eptr, len) c = *eptr;
374     #define BACKCHAR(eptr)
375    
376     #else /* SUPPORT_UTF8 */
377    
378     /* Get the next UTF-8 character, not advancing the pointer. This is called when
379     we know we are in UTF-8 mode. */
380    
381     #define GETCHAR(c, eptr) \
382     c = *eptr; \
383 nigel 93 if (c >= 0xc0) \
384 nigel 77 { \
385     int gcii; \
386     int gcaa = _pcre_utf8_table4[c & 0x3f]; /* Number of additional bytes */ \
387     int gcss = 6*gcaa; \
388     c = (c & _pcre_utf8_table3[gcaa]) << gcss; \
389     for (gcii = 1; gcii <= gcaa; gcii++) \
390     { \
391     gcss -= 6; \
392     c |= (eptr[gcii] & 0x3f) << gcss; \
393     } \
394     }
395    
396     /* Get the next UTF-8 character, testing for UTF-8 mode, and not advancing the
397     pointer. */
398    
399     #define GETCHARTEST(c, eptr) \
400     c = *eptr; \
401 nigel 93 if (utf8 && c >= 0xc0) \
402 nigel 77 { \
403     int gcii; \
404     int gcaa = _pcre_utf8_table4[c & 0x3f]; /* Number of additional bytes */ \
405     int gcss = 6*gcaa; \
406     c = (c & _pcre_utf8_table3[gcaa]) << gcss; \
407     for (gcii = 1; gcii <= gcaa; gcii++) \
408     { \
409     gcss -= 6; \
410     c |= (eptr[gcii] & 0x3f) << gcss; \
411     } \
412     }
413    
414     /* Get the next UTF-8 character, advancing the pointer. This is called when we
415     know we are in UTF-8 mode. */
416    
417     #define GETCHARINC(c, eptr) \
418     c = *eptr++; \
419 nigel 93 if (c >= 0xc0) \
420 nigel 77 { \
421     int gcaa = _pcre_utf8_table4[c & 0x3f]; /* Number of additional bytes */ \
422     int gcss = 6*gcaa; \
423     c = (c & _pcre_utf8_table3[gcaa]) << gcss; \
424     while (gcaa-- > 0) \
425     { \
426     gcss -= 6; \
427     c |= (*eptr++ & 0x3f) << gcss; \
428     } \
429     }
430    
431     /* Get the next character, testing for UTF-8 mode, and advancing the pointer */
432    
433     #define GETCHARINCTEST(c, eptr) \
434     c = *eptr++; \
435 nigel 93 if (utf8 && c >= 0xc0) \
436 nigel 77 { \
437     int gcaa = _pcre_utf8_table4[c & 0x3f]; /* Number of additional bytes */ \
438     int gcss = 6*gcaa; \
439     c = (c & _pcre_utf8_table3[gcaa]) << gcss; \
440     while (gcaa-- > 0) \
441     { \
442     gcss -= 6; \
443     c |= (*eptr++ & 0x3f) << gcss; \
444     } \
445     }
446    
447     /* Get the next UTF-8 character, not advancing the pointer, incrementing length
448     if there are extra bytes. This is called when we know we are in UTF-8 mode. */
449    
450     #define GETCHARLEN(c, eptr, len) \
451     c = *eptr; \
452 nigel 93 if (c >= 0xc0) \
453 nigel 77 { \
454     int gcii; \
455     int gcaa = _pcre_utf8_table4[c & 0x3f]; /* Number of additional bytes */ \
456     int gcss = 6*gcaa; \
457     c = (c & _pcre_utf8_table3[gcaa]) << gcss; \
458     for (gcii = 1; gcii <= gcaa; gcii++) \
459     { \
460     gcss -= 6; \
461     c |= (eptr[gcii] & 0x3f) << gcss; \
462     } \
463     len += gcaa; \
464     }
465    
466     /* If the pointer is not at the start of a character, move it back until
467     it is. Called only in UTF-8 mode. */
468    
469     #define BACKCHAR(eptr) while((*eptr & 0xc0) == 0x80) eptr--;
470    
471     #endif
472    
473    
474     /* In case there is no definition of offsetof() provided - though any proper
475     Standard C system should have one. */
476    
477     #ifndef offsetof
478     #define offsetof(p_type,field) ((size_t)&(((p_type *)0)->field))
479     #endif
480    
481    
482     /* These are the public options that can change during matching. */
483    
484     #define PCRE_IMS (PCRE_CASELESS|PCRE_MULTILINE|PCRE_DOTALL)
485    
486 nigel 91 /* Private options flags start at the most significant end of the four bytes.
487     The public options defined in pcre.h start at the least significant end. Make
488     sure they don't overlap! The bits are getting a bit scarce now -- when we run
489     out, there is a dummy word in the structure that could be used for the private
490     bits. */
491 nigel 77
492 nigel 91 #define PCRE_NOPARTIAL 0x80000000 /* can't use partial with this regex */
493 nigel 77 #define PCRE_FIRSTSET 0x40000000 /* first_byte is set */
494     #define PCRE_REQCHSET 0x20000000 /* req_byte is set */
495     #define PCRE_STARTLINE 0x10000000 /* start after \n for multiline */
496 nigel 91 #define PCRE_JCHANGED 0x08000000 /* j option changes within regex */
497 nigel 77
498     /* Options for the "extra" block produced by pcre_study(). */
499    
500     #define PCRE_STUDY_MAPPED 0x01 /* a map of starting chars exists */
501    
502     /* Masks for identifying the public options that are permitted at compile
503     time, run time, or study time, respectively. */
504    
505 ph10 149 #define PCRE_NEWLINE_BITS (PCRE_NEWLINE_CR|PCRE_NEWLINE_LF|PCRE_NEWLINE_ANY| \
506     PCRE_NEWLINE_ANYCRLF)
507 nigel 93
508 nigel 77 #define PUBLIC_OPTIONS \
509     (PCRE_CASELESS|PCRE_EXTENDED|PCRE_ANCHORED|PCRE_MULTILINE| \
510     PCRE_DOTALL|PCRE_DOLLAR_ENDONLY|PCRE_EXTRA|PCRE_UNGREEDY|PCRE_UTF8| \
511 nigel 91 PCRE_NO_AUTO_CAPTURE|PCRE_NO_UTF8_CHECK|PCRE_AUTO_CALLOUT|PCRE_FIRSTLINE| \
512 nigel 93 PCRE_DUPNAMES|PCRE_NEWLINE_BITS)
513 nigel 77
514     #define PUBLIC_EXEC_OPTIONS \
515     (PCRE_ANCHORED|PCRE_NOTBOL|PCRE_NOTEOL|PCRE_NOTEMPTY|PCRE_NO_UTF8_CHECK| \
516 nigel 93 PCRE_PARTIAL|PCRE_NEWLINE_BITS)
517 nigel 77
518     #define PUBLIC_DFA_EXEC_OPTIONS \
519     (PCRE_ANCHORED|PCRE_NOTBOL|PCRE_NOTEOL|PCRE_NOTEMPTY|PCRE_NO_UTF8_CHECK| \
520 nigel 93 PCRE_PARTIAL|PCRE_DFA_SHORTEST|PCRE_DFA_RESTART|PCRE_NEWLINE_BITS)
521 nigel 77
522     #define PUBLIC_STUDY_OPTIONS 0 /* None defined */
523    
524     /* Magic number to provide a small check against being handed junk. Also used
525     to detect whether a pattern was compiled on a host of different endianness. */
526    
527     #define MAGIC_NUMBER 0x50435245UL /* 'PCRE' */
528    
529     /* Negative values for the firstchar and reqchar variables */
530    
531     #define REQ_UNSET (-2)
532     #define REQ_NONE (-1)
533    
534     /* The maximum remaining length of subject we are prepared to search for a
535     req_byte match. */
536    
537     #define REQ_BYTE_MAX 1000
538    
539     /* Flags added to firstbyte or reqbyte; a "non-literal" item is either a
540     variable-length repeat, or a anything other than literal characters. */
541    
542     #define REQ_CASELESS 0x0100 /* indicates caselessness */
543     #define REQ_VARY 0x0200 /* reqbyte followed non-literal item */
544    
545     /* Miscellaneous definitions */
546    
547     typedef int BOOL;
548    
549     #define FALSE 0
550     #define TRUE 1
551    
552 nigel 93 /* Escape items that are just an encoding of a particular data value. */
553 nigel 77
554     #ifndef ESC_e
555     #define ESC_e 27
556     #endif
557    
558     #ifndef ESC_f
559     #define ESC_f '\f'
560     #endif
561    
562     #ifndef ESC_n
563 nigel 93 #define ESC_n '\n'
564 nigel 77 #endif
565    
566     #ifndef ESC_r
567     #define ESC_r '\r'
568     #endif
569    
570     /* We can't officially use ESC_t because it is a POSIX reserved identifier
571     (presumably because of all the others like size_t). */
572    
573     #ifndef ESC_tee
574     #define ESC_tee '\t'
575     #endif
576    
577 nigel 87 /* Codes for different types of Unicode property */
578    
579     #define PT_ANY 0 /* Any property - matches all chars */
580     #define PT_LAMP 1 /* L& - the union of Lu, Ll, Lt */
581     #define PT_GC 2 /* General characteristic (e.g. L) */
582     #define PT_PC 3 /* Particular characteristic (e.g. Lu) */
583     #define PT_SC 4 /* Script (e.g. Han) */
584    
585     /* Flag bits and data types for the extended class (OP_XCLASS) for classes that
586     contain UTF-8 characters with values greater than 255. */
587    
588     #define XCL_NOT 0x01 /* Flag: this is a negative class */
589     #define XCL_MAP 0x02 /* Flag: a 32-byte map is present */
590    
591     #define XCL_END 0 /* Marks end of individual items */
592     #define XCL_SINGLE 1 /* Single item (one multibyte char) follows */
593     #define XCL_RANGE 2 /* A range (two multibyte chars) follows */
594     #define XCL_PROP 3 /* Unicode property (2-byte property code follows) */
595     #define XCL_NOTPROP 4 /* Unicode inverted property (ditto) */
596    
597 nigel 77 /* These are escaped items that aren't just an encoding of a particular data
598     value such as \n. They must have non-zero values, as check_escape() returns
599     their negation. Also, they must appear in the same order as in the opcode
600     definitions below, up to ESC_z. There's a dummy for OP_ANY because it
601     corresponds to "." rather than an escape sequence. The final one must be
602 nigel 93 ESC_REF as subsequent values are used for backreferences (\1, \2, \3, etc).
603     There are two tests in the code for an escape greater than ESC_b and less than
604     ESC_Z to detect the types that may be repeated. These are the types that
605     consume characters. If any new escapes are put in between that don't consume a
606 nigel 77 character, that code will have to change. */
607    
608 ph10 172 enum { ESC_A = 1, ESC_G, ESC_K, ESC_B, ESC_b, ESC_D, ESC_d, ESC_S, ESC_s,
609 ph10 178 ESC_W, ESC_w, ESC_dum1, ESC_C, ESC_P, ESC_p, ESC_R, ESC_H, ESC_h,
610     ESC_V, ESC_v, ESC_X, ESC_Z, ESC_z, ESC_E, ESC_Q, ESC_k, ESC_REF };
611 nigel 77
612 nigel 93
613 nigel 77 /* Opcode table: OP_BRA must be last, as all values >= it are used for brackets
614     that extract substrings. Starting from 1 (i.e. after OP_END), the values up to
615     OP_EOD must correspond in order to the list of escapes immediately above.
616    
617 nigel 93 To keep stored, compiled patterns compatible, new opcodes should be added
618     immediately before OP_BRA, where (since release 7.0) a gap is left for this
619     purpose.
620    
621     *** NOTE NOTE NOTE *** Whenever this list is updated, the two macro definitions
622     that follow must also be updated to match. There is also a table called
623     "coptable" in pcre_dfa_exec.c that must be updated. */
624    
625 nigel 77 enum {
626     OP_END, /* 0 End of pattern */
627    
628     /* Values corresponding to backslashed metacharacters */
629    
630     OP_SOD, /* 1 Start of data: \A */
631     OP_SOM, /* 2 Start of match (subject + offset): \G */
632 ph10 172 OP_SET_SOM, /* 3 Set start of match (\K) */
633 ph10 168 OP_NOT_WORD_BOUNDARY, /* 4 \B */
634     OP_WORD_BOUNDARY, /* 5 \b */
635     OP_NOT_DIGIT, /* 6 \D */
636     OP_DIGIT, /* 7 \d */
637     OP_NOT_WHITESPACE, /* 8 \S */
638     OP_WHITESPACE, /* 9 \s */
639     OP_NOT_WORDCHAR, /* 10 \W */
640     OP_WORDCHAR, /* 11 \w */
641     OP_ANY, /* 12 Match any character */
642     OP_ANYBYTE, /* 13 Match any byte (\C); different to OP_ANY for UTF-8 */
643     OP_NOTPROP, /* 14 \P (not Unicode property) */
644     OP_PROP, /* 15 \p (Unicode property) */
645     OP_ANYNL, /* 16 \R (any newline sequence) */
646 ph10 178 OP_NOT_HSPACE, /* 17 \H (not horizontal whitespace) */
647     OP_HSPACE, /* 18 \h (horizontal whitespace) */
648     OP_NOT_VSPACE, /* 19 \V (not vertical whitespace) */
649     OP_VSPACE, /* 20 \v (vertical whitespace) */
650     OP_EXTUNI, /* 21 \X (extended Unicode sequence */
651     OP_EODN, /* 22 End of data or \n at end of data: \Z. */
652     OP_EOD, /* 23 End of data: \z */
653 nigel 77
654 ph10 178 OP_OPT, /* 24 Set runtime options */
655     OP_CIRC, /* 25 Start of line - varies with multiline switch */
656     OP_DOLL, /* 26 End of line - varies with multiline switch */
657     OP_CHAR, /* 27 Match one character, casefully */
658     OP_CHARNC, /* 28 Match one character, caselessly */
659     OP_NOT, /* 29 Match one character, not the following one */
660 nigel 77
661 ph10 178 OP_STAR, /* 30 The maximizing and minimizing versions of */
662     OP_MINSTAR, /* 31 these six opcodes must come in pairs, with */
663     OP_PLUS, /* 32 the minimizing one second. */
664     OP_MINPLUS, /* 33 This first set applies to single characters.*/
665     OP_QUERY, /* 34 */
666     OP_MINQUERY, /* 35 */
667 nigel 77
668 ph10 178 OP_UPTO, /* 36 From 0 to n matches */
669     OP_MINUPTO, /* 37 */
670     OP_EXACT, /* 38 Exactly n matches */
671 nigel 77
672 ph10 178 OP_POSSTAR, /* 39 Possessified star */
673     OP_POSPLUS, /* 40 Possessified plus */
674     OP_POSQUERY, /* 41 Posesssified query */
675     OP_POSUPTO, /* 42 Possessified upto */
676 nigel 77
677 ph10 178 OP_NOTSTAR, /* 43 The maximizing and minimizing versions of */
678     OP_NOTMINSTAR, /* 44 these six opcodes must come in pairs, with */
679     OP_NOTPLUS, /* 45 the minimizing one second. They must be in */
680     OP_NOTMINPLUS, /* 46 exactly the same order as those above. */
681     OP_NOTQUERY, /* 47 This set applies to "not" single characters. */
682     OP_NOTMINQUERY, /* 48 */
683 nigel 77
684 ph10 178 OP_NOTUPTO, /* 49 From 0 to n matches */
685     OP_NOTMINUPTO, /* 50 */
686     OP_NOTEXACT, /* 51 Exactly n matches */
687 nigel 93
688 ph10 178 OP_NOTPOSSTAR, /* 52 Possessified versions */
689     OP_NOTPOSPLUS, /* 53 */
690     OP_NOTPOSQUERY, /* 54 */
691     OP_NOTPOSUPTO, /* 55 */
692 nigel 93
693 ph10 178 OP_TYPESTAR, /* 56 The maximizing and minimizing versions of */
694     OP_TYPEMINSTAR, /* 57 these six opcodes must come in pairs, with */
695     OP_TYPEPLUS, /* 58 the minimizing one second. These codes must */
696     OP_TYPEMINPLUS, /* 59 be in exactly the same order as those above. */
697     OP_TYPEQUERY, /* 60 This set applies to character types such as \d */
698     OP_TYPEMINQUERY, /* 61 */
699 nigel 93
700 ph10 178 OP_TYPEUPTO, /* 62 From 0 to n matches */
701     OP_TYPEMINUPTO, /* 63 */
702     OP_TYPEEXACT, /* 64 Exactly n matches */
703 nigel 93
704 ph10 178 OP_TYPEPOSSTAR, /* 65 Possessified versions */
705     OP_TYPEPOSPLUS, /* 66 */
706     OP_TYPEPOSQUERY, /* 67 */
707     OP_TYPEPOSUPTO, /* 68 */
708 nigel 93
709 ph10 178 OP_CRSTAR, /* 69 The maximizing and minimizing versions of */
710     OP_CRMINSTAR, /* 70 all these opcodes must come in pairs, with */
711     OP_CRPLUS, /* 71 the minimizing one second. These codes must */
712     OP_CRMINPLUS, /* 72 be in exactly the same order as those above. */
713     OP_CRQUERY, /* 73 These are for character classes and back refs */
714     OP_CRMINQUERY, /* 74 */
715     OP_CRRANGE, /* 75 These are different to the three sets above. */
716     OP_CRMINRANGE, /* 76 */
717 nigel 93
718 ph10 178 OP_CLASS, /* 77 Match a character class, chars < 256 only */
719     OP_NCLASS, /* 78 Same, but the bitmap was created from a negative
720 nigel 77 class - the difference is relevant only when a UTF-8
721     character > 255 is encountered. */
722    
723 ph10 178 OP_XCLASS, /* 79 Extended class for handling UTF-8 chars within the
724 nigel 77 class. This does both positive and negative. */
725    
726 ph10 178 OP_REF, /* 80 Match a back reference */
727     OP_RECURSE, /* 81 Match a numbered subpattern (possibly recursive) */
728     OP_CALLOUT, /* 82 Call out to external function if provided */
729 nigel 77
730 ph10 178 OP_ALT, /* 83 Start of alternation */
731     OP_KET, /* 84 End of group that doesn't have an unbounded repeat */
732     OP_KETRMAX, /* 85 These two must remain together and in this */
733     OP_KETRMIN, /* 86 order. They are for groups the repeat for ever. */
734 nigel 77
735 nigel 93 /* The assertions must come before BRA, CBRA, ONCE, and COND.*/
736 nigel 77
737 ph10 178 OP_ASSERT, /* 87 Positive lookahead */
738     OP_ASSERT_NOT, /* 88 Negative lookahead */
739     OP_ASSERTBACK, /* 89 Positive lookbehind */
740     OP_ASSERTBACK_NOT, /* 90 Negative lookbehind */
741     OP_REVERSE, /* 91 Move pointer back - used in lookbehind assertions */
742 nigel 77
743 nigel 93 /* ONCE, BRA, CBRA, and COND must come after the assertions, with ONCE first,
744     as there's a test for >= ONCE for a subpattern that isn't an assertion. */
745 nigel 77
746 ph10 178 OP_ONCE, /* 92 Atomic group */
747     OP_BRA, /* 83 Start of non-capturing bracket */
748     OP_CBRA, /* 94 Start of capturing bracket */
749     OP_COND, /* 95 Conditional group */
750 nigel 77
751 nigel 93 /* These three must follow the previous three, in the same order. There's a
752     check for >= SBRA to distinguish the two sets. */
753 nigel 77
754 ph10 178 OP_SBRA, /* 96 Start of non-capturing bracket, check empty */
755     OP_SCBRA, /* 97 Start of capturing bracket, check empty */
756     OP_SCOND, /* 98 Conditional group, check empty */
757 nigel 77
758 ph10 178 OP_CREF, /* 99 Used to hold a capture number as condition */
759     OP_RREF, /* 100 Used to hold a recursion number as condition */
760     OP_DEF, /* 101 The DEFINE condition */
761 nigel 93
762 ph10 178 OP_BRAZERO, /* 102 These two must remain together and in this */
763     OP_BRAMINZERO /* 103 order. */
764 nigel 77 };
765    
766    
767     /* This macro defines textual names for all the opcodes. These are used only
768     for debugging. The macro is referenced only in pcre_printint.c. */
769    
770     #define OP_NAME_LIST \
771 ph10 168 "End", "\\A", "\\G", "\\K", "\\B", "\\b", "\\D", "\\d", \
772 nigel 77 "\\S", "\\s", "\\W", "\\w", "Any", "Anybyte", \
773 ph10 178 "notprop", "prop", "\\R", "\\H", "\\h", "\\V", "\\v", \
774     "extuni", "\\Z", "\\z", \
775 nigel 77 "Opt", "^", "$", "char", "charnc", "not", \
776     "*", "*?", "+", "+?", "?", "??", "{", "{", "{", \
777 nigel 93 "*+","++", "?+", "{", \
778 nigel 77 "*", "*?", "+", "+?", "?", "??", "{", "{", "{", \
779 nigel 93 "*+","++", "?+", "{", \
780 nigel 77 "*", "*?", "+", "+?", "?", "??", "{", "{", "{", \
781 nigel 93 "*+","++", "?+", "{", \
782 nigel 77 "*", "*?", "+", "+?", "?", "??", "{", "{", \
783     "class", "nclass", "xclass", "Ref", "Recurse", "Callout", \
784     "Alt", "Ket", "KetRmax", "KetRmin", "Assert", "Assert not", \
785 nigel 93 "AssertB", "AssertB not", "Reverse", \
786     "Once", "Bra 0", "Bra", "Cond", "SBra 0", "SBra", "SCond", \
787     "Cond ref", "Cond rec", "Cond def", "Brazero", "Braminzero"
788 nigel 77
789    
790     /* This macro defines the length of fixed length operations in the compiled
791     regex. The lengths are used when searching for specific things, and also in the
792     debugging printing of a compiled regex. We use a macro so that it can be
793     defined close to the definitions of the opcodes themselves.
794    
795     As things have been extended, some of these are no longer fixed lenths, but are
796     minima instead. For example, the length of a single-character repeat may vary
797     in UTF-8 mode. The code that uses this table must know about such things. */
798    
799     #define OP_LENGTHS \
800     1, /* End */ \
801 ph10 168 1, 1, 1, 1, 1, /* \A, \G, \K, \B, \b */ \
802     1, 1, 1, 1, 1, 1, /* \D, \d, \S, \s, \W, \w */ \
803 nigel 77 1, 1, /* Any, Anybyte */ \
804 ph10 178 3, 3, 1, /* NOTPROP, PROP, EXTUNI */ \
805     1, 1, 1, 1, 1, /* \R, \H, \h, \V, \v */ \
806 nigel 77 1, 1, 2, 1, 1, /* \Z, \z, Opt, ^, $ */ \
807     2, /* Char - the minimum length */ \
808     2, /* Charnc - the minimum length */ \
809     2, /* not */ \
810     /* Positive single-char repeats ** These are */ \
811     2, 2, 2, 2, 2, 2, /* *, *?, +, +?, ?, ?? ** minima in */ \
812     4, 4, 4, /* upto, minupto, exact ** UTF-8 mode */ \
813 nigel 93 2, 2, 2, 4, /* *+, ++, ?+, upto+ */ \
814 nigel 77 /* Negative single-char repeats - only for chars < 256 */ \
815     2, 2, 2, 2, 2, 2, /* NOT *, *?, +, +?, ?, ?? */ \
816     4, 4, 4, /* NOT upto, minupto, exact */ \
817 nigel 93 2, 2, 2, 4, /* Possessive *, +, ?, upto */ \
818 nigel 77 /* Positive type repeats */ \
819     2, 2, 2, 2, 2, 2, /* Type *, *?, +, +?, ?, ?? */ \
820     4, 4, 4, /* Type upto, minupto, exact */ \
821 nigel 93 2, 2, 2, 4, /* Possessive *+, ++, ?+, upto+ */ \
822 nigel 77 /* Character class & ref repeats */ \
823     1, 1, 1, 1, 1, 1, /* *, *?, +, +?, ?, ?? */ \
824     5, 5, /* CRRANGE, CRMINRANGE */ \
825     33, /* CLASS */ \
826     33, /* NCLASS */ \
827     0, /* XCLASS - variable length */ \
828     3, /* REF */ \
829     1+LINK_SIZE, /* RECURSE */ \
830     2+2*LINK_SIZE, /* CALLOUT */ \
831     1+LINK_SIZE, /* Alt */ \
832     1+LINK_SIZE, /* Ket */ \
833     1+LINK_SIZE, /* KetRmax */ \
834     1+LINK_SIZE, /* KetRmin */ \
835     1+LINK_SIZE, /* Assert */ \
836     1+LINK_SIZE, /* Assert not */ \
837     1+LINK_SIZE, /* Assert behind */ \
838     1+LINK_SIZE, /* Assert behind not */ \
839     1+LINK_SIZE, /* Reverse */ \
840 nigel 93 1+LINK_SIZE, /* ONCE */ \
841     1+LINK_SIZE, /* BRA */ \
842     3+LINK_SIZE, /* CBRA */ \
843 nigel 77 1+LINK_SIZE, /* COND */ \
844 nigel 93 1+LINK_SIZE, /* SBRA */ \
845     3+LINK_SIZE, /* SCBRA */ \
846     1+LINK_SIZE, /* SCOND */ \
847 nigel 77 3, /* CREF */ \
848 nigel 93 3, /* RREF */ \
849     1, /* DEF */ \
850 nigel 77 1, 1, /* BRAZERO, BRAMINZERO */ \
851    
852    
853 nigel 93 /* A magic value for OP_RREF to indicate the "any recursion" condition. */
854 nigel 77
855 nigel 93 #define RREF_ANY 0xffff
856 nigel 77
857     /* Error code numbers. They are given names so that they can more easily be
858     tracked. */
859    
860     enum { ERR0, ERR1, ERR2, ERR3, ERR4, ERR5, ERR6, ERR7, ERR8, ERR9,
861     ERR10, ERR11, ERR12, ERR13, ERR14, ERR15, ERR16, ERR17, ERR18, ERR19,
862     ERR20, ERR21, ERR22, ERR23, ERR24, ERR25, ERR26, ERR27, ERR28, ERR29,
863     ERR30, ERR31, ERR32, ERR33, ERR34, ERR35, ERR36, ERR37, ERR38, ERR39,
864 nigel 91 ERR40, ERR41, ERR42, ERR43, ERR44, ERR45, ERR46, ERR47, ERR48, ERR49,
865 ph10 166 ERR50, ERR51, ERR52, ERR53, ERR54, ERR55, ERR56, ERR57, ERR58 };
866 nigel 77
867     /* The real format of the start of the pcre block; the index of names and the
868     code vector run on as long as necessary after the end. We store an explicit
869     offset to the name table so that if a regex is compiled on one host, saved, and
870     then run on another where the size of pointers is different, all might still
871     be well. For the case of compiled-on-4 and run-on-8, we include an extra
872     pointer that is always NULL. For future-proofing, a few dummy fields were
873     originally included - even though you can never get this planning right - but
874     there is only one left now.
875    
876     NOTE NOTE NOTE:
877     Because people can now save and re-use compiled patterns, any additions to this
878     structure should be made at the end, and something earlier (e.g. a new
879     flag in the options or one of the dummy fields) should indicate that the new
880     fields are present. Currently PCRE always sets the dummy fields to zero.
881     NOTE NOTE NOTE:
882     */
883    
884     typedef struct real_pcre {
885     pcre_uint32 magic_number;
886     pcre_uint32 size; /* Total that was malloced */
887     pcre_uint32 options;
888     pcre_uint32 dummy1; /* For future use, maybe */
889    
890     pcre_uint16 top_bracket;
891     pcre_uint16 top_backref;
892     pcre_uint16 first_byte;
893     pcre_uint16 req_byte;
894     pcre_uint16 name_table_offset; /* Offset to name table that follows */
895     pcre_uint16 name_entry_size; /* Size of any name items */
896     pcre_uint16 name_count; /* Number of name items */
897     pcre_uint16 ref_count; /* Reference count */
898    
899     const unsigned char *tables; /* Pointer to tables or NULL for std */
900     const unsigned char *nullpad; /* NULL padding */
901     } real_pcre;
902    
903     /* The format of the block used to store data from pcre_study(). The same
904     remark (see NOTE above) about extending this structure applies. */
905    
906     typedef struct pcre_study_data {
907     pcre_uint32 size; /* Total that was malloced */
908     pcre_uint32 options;
909     uschar start_bits[32];
910     } pcre_study_data;
911    
912     /* Structure for passing "static" information around between the functions
913     doing the compiling, so that they are thread-safe. */
914    
915     typedef struct compile_data {
916     const uschar *lcc; /* Points to lower casing table */
917     const uschar *fcc; /* Points to case-flipping table */
918     const uschar *cbits; /* Points to character type table */
919     const uschar *ctypes; /* Points to table of type maps */
920 nigel 93 const uschar *start_workspace;/* The start of working space */
921 nigel 77 const uschar *start_code; /* The start of the compiled code */
922     const uschar *start_pattern; /* The start of the pattern */
923 nigel 93 const uschar *end_pattern; /* The end of the pattern */
924     uschar *hwm; /* High watermark of workspace */
925 nigel 77 uschar *name_table; /* The name/number table */
926     int names_found; /* Number of entries so far */
927     int name_entry_size; /* Size of each entry */
928 nigel 93 int bracount; /* Count of capturing parens */
929 nigel 77 int top_backref; /* Maximum back reference */
930     unsigned int backref_map; /* Bitmap of low back refs */
931 nigel 93 int external_options; /* External (initial) options */
932 nigel 77 int req_varyopt; /* "After variable item" flag for reqbyte */
933     BOOL nopartial; /* Set TRUE if partial won't work */
934 nigel 93 int nltype; /* Newline type */
935     int nllen; /* Newline string length */
936     uschar nl[4]; /* Newline string when fixed length */
937 nigel 77 } compile_data;
938    
939     /* Structure for maintaining a chain of pointers to the currently incomplete
940     branches, for testing for left recursion. */
941    
942     typedef struct branch_chain {
943     struct branch_chain *outer;
944     uschar *current;
945     } branch_chain;
946    
947     /* Structure for items in a linked list that represents an explicit recursive
948     call within the pattern. */
949    
950     typedef struct recursion_info {
951     struct recursion_info *prevrec; /* Previous recursion record (or NULL) */
952     int group_num; /* Number of group that was called */
953     const uschar *after_call; /* "Return value": points after the call in the expr */
954 ph10 168 USPTR save_start; /* Old value of mstart */
955 nigel 77 int *offset_save; /* Pointer to start of saved offsets */
956     int saved_max; /* Number of saved offsets */
957     } recursion_info;
958    
959 nigel 93 /* Structure for building a chain of data for holding the values of the subject
960     pointer at the start of each subpattern, so as to detect when an empty string
961     has been matched by a subpattern - to break infinite loops. */
962    
963     typedef struct eptrblock {
964     struct eptrblock *epb_prev;
965     USPTR epb_saved_eptr;
966     } eptrblock;
967    
968    
969 nigel 77 /* Structure for passing "static" information around between the functions
970     doing traditional NFA matching, so that they are thread-safe. */
971    
972     typedef struct match_data {
973 nigel 87 unsigned long int match_call_count; /* As it says */
974     unsigned long int match_limit; /* As it says */
975     unsigned long int match_limit_recursion; /* As it says */
976 nigel 77 int *offset_vector; /* Offset vector */
977     int offset_end; /* One past the end */
978     int offset_max; /* The maximum usable for return data */
979 nigel 93 int nltype; /* Newline type */
980     int nllen; /* Newline string length */
981     uschar nl[4]; /* Newline string when fixed */
982 nigel 77 const uschar *lcc; /* Points to lower casing table */
983     const uschar *ctypes; /* Points to table of type maps */
984     BOOL offset_overflow; /* Set if too many extractions */
985     BOOL notbol; /* NOTBOL flag */
986     BOOL noteol; /* NOTEOL flag */
987     BOOL utf8; /* UTF8 flag */
988     BOOL endonly; /* Dollar not before final \n */
989     BOOL notempty; /* Empty string match not wanted */
990     BOOL partial; /* PARTIAL flag */
991     BOOL hitend; /* Hit the end of the subject at some point */
992     const uschar *start_code; /* For use when recursing */
993 nigel 87 USPTR start_subject; /* Start of the subject string */
994     USPTR end_subject; /* End of the subject string */
995 ph10 168 USPTR start_match_ptr; /* Start of matched string */
996 nigel 87 USPTR end_match_ptr; /* Subject position at end match */
997 nigel 77 int end_offset_top; /* Highwater mark at end of match */
998     int capture_last; /* Most recent capture number */
999     int start_offset; /* The start offset value */
1000 nigel 93 eptrblock *eptrchain; /* Chain of eptrblocks for tail recursions */
1001     int eptrn; /* Next free eptrblock */
1002 nigel 77 recursion_info *recursive; /* Linked list of recursion data */
1003     void *callout_data; /* To pass back to callouts */
1004     } match_data;
1005    
1006     /* A similar structure is used for the same purpose by the DFA matching
1007     functions. */
1008    
1009     typedef struct dfa_match_data {
1010     const uschar *start_code; /* Start of the compiled pattern */
1011     const uschar *start_subject; /* Start of the subject string */
1012     const uschar *end_subject; /* End of subject string */
1013     const uschar *tables; /* Character tables */
1014     int moptions; /* Match options */
1015     int poptions; /* Pattern options */
1016 nigel 93 int nltype; /* Newline type */
1017     int nllen; /* Newline string length */
1018     uschar nl[4]; /* Newline string when fixed */
1019 nigel 77 void *callout_data; /* To pass back to callouts */
1020     } dfa_match_data;
1021    
1022     /* Bit definitions for entries in the pcre_ctypes table. */
1023    
1024     #define ctype_space 0x01
1025     #define ctype_letter 0x02
1026     #define ctype_digit 0x04
1027     #define ctype_xdigit 0x08
1028     #define ctype_word 0x10 /* alphameric or '_' */
1029     #define ctype_meta 0x80 /* regexp meta char or zero (end pattern) */
1030    
1031     /* Offsets for the bitmap tables in pcre_cbits. Each table contains a set
1032     of bits for a class map. Some classes are built by combining these tables. */
1033    
1034     #define cbit_space 0 /* [:space:] or \s */
1035     #define cbit_xdigit 32 /* [:xdigit:] */
1036     #define cbit_digit 64 /* [:digit:] or \d */
1037     #define cbit_upper 96 /* [:upper:] */
1038     #define cbit_lower 128 /* [:lower:] */
1039     #define cbit_word 160 /* [:word:] or \w */
1040     #define cbit_graph 192 /* [:graph:] */
1041     #define cbit_print 224 /* [:print:] */
1042     #define cbit_punct 256 /* [:punct:] */
1043     #define cbit_cntrl 288 /* [:cntrl:] */
1044     #define cbit_length 320 /* Length of the cbits table */
1045    
1046     /* Offsets of the various tables from the base tables pointer, and
1047     total length. */
1048    
1049     #define lcc_offset 0
1050     #define fcc_offset 256
1051     #define cbits_offset 512
1052     #define ctypes_offset (cbits_offset + cbit_length)
1053     #define tables_length (ctypes_offset + 256)
1054    
1055 nigel 87 /* Layout of the UCP type table that translates property names into types and
1056     codes. */
1057 nigel 77
1058     typedef struct {
1059     const char *name;
1060 nigel 87 pcre_uint16 type;
1061     pcre_uint16 value;
1062 nigel 77 } ucp_type_table;
1063    
1064    
1065     /* Internal shared data tables. These are tables that are used by more than one
1066     of the exported public functions. They have to be "external" in the C sense,
1067     but are not part of the PCRE public API. The data for these tables is in the
1068     pcre_tables.c module. */
1069    
1070     extern const int _pcre_utf8_table1[];
1071     extern const int _pcre_utf8_table2[];
1072     extern const int _pcre_utf8_table3[];
1073     extern const uschar _pcre_utf8_table4[];
1074    
1075     extern const int _pcre_utf8_table1_size;
1076    
1077     extern const ucp_type_table _pcre_utt[];
1078     extern const int _pcre_utt_size;
1079    
1080     extern const uschar _pcre_default_tables[];
1081    
1082     extern const uschar _pcre_OP_lengths[];
1083    
1084    
1085     /* Internal shared functions. These are functions that are used by more than
1086     one of the exported public functions. They have to be "external" in the C
1087     sense, but are not part of the PCRE public API. */
1088    
1089 ph10 150 extern BOOL _pcre_is_newline(const uschar *, int, const uschar *,
1090 ph10 149 int *, BOOL);
1091 nigel 93 extern int _pcre_ord2utf8(int, uschar *);
1092     extern real_pcre *_pcre_try_flipped(const real_pcre *, real_pcre *,
1093     const pcre_study_data *, pcre_study_data *);
1094     extern int _pcre_ucp_findprop(const unsigned int, int *, int *);
1095     extern unsigned int _pcre_ucp_othercase(const unsigned int);
1096     extern int _pcre_valid_utf8(const uschar *, int);
1097 ph10 150 extern BOOL _pcre_was_newline(const uschar *, int, const uschar *,
1098 ph10 149 int *, BOOL);
1099 nigel 93 extern BOOL _pcre_xclass(int, const uschar *);
1100 nigel 77
1101 nigel 85 #endif
1102    
1103 nigel 77 /* End of pcre_internal.h */

Properties

Name Value
svn:eol-style native
svn:keywords "Author Date Id Revision Url"

webmaster@exim.org
ViewVC Help
Powered by ViewVC 1.1.12