/[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 613 by ph10, Sat Jul 2 16:59:52 2011 UTC revision 750 by ph10, Fri Nov 18 11:07:14 2011 UTC
# Line 393  static const char error_texts[] = Line 393  static const char error_texts[] =
393    "internal error: previously-checked referenced subpattern not found\0"    "internal error: previously-checked referenced subpattern not found\0"
394    "DEFINE group contains more than one branch\0"    "DEFINE group contains more than one branch\0"
395    /* 55 */    /* 55 */
396    "repeating a DEFINE group is not allowed\0"    "repeating a DEFINE group is not allowed\0"  /** DEAD **/
397    "inconsistent NEWLINE options\0"    "inconsistent NEWLINE options\0"
398    "\\g is not followed by a braced, angle-bracketed, or quoted name/number or by a plain number\0"    "\\g is not followed by a braced, angle-bracketed, or quoted name/number or by a plain number\0"
399    "a numbered reference must not be zero\0"    "a numbered reference must not be zero\0"
# Line 409  static const char error_texts[] = Line 409  static const char error_texts[] =
409    "(*MARK) must have an argument\0"    "(*MARK) must have an argument\0"
410    "this version of PCRE is not compiled with PCRE_UCP support\0"    "this version of PCRE is not compiled with PCRE_UCP support\0"
411    "\\c must be followed by an ASCII character\0"    "\\c must be followed by an ASCII character\0"
412      "\\k is not followed by a braced, angle-bracketed, or quoted name\0"
413      /* 70 */
414      "internal error: unknown opcode in find_fixedlength()\0"
415    ;    ;
416    
417  /* 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 545  static const unsigned char ebcdic_charta Line 548  static const unsigned char ebcdic_charta
548  /* Definition to allow mutual recursion */  /* Definition to allow mutual recursion */
549    
550  static BOOL  static BOOL
551    compile_regex(int, uschar **, const uschar **, int *, BOOL, BOOL, int, int *,    compile_regex(int, uschar **, const uschar **, int *, BOOL, BOOL, int, int,
552      int *, branch_chain *, compile_data *, int *);      int *, int *, branch_chain *, compile_data *, int *);
553    
554    
555    
# Line 577  return s; Line 580  return s;
580    
581    
582  /*************************************************  /*************************************************
583    *            Check for counted repeat            *
584    *************************************************/
585    
586    /* This function is called when a '{' is encountered in a place where it might
587    start a quantifier. It looks ahead to see if it really is a quantifier or not.
588    It is only a quantifier if it is one of the forms {ddd} {ddd,} or {ddd,ddd}
589    where the ddds are digits.
590    
591    Arguments:
592      p         pointer to the first char after '{'
593    
594    Returns:    TRUE or FALSE
595    */
596    
597    static BOOL
598    is_counted_repeat(const uschar *p)
599    {
600    if ((digitab[*p++] & ctype_digit) == 0) return FALSE;
601    while ((digitab[*p] & ctype_digit) != 0) p++;
602    if (*p == CHAR_RIGHT_CURLY_BRACKET) return TRUE;
603    
604    if (*p++ != CHAR_COMMA) return FALSE;
605    if (*p == CHAR_RIGHT_CURLY_BRACKET) return TRUE;
606    
607    if ((digitab[*p++] & ctype_digit) == 0) return FALSE;
608    while ((digitab[*p] & ctype_digit) != 0) p++;
609    
610    return (*p == CHAR_RIGHT_CURLY_BRACKET);
611    }
612    
613    
614    
615    /*************************************************
616  *            Handle escapes                      *  *            Handle escapes                      *
617  *************************************************/  *************************************************/
618    
# Line 642  else Line 678  else
678    
679      case CHAR_l:      case CHAR_l:
680      case CHAR_L:      case CHAR_L:
681        *errorcodeptr = ERR37;
682        break;
683    
684      case CHAR_u:      case CHAR_u:
685        if ((options & PCRE_JAVASCRIPT_COMPAT) != 0)
686          {
687          /* In JavaScript, \u must be followed by four hexadecimal numbers.
688          Otherwise it is a lowercase u letter. */
689          if ((digitab[ptr[1]] & ctype_xdigit) != 0 && (digitab[ptr[2]] & ctype_xdigit) != 0
690               && (digitab[ptr[3]] & ctype_xdigit) != 0 && (digitab[ptr[4]] & ctype_xdigit) != 0)
691            {
692            c = 0;
693            for (i = 0; i < 4; ++i)
694              {
695              register int cc = *(++ptr);
696    #ifndef EBCDIC  /* ASCII/UTF-8 coding */
697              if (cc >= CHAR_a) cc -= 32;               /* Convert to upper case */
698              c = (c << 4) + cc - ((cc < CHAR_A)? CHAR_0 : (CHAR_A - 10));
699    #else           /* EBCDIC coding */
700              if (cc >= CHAR_a && cc <= CHAR_z) cc += 64;  /* Convert to upper case */
701              c = (c << 4) + cc - ((cc >= CHAR_0)? CHAR_0 : (CHAR_A - 10));
702    #endif
703              }
704            }
705          }
706        else
707          *errorcodeptr = ERR37;
708        break;
709    
710      case CHAR_U:      case CHAR_U:
711      *errorcodeptr = ERR37;      /* In JavaScript, \U is an uppercase U letter. */
712        if ((options & PCRE_JAVASCRIPT_COMPAT) == 0) *errorcodeptr = ERR37;
713      break;      break;
714    
715      /* \g must be followed by one of a number of specific things:      /* In a character class, \g is just a literal "g". Outside a character
716        class, \g must be followed by one of a number of specific things:
717    
718      (1) A number, either plain or braced. If positive, it is an absolute      (1) A number, either plain or braced. If positive, it is an absolute
719      backreference. If negative, it is a relative backreference. This is a Perl      backreference. If negative, it is a relative backreference. This is a Perl
# Line 664  else Line 730  else
730      the -ESC_g code (cf \k). */      the -ESC_g code (cf \k). */
731    
732      case CHAR_g:      case CHAR_g:
733        if (isclass) break;
734      if (ptr[1] == CHAR_LESS_THAN_SIGN || ptr[1] == CHAR_APOSTROPHE)      if (ptr[1] == CHAR_LESS_THAN_SIGN || ptr[1] == CHAR_APOSTROPHE)
735        {        {
736        c = -ESC_g;        c = -ESC_g;
# Line 792  else Line 859  else
859      treated as a data character. */      treated as a data character. */
860    
861      case CHAR_x:      case CHAR_x:
862        if ((options & PCRE_JAVASCRIPT_COMPAT) != 0)
863          {
864          /* In JavaScript, \x must be followed by two hexadecimal numbers.
865          Otherwise it is a lowercase x letter. */
866          if ((digitab[ptr[1]] & ctype_xdigit) != 0 && (digitab[ptr[2]] & ctype_xdigit) != 0)
867            {
868            c = 0;
869            for (i = 0; i < 2; ++i)
870              {
871              register int cc = *(++ptr);
872    #ifndef EBCDIC  /* ASCII/UTF-8 coding */
873              if (cc >= CHAR_a) cc -= 32;               /* Convert to upper case */
874              c = (c << 4) + cc - ((cc < CHAR_A)? CHAR_0 : (CHAR_A - 10));
875    #else           /* EBCDIC coding */
876              if (cc >= CHAR_a && cc <= CHAR_z) cc += 64;  /* Convert to upper case */
877              c = (c << 4) + cc - ((cc >= CHAR_0)? CHAR_0 : (CHAR_A - 10));
878    #endif
879              }
880            }
881          break;
882          }
883    
884      if (ptr[1] == CHAR_LEFT_CURLY_BRACKET)      if (ptr[1] == CHAR_LEFT_CURLY_BRACKET)
885        {        {
886        const uschar *pt = ptr + 2;        const uschar *pt = ptr + 2;
# Line 885  else Line 974  else
974    }    }
975    
976  /* Perl supports \N{name} for character names, as well as plain \N for "not  /* Perl supports \N{name} for character names, as well as plain \N for "not
977  newline". PCRE does not support \N{name}. */  newline". PCRE does not support \N{name}. However, it does support
978    quantification such as \N{2,3}. */
979    
980  if (c == -ESC_N && ptr[1] == CHAR_LEFT_CURLY_BRACKET)  if (c == -ESC_N && ptr[1] == CHAR_LEFT_CURLY_BRACKET &&
981         !is_counted_repeat(ptr+2))
982    *errorcodeptr = ERR37;    *errorcodeptr = ERR37;
983    
984  /* If PCRE_UCP is set, we change the values for \d etc. */  /* If PCRE_UCP is set, we change the values for \d etc. */
# Line 997  return -1; Line 1088  return -1;
1088    
1089    
1090  /*************************************************  /*************************************************
 *            Check for counted repeat            *  
 *************************************************/  
   
 /* This function is called when a '{' is encountered in a place where it might  
 start a quantifier. It looks ahead to see if it really is a quantifier or not.  
 It is only a quantifier if it is one of the forms {ddd} {ddd,} or {ddd,ddd}  
 where the ddds are digits.  
   
 Arguments:  
   p         pointer to the first char after '{'  
   
 Returns:    TRUE or FALSE  
 */  
   
 static BOOL  
 is_counted_repeat(const uschar *p)  
 {  
 if ((digitab[*p++] & ctype_digit) == 0) return FALSE;  
 while ((digitab[*p] & ctype_digit) != 0) p++;  
 if (*p == CHAR_RIGHT_CURLY_BRACKET) return TRUE;  
   
 if (*p++ != CHAR_COMMA) return FALSE;  
 if (*p == CHAR_RIGHT_CURLY_BRACKET) return TRUE;  
   
 if ((digitab[*p++] & ctype_digit) == 0) return FALSE;  
 while ((digitab[*p] & ctype_digit) != 0) p++;  
   
 return (*p == CHAR_RIGHT_CURLY_BRACKET);  
 }  
   
   
   
 /*************************************************  
1091  *         Read repeat counts                     *  *         Read repeat counts                     *
1092  *************************************************/  *************************************************/
1093    
# Line 1472  Returns:   the fixed length, Line 1530  Returns:   the fixed length,
1530               or -1 if there is no fixed length,               or -1 if there is no fixed length,
1531               or -2 if \C was encountered               or -2 if \C was encountered
1532               or -3 if an OP_RECURSE item was encountered and atend is FALSE               or -3 if an OP_RECURSE item was encountered and atend is FALSE
1533                 or -4 if an unknown opcode was encountered (internal error)
1534  */  */
1535    
1536  static int  static int
# Line 1495  for (;;) Line 1554  for (;;)
1554      /* We only need to continue for OP_CBRA (normal capturing bracket) and      /* We only need to continue for OP_CBRA (normal capturing bracket) and
1555      OP_BRA (normal non-capturing bracket) because the other variants of these      OP_BRA (normal non-capturing bracket) because the other variants of these
1556      opcodes are all concerned with unlimited repeated groups, which of course      opcodes are all concerned with unlimited repeated groups, which of course
1557      are not of fixed length. They will cause a -1 response from the default      are not of fixed length. */
     case of this switch. */  
1558    
1559      case OP_CBRA:      case OP_CBRA:
1560      case OP_BRA:      case OP_BRA:
1561      case OP_ONCE:      case OP_ONCE:
1562        case OP_ONCE_NC:
1563      case OP_COND:      case OP_COND:
1564      d = find_fixedlength(cc + ((op == OP_CBRA)? 2:0), utf8, atend, cd);      d = find_fixedlength(cc + ((op == OP_CBRA)? 2:0), utf8, atend, cd);
1565      if (d < 0) return d;      if (d < 0) return d;
# Line 1509  for (;;) Line 1568  for (;;)
1568      cc += 1 + LINK_SIZE;      cc += 1 + LINK_SIZE;
1569      break;      break;
1570    
1571      /* Reached end of a branch; if it's a ket it is the end of a nested      /* Reached end of a branch; if it's a ket it is the end of a nested call.
1572      call. If it's ALT it is an alternation in a nested call. If it is      If it's ALT it is an alternation in a nested call. An ACCEPT is effectively
1573      END it's the end of the outer call. All can be handled by the same code.      an ALT. If it is END it's the end of the outer call. All can be handled by
1574      Note that we must not include the OP_KETRxxx opcodes here, because they      the same code. Note that we must not include the OP_KETRxxx opcodes here,
1575      all imply an unlimited repeat. */      because they all imply an unlimited repeat. */
1576    
1577      case OP_ALT:      case OP_ALT:
1578      case OP_KET:      case OP_KET:
1579      case OP_END:      case OP_END:
1580        case OP_ACCEPT:
1581        case OP_ASSERT_ACCEPT:
1582      if (length < 0) length = branchlength;      if (length < 0) length = branchlength;
1583        else if (length != branchlength) return -1;        else if (length != branchlength) return -1;
1584      if (*cc != OP_ALT) return length;      if (*cc != OP_ALT) return length;
# Line 1551  for (;;) Line 1612  for (;;)
1612    
1613      /* Skip over things that don't match chars */      /* Skip over things that don't match chars */
1614    
1615      case OP_REVERSE:      case OP_MARK:
1616      case OP_CREF:      case OP_PRUNE_ARG:
1617      case OP_NCREF:      case OP_SKIP_ARG:
1618      case OP_RREF:      case OP_THEN_ARG:
1619      case OP_NRREF:      cc += cc[1] + _pcre_OP_lengths[*cc];
1620      case OP_DEF:      break;
1621    
1622      case OP_CALLOUT:      case OP_CALLOUT:
     case OP_SOD:  
     case OP_SOM:  
     case OP_SET_SOM:  
     case OP_EOD:  
     case OP_EODN:  
1623      case OP_CIRC:      case OP_CIRC:
1624      case OP_CIRCM:      case OP_CIRCM:
1625        case OP_CLOSE:
1626        case OP_COMMIT:
1627        case OP_CREF:
1628        case OP_DEF:
1629      case OP_DOLL:      case OP_DOLL:
1630      case OP_DOLLM:      case OP_DOLLM:
1631        case OP_EOD:
1632        case OP_EODN:
1633        case OP_FAIL:
1634        case OP_NCREF:
1635        case OP_NRREF:
1636      case OP_NOT_WORD_BOUNDARY:      case OP_NOT_WORD_BOUNDARY:
1637        case OP_PRUNE:
1638        case OP_REVERSE:
1639        case OP_RREF:
1640        case OP_SET_SOM:
1641        case OP_SKIP:
1642        case OP_SOD:
1643        case OP_SOM:
1644        case OP_THEN:
1645      case OP_WORD_BOUNDARY:      case OP_WORD_BOUNDARY:
1646      cc += _pcre_OP_lengths[*cc];      cc += _pcre_OP_lengths[*cc];
1647      break;      break;
# Line 1589  for (;;) Line 1663  for (;;)
1663      need to skip over a multibyte character in UTF8 mode.  */      need to skip over a multibyte character in UTF8 mode.  */
1664    
1665      case OP_EXACT:      case OP_EXACT:
1666        case OP_EXACTI:
1667        case OP_NOTEXACT:
1668        case OP_NOTEXACTI:
1669      branchlength += GET2(cc,1);      branchlength += GET2(cc,1);
1670      cc += 4;      cc += 4;
1671  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF8
# Line 1609  for (;;) Line 1686  for (;;)
1686      cc += 2;      cc += 2;
1687      /* Fall through */      /* Fall through */
1688    
1689        case OP_HSPACE:
1690        case OP_VSPACE:
1691        case OP_NOT_HSPACE:
1692        case OP_NOT_VSPACE:
1693      case OP_NOT_DIGIT:      case OP_NOT_DIGIT:
1694      case OP_DIGIT:      case OP_DIGIT:
1695      case OP_NOT_WHITESPACE:      case OP_NOT_WHITESPACE:
# Line 1640  for (;;) Line 1721  for (;;)
1721    
1722      switch (*cc)      switch (*cc)
1723        {        {
1724          case OP_CRPLUS:
1725          case OP_CRMINPLUS:
1726        case OP_CRSTAR:        case OP_CRSTAR:
1727        case OP_CRMINSTAR:        case OP_CRMINSTAR:
1728        case OP_CRQUERY:        case OP_CRQUERY:
# Line 1660  for (;;) Line 1743  for (;;)
1743    
1744      /* Anything else is variable length */      /* Anything else is variable length */
1745    
1746      default:      case OP_ANYNL:
1747        case OP_BRAMINZERO:
1748        case OP_BRAPOS:
1749        case OP_BRAPOSZERO:
1750        case OP_BRAZERO:
1751        case OP_CBRAPOS:
1752        case OP_EXTUNI:
1753        case OP_KETRMAX:
1754        case OP_KETRMIN:
1755        case OP_KETRPOS:
1756        case OP_MINPLUS:
1757        case OP_MINPLUSI:
1758        case OP_MINQUERY:
1759        case OP_MINQUERYI:
1760        case OP_MINSTAR:
1761        case OP_MINSTARI:
1762        case OP_MINUPTO:
1763        case OP_MINUPTOI:
1764        case OP_NOTMINPLUS:
1765        case OP_NOTMINPLUSI:
1766        case OP_NOTMINQUERY:
1767        case OP_NOTMINQUERYI:
1768        case OP_NOTMINSTAR:
1769        case OP_NOTMINSTARI:
1770        case OP_NOTMINUPTO:
1771        case OP_NOTMINUPTOI:
1772        case OP_NOTPLUS:
1773        case OP_NOTPLUSI:
1774        case OP_NOTPOSPLUS:
1775        case OP_NOTPOSPLUSI:
1776        case OP_NOTPOSQUERY:
1777        case OP_NOTPOSQUERYI:
1778        case OP_NOTPOSSTAR:
1779        case OP_NOTPOSSTARI:
1780        case OP_NOTPOSUPTO:
1781        case OP_NOTPOSUPTOI:
1782        case OP_NOTQUERY:
1783        case OP_NOTQUERYI:
1784        case OP_NOTSTAR:
1785        case OP_NOTSTARI:
1786        case OP_NOTUPTO:
1787        case OP_NOTUPTOI:
1788        case OP_PLUS:
1789        case OP_PLUSI:
1790        case OP_POSPLUS:
1791        case OP_POSPLUSI:
1792        case OP_POSQUERY:
1793        case OP_POSQUERYI:
1794        case OP_POSSTAR:
1795        case OP_POSSTARI:
1796        case OP_POSUPTO:
1797        case OP_POSUPTOI:
1798        case OP_QUERY:
1799        case OP_QUERYI:
1800        case OP_REF:
1801        case OP_REFI:
1802        case OP_SBRA:
1803        case OP_SBRAPOS:
1804        case OP_SCBRA:
1805        case OP_SCBRAPOS:
1806        case OP_SCOND:
1807        case OP_SKIPZERO:
1808        case OP_STAR:
1809        case OP_STARI:
1810        case OP_TYPEMINPLUS:
1811        case OP_TYPEMINQUERY:
1812        case OP_TYPEMINSTAR:
1813        case OP_TYPEMINUPTO:
1814        case OP_TYPEPLUS:
1815        case OP_TYPEPOSPLUS:
1816        case OP_TYPEPOSQUERY:
1817        case OP_TYPEPOSSTAR:
1818        case OP_TYPEPOSUPTO:
1819        case OP_TYPEQUERY:
1820        case OP_TYPESTAR:
1821        case OP_TYPEUPTO:
1822        case OP_UPTO:
1823        case OP_UPTOI:
1824      return -1;      return -1;
1825    
1826        /* Catch unrecognized opcodes so that when new ones are added they
1827        are not forgotten, as has happened in the past. */
1828    
1829        default:
1830        return -4;
1831      }      }
1832    }    }
1833  /* Control never gets here */  /* Control never gets here */
# Line 1694  _pcre_find_bracket(const uschar *code, B Line 1860  _pcre_find_bracket(const uschar *code, B
1860  for (;;)  for (;;)
1861    {    {
1862    register int c = *code;    register int c = *code;
1863    
1864    if (c == OP_END) return NULL;    if (c == OP_END) return NULL;
1865    
1866    /* 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
# Line 1755  for (;;) Line 1922  for (;;)
1922        break;        break;
1923    
1924        case OP_THEN_ARG:        case OP_THEN_ARG:
1925        code += code[1+LINK_SIZE];        code += code[1];
1926        break;        break;
1927        }        }
1928    
# Line 1874  for (;;) Line 2041  for (;;)
2041        break;        break;
2042    
2043        case OP_THEN_ARG:        case OP_THEN_ARG:
2044        code += code[1+LINK_SIZE];        code += code[1];
2045        break;        break;
2046        }        }
2047    
# Line 1974  for (code = first_significant_code(code Line 2141  for (code = first_significant_code(code
2141      }      }
2142    
2143    /* For a recursion/subroutine call, if its end has been reached, which    /* For a recursion/subroutine call, if its end has been reached, which
2144    implies a subroutine call, we can scan it. */    implies a backward reference subroutine call, we can scan it. If it's a
2145      forward reference subroutine call, we can't. To detect forward reference
2146      we have to scan up the list that is kept in the workspace. This function is
2147      called only when doing the real compile, not during the pre-compile that
2148      measures the size of the compiled pattern. */
2149    
2150    if (c == OP_RECURSE)    if (c == OP_RECURSE)
2151      {      {
2152      BOOL empty_branch = FALSE;      const uschar *scode;
2153      const uschar *scode = cd->start_code + GET(code, 1);      BOOL empty_branch;
2154    
2155        /* Test for forward reference */
2156    
2157        for (scode = cd->start_workspace; scode < cd->hwm; scode += LINK_SIZE)
2158          if (GET(scode, 0) == code + 1 - cd->start_code) return TRUE;
2159    
2160        /* Not a forward reference, test for completed backward reference */
2161    
2162        empty_branch = FALSE;
2163        scode = cd->start_code + GET(code, 1);
2164      if (GET(scode, 1) == 0) return TRUE;    /* Unclosed */      if (GET(scode, 1) == 0) return TRUE;    /* Unclosed */
2165    
2166        /* Completed backwards reference */
2167    
2168      do      do
2169        {        {
2170        if (could_be_empty_branch(scode, endcode, utf8, cd))        if (could_be_empty_branch(scode, endcode, utf8, cd))
# Line 1991  for (code = first_significant_code(code Line 2175  for (code = first_significant_code(code
2175        scode += GET(scode, 1);        scode += GET(scode, 1);
2176        }        }
2177      while (*scode == OP_ALT);      while (*scode == OP_ALT);
2178    
2179      if (!empty_branch) return FALSE;  /* All branches are non-empty */      if (!empty_branch) return FALSE;  /* All branches are non-empty */
2180      continue;      continue;
2181      }      }
# Line 2021  for (code = first_significant_code(code Line 2206  for (code = first_significant_code(code
2206    
2207    if (c == OP_BRA  || c == OP_BRAPOS ||    if (c == OP_BRA  || c == OP_BRAPOS ||
2208        c == OP_CBRA || c == OP_CBRAPOS ||        c == OP_CBRA || c == OP_CBRAPOS ||
2209        c == OP_ONCE || c == OP_COND)        c == OP_ONCE || c == OP_ONCE_NC ||
2210          c == OP_COND)
2211      {      {
2212      BOOL empty_branch;      BOOL empty_branch;
2213      if (GET(code, 1) == 0) return TRUE;    /* Hit unclosed bracket */      if (GET(code, 1) == 0) return TRUE;    /* Hit unclosed bracket */
# Line 2193  for (code = first_significant_code(code Line 2379  for (code = first_significant_code(code
2379      break;      break;
2380    
2381      case OP_THEN_ARG:      case OP_THEN_ARG:
2382      code += code[1+LINK_SIZE];      code += code[1];
2383      break;      break;
2384    
2385      /* None of the remaining opcodes are required to match a character. */      /* None of the remaining opcodes are required to match a character. */
# Line 2216  return TRUE; Line 2402  return TRUE;
2402  the current branch of the current pattern to see if it could match the empty  the current branch of the current pattern to see if it could match the empty
2403  string. If it could, we must look outwards for branches at other levels,  string. If it could, we must look outwards for branches at other levels,
2404  stopping when we pass beyond the bracket which is the subject of the recursion.  stopping when we pass beyond the bracket which is the subject of the recursion.
2405    This function is called only during the real compile, not during the
2406    pre-compile.
2407    
2408  Arguments:  Arguments:
2409    code        points to start of the recursion    code        points to start of the recursion
# Line 2266  where Perl recognizes it as the POSIX cl Line 2454  where Perl recognizes it as the POSIX cl
2454  "l\ower". This is a lesser evil that not diagnosing bad classes when Perl does,  "l\ower". This is a lesser evil that not diagnosing bad classes when Perl does,
2455  I think.  I think.
2456    
2457    A user pointed out that PCRE was rejecting [:a[:digit:]] whereas Perl was not.
2458    It seems that the appearance of a nested POSIX class supersedes an apparent
2459    external class. For example, [:a[:digit:]b:] matches "a", "b", ":", or
2460    a digit.
2461    
2462    In Perl, unescaped square brackets may also appear as part of class names. For
2463    example, [:a[:abc]b:] gives unknown POSIX class "[:abc]b:]". However, for
2464    [:a[:abc]b][b:] it gives unknown POSIX class "[:abc]b][b:]", which does not
2465    seem right at all. PCRE does not allow closing square brackets in POSIX class
2466    names.
2467    
2468  Arguments:  Arguments:
2469    ptr      pointer to the initial [    ptr      pointer to the initial [
2470    endptr   where to return the end pointer    endptr   where to return the end pointer
# Line 2280  int terminator;          /* Don't combin Line 2479  int terminator;          /* Don't combin
2479  terminator = *(++ptr);   /* compiler warns about "non-constant" initializer. */  terminator = *(++ptr);   /* compiler warns about "non-constant" initializer. */
2480  for (++ptr; *ptr != 0; ptr++)  for (++ptr; *ptr != 0; ptr++)
2481    {    {
2482    if (*ptr == CHAR_BACKSLASH && ptr[1] == CHAR_RIGHT_SQUARE_BRACKET) ptr++; else    if (*ptr == CHAR_BACKSLASH && ptr[1] == CHAR_RIGHT_SQUARE_BRACKET)
2483        ptr++;
2484      else if (*ptr == CHAR_RIGHT_SQUARE_BRACKET) return FALSE;
2485      else
2486      {      {
     if (*ptr == CHAR_RIGHT_SQUARE_BRACKET) return FALSE;  
2487      if (*ptr == terminator && ptr[1] == CHAR_RIGHT_SQUARE_BRACKET)      if (*ptr == terminator && ptr[1] == CHAR_RIGHT_SQUARE_BRACKET)
2488        {        {
2489        *endptr = ptr;        *endptr = ptr;
2490        return TRUE;        return TRUE;
2491        }        }
2492        if (*ptr == CHAR_LEFT_SQUARE_BRACKET &&
2493             (ptr[1] == CHAR_COLON || ptr[1] == CHAR_DOT ||
2494              ptr[1] == CHAR_EQUALS_SIGN) &&
2495            check_posix_syntax(ptr, endptr))
2496          return FALSE;
2497      }      }
2498    }    }
2499  return FALSE;  return FALSE;
# Line 2997  Arguments: Line 3203  Arguments:
3203    firstbyteptr   set to initial literal character, or < 0 (REQ_UNSET, REQ_NONE)    firstbyteptr   set to initial literal character, or < 0 (REQ_UNSET, REQ_NONE)
3204    reqbyteptr     set to the last literal character required, else < 0    reqbyteptr     set to the last literal character required, else < 0
3205    bcptr          points to current branch chain    bcptr          points to current branch chain
3206      cond_depth     conditional nesting depth
3207    cd             contains pointers to tables etc.    cd             contains pointers to tables etc.
3208    lengthptr      NULL during the real compile phase    lengthptr      NULL during the real compile phase
3209                   points to length accumulator during pre-compile phase                   points to length accumulator during pre-compile phase
# Line 3008  Returns:         TRUE on success Line 3215  Returns:         TRUE on success
3215  static BOOL  static BOOL
3216  compile_branch(int *optionsptr, uschar **codeptr, const uschar **ptrptr,  compile_branch(int *optionsptr, uschar **codeptr, const uschar **ptrptr,
3217    int *errorcodeptr, int *firstbyteptr, int *reqbyteptr, branch_chain *bcptr,    int *errorcodeptr, int *firstbyteptr, int *reqbyteptr, branch_chain *bcptr,
3218    compile_data *cd, int *lengthptr)    int cond_depth, compile_data *cd, int *lengthptr)
3219  {  {
3220  int repeat_type, op_type;  int repeat_type, op_type;
3221  int repeat_min = 0, repeat_max = 0;      /* To please picky compilers */  int repeat_min = 0, repeat_max = 0;      /* To please picky compilers */
# Line 3017  int greedy_default, greedy_non_default; Line 3224  int greedy_default, greedy_non_default;
3224  int firstbyte, reqbyte;  int firstbyte, reqbyte;
3225  int zeroreqbyte, zerofirstbyte;  int zeroreqbyte, zerofirstbyte;
3226  int req_caseopt, reqvary, tempreqvary;  int req_caseopt, reqvary, tempreqvary;
3227  int options = *optionsptr;  int options = *optionsptr;               /* May change dynamically */
3228  int after_manual_callout = 0;  int after_manual_callout = 0;
3229  int length_prevgroup = 0;  int length_prevgroup = 0;
3230  register int c;  register int c;
# Line 3035  uschar *previous_callout = NULL; Line 3242  uschar *previous_callout = NULL;
3242  uschar *save_hwm = NULL;  uschar *save_hwm = NULL;
3243  uschar classbits[32];  uschar classbits[32];
3244    
3245    /* We can fish out the UTF-8 setting once and for all into a BOOL, but we
3246    must not do this for other options (e.g. PCRE_EXTENDED) because they may change
3247    dynamically as we process the pattern. */
3248    
3249  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF8
3250  BOOL class_utf8;  BOOL class_utf8;
3251  BOOL utf8 = (options & PCRE_UTF8) != 0;  BOOL utf8 = (options & PCRE_UTF8) != 0;
# Line 3043  uschar *class_utf8data_base; Line 3254  uschar *class_utf8data_base;
3254  uschar utf8_char[6];  uschar utf8_char[6];
3255  #else  #else
3256  BOOL utf8 = FALSE;  BOOL utf8 = FALSE;
 uschar *utf8_char = NULL;  
3257  #endif  #endif
3258    
3259  #ifdef PCRE_DEBUG  #ifdef PCRE_DEBUG
# Line 3094  for (;; ptr++) Line 3304  for (;; ptr++)
3304    int subfirstbyte;    int subfirstbyte;
3305    int terminator;    int terminator;
3306    int mclength;    int mclength;
3307      int tempbracount;
3308    uschar mcbuffer[8];    uschar mcbuffer[8];
3309    
3310    /* Get next byte in the pattern */    /* Get next byte in the pattern */
# Line 3215  for (;; ptr++) Line 3426  for (;; ptr++)
3426      previous_callout = NULL;      previous_callout = NULL;
3427      }      }
3428    
3429    /* In extended mode, skip white space and comments */    /* In extended mode, skip white space and comments. */
3430    
3431    if ((options & PCRE_EXTENDED) != 0)    if ((options & PCRE_EXTENDED) != 0)
3432      {      {
# Line 4184  for (;; ptr++) Line 4395  for (;; ptr++)
4395      op_type = 0;                    /* Default single-char op codes */      op_type = 0;                    /* Default single-char op codes */
4396      possessive_quantifier = FALSE;  /* Default not possessive quantifier */      possessive_quantifier = FALSE;  /* Default not possessive quantifier */
4397    
4398      /* Save start of previous item, in case we have to move it up to make space      /* Save start of previous item, in case we have to move it up in order to
4399      for an inserted OP_ONCE for the additional '+' extension. */      insert something before it. */
4400    
4401      tempcode = previous;      tempcode = previous;
4402    
# Line 4208  for (;; ptr++) Line 4419  for (;; ptr++)
4419        }        }
4420      else repeat_type = greedy_default;      else repeat_type = greedy_default;
4421    
4422        /* If previous was a recursion call, wrap it in atomic brackets so that
4423        previous becomes the atomic group. All recursions were so wrapped in the
4424        past, but it no longer happens for non-repeated recursions. In fact, the
4425        repeated ones could be re-implemented independently so as not to need this,
4426        but for the moment we rely on the code for repeating groups. */
4427    
4428        if (*previous == OP_RECURSE)
4429          {
4430          memmove(previous + 1 + LINK_SIZE, previous, 1 + LINK_SIZE);
4431          *previous = OP_ONCE;
4432          PUT(previous, 1, 2 + 2*LINK_SIZE);
4433          previous[2 + 2*LINK_SIZE] = OP_KET;
4434          PUT(previous, 3 + 2*LINK_SIZE, 2 + 2*LINK_SIZE);
4435          code += 2 + 2 * LINK_SIZE;
4436          length_prevgroup = 3 + 3*LINK_SIZE;
4437    
4438          /* When actually compiling, we need to check whether this was a forward
4439          reference, and if so, adjust the offset. */
4440    
4441          if (lengthptr == NULL && cd->hwm >= cd->start_workspace + LINK_SIZE)
4442            {
4443            int offset = GET(cd->hwm, -LINK_SIZE);
4444            if (offset == previous + 1 - cd->start_code)
4445              PUT(cd->hwm, -LINK_SIZE, offset + 1 + LINK_SIZE);
4446            }
4447          }
4448    
4449        /* Now handle repetition for the different types of item. */
4450    
4451      /* If previous was a character match, abolish the item and generate a      /* If previous was a character match, abolish the item and generate a
4452      repeat item instead. If a char item has a minumum of more than one, ensure      repeat item instead. If a char item has a minumum of more than one, ensure
4453      that it is set in reqbyte - it might not be if a sequence such as x{3} is      that it is set in reqbyte - it might not be if a sequence such as x{3} is
# Line 4499  for (;; ptr++) Line 4739  for (;; ptr++)
4739        }        }
4740    
4741      /* If previous was a bracket group, we may have to replicate it in certain      /* If previous was a bracket group, we may have to replicate it in certain
4742      cases. Note that at this point we can encounter only the "basic" BRA and      cases. Note that at this point we can encounter only the "basic" bracket
4743      KET opcodes, as this is the place where they get converted into the more      opcodes such as BRA and CBRA, as this is the place where they get converted
4744      special varieties. */      into the more special varieties such as BRAPOS and SBRA. A test for >=
4745        OP_ASSERT and <= OP_COND includes ASSERT, ASSERT_NOT, ASSERTBACK,
4746        ASSERTBACK_NOT, ONCE, BRA, CBRA, and COND. Originally, PCRE did not allow
4747        repetition of assertions, but now it does, for Perl compatibility. */
4748    
4749      else if (*previous == OP_BRA  || *previous == OP_CBRA ||      else if (*previous >= OP_ASSERT && *previous <= OP_COND)
              *previous == OP_ONCE || *previous == OP_COND)  
4750        {        {
4751        register int i;        register int i;
4752        int len = (int)(code - previous);        int len = (int)(code - previous);
4753        uschar *bralink = NULL;        uschar *bralink = NULL;
4754        uschar *brazeroptr = NULL;        uschar *brazeroptr = NULL;
4755    
4756        /* Repeating a DEFINE group is pointless */        /* Repeating a DEFINE group is pointless, but Perl allows the syntax, so
4757          we just ignore the repeat. */
4758    
4759        if (*previous == OP_COND && previous[LINK_SIZE+1] == OP_DEF)        if (*previous == OP_COND && previous[LINK_SIZE+1] == OP_DEF)
4760            goto END_REPEAT;
4761    
4762          /* There is no sense in actually repeating assertions. The only potential
4763          use of repetition is in cases when the assertion is optional. Therefore,
4764          if the minimum is greater than zero, just ignore the repeat. If the
4765          maximum is not not zero or one, set it to 1. */
4766    
4767          if (*previous < OP_ONCE)    /* Assertion */
4768          {          {
4769          *errorcodeptr = ERR55;          if (repeat_min > 0) goto END_REPEAT;
4770          goto FAILED;          if (repeat_max < 0 || repeat_max > 1) repeat_max = 1;
4771          }          }
4772    
4773        /* The case of a zero minimum is special because of the need to stick        /* The case of a zero minimum is special because of the need to stick
# Line 4537  for (;; ptr++) Line 4788  for (;; ptr++)
4788          **   goto END_REPEAT;          **   goto END_REPEAT;
4789          **   }          **   }
4790    
4791          However, that fails when a group is referenced as a subroutine from          However, that fails when a group or a subgroup within it is referenced
4792          elsewhere in the pattern, so now we stick in OP_SKIPZERO in front of it          as a subroutine from elsewhere in the pattern, so now we stick in
4793          so that it is skipped on execution. As we don't have a list of which          OP_SKIPZERO in front of it so that it is skipped on execution. As we
4794          groups are referenced, we cannot do this selectively.          don't have a list of which groups are referenced, we cannot do this
4795            selectively.
4796    
4797          If the maximum is 1 or unlimited, we just have to stick in the BRAZERO          If the maximum is 1 or unlimited, we just have to stick in the BRAZERO
4798          and do no more at this point. However, we do need to adjust any          and do no more at this point. However, we do need to adjust any
# Line 4726  for (;; ptr++) Line 4978  for (;; ptr++)
4978          }          }
4979    
4980        /* If the maximum is unlimited, set a repeater in the final copy. For        /* If the maximum is unlimited, set a repeater in the final copy. For
4981        ONCE brackets, that's all we need to do.        ONCE brackets, that's all we need to do. However, possessively repeated
4982          ONCE brackets can be converted into non-capturing brackets, as the
4983        Otherwise, if the quantifier was possessive, we convert the BRA code to        behaviour of (?:xx)++ is the same as (?>xx)++ and this saves having to
4984        the POS form, and the KET code to KETRPOS. (It turns out to be convenient        deal with possessive ONCEs specially.
4985        at runtime to detect this kind of subpattern at both the start and at the  
4986        end.) The use of special opcodes makes it possible to reduce greatly the        Otherwise, when we are doing the actual compile phase, check to see
4987        stack usage in pcre_exec(). If the group is preceded by OP_BRAZERO,        whether this group is one that could match an empty string. If so,
4988        convert this to OP_BRAPOSZERO. Then cancel the possessive flag so that        convert the initial operator to the S form (e.g. OP_BRA -> OP_SBRA) so
4989        the default action below, of wrapping everything inside atomic brackets,        that runtime checking can be done. [This check is also applied to ONCE
4990        does not happen.        groups at runtime, but in a different way.]
4991    
4992        Then, when we are doing the actual compile phase, check to see whether        Then, if the quantifier was possessive and the bracket is not a
4993        this group is one that could match an empty string. If so, convert the        conditional, we convert the BRA code to the POS form, and the KET code to
4994        initial operator to the S form (e.g. OP_BRA -> OP_SBRA) so that runtime        KETRPOS. (It turns out to be convenient at runtime to detect this kind of
4995        checking can be done. [This check is also applied to ONCE groups at        subpattern at both the start and at the end.) The use of special opcodes
4996        runtime, but in a different way.] */        makes it possible to reduce greatly the stack usage in pcre_exec(). If
4997          the group is preceded by OP_BRAZERO, convert this to OP_BRAPOSZERO.
4998    
4999          Then, if the minimum number of matches is 1 or 0, cancel the possessive
5000          flag so that the default action below, of wrapping everything inside
5001          atomic brackets, does not happen. When the minimum is greater than 1,
5002          there will be earlier copies of the group, and so we still have to wrap
5003          the whole thing. */
5004    
5005        else        else
5006          {          {
5007          uschar *ketcode = code - 1 - LINK_SIZE;          uschar *ketcode = code - 1 - LINK_SIZE;
5008          uschar *bracode = ketcode - GET(ketcode, 1);          uschar *bracode = ketcode - GET(ketcode, 1);
5009    
5010          if (*bracode == OP_ONCE)          /* Convert possessive ONCE brackets to non-capturing */
5011    
5012            if ((*bracode == OP_ONCE || *bracode == OP_ONCE_NC) &&
5013                possessive_quantifier) *bracode = OP_BRA;
5014    
5015            /* For non-possessive ONCE brackets, all we need to do is to
5016            set the KET. */
5017    
5018            if (*bracode == OP_ONCE || *bracode == OP_ONCE_NC)
5019            *ketcode = OP_KETRMAX + repeat_type;            *ketcode = OP_KETRMAX + repeat_type;
5020    
5021            /* Handle non-ONCE brackets and possessive ONCEs (which have been
5022            converted to non-capturing above). */
5023    
5024          else          else
5025            {            {
5026            if (possessive_quantifier)            /* In the compile phase, check for empty string matching. */
5027              {  
             *bracode += 1;                   /* Switch to xxxPOS opcodes */  
             *ketcode = OP_KETRPOS;  
             if (brazeroptr != NULL) *brazeroptr = OP_BRAPOSZERO;  
             possessive_quantifier = FALSE;  
             }  
           else *ketcode = OP_KETRMAX + repeat_type;  
   
5028            if (lengthptr == NULL)            if (lengthptr == NULL)
5029              {              {
5030              uschar *scode = bracode;              uschar *scode = bracode;
# Line 4775  for (;; ptr++) Line 5039  for (;; ptr++)
5039                }                }
5040              while (*scode == OP_ALT);              while (*scode == OP_ALT);
5041              }              }
5042    
5043              /* Handle possessive quantifiers. */
5044    
5045              if (possessive_quantifier)
5046                {
5047                /* For COND brackets, we wrap the whole thing in a possessively
5048                repeated non-capturing bracket, because we have not invented POS
5049                versions of the COND opcodes. Because we are moving code along, we
5050                must ensure that any pending recursive references are updated. */
5051    
5052                if (*bracode == OP_COND || *bracode == OP_SCOND)
5053                  {
5054                  int nlen = (int)(code - bracode);
5055                  *code = OP_END;
5056                  adjust_recurse(bracode, 1 + LINK_SIZE, utf8, cd, save_hwm);
5057                  memmove(bracode + 1+LINK_SIZE, bracode, nlen);
5058                  code += 1 + LINK_SIZE;
5059                  nlen += 1 + LINK_SIZE;
5060                  *bracode = OP_BRAPOS;
5061                  *code++ = OP_KETRPOS;
5062                  PUTINC(code, 0, nlen);
5063                  PUT(bracode, 1, nlen);
5064                  }
5065    
5066                /* For non-COND brackets, we modify the BRA code and use KETRPOS. */
5067    
5068                else
5069                  {
5070                  *bracode += 1;              /* Switch to xxxPOS opcodes */
5071                  *ketcode = OP_KETRPOS;
5072                  }
5073    
5074                /* If the minimum is zero, mark it as possessive, then unset the
5075                possessive flag when the minimum is 0 or 1. */
5076    
5077                if (brazeroptr != NULL) *brazeroptr = OP_BRAPOSZERO;
5078                if (repeat_min < 2) possessive_quantifier = FALSE;
5079                }
5080    
5081              /* Non-possessive quantifier */
5082    
5083              else *ketcode = OP_KETRMAX + repeat_type;
5084            }            }
5085          }          }
5086        }        }
# Line 4799  for (;; ptr++) Line 5105  for (;; ptr++)
5105      there are special alternative opcodes for this case. For anything else, we      there are special alternative opcodes for this case. For anything else, we
5106      wrap the entire repeated item inside OP_ONCE brackets. Logically, the '+'      wrap the entire repeated item inside OP_ONCE brackets. Logically, the '+'
5107      notation is just syntactic sugar, taken from Sun's Java package, but the      notation is just syntactic sugar, taken from Sun's Java package, but the
5108      special opcodes can optimize it.      special opcodes can optimize it.
5109    
5110      Possessively repeated subpatterns have already been handled in the code      Some (but not all) possessively repeated subpatterns have already been
5111      just above, so possessive_quantifier is always FALSE for them at this      completely handled in the code just above. For them, possessive_quantifier
5112      stage.      is always FALSE at this stage.
5113    
5114      Note that the repeated item starts at tempcode, not at previous, which      Note that the repeated item starts at tempcode, not at previous, which
5115      might be the first part of a string whose (former) last char we repeated.      might be the first part of a string whose (former) last char we repeated.
5116    
# Line 4910  for (;; ptr++) Line 5216  for (;; ptr++)
5216        while ((cd->ctypes[*++ptr] & ctype_letter) != 0) {};        while ((cd->ctypes[*++ptr] & ctype_letter) != 0) {};
5217        namelen = (int)(ptr - name);        namelen = (int)(ptr - name);
5218    
5219          /* It appears that Perl allows any characters whatsoever, other than
5220          a closing parenthesis, to appear in arguments, so we no longer insist on
5221          letters, digits, and underscores. */
5222    
5223        if (*ptr == CHAR_COLON)        if (*ptr == CHAR_COLON)
5224          {          {
5225          arg = ++ptr;          arg = ++ptr;
5226          while ((cd->ctypes[*ptr] & (ctype_letter|ctype_digit)) != 0          while (*ptr != 0 && *ptr != CHAR_RIGHT_PARENTHESIS) ptr++;
           || *ptr == '_') ptr++;  
5227          arglen = (int)(ptr - arg);          arglen = (int)(ptr - arg);
5228          }          }
5229    
# Line 4931  for (;; ptr++) Line 5240  for (;; ptr++)
5240          if (namelen == verbs[i].len &&          if (namelen == verbs[i].len &&
5241              strncmp((char *)name, vn, namelen) == 0)              strncmp((char *)name, vn, namelen) == 0)
5242            {            {
5243            /* Check for open captures before ACCEPT and convert it to            /* Check for open captures before ACCEPT and convert it to
5244            ASSERT_ACCEPT if in an assertion. */            ASSERT_ACCEPT if in an assertion. */
5245    
5246            if (verbs[i].op == OP_ACCEPT)            if (verbs[i].op == OP_ACCEPT)
# Line 4941  for (;; ptr++) Line 5250  for (;; ptr++)
5250                {                {
5251                *errorcodeptr = ERR59;                *errorcodeptr = ERR59;
5252                goto FAILED;                goto FAILED;
5253                }                }
5254              cd->had_accept = TRUE;              cd->had_accept = TRUE;
5255              for (oc = cd->open_caps; oc != NULL; oc = oc->next)              for (oc = cd->open_caps; oc != NULL; oc = oc->next)
5256                {                {
# Line 4949  for (;; ptr++) Line 5258  for (;; ptr++)
5258                PUT2INC(code, 0, oc->number);                PUT2INC(code, 0, oc->number);
5259                }                }
5260              *code++ = (cd->assert_depth > 0)? OP_ASSERT_ACCEPT : OP_ACCEPT;              *code++ = (cd->assert_depth > 0)? OP_ASSERT_ACCEPT : OP_ACCEPT;
5261    
5262                /* Do not set firstbyte after *ACCEPT */
5263                if (firstbyte == REQ_UNSET) firstbyte = REQ_NONE;
5264              }              }
5265    
5266            /* Handle other cases with/without an argument */            /* Handle other cases with/without an argument */
# Line 4961  for (;; ptr++) Line 5273  for (;; ptr++)
5273                goto FAILED;                goto FAILED;
5274                }                }
5275              *code = verbs[i].op;              *code = verbs[i].op;
5276              if (*code++ == OP_THEN)              if (*code++ == OP_THEN) cd->external_flags |= PCRE_HASTHEN;
               {  
               PUT(code, 0, code - bcptr->current_branch - 1);  
               code += LINK_SIZE;  
               }  
5277              }              }
5278    
5279            else            else
# Line 4976  for (;; ptr++) Line 5284  for (;; ptr++)
5284                goto FAILED;                goto FAILED;
5285                }                }
5286              *code = verbs[i].op_arg;              *code = verbs[i].op_arg;
5287              if (*code++ == OP_THEN_ARG)              if (*code++ == OP_THEN_ARG) cd->external_flags |= PCRE_HASTHEN;
               {  
               PUT(code, 0, code - bcptr->current_branch - 1);  
               code += LINK_SIZE;  
               }  
