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

Diff of /code/trunk/pcre_exec.c

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

revision 606 by ph10, Mon Jun 6 17:46:22 2011 UTC revision 645 by ph10, Sun Jul 31 17:02:18 2011 UTC
# Line 57  possible. There are also some static sup Line 57  possible. There are also some static sup
57  #undef min  #undef min
58  #undef max  #undef max
59    
60  /* Values for setting in md->match_function_type to indicate two special types  /* Values for setting in md->match_function_type to indicate two special types
61  of call to match(). We do it this way to save on using another stack variable,  of call to match(). We do it this way to save on using another stack variable,
62  as stack usage is to be discouraged. */  as stack usage is to be discouraged. */
63    
64  #define MATCH_CONDASSERT     1  /* Called to check a condition assertion */  #define MATCH_CONDASSERT     1  /* Called to check a condition assertion */
# Line 76  negative to avoid the external error cod Line 76  negative to avoid the external error cod
76  #define MATCH_ACCEPT       (-999)  #define MATCH_ACCEPT       (-999)
77  #define MATCH_COMMIT       (-998)  #define MATCH_COMMIT       (-998)
78  #define MATCH_KETRPOS      (-997)  #define MATCH_KETRPOS      (-997)
79  #define MATCH_PRUNE        (-996)  #define MATCH_ONCE         (-996)
80  #define MATCH_SKIP         (-995)  #define MATCH_PRUNE        (-995)
81  #define MATCH_SKIP_ARG     (-994)  #define MATCH_SKIP         (-994)
82  #define MATCH_THEN         (-993)  #define MATCH_SKIP_ARG     (-993)
83    #define MATCH_THEN         (-992)
84    
85  /* This is a convenience macro for code that occurs many times. */  /* This is a convenience macro for code that occurs many times. */
86    
# Line 137  while (length-- > 0) Line 138  while (length-- > 0)
138    
139  /* Normally, if a back reference hasn't been set, the length that is passed is  /* Normally, if a back reference hasn't been set, the length that is passed is
140  negative, so the match always fails. However, in JavaScript compatibility mode,  negative, so the match always fails. However, in JavaScript compatibility mode,
141  the length passed is zero. Note that in caseless UTF-8 mode, the number of  the length passed is zero. Note that in caseless UTF-8 mode, the number of
142  subject bytes matched may be different to the number of reference bytes.  subject bytes matched may be different to the number of reference bytes.
143    
144  Arguments:  Arguments:
# Line 184  if (caseless) Line 185  if (caseless)
185  #ifdef SUPPORT_UCP  #ifdef SUPPORT_UCP
186    if (md->utf8)    if (md->utf8)
187      {      {
188      /* Match characters up to the end of the reference. NOTE: the number of      /* Match characters up to the end of the reference. NOTE: the number of
189      bytes matched may differ, because there are some characters whose upper and      bytes matched may differ, because there are some characters whose upper and
190      lower case versions code as different numbers of bytes. For example, U+023A      lower case versions code as different numbers of bytes. For example, U+023A
191      (2 bytes in UTF-8) is the upper case version of U+2C65 (3 bytes in UTF-8);      (2 bytes in UTF-8) is the upper case version of U+2C65 (3 bytes in UTF-8);
192      a sequence of 3 of the former uses 6 bytes, as does a sequence of two of      a sequence of 3 of the former uses 6 bytes, as does a sequence of two of
193      the latter. It is important, therefore, to check the length along the      the latter. It is important, therefore, to check the length along the
194      reference, not along the subject (earlier code did this wrong). */      reference, not along the subject (earlier code did this wrong). */
195    
196      USPTR endptr = p + length;      USPTR endptr = p + length;
197      while (p < endptr)      while (p < endptr)
198        {        {
# Line 209  if (caseless) Line 210  if (caseless)
210    /* The same code works when not in UTF-8 mode and in UTF-8 mode when there    /* The same code works when not in UTF-8 mode and in UTF-8 mode when there
211    is no UCP support. */    is no UCP support. */
212      {      {
213      if (eptr + length > md->end_subject) return -1;      if (eptr + length > md->end_subject) return -1;
214      while (length-- > 0)      while (length-- > 0)
215        { if (md->lcc[*p++] != md->lcc[*eptr++]) return -1; }        { if (md->lcc[*p++] != md->lcc[*eptr++]) return -1; }
216      }      }
217    }    }
218    
219  /* In the caseful case, we can just compare the bytes, whether or not we  /* In the caseful case, we can just compare the bytes, whether or not we
220  are in UTF-8 mode. */  are in UTF-8 mode. */
221    
222  else  else
223    {    {
224    if (eptr + length > md->end_subject) return -1;    if (eptr + length > md->end_subject) return -1;
225    while (length-- > 0) if (*p++ != *eptr++) return -1;    while (length-- > 0) if (*p++ != *eptr++) return -1;
226    }    }
227    
228  return eptr - eptr_start;  return eptr - eptr_start;
# Line 276  enum { RM1=1, RM2,  RM3,  RM4,  RM5,  RM Line 277  enum { RM1=1, RM2,  RM3,  RM4,  RM5,  RM
277         RM31,  RM32, RM33, RM34, RM35, RM36, RM37, RM38, RM39, RM40,         RM31,  RM32, RM33, RM34, RM35, RM36, RM37, RM38, RM39, RM40,
278         RM41,  RM42, RM43, RM44, RM45, RM46, RM47, RM48, RM49, RM50,         RM41,  RM42, RM43, RM44, RM45, RM46, RM47, RM48, RM49, RM50,
279         RM51,  RM52, RM53, RM54, RM55, RM56, RM57, RM58, RM59, RM60,         RM51,  RM52, RM53, RM54, RM55, RM56, RM57, RM58, RM59, RM60,
280         RM61,  RM62, RM63, RM64 };         RM61,  RM62, RM63 };
281    
282  /* These versions of the macros use the stack, as normal. There are debugging  /* These versions of the macros use the stack, as normal. There are debugging
283  versions and production versions. Note that the "rw" argument of RMATCH isn't  versions and production versions. Note that the "rw" argument of RMATCH isn't
# Line 383  typedef struct heapframe { Line 384  typedef struct heapframe {
384    int Xprop_type;    int Xprop_type;
385    int Xprop_value;    int Xprop_value;
386    int Xprop_fail_result;    int Xprop_fail_result;
   int Xprop_category;  
   int Xprop_chartype;  
   int Xprop_script;  
387    int Xoclength;    int Xoclength;
388    uschar Xocchars[8];    uschar Xocchars[8];
389  #endif  #endif
# Line 477  Returns:       MATCH_MATCH if matched Line 475  Returns:       MATCH_MATCH if matched
475    
476  static int  static int
477  match(REGISTER USPTR eptr, REGISTER const uschar *ecode, USPTR mstart,  match(REGISTER USPTR eptr, REGISTER const uschar *ecode, USPTR mstart,
478    const uschar *markptr, int offset_top, match_data *md, eptrblock *eptrb,    const uschar *markptr, int offset_top, match_data *md, eptrblock *eptrb,
479    unsigned int rdepth)    unsigned int rdepth)
480  {  {
481  /* These variables do not need to be preserved over recursion in this function,  /* These variables do not need to be preserved over recursion in this function,
# Line 550  HEAP_RECURSE: Line 548  HEAP_RECURSE:
548  #define prop_type          frame->Xprop_type  #define prop_type          frame->Xprop_type
549  #define prop_value         frame->Xprop_value  #define prop_value         frame->Xprop_value
550  #define prop_fail_result   frame->Xprop_fail_result  #define prop_fail_result   frame->Xprop_fail_result
 #define prop_category      frame->Xprop_category  
 #define prop_chartype      frame->Xprop_chartype  
 #define prop_script        frame->Xprop_script  
551  #define oclength           frame->Xoclength  #define oclength           frame->Xoclength
552  #define occhars            frame->Xocchars  #define occhars            frame->Xocchars
553  #endif  #endif
# Line 590  declarations can be cut out in a block. Line 585  declarations can be cut out in a block.
585  below are for variables that do not have to be preserved over a recursive call  below are for variables that do not have to be preserved over a recursive call
586  to RMATCH(). */  to RMATCH(). */
587    
588  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF8
589  const uschar *charptr;  const uschar *charptr;
590  #endif  #endif
591  const uschar *callpat;  const uschar *callpat;
592  const uschar *data;  const uschar *data;
593  const uschar *next;  const uschar *next;
594  USPTR         pp;  USPTR         pp;
595  const uschar *prev;  const uschar *prev;
596  USPTR         saved_eptr;  USPTR         saved_eptr;
597    
598  recursion_info new_recursive;  recursion_info new_recursive;
599    
600  BOOL cur_is_word;  BOOL cur_is_word;
601  BOOL condition;  BOOL condition;
602  BOOL prev_is_word;  BOOL prev_is_word;
603    
# Line 610  BOOL prev_is_word; Line 605  BOOL prev_is_word;
605  int prop_type;  int prop_type;
606  int prop_value;  int prop_value;
607  int prop_fail_result;  int prop_fail_result;
 int prop_category;  
 int prop_chartype;  
 int prop_script;  
608  int oclength;  int oclength;
609  uschar occhars[8];  uschar occhars[8];
610  #endif  #endif
# Line 632  int stacksave[REC_STACK_SAVE_MAX]; Line 624  int stacksave[REC_STACK_SAVE_MAX];
624  eptrblock newptrb;  eptrblock newptrb;
625  #endif     /* NO_RECURSE */  #endif     /* NO_RECURSE */
626    
627  /* To save space on the stack and in the heap frame, I have doubled up on some  /* To save space on the stack and in the heap frame, I have doubled up on some
628  of the local variables that are used only in localised parts of the code, but  of the local variables that are used only in localised parts of the code, but
629  still need to be preserved over recursive calls of match(). These macros define  still need to be preserved over recursive calls of match(). These macros define
630  the alternative names that are used. */  the alternative names that are used. */
631    
632  #define allow_zero    cur_is_word  #define allow_zero    cur_is_word
# Line 680  if (md->match_call_count++ >= md->match_ Line 672  if (md->match_call_count++ >= md->match_
672  if (rdepth >= md->match_limit_recursion) RRETURN(PCRE_ERROR_RECURSIONLIMIT);  if (rdepth >= md->match_limit_recursion) RRETURN(PCRE_ERROR_RECURSIONLIMIT);
673    
674  /* At the start of a group with an unlimited repeat that may match an empty  /* At the start of a group with an unlimited repeat that may match an empty
675  string, the variable md->match_function_type is set to MATCH_CBEGROUP. It is  string, the variable md->match_function_type is set to MATCH_CBEGROUP. It is
676  done this way to save having to use another function argument, which would take  done this way to save having to use another function argument, which would take
677  up space on the stack. See also MATCH_CONDASSERT below.  up space on the stack. See also MATCH_CONDASSERT below.
678    
679  When MATCH_CBEGROUP is set, add the current subject pointer to the chain of  When MATCH_CBEGROUP is set, add the current subject pointer to the chain of
# Line 705  for (;;) Line 697  for (;;)
697    {    {
698    minimize = possessive = FALSE;    minimize = possessive = FALSE;
699    op = *ecode;    op = *ecode;
700    
701    switch(op)    switch(op)
702      {      {
703      case OP_MARK:      case OP_MARK:
# Line 808  for (;;) Line 800  for (;;)
800      subject position in the working slot at the top of the vector. We mustn't      subject position in the working slot at the top of the vector. We mustn't
801      change the current values of the data slot, because they may be set from a      change the current values of the data slot, because they may be set from a
802      previous iteration of this group, and be referred to by a reference inside      previous iteration of this group, and be referred to by a reference inside
803      the group. If we fail to match, we need to restore this value and also the      the group. A failure to match might occur after the group has succeeded,
804      values of the final offsets, in case they were set by a previous iteration      if something later on doesn't match. For this reason, we need to restore
805      of the same bracket.      the working value and also the values of the final offsets, in case they
806        were set by a previous iteration of the same bracket.
807    
808      If there isn't enough space in the offset vector, treat this as if it were      If there isn't enough space in the offset vector, treat this as if it were
809      a non-capturing bracket. Don't worry about setting the flag for the error      a non-capturing bracket. Don't worry about setting the flag for the error
# Line 820  for (;;) Line 813  for (;;)
813      case OP_SCBRA:      case OP_SCBRA:
814      number = GET2(ecode, 1+LINK_SIZE);      number = GET2(ecode, 1+LINK_SIZE);
815      offset = number << 1;      offset = number << 1;
816    
817  #ifdef PCRE_DEBUG  #ifdef PCRE_DEBUG
818      printf("start bracket %d\n", number);      printf("start bracket %d\n", number);
819      printf("subject=");      printf("subject=");
# Line 841  for (;;) Line 834  for (;;)
834    
835        for (;;)        for (;;)
836          {          {
837          if (op >= OP_SBRA) md->match_function_type = MATCH_CBEGROUP;          if (op >= OP_SBRA) md->match_function_type = MATCH_CBEGROUP;
838          RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md,          RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md,
839            eptrb, RM1);            eptrb, RM1);
840            if (rrc == MATCH_ONCE) break;  /* Backing up through an atomic group */
841          if (rrc != MATCH_NOMATCH &&          if (rrc != MATCH_NOMATCH &&
842              (rrc != MATCH_THEN || md->start_match_ptr != ecode))              (rrc != MATCH_THEN || md->start_match_ptr != ecode))
843            RRETURN(rrc);            RRETURN(rrc);
844          md->capture_last = save_capture_last;          md->capture_last = save_capture_last;
845          ecode += GET(ecode, 1);          ecode += GET(ecode, 1);
846          if (*ecode != OP_ALT) break;          if (*ecode != OP_ALT) break;
847          }          }
848    
849        DPRINTF(("bracket %d failed\n", number));        DPRINTF(("bracket %d failed\n", number));
   
