/[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 195 by ph10, Mon Jul 30 13:23:28 2007 UTC revision 240 by ph10, Tue Sep 11 15:47:20 2007 UTC
# Line 42  POSSIBILITY OF SUCH DAMAGE. Line 42  POSSIBILITY OF SUCH DAMAGE.
42  supporting internal functions that are not used by other modules. */  supporting internal functions that are not used by other modules. */
43    
44    
45    #ifdef HAVE_CONFIG_H
46    #include "config.h"
47    #endif
48    
49  #define NLBLOCK cd             /* Block containing newline information */  #define NLBLOCK cd             /* Block containing newline information */
50  #define PSSTART start_pattern  /* Field containing processed string start */  #define PSSTART start_pattern  /* Field containing processed string start */
51  #define PSEND   end_pattern    /* Field containing processed string end */  #define PSEND   end_pattern    /* Field containing processed string end */
52    
   
53  #include "pcre_internal.h"  #include "pcre_internal.h"
54    
55    
# Line 62  used by pcretest. DEBUG is not defined w Line 65  used by pcretest. DEBUG is not defined w
65    
66  #define SETBIT(a,b) a[b/8] |= (1 << (b%8))  #define SETBIT(a,b) a[b/8] |= (1 << (b%8))
67    
68    /* Maximum length value to check against when making sure that the integer that
69    holds the compiled pattern length does not overflow. We make it a bit less than
70    INT_MAX to allow for adding in group terminating bytes, so that we don't have
71    to check them every time. */
72    
73    #define OFLOW_MAX (INT_MAX - 20)
74    
75    
76  /*************************************************  /*************************************************
77  *      Code parameters and static tables         *  *      Code parameters and static tables         *
# Line 130  static const short int escapes[] = { Line 140  static const short int escapes[] = {
140  #endif  #endif
141    
142    
143  /* Tables of names of POSIX character classes and their lengths. The list is  /* Table of special "verbs" like (*PRUNE). This is a short table, so it is
144  terminated by a zero length entry. The first three must be alpha, lower, upper,  searched linearly. Put all the names into a single string, in order to reduce
145  as this is assumed for handling case independence. */  the number of relocations when a shared library is dynamically linked. */
146    
147  static const char *const posix_names[] = {  typedef struct verbitem {
148    "alpha", "lower", "upper",    int   len;
149    "alnum", "ascii", "blank", "cntrl", "digit", "graph",    int   op;
150    "print", "punct", "space", "word",  "xdigit" };  } 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[] = {
162      { 6, OP_ACCEPT },
163      { 6, OP_COMMIT },
164      { 1, OP_FAIL },
165      { 4, OP_FAIL },
166      { 5, OP_PRUNE },
167      { 4, OP_SKIP  },
168      { 4, OP_THEN  }
169    };
170    
171    static int verbcount = sizeof(verbs)/sizeof(verbitem);
172    
173    
174    /* Tables of names of POSIX character classes and their lengths. The names are
175    now all in a single string, to reduce the number of relocations when a shared
176    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    for handling case independence. */
179    
180    static const char posix_names[] =
181      "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 176  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 (?\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 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",    "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\0"
301      /* 60 */
302      "(*VERB) not recognized\0"
303      "number is too big";
304    
305    
306  /* 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 385  static BOOL Line 436  static BOOL
436    
437    
438  /*************************************************  /*************************************************
439    *            Find an error text                  *
440    *************************************************/
441    
442    /* The error texts are now all in one long string, to save on relocations. As
443    some of the text is of unknown length, we can't use a table of offsets.
444    Instead, just count through the strings. This is not a performance issue
445    because it happens only when there has been a compilation error.
446    
447    Argument:   the error number
448    Returns:    pointer to the error string
449    */
450    
451    static const char *
452    find_error_text(int n)
453    {
454    const char *s = error_texts;
455    for (; n > 0; n--) while (*s++ != 0);
456    return s;
457    }
458    
459    
460    /*************************************************
461  *            Handle escapes                      *  *            Handle escapes                      *
462  *************************************************/  *************************************************/
463    
# Line 405  Arguments: Line 478  Arguments:
478    
479  Returns:         zero or positive => a data character  Returns:         zero or positive => a data character
480                   negative => a special escape sequence                   negative => a special escape sequence
481                   on error, errorptr is set                   on error, errorcodeptr is set
482  */  */
483    
484  static int  static int
# Line 490  else Line 563  else
563      while ((digitab[ptr[1]] & ctype_digit) != 0)      while ((digitab[ptr[1]] & ctype_digit) != 0)
564        c = c * 10 + *(++ptr) - '0';        c = c * 10 + *(++ptr) - '0';
565    
566        if (c < 0)
567          {
568          *errorcodeptr = ERR61;
569          break;
570          }
571    
572      if (c == 0 || (braced && *(++ptr) != '}'))      if (c == 0 || (braced && *(++ptr) != '}'))
573        {        {
574        *errorcodeptr = ERR57;        *errorcodeptr = ERR57;
575        return 0;        break;
576        }        }
577    
578      if (negated)      if (negated)
# Line 501  else Line 580  else
580        if (c > bracount)        if (c > bracount)
581          {          {
582          *errorcodeptr = ERR15;          *errorcodeptr = ERR15;
583          return 0;          break;
584          }          }
585        c = bracount - (c - 1);        c = bracount - (c - 1);
586        }        }
# Line 530  else Line 609  else
609        c -= '0';        c -= '0';
610        while ((digitab[ptr[1]] & ctype_digit) != 0)        while ((digitab[ptr[1]] & ctype_digit) != 0)
611          c = c * 10 + *(++ptr) - '0';          c = c * 10 + *(++ptr) - '0';
612          if (c < 0)
613            {
614            *errorcodeptr = ERR61;
615            break;
616            }
617        if (c < 10 || c <= bracount)        if (c < 10 || c <= bracount)
618          {          {
619          c = -(ESC_REF + c);          c = -(ESC_REF + c);
# Line 625  else Line 709  else
709      if (c == 0)      if (c == 0)
710        {        {
711        *errorcodeptr = ERR2;        *errorcodeptr = ERR2;
712        return 0;        break;
713        }        }
714    
715  #ifndef EBCDIC  /* ASCII coding */  #ifndef EBCDIC  /* ASCII coding */
# Line 701  if (c == '{') Line 785  if (c == '{')
785      *negptr = TRUE;      *negptr = TRUE;
786      ptr++;      ptr++;
787      }      }
788    for (i = 0; i < sizeof(name) - 1; i++)    for (i = 0; i < (int)sizeof(name) - 1; i++)
789      {      {
790      c = *(++ptr);      c = *(++ptr);
791      if (c == 0) goto ERROR_RETURN;      if (c == 0) goto ERROR_RETURN;
# Line 730  top = _pcre_utt_size; Line 814  top = _pcre_utt_size;
814  while (bot < top)  while (bot < top)
815    {    {
816    i = (bot + top) >> 1;    i = (bot + top) >> 1;
817    c = strcmp(name, _pcre_utt[i].name);    c = strcmp(name, _pcre_utt_names + _pcre_utt[i].name_offset);
818    if (c == 0)    if (c == 0)
819      {      {
820      *dptr = _pcre_utt[i].value;      *dptr = _pcre_utt[i].value;
# Line 904  for (; *ptr != 0; ptr++) Line 988  for (; *ptr != 0; ptr++)
988      {      {
989      while (*(++ptr) != ']')      while (*(++ptr) != ']')
990        {        {
991          if (*ptr == 0) return -1;
992        if (*ptr == '\\')        if (*ptr == '\\')
993          {          {
994          if (*(++ptr) == 0) return -1;          if (*(++ptr) == 0) return -1;
# Line 931  for (; *ptr != 0; ptr++) Line 1016  for (; *ptr != 0; ptr++)
1016    /* An opening parens must now be a real metacharacter */    /* An opening parens must now be a real metacharacter */
1017    
1018    if (*ptr != '(') continue;    if (*ptr != '(') continue;
1019    if (ptr[1] != '?')    if (ptr[1] != '?' && ptr[1] != '*')
1020      {      {
1021      count++;      count++;
1022      if (name == NULL && count == lorn) return count;      if (name == NULL && count == lorn) return count;
# Line 1059  for (;;) Line 1144  for (;;)
1144    {    {
1145    int d;    int d;
1146    register int op = *cc;    register int op = *cc;
   
1147    switch (op)    switch (op)
1148      {      {
1149      case OP_CBRA:      case OP_CBRA:
# Line 1148  for (;;) Line 1232  for (;;)
1232    
1233      case OP_TYPEEXACT:      case OP_TYPEEXACT:
1234      branchlength += GET2(cc,1);      branchlength += GET2(cc,1);
1235        if (cc[3] == OP_PROP || cc[3] == OP_NOTPROP) cc += 2;
1236      cc += 4;      cc += 4;
1237      break;      break;
1238    
# Line 1256  for (;;) Line 1341  for (;;)
1341      code += _pcre_OP_lengths[c];      code += _pcre_OP_lengths[c];
1342      }      }
1343    
1344    /* In UTF-8 mode, opcodes that are followed by a character may be followed by    /* Otherwise, we can get the item's length from the table, except that for
1345    a multi-byte character. The length in the table is a minimum, so we have to    repeated character types, we have to test for \p and \P, which have an extra
1346    arrange to skip the extra bytes. */    two bytes of parameters. */
1347    
1348    else    else
1349      {      {
1350        switch(c)
1351          {
1352          case OP_TYPESTAR:
1353          case OP_TYPEMINSTAR:
1354          case OP_TYPEPLUS:
1355          case OP_TYPEMINPLUS:
1356          case OP_TYPEQUERY:
1357          case OP_TYPEMINQUERY:
1358          case OP_TYPEPOSSTAR:
1359          case OP_TYPEPOSPLUS:
1360          case OP_TYPEPOSQUERY:
1361          if (code[1] == OP_PROP || code[1] == OP_NOTPROP) code += 2;
1362          break;
1363    
1364          case OP_TYPEUPTO:
1365          case OP_TYPEMINUPTO:
1366          case OP_TYPEEXACT:
1367          case OP_TYPEPOSUPTO:
1368          if (code[3] == OP_PROP || code[3] == OP_NOTPROP) code += 2;
1369          break;
1370          }
1371    
1372        /* Add in the fixed length from the table */
1373    
1374      code += _pcre_OP_lengths[c];      code += _pcre_OP_lengths[c];
1375    
1376      /* In UTF-8 mode, opcodes that are followed by a character may be followed by
1377      a multi-byte character. The length in the table is a minimum, so we have to
1378      arrange to skip the extra bytes. */
1379    
1380  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF8
1381      if (utf8) switch(c)      if (utf8) switch(c)
1382        {        {
# Line 1320  for (;;) Line 1434  for (;;)
1434    
1435    if (c == OP_XCLASS) code += GET(code, 1);    if (c == OP_XCLASS) code += GET(code, 1);
1436    
1437    /* Otherwise, we get the item's length from the table. In UTF-8 mode, opcodes    /* Otherwise, we can get the item's length from the table, except that for
1438    that are followed by a character may be followed by a multi-byte character.    repeated character types, we have to test for \p and \P, which have an extra
1439    The length in the table is a minimum, so we have to arrange to skip the extra    two bytes of parameters. */
   bytes. */  
1440    
1441    else    else
1442      {      {
1443        switch(c)
1444          {
1445          case OP_TYPESTAR:
1446          case OP_TYPEMINSTAR:
1447          case OP_TYPEPLUS:
1448          case OP_TYPEMINPLUS:
1449          case OP_TYPEQUERY:
1450          case OP_TYPEMINQUERY:
1451          case OP_TYPEPOSSTAR:
1452          case OP_TYPEPOSPLUS:
1453          case OP_TYPEPOSQUERY:
1454          if (code[1] == OP_PROP || code[1] == OP_NOTPROP) code += 2;
1455          break;
1456    
1457          case OP_TYPEPOSUPTO:
1458          case OP_TYPEUPTO:
1459          case OP_TYPEMINUPTO:
1460          case OP_TYPEEXACT:
1461          if (code[3] == OP_PROP || code[3] == OP_NOTPROP) code += 2;
1462          break;
1463          }
1464    
1465        /* Add in the fixed length from the table */
1466    
1467      code += _pcre_OP_lengths[c];      code += _pcre_OP_lengths[c];
1468    
1469        /* In UTF-8 mode, opcodes that are followed by a character may be followed
1470        by a multi-byte character. The length in the table is a minimum, so we have
1471        to arrange to skip the extra bytes. */
1472    
1473  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF8
1474      if (utf8) switch(c)      if (utf8) switch(c)
1475        {        {
# Line 1399  for (code = first_significant_code(code Line 1541  for (code = first_significant_code(code
1541    
1542    /* For other groups, scan the branches. */    /* For other groups, scan the branches. */
1543    
1544    if (c == OP_BRA || c == OP_CBRA || c == OP_ONCE)    if (c == OP_BRA || c == OP_CBRA || c == OP_ONCE || c == OP_COND)
1545      {      {
1546      BOOL empty_branch;      BOOL empty_branch;
1547      if (GET(code, 1) == 0) return TRUE;    /* Hit unclosed bracket */      if (GET(code, 1) == 0) return TRUE;    /* Hit unclosed bracket */
# Line 1423  for (code = first_significant_code(code Line 1565  for (code = first_significant_code(code
1565    
1566    switch (c)    switch (c)
1567      {      {
1568      /* Check for quantifiers after a class */      /* Check for quantifiers after a class. XCLASS is used for classes that
1569        cannot be represented just by a bit map. This includes negated single
1570        high-valued characters. The length in _pcre_OP_lengths[] is zero; the
1571        actual length is stored in the compiled code, so we must update "code"
1572        here. */
1573    
1574  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF8
1575      case OP_XCLASS:      case OP_XCLASS:
1576      ccode = code + GET(code, 1);      ccode = code += GET(code, 1);
1577      goto CHECK_CLASS_REPEAT;      goto CHECK_CLASS_REPEAT;
1578  #endif  #endif
1579    
# Line 1489  for (code = first_significant_code(code Line 1635  for (code = first_significant_code(code
1635      case OP_TYPEEXACT:      case OP_TYPEEXACT:
1636      return FALSE;      return FALSE;
1637    
1638        /* These are going to continue, as they may be empty, but we have to
1639        fudge the length for the \p and \P cases. */
1640    
1641        case OP_TYPESTAR:
1642        case OP_TYPEMINSTAR:
1643        case OP_TYPEPOSSTAR:
1644        case OP_TYPEQUERY:
1645        case OP_TYPEMINQUERY:
1646        case OP_TYPEPOSQUERY:
1647        if (code[1] == OP_PROP || code[1] == OP_NOTPROP) code += 2;
1648        break;
1649    
1650        /* Same for these */
1651    
1652        case OP_TYPEUPTO:
1653        case OP_TYPEMINUPTO:
1654        case OP_TYPEPOSUPTO:
1655        if (code[3] == OP_PROP || code[3] == OP_NOTPROP) code += 2;
1656        break;
1657    
1658      /* End of branch */      /* End of branch */
1659    
1660      case OP_KET:      case OP_KET:
# Line 1605  Returns: a value representing the na Line 1771  Returns: a value representing the na
1771  static int  static int
1772  check_posix_name(const uschar *ptr, int len)  check_posix_name(const uschar *ptr, int len)
1773  {  {
1774    const char *pn = posix_names;
1775  register int yield = 0;  register int yield = 0;
1776  while (posix_name_lengths[yield] != 0)  while (posix_name_lengths[yield] != 0)
1777    {    {
1778    if (len == posix_name_lengths[yield] &&    if (len == posix_name_lengths[yield] &&
1779      strncmp((const char *)ptr, posix_names[yield], len) == 0) return yield;      strncmp((const char *)ptr, pn, len) == 0) return yield;
1780      pn += posix_name_lengths[yield] + 1;
1781    yield++;    yield++;
1782    }    }
1783  return -1;  return -1;
# Line 1651  adjust_recurse(uschar *group, int adjust Line 1819  adjust_recurse(uschar *group, int adjust
1819    uschar *save_hwm)    uschar *save_hwm)
1820  {  {
1821  uschar *ptr = group;  uschar *ptr = group;
1822    
1823  while ((ptr = (uschar *)find_recurse(ptr, utf8)) != NULL)  while ((ptr = (uschar *)find_recurse(ptr, utf8)) != NULL)
1824    {    {
1825    int offset;    int offset;
# Line 2255  for (;; ptr++) Line 2424  for (;; ptr++)
2424      */      */
2425    
2426      if (code < last_code) code = last_code;      if (code < last_code) code = last_code;
2427    
2428        /* Paranoid check for integer overflow */
2429    
2430        if (OFLOW_MAX - *lengthptr < code - last_code)
2431          {
2432          *errorcodeptr = ERR20;
2433          goto FAILED;
2434          }
2435    
2436      *lengthptr += code - last_code;      *lengthptr += code - last_code;
2437      DPRINTF(("length=%d added %d c=%c\n", *lengthptr, code - last_code, c));      DPRINTF(("length=%d added %d c=%c\n", *lengthptr, code - last_code, c));
2438    
# Line 2367  for (;; ptr++) Line 2545  for (;; ptr++)
2545      *ptrptr = ptr;      *ptrptr = ptr;
2546      if (lengthptr != NULL)      if (lengthptr != NULL)
2547        {        {
2548          if (OFLOW_MAX - *lengthptr < code - last_code)
2549            {
2550            *errorcodeptr = ERR20;
2551            goto FAILED;
2552            }
2553        *lengthptr += code - last_code;   /* To include callout length */        *lengthptr += code - last_code;   /* To include callout length */
2554        DPRINTF((">> end branch\n"));        DPRINTF((">> end branch\n"));
2555        }        }
# Line 2429  for (;; ptr++) Line 2612  for (;; ptr++)
2612        goto FAILED;        goto FAILED;
2613        }        }
2614    
2615      /* If the first character is '^', set the negation flag and skip it. */      /* If the first character is '^', set the negation flag and skip it. Also,
2616        if the first few characters (either before or after ^) are \Q\E or \E we
2617        skip them too. This makes for compatibility with Perl. */
2618    
2619      if ((c = *(++ptr)) == '^')      negate_class = FALSE;
2620        for (;;)
2621        {        {
       negate_class = TRUE;  
2622        c = *(++ptr);        c = *(++ptr);
2623        }        if (c == '\\')
2624      else          {
2625        {          if (ptr[1] == 'E') ptr++;
2626        negate_class = FALSE;            else if (strncmp((const char *)ptr+1, "Q\\E", 3) == 0) ptr += 3;
2627                else break;
2628            }
2629          else if (!negate_class && c == '^')
2630            negate_class = TRUE;
2631          else break;
2632        }        }
2633    
2634      /* 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
# Line 2579  for (;; ptr++) Line 2769  for (;; ptr++)
2769        of the specials, which just set a flag. The sequence \b is a special        of the specials, which just set a flag. The sequence \b is a special
2770        case. Inside a class (and only there) it is treated as backspace.        case. Inside a class (and only there) it is treated as backspace.
2771        Elsewhere it marks a word boundary. Other escapes have preset maps ready        Elsewhere it marks a word boundary. Other escapes have preset maps ready
2772        to or into the one we are building. We assume they have more than one        to 'or' into the one we are building. We assume they have more than one
2773        character in them, so set class_charcount bigger than one. */        character in them, so set class_charcount bigger than one. */
2774    
2775        if (c == '\\')        if (c == '\\')
# Line 2599  for (;; ptr++) Line 2789  for (;; ptr++)
2789            else inescq = TRUE;            else inescq = TRUE;
2790            continue;            continue;
2791            }            }
2792            else if (-c == ESC_E) continue;  /* Ignore orphan \E */
2793    
2794          if (c < 0)          if (c < 0)
2795            {            {
# Line 2825  for (;; ptr++) Line 3016  for (;; ptr++)
3016    
3017        oldptr = ptr;        oldptr = ptr;
3018    
3019          /* Remember \r or \n */
3020    
3021          if (c == '\r' || c == '\n') cd->external_flags |= PCRE_HASCRORLF;
3022    
3023          /* Check for range */
3024    
3025        if (!inescq && ptr[1] == '-')        if (!inescq && ptr[1] == '-')
3026          {          {
3027          int d;          int d;
# Line 2892  for (;; ptr++) Line 3089  for (;; ptr++)
3089    
3090          if (d == c) goto LONE_SINGLE_CHARACTER;  /* A few lines below */          if (d == c) goto LONE_SINGLE_CHARACTER;  /* A few lines below */
3091    
3092            /* Remember \r or \n */
3093    
3094            if (d == '\r' || d == '\n') cd->external_flags |= PCRE_HASCRORLF;
3095    
3096          /* 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
3097          matching, we have to use an XCLASS with extra data items. Caseless          matching, we have to use an XCLASS with extra data items. Caseless
3098          matching for characters > 127 is available only if UCP support is          matching for characters > 127 is available only if UCP support is
# Line 3045  for (;; ptr++) Line 3246  for (;; ptr++)
3246        goto FAILED;        goto FAILED;
3247        }        }
3248    
3249    
3250    /* This code has been disabled because it would mean that \s counts as
3251    an explicit \r or \n reference, and that's not really what is wanted. Now
3252    we set the flag only if there is a literal "\r" or "\n" in the class. */
3253    
3254    #if 0
3255        /* Remember whether \r or \n are in this class */
3256    
3257        if (negate_class)
3258          {
3259          if ((classbits[1] & 0x24) != 0x24) cd->external_flags |= PCRE_HASCRORLF;
3260          }
3261        else
3262          {
3263          if ((classbits[1] & 0x24) != 0) cd->external_flags |= PCRE_HASCRORLF;
3264          }
3265    #endif
3266    
3267    
3268      /* 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
3269      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
3270      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
3271      because OP_NOT and the related opcodes like OP_NOTSTAR operate on      optimize.
3272      single-bytes only. This is an historical hangover. Maybe one day we can  
3273      tidy these opcodes to handle multi-byte characters.      In UTF-8 mode, we can optimize the negative case only if there were no
3274        characters >= 128 because OP_NOT and the related opcodes like OP_NOTSTAR
3275        operate on single-bytes only. This is an historical hangover. Maybe one day
3276        we can tidy these opcodes to handle multi-byte characters.
3277    
3278      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
3279      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 3060  for (;; ptr++) Line 3283  for (;; ptr++)
3283      reqbyte, save the previous value for reinstating. */      reqbyte, save the previous value for reinstating. */
3284    
3285  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF8
3286      if (class_charcount == 1 &&      if (class_charcount == 1 && !class_utf8 &&
3287            (!utf8 ||        (!utf8 || !negate_class || class_lastchar < 128))
           (!class_utf8 && (!negate_class || class_lastchar < 128))))  
   
3288  #else  #else
3289      if (class_charcount == 1)      if (class_charcount == 1)
3290  #endif  #endif
# Line 3335  for (;; ptr++) Line 3556  for (;; ptr++)
3556        /* All real repeats make it impossible to handle partial matching (maybe        /* All real repeats make it impossible to handle partial matching (maybe
3557        one day we will be able to remove this restriction). */        one day we will be able to remove this restriction). */
3558    
3559        if (repeat_max != 1) cd->nopartial = TRUE;        if (repeat_max != 1) cd->external_flags |= PCRE_NOPARTIAL;
3560    
3561        /* Combine the op_type with the repeat_type */        /* Combine the op_type with the repeat_type */
3562    
# Line 3485  for (;; ptr++) Line 3706  for (;; ptr++)
3706        /* All real repeats make it impossible to handle partial matching (maybe        /* All real repeats make it impossible to handle partial matching (maybe
3707        one day we will be able to remove this restriction). */        one day we will be able to remove this restriction). */
3708    
3709        if (repeat_max != 1) cd->nopartial = TRUE;        if (repeat_max != 1) cd->external_flags |= PCRE_NOPARTIAL;
3710    
3711        if (repeat_min == 0 && repeat_max == -1)        if (repeat_min == 0 && repeat_max == -1)
3712          *code++ = OP_CRSTAR + repeat_type;          *code++ = OP_CRSTAR + repeat_type;
# Line 3521  for (;; ptr++) Line 3742  for (;; ptr++)
3742          goto FAILED;          goto FAILED;
3743          }          }
3744    
       /* This is a paranoid check to stop integer overflow later on */  
   
       if (len > MAX_DUPLENGTH)  
         {  
         *errorcodeptr = ERR50;  
         goto FAILED;  
         }  
   
3745        /* If the maximum repeat count is unlimited, find the end of the bracket        /* If the maximum repeat count is unlimited, find the end of the bracket
3746        by scanning through from the start, and compute the offset back to it        by scanning through from the start, and compute the offset back to it
3747        from the current code pointer. There may be an OP_OPT setting following        from the current code pointer. There may be an OP_OPT setting following
# Line 3617  for (;; ptr++) Line 3830  for (;; ptr++)
3830          if (repeat_min > 1)          if (repeat_min > 1)
3831            {            {
3832            /* In the pre-compile phase, we don't actually do the replication. We            /* In the pre-compile phase, we don't actually do the replication. We
3833            just adjust the length as if we had. */            just adjust the length as if we had. Do some paranoid checks for
3834              potential integer overflow. */
3835    
3836            if (lengthptr != NULL)            if (lengthptr != NULL)
3837              *lengthptr += (repeat_min - 1)*length_prevgroup;              {
3838                int delta = (repeat_min - 1)*length_prevgroup;
3839                if ((double)(repeat_min - 1)*(double)length_prevgroup >
3840                                                                (double)INT_MAX ||
3841                    OFLOW_MAX - *lengthptr < delta)
3842                  {
3843                  *errorcodeptr = ERR20;
3844                  goto FAILED;
3845                  }
3846                *lengthptr += delta;
3847                }
3848    
3849            /* This is compiling for real */            /* This is compiling for real */
3850    
# Line 3658  for (;; ptr++) Line 3882  for (;; ptr++)
3882          /* In the pre-compile phase, we don't actually do the replication. We          /* In the pre-compile phase, we don't actually do the replication. We
3883          just adjust the length as if we had. For each repetition we must add 1          just adjust the length as if we had. For each repetition we must add 1
3884          to the length for BRAZERO and for all but the last repetition we must          to the length for BRAZERO and for all but the last repetition we must
3885          add 2 + 2*LINKSIZE to allow for the nesting that occurs. */          add 2 + 2*LINKSIZE to allow for the nesting that occurs. Do some
3886            paranoid checks to avoid integer overflow. */
3887    
3888          if (lengthptr != NULL && repeat_max > 0)          if (lengthptr != NULL && repeat_max > 0)
3889            *lengthptr += repeat_max * (length_prevgroup + 1 + 2 + 2*LINK_SIZE) -            {
3890              2 - 2*LINK_SIZE;  /* Last one doesn't nest */            int delta = repeat_max * (length_prevgroup + 1 + 2 + 2*LINK_SIZE) -
3891                          2 - 2*LINK_SIZE;   /* Last one doesn't nest */
3892              if ((double)repeat_max *
3893                    (double)(length_prevgroup + 1 + 2 + 2*LINK_SIZE)
3894                      > (double)INT_MAX ||
3895                  OFLOW_MAX - *lengthptr < delta)
3896                {
3897                *errorcodeptr = ERR20;
3898                goto FAILED;
3899                }
3900              *lengthptr += delta;
3901              }
3902    
3903          /* This is compiling for real */          /* This is compiling for real */
3904    
# Line 3814  for (;; ptr++) Line 4050  for (;; ptr++)
4050      /* ===================================================================*/      /* ===================================================================*/
4051      /* Start of nested parenthesized sub-expression, or comment or lookahead or      /* Start of nested parenthesized sub-expression, or comment or lookahead or
4052      lookbehind or option setting or condition or all the other extended      lookbehind or option setting or condition or all the other extended
4053      parenthesis forms. First deal with the specials; all are introduced by ?,      parenthesis forms.  */
     and the appearance of any of them means that this is not a capturing  
     group. */  
4054    
4055      case '(':      case '(':
4056      newoptions = options;      newoptions = options;
# Line 3825  for (;; ptr++) Line 4059  for (;; ptr++)
4059      save_hwm = cd->hwm;      save_hwm = cd->hwm;
4060      reset_bracount = FALSE;      reset_bracount = FALSE;
4061    
4062      if (*(++ptr) == '?')      /* First deal with various "verbs" that can be introduced by '*'. */
4063    
4064        if (*(++ptr) == '*' && (cd->ctypes[ptr[1]] & ctype_letter) != 0)
4065          {
4066          int i, namelen;
4067          const char *vn = verbnames;
4068          const uschar *name = ++ptr;
4069          previous = NULL;
4070          while ((cd->ctypes[*++ptr] & ctype_letter) != 0);
4071          if (*ptr == ':')
4072            {
4073            *errorcodeptr = ERR59;   /* Not supported */
4074            goto FAILED;
4075            }
4076          if (*ptr != ')')
4077            {
4078            *errorcodeptr = ERR60;
4079            goto FAILED;
4080            }
4081          namelen = ptr - name;
4082          for (i = 0; i < verbcount; i++)
4083            {
4084            if (namelen == verbs[i].len &&
4085                strncmp((char *)name, vn, namelen) == 0)
4086              {
4087              *code = verbs[i].op;
4088              if (*code++ == OP_ACCEPT) cd->had_accept = TRUE;
4089              break;
4090              }
4091            vn += verbs[i].len + 1;
4092            }
4093          if (i < verbcount) continue;
4094          *errorcodeptr = ERR60;
4095          goto FAILED;
4096          }
4097    
4098        /* Deal with the extended parentheses; all are introduced by '?', and the
4099        appearance of any of them means that this is not a capturing group. */
4100    
4101        else if (*ptr == '?')
4102        {        {
4103        int i, set, unset, namelen;        int i, set, unset, namelen;
4104        int *optset;        int *optset;
# Line 4067  for (;; ptr++) Line 4340  for (;; ptr++)
4340    
4341          /* ------------------------------------------------------------ */          /* ------------------------------------------------------------ */
4342          case '!':                 /* Negative lookahead */          case '!':                 /* Negative lookahead */
         bravalue = OP_ASSERT_NOT;  
4343          ptr++;          ptr++;
4344            if (*ptr == ')')          /* Optimize (?!) */
4345              {
4346              *code++ = OP_FAIL;
4347              previous = NULL;
4348              continue;
4349              }
4350            bravalue = OP_ASSERT_NOT;
4351          break;          break;
4352    
4353    
# Line 4426  for (;; ptr++) Line 4705  for (;; ptr++)
4705    
4706              case 'J':    /* Record that it changed in the external options */              case 'J':    /* Record that it changed in the external options */
4707              *optset |= PCRE_DUPNAMES;              *optset |= PCRE_DUPNAMES;
4708              cd->external_options |= PCRE_JCHANGED;              cd->external_flags |= PCRE_JCHANGED;
4709              break;              break;
4710    
4711              case 'i': *optset |= PCRE_CASELESS; break;              case 'i': *optset |= PCRE_CASELESS; break;
# Line 4617  for (;; ptr++) Line 4896  for (;; ptr++)
4896        goto FAILED;        goto FAILED;
4897        }        }
4898    
4899      /* In the pre-compile phase, update the length by the length of the nested      /* In the pre-compile phase, update the length by the length of the group,
4900      group, less the brackets at either end. Then reduce the compiled code to      less the brackets at either end. Then reduce the compiled code to just a
4901      just the brackets so that it doesn't use much memory if it is duplicated by      set of non-capturing brackets so that it doesn't use much memory if it is
4902      a quantifier. */      duplicated by a quantifier.*/
4903    
4904      if (lengthptr != NULL)      if (lengthptr != NULL)
4905        {        {
4906          if (OFLOW_MAX - *lengthptr < length_prevgroup - 2 - 2*LINK_SIZE)
4907            {
4908            *errorcodeptr = ERR20;
4909            goto FAILED;
4910            }
4911        *lengthptr += length_prevgroup - 2 - 2*LINK_SIZE;        *lengthptr += length_prevgroup - 2 - 2*LINK_SIZE;
4912        code++;        *code++ = OP_BRA;
4913        PUTINC(code, 0, 1 + LINK_SIZE);        PUTINC(code, 0, 1 + LINK_SIZE);
4914        *code++ = OP_KET;        *code++ = OP_KET;
4915        PUTINC(code, 0, 1 + LINK_SIZE);        PUTINC(code, 0, 1 + LINK_SIZE);
4916          break;    /* No need to waste time with special character handling */
4917        }        }
4918    
4919      /* Otherwise update the main code pointer to the end of the group. */      /* Otherwise update the main code pointer to the end of the group. */
4920    
4921      else code = tempcode;      code = tempcode;
4922    
4923      /* For a DEFINE group, required and first character settings are not      /* For a DEFINE group, required and first character settings are not
4924      relevant. */      relevant. */
# Line 4837  for (;; ptr++) Line 5122  for (;; ptr++)
5122      *code++ = ((options & PCRE_CASELESS) != 0)? OP_CHARNC : OP_CHAR;      *code++ = ((options & PCRE_CASELESS) != 0)? OP_CHARNC : OP_CHAR;
5123      for (c = 0; c < mclength; c++) *code++ = mcbuffer[c];      for (c = 0; c < mclength; c++) *code++ = mcbuffer[c];
5124    
5125        /* Remember if \r or \n were seen */
5126    
5127        if (mcbuffer[0] == '\r' || mcbuffer[0] == '\n')
5128          cd->external_flags |= PCRE_HASCRORLF;
5129    
5130      /* Set the first and required bytes appropriately. If no previous first      /* Set the first and required bytes appropriately. If no previous first
5131      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.
5132      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 5119  for (;;) Line 5409  for (;;)
5409      *ptrptr = ptr;      *ptrptr = ptr;
5410      *firstbyteptr = firstbyte;      *firstbyteptr = firstbyte;
5411      *reqbyteptr = reqbyte;      *reqbyteptr = reqbyte;
5412      if (lengthptr != NULL) *lengthptr += length;      if (lengthptr != NULL)
5413          {
5414          if (OFLOW_MAX - *lengthptr < length)
5415            {
5416            *errorcodeptr = ERR20;
5417            return FALSE;
5418            }
5419          *lengthptr += length;
5420          }
5421      return TRUE;      return TRUE;
5422      }      }
5423    
# Line 5428  real_pcre *re; Line 5726  real_pcre *re;
5726  int length = 1;  /* For final END opcode */  int length = 1;  /* For final END opcode */
5727  int firstbyte, reqbyte, newline;  int firstbyte, reqbyte, newline;
5728  int errorcode = 0;  int errorcode = 0;
5729    int skipatstart = 0;
5730  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF8
5731  BOOL utf8;  BOOL utf8;
5732  #endif  #endif
# Line 5506  cd->fcc = tables + fcc_offset; Line 5805  cd->fcc = tables + fcc_offset;
5805  cd->cbits = tables + cbits_offset;  cd->cbits = tables + cbits_offset;
5806  cd->ctypes = tables + ctypes_offset;  cd->ctypes = tables + ctypes_offset;
5807    
5808    /* Check for global one-time settings at the start of the pattern, and remember
5809    the offset for later. */
5810    
5811    while (ptr[skipatstart] == '(' && ptr[skipatstart+1] == '*')
5812      {
5813      int newnl = 0;
5814      int newbsr = 0;
5815    
5816      if (strncmp((char *)(ptr+skipatstart+2), "CR)", 3) == 0)
5817        { skipatstart += 5; newnl = PCRE_NEWLINE_CR; }
5818      else if (strncmp((char *)(ptr+skipatstart+2), "LF)", 3)  == 0)
5819        { skipatstart += 5; newnl = PCRE_NEWLINE_LF; }
5820      else if (strncmp((char *)(ptr+skipatstart+2), "CRLF)", 5)  == 0)
5821        { skipatstart += 7; newnl = PCRE_NEWLINE_CR + PCRE_NEWLINE_LF; }
5822      else if (strncmp((char *)(ptr+skipatstart+2), "ANY)", 4) == 0)
5823        { skipatstart += 6; newnl = PCRE_NEWLINE_ANY; }
5824      else if (strncmp((char *)(ptr+skipatstart+2), "ANYCRLF)", 8)  == 0)
5825        { skipatstart += 10; newnl = PCRE_NEWLINE_ANYCRLF; }
5826    
5827      else if (strncmp((char *)(ptr+skipatstart+2), "BSR_ANYCRLF)", 12) == 0)
5828        { skipatstart += 14; newbsr = PCRE_BSR_ANYCRLF; }
5829      else if (strncmp((char *)(ptr+skipatstart+2), "BSR_UNICODE)", 12) == 0)
5830        { skipatstart += 14; newbsr = PCRE_BSR_UNICODE; }
5831    
5832      if (newnl != 0)
5833        options = (options & ~PCRE_NEWLINE_BITS) | newnl;
5834      else if (newbsr != 0)
5835        options = (options & ~(PCRE_BSR_ANYCRLF|PCRE_BSR_UNICODE)) | newbsr;
5836      else break;
5837      }
5838    
5839    /* Check validity of \R options. */
5840    
5841    switch (options & (PCRE_BSR_ANYCRLF|PCRE_BSR_UNICODE))
5842      {
5843      case 0:
5844      case PCRE_BSR_ANYCRLF:
5845      case PCRE_BSR_UNICODE:
5846      break;
5847      default: errorcode = ERR56; goto PCRE_EARLY_ERROR_RETURN;
5848      }
5849    
5850  /* Handle different types of newline. The three bits give seven cases. The  /* Handle different types of newline. The three bits give seven cases. The
5851  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
5852  "anycrlf". */  "anycrlf". */
5853    
5854  switch (options & (PCRE_NEWLINE_CRLF | PCRE_NEWLINE_ANY))  switch (options & PCRE_NEWLINE_BITS)
5855    {    {
5856    case 0: newline = NEWLINE; break;   /* Compile-time default */    case 0: newline = NEWLINE; break;   /* Build-time default */
5857    case PCRE_NEWLINE_CR: newline = '\r'; break;    case PCRE_NEWLINE_CR: newline = '\r'; break;
5858    case PCRE_NEWLINE_LF: newline = '\n'; break;    case PCRE_NEWLINE_LF: newline = '\n'; break;
5859    case PCRE_NEWLINE_CR+    case PCRE_NEWLINE_CR+
# Line 5575  cd->hwm = cworkspace; Line 5916  cd->hwm = cworkspace;
5916  cd->start_pattern = (const uschar *)pattern;  cd->start_pattern = (const uschar *)pattern;
5917  cd->end_pattern = (const uschar *)(pattern + strlen(pattern));  cd->end_pattern = (const uschar *)(pattern + strlen(pattern));
5918  cd->req_varyopt = 0;  cd->req_varyopt = 0;
 cd->nopartial = FALSE;  
5919  cd->external_options = options;  cd->external_options = options;
5920    cd->external_flags = 0;
5921    
5922  /* 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
5923  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 5584  been put into the cd block so that they Line 5925  been put into the cd block so that they
5925  found within the regex right at the beginning. Bringing initial option settings  found within the regex right at the beginning. Bringing initial option settings
5926  outside can help speed up starting point checks. */  outside can help speed up starting point checks. */
5927    
5928    ptr += skipatstart;
5929  code = cworkspace;  code = cworkspace;
5930  *code = OP_BRA;  *code = OP_BRA;
5931  (void)compile_regex(cd->external_options, cd->external_options & PCRE_IMS,  (void)compile_regex(cd->external_options, cd->external_options & PCRE_IMS,
# Line 5614  if (re == NULL) Line 5956  if (re == NULL)
5956    goto PCRE_EARLY_ERROR_RETURN;    goto PCRE_EARLY_ERROR_RETURN;
5957    }    }
5958    
5959  /* 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
5960  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
5961  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
5962  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
5963    pointers. */
5964    
5965  re->magic_number = MAGIC_NUMBER;  re->magic_number = MAGIC_NUMBER;
5966  re->size = size;  re->size = size;
5967  re->options = cd->external_options;  re->options = cd->external_options;
5968    re->flags = cd->external_flags;
5969  re->dummy1 = 0;  re->dummy1 = 0;
5970  re->first_byte = 0;  re->first_byte = 0;
5971  re->req_byte = 0;  re->req_byte = 0;
# Line 5646  codestart = cd->name_table + re->name_en Line 5990  codestart = cd->name_table + re->name_en
5990  cd->start_code = codestart;  cd->start_code = codestart;
5991  cd->hwm = cworkspace;  cd->hwm = cworkspace;
5992  cd->req_varyopt = 0;  cd->req_varyopt = 0;
5993  cd->nopartial = FALSE;  cd->had_accept = FALSE;
5994    
5995  /* Set up a starting, non-extracting bracket, then compile the expression. On  /* Set up a starting, non-extracting bracket, then compile the expression. On
5996  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
5997  of the function here. */  of the function here. */
5998    
5999  ptr = (const uschar *)pattern;  ptr = (const uschar *)pattern + skipatstart;
6000  code = (uschar *)codestart;  code = (uschar *)codestart;
6001  *code = OP_BRA;  *code = OP_BRA;
6002  (void)compile_regex(re->options, re->options & PCRE_IMS, &code, &ptr,  (void)compile_regex(re->options, re->options & PCRE_IMS, &code, &ptr,
6003    &errorcode, FALSE, FALSE, 0, &firstbyte, &reqbyte, NULL, cd, NULL);    &errorcode, FALSE, FALSE, 0, &firstbyte, &reqbyte, NULL, cd, NULL);
6004  re->top_bracket = cd->bracount;  re->top_bracket = cd->bracount;
6005  re->top_backref = cd->top_backref;  re->top_backref = cd->top_backref;
6006    re->flags = cd->external_flags;
6007    
6008  if (cd->nopartial) re->options |= PCRE_NOPARTIAL;  if (cd->had_accept) reqbyte = -1;   /* Must disable after (*ACCEPT) */
6009    
6010  /* 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. */
6011    
# Line 5702  if (errorcode != 0) Line 6047  if (errorcode != 0)
6047    PCRE_EARLY_ERROR_RETURN:    PCRE_EARLY_ERROR_RETURN:
6048    *erroroffset = ptr - (const uschar *)pattern;    *erroroffset = ptr - (const uschar *)pattern;
6049    PCRE_EARLY_ERROR_RETURN2:    PCRE_EARLY_ERROR_RETURN2:
6050    *errorptr = error_texts[errorcode];    *errorptr = find_error_text(errorcode);
6051    if (errorcodeptr != NULL) *errorcodeptr = errorcode;    if (errorcodeptr != NULL) *errorcodeptr = errorcode;
6052    return NULL;    return NULL;
6053    }    }
# Line 5731  if ((re->options & PCRE_ANCHORED) == 0) Line 6076  if ((re->options & PCRE_ANCHORED) == 0)
6076        int ch = firstbyte & 255;        int ch = firstbyte & 255;
6077        re->first_byte = ((firstbyte & REQ_CASELESS) != 0 &&        re->first_byte = ((firstbyte & REQ_CASELESS) != 0 &&
6078           cd->fcc[ch] == ch)? ch : firstbyte;           cd->fcc[ch] == ch)? ch : firstbyte;
6079        re->options |= PCRE_FIRSTSET;        re->flags |= PCRE_FIRSTSET;
6080        }        }
6081      else if (is_startline(codestart, 0, cd->backref_map))      else if (is_startline(codestart, 0, cd->backref_map))
6082        re->options |= PCRE_STARTLINE;        re->flags |= PCRE_STARTLINE;
6083      }      }
6084    }    }
6085    
# Line 5748  if (reqbyte >= 0 && Line 6093  if (reqbyte >= 0 &&
6093    int ch = reqbyte & 255;    int ch = reqbyte & 255;
6094    re->req_byte = ((reqbyte & REQ_CASELESS) != 0 &&    re->req_byte = ((reqbyte & REQ_CASELESS) != 0 &&
6095      cd->fcc[ch] == ch)? (reqbyte & ~REQ_CASELESS) : reqbyte;      cd->fcc[ch] == ch)? (reqbyte & ~REQ_CASELESS) : reqbyte;
6096    re->options |= PCRE_REQCHSET;    re->flags |= PCRE_REQCHSET;
6097    }    }
6098    
6099  /* 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 5759  case when building a production library. Line 6104  case when building a production library.
6104  printf("Length = %d top_bracket = %d top_backref = %d\n",  printf("Length = %d top_bracket = %d top_backref = %d\n",
6105    length, re->top_bracket, re->top_backref);    length, re->top_bracket, re->top_backref);
6106    
6107  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 " : "");  
   }  
6108    
6109  if ((re->options & PCRE_FIRSTSET) != 0)  if ((re->flags & PCRE_FIRSTSET) != 0)
6110    {    {
6111    int ch = re->first_byte & 255;    int ch = re->first_byte & 255;
6112    const char *caseless = ((re->first_byte & REQ_CASELESS) == 0)?    const char *caseless = ((re->first_byte & REQ_CASELESS) == 0)?
# Line 5782  if ((re->options & PCRE_FIRSTSET) != 0) Line 6115  if ((re->options & PCRE_FIRSTSET) != 0)
6115      else printf("First char = \\x%02x%s\n", ch, caseless);      else printf("First char = \\x%02x%s\n", ch, caseless);
6116    }    }
6117    
6118  if ((re->options & PCRE_REQCHSET) != 0)  if ((re->flags & PCRE_REQCHSET) != 0)
6119    {    {
6120    int ch = re->req_byte & 255;    int ch = re->req_byte & 255;
6121    const char *caseless = ((re->req_byte & REQ_CASELESS) == 0)?    const char *caseless = ((re->req_byte & REQ_CASELESS) == 0)?
# Line 5799  was compiled can be seen. */ Line 6132  was compiled can be seen. */
6132  if (code - codestart > length)  if (code - codestart > length)
6133    {    {
6134    (pcre_free)(re);    (pcre_free)(re);
6135    *errorptr = error_texts[ERR23];    *errorptr = find_error_text(ERR23);
6136    *erroroffset = ptr - (uschar *)pattern;    *erroroffset = ptr - (uschar *)pattern;
6137    if (errorcodeptr != NULL) *errorcodeptr = ERR23;    if (errorcodeptr != NULL) *errorcodeptr = ERR23;
6138    return NULL;    return NULL;

Legend:
Removed from v.195  
changed lines
  Added in v.240

webmaster@exim.org
ViewVC Help
Powered by ViewVC 1.1.12