5288              *code++ = arglen;              *code++ = arglen;
5289              memcpy(code, arg, arglen);              memcpy(code, arg, arglen);
5290              code += arglen;              code += arglen;
# Line 5242  for (;; ptr++) Line 5546  for (;; ptr++)
5546          /* ------------------------------------------------------------ */          /* ------------------------------------------------------------ */
5547          case CHAR_EQUALS_SIGN:                 /* Positive lookahead */          case CHAR_EQUALS_SIGN:                 /* Positive lookahead */
5548          bravalue = OP_ASSERT;          bravalue = OP_ASSERT;
5549          cd->assert_depth += 1;          cd->assert_depth += 1;
5550          ptr++;          ptr++;
5551          break;          break;
5552    
# Line 5257  for (;; ptr++) Line 5561  for (;; ptr++)
5561            continue;            continue;
5562            }            }
5563          bravalue = OP_ASSERT_NOT;          bravalue = OP_ASSERT_NOT;
5564          cd->assert_depth += 1;          cd->assert_depth += 1;
5565          break;          break;
5566    
5567    
# Line 5267  for (;; ptr++) Line 5571  for (;; ptr++)
5571            {            {
5572            case CHAR_EQUALS_SIGN:               /* Positive lookbehind */            case CHAR_EQUALS_SIGN:               /* Positive lookbehind */
5573            bravalue = OP_ASSERTBACK;            bravalue = OP_ASSERTBACK;
5574            cd->assert_depth += 1;            cd->assert_depth += 1;
5575            ptr += 2;            ptr += 2;
5576            break;            break;
5577    
5578            case CHAR_EXCLAMATION_MARK:          /* Negative lookbehind */            case CHAR_EXCLAMATION_MARK:          /* Negative lookbehind */
5579            bravalue = OP_ASSERTBACK_NOT;            bravalue = OP_ASSERTBACK_NOT;
5580            cd->assert_depth += 1;            cd->assert_depth += 1;
5581            ptr += 2;            ptr += 2;
5582            break;            break;
5583    
# Line 5664  for (;; ptr++) Line 5968  for (;; ptr++)
5968    
5969                /* Fudge the value of "called" so that when it is inserted as an                /* Fudge the value of "called" so that when it is inserted as an
5970                offset below, what it actually inserted is the reference number                offset below, what it actually inserted is the reference number
5971                of the group. */                of the group. Then remember the forward reference. */
5972    
5973                called = cd->start_code + recno;                called = cd->start_code + recno;
5974                PUTINC(cd->hwm, 0, (int)(code + 2 + LINK_SIZE - cd->start_code));                PUTINC(cd->hwm, 0, (int)(code + 1 - cd->start_code));
5975                }                }
5976    
5977              /* If not a forward reference, and the subpattern is still open,              /* If not a forward reference, and the subpattern is still open,
5978              this is a recursive call. We check to see if this is a left              this is a recursive call. We check to see if this is a left
5979              recursion that could loop for ever, and diagnose that case. */              recursion that could loop for ever, and diagnose that case. We
5980                must not, however, do this check if we are in a conditional
5981                subpattern because the condition might be testing for recursion in
5982                a pattern such as /(?(R)a+|(?R)b)/, which is perfectly valid.
5983                Forever loops are also detected at runtime, so those that occur in
5984                conditional subpatterns will be picked up then. */
5985    
5986              else if (GET(called, 1) == 0 &&              else if (GET(called, 1) == 0 && cond_depth <= 0 &&
5987                       could_be_empty(called, code, bcptr, utf8, cd))                       could_be_empty(called, code, bcptr, utf8, cd))
5988                {                {
5989                *errorcodeptr = ERR40;                *errorcodeptr = ERR40;
# Line 5682  for (;; ptr++) Line 5991  for (;; ptr++)
5991                }                }
5992              }              }
5993    
5994            /* Insert the recursion/subroutine item, automatically wrapped inside            /* Insert the recursion/subroutine item. */
           "once" brackets. Set up a "previous group" length so that a  
           subsequent quantifier will work. */  
   
           *code = OP_ONCE;  
           PUT(code, 1, 2 + 2*LINK_SIZE);  
           code += 1 + LINK_SIZE;  