850        md->offset_vector[offset] = save_offset1;        md->offset_vector[offset] = save_offset1;
851        md->offset_vector[offset+1] = save_offset2;        md->offset_vector[offset+1] = save_offset2;
852        md->offset_vector[md->offset_end - number] = save_offset3;        md->offset_vector[md->offset_end - number] = save_offset3;
853    
854        if (rrc != MATCH_THEN) md->mark = markptr;        /* At this point, rrc will be one of MATCH_ONCE, MATCH_NOMATCH, or
855        RRETURN(MATCH_NOMATCH);        MATCH_THEN. */
856    
857          if (rrc != MATCH_THEN && md->mark == NULL) md->mark = markptr;
858          RRETURN(((rrc == MATCH_ONCE)? MATCH_ONCE:MATCH_NOMATCH));
859        }        }
860    
861      /* FALL THROUGH ... Insufficient room for saving captured contents. Treat      /* FALL THROUGH ... Insufficient room for saving captured contents. Treat
# Line 873  for (;;) Line 869  for (;;)
869      /* VVVVVVVVVVVVVVVVVVVVVVVVV */      /* VVVVVVVVVVVVVVVVVVVVVVVVV */
870      /* VVVVVVVVVVVVVVVVVVVVVVVVV */      /* VVVVVVVVVVVVVVVVVVVVVVVVV */
871    
872      /* Non-capturing bracket, except for possessive with unlimited repeat. Loop      /* Non-capturing or atomic group, except for possessive with unlimited
873      for all the alternatives. When we get to the final alternative within the      repeat. Loop for all the alternatives. When we get to the final alternative
874      brackets, we would return the result of a recursive call to match()      within the brackets, we used to return the result of a recursive call to
875      whatever happened. We can reduce stack usage by turning this into a tail      match() whatever happened so it was possible to reduce stack usage by
876      recursion, except in the case of a possibly empty group.*/      turning this into a tail recursion, except in the case of a possibly empty
877        group. However, now that there is the possiblity of (*THEN) occurring in
878        the final alternative, this optimization is no longer possible.
879    
880        MATCH_ONCE is returned when the end of an atomic group is successfully
881        reached, but subsequent matching fails. It passes back up the tree (causing
882        captured values to be reset) until the original atomic group level is
883        reached. This is tested by comparing md->once_target with the start of the
884        group. At this point, the return is converted into MATCH_NOMATCH so that
885        previous backup points can be taken. */
886    
887        case OP_ONCE:
888      case OP_BRA:      case OP_BRA:
889      case OP_SBRA:      case OP_SBRA:
890      DPRINTF(("start non-capturing bracket\n"));      DPRINTF(("start non-capturing bracket\n"));
891    
892      for (;;)      for (;;)
893        {        {
894        if (ecode[GET(ecode, 1)] != OP_ALT)   /* Final alternative */        if (op >= OP_SBRA || op == OP_ONCE) md->match_function_type = MATCH_CBEGROUP;
895          {        RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, eptrb,
         if (op >= OP_SBRA)   /* Possibly empty group */  
           {  
           md->match_function_type = MATCH_CBEGROUP;  
           RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, eptrb,  
             RM48);  
           if (rrc == MATCH_NOMATCH) md->mark = markptr;  
           RRETURN(rrc);  
           }  
         /* Not a possibly empty group; use tail recursion */  
         ecode += _pcre_OP_lengths[*ecode];  
         DPRINTF(("bracket 0 tail recursion\n"));  
         goto TAIL_RECURSE;  
         }  
   
       /* For non-final alternatives, continue the loop for a NOMATCH result;  
       otherwise return. */  
   
       if (op >= OP_SBRA) md->match_function_type = MATCH_CBEGROUP;  
       RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, eptrb,  
896          RM2);          RM2);
897        if (rrc != MATCH_NOMATCH &&        if (rrc != MATCH_NOMATCH &&
898            (rrc != MATCH_THEN || md->start_match_ptr != ecode))            (rrc != MATCH_THEN || md->start_match_ptr != ecode))
899            {
900            if (rrc == MATCH_ONCE)
901              {
902              const uschar *scode = ecode;
903              if (*scode != OP_ONCE)           /* If not at start, find it */
904                {
905                while (*scode == OP_ALT) scode += GET(scode, 1);
906                scode -= GET(scode, 1);
907                }
908              if (md->once_target == scode) rrc = MATCH_NOMATCH;
909              }
910          RRETURN(rrc);          RRETURN(rrc);
911            }
912        ecode += GET(ecode, 1);        ecode += GET(ecode, 1);
913          if (*ecode != OP_ALT) break;
914        }        }
915      /* Control never reaches here. */      if (rrc != MATCH_THEN && md->mark == NULL) md->mark = markptr;
916        RRETURN(MATCH_NOMATCH);
917    
918      /* Handle possessive capturing brackets with an unlimited repeat. We come      /* Handle possessive capturing brackets with an unlimited repeat. We come
919      here from BRAZERO with allow_zero set TRUE. The offset_vector values are      here from BRAZERO with allow_zero set TRUE. The offset_vector values are
920      handled similarly to the normal case above. However, the matching is      handled similarly to the normal case above. However, the matching is
921      different. The end of these brackets will always be OP_KETRPOS, which      different. The end of these brackets will always be OP_KETRPOS, which
922      returns MATCH_KETRPOS without going further in the pattern. By this means      returns MATCH_KETRPOS without going further in the pattern. By this means
923      we can handle the group by iteration rather than recursion, thereby      we can handle the group by iteration rather than recursion, thereby
924      reducing the amount of stack needed. */      reducing the amount of stack needed. */
925    
926      case OP_CBRAPOS:      case OP_CBRAPOS:
927      case OP_SCBRAPOS:      case OP_SCBRAPOS:
928      allow_zero = FALSE;      allow_zero = FALSE;
929    
930      POSSESSIVE_CAPTURE:      POSSESSIVE_CAPTURE:
931      number = GET2(ecode, 1+LINK_SIZE);      number = GET2(ecode, 1+LINK_SIZE);
932      offset = number << 1;      offset = number << 1;
# Line 939  for (;;) Line 941  for (;;)
941      if (offset < md->offset_max)      if (offset < md->offset_max)
942        {        {
943        matched_once = FALSE;        matched_once = FALSE;
944        code_offset = ecode - md->start_code;        code_offset = ecode - md->start_code;
945    
946        save_offset1 = md->offset_vector[offset];        save_offset1 = md->offset_vector[offset];
947        save_offset2 = md->offset_vector[offset+1];        save_offset2 = md->offset_vector[offset+1];
# Line 947  for (;;) Line 949  for (;;)
949        save_capture_last = md->capture_last;        save_capture_last = md->capture_last;
950    
951        DPRINTF(("saving %d %d %d\n", save_offset1, save_offset2, save_offset3));        DPRINTF(("saving %d %d %d\n", save_offset1, save_offset2, save_offset3));
952    
953        /* Each time round the loop, save the current subject position for use        /* Each time round the loop, save the current subject position for use
954        when the group matches. For MATCH_MATCH, the group has matched, so we        when the group matches. For MATCH_MATCH, the group has matched, so we
955        restart it with a new subject starting position, remembering that we had        restart it with a new subject starting position, remembering that we had
956        at least one match. For MATCH_NOMATCH, carry on with the alternatives, as        at least one match. For MATCH_NOMATCH, carry on with the alternatives, as
957        usual. If we haven't matched any alternatives in any iteration, check to        usual. If we haven't matched any alternatives in any iteration, check to
958        see if a previous iteration matched. If so, the group has matched;        see if a previous iteration matched. If so, the group has matched;
959        continue from afterwards. Otherwise it has failed; restore the previous        continue from afterwards. Otherwise it has failed; restore the previous
960        capture values before returning NOMATCH. */        capture values before returning NOMATCH. */
961    
962        for (;;)        for (;;)
963          {          {
964          md->offset_vector[md->offset_end - number] =          md->offset_vector[md->offset_end - number] =
965            (int)(eptr - md->start_subject);            (int)(eptr - md->start_subject);
966          if (op >= OP_SBRA) md->match_function_type = MATCH_CBEGROUP;          if (op >= OP_SBRA) md->match_function_type = MATCH_CBEGROUP;
967          RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md,          RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md,
968            eptrb, RM63);            eptrb, RM63);
969          if (rrc == MATCH_KETRPOS)          if (rrc == MATCH_KETRPOS)
970            {            {
971            offset_top = md->end_offset_top;            offset_top = md->end_offset_top;
972            eptr = md->end_match_ptr;            eptr = md->end_match_ptr;
973            ecode = md->start_code + code_offset;            ecode = md->start_code + code_offset;
974            save_capture_last = md->capture_last;            save_capture_last = md->capture_last;
975            matched_once = TRUE;            matched_once = TRUE;
976            continue;            continue;
977            }            }
978          if (rrc != MATCH_NOMATCH &&          if (rrc != MATCH_NOMATCH &&
979              (rrc != MATCH_THEN || md->start_match_ptr != ecode))              (rrc != MATCH_THEN || md->start_match_ptr != ecode))
980            RRETURN(rrc);            RRETURN(rrc);
981          md->capture_last = save_capture_last;          md->capture_last = save_capture_last;
982          ecode += GET(ecode, 1);          ecode += GET(ecode, 1);
983          if (*ecode != OP_ALT) break;          if (*ecode != OP_ALT) break;
984          }          }
985    
986        if (!matched_once)        if (!matched_once)
987          {          {
988          md->offset_vector[offset] = save_offset1;          md->offset_vector[offset] = save_offset1;
989          md->offset_vector[offset+1] = save_offset2;          md->offset_vector[offset+1] = save_offset2;
990          md->offset_vector[md->offset_end - number] = save_offset3;          md->offset_vector[md->offset_end - number] = save_offset3;
991          }          }
992    
993        if (rrc != MATCH_THEN) md->mark = markptr;        if (rrc != MATCH_THEN && md->mark == NULL) md->mark = markptr;
994        if (allow_zero || matched_once)        if (allow_zero || matched_once)
995          {          {
996          ecode += 1 + LINK_SIZE;          ecode += 1 + LINK_SIZE;
997          break;          break;
998          }          }
999    
1000        RRETURN(MATCH_NOMATCH);        RRETURN(MATCH_NOMATCH);
1001        }        }
1002    
1003      /* FALL THROUGH ... Insufficient room for saving captured contents. Treat      /* FALL THROUGH ... Insufficient room for saving captured contents. Treat
1004      as a non-capturing bracket. */      as a non-capturing bracket. */
1005    
# Line 1009  for (;;) Line 1011  for (;;)
1011      /* VVVVVVVVVVVVVVVVVVVVVVVVV */      /* VVVVVVVVVVVVVVVVVVVVVVVVV */
1012      /* VVVVVVVVVVVVVVVVVVVVVVVVV */      /* VVVVVVVVVVVVVVVVVVVVVVVVV */
1013    
1014      /* Non-capturing possessive bracket with unlimited repeat. We come here      /* Non-capturing possessive bracket with unlimited repeat. We come here
1015      from BRAZERO with allow_zero = TRUE. The code is similar to the above,      from BRAZERO with allow_zero = TRUE. The code is similar to the above,
1016      without the capturing complication. It is written out separately for speed      without the capturing complication. It is written out separately for speed
1017      and cleanliness. */      and cleanliness. */
1018    
1019      case OP_BRAPOS:      case OP_BRAPOS:
1020      case OP_SBRAPOS:      case OP_SBRAPOS:
1021      allow_zero = FALSE;      allow_zero = FALSE;
1022    
1023      POSSESSIVE_NON_CAPTURE:      POSSESSIVE_NON_CAPTURE:
1024      matched_once = FALSE;      matched_once = FALSE;
1025      code_offset = ecode - md->start_code;      code_offset = ecode - md->start_code;
1026    
1027      for (;;)      for (;;)
1028        {        {
1029        if (op >= OP_SBRA) md->match_function_type = MATCH_CBEGROUP;        if (op >= OP_SBRA) md->match_function_type = MATCH_CBEGROUP;
1030        RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md,        RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md,
1031          eptrb, RM64);          eptrb, RM48);
1032        if (rrc == MATCH_KETRPOS)        if (rrc == MATCH_KETRPOS)
1033          {          {
1034            offset_top = md->end_offset_top;
1035          eptr = md->end_match_ptr;          eptr = md->end_match_ptr;
1036          ecode = md->start_code + code_offset;          ecode = md->start_code + code_offset;
1037          matched_once = TRUE;          matched_once = TRUE;
1038          continue;          continue;
1039          }          }
1040        if (rrc != MATCH_NOMATCH &&        if (rrc != MATCH_NOMATCH &&
1041            (rrc != MATCH_THEN || md->start_match_ptr != ecode))            (rrc != MATCH_THEN || md->start_match_ptr != ecode))
1042          RRETURN(rrc);          RRETURN(rrc);
1043        ecode += GET(ecode, 1);        ecode += GET(ecode, 1);
1044        if (*ecode != OP_ALT) break;        if (*ecode != OP_ALT) break;
1045        }        }
1046    
1047      if (matched_once || allow_zero)      if (matched_once || allow_zero)
1048        {        {
1049        ecode += 1 + LINK_SIZE;        ecode += 1 + LINK_SIZE;
1050        break;        break;
1051        }        }
1052      RRETURN(MATCH_NOMATCH);      RRETURN(MATCH_NOMATCH);
1053    
1054      /* Control never reaches here. */      /* Control never reaches here. */
# Line 1053  for (;;) Line 1056  for (;;)
1056      /* Conditional group: compilation checked that there are no more than      /* Conditional group: compilation checked that there are no more than
1057      two branches. If the condition is false, skipping the first branch takes us      two branches. If the condition is false, skipping the first branch takes us
1058      past the end if there is only one branch, but that's OK because that is      past the end if there is only one branch, but that's OK because that is
1059      exactly what going to the ket would do. As there is only one branch to be      exactly what going to the ket would do. */
     obeyed, we can use tail recursion to avoid using another stack frame. */  
