/[pcre]/code/branches/pcre16/pcre_compile.c
ViewVC logotype

Diff of /code/branches/pcre16/pcre_compile.c

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

revision 218 by ph10, Thu Aug 16 10:13:23 2007 UTC revision 270 by ph10, Fri Nov 16 19:55:16 2007 UTC
# Line 43  supporting internal functions that are n Line 43  supporting internal functions that are n
43    
44    
45  #ifdef HAVE_CONFIG_H  #ifdef HAVE_CONFIG_H
46  #include <config.h>  #include "config.h"
47  #endif  #endif
48    
49  #define NLBLOCK cd             /* Block containing newline information */  #define NLBLOCK cd             /* Block containing newline information */
# Line 140  static const short int escapes[] = { Line 140  static const short int escapes[] = {
140  #endif  #endif
141    
142    
143  /* Table of special "verbs" like (*PRUNE) */  /* Table of special "verbs" like (*PRUNE). This is a short table, so it is
144    searched linearly. Put all the names into a single string, in order to reduce
145    the number of relocations when a shared library is dynamically linked. */
146    
147  typedef struct verbitem {  typedef struct verbitem {
   const char *name;  
148    int   len;    int   len;
149    int   op;    int   op;
150  } verbitem;  } verbitem;
151    
152    static const char verbnames[] =
153      "ACCEPT\0"
154      "COMMIT\0"
155      "F\0"
156      "FAIL\0"
157      "PRUNE\0"
158      "SKIP\0"
159      "THEN";
160    
161  static verbitem verbs[] = {  static verbitem verbs[] = {
162    { "ACCEPT", 6, OP_ACCEPT },    { 6, OP_ACCEPT },
163    { "COMMIT", 6, OP_COMMIT },    { 6, OP_COMMIT },
164    { "F",      1, OP_FAIL },    { 1, OP_FAIL },
165    { "FAIL",   4, OP_FAIL },    { 4, OP_FAIL },
166    { "PRUNE",  5, OP_PRUNE },    { 5, OP_PRUNE },
167    { "SKIP",   4, OP_SKIP  },    { 4, OP_SKIP  },
168    { "THEN",   4, OP_THEN  }    { 4, OP_THEN  }
169  };  };
170    
171  static int verbcount = sizeof(verbs)/sizeof(verbitem);  static int verbcount = sizeof(verbs)/sizeof(verbitem);
172    
173    
174  /* Tables of names of POSIX character classes and their lengths. The list is  /* Tables of names of POSIX character classes and their lengths. The names are
175  terminated by a zero length entry. The first three must be alpha, lower, upper,  now all in a single string, to reduce the number of relocations when a shared
176  as this is assumed for handling case independence. */  library is dynamically loaded. The list of lengths is terminated by a zero
177    length entry. The first three must be alpha, lower, upper, as this is assumed
178  static const char *const posix_names[] = {  for handling case independence. */
179    "alpha", "lower", "upper",  
180    "alnum", "ascii", "blank", "cntrl", "digit", "graph",  static const char posix_names[] =
181    "print", "punct", "space", "word",  "xdigit" };    "alpha\0"  "lower\0"  "upper\0"  "alnum\0"  "ascii\0"  "blank\0"
182      "cntrl\0"  "digit\0"  "graph\0"  "print\0"  "punct\0"  "space\0"
183      "word\0"   "xdigit";
184    
185  static const uschar posix_name_lengths[] = {  static const uschar posix_name_lengths[] = {
186    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 };
# Line 207  static const int posix_class_maps[] = { Line 219  static const int posix_class_maps[] = {
219  /* The texts of compile-time error messages. These are "char *" because they  /* The texts of compile-time error messages. These are "char *" because they
220  are passed to the outside world. Do not ever re-use any error number, because  are passed to the outside world. Do not ever re-use any error number, because
221  they are documented. Always add a new error instead. Messages marked DEAD below  they are documented. Always add a new error instead. Messages marked DEAD below
222  are no longer used. */  are no longer used. This used to be a table of strings, but in order to reduce
223    the number of relocations needed when a shared library is loaded dynamically,
224  static const char *error_texts[] = {  it is now one long string. We cannot use a table of offsets, because the
225    "no error",  lengths of inserts such as XSTRING(MAX_NAME_SIZE) are not known. Instead, we
226    "\\ at end of pattern",  simply count through to the one we want - this isn't a performance issue
227    "\\c at end of pattern",  because these strings are used only when there is a compilation error. */
228    "unrecognized character follows \\",  
229    "numbers out of order in {} quantifier",  static const char error_texts[] =
230      "no error\0"
231      "\\ at end of pattern\0"
232      "\\c at end of pattern\0"
233      "unrecognized character follows \\\0"
234      "numbers out of order in {} quantifier\0"
235    /* 5 */    /* 5 */
236    "number too big in {} quantifier",    "number too big in {} quantifier\0"
237    "missing terminating ] for character class",    "missing terminating ] for character class\0"
238    "invalid escape sequence in character class",    "invalid escape sequence in character class\0"
239    "range out of order in character class",    "range out of order in character class\0"
240    "nothing to repeat",    "nothing to repeat\0"
241    /* 10 */    /* 10 */
242    "operand of unlimited repeat could match the empty string",  /** DEAD **/    "operand of unlimited repeat could match the empty string\0"  /** DEAD **/
243    "internal error: unexpected repeat",    "internal error: unexpected repeat\0"
244    "unrecognized character after (?",    "unrecognized character after (? or (?-\0"
245    "POSIX named classes are supported only within a class",    "POSIX named classes are supported only within a class\0"
246    "missing )",    "missing )\0"
247    /* 15 */    /* 15 */
248    "reference to non-existent subpattern",    "reference to non-existent subpattern\0"
249    "erroffset passed as NULL",    "erroffset passed as NULL\0"
250    "unknown option bit(s) set",    "unknown option bit(s) set\0"
251    "missing ) after comment",    "missing ) after comment\0"
252    "parentheses nested too deeply",  /** DEAD **/    "parentheses nested too deeply\0"  /** DEAD **/
253    /* 20 */    /* 20 */
254    "regular expression is too large",    "regular expression is too large\0"
255    "failed to get memory",    "failed to get memory\0"
256    "unmatched parentheses",    "unmatched parentheses\0"
257    "internal error: code overflow",    "internal error: code overflow\0"
258    "unrecognized character after (?<",    "unrecognized character after (?<\0"
259    /* 25 */    /* 25 */
260    "lookbehind assertion is not fixed length",    "lookbehind assertion is not fixed length\0"
261    "malformed number or name after (?(",    "malformed number or name after (?(\0"
262    "conditional group contains more than two branches",    "conditional group contains more than two branches\0"
263    "assertion expected after (?(",    "assertion expected after (?(\0"
264    "(?R or (?[+-]digits must be followed by )",    "(?R or (?[+-]digits must be followed by )\0"
265    /* 30 */    /* 30 */
266    "unknown POSIX class name",    "unknown POSIX class name\0"
267    "POSIX collating elements are not supported",    "POSIX collating elements are not supported\0"
268    "this version of PCRE is not compiled with PCRE_UTF8 support",    "this version of PCRE is not compiled with PCRE_UTF8 support\0"
269    "spare error",  /** DEAD **/    "spare error\0"  /** DEAD **/
270    "character value in \\x{...} sequence is too large",    "character value in \\x{...} sequence is too large\0"
271    /* 35 */    /* 35 */
272    "invalid condition (?(0)",    "invalid condition (?(0)\0"
273    "\\C not allowed in lookbehind assertion",    "\\C not allowed in lookbehind assertion\0"
274    "PCRE does not support \\L, \\l, \\N, \\U, or \\u",    "PCRE does not support \\L, \\l, \\N, \\U, or \\u\0"
275    "number after (?C is > 255",    "number after (?C is > 255\0"
276    "closing ) for (?C expected",    "closing ) for (?C expected\0"
277    /* 40 */    /* 40 */
278    "recursive call could loop indefinitely",    "recursive call could loop indefinitely\0"
279    "unrecognized character after (?P",    "unrecognized character after (?P\0"
280    "syntax error in subpattern name (missing terminator)",    "syntax error in subpattern name (missing terminator)\0"
281    "two named subpatterns have the same name",    "two named subpatterns have the same name\0"
282    "invalid UTF-8 string",    "invalid UTF-8 string\0"
283    /* 45 */    /* 45 */
284    "support for \\P, \\p, and \\X has not been compiled",    "support for \\P, \\p, and \\X has not been compiled\0"
285    "malformed \\P or \\p sequence",    "malformed \\P or \\p sequence\0"
286    "unknown property name after \\P or \\p",    "unknown property name after \\P or \\p\0"
287    "subpattern name is too long (maximum " XSTRING(MAX_NAME_SIZE) " characters)",    "subpattern name is too long (maximum " XSTRING(MAX_NAME_SIZE) " characters)\0"
288    "too many named subpatterns (maximum " XSTRING(MAX_NAME_COUNT) ")",    "too many named subpatterns (maximum " XSTRING(MAX_NAME_COUNT) ")\0"
289    /* 50 */    /* 50 */
290    "repeated subpattern is too long",    /** DEAD **/    "repeated subpattern is too long\0"    /** DEAD **/
291    "octal value is greater than \\377 (not in UTF-8 mode)",    "octal value is greater than \\377 (not in UTF-8 mode)\0"
292    "internal error: overran compiling workspace",    "internal error: overran compiling workspace\0"
293    "internal error: previously-checked referenced subpattern not found",    "internal error: previously-checked referenced subpattern not found\0"
294    "DEFINE group contains more than one branch",    "DEFINE group contains more than one branch\0"
295    /* 55 */    /* 55 */
296    "repeating a DEFINE group is not allowed",    "repeating a DEFINE group is not allowed\0"
297    "inconsistent NEWLINE options",    "inconsistent NEWLINE options\0"
298    "\\g is not followed by a braced name or an optionally braced non-zero number",    "\\g is not followed by a braced name or an optionally braced non-zero number\0"
299    "(?+ or (?- or (?(+ or (?(- must be followed by a non-zero number",    "(?+ or (?- or (?(+ or (?(- must be followed by a non-zero number\0"
300    "(*VERB) with an argument is not supported",    "(*VERB) with an argument is not supported\0"
301    /* 60 */    /* 60 */
302    "(*VERB) not recognized",    "(*VERB) not recognized\0"
303    "number is too big"    "number is too big\0"
304  };    "subpattern name expected after (?&\0"
305      "digit expected after (?+";
306    
307    
308  /* 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 420  static BOOL Line 438  static BOOL
438    
439    
440  /*************************************************  /*************************************************
441    *            Find an error text                  *
442    *************************************************/
443    
444    /* The error texts are now all in one long string, to save on relocations. As
445    some of the text is of unknown length, we can't use a table of offsets.
446    Instead, just count through the strings. This is not a performance issue
447    because it happens only when there has been a compilation error.
448    
449    Argument:   the error number
450    Returns:    pointer to the error string
451    */
452    
453    static const char *
454    find_error_text(int n)
455    {
456    const char *s = error_texts;
457    for (; n > 0; n--) while (*s++ != 0);
458    return s;
459    }
460    
461    
462    /*************************************************
463  *            Handle escapes                      *  *            Handle escapes                      *
464  *************************************************/  *************************************************/
465    
# Line 524  else Line 564  else
564      c = 0;      c = 0;
565      while ((digitab[ptr[1]] & ctype_digit) != 0)      while ((digitab[ptr[1]] & ctype_digit) != 0)
566        c = c * 10 + *(++ptr) - '0';        c = c * 10 + *(++ptr) - '0';
567    
568      if (c < 0)      if (c < 0)
569        {        {
570        *errorcodeptr = ERR61;        *errorcodeptr = ERR61;
571        break;        break;
572        }        }
573    
574      if (c == 0 || (braced && *(++ptr) != '}'))      if (c == 0 || (braced && *(++ptr) != '}'))
575        {        {
# Line 574  else Line 614  else
614        if (c < 0)        if (c < 0)
615          {          {
616          *errorcodeptr = ERR61;          *errorcodeptr = ERR61;
617          break;          break;
618          }          }
619        if (c < 10 || c <= bracount)        if (c < 10 || c <= bracount)
620          {          {
621          c = -(ESC_REF + c);          c = -(ESC_REF + c);
# Line 776  top = _pcre_utt_size; Line 816  top = _pcre_utt_size;
816  while (bot < top)  while (bot < top)
817    {    {
818    i = (bot + top) >> 1;    i = (bot + top) >> 1;
819    c = strcmp(name, _pcre_utt[i].name);    c = strcmp(name, _pcre_utt_names + _pcre_utt[i].name_offset);
820    if (c == 0)    if (c == 0)
821      {      {
822      *dptr = _pcre_utt[i].value;      *dptr = _pcre_utt[i].value;
# Line 950  for (; *ptr != 0; ptr++) Line 990  for (; *ptr != 0; ptr++)
990      {      {
991      while (*(++ptr) != ']')      while (*(++ptr) != ']')
992        {        {
993        if (*ptr == 0) return -1;        if (*ptr == 0) return -1;
994        if (*ptr == '\\')        if (*ptr == '\\')
995          {          {
996          if (*(++ptr) == 0) return -1;          if (*(++ptr) == 0) return -1;
# Line 1194  for (;;) Line 1234  for (;;)
1234    
1235      case OP_TYPEEXACT:      case OP_TYPEEXACT:
1236      branchlength += GET2(cc,1);      branchlength += GET2(cc,1);
1237      if (cc[3] == OP_PROP || cc[3] == OP_NOTPROP) cc += 2;      if (cc[3] == OP_PROP || cc[3] == OP_NOTPROP) cc += 2;
1238      cc += 4;      cc += 4;
1239      break;      break;
1240    
# Line 1303  for (;;) Line 1343  for (;;)
1343      code += _pcre_OP_lengths[c];      code += _pcre_OP_lengths[c];
1344      }      }
1345    
1346    /* Otherwise, we can get the item's length from the table, except that for    /* Otherwise, we can get the item's length from the table, except that for
1347    repeated character types, we have to test for \p and \P, which have an extra    repeated character types, we have to test for \p and \P, which have an extra
1348    two bytes of parameters. */    two bytes of parameters. */
1349    
1350    else    else
# Line 1317  for (;;) Line 1357  for (;;)
1357        case OP_TYPEMINPLUS:        case OP_TYPEMINPLUS:
1358        case OP_TYPEQUERY:        case OP_TYPEQUERY:
1359        case OP_TYPEMINQUERY:        case OP_TYPEMINQUERY:
       case OP_TYPEUPTO:  
       case OP_TYPEMINUPTO:  
       case OP_TYPEEXACT:  
1360        case OP_TYPEPOSSTAR:        case OP_TYPEPOSSTAR:
1361        case OP_TYPEPOSPLUS:        case OP_TYPEPOSPLUS:
1362        case OP_TYPEPOSQUERY:        case OP_TYPEPOSQUERY:
       case OP_TYPEPOSUPTO:  
1363        if (code[1] == OP_PROP || code[1] == OP_NOTPROP) code += 2;        if (code[1] == OP_PROP || code[1] == OP_NOTPROP) code += 2;
1364        break;        break;
1365        }  
1366          case OP_TYPEUPTO:
1367          case OP_TYPEMINUPTO:
1368          case OP_TYPEEXACT:
1369          case OP_TYPEPOSUPTO:
1370          if (code[3] == OP_PROP || code[3] == OP_NOTPROP) code += 2;
1371          break;
1372          }
1373    
1374      /* Add in the fixed length from the table */      /* Add in the fixed length from the table */
1375    
1376      code += _pcre_OP_lengths[c];      code += _pcre_OP_lengths[c];
1377    
1378    /* In UTF-8 mode, opcodes that are followed by a character may be followed by    /* In UTF-8 mode, opcodes that are followed by a character may be followed by
1379    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
1380    arrange to skip the extra bytes. */    arrange to skip the extra bytes. */
1381    
1382  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF8
1383      if (utf8) switch(c)      if (utf8) switch(c)
1384        {        {
# Line 1386  for (;;) Line 1429  for (;;)
1429    register int c = *code;    register int c = *code;
1430    if (c == OP_END) return NULL;    if (c == OP_END) return NULL;
1431    if (c == OP_RECURSE) return code;    if (c == OP_RECURSE) return code;
1432    
1433    /* XCLASS is used for classes that cannot be represented just by a bit    /* XCLASS is used for classes that cannot be represented just by a bit
1434    map. This includes negated single high-valued characters. The length in    map. This includes negated single high-valued characters. The length in
1435    the table is zero; the actual length is stored in the compiled code. */    the table is zero; the actual length is stored in the compiled code. */
1436    
1437    if (c == OP_XCLASS) code += GET(code, 1);    if (c == OP_XCLASS) code += GET(code, 1);
1438    
1439    /* Otherwise, we can get the item's length from the table, except that for    /* Otherwise, we can get the item's length from the table, except that for
1440    repeated character types, we have to test for \p and \P, which have an extra    repeated character types, we have to test for \p and \P, which have an extra
1441    two bytes of parameters. */    two bytes of parameters. */
1442    
1443    else    else
# Line 1407  for (;;) Line 1450  for (;;)
1450        case OP_TYPEMINPLUS:        case OP_TYPEMINPLUS:
1451        case OP_TYPEQUERY:        case OP_TYPEQUERY:
1452        case OP_TYPEMINQUERY:        case OP_TYPEMINQUERY:
       case OP_TYPEUPTO:  
       case OP_TYPEMINUPTO:  
       case OP_TYPEEXACT:  
1453        case OP_TYPEPOSSTAR:        case OP_TYPEPOSSTAR:
1454        case OP_TYPEPOSPLUS:        case OP_TYPEPOSPLUS:
1455        case OP_TYPEPOSQUERY:        case OP_TYPEPOSQUERY:
       case OP_TYPEPOSUPTO:  
1456        if (code[1] == OP_PROP || code[1] == OP_NOTPROP) code += 2;        if (code[1] == OP_PROP || code[1] == OP_NOTPROP) code += 2;
1457        break;        break;
1458        }  
1459          case OP_TYPEPOSUPTO:
1460          case OP_TYPEUPTO:
1461          case OP_TYPEMINUPTO:
1462          case OP_TYPEEXACT:
1463          if (code[3] == OP_PROP || code[3] == OP_NOTPROP) code += 2;
1464          break;
1465          }
1466    
1467      /* Add in the fixed length from the table */      /* Add in the fixed length from the table */
1468    
1469      code += _pcre_OP_lengths[c];      code += _pcre_OP_lengths[c];
1470    
1471      /* In UTF-8 mode, opcodes that are followed by a character may be followed      /* In UTF-8 mode, opcodes that are followed by a character may be followed
1472      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
1473      to arrange to skip the extra bytes. */      to arrange to skip the extra bytes. */
1474    
1475  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF8
1476      if (utf8) switch(c)      if (utf8) switch(c)
1477        {        {
# Line 1524  for (code = first_significant_code(code Line 1570  for (code = first_significant_code(code
1570      /* Check for quantifiers after a class. XCLASS is used for classes that      /* Check for quantifiers after a class. XCLASS is used for classes that
1571      cannot be represented just by a bit map. This includes negated single      cannot be represented just by a bit map. This includes negated single
1572      high-valued characters. The length in _pcre_OP_lengths[] is zero; the      high-valued characters. The length in _pcre_OP_lengths[] is zero; the
1573      actual length is stored in the compiled code, so we must update "code"      actual length is stored in the compiled code, so we must update "code"
1574      here. */      here. */
1575    
1576  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF8
# Line 1591  for (code = first_significant_code(code Line 1637  for (code = first_significant_code(code
1637      case OP_TYPEEXACT:      case OP_TYPEEXACT:
1638      return FALSE;      return FALSE;
1639    
1640        /* These are going to continue, as they may be empty, but we have to
1641        fudge the length for the \p and \P cases. */
1642    
1643        case OP_TYPESTAR:
1644        case OP_TYPEMINSTAR:
1645        case OP_TYPEPOSSTAR:
1646        case OP_TYPEQUERY:
1647        case OP_TYPEMINQUERY:
1648        case OP_TYPEPOSQUERY:
1649        if (code[1] == OP_PROP || code[1] == OP_NOTPROP) code += 2;
1650        break;
1651    
1652        /* Same for these */
1653    
1654        case OP_TYPEUPTO:
1655        case OP_TYPEMINUPTO:
1656        case OP_TYPEPOSUPTO:
1657        if (code[3] == OP_PROP || code[3] == OP_NOTPROP) code += 2;
1658        break;
1659    
1660      /* End of branch */      /* End of branch */
1661    
1662      case OP_KET:      case OP_KET:
# Line 1707  Returns:     a value representing the na Line 1773  Returns:     a value representing the na
1773  static int  static int
1774  check_posix_name(const uschar *ptr, int len)  check_posix_name(const uschar *ptr, int len)
1775  {  {
1776    const char *pn = posix_names;
1777  register int yield = 0;  register int yield = 0;
1778  while (posix_name_lengths[yield] != 0)  while (posix_name_lengths[yield] != 0)
1779    {    {
1780    if (len == posix_name_lengths[yield] &&    if (len == posix_name_lengths[yield] &&
1781      strncmp((const char *)ptr, posix_names[yield], len) == 0) return yield;      strncmp((const char *)ptr, pn, len) == 0) return yield;
1782      pn += posix_name_lengths[yield] + 1;
1783    yield++;    yield++;
1784    }    }
1785  return -1;  return -1;
# Line 1753  adjust_recurse(uschar *group, int adjust Line 1821  adjust_recurse(uschar *group, int adjust
1821    uschar *save_hwm)    uschar *save_hwm)
1822  {  {
1823  uschar *ptr = group;  uschar *ptr = group;
1824    
1825  while ((ptr = (uschar *)find_recurse(ptr, utf8)) != NULL)  while ((ptr = (uschar *)find_recurse(ptr, utf8)) != NULL)
1826    {    {
1827    int offset;    int offset;
# Line 2316  req_caseopt = ((options & PCRE_CASELESS) Line 2385  req_caseopt = ((options & PCRE_CASELESS)
2385  for (;; ptr++)  for (;; ptr++)
2386    {    {
2387    BOOL negate_class;    BOOL negate_class;
2388      BOOL should_flip_negation;
2389    BOOL possessive_quantifier;    BOOL possessive_quantifier;
2390    BOOL is_quantifier;    BOOL is_quantifier;
2391    BOOL is_recurse;    BOOL is_recurse;
# Line 2564  for (;; ptr++) Line 2634  for (;; ptr++)
2634        else break;        else break;
2635        }        }
2636    
2637        /* If a class contains a negative special such as \S, we need to flip the
2638        negation flag at the end, so that support for characters > 255 works
2639        correctly (they are all included in the class). */
2640    
2641        should_flip_negation = FALSE;
2642    
2643      /* Keep a count of chars with values < 256 so that we can optimize the case      /* Keep a count of chars with values < 256 so that we can optimize the case
2644      of just a single character (as long as it's < 256). However, For higher      of just a single character (as long as it's < 256). However, For higher
2645      valued UTF-8 characters, we don't yet do any optimization. */      valued UTF-8 characters, we don't yet do any optimization. */
# Line 2636  for (;; ptr++) Line 2712  for (;; ptr++)
2712          if (*ptr == '^')          if (*ptr == '^')
2713            {            {
2714            local_negate = TRUE;            local_negate = TRUE;
2715              should_flip_negation = TRUE;  /* Note negative special */
2716            ptr++;            ptr++;
2717            }            }
2718    
# Line 2722  for (;; ptr++) Line 2799  for (;; ptr++)
2799            else inescq = TRUE;            else inescq = TRUE;
2800            continue;            continue;
2801            }            }
2802          else if (-c == ESC_E) continue;  /* Ignore orphan \E */          else if (-c == ESC_E) continue;  /* Ignore orphan \E */
2803    
2804          if (c < 0)          if (c < 0)
2805            {            {
# Line 2738  for (;; ptr++) Line 2815  for (;; ptr++)
2815              continue;              continue;
2816    
2817              case ESC_D:              case ESC_D:
2818                should_flip_negation = TRUE;
2819              for (c = 0; c < 32; c++) classbits[c] |= ~cbits[c+cbit_digit];              for (c = 0; c < 32; c++) classbits[c] |= ~cbits[c+cbit_digit];
2820              continue;              continue;
2821    
# Line 2746  for (;; ptr++) Line 2824  for (;; ptr++)
2824              continue;              continue;
2825    
2826              case ESC_W:              case ESC_W:
2827                should_flip_negation = TRUE;
2828              for (c = 0; c < 32; c++) classbits[c] |= ~cbits[c+cbit_word];              for (c = 0; c < 32; c++) classbits[c] |= ~cbits[c+cbit_word];
2829              continue;              continue;
2830    
# Line 2755  for (;; ptr++) Line 2834  for (;; ptr++)
2834              continue;              continue;
2835    
2836              case ESC_S:              case ESC_S:
2837                should_flip_negation = TRUE;
2838              for (c = 0; c < 32; c++) classbits[c] |= ~cbits[c+cbit_space];              for (c = 0; c < 32; c++) classbits[c] |= ~cbits[c+cbit_space];
2839              classbits[1] |= 0x08;    /* Perl 5.004 onwards omits VT from \s */              classbits[1] |= 0x08;    /* Perl 5.004 onwards omits VT from \s */
2840              continue;              continue;
# Line 2949  for (;; ptr++) Line 3029  for (;; ptr++)
3029    
3030        oldptr = ptr;        oldptr = ptr;
3031    
3032          /* Remember \r or \n */
3033    
3034          if (c == '\r' || c == '\n') cd->external_flags |= PCRE_HASCRORLF;
3035    
3036          /* Check for range */
3037    
3038        if (!inescq && ptr[1] == '-')        if (!inescq && ptr[1] == '-')
3039          {          {
3040          int d;          int d;
# Line 3016  for (;; ptr++) Line 3102  for (;; ptr++)
3102    
3103          if (d == c) goto LONE_SINGLE_CHARACTER;  /* A few lines below */          if (d == c) goto LONE_SINGLE_CHARACTER;  /* A few lines below */
3104    
3105            /* Remember \r or \n */
3106    
3107            if (d == '\r' || d == '\n') cd->external_flags |= PCRE_HASCRORLF;
3108    
3109          /* In UTF-8 mode, if the upper limit is > 255, or > 127 for caseless          /* In UTF-8 mode, if the upper limit is > 255, or > 127 for caseless
3110          matching, we have to use an XCLASS with extra data items. Caseless          matching, we have to use an XCLASS with extra data items. Caseless
3111          matching for characters > 127 is available only if UCP support is          matching for characters > 127 is available only if UCP support is
# Line 3169  for (;; ptr++) Line 3259  for (;; ptr++)
3259        goto FAILED;        goto FAILED;
3260        }        }
3261    
3262    
3263    /* This code has been disabled because it would mean that \s counts as
3264    an explicit \r or \n reference, and that's not really what is wanted. Now
3265    we set the flag only if there is a literal "\r" or "\n" in the class. */
3266    
3267    #if 0
3268        /* Remember whether \r or \n are in this class */
3269    
3270        if (negate_class)
3271          {
3272          if ((classbits[1] & 0x24) != 0x24) cd->external_flags |= PCRE_HASCRORLF;
3273          }
3274        else
3275          {
3276          if ((classbits[1] & 0x24) != 0) cd->external_flags |= PCRE_HASCRORLF;
3277          }
3278    #endif
3279    
3280    
3281      /* If class_charcount is 1, we saw precisely one character whose value is      /* If class_charcount is 1, we saw precisely one character whose value is
3282      less than 256. In non-UTF-8 mode we can always optimize. In UTF-8 mode, we      less than 256. As long as there were no characters >= 128 and there was no
3283      can optimize the negative case only if there were no characters >= 128      use of \p or \P, in other words, no use of any XCLASS features, we can
3284      because OP_NOT and the related opcodes like OP_NOTSTAR operate on      optimize.
3285      single-bytes only. This is an historical hangover. Maybe one day we can  
3286      tidy these opcodes to handle multi-byte characters.      In UTF-8 mode, we can optimize the negative case only if there were no
3287        characters >= 128 because OP_NOT and the related opcodes like OP_NOTSTAR
3288        operate on single-bytes only. This is an historical hangover. Maybe one day
3289        we can tidy these opcodes to handle multi-byte characters.
3290    
3291      The optimization throws away the bit map. We turn the item into a      The optimization throws away the bit map. We turn the item into a
3292      1-character OP_CHAR[NC] if it's positive, or OP_NOT if it's negative. Note      1-character OP_CHAR[NC] if it's positive, or OP_NOT if it's negative. Note
# Line 3184  for (;; ptr++) Line 3296  for (;; ptr++)
3296      reqbyte, save the previous value for reinstating. */      reqbyte, save the previous value for reinstating. */
3297    
3298  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF8
3299      if (class_charcount == 1 &&      if (class_charcount == 1 && !class_utf8 &&
3300            (!utf8 ||        (!utf8 || !negate_class || class_lastchar < 128))
           (!class_utf8 && (!negate_class || class_lastchar < 128))))  
   
3301  #else  #else
3302      if (class_charcount == 1)      if (class_charcount == 1)
3303  #endif  #endif
# Line 3230  for (;; ptr++) Line 3340  for (;; ptr++)
3340      zeroreqbyte = reqbyte;      zeroreqbyte = reqbyte;
3341    
3342      /* If there are characters with values > 255, we have to compile an      /* If there are characters with values > 255, we have to compile an
3343      extended class, with its own opcode. If there are no characters < 256,      extended class, with its own opcode, unless there was a negated special
3344      we can omit the bitmap in the actual compiled code. */      such as \S in the class, because in that case all characters > 255 are in
3345        the class, so any that were explicitly given as well can be ignored. If
3346        (when there are explicit characters > 255 that must be listed) there are no
3347        characters < 256, we can omit the bitmap in the actual compiled code. */
3348    
3349  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF8
3350      if (class_utf8)      if (class_utf8 && !should_flip_negation)
3351        {        {
3352        *class_utf8data++ = XCL_END;    /* Marks the end of extra data */        *class_utf8data++ = XCL_END;    /* Marks the end of extra data */
3353        *code++ = OP_XCLASS;        *code++ = OP_XCLASS;
# Line 3260  for (;; ptr++) Line 3373  for (;; ptr++)
3373        }        }
3374  #endif  #endif
3375    
3376      /* If there are no characters > 255, negate the 32-byte map if necessary,      /* If there are no characters > 255, set the opcode to OP_CLASS or
3377      and copy it into the code vector. If this is the first thing in the branch,      OP_NCLASS, depending on whether the whole class was negated and whether
3378      there can be no first char setting, whatever the repeat count. Any reqbyte      there were negative specials such as \S in the class. Then copy the 32-byte
3379      setting must remain unchanged after any kind of repeat. */      map into the code vector, negating it if necessary. */
3380    
3381        *code++ = (negate_class == should_flip_negation) ? OP_CLASS : OP_NCLASS;
3382      if (negate_class)      if (negate_class)
3383        {        {
       *code++ = OP_NCLASS;  
3384        if (lengthptr == NULL)    /* Save time in the pre-compile phase */        if (lengthptr == NULL)    /* Save time in the pre-compile phase */
3385          for (c = 0; c < 32; c++) code[c] = ~classbits[c];          for (c = 0; c < 32; c++) code[c] = ~classbits[c];
3386        }        }
3387      else      else
3388        {        {
       *code++ = OP_CLASS;  
3389        memcpy(code, classbits, 32);        memcpy(code, classbits, 32);
3390        }        }
3391      code += 32;      code += 32;
# Line 3459  for (;; ptr++) Line 3571  for (;; ptr++)
3571        /* All real repeats make it impossible to handle partial matching (maybe        /* All real repeats make it impossible to handle partial matching (maybe
3572        one day we will be able to remove this restriction). */        one day we will be able to remove this restriction). */
3573    
3574        if (repeat_max != 1) cd->nopartial = TRUE;        if (repeat_max != 1) cd->external_flags |= PCRE_NOPARTIAL;
3575    
3576        /* Combine the op_type with the repeat_type */        /* Combine the op_type with the repeat_type */
3577    
# Line 3609  for (;; ptr++) Line 3721  for (;; ptr++)
3721        /* All real repeats make it impossible to handle partial matching (maybe        /* All real repeats make it impossible to handle partial matching (maybe
3722        one day we will be able to remove this restriction). */        one day we will be able to remove this restriction). */
3723    
3724        if (repeat_max != 1) cd->nopartial = TRUE;        if (repeat_max != 1) cd->external_flags |= PCRE_NOPARTIAL;
3725    
3726        if (repeat_min == 0 && repeat_max == -1)        if (repeat_min == 0 && repeat_max == -1)
3727          *code++ = OP_CRSTAR + repeat_type;          *code++ = OP_CRSTAR + repeat_type;
# Line 3967  for (;; ptr++) Line 4079  for (;; ptr++)
4079      if (*(++ptr) == '*' && (cd->ctypes[ptr[1]] & ctype_letter) != 0)      if (*(++ptr) == '*' && (cd->ctypes[ptr[1]] & ctype_letter) != 0)
4080        {        {
4081        int i, namelen;        int i, namelen;
4082          const char *vn = verbnames;
4083        const uschar *name = ++ptr;        const uschar *name = ++ptr;
4084        previous = NULL;        previous = NULL;
4085        while ((cd->ctypes[*++ptr] & ctype_letter) != 0);        while ((cd->ctypes[*++ptr] & ctype_letter) != 0);
# Line 3984  for (;; ptr++) Line 4097  for (;; ptr++)
4097        for (i = 0; i < verbcount; i++)        for (i = 0; i < verbcount; i++)
4098          {          {
4099          if (namelen == verbs[i].len &&          if (namelen == verbs[i].len &&
4100              strncmp((char *)name, verbs[i].name, namelen) == 0)              strncmp((char *)name, vn, namelen) == 0)
4101            {            {
4102            *code = verbs[i].op;            *code = verbs[i].op;
4103            if (*code++ == OP_ACCEPT) cd->had_accept = TRUE;            if (*code++ == OP_ACCEPT) cd->had_accept = TRUE;
4104            break;            break;
4105            }            }
4106            vn += verbs[i].len + 1;
4107          }          }
4108        if (i < verbcount) continue;        if (i < verbcount) continue;
4109        *errorcodeptr = ERR60;        *errorcodeptr = ERR60;
# Line 4134  for (;; ptr++) Line 4248  for (;; ptr++)
4248              *errorcodeptr = ERR58;              *errorcodeptr = ERR58;
4249              goto FAILED;              goto FAILED;
4250              }              }
4251            if (refsign == '-')            recno = (refsign == '-')?
4252                cd->bracount - recno + 1 : recno +cd->bracount;
4253              if (recno <= 0 || recno > cd->final_bracount)
4254              {              {
4255              recno = cd->bracount - recno + 1;              *errorcodeptr = ERR15;
4256              if (recno <= 0)              goto FAILED;
               {  
               *errorcodeptr = ERR15;  
               goto FAILED;  
               }  
4257              }              }
           else recno += cd->bracount;  
4258            PUT2(code, 2+LINK_SIZE, recno);            PUT2(code, 2+LINK_SIZE, recno);
4259            break;            break;
4260            }            }
# Line 4215  for (;; ptr++) Line 4326  for (;; ptr++)
4326            skipbytes = 1;            skipbytes = 1;
4327            }            }
4328    
4329          /* Check for the "name" actually being a subpattern number. */          /* Check for the "name" actually being a subpattern number. We are
4330            in the second pass here, so final_bracount is set. */
4331    
4332          else if (recno > 0)          else if (recno > 0 && recno <= cd->final_bracount)
4333            {            {
4334            PUT2(code, 2+LINK_SIZE, recno);            PUT2(code, 2+LINK_SIZE, recno);
4335            }            }
# Line 4423  for (;; ptr++) Line 4535  for (;; ptr++)
4535    
4536          if (lengthptr != NULL)          if (lengthptr != NULL)
4537            {            {
4538              if (namelen == 0)
4539                {
4540                *errorcodeptr = ERR62;
4541                goto FAILED;
4542                }
4543            if (*ptr != terminator)            if (*ptr != terminator)
4544              {              {
4545              *errorcodeptr = ERR42;              *errorcodeptr = ERR42;
# Line 4436  for (;; ptr++) Line 4553  for (;; ptr++)
4553            recno = 0;            recno = 0;
4554            }            }
4555    
4556          /* In the real compile, seek the name in the table */          /* In the real compile, seek the name in the table. We check the name
4557            first, and then check that we have reached the end of the name in the
4558            table. That way, if the name that is longer than any in the table,
4559            the comparison will fail without reading beyond the table entry. */
4560    
4561          else          else
4562            {            {
4563            slot = cd->name_table;            slot = cd->name_table;
4564            for (i = 0; i < cd->names_found; i++)            for (i = 0; i < cd->names_found; i++)
4565              {              {
4566              if (strncmp((char *)name, (char *)slot+2, namelen) == 0) break;              if (strncmp((char *)name, (char *)slot+2, namelen) == 0 &&
4567                    slot[2+namelen] == 0)
4568                  break;
4569              slot += cd->name_entry_size;              slot += cd->name_entry_size;
4570              }              }
4571    
# Line 4480  for (;; ptr++) Line 4602  for (;; ptr++)
4602            {            {
4603            const uschar *called;            const uschar *called;
4604    
4605            if ((refsign = *ptr) == '+') ptr++;            if ((refsign = *ptr) == '+')
4606                {
4607                ptr++;
4608                if ((digitab[*ptr] & ctype_digit) == 0)
4609                  {
4610                  *errorcodeptr = ERR63;
4611                  goto FAILED;
4612                  }
4613                }
4614            else if (refsign == '-')            else if (refsign == '-')
4615              {              {
4616              if ((digitab[ptr[1]] & ctype_digit) == 0)              if ((digitab[ptr[1]] & ctype_digit) == 0)
# Line 4606  for (;; ptr++) Line 4736  for (;; ptr++)
4736    
4737              case 'J':    /* Record that it changed in the external options */              case 'J':    /* Record that it changed in the external options */
4738              *optset |= PCRE_DUPNAMES;              *optset |= PCRE_DUPNAMES;
4739              cd->external_options |= PCRE_JCHANGED;              cd->external_flags |= PCRE_JCHANGED;
4740              break;              break;
4741    
4742              case 'i': *optset |= PCRE_CASELESS; break;              case 'i': *optset |= PCRE_CASELESS; break;
# Line 4798  for (;; ptr++) Line 4928  for (;; ptr++)
4928        }        }
4929    
4930      /* In the pre-compile phase, update the length by the length of the group,      /* In the pre-compile phase, update the length by the length of the group,
4931      less the brackets at either end. Then reduce the compiled code to just a      less the brackets at either end. Then reduce the compiled code to just a
4932      set of non-capturing brackets so that it doesn't use much memory if it is      set of non-capturing brackets so that it doesn't use much memory if it is
4933      duplicated by a quantifier.*/      duplicated by a quantifier.*/
4934    
# Line 4810  for (;; ptr++) Line 4940  for (;; ptr++)
4940          goto FAILED;          goto FAILED;
4941          }          }
4942        *lengthptr += length_prevgroup - 2 - 2*LINK_SIZE;        *lengthptr += length_prevgroup - 2 - 2*LINK_SIZE;
4943        *code++ = OP_BRA;        *code++ = OP_BRA;
4944        PUTINC(code, 0, 1 + LINK_SIZE);        PUTINC(code, 0, 1 + LINK_SIZE);
4945        *code++ = OP_KET;        *code++ = OP_KET;
4946        PUTINC(code, 0, 1 + LINK_SIZE);        PUTINC(code, 0, 1 + LINK_SIZE);
# Line 5023  for (;; ptr++) Line 5153  for (;; ptr++)
5153      *code++ = ((options & PCRE_CASELESS) != 0)? OP_CHARNC : OP_CHAR;      *code++ = ((options & PCRE_CASELESS) != 0)? OP_CHARNC : OP_CHAR;
5154      for (c = 0; c < mclength; c++) *code++ = mcbuffer[c];      for (c = 0; c < mclength; c++) *code++ = mcbuffer[c];
5155    
5156        /* Remember if \r or \n were seen */
5157    
5158        if (mcbuffer[0] == '\r' || mcbuffer[0] == '\n')
5159          cd->external_flags |= PCRE_HASCRORLF;
5160    
5161      /* Set the first and required bytes appropriately. If no previous first      /* Set the first and required bytes appropriately. If no previous first
5162      byte, set it from this character, but revert to none on a zero repeat.      byte, set it from this character, but revert to none on a zero repeat.
5163      Otherwise, leave the firstbyte value alone, and don't change it on a zero      Otherwise, leave the firstbyte value alone, and don't change it on a zero
# Line 5622  real_pcre *re; Line 5757  real_pcre *re;
5757  int length = 1;  /* For final END opcode */  int length = 1;  /* For final END opcode */
5758  int firstbyte, reqbyte, newline;  int firstbyte, reqbyte, newline;
5759  int errorcode = 0;  int errorcode = 0;
5760    int skipatstart = 0;
5761  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF8
5762  BOOL utf8;  BOOL utf8;
5763  #endif  #endif
# Line 5700  cd->fcc = tables + fcc_offset; Line 5836  cd->fcc = tables + fcc_offset;
5836  cd->cbits = tables + cbits_offset;  cd->cbits = tables + cbits_offset;
5837  cd->ctypes = tables + ctypes_offset;  cd->ctypes = tables + ctypes_offset;
5838    
5839    /* Check for global one-time settings at the start of the pattern, and remember
5840    the offset for later. */
5841    
5842    while (ptr[skipatstart] == '(' && ptr[skipatstart+1] == '*')
5843      {
5844      int newnl = 0;
5845      int newbsr = 0;
5846    
5847      if (strncmp((char *)(ptr+skipatstart+2), "CR)", 3) == 0)
5848        { skipatstart += 5; newnl = PCRE_NEWLINE_CR; }
5849      else if (strncmp((char *)(ptr+skipatstart+2), "LF)", 3)  == 0)
5850        { skipatstart += 5; newnl = PCRE_NEWLINE_LF; }
5851      else if (strncmp((char *)(ptr+skipatstart+2), "CRLF)", 5)  == 0)
5852        { skipatstart += 7; newnl = PCRE_NEWLINE_CR + PCRE_NEWLINE_LF; }
5853      else if (strncmp((char *)(ptr+skipatstart+2), "ANY)", 4) == 0)
5854        { skipatstart += 6; newnl = PCRE_NEWLINE_ANY; }
5855      else if (strncmp((char *)(ptr+skipatstart+2), "ANYCRLF)", 8)  == 0)
5856        { skipatstart += 10; newnl = PCRE_NEWLINE_ANYCRLF; }
5857    
5858      else if (strncmp((char *)(ptr+skipatstart+2), "BSR_ANYCRLF)", 12) == 0)
5859        { skipatstart += 14; newbsr = PCRE_BSR_ANYCRLF; }
5860      else if (strncmp((char *)(ptr+skipatstart+2), "BSR_UNICODE)", 12) == 0)
5861        { skipatstart += 14; newbsr = PCRE_BSR_UNICODE; }
5862    
5863      if (newnl != 0)
5864        options = (options & ~PCRE_NEWLINE_BITS) | newnl;
5865      else if (newbsr != 0)
5866        options = (options & ~(PCRE_BSR_ANYCRLF|PCRE_BSR_UNICODE)) | newbsr;
5867      else break;
5868      }
5869    
5870    /* Check validity of \R options. */
5871    
5872    switch (options & (PCRE_BSR_ANYCRLF|PCRE_BSR_UNICODE))
5873      {
5874      case 0:
5875      case PCRE_BSR_ANYCRLF:
5876      case PCRE_BSR_UNICODE:
5877      break;
5878      default: errorcode = ERR56; goto PCRE_EARLY_ERROR_RETURN;
5879      }
5880    
5881  /* Handle different types of newline. The three bits give seven cases. The  /* Handle different types of newline. The three bits give seven cases. The
5882  current code allows for fixed one- or two-byte sequences, plus "any" and  current code allows for fixed one- or two-byte sequences, plus "any" and
5883  "anycrlf". */  "anycrlf". */
5884    
5885  switch (options & (PCRE_NEWLINE_CRLF | PCRE_NEWLINE_ANY))  switch (options & PCRE_NEWLINE_BITS)
5886    {    {
5887    case 0: newline = NEWLINE; break;   /* Compile-time default */    case 0: newline = NEWLINE; break;   /* Build-time default */
5888    case PCRE_NEWLINE_CR: newline = '\r'; break;    case PCRE_NEWLINE_CR: newline = '\r'; break;
5889    case PCRE_NEWLINE_LF: newline = '\n'; break;    case PCRE_NEWLINE_LF: newline = '\n'; break;
5890    case PCRE_NEWLINE_CR+    case PCRE_NEWLINE_CR+
# Line 5759  to compile parts of the pattern into; th Line 5937  to compile parts of the pattern into; th
5937  no longer needed, so hopefully this workspace will never overflow, though there  no longer needed, so hopefully this workspace will never overflow, though there
5938  is a test for its doing so. */  is a test for its doing so. */
5939    
5940  cd->bracount = 0;  cd->bracount = cd->final_bracount = 0;
5941  cd->names_found = 0;  cd->names_found = 0;
5942  cd->name_entry_size = 0;  cd->name_entry_size = 0;
5943  cd->name_table = NULL;  cd->name_table = NULL;
# Line 5769  cd->hwm = cworkspace; Line 5947  cd->hwm = cworkspace;
5947  cd->start_pattern = (const uschar *)pattern;  cd->start_pattern = (const uschar *)pattern;
5948  cd->end_pattern = (const uschar *)(pattern + strlen(pattern));  cd->end_pattern = (const uschar *)(pattern + strlen(pattern));
5949  cd->req_varyopt = 0;  cd->req_varyopt = 0;
 cd->nopartial = FALSE;  
5950  cd->external_options = options;  cd->external_options = options;
5951    cd->external_flags = 0;
5952    
5953  /* Now do the pre-compile. On error, errorcode will be set non-zero, so we  /* Now do the pre-compile. On error, errorcode will be set non-zero, so we
5954  don't need to look at the result of the function here. The initial options have  don't need to look at the result of the function here. The initial options have
# Line 5778  been put into the cd block so that they Line 5956  been put into the cd block so that they
5956  found within the regex right at the beginning. Bringing initial option settings  found within the regex right at the beginning. Bringing initial option settings
5957  outside can help speed up starting point checks. */  outside can help speed up starting point checks. */
5958    
5959    ptr += skipatstart;
5960  code = cworkspace;  code = cworkspace;
5961  *code = OP_BRA;  *code = OP_BRA;
5962  (void)compile_regex(cd->external_options, cd->external_options & PCRE_IMS,  (void)compile_regex(cd->external_options, cd->external_options & PCRE_IMS,
# Line 5808  if (re == NULL) Line 5987  if (re == NULL)
5987    goto PCRE_EARLY_ERROR_RETURN;    goto PCRE_EARLY_ERROR_RETURN;
5988    }    }
5989    
5990  /* Put in the magic number, and save the sizes, initial options, and character  /* Put in the magic number, and save the sizes, initial options, internal
5991  table pointer. NULL is used for the default character tables. The nullpad field  flags, and character table pointer. NULL is used for the default character
5992  is at the end; it's there to help in the case when a regex compiled on a system  tables. The nullpad field is at the end; it's there to help in the case when a
5993  with 4-byte pointers is run on another with 8-byte pointers. */  regex compiled on a system with 4-byte pointers is run on another with 8-byte
5994    pointers. */
5995    
5996  re->magic_number = MAGIC_NUMBER;  re->magic_number = MAGIC_NUMBER;
5997  re->size = size;  re->size = size;
5998  re->options = cd->external_options;  re->options = cd->external_options;
5999    re->flags = cd->external_flags;
6000  re->dummy1 = 0;  re->dummy1 = 0;
6001  re->first_byte = 0;  re->first_byte = 0;
6002  re->req_byte = 0;  re->req_byte = 0;
# Line 5833  field. Reset the bracket count and the n Line 6014  field. Reset the bracket count and the n
6014  field; this time it's used for remembering forward references to subpatterns.  field; this time it's used for remembering forward references to subpatterns.
6015  */  */
6016    
6017    cd->final_bracount = cd->bracount;  /* Save for checking forward references */
6018  cd->bracount = 0;  cd->bracount = 0;
6019  cd->names_found = 0;  cd->names_found = 0;
6020  cd->name_table = (uschar *)re + re->name_table_offset;  cd->name_table = (uschar *)re + re->name_table_offset;
# Line 5840  codestart = cd->name_table + re->name_en Line 6022  codestart = cd->name_table + re->name_en
6022  cd->start_code = codestart;  cd->start_code = codestart;
6023  cd->hwm = cworkspace;  cd->hwm = cworkspace;
6024  cd->req_varyopt = 0;  cd->req_varyopt = 0;
 cd->nopartial = FALSE;  
6025  cd->had_accept = FALSE;  cd->had_accept = FALSE;
6026    
6027  /* Set up a starting, non-extracting bracket, then compile the expression. On  /* Set up a starting, non-extracting bracket, then compile the expression. On
6028  error, errorcode will be set non-zero, so we don't need to look at the result  error, errorcode will be set non-zero, so we don't need to look at the result
6029  of the function here. */  of the function here. */
6030    
6031  ptr = (const uschar *)pattern;  ptr = (const uschar *)pattern + skipatstart;
6032  code = (uschar *)codestart;  code = (uschar *)codestart;
6033  *code = OP_BRA;  *code = OP_BRA;
6034  (void)compile_regex(re->options, re->options & PCRE_IMS, &code, &ptr,  (void)compile_regex(re->options, re->options & PCRE_IMS, &code, &ptr,
6035    &errorcode, FALSE, FALSE, 0, &firstbyte, &reqbyte, NULL, cd, NULL);    &errorcode, FALSE, FALSE, 0, &firstbyte, &reqbyte, NULL, cd, NULL);
6036  re->top_bracket = cd->bracount;  re->top_bracket = cd->bracount;
6037  re->top_backref = cd->top_backref;  re->top_backref = cd->top_backref;
6038    re->flags = cd->external_flags;
6039    
 if (cd->nopartial) re->options |= PCRE_NOPARTIAL;  
6040  if (cd->had_accept) reqbyte = -1;   /* Must disable after (*ACCEPT) */  if (cd->had_accept) reqbyte = -1;   /* Must disable after (*ACCEPT) */
6041    
6042  /* If not reached end of pattern on success, there's an excess bracket. */  /* If not reached end of pattern on success, there's an excess bracket. */
# Line 5898  if (errorcode != 0) Line 6079  if (errorcode != 0)
6079    PCRE_EARLY_ERROR_RETURN:    PCRE_EARLY_ERROR_RETURN:
6080    *erroroffset = ptr - (const uschar *)pattern;    *erroroffset = ptr - (const uschar *)pattern;
6081    PCRE_EARLY_ERROR_RETURN2:    PCRE_EARLY_ERROR_RETURN2:
6082    *errorptr = error_texts[errorcode];    *errorptr = find_error_text(errorcode);
6083    if (errorcodeptr != NULL) *errorcodeptr = errorcode;    if (errorcodeptr != NULL) *errorcodeptr = errorcode;
6084    return NULL;    return NULL;
6085    }    }
# Line 5927  if ((re->options & PCRE_ANCHORED) == 0) Line 6108  if ((re->options & PCRE_ANCHORED) == 0)
6108        int ch = firstbyte & 255;        int ch = firstbyte & 255;
6109        re->first_byte = ((firstbyte & REQ_CASELESS) != 0 &&        re->first_byte = ((firstbyte & REQ_CASELESS) != 0 &&
6110           cd->fcc[ch] == ch)? ch : firstbyte;           cd->fcc[ch] == ch)? ch : firstbyte;
6111        re->options |= PCRE_FIRSTSET;        re->flags |= PCRE_FIRSTSET;
6112        }        }
6113      else if (is_startline(codestart, 0, cd->backref_map))      else if (is_startline(codestart, 0, cd->backref_map))
6114        re->options |= PCRE_STARTLINE;        re->flags |= PCRE_STARTLINE;
6115      }      }
6116    }    }
6117    
# Line 5944  if (reqbyte >= 0 && Line 6125  if (reqbyte >= 0 &&
6125    int ch = reqbyte & 255;    int ch = reqbyte & 255;
6126    re->req_byte = ((reqbyte & REQ_CASELESS) != 0 &&    re->req_byte = ((reqbyte & REQ_CASELESS) != 0 &&
6127      cd->fcc[ch] == ch)? (reqbyte & ~REQ_CASELESS) : reqbyte;      cd->fcc[ch] == ch)? (reqbyte & ~REQ_CASELESS) : reqbyte;
6128    re->options |= PCRE_REQCHSET;    re->flags |= PCRE_REQCHSET;
6129    }    }
6130    
6131  /* Print out the compiled data if debugging is enabled. This is never the  /* Print out the compiled data if debugging is enabled. This is never the
# Line 5955  case when building a production library. Line 6136  case when building a production library.
6136  printf("Length = %d top_bracket = %d top_backref = %d\n",  printf("Length = %d top_bracket = %d top_backref = %d\n",
6137    length, re->top_bracket, re->top_backref);    length, re->top_bracket, re->top_backref);
6138    
6139  if (re->options != 0)  printf("Options=%08x\n", re->options);
   {  
   printf("%s%s%s%s%s%s%s%s%s\n",  
     ((re->options & PCRE_NOPARTIAL) != 0)? "nopartial " : "",  
     ((re->options & PCRE_ANCHORED) != 0)? "anchored " : "",  
     ((re->options & PCRE_CASELESS) != 0)? "caseless " : "",  
     ((re->options & PCRE_EXTENDED) != 0)? "extended " : "",  
     ((re->options & PCRE_MULTILINE) != 0)? "multiline " : "",  
     ((re->options & PCRE_DOTALL) != 0)? "dotall " : "",  
     ((re->options & PCRE_DOLLAR_ENDONLY) != 0)? "endonly " : "",  
     ((re->options & PCRE_EXTRA) != 0)? "extra " : "",  
     ((re->options & PCRE_UNGREEDY) != 0)? "ungreedy " : "");  
   }  
6140    
6141  if ((re->options & PCRE_FIRSTSET) != 0)  if ((re->flags & PCRE_FIRSTSET) != 0)
6142    {    {
6143    int ch = re->first_byte & 255;    int ch = re->first_byte & 255;
6144    const char *caseless = ((re->first_byte & REQ_CASELESS) == 0)?    const char *caseless = ((re->first_byte & REQ_CASELESS) == 0)?
# Line 5978  if ((re->options & PCRE_FIRSTSET) != 0) Line 6147  if ((re->options & PCRE_FIRSTSET) != 0)
6147      else printf("First char = \\x%02x%s\n", ch, caseless);      else printf("First char = \\x%02x%s\n", ch, caseless);
6148    }    }
6149    
6150  if ((re->options & PCRE_REQCHSET) != 0)  if ((re->flags & PCRE_REQCHSET) != 0)
6151    {    {
6152    int ch = re->req_byte & 255;    int ch = re->req_byte & 255;
6153    const char *caseless = ((re->req_byte & REQ_CASELESS) == 0)?    const char *caseless = ((re->req_byte & REQ_CASELESS) == 0)?
# Line 5995  was compiled can be seen. */ Line 6164  was compiled can be seen. */
6164  if (code - codestart > length)  if (code - codestart > length)
6165    {    {
6166    (pcre_free)(re);    (pcre_free)(re);
6167    *errorptr = error_texts[ERR23];    *errorptr = find_error_text(ERR23);
6168    *erroroffset = ptr - (uschar *)pattern;    *erroroffset = ptr - (uschar *)pattern;
6169    if (errorcodeptr != NULL) *errorcodeptr = ERR23;    if (errorcodeptr != NULL) *errorcodeptr = ERR23;
6170    return NULL;    return NULL;

Legend:
Removed from v.218  
changed lines
  Added in v.270

  ViewVC Help
Powered by ViewVC 1.1.5