/[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 1248 by ph10, Wed Feb 13 17:36:38 2013 UTC revision 1365 by ph10, Sun Oct 6 18:33:56 2013 UTC
# Line 6  Line 6 
6  and semantics are as close as possible to those of the Perl 5 language.  and semantics are as close as possible to those of the Perl 5 language.
7    
8                         Written by Philip Hazel                         Written by Philip Hazel
9             Copyright (c) 1997-2012 University of Cambridge             Copyright (c) 1997-2013 University of Cambridge
10    
11  -----------------------------------------------------------------------------  -----------------------------------------------------------------------------
12  Redistribution and use in source and binary forms, with or without  Redistribution and use in source and binary forms, with or without
# Line 56  possible. There are also some static sup Line 56  possible. There are also some static sup
56  #undef min  #undef min
57  #undef max  #undef max
58    
59  /* The md->capture_last field uses the lower 16 bits for the last captured  /* The md->capture_last field uses the lower 16 bits for the last captured
60  substring (which can never be greater than 65535) and a bit in the top half  substring (which can never be greater than 65535) and a bit in the top half
61  to mean "capture vector overflowed". This odd way of doing things was  to mean "capture vector overflowed". This odd way of doing things was
62  implemented when it was realized that preserving and restoring the overflow bit  implemented when it was realized that preserving and restoring the overflow bit
63  whenever the last capture number was saved/restored made for a neater  whenever the last capture number was saved/restored made for a neater
64  interface, and doing it this way saved on (a) another variable, which would  interface, and doing it this way saved on (a) another variable, which would
65  have increased the stack frame size (a big NO-NO in PCRE) and (b) another  have increased the stack frame size (a big NO-NO in PCRE) and (b) another
66  separate set of save/restore instructions. The following defines are used in  separate set of save/restore instructions. The following defines are used in
67  implementing this. */  implementing this. */
68    
69  #define CAPLMASK    0x0000ffff    /* The bits used for last_capture */  #define CAPLMASK    0x0000ffff    /* The bits used for last_capture */
# Line 87  defined PCRE_ERROR_xxx codes, which are Line 87  defined PCRE_ERROR_xxx codes, which are
87  negative to avoid the external error codes. */  negative to avoid the external error codes. */
88    
89  #define MATCH_ACCEPT       (-999)  #define MATCH_ACCEPT       (-999)
90  #define MATCH_COMMIT       (-998)  #define MATCH_KETRPOS      (-998)
91  #define MATCH_KETRPOS      (-997)  #define MATCH_ONCE         (-997)
92  #define MATCH_ONCE         (-996)  /* The next 5 must be kept together and in sequence so that a test that checks
93    for any one of them can use a range. */
94    #define MATCH_COMMIT       (-996)
95  #define MATCH_PRUNE        (-995)  #define MATCH_PRUNE        (-995)
96  #define MATCH_SKIP         (-994)  #define MATCH_SKIP         (-994)
97  #define MATCH_SKIP_ARG     (-993)  #define MATCH_SKIP_ARG     (-993)
98  #define MATCH_THEN         (-992)  #define MATCH_THEN         (-992)
99    #define MATCH_BACKTRACK_MAX MATCH_THEN
100    #define MATCH_BACKTRACK_MIN MATCH_COMMIT
101    
102  /* Maximum number of ints of offset to save on the stack for recursive calls.  /* Maximum number of ints of offset to save on the stack for recursive calls.
103  If the offset vector is bigger, malloc is used. This should be a multiple of 3,  If the offset vector is bigger, malloc is used. This should be a multiple of 3,
# Line 233  if (caseless) Line 237  if (caseless)
237      {      {
238      while (length-- > 0)      while (length-- > 0)
239        {        {
240        pcre_uchar cc, cp;        pcre_uint32 cc, cp;
241        if (eptr >= md->end_subject) return -2;   /* Partial match */        if (eptr >= md->end_subject) return -2;   /* Partial match */
242        cc = RAWUCHARTEST(eptr);        cc = RAWUCHARTEST(eptr);
243        cp = RAWUCHARTEST(p);        cp = RAWUCHARTEST(p);
# Line 308  enum { RM1=1, RM2,  RM3,  RM4,  RM5,  RM Line 312  enum { RM1=1, RM2,  RM3,  RM4,  RM5,  RM
312         RM31,  RM32, RM33, RM34, RM35, RM36, RM37, RM38, RM39, RM40,         RM31,  RM32, RM33, RM34, RM35, RM36, RM37, RM38, RM39, RM40,
313         RM41,  RM42, RM43, RM44, RM45, RM46, RM47, RM48, RM49, RM50,         RM41,  RM42, RM43, RM44, RM45, RM46, RM47, RM48, RM49, RM50,
314         RM51,  RM52, RM53, RM54, RM55, RM56, RM57, RM58, RM59, RM60,         RM51,  RM52, RM53, RM54, RM55, RM56, RM57, RM58, RM59, RM60,
315         RM61,  RM62, RM63, RM64, RM65, RM66, RM67 };         RM61,  RM62, RM63, RM64, RM65, RM66, RM67, RM68 };
316    
317  /* 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
318  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 777  for (;;) Line 781  for (;;)
781      case OP_FAIL:      case OP_FAIL:
782      RRETURN(MATCH_NOMATCH);      RRETURN(MATCH_NOMATCH);
783    
     /* COMMIT overrides PRUNE, SKIP, and THEN */  
   
784      case OP_COMMIT:      case OP_COMMIT:
785      RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode], offset_top, md,      RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode], offset_top, md,
786        eptrb, RM52);        eptrb, RM52);
787      if (rrc != MATCH_NOMATCH && rrc != MATCH_PRUNE &&      if (rrc != MATCH_NOMATCH) RRETURN(rrc);
         rrc != MATCH_SKIP && rrc != MATCH_SKIP_ARG &&  
         rrc != MATCH_THEN)  
       RRETURN(rrc);  
788      RRETURN(MATCH_COMMIT);      RRETURN(MATCH_COMMIT);
789    
     /* PRUNE overrides THEN */  
   
790      case OP_PRUNE:      case OP_PRUNE:
791      RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode], offset_top, md,      RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode], offset_top, md,
792        eptrb, RM51);        eptrb, RM51);
793      if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc);      if (rrc != MATCH_NOMATCH) RRETURN(rrc);
794      RRETURN(MATCH_PRUNE);      RRETURN(MATCH_PRUNE);
795    
796      case OP_PRUNE_ARG:      case OP_PRUNE_ARG:
# Line 803  for (;;) Line 800  for (;;)
800        eptrb, RM56);        eptrb, RM56);
801      if ((rrc == MATCH_MATCH || rrc == MATCH_ACCEPT) &&      if ((rrc == MATCH_MATCH || rrc == MATCH_ACCEPT) &&
802           md->mark == NULL) md->mark = ecode + 2;           md->mark == NULL) md->mark = ecode + 2;
803      if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc);      if (rrc != MATCH_NOMATCH) RRETURN(rrc);
804      RRETURN(MATCH_PRUNE);      RRETURN(MATCH_PRUNE);
805    
     /* SKIP overrides PRUNE and THEN */  
   
806      case OP_SKIP:      case OP_SKIP:
807      RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode], offset_top, md,      RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode], offset_top, md,
808        eptrb, RM53);        eptrb, RM53);
809      if (rrc != MATCH_NOMATCH && rrc != MATCH_PRUNE && rrc != MATCH_THEN)      if (rrc != MATCH_NOMATCH) RRETURN(rrc);
       RRETURN(rrc);  
810      md->start_match_ptr = eptr;   /* Pass back current position */      md->start_match_ptr = eptr;   /* Pass back current position */
811      RRETURN(MATCH_SKIP);      RRETURN(MATCH_SKIP);
812    
813      /* Note that, for Perl compatibility, SKIP with an argument does NOT set      /* Note that, for Perl compatibility, SKIP with an argument does NOT set
814      nomatch_mark. There is a flag that disables this opcode when re-matching a      nomatch_mark. When a pattern match ends with a SKIP_ARG for which there was
815      pattern that ended with a SKIP for which there was not a matching MARK. */      not a matching mark, we have to re-run the match, ignoring the SKIP_ARG
816        that failed and any that precede it (either they also failed, or were not
817        triggered). To do this, we maintain a count of executed SKIP_ARGs. If a
818        SKIP_ARG gets to top level, the match is re-run with md->ignore_skip_arg
819        set to the count of the one that failed. */
820    
821      case OP_SKIP_ARG:      case OP_SKIP_ARG:
822      if (md->ignore_skip_arg)      md->skip_arg_count++;
823        if (md->skip_arg_count <= md->ignore_skip_arg)
824        {        {
825        ecode += PRIV(OP_lengths)[*ecode] + ecode[1];        ecode += PRIV(OP_lengths)[*ecode] + ecode[1];
826        break;        break;
827        }        }
828      RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode] + ecode[1], offset_top, md,      RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode] + ecode[1], offset_top, md,
829        eptrb, RM57);        eptrb, RM57);
830      if (rrc != MATCH_NOMATCH && rrc != MATCH_PRUNE && rrc != MATCH_THEN)      if (rrc != MATCH_NOMATCH) RRETURN(rrc);
       RRETURN(rrc);  