1060    
1061      case OP_COND:      case OP_COND:
1062      case OP_SCOND:      case OP_SCOND:
# Line 1068  for (;;) Line 1070  for (;;)
1070        if (pcre_callout != NULL)        if (pcre_callout != NULL)
1071          {          {
1072          pcre_callout_block cb;          pcre_callout_block cb;
1073          cb.version          = 1;   /* Version 1 of the callout block */          cb.version          = 2;   /* Version 1 of the callout block */
1074          cb.callout_number   = ecode[LINK_SIZE+2];          cb.callout_number   = ecode[LINK_SIZE+2];
1075          cb.offset_vector    = md->offset_vector;          cb.offset_vector    = md->offset_vector;
1076          cb.subject          = (PCRE_SPTR)md->start_subject;          cb.subject          = (PCRE_SPTR)md->start_subject;
# Line 1080  for (;;) Line 1082  for (;;)
1082          cb.capture_top      = offset_top/2;          cb.capture_top      = offset_top/2;
1083          cb.capture_last     = md->capture_last;          cb.capture_last     = md->capture_last;
1084          cb.callout_data     = md->callout_data;          cb.callout_data     = md->callout_data;
1085            cb.mark             = markptr;
1086          if ((rrc = (*pcre_callout)(&cb)) > 0) MRRETURN(MATCH_NOMATCH);          if ((rrc = (*pcre_callout)(&cb)) > 0) MRRETURN(MATCH_NOMATCH);
1087          if (rrc < 0) RRETURN(rrc);          if (rrc < 0) RRETURN(rrc);
1088          }          }
# Line 1238  for (;;) Line 1241  for (;;)
1241    
1242      else      else
1243        {        {
1244        md->match_function_type = MATCH_CONDASSERT;        md->match_function_type = MATCH_CONDASSERT;
1245        RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, NULL, RM3);        RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, NULL, RM3);
1246        if (rrc == MATCH_MATCH)        if (rrc == MATCH_MATCH)
1247          {          {
1248            if (md->end_offset_top > offset_top)
1249              offset_top = md->end_offset_top;  /* Captures may have happened */
1250          condition = TRUE;          condition = TRUE;
1251          ecode += 1 + LINK_SIZE + GET(ecode, LINK_SIZE + 2);          ecode += 1 + LINK_SIZE + GET(ecode, LINK_SIZE + 2);
1252          while (*ecode == OP_ALT) ecode += GET(ecode, 1);          while (*ecode == OP_ALT) ecode += GET(ecode, 1);
# Line 1259  for (;;) Line 1264  for (;;)
1264        }        }
1265    
1266      /* We are now at the branch that is to be obeyed. As there is only one,      /* We are now at the branch that is to be obeyed. As there is only one,
1267      we can use tail recursion to avoid using another stack frame, except when      we used to use tail recursion to avoid using another stack frame, except
1268      we have an unlimited repeat of a possibly empty group. If the second      when there was unlimited repeat of a possibly empty group. However, that
1269      alternative doesn't exist, we can just plough on. */      strategy no longer works because of the possibilty of (*THEN) being
1270        encountered in the branch. A recursive call to match() is always required,
1271        unless the second alternative doesn't exist, in which case we can just
1272        plough on. */
1273    
1274      if (condition || *ecode == OP_ALT)      if (condition || *ecode == OP_ALT)
1275        {        {
1276        ecode += 1 + LINK_SIZE;        if (op == OP_SCOND) md->match_function_type = MATCH_CBEGROUP;
1277        if (op == OP_SCOND)        /* Possibly empty group */        RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, eptrb, RM49);
1278          {        if (rrc == MATCH_THEN && md->start_match_ptr == ecode)
1279          md->match_function_type = MATCH_CBEGROUP;          rrc = MATCH_NOMATCH;
1280          RMATCH(eptr, ecode, offset_top, md, eptrb, RM49);        RRETURN(rrc);
         RRETURN(rrc);  
         }  
       else goto TAIL_RECURSE;  
1281        }        }
1282      else                         /* Condition false & no alternative */      else                         /* Condition false & no alternative */
1283        {        {
# Line 1305  for (;;) Line 1310  for (;;)
1310      break;      break;
1311    
1312    
1313      /* End of the pattern, either real or forced. If we are in a top-level      /* End of the pattern, either real or forced. */
     recursion, we should restore the offsets appropriately and continue from  
     after the call. */  
1314    
     case OP_ACCEPT:  
1315      case OP_END:      case OP_END:
1316      if (md->recursive != NULL && md->recursive->group_num == 0)      case OP_ACCEPT:
1317        {      case OP_ASSERT_ACCEPT:
       recursion_info *rec = md->recursive;  
       DPRINTF(("End of pattern in a (?0) recursion\n"));  
       md->recursive = rec->prevrec;  
       memmove(md->offset_vector, rec->offset_save,  
         rec->saved_max * sizeof(int));  
       offset_top = rec->save_offset_top;  
       ecode = rec->after_call;  
       break;  
       }  
1318    
1319      /* Otherwise, if we have matched an empty string, fail if PCRE_NOTEMPTY is      /* If we have matched an empty string, fail if not in an assertion and not
1320      set, or if PCRE_NOTEMPTY_ATSTART is set and we have matched at the start of      in a recursion if either PCRE_NOTEMPTY is set, or if PCRE_NOTEMPTY_ATSTART
1321      the subject. In both cases, backtracking will then try other alternatives,      is set and we have matched at the start of the subject. In both cases,
1322      if any. */      backtracking will then try other alternatives, if any. */
1323    
1324      if (eptr == mstart &&      if (eptr == mstart && op != OP_ASSERT_ACCEPT &&
1325          (md->notempty ||           md->recursive == NULL &&
1326            (md->notempty_atstart &&           (md->notempty ||
1327              mstart == md->start_subject + md->start_offset)))             (md->notempty_atstart &&
1328                 mstart == md->start_subject + md->start_offset)))
1329        MRRETURN(MATCH_NOMATCH);        MRRETURN(MATCH_NOMATCH);
1330    
1331      /* Otherwise, we have a match. */      /* Otherwise, we have a match. */
# Line 1350  for (;;) Line 1344  for (;;)
1344      matching won't pass the KET for an assertion. If any one branch matches,      matching won't pass the KET for an assertion. If any one branch matches,
1345      the assertion is true. Lookbehind assertions have an OP_REVERSE item at the      the assertion is true. Lookbehind assertions have an OP_REVERSE item at the
1346      start of each branch to move the current point backwards, so the code at      start of each branch to move the current point backwards, so the code at
1347      this level is identical to the lookahead case. When the assertion is part      this level is identical to the lookahead case. When the assertion is part
1348      of a condition, we want to return immediately afterwards. The caller of      of a condition, we want to return immediately afterwards. The caller of
1349      this incarnation of the match() function will have set MATCH_CONDASSERT in      this incarnation of the match() function will have set MATCH_CONDASSERT in
1350      md->match_function type, and one of these opcodes will be the first opcode      md->match_function type, and one of these opcodes will be the first opcode
1351      that is processed. We use a local variable that is preserved over calls to      that is processed. We use a local variable that is preserved over calls to
1352      match() to remember this case. */      match() to remember this case. */
1353    
1354      case OP_ASSERT:      case OP_ASSERT:
# Line 1364  for (;;) Line 1358  for (;;)
1358        condassert = TRUE;        condassert = TRUE;
1359        md->match_function_type = 0;        md->match_function_type = 0;
1360        }        }
1361      else condassert = FALSE;      else condassert = FALSE;
1362    
1363      do      do
1364        {        {
1365        RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, NULL, RM4);        RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, NULL, RM4);
1366        if (rrc == MATCH_MATCH || rrc == MATCH_ACCEPT)        if (rrc == MATCH_MATCH || rrc == MATCH_ACCEPT)
1367          {          {
1368          mstart = md->start_match_ptr;   /* In case \K reset it */          mstart = md->start_match_ptr;   /* In case \K reset it */
1369            markptr = md->mark;
1370          break;          break;
1371          }          }
1372        if (rrc != MATCH_NOMATCH &&        if (rrc != MATCH_NOMATCH &&
# Line 1380  for (;;) Line 1375  for (;;)
1375        ecode += GET(ecode, 1);        ecode += GET(ecode, 1);
1376        }        }
1377      while (*ecode == OP_ALT);      while (*ecode == OP_ALT);
1378    
1379      if (*ecode == OP_KET) MRRETURN(MATCH_NOMATCH);      if (*ecode == OP_KET) MRRETURN(MATCH_NOMATCH);
1380    
1381      /* If checking an assertion for a condition, return MATCH_MATCH. */      /* If checking an assertion for a condition, return MATCH_MATCH. */
# Line 1406  for (;;) Line 1401  for (;;)
1401        condassert = TRUE;        condassert = TRUE;
1402        md->match_function_type = 0;        md->match_function_type = 0;
1403        }        }
1404      else condassert = FALSE;      else condassert = FALSE;
1405    
1406      do      do
1407        {        {
# Line 1425  for (;;) Line 1420  for (;;)
1420      while (*ecode == OP_ALT);      while (*ecode == OP_ALT);
1421    
1422      if (condassert) RRETURN(MATCH_MATCH);  /* Condition assertion */      if (condassert) RRETURN(MATCH_MATCH);  /* Condition assertion */
1423    
1424      ecode += 1 + LINK_SIZE;      ecode += 1 + LINK_SIZE;
1425      continue;      continue;
1426    
# Line 1470  for (;;) Line 1465  for (;;)
1465      if (pcre_callout != NULL)      if (pcre_callout != NULL)
1466        {        {
1467        pcre_callout_block cb;        pcre_callout_block cb;
1468        cb.version          = 1;   /* Version 1 of the callout block */        cb.version          = 2;   /* Version 1 of the callout block */
1469        cb.callout_number   = ecode[1];        cb.callout_number   = ecode[1];
1470        cb.offset_vector    = md->offset_vector;        cb.offset_vector    = md->offset_vector;
1471        cb.subject          = (PCRE_SPTR)md->start_subject;        cb.subject          = (PCRE_SPTR)md->start_subject;
# Line 1482  for (;;) Line 1477  for (;;)
1477        cb.capture_top      = offset_top/2;        cb.capture_top      = offset_top/2;
1478        cb.capture_last     = md->capture_last;        cb.capture_last     = md->capture_last;
1479        cb.callout_data     = md->callout_data;        cb.callout_data     = md->callout_data;
1480          cb.mark             = markptr;
1481        if ((rrc = (*pcre_callout)(&cb)) > 0) MRRETURN(MATCH_NOMATCH);        if ((rrc = (*pcre_callout)(&cb)) > 0) MRRETURN(MATCH_NOMATCH);
1482        if (rrc < 0) RRETURN(rrc);        if (rrc < 0) RRETURN(rrc);
1483        }        }
# Line 1492  for (;;) Line 1488  for (;;)
1488      offset data is the offset to the starting bracket from the start of the      offset data is the offset to the starting bracket from the start of the
1489      whole pattern. (This is so that it works from duplicated subpatterns.)      whole pattern. (This is so that it works from duplicated subpatterns.)
1490    
1491      If there are any capturing brackets started but not finished, we have to      The state of the capturing groups is preserved over recursion, and
1492      save their starting points and reinstate them after the recursion. However,      re-instated afterwards. We don't know how many are started and not yet
1493      we don't know how many such there are (offset_top records the completed      finished (offset_top records the completed total) so we just have to save
1494      total) so we just have to save all the potential data. There may be up to      all the potential data. There may be up to 65535 such values, which is too
1495      65535 such values, which is too large to put on the stack, but using malloc      large to put on the stack, but using malloc for small numbers seems
1496      for small numbers seems expensive. As a compromise, the stack is used when      expensive. As a compromise, the stack is used when there are no more than
1497      there are no more than REC_STACK_SAVE_MAX values to store; otherwise malloc      REC_STACK_SAVE_MAX values to store; otherwise malloc is used.
     is used. A problem is what to do if the malloc fails ... there is no way of  
     returning to the top level with an error. Save the top REC_STACK_SAVE_MAX  
     values on the stack, and accept that the rest may be wrong.  
1498    
1499      There are also other values that have to be saved. We use a chained      There are also other values that have to be saved. We use a chained
1500      sequence of blocks that actually live on the stack. Thanks to Robin Houston      sequence of blocks that actually live on the stack. Thanks to Robin Houston
1501      for the original version of this logic. */      for the original version of this logic. It has, however, been hacked around
1502        a lot, so he is not to blame for the current way it works. */
1503    
1504      case OP_RECURSE:      case OP_RECURSE:
1505        {        {
1506          recursion_info *ri;
1507          int recno;
1508    
1509        callpat = md->start_code + GET(ecode, 1);        callpat = md->start_code + GET(ecode, 1);
1510        new_recursive.group_num = (callpat == md->start_code)? 0 :        recno = (callpat == md->start_code)? 0 :
1511          GET2(callpat, 1 + LINK_SIZE);          GET2(callpat, 1 + LINK_SIZE);
1512    
1513          /* Check for repeating a recursion without advancing the subject pointer.
1514          This should catch convoluted mutual recursions. (Some simple cases are
1515          caught at compile time.) */
1516    
1517          for (ri = md->recursive; ri != NULL; ri = ri->prevrec)
1518            if (recno == ri->group_num && eptr == ri->subject_position)
1519              RRETURN(PCRE_ERROR_RECURSELOOP);
1520    
1521        /* Add to "recursing stack" */        /* Add to "recursing stack" */
1522    
1523          new_recursive.group_num = recno;
1524          new_recursive.subject_position = eptr;
1525        new_recursive.prevrec = md->recursive;        new_recursive.prevrec = md->recursive;
1526        md->recursive = &new_recursive;        md->recursive = &new_recursive;
1527    
1528        /* Find where to continue from afterwards */        /* Where to continue from afterwards */
1529    
1530        ecode += 1 + LINK_SIZE;        ecode += 1 + LINK_SIZE;
       new_recursive.after_call = ecode;  
1531    
1532        /* Now save the offset data. */        /* Now save the offset data */
1533    
1534        new_recursive.saved_max = md->offset_end;        new_recursive.saved_max = md->offset_end;
1535        if (new_recursive.saved_max <= REC_STACK_SAVE_MAX)        if (new_recursive.saved_max <= REC_STACK_SAVE_MAX)
# Line 1534  for (;;) Line 1540  for (;;)
1540            (int *)(pcre_malloc)(new_recursive.saved_max * sizeof(int));            (int *)(pcre_malloc)(new_recursive.saved_max * sizeof(int));
1541          if (new_recursive.offset_save == NULL) RRETURN(PCRE_ERROR_NOMEMORY);          if (new_recursive.offset_save == NULL) RRETURN(PCRE_ERROR_NOMEMORY);
1542          }          }
   
1543        memcpy(new_recursive.offset_save, md->offset_vector,        memcpy(new_recursive.offset_save, md->offset_vector,
1544              new_recursive.saved_max * sizeof(int));              new_recursive.saved_max * sizeof(int));
       new_recursive.save_offset_top = offset_top;  
1545    
1546        /* OK, now we can do the recursion. For each top-level alternative we        /* OK, now we can do the recursion. After processing each alternative,
1547        restore the offset and recursion data. */        restore the offset data. If there were nested recursions, md->recursive
1548          might be changed, so reset it before looping. */
1549    
1550        DPRINTF(("Recursing into group %d\n", new_recursive.group_num));        DPRINTF(("Recursing into group %d\n", new_recursive.group_num));
1551        cbegroup = (*callpat >= OP_SBRA);        cbegroup = (*callpat >= OP_SBRA);
# Line 1549  for (;;) Line 1554  for (;;)
1554          if (cbegroup) md->match_function_type = MATCH_CBEGROUP;          if (cbegroup) md->match_function_type = MATCH_CBEGROUP;
1555          RMATCH(eptr, callpat + _pcre_OP_lengths[*callpat], offset_top,          RMATCH(eptr, callpat + _pcre_OP_lengths[*callpat], offset_top,
1556            md, eptrb, RM6);            md, eptrb, RM6);
1557            memcpy(md->offset_vector, new_recursive.offset_save,
1558                new_recursive.saved_max * sizeof(int));
1559          if (rrc == MATCH_MATCH || rrc == MATCH_ACCEPT)          if (rrc == MATCH_MATCH || rrc == MATCH_ACCEPT)
1560            {            {
1561            DPRINTF(("Recursion matched\n"));            DPRINTF(("Recursion matched\n"));
1562            md->recursive = new_recursive.prevrec;            md->recursive = new_recursive.prevrec;
1563            if (new_recursive.offset_save != stacksave)            if (new_recursive.offset_save != stacksave)
1564              (pcre_free)(new_recursive.offset_save);              (pcre_free)(new_recursive.offset_save);
1565            MRRETURN(MATCH_MATCH);  
1566              /* Set where we got to in the subject, and reset the start in case
1567              it was changed by \K. This *is* propagated back out of a recursion,
1568              for Perl compatibility. */
1569    
1570              eptr = md->end_match_ptr;
1571              mstart = md->start_match_ptr;
1572              goto RECURSION_MATCHED;        /* Exit loop; end processing */
1573            }            }
1574          else if (rrc != MATCH_NOMATCH &&          else if (rrc != MATCH_NOMATCH &&
1575                  (rrc != MATCH_THEN || md->start_match_ptr != ecode))                  (rrc != MATCH_THEN || md->start_match_ptr != ecode))
# Line 1567  for (;;) Line 1581  for (;;)
1581            }            }
1582    
1583          md->recursive = &new_recursive;          md->recursive = &new_recursive;
         memcpy(md->offset_vector, new_recursive.offset_save,  
             new_recursive.saved_max * sizeof(int));  
