/[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 788 by ph10, Tue Dec 6 15:38:01 2011 UTC revision 1379 by ph10, Mon Oct 14 13:54:07 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-2011 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 37  POSSIBILITY OF SUCH DAMAGE. Line 37  POSSIBILITY OF SUCH DAMAGE.
37  -----------------------------------------------------------------------------  -----------------------------------------------------------------------------
38  */  */
39    
   
40  /* This module contains pcre_exec(), the externally visible function that does  /* This module contains pcre_exec(), the externally visible function that does
41  pattern matching using an NFA algorithm, trying to mimic Perl as closely as  pattern matching using an NFA algorithm, trying to mimic Perl as closely as
42  possible. There are also some static supporting functions. */  possible. There are also some static supporting functions. */
# Line 57  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
60    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
62    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
64    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
66    separate set of save/restore instructions. The following defines are used in
67    implementing this. */
68    
69    #define CAPLMASK    0x0000ffff    /* The bits used for last_capture */
70    #define OVFLMASK    0xffff0000    /* The bits used for the overflow flag */
71    #define OVFLBIT     0x00010000    /* The bit that is set for overflow */
72    
73  /* 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
74  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,
75  as stack usage is to be discouraged. */  as stack usage is to be discouraged. */
# Line 74  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 90  because the offset vector is always a mu Line 107  because the offset vector is always a mu
107    
108  /* Min and max values for the common repeats; for the maxima, 0 => infinity */  /* Min and max values for the common repeats; for the maxima, 0 => infinity */
109    
110  static const char rep_min[] = { 0, 0, 1, 1, 0, 0 };  static const char rep_min[] = { 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, };
111  static const char rep_max[] = { 0, 0, 0, 0, 1, 1 };  static const char rep_max[] = { 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, };
   
   
112    
113  #ifdef PCRE_DEBUG  #ifdef PCRE_DEBUG
114  /*************************************************  /*************************************************
# Line 113  Returns:     nothing Line 128  Returns:     nothing
128  */  */
129    
130  static void  static void
131  pchars(const uschar *p, int length, BOOL is_subject, match_data *md)  pchars(const pcre_uchar *p, int length, BOOL is_subject, match_data *md)
132  {  {
133  unsigned int c;  pcre_uint32 c;
134    BOOL utf = md->utf;
135  if (is_subject && length > md->end_subject - p) length = md->end_subject - p;  if (is_subject && length > md->end_subject - p) length = md->end_subject - p;
136  while (length-- > 0)  while (length-- > 0)
137    if (isprint(c = *(p++))) printf("%c", c); else printf("\\x%02x", c);    if (isprint(c = RAWUCHARINCTEST(p))) printf("%c", (char)c); else printf("\\x{%02x}", c);
138  }  }
139  #endif  #endif
140    
# Line 140  Arguments: Line 156  Arguments:
156    md          points to match data block    md          points to match data block
157    caseless    TRUE if caseless    caseless    TRUE if caseless
158    
159  Returns:      < 0 if not matched, otherwise the number of subject bytes matched  Returns:      >= 0 the number of subject bytes matched
160                  -1 no match
161                  -2 partial match; always given if at end subject
162  */  */
163    
164  static int  static int
165  match_ref(int offset, register USPTR eptr, int length, match_data *md,  match_ref(int offset, register PCRE_PUCHAR eptr, int length, match_data *md,
166    BOOL caseless)    BOOL caseless)
167  {  {
168  USPTR eptr_start = eptr;  PCRE_PUCHAR eptr_start = eptr;
169  register USPTR p = md->start_subject + md->offset_vector[offset];  register PCRE_PUCHAR p = md->start_subject + md->offset_vector[offset];
170    #ifdef SUPPORT_UTF
171    BOOL utf = md->utf;
172    #endif
173    
174  #ifdef PCRE_DEBUG  #ifdef PCRE_DEBUG
175  if (eptr >= md->end_subject)  if (eptr >= md->end_subject)
# Line 163  pchars(p, length, FALSE, md); Line 184  pchars(p, length, FALSE, md);
184  printf("\n");  printf("\n");
185  #endif  #endif
186    
187  /* Always fail if reference not set (and not JavaScript compatible). */  /* Always fail if reference not set (and not JavaScript compatible - in that
188    case the length is passed as zero). */
189    
190  if (length < 0) return -1;  if (length < 0) return -1;
191    
# Line 173  ASCII characters. */ Line 195  ASCII characters. */
195    
196  if (caseless)  if (caseless)
197    {    {
198  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF
199  #ifdef SUPPORT_UCP  #ifdef SUPPORT_UCP
200    if (md->utf8)    if (utf)
201      {      {
202      /* 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
203      bytes matched may differ, because there are some characters whose upper and      data units matched may differ, because in UTF-8 there are some characters
204      lower case versions code as different numbers of bytes. For example, U+023A      whose upper and lower case versions code have different numbers of bytes.
205      (2 bytes in UTF-8) is the upper case version of U+2C65 (3 bytes in UTF-8);      For example, U+023A (2 bytes in UTF-8) is the upper case version of U+2C65
206      a sequence of 3 of the former uses 6 bytes, as does a sequence of two of      (3 bytes in UTF-8); a sequence of 3 of the former uses 6 bytes, as does a
207      the latter. It is important, therefore, to check the length along the      sequence of two of the latter. It is important, therefore, to check the
208      reference, not along the subject (earlier code did this wrong). */      length along the reference, not along the subject (earlier code did this
209        wrong). */
210    
211      USPTR endptr = p + length;      PCRE_PUCHAR endptr = p + length;
212      while (p < endptr)      while (p < endptr)
213        {        {
214        int c, d;        pcre_uint32 c, d;
215        if (eptr >= md->end_subject) return -1;        const ucd_record *ur;
216          if (eptr >= md->end_subject) return -2;   /* Partial match */
217        GETCHARINC(c, eptr);        GETCHARINC(c, eptr);
218        GETCHARINC(d, p);        GETCHARINC(d, p);
219        if (c != d && c != UCD_OTHERCASE(d)) return -1;        ur = GET_UCD(d);
220          if (c != d && c != d + ur->other_case)
221            {
222            const pcre_uint32 *pp = PRIV(ucd_caseless_sets) + ur->caseset;
223            for (;;)
224              {
225              if (c < *pp) return -1;
226              if (c == *pp++) break;
227              }
228            }
229        }        }
230      }      }
231    else    else
# Line 202  if (caseless) Line 235  if (caseless)
235    /* 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
236    is no UCP support. */    is no UCP support. */
237      {      {
     if (eptr + length > md->end_subject) return -1;  
238      while (length-- > 0)      while (length-- > 0)
239        { if (md->lcc[*p++] != md->lcc[*eptr++]) return -1; }        {
240          pcre_uint32 cc, cp;
241          if (eptr >= md->end_subject) return -2;   /* Partial match */
242          cc = RAWUCHARTEST(eptr);
243          cp = RAWUCHARTEST(p);
244          if (TABLE_GET(cp, md->lcc, cp) != TABLE_GET(cc, md->lcc, cc)) return -1;
245          p++;
246          eptr++;
247          }
248      }      }
249    }    }
250    
# Line 213  are in UTF-8 mode. */ Line 253  are in UTF-8 mode. */
253    
254  else  else
255    {    {
256    if (eptr + length > md->end_subject) return -1;    while (length-- > 0)
257    while (length-- > 0) if (*p++ != *eptr++) return -1;      {
258        if (eptr >= md->end_subject) return -2;   /* Partial match */
259        if (RAWUCHARINCTEST(p) != RAWUCHARINCTEST(eptr)) return -1;
260        }
261    }    }
262    
263  return (int)(eptr - eptr_start);  return (int)(eptr - eptr_start);
# Line 269  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 };         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 287  actually used in this definition. */ Line 330  actually used in this definition. */
330    }    }
331  #define RRETURN(ra) \  #define RRETURN(ra) \
332    { \    { \
333    printf("match() returned %d from line %d ", ra, __LINE__); \    printf("match() returned %d from line %d\n", ra, __LINE__); \
334    return ra; \    return ra; \
335    }    }
336  #else  #else
# Line 307  argument of match(), which never changes Line 350  argument of match(), which never changes
350    
351  #define RMATCH(ra,rb,rc,rd,re,rw)\  #define RMATCH(ra,rb,rc,rd,re,rw)\
352    {\    {\
353    heapframe *newframe = (heapframe *)(pcre_stack_malloc)(sizeof(heapframe));\    heapframe *newframe = frame->Xnextframe;\
354    if (newframe == NULL) RRETURN(PCRE_ERROR_NOMEMORY);\    if (newframe == NULL)\
355    frame->Xwhere = rw; \      {\
356        newframe = (heapframe *)(PUBL(stack_malloc))(sizeof(heapframe));\
357        if (newframe == NULL) RRETURN(PCRE_ERROR_NOMEMORY);\
358        newframe->Xnextframe = NULL;\
359        frame->Xnextframe = newframe;\
360        }\
361      frame->Xwhere = rw;\
362    newframe->Xeptr = ra;\    newframe->Xeptr = ra;\
363    newframe->Xecode = rb;\    newframe->Xecode = rb;\
364    newframe->Xmstart = mstart;\    newframe->Xmstart = mstart;\
# Line 328  argument of match(), which never changes Line 377  argument of match(), which never changes
377    {\    {\
378    heapframe *oldframe = frame;\    heapframe *oldframe = frame;\
379    frame = oldframe->Xprevframe;\    frame = oldframe->Xprevframe;\
   (pcre_stack_free)(oldframe);\  
380    if (frame != NULL)\    if (frame != NULL)\
381      {\      {\
382      rrc = ra;\      rrc = ra;\
# Line 342  argument of match(), which never changes Line 390  argument of match(), which never changes
390    
391  typedef struct heapframe {  typedef struct heapframe {
392    struct heapframe *Xprevframe;    struct heapframe *Xprevframe;
393      struct heapframe *Xnextframe;
394    
395    /* Function arguments that may change */    /* Function arguments that may change */
396    
397    USPTR Xeptr;    PCRE_PUCHAR Xeptr;
398    const uschar *Xecode;    const pcre_uchar *Xecode;
399    USPTR Xmstart;    PCRE_PUCHAR Xmstart;
400    int Xoffset_top;    int Xoffset_top;
401    eptrblock *Xeptrb;    eptrblock *Xeptrb;
402    unsigned int Xrdepth;    unsigned int Xrdepth;
403    
404    /* Function local variables */    /* Function local variables */
405    
406    USPTR Xcallpat;    PCRE_PUCHAR Xcallpat;
407  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF
408    USPTR Xcharptr;    PCRE_PUCHAR Xcharptr;
409  #endif  #endif
410    USPTR Xdata;    PCRE_PUCHAR Xdata;
411    USPTR Xnext;    PCRE_PUCHAR Xnext;
412    USPTR Xpp;    PCRE_PUCHAR Xpp;
413    USPTR Xprev;    PCRE_PUCHAR Xprev;
414    USPTR Xsaved_eptr;    PCRE_PUCHAR Xsaved_eptr;
415    
416    recursion_info Xnew_recursive;    recursion_info Xnew_recursive;
417    
# Line 372  typedef struct heapframe { Line 421  typedef struct heapframe {
421    
422  #ifdef SUPPORT_UCP  #ifdef SUPPORT_UCP
423    int Xprop_type;    int Xprop_type;
424    int Xprop_value;    unsigned int Xprop_value;
425    int Xprop_fail_result;    int Xprop_fail_result;
426    int Xoclength;    int Xoclength;
427    uschar Xocchars[8];    pcre_uchar Xocchars[6];
428  #endif  #endif
429    
430    int Xcodelink;    int Xcodelink;
# Line 385  typedef struct heapframe { Line 434  typedef struct heapframe {
434    int Xlength;    int Xlength;
435    int Xmax;    int Xmax;
436    int Xmin;    int Xmin;
437    int Xnumber;    unsigned int Xnumber;
438    int Xoffset;    int Xoffset;
439    int Xop;    unsigned int Xop;
440    int Xsave_capture_last;    pcre_int32 Xsave_capture_last;
441    int Xsave_offset1, Xsave_offset2, Xsave_offset3;    int Xsave_offset1, Xsave_offset2, Xsave_offset3;
442    int Xstacksave[REC_STACK_SAVE_MAX];    int Xstacksave[REC_STACK_SAVE_MAX];
443    
# Line 440  the subject. */ Line 489  the subject. */
489    
490    
491  /* Performance note: It might be tempting to extract commonly used fields from  /* Performance note: It might be tempting to extract commonly used fields from
492  the md structure (e.g. utf8, end_subject) into individual variables to improve  the md structure (e.g. utf, end_subject) into individual variables to improve
493  performance. Tests using gcc on a SPARC disproved this; in the first case, it  performance. Tests using gcc on a SPARC disproved this; in the first case, it
494  made performance worse.  made performance worse.
495    
# Line 463  Returns:       MATCH_MATCH if matched Line 512  Returns:       MATCH_MATCH if matched
512  */  */
513    
514  static int  static int
515  match(REGISTER USPTR eptr, REGISTER const uschar *ecode, USPTR mstart,  match(REGISTER PCRE_PUCHAR eptr, REGISTER const pcre_uchar *ecode,
516    int offset_top, match_data *md, eptrblock *eptrb, unsigned int rdepth)    PCRE_PUCHAR mstart, int offset_top, match_data *md, eptrblock *eptrb,
517      unsigned int rdepth)
518  {  {
519  /* 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,
520  so they can be ordinary variables in all cases. Mark some of them with  so they can be ordinary variables in all cases. Mark some of them with
# Line 472  so they can be ordinary variables in all Line 522  so they can be ordinary variables in all
522    
523  register int  rrc;         /* Returns from recursive calls */  register int  rrc;         /* Returns from recursive calls */
524  register int  i;           /* Used for loops not involving calls to RMATCH() */  register int  i;           /* Used for loops not involving calls to RMATCH() */
525  register unsigned int c;   /* Character values not kept over RMATCH() calls */  register pcre_uint32 c;    /* Character values not kept over RMATCH() calls */
526  register BOOL utf8;        /* Local copy of UTF-8 flag for speed */  register BOOL utf;         /* Local copy of UTF flag for speed */
527    
528  BOOL minimize, possessive; /* Quantifier options */  BOOL minimize, possessive; /* Quantifier options */
529  BOOL caseless;  BOOL caseless;
530  int condcode;  int condcode;
531    
532  /* When recursion is not being used, all "local" variables that have to be  /* When recursion is not being used, all "local" variables that have to be
533  preserved over calls to RMATCH() are part of a "frame" which is obtained from  preserved over calls to RMATCH() are part of a "frame". We set up the top-level
534  heap storage. Set up the top-level frame here; others are obtained from the  frame on the stack here; subsequent instantiations are obtained from the heap
535  heap whenever RMATCH() does a "recursion". See the macro definitions above. */  whenever RMATCH() does a "recursion". See the macro definitions above. Putting
536    the top-level on the stack rather than malloc-ing them all gives a performance
537    boost in many cases where there is not much "recursion". */
538    
539  #ifdef NO_RECURSE  #ifdef NO_RECURSE
540  heapframe *frame = (heapframe *)(pcre_stack_malloc)(sizeof(heapframe));  heapframe *frame = (heapframe *)md->match_frames_base;
 if (frame == NULL) RRETURN(PCRE_ERROR_NOMEMORY);  
 frame->Xprevframe = NULL;            /* Marks the top level */  
541    
542  /* Copy in the original argument variables */  /* Copy in the original argument variables */
543    
# Line 513  HEAP_RECURSE: Line 563  HEAP_RECURSE:
563    
564  /* Ditto for the local variables */  /* Ditto for the local variables */
565    
566  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF
567  #define charptr            frame->Xcharptr  #define charptr            frame->Xcharptr
568  #endif  #endif
569  #define callpat            frame->Xcallpat  #define callpat            frame->Xcallpat
# Line 571  declarations can be cut out in a block. Line 621  declarations can be cut out in a block.
621  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
622  to RMATCH(). */  to RMATCH(). */
623    
624  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF
625  const uschar *charptr;  const pcre_uchar *charptr;
626  #endif  #endif
627  const uschar *callpat;  const pcre_uchar *callpat;
628  const uschar *data;  const pcre_uchar *data;
629  const uschar *next;  const pcre_uchar *next;
630  USPTR         pp;  PCRE_PUCHAR       pp;
631  const uschar *prev;  const pcre_uchar *prev;
632  USPTR         saved_eptr;  PCRE_PUCHAR       saved_eptr;
633    
634  recursion_info new_recursive;  recursion_info new_recursive;
635    
# Line 589  BOOL prev_is_word; Line 639  BOOL prev_is_word;
639    
640  #ifdef SUPPORT_UCP  #ifdef SUPPORT_UCP
641  int prop_type;  int prop_type;
642  int prop_value;  unsigned int prop_value;
643  int prop_fail_result;  int prop_fail_result;
644  int oclength;  int oclength;
645  uschar occhars[8];  pcre_uchar occhars[6];
646  #endif  #endif
647    
648  int codelink;  int codelink;
# Line 600  int ctype; Line 650  int ctype;
650  int length;  int length;
651  int max;  int max;
652  int min;  int min;
653  int number;  unsigned int number;
654  int offset;  int offset;
655  int op;  unsigned int op;
656  int save_capture_last;  pcre_int32 save_capture_last;
657  int save_offset1, save_offset2, save_offset3;  int save_offset1, save_offset2, save_offset3;
658  int stacksave[REC_STACK_SAVE_MAX];  int stacksave[REC_STACK_SAVE_MAX];
659    
660  eptrblock newptrb;  eptrblock newptrb;
661    
662    /* There is a special fudge for calling match() in a way that causes it to
663    measure the size of its basic stack frame when the stack is being used for
664    recursion. The second argument (ecode) being NULL triggers this behaviour. It
665    cannot normally ever be NULL. The return is the negated value of the frame
666    size. */
667    
668    if (ecode == NULL)
669      {
670      if (rdepth == 0)
671        return match((PCRE_PUCHAR)&rdepth, NULL, NULL, 0, NULL, NULL, 1);
672      else
673        {
674        int len = (char *)&rdepth - (char *)eptr;
675        return (len > 0)? -len : len;
676        }
677      }
678  #endif     /* NO_RECURSE */  #endif     /* NO_RECURSE */
679    
680  /* 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
# Line 620  the alternative names that are used. */ Line 687  the alternative names that are used. */
687  #define code_offset   codelink  #define code_offset   codelink
688  #define condassert    condition  #define condassert    condition
689  #define matched_once  prev_is_word  #define matched_once  prev_is_word
690    #define foc           number
691    #define save_mark     data
692    
693  /* These statements are here to stop the compiler complaining about unitialized  /* These statements are here to stop the compiler complaining about unitialized
694  variables. */  variables. */
# Line 645  defined). However, RMATCH isn't like a f Line 714  defined). However, RMATCH isn't like a f
714  complicated macro. It has to be used in one particular way. This shouldn't,  complicated macro. It has to be used in one particular way. This shouldn't,
715  however, impact performance when true recursion is being used. */  however, impact performance when true recursion is being used. */
716    
717  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF
718  utf8 = md->utf8;       /* Local copy of the flag */  utf = md->utf;       /* Local copy of the flag */
719  #else  #else
720  utf8 = FALSE;  utf = FALSE;
721  #endif  #endif
722    
723  /* First check that we haven't called match() too many times, or that we  /* First check that we haven't called match() too many times, or that we
# Line 689  for (;;) Line 758  for (;;)
758      case OP_MARK:      case OP_MARK:
759      md->nomatch_mark = ecode + 2;      md->nomatch_mark = ecode + 2;
760      md->mark = NULL;    /* In case previously set by assertion */      md->mark = NULL;    /* In case previously set by assertion */
761      RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode] + ecode[1], offset_top, md,      RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode] + ecode[1], offset_top, md,
762        eptrb, RM55);        eptrb, RM55);
763      if ((rrc == MATCH_MATCH || rrc == MATCH_ACCEPT) &&      if ((rrc == MATCH_MATCH || rrc == MATCH_ACCEPT) &&
764           md->mark == NULL) md->mark = ecode + 2;           md->mark == NULL) md->mark = ecode + 2;
# Line 702  for (;;) Line 771  for (;;)
771      unaltered. */      unaltered. */
772    
773      else if (rrc == MATCH_SKIP_ARG &&      else if (rrc == MATCH_SKIP_ARG &&
774          strcmp((char *)(ecode + 2), (char *)(md->start_match_ptr)) == 0)          STRCMP_UC_UC_TEST(ecode + 2, md->start_match_ptr) == 0)
775        {        {
776        md->start_match_ptr = eptr;        md->start_match_ptr = eptr;
777        RRETURN(MATCH_SKIP);        RRETURN(MATCH_SKIP);
# Line 712  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 + _pcre_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 + _pcre_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:
797      md->nomatch_mark = ecode + 2;      md->nomatch_mark = ecode + 2;
798      md->mark = NULL;    /* In case previously set by assertion */      md->mark = NULL;    /* In case previously set by assertion */
799      RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode] + ecode[1], offset_top, md,      RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode] + ecode[1], offset_top, md,
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 + _pcre_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 += _pcre_OP_lengths[*ecode] + ecode[1];        ecode += PRIV(OP_lengths)[*ecode] + ecode[1];
826        break;        break;
827        }        }
828      RMATCH(eptr, ecode + _pcre_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 779  for (;;) Line 842  for (;;)
842      match pointer to do this. */      match pointer to do this. */
843    
844      case OP_THEN:      case OP_THEN:
845      RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md,      RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode], offset_top, md,
846        eptrb, RM54);        eptrb, RM54);
847      if (rrc != MATCH_NOMATCH) RRETURN(rrc);      if (rrc != MATCH_NOMATCH) RRETURN(rrc);
848      md->start_match_ptr = ecode;      md->start_match_ptr = ecode;
# Line 788  for (;;) Line 851  for (;;)
851      case OP_THEN_ARG:      case OP_THEN_ARG:
852      md->nomatch_mark = ecode + 2;      md->nomatch_mark = ecode + 2;
853      md->mark = NULL;    /* In case previously set by assertion */      md->mark = NULL;    /* In case previously set by assertion */
854      RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode] + ecode[1], offset_top,      RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode] + ecode[1], offset_top,
855        md, eptrb, RM58);        md, eptrb, RM58);
856      if ((rrc == MATCH_MATCH || rrc == MATCH_ACCEPT) &&      if ((rrc == MATCH_MATCH || rrc == MATCH_ACCEPT) &&
857           md->mark == NULL) md->mark = ecode + 2;           md->mark == NULL) md->mark = ecode + 2;
# Line 812  for (;;) Line 875  for (;;)
875      case OP_ONCE_NC:      case OP_ONCE_NC:
876      prev = ecode;      prev = ecode;
877      saved_eptr = eptr;      saved_eptr = eptr;
878        save_mark = md->mark;
879      do      do
880        {        {
881        RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, eptrb, RM64);        RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, eptrb, RM64);
# Line 830  for (;;) Line 894  for (;;)
894    
895        if (rrc != MATCH_NOMATCH) RRETURN(rrc);        if (rrc != MATCH_NOMATCH) RRETURN(rrc);
896        ecode += GET(ecode,1);        ecode += GET(ecode,1);
897          md->mark = save_mark;
898        }        }
899      while (*ecode == OP_ALT);      while (*ecode == OP_ALT);
900    
# Line 869  for (;;) Line 934  for (;;)
934        }        }
935      else  /* OP_KETRMAX */      else  /* OP_KETRMAX */
936        {        {
       md->match_function_type = MATCH_CBEGROUP;  
937        RMATCH(eptr, prev, offset_top, md, eptrb, RM66);        RMATCH(eptr, prev, offset_top, md, eptrb, RM66);
938        if (rrc != MATCH_NOMATCH) RRETURN(rrc);        if (rrc != MATCH_NOMATCH) RRETURN(rrc);
939        ecode += 1 + LINK_SIZE;        ecode += 1 + LINK_SIZE;
# Line 909  for (;;) Line 973  for (;;)
973        save_offset2 = md->offset_vector[offset+1];        save_offset2 = md->offset_vector[offset+1];
974        save_offset3 = md->offset_vector[md->offset_end - number];        save_offset3 = md->offset_vector[md->offset_end - number];
975        save_capture_last = md->capture_last;        save_capture_last = md->capture_last;
976          save_mark = md->mark;
977    
978        DPRINTF(("saving %d %d %d\n", save_offset1, save_offset2, save_offset3));        DPRINTF(("saving %d %d %d\n", save_offset1, save_offset2, save_offset3));
979        md->offset_vector[md->offset_end - number] =        md->offset_vector[md->offset_end - number] =
# Line 917  for (;;) Line 982  for (;;)
982        for (;;)        for (;;)
983          {          {
984          if (op >= OP_SBRA) md->match_function_type = MATCH_CBEGROUP;          if (op >= OP_SBRA) md->match_function_type = MATCH_CBEGROUP;
985          RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md,          RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode], offset_top, md,
986            eptrb, RM1);            eptrb, RM1);
987          if (rrc == MATCH_ONCE) break;  /* Backing up through an atomic group */          if (rrc == MATCH_ONCE) break;  /* Backing up through an atomic group */
988    
# Line 945  for (;;) Line 1010  for (;;)
1010          if (rrc != MATCH_NOMATCH) RRETURN(rrc);          if (rrc != MATCH_NOMATCH) RRETURN(rrc);
1011          md->capture_last = save_capture_last;          md->capture_last = save_capture_last;
1012          ecode += GET(ecode, 1);          ecode += GET(ecode, 1);
1013            md->mark = save_mark;
1014          if (*ecode != OP_ALT) break;          if (*ecode != OP_ALT) break;
1015          }          }
1016    
# Line 996  for (;;) Line 1062  for (;;)
1062    
1063      for (;;)      for (;;)
1064        {        {
1065        if (op >= OP_SBRA || op == OP_ONCE) md->match_function_type = MATCH_CBEGROUP;        if (op >= OP_SBRA || op == OP_ONCE)
1066            md->match_function_type = MATCH_CBEGROUP;
1067    
1068        /* If this is not a possibly empty group, and there are no (*THEN)s in        /* If this is not a possibly empty group, and there are no (*THEN)s in
1069        the pattern, and this is the final alternative, optimize as described        the pattern, and this is the final alternative, optimize as described
# Line 1004  for (;;) Line 1071  for (;;)
1071    
1072        else if (!md->hasthen && ecode[GET(ecode, 1)] != OP_ALT)        else if (!md->hasthen && ecode[GET(ecode, 1)] != OP_ALT)
1073          {          {
1074          ecode += _pcre_OP_lengths[*ecode];          ecode += PRIV(OP_lengths)[*ecode];
1075          goto TAIL_RECURSE;          goto TAIL_RECURSE;
1076          }          }
1077    
1078        /* In all other cases, we have to make another call to match(). */        /* In all other cases, we have to make another call to match(). */
1079    
1080        RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, eptrb,        save_mark = md->mark;
1081          save_capture_last = md->capture_last;
1082          RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode], offset_top, md, eptrb,
1083          RM2);          RM2);
1084    
1085        /* See comment in the code for capturing groups above about handling        /* See comment in the code for capturing groups above about handling
# Line 1028  for (;;) Line 1097  for (;;)
1097          {          {
1098          if (rrc == MATCH_ONCE)          if (rrc == MATCH_ONCE)
1099            {            {
1100            const uschar *scode = ecode;            const pcre_uchar *scode = ecode;
1101            if (*scode != OP_ONCE)           /* If not at start, find it */            if (*scode != OP_ONCE)           /* If not at start, find it */
1102              {              {
1103              while (*scode == OP_ALT) scode += GET(scode, 1);              while (*scode == OP_ALT) scode += GET(scode, 1);
# Line 1039  for (;;) Line 1108  for (;;)
1108          RRETURN(rrc);          RRETURN(rrc);
1109          }          }
1110        ecode += GET(ecode, 1);        ecode += GET(ecode, 1);
1111          md->mark = save_mark;
1112        if (*ecode != OP_ALT) break;        if (*ecode != OP_ALT) break;
1113          md->capture_last = save_capture_last;
1114        }        }
1115    
1116      RRETURN(MATCH_NOMATCH);      RRETURN(MATCH_NOMATCH);
# Line 1093  for (;;) Line 1164  for (;;)
1164          md->offset_vector[md->offset_end - number] =          md->offset_vector[md->offset_end - number] =
1165            (int)(eptr - md->start_subject);            (int)(eptr - md->start_subject);
1166          if (op >= OP_SBRA) md->match_function_type = MATCH_CBEGROUP;          if (op >= OP_SBRA) md->match_function_type = MATCH_CBEGROUP;
1167          RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md,          RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode], offset_top, md,
1168            eptrb, RM63);            eptrb, RM63);
1169          if (rrc == MATCH_KETRPOS)          if (rrc == MATCH_KETRPOS)
1170            {            {
# Line 1161  for (;;) Line 1232  for (;;)
1232      POSSESSIVE_NON_CAPTURE:      POSSESSIVE_NON_CAPTURE:
1233      matched_once = FALSE;      matched_once = FALSE;
1234      code_offset = (int)(ecode - md->start_code);      code_offset = (int)(ecode - md->start_code);
1235        save_capture_last = md->capture_last;
1236    
1237      for (;;)      for (;;)
1238        {        {
1239        if (op >= OP_SBRA) md->match_function_type = MATCH_CBEGROUP;        if (op >= OP_SBRA) md->match_function_type = MATCH_CBEGROUP;
1240        RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md,        RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode], offset_top, md,
1241          eptrb, RM48);          eptrb, RM48);
1242        if (rrc == MATCH_KETRPOS)        if (rrc == MATCH_KETRPOS)
1243          {          {
# Line 1190  for (;;) Line 1262  for (;;)
1262        if (rrc != MATCH_NOMATCH) RRETURN(rrc);        if (rrc != MATCH_NOMATCH) RRETURN(rrc);
1263        ecode += GET(ecode, 1);        ecode += GET(ecode, 1);
1264        if (*ecode != OP_ALT) break;        if (*ecode != OP_ALT) break;
1265          md->capture_last = save_capture_last;
1266        }        }
1267    
1268      if (matched_once || allow_zero)      if (matched_once || allow_zero)
# Line 1201  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 (pcre_callout != NULL)        if (PUBL(callout) != NULL)
1299          {          {
1300          pcre_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
1305          cb.subject          = (PCRE_SPTR)md->start_subject;          cb.subject          = (PCRE_SPTR)md->start_subject;
1306    #elif defined COMPILE_PCRE16
1307            cb.subject          = (PCRE_SPTR16)md->start_subject;
1308    #elif defined COMPILE_PCRE32
1309            cb.subject          = (PCRE_SPTR32)md->start_subject;
1310    #endif
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;          cb.capture_last     = md->capture_last & CAPLMASK;
1318            /* Internal change requires this for API compatibility. */
1319            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 = (*pcre_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          }          }
       ecode += _pcre_OP_lengths[OP_CALLOUT];  
       }  
1325    
1326      condcode = ecode[LINK_SIZE+1];        /* 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      /* Now see what the actual condition is */        ecode += PRIV(OP_lengths)[OP_CALLOUT];
1330          codelink -= PRIV(OP_lengths)[OP_CALLOUT];
1331          }
1332    
1333        /* Test the various possible conditions */
1334    
1335      if (condcode == OP_RREF || condcode == OP_NRREF)    /* Recursion test */      condition = FALSE;
1336        switch(condcode = *ecode)
1337        {        {
1338        if (md->recursive == NULL)                /* Not recursing => FALSE */        case OP_RREF:         /* Numbered group recursion test */
1339          {        if (md->recursive != NULL)     /* Not recursing => FALSE */
         condition = FALSE;  
         ecode += GET(ecode, 1);  
         }  
       else  
1340          {          {
1341          int recno = GET2(ecode, LINK_SIZE + 2);   /* Recursion group number*/          unsigned int recno = GET2(ecode, 1);   /* 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            uschar *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)  
             {  
             uschar *slotB = slotA;  
             while (slotB > md->name_table)  
               {  
               slotB -= md->name_entry_size;  
               if (strcmp((char *)slotA + 2, (char *)slotB + 2) == 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((char *)slotA + 2, (char *)slotB + 2) == 0)  
                   {  
                   condition = GET2(slotB, 0) == md->recursive->group_num;  
                   if (condition) break;  
                   }  
                 else break;  
                 }  
               }  
             }  
1357            }            }
   
         /* Chose branch according to the condition */  
   
         ecode += condition? 3 : GET(ecode, 1);  
1358          }          }
1359        }        break;
1360    
1361      else if (condcode == OP_CREF || condcode == OP_NCREF)  /* Group used test */        case OP_CREF:         /* Numbered group used test */
1362        {        offset = GET2(ecode, 1) << 1;  /* Doubled ref number */
       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          int refno = offset >> 1;          int count = GET2(ecode, 1 + IMM2_SIZE);
1369          uschar *slotA = md->name_table;          pcre_uchar *slot = md->name_table + GET2(ecode, 1) * md->name_entry_size;
1370            while (count-- > 0)
1371          for (i = 0; i < md->name_count; i++)            {
1372            {            offset = GET2(slot, 0) << 1;
1373            if (GET2(slotA, 0) == refno) break;            condition = offset < offset_top && md->offset_vector[offset] >= 0;
1374            slotA += md->name_entry_size;            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)  
           {  
           uschar *slotB = slotA;  
           while (slotB > md->name_table)  
             {  
             slotB -= md->name_entry_size;  
             if (strcmp((char *)slotA + 2, (char *)slotB + 2) == 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((char *)slotA + 2, (char *)slotB + 2) == 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? 3 : GET(ecode, 1);  
       }  
   
     else if (condcode == OP_DEF)     /* DEFINE - always false */  
       {  
       condition = FALSE;  
       ecode += GET(ecode, 1);  
       }  
1382    
1383      /* The condition is an assertion. Call match() to evaluate it - setting        /* 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 of        md->match_function_type to MATCH_CONDASSERT causes it to stop at the end
1385      an assertion. */        of an assertion. */
1386    
1387      else        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;
     call to match() is always required, unless the second alternative doesn't  
     exist, in which case we can just plough on. Note that, for compatibility  
     with Perl, the | in a conditional group is NOT treated as creating two  
     alternatives. If a THEN is encountered in the branch, it propagates out to  
     the enclosing alternative (unless nested in a deeper set of alternatives,  
     of course). */  
1418    
1419      if (condition || *ecode == OP_ALT)      /* We are now at the branch that is to be obeyed. As there is only one, we
1420        can use tail recursion to avoid using another stack frame, except when
1421        there is unlimited repeat of a possibly empty group. In the latter case, a
1422        recursive call to match() is always required, unless the second alternative
1423        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        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 1441  for (;;) Line 1442  for (;;)
1442    
1443      else      else
1444        {        {
       ecode += 1 + LINK_SIZE;  
1445        }        }
1446      break;      break;
1447    
# Line 1450  for (;;) Line 1450  for (;;)
1450      to close any currently open capturing brackets. */      to close any currently open capturing brackets. */
1451    
1452      case OP_CLOSE:      case OP_CLOSE:
1453      number = GET2(ecode, 1);      number = GET2(ecode, 1);   /* Must be less than 65536 */
1454      offset = number << 1;      offset = number << 1;
1455    
1456  #ifdef PCRE_DEBUG  #ifdef PCRE_DEBUG
# Line 1458  for (;;) Line 1458  for (;;)
1458        printf("\n");        printf("\n");
1459  #endif  #endif
1460    
1461      md->capture_last = number;      md->capture_last = (md->capture_last & OVFLMASK) | number;
1462      if (offset >= md->offset_max) md->offset_overflow = TRUE; else      if (offset >= md->offset_max) md->capture_last |= OVFLBIT; else
1463        {        {
1464        md->offset_vector[offset] =        md->offset_vector[offset] =
1465          md->offset_vector[md->offset_end - number];          md->offset_vector[md->offset_end - number];
1466        md->offset_vector[offset+1] = (int)(eptr - md->start_subject);        md->offset_vector[offset+1] = (int)(eptr - md->start_subject);
1467        if (offset_top <= offset) offset_top = offset + 2;        if (offset_top <= offset) offset_top = offset + 2;
1468        }        }
1469      ecode += 3;      ecode += 1 + IMM2_SIZE;
1470      break;      break;
1471    
1472    
# Line 1513  for (;;) Line 1513  for (;;)
1513    
1514      case OP_ASSERT:      case OP_ASSERT:
1515      case OP_ASSERTBACK:      case OP_ASSERTBACK:
1516        save_mark = md->mark;
1517      if (md->match_function_type == MATCH_CONDASSERT)      if (md->match_function_type == MATCH_CONDASSERT)
1518        {        {
1519        condassert = TRUE;        condassert = TRUE;
# Line 1520  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        /* PCRE does not allow THEN to escape beyond an assertion; it is treated        /* If not matched, restore the previous mark setting. */
1540        as NOMATCH. */  
1541          md->mark = save_mark;
1542    
1543          /* See comment in the code for capturing groups above about handling
1544          THEN. */
1545    
1546          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          /* Anything other than NOMATCH causes the entire assertion to fail,
1555          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 1543  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:
1587        save_mark = md->mark;
1588      if (md->match_function_type == MATCH_CONDASSERT)      if (md->match_function_type == MATCH_CONDASSERT)
1589        {        {
1590        condassert = TRUE;        condassert = TRUE;
# Line 1564  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        if (rrc == MATCH_MATCH || rrc == MATCH_ACCEPT) RRETURN(MATCH_NOMATCH);        md->mark = save_mark;   /* Always restore the mark setting */
1601        if (rrc == MATCH_SKIP || rrc == MATCH_PRUNE || rrc == MATCH_COMMIT)  
1602          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 1593  for (;;) Line 1658  for (;;)
1658      back a number of characters, not bytes. */      back a number of characters, not bytes. */
1659    
1660      case OP_REVERSE:      case OP_REVERSE:
1661  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF
1662      if (utf8)      if (utf)
1663        {        {
1664        i = GET(ecode, 1);        i = GET(ecode, 1);
1665        while (i-- > 0)        while (i-- > 0)
# Line 1625  for (;;) Line 1690  for (;;)
1690      function is able to force a failure. */      function is able to force a failure. */
1691    
1692      case OP_CALLOUT:      case OP_CALLOUT:
1693      if (pcre_callout != NULL)      if (PUBL(callout) != NULL)
1694        {        {
1695        pcre_callout_block cb;        PUBL(callout_block) cb;
1696        cb.version          = 2;   /* Version 1 of the callout block */        cb.version          = 2;   /* Version 1 of the callout block */
1697        cb.callout_number   = ecode[1];        cb.callout_number   = ecode[1];
1698        cb.offset_vector    = md->offset_vector;        cb.offset_vector    = md->offset_vector;
1699    #if defined COMPILE_PCRE8
1700        cb.subject          = (PCRE_SPTR)md->start_subject;        cb.subject          = (PCRE_SPTR)md->start_subject;
1701    #elif defined COMPILE_PCRE16
1702          cb.subject          = (PCRE_SPTR16)md->start_subject;
1703    #elif defined COMPILE_PCRE32
1704          cb.subject          = (PCRE_SPTR32)md->start_subject;
1705    #endif
1706        cb.subject_length   = (int)(md->end_subject - md->start_subject);        cb.subject_length   = (int)(md->end_subject - md->start_subject);
1707        cb.start_match      = (int)(mstart - md->start_subject);        cb.start_match      = (int)(mstart - md->start_subject);
1708        cb.current_position = (int)(eptr - md->start_subject);        cb.current_position = (int)(eptr - md->start_subject);
1709        cb.pattern_position = GET(ecode, 2);        cb.pattern_position = GET(ecode, 2);
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;        cb.capture_last     = md->capture_last & CAPLMASK;
1713          /* Internal change requires this for API compatibility. */
1714          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 = (*pcre_callout)(&cb)) > 0) RRETURN(MATCH_NOMATCH);        if ((rrc = (*PUBL(callout))(&cb)) > 0) RRETURN(MATCH_NOMATCH);
1718        if (rrc < 0) RRETURN(rrc);        if (rrc < 0) RRETURN(rrc);
1719        }        }
1720      ecode += 2 + 2*LINK_SIZE;      ecode += 2 + 2*LINK_SIZE;
# Line 1667  for (;;) Line 1740  for (;;)
1740      case OP_RECURSE:      case OP_RECURSE:
1741        {        {
1742        recursion_info *ri;        recursion_info *ri;
1743        int recno;        unsigned int recno;
1744    
1745        callpat = md->start_code + GET(ecode, 1);        callpat = md->start_code + GET(ecode, 1);
1746        recno = (callpat == md->start_code)? 0 :        recno = (callpat == md->start_code)? 0 :
# Line 1684  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;
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 1700  for (;;) Line 1774  for (;;)
1774        else        else
1775          {          {
1776          new_recursive.offset_save =          new_recursive.offset_save =
1777            (int *)(pcre_malloc)(new_recursive.saved_max * sizeof(int));            (int *)(PUBL(malloc))(new_recursive.saved_max * sizeof(int));
1778          if (new_recursive.offset_save == NULL) RRETURN(PCRE_ERROR_NOMEMORY);          if (new_recursive.offset_save == NULL) RRETURN(PCRE_ERROR_NOMEMORY);
1779          }          }
1780        memcpy(new_recursive.offset_save, md->offset_vector,        memcpy(new_recursive.offset_save, md->offset_vector,
1781              new_recursive.saved_max * sizeof(int));              new_recursive.saved_max * sizeof(int));
1782    
1783        /* OK, now we can do the recursion. After processing each alternative,        /* OK, now we can do the recursion. After processing each alternative,
1784        restore the offset data. If there were nested recursions, md->recursive        restore the offset data and the last captured value. If there were nested
1785        might be changed, so reset it before looping. */        recursions, md->recursive might be changed, so reset it before looping.
1786          */
1787    
1788        DPRINTF(("Recursing into group %d\n", new_recursive.group_num));        DPRINTF(("Recursing into group %d\n", new_recursive.group_num));
1789        cbegroup = (*callpat >= OP_SBRA);        cbegroup = (*callpat >= OP_SBRA);
1790        do        do
1791          {          {
1792          if (cbegroup) md->match_function_type = MATCH_CBEGROUP;          if (cbegroup) md->match_function_type = MATCH_CBEGROUP;
1793          RMATCH(eptr, callpat + _pcre_OP_lengths[*callpat], offset_top,          RMATCH(eptr, callpat + PRIV(OP_lengths)[*callpat], offset_top,
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;
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            {            {
1801            DPRINTF(("Recursion matched\n"));            DPRINTF(("Recursion matched\n"));
1802            if (new_recursive.offset_save != stacksave)            if (new_recursive.offset_save != stacksave)
1803              (pcre_free)(new_recursive.offset_save);              (PUBL(free))(new_recursive.offset_save);
1804    
1805            /* Set where we got to in the subject, and reset the start in case            /* Set where we got to in the subject, and reset the start in case
1806            it was changed by \K. This *is* propagated back out of a recursion,            it was changed by \K. This *is* propagated back out of a recursion,
# Line 1735  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 to escape beyond a recursion; it is treated          /* PCRE does not allow THEN, SKIP, PRUNE or COMMIT to escape beyond a
1815          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            if (rrc >= MATCH_BACKTRACK_MIN && rrc <= MATCH_BACKTRACK_MAX)
1819              RRETURN(MATCH_NOMATCH);
1820    
1821            /* Any return code other than NOMATCH is an error. */
1822    
1823          else if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN)          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)
1827              (pcre_free)(new_recursive.offset_save);              (PUBL(free))(new_recursive.offset_save);
1828            RRETURN(rrc);            RRETURN(rrc);
1829            }            }
1830    
# Line 1754  for (;;) Line 1836  for (;;)
1836        DPRINTF(("Recursion didn't match\n"));        DPRINTF(("Recursion didn't match\n"));
1837        md->recursive = new_recursive.prevrec;        md->recursive = new_recursive.prevrec;
1838        if (new_recursive.offset_save != stacksave)        if (new_recursive.offset_save != stacksave)
1839          (pcre_free)(new_recursive.offset_save);          (PUBL(free))(new_recursive.offset_save);
1840        RRETURN(MATCH_NOMATCH);        RRETURN(MATCH_NOMATCH);
1841        }        }
1842    
# Line 1868  for (;;) Line 1950  for (;;)
1950    
1951        /* Deal with capturing */        /* Deal with capturing */
1952    
1953        md->capture_last = number;        md->capture_last = (md->capture_last & OVFLMASK) | number;
1954        if (offset >= md->offset_max) md->offset_overflow = TRUE; else        if (offset >= md->offset_max) md->capture_last |= OVFLBIT; else
1955          {          {
1956          /* If offset is greater than offset_top, it means that we are          /* If offset is greater than offset_top, it means that we are
1957          "skipping" a capturing group, and that group's offsets must be marked          "skipping" a capturing group, and that group's offsets must be marked
# Line 1949  for (;;) Line 2031  for (;;)
2031          }          }
2032        if (*prev >= OP_SBRA)    /* Could match an empty string */        if (*prev >= OP_SBRA)    /* Could match an empty string */
2033          {          {
         md->match_function_type = MATCH_CBEGROUP;  
2034          RMATCH(eptr, prev, offset_top, md, eptrb, RM50);          RMATCH(eptr, prev, offset_top, md, eptrb, RM50);
2035          RRETURN(rrc);          RRETURN(rrc);
2036          }          }
# Line 1958  for (;;) Line 2039  for (;;)
2039        }        }
2040      else  /* OP_KETRMAX */      else  /* OP_KETRMAX */
2041        {        {
       if (*prev >= OP_SBRA) md->match_function_type = MATCH_CBEGROUP;  
2042        RMATCH(eptr, prev, offset_top, md, eptrb, RM13);        RMATCH(eptr, prev, offset_top, md, eptrb, RM13);
2043        if (rrc == MATCH_ONCE && md->once_target == prev) rrc = MATCH_NOMATCH;        if (rrc == MATCH_ONCE && md->once_target == prev) rrc = MATCH_NOMATCH;
2044        if (rrc != MATCH_NOMATCH) RRETURN(rrc);        if (rrc != MATCH_NOMATCH) RRETURN(rrc);
# Line 2015  for (;;) Line 2095  for (;;)
2095    
2096      case OP_DOLLM:      case OP_DOLLM:
2097      if (eptr < md->end_subject)      if (eptr < md->end_subject)
2098        { if (!IS_NEWLINE(eptr)) RRETURN(MATCH_NOMATCH); }        {
2099          if (!IS_NEWLINE(eptr))
2100            {
2101            if (md->partial != 0 &&
2102                eptr + 1 >= md->end_subject &&
2103                NLBLOCK->nltype == NLTYPE_FIXED &&
2104                NLBLOCK->nllen == 2 &&
2105                RAWUCHARTEST(eptr) == NLBLOCK->nl[0])
2106              {
2107              md->hitend = TRUE;
2108              if (md->partial > 1) RRETURN(PCRE_ERROR_PARTIAL);
2109              }
2110            RRETURN(MATCH_NOMATCH);
2111            }
2112          }
2113      else      else
2114        {        {
2115        if (md->noteol) RRETURN(MATCH_NOMATCH);        if (md->noteol) RRETURN(MATCH_NOMATCH);
# Line 2047  for (;;) Line 2141  for (;;)
2141      ASSERT_NL_OR_EOS:      ASSERT_NL_OR_EOS:
2142      if (eptr < md->end_subject &&      if (eptr < md->end_subject &&
2143          (!IS_NEWLINE(eptr) || eptr != md->end_subject - md->nllen))          (!IS_NEWLINE(eptr) || eptr != md->end_subject - md->nllen))
2144          {
2145          if (md->partial != 0 &&
2146              eptr + 1 >= md->end_subject &&
2147              NLBLOCK->nltype == NLTYPE_FIXED &&
2148              NLBLOCK->nllen == 2 &&
2149              RAWUCHARTEST(eptr) == NLBLOCK->nl[0])
2150            {
2151            md->hitend = TRUE;
2152            if (md->partial > 1) RRETURN(PCRE_ERROR_PARTIAL);
2153            }
2154        RRETURN(MATCH_NOMATCH);        RRETURN(MATCH_NOMATCH);
2155          }
2156    
2157      /* Either at end of string or \n before end. */      /* Either at end of string or \n before end. */
2158    
# Line 2066  for (;;) Line 2171  for (;;)
2171        be "non-word" characters. Remember the earliest consulted character for        be "non-word" characters. Remember the earliest consulted character for
2172        partial matching. */        partial matching. */
2173    
2174  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF
2175        if (utf8)        if (utf)
2176          {          {
2177          /* Get status of previous character */          /* Get status of previous character */
2178    
2179          if (eptr == md->start_subject) prev_is_word = FALSE; else          if (eptr == md->start_subject) prev_is_word = FALSE; else
2180            {            {
2181            USPTR lastptr = eptr - 1;            PCRE_PUCHAR lastptr = eptr - 1;
2182            while((*lastptr & 0xc0) == 0x80) lastptr--;            BACKCHAR(lastptr);
2183            if (lastptr < md->start_used_ptr) md->start_used_ptr = lastptr;            if (lastptr < md->start_used_ptr) md->start_used_ptr = lastptr;
2184            GETCHAR(c, lastptr);            GETCHAR(c, lastptr);
2185  #ifdef SUPPORT_UCP  #ifdef SUPPORT_UCP
# Line 2139  for (;;) Line 2244  for (;;)
2244              }              }
2245            else            else
2246  #endif  #endif
2247            prev_is_word = ((md->ctypes[eptr[-1]] & ctype_word) != 0);            prev_is_word = MAX_255(eptr[-1])
2248                && ((md->ctypes[eptr[-1]] & ctype_word) != 0);
2249            }            }
2250    
2251          /* Get status of next character */          /* Get status of next character */
# Line 2162  for (;;) Line 2268  for (;;)
2268            }            }
2269          else          else
2270  #endif  #endif
2271          cur_is_word = ((md->ctypes[*eptr] & ctype_word) != 0);          cur_is_word = MAX_255(*eptr)
2272              && ((md->ctypes[*eptr] & ctype_word) != 0);
2273          }          }
2274    
2275        /* Now see if the situation is what we want */        /* Now see if the situation is what we want */
# Line 2173  for (;;) Line 2280  for (;;)
2280        }        }
2281      break;      break;
2282    
2283      /* Match a single character type; inline for speed */      /* Match any single character type except newline; have to take care with
2284        CRLF newlines and partial matching. */
2285    
2286      case OP_ANY:      case OP_ANY:
2287      if (IS_NEWLINE(eptr)) RRETURN(MATCH_NOMATCH);      if (IS_NEWLINE(eptr)) RRETURN(MATCH_NOMATCH);
2288        if (md->partial != 0 &&
2289            eptr + 1 >= md->end_subject &&
2290            NLBLOCK->nltype == NLTYPE_FIXED &&
2291            NLBLOCK->nllen == 2 &&
2292            RAWUCHARTEST(eptr) == NLBLOCK->nl[0])
2293          {
2294          md->hitend = TRUE;
2295          if (md->partial > 1) RRETURN(PCRE_ERROR_PARTIAL);
2296          }
2297    
2298      /* Fall through */      /* Fall through */
2299    
2300        /* Match any single character whatsoever. */
2301    
2302      case OP_ALLANY:      case OP_ALLANY:
2303      if (eptr >= md->end_subject)   /* DO NOT merge the eptr++ here; it must */      if (eptr >= md->end_subject)   /* DO NOT merge the eptr++ here; it must */
2304        {                            /* not be updated before SCHECK_PARTIAL. */        {                            /* not be updated before SCHECK_PARTIAL. */
# Line 2186  for (;;) Line 2306  for (;;)
2306        RRETURN(MATCH_NOMATCH);        RRETURN(MATCH_NOMATCH);
2307        }        }
2308      eptr++;      eptr++;
2309      if (utf8) while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++;  #ifdef SUPPORT_UTF
2310        if (utf) ACROSSCHAR(eptr < md->end_subject, *eptr, eptr++);
2311    #endif
2312      ecode++;      ecode++;
2313      break;      break;
2314    
# Line 2211  for (;;) Line 2333  for (;;)
2333        }        }
2334      GETCHARINCTEST(c, eptr);      GETCHARINCTEST(c, eptr);
2335      if (      if (
2336  #ifdef SUPPORT_UTF8  #if defined SUPPORT_UTF || !(defined COMPILE_PCRE8)
2337         c < 256 &&         c < 256 &&
2338  #endif  #endif
2339         (md->ctypes[c] & ctype_digit) != 0         (md->ctypes[c] & ctype_digit) != 0
# Line 2228  for (;;) Line 2350  for (;;)
2350        }        }
2351      GETCHARINCTEST(c, eptr);      GETCHARINCTEST(c, eptr);
2352      if (      if (
2353  #ifdef SUPPORT_UTF8  #if defined SUPPORT_UTF || !(defined COMPILE_PCRE8)
2354         c >= 256 ||         c > 255 ||
2355  #endif  #endif
2356         (md->ctypes[c] & ctype_digit) == 0         (md->ctypes[c] & ctype_digit) == 0
2357         )         )
# Line 2245  for (;;) Line 2367  for (;;)
2367        }        }
2368      GETCHARINCTEST(c, eptr);      GETCHARINCTEST(c, eptr);
2369      if (      if (
2370  #ifdef SUPPORT_UTF8  #if defined SUPPORT_UTF || !(defined COMPILE_PCRE8)
2371         c < 256 &&         c < 256 &&
2372  #endif  #endif
2373         (md->ctypes[c] & ctype_space) != 0         (md->ctypes[c] & ctype_space) != 0
# Line 2262  for (;;) Line 2384  for (;;)
2384        }        }
2385      GETCHARINCTEST(c, eptr);      GETCHARINCTEST(c, eptr);
2386      if (      if (
2387  #ifdef SUPPORT_UTF8  #if defined SUPPORT_UTF || !(defined COMPILE_PCRE8)
2388         c >= 256 ||         c > 255 ||
2389  #endif  #endif
2390         (md->ctypes[c] & ctype_space) == 0         (md->ctypes[c] & ctype_space) == 0
2391         )         )
# Line 2279  for (;;) Line 2401  for (;;)
2401        }        }
2402      GETCHARINCTEST(c, eptr);      GETCHARINCTEST(c, eptr);
2403      if (      if (
2404  #ifdef SUPPORT_UTF8  #if defined SUPPORT_UTF || !(defined COMPILE_PCRE8)
2405         c < 256 &&         c < 256 &&
2406  #endif  #endif
2407         (md->ctypes[c] & ctype_word) != 0         (md->ctypes[c] & ctype_word) != 0
# Line 2296  for (;;) Line 2418  for (;;)
2418        }        }
2419      GETCHARINCTEST(c, eptr);      GETCHARINCTEST(c, eptr);
2420      if (      if (
2421  #ifdef SUPPORT_UTF8  #if defined SUPPORT_UTF || !(defined COMPILE_PCRE8)
2422         c >= 256 ||         c > 255 ||
2423  #endif  #endif
2424         (md->ctypes[c] & ctype_word) == 0         (md->ctypes[c] & ctype_word) == 0
2425         )         )
# Line 2316  for (;;) Line 2438  for (;;)
2438        {        {
2439        default: RRETURN(MATCH_NOMATCH);        default: RRETURN(MATCH_NOMATCH);
2440    
2441        case 0x000d:        case CHAR_CR:
2442        if (eptr < md->end_subject && *eptr == 0x0a) eptr++;        if (eptr >= md->end_subject)
2443            {
2444            SCHECK_PARTIAL();
2445            }
2446          else if (RAWUCHARTEST(eptr) == CHAR_LF) eptr++;
2447        break;        break;
2448    
2449        case 0x000a:        case CHAR_LF:
2450        break;        break;
2451    
2452        case 0x000b:        case CHAR_VT:
2453        case 0x000c:        case CHAR_FF:
2454        case 0x0085:        case CHAR_NEL:
2455    #ifndef EBCDIC
2456        case 0x2028:        case 0x2028:
2457        case 0x2029:        case 0x2029:
2458    #endif  /* Not EBCDIC */
2459        if (md->bsr_anycrlf) RRETURN(MATCH_NOMATCH);        if (md->bsr_anycrlf) RRETURN(MATCH_NOMATCH);
2460        break;        break;
2461        }        }
# Line 2343  for (;;) Line 2471  for (;;)
2471      GETCHARINCTEST(c, eptr);      GETCHARINCTEST(c, eptr);
2472      switch(c)      switch(c)
2473        {        {
2474          HSPACE_CASES: RRETURN(MATCH_NOMATCH);  /* Byte and multibyte cases */
2475        default: break;        default: break;
       case 0x09:      /* HT */  
       case 0x20:      /* SPACE */  
       case 0xa0:      /* NBSP */  
       case 0x1680:    /* OGHAM SPACE MARK */  
       case 0x180e:    /* MONGOLIAN VOWEL SEPARATOR */  
       case 0x2000:    /* EN QUAD */  
       case 0x2001:    /* EM QUAD */  
       case 0x2002:    /* EN SPACE */  
       case 0x2003:    /* EM SPACE */  
       case 0x2004:    /* THREE-PER-EM SPACE */  
       case 0x2005:    /* FOUR-PER-EM SPACE */  
       case 0x2006:    /* SIX-PER-EM SPACE */  
       case 0x2007:    /* FIGURE SPACE */  
       case 0x2008:    /* PUNCTUATION SPACE */  
       case 0x2009:    /* THIN SPACE */  
       case 0x200A:    /* HAIR SPACE */  
       case 0x202f:    /* NARROW NO-BREAK SPACE */  
       case 0x205f:    /* MEDIUM MATHEMATICAL SPACE */  
       case 0x3000:    /* IDEOGRAPHIC SPACE */  
       RRETURN(MATCH_NOMATCH);  
2476        }        }
2477      ecode++;      ecode++;
2478      break;      break;
# Line 2377  for (;;) Line 2486  for (;;)
2486      GETCHARINCTEST(c, eptr);      GETCHARINCTEST(c, eptr);
2487      switch(c)      switch(c)
2488        {        {
2489          HSPACE_CASES: break;  /* Byte and multibyte cases */
2490        default: RRETURN(MATCH_NOMATCH);        default: RRETURN(MATCH_NOMATCH);
       case 0x09:      /* HT */  
       case 0x20:      /* SPACE */  
       case 0xa0:      /* NBSP */  
       case 0x1680:    /* OGHAM SPACE MARK */  
       case 0x180e:    /* MONGOLIAN VOWEL SEPARATOR */  
       case 0x2000:    /* EN QUAD */  
       case 0x2001:    /* EM QUAD */  
       case 0x2002:    /* EN SPACE */  
       case 0x2003:    /* EM SPACE */  
       case 0x2004:    /* THREE-PER-EM SPACE */  
       case 0x2005:    /* FOUR-PER-EM SPACE */  
       case 0x2006:    /* SIX-PER-EM SPACE */  
       case 0x2007:    /* FIGURE SPACE */  
       case 0x2008:    /* PUNCTUATION SPACE */  
       case 0x2009:    /* THIN SPACE */  
       case 0x200A:    /* HAIR SPACE */  
       case 0x202f:    /* NARROW NO-BREAK SPACE */  
       case 0x205f:    /* MEDIUM MATHEMATICAL SPACE */  
       case 0x3000:    /* IDEOGRAPHIC SPACE */  
       break;  
2491        }        }
2492      ecode++;      ecode++;
2493      break;      break;
# Line 2411  for (;;) Line 2501  for (;;)
2501      GETCHARINCTEST(c, eptr);      GETCHARINCTEST(c, eptr);
2502      switch(c)      switch(c)
2503        {        {
2504          VSPACE_CASES: RRETURN(MATCH_NOMATCH);
2505        default: break;        default: break;
       case 0x0a:      /* LF */  
       case 0x0b:      /* VT */  
       case 0x0c:      /* FF */  
       case 0x0d:      /* CR */  
       case 0x85:      /* NEL */  
       case 0x2028:    /* LINE SEPARATOR */  
       case 0x2029:    /* PARAGRAPH SEPARATOR */  
       RRETURN(MATCH_NOMATCH);  
2506        }        }
2507      ecode++;      ecode++;
2508      break;      break;
# Line 2433  for (;;) Line 2516  for (;;)
2516      GETCHARINCTEST(c, eptr);      GETCHARINCTEST(c, eptr);
2517      switch(c)      switch(c)
2518        {        {
2519          VSPACE_CASES: break;
2520        default: RRETURN(MATCH_NOMATCH);        default: RRETURN(MATCH_NOMATCH);
       case 0x0a:      /* LF */  
       case 0x0b:      /* VT */  
       case 0x0c:      /* FF */  
       case 0x0d:      /* CR */  
       case 0x85:      /* NEL */  
       case 0x2028:    /* LINE SEPARATOR */  
       case 0x2029:    /* PARAGRAPH SEPARATOR */  
       break;  
2521        }        }
2522      ecode++;      ecode++;
2523      break;      break;
# Line 2459  for (;;) Line 2535  for (;;)
2535        }        }
2536      GETCHARINCTEST(c, eptr);      GETCHARINCTEST(c, eptr);
2537        {        {
2538          const pcre_uint32 *cp;
2539        const ucd_record *prop = GET_UCD(c);        const ucd_record *prop = GET_UCD(c);
2540    
2541        switch(ecode[1])        switch(ecode[1])
# Line 2475  for (;;) Line 2552  for (;;)
2552          break;          break;
2553    
2554          case PT_GC:          case PT_GC:
2555          if ((ecode[2] != _pcre_ucp_gentype[prop->chartype]) == (op == OP_PROP))          if ((ecode[2] != PRIV(ucp_gentype)[prop->chartype]) == (op == OP_PROP))
2556            RRETURN(MATCH_NOMATCH);            RRETURN(MATCH_NOMATCH);
2557          break;          break;
2558    
# Line 2492  for (;;) Line 2569  for (;;)
2569          /* These are specials */          /* These are specials */
2570    
2571          case PT_ALNUM:          case PT_ALNUM:
2572          if ((_pcre_ucp_gentype[prop->chartype] == ucp_L ||          if ((PRIV(ucp_gentype)[prop->chartype] == ucp_L ||
2573               _pcre_ucp_gentype[prop->chartype] == ucp_N) == (op == OP_NOTPROP))               PRIV(ucp_gentype)[prop->chartype] == ucp_N) == (op == OP_NOTPROP))
2574            RRETURN(MATCH_NOMATCH);            RRETURN(MATCH_NOMATCH);
2575          break;          break;
2576    
2577          case PT_SPACE:    /* Perl space */          /* Perl space used to exclude VT, but from Perl 5.18 it is included,
2578          if ((_pcre_ucp_gentype[prop->chartype] == ucp_Z ||          which means that Perl space and POSIX space are now identical. PCRE
2579               c == CHAR_HT || c == CHAR_NL || c == CHAR_FF || c == CHAR_CR)          was changed at release 8.34. */
                == (op == OP_NOTPROP))  
           RRETURN(MATCH_NOMATCH);  
         break;  
2580    
2581            case PT_SPACE:    /* Perl space */
2582          case PT_PXSPACE:  /* POSIX space */          case PT_PXSPACE:  /* POSIX space */
2583          if ((_pcre_ucp_gentype[prop->chartype] == ucp_Z ||          switch(c)
2584               c == CHAR_HT || c == CHAR_NL || c == CHAR_VT ||            {
2585               c == CHAR_FF || c == CHAR_CR)            HSPACE_CASES:
2586                 == (op == OP_NOTPROP))            VSPACE_CASES:
2587            RRETURN(MATCH_NOMATCH);            if (op == OP_NOTPROP) RRETURN(MATCH_NOMATCH);
2588              break;
2589    
2590              default:
2591              if ((PRIV(ucp_gentype)[prop->chartype] == ucp_Z) ==
2592                (op == OP_NOTPROP)) RRETURN(MATCH_NOMATCH);
2593              break;
2594              }
2595          break;          break;
2596    
2597          case PT_WORD:          case PT_WORD:
2598          if ((_pcre_ucp_gentype[prop->chartype] == ucp_L ||          if ((PRIV(ucp_gentype)[prop->chartype] == ucp_L ||
2599               _pcre_ucp_gentype[prop->chartype] == ucp_N ||               PRIV(ucp_gentype)[prop->chartype] == ucp_N ||
2600               c == CHAR_UNDERSCORE) == (op == OP_NOTPROP))               c == CHAR_UNDERSCORE) == (op == OP_NOTPROP))
2601            RRETURN(MATCH_NOMATCH);            RRETURN(MATCH_NOMATCH);
2602          break;          break;
2603    
2604            case PT_CLIST:
2605            cp = PRIV(ucd_caseless_sets) + ecode[2];
2606            for (;;)
2607              {
2608              if (c < *cp)
2609                { if (op == OP_PROP) { RRETURN(MATCH_NOMATCH); } else break; }
2610              if (c == *cp++)
2611                { if (op == OP_PROP) break; else { RRETURN(MATCH_NOMATCH); } }
2612              }
2613            break;
2614    
2615            case PT_UCNC:
2616            if ((c == CHAR_DOLLAR_SIGN || c == CHAR_COMMERCIAL_AT ||
2617                 c == CHAR_GRAVE_ACCENT || (c >= 0xa0 && c <= 0xd7ff) ||
2618                 c >= 0xe000) == (op == OP_NOTPROP))
2619              RRETURN(MATCH_NOMATCH);
2620            break;
2621    
2622          /* This should never occur */          /* This should never occur */
2623    
2624          default:          default:
# Line 2538  for (;;) Line 2638  for (;;)
2638        SCHECK_PARTIAL();        SCHECK_PARTIAL();
2639        RRETURN(MATCH_NOMATCH);        RRETURN(MATCH_NOMATCH);
2640        }        }
2641      GETCHARINCTEST(c, eptr);      else
     if (UCD_CATEGORY(c) == ucp_M) RRETURN(MATCH_NOMATCH);  
     while (eptr < md->end_subject)  