831    
832      /* Pass back the current skip name by overloading md->start_match_ptr and      /* Pass back the current skip name by overloading md->start_match_ptr and
833      returning the special MATCH_SKIP_ARG return code. This will either be      returning the special MATCH_SKIP_ARG return code. This will either be
834      caught by a matching MARK, or get to the top, where it causes a rematch      caught by a matching MARK, or get to the top, where it causes a rematch
835      with the md->ignore_skip_arg flag set. */      with md->ignore_skip_arg set to the value of md->skip_arg_count. */
836    
837      md->start_match_ptr = ecode + 2;      md->start_match_ptr = ecode + 2;
838      RRETURN(MATCH_SKIP_ARG);      RRETURN(MATCH_SKIP_ARG);
# Line 1276  for (;;) Line 1274  for (;;)
1274    
1275      /* Control never reaches here. */      /* Control never reaches here. */
1276    
1277      /* Conditional group: compilation checked that there are no more than      /* Conditional group: compilation checked that there are no more than two
1278      two branches. If the condition is false, skipping the first branch takes us      branches. If the condition is false, skipping the first branch takes us
1279      past the end if there is only one branch, but that's OK because that is      past the end of the item if there is only one branch, but that's exactly
1280      exactly what going to the ket would do. */      what we want. */
1281    
1282      case OP_COND:      case OP_COND:
1283      case OP_SCOND:      case OP_SCOND:
1284      codelink = GET(ecode, 1);  
1285        /* The variable codelink will be added to ecode when the condition is
1286        false, to get to the second branch. Setting it to the offset to the ALT
1287        or KET, then incrementing ecode achieves this effect. We now have ecode
1288        pointing to the condition or callout. */
1289    
1290        codelink = GET(ecode, 1);   /* Offset to the second branch */
1291        ecode += 1 + LINK_SIZE;     /* From this opcode */
1292    
1293      /* Because of the way auto-callout works during compile, a callout item is      /* Because of the way auto-callout works during compile, a callout item is
1294      inserted between OP_COND and an assertion condition. */      inserted between OP_COND and an assertion condition. */
1295    
1296      if (ecode[LINK_SIZE+1] == OP_CALLOUT)      if (*ecode == OP_CALLOUT)
1297        {        {
1298        if (PUBL(callout) != NULL)        if (PUBL(callout) != NULL)
1299          {          {
1300          PUBL(callout_block) cb;          PUBL(callout_block) cb;
1301          cb.version          = 2;   /* Version 1 of the callout block */          cb.version          = 2;   /* Version 1 of the callout block */
1302          cb.callout_number   = ecode[LINK_SIZE+2];          cb.callout_number   = ecode[1];
1303          cb.offset_vector    = md->offset_vector;          cb.offset_vector    = md->offset_vector;
1304  #if defined COMPILE_PCRE8  #if defined COMPILE_PCRE8
1305          cb.subject          = (PCRE_SPTR)md->start_subject;          cb.subject          = (PCRE_SPTR)md->start_subject;
# Line 1306  for (;;) Line 1311  for (;;)
1311          cb.subject_length   = (int)(md->end_subject - md->start_subject);          cb.subject_length   = (int)(md->end_subject - md->start_subject);
1312          cb.start_match      = (int)(mstart - md->start_subject);          cb.start_match      = (int)(mstart - md->start_subject);
1313          cb.current_position = (int)(eptr - md->start_subject);          cb.current_position = (int)(eptr - md->start_subject);
1314          cb.pattern_position = GET(ecode, LINK_SIZE + 3);          cb.pattern_position = GET(ecode, 2);
1315          cb.next_item_length = GET(ecode, 3 + 2*LINK_SIZE);          cb.next_item_length = GET(ecode, 2 + LINK_SIZE);
1316          cb.capture_top      = offset_top/2;          cb.capture_top      = offset_top/2;
1317          cb.capture_last     = md->capture_last & CAPLMASK;          cb.capture_last     = md->capture_last & CAPLMASK;
1318          /* Internal change requires this for API compatibility. */          /* Internal change requires this for API compatibility. */
1319          if (cb.capture_last == 0) cb.capture_last = -1;          if (cb.capture_last == 0) cb.capture_last = -1;
1320          cb.callout_data     = md->callout_data;          cb.callout_data     = md->callout_data;
1321          cb.mark             = md->nomatch_mark;          cb.mark             = md->nomatch_mark;
1322          if ((rrc = (*PUBL(callout))(&cb)) > 0) RRETURN(MATCH_NOMATCH);          if ((rrc = (*PUBL(callout))(&cb)) > 0) RRETURN(MATCH_NOMATCH);
1323          if (rrc < 0) RRETURN(rrc);          if (rrc < 0) RRETURN(rrc);
1324          }          }
1325    
1326          /* Advance ecode past the callout, so it now points to the condition. We
1327          must adjust codelink so that the value of ecode+codelink is unchanged. */
1328    
1329        ecode += PRIV(OP_lengths)[OP_CALLOUT];        ecode += PRIV(OP_lengths)[OP_CALLOUT];
1330          codelink -= PRIV(OP_lengths)[OP_CALLOUT];
1331        }        }
1332    
1333      condcode = ecode[LINK_SIZE+1];      /* Test the various possible conditions */
   
     /* Now see what the actual condition is */  