1584          callpat += GET(callpat, 1);          callpat += GET(callpat, 1);
1585          }          }
1586        while (*callpat == OP_ALT);        while (*callpat == OP_ALT);
# Line 1579  for (;;) Line 1591  for (;;)
1591          (pcre_free)(new_recursive.offset_save);          (pcre_free)(new_recursive.offset_save);
1592        MRRETURN(MATCH_NOMATCH);        MRRETURN(MATCH_NOMATCH);
1593        }        }
     /* Control never reaches here */  
   
     /* "Once" brackets are like assertion brackets except that after a match,  
     the point in the subject string is not moved back. Thus there can never be  
     a move back into the brackets. Friedl calls these "atomic" subpatterns.  
     Check the alternative branches in turn - the matching won't pass the KET  
     for this kind of subpattern. If any one branch matches, we carry on as at  
     the end of a normal bracket, leaving the subject pointer, but resetting  
     the start-of-match value in case it was changed by \K. */  
   
     case OP_ONCE:  
     prev = ecode;  
     saved_eptr = eptr;  
   
     do  
       {  
       RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, eptrb, RM7);  
       if (rrc == MATCH_MATCH)  /* Note: _not_ MATCH_ACCEPT */  
         {  
         mstart = md->start_match_ptr;  
         break;  
         }  
       if (rrc != MATCH_NOMATCH &&  
           (rrc != MATCH_THEN || md->start_match_ptr != ecode))  
         RRETURN(rrc);  
       ecode += GET(ecode,1);  
       }  
     while (*ecode == OP_ALT);  
   
     /* If hit the end of the group (which could be repeated), fail */  
   
     if (*ecode != OP_ONCE && *ecode != OP_ALT) RRETURN(MATCH_NOMATCH);  
   
     /* Continue as from after the assertion, updating the offsets high water  
     mark, since extracts may have been taken. */  
   
     do ecode += GET(ecode, 1); while (*ecode == OP_ALT);  
   
     offset_top = md->end_offset_top;  
     eptr = md->end_match_ptr;  
   
     /* For a non-repeating ket, just continue at this level. This also  
     happens for a repeating ket if no characters were matched in the group.  
     This is the forcible breaking of infinite loops as implemented in Perl  
     5.005. If there is an options reset, it will get obeyed in the normal  
     course of events. */  
   
     if (*ecode == OP_KET || eptr == saved_eptr)  
       {  
       ecode += 1+LINK_SIZE;  
       break;  
       }  
1594    
1595      /* The repeating kets try the rest of the pattern or restart from the      RECURSION_MATCHED:
1596      preceding bracket, in the appropriate order. The second "call" of match()      break;
     uses tail recursion, to avoid using another stack frame. */  
   
     if (*ecode == OP_KETRMIN)  
       {  
       RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, eptrb, RM8);  
       if (rrc != MATCH_NOMATCH) RRETURN(rrc);  
       ecode = prev;  
       goto TAIL_RECURSE;  
       }  
     else  /* OP_KETRMAX */  
       {  
       md->match_function_type = MATCH_CBEGROUP;  
       RMATCH(eptr, prev, offset_top, md, eptrb, RM9);  
       if (rrc != MATCH_NOMATCH) RRETURN(rrc);  
       ecode += 1 + LINK_SIZE;  
       goto TAIL_RECURSE;  
       }  
     /* Control never gets here */  
1597    
1598      /* An alternation is the end of a branch; scan along to find the end of the      /* An alternation is the end of a branch; scan along to find the end of the
1599      bracketed group and go to there. */      bracketed group and go to there. */
# Line 1665  for (;;) Line 1607  for (;;)
1607      at all - i.e. it could be ()* or ()? or even (){0} in the pattern. Brackets      at all - i.e. it could be ()* or ()? or even (){0} in the pattern. Brackets
1608      with fixed upper repeat limits are compiled as a number of copies, with the      with fixed upper repeat limits are compiled as a number of copies, with the
1609      optional ones preceded by BRAZERO or BRAMINZERO. */      optional ones preceded by BRAZERO or BRAMINZERO. */
1610    
1611      case OP_BRAZERO:      case OP_BRAZERO:
1612      next = ecode + 1;      next = ecode + 1;
1613      RMATCH(eptr, next, offset_top, md, eptrb, RM10);      RMATCH(eptr, next, offset_top, md, eptrb, RM10);
# Line 1673  for (;;) Line 1615  for (;;)
1615      do next += GET(next, 1); while (*next == OP_ALT);      do next += GET(next, 1); while (*next == OP_ALT);
1616      ecode = next + 1 + LINK_SIZE;      ecode = next + 1 + LINK_SIZE;
1617      break;      break;
1618    
1619      case OP_BRAMINZERO:      case OP_BRAMINZERO:
1620      next = ecode + 1;      next = ecode + 1;
1621      do next += GET(next, 1); while (*next == OP_ALT);      do next += GET(next, 1); while (*next == OP_ALT);
# Line 1687  for (;;) Line 1629  for (;;)
1629      do next += GET(next,1); while (*next == OP_ALT);      do next += GET(next,1); while (*next == OP_ALT);
1630      ecode = next + 1 + LINK_SIZE;      ecode = next + 1 + LINK_SIZE;
1631      break;      break;
1632    
1633      /* BRAPOSZERO occurs before a possessive bracket group. Don't do anything      /* BRAPOSZERO occurs before a possessive bracket group. Don't do anything
1634      here; just jump to the group, with allow_zero set TRUE. */      here; just jump to the group, with allow_zero set TRUE. */
1635    
1636      case OP_BRAPOSZERO:      case OP_BRAPOSZERO:
1637      op = *(++ecode);      op = *(++ecode);
1638      allow_zero = TRUE;      allow_zero = TRUE;
1639      if (op == OP_CBRAPOS || op == OP_SCBRAPOS) goto POSSESSIVE_CAPTURE;      if (op == OP_CBRAPOS || op == OP_SCBRAPOS) goto POSSESSIVE_CAPTURE;
1640        goto POSSESSIVE_NON_CAPTURE;        goto POSSESSIVE_NON_CAPTURE;
# Line 1702  for (;;) Line 1644  for (;;)
1644      case OP_KET:      case OP_KET:
1645      case OP_KETRMIN:      case OP_KETRMIN:
1646      case OP_KETRMAX:      case OP_KETRMAX:
1647      case OP_KETRPOS:      case OP_KETRPOS:
1648      prev = ecode - GET(ecode, 1);      prev = ecode - GET(ecode, 1);
1649    
1650      /* If this was a group that remembered the subject start, in order to break      /* If this was a group that remembered the subject start, in order to break
1651      infinite repeats of empty string matches, retrieve the subject start from      infinite repeats of empty string matches, retrieve the subject start from
1652      the chain. Otherwise, set it NULL. */      the chain. Otherwise, set it NULL. */
1653    
1654      if (*prev >= OP_SBRA)      if (*prev >= OP_SBRA || *prev == OP_ONCE)
1655        {        {
1656        saved_eptr = eptrb->epb_saved_eptr;   /* Value at start of group */        saved_eptr = eptrb->epb_saved_eptr;   /* Value at start of group */
1657        eptrb = eptrb->epb_prev;              /* Backup to previous group */        eptrb = eptrb->epb_prev;              /* Backup to previous group */
1658        }        }
1659      else saved_eptr = NULL;      else saved_eptr = NULL;
1660    
1661      /* If we are at the end of an assertion group or an atomic group, stop      /* If we are at the end of an assertion group, stop matching and return
1662      matching and return MATCH_MATCH, but record the current high water mark for      MATCH_MATCH, but record the current high water mark for use by positive
1663      use by positive assertions. We also need to record the match start in case      assertions. We also need to record the match start in case it was changed
1664      it was changed by \K. */      by \K. */
1665    
1666      if (*prev == OP_ASSERT || *prev == OP_ASSERT_NOT ||      if (*prev == OP_ASSERT || *prev == OP_ASSERT_NOT ||
1667          *prev == OP_ASSERTBACK || *prev == OP_ASSERTBACK_NOT ||          *prev == OP_ASSERTBACK || *prev == OP_ASSERTBACK_NOT)
         *prev == OP_ONCE)  