2642        {        {
2643        int len = 1;        int lgb, rgb;
2644        if (!utf8) c = *eptr; else { GETCHARLEN(c, eptr, len); }        GETCHARINCTEST(c, eptr);
2645        if (UCD_CATEGORY(c) != ucp_M) break;        lgb = UCD_GRAPHBREAK(c);
2646        eptr += len;        while (eptr < md->end_subject)
2647            {
2648            int len = 1;
2649            if (!utf) c = *eptr; else { GETCHARLEN(c, eptr, len); }
2650            rgb = UCD_GRAPHBREAK(c);
2651            if ((PRIV(ucp_gbtable)[lgb] & (1 << rgb)) == 0) break;
2652            lgb = rgb;
2653            eptr += len;
2654            }
2655        }        }
2656        CHECK_PARTIAL();
2657      ecode++;      ecode++;
2658      break;      break;
2659  #endif  #endif  /* SUPPORT_UCP */
2660    
2661    
2662      /* Match a back reference, possibly repeatedly. Look past the end of the      /* Match a back reference, possibly repeatedly. Look past the end of the
# Line 2558  for (;;) Line 2665  for (;;)
2665      similar code to character type repeats - written out again for speed.      similar code to character type repeats - written out again for speed.
2666      However, if the referenced string is the empty string, always treat      However, if the referenced string is the empty string, always treat
2667      it as matched, any number of times (otherwise there could be infinite      it as matched, any number of times (otherwise there could be infinite
2668      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 += 3;  
   
     /* If the reference is unset, there are two possibilities:  
2669    
2670      (a) In the default, Perl-compatible state, set the length negative;      (a) In the default, Perl-compatible state, set the length negative;
2671      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 2576  for (;;) Line 2675  for (;;)
2675      so that the back reference matches an empty string.      so that the back reference matches an empty string.
2676    
2677      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
2678      referenced subpattern. */      referenced subpattern.
2679    
2680        The OP_REF and OP_REFI opcodes are used for a reference to a numbered group
2681        or to a non-duplicated named group. For a duplicated named group, OP_DNREF
2682        and OP_DNREFI are used. In this case we must scan the list of groups to
2683        which the name refers, and use the first one that is set. */
2684    
2685        case OP_DNREF:
2686        case OP_DNREFI:
2687        caseless = op == OP_DNREFI;
2688          {
2689          int count = GET2(ecode, 1+IMM2_SIZE);
2690          pcre_uchar *slot = md->name_table + GET2(ecode, 1) * md->name_entry_size;
2691          ecode += 1 + 2*IMM2_SIZE;
2692    
2693          while (count-- > 0)
2694            {
2695            offset = GET2(slot, 0) << 1;
2696            if (offset < offset_top && md->offset_vector[offset] >= 0) break;
2697            slot += md->name_entry_size;
2698            }
2699          if (count < 0)
2700            length = (md->jscript_compat)? 0 : -1;
2701          else
2702            length = md->offset_vector[offset+1] - md->offset_vector[offset];
2703          }
2704        goto REF_REPEAT;
2705    
2706        case OP_REF:
2707        case OP_REFI:
2708        caseless = op == OP_REFI;
2709        offset = GET2(ecode, 1) << 1;               /* Doubled ref number */
2710        ecode += 1 + IMM2_SIZE;
2711      if (offset >= offset_top || md->offset_vector[offset] < 0)      if (offset >= offset_top || md->offset_vector[offset] < 0)
2712        length = (md->jscript_compat)? 0 : -1;        length = (md->jscript_compat)? 0 : -1;
2713      else      else
# Line 2585  for (;;) Line 2715  for (;;)
2715    
2716      /* Set up for repetition, or handle the non-repeated case */      /* Set up for repetition, or handle the non-repeated case */
2717    
2718        REF_REPEAT:
2719      switch (*ecode)      switch (*ecode)
2720        {        {
2721        case OP_CRSTAR:        case OP_CRSTAR:
# Line 2604  for (;;) Line 2735  for (;;)
2735        case OP_CRMINRANGE:        case OP_CRMINRANGE:
2736        minimize = (*ecode == OP_CRMINRANGE);        minimize = (*ecode == OP_CRMINRANGE);
2737        min = GET2(ecode, 1);        min = GET2(ecode, 1);
2738        max = GET2(ecode, 3);        max = GET2(ecode, 1 + IMM2_SIZE);
2739        if (max == 0) max = INT_MAX;        if (max == 0) max = INT_MAX;
2740        ecode += 5;        ecode += 1 + 2 * IMM2_SIZE;
2741        break;        break;
2742    
2743        default:               /* No repeat follows */        default:               /* No repeat follows */
2744        if ((length = match_ref(offset, eptr, length, md, caseless)) < 0)        if ((length = match_ref(offset, eptr, length, md, caseless)) < 0)
2745          {          {
2746            if (length == -2) eptr = md->end_subject;   /* Partial match */
2747          CHECK_PARTIAL();          CHECK_PARTIAL();
2748          RRETURN(MATCH_NOMATCH);          RRETURN(MATCH_NOMATCH);
2749          }          }
# Line 2620  for (;;) Line 2752  for (;;)
2752        }        }
2753    
2754      /* Handle repeated back references. If the length of the reference is      /* Handle repeated back references. If the length of the reference is
2755      zero, just continue with the main loop. */      zero, just continue with the main loop. If the length is negative, it
2756        means the reference is unset in non-Java-compatible mode. If the minimum is
2757        zero, we can continue at the same level without recursion. For any other
2758        minimum, carrying on will result in NOMATCH. */
2759    
2760      if (length == 0) continue;      if (length == 0) continue;
2761        if (length < 0 && min == 0) continue;
2762    
2763      /* First, ensure the minimum number of matches are present. We get back      /* First, ensure the minimum number of matches are present. We get back
2764      the length of the reference string explicitly rather than passing the      the length of the reference string explicitly rather than passing the
# Line 2633  for (;;) Line 2769  for (;;)
2769        int slength;        int slength;
2770        if ((slength = match_ref(offset, eptr, length, md, caseless)) < 0)        if ((slength = match_ref(offset, eptr, length, md, caseless)) < 0)
2771          {          {
2772            if (slength == -2) eptr = md->end_subject;   /* Partial match */
2773          CHECK_PARTIAL();          CHECK_PARTIAL();
2774          RRETURN(MATCH_NOMATCH);          RRETURN(MATCH_NOMATCH);
2775          }          }
# Line 2656  for (;;) Line 2793  for (;;)
2793          if (fi >= max) RRETURN(MATCH_NOMATCH);          if (fi >= max) RRETURN(MATCH_NOMATCH);
2794          if ((slength = match_ref(offset, eptr, length, md, caseless)) < 0)          if ((slength = match_ref(offset, eptr, length, md, caseless)) < 0)
2795            {            {
2796              if (slength == -2) eptr = md->end_subject;   /* Partial match */
2797            CHECK_PARTIAL();            CHECK_PARTIAL();
2798            RRETURN(MATCH_NOMATCH);            RRETURN(MATCH_NOMATCH);
2799            }            }
# Line 2674  for (;;) Line 2812  for (;;)
2812          int slength;          int slength;
2813          if ((slength = match_ref(offset, eptr, length, md, caseless)) < 0)          if ((slength = match_ref(offset, eptr, length, md, caseless)) < 0)
2814            {            {
2815            CHECK_PARTIAL();            /* Can't use CHECK_PARTIAL because we don't want to update eptr in
2816              the soft partial matching case. */
2817    
2818              if (slength == -2 && md->partial != 0 &&
2819                  md->end_subject > md->start_used_ptr)
2820                {
2821                md->hitend = TRUE;
2822                if (md->partial > 1) RRETURN(PCRE_ERROR_PARTIAL);
2823                }
2824            break;            break;
2825            }            }
2826          eptr += slength;          eptr += slength;
2827          }          }
2828    
2829        while (eptr >= pp)        while (eptr >= pp)
2830          {          {
2831          RMATCH(eptr, ecode, offset_top, md, eptrb, RM15);          RMATCH(eptr, ecode, offset_top, md, eptrb, RM15);
# Line 2703  for (;;) Line 2850  for (;;)
2850      case OP_NCLASS:      case OP_NCLASS:
2851      case OP_CLASS:      case OP_CLASS:
2852        {        {
2853          /* The data variable is saved across frames, so the byte map needs to
2854          be stored there. */
2855    #define BYTE_MAP ((pcre_uint8 *)data)
2856        data = ecode + 1;                /* Save for matching */        data = ecode + 1;                /* Save for matching */
2857        ecode += 33;                     /* Advance past the item */        ecode += 1 + (32 / sizeof(pcre_uchar)); /* Advance past the item */
2858    
2859        switch (*ecode)        switch (*ecode)
2860          {          {
# Line 2714  for (;;) Line 2864  for (;;)
2864          case OP_CRMINPLUS:          case OP_CRMINPLUS:
2865          case OP_CRQUERY:          case OP_CRQUERY:
2866          case OP_CRMINQUERY:          case OP_CRMINQUERY:
2867            case OP_CRPOSSTAR:
2868            case OP_CRPOSPLUS:
2869            case OP_CRPOSQUERY:
2870          c = *ecode++ - OP_CRSTAR;          c = *ecode++ - OP_CRSTAR;
2871          minimize = (c & 1) != 0;          if (c < OP_CRPOSSTAR - OP_CRSTAR) minimize = (c & 1) != 0;
2872            else possessive = TRUE;
2873          min = rep_min[c];                 /* Pick up values from tables; */          min = rep_min[c];                 /* Pick up values from tables; */
2874          max = rep_max[c];                 /* zero for max => infinity */          max = rep_max[c];                 /* zero for max => infinity */
2875          if (max == 0) max = INT_MAX;          if (max == 0) max = INT_MAX;
# Line 2723  for (;;) Line 2877  for (;;)
2877    
2878          case OP_CRRANGE:          case OP_CRRANGE:
2879          case OP_CRMINRANGE:          case OP_CRMINRANGE:
2880            case OP_CRPOSRANGE:
2881          minimize = (*ecode == OP_CRMINRANGE);          minimize = (*ecode == OP_CRMINRANGE);
2882            possessive = (*ecode == OP_CRPOSRANGE);
2883          min = GET2(ecode, 1);          min = GET2(ecode, 1);
2884          max = GET2(ecode, 3);          max = GET2(ecode, 1 + IMM2_SIZE);
2885          if (max == 0) max = INT_MAX;          if (max == 0) max = INT_MAX;
2886          ecode += 5;          ecode += 1 + 2 * IMM2_SIZE;
2887          break;          break;
2888    
2889          default:               /* No repeat follows */          default:               /* No repeat follows */
# Line 2737  for (;;) Line 2893  for (;;)
2893    
2894        /* First, ensure the minimum number of matches are present. */        /* First, ensure the minimum number of matches are present. */
2895    
2896  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF
2897        /* UTF-8 mode */        if (utf)
       if (utf8)  
2898          {          {
2899          for (i = 1; i <= min; i++)          for (i = 1; i <= min; i++)
2900            {            {
# Line 2754  for (;;) Line 2909  for (;;)
2909              if (op == OP_CLASS) RRETURN(MATCH_NOMATCH);              if (op == OP_CLASS) RRETURN(MATCH_NOMATCH);
2910              }              }
2911            else            else
2912              {              if ((BYTE_MAP[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH);
             if ((data[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH);  
             }  
2913            }            }
2914          }          }
2915        else        else
2916  #endif  #endif
2917        /* Not UTF-8 mode */        /* Not UTF mode */
2918          {          {
2919          for (i = 1; i <= min; i++)          for (i = 1; i <= min; i++)
2920            {            {
# Line 2771  for (;;) Line 2924  for (;;)
2924              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
2925              }              }
2926            c = *eptr++;            c = *eptr++;
2927            if ((data[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH);  #ifndef COMPILE_PCRE8
2928              if (c > 255)
2929                {
2930                if (op == OP_CLASS) RRETURN(MATCH_NOMATCH);
2931                }
2932              else
2933    #endif
2934                if ((BYTE_MAP[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH);
2935            }            }
2936          }          }
2937    
# Line 2785  for (;;) Line 2945  for (;;)
2945    
2946        if (minimize)        if (minimize)
2947          {          {
2948  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF
2949          /* UTF-8 mode */          if (utf)
         if (utf8)  
2950            {            {
2951            for (fi = min;; fi++)            for (fi = min;; fi++)
2952              {              {
# Line 2805  for (;;) Line 2964  for (;;)
2964                if (op == OP_CLASS) RRETURN(MATCH_NOMATCH);                if (op == OP_CLASS) RRETURN(MATCH_NOMATCH);
2965                }                }
2966              else              else
2967                {                if ((BYTE_MAP[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH);
               if ((data[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH);  
               }  
2968              }              }
2969            }            }
2970          else          else
2971  #endif  #endif
2972          /* Not UTF-8 mode */          /* Not UTF mode */
2973            {            {
2974            for (fi = min;; fi++)            for (fi = min;; fi++)
2975              {              {
# Line 2825  for (;;) Line 2982  for (;;)
2982                RRETURN(MATCH_NOMATCH);                RRETURN(MATCH_NOMATCH);
2983                }                }
2984              c = *eptr++;              c = *eptr++;
2985              if ((data[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH);  #ifndef COMPILE_PCRE8
2986                if (c > 255)
2987                  {
2988                  if (op == OP_CLASS) RRETURN(MATCH_NOMATCH);
2989                  }
2990                else
2991    #endif
2992                  if ((BYTE_MAP[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH);
2993              }              }
2994            }            }
2995          /* Control never gets here */          /* Control never gets here */
# Line 2837  for (;;) Line 3001  for (;;)
3001          {          {
3002          pp = eptr;          pp = eptr;
3003    
3004  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF
3005          /* UTF-8 mode */          if (utf)
         if (utf8)  
3006            {            {
3007            for (i = min; i < max; i++)            for (i = min; i < max; i++)
3008              {              {
# Line 2855  for (;;) Line 3018  for (;;)
3018                if (op == OP_CLASS) break;                if (op == OP_CLASS) break;
3019                }                }
3020              else              else
3021                {                if ((BYTE_MAP[c/8] & (1 << (c&7))) == 0) break;
               if ((data[c/8] & (1 << (c&7))) == 0) break;  
               }  
3022              eptr += len;              eptr += len;
3023              }              }
3024    
3025              if (possessive) continue;    /* No backtracking */
3026    
3027            for (;;)            for (;;)
3028              {              {
3029              RMATCH(eptr, ecode, offset_top, md, eptrb, RM18);              RMATCH(eptr, ecode, offset_top, md, eptrb, RM18);
# Line 2870  for (;;) Line 3034  for (;;)
3034            }            }
3035          else          else
3036  #endif  #endif
3037            /* Not UTF-8 mode */            /* Not UTF mode */
3038            {            {
3039            for (i = min; i < max; i++)            for (i = min; i < max; i++)
3040              {              {
# Line 2880  for (;;) Line 3044  for (;;)
3044                break;                break;
3045                }                }
3046              c = *eptr;              c = *eptr;
3047              if ((data[c/8] & (1 << (c&7))) == 0) break;  #ifndef COMPILE_PCRE8
3048                if (c > 255)
3049                  {
3050                  if (op == OP_CLASS) break;
3051                  }
3052                else
3053    #endif
3054                  if ((BYTE_MAP[c/8] & (1 << (c&7))) == 0) break;
3055              eptr++;              eptr++;
3056              }              }
3057    
3058              if (possessive) continue;    /* No backtracking */
3059    
3060            while (eptr >= pp)            while (eptr >= pp)
3061              {              {
3062              RMATCH(eptr, ecode, offset_top, md, eptrb, RM19);              RMATCH(eptr, ecode, offset_top, md, eptrb, RM19);
# Line 2893  for (;;) Line 3067  for (;;)
3067    
3068          RRETURN(MATCH_NOMATCH);          RRETURN(MATCH_NOMATCH);
3069          }          }
3070    #undef BYTE_MAP
3071        }        }
3072      /* Control never gets here */      /* Control never gets here */
3073    
# Line 2901  for (;;) Line 3076  for (;;)
3076      when UTF-8 mode mode is supported. Nevertheless, we may not be in UTF-8      when UTF-8 mode mode is supported. Nevertheless, we may not be in UTF-8
3077      mode, because Unicode properties are supported in non-UTF-8 mode. */      mode, because Unicode properties are supported in non-UTF-8 mode. */
3078    
3079  #ifdef SUPPORT_UTF8  #if defined SUPPORT_UTF || !defined COMPILE_PCRE8
3080      case OP_XCLASS:      case OP_XCLASS:
3081        {        {
3082        data = ecode + 1 + LINK_SIZE;                /* Save for matching */        data = ecode + 1 + LINK_SIZE;                /* Save for matching */
# Line 2915  for (;;) Line 3090  for (;;)
3090          case OP_CRMINPLUS:          case OP_CRMINPLUS:
3091          case OP_CRQUERY:          case OP_CRQUERY:
3092          case OP_CRMINQUERY:          case OP_CRMINQUERY:
3093            case OP_CRPOSSTAR:
3094            case OP_CRPOSPLUS:
3095            case OP_CRPOSQUERY:
3096          c = *ecode++ - OP_CRSTAR;          c = *ecode++ - OP_CRSTAR;
3097          minimize = (c & 1) != 0;          if (c < OP_CRPOSSTAR - OP_CRSTAR) minimize = (c & 1) != 0;
3098            else possessive = TRUE;
3099          min = rep_min[c];                 /* Pick up values from tables; */          min = rep_min[c];                 /* Pick up values from tables; */
3100          max = rep_max[c];                 /* zero for max => infinity */          max = rep_max[c];                 /* zero for max => infinity */
3101          if (max == 0) max = INT_MAX;          if (max == 0) max = INT_MAX;
# Line 2924  for (;;) Line 3103  for (;;)
3103    
3104          case OP_CRRANGE:          case OP_CRRANGE:
3105          case OP_CRMINRANGE:          case OP_CRMINRANGE:
3106            case OP_CRPOSRANGE:
3107          minimize = (*ecode == OP_CRMINRANGE);          minimize = (*ecode == OP_CRMINRANGE);
3108            possessive = (*ecode == OP_CRPOSRANGE);
3109          min = GET2(ecode, 1);          min = GET2(ecode, 1);
3110          max = GET2(ecode, 3);          max = GET2(ecode, 1 + IMM2_SIZE);
3111          if (max == 0) max = INT_MAX;          if (max == 0) max = INT_MAX;
3112          ecode += 5;          ecode += 1 + 2 * IMM2_SIZE;
3113          break;          break;
3114    
3115          default:               /* No repeat follows */          default:               /* No repeat follows */
# Line 2946  for (;;) Line 3127  for (;;)
3127            RRETURN(MATCH_NOMATCH);            RRETURN(MATCH_NOMATCH);
3128            }            }
3129          GETCHARINCTEST(c, eptr);          GETCHARINCTEST(c, eptr);
3130          if (!_pcre_xclass(c, data)) RRETURN(MATCH_NOMATCH);          if (!PRIV(xclass)(c, data, utf)) RRETURN(MATCH_NOMATCH);
3131          }          }
3132    
3133        /* If max == min we can continue with the main loop without the        /* If max == min we can continue with the main loop without the
# Line 2970  for (;;) Line 3151  for (;;)
3151              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
3152              }              }
3153            GETCHARINCTEST(c, eptr);            GETCHARINCTEST(c, eptr);
3154            if (!_pcre_xclass(c, data)) RRETURN(MATCH_NOMATCH);            if (!PRIV(xclass)(c, data, utf)) RRETURN(MATCH_NOMATCH);
3155            }            }
3156          /* Control never gets here */          /* Control never gets here */
3157          }          }
# Line 2988  for (;;) Line 3169  for (;;)
3169              SCHECK_PARTIAL();              SCHECK_PARTIAL();
3170              break;              break;
3171              }              }
3172    #ifdef SUPPORT_UTF
3173            GETCHARLENTEST(c, eptr, len);            GETCHARLENTEST(c, eptr, len);
3174            if (!_pcre_xclass(c, data)) break;  #else
3175              c = *eptr;
3176    #endif
3177              if (!PRIV(xclass)(c, data, utf)) break;
3178            eptr += len;            eptr += len;
3179            }            }
3180    
3181            if (possessive) continue;    /* No backtracking */
3182    
3183          for(;;)          for(;;)
3184            {            {
3185            RMATCH(eptr, ecode, offset_top, md, eptrb, RM21);            RMATCH(eptr, ecode, offset_top, md, eptrb, RM21);
3186            if (rrc != MATCH_NOMATCH) RRETURN(rrc);            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3187            if (eptr-- == pp) break;        /* Stop if tried at original pos */            if (eptr-- == pp) break;        /* Stop if tried at original pos */
3188            if (utf8) BACKCHAR(eptr);  #ifdef SUPPORT_UTF
3189              if (utf) BACKCHAR(eptr);
3190    #endif
3191            }            }
3192          RRETURN(MATCH_NOMATCH);          RRETURN(MATCH_NOMATCH);
3193          }          }
# Line 3009  for (;;) Line 3199  for (;;)
3199      /* Match a single character, casefully */      /* Match a single character, casefully */
3200    
3201      case OP_CHAR:      case OP_CHAR:
3202  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF
3203      if (utf8)      if (utf)
3204        {        {
3205        length = 1;        length = 1;
3206        ecode++;        ecode++;
# Line 3020  for (;;) Line 3210  for (;;)
3210          CHECK_PARTIAL();             /* Not SCHECK_PARTIAL() */          CHECK_PARTIAL();             /* Not SCHECK_PARTIAL() */
3211          RRETURN(MATCH_NOMATCH);          RRETURN(MATCH_NOMATCH);
3212          }          }
3213        while (length-- > 0) if (*ecode++ != *eptr++) RRETURN(MATCH_NOMATCH);        while (length-- > 0) if (*ecode++ != RAWUCHARINC(eptr)) RRETURN(MATCH_NOMATCH);
3214        }        }
3215      else      else
3216  #endif  #endif
3217        /* Not UTF mode */
     /* Non-UTF-8 mode */  
3218        {        {
3219        if (md->end_subject - eptr < 1)        if (md->end_subject - eptr < 1)
3220          {          {
# Line 3047  for (;;) Line 3236  for (;;)
3236        RRETURN(MATCH_NOMATCH);        RRETURN(MATCH_NOMATCH);
3237        }        }
3238    
3239  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF
3240      if (utf8)      if (utf)
3241        {        {
3242        length = 1;        length = 1;
3243        ecode++;        ecode++;
# Line 3061  for (;;) Line 3250  for (;;)
3250    
3251        if (fc < 128)        if (fc < 128)
3252          {          {
3253          if (md->lcc[*ecode++] != md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH);          pcre_uint32 cc = RAWUCHAR(eptr);
3254            if (md->lcc[fc] != TABLE_GET(cc, md->lcc, cc)) RRETURN(MATCH_NOMATCH);
3255            ecode++;
3256            eptr++;
3257          }          }
3258    
3259        /* Otherwise we must pick up the subject character. Note that we cannot        /* Otherwise we must pick up the subject character. Note that we cannot
# Line 3070  for (;;) Line 3262  for (;;)
3262    
3263        else        else
3264          {          {
3265          unsigned int dc;          pcre_uint32 dc;
3266          GETCHARINC(dc, eptr);          GETCHARINC(dc, eptr);
3267          ecode += length;          ecode += length;
3268    
# Line 3087  for (;;) Line 3279  for (;;)
3279          }          }
3280        }        }
3281      else      else
3282  #endif   /* SUPPORT_UTF8 */  #endif   /* SUPPORT_UTF */
3283    
3284      /* Non-UTF-8 mode */      /* Not UTF mode */
3285        {        {
3286        if (md->lcc[ecode[1]] != md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH);        if (TABLE_GET(ecode[1], md->lcc, ecode[1])
3287              != TABLE_GET(*eptr, md->lcc, *eptr)) RRETURN(MATCH_NOMATCH);
3288          eptr++;
3289        ecode += 2;        ecode += 2;
3290        }        }
3291      break;      break;
# Line 3101  for (;;) Line 3295  for (;;)
3295      case OP_EXACT:      case OP_EXACT:
3296      case OP_EXACTI:      case OP_EXACTI:
3297      min = max = GET2(ecode, 1);      min = max = GET2(ecode, 1);
3298      ecode += 3;      ecode += 1 + IMM2_SIZE;
3299      goto REPEATCHAR;      goto REPEATCHAR;
3300    
3301      case OP_POSUPTO:      case OP_POSUPTO:
# Line 3116  for (;;) Line 3310  for (;;)
3310      min = 0;      min = 0;
3311      max = GET2(ecode, 1);      max = GET2(ecode, 1);
3312      minimize = *ecode == OP_MINUPTO || *ecode == OP_MINUPTOI;      minimize = *ecode == OP_MINUPTO || *ecode == OP_MINUPTOI;
3313      ecode += 3;      ecode += 1 + IMM2_SIZE;
3314      goto REPEATCHAR;      goto REPEATCHAR;
3315    
3316      case OP_POSSTAR:      case OP_POSSTAR:
# Line 3161  for (;;) Line 3355  for (;;)
3355      max = rep_max[c];                 /* zero for max => infinity */      max = rep_max[c];                 /* zero for max => infinity */
3356      if (max == 0) max = INT_MAX;      if (max == 0) max = INT_MAX;
3357    
3358      /* Common code for all repeated single-character matches. */      /* Common code for all repeated single-character matches. We first check
3359        for the minimum number of characters. If the minimum equals the maximum, we
3360        are done. Otherwise, if minimizing, check the rest of the pattern for a
3361        match; if there isn't one, advance up to the maximum, one character at a
3362        time.
3363    
3364        If maximizing, advance up to the maximum number of matching characters,
3365        until eptr is past the end of the maximum run. If possessive, we are
3366        then done (no backing up). Otherwise, match at this position; anything
3367        other than no match is immediately returned. For nomatch, back up one
3368        character, unless we are matching \R and the last thing matched was
3369        \r\n, in which case, back up two bytes. When we reach the first optional
3370        character position, we can save stack by doing a tail recurse.
3371    
3372        The various UTF/non-UTF and caseful/caseless cases are handled separately,
3373        for speed. */
3374    
3375      REPEATCHAR:      REPEATCHAR:
3376  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF
3377      if (utf8)      if (utf)
3378        {        {
3379        length = 1;        length = 1;
3380        charptr = ecode;        charptr = ecode;
# Line 3178  for (;;) Line 3387  for (;;)
3387        if (length > 1)        if (length > 1)
3388          {          {
3389  #ifdef SUPPORT_UCP  #ifdef SUPPORT_UCP
3390          unsigned int othercase;          pcre_uint32 othercase;
3391          if (op >= OP_STARI &&     /* Caseless */          if (op >= OP_STARI &&     /* Caseless */
3392              (othercase = UCD_OTHERCASE(fc)) != fc)              (othercase = UCD_OTHERCASE(fc)) != fc)
3393            oclength = _pcre_ord2utf8(othercase, occhars);            oclength = PRIV(ord2utf)(othercase, occhars);
3394          else oclength = 0;          else oclength = 0;
3395  #endif  /* SUPPORT_UCP */  #endif  /* SUPPORT_UCP */
3396    
3397          for (i = 1; i <= min; i++)          for (i = 1; i <= min; i++)
3398            {            {
3399            if (eptr <= md->end_subject - length &&            if (eptr <= md->end_subject - length &&
3400              memcmp(eptr, charptr, length) == 0) eptr += length;              memcmp(eptr, charptr, IN_UCHARS(length)) == 0) eptr += length;
3401  #ifdef SUPPORT_UCP  #ifdef SUPPORT_UCP
3402            else if (oclength > 0 &&            else if (oclength > 0 &&
3403                     eptr <= md->end_subject - oclength &&                     eptr <= md->end_subject - oclength &&
3404                     memcmp(eptr, occhars, oclength) == 0) eptr += oclength;                     memcmp(eptr, occhars, IN_UCHARS(oclength)) == 0) eptr += oclength;
3405  #endif  /* SUPPORT_UCP */  #endif  /* SUPPORT_UCP */
3406            else            else
3407              {              {
# Line 3211  for (;;) Line 3420  for (;;)
3420              if (rrc != MATCH_NOMATCH) RRETURN(rrc);              if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3421              if (fi >= max) RRETURN(MATCH_NOMATCH);              if (fi >= max) RRETURN(MATCH_NOMATCH);
3422              if (eptr <= md->end_subject - length &&              if (eptr <= md->end_subject - length &&
3423                memcmp(eptr, charptr, length) == 0) eptr += length;                memcmp(eptr, charptr, IN_UCHARS(length)) == 0) eptr += length;
3424  #ifdef SUPPORT_UCP  #ifdef SUPPORT_UCP
3425              else if (oclength > 0 &&              else if (oclength > 0 &&
3426                       eptr <= md->end_subject - oclength &&                       eptr <= md->end_subject - oclength &&
3427                       memcmp(eptr, occhars, oclength) == 0) eptr += oclength;                       memcmp(eptr, occhars, IN_UCHARS(oclength)) == 0) eptr += oclength;
3428  #endif  /* SUPPORT_UCP */  #endif  /* SUPPORT_UCP */
3429              else              else
3430                {                {
# Line 3232  for (;;) Line 3441  for (;;)
3441            for (i = min; i < max; i++)            for (i = min; i < max; i++)
3442              {              {
3443              if (eptr <= md->end_subject - length &&              if (eptr <= md->end_subject - length &&
3444                  memcmp(eptr, charptr, length) == 0) eptr += length;                  memcmp(eptr, charptr, IN_UCHARS(length)) == 0) eptr += length;
3445  #ifdef SUPPORT_UCP  #ifdef SUPPORT_UCP
3446              else if (oclength > 0 &&              else if (oclength > 0 &&
3447                       eptr <= md->end_subject - oclength &&                       eptr <= md->end_subject - oclength &&
3448                       memcmp(eptr, occhars, oclength) == 0) eptr += oclength;                       memcmp(eptr, occhars, IN_UCHARS(oclength)) == 0) eptr += oclength;
3449  #endif  /* SUPPORT_UCP */  #endif  /* SUPPORT_UCP */
3450              else              else
3451                {                {
# Line 3245  for (;;) Line 3454  for (;;)
3454                }                }
3455              }              }
3456    
3457            if (possessive) continue;            if (possessive) continue;    /* No backtracking */
   
3458            for(;;)            for(;;)
3459              {              {
3460                if (eptr == pp) goto TAIL_RECURSE;
3461              RMATCH(eptr, ecode, offset_top, md, eptrb, RM23);              RMATCH(eptr, ecode, offset_top, md, eptrb, RM23);
3462              if (rrc != MATCH_NOMATCH) RRETURN(rrc);              if (rrc != MATCH_NOMATCH) RRETURN(rrc);
             if (eptr == pp) { RRETURN(MATCH_NOMATCH); }  
3463  #ifdef SUPPORT_UCP  #ifdef SUPPORT_UCP
3464              eptr--;              eptr--;
3465              BACKCHAR(eptr);              BACKCHAR(eptr);
# Line 3268  for (;;) Line 3476  for (;;)
3476        value of fc will always be < 128. */        value of fc will always be < 128. */
3477        }        }
3478      else      else
3479  #endif  /* SUPPORT_UTF8 */  #endif  /* SUPPORT_UTF */
3480          /* When not in UTF-8 mode, load a single-byte character. */
3481      /* When not in UTF-8 mode, load a single-byte character. */        fc = *ecode++;
   
     fc = *ecode++;  
3482    
3483      /* The value of fc at this point is always less than 256, though we may or      /* The value of fc at this point is always one character, though we may
3484      may not be in UTF-8 mode. The code is duplicated for the caseless and      or may not be in UTF mode. The code is duplicated for the caseless and
3485      caseful cases, for speed, since matching characters is likely to be quite      caseful cases, for speed, since matching characters is likely to be quite
3486      common. First, ensure the minimum number of matches are present. If min =      common. First, ensure the minimum number of matches are present. If min =
3487      max, continue at the same level without recursing. Otherwise, if      max, continue at the same level without recursing. Otherwise, if
# Line 3284  for (;;) Line 3490  for (;;)
3490      maximizing, find the maximum number of characters and work backwards. */      maximizing, find the maximum number of characters and work backwards. */
3491    
3492      DPRINTF(("matching %c{%d,%d} against subject %.*s\n", fc, min, max,      DPRINTF(("matching %c{%d,%d} against subject %.*s\n", fc, min, max,
3493        max, eptr));        max, (char *)eptr));
3494    
3495      if (op >= OP_STARI)  /* Caseless */      if (op >= OP_STARI)  /* Caseless */
3496        {        {
3497        fc = md->lcc[fc];  #ifdef COMPILE_PCRE8
3498          /* fc must be < 128 if UTF is enabled. */
3499          foc = md->fcc[fc];
3500    #else
3501    #ifdef SUPPORT_UTF
3502    #ifdef SUPPORT_UCP
3503          if (utf && fc > 127)
3504            foc = UCD_OTHERCASE(fc);
3505    #else
3506          if (utf && fc > 127)
3507            foc = fc;
3508    #endif /* SUPPORT_UCP */
3509          else
3510    #endif /* SUPPORT_UTF */
3511            foc = TABLE_GET(fc, md->fcc, fc);
3512    #endif /* COMPILE_PCRE8 */
3513    
3514        for (i = 1; i <= min; i++)        for (i = 1; i <= min; i++)
3515          {          {
3516            pcre_uint32 cc;                 /* Faster than pcre_uchar */
3517          if (eptr >= md->end_subject)          if (eptr >= md->end_subject)
3518            {            {
3519            SCHECK_PARTIAL();            SCHECK_PARTIAL();
3520            RRETURN(MATCH_NOMATCH);            RRETURN(MATCH_NOMATCH);
3521            }            }
3522          if (fc != md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH);          cc = RAWUCHARTEST(eptr);
3523            if (fc != cc && foc != cc) RRETURN(MATCH_NOMATCH);
3524            eptr++;
3525          }          }
3526        if (min == max) continue;        if (min == max) continue;
3527        if (minimize)        if (minimize)
3528          {          {
3529          for (fi = min;; fi++)          for (fi = min;; fi++)
3530            {            {
3531              pcre_uint32 cc;               /* Faster than pcre_uchar */
3532            RMATCH(eptr, ecode, offset_top, md, eptrb, RM24);            RMATCH(eptr, ecode, offset_top, md, eptrb, RM24);
3533            if (rrc != MATCH_NOMATCH) RRETURN(rrc);            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3534            if (fi >= max) RRETURN(MATCH_NOMATCH);            if (fi >= max) RRETURN(MATCH_NOMATCH);
# Line 3311  for (;;) Line 3537  for (;;)
3537              SCHECK_PARTIAL();              SCHECK_PARTIAL();
3538              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
3539              }              }
3540            if (fc != md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH);            cc = RAWUCHARTEST(eptr);
3541              if (fc != cc && foc != cc) RRETURN(MATCH_NOMATCH);
3542              eptr++;
3543            }            }
3544          /* Control never gets here */          /* Control never gets here */
3545          }          }
# Line 3320  for (;;) Line 3548  for (;;)
3548          pp = eptr;          pp = eptr;
3549          for (i = min; i < max; i++)          for (i = min; i < max; i++)
3550            {            {
3551              pcre_uint32 cc;               /* Faster than pcre_uchar */
3552            if (eptr >= md->end_subject)            if (eptr >= md->end_subject)
3553              {              {
3554              SCHECK_PARTIAL();              SCHECK_PARTIAL();
3555              break;              break;
3556              }              }
3557            if (fc != md->lcc[*eptr]) break;            cc = RAWUCHARTEST(eptr);
3558              if (fc != cc && foc != cc) break;
3559            eptr++;            eptr++;
3560            }            }
3561            if (possessive) continue;       /* No backtracking */
3562          if (possessive) continue;          for (;;)
   
         while (eptr >= pp)  
3563            {            {
3564              if (eptr == pp) goto TAIL_RECURSE;
3565            RMATCH(eptr, ecode, offset_top, md, eptrb, RM25);            RMATCH(eptr, ecode, offset_top, md, eptrb, RM25);
3566            eptr--;            eptr--;
3567            if (rrc != MATCH_NOMATCH) RRETURN(rrc);            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3568            }            }
3569          RRETURN(MATCH_NOMATCH);          /* Control never gets here */
3570          }          }
       /* Control never gets here */  
3571        }        }
3572    
3573      /* Caseful comparisons (includes all multi-byte characters) */      /* Caseful comparisons (includes all multi-byte characters) */
# Line 3353  for (;;) Line 3581  for (;;)
3581            SCHECK_PARTIAL();            SCHECK_PARTIAL();
3582            RRETURN(MATCH_NOMATCH);            RRETURN(MATCH_NOMATCH);
3583            }            }
3584          if (fc != *eptr++) RRETURN(MATCH_NOMATCH);          if (fc != RAWUCHARINCTEST(eptr)) RRETURN(MATCH_NOMATCH);
3585          }          }
3586    
3587        if (min == max) continue;        if (min == max) continue;
# Line 3370  for (;;) Line 3598  for (;;)
3598              SCHECK_PARTIAL();              SCHECK_PARTIAL();
3599              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
3600              }              }
3601            if (fc != *eptr++) RRETURN(MATCH_NOMATCH);            if (fc != RAWUCHARINCTEST(eptr)) RRETURN(MATCH_NOMATCH);
3602            }            }
3603          /* Control never gets here */          /* Control never gets here */
3604          }          }
# Line 3384  for (;;) Line 3612  for (;;)
3612              SCHECK_PARTIAL();              SCHECK_PARTIAL();
3613              break;              break;
3614              }              }
3615            if (fc != *eptr) break;            if (fc != RAWUCHARTEST(eptr)) break;
3616            eptr++;            eptr++;
3617            }            }
3618          if (possessive) continue;          if (possessive) continue;    /* No backtracking */
3619            for (;;)
         while (eptr >= pp)  
