/[pcre]/code/trunk/pcre_compile.c
ViewVC logotype

Diff of /code/trunk/pcre_compile.c

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 964 by ph10, Fri May 4 13:03:39 2012 UTC revision 1415 by zherczeg, Sun Dec 22 20:47:08 2013 UTC
# Line 6  Line 6 
6  and semantics are as close as possible to those of the Perl 5 language.  and semantics are as close as possible to those of the Perl 5 language.
7    
8                         Written by Philip Hazel                         Written by Philip Hazel
9             Copyright (c) 1997-2012 University of Cambridge             Copyright (c) 1997-2013 University of Cambridge
10    
11  -----------------------------------------------------------------------------  -----------------------------------------------------------------------------
12  Redistribution and use in source and binary forms, with or without  Redistribution and use in source and binary forms, with or without
# Line 53  supporting internal functions that are n Line 53  supporting internal functions that are n
53  #include "pcre_internal.h"  #include "pcre_internal.h"
54    
55    
56  /* When PCRE_DEBUG is defined, we need the pcre(16)_printint() function, which  /* When PCRE_DEBUG is defined, we need the pcre(16|32)_printint() function, which
57  is also used by pcretest. PCRE_DEBUG is not defined when building a production  is also used by pcretest. PCRE_DEBUG is not defined when building a production
58  library. We do not need to select pcre16_printint.c specially, because the  library. We do not need to select pcre16_printint.c specially, because the
59  COMPILE_PCREx macro will already be appropriately set. */  COMPILE_PCREx macro will already be appropriately set. */
# Line 68  COMPILE_PCREx macro will already be appr Line 68  COMPILE_PCREx macro will already be appr
68    
69  /* Macro for setting individual bits in class bitmaps. */  /* Macro for setting individual bits in class bitmaps. */
70    
71  #define SETBIT(a,b) a[b/8] |= (1 << (b%8))  #define SETBIT(a,b) a[(b)/8] |= (1 << ((b)&7))
72    
73  /* Maximum length value to check against when making sure that the integer that  /* Maximum length value to check against when making sure that the integer that
74  holds the compiled pattern length does not overflow. We make it a bit less than  holds the compiled pattern length does not overflow. We make it a bit less than
# Line 77  to check them every time. */ Line 77  to check them every time. */
77    
78  #define OFLOW_MAX (INT_MAX - 20)  #define OFLOW_MAX (INT_MAX - 20)
79    
80    /* Definitions to allow mutual recursion */
81    
82    static int
83      add_list_to_class(pcre_uint8 *, pcre_uchar **, int, compile_data *,
84        const pcre_uint32 *, unsigned int);
85    
86    static BOOL
87      compile_regex(int, pcre_uchar **, const pcre_uchar **, int *, BOOL, BOOL, int, int,
88        pcre_uint32 *, pcre_int32 *, pcre_uint32 *, pcre_int32 *, branch_chain *,
89        compile_data *, int *);
90    
91    
92    
93  /*************************************************  /*************************************************
94  *      Code parameters and static tables         *  *      Code parameters and static tables         *
# Line 103  kicks in at the same number of forward r Line 115  kicks in at the same number of forward r
115  #define COMPILE_WORK_SIZE (2048*LINK_SIZE)  #define COMPILE_WORK_SIZE (2048*LINK_SIZE)
116  #define COMPILE_WORK_SIZE_MAX (100*COMPILE_WORK_SIZE)  #define COMPILE_WORK_SIZE_MAX (100*COMPILE_WORK_SIZE)
117    
118    /* This value determines the size of the initial vector that is used for
119    remembering named groups during the pre-compile. It is allocated on the stack,
120    but if it is too small, it is expanded using malloc(), in a similar way to the
121    workspace. The value is the number of slots in the list. */
122    
123    #define NAMED_GROUP_LIST_SIZE  20
124    
125  /* The overrun tests check for a slightly smaller size so that they detect the  /* The overrun tests check for a slightly smaller size so that they detect the
126  overrun before it actually does run off the end of the data block. */  overrun before it actually does run off the end of the data block. */
127    
# Line 110  overrun before it actually does run off Line 129  overrun before it actually does run off
129    
130  /* Private flags added to firstchar and reqchar. */  /* Private flags added to firstchar and reqchar. */
131    
132  #define REQ_CASELESS   0x10000000l      /* Indicates caselessness */  #define REQ_CASELESS    (1 << 0)        /* Indicates caselessness */
133  #define REQ_VARY       0x20000000l      /* Reqchar followed non-literal item */  #define REQ_VARY        (1 << 1)        /* Reqchar followed non-literal item */
134    /* Negative values for the firstchar and reqchar flags */
135    #define REQ_UNSET       (-2)
136    #define REQ_NONE        (-1)
137    
138  /* Repeated character flags. */  /* Repeated character flags. */
139    
# Line 238  static const verbitem verbs[] = { Line 260  static const verbitem verbs[] = {
260  static const int verbcount = sizeof(verbs)/sizeof(verbitem);  static const int verbcount = sizeof(verbs)/sizeof(verbitem);
261    
262    
263    /* Substitutes for [[:<:]] and [[:>:]], which mean start and end of word in
264    another regex library. */
265    
266    static const pcre_uchar sub_start_of_word[] = {
267      CHAR_BACKSLASH, CHAR_b, CHAR_LEFT_PARENTHESIS, CHAR_QUESTION_MARK,
268      CHAR_EQUALS_SIGN, CHAR_BACKSLASH, CHAR_w, CHAR_RIGHT_PARENTHESIS, '\0' };
269    
270    static const pcre_uchar sub_end_of_word[] = {
271      CHAR_BACKSLASH, CHAR_b, CHAR_LEFT_PARENTHESIS, CHAR_QUESTION_MARK,
272      CHAR_LESS_THAN_SIGN, CHAR_EQUALS_SIGN, CHAR_BACKSLASH, CHAR_w,
273      CHAR_RIGHT_PARENTHESIS, '\0' };
274    
275    
276  /* Tables of names of POSIX character classes and their lengths. The names are  /* Tables of names of POSIX character classes and their lengths. The names are
277  now all in a single string, to reduce the number of relocations when a shared  now all in a single string, to reduce the number of relocations when a shared
278  library is dynamically loaded. The list of lengths is terminated by a zero  library is dynamically loaded. The list of lengths is terminated by a zero
279  length entry. The first three must be alpha, lower, upper, as this is assumed  length entry. The first three must be alpha, lower, upper, as this is assumed
280  for handling case independence. */  for handling case independence. The indices for graph, print, and punct are
281    needed, so identify them. */
282    
283  static const char posix_names[] =  static const char posix_names[] =
284    STRING_alpha0 STRING_lower0 STRING_upper0 STRING_alnum0    STRING_alpha0 STRING_lower0 STRING_upper0 STRING_alnum0
# Line 253  static const char posix_names[] = Line 289  static const char posix_names[] =
289  static const pcre_uint8 posix_name_lengths[] = {  static const pcre_uint8 posix_name_lengths[] = {
290    5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 6, 0 };    5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 6, 0 };
291    
292    #define PC_GRAPH  8
293    #define PC_PRINT  9
294    #define PC_PUNCT 10
295    
296    
297  /* Table of class bit maps for each POSIX class. Each class is formed from a  /* Table of class bit maps for each POSIX class. Each class is formed from a
298  base map, with an optional addition or removal of another map. Then, for some  base map, with an optional addition or removal of another map. Then, for some
299  classes, there is some additional tweaking: for [:blank:] the vertical space  classes, there is some additional tweaking: for [:blank:] the vertical space
# Line 280  static const int posix_class_maps[] = { Line 321  static const int posix_class_maps[] = {
321    cbit_xdigit,-1,          0              /* xdigit */    cbit_xdigit,-1,          0              /* xdigit */
322  };  };
323    
324  /* Table of substitutes for \d etc when PCRE_UCP is set. The POSIX class  /* Table of substitutes for \d etc when PCRE_UCP is set. They are replaced by
325  substitutes must be in the order of the names, defined above, and there are  Unicode property escapes. */
 both positive and negative cases. NULL means no substitute. */  