1334    
1335      if (condcode == OP_RREF || condcode == OP_NRREF)    /* Recursion test */      condition = FALSE;
1336        {      switch(condcode = *ecode)
1337        if (md->recursive == NULL)                /* Not recursing => FALSE */        {
1338          case OP_RREF:         /* Numbered group recursion test */
1339          if (md->recursive != NULL)     /* Not recursing => FALSE */
1340          {          {
1341          condition = FALSE;          unsigned int recno = GET2(ecode, 1);   /* Recursion group number*/
         ecode += GET(ecode, 1);  
         }  
       else  
         {  
         unsigned int recno = GET2(ecode, LINK_SIZE + 2);   /* Recursion group number*/  
1342          condition = (recno == RREF_ANY || recno == md->recursive->group_num);          condition = (recno == RREF_ANY || recno == md->recursive->group_num);
1343            }
1344          break;
1345    
1346          /* If the test is for recursion into a specific subpattern, and it is        case OP_DNRREF:       /* Duplicate named group recursion test */
1347          false, but the test was set up by name, scan the table to see if the        if (md->recursive != NULL)
1348          name refers to any other numbers, and test them. The condition is true          {
1349          if any one is set. */          int count = GET2(ecode, 1 + IMM2_SIZE);
1350            pcre_uchar *slot = md->name_table + GET2(ecode, 1) * md->name_entry_size;
1351          if (!condition && condcode == OP_NRREF)          while (count-- > 0)
1352            {            {
1353            pcre_uchar *slotA = md->name_table;            unsigned int recno = GET2(slot, 0);
1354            for (i = 0; i < md->name_count; i++)            condition = recno == md->recursive->group_num;
1355              {            if (condition) break;
1356              if (GET2(slotA, 0) == recno) break;            slot += md->name_entry_size;
             slotA += md->name_entry_size;  
             }  
   
           /* Found a name for the number - there can be only one; duplicate  
           names for different numbers are allowed, but not vice versa. First  
           scan down for duplicates. */  
   
           if (i < md->name_count)  
             {  
             pcre_uchar *slotB = slotA;  
             while (slotB > md->name_table)  
               {  
               slotB -= md->name_entry_size;  
               if (STRCMP_UC_UC(slotA + IMM2_SIZE, slotB + IMM2_SIZE) == 0)  
                 {  
                 condition = GET2(slotB, 0) == md->recursive->group_num;  
                 if (condition) break;  
                 }  
               else break;  
               }  
   
             /* Scan up for duplicates */  
   
             if (!condition)  
               {  
               slotB = slotA;  
               for (i++; i < md->name_count; i++)  
                 {  
                 slotB += md->name_entry_size;  
                 if (STRCMP_UC_UC(slotA + IMM2_SIZE, slotB + IMM2_SIZE) == 0)  
                   {  
                   condition = GET2(slotB, 0) == md->recursive->group_num;  
                   if (condition) break;  
                   }  
                 else break;  
                 }  
               }  
             }  
1357            }            }
1358            }
1359          break;
1360    
1361          /* Chose branch according to the condition */        case OP_CREF:         /* Numbered group used test */
1362          offset = GET2(ecode, 1) << 1;  /* Doubled ref number */
         ecode += condition? 1 + IMM2_SIZE : GET(ecode, 1);  
         }  
       }  
   
     else if (condcode == OP_CREF || condcode == OP_NCREF)  /* Group used test */  
       {  
       offset = GET2(ecode, LINK_SIZE+2) << 1;  /* Doubled ref number */  
1363        condition = offset < offset_top && md->offset_vector[offset] >= 0;        condition = offset < offset_top && md->offset_vector[offset] >= 0;
1364          break;
1365    
1366        /* If the numbered capture is unset, but the reference was by name,        case OP_DNCREF:      /* Duplicate named group used test */
       scan the table to see if the name refers to any other numbers, and test  
       them. The condition is true if any one is set. This is tediously similar  
       to the code above, but not close enough to try to amalgamate. */  
   
       if (!condition && condcode == OP_NCREF)  
1367          {          {
1368          unsigned int refno = offset >> 1;          int count = GET2(ecode, 1 + IMM2_SIZE);
1369          pcre_uchar *slotA = md->name_table;          pcre_uchar *slot = md->name_table + GET2(ecode, 1) * md->name_entry_size;
1370            while (count-- > 0)
         for (i = 0; i < md->name_count; i++)  
1371            {            {
1372            if (GET2(slotA, 0) == refno) break;            offset = GET2(slot, 0) << 1;
1373            slotA += md->name_entry_size;            condition = offset < offset_top && md->offset_vector[offset] >= 0;
1374            }            if (condition) break;
1375              slot += md->name_entry_size;
         /* Found a name for the number - there can be only one; duplicate names  
         for different numbers are allowed, but not vice versa. First scan down  
         for duplicates. */  
   
         if (i < md->name_count)  
           {  
           pcre_uchar *slotB = slotA;  
           while (slotB > md->name_table)  
             {  
             slotB -= md->name_entry_size;  
             if (STRCMP_UC_UC(slotA + IMM2_SIZE, slotB + IMM2_SIZE) == 0)  
               {  
               offset = GET2(slotB, 0) << 1;  
               condition = offset < offset_top &&  
                 md->offset_vector[offset] >= 0;  
               if (condition) break;  
               }  
             else break;  
             }  
   
           /* Scan up for duplicates */  
   
           if (!condition)  
             {  
             slotB = slotA;  
             for (i++; i < md->name_count; i++)  
               {  
               slotB += md->name_entry_size;  
               if (STRCMP_UC_UC(slotA + IMM2_SIZE, slotB + IMM2_SIZE) == 0)  
                 {  
                 offset = GET2(slotB, 0) << 1;  
                 condition = offset < offset_top &&  
                   md->offset_vector[offset] >= 0;  
                 if (condition) break;  
                 }  
               else break;  
               }  
             }  
1376            }            }
1377          }          }
1378          break;
1379    
1380        /* Chose branch according to the condition */        case OP_DEF:     /* DEFINE - always false */
1381          break;
       ecode += condition? 1 + IMM2_SIZE : GET(ecode, 1);  
       }  
   
     else if (condcode == OP_DEF)     /* DEFINE - always false */  
       {  
       condition = FALSE;  
       ecode += GET(ecode, 1);  
       }  
   
     /* The condition is an assertion. Call match() to evaluate it - setting  
     md->match_function_type to MATCH_CONDASSERT causes it to stop at the end of  
     an assertion. */  
1382    
1383      else        /* The condition is an assertion. Call match() to evaluate it - setting
1384        {        md->match_function_type to MATCH_CONDASSERT causes it to stop at the end
1385          of an assertion. */
1386    
1387          default:
1388        md->match_function_type = MATCH_CONDASSERT;        md->match_function_type = MATCH_CONDASSERT;
1389        RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, NULL, RM3);        RMATCH(eptr, ecode, offset_top, md, NULL, RM3);
1390        if (rrc == MATCH_MATCH)        if (rrc == MATCH_MATCH)
1391          {          {
1392          if (md->end_offset_top > offset_top)          if (md->end_offset_top > offset_top)
1393            offset_top = md->end_offset_top;  /* Captures may have happened */            offset_top = md->end_offset_top;  /* Captures may have happened */
1394          condition = TRUE;          condition = TRUE;
1395          ecode += 1 + LINK_SIZE + GET(ecode, LINK_SIZE + 2);  
1396            /* Advance ecode past the assertion to the start of the first branch,
1397            but adjust it so that the general choosing code below works. */
1398    
1399            ecode += GET(ecode, 1);
1400          while (*ecode == OP_ALT) ecode += GET(ecode, 1);          while (*ecode == OP_ALT) ecode += GET(ecode, 1);
1401            ecode += 1 + LINK_SIZE - PRIV(OP_lengths)[condcode];
1402          }          }
1403    
1404        /* PCRE doesn't allow the effect of (*THEN) to escape beyond an        /* PCRE doesn't allow the effect of (*THEN) to escape beyond an
1405        assertion; it is therefore treated as NOMATCH. */        assertion; it is therefore treated as NOMATCH. Any other return is an
1406          error. */
1407    
1408        else if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN)        else if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN)
1409          {          {
1410          RRETURN(rrc);         /* Need braces because of following else */          RRETURN(rrc);         /* Need braces because of following else */
1411          }          }
1412        else        break;
         {  
         condition = FALSE;  
         ecode += codelink;  
         }  
1413        }        }
1414    
1415      /* We are now at the branch that is to be obeyed. As there is only one, can      /* Choose branch according to the condition */
1416      use tail recursion to avoid using another stack frame, except when there is  
1417      unlimited repeat of a possibly empty group. In the latter case, a recursive      ecode += condition? PRIV(OP_lengths)[condcode] : codelink;
1418      call to match() is always required, unless the second alternative doesn't  
1419      exist, in which case we can just plough on. Note that, for compatibility      /* We are now at the branch that is to be obeyed. As there is only one, we
1420      with Perl, the | in a conditional group is NOT treated as creating two      can use tail recursion to avoid using another stack frame, except when
1421      alternatives. If a THEN is encountered in the branch, it propagates out to      there is unlimited repeat of a possibly empty group. In the latter case, a
1422      the enclosing alternative (unless nested in a deeper set of alternatives,      recursive call to match() is always required, unless the second alternative
1423      of course). */      doesn't exist, in which case we can just plough on. Note that, for
1424        compatibility with Perl, the | in a conditional group is NOT treated as
1425      if (condition || *ecode == OP_ALT)      creating two alternatives. If a THEN is encountered in the branch, it
1426        propagates out to the enclosing alternative (unless nested in a deeper set
1427        of alternatives, of course). */
1428    
1429        if (condition || ecode[-(1+LINK_SIZE)] == OP_ALT)
1430        {        {
1431        if (op != OP_SCOND)        if (op != OP_SCOND)
1432          {          {
         ecode += 1 + LINK_SIZE;  
1433          goto TAIL_RECURSE;          goto TAIL_RECURSE;
1434          }          }
1435    
1436        md->match_function_type = MATCH_CBEGROUP;        md->match_function_type = MATCH_CBEGROUP;
1437        RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, eptrb, RM49);        RMATCH(eptr, ecode, offset_top, md, eptrb, RM49);
1438        RRETURN(rrc);        RRETURN(rrc);
1439        }        }
1440    
# Line 1524  for (;;) Line 1442  for (;;)
1442    
1443      else      else
1444        {        {
       ecode += 1 + LINK_SIZE;  
1445        }        }
1446      break;      break;
1447    
# Line 1604  for (;;) Line 1521  for (;;)
1521        }        }
1522      else condassert = FALSE;      else condassert = FALSE;
1523    
1524        /* Loop for each branch */
1525    
1526      do      do
1527        {        {
1528        RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, NULL, RM4);        RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, NULL, RM4);
1529    
1530          /* A match means that the assertion is true; break out of the loop
1531          that matches its alternatives. */
1532    
1533        if (rrc == MATCH_MATCH || rrc == MATCH_ACCEPT)        if (rrc == MATCH_MATCH || rrc == MATCH_ACCEPT)
1534          {          {
1535          mstart = md->start_match_ptr;   /* In case \K reset it */          mstart = md->start_match_ptr;   /* In case \K reset it */
1536          break;          break;
1537          }          }
1538    
1539          /* If not matched, restore the previous mark setting. */
1540    
1541        md->mark = save_mark;        md->mark = save_mark;
1542    
1543        /* A COMMIT failure must fail the entire assertion, without trying any        /* See comment in the code for capturing groups above about handling
1544        subsequent branches. */        THEN. */
1545    
1546        if (rrc == MATCH_COMMIT) RRETURN(MATCH_NOMATCH);        if (rrc == MATCH_THEN)
1547            {
1548            next = ecode + GET(ecode,1);
1549            if (md->start_match_ptr < next &&
1550                (*ecode == OP_ALT || *next == OP_ALT))
1551              rrc = MATCH_NOMATCH;
1552            }
1553    
1554        /* PCRE does not allow THEN to escape beyond an assertion; it        /* Anything other than NOMATCH causes the entire assertion to fail,
1555        is treated as NOMATCH. */        passing back the return code. This includes COMMIT, SKIP, PRUNE and an
1556          uncaptured THEN, which means they take their normal effect. This
1557          consistent approach does not always have exactly the same effect as in
1558          Perl. */
1559    
1560        if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc);        if (rrc != MATCH_NOMATCH) RRETURN(rrc);
1561        ecode += GET(ecode, 1);        ecode += GET(ecode, 1);
1562        }        }
1563      while (*ecode == OP_ALT);      while (*ecode == OP_ALT);   /* Continue for next alternative */
1564    
1565        /* If we have tried all the alternative branches, the assertion has
1566        failed. If not, we broke out after a match. */
1567    
1568      if (*ecode == OP_KET) RRETURN(MATCH_NOMATCH);      if (*ecode == OP_KET) RRETURN(MATCH_NOMATCH);
1569    
# Line 1633  for (;;) Line 1571  for (;;)
1571    
1572      if (condassert) RRETURN(MATCH_MATCH);      if (condassert) RRETURN(MATCH_MATCH);
1573    
1574      /* Continue from after the assertion, updating the offsets high water      /* Continue from after a successful assertion, updating the offsets high
1575      mark, since extracts may have been taken during the assertion. */      water mark, since extracts may have been taken during the assertion. */
1576    
1577      do ecode += GET(ecode,1); while (*ecode == OP_ALT);      do ecode += GET(ecode,1); while (*ecode == OP_ALT);
1578      ecode += 1 + LINK_SIZE;      ecode += 1 + LINK_SIZE;
1579      offset_top = md->end_offset_top;      offset_top = md->end_offset_top;
1580      continue;      continue;
1581    
1582      /* Negative assertion: all branches must fail to match. Encountering SKIP,      /* Negative assertion: all branches must fail to match for the assertion to
1583      PRUNE, or COMMIT means we must assume failure without checking subsequent      succeed. */
     branches. */  
