source: project/release/3/regex-extras/trunk/pcre_internal.h @ 9129

Last change on this file since 9129 was 9129, checked in by Kon Lovett, 12 years ago

Update for PCRE 7.6

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