5995    
5996            *code = OP_RECURSE;            *code = OP_RECURSE;
5997            PUT(code, 1, (int)(called - cd->start_code));            PUT(code, 1, (int)(called - cd->start_code));
5998            code += 1 + LINK_SIZE;            code += 1 + LINK_SIZE;
   
           *code = OP_KET;  
           PUT(code, 1, 2 + 2*LINK_SIZE);  
           code += 1 + LINK_SIZE;  
   
           length_prevgroup = 3 + 3*LINK_SIZE;  
5999            }            }
6000    
6001          /* Can't determine a first byte now */          /* Can't determine a first byte now */
# Line 5813  for (;; ptr++) Line 6110  for (;; ptr++)
6110        skipbytes = 2;        skipbytes = 2;
6111        }        }
6112    
6113      /* Process nested bracketed regex. Assertions may not be repeated, but      /* Process nested bracketed regex. Assertions used not to be repeatable,
6114      other kinds can be. All their opcodes are >= OP_ONCE. We copy code into a      but this was changed for Perl compatibility, so all kinds can now be
6115      non-register variable (tempcode) in order to be able to pass its address      repeated. We copy code into a non-register variable (tempcode) in order to
6116      because some compilers complain otherwise. */      be able to pass its address because some compilers complain otherwise. */
6117    
6118      previous = (bravalue >= OP_ONCE)? code : NULL;      previous = code;                      /* For handling repetition */
6119      *code = bravalue;      *code = bravalue;
6120      tempcode = code;      tempcode = code;
6121      tempreqvary = cd->req_varyopt;     /* Save value before bracket */      tempreqvary = cd->req_varyopt;        /* Save value before bracket */
6122      length_prevgroup = 0;              /* Initialize for pre-compile phase */      tempbracount = cd->bracount;          /* Save value before bracket */
6123        length_prevgroup = 0;                 /* Initialize for pre-compile phase */
6124    
6125      if (!compile_regex(      if (!compile_regex(
6126           newoptions,                   /* The complete new option state */           newoptions,                      /* The complete new option state */
6127           &tempcode,                    /* Where to put code (updated) */           &tempcode,                       /* Where to put code (updated) */
6128           &ptr,                         /* Input pointer (updated) */           &ptr,                            /* Input pointer (updated) */
6129           errorcodeptr,                 /* Where to put an error message */           errorcodeptr,                    /* Where to put an error message */
6130           (bravalue == OP_ASSERTBACK ||           (bravalue == OP_ASSERTBACK ||
6131            bravalue == OP_ASSERTBACK_NOT), /* TRUE if back assert */            bravalue == OP_ASSERTBACK_NOT), /* TRUE if back assert */
6132           reset_bracount,               /* True if (?| group */           reset_bracount,                  /* True if (?| group */
6133           skipbytes,                    /* Skip over bracket number */           skipbytes,                       /* Skip over bracket number */
6134           &subfirstbyte,                /* For possible first char */           cond_depth +
6135           &subreqbyte,                  /* For possible last char */             ((bravalue == OP_COND)?1:0),   /* Depth of condition subpatterns */
6136           bcptr,                        /* Current branch chain */           &subfirstbyte,                   /* For possible first char */
6137           cd,                           /* Tables block */           &subreqbyte,                     /* For possible last char */
6138           (lengthptr == NULL)? NULL :   /* Actual compile phase */           bcptr,                           /* Current branch chain */
6139             &length_prevgroup           /* Pre-compile phase */           cd,                              /* Tables block */
6140             (lengthptr == NULL)? NULL :      /* Actual compile phase */
6141               &length_prevgroup              /* Pre-compile phase */
6142           ))           ))
6143        goto FAILED;        goto FAILED;
6144    
6145        /* If this was an atomic group and there are no capturing groups within it,
6146        generate OP_ONCE_NC instead of OP_ONCE. */
6147    
6148        if (bravalue == OP_ONCE && cd->bracount <= tempbracount)
6149          *code = OP_ONCE_NC;
6150    
6151      if (bravalue >= OP_ASSERT && bravalue <= OP_ASSERTBACK_NOT)      if (bravalue >= OP_ASSERT && bravalue <= OP_ASSERTBACK_NOT)
6152        cd->assert_depth -= 1;        cd->assert_depth -= 1;
6153    
6154      /* At the end of compiling, code is still pointing to the start of the      /* At the end of compiling, code is still pointing to the start of the
6155      group, while tempcode has been updated to point past the end of the group      group, while tempcode has been updated to point past the end of the group.
6156      and any option resetting that may follow it. The pattern pointer (ptr)      The pattern pointer (ptr) is on the bracket.
     is on the bracket. */  