1584    
1585      case OP_ASSERT_NOT:      case OP_ASSERT_NOT:
1586      case OP_ASSERTBACK_NOT:      case OP_ASSERTBACK_NOT:
# Line 1655  for (;;) Line 1592  for (;;)
1592        }        }
1593      else condassert = FALSE;      else condassert = FALSE;
1594    
1595        /* Loop for each alternative branch. */
1596    
1597      do      do
1598        {        {
1599        RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, NULL, RM5);        RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, NULL, RM5);
1600        md->mark = save_mark;        md->mark = save_mark;   /* Always restore the mark setting */
1601        if (rrc == MATCH_MATCH || rrc == MATCH_ACCEPT) RRETURN(MATCH_NOMATCH);  
1602        if (rrc == MATCH_SKIP || rrc == MATCH_PRUNE || rrc == MATCH_COMMIT)        switch(rrc)
1603          {          {
1604          do ecode += GET(ecode,1); while (*ecode == OP_ALT);          case MATCH_MATCH:            /* A successful match means */
1605            case MATCH_ACCEPT:           /* the assertion has failed. */
1606            RRETURN(MATCH_NOMATCH);
1607    
1608            case MATCH_NOMATCH:          /* Carry on with next branch */
1609          break;          break;
1610    
1611            /* See comment in the code for capturing groups above about handling
1612            THEN. */
1613    
1614            case MATCH_THEN:
1615            next = ecode + GET(ecode,1);
1616            if (md->start_match_ptr < next &&
1617                (*ecode == OP_ALT || *next == OP_ALT))
1618              {
1619              rrc = MATCH_NOMATCH;
1620              break;
1621              }
1622            /* Otherwise fall through. */
1623    
1624            /* COMMIT, SKIP, PRUNE, and an uncaptured THEN cause the whole
1625            assertion to fail to match, without considering any more alternatives.
1626            Failing to match means the assertion is true. This is a consistent
1627            approach, but does not always have the same effect as in Perl. */
1628    
1629            case MATCH_COMMIT:
1630            case MATCH_SKIP:
1631            case MATCH_SKIP_ARG:
1632            case MATCH_PRUNE:
1633            do ecode += GET(ecode,1); while (*ecode == OP_ALT);
1634            goto NEG_ASSERT_TRUE;   /* Break out of alternation loop */
1635    
1636            /* Anything else is an error */
1637    
1638            default:
1639            RRETURN(rrc);
1640          }          }
1641    
1642        /* PCRE does not allow THEN to escape beyond an assertion; it is treated        /* Continue with next branch */
       as NOMATCH. */  
1643    
       if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc);  