1668        {        {
1669        md->end_match_ptr = eptr;      /* For ONCE */        md->end_match_ptr = eptr;      /* For ONCE */
1670        md->end_offset_top = offset_top;        md->end_offset_top = offset_top;
1671        md->start_match_ptr = mstart;        md->start_match_ptr = mstart;
1672        MRRETURN(MATCH_MATCH);        MRRETURN(MATCH_MATCH);         /* Sets md->mark */
1673        }        }
1674    
1675      /* For capturing groups we have to check the group number back at the start      /* For capturing groups we have to check the group number back at the start
1676      and if necessary complete handling an extraction by setting the offsets and      and if necessary complete handling an extraction by setting the offsets and
1677      bumping the high water mark. Note that whole-pattern recursion is coded as      bumping the high water mark. Whole-pattern recursion is coded as a recurse
1678      a recurse into group 0, so it won't be picked up here. Instead, we catch it      into group 0, so it won't be picked up here. Instead, we catch it when the
1679      when the OP_END is reached. Other recursion is handled here. */      OP_END is reached. Other recursion is handled here. We just have to record
1680        the current subject position and start match pointer and give a MATCH
1681        return. */
1682    
1683      if (*prev == OP_CBRA || *prev == OP_SCBRA ||      if (*prev == OP_CBRA || *prev == OP_SCBRA ||
1684          *prev == OP_CBRAPOS || *prev == OP_SCBRAPOS)          *prev == OP_CBRAPOS || *prev == OP_SCBRAPOS)
# Line 1748  for (;;) Line 1691  for (;;)
1691        printf("\n");        printf("\n");
1692  #endif  #endif
1693    
1694          /* Handle a recursively called group. */
1695    
1696          if (md->recursive != NULL && md->recursive->group_num == number)
1697            {
1698            md->end_match_ptr = eptr;
1699            md->start_match_ptr = mstart;
1700            RRETURN(MATCH_MATCH);
1701            }
1702    
1703          /* Deal with capturing */
1704    
1705        md->capture_last = number;        md->capture_last = number;
1706        if (offset >= md->offset_max) md->offset_overflow = TRUE; else        if (offset >= md->offset_max) md->offset_overflow = TRUE; else
1707          {          {
1708            /* If offset is greater than offset_top, it means that we are
1709            "skipping" a capturing group, and that group's offsets must be marked
1710            unset. In earlier versions of PCRE, all the offsets were unset at the
1711            start of matching, but this doesn't work because atomic groups and
1712            assertions can cause a value to be set that should later be unset.
1713            Example: matching /(?>(a))b|(a)c/ against "ac". This sets group 1 as
1714            part of the atomic group, but this is not on the final matching path,
1715            so must be unset when 2 is set. (If there is no group 2, there is no
1716            problem, because offset_top will then be 2, indicating no capture.) */
1717    
1718            if (offset > offset_top)
1719              {
1720              register int *iptr = md->offset_vector + offset_top;
1721              register int *iend = md->offset_vector + offset;
1722              while (iptr < iend) *iptr++ = -1;
1723              }
1724    
1725            /* Now make the extraction */
1726    
1727          md->offset_vector[offset] =          md->offset_vector[offset] =
1728            md->offset_vector[md->offset_end - number];            md->offset_vector[md->offset_end - number];
1729          md->offset_vector[offset+1] = (int)(eptr - md->start_subject);          md->offset_vector[offset+1] = (int)(eptr - md->start_subject);
1730          if (offset_top <= offset) offset_top = offset + 2;          if (offset_top <= offset) offset_top = offset + 2;
1731          }          }
   
       /* Handle a recursively called group. Restore the offsets  
       appropriately and continue from after the call. */  
   
       if (md->recursive != NULL && md->recursive->group_num == number)  
         {  
         recursion_info *rec = md->recursive;  
         DPRINTF(("Recursion (%d) succeeded - continuing\n", number));  
         md->recursive = rec->prevrec;  
         memcpy(md->offset_vector, rec->offset_save,  
           rec->saved_max * sizeof(int));  
         offset_top = rec->save_offset_top;  
         ecode = rec->after_call;  
         break;  
         }  