3620            {            {
3621              if (eptr == pp) goto TAIL_RECURSE;
3622            RMATCH(eptr, ecode, offset_top, md, eptrb, RM27);            RMATCH(eptr, ecode, offset_top, md, eptrb, RM27);
3623            eptr--;            eptr--;
3624            if (rrc != MATCH_NOMATCH) RRETURN(rrc);            if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3625            }            }
3626          RRETURN(MATCH_NOMATCH);          /* Control never gets here */
3627          }          }
3628        }        }
3629      /* Control never gets here */      /* Control never gets here */
# Line 3410  for (;;) Line 3638  for (;;)
3638        SCHECK_PARTIAL();        SCHECK_PARTIAL();
3639        RRETURN(MATCH_NOMATCH);        RRETURN(MATCH_NOMATCH);
3640        }        }
3641      ecode++;  #ifdef SUPPORT_UTF
3642      GETCHARINCTEST(c, eptr);      if (utf)
     if (op == OP_NOTI)         /* The caseless case */  
3643        {        {
3644  #ifdef SUPPORT_UTF8        register pcre_uint32 ch, och;
3645        if (c < 256)  
3646  #endif        ecode++;
3647        c = md->lcc[c];        GETCHARINC(ch, ecode);
3648        if (md->lcc[*ecode++] == c) RRETURN(MATCH_NOMATCH);        GETCHARINC(c, eptr);
3649    
3650          if (op == OP_NOT)
3651            {
3652            if (ch == c) RRETURN(MATCH_NOMATCH);
3653            }
3654          else
3655            {
3656    #ifdef SUPPORT_UCP
3657            if (ch > 127)
3658              och = UCD_OTHERCASE(ch);
3659    #else
3660            if (ch > 127)
3661              och = ch;
3662    #endif /* SUPPORT_UCP */
3663            else
3664              och = TABLE_GET(ch, md->fcc, ch);
3665            if (ch == c || och == c) RRETURN(MATCH_NOMATCH);
3666            }
3667        }        }
3668      else    /* Caseful */      else
3669    #endif
3670        {        {
3671        if (*ecode++ == c) RRETURN(MATCH_NOMATCH);        register pcre_uint32 ch = ecode[1];
3672          c = *eptr++;
3673          if (ch == c || (op == OP_NOTI && TABLE_GET(ch, md->fcc, ch) == c))
3674            RRETURN(MATCH_NOMATCH);
3675          ecode += 2;
3676        }        }
3677      break;      break;
3678    
# Line 3436  for (;;) Line 3686  for (;;)
3686      case OP_NOTEXACT:      case OP_NOTEXACT:
3687      case OP_NOTEXACTI:      case OP_NOTEXACTI:
3688      min = max = GET2(ecode, 1);      min = max = GET2(ecode, 1);
3689      ecode += 3;      ecode += 1 + IMM2_SIZE;
3690      goto REPEATNOTCHAR;      goto REPEATNOTCHAR;
3691    
3692      case OP_NOTUPTO:      case OP_NOTUPTO:
# Line 3446  for (;;) Line 3696  for (;;)
3696      min = 0;      min = 0;
3697      max = GET2(ecode, 1);      max = GET2(ecode, 1);
3698      minimize = *ecode == OP_NOTMINUPTO || *ecode == OP_NOTMINUPTOI;      minimize = *ecode == OP_NOTMINUPTO || *ecode == OP_NOTMINUPTOI;
3699      ecode += 3;      ecode += 1 + IMM2_SIZE;
3700      goto REPEATNOTCHAR;      goto REPEATNOTCHAR;
3701    
3702      case OP_NOTPOSSTAR:      case OP_NOTPOSSTAR:
# Line 3478  for (;;) Line 3728  for (;;)
3728      possessive = TRUE;      possessive = TRUE;
3729      min = 0;      min = 0;
3730      max = GET2(ecode, 1);      max = GET2(ecode, 1);
3731      ecode += 3;      ecode += 1 + IMM2_SIZE;
3732      goto REPEATNOTCHAR;      goto REPEATNOTCHAR;
3733    
3734      case OP_NOTSTAR:      case OP_NOTSTAR:
# Line 3502  for (;;) Line 3752  for (;;)
3752      /* Common code for all repeated single-byte matches. */      /* Common code for all repeated single-byte matches. */
3753    
3754      REPEATNOTCHAR:      REPEATNOTCHAR:
3755      fc = *ecode++;      GETCHARINCTEST(fc, ecode);
3756    
3757      /* The code is duplicated for the caseless and caseful cases, for speed,      /* The code is duplicated for the caseless and caseful cases, for speed,
3758      since matching characters is likely to be quite common. First, ensure the      since matching characters is likely to be quite common. First, ensure the
# Line 3513  for (;;) Line 3763  for (;;)
3763      characters and work backwards. */      characters and work backwards. */
3764    
3765      DPRINTF(("negative matching %c{%d,%d} against subject %.*s\n", fc, min, max,      DPRINTF(("negative matching %c{%d,%d} against subject %.*s\n", fc, min, max,
3766        max, eptr));        max, (char *)eptr));
3767    
3768      if (op >= OP_NOTSTARI)     /* Caseless */      if (op >= OP_NOTSTARI)     /* Caseless */
3769        {        {
3770        fc = md->lcc[fc];  #ifdef SUPPORT_UTF
3771    #ifdef SUPPORT_UCP
3772          if (utf && fc > 127)
3773            foc = UCD_OTHERCASE(fc);
3774    #else
3775          if (utf && fc > 127)
3776            foc = fc;
3777    #endif /* SUPPORT_UCP */
3778          else
3779    #endif /* SUPPORT_UTF */
3780            foc = TABLE_GET(fc, md->fcc, fc);
3781    
3782  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF
3783        /* UTF-8 mode */        if (utf)
       if (utf8)  
3784          {          {
3785          register unsigned int d;          register pcre_uint32 d;
3786          for (i = 1; i <= min; i++)          for (i = 1; i <= min; i++)
3787            {            {
3788            if (eptr >= md->end_subject)            if (eptr >= md->end_subject)
# Line 3532  for (;;) Line 3791  for (;;)
3791              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
3792              }              }
3793            GETCHARINC(d, eptr);            GETCHARINC(d, eptr);
3794            if (d < 256) d = md->lcc[d];            if (fc == d || (unsigned int)foc == d) RRETURN(MATCH_NOMATCH);
           if (fc == d) RRETURN(MATCH_NOMATCH);  
3795            }            }
3796          }          }
3797        else        else
3798  #endif  #endif  /* SUPPORT_UTF */
3799          /* Not UTF mode */
       /* Not UTF-8 mode */  