1644        ecode += GET(ecode,1);        ecode += GET(ecode,1);
1645        }        }
1646      while (*ecode == OP_ALT);      while (*ecode == OP_ALT);
1647    
1648      if (condassert) RRETURN(MATCH_MATCH);  /* Condition assertion */      /* All branches in the assertion failed to match. */
1649    
1650      ecode += 1 + LINK_SIZE;      NEG_ASSERT_TRUE:
1651        if (condassert) RRETURN(MATCH_MATCH);  /* Condition assertion */
1652        ecode += 1 + LINK_SIZE;                /* Continue with current branch */
1653      continue;      continue;
1654    
1655      /* Move the subject pointer back. This occurs only at the start of      /* Move the subject pointer back. This occurs only at the start of
# Line 1737  for (;;) Line 1710  for (;;)
1710        cb.next_item_length = GET(ecode, 2 + LINK_SIZE);        cb.next_item_length = GET(ecode, 2 + LINK_SIZE);
1711        cb.capture_top      = offset_top/2;        cb.capture_top      = offset_top/2;
1712        cb.capture_last     = md->capture_last & CAPLMASK;        cb.capture_last     = md->capture_last & CAPLMASK;
1713        /* Internal change requires this for API compatibility. */        /* Internal change requires this for API compatibility. */
1714        if (cb.capture_last == 0) cb.capture_last = -1;        if (cb.capture_last == 0) cb.capture_last = -1;
1715        cb.callout_data     = md->callout_data;        cb.callout_data     = md->callout_data;
1716        cb.mark             = md->nomatch_mark;        cb.mark             = md->nomatch_mark;
1717        if ((rrc = (*PUBL(callout))(&cb)) > 0) RRETURN(MATCH_NOMATCH);        if ((rrc = (*PUBL(callout))(&cb)) > 0) RRETURN(MATCH_NOMATCH);
# Line 1784  for (;;) Line 1757  for (;;)
1757        /* Add to "recursing stack" */        /* Add to "recursing stack" */
1758    
1759        new_recursive.group_num = recno;        new_recursive.group_num = recno;
1760        new_recursive.saved_capture_last = md->capture_last;        new_recursive.saved_capture_last = md->capture_last;
1761        new_recursive.subject_position = eptr;        new_recursive.subject_position = eptr;
1762        new_recursive.prevrec = md->recursive;        new_recursive.prevrec = md->recursive;
1763        md->recursive = &new_recursive;        md->recursive = &new_recursive;
# Line 1821  for (;;) Line 1794  for (;;)
1794            md, eptrb, RM6);            md, eptrb, RM6);
1795          memcpy(md->offset_vector, new_recursive.offset_save,          memcpy(md->offset_vector, new_recursive.offset_save,
1796              new_recursive.saved_max * sizeof(int));              new_recursive.saved_max * sizeof(int));
1797          md->capture_last = new_recursive.saved_capture_last;          md->capture_last = new_recursive.saved_capture_last;
1798          md->recursive = new_recursive.prevrec;          md->recursive = new_recursive.prevrec;
1799          if (rrc == MATCH_MATCH || rrc == MATCH_ACCEPT)          if (rrc == MATCH_MATCH || rrc == MATCH_ACCEPT)
1800            {            {
# Line 1838  for (;;) Line 1811  for (;;)
1811            goto RECURSION_MATCHED;        /* Exit loop; end processing */            goto RECURSION_MATCHED;        /* Exit loop; end processing */
1812            }            }
1813    
1814          /* PCRE does not allow THEN or COMMIT to escape beyond a recursion; it          /* PCRE does not allow THEN, SKIP, PRUNE or COMMIT to escape beyond a
1815          is treated as NOMATCH. */          recursion; they cause a NOMATCH for the entire recursion. These codes
1816            are defined in a range that can be tested for. */
1817    
1818          else if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN &&          if (rrc >= MATCH_BACKTRACK_MIN && rrc <= MATCH_BACKTRACK_MAX)
1819                   rrc != MATCH_COMMIT)            RRETURN(MATCH_NOMATCH);
1820    
1821            /* Any return code other than NOMATCH is an error. */
1822    
1823            if (rrc != MATCH_NOMATCH)
1824            {            {
1825            DPRINTF(("Recursion gave error %d\n", rrc));            DPRINTF(("Recursion gave error %d\n", rrc));
1826            if (new_recursive.offset_save != stacksave)            if (new_recursive.offset_save != stacksave)
# Line 2596  for (;;) Line 2574  for (;;)
2574            RRETURN(MATCH_NOMATCH);            RRETURN(MATCH_NOMATCH);
2575          break;          break;
2576    
2577            /* Perl space used to exclude VT, but from Perl 5.18 it is included,
2578            which means that Perl space and POSIX space are now identical. PCRE
2579            was changed at release 8.34. */
2580    
2581          case PT_SPACE:    /* Perl space */          case PT_SPACE:    /* Perl space */
         if ((PRIV(ucp_gentype)[prop->chartype] == ucp_Z ||  
              c == CHAR_HT || c == CHAR_NL || c == CHAR_FF || c == CHAR_CR)  
                == (op == OP_NOTPROP))  
           RRETURN(MATCH_NOMATCH);  
         break;  
   
2582          case PT_PXSPACE:  /* POSIX space */          case PT_PXSPACE:  /* POSIX space */
2583          if ((PRIV(ucp_gentype)[prop->chartype] == ucp_Z ||          if ((PRIV(ucp_gentype)[prop->chartype] == ucp_Z ||
2584               c == CHAR_HT || c == CHAR_NL || c == CHAR_VT ||               c == CHAR_HT || c == CHAR_NL || c == CHAR_VT ||
# Line 2629  for (;;) Line 2605  for (;;)
2605            }            }
2606          break;          break;
2607    
2608            case PT_UCNC:
2609            if ((c == CHAR_DOLLAR_SIGN || c == CHAR_COMMERCIAL_AT ||
2610                 c == CHAR_GRAVE_ACCENT || (c >= 0xa0 && c <= 0xd7ff) ||
2611                 c >= 0xe000) == (op == OP_NOTPROP))
2612              RRETURN(MATCH_NOMATCH);
2613            break;
2614    
2615          /* This should never occur */          /* This should never occur */
2616    
2617          default:          default:
# Line 2675  for (;;) Line 2658  for (;;)
2658      similar code to character type repeats - written out again for speed.      similar code to character type repeats - written out again for speed.
2659      However, if the referenced string is the empty string, always treat      However, if the referenced string is the empty string, always treat
2660      it as matched, any number of times (otherwise there could be infinite      it as matched, any number of times (otherwise there could be infinite
2661      loops). */      loops). If the reference is unset, there are two possibilities:
   
     case OP_REF:  
     case OP_REFI:  
     caseless = op == OP_REFI;  
     offset = GET2(ecode, 1) << 1;               /* Doubled ref number */  
     ecode += 1 + IMM2_SIZE;  
   
     /* If the reference is unset, there are two possibilities:  
2662    
2663      (a) In the default, Perl-compatible state, set the length negative;      (a) In the default, Perl-compatible state, set the length negative;
2664      this ensures that every attempt at a match fails. We can't just fail      this ensures that every attempt at a match fails. We can't just fail
# Line 2693  for (;;) Line 2668  for (;;)
2668      so that the back reference matches an empty string.      so that the back reference matches an empty string.
2669    
2670      Otherwise, set the length to the length of what was matched by the      Otherwise, set the length to the length of what was matched by the
2671      referenced subpattern. */      referenced subpattern.
2672    
2673        The OP_REF and OP_REFI opcodes are used for a reference to a numbered group
2674        or to a non-duplicated named group. For a duplicated named group, OP_DNREF
2675        and OP_DNREFI are used. In this case we must scan the list of groups to
2676        which the name refers, and use the first one that is set. */
2677    
2678        case OP_DNREF:
2679        case OP_DNREFI:
2680        caseless = op == OP_DNREFI;
2681          {
2682          int count = GET2(ecode, 1+IMM2_SIZE);
2683          pcre_uchar *slot = md->name_table + GET2(ecode, 1) * md->name_entry_size;
2684          ecode += 1 + 2*IMM2_SIZE;
2685    
2686          while (count-- > 0)
2687            {
2688            offset = GET2(slot, 0) << 1;
2689            if (offset < offset_top && md->offset_vector[offset] >= 0) break;
2690            slot += md->name_entry_size;
2691            }
2692          if (count < 0)
2693            length = (md->jscript_compat)? 0 : -1;
2694          else
2695            length = md->offset_vector[offset+1] - md->offset_vector[offset];
2696          }
2697        goto REF_REPEAT;
2698    
2699        case OP_REF:
2700        case OP_REFI:
2701        caseless = op == OP_REFI;
2702        offset = GET2(ecode, 1) << 1;               /* Doubled ref number */
2703        ecode += 1 + IMM2_SIZE;
2704      if (offset >= offset_top || md->offset_vector[offset] < 0)      if (offset >= offset_top || md->offset_vector[offset] < 0)
2705        length = (md->jscript_compat)? 0 : -1;        length = (md->jscript_compat)? 0 : -1;
2706      else      else
# Line 2702  for (;;) Line 2708  for (;;)
2708    
2709      /* Set up for repetition, or handle the non-repeated case */      /* Set up for repetition, or handle the non-repeated case */
2710    
2711        REF_REPEAT:
2712      switch (*ecode)      switch (*ecode)
2713        {        {
2714        case OP_CRSTAR:        case OP_CRSTAR:
# Line 3215  for (;;) Line 3222  for (;;)
3222    
3223        if (fc < 128)        if (fc < 128)
3224          {          {
3225          pcre_uchar cc = RAWUCHAR(eptr);          pcre_uint32 cc = RAWUCHAR(eptr);
3226          if (md->lcc[fc] != TABLE_GET(cc, md->lcc, cc)) RRETURN(MATCH_NOMATCH);          if (md->lcc[fc] != TABLE_GET(cc, md->lcc, cc)) RRETURN(MATCH_NOMATCH);
3227          ecode++;          ecode++;
3228          eptr++;          eptr++;
# Line 3320  for (;;) Line 3327  for (;;)
3327      max = rep_max[c];                 /* zero for max => infinity */      max = rep_max[c];                 /* zero for max => infinity */
3328      if (max == 0) max = INT_MAX;      if (max == 0) max = INT_MAX;
3329    
3330      /* Common code for all repeated single-character matches. */      /* Common code for all repeated single-character matches. We first check
3331        for the minimum number of characters. If the minimum equals the maximum, we
3332        are done. Otherwise, if minimizing, check the rest of the pattern for a
3333        match; if there isn't one, advance up to the maximum, one character at a
3334        time.
3335    
3336        If maximizing, advance up to the maximum number of matching characters,
3337        until eptr is past the end of the maximum run. If possessive, we are
3338        then done (no backing up). Otherwise, match at this position; anything
3339        other than no match is immediately returned. For nomatch, back up one
3340        character, unless we are matching \R and the last thing matched was
3341        \r\n, in which case, back up two bytes. When we reach the first optional
3342        character position, we can save stack by doing a tail recurse.
3343    
3344        The various UTF/non-UTF and caseful/caseless cases are handled separately,
3345        for speed. */
3346    
3347      REPEATCHAR:      REPEATCHAR:
3348  #ifdef SUPPORT_UTF  #ifdef SUPPORT_UTF
# Line 3404  for (;;) Line 3426  for (;;)
3426                }                }
3427              }              }
3428    
3429            if (possessive) continue;            if (possessive) continue;    /* No backtracking */
   
3430            for(;;)            for(;;)
3431              {              {
3432                if (eptr == pp) goto TAIL_RECURSE;
3433              RMATCH(eptr, ecode, offset_top, md, eptrb, RM23);              RMATCH(eptr, ecode, offset_top, md, eptrb, RM23);
3434              if (rrc != MATCH_NOMATCH) RRETURN(rrc);              if (rrc != MATCH_NOMATCH) RRETURN(rrc);
             if (eptr == pp) { RRETURN(MATCH_NOMATCH); }  
3435  #ifdef SUPPORT_UCP  #ifdef SUPPORT_UCP
3436              eptr--;              eptr--;
3437              BACKCHAR(eptr);              BACKCHAR(eptr);
# Line 3509  for (;;) Line 3530  for (;;)
3530            if (fc != cc && foc != cc) break;            if (fc != cc && foc != cc) break;
3531            eptr++;            eptr++;
3532            }            }
3533            if (possessive) continue;       /* No backtracking */
3534          if (possessive) continue;          for (;;)
   
         while (eptr >= pp)  
3535            {            {
3536              if (eptr == pp) goto TAIL_RECURSE;
3537            RMATCH(eptr, ecode, offset_top, md, eptrb, RM25);            RMATCH(eptr, ecode, offset_top, md, eptrb, RM25);
3538            eptr--;            eptr--;
3539            if (rrc != MATCH_NOMATCH) RRETURN(rrc);            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3540            }            }
3541          RRETURN(MATCH_NOMATCH);          /* Control never gets here */
3542          }          }
       /* Control never gets here */  
3543        }        }
3544    
3545      /* Caseful comparisons (includes all multi-byte characters) */      /* Caseful comparisons (includes all multi-byte characters) */
# Line 3568  for (;;) Line 3587  for (;;)
3587            if (fc != RAWUCHARTEST(eptr)) break;            if (fc != RAWUCHARTEST(eptr)) break;
3588            eptr++;            eptr++;
3589            }            }
3590          if (possessive) continue;          if (possessive) continue;    /* No backtracking */
3591            for (;;)
         while (eptr >= pp)  
3592            {            {
3593              if (eptr == pp) goto TAIL_RECURSE;
3594            RMATCH(eptr, ecode, offset_top, md, eptrb, RM27);            RMATCH(eptr, ecode, offset_top, md, eptrb, RM27);
3595            eptr--;            eptr--;
3596            if (rrc != MATCH_NOMATCH) RRETURN(rrc);            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3597            }            }
3598          RRETURN(MATCH_NOMATCH);          /* Control never gets here */
3599          }          }
3600        }        }
3601      /* Control never gets here */      /* Control never gets here */
# Line 3748  for (;;) Line 3767  for (;;)
3767            }            }
3768          }          }
3769        else        else
3770  #endif  #endif  /* SUPPORT_UTF */
3771        /* Not UTF mode */        /* Not UTF mode */
3772          {          {
3773          for (i = 1; i <= min; i++)          for (i = 1; i <= min; i++)
# Line 3786  for (;;) Line 3805  for (;;)
3805              }              }
3806            }            }
3807          else          else
3808  #endif  #endif  /*SUPPORT_UTF */
3809          /* Not UTF mode */          /* Not UTF mode */
3810            {            {
3811            for (fi = min;; fi++)            for (fi = min;; fi++)
# Line 3828  for (;;) Line 3847  for (;;)
3847              if (fc == d || (unsigned int)foc == d) break;              if (fc == d || (unsigned int)foc == d) break;
3848              eptr += len;              eptr += len;
3849              }              }
3850            if (possessive) continue;            if (possessive) continue;    /* No backtracking */
3851            for(;;)            for(;;)
3852              {              {
3853                if (eptr == pp) goto TAIL_RECURSE;
3854              RMATCH(eptr, ecode, offset_top, md, eptrb, RM30);              RMATCH(eptr, ecode, offset_top, md, eptrb, RM30);
3855              if (rrc != MATCH_NOMATCH) RRETURN(rrc);              if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3856              if (eptr-- == pp) break;        /* Stop if tried at original pos */              eptr--;
3857              BACKCHAR(eptr);              BACKCHAR(eptr);
3858              }              }
3859            }            }
3860          else          else
3861  #endif  #endif  /* SUPPORT_UTF */
3862          /* Not UTF mode */          /* Not UTF mode */
3863            {            {
3864            for (i = min; i < max; i++)            for (i = min; i < max; i++)
# Line 3851  for (;;) Line 3871  for (;;)
3871              if (fc == *eptr || foc == *eptr) break;              if (fc == *eptr || foc == *eptr) break;
3872              eptr++;              eptr++;
3873              }              }
3874            if (possessive) continue;            if (possessive) continue;    /* No backtracking */
3875            while (eptr >= pp)            for (;;)
3876              {              {
3877                if (eptr == pp) goto TAIL_RECURSE;
3878              RMATCH(eptr, ecode, offset_top, md, eptrb, RM31);              RMATCH(eptr, ecode, offset_top, md, eptrb, RM31);
3879              if (rrc != MATCH_NOMATCH) RRETURN(rrc);              if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3880              eptr--;              eptr--;
3881              }              }
3882            }            }
3883            /* Control never gets here */
         RRETURN(MATCH_NOMATCH);  