1732        }        }
1733    
1734      /* For a non-repeating ket, just continue at this level. This also      /* For an ordinary non-repeating ket, just continue at this level. This
1735      happens for a repeating ket if no characters were matched in the group.      also happens for a repeating ket if no characters were matched in the
1736      This is the forcible breaking of infinite loops as implemented in Perl      group. This is the forcible breaking of infinite loops as implemented in
1737      5.005. If there is an options reset, it will get obeyed in the normal      Perl 5.005. For a non-repeating atomic group, establish a backup point by
1738      course of events. */      processing the rest of the pattern at a lower level. If this results in a
1739        NOMATCH return, pass MATCH_ONCE back to the original OP_ONCE level, thereby
1740        bypassing intermediate backup points, but resetting any captures that
1741        happened along the way. */
1742    
1743      if (*ecode == OP_KET || eptr == saved_eptr)      if (*ecode == OP_KET || eptr == saved_eptr)
1744        {        {
1745        ecode += 1 + LINK_SIZE;        if (*prev == OP_ONCE)
1746            {
1747            RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, eptrb, RM12);
1748            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
1749            md->once_target = prev;  /* Level at which to change to MATCH_NOMATCH */
1750            RRETURN(MATCH_ONCE);
1751            }
1752          ecode += 1 + LINK_SIZE;    /* Carry on at this level */
1753        break;        break;
1754        }        }
1755    
1756      /* OP_KETRPOS is a possessive repeating ket. Remember the current position,      /* OP_KETRPOS is a possessive repeating ket. Remember the current position,
1757      and return the MATCH_KETRPOS. This makes it possible to do the repeats one      and return the MATCH_KETRPOS. This makes it possible to do the repeats one
1758      at a time from the outer level, thus saving stack. */      at a time from the outer level, thus saving stack. */
1759    
1760      if (*ecode == OP_KETRPOS)      if (*ecode == OP_KETRPOS)
1761        {        {
1762        md->end_match_ptr = eptr;        md->end_match_ptr = eptr;
1763        md->end_offset_top = offset_top;        md->end_offset_top = offset_top;
1764        RRETURN(MATCH_KETRPOS);        RRETURN(MATCH_KETRPOS);
1765        }        }
1766    
1767      /* The normal repeating kets try the rest of the pattern or restart from      /* The normal repeating kets try the rest of the pattern or restart from
1768      the preceding bracket, in the appropriate order. In the second case, we can      the preceding bracket, in the appropriate order. In the second case, we can
1769      use tail recursion to avoid using another stack frame, unless we have an      use tail recursion to avoid using another stack frame, unless we have an
1770      unlimited repeat of a group that can match an empty string. */      an atomic group or an unlimited repeat of a group that can match an empty
1771        string. */
1772    
1773      if (*ecode == OP_KETRMIN)      if (*ecode == OP_KETRMIN)
1774        {        {
1775        RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, eptrb, RM12);        RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, eptrb, RM7);
1776        if (rrc != MATCH_NOMATCH) RRETURN(rrc);        if (rrc != MATCH_NOMATCH) RRETURN(rrc);
1777          if (*prev == OP_ONCE)
1778            {
1779            RMATCH(eptr, prev, offset_top, md, eptrb, RM8);
1780            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
1781            md->once_target = prev;  /* Level at which to change to MATCH_NOMATCH */
1782            RRETURN(MATCH_ONCE);
1783            }
1784        if (*prev >= OP_SBRA)    /* Could match an empty string */        if (*prev >= OP_SBRA)    /* Could match an empty string */
1785          {          {
1786          md->match_function_type = MATCH_CBEGROUP;          md->match_function_type = MATCH_CBEGROUP;
1787          RMATCH(eptr, prev, offset_top, md, eptrb, RM50);          RMATCH(eptr, prev, offset_top, md, eptrb, RM50);
1788          RRETURN(rrc);          RRETURN(rrc);
1789          }          }
# Line 1816  for (;;) Line 1792  for (;;)
1792        }        }
1793      else  /* OP_KETRMAX */      else  /* OP_KETRMAX */
1794        {        {
1795        if (*prev >= OP_SBRA) md->match_function_type = MATCH_CBEGROUP;        if (*prev >= OP_SBRA) md->match_function_type = MATCH_CBEGROUP;
1796        RMATCH(eptr, prev, offset_top, md, eptrb, RM13);        RMATCH(eptr, prev, offset_top, md, eptrb, RM13);
1797          if (rrc == MATCH_ONCE && md->once_target == prev) rrc = MATCH_NOMATCH;
1798        if (rrc != MATCH_NOMATCH) RRETURN(rrc);        if (rrc != MATCH_NOMATCH) RRETURN(rrc);
1799          if (*prev == OP_ONCE)
1800            {
1801            RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, eptrb, RM9);
1802            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
1803            md->once_target = prev;
1804            RRETURN(MATCH_ONCE);
1805            }
1806        ecode += 1 + LINK_SIZE;        ecode += 1 + LINK_SIZE;
1807        goto TAIL_RECURSE;        goto TAIL_RECURSE;
1808        }        }
# Line 1828  for (;;) Line 1812  for (;;)
1812    
1813      case OP_CIRC:      case OP_CIRC:
1814      if (md->notbol && eptr == md->start_subject) MRRETURN(MATCH_NOMATCH);      if (md->notbol && eptr == md->start_subject) MRRETURN(MATCH_NOMATCH);
1815    
1816      /* Start of subject assertion */      /* Start of subject assertion */
1817    
1818      case OP_SOD:      case OP_SOD:
1819      if (eptr != md->start_subject) MRRETURN(MATCH_NOMATCH);      if (eptr != md->start_subject) MRRETURN(MATCH_NOMATCH);
1820      ecode++;      ecode++;
1821      break;      break;
1822    
1823      /* Multiline mode: start of subject unless notbol, or after any newline. */      /* Multiline mode: start of subject unless notbol, or after any newline. */
1824    
1825      case OP_CIRCM:      case OP_CIRCM:
# Line 1874  for (;;) Line 1858  for (;;)
1858      ecode++;      ecode++;
1859      break;      break;
1860    
1861      /* Not multiline mode: assert before a terminating newline or before end of      /* Not multiline mode: assert before a terminating newline or before end of
1862      subject unless noteol is set. */      subject unless noteol is set. */
1863    
1864      case OP_DOLL:      case OP_DOLL:
# Line 2163  for (;;) Line 2147  for (;;)
2147      switch(c)      switch(c)
2148        {        {
2149        default: MRRETURN(MATCH_NOMATCH);        default: MRRETURN(MATCH_NOMATCH);
2150    
2151        case 0x000d:        case 0x000d:
2152        if (eptr < md->end_subject && *eptr == 0x0a) eptr++;        if (eptr < md->end_subject && *eptr == 0x0a) eptr++;
2153        break;        break;
# Line 2387  for (;;) Line 2371  for (;;)
2371        MRRETURN(MATCH_NOMATCH);        MRRETURN(MATCH_NOMATCH);
2372        }        }
2373      GETCHARINCTEST(c, eptr);      GETCHARINCTEST(c, eptr);
2374        if (UCD_CATEGORY(c) == ucp_M) MRRETURN(MATCH_NOMATCH);
2375        while (eptr < md->end_subject)
2376        {        {
2377        int category = UCD_CATEGORY(c);        int len = 1;
2378        if (category == ucp_M) MRRETURN(MATCH_NOMATCH);        if (!utf8) c = *eptr; else { GETCHARLEN(c, eptr, len); }
2379        while (eptr < md->end_subject)        if (UCD_CATEGORY(c) != ucp_M) break;
2380          {        eptr += len;
         int len = 1;  
         if (!utf8) c = *eptr; else  
           {  
           GETCHARLEN(c, eptr, len);  
           }  
         category = UCD_CATEGORY(c);  
         if (category != ucp_M) break;  
         eptr += len;  
         }  
2381        }        }
2382      ecode++;      ecode++;
2383      break;      break;
# Line 2416  for (;;) Line 2393  for (;;)
2393      loops). */      loops). */
2394    
2395      case OP_REF:      case OP_REF:
2396      case OP_REFI:      case OP_REFI:
2397      caseless = op == OP_REFI;      caseless = op == OP_REFI;
2398      offset = GET2(ecode, 1) << 1;               /* Doubled ref number */      offset = GET2(ecode, 1) << 1;               /* Doubled ref number */
2399      ecode += 3;      ecode += 3;
2400    
# Line 2485  for (;;) Line 2462  for (;;)
2462    
2463      for (i = 1; i <= min; i++)      for (i = 1; i <= min; i++)
2464        {        {
2465        int slength;        int slength;
2466        if ((slength = match_ref(offset, eptr, length, md, caseless)) < 0)        if ((slength = match_ref(offset, eptr, length, md, caseless)) < 0)
2467          {          {
2468          CHECK_PARTIAL();          CHECK_PARTIAL();
# Line 2505  for (;;) Line 2482  for (;;)
2482        {        {
2483        for (fi = min;; fi++)        for (fi = min;; fi++)
2484          {          {
2485          int slength;          int slength;
2486          RMATCH(eptr, ecode, offset_top, md, eptrb, RM14);          RMATCH(eptr, ecode, offset_top, md, eptrb, RM14);
2487          if (rrc != MATCH_NOMATCH) RRETURN(rrc);          if (rrc != MATCH_NOMATCH) RRETURN(rrc);
2488          if (fi >= max) MRRETURN(MATCH_NOMATCH);          if (fi >= max) MRRETURN(MATCH_NOMATCH);
# Line 2526  for (;;) Line 2503  for (;;)
2503        pp = eptr;        pp = eptr;
2504        for (i = min; i < max; i++)        for (i = min; i < max; i++)
2505          {          {
2506          int slength;          int slength;
2507          if ((slength = match_ref(offset, eptr, length, md, caseless)) < 0)          if ((slength = match_ref(offset, eptr, length, md, caseless)) < 0)
2508            {            {
2509            CHECK_PARTIAL();            CHECK_PARTIAL();
# Line 3259  for (;;) Line 3236  for (;;)
3236      checking can be multibyte. */      checking can be multibyte. */
3237    
3238      case OP_NOT:      case OP_NOT:
3239      case OP_NOTI:      case OP_NOTI:
3240      if (eptr >= md->end_subject)      if (eptr >= md->end_subject)
3241        {        {
3242        SCHECK_PARTIAL();        SCHECK_PARTIAL();
# Line 3754  for (;;) Line 3731  for (;;)
3731            case PT_LAMP:            case PT_LAMP:
3732            for (i = 1; i <= min; i++)            for (i = 1; i <= min; i++)
3733              {              {
3734                int chartype;
3735              if (eptr >= md->end_subject)              if (eptr >= md->end_subject)
3736                {                {
3737                SCHECK_PARTIAL();                SCHECK_PARTIAL();
3738                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
3739                }                }
3740              GETCHARINCTEST(c, eptr);              GETCHARINCTEST(c, eptr);
3741              prop_chartype = UCD_CHARTYPE(c);              chartype = UCD_CHARTYPE(c);
3742              if ((prop_chartype == ucp_Lu ||              if ((chartype == ucp_Lu ||
3743                   prop_chartype == ucp_Ll ||                   chartype == ucp_Ll ||
3744                   prop_chartype == ucp_Lt) == prop_fail_result)                   chartype == ucp_Lt) == prop_fail_result)
3745                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
3746              }              }
3747            break;            break;
# Line 3777  for (;;) Line 3755  for (;;)
3755                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
3756                }                }
3757              GETCHARINCTEST(c, eptr);              GETCHARINCTEST(c, eptr);
3758              prop_category = UCD_CATEGORY(c);              if ((UCD_CATEGORY(c) == prop_value) == prop_fail_result)
             if ((prop_category == prop_value) == prop_fail_result)  
3759                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
3760              }              }
3761            break;            break;
# Line 3792  for (;;) Line 3769  for (;;)
3769                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
3770                }                }
3771              GETCHARINCTEST(c, eptr);              GETCHARINCTEST(c, eptr);
3772              prop_chartype = UCD_CHARTYPE(c);              if ((UCD_CHARTYPE(c) == prop_value) == prop_fail_result)
             if ((prop_chartype == prop_value) == prop_fail_result)  
3773                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
3774              }              }
3775            break;            break;
# Line 3807  for (;;) Line 3783  for (;;)
3783                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
3784                }                }
3785              GETCHARINCTEST(c, eptr);              GETCHARINCTEST(c, eptr);
3786              prop_script = UCD_SCRIPT(c);              if ((UCD_SCRIPT(c) == prop_value) == prop_fail_result)
             if ((prop_script == prop_value) == prop_fail_result)  
3787                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
3788              }              }
3789            break;            break;
# Line 3816  for (;;) Line 3791  for (;;)
3791            case PT_ALNUM:            case PT_ALNUM:
3792            for (i = 1; i <= min; i++)            for (i = 1; i <= min; i++)
3793              {              {
3794                int category;
3795              if (eptr >= md->end_subject)              if (eptr >= md->end_subject)
3796                {                {
3797                SCHECK_PARTIAL();                SCHECK_PARTIAL();
3798                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
3799                }                }
3800              GETCHARINCTEST(c, eptr);              GETCHARINCTEST(c, eptr);
3801              prop_category = UCD_CATEGORY(c);              category = UCD_CATEGORY(c);
3802              if ((prop_category == ucp_L || prop_category == ucp_N)              if ((category == ucp_L || category == ucp_N) == prop_fail_result)
                    == prop_fail_result)  
3803                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
3804              }              }
3805            break;            break;
# Line 3838  for (;;) Line 3813  for (;;)
3813                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
3814                }                }
3815              GETCHARINCTEST(c, eptr);              GETCHARINCTEST(c, eptr);
3816              prop_category = UCD_CATEGORY(c);              if ((UCD_CATEGORY(c) == ucp_Z || c == CHAR_HT || c == CHAR_NL ||
             if ((prop_category == ucp_Z || c == CHAR_HT || c == CHAR_NL ||  
3817                   c == CHAR_FF || c == CHAR_CR)                   c == CHAR_FF || c == CHAR_CR)
3818                     == prop_fail_result)                     == prop_fail_result)
3819                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
# Line 3855  for (;;) Line 3829  for (;;)
3829                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
3830                }                }
3831              GETCHARINCTEST(c, eptr);              GETCHARINCTEST(c, eptr);
3832              prop_category = UCD_CATEGORY(c);              if ((UCD_CATEGORY(c) == ucp_Z || c == CHAR_HT || c == CHAR_NL ||
             if ((prop_category == ucp_Z || c == CHAR_HT || c == CHAR_NL ||  
3833                   c == CHAR_VT || c == CHAR_FF || c == CHAR_CR)                   c == CHAR_VT || c == CHAR_FF || c == CHAR_CR)
3834                     == prop_fail_result)                     == prop_fail_result)
3835                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
# Line 3866  for (;;) Line 3839  for (;;)
3839            case PT_WORD:            case PT_WORD:
3840            for (i = 1; i <= min; i++)            for (i = 1; i <= min; i++)
3841              {              {
3842                int category;
3843              if (eptr >= md->end_subject)              if (eptr >= md->end_subject)
3844                {                {
3845                SCHECK_PARTIAL();                SCHECK_PARTIAL();
3846                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
3847                }                }
3848              GETCHARINCTEST(c, eptr);              GETCHARINCTEST(c, eptr);
3849              prop_category = UCD_CATEGORY(c);              category = UCD_CATEGORY(c);
3850              if ((prop_category == ucp_L || prop_category == ucp_N ||              if ((category == ucp_L || category == ucp_N || c == CHAR_UNDERSCORE)
                  c == CHAR_UNDERSCORE)  
3851                     == prop_fail_result)                     == prop_fail_result)
3852                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
3853              }              }
# Line 3900  for (;;) Line 3873  for (;;)
3873              MRRETURN(MATCH_NOMATCH);              MRRETURN(MATCH_NOMATCH);
3874              }              }
3875            GETCHARINCTEST(c, eptr);            GETCHARINCTEST(c, eptr);
3876            prop_category = UCD_CATEGORY(c);            if (UCD_CATEGORY(c) == ucp_M) MRRETURN(MATCH_NOMATCH);
           if (prop_category == ucp_M) MRRETURN(MATCH_NOMATCH);  
3877            while (eptr < md->end_subject)            while (eptr < md->end_subject)
3878              {              {
3879              int len = 1;              int len = 1;
3880              if (!utf8) c = *eptr;              if (!utf8) c = *eptr; else { GETCHARLEN(c, eptr, len); }
3881                else { GETCHARLEN(c, eptr, len); }              if (UCD_CATEGORY(c) != ucp_M) break;
             prop_category = UCD_CATEGORY(c);  
             if (prop_category != ucp_M) break;  
3882              eptr += len;              eptr += len;
3883              }              }
3884            }            }
# Line 3966  for (;;) Line 3936  for (;;)
3936            switch(c)            switch(c)
3937              {              {
3938              default: MRRETURN(MATCH_NOMATCH);              default: MRRETURN(MATCH_NOMATCH);
3939    
3940              case 0x000d:              case 0x000d:
3941              if (eptr < md->end_subject && *eptr == 0x0a) eptr++;              if (eptr < md->end_subject && *eptr == 0x0a) eptr++;
3942              break;              break;
# Line 4243  for (;;) Line 4213  for (;;)
4213            switch(*eptr++)            switch(*eptr++)
4214              {              {
4215              default: MRRETURN(MATCH_NOMATCH);              default: MRRETURN(MATCH_NOMATCH);
4216    
4217              case 0x000d:              case 0x000d:
4218              if (eptr < md->end_subject && *eptr == 0x0a) eptr++;              if (eptr < md->end_subject && *eptr == 0x0a) eptr++;
4219              break;              break;
4220    
4221              case 0x000a:              case 0x000a:
4222              break;              break;
4223    
# Line 4453  for (;;) Line 4423  for (;;)
4423            case PT_LAMP:            case PT_LAMP:
4424            for (fi = min;; fi++)            for (fi = min;; fi++)
4425              {              {
4426                int chartype;
4427              RMATCH(eptr, ecode, offset_top, md, eptrb, RM37);              RMATCH(eptr, ecode, offset_top, md, eptrb, RM37);
4428              if (rrc != MATCH_NOMATCH) RRETURN(rrc);              if (rrc != MATCH_NOMATCH) RRETURN(rrc);
4429              if (fi >= max) MRRETURN(MATCH_NOMATCH);              if (fi >= max) MRRETURN(MATCH_NOMATCH);
# Line 4462  for (;;) Line 4433  for (;;)
4433                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
4434                }                }
4435              GETCHARINCTEST(c, eptr);              GETCHARINCTEST(c, eptr);
4436              prop_chartype = UCD_CHARTYPE(c);              chartype = UCD_CHARTYPE(c);
4437              if ((prop_chartype == ucp_Lu ||              if ((chartype == ucp_Lu ||
4438                   prop_chartype == ucp_Ll ||                   chartype == ucp_Ll ||
4439                   prop_chartype == ucp_Lt) == prop_fail_result)                   chartype == ucp_Lt) == prop_fail_result)
4440                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
4441              }              }
4442            /* Control never gets here */            /* Control never gets here */
# Line 4482  for (;;) Line 4453  for (;;)
4453                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
4454                }                }
4455              GETCHARINCTEST(c, eptr);              GETCHARINCTEST(c, eptr);
4456              prop_category = UCD_CATEGORY(c);              if ((UCD_CATEGORY(c) == prop_value) == prop_fail_result)
             if ((prop_category == prop_value) == prop_fail_result)  
4457                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
4458              }              }
4459            /* Control never gets here */            /* Control never gets here */
# Line 4500  for (;;) Line 4470  for (;;)
4470                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
4471                }                }
4472              GETCHARINCTEST(c, eptr);              GETCHARINCTEST(c, eptr);
4473              prop_chartype = UCD_CHARTYPE(c);              if ((UCD_CHARTYPE(c) == prop_value) == prop_fail_result)
             if ((prop_chartype == prop_value) == prop_fail_result)  
4474                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
4475              }              }
4476            /* Control never gets here */            /* Control never gets here */
# Line 4518  for (;;) Line 4487  for (;;)
4487                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
4488                }                }
4489              GETCHARINCTEST(c, eptr);              GETCHARINCTEST(c, eptr);
4490              prop_script = UCD_SCRIPT(c);              if ((UCD_SCRIPT(c) == prop_value) == prop_fail_result)
             if ((prop_script == prop_value) == prop_fail_result)  