6157    
6158      /* If this is a conditional bracket, check that there are no more than      If this is a conditional bracket, check that there are no more than
6159      two branches in the group, or just one if it's a DEFINE group. We do this      two branches in the group, or just one if it's a DEFINE group. We do this
6160      in the real compile phase, not in the pre-pass, where the whole group may      in the real compile phase, not in the pre-pass, where the whole group may
6161      not be available. */      not be available. */
# Line 6083  for (;; ptr++) Line 6388  for (;; ptr++)
6388          }          }
6389    
6390        /* \k<name> or \k'name' is a back reference by name (Perl syntax).        /* \k<name> or \k'name' is a back reference by name (Perl syntax).
6391        We also support \k{name} (.NET syntax) */        We also support \k{name} (.NET syntax).  */
6392    
6393        if (-c == ESC_k && (ptr[1] == CHAR_LESS_THAN_SIGN ||        if (-c == ESC_k)
           ptr[1] == CHAR_APOSTROPHE || ptr[1] == CHAR_LEFT_CURLY_BRACKET))  
6394          {          {
6395            if ((ptr[1] != CHAR_LESS_THAN_SIGN &&
6396              ptr[1] != CHAR_APOSTROPHE && ptr[1] != CHAR_LEFT_CURLY_BRACKET))
6397              {
6398              *errorcodeptr = ERR69;
6399              break;
6400              }
6401          is_recurse = FALSE;          is_recurse = FALSE;
6402          terminator = (*(++ptr) == CHAR_LESS_THAN_SIGN)?          terminator = (*(++ptr) == CHAR_LESS_THAN_SIGN)?
6403            CHAR_GREATER_THAN_SIGN : (*ptr == CHAR_APOSTROPHE)?            CHAR_GREATER_THAN_SIGN : (*ptr == CHAR_APOSTROPHE)?
# Line 6244  for (;; ptr++) Line 6554  for (;; ptr++)
6554        else firstbyte = reqbyte = REQ_NONE;        else firstbyte = reqbyte = REQ_NONE;
6555        }        }
6556    
6557      /* firstbyte was previously set; we can set reqbyte only the length is      /* firstbyte was previously set; we can set reqbyte only if the length is
6558      1 or the matching is caseful. */      1 or the matching is caseful. */
6559    
6560      else      else
# Line 6291  Arguments: Line 6601  Arguments:
6601    lookbehind     TRUE if this is a lookbehind assertion    lookbehind     TRUE if this is a lookbehind assertion
6602    reset_bracount TRUE to reset the count for each branch    reset_bracount TRUE to reset the count for each branch
6603    skipbytes      skip this many bytes at start (for brackets and OP_COND)    skipbytes      skip this many bytes at start (for brackets and OP_COND)
6604      cond_depth     depth of nesting for conditional subpatterns
6605    firstbyteptr   place to put the first required character, or a negative number    firstbyteptr   place to put the first required character, or a negative number
6606    reqbyteptr     place to put the last required character, or a negative number    reqbyteptr     place to put the last required character, or a negative number
6607    bcptr          pointer to the chain of currently open branches    bcptr          pointer to the chain of currently open branches
# Line 6304  Returns:         TRUE on success Line 6615  Returns:         TRUE on success
6615  static BOOL  static BOOL
6616  compile_regex(int options, uschar **codeptr, const uschar **ptrptr,  compile_regex(int options, uschar **codeptr, const uschar **ptrptr,
6617    int *errorcodeptr, BOOL lookbehind, BOOL reset_bracount, int skipbytes,    int *errorcodeptr, BOOL lookbehind, BOOL reset_bracount, int skipbytes,
6618    int *firstbyteptr, int *reqbyteptr, branch_chain *bcptr, compile_data *cd,    int cond_depth, int *firstbyteptr, int *reqbyteptr, branch_chain *bcptr,
6619    int *lengthptr)    compile_data *cd, int *lengthptr)
6620  {  {
6621  const uschar *ptr = *ptrptr;  const uschar *ptr = *ptrptr;
6622  uschar *code = *codeptr;  uschar *code = *codeptr;
# Line 6342  pre-compile phase to find out whether an Line 6653  pre-compile phase to find out whether an
6653    
6654  /* If this is a capturing subpattern, add to the chain of open capturing items  /* If this is a capturing subpattern, add to the chain of open capturing items
6655  so that we can detect them if (*ACCEPT) is encountered. This is also used to  so that we can detect them if (*ACCEPT) is encountered. This is also used to
6656  detect groups that contain recursive back references to themselves. Note that  detect groups that contain recursive back references to themselves. Note that
6657  only OP_CBRA need be tested here; changing this opcode to one of its variants,  only OP_CBRA need be tested here; changing this opcode to one of its variants,
6658  e.g. OP_SCBRAPOS, happens later, after the group has been compiled. */  e.g. OP_SCBRAPOS, happens later, after the group has been compiled. */
6659    
6660  if (*code == OP_CBRA)  if (*code == OP_CBRA)
# Line 6384  for (;;) Line 6695  for (;;)
6695    into the length. */    into the length. */
6696    
6697    if (!compile_branch(&options, &code, &ptr, errorcodeptr, &branchfirstbyte,    if (!compile_branch(&options, &code, &ptr, errorcodeptr, &branchfirstbyte,
6698          &branchreqbyte, &bc, cd, (lengthptr == NULL)? NULL : &length))          &branchreqbyte, &bc, cond_depth, cd,
6699            (lengthptr == NULL)? NULL : &length))
6700      {      {
6701      *ptrptr = ptr;      *ptrptr = ptr;
6702      return FALSE;      return FALSE;
# Line 6459  for (;;) Line 6771  for (;;)
6771          }          }
6772        else if (fixed_length < 0)        else if (fixed_length < 0)
6773          {          {
6774          *errorcodeptr = (fixed_length == -2)? ERR36 : ERR25;          *errorcodeptr = (fixed_length == -2)? ERR36 :
6775                            (fixed_length == -4)? ERR70: ERR25;
6776          *ptrptr = ptr;          *ptrptr = ptr;
6777          return FALSE;          return FALSE;
6778          }          }
# Line 6634  do { Line 6947  do {
6947    
6948     /* Other brackets */     /* Other brackets */
6949    
6950     else if (op == OP_ASSERT || op == OP_ONCE || op == OP_COND)     else if (op == OP_ASSERT || op == OP_ONCE || op == OP_ONCE_NC ||
6951                op == OP_COND)
6952       {       {
6953       if (!is_anchored(scode, bracket_map, backref_map)) return FALSE;       if (!is_anchored(scode, bracket_map, backref_map)) return FALSE;
6954       }       }
# Line 6738  do { Line 7052  do {
7052    
7053     /* Other brackets */     /* Other brackets */
7054    
7055     else if (op == OP_ASSERT || op == OP_ONCE)     else if (op == OP_ASSERT || op == OP_ONCE || op == OP_ONCE_NC)
7056       {       {
7057       if (!is_startline(scode, bracket_map, backref_map)) return FALSE;       if (!is_startline(scode, bracket_map, backref_map)) return FALSE;
7058       }       }
# Line 6808  do { Line 7122  do {
7122       case OP_SCBRAPOS:       case OP_SCBRAPOS:
7123       case OP_ASSERT:       case OP_ASSERT:
7124       case OP_ONCE:       case OP_ONCE:
7125         case OP_ONCE_NC:
7126       case OP_COND:       case OP_COND:
7127       if ((d = find_firstassertedchar(scode, op == OP_ASSERT)) < 0)       if ((d = find_firstassertedchar(scode, op == OP_ASSERT)) < 0)
7128         return -1;         return -1;
# Line 6817  do { Line 7132  do {
7132       case OP_EXACT:       case OP_EXACT:
7133       scode += 2;       scode += 2;
7134       /* Fall through */       /* Fall through */
7135    
7136       case OP_CHAR:       case OP_CHAR:
7137       case OP_PLUS:       case OP_PLUS:
7138       case OP_MINPLUS:       case OP_MINPLUS:
# Line 6830  do { Line 7145  do {
7145       case OP_EXACTI:       case OP_EXACTI:
7146       scode += 2;       scode += 2;
7147       /* Fall through */       /* Fall through */
7148    
7149       case OP_CHARI:       case OP_CHARI:
7150       case OP_PLUSI:       case OP_PLUSI:
7151       case OP_MINPLUSI:       case OP_MINPLUSI:
# Line 6990  utf8 = (options & PCRE_UTF8) != 0; Line 7305  utf8 = (options & PCRE_UTF8) != 0;
7305    
7306  /* Can't support UTF8 unless PCRE has been compiled to include the code. The  /* Can't support UTF8 unless PCRE has been compiled to include the code. The
7307  return of an error code from _pcre_valid_utf8() is a new feature, introduced in  return of an error code from _pcre_valid_utf8() is a new feature, introduced in
7308  release 8.13. It is passed back from pcre_[dfa_]exec(), but at the moment is  release 8.13. It is passed back from pcre_[dfa_]exec(), but at the moment is
7309  not used here. */  not used here. */
7310    
7311  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF8
# Line 7020  if ((options & PCRE_UCP) != 0) Line 7335  if ((options & PCRE_UCP) != 0)
7335    
7336  /* Check validity of \R options. */  /* Check validity of \R options. */
7337    
7338  switch (options & (PCRE_BSR_ANYCRLF|PCRE_BSR_UNICODE))  if ((options & (PCRE_BSR_ANYCRLF|PCRE_BSR_UNICODE)) ==
7339         (PCRE_BSR_ANYCRLF|PCRE_BSR_UNICODE))
7340    {    {
7341    case 0:    errorcode = ERR56;
7342    case PCRE_BSR_ANYCRLF:    goto PCRE_EARLY_ERROR_RETURN;
   case PCRE_BSR_UNICODE:  
   break;  
   default: errorcode = ERR56; goto PCRE_EARLY_ERROR_RETURN;  
7343    }    }
7344    
7345  /* Handle different types of newline. The three bits give seven cases. The  /* Handle different types of newline. The three bits give seven cases. The
# Line 7111  outside can help speed up starting point Line 7424  outside can help speed up starting point
7424  ptr += skipatstart;  ptr += skipatstart;
7425  code = cworkspace;  code = cworkspace;
7426  *code = OP_BRA;  *code = OP_BRA;
7427  (void)compile_regex(cd->external_options, &code, &ptr, &errorcode, FALSE,  (void)compile_regex(cd->external_options, &code, &ptr, &errorcode, FALSE,
7428    FALSE, 0, &firstbyte, &reqbyte, NULL, cd, &length);    FALSE, 0, 0, &firstbyte, &reqbyte, NULL, cd, &length);
7429  if (errorcode != 0) goto PCRE_EARLY_ERROR_RETURN;  if (errorcode != 0) goto PCRE_EARLY_ERROR_RETURN;
7430    
7431  DPRINTF(("end pre-compile: length=%d workspace=%d\n", length,  DPRINTF(("end pre-compile: length=%d workspace=%d\n", length,
# Line 7185  of the function here. */ Line 7498  of the function here. */
7498  ptr = (const uschar *)pattern + skipatstart;  ptr = (const uschar *)pattern + skipatstart;
7499  code = (uschar *)codestart;  code = (uschar *)codestart;
7500  *code = OP_BRA;  *code = OP_BRA;
7501  (void)compile_regex(re->options, &code, &ptr, &errorcode, FALSE, FALSE, 0,  (void)compile_regex(re->options, &code, &ptr, &errorcode, FALSE, FALSE, 0, 0,
7502    &firstbyte, &reqbyte, NULL, cd, NULL);    &firstbyte, &reqbyte, NULL, cd, NULL);
7503  re->top_bracket = cd->bracount;  re->top_bracket = cd->bracount;
7504  re->top_backref = cd->top_backref;  re->top_backref = cd->top_backref;
7505  re->flags = cd->external_flags;  re->flags = cd->external_flags;
7506    
7507  if (cd->had_accept) reqbyte = -1;   /* Must disable after (*ACCEPT) */  if (cd->had_accept) reqbyte = REQ_NONE;   /* Must disable after (*ACCEPT) */
7508    
7509  /* 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. */
7510    
# Line 7258  if (cd->check_lookbehind) Line 7571  if (cd->check_lookbehind)
7571        DPRINTF(("fixed length = %d\n", fixed_length));        DPRINTF(("fixed length = %d\n", fixed_length));
7572        if (fixed_length < 0)        if (fixed_length < 0)
7573          {          {
7574          errorcode = (fixed_length == -2)? ERR36 : ERR25;          errorcode = (fixed_length == -2)? ERR36 :
7575                        (fixed_length == -4)? ERR70 : ERR25;
7576          break;          break;
7577          }          }
7578        PUT(cc, 1, fixed_length);        PUT(cc, 1, fixed_length);

Legend:
Removed from v.613  
changed lines
  Added in v.750

  ViewVC Help
Powered by ViewVC 1.1.5