3884          }          }
       /* Control never gets here */  
3885        }        }
3886    
3887      /* Caseful comparisons */      /* Caseful comparisons */
# Line 3963  for (;;) Line 3982  for (;;)
3982              if (fc == d) break;              if (fc == d) break;
3983              eptr += len;              eptr += len;
3984              }              }
3985            if (possessive) continue;            if (possessive) continue;    /* No backtracking */
3986            for(;;)            for(;;)
3987              {              {
3988                if (eptr == pp) goto TAIL_RECURSE;
3989              RMATCH(eptr, ecode, offset_top, md, eptrb, RM34);              RMATCH(eptr, ecode, offset_top, md, eptrb, RM34);
3990              if (rrc != MATCH_NOMATCH) RRETURN(rrc);              if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3991              if (eptr-- == pp) break;        /* Stop if tried at original pos */              eptr--;
3992              BACKCHAR(eptr);              BACKCHAR(eptr);
3993              }              }
3994            }            }
# Line 3986  for (;;) Line 4006  for (;;)
4006              if (fc == *eptr) break;              if (fc == *eptr) break;
4007              eptr++;              eptr++;
4008              }              }
4009            if (possessive) continue;            if (possessive) continue;    /* No backtracking */
4010            while (eptr >= pp)            for (;;)
4011              {              {
4012                if (eptr == pp) goto TAIL_RECURSE;
4013              RMATCH(eptr, ecode, offset_top, md, eptrb, RM35);              RMATCH(eptr, ecode, offset_top, md, eptrb, RM35);
4014              if (rrc != MATCH_NOMATCH) RRETURN(rrc);              if (rrc != MATCH_NOMATCH) RRETURN(rrc);
4015              eptr--;              eptr--;
4016              }              }
4017            }            }
4018            /* Control never gets here */
         RRETURN(MATCH_NOMATCH);  
4019          }          }
4020        }        }
4021      /* Control never gets here */      /* Control never gets here */
# Line 4177  for (;;) Line 4197  for (;;)
4197              }              }
4198            break;            break;
4199    
4200              /* Perl space used to exclude VT, but from Perl 5.18 it is included,
4201              which means that Perl space and POSIX space are now identical. PCRE
4202              was changed at release 8.34. */
4203    
4204            case PT_SPACE:    /* Perl space */            case PT_SPACE:    /* Perl space */
           for (i = 1; i <= min; i++)  
             {  
             if (eptr >= md->end_subject)  
               {  
               SCHECK_PARTIAL();  
               RRETURN(MATCH_NOMATCH);  
               }  
             GETCHARINCTEST(c, eptr);  
             if ((UCD_CATEGORY(c) == ucp_Z || c == CHAR_HT || c == CHAR_NL ||  
                  c == CHAR_FF || c == CHAR_CR)  
                    == prop_fail_result)  
               RRETURN(MATCH_NOMATCH);  
             }  
           break;  
   