4491                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
4492              }              }
4493            /* Control never gets here */            /* Control never gets here */
# Line 4527  for (;;) Line 4495  for (;;)
4495            case PT_ALNUM:            case PT_ALNUM:
4496            for (fi = min;; fi++)            for (fi = min;; fi++)
4497              {              {
4498                int category;
4499              RMATCH(eptr, ecode, offset_top, md, eptrb, RM59);              RMATCH(eptr, ecode, offset_top, md, eptrb, RM59);
4500              if (rrc != MATCH_NOMATCH) RRETURN(rrc);              if (rrc != MATCH_NOMATCH) RRETURN(rrc);
4501              if (fi >= max) MRRETURN(MATCH_NOMATCH);              if (fi >= max) MRRETURN(MATCH_NOMATCH);
# Line 4536  for (;;) Line 4505  for (;;)
4505                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
4506                }                }
4507              GETCHARINCTEST(c, eptr);              GETCHARINCTEST(c, eptr);
4508              prop_category = UCD_CATEGORY(c);              category = UCD_CATEGORY(c);
4509              if ((prop_category == ucp_L || prop_category == ucp_N)              if ((category == ucp_L || category == ucp_N) == prop_fail_result)
                    == prop_fail_result)  
4510                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
4511              }              }
4512            /* Control never gets here */            /* Control never gets here */
# Line 4555  for (;;) Line 4523  for (;;)
4523                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
4524                }                }
4525              GETCHARINCTEST(c, eptr);              GETCHARINCTEST(c, eptr);
4526              prop_category = UCD_CATEGORY(c);              if ((UCD_CATEGORY(c) == ucp_Z || c == CHAR_HT || c == CHAR_NL ||
             if ((prop_category == ucp_Z || c == CHAR_HT || c == CHAR_NL ||  
4527                   c == CHAR_FF || c == CHAR_CR)                   c == CHAR_FF || c == CHAR_CR)
4528                     == prop_fail_result)                     == prop_fail_result)
4529                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
# Line 4575  for (;;) Line 4542  for (;;)
4542                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
4543                }                }
4544              GETCHARINCTEST(c, eptr);              GETCHARINCTEST(c, eptr);
4545              prop_category = UCD_CATEGORY(c);              if ((UCD_CATEGORY(c) == ucp_Z || c == CHAR_HT || c == CHAR_NL ||
             if ((prop_category == ucp_Z || c == CHAR_HT || c == CHAR_NL ||  
4546                   c == CHAR_VT || c == CHAR_FF || c == CHAR_CR)                   c == CHAR_VT || c == CHAR_FF || c == CHAR_CR)
4547                     == prop_fail_result)                     == prop_fail_result)
4548                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
# Line 4586  for (;;) Line 4552  for (;;)
4552            case PT_WORD:            case PT_WORD:
4553            for (fi = min;; fi++)            for (fi = min;; fi++)
4554              {              {
4555                int category;
4556              RMATCH(eptr, ecode, offset_top, md, eptrb, RM62);              RMATCH(eptr, ecode, offset_top, md, eptrb, RM62);
4557              if (rrc != MATCH_NOMATCH) RRETURN(rrc);              if (rrc != MATCH_NOMATCH) RRETURN(rrc);
4558              if (fi >= max) MRRETURN(MATCH_NOMATCH);              if (fi >= max) MRRETURN(MATCH_NOMATCH);
# Line 4595  for (;;) Line 4562  for (;;)
4562                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
4563                }                }
4564              GETCHARINCTEST(c, eptr);              GETCHARINCTEST(c, eptr);
4565              prop_category = UCD_CATEGORY(c);              category = UCD_CATEGORY(c);
4566              if ((prop_category == ucp_L ||              if ((category == ucp_L ||
4567                   prop_category == ucp_N ||                   category == ucp_N ||
4568                   c == CHAR_UNDERSCORE)                   c == CHAR_UNDERSCORE)
4569                     == prop_fail_result)                     == prop_fail_result)
4570                MRRETURN(MATCH_NOMATCH);                MRRETURN(MATCH_NOMATCH);
# Line 4627  for (;;) Line 4594  for (;;)
4594              MRRETURN(MATCH_NOMATCH);              MRRETURN(MATCH_NOMATCH);
4595              }              }
4596            GETCHARINCTEST(c, eptr);            GETCHARINCTEST(c, eptr);
4597            prop_category = UCD_CATEGORY(c);            if (UCD_CATEGORY(c) == ucp_M) MRRETURN(MATCH_NOMATCH);
           if (prop_category == ucp_M) MRRETURN(MATCH_NOMATCH);  
4598            while (eptr < md->end_subject)            while (eptr < md->end_subject)
4599              {              {
4600              int len = 1;              int len = 1;
4601              if (!utf8) c = *eptr;              if (!utf8) c = *eptr; else { GETCHARLEN(c, eptr, len); }
4602                else { GETCHARLEN(c, eptr, len); }              if (UCD_CATEGORY(c) != ucp_M) break;
             prop_category = UCD_CATEGORY(c);  
             if (prop_category != ucp_M) break;  
4603              eptr += len;              eptr += len;
4604              }              }
4605            }            }
4606          }          }
   
4607        else        else
4608  #endif     /* SUPPORT_UCP */  #endif     /* SUPPORT_UCP */
4609    
# Line 4961  for (;;) Line 4924  for (;;)
4924            case PT_LAMP:            case PT_LAMP:
4925            for (i = min; i < max; i++)            for (i = min; i < max; i++)
4926              {              {
4927                int chartype;
4928              int len = 1;              int len = 1;
4929              if (eptr >= md->end_subject)              if (eptr >= md->end_subject)
4930                {                {
# Line 4968  for (;;) Line 4932  for (;;)
4932                break;                break;
4933                }                }
4934              GETCHARLENTEST(c, eptr, len);              GETCHARLENTEST(c, eptr, len);
4935              prop_chartype = UCD_CHARTYPE(c);              chartype = UCD_CHARTYPE(c);
4936              if ((prop_chartype == ucp_Lu ||              if ((chartype == ucp_Lu ||
4937                   prop_chartype == ucp_Ll ||                   chartype == ucp_Ll ||
4938                   prop_chartype == ucp_Lt) == prop_fail_result)                   chartype == ucp_Lt) == prop_fail_result)
4939                break;                break;
4940              eptr+= len;              eptr+= len;
4941              }              }
# Line 4987  for (;;) Line 4951  for (;;)
4951                break;                break;
4952                }                }
4953              GETCHARLENTEST(c, eptr, len);              GETCHARLENTEST(c, eptr, len);
4954              prop_category = UCD_CATEGORY(c);              if ((UCD_CATEGORY(c) == prop_value) == prop_fail_result) break;
             if ((prop_category == prop_value) == prop_fail_result)  
               break;  
4955              eptr+= len;              eptr+= len;
4956              }              }
4957            break;            break;
# Line 5004  for (;;) Line 4966  for (;;)
4966                break;                break;
4967                }                }
4968              GETCHARLENTEST(c, eptr, len);              GETCHARLENTEST(c, eptr, len);
4969              prop_chartype = UCD_CHARTYPE(c);              if ((UCD_CHARTYPE(c) == prop_value) == prop_fail_result) break;
             if ((prop_chartype == prop_value) == prop_fail_result)  
               break;  
4970              eptr+= len;              eptr+= len;
4971              }              }
4972            break;            break;
# Line 5021  for (;;) Line 4981  for (;;)
4981                break;                break;
4982                }                }
4983              GETCHARLENTEST(c, eptr, len);              GETCHARLENTEST(c, eptr, len);
4984              prop_script = UCD_SCRIPT(c);              if ((UCD_SCRIPT(c) == prop_value) == prop_fail_result) break;
             if ((prop_script == prop_value) == prop_fail_result)  
               break;  