326    
327  #ifdef SUPPORT_UCP  #ifdef SUPPORT_UCP
328  static const pcre_uchar string_PNd[]  = {  static const pcre_uchar string_PNd[]  = {
# Line 307  static const pcre_uchar string_pXwd[] = Line 347  static const pcre_uchar string_pXwd[] =
347  static const pcre_uchar *substitutes[] = {  static const pcre_uchar *substitutes[] = {
348    string_PNd,           /* \D */    string_PNd,           /* \D */
349    string_pNd,           /* \d */    string_pNd,           /* \d */
350    string_PXsp,          /* \S */       /* NOTE: Xsp is Perl space */    string_PXsp,          /* \S */   /* Xsp is Perl space, but from 8.34, Perl */
351    string_pXsp,          /* \s */    string_pXsp,          /* \s */   /* space and POSIX space are the same. */
352    string_PXwd,          /* \W */    string_PXwd,          /* \W */
353    string_pXwd           /* \w */    string_pXwd           /* \w */
354  };  };
355    
356    /* The POSIX class substitutes must be in the order of the POSIX class names,
357    defined above, and there are both positive and negative cases. NULL means no
358    general substitute of a Unicode property escape (\p or \P). However, for some
359    POSIX classes (e.g. graph, print, punct) a special property code is compiled
360    directly. */
361    
362  static const pcre_uchar string_pL[] =   {  static const pcre_uchar string_pL[] =   {
363    CHAR_BACKSLASH, CHAR_p, CHAR_LEFT_CURLY_BRACKET,    CHAR_BACKSLASH, CHAR_p, CHAR_LEFT_CURLY_BRACKET,
364    CHAR_L, CHAR_RIGHT_CURLY_BRACKET, '\0' };    CHAR_L, CHAR_RIGHT_CURLY_BRACKET, '\0' };
# Line 360  static const pcre_uchar *posix_substitut Line 406  static const pcre_uchar *posix_substitut
406    NULL,                 /* graph */    NULL,                 /* graph */
407    NULL,                 /* print */    NULL,                 /* print */
408    NULL,                 /* punct */    NULL,                 /* punct */
409    string_pXps,          /* space */    /* NOTE: Xps is POSIX space */    string_pXps,          /* space */   /* Xps is POSIX space, but from 8.34 */
410    string_pXwd,          /* word */    string_pXwd,          /* word  */   /* Perl and POSIX space are the same */
411    NULL,                 /* xdigit */    NULL,                 /* xdigit */
412    /* Negated cases */    /* Negated cases */
413    string_PL,            /* ^alpha */    string_PL,            /* ^alpha */
# Line 375  static const pcre_uchar *posix_substitut Line 421  static const pcre_uchar *posix_substitut
421    NULL,                 /* ^graph */    NULL,                 /* ^graph */
422    NULL,                 /* ^print */    NULL,                 /* ^print */
423    NULL,                 /* ^punct */    NULL,                 /* ^punct */
424    string_PXps,          /* ^space */   /* NOTE: Xps is POSIX space */    string_PXps,          /* ^space */  /* Xps is POSIX space, but from 8.34 */
425    string_PXwd,          /* ^word */    string_PXwd,          /* ^word */   /* Perl and POSIX space are the same */
426    NULL                  /* ^xdigit */    NULL                  /* ^xdigit */
427  };  };
428  #define POSIX_SUBSIZE (sizeof(posix_substitutes) / sizeof(pcre_uchar *))  #define POSIX_SUBSIZE (sizeof(posix_substitutes) / sizeof(pcre_uchar *))
# Line 440  static const char error_texts[] = Line 486  static const char error_texts[] =
486    "POSIX collating elements are not supported\0"    "POSIX collating elements are not supported\0"
487    "this version of PCRE is compiled without UTF support\0"    "this version of PCRE is compiled without UTF support\0"
488    "spare error\0"  /** DEAD **/    "spare error\0"  /** DEAD **/
489    "character value in \\x{...} sequence is too large\0"    "character value in \\x{} or \\o{} is too large\0"
490    /* 35 */    /* 35 */
491    "invalid condition (?(0)\0"    "invalid condition (?(0)\0"
492    "\\C not allowed in lookbehind assertion\0"    "\\C not allowed in lookbehind assertion\0"
# Line 472  static const char error_texts[] = Line 518  static const char error_texts[] =
518    "a numbered reference must not be zero\0"    "a numbered reference must not be zero\0"
519    "an argument is not allowed for (*ACCEPT), (*FAIL), or (*COMMIT)\0"    "an argument is not allowed for (*ACCEPT), (*FAIL), or (*COMMIT)\0"
520    /* 60 */    /* 60 */
521    "(*VERB) not recognized\0"    "(*VERB) not recognized or malformed\0"
522    "number is too big\0"    "number is too big\0"
523    "subpattern name expected\0"    "subpattern name expected\0"
524    "digit expected after (?+\0"    "digit expected after (?+\0"
# Line 490  static const char error_texts[] = Line 536  static const char error_texts[] =
536    "disallowed Unicode code point (>= 0xd800 && <= 0xdfff)\0"    "disallowed Unicode code point (>= 0xd800 && <= 0xdfff)\0"
537    "invalid UTF-16 string\0"    "invalid UTF-16 string\0"
538    /* 75 */    /* 75 */
539    "name is too long in (*MARK), (*PRUNE), (*SKIP), or (*THEN)\0"    "name is too long in (*MARK), (*PRUNE), (*SKIP), or (*THEN)\0"
540      "character value in \\u.... sequence is too large\0"
541      "invalid UTF-32 string\0"
542      "setting UTF is disabled by the application\0"
543      "non-hex character in \\x{} (closing brace missing?)\0"
544      /* 80 */
545      "non-octal character in \\o{} (closing brace missing?)\0"
546      "missing opening brace after \\o\0"
547      "parentheses are too deeply nested\0"
548      "invalid range in character class\0"
549      "group name must start with a non-digit\0"
550    ;    ;
551    
552  /* Table to identify digits and hex digits. This is used when compiling  /* Table to identify digits and hex digits. This is used when compiling
# Line 630  static const pcre_uint8 ebcdic_chartab[] Line 686  static const pcre_uint8 ebcdic_chartab[]
686  #endif  #endif
687    
688    
689  /* Definition to allow mutual recursion */  /* This table is used to check whether auto-possessification is possible
690    between adjacent character-type opcodes. The left-hand (repeated) opcode is
691    used to select the row, and the right-hand opcode is use to select the column.
692    A value of 1 means that auto-possessification is OK. For example, the second
693    value in the first row means that \D+\d can be turned into \D++\d.
694    
695    The Unicode property types (\P and \p) have to be present to fill out the table
696    because of what their opcode values are, but the table values should always be
697    zero because property types are handled separately in the code. The last four
698    columns apply to items that cannot be repeated, so there is no need to have
699    rows for them. Note that OP_DIGIT etc. are generated only when PCRE_UCP is
700    *not* set. When it is set, \d etc. are converted into OP_(NOT_)PROP codes. */
701    
702    #define APTROWS (LAST_AUTOTAB_LEFT_OP - FIRST_AUTOTAB_OP + 1)
703    #define APTCOLS (LAST_AUTOTAB_RIGHT_OP - FIRST_AUTOTAB_OP + 1)
704    
705    static const pcre_uint8 autoposstab[APTROWS][APTCOLS] = {
706    /* \D \d \S \s \W \w  . .+ \C \P \p \R \H \h \V \v \X \Z \z  $ $M */
707      { 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0 },  /* \D */
708      { 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1 },  /* \d */
709      { 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1 },  /* \S */
710      { 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0 },  /* \s */
711      { 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0 },  /* \W */
712      { 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1 },  /* \w */
713      { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0 },  /* .  */
714      { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0 },  /* .+ */
715      { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0 },  /* \C */
716      { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },  /* \P */
717      { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },  /* \p */
718      { 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0 },  /* \R */
719      { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0 },  /* \H */
720      { 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0 },  /* \h */
721      { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0 },  /* \V */
722      { 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0 },  /* \v */
723      { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0 }   /* \X */
724    };
725    
726    
727  static BOOL  /* This table is used to check whether auto-possessification is possible
728    compile_regex(int, pcre_uchar **, const pcre_uchar **, int *, BOOL, BOOL, int, int,  between adjacent Unicode property opcodes (OP_PROP and OP_NOTPROP). The
729      int *, int *, branch_chain *, compile_data *, int *);  left-hand (repeated) opcode is used to select the row, and the right-hand
730    opcode is used to select the column. The values are as follows:
731    
732      0   Always return FALSE (never auto-possessify)
733      1   Character groups are distinct (possessify if both are OP_PROP)
734      2   Check character categories in the same group (general or particular)
735      3   TRUE if the two opcodes are not the same (PROP vs NOTPROP)
736    
737      4   Check left general category vs right particular category
738      5   Check right general category vs left particular category
739    
740      6   Left alphanum vs right general category
741      7   Left space vs right general category
742      8   Left word vs right general category
743    
744      9   Right alphanum vs left general category
745     10   Right space vs left general category
746     11   Right word vs left general category
747    
748     12   Left alphanum vs right particular category
749     13   Left space vs right particular category
750     14   Left word vs right particular category
751    
752     15   Right alphanum vs left particular category
753     16   Right space vs left particular category
754     17   Right word vs left particular category
755    */
756    
757    static const pcre_uint8 propposstab[PT_TABSIZE][PT_TABSIZE] = {
758    /* ANY LAMP GC  PC  SC ALNUM SPACE PXSPACE WORD CLIST UCNC */
759      { 0,  0,  0,  0,  0,    0,    0,      0,   0,    0,   0 },  /* PT_ANY */
760      { 0,  3,  0,  0,  0,    3,    1,      1,   0,    0,   0 },  /* PT_LAMP */
761      { 0,  0,  2,  4,  0,    9,   10,     10,  11,    0,   0 },  /* PT_GC */
762      { 0,  0,  5,  2,  0,   15,   16,     16,  17,    0,   0 },  /* PT_PC */
763      { 0,  0,  0,  0,  2,    0,    0,      0,   0,    0,   0 },  /* PT_SC */
764      { 0,  3,  6, 12,  0,    3,    1,      1,   0,    0,   0 },  /* PT_ALNUM */
765      { 0,  1,  7, 13,  0,    1,    3,      3,   1,    0,   0 },  /* PT_SPACE */
766      { 0,  1,  7, 13,  0,    1,    3,      3,   1,    0,   0 },  /* PT_PXSPACE */
767      { 0,  0,  8, 14,  0,    0,    1,      1,   3,    0,   0 },  /* PT_WORD */
768      { 0,  0,  0,  0,  0,    0,    0,      0,   0,    0,   0 },  /* PT_CLIST */
769      { 0,  0,  0,  0,  0,    0,    0,      0,   0,    0,   3 }   /* PT_UCNC */
770    };
771    
772    /* This table is used to check whether auto-possessification is possible
773    between adjacent Unicode property opcodes (OP_PROP and OP_NOTPROP) when one
774    specifies a general category and the other specifies a particular category. The
775    row is selected by the general category and the column by the particular
776    category. The value is 1 if the particular category is not part of the general
777    category. */
778    
779    static const pcre_uint8 catposstab[7][30] = {
780    /* Cc Cf Cn Co Cs Ll Lm Lo Lt Lu Mc Me Mn Nd Nl No Pc Pd Pe Pf Pi Po Ps Sc Sk Sm So Zl Zp Zs */
781      { 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 },  /* C */
782      { 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 },  /* L */
783      { 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 },  /* M */
784      { 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 },  /* N */
785      { 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1 },  /* P */
786      { 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1 },  /* S */
787      { 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0 }   /* Z */
788    };
789    
790    /* This table is used when checking ALNUM, (PX)SPACE, SPACE, and WORD against
791    a general or particular category. The properties in each row are those
792    that apply to the character set in question. Duplication means that a little
793    unnecessary work is done when checking, but this keeps things much simpler
794    because they can all use the same code. For more details see the comment where
795    this table is used.
796    
797    Note: SPACE and PXSPACE used to be different because Perl excluded VT from
798    "space", but from Perl 5.18 it's included, so both categories are treated the
799    same here. */
800    
801    static const pcre_uint8 posspropstab[3][4] = {
802      { ucp_L, ucp_N, ucp_N, ucp_Nl },  /* ALNUM, 3rd and 4th values redundant */
803      { ucp_Z, ucp_Z, ucp_C, ucp_Cc },  /* SPACE and PXSPACE, 2nd value redundant */
804      { ucp_L, ucp_N, ucp_P, ucp_Po }   /* WORD */
805    };
806    
807    /* This table is used when converting repeating opcodes into possessified
808    versions as a result of an explicit possessive quantifier such as ++. A zero
809    value means there is no possessified version - in those cases the item in
810    question must be wrapped in ONCE brackets. The table is truncated at OP_CALLOUT
811    because all relevant opcodes are less than that. */
812    
813    static const pcre_uint8 opcode_possessify[] = {
814      0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,   /* 0 - 15  */
815      0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,   /* 16 - 31 */
816    
817      0,                       /* NOTI */
818      OP_POSSTAR, 0,           /* STAR, MINSTAR */
819      OP_POSPLUS, 0,           /* PLUS, MINPLUS */
820      OP_POSQUERY, 0,          /* QUERY, MINQUERY */
821      OP_POSUPTO, 0,           /* UPTO, MINUPTO */
822      0,                       /* EXACT */
823      0, 0, 0, 0,              /* POS{STAR,PLUS,QUERY,UPTO} */
824    
825      OP_POSSTARI, 0,          /* STARI, MINSTARI */
826      OP_POSPLUSI, 0,          /* PLUSI, MINPLUSI */
827      OP_POSQUERYI, 0,         /* QUERYI, MINQUERYI */
828      OP_POSUPTOI, 0,          /* UPTOI, MINUPTOI */
829      0,                       /* EXACTI */
830      0, 0, 0, 0,              /* POS{STARI,PLUSI,QUERYI,UPTOI} */
831    
832      OP_NOTPOSSTAR, 0,        /* NOTSTAR, NOTMINSTAR */
833      OP_NOTPOSPLUS, 0,        /* NOTPLUS, NOTMINPLUS */
834      OP_NOTPOSQUERY, 0,       /* NOTQUERY, NOTMINQUERY */
835      OP_NOTPOSUPTO, 0,        /* NOTUPTO, NOTMINUPTO */
836      0,                       /* NOTEXACT */
837      0, 0, 0, 0,              /* NOTPOS{STAR,PLUS,QUERY,UPTO} */
838    
839      OP_NOTPOSSTARI, 0,       /* NOTSTARI, NOTMINSTARI */
840      OP_NOTPOSPLUSI, 0,       /* NOTPLUSI, NOTMINPLUSI */
841      OP_NOTPOSQUERYI, 0,      /* NOTQUERYI, NOTMINQUERYI */
842      OP_NOTPOSUPTOI, 0,       /* NOTUPTOI, NOTMINUPTOI */
843      0,                       /* NOTEXACTI */
844      0, 0, 0, 0,              /* NOTPOS{STARI,PLUSI,QUERYI,UPTOI} */
845    
846      OP_TYPEPOSSTAR, 0,       /* TYPESTAR, TYPEMINSTAR */
847      OP_TYPEPOSPLUS, 0,       /* TYPEPLUS, TYPEMINPLUS */
848      OP_TYPEPOSQUERY, 0,      /* TYPEQUERY, TYPEMINQUERY */
849      OP_TYPEPOSUPTO, 0,       /* TYPEUPTO, TYPEMINUPTO */
850      0,                       /* TYPEEXACT */
851      0, 0, 0, 0,              /* TYPEPOS{STAR,PLUS,QUERY,UPTO} */
852    
853      OP_CRPOSSTAR, 0,         /* CRSTAR, CRMINSTAR */
854      OP_CRPOSPLUS, 0,         /* CRPLUS, CRMINPLUS */
855      OP_CRPOSQUERY, 0,        /* CRQUERY, CRMINQUERY */
856      OP_CRPOSRANGE, 0,        /* CRRANGE, CRMINRANGE */
857      0, 0, 0, 0,              /* CRPOS{STAR,PLUS,QUERY,RANGE} */
858    
859      0, 0, 0,                 /* CLASS, NCLASS, XCLASS */
860      0, 0,                    /* REF, REFI */
861      0, 0,                    /* DNREF, DNREFI */
862      0, 0                     /* RECURSE, CALLOUT */
863    };
864    
865    
866    
# Line 657  find_error_text(int n) Line 883  find_error_text(int n)
883  const char *s = error_texts;  const char *s = error_texts;
884  for (; n > 0; n--)  for (; n > 0; n--)
885    {    {
886    while (*s++ != 0) {};    while (*s++ != CHAR_NULL) {};
887    if (*s == 0) return "Error text not found (please report)";    if (*s == CHAR_NULL) return "Error text not found (please report)";
888    }    }
889  return s;  return s;
890  }  }
891    
892    
893    
894  /*************************************************  /*************************************************
895  *           Expand the workspace                 *  *           Expand the workspace                 *
896  *************************************************/  *************************************************/
# Line 741  return (*p == CHAR_RIGHT_CURLY_BRACKET); Line 968  return (*p == CHAR_RIGHT_CURLY_BRACKET);
968  *************************************************/  *************************************************/
969    
970  /* This function is called when a \ has been encountered. It either returns a  /* This function is called when a \ has been encountered. It either returns a
971  positive value for a simple escape such as \n, or a negative value which  positive value for a simple escape such as \n, or 0 for a data character which
972  encodes one of the more complicated things such as \d. A backreference to group  will be placed in chptr. A backreference to group n is returned as negative n.
973  n is returned as -(ESC_REF + n); ESC_REF is the highest ESC_xxx macro. When  When UTF-8 is enabled, a positive value greater than 255 may be returned in
974  UTF-8 is enabled, a positive value greater than 255 may be returned. On entry,  chptr. On entry, ptr is pointing at the \. On exit, it is on the final
975  ptr is pointing at the \. On exit, it is on the final character of the escape  character of the escape sequence.
 sequence.  
976    
977  Arguments:  Arguments:
978    ptrptr         points to the pattern position pointer    ptrptr         points to the pattern position pointer
979      chptr          points to a returned data character
980    errorcodeptr   points to the errorcode variable    errorcodeptr   points to the errorcode variable
981    bracount       number of previous extracting brackets    bracount       number of previous extracting brackets
982    options        the options bits    options        the options bits
983    isclass        TRUE if inside a character class    isclass        TRUE if inside a character class
984    
985  Returns:         zero or positive => a data character  Returns:         zero => a data character
986                   negative => a special escape sequence                   positive => a special escape sequence
987                     negative => a back reference
988                   on error, errorcodeptr is set                   on error, errorcodeptr is set
989  */  */
990    
991  static int  static int
992  check_escape(const pcre_uchar **ptrptr, int *errorcodeptr, int bracount,  check_escape(const pcre_uchar **ptrptr, pcre_uint32 *chptr, int *errorcodeptr,
993    int options, BOOL isclass)    int bracount, int options, BOOL isclass)
994  {  {
995  /* PCRE_UTF16 has the same value as PCRE_UTF8. */  /* PCRE_UTF16 has the same value as PCRE_UTF8. */
996  BOOL utf = (options & PCRE_UTF8) != 0;  BOOL utf = (options & PCRE_UTF8) != 0;
997  const pcre_uchar *ptr = *ptrptr + 1;  const pcre_uchar *ptr = *ptrptr + 1;
998  pcre_int32 c;  pcre_uint32 c;
999    int escape = 0;
1000  int i;  int i;
1001    
1002  GETCHARINCTEST(c, ptr);           /* Get character value, increment pointer */  GETCHARINCTEST(c, ptr);           /* Get character value, increment pointer */
# Line 775  ptr--;                            /* Set Line 1004  ptr--;                            /* Set
1004    
1005  /* If backslash is at the end of the pattern, it's an error. */  /* If backslash is at the end of the pattern, it's an error. */
1006    
1007  if (c == 0) *errorcodeptr = ERR1;  if (c == CHAR_NULL) *errorcodeptr = ERR1;
1008    
1009  /* Non-alphanumerics are literals. For digits or letters, do an initial lookup  /* Non-alphanumerics are literals. For digits or letters, do an initial lookup
1010  in a table. A non-zero result is something that can be returned immediately.  in a table. A non-zero result is something that can be returned immediately.
# Line 784  Otherwise further processing may be requ Line 1013  Otherwise further processing may be requ
1013  #ifndef EBCDIC  /* ASCII/UTF-8 coding */  #ifndef EBCDIC  /* ASCII/UTF-8 coding */
1014  /* Not alphanumeric */  /* Not alphanumeric */
1015  else if (c < CHAR_0 || c > CHAR_z) {}  else if (c < CHAR_0 || c > CHAR_z) {}
1016  else if ((i = escapes[c - CHAR_0]) != 0) c = i;  else if ((i = escapes[c - CHAR_0]) != 0)
1017      { if (i > 0) c = (pcre_uint32)i; else escape = -i; }
1018    
1019  #else           /* EBCDIC coding */  #else           /* EBCDIC coding */
1020  /* Not alphanumeric */  /* Not alphanumeric */
1021  else if (c < 'a' || (!MAX_255(c) || (ebcdic_chartab[c] & 0x0E) == 0)) {}  else if (c < CHAR_a || (!MAX_255(c) || (ebcdic_chartab[c] & 0x0E) == 0)) {}
1022  else if ((i = escapes[c - 0x48]) != 0)  c = i;  else if ((i = escapes[c - 0x48]) != 0)  { if (i > 0) c = (pcre_uint32)i; else escape = -i; }
1023  #endif  #endif
1024    
1025  /* Escapes that need further processing, or are illegal. */  /* Escapes that need further processing, or are illegal. */
# Line 797  else if ((i = escapes[c - 0x48]) != 0) Line 1027  else if ((i = escapes[c - 0x48]) != 0)
1027  else  else
1028    {    {
1029    const pcre_uchar *oldptr;    const pcre_uchar *oldptr;
1030    BOOL braced, negated;    BOOL braced, negated, overflow;
1031      int s;
1032    
1033    switch (c)    switch (c)
1034      {      {
# Line 822  else Line 1053  else
1053          c = 0;          c = 0;
1054          for (i = 0; i < 4; ++i)          for (i = 0; i < 4; ++i)
1055            {            {
1056            register int cc = *(++ptr);            register pcre_uint32 cc = *(++ptr);
1057  #ifndef EBCDIC  /* ASCII/UTF-8 coding */  #ifndef EBCDIC  /* ASCII/UTF-8 coding */
1058            if (cc >= CHAR_a) cc -= 32;               /* Convert to upper case */            if (cc >= CHAR_a) cc -= 32;               /* Convert to upper case */
1059            c = (c << 4) + cc - ((cc < CHAR_A)? CHAR_0 : (CHAR_A - 10));            c = (c << 4) + cc - ((cc < CHAR_A)? CHAR_0 : (CHAR_A - 10));
# Line 831  else Line 1062  else
1062            c = (c << 4) + cc - ((cc >= CHAR_0)? CHAR_0 : (CHAR_A - 10));            c = (c << 4) + cc - ((cc >= CHAR_0)? CHAR_0 : (CHAR_A - 10));
1063  #endif  #endif
1064            }            }
1065    
1066    #if defined COMPILE_PCRE8
1067            if (c > (utf ? 0x10ffffU : 0xffU))
1068    #elif defined COMPILE_PCRE16
1069            if (c > (utf ? 0x10ffffU : 0xffffU))
1070    #elif defined COMPILE_PCRE32
1071            if (utf && c > 0x10ffffU)
1072    #endif
1073              {
1074              *errorcodeptr = ERR76;
1075              }
1076            else if (utf && c >= 0xd800 && c <= 0xdfff) *errorcodeptr = ERR73;
1077          }          }
1078        }        }
1079      else      else
# Line 857  else Line 1100  else
1100      (3) For Oniguruma compatibility we also support \g followed by a name or a      (3) For Oniguruma compatibility we also support \g followed by a name or a
1101      number either in angle brackets or in single quotes. However, these are      number either in angle brackets or in single quotes. However, these are
1102      (possibly recursive) subroutine calls, _not_ backreferences. Just return      (possibly recursive) subroutine calls, _not_ backreferences. Just return
1103      the -ESC_g code (cf \k). */      the ESC_g code (cf \k). */
1104    
1105      case CHAR_g:      case CHAR_g:
1106      if (isclass) break;      if (isclass) break;
1107      if (ptr[1] == CHAR_LESS_THAN_SIGN || ptr[1] == CHAR_APOSTROPHE)      if (ptr[1] == CHAR_LESS_THAN_SIGN || ptr[1] == CHAR_APOSTROPHE)
1108        {        {
1109        c = -ESC_g;        escape = ESC_g;
1110        break;        break;
1111        }        }
1112    
# Line 872  else Line 1115  else
1115      if (ptr[1] == CHAR_LEFT_CURLY_BRACKET)      if (ptr[1] == CHAR_LEFT_CURLY_BRACKET)
1116        {        {
1117        const pcre_uchar *p;        const pcre_uchar *p;
1118        for (p = ptr+2; *p != 0 && *p != CHAR_RIGHT_CURLY_BRACKET; p++)        for (p = ptr+2; *p != CHAR_NULL && *p != CHAR_RIGHT_CURLY_BRACKET; p++)
1119          if (*p != CHAR_MINUS && !IS_DIGIT(*p)) break;          if (*p != CHAR_MINUS && !IS_DIGIT(*p)) break;
1120        if (*p != 0 && *p != CHAR_RIGHT_CURLY_BRACKET)        if (*p != CHAR_NULL && *p != CHAR_RIGHT_CURLY_BRACKET)
1121          {          {
1122          c = -ESC_k;          escape = ESC_k;
1123          break;          break;
1124          }          }
1125        braced = TRUE;        braced = TRUE;
# Line 892  else Line 1135  else
1135      else negated = FALSE;      else negated = FALSE;
1136    
1137      /* The integer range is limited by the machine's int representation. */      /* The integer range is limited by the machine's int representation. */
1138      c = 0;      s = 0;
1139        overflow = FALSE;
1140      while (IS_DIGIT(ptr[1]))      while (IS_DIGIT(ptr[1]))
1141        {        {
1142        if (((unsigned int)c) > INT_MAX / 10) /* Integer overflow */        if (s > INT_MAX / 10 - 1) /* Integer overflow */
1143          {          {
1144          c = -1;          overflow = TRUE;
1145          break;          break;
1146          }          }
1147        c = c * 10 + *(++ptr) - CHAR_0;        s = s * 10 + (int)(*(++ptr) - CHAR_0);
1148        }        }
1149      if (((unsigned int)c) > INT_MAX) /* Integer overflow */      if (overflow) /* Integer overflow */
1150        {        {
1151        while (IS_DIGIT(ptr[1]))        while (IS_DIGIT(ptr[1]))
1152          ptr++;          ptr++;
# Line 916  else Line 1160  else
1160        break;        break;
1161        }        }
1162    
1163      if (c == 0)      if (s == 0)
1164        {        {
1165        *errorcodeptr = ERR58;        *errorcodeptr = ERR58;
1166        break;        break;
# Line 924  else Line 1168  else
1168    
1169      if (negated)      if (negated)
1170        {        {
1171        if (c > bracount)        if (s > bracount)
1172          {          {
1173          *errorcodeptr = ERR15;          *errorcodeptr = ERR15;
1174          break;          break;
1175          }          }
1176        c = bracount - (c - 1);        s = bracount - (s - 1);
1177        }        }
1178    
1179      c = -(ESC_REF + c);      escape = -s;
1180      break;      break;
1181    
1182      /* The handling of escape sequences consisting of a string of digits      /* The handling of escape sequences consisting of a string of digits
1183      starting with one that is not zero is not straightforward. By experiment,      starting with one that is not zero is not straightforward. Perl has changed
1184      the way Perl works seems to be as follows:      over the years. Nowadays \g{} for backreferences and \o{} for octal are
1185        recommended to avoid the ambiguities in the old syntax.
1186    
1187      Outside a character class, the digits are read as a decimal number. If the      Outside a character class, the digits are read as a decimal number. If the
1188      number is less than 10, or if there are that many previous extracting      number is less than 8 (used to be 10), or if there are that many previous
1189      left brackets, then it is a back reference. Otherwise, up to three octal      extracting left brackets, then it is a back reference. Otherwise, up to
1190      digits are read to form an escaped byte. Thus \123 is likely to be octal      three octal digits are read to form an escaped byte. Thus \123 is likely to
1191      123 (cf \0123, which is octal 012 followed by the literal 3). If the octal      be octal 123 (cf \0123, which is octal 012 followed by the literal 3). If
1192      value is greater than 377, the least significant 8 bits are taken. Inside a      the octal value is greater than 377, the least significant 8 bits are
1193      character class, \ followed by a digit is always an octal number. */      taken. \8 and \9 are treated as the literal characters 8 and 9.
1194    
1195        Inside a character class, \ followed by a digit is always either a literal
1196        8 or 9 or an octal number. */
1197    
1198      case CHAR_1: case CHAR_2: case CHAR_3: case CHAR_4: case CHAR_5:      case CHAR_1: case CHAR_2: case CHAR_3: case CHAR_4: case CHAR_5:
1199      case CHAR_6: case CHAR_7: case CHAR_8: case CHAR_9:      case CHAR_6: case CHAR_7: case CHAR_8: case CHAR_9:
# Line 954  else Line 1202  else
1202        {        {
1203        oldptr = ptr;        oldptr = ptr;
1204        /* The integer range is limited by the machine's int representation. */        /* The integer range is limited by the machine's int representation. */
1205        c -= CHAR_0;        s = (int)(c -CHAR_0);
1206          overflow = FALSE;
1207        while (IS_DIGIT(ptr[1]))        while (IS_DIGIT(ptr[1]))
1208          {          {
1209          if (((unsigned int)c) > INT_MAX / 10) /* Integer overflow */          if (s > INT_MAX / 10 - 1) /* Integer overflow */
1210            {            {
1211            c = -1;            overflow = TRUE;
1212            break;            break;
1213            }            }
1214          c = c * 10 + *(++ptr) - CHAR_0;          s = s * 10 + (int)(*(++ptr) - CHAR_0);
1215          }          }
1216        if (((unsigned int)c) > INT_MAX) /* Integer overflow */        if (overflow) /* Integer overflow */
1217          {          {
1218          while (IS_DIGIT(ptr[1]))          while (IS_DIGIT(ptr[1]))
1219            ptr++;            ptr++;
1220          *errorcodeptr = ERR61;          *errorcodeptr = ERR61;
1221          break;          break;
1222          }          }
1223        if (c < 10 || c <= bracount)        if (s < 8 || s <= bracount)  /* Check for back reference */
1224          {          {
1225          c = -(ESC_REF + c);          escape = -s;
1226          break;          break;
1227          }          }
1228        ptr = oldptr;      /* Put the pointer back and fall through */        ptr = oldptr;      /* Put the pointer back and fall through */
1229        }        }
1230    
1231      /* Handle an octal number following \. If the first digit is 8 or 9, Perl      /* Handle a digit following \ when the number is not a back reference. If
1232      generates a binary zero byte and treats the digit as a following literal.      the first digit is 8 or 9, Perl used to generate a binary zero byte and
1233      Thus we have to pull back the pointer by one. */      then treat the digit as a following literal. At least by Perl 5.18 this
1234        changed so as not to insert the binary zero. */
1235    
1236      if ((c = *ptr) >= CHAR_8)      if ((c = *ptr) >= CHAR_8) break;
1237        {  
1238        ptr--;      /* Fall through with a digit less than 8 */
       c = 0;  
       break;  
       }  
1239    
1240      /* \0 always starts an octal number, but we may drop through to here with a      /* \0 always starts an octal number, but we may drop through to here with a
1241      larger first octal digit. The original code used just to take the least      larger first octal digit. The original code used just to take the least
# Line 1005  else Line 1252  else
1252  #endif  #endif
1253      break;      break;
1254    
1255      /* \x is complicated. \x{ddd} is a character number which can be greater      /* \o is a relatively new Perl feature, supporting a more general way of
1256      than 0xff in utf or non-8bit mode, but only if the ddd are hex digits.      specifying character codes in octal. The only supported form is \o{ddd}. */
1257      If not, { is treated as a data character. */  
1258        case CHAR_o:
1259        if (ptr[1] != CHAR_LEFT_CURLY_BRACKET) *errorcodeptr = ERR81; else
1260          {
1261          ptr += 2;
1262          c = 0;
1263          overflow = FALSE;
1264          while (*ptr >= CHAR_0 && *ptr <= CHAR_7)
1265            {
1266            register pcre_uint32 cc = *ptr++;
1267            if (c == 0 && cc == CHAR_0) continue;     /* Leading zeroes */
1268    #ifdef COMPILE_PCRE32
1269            if (c >= 0x20000000l) { overflow = TRUE; break; }
1270    #endif
1271            c = (c << 3) + cc - CHAR_0 ;
1272    #if defined COMPILE_PCRE8
1273            if (c > (utf ? 0x10ffffU : 0xffU)) { overflow = TRUE; break; }
1274    #elif defined COMPILE_PCRE16
1275            if (c > (utf ? 0x10ffffU : 0xffffU)) { overflow = TRUE; break; }
1276    #elif defined COMPILE_PCRE32
1277            if (utf && c > 0x10ffffU) { overflow = TRUE; break; }
1278    #endif
1279            }
1280          if (overflow)
1281            {
1282            while (*ptr >= CHAR_0 && *ptr <= CHAR_7) ptr++;
1283            *errorcodeptr = ERR34;
1284            }
1285          else if (*ptr == CHAR_RIGHT_CURLY_BRACKET)
1286            {
1287            if (utf && c >= 0xd800 && c <= 0xdfff) *errorcodeptr = ERR73;
1288            }
1289          else *errorcodeptr = ERR80;
1290          }
1291        break;
1292    
1293        /* \x is complicated. In JavaScript, \x must be followed by two hexadecimal
1294        numbers. Otherwise it is a lowercase x letter. */
1295    
1296      case CHAR_x:      case CHAR_x:
1297      if ((options & PCRE_JAVASCRIPT_COMPAT) != 0)      if ((options & PCRE_JAVASCRIPT_COMPAT) != 0)
1298        {        {
       /* In JavaScript, \x must be followed by two hexadecimal numbers.  
       Otherwise it is a lowercase x letter. */  
1299        if (MAX_255(ptr[1]) && (digitab[ptr[1]] & ctype_xdigit) != 0        if (MAX_255(ptr[1]) && (digitab[ptr[1]] & ctype_xdigit) != 0
1300          && MAX_255(ptr[2]) && (digitab[ptr[2]] & ctype_xdigit) != 0)          && MAX_255(ptr[2]) && (digitab[ptr[2]] & ctype_xdigit) != 0)
1301          {          {
1302          c = 0;          c = 0;
1303          for (i = 0; i < 2; ++i)          for (i = 0; i < 2; ++i)
1304            {            {
1305            register int cc = *(++ptr);            register pcre_uint32 cc = *(++ptr);
1306  #ifndef EBCDIC  /* ASCII/UTF-8 coding */  #ifndef EBCDIC  /* ASCII/UTF-8 coding */
1307            if (cc >= CHAR_a) cc -= 32;               /* Convert to upper case */            if (cc >= CHAR_a) cc -= 32;               /* Convert to upper case */
1308            c = (c << 4) + cc - ((cc < CHAR_A)? CHAR_0 : (CHAR_A - 10));            c = (c << 4) + cc - ((cc < CHAR_A)? CHAR_0 : (CHAR_A - 10));
# Line 1030  else Line 1312  else
1312  #endif  #endif
1313            }            }
1314          }          }
1315        break;        }    /* End JavaScript handling */
       }  
1316    
1317      if (ptr[1] == CHAR_LEFT_CURLY_BRACKET)      /* Handle \x in Perl's style. \x{ddd} is a character number which can be
1318        {      greater than 0xff in utf or non-8bit mode, but only if the ddd are hex
1319        const pcre_uchar *pt = ptr + 2;      digits. If not, { used to be treated as a data character. However, Perl
1320        seems to read hex digits up to the first non-such, and ignore the rest, so
1321        that, for example \x{zz} matches a binary zero. This seems crazy, so PCRE
1322        now gives an error. */
1323    
1324        c = 0;      else
1325        while (MAX_255(*pt) && (digitab[*pt] & ctype_xdigit) != 0)        {
1326          if (ptr[1] == CHAR_LEFT_CURLY_BRACKET)
1327          {          {
1328          register int cc = *pt++;          ptr += 2;
1329          if (c == 0 && cc == CHAR_0) continue;     /* Leading zeroes */          c = 0;
1330            overflow = FALSE;
1331            while (MAX_255(*ptr) && (digitab[*ptr] & ctype_xdigit) != 0)
1332              {
1333              register pcre_uint32 cc = *ptr++;
1334              if (c == 0 && cc == CHAR_0) continue;     /* Leading zeroes */
1335    
1336    #ifdef COMPILE_PCRE32
1337              if (c >= 0x10000000l) { overflow = TRUE; break; }
1338    #endif
1339    
1340  #ifndef EBCDIC  /* ASCII/UTF-8 coding */  #ifndef EBCDIC  /* ASCII/UTF-8 coding */
1341          if (cc >= CHAR_a) cc -= 32;               /* Convert to upper case */            if (cc >= CHAR_a) cc -= 32;               /* Convert to upper case */
1342          c = (c << 4) + cc - ((cc < CHAR_A)? CHAR_0 : (CHAR_A - 10));            c = (c << 4) + cc - ((cc < CHAR_A)? CHAR_0 : (CHAR_A - 10));
1343  #else           /* EBCDIC coding */  #else           /* EBCDIC coding */
1344          if (cc >= CHAR_a && cc <= CHAR_z) cc += 64;  /* Convert to upper case */            if (cc >= CHAR_a && cc <= CHAR_z) cc += 64;  /* Convert to upper case */
1345          c = (c << 4) + cc - ((cc >= CHAR_0)? CHAR_0 : (CHAR_A - 10));            c = (c << 4) + cc - ((cc >= CHAR_0)? CHAR_0 : (CHAR_A - 10));
1346  #endif  #endif
1347    
1348  #ifdef COMPILE_PCRE8  #if defined COMPILE_PCRE8
1349          if (c > (utf ? 0x10ffff : 0xff)) { c = -1; break; }            if (c > (utf ? 0x10ffffU : 0xffU)) { overflow = TRUE; break; }
1350  #else  #elif defined COMPILE_PCRE16
1351  #ifdef COMPILE_PCRE16            if (c > (utf ? 0x10ffffU : 0xffffU)) { overflow = TRUE; break; }
1352          if (c > (utf ? 0x10ffff : 0xffff)) { c = -1; break; }  #elif defined COMPILE_PCRE32
1353              if (utf && c > 0x10ffffU) { overflow = TRUE; break; }
1354  #endif  #endif
1355  #endif            }
         }  
1356    
1357        if (c < 0)          if (overflow)
1358          {            {
1359          while (MAX_255(*pt) && (digitab[*pt] & ctype_xdigit) != 0) pt++;            while (MAX_255(*ptr) && (digitab[*ptr] & ctype_xdigit) != 0) ptr++;
1360          *errorcodeptr = ERR34;            *errorcodeptr = ERR34;
1361          }            }
1362    
1363        if (*pt == CHAR_RIGHT_CURLY_BRACKET)          else if (*ptr == CHAR_RIGHT_CURLY_BRACKET)
1364          {            {
1365          if (utf && c >= 0xd800 && c <= 0xdfff) *errorcodeptr = ERR73;            if (utf && c >= 0xd800 && c <= 0xdfff) *errorcodeptr = ERR73;
1366          ptr = pt;            }
         break;  
         }  
1367    
1368        /* If the sequence of hex digits does not end with '}', then we don't          /* If the sequence of hex digits does not end with '}', give an error.
1369        recognize this construct; fall through to the normal \x handling. */          We used just to recognize this construct and fall through to the normal
1370        }          \x handling, but nowadays Perl gives an error, which seems much more
1371            sensible, so we do too. */
1372    
1373      /* Read just a single-byte hex-defined char */          else *errorcodeptr = ERR79;
1374            }   /* End of \x{} processing */
1375    
1376      c = 0;        /* Read a single-byte hex-defined char (up to two hex digits after \x) */
1377      while (i++ < 2 && MAX_255(ptr[1]) && (digitab[ptr[1]] & ctype_xdigit) != 0)  
1378        {        else
1379        int cc;                                  /* Some compilers don't like */          {
1380        cc = *(++ptr);                           /* ++ in initializers */          c = 0;
1381            while (i++ < 2 && MAX_255(ptr[1]) && (digitab[ptr[1]] & ctype_xdigit) != 0)
1382              {
1383              pcre_uint32 cc;                          /* Some compilers don't like */
1384              cc = *(++ptr);                           /* ++ in initializers */
1385  #ifndef EBCDIC  /* ASCII/UTF-8 coding */  #ifndef EBCDIC  /* ASCII/UTF-8 coding */
1386        if (cc >= CHAR_a) cc -= 32;              /* Convert to upper case */            if (cc >= CHAR_a) cc -= 32;              /* Convert to upper case */
1387        c = c * 16 + cc - ((cc < CHAR_A)? CHAR_0 : (CHAR_A - 10));            c = c * 16 + cc - ((cc < CHAR_A)? CHAR_0 : (CHAR_A - 10));
1388  #else           /* EBCDIC coding */  #else           /* EBCDIC coding */
1389        if (cc <= CHAR_z) cc += 64;              /* Convert to upper case */            if (cc <= CHAR_z) cc += 64;              /* Convert to upper case */
1390        c = c * 16 + cc - ((cc >= CHAR_0)? CHAR_0 : (CHAR_A - 10));            c = c * 16 + cc - ((cc >= CHAR_0)? CHAR_0 : (CHAR_A - 10));
1391  #endif  #endif
1392        }            }
1393            }     /* End of \xdd handling */
1394          }       /* End of Perl-style \x handling */
1395      break;      break;
1396    
1397      /* For \c, a following letter is upper-cased; then the 0x40 bit is flipped.      /* For \c, a following letter is upper-cased; then the 0x40 bit is flipped.
# Line 1101  else Line 1401  else
1401    
1402      case CHAR_c:      case CHAR_c:
1403      c = *(++ptr);      c = *(++ptr);
1404      if (c == 0)      if (c == CHAR_NULL)
1405        {        {
1406        *errorcodeptr = ERR2;        *errorcodeptr = ERR2;
1407        break;        break;
# Line 1141  else Line 1441  else
1441  newline". PCRE does not support \N{name}. However, it does support  newline". PCRE does not support \N{name}. However, it does support
1442  quantification such as \N{2,3}. */  quantification such as \N{2,3}. */
1443    
1444  if (c == -ESC_N && ptr[1] == CHAR_LEFT_CURLY_BRACKET &&  if (escape == ESC_N && ptr[1] == CHAR_LEFT_CURLY_BRACKET &&
1445       !is_counted_repeat(ptr+2))       !is_counted_repeat(ptr+2))
1446    *errorcodeptr = ERR37;    *errorcodeptr = ERR37;
1447    
1448  /* If PCRE_UCP is set, we change the values for \d etc. */  /* If PCRE_UCP is set, we change the values for \d etc. */
1449    
1450  if ((options & PCRE_UCP) != 0 && c <= -ESC_D && c >= -ESC_w)  if ((options & PCRE_UCP) != 0 && escape >= ESC_D && escape <= ESC_w)
1451    c -= (ESC_DU - ESC_D);    escape += (ESC_DU - ESC_D);
1452    
1453  /* Set the pointer to the final character before returning. */  /* Set the pointer to the final character before returning. */
1454    
1455  *ptrptr = ptr;  *ptrptr = ptr;
1456  return c;  *chptr = c;
1457    return escape;
1458  }  }
1459    
1460    
# Line 1171  escape sequence. Line 1472  escape sequence.
1472  Argument:  Argument:
1473    ptrptr         points to the pattern position pointer    ptrptr         points to the pattern position pointer
1474    negptr         points to a boolean that is set TRUE for negation else FALSE    negptr         points to a boolean that is set TRUE for negation else FALSE
1475    dptr           points to an int that is set to the detailed property value    ptypeptr       points to an unsigned int that is set to the type value
1476      pdataptr       points to an unsigned int that is set to the detailed property value
1477    errorcodeptr   points to the error code variable    errorcodeptr   points to the error code variable
1478    
1479  Returns:         type value from ucp_type_table, or -1 for an invalid type  Returns:         TRUE if the type value was found, or FALSE for an invalid type
1480  */  */
1481    
1482  static int  static BOOL
1483  get_ucp(const pcre_uchar **ptrptr, BOOL *negptr, int *dptr, int *errorcodeptr)  get_ucp(const pcre_uchar **ptrptr, BOOL *negptr, unsigned int *ptypeptr,
1484      unsigned int *pdataptr, int *errorcodeptr)
1485  {  {
1486  int c, i, bot, top;  pcre_uchar c;
1487    int i, bot, top;
1488  const pcre_uchar *ptr = *ptrptr;  const pcre_uchar *ptr = *ptrptr;
1489  pcre_uchar name[32];  pcre_uchar name[32];
1490    
1491  c = *(++ptr);  c = *(++ptr);
1492  if (c == 0) goto ERROR_RETURN;  if (c == CHAR_NULL) goto ERROR_RETURN;
1493    
1494  *negptr = FALSE;  *negptr = FALSE;
1495    
# Line 1202  if (c == CHAR_LEFT_CURLY_BRACKET) Line 1506  if (c == CHAR_LEFT_CURLY_BRACKET)
1506    for (i = 0; i < (int)(sizeof(name) / sizeof(pcre_uchar)) - 1; i++)    for (i = 0; i < (int)(sizeof(name) / sizeof(pcre_uchar)) - 1; i++)
1507      {      {
1508      c = *(++ptr);      c = *(++ptr);
1509      if (c == 0) goto ERROR_RETURN;      if (c == CHAR_NULL) goto ERROR_RETURN;
1510      if (c == CHAR_RIGHT_CURLY_BRACKET) break;      if (c == CHAR_RIGHT_CURLY_BRACKET) break;
1511      name[i] = c;      name[i] = c;
1512      }      }
# Line 1227  top = PRIV(utt_size); Line 1531  top = PRIV(utt_size);
1531    
1532  while (bot < top)  while (bot < top)
1533    {    {
1534      int r;
1535    i = (bot + top) >> 1;    i = (bot + top) >> 1;
1536    c = STRCMP_UC_C8(name, PRIV(utt_names) + PRIV(utt)[i].name_offset);    r = STRCMP_UC_C8(name, PRIV(utt_names) + PRIV(utt)[i].name_offset);
1537    if (c == 0)    if (r == 0)
1538      {      {
1539      *dptr = PRIV(utt)[i].value;      *ptypeptr = PRIV(utt)[i].type;
1540      return PRIV(utt)[i].type;      *pdataptr = PRIV(utt)[i].value;
1541        return TRUE;
1542      }      }
1543    if (c > 0) bot = i + 1; else top = i;    if (r > 0) bot = i + 1; else top = i;
1544    }    }
1545    
1546  *errorcodeptr = ERR47;  *errorcodeptr = ERR47;
1547  *ptrptr = ptr;  *ptrptr = ptr;
1548  return -1;  return FALSE;
1549    
1550  ERROR_RETURN:  ERROR_RETURN:
1551  *errorcodeptr = ERR46;  *errorcodeptr = ERR46;
1552  *ptrptr = ptr;  *ptrptr = ptr;
1553  return -1;  return FALSE;
1554  }  }
1555  #endif  #endif
1556    
1557    
1558    
   
1559  /*************************************************  /*************************************************
1560  *         Read repeat counts                     *  *         Read repeat counts                     *
1561  *************************************************/  *************************************************/
# Line 1279  int max = -1; Line 1584  int max = -1;
1584  /* Read the minimum value and do a paranoid check: a negative value indicates  /* Read the minimum value and do a paranoid check: a negative value indicates
1585  an integer overflow. */  an integer overflow. */
1586    
1587  while (IS_DIGIT(*p)) min = min * 10 + *p++ - CHAR_0;  while (IS_DIGIT(*p)) min = min * 10 + (int)(*p++ - CHAR_0);
1588  if (min < 0 || min > 65535)  if (min < 0 || min > 65535)
1589    {    {
1590    *errorcodeptr = ERR5;    *errorcodeptr = ERR5;
# Line 1294  if (*p == CHAR_RIGHT_CURLY_BRACKET) max Line 1599  if (*p == CHAR_RIGHT_CURLY_BRACKET) max
1599    if (*(++p) != CHAR_RIGHT_CURLY_BRACKET)    if (*(++p) != CHAR_RIGHT_CURLY_BRACKET)
1600      {      {
1601      max = 0;      max = 0;
1602      while(IS_DIGIT(*p)) max = max * 10 + *p++ - CHAR_0;      while(IS_DIGIT(*p)) max = max * 10 + (int)(*p++ - CHAR_0);
1603      if (max < 0 || max > 65535)      if (max < 0 || max > 65535)
1604        {        {
1605        *errorcodeptr = ERR5;        *errorcodeptr = ERR5;
# Line 1319  return p; Line 1624  return p;
1624    
1625    
1626  /*************************************************  /*************************************************
 *  Subroutine for finding forward reference      *  
 *************************************************/  
   
 /* This recursive function is called only from find_parens() below. The  
 top-level call starts at the beginning of the pattern. All other calls must  
 start at a parenthesis. It scans along a pattern's text looking for capturing  
 subpatterns, and counting them. If it finds a named pattern that matches the  
 name it is given, it returns its number. Alternatively, if the name is NULL, it  
 returns when it reaches a given numbered subpattern. Recursion is used to keep  
 track of subpatterns that reset the capturing group numbers - the (?| feature.  
   
 This function was originally called only from the second pass, in which we know  
 that if (?< or (?' or (?P< is encountered, the name will be correctly  
 terminated because that is checked in the first pass. There is now one call to  
 this function in the first pass, to check for a recursive back reference by  
 name (so that we can make the whole group atomic). In this case, we need check  
 only up to the current position in the pattern, and that is still OK because  
 and previous occurrences will have been checked. To make this work, the test  
 for "end of pattern" is a check against cd->end_pattern in the main loop,  
 instead of looking for a binary zero. This means that the special first-pass  
 call can adjust cd->end_pattern temporarily. (Checks for binary zero while  
 processing items within the loop are OK, because afterwards the main loop will  
 terminate.)  
   
 Arguments:  
   ptrptr       address of the current character pointer (updated)  
   cd           compile background data  
   name         name to seek, or NULL if seeking a numbered subpattern  
   lorn         name length, or subpattern number if name is NULL  
   xmode        TRUE if we are in /x mode  
   utf          TRUE if we are in UTF-8 / UTF-16 mode  
   count        pointer to the current capturing subpattern number (updated)  
   
 Returns:       the number of the named subpattern, or -1 if not found  
 */  
   
 static int  
 find_parens_sub(pcre_uchar **ptrptr, compile_data *cd, const pcre_uchar *name, int lorn,  
   BOOL xmode, BOOL utf, int *count)  
 {  
 pcre_uchar *ptr = *ptrptr;  
 int start_count = *count;  
 int hwm_count = start_count;  
 BOOL dup_parens = FALSE;  
   
 /* If the first character is a parenthesis, check on the type of group we are  
 dealing with. The very first call may not start with a parenthesis. */  
   
 if (ptr[0] == CHAR_LEFT_PARENTHESIS)  
   {  
   /* Handle specials such as (*SKIP) or (*UTF8) etc. */  
   
   if (ptr[1] == CHAR_ASTERISK) ptr += 2;  
   
   /* Handle a normal, unnamed capturing parenthesis. */  
   
   else if (ptr[1] != CHAR_QUESTION_MARK)  
     {  
     *count += 1;  
     if (name == NULL && *count == lorn) return *count;  
     ptr++;  
     }  
   
   /* All cases now have (? at the start. Remember when we are in a group  
   where the parenthesis numbers are duplicated. */  
   
   else if (ptr[2] == CHAR_VERTICAL_LINE)  
     {  
     ptr += 3;  
     dup_parens = TRUE;  
     }  
   
   /* Handle comments; all characters are allowed until a ket is reached. */  
   
   else if (ptr[2] == CHAR_NUMBER_SIGN)  
     {  
     for (ptr += 3; *ptr != 0; ptr++) if (*ptr == CHAR_RIGHT_PARENTHESIS) break;  
     goto FAIL_EXIT;  
     }  
   
   /* Handle a condition. If it is an assertion, just carry on so that it  
   is processed as normal. If not, skip to the closing parenthesis of the  
   condition (there can't be any nested parens). */  
   
   else if (ptr[2] == CHAR_LEFT_PARENTHESIS)  
     {  
     ptr += 2;  
     if (ptr[1] != CHAR_QUESTION_MARK)  
       {  
       while (*ptr != 0 && *ptr != CHAR_RIGHT_PARENTHESIS) ptr++;  
       if (*ptr != 0) ptr++;  
       }  
     }  
   
   /* Start with (? but not a condition. */  
   
   else  
     {  
     ptr += 2;  
     if (*ptr == CHAR_P) ptr++;                      /* Allow optional P */  
   
     /* We have to disambiguate (?<! and (?<= from (?<name> for named groups */  
   
     if ((*ptr == CHAR_LESS_THAN_SIGN && ptr[1] != CHAR_EXCLAMATION_MARK &&  
         ptr[1] != CHAR_EQUALS_SIGN) || *ptr == CHAR_APOSTROPHE)  
       {  
       int term;  
       const pcre_uchar *thisname;  
       *count += 1;  
       if (name == NULL && *count == lorn) return *count;  
       term = *ptr++;  
       if (term == CHAR_LESS_THAN_SIGN) term = CHAR_GREATER_THAN_SIGN;  
       thisname = ptr;  
       while (*ptr != term) ptr++;  
       if (name != NULL && lorn == ptr - thisname &&  
           STRNCMP_UC_UC(name, thisname, lorn) == 0)  
         return *count;  
       term++;  
       }  
     }  
   }  
   
 /* Past any initial parenthesis handling, scan for parentheses or vertical  
 bars. Stop if we get to cd->end_pattern. Note that this is important for the  
 first-pass call when this value is temporarily adjusted to stop at the current  
 position. So DO NOT change this to a test for binary zero. */  
   
 for (; ptr < cd->end_pattern; ptr++)  
   {  
   /* Skip over backslashed characters and also entire \Q...\E */  
   
   if (*ptr == CHAR_BACKSLASH)  
     {  
     if (*(++ptr) == 0) goto FAIL_EXIT;  
     if (*ptr == CHAR_Q) for (;;)  
       {  
       while (*(++ptr) != 0 && *ptr != CHAR_BACKSLASH) {};  
       if (*ptr == 0) goto FAIL_EXIT;  
       if (*(++ptr) == CHAR_E) break;  
       }  
     continue;  
     }  
   
   /* Skip over character classes; this logic must be similar to the way they  
   are handled for real. If the first character is '^', skip it. Also, if the  
   first few characters (either before or after ^) are \Q\E or \E we skip them  
   too. This makes for compatibility with Perl. Note the use of STR macros to  
   encode "Q\\E" so that it works in UTF-8 on EBCDIC platforms. */  
   
   if (*ptr == CHAR_LEFT_SQUARE_BRACKET)  
     {  
     BOOL negate_class = FALSE;  
     for (;;)  
       {  
       if (ptr[1] == CHAR_BACKSLASH)  
         {  
         if (ptr[2] == CHAR_E)  
           ptr+= 2;  
         else if (STRNCMP_UC_C8(ptr + 2,  
                  STR_Q STR_BACKSLASH STR_E, 3) == 0)  
           ptr += 4;  
         else  
           break;  
         }  
       else if (!negate_class && ptr[1] == CHAR_CIRCUMFLEX_ACCENT)  
         {  
         negate_class = TRUE;  
         ptr++;  
         }  
       else break;  
       }  
   
     /* If the next character is ']', it is a data character that must be  
     skipped, except in JavaScript compatibility mode. */  
   
     if (ptr[1] == CHAR_RIGHT_SQUARE_BRACKET &&  
         (cd->external_options & PCRE_JAVASCRIPT_COMPAT) == 0)  
       ptr++;  
   
     while (*(++ptr) != CHAR_RIGHT_SQUARE_BRACKET)  
       {  
       if (*ptr == 0) return -1;  
       if (*ptr == CHAR_BACKSLASH)  
         {  
         if (*(++ptr) == 0) goto FAIL_EXIT;  
         if (*ptr == CHAR_Q) for (;;)  
           {  
           while (*(++ptr) != 0 && *ptr != CHAR_BACKSLASH) {};  
           if (*ptr == 0) goto FAIL_EXIT;  
           if (*(++ptr) == CHAR_E) break;  
           }  
         continue;  
         }  
       }  
     continue;  
     }  
   
   /* Skip comments in /x mode */  
   
   if (xmode && *ptr == CHAR_NUMBER_SIGN)  
     {  
     ptr++;  
     while (*ptr != 0)  
       {  
       if (IS_NEWLINE(ptr)) { ptr += cd->nllen - 1; break; }  
       ptr++;  
 #ifdef SUPPORT_UTF  
       if (utf) FORWARDCHAR(ptr);  
 #endif  
       }  
     if (*ptr == 0) goto FAIL_EXIT;  
     continue;  
     }  
   
   /* Check for the special metacharacters */  
   
   if (*ptr == CHAR_LEFT_PARENTHESIS)  
     {  
     int rc = find_parens_sub(&ptr, cd, name, lorn, xmode, utf, count);  
     if (rc > 0) return rc;  
     if (*ptr == 0) goto FAIL_EXIT;  
     }  
   
   else if (*ptr == CHAR_RIGHT_PARENTHESIS)  
     {  
     if (dup_parens && *count < hwm_count) *count = hwm_count;  
     goto FAIL_EXIT;  
     }  
   
   else if (*ptr == CHAR_VERTICAL_LINE && dup_parens)  
     {  
     if (*count > hwm_count) hwm_count = *count;  
     *count = start_count;  
     }  
   }  
   
 FAIL_EXIT:  
 *ptrptr = ptr;  
 return -1;  
 }  
   
   
   
   
 /*************************************************  
 *       Find forward referenced subpattern       *  
 *************************************************/  
   
 /* This function scans along a pattern's text looking for capturing  
 subpatterns, and counting them. If it finds a named pattern that matches the  
 name it is given, it returns its number. Alternatively, if the name is NULL, it  
 returns when it reaches a given numbered subpattern. This is used for forward  
 references to subpatterns. We used to be able to start this scan from the  
 current compiling point, using the current count value from cd->bracount, and  
 do it all in a single loop, but the addition of the possibility of duplicate  
 subpattern numbers means that we have to scan from the very start, in order to  
 take account of such duplicates, and to use a recursive function to keep track  
 of the different types of group.  
   
 Arguments:  
   cd           compile background data  
   name         name to seek, or NULL if seeking a numbered subpattern  
   lorn         name length, or subpattern number if name is NULL  
   xmode        TRUE if we are in /x mode  
   utf          TRUE if we are in UTF-8 / UTF-16 mode  
   
 Returns:       the number of the found subpattern, or -1 if not found  
 */  
   
 static int  
 find_parens(compile_data *cd, const pcre_uchar *name, int lorn, BOOL xmode,  
   BOOL utf)  
 {  
 pcre_uchar *ptr = (pcre_uchar *)cd->start_pattern;  
 int count = 0;  
 int rc;  
   
 /* If the pattern does not start with an opening parenthesis, the first call  
 to find_parens_sub() will scan right to the end (if necessary). However, if it  
 does start with a parenthesis, find_parens_sub() will return when it hits the  
 matching closing parens. That is why we have to have a loop. */  
   
 for (;;)  
   {  
   rc = find_parens_sub(&ptr, cd, name, lorn, xmode, utf, &count);  
   if (rc > 0 || *ptr++ == 0) break;  
   }  
   
 return rc;  
 }  
   
   
   
   
 /*************************************************  
1627  *      Find first significant op code            *  *      Find first significant op code            *
1628  *************************************************/  *************************************************/
1629    
# Line 1652  for (;;) Line 1662  for (;;)
1662    
1663      case OP_CALLOUT:      case OP_CALLOUT:
1664      case OP_CREF:      case OP_CREF:
1665      case OP_NCREF:      case OP_DNCREF:
1666      case OP_RREF:      case OP_RREF:
1667      case OP_NRREF:      case OP_DNRREF:
1668      case OP_DEF:      case OP_DEF:
1669      code += PRIV(OP_lengths)[*code];      code += PRIV(OP_lengths)[*code];
1670      break;      break;
# Line 1668  for (;;) Line 1678  for (;;)
1678    
1679    
1680    
   
1681  /*************************************************  /*************************************************
1682  *        Find the fixed length of a branch       *  *        Find the fixed length of a branch       *
1683  *************************************************/  *************************************************/
# Line 1686  and doing the check at the end; a flag s Line 1695  and doing the check at the end; a flag s
1695    
1696  Arguments:  Arguments:
1697    code     points to the start of the pattern (the bracket)    code     points to the start of the pattern (the bracket)
1698    utf      TRUE in UTF-8 / UTF-16 mode    utf      TRUE in UTF-8 / UTF-16 / UTF-32 mode
1699    atend    TRUE if called when the pattern is complete    atend    TRUE if called when the pattern is complete
1700    cd       the "compile data" structure    cd       the "compile data" structure
1701    
# Line 1712  for (;;) Line 1721  for (;;)
1721    {    {
1722    int d;    int d;
1723    pcre_uchar *ce, *cs;    pcre_uchar *ce, *cs;
1724    register int op = *cc;    register pcre_uchar op = *cc;
1725    
1726    switch (op)    switch (op)
1727      {      {
# Line 1792  for (;;) Line 1801  for (;;)
1801      case OP_COMMIT:      case OP_COMMIT:
1802      case OP_CREF:      case OP_CREF:
1803      case OP_DEF:      case OP_DEF:
1804        case OP_DNCREF:
1805        case OP_DNRREF:
1806      case OP_DOLL:      case OP_DOLL:
1807      case OP_DOLLM:      case OP_DOLLM:
1808      case OP_EOD:      case OP_EOD:
1809      case OP_EODN:      case OP_EODN:
1810      case OP_FAIL:      case OP_FAIL:
     case OP_NCREF:  
     case OP_NRREF:  
1811      case OP_NOT_WORD_BOUNDARY:      case OP_NOT_WORD_BOUNDARY:
1812      case OP_PRUNE:      case OP_PRUNE:
1813      case OP_REVERSE:      case OP_REVERSE:
# Line 1832  for (;;) Line 1841  for (;;)
1841      case OP_EXACTI:      case OP_EXACTI:
1842      case OP_NOTEXACT:      case OP_NOTEXACT:
1843      case OP_NOTEXACTI:      case OP_NOTEXACTI:
1844      branchlength += GET2(cc,1);      branchlength += (int)GET2(cc,1);
1845      cc += 2 + IMM2_SIZE;      cc += 2 + IMM2_SIZE;
1846  #ifdef SUPPORT_UTF  #ifdef SUPPORT_UTF
1847      if (utf && HAS_EXTRALEN(cc[-1])) cc += GET_EXTRALEN(cc[-1]);      if (utf && HAS_EXTRALEN(cc[-1])) cc += GET_EXTRALEN(cc[-1]);
# Line 1841  for (;;) Line 1850  for (;;)
1850    
1851      case OP_TYPEEXACT:      case OP_TYPEEXACT:
1852      branchlength += GET2(cc,1);      branchlength += GET2(cc,1);
1853      if (cc[1 + IMM2_SIZE] == OP_PROP || cc[1 + IMM2_SIZE] == OP_NOTPROP) cc += 2;      if (cc[1 + IMM2_SIZE] == OP_PROP || cc[1 + IMM2_SIZE] == OP_NOTPROP)
1854          cc += 2;
1855      cc += 1 + IMM2_SIZE + 1;      cc += 1 + IMM2_SIZE + 1;
1856      break;      break;
1857    
# Line 1876  for (;;) Line 1886  for (;;)
1886    
1887      /* Check a class for variable quantification */      /* Check a class for variable quantification */
1888    
 #if defined SUPPORT_UTF || defined COMPILE_PCRE16  
     case OP_XCLASS:  
     cc += GET(cc, 1) - PRIV(OP_lengths)[OP_CLASS];  
     /* Fall through */  
 #endif  
   
1889      case OP_CLASS:      case OP_CLASS:
1890      case OP_NCLASS:      case OP_NCLASS:
1891    #if defined SUPPORT_UTF || defined COMPILE_PCRE16 || defined COMPILE_PCRE32
1892        case OP_XCLASS:
1893        /* The original code caused an unsigned overflow in 64 bit systems,
1894        so now we use a conditional statement. */
1895        if (op == OP_XCLASS)
1896          cc += GET(cc, 1);
1897        else
1898          cc += PRIV(OP_lengths)[OP_CLASS];
1899    #else
1900      cc += PRIV(OP_lengths)[OP_CLASS];      cc += PRIV(OP_lengths)[OP_CLASS];
1901    #endif
1902    
1903      switch (*cc)      switch (*cc)
1904        {        {
       case OP_CRPLUS:  
       case OP_CRMINPLUS:  
1905        case OP_CRSTAR:        case OP_CRSTAR:
1906        case OP_CRMINSTAR:        case OP_CRMINSTAR:
1907          case OP_CRPLUS:
1908          case OP_CRMINPLUS:
1909        case OP_CRQUERY:        case OP_CRQUERY:
1910        case OP_CRMINQUERY:        case OP_CRMINQUERY:
1911          case OP_CRPOSSTAR:
1912          case OP_CRPOSPLUS:
1913          case OP_CRPOSQUERY:
1914        return -1;        return -1;
1915    
1916        case OP_CRRANGE:        case OP_CRRANGE:
1917        case OP_CRMINRANGE:        case OP_CRMINRANGE:
1918          case OP_CRPOSRANGE:
1919        if (GET2(cc,1) != GET2(cc,1+IMM2_SIZE)) return -1;        if (GET2(cc,1) != GET2(cc,1+IMM2_SIZE)) return -1;
1920        branchlength += GET2(cc,1);        branchlength += (int)GET2(cc,1);
1921        cc += 1 + 2 * IMM2_SIZE;        cc += 1 + 2 * IMM2_SIZE;
1922        break;        break;
1923    
# Line 1966  for (;;) Line 1984  for (;;)
1984      case OP_QUERYI:      case OP_QUERYI:
1985      case OP_REF:      case OP_REF:
1986      case OP_REFI:      case OP_REFI:
1987        case OP_DNREF:
1988        case OP_DNREFI:
1989      case OP_SBRA:      case OP_SBRA:
1990      case OP_SBRAPOS:      case OP_SBRAPOS:
1991      case OP_SCBRA:      case OP_SCBRA:
# Line 2002  for (;;) Line 2022  for (;;)
2022    
2023    
2024    
   
2025  /*************************************************  /*************************************************
2026  *    Scan compiled regex for specific bracket    *  *    Scan compiled regex for specific bracket    *
2027  *************************************************/  *************************************************/
# Line 2015  length. Line 2034  length.
2034    
2035  Arguments:  Arguments:
2036    code        points to start of expression    code        points to start of expression
2037    utf         TRUE in UTF-8 / UTF-16 mode    utf         TRUE in UTF-8 / UTF-16 / UTF-32 mode
2038    number      the required bracket number or negative to find a lookbehind    number      the required bracket number or negative to find a lookbehind
2039    
2040  Returns:      pointer to the opcode for the bracket, or NULL if not found  Returns:      pointer to the opcode for the bracket, or NULL if not found
# Line 2026  PRIV(find_bracket)(const pcre_uchar *cod Line 2045  PRIV(find_bracket)(const pcre_uchar *cod
2045  {  {
2046  for (;;)  for (;;)
2047    {    {
2048    register int c = *code;    register pcre_uchar c = *code;
2049    
2050    if (c == OP_END) return NULL;    if (c == OP_END) return NULL;
2051    
# Line 2049  for (;;) Line 2068  for (;;)
2068    else if (c == OP_CBRA || c == OP_SCBRA ||    else if (c == OP_CBRA || c == OP_SCBRA ||
2069             c == OP_CBRAPOS || c == OP_SCBRAPOS)             c == OP_CBRAPOS || c == OP_SCBRAPOS)
2070      {      {
2071      int n = GET2(code, 1+LINK_SIZE);      int n = (int)GET2(code, 1+LINK_SIZE);
2072      if (n == number) return (pcre_uchar *)code;      if (n == number) return (pcre_uchar *)code;
2073      code += PRIV(OP_lengths)[c];      code += PRIV(OP_lengths)[c];
2074      }      }
# Line 2079  for (;;) Line 2098  for (;;)
2098        case OP_TYPEMINUPTO:        case OP_TYPEMINUPTO:
2099        case OP_TYPEEXACT:        case OP_TYPEEXACT:
2100        case OP_TYPEPOSUPTO:        case OP_TYPEPOSUPTO:
2101        if (code[1 + IMM2_SIZE] == OP_PROP        if (code[1 + IMM2_SIZE] == OP_PROP || code[1 + IMM2_SIZE] == OP_NOTPROP)
2102          || code[1 + IMM2_SIZE] == OP_NOTPROP) code += 2;          code += 2;
2103        break;        break;
2104    
2105        case OP_MARK:        case OP_MARK:
2106        case OP_PRUNE_ARG:        case OP_PRUNE_ARG:
2107        case OP_SKIP_ARG:        case OP_SKIP_ARG:
       code += code[1];  
       break;  
   
2108        case OP_THEN_ARG:        case OP_THEN_ARG:
2109        code += code[1];        code += code[1];
2110        break;        break;
# Line 2102  for (;;) Line 2118  for (;;)
2118    a multi-byte character. The length in the table is a minimum, so we have to    a multi-byte character. The length in the table is a minimum, so we have to
2119    arrange to skip the extra bytes. */    arrange to skip the extra bytes. */
2120    
2121  #ifdef SUPPORT_UTF  #if defined SUPPORT_UTF && !defined COMPILE_PCRE32
2122      if (utf) switch(c)      if (utf) switch(c)
2123        {        {
2124        case OP_CHAR:        case OP_CHAR:
# Line 2154  instance of OP_RECURSE. Line 2170  instance of OP_RECURSE.
2170    
2171  Arguments:  Arguments:
2172    code        points to start of expression    code        points to start of expression
2173    utf         TRUE in UTF-8 / UTF-16 mode    utf         TRUE in UTF-8 / UTF-16 / UTF-32 mode
2174    
2175  Returns:      pointer to the opcode for OP_RECURSE, or NULL if not found  Returns:      pointer to the opcode for OP_RECURSE, or NULL if not found
2176  */  */
# Line 2164  find_recurse(const pcre_uchar *code, BOO Line 2180  find_recurse(const pcre_uchar *code, BOO
2180  {  {
2181  for (;;)  for (;;)
2182    {    {
2183    register int c = *code;    register pcre_uchar c = *code;
2184    if (c == OP_END) return NULL;    if (c == OP_END) return NULL;
2185    if (c == OP_RECURSE) return code;    if (c == OP_RECURSE) return code;
2186    
# Line 2199  for (;;) Line 2215  for (;;)
2215        case OP_TYPEUPTO:        case OP_TYPEUPTO:
2216        case OP_TYPEMINUPTO:        case OP_TYPEMINUPTO:
2217        case OP_TYPEEXACT:        case OP_TYPEEXACT:
2218        if (code[1 + IMM2_SIZE] == OP_PROP        if (code[1 + IMM2_SIZE] == OP_PROP || code[1 + IMM2_SIZE] == OP_NOTPROP)
2219          || code[1 + IMM2_SIZE] == OP_NOTPROP) code += 2;          code += 2;
2220        break;        break;
2221    
2222        case OP_MARK:        case OP_MARK:
2223        case OP_PRUNE_ARG:        case OP_PRUNE_ARG:
2224        case OP_SKIP_ARG:        case OP_SKIP_ARG:
       code += code[1];  
       break;  
   
2225        case OP_THEN_ARG:        case OP_THEN_ARG:
2226        code += code[1];        code += code[1];
2227        break;        break;
# Line 2222  for (;;) Line 2235  for (;;)
2235      by a multi-byte character. The length in the table is a minimum, so we have      by a multi-byte character. The length in the table is a minimum, so we have
2236      to arrange to skip the extra bytes. */      to arrange to skip the extra bytes. */
2237    
2238  #ifdef SUPPORT_UTF  #if defined SUPPORT_UTF && !defined COMPILE_PCRE32
2239      if (utf) switch(c)      if (utf) switch(c)
2240        {        {
2241        case OP_CHAR:        case OP_CHAR:
# Line 2308  bracket whose current branch will alread Line 2321  bracket whose current branch will alread
2321  Arguments:  Arguments:
2322    code        points to start of search    code        points to start of search
2323    endcode     points to where to stop    endcode     points to where to stop
2324    utf         TRUE if in UTF-8 / UTF-16 mode    utf         TRUE if in UTF-8 / UTF-16 / UTF-32 mode
2325    cd          contains pointers to tables etc.    cd          contains pointers to tables etc.
2326      recurses    chain of recurse_check to catch mutual recursion
2327    
2328  Returns:      TRUE if what is matched could be empty  Returns:      TRUE if what is matched could be empty
2329  */  */
2330    
2331    typedef struct recurse_check {
2332      struct recurse_check *prev;
2333      const pcre_uchar *group;
2334    } recurse_check;
2335    
2336  static BOOL  static BOOL
2337  could_be_empty_branch(const pcre_uchar *code, const pcre_uchar *endcode,  could_be_empty_branch(const pcre_uchar *code, const pcre_uchar *endcode,
2338    BOOL utf, compile_data *cd)    BOOL utf, compile_data *cd, recurse_check *recurses)
2339  {  {
2340  register int c;  register pcre_uchar c;
2341    recurse_check this_recurse;
2342    
2343  for (code = first_significant_code(code + PRIV(OP_lengths)[*code], TRUE);  for (code = first_significant_code(code + PRIV(OP_lengths)[*code], TRUE);
2344       code < endcode;       code < endcode;
2345       code = first_significant_code(code + PRIV(OP_lengths)[c], TRUE))       code = first_significant_code(code + PRIV(OP_lengths)[c], TRUE))
# Line 2346  for (code = first_significant_code(code Line 2367  for (code = first_significant_code(code
2367    
2368    if (c == OP_RECURSE)    if (c == OP_RECURSE)
2369      {      {
2370      const pcre_uchar *scode;      const pcre_uchar *scode = cd->start_code + GET(code, 1);
2371      BOOL empty_branch;      BOOL empty_branch;
2372    
2373      /* Test for forward reference */      /* Test for forward reference or uncompleted reference. This is disabled
2374        when called to scan a completed pattern by setting cd->start_workspace to
2375        NULL. */
2376    
2377        if (cd->start_workspace != NULL)
2378          {
2379          const pcre_uchar *tcode;
2380          for (tcode = cd->start_workspace; tcode < cd->hwm; tcode += LINK_SIZE)
2381            if ((int)GET(tcode, 0) == (int)(code + 1 - cd->start_code)) return TRUE;
2382          if (GET(scode, 1) == 0) return TRUE;    /* Unclosed */
2383          }
2384    
2385        /* If we are scanning a completed pattern, there are no forward references
2386        and all groups are complete. We need to detect whether this is a recursive
2387        call, as otherwise there will be an infinite loop. If it is a recursion,
2388        just skip over it. Simple recursions are easily detected. For mutual
2389        recursions we keep a chain on the stack. */
2390    
2391        else
2392          {
2393          recurse_check *r = recurses;
2394          const pcre_uchar *endgroup = scode;
2395    
2396      for (scode = cd->start_workspace; scode < cd->hwm; scode += LINK_SIZE)        do endgroup += GET(endgroup, 1); while (*endgroup == OP_ALT);
2397        if (GET(scode, 0) == code + 1 - cd->start_code) return TRUE;        if (code >= scode && code <= endgroup) continue;  /* Simple recursion */
2398    
2399      /* Not a forward reference, test for completed backward reference */        for (r = recurses; r != NULL; r = r->prev)
2400            if (r->group == scode) break;
2401          if (r != NULL) continue;   /* Mutual recursion */
2402          }
2403    
2404      empty_branch = FALSE;      /* Completed reference; scan the referenced group, remembering it on the
2405      scode = cd->start_code + GET(code, 1);      stack chain to detect mutual recursions. */
     if (GET(scode, 1) == 0) return TRUE;    /* Unclosed */  
2406    
2407      /* Completed backwards reference */      empty_branch = FALSE;
2408        this_recurse.prev = recurses;
2409        this_recurse.group = scode;
2410    
2411      do      do
2412        {        {
2413        if (could_be_empty_branch(scode, endcode, utf, cd))        if (could_be_empty_branch(scode, endcode, utf, cd, &this_recurse))
2414          {          {
2415          empty_branch = TRUE;          empty_branch = TRUE;
2416          break;          break;
# Line 2420  for (code = first_significant_code(code Line 2466  for (code = first_significant_code(code
2466        empty_branch = FALSE;        empty_branch = FALSE;
2467        do        do
2468          {          {
2469          if (!empty_branch && could_be_empty_branch(code, endcode, utf, cd))          if (!empty_branch && could_be_empty_branch(code, endcode, utf, cd, NULL))
2470            empty_branch = TRUE;            empty_branch = TRUE;
2471          code += GET(code, 1);          code += GET(code, 1);
2472          }          }
# Line 2462  for (code = first_significant_code(code Line 2508  for (code = first_significant_code(code
2508        case OP_CRMINSTAR:        case OP_CRMINSTAR:
2509        case OP_CRQUERY:        case OP_CRQUERY:
2510        case OP_CRMINQUERY:        case OP_CRMINQUERY:
2511          case OP_CRPOSSTAR:
2512          case OP_CRPOSQUERY:
2513        break;        break;
2514    
2515        default:                   /* Non-repeat => class must match */        default:                   /* Non-repeat => class must match */
2516        case OP_CRPLUS:            /* These repeats aren't empty */        case OP_CRPLUS:            /* These repeats aren't empty */
2517        case OP_CRMINPLUS:        case OP_CRMINPLUS:
2518          case OP_CRPOSPLUS:
2519        return FALSE;        return FALSE;
2520    
2521        case OP_CRRANGE:        case OP_CRRANGE:
2522        case OP_CRMINRANGE:        case OP_CRMINRANGE:
2523          case OP_CRPOSRANGE:
2524        if (GET2(ccode, 1) > 0) return FALSE;  /* Minimum > 0 */        if (GET2(ccode, 1) > 0) return FALSE;  /* Minimum > 0 */
2525        break;        break;
2526        }        }
# Line 2478  for (code = first_significant_code(code Line 2528  for (code = first_significant_code(code
2528    
2529      /* Opcodes that must match a character */      /* Opcodes that must match a character */
2530    
2531        case OP_ANY:
2532        case OP_ALLANY:
2533        case OP_ANYBYTE:
2534    
2535      case OP_PROP:      case OP_PROP:
2536      case OP_NOTPROP:      case OP_NOTPROP:
2537        case OP_ANYNL:
2538    
2539        case OP_NOT_HSPACE:
2540        case OP_HSPACE:
2541        case OP_NOT_VSPACE:
2542        case OP_VSPACE:
2543      case OP_EXTUNI:      case OP_EXTUNI:
2544    
2545      case OP_NOT_DIGIT:      case OP_NOT_DIGIT:
2546      case OP_DIGIT:      case OP_DIGIT:
2547      case OP_NOT_WHITESPACE:      case OP_NOT_WHITESPACE:
2548      case OP_WHITESPACE:      case OP_WHITESPACE:
2549      case OP_NOT_WORDCHAR:      case OP_NOT_WORDCHAR:
2550      case OP_WORDCHAR:      case OP_WORDCHAR:
2551      case OP_ANY:  
     case OP_ALLANY:  
     case OP_ANYBYTE:  
2552      case OP_CHAR:      case OP_CHAR:
2553      case OP_CHARI:      case OP_CHARI:
2554      case OP_NOT:      case OP_NOT:
2555      case OP_NOTI:      case OP_NOTI:
2556    
2557      case OP_PLUS:      case OP_PLUS:
2558        case OP_PLUSI:
2559      case OP_MINPLUS:      case OP_MINPLUS:
2560      case OP_POSPLUS:      case OP_MINPLUSI:
2561      case OP_EXACT:  
2562      case OP_NOTPLUS:      case OP_NOTPLUS:
2563        case OP_NOTPLUSI:
2564      case OP_NOTMINPLUS:      case OP_NOTMINPLUS:
2565        case OP_NOTMINPLUSI:
2566    
2567        case OP_POSPLUS:
2568        case OP_POSPLUSI:
2569      case OP_NOTPOSPLUS:      case OP_NOTPOSPLUS:
2570        case OP_NOTPOSPLUSI:
2571    
2572        case OP_EXACT:
2573        case OP_EXACTI:
2574      case OP_NOTEXACT:      case OP_NOTEXACT:
2575        case OP_NOTEXACTI:
2576    
2577      case OP_TYPEPLUS:      case OP_TYPEPLUS:
2578      case OP_TYPEMINPLUS:      case OP_TYPEMINPLUS:
2579      case OP_TYPEPOSPLUS:      case OP_TYPEPOSPLUS:
2580      case OP_TYPEEXACT:      case OP_TYPEEXACT:
2581    
2582      return FALSE;      return FALSE;
2583    
2584      /* These are going to continue, as they may be empty, but we have to      /* These are going to continue, as they may be empty, but we have to
# Line 2525  for (code = first_significant_code(code Line 2598  for (code = first_significant_code(code
2598      case OP_TYPEUPTO:      case OP_TYPEUPTO:
2599      case OP_TYPEMINUPTO:      case OP_TYPEMINUPTO:
2600      case OP_TYPEPOSUPTO:      case OP_TYPEPOSUPTO:
2601      if (code[1 + IMM2_SIZE] == OP_PROP      if (code[1 + IMM2_SIZE] == OP_PROP || code[1 + IMM2_SIZE] == OP_NOTPROP)
2602        || code[1 + IMM2_SIZE] == OP_NOTPROP) code += 2;        code += 2;
2603      break;      break;
2604    
2605      /* End of branch */      /* End of branch */
# Line 2539  for (code = first_significant_code(code Line 2612  for (code = first_significant_code(code
2612      return TRUE;      return TRUE;
2613    
2614      /* In UTF-8 mode, STAR, MINSTAR, POSSTAR, QUERY, MINQUERY, POSQUERY, UPTO,      /* In UTF-8 mode, STAR, MINSTAR, POSSTAR, QUERY, MINQUERY, POSQUERY, UPTO,
2615      MINUPTO, and POSUPTO may be followed by a multibyte character */      MINUPTO, and POSUPTO and their caseless and negative versions may be
2616        followed by a multibyte character. */
2617    
2618  #ifdef SUPPORT_UTF  #if defined SUPPORT_UTF && !defined COMPILE_PCRE32
2619      case OP_STAR:      case OP_STAR:
2620      case OP_STARI:      case OP_STARI:
2621        case OP_NOTSTAR:
2622        case OP_NOTSTARI:
2623    
2624      case OP_MINSTAR:      case OP_MINSTAR:
2625      case OP_MINSTARI:      case OP_MINSTARI:
2626        case OP_NOTMINSTAR:
2627        case OP_NOTMINSTARI:
2628    
2629      case OP_POSSTAR:      case OP_POSSTAR:
2630      case OP_POSSTARI:      case OP_POSSTARI:
2631        case OP_NOTPOSSTAR:
2632        case OP_NOTPOSSTARI:
2633    
2634      case OP_QUERY:      case OP_QUERY:
2635      case OP_QUERYI:      case OP_QUERYI:
2636        case OP_NOTQUERY:
2637        case OP_NOTQUERYI:
2638    
2639      case OP_MINQUERY:      case OP_MINQUERY:
2640      case OP_MINQUERYI:      case OP_MINQUERYI:
2641        case OP_NOTMINQUERY:
2642        case OP_NOTMINQUERYI:
2643    
2644      case OP_POSQUERY:      case OP_POSQUERY:
2645      case OP_POSQUERYI:      case OP_POSQUERYI:
2646        case OP_NOTPOSQUERY:
2647        case OP_NOTPOSQUERYI:
2648    
2649      if (utf && HAS_EXTRALEN(code[1])) code += GET_EXTRALEN(code[1]);      if (utf && HAS_EXTRALEN(code[1])) code += GET_EXTRALEN(code[1]);
2650      break;      break;
2651    
2652      case OP_UPTO:      case OP_UPTO:
2653      case OP_UPTOI:      case OP_UPTOI:
2654        case OP_NOTUPTO:
2655        case OP_NOTUPTOI:
2656    
2657      case OP_MINUPTO:      case OP_MINUPTO:
2658      case OP_MINUPTOI:      case OP_MINUPTOI:
2659        case OP_NOTMINUPTO:
2660        case OP_NOTMINUPTOI:
2661    
2662      case OP_POSUPTO:      case OP_POSUPTO:
2663      case OP_POSUPTOI:      case OP_POSUPTOI:
2664        case OP_NOTPOSUPTO:
2665        case OP_NOTPOSUPTOI:
2666    
2667      if (utf && HAS_EXTRALEN(code[1 + IMM2_SIZE])) code += GET_EXTRALEN(code[1 + IMM2_SIZE]);      if (utf && HAS_EXTRALEN(code[1 + IMM2_SIZE])) code += GET_EXTRALEN(code[1 + IMM2_SIZE]);
2668      break;      break;
2669  #endif  #endif
# Line 2573  for (code = first_significant_code(code Line 2674  for (code = first_significant_code(code
2674      case OP_MARK:      case OP_MARK:
2675      case OP_PRUNE_ARG:      case OP_PRUNE_ARG:
2676      case OP_SKIP_ARG:      case OP_SKIP_ARG:
     code += code[1];  
     break;  
   
2677      case OP_THEN_ARG:      case OP_THEN_ARG:
2678      code += code[1];      code += code[1];
2679      break;      break;
# Line 2607  Arguments: Line 2705  Arguments:
2705    code        points to start of the recursion    code        points to start of the recursion
2706    endcode     points to where to stop (current RECURSE item)    endcode     points to where to stop (current RECURSE item)
2707    bcptr       points to the chain of current (unclosed) branch starts    bcptr       points to the chain of current (unclosed) branch starts
2708    utf         TRUE if in UTF-8 / UTF-16 mode    utf         TRUE if in UTF-8 / UTF-16 / UTF-32 mode
2709    cd          pointers to tables etc    cd          pointers to tables etc
2710    
2711  Returns:      TRUE if what is matched could be empty  Returns:      TRUE if what is matched could be empty
# Line 2619  could_be_empty(const pcre_uchar *code, c Line 2717  could_be_empty(const pcre_uchar *code, c
2717  {  {
2718  while (bcptr != NULL && bcptr->current_branch >= code)  while (bcptr != NULL && bcptr->current_branch >= code)
2719    {    {
2720    if (!could_be_empty_branch(bcptr->current_branch, endcode, utf, cd))    if (!could_be_empty_branch(bcptr->current_branch, endcode, utf, cd, NULL))
2721      return FALSE;      return FALSE;
2722    bcptr = bcptr->outer;    bcptr = bcptr->outer;
2723    }    }
# Line 2629  return TRUE; Line 2727  return TRUE;
2727    
2728    
2729  /*************************************************  /*************************************************
2730  *           Check for POSIX class syntax         *  *        Base opcode of repeated opcodes         *
2731  *************************************************/  *************************************************/
2732    
2733  /* This function is called when the sequence "[:" or "[." or "[=" is  /* Returns the base opcode for repeated single character type opcodes. If the
2734  encountered in a character class. It checks whether this is followed by a  opcode is not a repeated character type, it returns with the original value.
 sequence of characters terminated by a matching ":]" or ".]" or "=]". If we  
 reach an unescaped ']' without the special preceding character, return FALSE.  
   
 Originally, this function only recognized a sequence of letters between the  
 terminators, but it seems that Perl recognizes any sequence of characters,  
 though of course unknown POSIX names are subsequently rejected. Perl gives an  
 "Unknown POSIX class" error for [:f\oo:] for example, where previously PCRE  
 didn't consider this to be a POSIX class. Likewise for [:1234:].  
   
 The problem in trying to be exactly like Perl is in the handling of escapes. We  
 have to be sure that [abc[:x\]pqr] is *not* treated as containing a POSIX  
 class, but [abc[:x\]pqr:]] is (so that an error can be generated). The code  
 below handles the special case of \], but does not try to do any other escape  
 processing. This makes it different from Perl for cases such as [:l\ower:]  
 where Perl recognizes it as the POSIX class "lower" but PCRE does not recognize  
 "l\ower". This is a lesser evil that not diagnosing bad classes when Perl does,  
 I think.  
   
 A user pointed out that PCRE was rejecting [:a[:digit:]] whereas Perl was not.  
 It seems that the appearance of a nested POSIX class supersedes an apparent  
 external class. For example, [:a[:digit:]b:] matches "a", "b", ":", or  
 a digit.  
   
 In Perl, unescaped square brackets may also appear as part of class names. For  
 example, [:a[:abc]b:] gives unknown POSIX class "[:abc]b:]". However, for  
 [:a[:abc]b][b:] it gives unknown POSIX class "[:abc]b][b:]", which does not  
 seem right at all. PCRE does not allow closing square brackets in POSIX class  
 names.  
   
 Arguments:  
   ptr      pointer to the initial [  
   endptr   where to return the end pointer  
2735    
2736  Returns:   TRUE or FALSE  Arguments:  c opcode
2737    Returns:    base opcode for the type
2738  */  */
2739    
2740  static BOOL  static pcre_uchar
2741  check_posix_syntax(const pcre_uchar *ptr, const pcre_uchar **endptr)  get_repeat_base(pcre_uchar c)
2742  {  {
2743  int terminator;          /* Don't combine these lines; the Solaris cc */  return (c > OP_TYPEPOSUPTO)? c :
2744  terminator = *(++ptr);   /* compiler warns about "non-constant" initializer. */         (c >= OP_TYPESTAR)?   OP_TYPESTAR :
2745  for (++ptr; *ptr != 0; ptr++)         (c >= OP_NOTSTARI)?   OP_NOTSTARI :
2746    {         (c >= OP_NOTSTAR)?    OP_NOTSTAR :
2747    if (*ptr == CHAR_BACKSLASH && ptr[1] == CHAR_RIGHT_SQUARE_BRACKET)         (c >= OP_STARI)?      OP_STARI :
2748      ptr++;                               OP_STAR;
   else if (*ptr == CHAR_RIGHT_SQUARE_BRACKET) return FALSE;  
   else  
     {  
     if (*ptr == terminator && ptr[1] == CHAR_RIGHT_SQUARE_BRACKET)  
       {  
       *endptr = ptr;  
       return TRUE;  
       }  
     if (*ptr == CHAR_LEFT_SQUARE_BRACKET &&  
          (ptr[1] == CHAR_COLON || ptr[1] == CHAR_DOT ||  
           ptr[1] == CHAR_EQUALS_SIGN) &&  
         check_posix_syntax(ptr, endptr))  
       return FALSE;  
     }  
   }  
 return FALSE;  
2749  }  }
2750    
2751    
2752    
2753    #ifdef SUPPORT_UCP
2754  /*************************************************  /*************************************************
2755  *          Check POSIX class name                *  *        Check a character and a property        *
2756  *************************************************/  *************************************************/
2757    
2758  /* This function is called to check the name given in a POSIX-style class entry  /* This function is called by check_auto_possessive() when a property item
2759  such as [:alnum:].  is adjacent to a fixed character.
2760    
2761  Arguments:  Arguments:
2762    ptr        points to the first letter    c            the character
2763    len        the length of the name    ptype        the property type
2764      pdata        the data for the type
2765      negated      TRUE if it's a negated property (\P or \p{^)
2766    
2767  Returns:     a value representing the name, or -1 if unknown  Returns:       TRUE if auto-possessifying is OK
2768  */  */
2769    
2770  static int  static BOOL
2771  check_posix_name(const pcre_uchar *ptr, int len)  check_char_prop(pcre_uint32 c, unsigned int ptype, unsigned int pdata,
2772      BOOL negated)
2773  {  {
2774  const char *pn = posix_names;  const pcre_uint32 *p;
2775  register int yield = 0;  const ucd_record *prop = GET_UCD(c);
 while (posix_name_lengths[yield] != 0)  
   {  
   if (len == posix_name_lengths[yield] &&  
     STRNCMP_UC_C8(ptr, pn, len) == 0) return yield;  
   pn += posix_name_lengths[yield] + 1;  
   yield++;  
   }  
 return -1;  
 }  
   
   
 /*************************************************  
 *    Adjust OP_RECURSE items in repeated group   *  
 *************************************************/  
2776    
2777  /* OP_RECURSE items contain an offset from the start of the regex to the group  switch(ptype)
2778  that is referenced. This means that groups can be replicated for fixed    {
2779  repetition simply by copying (because the recursion is allowed to refer to    case PT_LAMP:
2780  earlier groups that are outside the current group). However, when a group is    return (prop->chartype == ucp_Lu ||
2781  optional (i.e. the minimum quantifier is zero), OP_BRAZERO or OP_SKIPZERO is            prop->chartype == ucp_Ll ||
2782  inserted before it, after it has been compiled. This means that any OP_RECURSE            prop->chartype == ucp_Lt) == negated;
 items within it that refer to the group itself or any contained groups have to  
 have their offsets adjusted. That one of the jobs of this function. Before it  
 is called, the partially compiled regex must be temporarily terminated with  
 OP_END.  
2783    
2784  This function has been extended with the possibility of forward references for    case PT_GC:
2785  recursions and subroutine calls. It must also check the list of such references    return (pdata == PRIV(ucp_gentype)[prop->chartype]) == negated;
 for the group we are dealing with. If it finds that one of the recursions in  
 the current group is on this list, it adjusts the offset in the list, not the  
 value in the reference (which is a group number).  
2786    
2787  Arguments:    case PT_PC:
2788    group      points to the start of the group    return (pdata == prop->chartype) == negated;
   adjust     the amount by which the group is to be moved  
   utf        TRUE in UTF-8 / UTF-16 mode  
   cd         contains pointers to tables etc.  
   save_hwm   the hwm forward reference pointer at the start of the group  
2789    
2790  Returns:     nothing    case PT_SC:
2791  */    return (pdata == prop->script) == negated;
2792    
2793  static void    /* These are specials */
 adjust_recurse(pcre_uchar *group, int adjust, BOOL utf, compile_data *cd,  
   pcre_uchar *save_hwm)  
 {  
 pcre_uchar *ptr = group;  
2794    
2795  while ((ptr = (pcre_uchar *)find_recurse(ptr, utf)) != NULL)    case PT_ALNUM:
2796    {    return (PRIV(ucp_gentype)[prop->chartype] == ucp_L ||
2797    int offset;            PRIV(ucp_gentype)[prop->chartype] == ucp_N) == negated;
   pcre_uchar *hc;  
2798    
2799    /* See if this recursion is on the forward reference list. If so, adjust the    /* Perl space used to exclude VT, but from Perl 5.18 it is included, which
2800    reference. */    means that Perl space and POSIX space are now identical. PCRE was changed
2801      at release 8.34. */
2802    
2803    for (hc = save_hwm; hc < cd->hwm; hc += LINK_SIZE)    case PT_SPACE:    /* Perl space */
2804      case PT_PXSPACE:  /* POSIX space */
2805      switch(c)
2806      {      {
2807      offset = GET(hc, 0);      HSPACE_CASES:
2808      if (cd->start_code + offset == ptr + 1)      VSPACE_CASES:
2809        {      return negated;
2810        PUT(hc, 0, offset + adjust);  
2811        break;      default:
2812        }      return (PRIV(ucp_gentype)[prop->chartype] == ucp_Z) == negated;
2813      }      }
2814      break;  /* Control never reaches here */
2815    
2816    /* Otherwise, adjust the recursion offset if it's after the start of this    case PT_WORD:
2817    group. */    return (PRIV(ucp_gentype)[prop->chartype] == ucp_L ||
2818              PRIV(ucp_gentype)[prop->chartype] == ucp_N ||
2819              c == CHAR_UNDERSCORE) == negated;
2820    
2821    if (hc >= cd->hwm)    case PT_CLIST:
2822      p = PRIV(ucd_caseless_sets) + prop->caseset;
2823      for (;;)
2824      {      {
2825      offset = GET(ptr, 1);      if (c < *p) return !negated;
2826      if (cd->start_code + offset >= group) PUT(ptr, 1, offset + adjust);      if (c == *p++) return negated;
2827      }      }
2828      break;  /* Control never reaches here */
   ptr += 1 + LINK_SIZE;  
2829    }    }
2830    
2831    return FALSE;
2832  }  }
2833    #endif  /* SUPPORT_UCP */
2834    
2835    
2836    
2837  /*************************************************  /*************************************************
2838  *        Insert an automatic callout point       *  *        Fill the character property list        *
2839  *************************************************/  *************************************************/
2840    
2841  /* This function is called when the PCRE_AUTO_CALLOUT option is set, to insert  /* Checks whether the code points to an opcode that can take part in auto-
2842  callout points before each pattern item.  possessification, and if so, fills a list with its properties.
2843    
2844  Arguments:  Arguments:
2845    code           current code pointer    code        points to start of expression
2846    ptr            current pattern pointer    utf         TRUE if in UTF-8 / UTF-16 / UTF-32 mode
2847    cd             pointers to tables etc    fcc         points to case-flipping table
2848      list        points to output list
2849                  list[0] will be filled with the opcode
2850                  list[1] will be non-zero if this opcode
2851                    can match an empty character string
2852                  list[2..7] depends on the opcode
2853    
2854  Returns:         new code pointer  Returns:      points to the start of the next opcode if *code is accepted
2855                  NULL if *code is not accepted
2856  */  */
2857    
2858  static pcre_uchar *  static const pcre_uchar *
2859  auto_callout(pcre_uchar *code, const pcre_uchar *ptr, compile_data *cd)  get_chr_property_list(const pcre_uchar *code, BOOL utf,
2860      const pcre_uint8 *fcc, pcre_uint32 *list)
2861  {  {
2862  *code++ = OP_CALLOUT;  pcre_uchar c = *code;
2863  *code++ = 255;  pcre_uchar base;
2864  PUT(code, 0, (int)(ptr - cd->start_pattern));  /* Pattern offset */  const pcre_uchar *end;
2865  PUT(code, LINK_SIZE, 0);                       /* Default length */  pcre_uint32 chr;
2866  return code + 2 * LINK_SIZE;  
2867    #ifdef SUPPORT_UCP
2868    pcre_uint32 *clist_dest;
2869    const pcre_uint32 *clist_src;
2870    #else
2871    utf = utf;  /* Suppress "unused parameter" compiler warning */
2872    #endif
2873    
2874    list[0] = c;
2875    list[1] = FALSE;
2876    code++;
2877    
2878    if (c >= OP_STAR && c <= OP_TYPEPOSUPTO)
2879      {
2880      base = get_repeat_base(c);
2881      c -= (base - OP_STAR);
2882    
2883      if (c == OP_UPTO || c == OP_MINUPTO || c == OP_EXACT || c == OP_POSUPTO)
2884        code += IMM2_SIZE;
2885    
2886      list[1] = (c != OP_PLUS && c != OP_MINPLUS && c != OP_EXACT && c != OP_POSPLUS);
2887    
2888      switch(base)
2889        {
2890        case OP_STAR:
2891        list[0] = OP_CHAR;
2892        break;
2893    
2894        case OP_STARI:
2895        list[0] = OP_CHARI;
2896        break;
2897    
2898        case OP_NOTSTAR:
2899        list[0] = OP_NOT;
2900        break;
2901    
2902        case OP_NOTSTARI:
2903        list[0] = OP_NOTI;
2904        break;
2905    
2906        case OP_TYPESTAR:
2907        list[0] = *code;
2908        code++;
2909        break;
2910        }
2911      c = list[0];
2912      }
2913    
2914    switch(c)
2915      {
2916      case OP_NOT_DIGIT:
2917      case OP_DIGIT:
2918      case OP_NOT_WHITESPACE:
2919      case OP_WHITESPACE:
2920      case OP_NOT_WORDCHAR:
2921      case OP_WORDCHAR:
2922      case OP_ANY:
2923      case OP_ALLANY:
2924      case OP_ANYNL:
2925      case OP_NOT_HSPACE:
2926      case OP_HSPACE:
2927      case OP_NOT_VSPACE:
2928      case OP_VSPACE:
2929      case OP_EXTUNI:
2930      case OP_EODN:
2931      case OP_EOD:
2932      case OP_DOLL:
2933      case OP_DOLLM:
2934      return code;
2935    
2936      case OP_CHAR:
2937      case OP_NOT:
2938      GETCHARINCTEST(chr, code);
2939      list[2] = chr;
2940      list[3] = NOTACHAR;
2941      return code;
2942    
2943      case OP_CHARI:
2944      case OP_NOTI:
2945      list[0] = (c == OP_CHARI) ? OP_CHAR : OP_NOT;
2946      GETCHARINCTEST(chr, code);
2947      list[2] = chr;
2948    
2949    #ifdef SUPPORT_UCP
2950      if (chr < 128 || (chr < 256 && !utf))
2951        list[3] = fcc[chr];
2952      else
2953        list[3] = UCD_OTHERCASE(chr);
2954    #elif defined SUPPORT_UTF || !defined COMPILE_PCRE8
2955      list[3] = (chr < 256) ? fcc[chr] : chr;
2956    #else
2957      list[3] = fcc[chr];
2958    #endif
2959    
2960      /* The othercase might be the same value. */
2961    
2962      if (chr == list[3])
2963        list[3] = NOTACHAR;
2964      else
2965        list[4] = NOTACHAR;
2966      return code;
2967    
2968    #ifdef SUPPORT_UCP
2969      case OP_PROP:
2970      case OP_NOTPROP:
2971      if (code[0] != PT_CLIST)
2972        {
2973        list[2] = code[0];
2974        list[3] = code[1];
2975        return code + 2;
2976        }
2977    
2978      /* Convert only if we have enough space. */
2979    
2980      clist_src = PRIV(ucd_caseless_sets) + code[1];
2981      clist_dest = list + 2;
2982      code += 2;
2983    
2984      do {
2985         if (clist_dest >= list + 8)
2986           {
2987           /* Early return if there is not enough space. This should never
2988           happen, since all clists are shorter than 5 character now. */
2989           list[2] = code[0];
2990           list[3] = code[1];
2991           return code;
2992           }
2993         *clist_dest++ = *clist_src;
2994         }
2995      while(*clist_src++ != NOTACHAR);
2996    
2997      /* All characters are stored. The terminating NOTACHAR
2998      is copied form the clist itself. */
2999    
3000      list[0] = (c == OP_PROP) ? OP_CHAR : OP_NOT;
3001      return code;
3002    #endif
3003    
3004      case OP_NCLASS:
3005      case OP_CLASS:
3006    #if defined SUPPORT_UTF || !defined COMPILE_PCRE8
3007      case OP_XCLASS:
3008      if (c == OP_XCLASS)
3009        end = code + GET(code, 0) - 1;
3010      else
3011    #endif
3012        end = code + 32 / sizeof(pcre_uchar);
3013    
3014      switch(*end)
3015        {
3016        case OP_CRSTAR:
3017        case OP_CRMINSTAR:
3018        case OP_CRQUERY:
3019        case OP_CRMINQUERY:
3020        case OP_CRPOSSTAR:
3021        case OP_CRPOSQUERY:
3022        list[1] = TRUE;
3023        end++;
3024        break;
3025    
3026        case OP_CRPLUS:
3027        case OP_CRMINPLUS:
3028        case OP_CRPOSPLUS:
3029        end++;
3030        break;
3031    
3032        case OP_CRRANGE:
3033        case OP_CRMINRANGE:
3034        case OP_CRPOSRANGE:
3035        list[1] = (GET2(end, 1) == 0);
3036        end += 1 + 2 * IMM2_SIZE;
3037        break;
3038        }
3039      list[2] = end - code;
3040      return end;
3041      }
3042    return NULL;    /* Opcode not accepted */
3043    }
3044    
3045    
3046    
3047    /*************************************************
3048    *    Scan further character sets for match       *
3049    *************************************************/
3050    
3051    /* Checks whether the base and the current opcode have a common character, in
3052    which case the base cannot be possessified.
3053    
3054    Arguments:
3055      code        points to the byte code
3056      utf         TRUE in UTF-8 / UTF-16 / UTF-32 mode
3057      cd          static compile data
3058      base_list   the data list of the base opcode
3059    
3060    Returns:      TRUE if the auto-possessification is possible
3061    */
3062    
3063    static BOOL
3064    compare_opcodes(const pcre_uchar *code, BOOL utf, const compile_data *cd,
3065      const pcre_uint32 *base_list, const pcre_uchar *base_end)
3066    {
3067    pcre_uchar c;
3068    pcre_uint32 list[8];
3069    const pcre_uint32 *chr_ptr;
3070    const pcre_uint32 *ochr_ptr;
3071    const pcre_uint32 *list_ptr;
3072    const pcre_uchar *next_code;
3073    #if defined SUPPORT_UTF || !defined COMPILE_PCRE8
3074    const pcre_uchar *xclass_flags;
3075    #endif
3076    const pcre_uint8 *class_bitset;
3077    const pcre_uint8 *set1, *set2, *set_end;
3078    pcre_uint32 chr;
3079    BOOL accepted, invert_bits;
3080    
3081    /* Note: the base_list[1] contains whether the current opcode has greedy
3082    (represented by a non-zero value) quantifier. This is a different from
3083    other character type lists, which stores here that the character iterator
3084    matches to an empty string (also represented by a non-zero value). */
3085    
3086    for(;;)
3087      {
3088      /* All operations move the code pointer forward.
3089      Therefore infinite recursions are not possible. */
3090    
3091      c = *code;
3092    
3093      /* Skip over callouts */
3094    
3095      if (c == OP_CALLOUT)
3096        {
3097        code += PRIV(OP_lengths)[c];
3098        continue;
3099        }
3100    
3101      if (c == OP_ALT)
3102        {
3103        do code += GET(code, 1); while (*code == OP_ALT);
3104        c = *code;
3105        }
3106    
3107      switch(c)
3108        {
3109        case OP_END:
3110        case OP_KETRPOS:
3111        /* TRUE only in greedy case. The non-greedy case could be replaced by
3112        an OP_EXACT, but it is probably not worth it. (And note that OP_EXACT
3113        uses more memory, which we cannot get at this stage.) */
3114    
3115        return base_list[1] != 0;
3116    
3117        case OP_KET:
3118        /* If the bracket is capturing, and referenced by an OP_RECURSE, or
3119        it is an atomic sub-pattern (assert, once, etc.) the non-greedy case
3120        cannot be converted to a possessive form. */
3121    
3122        if (base_list[1] == 0) return FALSE;
3123    
3124        switch(*(code - GET(code, 1)))
3125          {
3126          case OP_ASSERT:
3127          case OP_ASSERT_NOT:
3128          case OP_ASSERTBACK:
3129          case OP_ASSERTBACK_NOT:
3130          case OP_ONCE:
3131          case OP_ONCE_NC:
3132          /* Atomic sub-patterns and assertions can always auto-possessify their
3133          last iterator. */
3134          return TRUE;
3135          }
3136    
3137        code += PRIV(OP_lengths)[c];
3138        continue;
3139    
3140        case OP_ONCE:
3141        case OP_ONCE_NC:
3142        case OP_BRA:
3143        case OP_CBRA:
3144        next_code = code + GET(code, 1);
3145        code += PRIV(OP_lengths)[c];
3146    
3147        while (*next_code == OP_ALT)
3148          {
3149          if (!compare_opcodes(code, utf, cd, base_list, base_end)) return FALSE;
3150          code = next_code + 1 + LINK_SIZE;
3151          next_code += GET(next_code, 1);
3152          }
3153        continue;
3154    
3155        case OP_BRAZERO:
3156        case OP_BRAMINZERO:
3157    
3158        next_code = code + 1;
3159        if (*next_code != OP_BRA && *next_code != OP_CBRA
3160            && *next_code != OP_ONCE && *next_code != OP_ONCE_NC) return FALSE;
3161    
3162        do next_code += GET(next_code, 1); while (*next_code == OP_ALT);
3163    
3164        /* The bracket content will be checked by the
3165        OP_BRA/OP_CBRA case above. */
3166        next_code += 1 + LINK_SIZE;
3167        if (!compare_opcodes(next_code, utf, cd, base_list, base_end))
3168          return FALSE;
3169    
3170        code += PRIV(OP_lengths)[c];
3171        continue;
3172        }
3173    
3174      /* Check for a supported opcode, and load its properties. */
3175    
3176      code = get_chr_property_list(code, utf, cd->fcc, list);
3177      if (code == NULL) return FALSE;    /* Unsupported */
3178    
3179      /* If either opcode is a small character list, set pointers for comparing
3180      characters from that list with another list, or with a property. */
3181    
3182      if (base_list[0] == OP_CHAR)
3183        {
3184        chr_ptr = base_list + 2;
3185        list_ptr = list;
3186        }
3187      else if (list[0] == OP_CHAR)
3188        {
3189        chr_ptr = list + 2;
3190        list_ptr = base_list;
3191        }
3192    
3193      /* Character bitsets can also be compared to certain opcodes. */
3194    
3195      else if (base_list[0] == OP_CLASS || list[0] == OP_CLASS
3196    #ifdef COMPILE_PCRE8
3197          /* In 8 bit, non-UTF mode, OP_CLASS and OP_NCLASS are the same. */
3198          || (!utf && (base_list[0] == OP_NCLASS || list[0] == OP_NCLASS))
3199    #endif
3200          )
3201        {
3202    #ifdef COMPILE_PCRE8
3203        if (base_list[0] == OP_CLASS || (!utf && base_list[0] == OP_NCLASS))
3204    #else
3205        if (base_list[0] == OP_CLASS)
3206    #endif
3207          {
3208          set1 = (pcre_uint8 *)(base_end - base_list[2]);
3209          list_ptr = list;
3210          }
3211        else
3212          {
3213          set1 = (pcre_uint8 *)(code - list[2]);
3214          list_ptr = base_list;
3215          }
3216    
3217        invert_bits = FALSE;
3218        switch(list_ptr[0])
3219          {
3220          case OP_CLASS:
3221          case OP_NCLASS:
3222          set2 = (pcre_uint8 *)
3223            ((list_ptr == list ? code : base_end) - list_ptr[2]);
3224          break;
3225    
3226    #if defined SUPPORT_UTF || !defined COMPILE_PCRE8
3227          case OP_XCLASS:
3228          xclass_flags = (list_ptr == list ? code : base_end) - list_ptr[2] + LINK_SIZE;
3229          if ((*xclass_flags & XCL_HASPROP) != 0) return FALSE;
3230          if ((*xclass_flags & XCL_MAP) == 0)
3231            {
3232            /* No bits are set for characters < 256. */
3233            if (list[1] == 0) return TRUE;
3234            /* Might be an empty repeat. */
3235            continue;
3236            }
3237          set2 = (pcre_uint8 *)(xclass_flags + 1);
3238          break;
3239    #endif
3240    
3241          case OP_NOT_DIGIT:
3242          invert_bits = TRUE;
3243          /* Fall through */
3244          case OP_DIGIT:
3245          set2 = (pcre_uint8 *)(cd->cbits + cbit_digit);
3246          break;
3247    
3248          case OP_NOT_WHITESPACE:
3249          invert_bits = TRUE;
3250          /* Fall through */
3251          case OP_WHITESPACE:
3252          set2 = (pcre_uint8 *)(cd->cbits + cbit_space);
3253          break;
3254    
3255          case OP_NOT_WORDCHAR:
3256          invert_bits = TRUE;
3257          /* Fall through */
3258          case OP_WORDCHAR:
3259          set2 = (pcre_uint8 *)(cd->cbits + cbit_word);
3260          break;
3261    
3262          default:
3263          return FALSE;
3264          }
3265    
3266        /* Because the sets are unaligned, we need
3267        to perform byte comparison here. */
3268        set_end = set1 + 32;
3269        if (invert_bits)
3270          {
3271          do
3272            {
3273            if ((*set1++ & ~(*set2++)) != 0) return FALSE;
3274            }
3275          while (set1 < set_end);
3276          }
3277        else
3278          {
3279          do
3280            {
3281            if ((*set1++ & *set2++) != 0) return FALSE;
3282            }
3283          while (set1 < set_end);
3284          }
3285    
3286        if (list[1] == 0) return TRUE;
3287        /* Might be an empty repeat. */
3288        continue;
3289        }
3290    
3291      /* Some property combinations also acceptable. Unicode property opcodes are
3292      processed specially; the rest can be handled with a lookup table. */
3293    
3294      else
3295        {
3296        pcre_uint32 leftop, rightop;
3297    
3298        leftop = base_list[0];
3299        rightop = list[0];
3300    
3301    #ifdef SUPPORT_UCP
3302        accepted = FALSE; /* Always set in non-unicode case. */
3303        if (leftop == OP_PROP || leftop == OP_NOTPROP)
3304          {
3305          if (rightop == OP_EOD)
3306            accepted = TRUE;
3307          else if (rightop == OP_PROP || rightop == OP_NOTPROP)
3308            {
3309            int n;
3310            const pcre_uint8 *p;
3311            BOOL same = leftop == rightop;
3312            BOOL lisprop = leftop == OP_PROP;
3313            BOOL risprop = rightop == OP_PROP;
3314            BOOL bothprop = lisprop && risprop;
3315    
3316            /* There's a table that specifies how each combination is to be
3317            processed:
3318              0   Always return FALSE (never auto-possessify)
3319              1   Character groups are distinct (possessify if both are OP_PROP)
3320              2   Check character categories in the same group (general or particular)
3321              3   Return TRUE if the two opcodes are not the same
3322              ... see comments below
3323            */
3324    
3325            n = propposstab[base_list[2]][list[2]];
3326            switch(n)
3327              {
3328              case 0: break;
3329              case 1: accepted = bothprop; break;
3330              case 2: accepted = (base_list[3] == list[3]) != same; break;
3331              case 3: accepted = !same; break;
3332    
3333              case 4:  /* Left general category, right particular category */
3334              accepted = risprop && catposstab[base_list[3]][list[3]] == same;
3335              break;
3336    
3337              case 5:  /* Right general category, left particular category */
3338              accepted = lisprop && catposstab[list[3]][base_list[3]] == same;
3339              break;
3340    
3341              /* This code is logically tricky. Think hard before fiddling with it.
3342              The posspropstab table has four entries per row. Each row relates to
3343              one of PCRE's special properties such as ALNUM or SPACE or WORD.
3344              Only WORD actually needs all four entries, but using repeats for the
3345              others means they can all use the same code below.
3346    
3347              The first two entries in each row are Unicode general categories, and
3348              apply always, because all the characters they include are part of the
3349              PCRE character set. The third and fourth entries are a general and a
3350              particular category, respectively, that include one or more relevant
3351              characters. One or the other is used, depending on whether the check
3352              is for a general or a particular category. However, in both cases the
3353              category contains more characters than the specials that are defined
3354              for the property being tested against. Therefore, it cannot be used
3355              in a NOTPROP case.
3356    
3357              Example: the row for WORD contains ucp_L, ucp_N, ucp_P, ucp_Po.
3358              Underscore is covered by ucp_P or ucp_Po. */
3359    
3360              case 6:  /* Left alphanum vs right general category */
3361              case 7:  /* Left space vs right general category */
3362              case 8:  /* Left word vs right general category */
3363              p = posspropstab[n-6];
3364              accepted = risprop && lisprop ==
3365                (list[3] != p[0] &&
3366                 list[3] != p[1] &&
3367                (list[3] != p[2] || !lisprop));
3368              break;
3369    
3370              case 9:   /* Right alphanum vs left general category */
3371              case 10:  /* Right space vs left general category */
3372              case 11:  /* Right word vs left general category */
3373              p = posspropstab[n-9];
3374              accepted = lisprop && risprop ==
3375                (base_list[3] != p[0] &&
3376                 base_list[3] != p[1] &&
3377                (base_list[3] != p[2] || !risprop));
3378              break;
3379    
3380              case 12:  /* Left alphanum vs right particular category */
3381              case 13:  /* Left space vs right particular category */
3382              case 14:  /* Left word vs right particular category */
3383              p = posspropstab[n-12];
3384              accepted = risprop && lisprop ==
3385                (catposstab[p[0]][list[3]] &&
3386                 catposstab[p[1]][list[3]] &&
3387                (list[3] != p[3] || !lisprop));
3388              break;
3389    
3390              case 15:  /* Right alphanum vs left particular category */
3391              case 16:  /* Right space vs left particular category */
3392              case 17:  /* Right word vs left particular category */
3393              p = posspropstab[n-15];
3394              accepted = lisprop && risprop ==
3395                (catposstab[p[0]][base_list[3]] &&
3396                 catposstab[p[1]][base_list[3]] &&
3397                (base_list[3] != p[3] || !risprop));
3398              break;
3399              }
3400            }
3401          }
3402    
3403        else
3404    #endif  /* SUPPORT_UCP */
3405    
3406        accepted = leftop >= FIRST_AUTOTAB_OP && leftop <= LAST_AUTOTAB_LEFT_OP &&
3407               rightop >= FIRST_AUTOTAB_OP && rightop <= LAST_AUTOTAB_RIGHT_OP &&
3408               autoposstab[leftop - FIRST_AUTOTAB_OP][rightop - FIRST_AUTOTAB_OP];
3409    
3410        if (!accepted)
3411          return FALSE;
3412    
3413        if (list[1] == 0) return TRUE;
3414        /* Might be an empty repeat. */
3415        continue;
3416        }
3417    
3418      /* Control reaches here only if one of the items is a small character list.
3419      All characters are checked against the other side. */
3420    
3421      do
3422        {
3423        chr = *chr_ptr;
3424    
3425        switch(list_ptr[0])
3426          {
3427          case OP_CHAR:
3428          ochr_ptr = list_ptr + 2;
3429          do
3430            {
3431            if (chr == *ochr_ptr) return FALSE;
3432            ochr_ptr++;
3433            }
3434          while(*ochr_ptr != NOTACHAR);
3435          break;
3436    
3437          case OP_NOT:
3438          ochr_ptr = list_ptr + 2;
3439          do
3440            {
3441            if (chr == *ochr_ptr)
3442              break;
3443            ochr_ptr++;
3444            }
3445          while(*ochr_ptr != NOTACHAR);
3446          if (*ochr_ptr == NOTACHAR) return FALSE;   /* Not found */
3447          break;
3448    
3449          /* Note that OP_DIGIT etc. are generated only when PCRE_UCP is *not*
3450          set. When it is set, \d etc. are converted into OP_(NOT_)PROP codes. */
3451    
3452          case OP_DIGIT:
3453          if (chr < 256 && (cd->ctypes[chr] & ctype_digit) != 0) return FALSE;
3454          break;
3455    
3456          case OP_NOT_DIGIT:
3457          if (chr > 255 || (cd->ctypes[chr] & ctype_digit) == 0) return FALSE;
3458          break;
3459    
3460          case OP_WHITESPACE:
3461          if (chr < 256 && (cd->ctypes[chr] & ctype_space) != 0) return FALSE;
3462          break;
3463    
3464          case OP_NOT_WHITESPACE:
3465          if (chr > 255 || (cd->ctypes[chr] & ctype_space) == 0) return FALSE;
3466          break;
3467    
3468          case OP_WORDCHAR:
3469          if (chr < 255 && (cd->ctypes[chr] & ctype_word) != 0) return FALSE;
3470          break;
3471    
3472          case OP_NOT_WORDCHAR:
3473          if (chr > 255 || (cd->ctypes[chr] & ctype_word) == 0) return FALSE;
3474          break;
3475    
3476          case OP_HSPACE:
3477          switch(chr)
3478            {
3479            HSPACE_CASES: return FALSE;
3480            default: break;
3481            }
3482          break;
3483    
3484          case OP_NOT_HSPACE:
3485          switch(chr)
3486            {
3487            HSPACE_CASES: break;
3488            default: return FALSE;
3489            }
3490          break;
3491    
3492          case OP_ANYNL:
3493          case OP_VSPACE:
3494          switch(chr)
3495            {
3496            VSPACE_CASES: return FALSE;
3497            default: break;
3498            }
3499          break;
3500    
3501          case OP_NOT_VSPACE:
3502          switch(chr)
3503            {
3504            VSPACE_CASES: break;
3505            default: return FALSE;
3506            }
3507          break;
3508    
3509          case OP_DOLL:
3510          case OP_EODN:
3511          switch (chr)
3512            {
3513            case CHAR_CR:
3514            case CHAR_LF:
3515            case CHAR_VT:
3516            case CHAR_FF:
3517            case CHAR_NEL:
3518    #ifndef EBCDIC
3519            case 0x2028:
3520            case 0x2029:
3521    #endif  /* Not EBCDIC */
3522            return FALSE;
3523            }
3524          break;
3525    
3526          case OP_EOD:    /* Can always possessify before \z */
3527          break;
3528    
3529    #ifdef SUPPORT_UCP
3530          case OP_PROP:
3531          case OP_NOTPROP:
3532          if (!check_char_prop(chr, list_ptr[2], list_ptr[3],
3533                list_ptr[0] == OP_NOTPROP))
3534            return FALSE;
3535          break;
3536    #endif
3537    
3538          case OP_NCLASS:
3539          if (chr > 255) return FALSE;
3540          /* Fall through */
3541    
3542          case OP_CLASS:
3543          if (chr > 255) break;
3544          class_bitset = (pcre_uint8 *)
3545            ((list_ptr == list ? code : base_end) - list_ptr[2]);
3546          if ((class_bitset[chr >> 3] & (1 << (chr & 7))) != 0) return FALSE;
3547          break;
3548    
3549    #if defined SUPPORT_UTF || !defined COMPILE_PCRE8
3550          case OP_XCLASS:
3551          if (PRIV(xclass)(chr, (list_ptr == list ? code : base_end) -
3552              list_ptr[2] + LINK_SIZE, utf)) return FALSE;
3553          break;
3554    #endif
3555    
3556          default:
3557          return FALSE;
3558          }
3559    
3560        chr_ptr++;
3561        }
3562      while(*chr_ptr != NOTACHAR);
3563    
3564      /* At least one character must be matched from this opcode. */
3565    
3566      if (list[1] == 0) return TRUE;
3567      }
3568    
3569    return FALSE;
3570    }
3571    
3572    
3573    
3574    /*************************************************
3575    *    Scan compiled regex for auto-possession     *
3576    *************************************************/
3577    
3578    /* Replaces single character iterations with their possessive alternatives
3579    if appropriate. This function modifies the compiled opcode!
3580    
3581    Arguments:
3582      code        points to start of the byte code
3583      utf         TRUE in UTF-8 / UTF-16 / UTF-32 mode
3584      cd          static compile data
3585    
3586    Returns:      nothing
3587    */
3588    
3589    static void
3590    auto_possessify(pcre_uchar *code, BOOL utf, const compile_data *cd)
3591    {
3592    register pcre_uchar c;
3593    const pcre_uchar *end;
3594    pcre_uchar *repeat_opcode;
3595    pcre_uint32 list[8];
3596    
3597    for (;;)
3598      {
3599      c = *code;
3600    
3601      if (c >= OP_STAR && c <= OP_TYPEPOSUPTO)
3602        {
3603        c -= get_repeat_base(c) - OP_STAR;
3604        end = (c <= OP_MINUPTO) ?
3605          get_chr_property_list(code, utf, cd->fcc, list) : NULL;
3606        list[1] = c == OP_STAR || c == OP_PLUS || c == OP_QUERY || c == OP_UPTO;
3607    
3608        if (end != NULL && compare_opcodes(end, utf, cd, list, end))
3609          {
3610          switch(c)
3611            {
3612            case OP_STAR:
3613            *code += OP_POSSTAR - OP_STAR;
3614            break;
3615    
3616            case OP_MINSTAR:
3617            *code += OP_POSSTAR - OP_MINSTAR;
3618            break;
3619    
3620            case OP_PLUS:
3621            *code += OP_POSPLUS - OP_PLUS;
3622            break;
3623    
3624            case OP_MINPLUS:
3625            *code += OP_POSPLUS - OP_MINPLUS;
3626            break;
3627    
3628            case OP_QUERY:
3629            *code += OP_POSQUERY - OP_QUERY;
3630            break;
3631    
3632            case OP_MINQUERY:
3633            *code += OP_POSQUERY - OP_MINQUERY;
3634            break;
3635    
3636            case OP_UPTO:
3637            *code += OP_POSUPTO - OP_UPTO;
3638            break;
3639    
3640            case OP_MINUPTO:
3641            *code += OP_MINUPTO - OP_UPTO;
3642            break;
3643            }
3644          }
3645        c = *code;
3646        }
3647      else if (c == OP_CLASS || c == OP_NCLASS || c == OP_XCLASS)
3648        {
3649    #if defined SUPPORT_UTF || !defined COMPILE_PCRE8
3650        if (c == OP_XCLASS)
3651          repeat_opcode = code + GET(code, 1);
3652        else
3653    #endif
3654          repeat_opcode = code + 1 + (32 / sizeof(pcre_uchar));
3655    
3656        c = *repeat_opcode;
3657        if (c >= OP_CRSTAR && c <= OP_CRMINRANGE)
3658          {
3659          /* end must not be NULL. */
3660          end = get_chr_property_list(code, utf, cd->fcc, list);
3661    
3662          list[1] = (c & 1) == 0;
3663    
3664          if (compare_opcodes(end, utf, cd, list, end))
3665            {
3666            switch (c)
3667              {
3668              case OP_CRSTAR:
3669              case OP_CRMINSTAR:
3670              *repeat_opcode = OP_CRPOSSTAR;
3671              break;
3672    
3673              case OP_CRPLUS:
3674              case OP_CRMINPLUS:
3675              *repeat_opcode = OP_CRPOSPLUS;
3676              break;
3677    
3678              case OP_CRQUERY:
3679              case OP_CRMINQUERY:
3680              *repeat_opcode = OP_CRPOSQUERY;
3681              break;
3682    
3683              case OP_CRRANGE:
3684              case OP_CRMINRANGE:
3685              *repeat_opcode = OP_CRPOSRANGE;
3686              break;
3687              }
3688            }
3689          }
3690        c = *code;
3691        }
3692    
3693      switch(c)
3694        {
3695        case OP_END:
3696        return;
3697    
3698        case OP_TYPESTAR:
3699        case OP_TYPEMINSTAR:
3700        case OP_TYPEPLUS:
3701        case OP_TYPEMINPLUS:
3702        case OP_TYPEQUERY:
3703        case OP_TYPEMINQUERY:
3704        case OP_TYPEPOSSTAR:
3705        case OP_TYPEPOSPLUS:
3706        case OP_TYPEPOSQUERY:
3707        if (code[1] == OP_PROP || code[1] == OP_NOTPROP) code += 2;
3708        break;
3709    
3710        case OP_TYPEUPTO:
3711        case OP_TYPEMINUPTO:
3712        case OP_TYPEEXACT:
3713        case OP_TYPEPOSUPTO:
3714        if (code[1 + IMM2_SIZE] == OP_PROP || code[1 + IMM2_SIZE] == OP_NOTPROP)
3715          code += 2;
3716        break;
3717    
3718    #if defined SUPPORT_UTF || !defined COMPILE_PCRE8
3719        case OP_XCLASS:
3720        code += GET(code, 1);
3721        break;
3722    #endif
3723    
3724        case OP_MARK:
3725        case OP_PRUNE_ARG:
3726        case OP_SKIP_ARG:
3727        case OP_THEN_ARG:
3728        code += code[1];
3729        break;
3730        }
3731    
3732      /* Add in the fixed length from the table */
3733    
3734      code += PRIV(OP_lengths)[c];
3735    
3736      /* In UTF-8 mode, opcodes that are followed by a character may be followed by
3737      a multi-byte character. The length in the table is a minimum, so we have to
3738      arrange to skip the extra bytes. */
3739    
3740    #if defined SUPPORT_UTF && !defined COMPILE_PCRE32
3741      if (utf) switch(c)
3742        {
3743        case OP_CHAR:
3744        case OP_CHARI:
3745        case OP_NOT:
3746        case OP_NOTI:
3747        case OP_STAR:
3748        case OP_MINSTAR:
3749        case OP_PLUS:
3750        case OP_MINPLUS:
3751        case OP_QUERY:
3752        case OP_MINQUERY:
3753        case OP_UPTO:
3754        case OP_MINUPTO:
3755        case OP_EXACT:
3756        case OP_POSSTAR:
3757        case OP_POSPLUS:
3758        case OP_POSQUERY:
3759        case OP_POSUPTO:
3760        case OP_STARI:
3761        case OP_MINSTARI:
3762        case OP_PLUSI:
3763        case OP_MINPLUSI:
3764        case OP_QUERYI:
3765        case OP_MINQUERYI:
3766        case OP_UPTOI:
3767        case OP_MINUPTOI:
3768        case OP_EXACTI:
3769        case OP_POSSTARI:
3770        case OP_POSPLUSI:
3771        case OP_POSQUERYI:
3772        case OP_POSUPTOI:
3773        case OP_NOTSTAR:
3774        case OP_NOTMINSTAR:
3775        case OP_NOTPLUS:
3776        case OP_NOTMINPLUS:
3777        case OP_NOTQUERY:
3778        case OP_NOTMINQUERY:
3779        case OP_NOTUPTO:
3780        case OP_NOTMINUPTO:
3781        case OP_NOTEXACT:
3782        case OP_NOTPOSSTAR:
3783        case OP_NOTPOSPLUS:
3784        case OP_NOTPOSQUERY:
3785        case OP_NOTPOSUPTO:
3786        case OP_NOTSTARI:
3787        case OP_NOTMINSTARI:
3788        case OP_NOTPLUSI:
3789        case OP_NOTMINPLUSI:
3790        case OP_NOTQUERYI:
3791        case OP_NOTMINQUERYI:
3792        case OP_NOTUPTOI:
3793        case OP_NOTMINUPTOI:
3794        case OP_NOTEXACTI:
3795        case OP_NOTPOSSTARI:
3796        case OP_NOTPOSPLUSI:
3797        case OP_NOTPOSQUERYI:
3798        case OP_NOTPOSUPTOI:
3799        if (HAS_EXTRALEN(code[-1])) code += GET_EXTRALEN(code[-1]);
3800        break;
3801        }
3802    #else
3803      (void)(utf);  /* Keep compiler happy by referencing function argument */
3804    #endif
3805      }
3806  }  }
3807    
3808    
3809    
3810  /*************************************************  /*************************************************
3811  *         Complete a callout item                *  *           Check for POSIX class syntax         *
3812  *************************************************/  *************************************************/
3813    
3814  /* A callout item contains the length of the next item in the pattern, which  /* This function is called when the sequence "[:" or "[." or "[=" is
3815  we can't fill in till after we have reached the relevant point. This is used  encountered in a character class. It checks whether this is followed by a
3816  for both automatic and manual callouts.  sequence of characters terminated by a matching ":]" or ".]" or "=]". If we
3817    reach an unescaped ']' without the special preceding character, return FALSE.
3818    
3819    Originally, this function only recognized a sequence of letters between the
3820    terminators, but it seems that Perl recognizes any sequence of characters,
3821    though of course unknown POSIX names are subsequently rejected. Perl gives an
3822    "Unknown POSIX class" error for [:f\oo:] for example, where previously PCRE
3823    didn't consider this to be a POSIX class. Likewise for [:1234:].
3824    
3825    The problem in trying to be exactly like Perl is in the handling of escapes. We
3826    have to be sure that [abc[:x\]pqr] is *not* treated as containing a POSIX
3827    class, but [abc[:x\]pqr:]] is (so that an error can be generated). The code
3828    below handles the special case of \], but does not try to do any other escape
3829    processing. This makes it different from Perl for cases such as [:l\ower:]
3830    where Perl recognizes it as the POSIX class "lower" but PCRE does not recognize
3831    "l\ower". This is a lesser evil than not diagnosing bad classes when Perl does,
3832    I think.
3833    
3834    A user pointed out that PCRE was rejecting [:a[:digit:]] whereas Perl was not.
3835    It seems that the appearance of a nested POSIX class supersedes an apparent
3836    external class. For example, [:a[:digit:]b:] matches "a", "b", ":", or
3837    a digit.
3838    
3839    In Perl, unescaped square brackets may also appear as part of class names. For
3840    example, [:a[:abc]b:] gives unknown POSIX class "[:abc]b:]". However, for
3841    [:a[:abc]b][b:] it gives unknown POSIX class "[:abc]b][b:]", which does not
3842    seem right at all. PCRE does not allow closing square brackets in POSIX class
3843    names.
3844    
3845  Arguments:  Arguments:
3846    previous_callout   points to previous callout item    ptr      pointer to the initial [
3847    ptr                current pattern pointer    endptr   where to return the end pointer
   cd                 pointers to tables etc  
3848    
3849  Returns:             nothing  Returns:   TRUE or FALSE
3850  */  */
3851    
3852  static void  static BOOL
3853  complete_callout(pcre_uchar *previous_callout, const pcre_uchar *ptr, compile_data *cd)  check_posix_syntax(const pcre_uchar *ptr, const pcre_uchar **endptr)
3854  {  {
3855  int length = (int)(ptr - cd->start_pattern - GET(previous_callout, 2));  pcre_uchar terminator;          /* Don't combine these lines; the Solaris cc */
3856  PUT(previous_callout, 2 + LINK_SIZE, length);  terminator = *(++ptr);   /* compiler warns about "non-constant" initializer. */
3857    for (++ptr; *ptr != CHAR_NULL; ptr++)
3858      {
3859      if (*ptr == CHAR_BACKSLASH && ptr[1] == CHAR_RIGHT_SQUARE_BRACKET)
3860        ptr++;
3861      else if (*ptr == CHAR_RIGHT_SQUARE_BRACKET) return FALSE;
3862      else
3863        {
3864        if (*ptr == terminator && ptr[1] == CHAR_RIGHT_SQUARE_BRACKET)
3865          {
3866          *endptr = ptr;
3867          return TRUE;
3868          }
3869        if (*ptr == CHAR_LEFT_SQUARE_BRACKET &&
3870             (ptr[1] == CHAR_COLON || ptr[1] == CHAR_DOT ||
3871              ptr[1] == CHAR_EQUALS_SIGN) &&
3872            check_posix_syntax(ptr, endptr))
3873          return FALSE;
3874        }
3875      }
3876    return FALSE;
3877  }  }
3878    
3879    
3880    
3881  #ifdef SUPPORT_UCP  
3882  /*************************************************  /*************************************************
3883  *           Get othercase range                  *  *          Check POSIX class name                *
3884  *************************************************/  *************************************************/
3885    
3886  /* This function is passed the start and end of a class range, in UTF-8 mode  /* This function is called to check the name given in a POSIX-style class entry
3887  with UCP support. It searches up the characters, looking for internal ranges of  such as [:alnum:].
 characters in the "other" case. Each call returns the next one, updating the  
 start address.  
3888    
3889  Arguments:  Arguments:
3890    cptr        points to starting character value; updated    ptr        points to the first letter
3891    d           end value    len        the length of the name
   ocptr       where to put start of othercase range  
   odptr       where to put end of othercase range  
3892    
3893  Yield:        TRUE when range returned; FALSE when no more  Returns:     a value representing the name, or -1 if unknown
3894  */  */
3895    
3896  static BOOL  static int
3897  get_othercase_range(unsigned int *cptr, unsigned int d, unsigned int *ocptr,  check_posix_name(const pcre_uchar *ptr, int len)
   unsigned int *odptr)  
3898  {  {
3899  unsigned int c, othercase, next;  const char *pn = posix_names;
3900    register int yield = 0;
3901    while (posix_name_lengths[yield] != 0)
3902      {
3903      if (len == posix_name_lengths[yield] &&
3904        STRNCMP_UC_C8(ptr, pn, (unsigned int)len) == 0) return yield;
3905      pn += posix_name_lengths[yield] + 1;
3906      yield++;
3907      }
3908    return -1;
3909    }
3910    
 for (c = *cptr; c <= d; c++)  
   { if ((othercase = UCD_OTHERCASE(c)) != c) break; }  
3911    
3912  if (c > d) return FALSE;  /*************************************************
3913    *    Adjust OP_RECURSE items in repeated group   *
3914    *************************************************/
3915    
3916  *ocptr = othercase;  /* OP_RECURSE items contain an offset from the start of the regex to the group
3917  next = othercase + 1;  that is referenced. This means that groups can be replicated for fixed
3918    repetition simply by copying (because the recursion is allowed to refer to
3919    earlier groups that are outside the current group). However, when a group is
3920    optional (i.e. the minimum quantifier is zero), OP_BRAZERO or OP_SKIPZERO is
3921    inserted before it, after it has been compiled. This means that any OP_RECURSE
3922    items within it that refer to the group itself or any contained groups have to
3923    have their offsets adjusted. That one of the jobs of this function. Before it
3924    is called, the partially compiled regex must be temporarily terminated with
3925    OP_END.
3926    
3927  for (++c; c <= d; c++)  This function has been extended with the possibility of forward references for
3928    recursions and subroutine calls. It must also check the list of such references
3929    for the group we are dealing with. If it finds that one of the recursions in
3930    the current group is on this list, it adjusts the offset in the list, not the
3931    value in the reference (which is a group number).
3932    
3933    Arguments:
3934      group      points to the start of the group
3935      adjust     the amount by which the group is to be moved
3936      utf        TRUE in UTF-8 / UTF-16 / UTF-32 mode
3937      cd         contains pointers to tables etc.
3938      save_hwm   the hwm forward reference pointer at the start of the group
3939    
3940    Returns:     nothing
3941    */
3942    
3943    static void
3944    adjust_recurse(pcre_uchar *group, int adjust, BOOL utf, compile_data *cd,
3945      pcre_uchar *save_hwm)
3946    {
3947    pcre_uchar *ptr = group;
3948    
3949    while ((ptr = (pcre_uchar *)find_recurse(ptr, utf)) != NULL)
3950    {    {
3951    if (UCD_OTHERCASE(c) != next) break;    int offset;
3952    next++;    pcre_uchar *hc;
   }  
3953    
3954  *odptr = next - 1;    /* See if this recursion is on the forward reference list. If so, adjust the
3955  *cptr = c;    reference. */
3956    
3957  return TRUE;    for (hc = save_hwm; hc < cd->hwm; hc += LINK_SIZE)
3958        {
3959        offset = (int)GET(hc, 0);
3960        if (cd->start_code + offset == ptr + 1)
3961          {
3962          PUT(hc, 0, offset + adjust);
3963          break;
3964          }
3965        }
3966    
3967      /* Otherwise, adjust the recursion offset if it's after the start of this
3968      group. */
3969    
3970      if (hc >= cd->hwm)
3971        {
3972        offset = (int)GET(ptr, 1);
3973        if (cd->start_code + offset >= group) PUT(ptr, 1, offset + adjust);
3974        }
3975    
3976      ptr += 1 + LINK_SIZE;
3977      }
3978  }  }
3979    
3980    
3981    
3982  /*************************************************  /*************************************************
3983  *        Check a character and a property        *  *        Insert an automatic callout point       *
3984  *************************************************/  *************************************************/
3985    
3986  /* This function is called by check_auto_possessive() when a property item  /* This function is called when the PCRE_AUTO_CALLOUT option is set, to insert
3987  is adjacent to a fixed character.  callout points before each pattern item.
3988    
3989  Arguments:  Arguments:
3990    c            the character    code           current code pointer
3991    ptype        the property type    ptr            current pattern pointer
3992    pdata        the data for the type    cd             pointers to tables etc
   negated      TRUE if it's a negated property (\P or \p{^)  
3993    
3994  Returns:       TRUE if auto-possessifying is OK  Returns:         new code pointer
3995  */  */
3996    
3997  static BOOL  static pcre_uchar *
3998  check_char_prop(int c, int ptype, int pdata, BOOL negated)  auto_callout(pcre_uchar *code, const pcre_uchar *ptr, compile_data *cd)
3999  {  {
4000  const ucd_record *prop = GET_UCD(c);  *code++ = OP_CALLOUT;
4001  switch(ptype)  *code++ = 255;
4002    {  PUT(code, 0, (int)(ptr - cd->start_pattern));  /* Pattern offset */
4003    case PT_LAMP:  PUT(code, LINK_SIZE, 0);                       /* Default length */
4004    return (prop->chartype == ucp_Lu ||  return code + 2 * LINK_SIZE;
4005            prop->chartype == ucp_Ll ||  }
           prop->chartype == ucp_Lt) == negated;  
   
   case PT_GC:  
   return (pdata == PRIV(ucp_gentype)[prop->chartype]) == negated;  
4006    
   case PT_PC:  
   return (pdata == prop->chartype) == negated;  
4007    
   case PT_SC:  
   return (pdata == prop->script) == negated;  
4008    
4009    /* These are specials */  /*************************************************
4010    *         Complete a callout item                *
4011    *************************************************/
4012    
4013    case PT_ALNUM:  /* A callout item contains the length of the next item in the pattern, which
4014    return (PRIV(ucp_gentype)[prop->chartype] == ucp_L ||  we can't fill in till after we have reached the relevant point. This is used
4015            PRIV(ucp_gentype)[prop->chartype] == ucp_N) == negated;  for both automatic and manual callouts.
4016    
4017    case PT_SPACE:    /* Perl space */  Arguments:
4018    return (PRIV(ucp_gentype)[prop->chartype] == ucp_Z ||    previous_callout   points to previous callout item
4019            c == CHAR_HT || c == CHAR_NL || c == CHAR_FF || c == CHAR_CR)    ptr                current pattern pointer
4020            == negated;    cd                 pointers to tables etc
4021    
4022    case PT_PXSPACE:  /* POSIX space */  Returns:             nothing
4023    return (PRIV(ucp_gentype)[prop->chartype] == ucp_Z ||  */
           c == CHAR_HT || c == CHAR_NL || c == CHAR_VT ||  
           c == CHAR_FF || c == CHAR_CR)  
           == negated;  
4024    
4025    case PT_WORD:  static void
4026    return (PRIV(ucp_gentype)[prop->chartype] == ucp_L ||  complete_callout(pcre_uchar *previous_callout, const pcre_uchar *ptr, compile_data *cd)
4027            PRIV(ucp_gentype)[prop->chartype] == ucp_N ||  {
4028            c == CHAR_UNDERSCORE) == negated;  int length = (int)(ptr - cd->start_pattern - GET(previous_callout, 2));
4029    }  PUT(previous_callout, 2 + LINK_SIZE, length);
 return FALSE;  
4030  }  }
 #endif  /* SUPPORT_UCP */  
4031    
4032    
4033    
4034    #ifdef SUPPORT_UCP
4035  /*************************************************  /*************************************************
4036  *     Check if auto-possessifying is possible    *  *           Get othercase range                  *
4037  *************************************************/  *************************************************/
4038    
4039  /* This function is called for unlimited repeats of certain items, to see  /* This function is passed the start and end of a class range, in UTF-8 mode
4040  whether the next thing could possibly match the repeated item. If not, it makes  with UCP support. It searches up the characters, looking for ranges of
4041  sense to automatically possessify the repeated item.  characters in the "other" case. Each call returns the next one, updating the
4042    start address. A character with multiple other cases is returned on its own
4043    with a special return value.
4044    
4045  Arguments:  Arguments:
4046    previous      pointer to the repeated opcode    cptr        points to starting character value; updated
4047    utf           TRUE in UTF-8 / UTF-16 mode    d           end value
4048    ptr           next character in pattern    ocptr       where to put start of othercase range
4049    options       options bits    odptr       where to put end of othercase range
   cd            contains pointers to tables etc.  
4050    
4051  Returns:        TRUE if possessifying is wanted  Yield:        -1 when no more
4052                   0 when a range is returned
4053                  >0 the CASESET offset for char with multiple other cases
4054                    in this case, ocptr contains the original
4055  */  */
4056    
4057  static BOOL  static int
4058  check_auto_possessive(const pcre_uchar *previous, BOOL utf,  get_othercase_range(pcre_uint32 *cptr, pcre_uint32 d, pcre_uint32 *ocptr,
4059    const pcre_uchar *ptr, int options, compile_data *cd)    pcre_uint32 *odptr)
4060  {  {
4061  pcre_int32 c, next;  pcre_uint32 c, othercase, next;
4062  int op_code = *previous++;  unsigned int co;
4063    
4064  /* Skip whitespace and comments in extended mode */  /* Find the first character that has an other case. If it has multiple other
4065    cases, return its case offset value. */
4066    
4067  if ((options & PCRE_EXTENDED) != 0)  for (c = *cptr; c <= d; c++)
4068    {    {
4069    for (;;)    if ((co = UCD_CASESET(c)) != 0)
4070      {      {
4071      while (MAX_255(*ptr) && (cd->ctypes[*ptr] & ctype_space) != 0) ptr++;      *ocptr = c++;   /* Character that has the set */
4072      if (*ptr == CHAR_NUMBER_SIGN)      *cptr = c;      /* Rest of input range */
4073        {      return (int)co;
       ptr++;  
       while (*ptr != 0)  
         {  
         if (IS_NEWLINE(ptr)) { ptr += cd->nllen; break; }  
         ptr++;  
 #ifdef SUPPORT_UTF  
         if (utf) FORWARDCHAR(ptr);  
 #endif  
         }  
       }  
     else break;  
4074      }      }
4075      if ((othercase = UCD_OTHERCASE(c)) != c) break;
4076    }    }
4077    
4078  /* If the next item is one that we can handle, get its value. A non-negative  if (c > d) return -1;  /* Reached end of range */
 value is a character, a negative value is an escape value. */  
   
 if (*ptr == CHAR_BACKSLASH)  
   {  
   int temperrorcode = 0;  
   next = check_escape(&ptr, &temperrorcode, cd->bracount, options, FALSE);  
   if (temperrorcode != 0) return FALSE;  
   ptr++;    /* Point after the escape sequence */  
   }  
 else if (!MAX_255(*ptr) || (cd->ctypes[*ptr] & ctype_meta) == 0)  
   {  
 #ifdef SUPPORT_UTF  
   if (utf) { GETCHARINC(next, ptr); } else  
 #endif  
   next = *ptr++;  
   }  
 else return FALSE;  
4079    
4080  /* Skip whitespace and comments in extended mode */  *ocptr = othercase;
4081    next = othercase + 1;
4082    
4083  if ((options & PCRE_EXTENDED) != 0)  for (++c; c <= d; c++)
4084    {    {
4085    for (;;)    if (UCD_OTHERCASE(c) != next) break;
4086      {    next++;
     while (MAX_255(*ptr) && (cd->ctypes[*ptr] & ctype_space) != 0) ptr++;  
     if (*ptr == CHAR_NUMBER_SIGN)  
       {  
       ptr++;  
       while (*ptr != 0)  
         {  
         if (IS_NEWLINE(ptr)) { ptr += cd->nllen; break; }  
         ptr++;  
 #ifdef SUPPORT_UTF  
         if (utf) FORWARDCHAR(ptr);  
 #endif  
         }  
       }  
     else break;  
     }  
4087    }    }
4088    
4089  /* If the next thing is itself optional, we have to give up. */  *odptr = next - 1;     /* End of othercase range */
4090    *cptr = c;             /* Rest of input range */
4091    return 0;
4092    }
4093    #endif  /* SUPPORT_UCP */
4094    
 if (*ptr == CHAR_ASTERISK || *ptr == CHAR_QUESTION_MARK ||  
   STRNCMP_UC_C8(ptr, STR_LEFT_CURLY_BRACKET STR_0 STR_COMMA, 3) == 0)  
     return FALSE;  
4095    
 /* Now compare the next item with the previous opcode. First, handle cases when  
 the next item is a character. */  
4096    
4097  if (next >= 0) switch(op_code)  /*************************************************
4098    {  *        Add a character or range to a class     *
4099    case OP_CHAR:  *************************************************/
 #ifdef SUPPORT_UTF  
   GETCHARTEST(c, previous);  
 #else  
   c = *previous;  
 #endif  
   return c != next;  
4100    
4101    /* For CHARI (caseless character) we must check the other case. If we have  /* This function packages up the logic of adding a character or range of
4102    Unicode property support, we can use it to test the other case of  characters to a class. The character values in the arguments will be within the
4103    high-valued characters. */  valid values for the current mode (8-bit, 16-bit, UTF, etc). This function is
4104    mutually recursive with the function immediately below.
4105    
4106    case OP_CHARI:  Arguments:
4107  #ifdef SUPPORT_UTF    classbits     the bit map for characters < 256
4108    GETCHARTEST(c, previous);    uchardptr     points to the pointer for extra data
4109  #else    options       the options word
4110    c = *previous;    cd            contains pointers to tables etc.
4111  #endif    start         start of range character
4112    if (c == next) return FALSE;    end           end of range character
 #ifdef SUPPORT_UTF  
   if (utf)  
     {  
     unsigned int othercase;  
     if (next < 128) othercase = cd->fcc[next]; else  
 #ifdef SUPPORT_UCP  
     othercase = UCD_OTHERCASE((unsigned int)next);  
 #else  
     othercase = NOTACHAR;  
 #endif  
     return (unsigned int)c != othercase;  
     }  
   else  
 #endif  /* SUPPORT_UTF */  
   return (c != TABLE_GET((unsigned int)next, cd->fcc, next));  /* Non-UTF-8 mode */  
4113    
4114    case OP_NOT:  Returns:        the number of < 256 characters added
4115  #ifdef SUPPORT_UTF                  the pointer to extra data is updated
4116    GETCHARTEST(c, previous);  */
 #else  
   c = *previous;  
 #endif  
   return c == next;  
4117    
4118    case OP_NOTI:  static int
4119  #ifdef SUPPORT_UTF  add_to_class(pcre_uint8 *classbits, pcre_uchar **uchardptr, int options,
4120    GETCHARTEST(c, previous);    compile_data *cd, pcre_uint32 start, pcre_uint32 end)
4121  #else  {
4122    c = *previous;  pcre_uint32 c;
4123  #endif  pcre_uint32 classbits_end = (end <= 0xff ? end : 0xff);
4124    if (c == next) return TRUE;  int n8 = 0;
4125  #ifdef SUPPORT_UTF  
4126    if (utf)  /* If caseless matching is required, scan the range and process alternate
4127      {  cases. In Unicode, there are 8-bit characters that have alternate cases that
4128      unsigned int othercase;  are greater than 255 and vice-versa. Sometimes we can just extend the original
4129      if (next < 128) othercase = cd->fcc[next]; else  range. */
 #ifdef SUPPORT_UCP  
     othercase = UCD_OTHERCASE((unsigned int)next);  
 #else  
     othercase = NOTACHAR;  
 #endif  
     return (unsigned int)c == othercase;  
     }  
   else  
 #endif  /* SUPPORT_UTF */  
   return (c == TABLE_GET((unsigned int)next, cd->fcc, next));  /* Non-UTF-8 mode */  
4130    
4131    /* Note that OP_DIGIT etc. are generated only when PCRE_UCP is *not* set.  if ((options & PCRE_CASELESS) != 0)
4132    When it is set, \d etc. are converted into OP_(NOT_)PROP codes. */    {
4133    #ifdef SUPPORT_UCP
4134      if ((options & PCRE_UTF8) != 0)
4135        {
4136        int rc;
4137        pcre_uint32 oc, od;
4138    
4139    case OP_DIGIT:      options &= ~PCRE_CASELESS;   /* Remove for recursive calls */
4140    return next > 255 || (cd->ctypes[next] & ctype_digit) == 0;      c = start;
4141    
4142    case OP_NOT_DIGIT:      while ((rc = get_othercase_range(&c, end, &oc, &od)) >= 0)
4143    return next <= 255 && (cd->ctypes[next] & ctype_digit) != 0;        {
4144          /* Handle a single character that has more than one other case. */
4145    
4146    case OP_WHITESPACE:        if (rc > 0) n8 += add_list_to_class(classbits, uchardptr, options, cd,
4147    return next > 255 || (cd->ctypes[next] & ctype_space) == 0;          PRIV(ucd_caseless_sets) + rc, oc);
4148    
4149    case OP_NOT_WHITESPACE:        /* Do nothing if the other case range is within the original range. */
   return next <= 255 && (cd->ctypes[next] & ctype_space) != 0;  
4150    
4151    case OP_WORDCHAR:        else if (oc >= start && od <= end) continue;
   return next > 255 || (cd->ctypes[next] & ctype_word) == 0;  
4152    
4153    case OP_NOT_WORDCHAR:        /* Extend the original range if there is overlap, noting that if oc < c, we
4154    return next <= 255 && (cd->ctypes[next] & ctype_word) != 0;        can't have od > end because a subrange is always shorter than the basic
4155          range. Otherwise, use a recursive call to add the additional range. */
4156    
4157    case OP_HSPACE:        else if (oc < start && od >= start - 1) start = oc; /* Extend downwards */
4158    case OP_NOT_HSPACE:        else if (od > end && oc <= end + 1) end = od;       /* Extend upwards */
4159    switch(next)        else n8 += add_to_class(classbits, uchardptr, options, cd, oc, od);
4160      {        }
     case 0x09:  
     case 0x20:  
     case 0xa0:  
     case 0x1680:  
     case 0x180e:  
     case 0x2000:  
     case 0x2001:  
     case 0x2002:  
     case 0x2003:  
     case 0x2004:  
     case 0x2005:  
     case 0x2006:  
     case 0x2007:  
     case 0x2008:  
     case 0x2009:  
     case 0x200A:  
     case 0x202f:  
     case 0x205f:  
     case 0x3000:  
     return op_code == OP_NOT_HSPACE;  
     default:  
     return op_code != OP_NOT_HSPACE;  
4161      }      }
4162      else
4163    #endif  /* SUPPORT_UCP */
4164    
4165    case OP_ANYNL:    /* Not UTF-mode, or no UCP */
4166    case OP_VSPACE:  
4167    case OP_NOT_VSPACE:    for (c = start; c <= classbits_end; c++)
   switch(next)  
4168      {      {
4169      case 0x0a:      SETBIT(classbits, cd->fcc[c]);
4170      case 0x0b:      n8++;
     case 0x0c:  
     case 0x0d:  
     case 0x85:  
     case 0x2028:  
     case 0x2029:  
     return op_code == OP_NOT_VSPACE;  
     default:  
     return op_code != OP_NOT_VSPACE;  
4171      }      }
   
 #ifdef SUPPORT_UCP  
   case OP_PROP:  
   return check_char_prop(next, previous[0], previous[1], FALSE);  
   
   case OP_NOTPROP:  
   return check_char_prop(next, previous[0], previous[1], TRUE);  
 #endif  
   
   default:  
   return FALSE;  
4172    }    }
4173    
4174    /* Now handle the original range. Adjust the final value according to the bit
4175    length - this means that the same lists of (e.g.) horizontal spaces can be used
4176    in all cases. */
4177    
4178  /* Handle the case when the next item is \d, \s, etc. Note that when PCRE_UCP  #if defined COMPILE_PCRE8
4179  is set, \d turns into ESC_du rather than ESC_d, etc., so ESC_d etc. are  #ifdef SUPPORT_UTF
4180  generated only when PCRE_UCP is *not* set, that is, when only ASCII    if ((options & PCRE_UTF8) == 0)
4181  characteristics are recognized. Similarly, the opcodes OP_DIGIT etc. are  #endif
4182  replaced by OP_PROP codes when PCRE_UCP is set. */    if (end > 0xff) end = 0xff;
4183    
4184  switch(op_code)  #elif defined COMPILE_PCRE16
   {  
   case OP_CHAR:  
   case OP_CHARI:  
4185  #ifdef SUPPORT_UTF  #ifdef SUPPORT_UTF
4186    GETCHARTEST(c, previous);    if ((options & PCRE_UTF16) == 0)
 #else  
   c = *previous;  
4187  #endif  #endif
4188    switch(-next)    if (end > 0xffff) end = 0xffff;
     {  
     case ESC_d:  
     return c > 255 || (cd->ctypes[c] & ctype_digit) == 0;  
4189    
4190      case ESC_D:  #endif /* COMPILE_PCRE[8|16] */
     return c <= 255 && (cd->ctypes[c] & ctype_digit) != 0;  
4191    
4192      case ESC_s:  /* Use the bitmap for characters < 256. Otherwise use extra data.*/
     return c > 255 || (cd->ctypes[c] & ctype_space) == 0;  
4193    
4194      case ESC_S:  for (c = start; c <= classbits_end; c++)
4195      return c <= 255 && (cd->ctypes[c] & ctype_space) != 0;    {
4196      /* Regardless of start, c will always be <= 255. */
4197      SETBIT(classbits, c);
4198      n8++;
4199      }
4200    
4201      case ESC_w:  #if defined SUPPORT_UTF || !defined COMPILE_PCRE8
4202      return c > 255 || (cd->ctypes[c] & ctype_word) == 0;  if (start <= 0xff) start = 0xff + 1;
4203    
4204      case ESC_W:  if (end >= start) {
4205      return c <= 255 && (cd->ctypes[c] & ctype_word) != 0;    pcre_uchar *uchardata = *uchardptr;
4206    
4207      case ESC_h:  #ifdef SUPPORT_UTF
4208      case ESC_H:    if ((options & PCRE_UTF8) != 0)  /* All UTFs use the same flag bit */
4209      switch(c)      {
4210        if (start < end)
4211        {        {
4212        case 0x09:        *uchardata++ = XCL_RANGE;
4213        case 0x20:        uchardata += PRIV(ord2utf)(start, uchardata);
4214        case 0xa0:        uchardata += PRIV(ord2utf)(end, uchardata);
       case 0x1680:  
       case 0x180e:  
       case 0x2000:  
       case 0x2001:  
       case 0x2002:  
       case 0x2003:  
       case 0x2004:  
       case 0x2005:  
       case 0x2006:  
       case 0x2007:  
       case 0x2008:  
       case 0x2009:  
       case 0x200A:  
       case 0x202f:  
       case 0x205f:  
       case 0x3000:  
       return -next != ESC_h;  
       default:  
       return -next == ESC_h;  
4215        }        }
4216        else if (start == end)
     case ESC_v:  
     case ESC_V:  
     switch(c)  
4217        {        {
4218        case 0x0a:        *uchardata++ = XCL_SINGLE;
4219        case 0x0b:        uchardata += PRIV(ord2utf)(start, uchardata);
       case 0x0c:  
       case 0x0d:  
       case 0x85:  
       case 0x2028:  
       case 0x2029:  
       return -next != ESC_v;  
       default:  
       return -next == ESC_v;  
       }  
   
     /* When PCRE_UCP is set, these values get generated for \d etc. Find  
     their substitutions and process them. The result will always be either  
     -ESC_p or -ESC_P. Then fall through to process those values. */  
   
 #ifdef SUPPORT_UCP  
     case ESC_du:  
     case ESC_DU:  
     case ESC_wu:  
     case ESC_WU:  
     case ESC_su:  
     case ESC_SU:  
       {  
       int temperrorcode = 0;  
       ptr = substitutes[-next - ESC_DU];  
       next = check_escape(&ptr, &temperrorcode, 0, options, FALSE);  
       if (temperrorcode != 0) return FALSE;  
       ptr++;    /* For compatibility */  
4220        }        }
4221      /* Fall through */      }
4222      else
4223    #endif  /* SUPPORT_UTF */
4224    
4225      case ESC_p:    /* Without UTF support, character values are constrained by the bit length,
4226      case ESC_P:    and can only be > 256 for 16-bit and 32-bit libraries. */
       {  
       int ptype, pdata, errorcodeptr;  
       BOOL negated;  
4227    
4228        ptr--;      /* Make ptr point at the p or P */  #ifdef COMPILE_PCRE8
4229        ptype = get_ucp(&ptr, &negated, &pdata, &errorcodeptr);      {}
4230        if (ptype < 0) return FALSE;  #else
4231        ptr++;      /* Point past the final curly ket */    if (start < end)
4232        {
4233        *uchardata++ = XCL_RANGE;
4234        *uchardata++ = start;
4235        *uchardata++ = end;
4236        }
4237      else if (start == end)
4238        {
4239        *uchardata++ = XCL_SINGLE;
4240        *uchardata++ = start;
4241        }
4242    #endif
4243    
4244        /* If the property item is optional, we have to give up. (When generated    *uchardptr = uchardata;   /* Updata extra data pointer */
4245        from \d etc by PCRE_UCP, this test will have been applied much earlier,    }
4246        to the original \d etc. At this point, ptr will point to a zero byte. */  #endif /* SUPPORT_UTF || !COMPILE_PCRE8 */
4247    
4248        if (*ptr == CHAR_ASTERISK || *ptr == CHAR_QUESTION_MARK ||  return n8;    /* Number of 8-bit characters */
4249          STRNCMP_UC_C8(ptr, STR_LEFT_CURLY_BRACKET STR_0 STR_COMMA, 3) == 0)  }
           return FALSE;  
4250    
       /* Do the property check. */  
4251    
       return check_char_prop(c, ptype, pdata, (next == -ESC_P) != negated);  
       }  
 #endif  
4252    
     default:  
     return FALSE;  
     }  
4253    
4254    /* In principle, support for Unicode properties should be integrated here as  /*************************************************
4255    well. It means re-organizing the above code so as to get hold of the property  *        Add a list of characters to a class     *
4256    values before switching on the op-code. However, I wonder how many patterns  *************************************************/
   combine ASCII \d etc with Unicode properties? (Note that if PCRE_UCP is set,  
   these op-codes are never generated.) */  
4257    
4258    case OP_DIGIT:  /* This function is used for adding a list of case-equivalent characters to a
4259    return next == -ESC_D || next == -ESC_s || next == -ESC_W ||  class, and also for adding a list of horizontal or vertical whitespace. If the
4260           next == -ESC_h || next == -ESC_v || next == -ESC_R;  list is in order (which it should be), ranges of characters are detected and
4261    handled appropriately. This function is mutually recursive with the function
4262    above.
4263    
4264    case OP_NOT_DIGIT:  Arguments:
4265    return next == -ESC_d;    classbits     the bit map for characters < 256
4266      uchardptr     points to the pointer for extra data
4267      options       the options word
4268      cd            contains pointers to tables etc.
4269      p             points to row of 32-bit values, terminated by NOTACHAR
4270      except        character to omit; this is used when adding lists of
4271                      case-equivalent characters to avoid including the one we
4272                      already know about
4273    
4274    case OP_WHITESPACE:  Returns:        the number of < 256 characters added
4275    return next == -ESC_S || next == -ESC_d || next == -ESC_w;                  the pointer to extra data is updated
4276    */
4277    
4278    case OP_NOT_WHITESPACE:  static int
4279    return next == -ESC_s || next == -ESC_h || next == -ESC_v || next == -ESC_R;  add_list_to_class(pcre_uint8 *classbits, pcre_uchar **uchardptr, int options,
4280      compile_data *cd, const pcre_uint32 *p, unsigned int except)
4281    {
4282    int n8 = 0;
4283    while (p[0] < NOTACHAR)
4284      {
4285      int n = 0;
4286      if (p[0] != except)
4287        {
4288        while(p[n+1] == p[0] + n + 1) n++;
4289        n8 += add_to_class(classbits, uchardptr, options, cd, p[0], p[n]);
4290        }
4291      p += n + 1;
4292      }
4293    return n8;
4294    }
4295    
   case OP_HSPACE:  
   return next == -ESC_S || next == -ESC_H || next == -ESC_d ||  
          next == -ESC_w || next == -ESC_v || next == -ESC_R;  
4296    
   case OP_NOT_HSPACE:  
   return next == -ESC_h;  
4297    
4298    /* Can't have \S in here because VT matches \S (Perl anomaly) */  /*************************************************
4299    case OP_ANYNL:  *    Add characters not in a list to a class     *
4300    case OP_VSPACE:  *************************************************/
   return next == -ESC_V || next == -ESC_d || next == -ESC_w;  
4301    
4302    case OP_NOT_VSPACE:  /* This function is used for adding the complement of a list of horizontal or
4303    return next == -ESC_v || next == -ESC_R;  vertical whitespace to a class. The list must be in order.
4304    
4305    case OP_WORDCHAR:  Arguments:
4306    return next == -ESC_W || next == -ESC_s || next == -ESC_h ||    classbits     the bit map for characters < 256
4307           next == -ESC_v || next == -ESC_R;    uchardptr     points to the pointer for extra data
4308      options       the options word
4309      cd            contains pointers to tables etc.
4310      p             points to row of 32-bit values, terminated by NOTACHAR
4311    
4312    case OP_NOT_WORDCHAR:  Returns:        the number of < 256 characters added
4313    return next == -ESC_w || next == -ESC_d;                  the pointer to extra data is updated
4314    */
4315    
4316    default:  static int
4317    return FALSE;  add_not_list_to_class(pcre_uint8 *classbits, pcre_uchar **uchardptr,
4318      int options, compile_data *cd, const pcre_uint32 *p)
4319    {
4320    BOOL utf = (options & PCRE_UTF8) != 0;
4321    int n8 = 0;
4322    if (p[0] > 0)
4323      n8 += add_to_class(classbits, uchardptr, options, cd, 0, p[0] - 1);
4324    while (p[0] < NOTACHAR)
4325      {
4326      while (p[1] == p[0] + 1) p++;
4327      n8 += add_to_class(classbits, uchardptr, options, cd, p[0] + 1,
4328        (p[1] == NOTACHAR) ? (utf ? 0x10ffffu : 0xffffffffu) : p[1] - 1);
4329      p++;
4330    }    }
4331    return n8;
 /* Control does not reach here */  
4332  }  }
4333    
4334    
# Line 3398  to find out the amount of memory needed, Line 4344  to find out the amount of memory needed,
4344  phase. The value of lengthptr distinguishes the two phases.  phase. The value of lengthptr distinguishes the two phases.
4345    
4346  Arguments:  Arguments:
4347    optionsptr     pointer to the option bits    optionsptr        pointer to the option bits
4348    codeptr        points to the pointer to the current code point    codeptr           points to the pointer to the current code point
4349    ptrptr         points to the current pattern pointer    ptrptr            points to the current pattern pointer
4350    errorcodeptr   points to error code variable    errorcodeptr      points to error code variable
4351    firstcharptr   set to initial literal character, or < 0 (REQ_UNSET, REQ_NONE)    firstcharptr      place to put the first required character
4352    reqcharptr     set to the last literal character required, else < 0    firstcharflagsptr place to put the first character flags, or a negative number
4353    bcptr          points to current branch chain    reqcharptr        place to put the last required character
4354    cond_depth     conditional nesting depth    reqcharflagsptr   place to put the last required character flags, or a negative number
4355    cd             contains pointers to tables etc.    bcptr             points to current branch chain
4356    lengthptr      NULL during the real compile phase    cond_depth        conditional nesting depth
4357                   points to length accumulator during pre-compile phase    cd                contains pointers to tables etc.
4358      lengthptr         NULL during the real compile phase
4359                        points to length accumulator during pre-compile phase
4360    
4361  Returns:         TRUE on success  Returns:            TRUE on success
4362                   FALSE, with *errorcodeptr set non-zero on error                      FALSE, with *errorcodeptr set non-zero on error
4363  */  */
4364    
4365  static BOOL  static BOOL
4366  compile_branch(int *optionsptr, pcre_uchar **codeptr,  compile_branch(int *optionsptr, pcre_uchar **codeptr,
4367    const pcre_uchar **ptrptr, int *errorcodeptr, pcre_int32 *firstcharptr,    const pcre_uchar **ptrptr, int *errorcodeptr,
4368    pcre_int32 *reqcharptr, branch_chain *bcptr, int cond_depth,    pcre_uint32 *firstcharptr, pcre_int32 *firstcharflagsptr,
4369      pcre_uint32 *reqcharptr, pcre_int32 *reqcharflagsptr,
4370      branch_chain *bcptr, int cond_depth,
4371    compile_data *cd, int *lengthptr)    compile_data *cd, int *lengthptr)
4372  {  {
4373  int repeat_type, op_type;  int repeat_type, op_type;
4374  int repeat_min = 0, repeat_max = 0;      /* To please picky compilers */  int repeat_min = 0, repeat_max = 0;      /* To please picky compilers */
4375  int bravalue = 0;  int bravalue = 0;
4376  int greedy_default, greedy_non_default;  int greedy_default, greedy_non_default;
4377  pcre_int32 firstchar, reqchar;  pcre_uint32 firstchar, reqchar;
4378  pcre_int32 zeroreqchar, zerofirstchar;  pcre_int32 firstcharflags, reqcharflags;
4379    pcre_uint32 zeroreqchar, zerofirstchar;
4380    pcre_int32 zeroreqcharflags, zerofirstcharflags;
4381  pcre_int32 req_caseopt, reqvary, tempreqvary;  pcre_int32 req_caseopt, reqvary, tempreqvary;
4382  int options = *optionsptr;               /* May change dynamically */  int options = *optionsptr;               /* May change dynamically */
4383  int after_manual_callout = 0;  int after_manual_callout = 0;
4384  int length_prevgroup = 0;  int length_prevgroup = 0;
4385  register int c;  register pcre_uint32 c;
4386    int escape;
4387  register pcre_uchar *code = *codeptr;  register pcre_uchar *code = *codeptr;
4388  pcre_uchar *last_code = code;  pcre_uchar *last_code = code;
4389  pcre_uchar *orig_code = code;  pcre_uchar *orig_code = code;
# Line 3450  must not do this for other options (e.g. Line 4403  must not do this for other options (e.g.
4403  dynamically as we process the pattern. */  dynamically as we process the pattern. */
4404    
4405  #ifdef SUPPORT_UTF  #ifdef SUPPORT_UTF
4406  /* PCRE_UTF16 has the same value as PCRE_UTF8. */  /* PCRE_UTF[16|32] have the same value as PCRE_UTF8. */
4407  BOOL utf = (options & PCRE_UTF8) != 0;  BOOL utf = (options & PCRE_UTF8) != 0;
4408    #ifndef COMPILE_PCRE32
4409  pcre_uchar utf_chars[6];  pcre_uchar utf_chars[6];
4410    #endif
4411  #else  #else
4412  BOOL utf = FALSE;  BOOL utf = FALSE;
4413  #endif  #endif