4205            case PT_PXSPACE:  /* POSIX space */            case PT_PXSPACE:  /* POSIX space */
4206            for (i = 1; i <= min; i++)            for (i = 1; i <= min; i++)
4207              {              {
# Line 4247  for (;;) Line 4256  for (;;)
4256              }              }
4257            break;            break;
4258    
4259              case PT_UCNC:
4260              for (i = 1; i <= min; i++)
4261                {
4262                if (eptr >= md->end_subject)
4263                  {
4264                  SCHECK_PARTIAL();
4265                  RRETURN(MATCH_NOMATCH);
4266                  }
4267                GETCHARINCTEST(c, eptr);
4268                if ((c == CHAR_DOLLAR_SIGN || c == CHAR_COMMERCIAL_AT ||
4269                     c == CHAR_GRAVE_ACCENT || (c >= 0xa0 && c <= 0xd7ff) ||
4270                     c >= 0xe000) == prop_fail_result)
4271                  RRETURN(MATCH_NOMATCH);
4272                }
4273              break;
4274    
4275            /* This should not occur */            /* This should not occur */
4276    
4277            default:            default:
# Line 4452  for (;;) Line 4477  for (;;)
4477          case OP_DIGIT:          case OP_DIGIT:
4478          for (i = 1; i <= min; i++)          for (i = 1; i <= min; i++)
4479            {            {
4480            pcre_uchar cc;            pcre_uint32 cc;
   
4481            if (eptr >= md->end_subject)            if (eptr >= md->end_subject)
4482              {              {
4483              SCHECK_PARTIAL();              SCHECK_PARTIAL();
# Line 4470  for (;;) Line 4494  for (;;)
4494          case OP_NOT_WHITESPACE:          case OP_NOT_WHITESPACE:
4495          for (i = 1; i <= min; i++)          for (i = 1; i <= min; i++)
4496            {            {
4497            pcre_uchar cc;            pcre_uint32 cc;
   
4498            if (eptr >= md->end_subject)            if (eptr >= md->end_subject)
4499              {              {
4500              SCHECK_PARTIAL();              SCHECK_PARTIAL();
# Line 4488  for (;;) Line 4511  for (;;)
4511          case OP_WHITESPACE:          case OP_WHITESPACE:
4512          for (i = 1; i <= min; i++)          for (i = 1; i <= min; i++)
4513            {            {
4514            pcre_uchar cc;            pcre_uint32 cc;
   
4515            if (eptr >= md->end_subject)            if (eptr >= md->end_subject)
4516              {              {
4517              SCHECK_PARTIAL();              SCHECK_PARTIAL();
# Line 4506  for (;;) Line 4528  for (;;)
4528          case OP_NOT_WORDCHAR:          case OP_NOT_WORDCHAR:
4529          for (i = 1; i <= min; i++)          for (i = 1; i <= min; i++)
4530            {            {
4531            pcre_uchar cc;            pcre_uint32 cc;
   
4532            if (eptr >= md->end_subject)            if (eptr >= md->end_subject)
4533              {              {
4534              SCHECK_PARTIAL();              SCHECK_PARTIAL();
# Line 4524  for (;;) Line 4545  for (;;)
4545          case OP_WORDCHAR:          case OP_WORDCHAR:
4546          for (i = 1; i <= min; i++)          for (i = 1; i <= min; i++)
4547            {            {
4548            pcre_uchar cc;            pcre_uint32 cc;
   
4549            if (eptr >= md->end_subject)            if (eptr >= md->end_subject)
4550              {              {
4551              SCHECK_PARTIAL();              SCHECK_PARTIAL();
# Line 4914  for (;;) Line 4934  for (;;)
4934              }              }
4935            /* Control never gets here */            /* Control never gets here */
4936    
4937              /* Perl space used to exclude VT, but from Perl 5.18 it is included,
4938              which means that Perl space and POSIX space are now identical. PCRE
4939              was changed at release 8.34. */
4940    
4941            case PT_SPACE:    /* Perl space */            case PT_SPACE:    /* Perl space */
           for (fi = min;; fi++)  
             {  
             RMATCH(eptr, ecode, offset_top, md, eptrb, RM60);  
             if (rrc != MATCH_NOMATCH) RRETURN(rrc);  
             if (fi >= max) RRETURN(MATCH_NOMATCH);  
             if (eptr >= md->end_subject)  
               {  
               SCHECK_PARTIAL();  
               RRETURN(MATCH_NOMATCH);  
               }  
             GETCHARINCTEST(c, eptr);  
             if ((UCD_CATEGORY(c) == ucp_Z || c == CHAR_HT || c == CHAR_NL ||  
                  c == CHAR_FF || c == CHAR_CR)  
                    == prop_fail_result)  
               RRETURN(MATCH_NOMATCH);  
             }  
           /* Control never gets here */  
   
4942            case PT_PXSPACE:  /* POSIX space */            case PT_PXSPACE:  /* POSIX space */
4943            for (fi = min;; fi++)            for (fi = min;; fi++)
4944              {              {
# Line 4998  for (;;) Line 5004  for (;;)
5004              }              }
5005            /* Control never gets here */            /* Control never gets here */
5006    
5007              case PT_UCNC:
5008              for (fi = min;; fi++)
5009                {
5010                RMATCH(eptr, ecode, offset_top, md, eptrb, RM68);
5011                if (rrc != MATCH_NOMATCH) RRETURN(rrc);
5012                if (fi >= max) RRETURN(MATCH_NOMATCH);
5013                if (eptr >= md->end_subject)
5014                  {
5015                  SCHECK_PARTIAL();
5016                  RRETURN(MATCH_NOMATCH);
5017                  }
5018                GETCHARINCTEST(c, eptr);
5019                if ((c == CHAR_DOLLAR_SIGN || c == CHAR_COMMERCIAL_AT ||
5020                     c == CHAR_GRAVE_ACCENT || (c >= 0xa0 && c <= 0xd7ff) ||
5021                     c >= 0xe000) == prop_fail_result)
5022                  RRETURN(MATCH_NOMATCH);
5023                }
5024              /* Control never gets here */
5025    
5026            /* This should never occur */            /* This should never occur */
5027            default:            default:
5028            RRETURN(PCRE_ERROR_INTERNAL);            RRETURN(PCRE_ERROR_INTERNAL);
# Line 5413  for (;;) Line 5438  for (;;)
5438              }              }
5439            break;            break;
5440    
5441              /* Perl space used to exclude VT, but from Perl 5.18 it is included,
5442              which means that Perl space and POSIX space are now identical. PCRE
5443              was changed at release 8.34. */
5444    
5445            case PT_SPACE:    /* Perl space */            case PT_SPACE:    /* Perl space */
           for (i = min; i < max; i++)  
             {  
             int len = 1;  
             if (eptr >= md->end_subject)  
               {  
               SCHECK_PARTIAL();  
               break;  
               }  
             GETCHARLENTEST(c, eptr, len);  
             if ((UCD_CATEGORY(c) == ucp_Z || c == CHAR_HT || c == CHAR_NL ||  
                  c == CHAR_FF || c == CHAR_CR)  
                  == prop_fail_result)  
               break;  
             eptr+= len;  
             }  
           break;  
   
5446            case PT_PXSPACE:  /* POSIX space */            case PT_PXSPACE:  /* POSIX space */
5447            for (i = min; i < max; i++)            for (i = min; i < max; i++)
5448              {              {
# Line 5492  for (;;) Line 5504  for (;;)
5504            GOT_MAX:            GOT_MAX:
5505            break;            break;
5506    
5507              case PT_UCNC:
5508              for (i = min; i < max; i++)
5509                {
5510                int len = 1;
5511                if (eptr >= md->end_subject)
5512                  {
5513                  SCHECK_PARTIAL();
5514                  break;
5515                  }
5516                GETCHARLENTEST(c, eptr, len);
5517                if ((c == CHAR_DOLLAR_SIGN || c == CHAR_COMMERCIAL_AT ||
5518                     c == CHAR_GRAVE_ACCENT || (c >= 0xa0 && c <= 0xd7ff) ||
5519                     c >= 0xe000) == prop_fail_result)
5520                  break;
5521                eptr += len;
5522                }
5523              break;
5524    
5525            default:            default:
5526            RRETURN(PCRE_ERROR_INTERNAL);            RRETURN(PCRE_ERROR_INTERNAL);
5527            }            }
5528    
5529          /* eptr is now past the end of the maximum run */          /* eptr is now past the end of the maximum run */
5530    
5531          if (possessive) continue;          if (possessive) continue;    /* No backtracking */
5532          for(;;)          for(;;)
5533            {            {
5534              if (eptr == pp) goto TAIL_RECURSE;
5535            RMATCH(eptr, ecode, offset_top, md, eptrb, RM44);            RMATCH(eptr, ecode, offset_top, md, eptrb, RM44);
5536            if (rrc != MATCH_NOMATCH) RRETURN(rrc);            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
5537            if (eptr-- == pp) break;        /* Stop if tried at original pos */            eptr--;
5538            if (utf) BACKCHAR(eptr);            if (utf) BACKCHAR(eptr);
5539            }            }
5540          }          }
5541    
5542        /* Match extended Unicode sequences. We will get here only if the        /* Match extended Unicode grapheme clusters. We will get here only if the
5543        support is in the binary; otherwise a compile-time error occurs. */        support is in the binary; otherwise a compile-time error occurs. */
5544    
5545        else if (ctype == OP_EXTUNI)        else if (ctype == OP_EXTUNI)
# Line 5540  for (;;) Line 5571  for (;;)
5571    
5572          /* eptr is now past the end of the maximum run */          /* eptr is now past the end of the maximum run */
5573    
5574          if (possessive) continue;          if (possessive) continue;    /* No backtracking */
5575    
5576          for(;;)          for(;;)
5577            {            {
5578              int lgb, rgb;
5579              PCRE_PUCHAR fptr;
5580    
5581              if (eptr == pp) goto TAIL_RECURSE;   /* At start of char run */
5582            RMATCH(eptr, ecode, offset_top, md, eptrb, RM45);            RMATCH(eptr, ecode, offset_top, md, eptrb, RM45);
5583            if (rrc != MATCH_NOMATCH) RRETURN(rrc);            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
5584            if (eptr-- == pp) break;        /* Stop if tried at original pos */  
5585            for (;;)                        /* Move back over one extended */            /* Backtracking over an extended grapheme cluster involves inspecting
5586              the previous two characters (if present) to see if a break is
5587              permitted between them. */
5588    
5589              eptr--;
5590              if (!utf) c = *eptr; else
5591              {              {
5592              if (!utf) c = *eptr; else              BACKCHAR(eptr);
5593                {              GETCHAR(c, eptr);
5594                BACKCHAR(eptr);              }
5595                GETCHAR(c, eptr);            rgb = UCD_GRAPHBREAK(c);
5596                }  
5597              if (UCD_CATEGORY(c) != ucp_M) break;            for (;;)
5598              eptr--;              {
5599                if (eptr == pp) goto TAIL_RECURSE;   /* At start of char run */
5600                fptr = eptr - 1;
5601                if (!utf) c = *fptr; else
5602                  {
5603                  BACKCHAR(fptr);
5604                  GETCHAR(c, fptr);
5605                  }
5606                lgb = UCD_GRAPHBREAK(c);
5607                if ((PRIV(ucp_gbtable)[lgb] & (1 << rgb)) == 0) break;
5608                eptr = fptr;
5609                rgb = lgb;
5610              }              }
5611            }            }
5612          }          }
# Line 5821  for (;;) Line 5872  for (;;)
5872            RRETURN(PCRE_ERROR_INTERNAL);            RRETURN(PCRE_ERROR_INTERNAL);
5873            }            }
5874    
5875          /* eptr is now past the end of the maximum run. If possessive, we are          if (possessive) continue;    /* No backtracking */
         done (no backing up). Otherwise, match at this position; anything other  
         than no match is immediately returned. For nomatch, back up one  
         character, unless we are matching \R and the last thing matched was  
         \r\n, in which case, back up two bytes. */  
   
         if (possessive) continue;  
5876          for(;;)          for(;;)
5877            {            {
5878              if (eptr == pp) goto TAIL_RECURSE;
5879            RMATCH(eptr, ecode, offset_top, md, eptrb, RM46);            RMATCH(eptr, ecode, offset_top, md, eptrb, RM46);
5880            if (rrc != MATCH_NOMATCH) RRETURN(rrc);            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
5881            if (eptr-- == pp) break;        /* Stop if tried at original pos */            eptr--;
5882            BACKCHAR(eptr);            BACKCHAR(eptr);
5883            if (ctype == OP_ANYNL && eptr > pp  && RAWUCHAR(eptr) == CHAR_NL &&            if (ctype == OP_ANYNL && eptr > pp  && RAWUCHAR(eptr) == CHAR_NL &&
5884                RAWUCHAR(eptr - 1) == CHAR_CR) eptr--;                RAWUCHAR(eptr - 1) == CHAR_CR) eptr--;
# Line 6070  for (;;) Line 6116  for (;;)
6116            RRETURN(PCRE_ERROR_INTERNAL);            RRETURN(PCRE_ERROR_INTERNAL);
6117            }            }
6118    
6119          /* eptr is now past the end of the maximum run. If possessive, we are          if (possessive) continue;    /* No backtracking */
6120          done (no backing up). Otherwise, match at this position; anything other          for (;;)
         than no match is immediately returned. For nomatch, back up one  
         character (byte), unless we are matching \R and the last thing matched  
         was \r\n, in which case, back up two bytes. */  
   
         if (possessive) continue;  
         while (eptr >= pp)  
6121            {            {
6122              if (eptr == pp) goto TAIL_RECURSE;
6123            RMATCH(eptr, ecode, offset_top, md, eptrb, RM47);            RMATCH(eptr, ecode, offset_top, md, eptrb, RM47);
6124            if (rrc != MATCH_NOMATCH) RRETURN(rrc);            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
6125            eptr--;            eptr--;
# Line 6086  for (;;) Line 6127  for (;;)
6127                eptr[-1] == CHAR_CR) eptr--;                eptr[-1] == CHAR_CR) eptr--;
6128            }            }
6129          }          }
6130    
6131        /* Get here if we can't make it match with any permitted repetitions */        /* Control never gets here */
   
       RRETURN(MATCH_NOMATCH);  
6132        }        }
     /* Control never gets here */  
6133    
6134      /* There's been some horrible disaster. Arrival here can only mean there is      /* There's been some horrible disaster. Arrival here can only mean there is
6135      something seriously wrong in the code above or the OP_xxx definitions. */      something seriously wrong in the code above or the OP_xxx definitions. */
# Line 6133  switch (frame->Xwhere) Line 6171  switch (frame->Xwhere)
6171    LBL(32) LBL(34) LBL(42) LBL(46)    LBL(32) LBL(34) LBL(42) LBL(46)
6172  #ifdef SUPPORT_UCP  #ifdef SUPPORT_UCP
6173    LBL(36) LBL(37) LBL(38) LBL(39) LBL(40) LBL(41) LBL(44) LBL(45)    LBL(36) LBL(37) LBL(38) LBL(39) LBL(40) LBL(41) LBL(44) LBL(45)
6174    LBL(59) LBL(60) LBL(61) LBL(62) LBL(67)    LBL(59) LBL(60) LBL(61) LBL(62) LBL(67) LBL(68)
6175  #endif  /* SUPPORT_UCP */  #endif  /* SUPPORT_UCP */
6176  #endif  /* SUPPORT_UTF */  #endif  /* SUPPORT_UTF */
6177    default:    default:
# Line 6286  const pcre_uint8 *start_bits = NULL; Line 6324  const pcre_uint8 *start_bits = NULL;
6324  PCRE_PUCHAR start_match = (PCRE_PUCHAR)subject + start_offset;  PCRE_PUCHAR start_match = (PCRE_PUCHAR)subject + start_offset;
6325  PCRE_PUCHAR end_subject;  PCRE_PUCHAR end_subject;
6326  PCRE_PUCHAR start_partial = NULL;  PCRE_PUCHAR start_partial = NULL;
6327    PCRE_PUCHAR match_partial = NULL;
6328  PCRE_PUCHAR req_char_ptr = start_match - 1;  PCRE_PUCHAR req_char_ptr = start_match - 1;
6329    
6330  const pcre_study_data *study;  const pcre_study_data *study;
# Line 6415  md->callout_data = NULL; Line 6454  md->callout_data = NULL;
6454    
6455  tables = re->tables;  tables = re->tables;
6456    
6457    /* The two limit values override the defaults, whatever their value. */
6458    
6459  if (extra_data != NULL)  if (extra_data != NULL)
6460    {    {
6461    register unsigned int flags = extra_data->flags;    register unsigned int flags = extra_data->flags;
# Line 6429  if (extra_data != NULL) Line 6470  if (extra_data != NULL)
6470    if ((flags & PCRE_EXTRA_TABLES) != 0) tables = extra_data->tables;    if ((flags & PCRE_EXTRA_TABLES) != 0) tables = extra_data->tables;
6471    }    }
6472    
6473    /* Limits in the regex override only if they are smaller. */
6474    
6475    if ((re->flags & PCRE_MLSET) != 0 && re->limit_match < md->match_limit)
6476      md->match_limit = re->limit_match;
6477    
6478    if ((re->flags & PCRE_RLSET) != 0 &&
6479        re->limit_recursion < md->match_limit_recursion)
6480      md->match_limit_recursion = re->limit_recursion;
6481    
6482  /* If the exec call supplied NULL for tables, use the inbuilt ones. This  /* If the exec call supplied NULL for tables, use the inbuilt ones. This
6483  is a feature that makes it possible to save compiled regex and re-use them  is a feature that makes it possible to save compiled regex and re-use them
6484  in other programs later. */  in other programs later. */
# Line 6454  end_subject = md->end_subject; Line 6504  end_subject = md->end_subject;
6504  md->endonly = (re->options & PCRE_DOLLAR_ENDONLY) != 0;  md->endonly = (re->options & PCRE_DOLLAR_ENDONLY) != 0;
6505  md->use_ucp = (re->options & PCRE_UCP) != 0;  md->use_ucp = (re->options & PCRE_UCP) != 0;
6506  md->jscript_compat = (re->options & PCRE_JAVASCRIPT_COMPAT) != 0;  md->jscript_compat = (re->options & PCRE_JAVASCRIPT_COMPAT) != 0;
6507  md->ignore_skip_arg = FALSE;  md->ignore_skip_arg = 0;
6508    
6509  /* Some options are unpacked into BOOL variables in the hope that testing  /* Some options are unpacked into BOOL variables in the hope that testing
6510  them will be faster than individual option bits. */  them will be faster than individual option bits. */
# Line 6836  for(;;) Line 6886  for(;;)
6886    md->match_call_count = 0;    md->match_call_count = 0;
6887    md->match_function_type = 0;    md->match_function_type = 0;
6888    md->end_offset_top = 0;    md->end_offset_top = 0;
6889      md->skip_arg_count = 0;
6890    rc = match(start_match, md->start_code, start_match, 2, md, NULL, 0);    rc = match(start_match, md->start_code, start_match, 2, md, NULL, 0);
6891    if (md->hitend && start_partial == NULL) start_partial = md->start_used_ptr;    if (md->hitend && start_partial == NULL)
6892        {
6893        start_partial = md->start_used_ptr;
6894        match_partial = start_match;
6895        }
6896    
6897    switch(rc)    switch(rc)
6898      {      {
# Line 6850  for(;;) Line 6905  for(;;)
6905    
6906      case MATCH_SKIP_ARG:      case MATCH_SKIP_ARG:
6907      new_start_match = start_match;      new_start_match = start_match;
6908      md->ignore_skip_arg = TRUE;      md->ignore_skip_arg = md->skip_arg_count;
6909      break;      break;
6910    
6911      /* SKIP passes back the next starting point explicitly, but if it is the      /* SKIP passes back the next starting point explicitly, but if it is no
6912      same as the match we have just done, treat it as NOMATCH. */      greater than the match we have just done, treat it as NOMATCH. */
6913    
6914      case MATCH_SKIP:      case MATCH_SKIP:
6915      if (md->start_match_ptr != start_match)      if (md->start_match_ptr > start_match)
6916        {        {
6917        new_start_match = md->start_match_ptr;        new_start_match = md->start_match_ptr;
6918        break;        break;
# Line 6865  for(;;) Line 6920  for(;;)
6920      /* Fall through */      /* Fall through */
6921    
6922      /* NOMATCH and PRUNE advance by one character. THEN at this level acts      /* NOMATCH and PRUNE advance by one character. THEN at this level acts
6923      exactly like PRUNE. Unset the ignore SKIP-with-argument flag. */      exactly like PRUNE. Unset ignore SKIP-with-argument. */
6924    
6925      case MATCH_NOMATCH:      case MATCH_NOMATCH:
6926      case MATCH_PRUNE:      case MATCH_PRUNE:
6927      case MATCH_THEN:      case MATCH_THEN:
6928      md->ignore_skip_arg = FALSE;      md->ignore_skip_arg = 0;
6929      new_start_match = start_match + 1;      new_start_match = start_match + 1;
6930  #ifdef SUPPORT_UTF  #ifdef SUPPORT_UTF
6931      if (utf)      if (utf)
# Line 6971  if (rc == MATCH_MATCH || rc == MATCH_ACC Line 7026  if (rc == MATCH_MATCH || rc == MATCH_ACC
7026    /* Set the return code to the number of captured strings, or 0 if there were    /* Set the return code to the number of captured strings, or 0 if there were
7027    too many to fit into the vector. */    too many to fit into the vector. */
7028    
7029    rc = ((md->capture_last & OVFLBIT) != 0 &&    rc = ((md->capture_last & OVFLBIT) != 0 &&
7030           md->end_offset_top >= arg_offset_max)?           md->end_offset_top >= arg_offset_max)?
7031      0 : md->end_offset_top/2;      0 : md->end_offset_top/2;
7032    
# Line 7037  if (rc != MATCH_NOMATCH && rc != PCRE_ER Line 7092  if (rc != MATCH_NOMATCH && rc != PCRE_ER
7092    
7093  /* Handle partial matches - disable any mark data */  /* Handle partial matches - disable any mark data */
7094    
7095  if (start_partial != NULL)  if (match_partial != NULL)
7096    {    {
7097    DPRINTF((">>>> returning PCRE_ERROR_PARTIAL\n"));    DPRINTF((">>>> returning PCRE_ERROR_PARTIAL\n"));
7098    md->mark = NULL;    md->mark = NULL;
# Line 7045  if (start_partial != NULL) Line 7100  if (start_partial != NULL)
7100      {      {
7101      offsets[0] = (int)(start_partial - (PCRE_PUCHAR)subject);      offsets[0] = (int)(start_partial - (PCRE_PUCHAR)subject);
7102      offsets[1] = (int)(end_subject - (PCRE_PUCHAR)subject);      offsets[1] = (int)(end_subject - (PCRE_PUCHAR)subject);
7103        if (offsetcount > 2)
7104          offsets[2] = (int)(match_partial - (PCRE_PUCHAR)subject);
7105      }      }
7106    rc = PCRE_ERROR_PARTIAL;    rc = PCRE_ERROR_PARTIAL;
7107    }    }

Legend:
Removed from v.1248  
changed lines
  Added in v.1365

  ViewVC Help
Powered by ViewVC 1.1.5