4985              eptr+= len;              eptr+= len;
4986              }              }
4987            break;            break;
# Line 5031  for (;;) Line 4989  for (;;)
4989            case PT_ALNUM:            case PT_ALNUM:
4990            for (i = min; i < max; i++)            for (i = min; i < max; i++)
4991              {              {
4992                int category;
4993              int len = 1;              int len = 1;
4994              if (eptr >= md->end_subject)              if (eptr >= md->end_subject)
4995                {                {
# Line 5038  for (;;) Line 4997  for (;;)
4997                break;                break;
4998                }                }
4999              GETCHARLENTEST(c, eptr, len);              GETCHARLENTEST(c, eptr, len);
5000              prop_category = UCD_CATEGORY(c);              category = UCD_CATEGORY(c);
5001              if ((prop_category == ucp_L || prop_category == ucp_N)              if ((category == ucp_L || category == ucp_N) == prop_fail_result)
                  == prop_fail_result)  
5002                break;                break;
5003              eptr+= len;              eptr+= len;
5004              }              }
# Line 5056  for (;;) Line 5014  for (;;)
5014                break;                break;
5015                }                }
5016              GETCHARLENTEST(c, eptr, len);              GETCHARLENTEST(c, eptr, len);
5017              prop_category = UCD_CATEGORY(c);              if ((UCD_CATEGORY(c) == ucp_Z || c == CHAR_HT || c == CHAR_NL ||
             if ((prop_category == ucp_Z || c == CHAR_HT || c == CHAR_NL ||  
5018                   c == CHAR_FF || c == CHAR_CR)                   c == CHAR_FF || c == CHAR_CR)
5019                   == prop_fail_result)                   == prop_fail_result)
5020                break;                break;
# Line 5075  for (;;) Line 5032  for (;;)
5032                break;                break;
5033                }                }
5034              GETCHARLENTEST(c, eptr, len);              GETCHARLENTEST(c, eptr, len);
5035              prop_category = UCD_CATEGORY(c);              if ((UCD_CATEGORY(c) == ucp_Z || c == CHAR_HT || c == CHAR_NL ||
             if ((prop_category == ucp_Z || c == CHAR_HT || c == CHAR_NL ||  
5036                   c == CHAR_VT || c == CHAR_FF || c == CHAR_CR)                   c == CHAR_VT || c == CHAR_FF || c == CHAR_CR)
5037                   == prop_fail_result)                   == prop_fail_result)
5038                break;                break;
# Line 5087  for (;;) Line 5043  for (;;)
5043            case PT_WORD:            case PT_WORD:
5044            for (i = min; i < max; i++)            for (i = min; i < max; i++)
5045              {              {
5046                int category;
5047              int len = 1;              int len = 1;
5048              if (eptr >= md->end_subject)              if (eptr >= md->end_subject)
5049                {                {
# Line 5094  for (;;) Line 5051  for (;;)
5051                break;                break;
5052                }                }
5053              GETCHARLENTEST(c, eptr, len);              GETCHARLENTEST(c, eptr, len);
5054              prop_category = UCD_CATEGORY(c);              category = UCD_CATEGORY(c);
5055              if ((prop_category == ucp_L || prop_category == ucp_N ||              if ((category == ucp_L || category == ucp_N ||
5056                   c == CHAR_UNDERSCORE) == prop_fail_result)                   c == CHAR_UNDERSCORE) == prop_fail_result)
5057                break;                break;
5058              eptr+= len;              eptr+= len;
# Line 5125  for (;;) Line 5082  for (;;)
5082          {          {
5083          for (i = min; i < max; i++)          for (i = min; i < max; i++)
5084            {            {
5085              int len = 1;
5086            if (eptr >= md->end_subject)            if (eptr >= md->end_subject)
5087              {              {
5088              SCHECK_PARTIAL();              SCHECK_PARTIAL();
5089              break;              break;
5090              }              }
5091            GETCHARINCTEST(c, eptr);            if (!utf8) c = *eptr; else { GETCHARLEN(c, eptr, len); }
5092            prop_category = UCD_CATEGORY(c);            if (UCD_CATEGORY(c) == ucp_M) break;
5093            if (prop_category == ucp_M) break;            eptr += len;
5094            while (eptr < md->end_subject)            while (eptr < md->end_subject)
5095              {              {
5096              int len = 1;              len = 1;
5097              if (!utf8) c = *eptr; else              if (!utf8) c = *eptr; else { GETCHARLEN(c, eptr, len); }
5098                {              if (UCD_CATEGORY(c) != ucp_M) break;
               GETCHARLEN(c, eptr, len);  
               }  
             prop_category = UCD_CATEGORY(c);  
             if (prop_category != ucp_M) break;  
5099              eptr += len;              eptr += len;
5100              }              }
5101            }            }
# Line 5157  for (;;) Line 5111  for (;;)
5111            if (eptr-- == pp) break;        /* Stop if tried at original pos */            if (eptr-- == pp) break;        /* Stop if tried at original pos */
5112            for (;;)                        /* Move back over one extended */            for (;;)                        /* Move back over one extended */
5113              {              {
             int len = 1;  
5114              if (!utf8) c = *eptr; else              if (!utf8) c = *eptr; else
5115                {                {
5116                BACKCHAR(eptr);                BACKCHAR(eptr);
5117                GETCHARLEN(c, eptr, len);                GETCHAR(c, eptr);
5118                }                }
5119              prop_category = UCD_CATEGORY(c);              if (UCD_CATEGORY(c) != ucp_M) break;
             if (prop_category != ucp_M) break;  
5120              eptr--;              eptr--;
5121              }              }
5122            }            }
# Line 5449  for (;;) Line 5401  for (;;)
5401            if (rrc != MATCH_NOMATCH) RRETURN(rrc);            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
5402            if (eptr-- == pp) break;        /* Stop if tried at original pos */            if (eptr-- == pp) break;        /* Stop if tried at original pos */
5403            BACKCHAR(eptr);            BACKCHAR(eptr);
5404            if (ctype == OP_ANYNL && eptr > pp  && *eptr == '\n' &&            if (ctype == OP_ANYNL && eptr > pp  && *eptr == '\n' &&
5405                eptr[-1] == '\r') eptr--;                eptr[-1] == '\r') eptr--;
5406            }            }
5407          }          }
# Line 5661  for (;;) Line 5613  for (;;)
5613            RMATCH(eptr, ecode, offset_top, md, eptrb, RM47);            RMATCH(eptr, ecode, offset_top, md, eptrb, RM47);
5614            if (rrc != MATCH_NOMATCH) RRETURN(rrc);            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
5615            eptr--;            eptr--;
5616            if (ctype == OP_ANYNL && eptr > pp  && *eptr == '\n' &&            if (ctype == OP_ANYNL && eptr > pp  && *eptr == '\n' &&
5617                eptr[-1] == '\r') eptr--;                eptr[-1] == '\r') eptr--;
5618            }            }
5619          }          }
# Line 5701  switch (frame->Xwhere) Line 5653  switch (frame->Xwhere)
5653    LBL( 9) LBL(10) LBL(11) LBL(12) LBL(13) LBL(14) LBL(15) LBL(17)    LBL( 9) LBL(10) LBL(11) LBL(12) LBL(13) LBL(14) LBL(15) LBL(17)
5654    LBL(19) LBL(24) LBL(25) LBL(26) LBL(27) LBL(29) LBL(31) LBL(33)    LBL(19) LBL(24) LBL(25) LBL(26) LBL(27) LBL(29) LBL(31) LBL(33)
5655    LBL(35) LBL(43) LBL(47) LBL(48) LBL(49) LBL(50) LBL(51) LBL(52)    LBL(35) LBL(43) LBL(47) LBL(48) LBL(49) LBL(50) LBL(51) LBL(52)
5656    LBL(53) LBL(54) LBL(55) LBL(56) LBL(57) LBL(58) LBL(63) LBL(64)    LBL(53) LBL(54) LBL(55) LBL(56) LBL(57) LBL(58) LBL(63)
5657  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF8
5658    LBL(16) LBL(18) LBL(20) LBL(21) LBL(22) LBL(23) LBL(28) LBL(30)    LBL(16) LBL(18) LBL(20) LBL(21) LBL(22) LBL(23) LBL(28) LBL(30)
5659    LBL(32) LBL(34) LBL(42) LBL(46)    LBL(32) LBL(34) LBL(42) LBL(46)
# Line 5803  pcre_exec(const pcre *argument_re, const Line 5755  pcre_exec(const pcre *argument_re, const
5755    PCRE_SPTR subject, int length, int start_offset, int options, int *offsets,    PCRE_SPTR subject, int length, int start_offset, int options, int *offsets,
5756    int offsetcount)    int offsetcount)
5757  {  {
5758  int rc, resetcount, ocount;  int rc, ocount;
5759  int first_byte = -1;  int first_byte = -1;
5760  int req_byte = -1;  int req_byte = -1;
5761  int req_byte2 = -1;  int req_byte2 = -1;
# Line 5911  utf8 = md->utf8 = (re->options & PCRE_UT Line 5863  utf8 = md->utf8 = (re->options & PCRE_UT
5863  md->use_ucp = (re->options & PCRE_UCP) != 0;  md->use_ucp = (re->options & PCRE_UCP) != 0;
5864  md->jscript_compat = (re->options & PCRE_JAVASCRIPT_COMPAT) != 0;  md->jscript_compat = (re->options & PCRE_JAVASCRIPT_COMPAT) != 0;
5865    
5866    /* Some options are unpacked into BOOL variables in the hope that testing
5867    them will be faster than individual option bits. */
5868    
5869  md->notbol = (options & PCRE_NOTBOL) != 0;  md->notbol = (options & PCRE_NOTBOL) != 0;
5870  md->noteol = (options & PCRE_NOTEOL) != 0;  md->noteol = (options & PCRE_NOTEOL) != 0;
5871  md->notempty = (options & PCRE_NOTEMPTY) != 0;  md->notempty = (options & PCRE_NOTEMPTY) != 0;
5872  md->notempty_atstart = (options & PCRE_NOTEMPTY_ATSTART) != 0;  md->notempty_atstart = (options & PCRE_NOTEMPTY_ATSTART) != 0;
5873  md->partial = ((options & PCRE_PARTIAL_HARD) != 0)? 2 :  md->partial = ((options & PCRE_PARTIAL_HARD) != 0)? 2 :
5874                ((options & PCRE_PARTIAL_SOFT) != 0)? 1 : 0;                ((options & PCRE_PARTIAL_SOFT) != 0)? 1 : 0;
5875    
5876    
5877  md->hitend = FALSE;  md->hitend = FALSE;
5878  md->mark = NULL;                        /* In case never set */  md->mark = NULL;                        /* In case never set */
5879    
# Line 5998  defined (though never set). So there's n Line 5955  defined (though never set). So there's n
5955  if (md->partial && (re->flags & PCRE_NOPARTIAL) != 0)  if (md->partial && (re->flags & PCRE_NOPARTIAL) != 0)
5956    return PCRE_ERROR_BADPARTIAL;    return PCRE_ERROR_BADPARTIAL;
5957    
5958  /* Check a UTF-8 string if required. Pass back the character offset and error  /* Check a UTF-8 string if required. Pass back the character offset and error
5959  code for an invalid string if a results vector is available. */  code for an invalid string if a results vector is available. */
5960    
5961  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF8
5962  if (utf8 && (options & PCRE_NO_UTF8_CHECK) == 0)  if (utf8 && (options & PCRE_NO_UTF8_CHECK) == 0)
5963    {    {
5964    int erroroffset;    int erroroffset;
5965    int errorcode = _pcre_valid_utf8((USPTR)subject, length, &erroroffset);    int errorcode = _pcre_valid_utf8((USPTR)subject, length, &erroroffset);
5966    if (errorcode != 0)    if (errorcode != 0)
5967      {      {
# Line 6012  if (utf8 && (options & PCRE_NO_UTF8_CHEC Line 5969  if (utf8 && (options & PCRE_NO_UTF8_CHEC
5969        {        {
5970        offsets[0] = erroroffset;        offsets[0] = erroroffset;
5971        offsets[1] = errorcode;        offsets[1] = errorcode;
5972        }        }
5973      return (errorcode <= PCRE_UTF8_ERR5 && md->partial > 1)?      return (errorcode <= PCRE_UTF8_ERR5 && md->partial > 1)?
5974        PCRE_ERROR_SHORTUTF8 : PCRE_ERROR_BADUTF8;        PCRE_ERROR_SHORTUTF8 : PCRE_ERROR_BADUTF8;
5975      }      }
5976    
5977    /* Check that a start_offset points to the start of a UTF-8 character. */    /* Check that a start_offset points to the start of a UTF-8 character. */
5978    
5979    if (start_offset > 0 && start_offset < length &&    if (start_offset > 0 && start_offset < length &&
5980        (((USPTR)subject)[start_offset] & 0xc0) == 0x80)        (((USPTR)subject)[start_offset] & 0xc0) == 0x80)
5981      return PCRE_ERROR_BADUTF8_OFFSET;      return PCRE_ERROR_BADUTF8_OFFSET;
5982    }    }
5983  #endif  #endif
# Line 6047  md->offset_max = (2*ocount)/3; Line 6004  md->offset_max = (2*ocount)/3;
6004  md->offset_overflow = FALSE;  md->offset_overflow = FALSE;
6005  md->capture_last = -1;  md->capture_last = -1;
6006    
 /* Compute the minimum number of offsets that we need to reset each time. Doing  
 this makes a huge difference to execution time when there aren't many brackets  
 in the pattern. */  
   
 resetcount = 2 + re->top_bracket * 2;  
 if (resetcount > offsetcount) resetcount = ocount;  
   
6007  /* Reset the working variable associated with each extraction. These should  /* Reset the working variable associated with each extraction. These should
6008  never be used unless previously set, but they get saved and restored, and so we  never be used unless previously set, but they get saved and restored, and so we
6009  initialize them to avoid reading uninitialized locations. */  initialize them to avoid reading uninitialized locations. Also, unset the
6010    offsets for the matched string. This is really just for tidiness with callouts,
6011    in case they inspect these fields. */
6012    
6013  if (md->offset_vector != NULL)  if (md->offset_vector != NULL)
6014    {    {
6015    register int *iptr = md->offset_vector + ocount;    register int *iptr = md->offset_vector + ocount;
6016    register int *iend = iptr - resetcount/2 + 1;    register int *iend = iptr - re->top_bracket;
6017      if (iend < md->offset_vector + 2) iend = md->offset_vector + 2;
6018    while (--iptr >= iend) *iptr = -1;    while (--iptr >= iend) *iptr = -1;
6019      md->offset_vector[0] = md->offset_vector[1] = -1;
6020    }    }
6021    
6022  /* Set up the first character to match, if available. The first_byte value is  /* Set up the first character to match, if available. The first_byte value is
# Line 6096  if ((re->flags & PCRE_REQCHSET) != 0) Line 6050  if ((re->flags & PCRE_REQCHSET) != 0)
6050    }    }
6051    
6052    
6053    
6054    
6055  /* ==========================================================================*/  /* ==========================================================================*/
6056    
6057  /* Loop for handling unanchored repeated matching attempts; for anchored regexs  /* Loop for handling unanchored repeated matching attempts; for anchored regexs
# Line 6106  for(;;) Line 6062  for(;;)
6062    USPTR save_end_subject = end_subject;    USPTR save_end_subject = end_subject;
6063    USPTR new_start_match;    USPTR new_start_match;
6064    
   /* Reset the maximum number of extractions we might see. */  
   
   if (md->offset_vector != NULL)  
     {  
     register int *iptr = md->offset_vector;  
     register int *iend = iptr + resetcount;  
     while (iptr < iend) *iptr++ = -1;  
     }  
   
6065    /* If firstline is TRUE, the start of the match is constrained to the first    /* If firstline is TRUE, the start of the match is constrained to the first
6066    line of a multiline string. That is, the match must be before or at the first    line of a multiline string. That is, the match must be before or at the first
6067    newline. Implement this by temporarily adjusting end_subject so that we stop    newline. Implement this by temporarily adjusting end_subject so that we stop
# Line 6303  for(;;) Line 6250  for(;;)
6250    md->start_match_ptr = start_match;    md->start_match_ptr = start_match;
6251    md->start_used_ptr = start_match;    md->start_used_ptr = start_match;
6252    md->match_call_count = 0;    md->match_call_count = 0;
6253    md->match_function_type = 0;    md->match_function_type = 0;
6254      md->end_offset_top = 0;
6255    rc = match(start_match, md->start_code, start_match, NULL, 2, md, NULL, 0);    rc = match(start_match, md->start_code, start_match, NULL, 2, md, NULL, 0);
6256    if (md->hitend && start_partial == NULL) start_partial = md->start_used_ptr;    if (md->hitend && start_partial == NULL) start_partial = md->start_used_ptr;
6257    
# Line 6427  if (rc == MATCH_MATCH || rc == MATCH_ACC Line 6375  if (rc == MATCH_MATCH || rc == MATCH_ACC
6375    
6376    /* Set the return code to the number of captured strings, or 0 if there are    /* Set the return code to the number of captured strings, or 0 if there are
6377    too many to fit into the vector. */    too many to fit into the vector. */
6378    
6379    rc = md->offset_overflow? 0 : md->end_offset_top/2;    rc = md->offset_overflow? 0 : md->end_offset_top/2;
6380    
6381      /* If there is space in the offset vector, set any unused pairs at the end of
6382      the pattern to -1 for backwards compatibility. It is documented that this
6383      happens. In earlier versions, the whole set of potential capturing offsets
6384      was set to -1 each time round the loop, but this is handled differently now.
6385      "Gaps" are set to -1 dynamically instead (this fixes a bug). Thus, it is only
6386      those at the end that need unsetting here. We can't just unset them all at
6387      the start of the whole thing because they may get set in one branch that is
6388      not the final matching branch. */
6389    
6390      if (md->end_offset_top/2 <= re->top_bracket && offsets != NULL)
6391        {
6392        register int *iptr, *iend;
6393        int resetcount = 2 + re->top_bracket * 2;
6394        if (resetcount > offsetcount) resetcount = ocount;
6395        iptr = offsets + md->end_offset_top;
6396        iend = offsets + resetcount;
6397        while (iptr < iend) *iptr++ = -1;
6398        }
6399    
6400    /* If there is space, set up the whole thing as substring 0. The value of    /* If there is space, set up the whole thing as substring 0. The value of
6401    md->start_match_ptr might be modified if \K was encountered on the success    md->start_match_ptr might be modified if \K was encountered on the success
6402    matching path. */    matching path. */

Legend:
Removed from v.606  
changed lines
  Added in v.645

  ViewVC Help
Powered by ViewVC 1.1.5