3800          {          {
3801          for (i = 1; i <= min; i++)          for (i = 1; i <= min; i++)
3802            {            {
# Line 3548  for (;;) Line 3805  for (;;)
3805              SCHECK_PARTIAL();              SCHECK_PARTIAL();
3806              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
3807              }              }
3808            if (fc == md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH);            if (fc == *eptr || foc == *eptr) RRETURN(MATCH_NOMATCH);
3809              eptr++;
3810            }            }
3811          }          }
3812    
# Line 3556  for (;;) Line 3814  for (;;)
3814    
3815        if (minimize)        if (minimize)
3816          {          {
3817  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF
3818          /* UTF-8 mode */          if (utf)
         if (utf8)  
3819            {            {
3820            register unsigned int d;            register pcre_uint32 d;
3821            for (fi = min;; fi++)            for (fi = min;; fi++)
3822              {              {
3823              RMATCH(eptr, ecode, offset_top, md, eptrb, RM28);              RMATCH(eptr, ecode, offset_top, md, eptrb, RM28);
# Line 3572  for (;;) Line 3829  for (;;)
3829                RRETURN(MATCH_NOMATCH);                RRETURN(MATCH_NOMATCH);
3830                }                }
3831              GETCHARINC(d, eptr);              GETCHARINC(d, eptr);
3832              if (d < 256) d = md->lcc[d];              if (fc == d || (unsigned int)foc == d) RRETURN(MATCH_NOMATCH);
             if (fc == d) RRETURN(MATCH_NOMATCH);  
3833              }              }
3834            }            }
3835          else          else
3836  #endif  #endif  /*SUPPORT_UTF */
3837          /* Not UTF-8 mode */          /* Not UTF mode */
3838            {            {
3839            for (fi = min;; fi++)            for (fi = min;; fi++)
3840              {              {
# Line 3590  for (;;) Line 3846  for (;;)
3846                SCHECK_PARTIAL();                SCHECK_PARTIAL();
3847                RRETURN(MATCH_NOMATCH);                RRETURN(MATCH_NOMATCH);
3848                }                }
3849              if (fc == md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH);              if (fc == *eptr || foc == *eptr) RRETURN(MATCH_NOMATCH);
3850                eptr++;
3851              }              }
3852            }            }
3853          /* Control never gets here */          /* Control never gets here */
# Line 3602  for (;;) Line 3859  for (;;)
3859          {          {
3860          pp = eptr;          pp = eptr;
3861    
3862  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF
3863          /* UTF-8 mode */          if (utf)
         if (utf8)  
3864            {            {
3865            register unsigned int d;            register pcre_uint32 d;
3866            for (i = min; i < max; i++)            for (i = min; i < max; i++)
3867              {              {
3868              int len = 1;              int len = 1;
# Line 3616  for (;;) Line 3872  for (;;)
3872                break;                break;
3873                }                }
3874              GETCHARLEN(d, eptr, len);              GETCHARLEN(d, eptr, len);
3875              if (d < 256) d = md->lcc[d];              if (fc == d || (unsigned int)foc == d) break;
             if (fc == d) break;  
3876              eptr += len;              eptr += len;
3877              }              }
3878          if (possessive) continue;            if (possessive) continue;    /* No backtracking */
3879          for(;;)            for(;;)
3880              {              {
3881                if (eptr == pp) goto TAIL_RECURSE;
3882              RMATCH(eptr, ecode, offset_top, md, eptrb, RM30);              RMATCH(eptr, ecode, offset_top, md, eptrb, RM30);
3883              if (rrc != MATCH_NOMATCH) RRETURN(rrc);              if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3884              if (eptr-- == pp) break;        /* Stop if tried at original pos */              eptr--;
3885              BACKCHAR(eptr);              BACKCHAR(eptr);
3886              }              }
3887            }            }
3888          else          else
3889  #endif  #endif  /* SUPPORT_UTF */
3890          /* Not UTF-8 mode */          /* Not UTF mode */
3891            {            {
3892            for (i = min; i < max; i++)            for (i = min; i < max; i++)
3893              {              {
# Line 3640  for (;;) Line 3896  for (;;)
3896                SCHECK_PARTIAL();                SCHECK_PARTIAL();
3897                break;                break;
3898                }                }
3899              if (fc == md->lcc[*eptr]) break;              if (fc == *eptr || foc == *eptr) break;
3900              eptr++;              eptr++;
3901              }              }
3902            if (possessive) continue;            if (possessive) continue;    /* No backtracking */
3903            while (eptr >= pp)            for (;;)
3904              {              {
3905                if (eptr == pp) goto TAIL_RECURSE;
3906              RMATCH(eptr, ecode, offset_top, md, eptrb, RM31);              RMATCH(eptr, ecode, offset_top, md, eptrb, RM31);
3907              if (rrc != MATCH_NOMATCH) RRETURN(rrc);              if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3908              eptr--;              eptr--;
3909              }              }
3910            }            }
3911            /* Control never gets here */
         RRETURN(MATCH_NOMATCH);  
3912          }          }
       /* Control never gets here */  
3913        }        }
3914    
3915      /* Caseful comparisons */      /* Caseful comparisons */
3916    
3917      else      else
3918        {        {
3919  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF
3920        /* UTF-8 mode */        if (utf)
       if (utf8)  
3921          {          {
3922          register unsigned int d;          register pcre_uint32 d;
3923          for (i = 1; i <= min; i++)          for (i = 1; i <= min; i++)
3924            {            {
3925            if (eptr >= md->end_subject)            if (eptr >= md->end_subject)
# Line 3679  for (;;) Line 3933  for (;;)
3933          }          }
3934        else        else
3935  #endif  #endif
3936        /* Not UTF-8 mode */        /* Not UTF mode */
3937          {          {
3938          for (i = 1; i <= min; i++)          for (i = 1; i <= min; i++)
3939            {            {
# Line 3696  for (;;) Line 3950  for (;;)
3950    
3951        if (minimize)        if (minimize)
3952          {          {
3953  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF
3954          /* UTF-8 mode */          if (utf)
         if (utf8)  
3955            {            {
3956            register unsigned int d;            register pcre_uint32 d;
3957            for (fi = min;; fi++)            for (fi = min;; fi++)
3958              {              {
3959              RMATCH(eptr, ecode, offset_top, md, eptrb, RM32);              RMATCH(eptr, ecode, offset_top, md, eptrb, RM32);
# Line 3717  for (;;) Line 3970  for (;;)
3970            }            }
3971          else          else
3972  #endif  #endif
3973          /* Not UTF-8 mode */          /* Not UTF mode */
3974            {            {
3975            for (fi = min;; fi++)            for (fi = min;; fi++)
3976              {              {
# Line 3741  for (;;) Line 3994  for (;;)
3994          {          {
3995          pp = eptr;          pp = eptr;
3996    
3997  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF
3998          /* UTF-8 mode */          if (utf)
         if (utf8)  
3999            {            {
4000            register unsigned int d;            register pcre_uint32 d;
4001            for (i = min; i < max; i++)            for (i = min; i < max; i++)
4002              {              {
4003              int len = 1;              int len = 1;
# Line 3758  for (;;) Line 4010  for (;;)
4010              if (fc == d) break;              if (fc == d) break;
4011              eptr += len;              eptr += len;
4012              }              }
4013            if (possessive) continue;            if (possessive) continue;    /* No backtracking */
4014            for(;;)            for(;;)
4015              {              {
4016                if (eptr == pp) goto TAIL_RECURSE;
4017              RMATCH(eptr, ecode, offset_top, md, eptrb, RM34);              RMATCH(eptr, ecode, offset_top, md, eptrb, RM34);
4018              if (rrc != MATCH_NOMATCH) RRETURN(rrc);              if (rrc != MATCH_NOMATCH) RRETURN(rrc);
4019              if (eptr-- == pp) break;        /* Stop if tried at original pos */              eptr--;
4020              BACKCHAR(eptr);              BACKCHAR(eptr);
4021              }              }
4022            }            }
4023          else          else
4024  #endif  #endif
4025          /* Not UTF-8 mode */          /* Not UTF mode */
4026            {            {
4027            for (i = min; i < max; i++)            for (i = min; i < max; i++)
4028              {              {
# Line 3781  for (;;) Line 4034  for (;;)
4034              if (fc == *eptr) break;              if (fc == *eptr) break;
4035              eptr++;              eptr++;
4036              }              }
4037            if (possessive) continue;            if (possessive) continue;    /* No backtracking */
4038            while (eptr >= pp)            for (;;)
4039              {              {
4040                if (eptr == pp) goto TAIL_RECURSE;
4041              RMATCH(eptr, ecode, offset_top, md, eptrb, RM35);              RMATCH(eptr, ecode, offset_top, md, eptrb, RM35);
4042              if (rrc != MATCH_NOMATCH) RRETURN(rrc);              if (rrc != MATCH_NOMATCH) RRETURN(rrc);
4043              eptr--;              eptr--;
4044              }              }
4045            }            }
4046            /* Control never gets here */
         RRETURN(MATCH_NOMATCH);  
4047          }          }
4048        }        }
4049      /* Control never gets here */      /* Control never gets here */
# Line 3802  for (;;) Line 4055  for (;;)
4055      case OP_TYPEEXACT:      case OP_TYPEEXACT:
4056      min = max = GET2(ecode, 1);      min = max = GET2(ecode, 1);
4057      minimize = TRUE;      minimize = TRUE;
4058      ecode += 3;      ecode += 1 + IMM2_SIZE;
4059      goto REPEATTYPE;      goto REPEATTYPE;
4060    
4061      case OP_TYPEUPTO:      case OP_TYPEUPTO:
# Line 3810  for (;;) Line 4063  for (;;)
4063      min = 0;      min = 0;
4064      max = GET2(ecode, 1);      max = GET2(ecode, 1);
4065      minimize = *ecode == OP_TYPEMINUPTO;      minimize = *ecode == OP_TYPEMINUPTO;
4066      ecode += 3;      ecode += 1 + IMM2_SIZE;
4067      goto REPEATTYPE;      goto REPEATTYPE;
4068    
4069      case OP_TYPEPOSSTAR:      case OP_TYPEPOSSTAR:
# Line 3838  for (;;) Line 4091  for (;;)
4091      possessive = TRUE;      possessive = TRUE;
4092      min = 0;      min = 0;
4093      max = GET2(ecode, 1);      max = GET2(ecode, 1);
4094      ecode += 3;      ecode += 1 + IMM2_SIZE;
4095      goto REPEATTYPE;      goto REPEATTYPE;
4096    
4097      case OP_TYPESTAR:      case OP_TYPESTAR:
# Line 3972  for (;;) Line 4225  for (;;)
4225              }              }
4226            break;            break;
4227    
4228              /* Perl space used to exclude VT, but from Perl 5.18 it is included,
4229              which means that Perl space and POSIX space are now identical. PCRE
4230              was changed at release 8.34. */
4231    
4232            case PT_SPACE:    /* Perl space */            case PT_SPACE:    /* Perl space */
4233              case PT_PXSPACE:  /* POSIX space */
4234            for (i = 1; i <= min; i++)            for (i = 1; i <= min; i++)
4235              {              {
4236              if (eptr >= md->end_subject)              if (eptr >= md->end_subject)
# Line 3981  for (;;) Line 4239  for (;;)
4239                RRETURN(MATCH_NOMATCH);                RRETURN(MATCH_NOMATCH);
4240                }                }
4241              GETCHARINCTEST(c, eptr);              GETCHARINCTEST(c, eptr);
4242              if ((UCD_CATEGORY(c) == ucp_Z || c == CHAR_HT || c == CHAR_NL ||              switch(c)
4243                   c == CHAR_FF || c == CHAR_CR)                {
4244                     == prop_fail_result)                HSPACE_CASES:
4245                RRETURN(MATCH_NOMATCH);                VSPACE_CASES:
4246                  if (prop_fail_result) RRETURN(MATCH_NOMATCH);
4247                  break;
4248    
4249                  default:
4250                  if ((UCD_CATEGORY(c) == ucp_Z) == prop_fail_result)
4251                    RRETURN(MATCH_NOMATCH);
4252                  break;
4253                  }
4254              }              }
4255            break;            break;
4256    
4257            case PT_PXSPACE:  /* POSIX space */            case PT_WORD:
4258            for (i = 1; i <= min; i++)            for (i = 1; i <= min; i++)
4259              {              {
4260                int category;
4261              if (eptr >= md->end_subject)              if (eptr >= md->end_subject)
4262                {                {
4263                SCHECK_PARTIAL();                SCHECK_PARTIAL();
4264                RRETURN(MATCH_NOMATCH);                RRETURN(MATCH_NOMATCH);
4265                }                }
4266              GETCHARINCTEST(c, eptr);              GETCHARINCTEST(c, eptr);
4267              if ((UCD_CATEGORY(c) == ucp_Z || c == CHAR_HT || c == CHAR_NL ||              category = UCD_CATEGORY(c);
4268                   c == CHAR_VT || c == CHAR_FF || c == CHAR_CR)              if ((category == ucp_L || category == ucp_N || c == CHAR_UNDERSCORE)
4269                     == prop_fail_result)                     == prop_fail_result)
4270                RRETURN(MATCH_NOMATCH);                RRETURN(MATCH_NOMATCH);
4271              }              }
4272            break;            break;
4273    
4274            case PT_WORD:            case PT_CLIST:
4275            for (i = 1; i <= min; i++)            for (i = 1; i <= min; i++)
4276              {              {
4277              int category;              const pcre_uint32 *cp;
4278              if (eptr >= md->end_subject)              if (eptr >= md->end_subject)
4279                {                {
4280                SCHECK_PARTIAL();                SCHECK_PARTIAL();
4281                RRETURN(MATCH_NOMATCH);                RRETURN(MATCH_NOMATCH);
4282                }                }
4283              GETCHARINCTEST(c, eptr);              GETCHARINCTEST(c, eptr);
4284              category = UCD_CATEGORY(c);              cp = PRIV(ucd_caseless_sets) + prop_value;
4285              if ((category == ucp_L || category == ucp_N || c == CHAR_UNDERSCORE)              for (;;)
4286                     == prop_fail_result)                {
4287                  if (c < *cp)
4288                    { if (prop_fail_result) break; else { RRETURN(MATCH_NOMATCH); } }
4289                  if (c == *cp++)
4290                    { if (prop_fail_result) { RRETURN(MATCH_NOMATCH); } else break; }
4291                  }
4292                }
4293              break;
4294    
4295              case PT_UCNC:
4296              for (i = 1; i <= min; i++)
4297                {
4298                if (eptr >= md->end_subject)
4299                  {
4300                  SCHECK_PARTIAL();
4301                  RRETURN(MATCH_NOMATCH);
4302                  }
4303                GETCHARINCTEST(c, eptr);
4304                if ((c == CHAR_DOLLAR_SIGN || c == CHAR_COMMERCIAL_AT ||
4305                     c == CHAR_GRAVE_ACCENT || (c >= 0xa0 && c <= 0xd7ff) ||
4306                     c >= 0xe000) == prop_fail_result)
4307                RRETURN(MATCH_NOMATCH);                RRETURN(MATCH_NOMATCH);
4308              }              }
4309            break;            break;
# Line 4040  for (;;) Line 4327  for (;;)
4327              SCHECK_PARTIAL();              SCHECK_PARTIAL();
4328              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4329              }              }
4330            GETCHARINCTEST(c, eptr);            else
           if (UCD_CATEGORY(c) == ucp_M) RRETURN(MATCH_NOMATCH);  
           while (eptr < md->end_subject)  
4331              {              {
4332              int len = 1;              int lgb, rgb;
4333              if (!utf8) c = *eptr; else { GETCHARLEN(c, eptr, len); }              GETCHARINCTEST(c, eptr);
4334              if (UCD_CATEGORY(c) != ucp_M) break;              lgb = UCD_GRAPHBREAK(c);
4335              eptr += len;             while (eptr < md->end_subject)
4336                  {
4337                  int len = 1;
4338                  if (!utf) c = *eptr; else { GETCHARLEN(c, eptr, len); }
4339                  rgb = UCD_GRAPHBREAK(c);
4340                  if ((PRIV(ucp_gbtable)[lgb] & (1 << rgb)) == 0) break;
4341                  lgb = rgb;
4342                  eptr += len;
4343                  }
4344              }              }
4345              CHECK_PARTIAL();
4346            }            }
4347          }          }
4348    
# Line 4057  for (;;) Line 4351  for (;;)
4351    
4352  /* Handle all other cases when the coding is UTF-8 */  /* Handle all other cases when the coding is UTF-8 */
4353    
4354  #ifdef SUPPORT_UTF8  #ifdef SUPPORT_UTF
4355        if (utf8) switch(ctype)        if (utf) switch(ctype)
4356          {          {
4357          case OP_ANY:          case OP_ANY:
4358          for (i = 1; i <= min; i++)          for (i = 1; i <= min; i++)
# Line 4069  for (;;) Line 4363  for (;;)
4363              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4364              }              }
4365            if (IS_NEWLINE(eptr)) RRETURN(MATCH_NOMATCH);            if (IS_NEWLINE(eptr)) RRETURN(MATCH_NOMATCH);
4366              if (md->partial != 0 &&
4367                  eptr + 1 >= md->end_subject &&
4368                  NLBLOCK->nltype == NLTYPE_FIXED &&
4369                  NLBLOCK->nllen == 2 &&
4370                  RAWUCHAR(eptr) == NLBLOCK->nl[0])
4371                {
4372                md->hitend = TRUE;
4373                if (md->partial > 1) RRETURN(PCRE_ERROR_PARTIAL);
4374                }
4375            eptr++;            eptr++;
4376            while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++;            ACROSSCHAR(eptr < md->end_subject, *eptr, eptr++);
4377            }            }
4378          break;          break;
4379    
# Line 4083  for (;;) Line 4386  for (;;)
4386              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4387              }              }
4388            eptr++;            eptr++;
4389            while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++;            ACROSSCHAR(eptr < md->end_subject, *eptr, eptr++);
4390            }            }
4391          break;          break;
4392    
# Line 4105  for (;;) Line 4408  for (;;)
4408              {              {
4409              default: RRETURN(MATCH_NOMATCH);              default: RRETURN(MATCH_NOMATCH);
4410    
4411              case 0x000d:              case CHAR_CR:
4412              if (eptr < md->end_subject && *eptr == 0x0a) eptr++;              if (eptr < md->end_subject && RAWUCHAR(eptr) == CHAR_LF) eptr++;
4413              break;              break;
4414    
4415              case 0x000a:              case CHAR_LF:
4416              break;              break;
4417    
4418              case 0x000b:              case CHAR_VT:
4419              case 0x000c:              case CHAR_FF:
4420              case 0x0085:              case CHAR_NEL:
4421    #ifndef EBCDIC
4422              case 0x2028:              case 0x2028:
4423              case 0x2029:              case 0x2029:
4424    #endif  /* Not EBCDIC */
4425              if (md->bsr_anycrlf) RRETURN(MATCH_NOMATCH);              if (md->bsr_anycrlf) RRETURN(MATCH_NOMATCH);
4426              break;              break;
4427              }              }
# Line 4134  for (;;) Line 4439  for (;;)
4439            GETCHARINC(c, eptr);            GETCHARINC(c, eptr);
4440            switch(c)            switch(c)
4441              {              {
4442                HSPACE_CASES: RRETURN(MATCH_NOMATCH);  /* Byte and multibyte cases */
4443              default: break;              default: break;
             case 0x09:      /* HT */  
             case 0x20:      /* SPACE */  
             case 0xa0:      /* NBSP */  
             case 0x1680:    /* OGHAM SPACE MARK */  
             case 0x180e:    /* MONGOLIAN VOWEL SEPARATOR */  
             case 0x2000:    /* EN QUAD */  
             case 0x2001:    /* EM QUAD */  
             case 0x2002:    /* EN SPACE */  
             case 0x2003:    /* EM SPACE */  
             case 0x2004:    /* THREE-PER-EM SPACE */  
             case 0x2005:    /* FOUR-PER-EM SPACE */  
             case 0x2006:    /* SIX-PER-EM SPACE */  
             case 0x2007:    /* FIGURE SPACE */  
             case 0x2008:    /* PUNCTUATION SPACE */  
             case 0x2009:    /* THIN SPACE */  
             case 0x200A:    /* HAIR SPACE */  
             case 0x202f:    /* NARROW NO-BREAK SPACE */  
             case 0x205f:    /* MEDIUM MATHEMATICAL SPACE */  
             case 0x3000:    /* IDEOGRAPHIC SPACE */  
             RRETURN(MATCH_NOMATCH);  
4444              }              }
4445            }            }
4446          break;          break;
# Line 4170  for (;;) Line 4456  for (;;)
4456            GETCHARINC(c, eptr);            GETCHARINC(c, eptr);
4457            switch(c)            switch(c)
4458              {              {
4459                HSPACE_CASES: break;  /* Byte and multibyte cases */
4460              default: RRETURN(MATCH_NOMATCH);              default: RRETURN(MATCH_NOMATCH);
             case 0x09:      /* HT */  
             case 0x20:      /* SPACE */  
             case 0xa0:      /* NBSP */  
             case 0x1680:    /* OGHAM SPACE MARK */  
             case 0x180e:    /* MONGOLIAN VOWEL SEPARATOR */  
             case 0x2000:    /* EN QUAD */  
             case 0x2001:    /* EM QUAD */  
             case 0x2002:    /* EN SPACE */  
             case 0x2003:    /* EM SPACE */  
             case 0x2004:    /* THREE-PER-EM SPACE */  
             case 0x2005:    /* FOUR-PER-EM SPACE */  
             case 0x2006:    /* SIX-PER-EM SPACE */  
             case 0x2007:    /* FIGURE SPACE */  
             case 0x2008:    /* PUNCTUATION SPACE */  
             case 0x2009:    /* THIN SPACE */  
             case 0x200A:    /* HAIR SPACE */  
             case 0x202f:    /* NARROW NO-BREAK SPACE */  
             case 0x205f:    /* MEDIUM MATHEMATICAL SPACE */  
             case 0x3000:    /* IDEOGRAPHIC SPACE */  
             break;  
4461              }              }
4462            }            }
4463          break;          break;
# Line 4206  for (;;) Line 4473  for (;;)
4473            GETCHARINC(c, eptr);            GETCHARINC(c, eptr);
4474            switch(c)            switch(c)
4475              {              {
4476                VSPACE_CASES: RRETURN(MATCH_NOMATCH);
4477              default: break;              default: break;
             case 0x0a:      /* LF */  
             case 0x0b:      /* VT */  
             case 0x0c:      /* FF */  
             case 0x0d:      /* CR */  
             case 0x85:      /* NEL */  
             case 0x2028:    /* LINE SEPARATOR */  
             case 0x2029:    /* PARAGRAPH SEPARATOR */  
             RRETURN(MATCH_NOMATCH);  
4478              }              }
4479            }            }
4480          break;          break;
# Line 4230  for (;;) Line 4490  for (;;)
4490            GETCHARINC(c, eptr);            GETCHARINC(c, eptr);
4491            switch(c)            switch(c)
4492              {              {
4493                VSPACE_CASES: break;
4494              default: RRETURN(MATCH_NOMATCH);              default: RRETURN(MATCH_NOMATCH);
             case 0x0a:      /* LF */  
             case 0x0b:      /* VT */  
             case 0x0c:      /* FF */  
             case 0x0d:      /* CR */  
             case 0x85:      /* NEL */  
             case 0x2028:    /* LINE SEPARATOR */  
             case 0x2029:    /* PARAGRAPH SEPARATOR */  
             break;  
4495              }              }
4496            }            }
4497          break;          break;
# Line 4260  for (;;) Line 4513  for (;;)
4513          case OP_DIGIT:          case OP_DIGIT:
4514          for (i = 1; i <= min; i++)          for (i = 1; i <= min; i++)
4515            {            {
4516              pcre_uint32 cc;
4517            if (eptr >= md->end_subject)            if (eptr >= md->end_subject)
4518              {              {
4519              SCHECK_PARTIAL();              SCHECK_PARTIAL();
4520              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4521              }              }
4522            if (*eptr >= 128 || (md->ctypes[*eptr++] & ctype_digit) == 0)            cc = RAWUCHAR(eptr);
4523              if (cc >= 128 || (md->ctypes[cc] & ctype_digit) == 0)
4524              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4525              eptr++;
4526            /* No need to skip more bytes - we know it's a 1-byte character */            /* No need to skip more bytes - we know it's a 1-byte character */
4527            }            }
4528          break;          break;
# Line 4274  for (;;) Line 4530  for (;;)
4530          case OP_NOT_WHITESPACE:          case OP_NOT_WHITESPACE:
4531          for (i = 1; i <= min; i++)          for (i = 1; i <= min; i++)
4532            {            {
4533              pcre_uint32 cc;
4534            if (eptr >= md->end_subject)            if (eptr >= md->end_subject)
4535              {              {
4536              SCHECK_PARTIAL();              SCHECK_PARTIAL();
4537              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4538              }              }
4539            if (*eptr < 128 && (md->ctypes[*eptr] & ctype_space) != 0)            cc = RAWUCHAR(eptr);
4540              if (cc < 128 && (md->ctypes[cc] & ctype_space) != 0)
4541              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4542            while (++eptr < md->end_subject && (*eptr & 0xc0) == 0x80);            eptr++;
4543              ACROSSCHAR(eptr < md->end_subject, *eptr, eptr++);
4544            }            }
4545          break;          break;
4546    
4547          case OP_WHITESPACE:          case OP_WHITESPACE:
4548          for (i = 1; i <= min; i++)          for (i = 1; i <= min; i++)
4549            {            {
4550              pcre_uint32 cc;
4551            if (eptr >= md->end_subject)            if (eptr >= md->end_subject)
4552              {              {
4553              SCHECK_PARTIAL();              SCHECK_PARTIAL();
4554              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4555              }              }
4556            if (*eptr >= 128 || (md->ctypes[*eptr++] & ctype_space) == 0)            cc = RAWUCHAR(eptr);
4557              if (cc >= 128 || (md->ctypes[cc] & ctype_space) == 0)
4558              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4559              eptr++;
4560            /* No need to skip more bytes - we know it's a 1-byte character */            /* No need to skip more bytes - we know it's a 1-byte character */
4561            }            }
4562          break;          break;
# Line 4302  for (;;) Line 4564  for (;;)
4564          case OP_NOT_WORDCHAR:          case OP_NOT_WORDCHAR:
4565          for (i = 1; i <= min; i++)          for (i = 1; i <= min; i++)
4566            {            {
4567              pcre_uint32 cc;
4568            if (eptr >= md->end_subject)            if (eptr >= md->end_subject)
4569              {              {
4570              SCHECK_PARTIAL();              SCHECK_PARTIAL();
4571              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4572              }              }
4573            if (*eptr < 128 && (md->ctypes[*eptr] & ctype_word) != 0)            cc = RAWUCHAR(eptr);
4574              if (cc < 128 && (md->ctypes[cc] & ctype_word) != 0)
4575              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4576            while (++eptr < md->end_subject && (*eptr & 0xc0) == 0x80);            eptr++;
4577              ACROSSCHAR(eptr < md->end_subject, *eptr, eptr++);
4578            }            }
4579          break;          break;
4580    
4581          case OP_WORDCHAR:          case OP_WORDCHAR:
4582          for (i = 1; i <= min; i++)          for (i = 1; i <= min; i++)
4583            {            {
4584              pcre_uint32 cc;
4585            if (eptr >= md->end_subject)            if (eptr >= md->end_subject)
4586              {              {
4587              SCHECK_PARTIAL();              SCHECK_PARTIAL();
4588              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4589              }              }
4590            if (*eptr >= 128 || (md->ctypes[*eptr++] & ctype_word) == 0)            cc = RAWUCHAR(eptr);
4591              if (cc >= 128 || (md->ctypes[cc] & ctype_word) == 0)
4592              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4593              eptr++;
4594            /* No need to skip more bytes - we know it's a 1-byte character */            /* No need to skip more bytes - we know it's a 1-byte character */
4595            }            }
4596          break;          break;
# Line 4332  for (;;) Line 4600  for (;;)
4600          }  /* End switch(ctype) */          }  /* End switch(ctype) */
4601    
4602        else        else
4603  #endif     /* SUPPORT_UTF8 */  #endif     /* SUPPORT_UTF */
4604    
4605        /* Code for the non-UTF-8 case for minimum matching of operators other        /* Code for the non-UTF-8 case for minimum matching of operators other
4606        than OP_PROP and OP_NOTPROP. */        than OP_PROP and OP_NOTPROP. */
# Line 4348  for (;;) Line 4616  for (;;)
4616              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4617              }              }
4618            if (IS_NEWLINE(eptr)) RRETURN(MATCH_NOMATCH);            if (IS_NEWLINE(eptr)) RRETURN(MATCH_NOMATCH);
4619              if (md->partial != 0 &&
4620                  eptr + 1 >= md->end_subject &&
4621                  NLBLOCK->nltype == NLTYPE_FIXED &&
4622                  NLBLOCK->nllen == 2 &&
4623                  *eptr == NLBLOCK->nl[0])
4624                {
4625                md->hitend = TRUE;
4626                if (md->partial > 1) RRETURN(PCRE_ERROR_PARTIAL);
4627                }
4628            eptr++;            eptr++;
4629            }            }
4630          break;          break;
# Line 4382  for (;;) Line 4659  for (;;)
4659              {              {
4660              default: RRETURN(MATCH_NOMATCH);              default: RRETURN(MATCH_NOMATCH);
4661    
4662              case 0x000d:              case CHAR_CR:
4663              if (eptr < md->end_subject && *eptr == 0x0a) eptr++;              if (eptr < md->end_subject && *eptr == CHAR_LF) eptr++;
4664              break;              break;
4665    
4666              case 0x000a:              case CHAR_LF:
4667              break;              break;
4668    
4669              case 0x000b:              case CHAR_VT:
4670              case 0x000c:              case CHAR_FF:
4671              case 0x0085:              case CHAR_NEL:
4672    #if defined COMPILE_PCRE16 || defined COMPILE_PCRE32
4673                case 0x2028:
4674                case 0x2029:
4675    #endif
4676              if (md->bsr_anycrlf) RRETURN(MATCH_NOMATCH);              if (md->bsr_anycrlf) RRETURN(MATCH_NOMATCH);
4677              break;              break;
4678              }              }
# Line 4409  for (;;) Line 4690  for (;;)
4690            switch(*eptr++)            switch(*eptr++)
4691              {              {
4692              default: break;              default: break;
4693              case 0x09:      /* HT */              HSPACE_BYTE_CASES:
4694              case 0x20:      /* SPACE */  #if defined COMPILE_PCRE16 || defined COMPILE_PCRE32
4695              case 0xa0:      /* NBSP */              HSPACE_MULTIBYTE_CASES:
4696    #endif
4697              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4698              }              }
4699            }            }
# Line 4428  for (;;) Line 4710  for (;;)
4710            switch(*eptr++)            switch(*eptr++)
4711              {              {
4712              default: RRETURN(MATCH_NOMATCH);              default: RRETURN(MATCH_NOMATCH);
4713              case 0x09:      /* HT */              HSPACE_BYTE_CASES:
4714              case 0x20:      /* SPACE */  #if defined COMPILE_PCRE16 || defined COMPILE_PCRE32
4715              case 0xa0:      /* NBSP */              HSPACE_MULTIBYTE_CASES:
4716    #endif
4717              break;              break;
4718              }              }
4719            }            }
# Line 4446  for (;;) Line 4729  for (;;)
4729              }              }
4730            switch(*eptr++)            switch(*eptr++)
4731              {              {
4732              default: break;              VSPACE_BYTE_CASES:
4733              case 0x0a:      /* LF */  #if defined COMPILE_PCRE16 || defined COMPILE_PCRE32
4734              case 0x0b:      /* VT */              VSPACE_MULTIBYTE_CASES:
4735              case 0x0c:      /* FF */  #endif
             case 0x0d:      /* CR */  
             case 0x85:      /* NEL */  
4736              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4737                default: break;
4738              }              }
4739            }            }
4740          break;          break;
# Line 4468  for (;;) Line 4750  for (;;)
4750            switch(*eptr++)            switch(*eptr++)
4751              {              {
4752              default: RRETURN(MATCH_NOMATCH);              default: RRETURN(MATCH_NOMATCH);
4753              case 0x0a:      /* LF */              VSPACE_BYTE_CASES:
4754              case 0x0b:      /* VT */  #if defined COMPILE_PCRE16 || defined COMPILE_PCRE32
4755              case 0x0c:      /* FF */              VSPACE_MULTIBYTE_CASES:
4756              case 0x0d:      /* CR */  #endif
             case 0x85:      /* NEL */  
4757              break;              break;
4758              }              }
4759            }            }
# Line 4486  for (;;) Line 4767  for (;;)
4767              SCHECK_PARTIAL();              SCHECK_PARTIAL();
4768              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4769              }              }
4770            if ((md->ctypes[*eptr++] & ctype_digit) != 0) RRETURN(MATCH_NOMATCH);            if (MAX_255(*eptr) && (md->ctypes[*eptr] & ctype_digit) != 0)
4771                RRETURN(MATCH_NOMATCH);
4772              eptr++;
4773            }            }
4774          break;          break;
4775    
# Line 4498  for (;;) Line 4781  for (;;)
4781              SCHECK_PARTIAL();              SCHECK_PARTIAL();
4782              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4783              }              }
4784            if ((md->ctypes[*eptr++] & ctype_digit) == 0) RRETURN(MATCH_NOMATCH);            if (!MAX_255(*eptr) || (md->ctypes[*eptr] & ctype_digit) == 0)
4785                RRETURN(MATCH_NOMATCH);
4786              eptr++;
4787            }            }
4788          break;          break;
4789    
# Line 4510  for (;;) Line 4795  for (;;)
4795              SCHECK_PARTIAL();              SCHECK_PARTIAL();
4796              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4797              }              }
4798            if ((md->ctypes[*eptr++] & ctype_space) != 0) RRETURN(MATCH_NOMATCH);            if (MAX_255(*eptr) && (md->ctypes[*eptr] & ctype_space) != 0)
4799                RRETURN(MATCH_NOMATCH);
4800              eptr++;
4801            }            }
4802          break;          break;
4803    
# Line 4522  for (;;) Line 4809  for (;;)
4809              SCHECK_PARTIAL();              SCHECK_PARTIAL();
4810              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4811              }              }
4812            if ((md->ctypes[*eptr++] & ctype_space) == 0) RRETURN(MATCH_NOMATCH);            if (!MAX_255(*eptr) || (md->ctypes[*eptr] & ctype_space) == 0)
4813                RRETURN(MATCH_NOMATCH);
4814              eptr++;
4815            }            }
4816          break;          break;
4817    
# Line 4534  for (;;) Line 4823  for (;;)
4823              SCHECK_PARTIAL();              SCHECK_PARTIAL();
4824              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4825              }              }
4826            if ((md->ctypes[*eptr++] & ctype_word) != 0)            if (MAX_255(*eptr) && (md->ctypes[*eptr] & ctype_word) != 0)
4827              RRETURN(MATCH_NOMATCH);              RRETURN(MATCH_NOMATCH);
4828              eptr++;
4829            }            }
4830          break;          break;
4831