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

Contents of /code/trunk/pcre_exec.c

Parent Directory Parent Directory | Revision Log Revision Log


Revision 888 - (show annotations)
Tue Jan 17 14:43:23 2012 UTC (3 years, 7 months ago) by ph10
File MIME type: text/plain
File size: 211788 byte(s)
Error occurred while calculating annotation data.
Fix MARK bug for assertions.
1 /*************************************************
2 * Perl-Compatible Regular Expressions *
3 *************************************************/
4
5 /* PCRE is a library of functions to support regular expressions whose syntax
6 and semantics are as close as possible to those of the Perl 5 language.
7
8 Written by Philip Hazel
9 Copyright (c) 1997-2012 University of Cambridge
10
11 -----------------------------------------------------------------------------
12 Redistribution and use in source and binary forms, with or without
13 modification, are permitted provided that the following conditions are met:
14
15 * Redistributions of source code must retain the above copyright notice,
16 this list of conditions and the following disclaimer.
17
18 * Redistributions in binary form must reproduce the above copyright
19 notice, this list of conditions and the following disclaimer in the
20 documentation and/or other materials provided with the distribution.
21
22 * Neither the name of the University of Cambridge nor the names of its
23 contributors may be used to endorse or promote products derived from
24 this software without specific prior written permission.
25
26 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
27 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
30 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 POSSIBILITY OF SUCH DAMAGE.
37 -----------------------------------------------------------------------------
38 */
39
40
41 /* This module contains pcre_exec(), the externally visible function that does
42 pattern matching using an NFA algorithm, trying to mimic Perl as closely as
43 possible. There are also some static supporting functions. */
44
45 #ifdef HAVE_CONFIG_H
46 #include "config.h"
47 #endif
48
49 #define NLBLOCK md /* Block containing newline information */
50 #define PSSTART start_subject /* Field containing processed string start */
51 #define PSEND end_subject /* Field containing processed string end */
52
53 #include "pcre_internal.h"
54
55 /* Undefine some potentially clashing cpp symbols */
56
57 #undef min
58 #undef max
59
60 /* Values for setting in md->match_function_type to indicate two special types
61 of call to match(). We do it this way to save on using another stack variable,
62 as stack usage is to be discouraged. */
63
64 #define MATCH_CONDASSERT 1 /* Called to check a condition assertion */
65 #define MATCH_CBEGROUP 2 /* Could-be-empty unlimited repeat group */
66
67 /* Non-error returns from the match() function. Error returns are externally
68 defined PCRE_ERROR_xxx codes, which are all negative. */
69
70 #define MATCH_MATCH 1
71 #define MATCH_NOMATCH 0
72
73 /* Special internal returns from the match() function. Make them sufficiently
74 negative to avoid the external error codes. */
75
76 #define MATCH_ACCEPT (-999)
77 #define MATCH_COMMIT (-998)
78 #define MATCH_KETRPOS (-997)
79 #define MATCH_ONCE (-996)
80 #define MATCH_PRUNE (-995)
81 #define MATCH_SKIP (-994)
82 #define MATCH_SKIP_ARG (-993)
83 #define MATCH_THEN (-992)
84
85 /* Maximum number of ints of offset to save on the stack for recursive calls.
86 If the offset vector is bigger, malloc is used. This should be a multiple of 3,
87 because the offset vector is always a multiple of 3 long. */
88
89 #define REC_STACK_SAVE_MAX 30
90
91 /* Min and max values for the common repeats; for the maxima, 0 => infinity */
92
93 static const char rep_min[] = { 0, 0, 1, 1, 0, 0 };
94 static const char rep_max[] = { 0, 0, 0, 0, 1, 1 };
95
96
97
98 #ifdef PCRE_DEBUG
99 /*************************************************
100 * Debugging function to print chars *
101 *************************************************/
102
103 /* Print a sequence of chars in printable format, stopping at the end of the
104 subject if the requested.
105
106 Arguments:
107 p points to characters
108 length number to print
109 is_subject TRUE if printing from within md->start_subject
110 md pointer to matching data block, if is_subject is TRUE
111
112 Returns: nothing
113 */
114
115 static void
116 pchars(const pcre_uchar *p, int length, BOOL is_subject, match_data *md)
117 {
118 unsigned int c;
119 if (is_subject && length > md->end_subject - p) length = md->end_subject - p;
120 while (length-- > 0)
121 if (isprint(c = *(p++))) printf("%c", c); else printf("\\x%02x", c);
122 }
123 #endif
124
125
126
127 /*************************************************
128 * Match a back-reference *
129 *************************************************/
130
131 /* Normally, if a back reference hasn't been set, the length that is passed is
132 negative, so the match always fails. However, in JavaScript compatibility mode,
133 the length passed is zero. Note that in caseless UTF-8 mode, the number of
134 subject bytes matched may be different to the number of reference bytes.
135
136 Arguments:
137 offset index into the offset vector
138 eptr pointer into the subject
139 length length of reference to be matched (number of bytes)
140 md points to match data block
141 caseless TRUE if caseless
142
143 Returns: < 0 if not matched, otherwise the number of subject bytes matched
144 */
145
146 static int
147 match_ref(int offset, register PCRE_PUCHAR eptr, int length, match_data *md,
148 BOOL caseless)
149 {
150 PCRE_PUCHAR eptr_start = eptr;
151 register PCRE_PUCHAR p = md->start_subject + md->offset_vector[offset];
152
153 #ifdef PCRE_DEBUG
154 if (eptr >= md->end_subject)
155 printf("matching subject <null>");
156 else
157 {
158 printf("matching subject ");
159 pchars(eptr, length, TRUE, md);
160 }
161 printf(" against backref ");
162 pchars(p, length, FALSE, md);
163 printf("\n");
164 #endif
165
166 /* Always fail if reference not set (and not JavaScript compatible). */
167
168 if (length < 0) return -1;
169
170 /* Separate the caseless case for speed. In UTF-8 mode we can only do this
171 properly if Unicode properties are supported. Otherwise, we can check only
172 ASCII characters. */
173
174 if (caseless)
175 {
176 #ifdef SUPPORT_UTF
177 #ifdef SUPPORT_UCP
178 if (md->utf)
179 {
180 /* Match characters up to the end of the reference. NOTE: the number of
181 bytes matched may differ, because there are some characters whose upper and
182 lower case versions code as different numbers of bytes. For example, U+023A
183 (2 bytes in UTF-8) is the upper case version of U+2C65 (3 bytes in UTF-8);
184 a sequence of 3 of the former uses 6 bytes, as does a sequence of two of
185 the latter. It is important, therefore, to check the length along the
186 reference, not along the subject (earlier code did this wrong). */
187
188 PCRE_PUCHAR endptr = p + length;
189 while (p < endptr)
190 {
191 int c, d;
192 if (eptr >= md->end_subject) return -1;
193 GETCHARINC(c, eptr);
194 GETCHARINC(d, p);
195 if (c != d && c != UCD_OTHERCASE(d)) return -1;
196 }
197 }
198 else
199 #endif
200 #endif
201
202 /* The same code works when not in UTF-8 mode and in UTF-8 mode when there
203 is no UCP support. */
204 {
205 if (eptr + length > md->end_subject) return -1;
206 while (length-- > 0)
207 {
208 if (TABLE_GET(*p, md->lcc, *p) != TABLE_GET(*eptr, md->lcc, *eptr)) return -1;
209 p++;
210 eptr++;
211 }
212 }
213 }
214
215 /* In the caseful case, we can just compare the bytes, whether or not we
216 are in UTF-8 mode. */
217
218 else
219 {
220 if (eptr + length > md->end_subject) return -1;
221 while (length-- > 0) if (*p++ != *eptr++) return -1;
222 }
223
224 return (int)(eptr - eptr_start);
225 }
226
227
228
229 /***************************************************************************
230 ****************************************************************************
231 RECURSION IN THE match() FUNCTION
232
233 The match() function is highly recursive, though not every recursive call
234 increases the recursive depth. Nevertheless, some regular expressions can cause
235 it to recurse to a great depth. I was writing for Unix, so I just let it call
236 itself recursively. This uses the stack for saving everything that has to be
237 saved for a recursive call. On Unix, the stack can be large, and this works
238 fine.
239
240 It turns out that on some non-Unix-like systems there are problems with
241 programs that use a lot of stack. (This despite the fact that every last chip
242 has oodles of memory these days, and techniques for extending the stack have
243 been known for decades.) So....
244
245 There is a fudge, triggered by defining NO_RECURSE, which avoids recursive
246 calls by keeping local variables that need to be preserved in blocks of memory
247 obtained from malloc() instead instead of on the stack. Macros are used to
248 achieve this so that the actual code doesn't look very different to what it
249 always used to.
250
251 The original heap-recursive code used longjmp(). However, it seems that this
252 can be very slow on some operating systems. Following a suggestion from Stan
253 Switzer, the use of longjmp() has been abolished, at the cost of having to
254 provide a unique number for each call to RMATCH. There is no way of generating
255 a sequence of numbers at compile time in C. I have given them names, to make
256 them stand out more clearly.
257
258 Crude tests on x86 Linux show a small speedup of around 5-8%. However, on
259 FreeBSD, avoiding longjmp() more than halves the time taken to run the standard
260 tests. Furthermore, not using longjmp() means that local dynamic variables
261 don't have indeterminate values; this has meant that the frame size can be
262 reduced because the result can be "passed back" by straight setting of the
263 variable instead of being passed in the frame.
264 ****************************************************************************
265 ***************************************************************************/
266
267 /* Numbers for RMATCH calls. When this list is changed, the code at HEAP_RETURN
268 below must be updated in sync. */
269
270 enum { RM1=1, RM2, RM3, RM4, RM5, RM6, RM7, RM8, RM9, RM10,
271 RM11, RM12, RM13, RM14, RM15, RM16, RM17, RM18, RM19, RM20,
272 RM21, RM22, RM23, RM24, RM25, RM26, RM27, RM28, RM29, RM30,
273 RM31, RM32, RM33, RM34, RM35, RM36, RM37, RM38, RM39, RM40,
274 RM41, RM42, RM43, RM44, RM45, RM46, RM47, RM48, RM49, RM50,
275 RM51, RM52, RM53, RM54, RM55, RM56, RM57, RM58, RM59, RM60,
276 RM61, RM62, RM63, RM64, RM65, RM66 };
277
278 /* These versions of the macros use the stack, as normal. There are debugging
279 versions and production versions. Note that the "rw" argument of RMATCH isn't
280 actually used in this definition. */
281
282 #ifndef NO_RECURSE
283 #define REGISTER register
284
285 #ifdef PCRE_DEBUG
286 #define RMATCH(ra,rb,rc,rd,re,rw) \
287 { \
288 printf("match() called in line %d\n", __LINE__); \
289 rrc = match(ra,rb,mstart,rc,rd,re,rdepth+1); \
290 printf("to line %d\n", __LINE__); \
291 }
292 #define RRETURN(ra) \
293 { \
294 printf("match() returned %d from line %d ", ra, __LINE__); \
295 return ra; \
296 }
297 #else
298 #define RMATCH(ra,rb,rc,rd,re,rw) \
299 rrc = match(ra,rb,mstart,rc,rd,re,rdepth+1)
300 #define RRETURN(ra) return ra
301 #endif
302
303 #else
304
305
306 /* These versions of the macros manage a private stack on the heap. Note that
307 the "rd" argument of RMATCH isn't actually used in this definition. It's the md
308 argument of match(), which never changes. */
309
310 #define REGISTER
311
312 #define RMATCH(ra,rb,rc,rd,re,rw)\
313 {\
314 heapframe *newframe = (heapframe *)(PUBL(stack_malloc))(sizeof(heapframe));\
315 if (newframe == NULL) RRETURN(PCRE_ERROR_NOMEMORY);\
316 frame->Xwhere = rw; \
317 newframe->Xeptr = ra;\
318 newframe->Xecode = rb;\
319 newframe->Xmstart = mstart;\
320 newframe->Xoffset_top = rc;\
321 newframe->Xeptrb = re;\
322 newframe->Xrdepth = frame->Xrdepth + 1;\
323 newframe->Xprevframe = frame;\
324 frame = newframe;\
325 DPRINTF(("restarting from line %d\n", __LINE__));\
326 goto HEAP_RECURSE;\
327 L_##rw:\
328 DPRINTF(("jumped back to line %d\n", __LINE__));\
329 }
330
331 #define RRETURN(ra)\
332 {\
333 heapframe *oldframe = frame;\
334 frame = oldframe->Xprevframe;\
335 (PUBL(stack_free))(oldframe);\
336 if (frame != NULL)\
337 {\
338 rrc = ra;\
339 goto HEAP_RETURN;\
340 }\
341 return ra;\
342 }
343
344
345 /* Structure for remembering the local variables in a private frame */
346
347 typedef struct heapframe {
348 struct heapframe *Xprevframe;
349
350 /* Function arguments that may change */
351
352 PCRE_PUCHAR Xeptr;
353 const pcre_uchar *Xecode;
354 PCRE_PUCHAR Xmstart;
355 int Xoffset_top;
356 eptrblock *Xeptrb;
357 unsigned int Xrdepth;
358
359 /* Function local variables */
360
361 PCRE_PUCHAR Xcallpat;
362 #ifdef SUPPORT_UTF
363 PCRE_PUCHAR Xcharptr;
364 #endif
365 PCRE_PUCHAR Xdata;
366 PCRE_PUCHAR Xnext;
367 PCRE_PUCHAR Xpp;
368 PCRE_PUCHAR Xprev;
369 PCRE_PUCHAR Xsaved_eptr;
370
371 recursion_info Xnew_recursive;
372
373 BOOL Xcur_is_word;
374 BOOL Xcondition;
375 BOOL Xprev_is_word;
376
377 #ifdef SUPPORT_UCP
378 int Xprop_type;
379 int Xprop_value;
380 int Xprop_fail_result;
381 int Xoclength;
382 pcre_uchar Xocchars[6];
383 #endif
384
385 int Xcodelink;
386 int Xctype;
387 unsigned int Xfc;
388 int Xfi;
389 int Xlength;
390 int Xmax;
391 int Xmin;
392 int Xnumber;
393 int Xoffset;
394 int Xop;
395 int Xsave_capture_last;
396 int Xsave_offset1, Xsave_offset2, Xsave_offset3;
397 int Xstacksave[REC_STACK_SAVE_MAX];
398
399 eptrblock Xnewptrb;
400
401 /* Where to jump back to */
402
403 int Xwhere;
404
405 } heapframe;
406
407 #endif
408
409
410 /***************************************************************************
411 ***************************************************************************/
412
413
414
415 /*************************************************
416 * Match from current position *
417 *************************************************/
418
419 /* This function is called recursively in many circumstances. Whenever it
420 returns a negative (error) response, the outer incarnation must also return the
421 same response. */
422
423 /* These macros pack up tests that are used for partial matching, and which
424 appear several times in the code. We set the "hit end" flag if the pointer is
425 at the end of the subject and also past the start of the subject (i.e.
426 something has been matched). For hard partial matching, we then return
427 immediately. The second one is used when we already know we are past the end of
428 the subject. */
429
430 #define CHECK_PARTIAL()\
431 if (md->partial != 0 && eptr >= md->end_subject && \
432 eptr > md->start_used_ptr) \
433 { \
434 md->hitend = TRUE; \
435 if (md->partial > 1) RRETURN(PCRE_ERROR_PARTIAL); \
436 }
437
438 #define SCHECK_PARTIAL()\
439 if (md->partial != 0 && eptr > md->start_used_ptr) \
440 { \
441 md->hitend = TRUE; \
442 if (md->partial > 1) RRETURN(PCRE_ERROR_PARTIAL); \
443 }
444
445
446 /* Performance note: It might be tempting to extract commonly used fields from
447 the md structure (e.g. utf, end_subject) into individual variables to improve
448 performance. Tests using gcc on a SPARC disproved this; in the first case, it
449 made performance worse.
450
451 Arguments:
452 eptr pointer to current character in subject
453 ecode pointer to current position in compiled code
454 mstart pointer to the current match start position (can be modified
455 by encountering \K)
456 offset_top current top pointer
457 md pointer to "static" info for the match
458 eptrb pointer to chain of blocks containing eptr at start of
459 brackets - for testing for empty matches
460 rdepth the recursion depth
461
462 Returns: MATCH_MATCH if matched ) these values are >= 0
463 MATCH_NOMATCH if failed to match )
464 a negative MATCH_xxx value for PRUNE, SKIP, etc
465 a negative PCRE_ERROR_xxx value if aborted by an error condition
466 (e.g. stopped by repeated call or recursion limit)
467 */
468
469 static int
470 match(REGISTER PCRE_PUCHAR eptr, REGISTER const pcre_uchar *ecode,
471 PCRE_PUCHAR mstart, int offset_top, match_data *md, eptrblock *eptrb,
472 unsigned int rdepth)
473 {
474 /* These variables do not need to be preserved over recursion in this function,
475 so they can be ordinary variables in all cases. Mark some of them with
476 "register" because they are used a lot in loops. */
477
478 register int rrc; /* Returns from recursive calls */
479 register int i; /* Used for loops not involving calls to RMATCH() */
480 register unsigned int c; /* Character values not kept over RMATCH() calls */
481 register BOOL utf; /* Local copy of UTF flag for speed */
482
483 BOOL minimize, possessive; /* Quantifier options */
484 BOOL caseless;
485 int condcode;
486
487 /* When recursion is not being used, all "local" variables that have to be
488 preserved over calls to RMATCH() are part of a "frame" which is obtained from
489 heap storage. Set up the top-level frame here; others are obtained from the
490 heap whenever RMATCH() does a "recursion". See the macro definitions above. */
491
492 #ifdef NO_RECURSE
493 heapframe *frame = (heapframe *)(PUBL(stack_malloc))(sizeof(heapframe));
494 if (frame == NULL) RRETURN(PCRE_ERROR_NOMEMORY);
495 frame->Xprevframe = NULL; /* Marks the top level */
496
497 /* Copy in the original argument variables */
498
499 frame->Xeptr = eptr;
500 frame->Xecode = ecode;
501 frame->Xmstart = mstart;
502 frame->Xoffset_top = offset_top;
503 frame->Xeptrb = eptrb;
504 frame->Xrdepth = rdepth;
505
506 /* This is where control jumps back to to effect "recursion" */
507
508 HEAP_RECURSE:
509
510 /* Macros make the argument variables come from the current frame */
511
512 #define eptr frame->Xeptr
513 #define ecode frame->Xecode
514 #define mstart frame->Xmstart
515 #define offset_top frame->Xoffset_top
516 #define eptrb frame->Xeptrb
517 #define rdepth frame->Xrdepth
518
519 /* Ditto for the local variables */
520
521 #ifdef SUPPORT_UTF
522 #define charptr frame->Xcharptr
523 #endif
524 #define callpat frame->Xcallpat
525 #define codelink frame->Xcodelink
526 #define data frame->Xdata
527 #define next frame->Xnext
528 #define pp frame->Xpp
529 #define prev frame->Xprev
530 #define saved_eptr frame->Xsaved_eptr
531
532 #define new_recursive frame->Xnew_recursive
533
534 #define cur_is_word frame->Xcur_is_word
535 #define condition frame->Xcondition
536 #define prev_is_word frame->Xprev_is_word
537
538 #ifdef SUPPORT_UCP
539 #define prop_type frame->Xprop_type
540 #define prop_value frame->Xprop_value
541 #define prop_fail_result frame->Xprop_fail_result
542 #define oclength frame->Xoclength
543 #define occhars frame->Xocchars
544 #endif
545
546 #define ctype frame->Xctype
547 #define fc frame->Xfc
548 #define fi frame->Xfi
549 #define length frame->Xlength
550 #define max frame->Xmax
551 #define min frame->Xmin
552 #define number frame->Xnumber
553 #define offset frame->Xoffset
554 #define op frame->Xop
555 #define save_capture_last frame->Xsave_capture_last
556 #define save_offset1 frame->Xsave_offset1
557 #define save_offset2 frame->Xsave_offset2
558 #define save_offset3 frame->Xsave_offset3
559 #define stacksave frame->Xstacksave
560
561 #define newptrb frame->Xnewptrb
562
563 /* When recursion is being used, local variables are allocated on the stack and
564 get preserved during recursion in the normal way. In this environment, fi and
565 i, and fc and c, can be the same variables. */
566
567 #else /* NO_RECURSE not defined */
568 #define fi i
569 #define fc c
570
571 /* Many of the following variables are used only in small blocks of the code.
572 My normal style of coding would have declared them within each of those blocks.
573 However, in order to accommodate the version of this code that uses an external
574 "stack" implemented on the heap, it is easier to declare them all here, so the
575 declarations can be cut out in a block. The only declarations within blocks
576 below are for variables that do not have to be preserved over a recursive call
577 to RMATCH(). */
578
579 #ifdef SUPPORT_UTF
580 const pcre_uchar *charptr;
581 #endif
582 const pcre_uchar *callpat;
583 const pcre_uchar *data;
584 const pcre_uchar *next;
585 PCRE_PUCHAR pp;
586 const pcre_uchar *prev;
587 PCRE_PUCHAR saved_eptr;
588
589 recursion_info new_recursive;
590
591 BOOL cur_is_word;
592 BOOL condition;
593 BOOL prev_is_word;
594
595 #ifdef SUPPORT_UCP
596 int prop_type;
597 int prop_value;
598 int prop_fail_result;
599 int oclength;
600 pcre_uchar occhars[6];
601 #endif
602
603 int codelink;
604 int ctype;
605 int length;
606 int max;
607 int min;
608 int number;
609 int offset;
610 int op;
611 int save_capture_last;
612 int save_offset1, save_offset2, save_offset3;
613 int stacksave[REC_STACK_SAVE_MAX];
614
615 eptrblock newptrb;
616 #endif /* NO_RECURSE */
617
618 /* To save space on the stack and in the heap frame, I have doubled up on some
619 of the local variables that are used only in localised parts of the code, but
620 still need to be preserved over recursive calls of match(). These macros define
621 the alternative names that are used. */
622
623 #define allow_zero cur_is_word
624 #define cbegroup condition
625 #define code_offset codelink
626 #define condassert condition
627 #define matched_once prev_is_word
628 #define foc number
629 #define save_mark data
630
631 /* These statements are here to stop the compiler complaining about unitialized
632 variables. */
633
634 #ifdef SUPPORT_UCP
635 prop_value = 0;
636 prop_fail_result = 0;
637 #endif
638
639
640 /* This label is used for tail recursion, which is used in a few cases even
641 when NO_RECURSE is not defined, in order to reduce the amount of stack that is
642 used. Thanks to Ian Taylor for noticing this possibility and sending the
643 original patch. */
644
645 TAIL_RECURSE:
646
647 /* OK, now we can get on with the real code of the function. Recursive calls
648 are specified by the macro RMATCH and RRETURN is used to return. When
649 NO_RECURSE is *not* defined, these just turn into a recursive call to match()
650 and a "return", respectively (possibly with some debugging if PCRE_DEBUG is
651 defined). However, RMATCH isn't like a function call because it's quite a
652 complicated macro. It has to be used in one particular way. This shouldn't,
653 however, impact performance when true recursion is being used. */
654
655 #ifdef SUPPORT_UTF
656 utf = md->utf; /* Local copy of the flag */
657 #else
658 utf = FALSE;
659 #endif
660
661 /* First check that we haven't called match() too many times, or that we
662 haven't exceeded the recursive call limit. */
663
664 if (md->match_call_count++ >= md->match_limit) RRETURN(PCRE_ERROR_MATCHLIMIT);
665 if (rdepth >= md->match_limit_recursion) RRETURN(PCRE_ERROR_RECURSIONLIMIT);
666
667 /* At the start of a group with an unlimited repeat that may match an empty
668 string, the variable md->match_function_type is set to MATCH_CBEGROUP. It is
669 done this way to save having to use another function argument, which would take
670 up space on the stack. See also MATCH_CONDASSERT below.
671
672 When MATCH_CBEGROUP is set, add the current subject pointer to the chain of
673 such remembered pointers, to be checked when we hit the closing ket, in order
674 to break infinite loops that match no characters. When match() is called in
675 other circumstances, don't add to the chain. The MATCH_CBEGROUP feature must
676 NOT be used with tail recursion, because the memory block that is used is on
677 the stack, so a new one may be required for each match(). */
678
679 if (md->match_function_type == MATCH_CBEGROUP)
680 {
681 newptrb.epb_saved_eptr = eptr;
682 newptrb.epb_prev = eptrb;
683 eptrb = &newptrb;
684 md->match_function_type = 0;
685 }
686
687 /* Now start processing the opcodes. */
688
689 for (;;)
690 {
691 minimize = possessive = FALSE;
692 op = *ecode;
693
694 switch(op)
695 {
696 case OP_MARK:
697 md->nomatch_mark = ecode + 2;
698 md->mark = NULL; /* In case previously set by assertion */
699 RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode] + ecode[1], offset_top, md,
700 eptrb, RM55);
701 if ((rrc == MATCH_MATCH || rrc == MATCH_ACCEPT) &&
702 md->mark == NULL) md->mark = ecode + 2;
703
704 /* A return of MATCH_SKIP_ARG means that matching failed at SKIP with an
705 argument, and we must check whether that argument matches this MARK's
706 argument. It is passed back in md->start_match_ptr (an overloading of that
707 variable). If it does match, we reset that variable to the current subject
708 position and return MATCH_SKIP. Otherwise, pass back the return code
709 unaltered. */
710
711 else if (rrc == MATCH_SKIP_ARG &&
712 STRCMP_UC_UC(ecode + 2, md->start_match_ptr) == 0)
713 {
714 md->start_match_ptr = eptr;
715 RRETURN(MATCH_SKIP);
716 }
717 RRETURN(rrc);
718
719 case OP_FAIL:
720 RRETURN(MATCH_NOMATCH);
721
722 /* COMMIT overrides PRUNE, SKIP, and THEN */
723
724 case OP_COMMIT:
725 RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode], offset_top, md,
726 eptrb, RM52);
727 if (rrc != MATCH_NOMATCH && rrc != MATCH_PRUNE &&
728 rrc != MATCH_SKIP && rrc != MATCH_SKIP_ARG &&
729 rrc != MATCH_THEN)
730 RRETURN(rrc);
731 RRETURN(MATCH_COMMIT);
732
733 /* PRUNE overrides THEN */
734
735 case OP_PRUNE:
736 RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode], offset_top, md,
737 eptrb, RM51);
738 if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc);
739 RRETURN(MATCH_PRUNE);
740
741 case OP_PRUNE_ARG:
742 md->nomatch_mark = ecode + 2;
743 md->mark = NULL; /* In case previously set by assertion */
744 RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode] + ecode[1], offset_top, md,
745 eptrb, RM56);
746 if ((rrc == MATCH_MATCH || rrc == MATCH_ACCEPT) &&
747 md->mark == NULL) md->mark = ecode + 2;
748 if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc);
749 RRETURN(MATCH_PRUNE);
750
751 /* SKIP overrides PRUNE and THEN */
752
753 case OP_SKIP:
754 RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode], offset_top, md,
755 eptrb, RM53);
756 if (rrc != MATCH_NOMATCH && rrc != MATCH_PRUNE && rrc != MATCH_THEN)
757 RRETURN(rrc);
758 md->start_match_ptr = eptr; /* Pass back current position */
759 RRETURN(MATCH_SKIP);
760
761 /* Note that, for Perl compatibility, SKIP with an argument does NOT set
762 nomatch_mark. There is a flag that disables this opcode when re-matching a
763 pattern that ended with a SKIP for which there was not a matching MARK. */
764
765 case OP_SKIP_ARG:
766 if (md->ignore_skip_arg)
767 {
768 ecode += PRIV(OP_lengths)[*ecode] + ecode[1];
769 break;
770 }
771 RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode] + ecode[1], offset_top, md,
772 eptrb, RM57);
773 if (rrc != MATCH_NOMATCH && rrc != MATCH_PRUNE && rrc != MATCH_THEN)
774 RRETURN(rrc);
775
776 /* Pass back the current skip name by overloading md->start_match_ptr and
777 returning the special MATCH_SKIP_ARG return code. This will either be
778 caught by a matching MARK, or get to the top, where it causes a rematch
779 with the md->ignore_skip_arg flag set. */
780
781 md->start_match_ptr = ecode + 2;
782 RRETURN(MATCH_SKIP_ARG);
783
784 /* For THEN (and THEN_ARG) we pass back the address of the opcode, so that
785 the branch in which it occurs can be determined. Overload the start of
786 match pointer to do this. */
787
788 case OP_THEN:
789 RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode], offset_top, md,
790 eptrb, RM54);
791 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
792 md->start_match_ptr = ecode;
793 RRETURN(MATCH_THEN);
794
795 case OP_THEN_ARG:
796 md->nomatch_mark = ecode + 2;
797 md->mark = NULL; /* In case previously set by assertion */
798 RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode] + ecode[1], offset_top,
799 md, eptrb, RM58);
800 if ((rrc == MATCH_MATCH || rrc == MATCH_ACCEPT) &&
801 md->mark == NULL) md->mark = ecode + 2;
802 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
803 md->start_match_ptr = ecode;
804 RRETURN(MATCH_THEN);
805
806 /* Handle an atomic group that does not contain any capturing parentheses.
807 This can be handled like an assertion. Prior to 8.13, all atomic groups
808 were handled this way. In 8.13, the code was changed as below for ONCE, so
809 that backups pass through the group and thereby reset captured values.
810 However, this uses a lot more stack, so in 8.20, atomic groups that do not
811 contain any captures generate OP_ONCE_NC, which can be handled in the old,
812 less stack intensive way.
813
814 Check the alternative branches in turn - the matching won't pass the KET
815 for this kind of subpattern. If any one branch matches, we carry on as at
816 the end of a normal bracket, leaving the subject pointer, but resetting
817 the start-of-match value in case it was changed by \K. */
818
819 case OP_ONCE_NC:
820 prev = ecode;
821 saved_eptr = eptr;
822 save_mark = md->mark;
823 do
824 {
825 RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, eptrb, RM64);
826 if (rrc == MATCH_MATCH) /* Note: _not_ MATCH_ACCEPT */
827 {
828 mstart = md->start_match_ptr;
829 break;
830 }
831 if (rrc == MATCH_THEN)
832 {
833 next = ecode + GET(ecode,1);
834 if (md->start_match_ptr < next &&
835 (*ecode == OP_ALT || *next == OP_ALT))
836 rrc = MATCH_NOMATCH;
837 }
838
839 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
840 ecode += GET(ecode,1);
841 md->mark = save_mark;
842 }
843 while (*ecode == OP_ALT);
844
845 /* If hit the end of the group (which could be repeated), fail */
846
847 if (*ecode != OP_ONCE_NC && *ecode != OP_ALT) RRETURN(MATCH_NOMATCH);
848
849 /* Continue as from after the group, updating the offsets high water
850 mark, since extracts may have been taken. */
851
852 do ecode += GET(ecode, 1); while (*ecode == OP_ALT);
853
854 offset_top = md->end_offset_top;
855 eptr = md->end_match_ptr;
856
857 /* For a non-repeating ket, just continue at this level. This also
858 happens for a repeating ket if no characters were matched in the group.
859 This is the forcible breaking of infinite loops as implemented in Perl
860 5.005. */
861
862 if (*ecode == OP_KET || eptr == saved_eptr)
863 {
864 ecode += 1+LINK_SIZE;
865 break;
866 }
867
868 /* The repeating kets try the rest of the pattern or restart from the
869 preceding bracket, in the appropriate order. The second "call" of match()
870 uses tail recursion, to avoid using another stack frame. */
871
872 if (*ecode == OP_KETRMIN)
873 {
874 RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, eptrb, RM65);
875 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
876 ecode = prev;
877 goto TAIL_RECURSE;
878 }
879 else /* OP_KETRMAX */
880 {
881 md->match_function_type = MATCH_CBEGROUP;
882 RMATCH(eptr, prev, offset_top, md, eptrb, RM66);
883 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
884 ecode += 1 + LINK_SIZE;
885 goto TAIL_RECURSE;
886 }
887 /* Control never gets here */
888
889 /* Handle a capturing bracket, other than those that are possessive with an
890 unlimited repeat. If there is space in the offset vector, save the current
891 subject position in the working slot at the top of the vector. We mustn't
892 change the current values of the data slot, because they may be set from a
893 previous iteration of this group, and be referred to by a reference inside
894 the group. A failure to match might occur after the group has succeeded,
895 if something later on doesn't match. For this reason, we need to restore
896 the working value and also the values of the final offsets, in case they
897 were set by a previous iteration of the same bracket.
898
899 If there isn't enough space in the offset vector, treat this as if it were
900 a non-capturing bracket. Don't worry about setting the flag for the error
901 case here; that is handled in the code for KET. */
902
903 case OP_CBRA:
904 case OP_SCBRA:
905 number = GET2(ecode, 1+LINK_SIZE);
906 offset = number << 1;
907
908 #ifdef PCRE_DEBUG
909 printf("start bracket %d\n", number);
910 printf("subject=");
911 pchars(eptr, 16, TRUE, md);
912 printf("\n");
913 #endif
914
915 if (offset < md->offset_max)
916 {
917 save_offset1 = md->offset_vector[offset];
918 save_offset2 = md->offset_vector[offset+1];
919 save_offset3 = md->offset_vector[md->offset_end - number];
920 save_capture_last = md->capture_last;
921 save_mark = md->mark;
922
923 DPRINTF(("saving %d %d %d\n", save_offset1, save_offset2, save_offset3));
924 md->offset_vector[md->offset_end - number] =
925 (int)(eptr - md->start_subject);
926
927 for (;;)
928 {
929 if (op >= OP_SBRA) md->match_function_type = MATCH_CBEGROUP;
930 RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode], offset_top, md,
931 eptrb, RM1);
932 if (rrc == MATCH_ONCE) break; /* Backing up through an atomic group */
933
934 /* If we backed up to a THEN, check whether it is within the current
935 branch by comparing the address of the THEN that is passed back with
936 the end of the branch. If it is within the current branch, and the
937 branch is one of two or more alternatives (it either starts or ends
938 with OP_ALT), we have reached the limit of THEN's action, so convert
939 the return code to NOMATCH, which will cause normal backtracking to
940 happen from now on. Otherwise, THEN is passed back to an outer
941 alternative. This implements Perl's treatment of parenthesized groups,
942 where a group not containing | does not affect the current alternative,
943 that is, (X) is NOT the same as (X|(*F)). */
944
945 if (rrc == MATCH_THEN)
946 {
947 next = ecode + GET(ecode,1);
948 if (md->start_match_ptr < next &&
949 (*ecode == OP_ALT || *next == OP_ALT))
950 rrc = MATCH_NOMATCH;
951 }
952
953 /* Anything other than NOMATCH is passed back. */
954
955 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
956 md->capture_last = save_capture_last;
957 ecode += GET(ecode, 1);
958 md->mark = save_mark;
959 if (*ecode != OP_ALT) break;
960 }
961
962 DPRINTF(("bracket %d failed\n", number));
963 md->offset_vector[offset] = save_offset1;
964 md->offset_vector[offset+1] = save_offset2;
965 md->offset_vector[md->offset_end - number] = save_offset3;
966
967 /* At this point, rrc will be one of MATCH_ONCE or MATCH_NOMATCH. */
968
969 RRETURN(rrc);
970 }
971
972 /* FALL THROUGH ... Insufficient room for saving captured contents. Treat
973 as a non-capturing bracket. */
974
975 /* VVVVVVVVVVVVVVVVVVVVVVVVV */
976 /* VVVVVVVVVVVVVVVVVVVVVVVVV */
977
978 DPRINTF(("insufficient capture room: treat as non-capturing\n"));
979
980 /* VVVVVVVVVVVVVVVVVVVVVVVVV */
981 /* VVVVVVVVVVVVVVVVVVVVVVVVV */
982
983 /* Non-capturing or atomic group, except for possessive with unlimited
984 repeat and ONCE group with no captures. Loop for all the alternatives.
985
986 When we get to the final alternative within the brackets, we used to return
987 the result of a recursive call to match() whatever happened so it was
988 possible to reduce stack usage by turning this into a tail recursion,
989 except in the case of a possibly empty group. However, now that there is
990 the possiblity of (*THEN) occurring in the final alternative, this
991 optimization is no longer always possible.
992
993 We can optimize if we know there are no (*THEN)s in the pattern; at present
994 this is the best that can be done.
995
996 MATCH_ONCE is returned when the end of an atomic group is successfully
997 reached, but subsequent matching fails. It passes back up the tree (causing
998 captured values to be reset) until the original atomic group level is
999 reached. This is tested by comparing md->once_target with the start of the
1000 group. At this point, the return is converted into MATCH_NOMATCH so that
1001 previous backup points can be taken. */
1002
1003 case OP_ONCE:
1004 case OP_BRA:
1005 case OP_SBRA:
1006 DPRINTF(("start non-capturing bracket\n"));
1007
1008 for (;;)
1009 {
1010 if (op >= OP_SBRA || op == OP_ONCE) md->match_function_type = MATCH_CBEGROUP;
1011
1012 /* If this is not a possibly empty group, and there are no (*THEN)s in
1013 the pattern, and this is the final alternative, optimize as described
1014 above. */
1015
1016 else if (!md->hasthen && ecode[GET(ecode, 1)] != OP_ALT)
1017 {
1018 ecode += PRIV(OP_lengths)[*ecode];
1019 goto TAIL_RECURSE;
1020 }
1021
1022 /* In all other cases, we have to make another call to match(). */
1023
1024 save_mark = md->mark;
1025 RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode], offset_top, md, eptrb,
1026 RM2);
1027
1028 /* See comment in the code for capturing groups above about handling
1029 THEN. */
1030
1031 if (rrc == MATCH_THEN)
1032 {
1033 next = ecode + GET(ecode,1);
1034 if (md->start_match_ptr < next &&
1035 (*ecode == OP_ALT || *next == OP_ALT))
1036 rrc = MATCH_NOMATCH;
1037 }
1038
1039 if (rrc != MATCH_NOMATCH)
1040 {
1041 if (rrc == MATCH_ONCE)
1042 {
1043 const pcre_uchar *scode = ecode;
1044 if (*scode != OP_ONCE) /* If not at start, find it */
1045 {
1046 while (*scode == OP_ALT) scode += GET(scode, 1);
1047 scode -= GET(scode, 1);
1048 }
1049 if (md->once_target == scode) rrc = MATCH_NOMATCH;
1050 }
1051 RRETURN(rrc);
1052 }
1053 ecode += GET(ecode, 1);
1054 md->mark = save_mark;
1055 if (*ecode != OP_ALT) break;
1056 }
1057
1058 RRETURN(MATCH_NOMATCH);
1059
1060 /* Handle possessive capturing brackets with an unlimited repeat. We come
1061 here from BRAZERO with allow_zero set TRUE. The offset_vector values are
1062 handled similarly to the normal case above. However, the matching is
1063 different. The end of these brackets will always be OP_KETRPOS, which
1064 returns MATCH_KETRPOS without going further in the pattern. By this means
1065 we can handle the group by iteration rather than recursion, thereby
1066 reducing the amount of stack needed. */
1067
1068 case OP_CBRAPOS:
1069 case OP_SCBRAPOS:
1070 allow_zero = FALSE;
1071
1072 POSSESSIVE_CAPTURE:
1073 number = GET2(ecode, 1+LINK_SIZE);
1074 offset = number << 1;
1075
1076 #ifdef PCRE_DEBUG
1077 printf("start possessive bracket %d\n", number);
1078 printf("subject=");
1079 pchars(eptr, 16, TRUE, md);
1080 printf("\n");
1081 #endif
1082
1083 if (offset < md->offset_max)
1084 {
1085 matched_once = FALSE;
1086 code_offset = (int)(ecode - md->start_code);
1087
1088 save_offset1 = md->offset_vector[offset];
1089 save_offset2 = md->offset_vector[offset+1];
1090 save_offset3 = md->offset_vector[md->offset_end - number];
1091 save_capture_last = md->capture_last;
1092
1093 DPRINTF(("saving %d %d %d\n", save_offset1, save_offset2, save_offset3));
1094
1095 /* Each time round the loop, save the current subject position for use
1096 when the group matches. For MATCH_MATCH, the group has matched, so we
1097 restart it with a new subject starting position, remembering that we had
1098 at least one match. For MATCH_NOMATCH, carry on with the alternatives, as
1099 usual. If we haven't matched any alternatives in any iteration, check to
1100 see if a previous iteration matched. If so, the group has matched;
1101 continue from afterwards. Otherwise it has failed; restore the previous
1102 capture values before returning NOMATCH. */
1103
1104 for (;;)
1105 {
1106 md->offset_vector[md->offset_end - number] =
1107 (int)(eptr - md->start_subject);
1108 if (op >= OP_SBRA) md->match_function_type = MATCH_CBEGROUP;
1109 RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode], offset_top, md,
1110 eptrb, RM63);
1111 if (rrc == MATCH_KETRPOS)
1112 {
1113 offset_top = md->end_offset_top;
1114 eptr = md->end_match_ptr;
1115 ecode = md->start_code + code_offset;
1116 save_capture_last = md->capture_last;
1117 matched_once = TRUE;
1118 continue;
1119 }
1120
1121 /* See comment in the code for capturing groups above about handling
1122 THEN. */
1123
1124 if (rrc == MATCH_THEN)
1125 {
1126 next = ecode + GET(ecode,1);
1127 if (md->start_match_ptr < next &&
1128 (*ecode == OP_ALT || *next == OP_ALT))
1129 rrc = MATCH_NOMATCH;
1130 }
1131
1132 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
1133 md->capture_last = save_capture_last;
1134 ecode += GET(ecode, 1);
1135 if (*ecode != OP_ALT) break;
1136 }
1137
1138 if (!matched_once)
1139 {
1140 md->offset_vector[offset] = save_offset1;
1141 md->offset_vector[offset+1] = save_offset2;
1142 md->offset_vector[md->offset_end - number] = save_offset3;
1143 }
1144
1145 if (allow_zero || matched_once)
1146 {
1147 ecode += 1 + LINK_SIZE;
1148 break;
1149 }
1150
1151 RRETURN(MATCH_NOMATCH);
1152 }
1153
1154 /* FALL THROUGH ... Insufficient room for saving captured contents. Treat
1155 as a non-capturing bracket. */
1156
1157 /* VVVVVVVVVVVVVVVVVVVVVVVVV */
1158 /* VVVVVVVVVVVVVVVVVVVVVVVVV */
1159
1160 DPRINTF(("insufficient capture room: treat as non-capturing\n"));
1161
1162 /* VVVVVVVVVVVVVVVVVVVVVVVVV */
1163 /* VVVVVVVVVVVVVVVVVVVVVVVVV */
1164
1165 /* Non-capturing possessive bracket with unlimited repeat. We come here
1166 from BRAZERO with allow_zero = TRUE. The code is similar to the above,
1167 without the capturing complication. It is written out separately for speed
1168 and cleanliness. */
1169
1170 case OP_BRAPOS:
1171 case OP_SBRAPOS:
1172 allow_zero = FALSE;
1173
1174 POSSESSIVE_NON_CAPTURE:
1175 matched_once = FALSE;
1176 code_offset = (int)(ecode - md->start_code);
1177
1178 for (;;)
1179 {
1180 if (op >= OP_SBRA) md->match_function_type = MATCH_CBEGROUP;
1181 RMATCH(eptr, ecode + PRIV(OP_lengths)[*ecode], offset_top, md,
1182 eptrb, RM48);
1183 if (rrc == MATCH_KETRPOS)
1184 {
1185 offset_top = md->end_offset_top;
1186 eptr = md->end_match_ptr;
1187 ecode = md->start_code + code_offset;
1188 matched_once = TRUE;
1189 continue;
1190 }
1191
1192 /* See comment in the code for capturing groups above about handling
1193 THEN. */
1194
1195 if (rrc == MATCH_THEN)
1196 {
1197 next = ecode + GET(ecode,1);
1198 if (md->start_match_ptr < next &&
1199 (*ecode == OP_ALT || *next == OP_ALT))
1200 rrc = MATCH_NOMATCH;
1201 }
1202
1203 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
1204 ecode += GET(ecode, 1);
1205 if (*ecode != OP_ALT) break;
1206 }
1207
1208 if (matched_once || allow_zero)
1209 {
1210 ecode += 1 + LINK_SIZE;
1211 break;
1212 }
1213 RRETURN(MATCH_NOMATCH);
1214
1215 /* Control never reaches here. */
1216
1217 /* Conditional group: compilation checked that there are no more than
1218 two branches. If the condition is false, skipping the first branch takes us
1219 past the end if there is only one branch, but that's OK because that is
1220 exactly what going to the ket would do. */
1221
1222 case OP_COND:
1223 case OP_SCOND:
1224 codelink = GET(ecode, 1);
1225
1226 /* Because of the way auto-callout works during compile, a callout item is
1227 inserted between OP_COND and an assertion condition. */
1228
1229 if (ecode[LINK_SIZE+1] == OP_CALLOUT)
1230 {
1231 if (PUBL(callout) != NULL)
1232 {
1233 PUBL(callout_block) cb;
1234 cb.version = 2; /* Version 1 of the callout block */
1235 cb.callout_number = ecode[LINK_SIZE+2];
1236 cb.offset_vector = md->offset_vector;
1237 #ifdef COMPILE_PCRE8
1238 cb.subject = (PCRE_SPTR)md->start_subject;
1239 #else
1240 cb.subject = (PCRE_SPTR16)md->start_subject;
1241 #endif
1242 cb.subject_length = (int)(md->end_subject - md->start_subject);
1243 cb.start_match = (int)(mstart - md->start_subject);
1244 cb.current_position = (int)(eptr - md->start_subject);
1245 cb.pattern_position = GET(ecode, LINK_SIZE + 3);
1246 cb.next_item_length = GET(ecode, 3 + 2*LINK_SIZE);
1247 cb.capture_top = offset_top/2;
1248 cb.capture_last = md->capture_last;
1249 cb.callout_data = md->callout_data;
1250 cb.mark = md->nomatch_mark;
1251 if ((rrc = (*PUBL(callout))(&cb)) > 0) RRETURN(MATCH_NOMATCH);
1252 if (rrc < 0) RRETURN(rrc);
1253 }
1254 ecode += PRIV(OP_lengths)[OP_CALLOUT];
1255 }
1256
1257 condcode = ecode[LINK_SIZE+1];
1258
1259 /* Now see what the actual condition is */
1260
1261 if (condcode == OP_RREF || condcode == OP_NRREF) /* Recursion test */
1262 {
1263 if (md->recursive == NULL) /* Not recursing => FALSE */
1264 {
1265 condition = FALSE;
1266 ecode += GET(ecode, 1);
1267 }
1268 else
1269 {
1270 int recno = GET2(ecode, LINK_SIZE + 2); /* Recursion group number*/
1271 condition = (recno == RREF_ANY || recno == md->recursive->group_num);
1272
1273 /* If the test is for recursion into a specific subpattern, and it is
1274 false, but the test was set up by name, scan the table to see if the
1275 name refers to any other numbers, and test them. The condition is true
1276 if any one is set. */
1277
1278 if (!condition && condcode == OP_NRREF)
1279 {
1280 pcre_uchar *slotA = md->name_table;
1281 for (i = 0; i < md->name_count; i++)
1282 {
1283 if (GET2(slotA, 0) == recno) break;
1284 slotA += md->name_entry_size;
1285 }
1286
1287 /* Found a name for the number - there can be only one; duplicate
1288 names for different numbers are allowed, but not vice versa. First
1289 scan down for duplicates. */
1290
1291 if (i < md->name_count)
1292 {
1293 pcre_uchar *slotB = slotA;
1294 while (slotB > md->name_table)
1295 {
1296 slotB -= md->name_entry_size;
1297 if (STRCMP_UC_UC(slotA + IMM2_SIZE, slotB + IMM2_SIZE) == 0)
1298 {
1299 condition = GET2(slotB, 0) == md->recursive->group_num;
1300 if (condition) break;
1301 }
1302 else break;
1303 }
1304
1305 /* Scan up for duplicates */
1306
1307 if (!condition)
1308 {
1309 slotB = slotA;
1310 for (i++; i < md->name_count; i++)
1311 {
1312 slotB += md->name_entry_size;
1313 if (STRCMP_UC_UC(slotA + IMM2_SIZE, slotB + IMM2_SIZE) == 0)
1314 {
1315 condition = GET2(slotB, 0) == md->recursive->group_num;
1316 if (condition) break;
1317 }
1318 else break;
1319 }
1320 }
1321 }
1322 }
1323
1324 /* Chose branch according to the condition */
1325
1326 ecode += condition? 1 + IMM2_SIZE : GET(ecode, 1);
1327 }
1328 }
1329
1330 else if (condcode == OP_CREF || condcode == OP_NCREF) /* Group used test */
1331 {
1332 offset = GET2(ecode, LINK_SIZE+2) << 1; /* Doubled ref number */
1333 condition = offset < offset_top && md->offset_vector[offset] >= 0;
1334
1335 /* If the numbered capture is unset, but the reference was by name,
1336 scan the table to see if the name refers to any other numbers, and test
1337 them. The condition is true if any one is set. This is tediously similar
1338 to the code above, but not close enough to try to amalgamate. */
1339
1340 if (!condition && condcode == OP_NCREF)
1341 {
1342 int refno = offset >> 1;
1343 pcre_uchar *slotA = md->name_table;
1344
1345 for (i = 0; i < md->name_count; i++)
1346 {
1347 if (GET2(slotA, 0) == refno) break;
1348 slotA += md->name_entry_size;
1349 }
1350
1351 /* Found a name for the number - there can be only one; duplicate names
1352 for different numbers are allowed, but not vice versa. First scan down
1353 for duplicates. */
1354
1355 if (i < md->name_count)
1356 {
1357 pcre_uchar *slotB = slotA;
1358 while (slotB > md->name_table)
1359 {
1360 slotB -= md->name_entry_size;
1361 if (STRCMP_UC_UC(slotA + IMM2_SIZE, slotB + IMM2_SIZE) == 0)
1362 {
1363 offset = GET2(slotB, 0) << 1;
1364 condition = offset < offset_top &&
1365 md->offset_vector[offset] >= 0;
1366 if (condition) break;
1367 }
1368 else break;
1369 }
1370
1371 /* Scan up for duplicates */
1372
1373 if (!condition)
1374 {
1375 slotB = slotA;
1376 for (i++; i < md->name_count; i++)
1377 {
1378 slotB += md->name_entry_size;
1379 if (STRCMP_UC_UC(slotA + IMM2_SIZE, slotB + IMM2_SIZE) == 0)
1380 {
1381 offset = GET2(slotB, 0) << 1;
1382 condition = offset < offset_top &&
1383 md->offset_vector[offset] >= 0;
1384 if (condition) break;
1385 }
1386 else break;
1387 }
1388 }
1389 }
1390 }
1391
1392 /* Chose branch according to the condition */
1393
1394 ecode += condition? 1 + IMM2_SIZE : GET(ecode, 1);
1395 }
1396
1397 else if (condcode == OP_DEF) /* DEFINE - always false */
1398 {
1399 condition = FALSE;
1400 ecode += GET(ecode, 1);
1401 }
1402
1403 /* The condition is an assertion. Call match() to evaluate it - setting
1404 md->match_function_type to MATCH_CONDASSERT causes it to stop at the end of
1405 an assertion. */
1406
1407 else
1408 {
1409 md->match_function_type = MATCH_CONDASSERT;
1410 RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, NULL, RM3);
1411 if (rrc == MATCH_MATCH)
1412 {
1413 if (md->end_offset_top > offset_top)
1414 offset_top = md->end_offset_top; /* Captures may have happened */
1415 condition = TRUE;
1416 ecode += 1 + LINK_SIZE + GET(ecode, LINK_SIZE + 2);
1417 while (*ecode == OP_ALT) ecode += GET(ecode, 1);
1418 }
1419
1420 /* PCRE doesn't allow the effect of (*THEN) to escape beyond an
1421 assertion; it is therefore treated as NOMATCH. */
1422
1423 else if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN)
1424 {
1425 RRETURN(rrc); /* Need braces because of following else */
1426 }
1427 else
1428 {
1429 condition = FALSE;
1430 ecode += codelink;
1431 }
1432 }
1433
1434 /* We are now at the branch that is to be obeyed. As there is only one, can
1435 use tail recursion to avoid using another stack frame, except when there is
1436 unlimited repeat of a possibly empty group. In the latter case, a recursive
1437 call to match() is always required, unless the second alternative doesn't
1438 exist, in which case we can just plough on. Note that, for compatibility
1439 with Perl, the | in a conditional group is NOT treated as creating two
1440 alternatives. If a THEN is encountered in the branch, it propagates out to
1441 the enclosing alternative (unless nested in a deeper set of alternatives,
1442 of course). */
1443
1444 if (condition || *ecode == OP_ALT)
1445 {
1446 if (op != OP_SCOND)
1447 {
1448 ecode += 1 + LINK_SIZE;
1449 goto TAIL_RECURSE;
1450 }
1451
1452 md->match_function_type = MATCH_CBEGROUP;
1453 RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, eptrb, RM49);
1454 RRETURN(rrc);
1455 }
1456
1457 /* Condition false & no alternative; continue after the group. */
1458
1459 else
1460 {
1461 ecode += 1 + LINK_SIZE;
1462 }
1463 break;
1464
1465
1466 /* Before OP_ACCEPT there may be any number of OP_CLOSE opcodes,
1467 to close any currently open capturing brackets. */
1468
1469 case OP_CLOSE:
1470 number = GET2(ecode, 1);
1471 offset = number << 1;
1472
1473 #ifdef PCRE_DEBUG
1474 printf("end bracket %d at *ACCEPT", number);
1475 printf("\n");
1476 #endif
1477
1478 md->capture_last = number;
1479 if (offset >= md->offset_max) md->offset_overflow = TRUE; else
1480 {
1481 md->offset_vector[offset] =
1482 md->offset_vector[md->offset_end - number];
1483 md->offset_vector[offset+1] = (int)(eptr - md->start_subject);
1484 if (offset_top <= offset) offset_top = offset + 2;
1485 }
1486 ecode += 1 + IMM2_SIZE;
1487 break;
1488
1489
1490 /* End of the pattern, either real or forced. */
1491
1492 case OP_END:
1493 case OP_ACCEPT:
1494 case OP_ASSERT_ACCEPT:
1495
1496 /* If we have matched an empty string, fail if not in an assertion and not
1497 in a recursion if either PCRE_NOTEMPTY is set, or if PCRE_NOTEMPTY_ATSTART
1498 is set and we have matched at the start of the subject. In both cases,
1499 backtracking will then try other alternatives, if any. */
1500
1501 if (eptr == mstart && op != OP_ASSERT_ACCEPT &&
1502 md->recursive == NULL &&
1503 (md->notempty ||
1504 (md->notempty_atstart &&
1505 mstart == md->start_subject + md->start_offset)))
1506 RRETURN(MATCH_NOMATCH);
1507
1508 /* Otherwise, we have a match. */
1509
1510 md->end_match_ptr = eptr; /* Record where we ended */
1511 md->end_offset_top = offset_top; /* and how many extracts were taken */
1512 md->start_match_ptr = mstart; /* and the start (\K can modify) */
1513
1514 /* For some reason, the macros don't work properly if an expression is
1515 given as the argument to RRETURN when the heap is in use. */
1516
1517 rrc = (op == OP_END)? MATCH_MATCH : MATCH_ACCEPT;
1518 RRETURN(rrc);
1519
1520 /* Assertion brackets. Check the alternative branches in turn - the
1521 matching won't pass the KET for an assertion. If any one branch matches,
1522 the assertion is true. Lookbehind assertions have an OP_REVERSE item at the
1523 start of each branch to move the current point backwards, so the code at
1524 this level is identical to the lookahead case. When the assertion is part
1525 of a condition, we want to return immediately afterwards. The caller of
1526 this incarnation of the match() function will have set MATCH_CONDASSERT in
1527 md->match_function type, and one of these opcodes will be the first opcode
1528 that is processed. We use a local variable that is preserved over calls to
1529 match() to remember this case. */
1530
1531 case OP_ASSERT:
1532 case OP_ASSERTBACK:
1533 save_mark = md->mark;
1534 if (md->match_function_type == MATCH_CONDASSERT)
1535 {
1536 condassert = TRUE;
1537 md->match_function_type = 0;
1538 }
1539 else condassert = FALSE;
1540
1541 do
1542 {
1543 RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, NULL, RM4);
1544 if (rrc == MATCH_MATCH || rrc == MATCH_ACCEPT)
1545 {
1546 mstart = md->start_match_ptr; /* In case \K reset it */
1547 break;
1548 }
1549
1550 /* PCRE does not allow THEN to escape beyond an assertion; it is treated
1551 as NOMATCH. */
1552
1553 if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc);
1554 ecode += GET(ecode, 1);
1555 md->mark = save_mark;
1556 }
1557 while (*ecode == OP_ALT);
1558
1559 if (*ecode == OP_KET) RRETURN(MATCH_NOMATCH);
1560
1561 /* If checking an assertion for a condition, return MATCH_MATCH. */
1562
1563 if (condassert) RRETURN(MATCH_MATCH);
1564
1565 /* Continue from after the assertion, updating the offsets high water
1566 mark, since extracts may have been taken during the assertion. */
1567
1568 do ecode += GET(ecode,1); while (*ecode == OP_ALT);
1569 ecode += 1 + LINK_SIZE;
1570 offset_top = md->end_offset_top;
1571 continue;
1572
1573 /* Negative assertion: all branches must fail to match. Encountering SKIP,
1574 PRUNE, or COMMIT means we must assume failure without checking subsequent
1575 branches. */
1576
1577 case OP_ASSERT_NOT:
1578 case OP_ASSERTBACK_NOT:
1579 save_mark = md->mark;
1580 if (md->match_function_type == MATCH_CONDASSERT)
1581 {
1582 condassert = TRUE;
1583 md->match_function_type = 0;
1584 }
1585 else condassert = FALSE;
1586
1587 do
1588 {
1589 RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, NULL, RM5);
1590 md->mark = save_mark;
1591 if (rrc == MATCH_MATCH || rrc == MATCH_ACCEPT) RRETURN(MATCH_NOMATCH);
1592 if (rrc == MATCH_SKIP || rrc == MATCH_PRUNE || rrc == MATCH_COMMIT)
1593 {
1594 do ecode += GET(ecode,1); while (*ecode == OP_ALT);
1595 break;
1596 }
1597
1598 /* PCRE does not allow THEN to escape beyond an assertion; it is treated
1599 as NOMATCH. */
1600
1601 if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc);
1602 ecode += GET(ecode,1);
1603 }
1604 while (*ecode == OP_ALT);
1605
1606 if (condassert) RRETURN(MATCH_MATCH); /* Condition assertion */
1607
1608 ecode += 1 + LINK_SIZE;
1609 continue;
1610
1611 /* Move the subject pointer back. This occurs only at the start of
1612 each branch of a lookbehind assertion. If we are too close to the start to
1613 move back, this match function fails. When working with UTF-8 we move
1614 back a number of characters, not bytes. */
1615
1616 case OP_REVERSE:
1617 #ifdef SUPPORT_UTF
1618 if (utf)
1619 {
1620 i = GET(ecode, 1);
1621 while (i-- > 0)
1622 {
1623 eptr--;
1624 if (eptr < md->start_subject) RRETURN(MATCH_NOMATCH);
1625 BACKCHAR(eptr);
1626 }
1627 }
1628 else
1629 #endif
1630
1631 /* No UTF-8 support, or not in UTF-8 mode: count is byte count */
1632
1633 {
1634 eptr -= GET(ecode, 1);
1635 if (eptr < md->start_subject) RRETURN(MATCH_NOMATCH);
1636 }
1637
1638 /* Save the earliest consulted character, then skip to next op code */
1639
1640 if (eptr < md->start_used_ptr) md->start_used_ptr = eptr;
1641 ecode += 1 + LINK_SIZE;
1642 break;
1643
1644 /* The callout item calls an external function, if one is provided, passing
1645 details of the match so far. This is mainly for debugging, though the
1646 function is able to force a failure. */
1647
1648 case OP_CALLOUT:
1649 if (PUBL(callout) != NULL)
1650 {
1651 PUBL(callout_block) cb;
1652 cb.version = 2; /* Version 1 of the callout block */
1653 cb.callout_number = ecode[1];
1654 cb.offset_vector = md->offset_vector;
1655 #ifdef COMPILE_PCRE8
1656 cb.subject = (PCRE_SPTR)md->start_subject;
1657 #else
1658 cb.subject = (PCRE_SPTR16)md->start_subject;
1659 #endif
1660 cb.subject_length = (int)(md->end_subject - md->start_subject);
1661 cb.start_match = (int)(mstart - md->start_subject);
1662 cb.current_position = (int)(eptr - md->start_subject);
1663 cb.pattern_position = GET(ecode, 2);
1664 cb.next_item_length = GET(ecode, 2 + LINK_SIZE);
1665 cb.capture_top = offset_top/2;
1666 cb.capture_last = md->capture_last;
1667 cb.callout_data = md->callout_data;
1668 cb.mark = md->nomatch_mark;
1669 if ((rrc = (*PUBL(callout))(&cb)) > 0) RRETURN(MATCH_NOMATCH);
1670 if (rrc < 0) RRETURN(rrc);
1671 }
1672 ecode += 2 + 2*LINK_SIZE;
1673 break;
1674
1675 /* Recursion either matches the current regex, or some subexpression. The
1676 offset data is the offset to the starting bracket from the start of the
1677 whole pattern. (This is so that it works from duplicated subpatterns.)
1678
1679 The state of the capturing groups is preserved over recursion, and
1680 re-instated afterwards. We don't know how many are started and not yet
1681 finished (offset_top records the completed total) so we just have to save
1682 all the potential data. There may be up to 65535 such values, which is too
1683 large to put on the stack, but using malloc for small numbers seems
1684 expensive. As a compromise, the stack is used when there are no more than
1685 REC_STACK_SAVE_MAX values to store; otherwise malloc is used.
1686
1687 There are also other values that have to be saved. We use a chained
1688 sequence of blocks that actually live on the stack. Thanks to Robin Houston
1689 for the original version of this logic. It has, however, been hacked around
1690 a lot, so he is not to blame for the current way it works. */
1691
1692 case OP_RECURSE:
1693 {
1694 recursion_info *ri;
1695 int recno;
1696
1697 callpat = md->start_code + GET(ecode, 1);
1698 recno = (callpat == md->start_code)? 0 :
1699 GET2(callpat, 1 + LINK_SIZE);
1700
1701 /* Check for repeating a recursion without advancing the subject pointer.
1702 This should catch convoluted mutual recursions. (Some simple cases are
1703 caught at compile time.) */
1704
1705 for (ri = md->recursive; ri != NULL; ri = ri->prevrec)
1706 if (recno == ri->group_num && eptr == ri->subject_position)
1707 RRETURN(PCRE_ERROR_RECURSELOOP);
1708
1709 /* Add to "recursing stack" */
1710
1711 new_recursive.group_num = recno;
1712 new_recursive.subject_position = eptr;
1713 new_recursive.prevrec = md->recursive;
1714 md->recursive = &new_recursive;
1715
1716 /* Where to continue from afterwards */
1717
1718 ecode += 1 + LINK_SIZE;
1719
1720 /* Now save the offset data */
1721
1722 new_recursive.saved_max = md->offset_end;
1723 if (new_recursive.saved_max <= REC_STACK_SAVE_MAX)
1724 new_recursive.offset_save = stacksave;
1725 else
1726 {
1727 new_recursive.offset_save =
1728 (int *)(PUBL(malloc))(new_recursive.saved_max * sizeof(int));
1729 if (new_recursive.offset_save == NULL) RRETURN(PCRE_ERROR_NOMEMORY);
1730 }
1731 memcpy(new_recursive.offset_save, md->offset_vector,
1732 new_recursive.saved_max * sizeof(int));
1733
1734 /* OK, now we can do the recursion. After processing each alternative,
1735 restore the offset data. If there were nested recursions, md->recursive
1736 might be changed, so reset it before looping. */
1737
1738 DPRINTF(("Recursing into group %d\n", new_recursive.group_num));
1739 cbegroup = (*callpat >= OP_SBRA);
1740 do
1741 {
1742 if (cbegroup) md->match_function_type = MATCH_CBEGROUP;
1743 RMATCH(eptr, callpat + PRIV(OP_lengths)[*callpat], offset_top,
1744 md, eptrb, RM6);
1745 memcpy(md->offset_vector, new_recursive.offset_save,
1746 new_recursive.saved_max * sizeof(int));
1747 md->recursive = new_recursive.prevrec;
1748 if (rrc == MATCH_MATCH || rrc == MATCH_ACCEPT)
1749 {
1750 DPRINTF(("Recursion matched\n"));
1751 if (new_recursive.offset_save != stacksave)
1752 (PUBL(free))(new_recursive.offset_save);
1753
1754 /* Set where we got to in the subject, and reset the start in case
1755 it was changed by \K. This *is* propagated back out of a recursion,
1756 for Perl compatibility. */
1757
1758 eptr = md->end_match_ptr;
1759 mstart = md->start_match_ptr;
1760 goto RECURSION_MATCHED; /* Exit loop; end processing */
1761 }
1762
1763 /* PCRE does not allow THEN to escape beyond a recursion; it is treated
1764 as NOMATCH. */
1765
1766 else if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN)
1767 {
1768 DPRINTF(("Recursion gave error %d\n", rrc));
1769 if (new_recursive.offset_save != stacksave)
1770 (PUBL(free))(new_recursive.offset_save);
1771 RRETURN(rrc);
1772 }
1773
1774 md->recursive = &new_recursive;
1775 callpat += GET(callpat, 1);
1776 }
1777 while (*callpat == OP_ALT);
1778
1779 DPRINTF(("Recursion didn't match\n"));
1780 md->recursive = new_recursive.prevrec;
1781 if (new_recursive.offset_save != stacksave)
1782 (PUBL(free))(new_recursive.offset_save);
1783 RRETURN(MATCH_NOMATCH);
1784 }
1785
1786 RECURSION_MATCHED:
1787 break;
1788
1789 /* An alternation is the end of a branch; scan along to find the end of the
1790 bracketed group and go to there. */
1791
1792 case OP_ALT:
1793 do ecode += GET(ecode,1); while (*ecode == OP_ALT);
1794 break;
1795
1796 /* BRAZERO, BRAMINZERO and SKIPZERO occur just before a bracket group,
1797 indicating that it may occur zero times. It may repeat infinitely, or not
1798 at all - i.e. it could be ()* or ()? or even (){0} in the pattern. Brackets
1799 with fixed upper repeat limits are compiled as a number of copies, with the
1800 optional ones preceded by BRAZERO or BRAMINZERO. */
1801
1802 case OP_BRAZERO:
1803 next = ecode + 1;
1804 RMATCH(eptr, next, offset_top, md, eptrb, RM10);
1805 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
1806 do next += GET(next, 1); while (*next == OP_ALT);
1807 ecode = next + 1 + LINK_SIZE;
1808 break;
1809
1810 case OP_BRAMINZERO:
1811 next = ecode + 1;
1812 do next += GET(next, 1); while (*next == OP_ALT);
1813 RMATCH(eptr, next + 1+LINK_SIZE, offset_top, md, eptrb, RM11);
1814 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
1815 ecode++;
1816 break;
1817
1818 case OP_SKIPZERO:
1819 next = ecode+1;
1820 do next += GET(next,1); while (*next == OP_ALT);
1821 ecode = next + 1 + LINK_SIZE;
1822 break;
1823
1824 /* BRAPOSZERO occurs before a possessive bracket group. Don't do anything
1825 here; just jump to the group, with allow_zero set TRUE. */
1826
1827 case OP_BRAPOSZERO:
1828 op = *(++ecode);
1829 allow_zero = TRUE;
1830 if (op == OP_CBRAPOS || op == OP_SCBRAPOS) goto POSSESSIVE_CAPTURE;
1831 goto POSSESSIVE_NON_CAPTURE;
1832
1833 /* End of a group, repeated or non-repeating. */
1834
1835 case OP_KET:
1836 case OP_KETRMIN:
1837 case OP_KETRMAX:
1838 case OP_KETRPOS:
1839 prev = ecode - GET(ecode, 1);
1840
1841 /* If this was a group that remembered the subject start, in order to break
1842 infinite repeats of empty string matches, retrieve the subject start from
1843 the chain. Otherwise, set it NULL. */
1844
1845 if (*prev >= OP_SBRA || *prev == OP_ONCE)
1846 {
1847 saved_eptr = eptrb->epb_saved_eptr; /* Value at start of group */
1848 eptrb = eptrb->epb_prev; /* Backup to previous group */
1849 }
1850 else saved_eptr = NULL;
1851
1852 /* If we are at the end of an assertion group or a non-capturing atomic
1853 group, stop matching and return MATCH_MATCH, but record the current high
1854 water mark for use by positive assertions. We also need to record the match
1855 start in case it was changed by \K. */
1856
1857 if ((*prev >= OP_ASSERT && *prev <= OP_ASSERTBACK_NOT) ||
1858 *prev == OP_ONCE_NC)
1859 {
1860 md->end_match_ptr = eptr; /* For ONCE_NC */
1861 md->end_offset_top = offset_top;
1862 md->start_match_ptr = mstart;
1863 RRETURN(MATCH_MATCH); /* Sets md->mark */
1864 }
1865
1866 /* For capturing groups we have to check the group number back at the start
1867 and if necessary complete handling an extraction by setting the offsets and
1868 bumping the high water mark. Whole-pattern recursion is coded as a recurse
1869 into group 0, so it won't be picked up here. Instead, we catch it when the
1870 OP_END is reached. Other recursion is handled here. We just have to record
1871 the current subject position and start match pointer and give a MATCH
1872 return. */
1873
1874 if (*prev == OP_CBRA || *prev == OP_SCBRA ||
1875 *prev == OP_CBRAPOS || *prev == OP_SCBRAPOS)
1876 {
1877 number = GET2(prev, 1+LINK_SIZE);
1878 offset = number << 1;
1879
1880 #ifdef PCRE_DEBUG
1881 printf("end bracket %d", number);
1882 printf("\n");
1883 #endif
1884
1885 /* Handle a recursively called group. */
1886
1887 if (md->recursive != NULL && md->recursive->group_num == number)
1888 {
1889 md->end_match_ptr = eptr;
1890 md->start_match_ptr = mstart;
1891 RRETURN(MATCH_MATCH);
1892 }
1893
1894 /* Deal with capturing */
1895
1896 md->capture_last = number;
1897 if (offset >= md->offset_max) md->offset_overflow = TRUE; else
1898 {
1899 /* If offset is greater than offset_top, it means that we are
1900 "skipping" a capturing group, and that group's offsets must be marked
1901 unset. In earlier versions of PCRE, all the offsets were unset at the
1902 start of matching, but this doesn't work because atomic groups and
1903 assertions can cause a value to be set that should later be unset.
1904 Example: matching /(?>(a))b|(a)c/ against "ac". This sets group 1 as
1905 part of the atomic group, but this is not on the final matching path,
1906 so must be unset when 2 is set. (If there is no group 2, there is no
1907 problem, because offset_top will then be 2, indicating no capture.) */
1908
1909 if (offset > offset_top)
1910 {
1911 register int *iptr = md->offset_vector + offset_top;
1912 register int *iend = md->offset_vector + offset;
1913 while (iptr < iend) *iptr++ = -1;
1914 }
1915
1916 /* Now make the extraction */
1917
1918 md->offset_vector[offset] =
1919 md->offset_vector[md->offset_end - number];
1920 md->offset_vector[offset+1] = (int)(eptr - md->start_subject);
1921 if (offset_top <= offset) offset_top = offset + 2;
1922 }
1923 }
1924
1925 /* For an ordinary non-repeating ket, just continue at this level. This
1926 also happens for a repeating ket if no characters were matched in the
1927 group. This is the forcible breaking of infinite loops as implemented in
1928 Perl 5.005. For a non-repeating atomic group that includes captures,
1929 establish a backup point by processing the rest of the pattern at a lower
1930 level. If this results in a NOMATCH return, pass MATCH_ONCE back to the
1931 original OP_ONCE level, thereby bypassing intermediate backup points, but
1932 resetting any captures that happened along the way. */
1933
1934 if (*ecode == OP_KET || eptr == saved_eptr)
1935 {
1936 if (*prev == OP_ONCE)
1937 {
1938 RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, eptrb, RM12);
1939 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
1940 md->once_target = prev; /* Level at which to change to MATCH_NOMATCH */
1941 RRETURN(MATCH_ONCE);
1942 }
1943 ecode += 1 + LINK_SIZE; /* Carry on at this level */
1944 break;
1945 }
1946
1947 /* OP_KETRPOS is a possessive repeating ket. Remember the current position,
1948 and return the MATCH_KETRPOS. This makes it possible to do the repeats one
1949 at a time from the outer level, thus saving stack. */
1950
1951 if (*ecode == OP_KETRPOS)
1952 {
1953 md->end_match_ptr = eptr;
1954 md->end_offset_top = offset_top;
1955 RRETURN(MATCH_KETRPOS);
1956 }
1957
1958 /* The normal repeating kets try the rest of the pattern or restart from
1959 the preceding bracket, in the appropriate order. In the second case, we can
1960 use tail recursion to avoid using another stack frame, unless we have an
1961 an atomic group or an unlimited repeat of a group that can match an empty
1962 string. */
1963
1964 if (*ecode == OP_KETRMIN)
1965 {
1966 RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, eptrb, RM7);
1967 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
1968 if (*prev == OP_ONCE)
1969 {
1970 RMATCH(eptr, prev, offset_top, md, eptrb, RM8);
1971 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
1972 md->once_target = prev; /* Level at which to change to MATCH_NOMATCH */
1973 RRETURN(MATCH_ONCE);
1974 }
1975 if (*prev >= OP_SBRA) /* Could match an empty string */
1976 {
1977 md->match_function_type = MATCH_CBEGROUP;
1978 RMATCH(eptr, prev, offset_top, md, eptrb, RM50);
1979 RRETURN(rrc);
1980 }
1981 ecode = prev;
1982 goto TAIL_RECURSE;
1983 }
1984 else /* OP_KETRMAX */
1985 {
1986 if (*prev >= OP_SBRA) md->match_function_type = MATCH_CBEGROUP;
1987 RMATCH(eptr, prev, offset_top, md, eptrb, RM13);
1988 if (rrc == MATCH_ONCE && md->once_target == prev) rrc = MATCH_NOMATCH;
1989 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
1990 if (*prev == OP_ONCE)
1991 {
1992 RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, eptrb, RM9);
1993 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
1994 md->once_target = prev;
1995 RRETURN(MATCH_ONCE);
1996 }
1997 ecode += 1 + LINK_SIZE;
1998 goto TAIL_RECURSE;
1999 }
2000 /* Control never gets here */
2001
2002 /* Not multiline mode: start of subject assertion, unless notbol. */
2003
2004 case OP_CIRC:
2005 if (md->notbol && eptr == md->start_subject) RRETURN(MATCH_NOMATCH);
2006
2007 /* Start of subject assertion */
2008
2009 case OP_SOD:
2010 if (eptr != md->start_subject) RRETURN(MATCH_NOMATCH);
2011 ecode++;
2012 break;
2013
2014 /* Multiline mode: start of subject unless notbol, or after any newline. */
2015
2016 case OP_CIRCM:
2017 if (md->notbol && eptr == md->start_subject) RRETURN(MATCH_NOMATCH);
2018 if (eptr != md->start_subject &&
2019 (eptr == md->end_subject || !WAS_NEWLINE(eptr)))
2020 RRETURN(MATCH_NOMATCH);
2021 ecode++;
2022 break;
2023
2024 /* Start of match assertion */
2025
2026 case OP_SOM:
2027 if (eptr != md->start_subject + md->start_offset) RRETURN(MATCH_NOMATCH);
2028 ecode++;
2029 break;
2030
2031 /* Reset the start of match point */
2032
2033 case OP_SET_SOM:
2034 mstart = eptr;
2035 ecode++;
2036 break;
2037
2038 /* Multiline mode: assert before any newline, or before end of subject
2039 unless noteol is set. */
2040
2041 case OP_DOLLM:
2042 if (eptr < md->end_subject)
2043 { if (!IS_NEWLINE(eptr)) RRETURN(MATCH_NOMATCH); }
2044 else
2045 {
2046 if (md->noteol) RRETURN(MATCH_NOMATCH);
2047 SCHECK_PARTIAL();
2048 }
2049 ecode++;
2050 break;
2051
2052 /* Not multiline mode: assert before a terminating newline or before end of
2053 subject unless noteol is set. */
2054
2055 case OP_DOLL:
2056 if (md->noteol) RRETURN(MATCH_NOMATCH);
2057 if (!md->endonly) goto ASSERT_NL_OR_EOS;
2058
2059 /* ... else fall through for endonly */
2060
2061 /* End of subject assertion (\z) */
2062
2063 case OP_EOD:
2064 if (eptr < md->end_subject) RRETURN(MATCH_NOMATCH);
2065 SCHECK_PARTIAL();
2066 ecode++;
2067 break;
2068
2069 /* End of subject or ending \n assertion (\Z) */
2070
2071 case OP_EODN:
2072 ASSERT_NL_OR_EOS:
2073 if (eptr < md->end_subject &&
2074 (!IS_NEWLINE(eptr) || eptr != md->end_subject - md->nllen))
2075 RRETURN(MATCH_NOMATCH);
2076
2077 /* Either at end of string or \n before end. */
2078
2079 SCHECK_PARTIAL();
2080 ecode++;
2081 break;
2082
2083 /* Word boundary assertions */
2084
2085 case OP_NOT_WORD_BOUNDARY:
2086 case OP_WORD_BOUNDARY:
2087 {
2088
2089 /* Find out if the previous and current characters are "word" characters.
2090 It takes a bit more work in UTF-8 mode. Characters > 255 are assumed to
2091 be "non-word" characters. Remember the earliest consulted character for
2092 partial matching. */
2093
2094 #ifdef SUPPORT_UTF
2095 if (utf)
2096 {
2097 /* Get status of previous character */
2098
2099 if (eptr == md->start_subject) prev_is_word = FALSE; else
2100 {
2101 PCRE_PUCHAR lastptr = eptr - 1;
2102 BACKCHAR(lastptr);
2103 if (lastptr < md->start_used_ptr) md->start_used_ptr = lastptr;
2104 GETCHAR(c, lastptr);
2105 #ifdef SUPPORT_UCP
2106 if (md->use_ucp)
2107 {
2108 if (c == '_') prev_is_word = TRUE; else
2109 {
2110 int cat = UCD_CATEGORY(c);
2111 prev_is_word = (cat == ucp_L || cat == ucp_N);
2112 }
2113 }
2114 else
2115 #endif
2116 prev_is_word = c < 256 && (md->ctypes[c] & ctype_word) != 0;
2117 }
2118
2119 /* Get status of next character */
2120
2121 if (eptr >= md->end_subject)
2122 {
2123 SCHECK_PARTIAL();
2124 cur_is_word = FALSE;
2125 }
2126 else
2127 {
2128 GETCHAR(c, eptr);
2129 #ifdef SUPPORT_UCP
2130 if (md->use_ucp)
2131 {
2132 if (c == '_') cur_is_word = TRUE; else
2133 {
2134 int cat = UCD_CATEGORY(c);
2135 cur_is_word = (cat == ucp_L || cat == ucp_N);
2136 }
2137 }
2138 else
2139 #endif
2140 cur_is_word = c < 256 && (md->ctypes[c] & ctype_word) != 0;
2141 }
2142 }
2143 else
2144 #endif
2145
2146 /* Not in UTF-8 mode, but we may still have PCRE_UCP set, and for
2147 consistency with the behaviour of \w we do use it in this case. */
2148
2149 {
2150 /* Get status of previous character */
2151
2152 if (eptr == md->start_subject) prev_is_word = FALSE; else
2153 {
2154 if (eptr <= md->start_used_ptr) md->start_used_ptr = eptr - 1;
2155 #ifdef SUPPORT_UCP
2156 if (md->use_ucp)
2157 {
2158 c = eptr[-1];
2159 if (c == '_') prev_is_word = TRUE; else
2160 {
2161 int cat = UCD_CATEGORY(c);
2162 prev_is_word = (cat == ucp_L || cat == ucp_N);
2163 }
2164 }
2165 else
2166 #endif
2167 prev_is_word = MAX_255(eptr[-1])
2168 && ((md->ctypes[eptr[-1]] & ctype_word) != 0);
2169 }
2170
2171 /* Get status of next character */
2172
2173 if (eptr >= md->end_subject)
2174 {
2175 SCHECK_PARTIAL();
2176 cur_is_word = FALSE;
2177 }
2178 else
2179 #ifdef SUPPORT_UCP
2180 if (md->use_ucp)
2181 {
2182 c = *eptr;
2183 if (c == '_') cur_is_word = TRUE; else
2184 {
2185 int cat = UCD_CATEGORY(c);
2186 cur_is_word = (cat == ucp_L || cat == ucp_N);
2187 }
2188 }
2189 else
2190 #endif
2191 cur_is_word = MAX_255(*eptr)
2192 && ((md->ctypes[*eptr] & ctype_word) != 0);
2193 }
2194
2195 /* Now see if the situation is what we want */
2196
2197 if ((*ecode++ == OP_WORD_BOUNDARY)?
2198 cur_is_word == prev_is_word : cur_is_word != prev_is_word)
2199 RRETURN(MATCH_NOMATCH);
2200 }
2201 break;
2202
2203 /* Match a single character type; inline for speed */
2204
2205 case OP_ANY:
2206 if (IS_NEWLINE(eptr)) RRETURN(MATCH_NOMATCH);
2207 /* Fall through */
2208
2209 case OP_ALLANY:
2210 if (eptr >= md->end_subject) /* DO NOT merge the eptr++ here; it must */
2211 { /* not be updated before SCHECK_PARTIAL. */
2212 SCHECK_PARTIAL();
2213 RRETURN(MATCH_NOMATCH);
2214 }
2215 eptr++;
2216 #ifdef SUPPORT_UTF
2217 if (utf) ACROSSCHAR(eptr < md->end_subject, *eptr, eptr++);
2218 #endif
2219 ecode++;
2220 break;
2221
2222 /* Match a single byte, even in UTF-8 mode. This opcode really does match
2223 any byte, even newline, independent of the setting of PCRE_DOTALL. */
2224
2225 case OP_ANYBYTE:
2226 if (eptr >= md->end_subject) /* DO NOT merge the eptr++ here; it must */
2227 { /* not be updated before SCHECK_PARTIAL. */
2228 SCHECK_PARTIAL();
2229 RRETURN(MATCH_NOMATCH);
2230 }
2231 eptr++;
2232 ecode++;
2233 break;
2234
2235 case OP_NOT_DIGIT:
2236 if (eptr >= md->end_subject)
2237 {
2238 SCHECK_PARTIAL();
2239 RRETURN(MATCH_NOMATCH);
2240 }
2241 GETCHARINCTEST(c, eptr);
2242 if (
2243 #if defined SUPPORT_UTF || !(defined COMPILE_PCRE8)
2244 c < 256 &&
2245 #endif
2246 (md->ctypes[c] & ctype_digit) != 0
2247 )
2248 RRETURN(MATCH_NOMATCH);
2249 ecode++;
2250 break;
2251
2252 case OP_DIGIT:
2253 if (eptr >= md->end_subject)
2254 {
2255 SCHECK_PARTIAL();
2256 RRETURN(MATCH_NOMATCH);
2257 }
2258 GETCHARINCTEST(c, eptr);
2259 if (
2260 #if defined SUPPORT_UTF || !(defined COMPILE_PCRE8)
2261 c > 255 ||
2262 #endif
2263 (md->ctypes[c] & ctype_digit) == 0
2264 )
2265 RRETURN(MATCH_NOMATCH);
2266 ecode++;
2267 break;
2268
2269 case OP_NOT_WHITESPACE:
2270 if (eptr >= md->end_subject)
2271 {
2272 SCHECK_PARTIAL();
2273 RRETURN(MATCH_NOMATCH);
2274 }
2275 GETCHARINCTEST(c, eptr);
2276 if (
2277 #if defined SUPPORT_UTF || !(defined COMPILE_PCRE8)
2278 c < 256 &&
2279 #endif
2280 (md->ctypes[c] & ctype_space) != 0
2281 )
2282 RRETURN(MATCH_NOMATCH);
2283 ecode++;
2284 break;
2285
2286 case OP_WHITESPACE:
2287 if (eptr >= md->end_subject)
2288 {
2289 SCHECK_PARTIAL();
2290 RRETURN(MATCH_NOMATCH);
2291 }
2292 GETCHARINCTEST(c, eptr);
2293 if (
2294 #if defined SUPPORT_UTF || !(defined COMPILE_PCRE8)
2295 c > 255 ||
2296 #endif
2297 (md->ctypes[c] & ctype_space) == 0
2298 )
2299 RRETURN(MATCH_NOMATCH);
2300 ecode++;
2301 break;
2302
2303 case OP_NOT_WORDCHAR:
2304 if (eptr >= md->end_subject)
2305 {
2306 SCHECK_PARTIAL();
2307 RRETURN(MATCH_NOMATCH);
2308 }
2309 GETCHARINCTEST(c, eptr);
2310 if (
2311 #if defined SUPPORT_UTF || !(defined COMPILE_PCRE8)
2312 c < 256 &&
2313 #endif
2314 (md->ctypes[c] & ctype_word) != 0
2315 )
2316 RRETURN(MATCH_NOMATCH);
2317 ecode++;
2318 break;
2319
2320 case OP_WORDCHAR:
2321 if (eptr >= md->end_subject)
2322 {
2323 SCHECK_PARTIAL();
2324 RRETURN(MATCH_NOMATCH);
2325 }
2326 GETCHARINCTEST(c, eptr);
2327 if (
2328 #if defined SUPPORT_UTF || !(defined COMPILE_PCRE8)
2329 c > 255 ||
2330 #endif
2331 (md->ctypes[c] & ctype_word) == 0
2332 )
2333 RRETURN(MATCH_NOMATCH);
2334 ecode++;
2335 break;
2336
2337 case OP_ANYNL:
2338 if (eptr >= md->end_subject)
2339 {
2340 SCHECK_PARTIAL();
2341 RRETURN(MATCH_NOMATCH);
2342 }
2343 GETCHARINCTEST(c, eptr);
2344 switch(c)
2345 {
2346 default: RRETURN(MATCH_NOMATCH);
2347
2348 case 0x000d:
2349 if (eptr < md->end_subject && *eptr == 0x0a) eptr++;
2350 break;
2351
2352 case 0x000a:
2353 break;
2354
2355 case 0x000b:
2356 case 0x000c:
2357 case 0x0085:
2358 case 0x2028:
2359 case 0x2029:
2360 if (md->bsr_anycrlf) RRETURN(MATCH_NOMATCH);
2361 break;
2362 }
2363 ecode++;
2364 break;
2365
2366 case OP_NOT_HSPACE:
2367 if (eptr >= md->end_subject)
2368 {
2369 SCHECK_PARTIAL();
2370 RRETURN(MATCH_NOMATCH);
2371 }
2372 GETCHARINCTEST(c, eptr);
2373 switch(c)
2374 {
2375 default: break;
2376 case 0x09: /* HT */
2377 case 0x20: /* SPACE */
2378 case 0xa0: /* NBSP */
2379 case 0x1680: /* OGHAM SPACE MARK */
2380 case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
2381 case 0x2000: /* EN QUAD */
2382 case 0x2001: /* EM QUAD */
2383 case 0x2002: /* EN SPACE */
2384 case 0x2003: /* EM SPACE */
2385 case 0x2004: /* THREE-PER-EM SPACE */
2386 case 0x2005: /* FOUR-PER-EM SPACE */
2387 case 0x2006: /* SIX-PER-EM SPACE */
2388 case 0x2007: /* FIGURE SPACE */
2389 case 0x2008: /* PUNCTUATION SPACE */
2390 case 0x2009: /* THIN SPACE */
2391 case 0x200A: /* HAIR SPACE */
2392 case 0x202f: /* NARROW NO-BREAK SPACE */
2393 case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
2394 case 0x3000: /* IDEOGRAPHIC SPACE */
2395 RRETURN(MATCH_NOMATCH);
2396 }
2397 ecode++;
2398 break;
2399
2400 case OP_HSPACE:
2401 if (eptr >= md->end_subject)
2402 {
2403 SCHECK_PARTIAL();
2404 RRETURN(MATCH_NOMATCH);
2405 }
2406 GETCHARINCTEST(c, eptr);
2407 switch(c)
2408 {
2409 default: RRETURN(MATCH_NOMATCH);
2410 case 0x09: /* HT */
2411 case 0x20: /* SPACE */
2412 case 0xa0: /* NBSP */
2413 case 0x1680: /* OGHAM SPACE MARK */
2414 case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
2415 case 0x2000: /* EN QUAD */
2416 case 0x2001: /* EM QUAD */
2417 case 0x2002: /* EN SPACE */
2418 case 0x2003: /* EM SPACE */
2419 case 0x2004: /* THREE-PER-EM SPACE */
2420 case 0x2005: /* FOUR-PER-EM SPACE */
2421 case 0x2006: /* SIX-PER-EM SPACE */
2422 case 0x2007: /* FIGURE SPACE */
2423 case 0x2008: /* PUNCTUATION SPACE */
2424 case 0x2009: /* THIN SPACE */
2425 case 0x200A: /* HAIR SPACE */
2426 case 0x202f: /* NARROW NO-BREAK SPACE */
2427 case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
2428 case 0x3000: /* IDEOGRAPHIC SPACE */
2429 break;
2430 }
2431 ecode++;
2432 break;
2433
2434 case OP_NOT_VSPACE:
2435 if (eptr >= md->end_subject)
2436 {
2437 SCHECK_PARTIAL();
2438 RRETURN(MATCH_NOMATCH);
2439 }
2440 GETCHARINCTEST(c, eptr);
2441 switch(c)
2442 {
2443 default: break;
2444 case 0x0a: /* LF */
2445 case 0x0b: /* VT */
2446 case 0x0c: /* FF */
2447 case 0x0d: /* CR */
2448 case 0x85: /* NEL */
2449 case 0x2028: /* LINE SEPARATOR */
2450 case 0x2029: /* PARAGRAPH SEPARATOR */
2451 RRETURN(MATCH_NOMATCH);
2452 }
2453 ecode++;
2454 break;
2455
2456 case OP_VSPACE:
2457 if (eptr >= md->end_subject)
2458 {
2459 SCHECK_PARTIAL();
2460 RRETURN(MATCH_NOMATCH);
2461 }
2462 GETCHARINCTEST(c, eptr);
2463 switch(c)
2464 {
2465 default: RRETURN(MATCH_NOMATCH);
2466 case 0x0a: /* LF */
2467 case 0x0b: /* VT */
2468 case 0x0c: /* FF */
2469 case 0x0d: /* CR */
2470 case 0x85: /* NEL */
2471 case 0x2028: /* LINE SEPARATOR */
2472 case 0x2029: /* PARAGRAPH SEPARATOR */
2473 break;
2474 }
2475 ecode++;
2476 break;
2477
2478 #ifdef SUPPORT_UCP
2479 /* Check the next character by Unicode property. We will get here only
2480 if the support is in the binary; otherwise a compile-time error occurs. */
2481
2482 case OP_PROP:
2483 case OP_NOTPROP:
2484 if (eptr >= md->end_subject)
2485 {
2486 SCHECK_PARTIAL();
2487 RRETURN(MATCH_NOMATCH);
2488 }
2489 GETCHARINCTEST(c, eptr);
2490 {
2491 const ucd_record *prop = GET_UCD(c);
2492
2493 switch(ecode[1])
2494 {
2495 case PT_ANY:
2496 if (op == OP_NOTPROP) RRETURN(MATCH_NOMATCH);
2497 break;
2498
2499 case PT_LAMP:
2500 if ((prop->chartype == ucp_Lu ||
2501 prop->chartype == ucp_Ll ||
2502 prop->chartype == ucp_Lt) == (op == OP_NOTPROP))
2503 RRETURN(MATCH_NOMATCH);
2504 break;
2505
2506 case PT_GC:
2507 if ((ecode[2] != PRIV(ucp_gentype)[prop->chartype]) == (op == OP_PROP))
2508 RRETURN(MATCH_NOMATCH);
2509 break;
2510
2511 case PT_PC:
2512 if ((ecode[2] != prop->chartype) == (op == OP_PROP))
2513 RRETURN(MATCH_NOMATCH);
2514 break;
2515
2516 case PT_SC:
2517 if ((ecode[2] != prop->script) == (op == OP_PROP))
2518 RRETURN(MATCH_NOMATCH);
2519 break;
2520
2521 /* These are specials */
2522
2523 case PT_ALNUM:
2524 if ((PRIV(ucp_gentype)[prop->chartype] == ucp_L ||
2525 PRIV(ucp_gentype)[prop->chartype] == ucp_N) == (op == OP_NOTPROP))
2526 RRETURN(MATCH_NOMATCH);
2527 break;
2528
2529 case PT_SPACE: /* Perl space */
2530 if ((PRIV(ucp_gentype)[prop->chartype] == ucp_Z ||
2531 c == CHAR_HT || c == CHAR_NL || c == CHAR_FF || c == CHAR_CR)
2532 == (op == OP_NOTPROP))
2533 RRETURN(MATCH_NOMATCH);
2534 break;
2535
2536 case PT_PXSPACE: /* POSIX space */
2537 if ((PRIV(ucp_gentype)[prop->chartype] == ucp_Z ||
2538 c == CHAR_HT || c == CHAR_NL || c == CHAR_VT ||
2539 c == CHAR_FF || c == CHAR_CR)
2540 == (op == OP_NOTPROP))
2541 RRETURN(MATCH_NOMATCH);
2542 break;
2543
2544 case PT_WORD:
2545 if ((PRIV(ucp_gentype)[prop->chartype] == ucp_L ||
2546 PRIV(ucp_gentype)[prop->chartype] == ucp_N ||
2547 c == CHAR_UNDERSCORE) == (op == OP_NOTPROP))
2548 RRETURN(MATCH_NOMATCH);
2549 break;
2550
2551 /* This should never occur */
2552
2553 default:
2554 RRETURN(PCRE_ERROR_INTERNAL);
2555 }
2556
2557 ecode += 3;
2558 }
2559 break;
2560
2561 /* Match an extended Unicode sequence. We will get here only if the support
2562 is in the binary; otherwise a compile-time error occurs. */
2563
2564 case OP_EXTUNI:
2565 if (eptr >= md->end_subject)
2566 {
2567 SCHECK_PARTIAL();
2568 RRETURN(MATCH_NOMATCH);
2569 }
2570 GETCHARINCTEST(c, eptr);
2571 if (UCD_CATEGORY(c) == ucp_M) RRETURN(MATCH_NOMATCH);
2572 while (eptr < md->end_subject)
2573 {
2574 int len = 1;
2575 if (!utf) c = *eptr; else { GETCHARLEN(c, eptr, len); }
2576 if (UCD_CATEGORY(c) != ucp_M) break;
2577 eptr += len;
2578 }
2579 ecode++;
2580 break;
2581 #endif
2582
2583
2584 /* Match a back reference, possibly repeatedly. Look past the end of the
2585 item to see if there is repeat information following. The code is similar
2586 to that for character classes, but repeated for efficiency. Then obey
2587 similar code to character type repeats - written out again for speed.
2588 However, if the referenced string is the empty string, always treat
2589 it as matched, any number of times (otherwise there could be infinite
2590 loops). */
2591
2592 case OP_REF:
2593 case OP_REFI:
2594 caseless = op == OP_REFI;
2595 offset = GET2(ecode, 1) << 1; /* Doubled ref number */
2596 ecode += 1 + IMM2_SIZE;
2597
2598 /* If the reference is unset, there are two possibilities:
2599
2600 (a) In the default, Perl-compatible state, set the length negative;
2601 this ensures that every attempt at a match fails. We can't just fail
2602 here, because of the possibility of quantifiers with zero minima.
2603
2604 (b) If the JavaScript compatibility flag is set, set the length to zero
2605 so that the back reference matches an empty string.
2606
2607 Otherwise, set the length to the length of what was matched by the
2608 referenced subpattern. */
2609
2610 if (offset >= offset_top || md->offset_vector[offset] < 0)
2611 length = (md->jscript_compat)? 0 : -1;
2612 else
2613 length = md->offset_vector[offset+1] - md->offset_vector[offset];
2614
2615 /* Set up for repetition, or handle the non-repeated case */
2616
2617 switch (*ecode)
2618 {
2619 case OP_CRSTAR:
2620 case OP_CRMINSTAR:
2621 case OP_CRPLUS:
2622 case OP_CRMINPLUS:
2623 case OP_CRQUERY:
2624 case OP_CRMINQUERY:
2625 c = *ecode++ - OP_CRSTAR;
2626 minimize = (c & 1) != 0;
2627 min = rep_min[c]; /* Pick up values from tables; */
2628 max = rep_max[c]; /* zero for max => infinity */
2629 if (max == 0) max = INT_MAX;
2630 break;
2631
2632 case OP_CRRANGE:
2633 case OP_CRMINRANGE:
2634 minimize = (*ecode == OP_CRMINRANGE);
2635 min = GET2(ecode, 1);
2636 max = GET2(ecode, 1 + IMM2_SIZE);
2637 if (max == 0) max = INT_MAX;
2638 ecode += 1 + 2 * IMM2_SIZE;
2639 break;
2640
2641 default: /* No repeat follows */
2642 if ((length = match_ref(offset, eptr, length, md, caseless)) < 0)
2643 {
2644 CHECK_PARTIAL();
2645 RRETURN(MATCH_NOMATCH);
2646 }
2647 eptr += length;
2648 continue; /* With the main loop */
2649 }
2650
2651 /* Handle repeated back references. If the length of the reference is
2652 zero, just continue with the main loop. If the length is negative, it
2653 means the reference is unset in non-Java-compatible mode. If the minimum is
2654 zero, we can continue at the same level without recursion. For any other
2655 minimum, carrying on will result in NOMATCH. */
2656
2657 if (length == 0) continue;
2658 if (length < 0 && min == 0) continue;
2659
2660 /* First, ensure the minimum number of matches are present. We get back
2661 the length of the reference string explicitly rather than passing the
2662 address of eptr, so that eptr can be a register variable. */
2663
2664 for (i = 1; i <= min; i++)
2665 {
2666 int slength;
2667 if ((slength = match_ref(offset, eptr, length, md, caseless)) < 0)
2668 {
2669 CHECK_PARTIAL();
2670 RRETURN(MATCH_NOMATCH);
2671 }
2672 eptr += slength;
2673 }
2674
2675 /* If min = max, continue at the same level without recursion.
2676 They are not both allowed to be zero. */
2677
2678 if (min == max) continue;
2679
2680 /* If minimizing, keep trying and advancing the pointer */
2681
2682 if (minimize)
2683 {
2684 for (fi = min;; fi++)
2685 {
2686 int slength;
2687 RMATCH(eptr, ecode, offset_top, md, eptrb, RM14);
2688 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
2689 if (fi >= max) RRETURN(MATCH_NOMATCH);
2690 if ((slength = match_ref(offset, eptr, length, md, caseless)) < 0)
2691 {
2692 CHECK_PARTIAL();
2693 RRETURN(MATCH_NOMATCH);
2694 }
2695 eptr += slength;
2696 }
2697 /* Control never gets here */
2698 }
2699
2700 /* If maximizing, find the longest string and work backwards */
2701
2702 else
2703 {
2704 pp = eptr;
2705 for (i = min; i < max; i++)
2706 {
2707 int slength;
2708 if ((slength = match_ref(offset, eptr, length, md, caseless)) < 0)
2709 {
2710 CHECK_PARTIAL();
2711 break;
2712 }
2713 eptr += slength;
2714 }
2715 while (eptr >= pp)
2716 {
2717 RMATCH(eptr, ecode, offset_top, md, eptrb, RM15);
2718 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
2719 eptr -= length;
2720 }
2721 RRETURN(MATCH_NOMATCH);
2722 }
2723 /* Control never gets here */
2724
2725 /* Match a bit-mapped character class, possibly repeatedly. This op code is
2726 used when all the characters in the class have values in the range 0-255,
2727 and either the matching is caseful, or the characters are in the range
2728 0-127 when UTF-8 processing is enabled. The only difference between
2729 OP_CLASS and OP_NCLASS occurs when a data character outside the range is
2730 encountered.
2731
2732 First, look past the end of the item to see if there is repeat information
2733 following. Then obey similar code to character type repeats - written out
2734 again for speed. */
2735
2736 case OP_NCLASS:
2737 case OP_CLASS:
2738 {
2739 /* The data variable is saved across frames, so the byte map needs to
2740 be stored there. */
2741 #define BYTE_MAP ((pcre_uint8 *)data)
2742 data = ecode + 1; /* Save for matching */
2743 ecode += 1 + (32 / sizeof(pcre_uchar)); /* Advance past the item */
2744
2745 switch (*ecode)
2746 {
2747 case OP_CRSTAR:
2748 case OP_CRMINSTAR:
2749 case OP_CRPLUS:
2750 case OP_CRMINPLUS:
2751 case OP_CRQUERY:
2752 case OP_CRMINQUERY:
2753 c = *ecode++ - OP_CRSTAR;
2754 minimize = (c & 1) != 0;
2755 min = rep_min[c]; /* Pick up values from tables; */
2756 max = rep_max[c]; /* zero for max => infinity */
2757 if (max == 0) max = INT_MAX;
2758 break;
2759
2760 case OP_CRRANGE:
2761 case OP_CRMINRANGE:
2762 minimize = (*ecode == OP_CRMINRANGE);
2763 min = GET2(ecode, 1);
2764 max = GET2(ecode, 1 + IMM2_SIZE);
2765 if (max == 0) max = INT_MAX;
2766 ecode += 1 + 2 * IMM2_SIZE;
2767 break;
2768
2769 default: /* No repeat follows */
2770 min = max = 1;
2771 break;
2772 }
2773
2774 /* First, ensure the minimum number of matches are present. */
2775
2776 #ifdef SUPPORT_UTF
2777 if (utf)
2778 {
2779 for (i = 1; i <= min; i++)
2780 {
2781 if (eptr >= md->end_subject)
2782 {
2783 SCHECK_PARTIAL();
2784 RRETURN(MATCH_NOMATCH);
2785 }
2786 GETCHARINC(c, eptr);
2787 if (c > 255)
2788 {
2789 if (op == OP_CLASS) RRETURN(MATCH_NOMATCH);
2790 }
2791 else
2792 if ((BYTE_MAP[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH);
2793 }
2794 }
2795 else
2796 #endif
2797 /* Not UTF mode */
2798 {
2799 for (i = 1; i <= min; i++)
2800 {
2801 if (eptr >= md->end_subject)
2802 {
2803 SCHECK_PARTIAL();
2804 RRETURN(MATCH_NOMATCH);
2805 }
2806 c = *eptr++;
2807 #ifndef COMPILE_PCRE8
2808 if (c > 255)
2809 {
2810 if (op == OP_CLASS) RRETURN(MATCH_NOMATCH);
2811 }
2812 else
2813 #endif
2814 if ((BYTE_MAP[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH);
2815 }
2816 }
2817
2818 /* If max == min we can continue with the main loop without the
2819 need to recurse. */
2820
2821 if (min == max) continue;
2822
2823 /* If minimizing, keep testing the rest of the expression and advancing
2824 the pointer while it matches the class. */
2825
2826 if (minimize)
2827 {
2828 #ifdef SUPPORT_UTF
2829 if (utf)
2830 {
2831 for (fi = min;; fi++)
2832 {
2833 RMATCH(eptr, ecode, offset_top, md, eptrb, RM16);
2834 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
2835 if (fi >= max) RRETURN(MATCH_NOMATCH);
2836 if (eptr >= md->end_subject)
2837 {
2838 SCHECK_PARTIAL();
2839 RRETURN(MATCH_NOMATCH);
2840 }
2841 GETCHARINC(c, eptr);
2842 if (c > 255)
2843 {
2844 if (op == OP_CLASS) RRETURN(MATCH_NOMATCH);
2845 }
2846 else
2847 if ((BYTE_MAP[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH);
2848 }
2849 }
2850 else
2851 #endif
2852 /* Not UTF mode */
2853 {
2854 for (fi = min;; fi++)
2855 {
2856 RMATCH(eptr, ecode, offset_top, md, eptrb, RM17);
2857 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
2858 if (fi >= max) RRETURN(MATCH_NOMATCH);
2859 if (eptr >= md->end_subject)
2860 {
2861 SCHECK_PARTIAL();
2862 RRETURN(MATCH_NOMATCH);
2863 }
2864 c = *eptr++;
2865 #ifndef COMPILE_PCRE8
2866 if (c > 255)
2867 {
2868 if (op == OP_CLASS) RRETURN(MATCH_NOMATCH);
2869 }
2870 else
2871 #endif
2872 if ((BYTE_MAP[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH);
2873 }
2874 }
2875 /* Control never gets here */
2876 }
2877
2878 /* If maximizing, find the longest possible run, then work backwards. */
2879
2880 else
2881 {
2882 pp = eptr;
2883
2884 #ifdef SUPPORT_UTF
2885 if (utf)
2886 {
2887 for (i = min; i < max; i++)
2888 {
2889 int len = 1;
2890 if (eptr >= md->end_subject)
2891 {
2892 SCHECK_PARTIAL();
2893 break;
2894 }
2895 GETCHARLEN(c, eptr, len);
2896 if (c > 255)
2897 {
2898 if (op == OP_CLASS) break;
2899 }
2900 else
2901 if ((BYTE_MAP[c/8] & (1 << (c&7))) == 0) break;
2902 eptr += len;
2903 }
2904 for (;;)
2905 {
2906 RMATCH(eptr, ecode, offset_top, md, eptrb, RM18);
2907 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
2908 if (eptr-- == pp) break; /* Stop if tried at original pos */
2909 BACKCHAR(eptr);
2910 }
2911 }
2912 else
2913 #endif
2914 /* Not UTF mode */
2915 {
2916 for (i = min; i < max; i++)
2917 {
2918 if (eptr >= md->end_subject)
2919 {
2920 SCHECK_PARTIAL();
2921 break;
2922 }
2923 c = *eptr;
2924 #ifndef COMPILE_PCRE8
2925 if (c > 255)
2926 {
2927 if (op == OP_CLASS) break;
2928 }
2929 else
2930 #endif
2931 if ((BYTE_MAP[c/8] & (1 << (c&7))) == 0) break;
2932 eptr++;
2933 }
2934 while (eptr >= pp)
2935 {
2936 RMATCH(eptr, ecode, offset_top, md, eptrb, RM19);
2937 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
2938 eptr--;
2939 }
2940 }
2941
2942 RRETURN(MATCH_NOMATCH);
2943 }
2944 #undef BYTE_MAP
2945 }
2946 /* Control never gets here */
2947
2948
2949 /* Match an extended character class. This opcode is encountered only
2950 when UTF-8 mode mode is supported. Nevertheless, we may not be in UTF-8
2951 mode, because Unicode properties are supported in non-UTF-8 mode. */
2952
2953 #if defined SUPPORT_UTF || !defined COMPILE_PCRE8
2954 case OP_XCLASS:
2955 {
2956 data = ecode + 1 + LINK_SIZE; /* Save for matching */
2957 ecode += GET(ecode, 1); /* Advance past the item */
2958
2959 switch (*ecode)
2960 {
2961 case OP_CRSTAR:
2962 case OP_CRMINSTAR:
2963 case OP_CRPLUS:
2964 case OP_CRMINPLUS:
2965 case OP_CRQUERY:
2966 case OP_CRMINQUERY:
2967 c = *ecode++ - OP_CRSTAR;
2968 minimize = (c & 1) != 0;
2969 min = rep_min[c]; /* Pick up values from tables; */
2970 max = rep_max[c]; /* zero for max => infinity */
2971 if (max == 0) max = INT_MAX;
2972 break;
2973
2974 case OP_CRRANGE:
2975 case OP_CRMINRANGE:
2976 minimize = (*ecode == OP_CRMINRANGE);
2977 min = GET2(ecode, 1);
2978 max = GET2(ecode, 1 + IMM2_SIZE);
2979 if (max == 0) max = INT_MAX;
2980 ecode += 1 + 2 * IMM2_SIZE;
2981 break;
2982
2983 default: /* No repeat follows */
2984 min = max = 1;
2985 break;
2986 }
2987
2988 /* First, ensure the minimum number of matches are present. */
2989
2990 for (i = 1; i <= min; i++)
2991 {
2992 if (eptr >= md->end_subject)
2993 {
2994 SCHECK_PARTIAL();
2995 RRETURN(MATCH_NOMATCH);
2996 }
2997 GETCHARINCTEST(c, eptr);
2998 if (!PRIV(xclass)(c, data, utf)) RRETURN(MATCH_NOMATCH);
2999 }
3000
3001 /* If max == min we can continue with the main loop without the
3002 need to recurse. */
3003
3004 if (min == max) continue;
3005
3006 /* If minimizing, keep testing the rest of the expression and advancing
3007 the pointer while it matches the class. */
3008
3009 if (minimize)
3010 {
3011 for (fi = min;; fi++)
3012 {
3013 RMATCH(eptr, ecode, offset_top, md, eptrb, RM20);
3014 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3015 if (fi >= max) RRETURN(MATCH_NOMATCH);
3016 if (eptr >= md->end_subject)
3017 {
3018 SCHECK_PARTIAL();
3019 RRETURN(MATCH_NOMATCH);
3020 }
3021 GETCHARINCTEST(c, eptr);
3022 if (!PRIV(xclass)(c, data, utf)) RRETURN(MATCH_NOMATCH);
3023 }
3024 /* Control never gets here */
3025 }
3026
3027 /* If maximizing, find the longest possible run, then work backwards. */
3028
3029 else
3030 {
3031 pp = eptr;
3032 for (i = min; i < max; i++)
3033 {
3034 int len = 1;
3035 if (eptr >= md->end_subject)
3036 {
3037 SCHECK_PARTIAL();
3038 break;
3039 }
3040 #ifdef SUPPORT_UTF
3041 GETCHARLENTEST(c, eptr, len);
3042 #else
3043 c = *eptr;
3044 #endif
3045 if (!PRIV(xclass)(c, data, utf)) break;
3046 eptr += len;
3047 }
3048 for(;;)
3049 {
3050 RMATCH(eptr, ecode, offset_top, md, eptrb, RM21);
3051 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3052 if (eptr-- == pp) break; /* Stop if tried at original pos */
3053 #ifdef SUPPORT_UTF
3054 if (utf) BACKCHAR(eptr);
3055 #endif
3056 }
3057 RRETURN(MATCH_NOMATCH);
3058 }
3059
3060 /* Control never gets here */
3061 }
3062 #endif /* End of XCLASS */
3063
3064 /* Match a single character, casefully */
3065
3066 case OP_CHAR:
3067 #ifdef SUPPORT_UTF
3068 if (utf)
3069 {
3070 length = 1;
3071 ecode++;
3072 GETCHARLEN(fc, ecode, length);
3073 if (length > md->end_subject - eptr)
3074 {
3075 CHECK_PARTIAL(); /* Not SCHECK_PARTIAL() */
3076 RRETURN(MATCH_NOMATCH);
3077 }
3078 while (length-- > 0) if (*ecode++ != *eptr++) RRETURN(MATCH_NOMATCH);
3079 }
3080 else
3081 #endif
3082 /* Not UTF mode */
3083 {
3084 if (md->end_subject - eptr < 1)
3085 {
3086 SCHECK_PARTIAL(); /* This one can use SCHECK_PARTIAL() */
3087 RRETURN(MATCH_NOMATCH);
3088 }
3089 if (ecode[1] != *eptr++) RRETURN(MATCH_NOMATCH);
3090 ecode += 2;
3091 }
3092 break;
3093
3094 /* Match a single character, caselessly. If we are at the end of the
3095 subject, give up immediately. */
3096
3097 case OP_CHARI:
3098 if (eptr >= md->end_subject)
3099 {
3100 SCHECK_PARTIAL();
3101 RRETURN(MATCH_NOMATCH);
3102 }
3103
3104 #ifdef SUPPORT_UTF
3105 if (utf)
3106 {
3107 length = 1;
3108 ecode++;
3109 GETCHARLEN(fc, ecode, length);
3110
3111 /* If the pattern character's value is < 128, we have only one byte, and
3112 we know that its other case must also be one byte long, so we can use the
3113 fast lookup table. We know that there is at least one byte left in the
3114 subject. */
3115
3116 if (fc < 128)
3117 {
3118 if (md->lcc[fc]
3119 != TABLE_GET(*eptr, md->lcc, *eptr)) RRETURN(MATCH_NOMATCH);
3120 ecode++;
3121 eptr++;
3122 }
3123
3124 /* Otherwise we must pick up the subject character. Note that we cannot
3125 use the value of "length" to check for sufficient bytes left, because the
3126 other case of the character may have more or fewer bytes. */
3127
3128 else
3129 {
3130 unsigned int dc;
3131 GETCHARINC(dc, eptr);
3132 ecode += length;
3133
3134 /* If we have Unicode property support, we can use it to test the other
3135 case of the character, if there is one. */
3136
3137 if (fc != dc)
3138 {
3139 #ifdef SUPPORT_UCP
3140 if (dc != UCD_OTHERCASE(fc))
3141 #endif
3142 RRETURN(MATCH_NOMATCH);
3143 }
3144 }
3145 }
3146 else
3147 #endif /* SUPPORT_UTF */
3148
3149 /* Not UTF mode */
3150 {
3151 if (TABLE_GET(ecode[1], md->lcc, ecode[1])
3152 != TABLE_GET(*eptr, md->lcc, *eptr)) RRETURN(MATCH_NOMATCH);
3153 eptr++;
3154 ecode += 2;
3155 }
3156 break;
3157
3158 /* Match a single character repeatedly. */
3159
3160 case OP_EXACT:
3161 case OP_EXACTI:
3162 min = max = GET2(ecode, 1);
3163 ecode += 1 + IMM2_SIZE;
3164 goto REPEATCHAR;
3165
3166 case OP_POSUPTO:
3167 case OP_POSUPTOI:
3168 possessive = TRUE;
3169 /* Fall through */
3170
3171 case OP_UPTO:
3172 case OP_UPTOI:
3173 case OP_MINUPTO:
3174 case OP_MINUPTOI:
3175 min = 0;
3176 max = GET2(ecode, 1);
3177 minimize = *ecode == OP_MINUPTO || *ecode == OP_MINUPTOI;
3178 ecode += 1 + IMM2_SIZE;
3179 goto REPEATCHAR;
3180
3181 case OP_POSSTAR:
3182 case OP_POSSTARI:
3183 possessive = TRUE;
3184 min = 0;
3185 max = INT_MAX;
3186 ecode++;
3187 goto REPEATCHAR;
3188
3189 case OP_POSPLUS:
3190 case OP_POSPLUSI:
3191 possessive = TRUE;
3192 min = 1;
3193 max = INT_MAX;
3194 ecode++;
3195 goto REPEATCHAR;
3196
3197 case OP_POSQUERY:
3198 case OP_POSQUERYI:
3199 possessive = TRUE;
3200 min = 0;
3201 max = 1;
3202 ecode++;
3203 goto REPEATCHAR;
3204
3205 case OP_STAR:
3206 case OP_STARI:
3207 case OP_MINSTAR:
3208 case OP_MINSTARI:
3209 case OP_PLUS:
3210 case OP_PLUSI:
3211 case OP_MINPLUS:
3212 case OP_MINPLUSI:
3213 case OP_QUERY:
3214 case OP_QUERYI:
3215 case OP_MINQUERY:
3216 case OP_MINQUERYI:
3217 c = *ecode++ - ((op < OP_STARI)? OP_STAR : OP_STARI);
3218 minimize = (c & 1) != 0;
3219 min = rep_min[c]; /* Pick up values from tables; */
3220 max = rep_max[c]; /* zero for max => infinity */
3221 if (max == 0) max = INT_MAX;
3222
3223 /* Common code for all repeated single-character matches. */
3224
3225 REPEATCHAR:
3226 #ifdef SUPPORT_UTF
3227 if (utf)
3228 {
3229 length = 1;
3230 charptr = ecode;
3231 GETCHARLEN(fc, ecode, length);
3232 ecode += length;
3233
3234 /* Handle multibyte character matching specially here. There is
3235 support for caseless matching if UCP support is present. */
3236
3237 if (length > 1)
3238 {
3239 #ifdef SUPPORT_UCP
3240 unsigned int othercase;
3241 if (op >= OP_STARI && /* Caseless */
3242 (othercase = UCD_OTHERCASE(fc)) != fc)
3243 oclength = PRIV(ord2utf)(othercase, occhars);
3244 else oclength = 0;
3245 #endif /* SUPPORT_UCP */
3246
3247 for (i = 1; i <= min; i++)
3248 {
3249 if (eptr <= md->end_subject - length &&
3250 memcmp(eptr, charptr, IN_UCHARS(length)) == 0) eptr += length;
3251 #ifdef SUPPORT_UCP
3252 else if (oclength > 0 &&
3253 eptr <= md->end_subject - oclength &&
3254 memcmp(eptr, occhars, IN_UCHARS(oclength)) == 0) eptr += oclength;
3255 #endif /* SUPPORT_UCP */
3256 else
3257 {
3258 CHECK_PARTIAL();
3259 RRETURN(MATCH_NOMATCH);
3260 }
3261 }
3262
3263 if (min == max) continue;
3264
3265 if (minimize)
3266 {
3267 for (fi = min;; fi++)
3268 {
3269 RMATCH(eptr, ecode, offset_top, md, eptrb, RM22);
3270 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3271 if (fi >= max) RRETURN(MATCH_NOMATCH);
3272 if (eptr <= md->end_subject - length &&
3273 memcmp(eptr, charptr, IN_UCHARS(length)) == 0) eptr += length;
3274 #ifdef SUPPORT_UCP
3275 else if (oclength > 0 &&
3276 eptr <= md->end_subject - oclength &&
3277 memcmp(eptr, occhars, IN_UCHARS(oclength)) == 0) eptr += oclength;
3278 #endif /* SUPPORT_UCP */
3279 else
3280 {
3281 CHECK_PARTIAL();
3282 RRETURN(MATCH_NOMATCH);
3283 }
3284 }
3285 /* Control never gets here */
3286 }
3287
3288 else /* Maximize */
3289 {
3290 pp = eptr;
3291 for (i = min; i < max; i++)
3292 {
3293 if (eptr <= md->end_subject - length &&
3294 memcmp(eptr, charptr, IN_UCHARS(length)) == 0) eptr += length;
3295 #ifdef SUPPORT_UCP
3296 else if (oclength > 0 &&
3297 eptr <= md->end_subject - oclength &&
3298 memcmp(eptr, occhars, IN_UCHARS(oclength)) == 0) eptr += oclength;
3299 #endif /* SUPPORT_UCP */
3300 else
3301 {
3302 CHECK_PARTIAL();
3303 break;
3304 }
3305 }
3306
3307 if (possessive) continue;
3308
3309 for(;;)
3310 {
3311 RMATCH(eptr, ecode, offset_top, md, eptrb, RM23);
3312 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3313 if (eptr == pp) { RRETURN(MATCH_NOMATCH); }
3314 #ifdef SUPPORT_UCP
3315 eptr--;
3316 BACKCHAR(eptr);
3317 #else /* without SUPPORT_UCP */
3318 eptr -= length;
3319 #endif /* SUPPORT_UCP */
3320 }
3321 }
3322 /* Control never gets here */
3323 }
3324
3325 /* If the length of a UTF-8 character is 1, we fall through here, and
3326 obey the code as for non-UTF-8 characters below, though in this case the
3327 value of fc will always be < 128. */
3328 }
3329 else
3330 #endif /* SUPPORT_UTF */
3331 /* When not in UTF-8 mode, load a single-byte character. */
3332 fc = *ecode++;
3333
3334 /* The value of fc at this point is always one character, though we may
3335 or may not be in UTF mode. The code is duplicated for the caseless and
3336 caseful cases, for speed, since matching characters is likely to be quite
3337 common. First, ensure the minimum number of matches are present. If min =
3338 max, continue at the same level without recursing. Otherwise, if
3339 minimizing, keep trying the rest of the expression and advancing one
3340 matching character if failing, up to the maximum. Alternatively, if
3341 maximizing, find the maximum number of characters and work backwards. */
3342
3343 DPRINTF(("matching %c{%d,%d} against subject %.*s\n", fc, min, max,
3344 max, eptr));
3345
3346 if (op >= OP_STARI) /* Caseless */
3347 {
3348 #ifdef COMPILE_PCRE8
3349 /* fc must be < 128 if UTF is enabled. */
3350 foc = md->fcc[fc];
3351 #else
3352 #ifdef SUPPORT_UTF
3353 #ifdef SUPPORT_UCP
3354 if (utf && fc > 127)
3355 foc = UCD_OTHERCASE(fc);
3356 #else
3357 if (utf && fc > 127)
3358 foc = fc;
3359 #endif /* SUPPORT_UCP */
3360 else
3361 #endif /* SUPPORT_UTF */
3362 foc = TABLE_GET(fc, md->fcc, fc);
3363 #endif /* COMPILE_PCRE8 */
3364
3365 for (i = 1; i <= min; i++)
3366 {
3367 if (eptr >= md->end_subject)
3368 {
3369 SCHECK_PARTIAL();
3370 RRETURN(MATCH_NOMATCH);
3371 }
3372 if (fc != *eptr && foc != *eptr) RRETURN(MATCH_NOMATCH);
3373 eptr++;
3374 }
3375 if (min == max) continue;
3376 if (minimize)
3377 {
3378 for (fi = min;; fi++)
3379 {
3380 RMATCH(eptr, ecode, offset_top, md, eptrb, RM24);
3381 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3382 if (fi >= max) RRETURN(MATCH_NOMATCH);
3383 if (eptr >= md->end_subject)
3384 {
3385 SCHECK_PARTIAL();
3386 RRETURN(MATCH_NOMATCH);
3387 }
3388 if (fc != *eptr && foc != *eptr) RRETURN(MATCH_NOMATCH);
3389 eptr++;
3390 }
3391 /* Control never gets here */
3392 }
3393 else /* Maximize */
3394 {
3395 pp = eptr;
3396 for (i = min; i < max; i++)
3397 {
3398 if (eptr >= md->end_subject)
3399 {
3400 SCHECK_PARTIAL();
3401 break;
3402 }
3403 if (fc != *eptr && foc != *eptr) break;
3404 eptr++;
3405 }
3406
3407 if (possessive) continue;
3408
3409 while (eptr >= pp)
3410 {
3411 RMATCH(eptr, ecode, offset_top, md, eptrb, RM25);
3412 eptr--;
3413 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3414 }
3415 RRETURN(MATCH_NOMATCH);
3416 }
3417 /* Control never gets here */
3418 }
3419
3420 /* Caseful comparisons (includes all multi-byte characters) */
3421
3422 else
3423 {
3424 for (i = 1; i <= min; i++)
3425 {
3426 if (eptr >= md->end_subject)
3427 {
3428 SCHECK_PARTIAL();
3429 RRETURN(MATCH_NOMATCH);
3430 }
3431 if (fc != *eptr++) RRETURN(MATCH_NOMATCH);
3432 }
3433
3434 if (min == max) continue;
3435
3436 if (minimize)
3437 {
3438 for (fi = min;; fi++)
3439 {
3440 RMATCH(eptr, ecode, offset_top, md, eptrb, RM26);
3441 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3442 if (fi >= max) RRETURN(MATCH_NOMATCH);
3443 if (eptr >= md->end_subject)
3444 {
3445 SCHECK_PARTIAL();
3446 RRETURN(MATCH_NOMATCH);
3447 }
3448 if (fc != *eptr++) RRETURN(MATCH_NOMATCH);
3449 }
3450 /* Control never gets here */
3451 }
3452 else /* Maximize */
3453 {
3454 pp = eptr;
3455 for (i = min; i < max; i++)
3456 {
3457 if (eptr >= md->end_subject)
3458 {
3459 SCHECK_PARTIAL();
3460 break;
3461 }
3462 if (fc != *eptr) break;
3463 eptr++;
3464 }
3465 if (possessive) continue;
3466
3467 while (eptr >= pp)
3468 {
3469 RMATCH(eptr, ecode, offset_top, md, eptrb, RM27);
3470 eptr--;
3471 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3472 }
3473 RRETURN(MATCH_NOMATCH);
3474 }
3475 }
3476 /* Control never gets here */
3477
3478 /* Match a negated single one-byte character. The character we are
3479 checking can be multibyte. */
3480
3481 case OP_NOT:
3482 case OP_NOTI:
3483 if (eptr >= md->end_subject)
3484 {
3485 SCHECK_PARTIAL();
3486 RRETURN(MATCH_NOMATCH);
3487 }
3488 ecode++;
3489 GETCHARINCTEST(c, eptr);
3490 if (op == OP_NOTI) /* The caseless case */
3491 {
3492 register int ch, och;
3493 ch = *ecode++;
3494 #ifdef COMPILE_PCRE8
3495 /* ch must be < 128 if UTF is enabled. */
3496 och = md->fcc[ch];
3497 #else
3498 #ifdef SUPPORT_UTF
3499 #ifdef SUPPORT_UCP
3500 if (utf && ch > 127)
3501 och = UCD_OTHERCASE(ch);
3502 #else
3503 if (utf && ch > 127)
3504 och = ch;
3505 #endif /* SUPPORT_UCP */
3506 else
3507 #endif /* SUPPORT_UTF */
3508 och = TABLE_GET(ch, md->fcc, ch);
3509 #endif /* COMPILE_PCRE8 */
3510 if (ch == c || och == c) RRETURN(MATCH_NOMATCH);
3511 }
3512 else /* Caseful */
3513 {
3514 if (*ecode++ == c) RRETURN(MATCH_NOMATCH);
3515 }
3516 break;
3517
3518 /* Match a negated single one-byte character repeatedly. This is almost a
3519 repeat of the code for a repeated single character, but I haven't found a
3520 nice way of commoning these up that doesn't require a test of the
3521 positive/negative option for each character match. Maybe that wouldn't add
3522 very much to the time taken, but character matching *is* what this is all
3523 about... */
3524
3525 case OP_NOTEXACT:
3526 case OP_NOTEXACTI:
3527 min = max = GET2(ecode, 1);
3528 ecode += 1 + IMM2_SIZE;
3529 goto REPEATNOTCHAR;
3530
3531 case OP_NOTUPTO:
3532 case OP_NOTUPTOI:
3533 case OP_NOTMINUPTO:
3534 case OP_NOTMINUPTOI:
3535 min = 0;
3536 max = GET2(ecode, 1);
3537 minimize = *ecode == OP_NOTMINUPTO || *ecode == OP_NOTMINUPTOI;
3538 ecode += 1 + IMM2_SIZE;
3539 goto REPEATNOTCHAR;
3540
3541 case OP_NOTPOSSTAR:
3542 case OP_NOTPOSSTARI:
3543 possessive = TRUE;
3544 min = 0;
3545 max = INT_MAX;
3546 ecode++;
3547 goto REPEATNOTCHAR;
3548
3549 case OP_NOTPOSPLUS:
3550 case OP_NOTPOSPLUSI:
3551 possessive = TRUE;
3552 min = 1;
3553 max = INT_MAX;
3554 ecode++;
3555 goto REPEATNOTCHAR;
3556
3557 case OP_NOTPOSQUERY:
3558 case OP_NOTPOSQUERYI:
3559 possessive = TRUE;
3560 min = 0;
3561 max = 1;
3562 ecode++;
3563 goto REPEATNOTCHAR;
3564
3565 case OP_NOTPOSUPTO:
3566 case OP_NOTPOSUPTOI:
3567 possessive = TRUE;
3568 min = 0;
3569 max = GET2(ecode, 1);
3570 ecode += 1 + IMM2_SIZE;
3571 goto REPEATNOTCHAR;
3572
3573 case OP_NOTSTAR:
3574 case OP_NOTSTARI:
3575 case OP_NOTMINSTAR:
3576 case OP_NOTMINSTARI:
3577 case OP_NOTPLUS:
3578 case OP_NOTPLUSI:
3579 case OP_NOTMINPLUS:
3580 case OP_NOTMINPLUSI:
3581 case OP_NOTQUERY:
3582 case OP_NOTQUERYI:
3583 case OP_NOTMINQUERY:
3584 case OP_NOTMINQUERYI:
3585 c = *ecode++ - ((op >= OP_NOTSTARI)? OP_NOTSTARI: OP_NOTSTAR);
3586 minimize = (c & 1) != 0;
3587 min = rep_min[c]; /* Pick up values from tables; */
3588 max = rep_max[c]; /* zero for max => infinity */
3589 if (max == 0) max = INT_MAX;
3590
3591 /* Common code for all repeated single-byte matches. */
3592
3593 REPEATNOTCHAR:
3594 fc = *ecode++;
3595
3596 /* The code is duplicated for the caseless and caseful cases, for speed,
3597 since matching characters is likely to be quite common. First, ensure the
3598 minimum number of matches are present. If min = max, continue at the same
3599 level without recursing. Otherwise, if minimizing, keep trying the rest of
3600 the expression and advancing one matching character if failing, up to the
3601 maximum. Alternatively, if maximizing, find the maximum number of
3602 characters and work backwards. */
3603
3604 DPRINTF(("negative matching %c{%d,%d} against subject %.*s\n", fc, min, max,
3605 max, eptr));
3606
3607 if (op >= OP_NOTSTARI) /* Caseless */
3608 {
3609 #ifdef COMPILE_PCRE8
3610 /* fc must be < 128 if UTF is enabled. */
3611 foc = md->fcc[fc];
3612 #else
3613 #ifdef SUPPORT_UTF
3614 #ifdef SUPPORT_UCP
3615 if (utf && fc > 127)
3616 foc = UCD_OTHERCASE(fc);
3617 #else
3618 if (utf && fc > 127)
3619 foc = fc;
3620 #endif /* SUPPORT_UCP */
3621 else
3622 #endif /* SUPPORT_UTF */
3623 foc = TABLE_GET(fc, md->fcc, fc);
3624 #endif /* COMPILE_PCRE8 */
3625
3626 #ifdef SUPPORT_UTF
3627 if (utf)
3628 {
3629 register unsigned int d;
3630 for (i = 1; i <= min; i++)
3631 {
3632 if (eptr >= md->end_subject)
3633 {
3634 SCHECK_PARTIAL();
3635 RRETURN(MATCH_NOMATCH);
3636 }
3637 GETCHARINC(d, eptr);
3638 if (fc == d || foc == d) RRETURN(MATCH_NOMATCH);
3639 }
3640 }
3641 else
3642 #endif
3643 /* Not UTF mode */
3644 {
3645 for (i = 1; i <= min; i++)
3646 {
3647 if (eptr >= md->end_subject)
3648 {
3649 SCHECK_PARTIAL();
3650 RRETURN(MATCH_NOMATCH);
3651 }
3652 if (fc == *eptr || foc == *eptr) RRETURN(MATCH_NOMATCH);
3653 eptr++;
3654 }
3655 }
3656
3657 if (min == max) continue;
3658
3659 if (minimize)
3660 {
3661 #ifdef SUPPORT_UTF
3662 if (utf)
3663 {
3664 register unsigned int d;
3665 for (fi = min;; fi++)
3666 {
3667 RMATCH(eptr, ecode, offset_top, md, eptrb, RM28);
3668 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3669 if (fi >= max) RRETURN(MATCH_NOMATCH);
3670 if (eptr >= md->end_subject)
3671 {
3672 SCHECK_PARTIAL();
3673 RRETURN(MATCH_NOMATCH);
3674 }
3675 GETCHARINC(d, eptr);
3676 if (fc == d || foc == d) RRETURN(MATCH_NOMATCH);
3677 }
3678 }
3679 else
3680 #endif
3681 /* Not UTF mode */
3682 {
3683 for (fi = min;; fi++)
3684 {
3685 RMATCH(eptr, ecode, offset_top, md, eptrb, RM29);
3686 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3687 if (fi >= max) RRETURN(MATCH_NOMATCH);
3688 if (eptr >= md->end_subject)
3689 {
3690 SCHECK_PARTIAL();
3691 RRETURN(MATCH_NOMATCH);
3692 }
3693 if (fc == *eptr || foc == *eptr) RRETURN(MATCH_NOMATCH);
3694 eptr++;
3695 }
3696 }
3697 /* Control never gets here */
3698 }
3699
3700 /* Maximize case */
3701
3702 else
3703 {
3704 pp = eptr;
3705
3706 #ifdef SUPPORT_UTF
3707 if (utf)
3708 {
3709 register unsigned int d;
3710 for (i = min; i < max; i++)
3711 {
3712 int len = 1;
3713 if (eptr >= md->end_subject)
3714 {
3715 SCHECK_PARTIAL();
3716 break;
3717 }
3718 GETCHARLEN(d, eptr, len);
3719 if (fc == d || foc == d) break;
3720 eptr += len;
3721 }
3722 if (possessive) continue;
3723 for(;;)
3724 {
3725 RMATCH(eptr, ecode, offset_top, md, eptrb, RM30);
3726 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3727 if (eptr-- == pp) break; /* Stop if tried at original pos */
3728 BACKCHAR(eptr);
3729 }
3730 }
3731 else
3732 #endif
3733 /* Not UTF mode */
3734 {
3735 for (i = min; i < max; i++)
3736 {
3737 if (eptr >= md->end_subject)
3738 {
3739 SCHECK_PARTIAL();
3740 break;
3741 }
3742 if (fc == *eptr || foc == *eptr) break;
3743 eptr++;
3744 }
3745 if (possessive) continue;
3746 while (eptr >= pp)
3747 {
3748 RMATCH(eptr, ecode, offset_top, md, eptrb, RM31);
3749 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3750 eptr--;
3751 }
3752 }
3753
3754 RRETURN(MATCH_NOMATCH);
3755 }
3756 /* Control never gets here */
3757 }
3758
3759 /* Caseful comparisons */
3760
3761 else
3762 {
3763 #ifdef SUPPORT_UTF
3764 if (utf)
3765 {
3766 register unsigned int d;
3767 for (i = 1; i <= min; i++)
3768 {
3769 if (eptr >= md->end_subject)
3770 {
3771 SCHECK_PARTIAL();
3772 RRETURN(MATCH_NOMATCH);
3773 }
3774 GETCHARINC(d, eptr);
3775 if (fc == d) RRETURN(MATCH_NOMATCH);
3776 }
3777 }
3778 else
3779 #endif
3780 /* Not UTF mode */
3781 {
3782 for (i = 1; i <= min; i++)
3783 {
3784 if (eptr >= md->end_subject)
3785 {
3786 SCHECK_PARTIAL();
3787 RRETURN(MATCH_NOMATCH);
3788 }
3789 if (fc == *eptr++) RRETURN(MATCH_NOMATCH);
3790 }
3791 }
3792
3793 if (min == max) continue;
3794
3795 if (minimize)
3796 {
3797 #ifdef SUPPORT_UTF
3798 if (utf)
3799 {
3800 register unsigned int d;
3801 for (fi = min;; fi++)
3802 {
3803 RMATCH(eptr, ecode, offset_top, md, eptrb, RM32);
3804 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3805 if (fi >= max) RRETURN(MATCH_NOMATCH);
3806 if (eptr >= md->end_subject)
3807 {
3808 SCHECK_PARTIAL();
3809 RRETURN(MATCH_NOMATCH);
3810 }
3811 GETCHARINC(d, eptr);
3812 if (fc == d) RRETURN(MATCH_NOMATCH);
3813 }
3814 }
3815 else
3816 #endif
3817 /* Not UTF mode */
3818 {
3819 for (fi = min;; fi++)
3820 {
3821 RMATCH(eptr, ecode, offset_top, md, eptrb, RM33);
3822 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3823 if (fi >= max) RRETURN(MATCH_NOMATCH);
3824 if (eptr >= md->end_subject)
3825 {
3826 SCHECK_PARTIAL();
3827 RRETURN(MATCH_NOMATCH);
3828 }
3829 if (fc == *eptr++) RRETURN(MATCH_NOMATCH);
3830 }
3831 }
3832 /* Control never gets here */
3833 }
3834
3835 /* Maximize case */
3836
3837 else
3838 {
3839 pp = eptr;
3840
3841 #ifdef SUPPORT_UTF
3842 if (utf)
3843 {
3844 register unsigned int d;
3845 for (i = min; i < max; i++)
3846 {
3847 int len = 1;
3848 if (eptr >= md->end_subject)
3849 {
3850 SCHECK_PARTIAL();
3851 break;
3852 }
3853 GETCHARLEN(d, eptr, len);
3854 if (fc == d) break;
3855 eptr += len;
3856 }
3857 if (possessive) continue;
3858 for(;;)
3859 {
3860 RMATCH(eptr, ecode, offset_top, md, eptrb, RM34);
3861 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3862 if (eptr-- == pp) break; /* Stop if tried at original pos */
3863 BACKCHAR(eptr);
3864 }
3865 }
3866 else
3867 #endif
3868 /* Not UTF mode */
3869 {
3870 for (i = min; i < max; i++)
3871 {
3872 if (eptr >= md->end_subject)
3873 {
3874 SCHECK_PARTIAL();
3875 break;
3876 }
3877 if (fc == *eptr) break;
3878 eptr++;
3879 }
3880 if (possessive) continue;
3881 while (eptr >= pp)
3882 {
3883 RMATCH(eptr, ecode, offset_top, md, eptrb, RM35);
3884 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
3885 eptr--;
3886 }
3887 }
3888
3889 RRETURN(MATCH_NOMATCH);
3890 }
3891 }
3892 /* Control never gets here */
3893
3894 /* Match a single character type repeatedly; several different opcodes
3895 share code. This is very similar to the code for single characters, but we
3896 repeat it in the interests of efficiency. */
3897
3898 case OP_TYPEEXACT:
3899 min = max = GET2(ecode, 1);
3900 minimize = TRUE;
3901 ecode += 1 + IMM2_SIZE;
3902 goto REPEATTYPE;
3903
3904 case OP_TYPEUPTO:
3905 case OP_TYPEMINUPTO:
3906 min = 0;
3907 max = GET2(ecode, 1);
3908 minimize = *ecode == OP_TYPEMINUPTO;
3909 ecode += 1 + IMM2_SIZE;
3910 goto REPEATTYPE;
3911
3912 case OP_TYPEPOSSTAR:
3913 possessive = TRUE;
3914 min = 0;
3915 max = INT_MAX;
3916 ecode++;
3917 goto REPEATTYPE;
3918
3919 case OP_TYPEPOSPLUS:
3920 possessive = TRUE;
3921 min = 1;
3922 max = INT_MAX;
3923 ecode++;
3924 goto REPEATTYPE;
3925
3926 case OP_TYPEPOSQUERY:
3927 possessive = TRUE;
3928 min = 0;
3929 max = 1;
3930 ecode++;
3931 goto REPEATTYPE;
3932
3933 case OP_TYPEPOSUPTO:
3934 possessive = TRUE;
3935 min = 0;
3936 max = GET2(ecode, 1);
3937 ecode += 1 + IMM2_SIZE;
3938 goto REPEATTYPE;
3939
3940 case OP_TYPESTAR:
3941 case OP_TYPEMINSTAR:
3942 case OP_TYPEPLUS:
3943 case OP_TYPEMINPLUS:
3944 case OP_TYPEQUERY:
3945 case OP_TYPEMINQUERY:
3946 c = *ecode++ - OP_TYPESTAR;
3947 minimize = (c & 1) != 0;
3948 min = rep_min[c]; /* Pick up values from tables; */
3949 max = rep_max[c]; /* zero for max => infinity */
3950 if (max == 0) max = INT_MAX;
3951
3952 /* Common code for all repeated single character type matches. Note that
3953 in UTF-8 mode, '.' matches a character of any length, but for the other
3954 character types, the valid characters are all one-byte long. */
3955
3956 REPEATTYPE:
3957 ctype = *ecode++; /* Code for the character type */
3958
3959 #ifdef SUPPORT_UCP
3960 if (ctype == OP_PROP || ctype == OP_NOTPROP)
3961 {
3962 prop_fail_result = ctype == OP_NOTPROP;
3963 prop_type = *ecode++;
3964 prop_value = *ecode++;
3965 }
3966 else prop_type = -1;
3967 #endif
3968
3969 /* First, ensure the minimum number of matches are present. Use inline
3970 code for maximizing the speed, and do the type test once at the start
3971 (i.e. keep it out of the loop). Separate the UTF-8 code completely as that
3972 is tidier. Also separate the UCP code, which can be the same for both UTF-8
3973 and single-bytes. */
3974
3975 if (min > 0)
3976 {
3977 #ifdef SUPPORT_UCP
3978 if (prop_type >= 0)
3979 {
3980 switch(prop_type)
3981 {
3982 case PT_ANY:
3983 if (prop_fail_result) RRETURN(MATCH_NOMATCH);
3984 for (i = 1; i <= min; i++)
3985 {
3986 if (eptr >= md->end_subject)
3987 {
3988 SCHECK_PARTIAL();
3989 RRETURN(MATCH_NOMATCH);
3990 }
3991 GETCHARINCTEST(c, eptr);
3992 }
3993 break;
3994
3995 case PT_LAMP:
3996 for (i = 1; i <= min; i++)
3997 {
3998 int chartype;
3999 if (eptr >= md->end_subject)
4000 {
4001 SCHECK_PARTIAL();
4002 RRETURN(MATCH_NOMATCH);
4003 }
4004 GETCHARINCTEST(c, eptr);
4005 chartype = UCD_CHARTYPE(c);
4006 if ((chartype == ucp_Lu ||
4007 chartype == ucp_Ll ||
4008 chartype == ucp_Lt) == prop_fail_result)
4009 RRETURN(MATCH_NOMATCH);
4010 }
4011 break;
4012
4013 case PT_GC:
4014 for (i = 1; i <= min; i++)
4015 {
4016 if (eptr >= md->end_subject)
4017 {
4018 SCHECK_PARTIAL();
4019 RRETURN(MATCH_NOMATCH);
4020 }
4021 GETCHARINCTEST(c, eptr);
4022 if ((UCD_CATEGORY(c) == prop_value) == prop_fail_result)
4023 RRETURN(MATCH_NOMATCH);
4024 }
4025 break;
4026
4027 case PT_PC:
4028 for (i = 1; i <= min; i++)
4029 {
4030 if (eptr >= md->end_subject)
4031 {
4032 SCHECK_PARTIAL();
4033 RRETURN(MATCH_NOMATCH);
4034 }
4035 GETCHARINCTEST(c, eptr);
4036 if ((UCD_CHARTYPE(c) == prop_value) == prop_fail_result)
4037 RRETURN(MATCH_NOMATCH);
4038 }
4039 break;
4040
4041 case PT_SC:
4042 for (i = 1; i <= min; i++)
4043 {
4044 if (eptr >= md->end_subject)
4045 {
4046 SCHECK_PARTIAL();
4047 RRETURN(MATCH_NOMATCH);
4048 }
4049 GETCHARINCTEST(c, eptr);
4050 if ((UCD_SCRIPT(c) == prop_value) == prop_fail_result)
4051 RRETURN(MATCH_NOMATCH);
4052 }
4053 break;
4054
4055 case PT_ALNUM:
4056 for (i = 1; i <= min; i++)
4057 {
4058 int category;
4059 if (eptr >= md->end_subject)
4060 {
4061 SCHECK_PARTIAL();
4062 RRETURN(MATCH_NOMATCH);
4063 }
4064 GETCHARINCTEST(c, eptr);
4065 category = UCD_CATEGORY(c);
4066 if ((category == ucp_L || category == ucp_N) == prop_fail_result)
4067 RRETURN(MATCH_NOMATCH);
4068 }
4069 break;
4070
4071 case PT_SPACE: /* Perl space */
4072 for (i = 1; i <= min; i++)
4073 {
4074 if (eptr >= md->end_subject)
4075 {
4076 SCHECK_PARTIAL();
4077 RRETURN(MATCH_NOMATCH);
4078 }
4079 GETCHARINCTEST(c, eptr);
4080 if ((UCD_CATEGORY(c) == ucp_Z || c == CHAR_HT || c == CHAR_NL ||
4081 c == CHAR_FF || c == CHAR_CR)
4082 == prop_fail_result)
4083 RRETURN(MATCH_NOMATCH);
4084 }
4085 break;
4086
4087 case PT_PXSPACE: /* POSIX space */
4088 for (i = 1; i <= min; i++)
4089 {
4090 if (eptr >= md->end_subject)
4091 {
4092 SCHECK_PARTIAL();
4093 RRETURN(MATCH_NOMATCH);
4094 }
4095 GETCHARINCTEST(c, eptr);
4096 if ((UCD_CATEGORY(c) == ucp_Z || c == CHAR_HT || c == CHAR_NL ||
4097 c == CHAR_VT || c == CHAR_FF || c == CHAR_CR)
4098 == prop_fail_result)
4099 RRETURN(MATCH_NOMATCH);
4100 }
4101 break;
4102
4103 case PT_WORD:
4104 for (i = 1; i <= min; i++)
4105 {
4106 int category;
4107 if (eptr >= md->end_subject)
4108 {
4109 SCHECK_PARTIAL();
4110 RRETURN(MATCH_NOMATCH);
4111 }
4112 GETCHARINCTEST(c, eptr);
4113 category = UCD_CATEGORY(c);
4114 if ((category == ucp_L || category == ucp_N || c == CHAR_UNDERSCORE)
4115 == prop_fail_result)
4116 RRETURN(MATCH_NOMATCH);
4117 }
4118 break;
4119
4120 /* This should not occur */
4121
4122 default:
4123 RRETURN(PCRE_ERROR_INTERNAL);
4124 }
4125 }
4126
4127 /* Match extended Unicode sequences. We will get here only if the
4128 support is in the binary; otherwise a compile-time error occurs. */
4129
4130 else if (ctype == OP_EXTUNI)
4131 {
4132 for (i = 1; i <= min; i++)
4133 {
4134 if (eptr >= md->end_subject)
4135 {
4136 SCHECK_PARTIAL();
4137 RRETURN(MATCH_NOMATCH);
4138 }
4139 GETCHARINCTEST(c, eptr);
4140 if (UCD_CATEGORY(c) == ucp_M) RRETURN(MATCH_NOMATCH);
4141 while (eptr < md->end_subject)
4142 {
4143 int len = 1;
4144 if (!utf) c = *eptr; else { GETCHARLEN(c, eptr, len); }
4145 if (UCD_CATEGORY(c) != ucp_M) break;
4146 eptr += len;
4147 }
4148 }
4149 }
4150
4151 else
4152 #endif /* SUPPORT_UCP */
4153
4154 /* Handle all other cases when the coding is UTF-8 */
4155
4156 #ifdef SUPPORT_UTF
4157 if (utf) switch(ctype)
4158 {
4159 case OP_ANY:
4160 for (i = 1; i <= min; i++)
4161 {
4162 if (eptr >= md->end_subject)
4163 {
4164 SCHECK_PARTIAL();
4165 RRETURN(MATCH_NOMATCH);
4166 }
4167 if (IS_NEWLINE(eptr)) RRETURN(MATCH_NOMATCH);
4168 eptr++;
4169 ACROSSCHAR(eptr < md->end_subject, *eptr, eptr++);
4170 }
4171 break;
4172
4173 case OP_ALLANY:
4174 for (i = 1; i <= min; i++)
4175 {
4176 if (eptr >= md->end_subject)
4177 {
4178 SCHECK_PARTIAL();
4179 RRETURN(MATCH_NOMATCH);
4180 }
4181 eptr++;
4182 ACROSSCHAR(eptr < md->end_subject, *eptr, eptr++);
4183 }
4184 break;
4185
4186 case OP_ANYBYTE:
4187 if (eptr > md->end_subject - min) RRETURN(MATCH_NOMATCH);
4188 eptr += min;
4189 break;
4190
4191 case OP_ANYNL:
4192 for (i = 1; i <= min; i++)
4193 {
4194 if (eptr >= md->end_subject)
4195 {
4196 SCHECK_PARTIAL();
4197 RRETURN(MATCH_NOMATCH);
4198 }
4199 GETCHARINC(c, eptr);
4200 switch(c)
4201 {
4202 default: RRETURN(MATCH_NOMATCH);
4203
4204 case 0x000d:
4205 if (eptr < md->end_subject && *eptr == 0x0a) eptr++;
4206 break;
4207
4208 case 0x000a:
4209 break;
4210
4211 case 0x000b:
4212 case 0x000c:
4213 case 0x0085:
4214 case 0x2028:
4215 case 0x2029:
4216 if (md->bsr_anycrlf) RRETURN(MATCH_NOMATCH);
4217 break;
4218 }
4219 }
4220 break;
4221
4222 case OP_NOT_HSPACE:
4223 for (i = 1; i <= min; i++)
4224 {
4225 if (eptr >= md->end_subject)
4226 {
4227 SCHECK_PARTIAL();
4228 RRETURN(MATCH_NOMATCH);
4229 }
4230 GETCHARINC(c, eptr);
4231 switch(c)
4232 {
4233 default: break;
4234 case 0x09: /* HT */
4235 case 0x20: /* SPACE */
4236 case 0xa0: /* NBSP */
4237 case 0x1680: /* OGHAM SPACE MARK */
4238 case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
4239 case 0x2000: /* EN QUAD */
4240 case 0x2001: /* EM QUAD */
4241 case 0x2002: /* EN SPACE */
4242 case 0x2003: /* EM SPACE */
4243 case 0x2004: /* THREE-PER-EM SPACE */
4244 case 0x2005: /* FOUR-PER-EM SPACE */
4245 case 0x2006: /* SIX-PER-EM SPACE */
4246 case 0x2007: /* FIGURE SPACE */
4247 case 0x2008: /* PUNCTUATION SPACE */
4248 case 0x2009: /* THIN SPACE */
4249 case 0x200A: /* HAIR SPACE */
4250 case 0x202f: /* NARROW NO-BREAK SPACE */
4251 case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
4252 case 0x3000: /* IDEOGRAPHIC SPACE */
4253 RRETURN(MATCH_NOMATCH);
4254 }
4255 }
4256 break;
4257
4258 case OP_HSPACE:
4259 for (i = 1; i <= min; i++)
4260 {
4261 if (eptr >= md->end_subject)
4262 {
4263 SCHECK_PARTIAL();
4264 RRETURN(MATCH_NOMATCH);
4265 }
4266 GETCHARINC(c, eptr);
4267 switch(c)
4268 {
4269 default: RRETURN(MATCH_NOMATCH);
4270 case 0x09: /* HT */
4271 case 0x20: /* SPACE */
4272 case 0xa0: /* NBSP */
4273 case 0x1680: /* OGHAM SPACE MARK */
4274 case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
4275 case 0x2000: /* EN QUAD */
4276 case 0x2001: /* EM QUAD */
4277 case 0x2002: /* EN SPACE */
4278 case 0x2003: /* EM SPACE */
4279 case 0x2004: /* THREE-PER-EM SPACE */
4280 case 0x2005: /* FOUR-PER-EM SPACE */
4281 case 0x2006: /* SIX-PER-EM SPACE */
4282 case 0x2007: /* FIGURE SPACE */
4283 case 0x2008: /* PUNCTUATION SPACE */
4284 case 0x2009: /* THIN SPACE */
4285 case 0x200A: /* HAIR SPACE */
4286 case 0x202f: /* NARROW NO-BREAK SPACE */
4287 case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
4288 case 0x3000: /* IDEOGRAPHIC SPACE */
4289 break;
4290 }
4291 }
4292 break;
4293
4294 case OP_NOT_VSPACE:
4295 for (i = 1; i <= min; i++)
4296 {
4297 if (eptr >= md->end_subject)
4298 {
4299 SCHECK_PARTIAL();
4300 RRETURN(MATCH_NOMATCH);
4301 }
4302 GETCHARINC(c, eptr);
4303 switch(c)
4304 {
4305 default: break;
4306 case 0x0a: /* LF */
4307 case 0x0b: /* VT */
4308 case 0x0c: /* FF */
4309 case 0x0d: /* CR */
4310 case 0x85: /* NEL */
4311 case 0x2028: /* LINE SEPARATOR */
4312 case 0x2029: /* PARAGRAPH SEPARATOR */
4313 RRETURN(MATCH_NOMATCH);
4314 }
4315 }
4316 break;
4317
4318 case OP_VSPACE:
4319 for (i = 1; i <= min; i++)
4320 {
4321 if (eptr >= md->end_subject)
4322 {
4323 SCHECK_PARTIAL();
4324 RRETURN(MATCH_NOMATCH);
4325 }
4326 GETCHARINC(c, eptr);
4327 switch(c)
4328 {
4329 default: RRETURN(MATCH_NOMATCH);
4330 case 0x0a: /* LF */
4331 case 0x0b: /* VT */
4332 case 0x0c: /* FF */
4333 case 0x0d: /* CR */
4334 case 0x85: /* NEL */
4335 case 0x2028: /* LINE SEPARATOR */
4336 case 0x2029: /* PARAGRAPH SEPARATOR */
4337 break;
4338 }
4339 }
4340 break;
4341
4342 case OP_NOT_DIGIT:
4343 for (i = 1; i <= min; i++)
4344 {
4345 if (eptr >= md->end_subject)
4346 {
4347 SCHECK_PARTIAL();
4348 RRETURN(MATCH_NOMATCH);
4349 }
4350 GETCHARINC(c, eptr);
4351 if (c < 128 && (md->ctypes[c] & ctype_digit) != 0)
4352 RRETURN(MATCH_NOMATCH);
4353 }
4354 break;
4355
4356 case OP_DIGIT:
4357 for (i = 1; i <= min; i++)
4358 {
4359 if (eptr >= md->end_subject)
4360 {
4361 SCHECK_PARTIAL();
4362 RRETURN(MATCH_NOMATCH);
4363 }
4364 if (*eptr >= 128 || (md->ctypes[*eptr] & ctype_digit) == 0)
4365 RRETURN(MATCH_NOMATCH);
4366 eptr++;
4367 /* No need to skip more bytes - we know it's a 1-byte character */
4368 }
4369 break;
4370
4371 case OP_NOT_WHITESPACE:
4372 for (i = 1; i <= min; i++)
4373 {
4374 if (eptr >= md->end_subject)
4375 {
4376 SCHECK_PARTIAL();
4377 RRETURN(MATCH_NOMATCH);
4378 }
4379 if (*eptr < 128 && (md->ctypes[*eptr] & ctype_space) != 0)
4380 RRETURN(MATCH_NOMATCH);
4381 eptr++;
4382 ACROSSCHAR(eptr < md->end_subject, *eptr, eptr++);
4383 }
4384 break;
4385
4386 case OP_WHITESPACE:
4387 for (i = 1; i <= min; i++)
4388 {
4389 if (eptr >= md->end_subject)
4390 {
4391 SCHECK_PARTIAL();
4392 RRETURN(MATCH_NOMATCH);
4393 }
4394 if (*eptr >= 128 || (md->ctypes[*eptr] & ctype_space) == 0)
4395 RRETURN(MATCH_NOMATCH);
4396 eptr++;
4397 /* No need to skip more bytes - we know it's a 1-byte character */
4398 }
4399 break;
4400
4401 case OP_NOT_WORDCHAR:
4402 for (i = 1; i <= min; i++)
4403 {
4404 if (eptr >= md->end_subject)
4405 {
4406 SCHECK_PARTIAL();
4407 RRETURN(MATCH_NOMATCH);
4408 }
4409 if (*eptr < 128 && (md->ctypes[*eptr] & ctype_word) != 0)
4410 RRETURN(MATCH_NOMATCH);
4411 eptr++;
4412 ACROSSCHAR(eptr < md->end_subject, *eptr, eptr++);
4413 }
4414 break;
4415
4416 case OP_WORDCHAR:
4417 for (i = 1; i <= min; i++)
4418 {
4419 if (eptr >= md->end_subject)
4420 {
4421 SCHECK_PARTIAL();
4422 RRETURN(MATCH_NOMATCH);
4423 }
4424 if (*eptr >= 128 || (md->ctypes[*eptr] & ctype_word) == 0)
4425 RRETURN(MATCH_NOMATCH);
4426 eptr++;
4427 /* No need to skip more bytes - we know it's a 1-byte character */
4428 }
4429 break;
4430
4431 default:
4432 RRETURN(PCRE_ERROR_INTERNAL);
4433 } /* End switch(ctype) */
4434
4435 else
4436 #endif /* SUPPORT_UTF */
4437
4438 /* Code for the non-UTF-8 case for minimum matching of operators other
4439 than OP_PROP and OP_NOTPROP. */
4440
4441 switch(ctype)
4442 {
4443 case OP_ANY:
4444 for (i = 1; i <= min; i++)
4445 {
4446 if (eptr >= md->end_subject)
4447 {
4448 SCHECK_PARTIAL();
4449 RRETURN(MATCH_NOMATCH);
4450 }
4451 if (IS_NEWLINE(eptr)) RRETURN(MATCH_NOMATCH);
4452 eptr++;
4453 }
4454 break;
4455
4456 case OP_ALLANY:
4457 if (eptr > md->end_subject - min)
4458 {
4459 SCHECK_PARTIAL();
4460 RRETURN(MATCH_NOMATCH);
4461 }
4462 eptr += min;
4463 break;
4464
4465 case OP_ANYBYTE:
4466 if (eptr > md->end_subject - min)
4467 {
4468 SCHECK_PARTIAL();
4469 RRETURN(MATCH_NOMATCH);
4470 }
4471 eptr += min;
4472 break;
4473
4474 case OP_ANYNL:
4475 for (i = 1; i <= min; i++)
4476 {
4477 if (eptr >= md->end_subject)
4478 {
4479 SCHECK_PARTIAL();
4480 RRETURN(MATCH_NOMATCH);
4481 }
4482 switch(*eptr++)
4483 {
4484 default: RRETURN(MATCH_NOMATCH);
4485
4486 case 0x000d:
4487 if (eptr < md->end_subject && *eptr == 0x0a) eptr++;
4488 break;
4489
4490 case 0x000a:
4491 break;
4492
4493 case 0x000b:
4494 case 0x000c:
4495 case 0x0085:
4496 #ifdef COMPILE_PCRE16
4497 case 0x2028:
4498 case 0x2029:
4499 #endif
4500 if (md->bsr_anycrlf) RRETURN(MATCH_NOMATCH);
4501 break;
4502 }
4503 }
4504 break;
4505
4506 case OP_NOT_HSPACE:
4507 for (i = 1; i <= min; i++)
4508 {
4509 if (eptr >= md->end_subject)
4510 {
4511 SCHECK_PARTIAL();
4512 RRETURN(MATCH_NOMATCH);
4513 }
4514 switch(*eptr++)
4515 {
4516 default: break;
4517 case 0x09: /* HT */
4518 case 0x20: /* SPACE */
4519 case 0xa0: /* NBSP */
4520 #ifdef COMPILE_PCRE16
4521 case 0x1680: /* OGHAM SPACE MARK */
4522 case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
4523 case 0x2000: /* EN QUAD */
4524 case 0x2001: /* EM QUAD */
4525 case 0x2002: /* EN SPACE */
4526 case 0x2003: /* EM SPACE */
4527 case 0x2004: /* THREE-PER-EM SPACE */
4528 case 0x2005: /* FOUR-PER-EM SPACE */
4529 case 0x2006: /* SIX-PER-EM SPACE */
4530 case 0x2007: /* FIGURE SPACE */
4531 case 0x2008: /* PUNCTUATION SPACE */
4532 case 0x2009: /* THIN SPACE */
4533 case 0x200A: /* HAIR SPACE */
4534 case 0x202f: /* NARROW NO-BREAK SPACE */
4535 case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
4536 case 0x3000: /* IDEOGRAPHIC SPACE */
4537 #endif
4538 RRETURN(MATCH_NOMATCH);
4539 }
4540 }
4541 break;
4542
4543 case OP_HSPACE:
4544 for (i = 1; i <= min; i++)
4545 {
4546 if (eptr >= md->end_subject)
4547 {
4548 SCHECK_PARTIAL();
4549 RRETURN(MATCH_NOMATCH);
4550 }
4551 switch(*eptr++)
4552 {
4553 default: RRETURN(MATCH_NOMATCH);
4554 case 0x09: /* HT */
4555 case 0x20: /* SPACE */
4556 case 0xa0: /* NBSP */
4557 #ifdef COMPILE_PCRE16
4558 case 0x1680: /* OGHAM SPACE MARK */
4559 case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
4560 case 0x2000: /* EN QUAD */
4561 case 0x2001: /* EM QUAD */
4562 case 0x2002: /* EN SPACE */
4563 case 0x2003: /* EM SPACE */
4564 case 0x2004: /* THREE-PER-EM SPACE */
4565 case 0x2005: /* FOUR-PER-EM SPACE */
4566 case 0x2006: /* SIX-PER-EM SPACE */
4567 case 0x2007: /* FIGURE SPACE */
4568 case 0x2008: /* PUNCTUATION SPACE */
4569 case 0x2009: /* THIN SPACE */
4570 case 0x200A: /* HAIR SPACE */
4571 case 0x202f: /* NARROW NO-BREAK SPACE */
4572 case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
4573 case 0x3000: /* IDEOGRAPHIC SPACE */
4574 #endif
4575 break;
4576 }
4577 }
4578 break;
4579
4580 case OP_NOT_VSPACE:
4581 for (i = 1; i <= min; i++)
4582 {
4583 if (eptr >= md->end_subject)
4584 {
4585 SCHECK_PARTIAL();
4586 RRETURN(MATCH_NOMATCH);
4587 }
4588 switch(*eptr++)
4589 {
4590 default: break;
4591 case 0x0a: /* LF */
4592 case 0x0b: /* VT */
4593 case 0x0c: /* FF */
4594 case 0x0d: /* CR */
4595 case 0x85: /* NEL */
4596 #ifdef COMPILE_PCRE16
4597 case 0x2028: /* LINE SEPARATOR */
4598 case 0x2029: /* PARAGRAPH SEPARATOR */
4599 #endif
4600 RRETURN(MATCH_NOMATCH);
4601 }
4602 }
4603 break;
4604
4605 case OP_VSPACE:
4606 for (i = 1; i <= min; i++)
4607 {
4608 if (eptr >= md->end_subject)
4609 {
4610 SCHECK_PARTIAL();
4611 RRETURN(MATCH_NOMATCH);
4612 }
4613 switch(*eptr++)
4614 {
4615 default: RRETURN(MATCH_NOMATCH);
4616 case 0x0a: /* LF */
4617 case 0x0b: /* VT */
4618 case 0x0c: /* FF */
4619 case 0x0d: /* CR */
4620 case 0x85: /* NEL */
4621 #ifdef COMPILE_PCRE16
4622 case 0x2028: /* LINE SEPARATOR */
4623 case 0x2029: /* PARAGRAPH SEPARATOR */
4624 #endif
4625 break;
4626 }
4627 }
4628 break;
4629
4630 case OP_NOT_DIGIT:
4631 for (i = 1; i <= min; i++)
4632 {
4633 if (eptr >= md->end_subject)
4634 {
4635 SCHECK_PARTIAL();
4636 RRETURN(MATCH_NOMATCH);
4637 }
4638 if (MAX_255(*eptr) && (md->ctypes[*eptr] & ctype_digit) != 0)
4639 RRETURN(MATCH_NOMATCH);
4640 eptr++;
4641 }
4642 break;
4643
4644 case OP_DIGIT:
4645 for (i = 1; i <= min; i++)
4646 {
4647 if (eptr >= md->end_subject)
4648 {
4649 SCHECK_PARTIAL();
4650 RRETURN(MATCH_NOMATCH);
4651 }
4652 if (!MAX_255(*eptr) || (md->ctypes[*eptr] & ctype_digit) == 0)
4653 RRETURN(MATCH_NOMATCH);
4654 eptr++;
4655 }
4656 break;
4657
4658 case OP_NOT_WHITESPACE:
4659 for (i = 1; i <= min; i++)
4660 {
4661 if (eptr >= md->end_subject)
4662 {
4663 SCHECK_PARTIAL();
4664 RRETURN(MATCH_NOMATCH);
4665 }
4666 if (MAX_255(*eptr) && (md->ctypes[*eptr] & ctype_space) != 0)
4667 RRETURN(MATCH_NOMATCH);
4668 eptr++;
4669 }
4670 break;
4671
4672 case OP_WHITESPACE:
4673 for (i = 1; i <= min; i++)
4674 {
4675 if (eptr >= md->end_subject)
4676 {
4677 SCHECK_PARTIAL();
4678 RRETURN(MATCH_NOMATCH);
4679 }
4680 if (!MAX_255(*eptr) || (md->ctypes[*eptr] & ctype_space) == 0)
4681 RRETURN(MATCH_NOMATCH);
4682 eptr++;
4683 }
4684 break;
4685
4686 case OP_NOT_WORDCHAR:
4687 for (i = 1; i <= min; i++)
4688 {
4689 if (eptr >= md->end_subject)
4690 {
4691 SCHECK_PARTIAL();
4692 RRETURN(MATCH_NOMATCH);
4693 }
4694 if (MAX_255(*eptr) && (md->ctypes[*eptr] & ctype_word) != 0)
4695 RRETURN(MATCH_NOMATCH);
4696 eptr++;
4697 }
4698 break;
4699
4700 case OP_WORDCHAR:
4701 for (i = 1; i <= min; i++)
4702 {
4703 if (eptr >= md->end_subject)
4704 {
4705 SCHECK_PARTIAL();
4706 RRETURN(MATCH_NOMATCH);
4707 }
4708 if (!MAX_255(*eptr) || (md->ctypes[*eptr] & ctype_word) == 0)
4709 RRETURN(MATCH_NOMATCH);
4710 eptr++;
4711 }
4712 break;
4713
4714 default:
4715 RRETURN(PCRE_ERROR_INTERNAL);
4716 }
4717 }
4718
4719 /* If min = max, continue at the same level without recursing */
4720
4721 if (min == max) continue;
4722
4723 /* If minimizing, we have to test the rest of the pattern before each
4724 subsequent match. Again, separate the UTF-8 case for speed, and also
4725 separate the UCP cases. */
4726
4727 if (minimize)
4728 {
4729 #ifdef SUPPORT_UCP
4730 if (prop_type >= 0)
4731 {
4732 switch(prop_type)
4733 {
4734 case PT_ANY:
4735 for (fi = min;; fi++)
4736 {
4737 RMATCH(eptr, ecode, offset_top, md, eptrb, RM36);
4738 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
4739 if (fi >= max) RRETURN(MATCH_NOMATCH);
4740 if (eptr >= md->end_subject)
4741 {
4742 SCHECK_PARTIAL();
4743 RRETURN(MATCH_NOMATCH);
4744 }
4745 GETCHARINCTEST(c, eptr);
4746 if (prop_fail_result) RRETURN(MATCH_NOMATCH);
4747 }
4748 /* Control never gets here */
4749
4750 case PT_LAMP:
4751 for (fi = min;; fi++)
4752 {
4753 int chartype;
4754 RMATCH(eptr, ecode, offset_top, md, eptrb, RM37);
4755 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
4756 if (fi >= max) RRETURN(MATCH_NOMATCH);
4757 if (eptr >= md->end_subject)
4758 {
4759 SCHECK_PARTIAL();
4760 RRETURN(MATCH_NOMATCH);
4761 }
4762 GETCHARINCTEST(c, eptr);
4763 chartype = UCD_CHARTYPE(c);
4764 if ((chartype == ucp_Lu ||
4765 chartype == ucp_Ll ||
4766 chartype == ucp_Lt) == prop_fail_result)
4767 RRETURN(MATCH_NOMATCH);
4768 }
4769 /* Control never gets here */
4770
4771 case PT_GC:
4772 for (fi = min;; fi++)
4773 {
4774 RMATCH(eptr, ecode, offset_top, md, eptrb, RM38);
4775 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
4776 if (fi >= max) RRETURN(MATCH_NOMATCH);
4777 if (eptr >= md->end_subject)
4778 {
4779 SCHECK_PARTIAL();
4780 RRETURN(MATCH_NOMATCH);
4781 }
4782 GETCHARINCTEST(c, eptr);
4783 if ((UCD_CATEGORY(c) == prop_value) == prop_fail_result)
4784 RRETURN(MATCH_NOMATCH);
4785 }
4786 /* Control never gets here */
4787
4788 case PT_PC:
4789 for (fi = min;; fi++)
4790 {
4791 RMATCH(eptr, ecode, offset_top, md, eptrb, RM39);
4792 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
4793 if (fi >= max) RRETURN(MATCH_NOMATCH);
4794 if (eptr >= md->end_subject)
4795 {
4796 SCHECK_PARTIAL();
4797 RRETURN(MATCH_NOMATCH);
4798 }
4799 GETCHARINCTEST(c, eptr);
4800 if ((UCD_CHARTYPE(c) == prop_value) == prop_fail_result)
4801 RRETURN(MATCH_NOMATCH);
4802 }
4803 /* Control never gets here */
4804
4805 case PT_SC:
4806 for (fi = min;; fi++)
4807 {
4808 RMATCH(eptr, ecode, offset_top, md, eptrb, RM40);
4809 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
4810 if (fi >= max) RRETURN(MATCH_NOMATCH);
4811 if (eptr >= md->end_subject)
4812 {
4813 SCHECK_PARTIAL();
4814 RRETURN(MATCH_NOMATCH);
4815 }
4816 GETCHARINCTEST(c, eptr);
4817 if ((UCD_SCRIPT(c) == prop_value) == prop_fail_result)
4818 RRETURN(MATCH_NOMATCH);
4819 }
4820 /* Control never gets here */
4821
4822 case PT_ALNUM:
4823 for (fi = min;; fi++)
4824 {
4825 int category;
4826 RMATCH(eptr, ecode, offset_top, md, eptrb, RM59);
4827 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
4828 if (fi >= max) RRETURN(MATCH_NOMATCH);
4829 if (eptr >= md->end_subject)
4830 {
4831 SCHECK_PARTIAL();
4832 RRETURN(MATCH_NOMATCH);
4833 }
4834 GETCHARINCTEST(c, eptr);
4835 category = UCD_CATEGORY(c);
4836 if ((category == ucp_L || category == ucp_N) == prop_fail_result)
4837 RRETURN(MATCH_NOMATCH);
4838 }
4839 /* Control never gets here */
4840
4841 case PT_SPACE: /* Perl space */
4842 for (fi = min;; fi++)
4843 {
4844 RMATCH(eptr, ecode, offset_top, md, eptrb, RM60);
4845 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
4846 if (fi >= max) RRETURN(MATCH_NOMATCH);
4847 if (eptr >= md->end_subject)
4848 {
4849 SCHECK_PARTIAL();
4850 RRETURN(MATCH_NOMATCH);
4851 }
4852 GETCHARINCTEST(c, eptr);
4853 if ((UCD_CATEGORY(c) == ucp_Z || c == CHAR_HT || c == CHAR_NL ||
4854 c == CHAR_FF || c == CHAR_CR)
4855 == prop_fail_result)
4856 RRETURN(MATCH_NOMATCH);
4857 }
4858 /* Control never gets here */
4859
4860 case PT_PXSPACE: /* POSIX space */
4861 for (fi = min;; fi++)
4862 {
4863 RMATCH(eptr, ecode, offset_top, md, eptrb, RM61);
4864 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
4865 if (fi >= max) RRETURN(MATCH_NOMATCH);
4866 if (eptr >= md->end_subject)
4867 {
4868 SCHECK_PARTIAL();
4869 RRETURN(MATCH_NOMATCH);
4870 }
4871 GETCHARINCTEST(c, eptr);
4872 if ((UCD_CATEGORY(c) == ucp_Z || c == CHAR_HT || c == CHAR_NL ||
4873 c == CHAR_VT || c == CHAR_FF || c == CHAR_CR)
4874 == prop_fail_result)
4875 RRETURN(MATCH_NOMATCH);
4876 }
4877 /* Control never gets here */
4878
4879 case PT_WORD:
4880 for (fi = min;; fi++)
4881 {
4882 int category;
4883 RMATCH(eptr, ecode, offset_top, md, eptrb, RM62);
4884 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
4885 if (fi >= max) RRETURN(MATCH_NOMATCH);
4886 if (eptr >= md->end_subject)
4887 {
4888 SCHECK_PARTIAL();
4889 RRETURN(MATCH_NOMATCH);
4890 }
4891 GETCHARINCTEST(c, eptr);
4892 category = UCD_CATEGORY(c);
4893 if ((category == ucp_L ||
4894 category == ucp_N ||
4895 c == CHAR_UNDERSCORE)
4896 == prop_fail_result)
4897 RRETURN(MATCH_NOMATCH);
4898 }
4899 /* Control never gets here */
4900
4901 /* This should never occur */
4902
4903 default:
4904 RRETURN(PCRE_ERROR_INTERNAL);
4905 }
4906 }
4907
4908 /* Match extended Unicode sequences. We will get here only if the
4909 support is in the binary; otherwise a compile-time error occurs. */
4910
4911 else if (ctype == OP_EXTUNI)
4912 {
4913 for (fi = min;; fi++)
4914 {
4915 RMATCH(eptr, ecode, offset_top, md, eptrb, RM41);
4916 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
4917 if (fi >= max) RRETURN(MATCH_NOMATCH);
4918 if (eptr >= md->end_subject)
4919 {
4920 SCHECK_PARTIAL();
4921 RRETURN(MATCH_NOMATCH);
4922 }
4923 GETCHARINCTEST(c, eptr);
4924 if (UCD_CATEGORY(c) == ucp_M) RRETURN(MATCH_NOMATCH);
4925 while (eptr < md->end_subject)
4926 {
4927 int len = 1;
4928 if (!utf) c = *eptr; else { GETCHARLEN(c, eptr, len); }
4929 if (UCD_CATEGORY(c) != ucp_M) break;
4930 eptr += len;
4931 }
4932 }
4933 }
4934 else
4935 #endif /* SUPPORT_UCP */
4936
4937 #ifdef SUPPORT_UTF
4938 if (utf)
4939 {
4940 for (fi = min;; fi++)
4941 {
4942 RMATCH(eptr, ecode, offset_top, md, eptrb, RM42);
4943 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
4944 if (fi >= max) RRETURN(MATCH_NOMATCH);
4945 if (eptr >= md->end_subject)
4946 {
4947 SCHECK_PARTIAL();
4948 RRETURN(MATCH_NOMATCH);
4949 }
4950 if (ctype == OP_ANY && IS_NEWLINE(eptr))
4951 RRETURN(MATCH_NOMATCH);
4952 GETCHARINC(c, eptr);
4953 switch(ctype)
4954 {
4955 case OP_ANY: /* This is the non-NL case */
4956 case OP_ALLANY:
4957 case OP_ANYBYTE:
4958 break;
4959
4960 case OP_ANYNL:
4961 switch(c)
4962 {
4963 default: RRETURN(MATCH_NOMATCH);
4964 case 0x000d:
4965 if (eptr < md->end_subject && *eptr == 0x0a) eptr++;
4966 break;
4967 case 0x000a:
4968 break;
4969
4970 case 0x000b:
4971 case 0x000c:
4972 case 0x0085:
4973 case 0x2028:
4974 case 0x2029:
4975 if (md->bsr_anycrlf) RRETURN(MATCH_NOMATCH);
4976 break;
4977 }
4978 break;
4979
4980 case OP_NOT_HSPACE:
4981 switch(c)
4982 {
4983 default: break;
4984 case 0x09: /* HT */
4985 case 0x20: /* SPACE */
4986 case 0xa0: /* NBSP */
4987 case 0x1680: /* OGHAM SPACE MARK */
4988 case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
4989 case 0x2000: /* EN QUAD */
4990 case 0x2001: /* EM QUAD */
4991 case 0x2002: /* EN SPACE */
4992 case 0x2003: /* EM SPACE */
4993 case 0x2004: /* THREE-PER-EM SPACE */
4994 case 0x2005: /* FOUR-PER-EM SPACE */
4995 case 0x2006: /* SIX-PER-EM SPACE */
4996 case 0x2007: /* FIGURE SPACE */
4997 case 0x2008: /* PUNCTUATION SPACE */
4998 case 0x2009: /* THIN SPACE */
4999 case 0x200A: /* HAIR SPACE */
5000 case 0x202f: /* NARROW NO-BREAK SPACE */
5001 case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
5002 case 0x3000: /* IDEOGRAPHIC SPACE */
5003 RRETURN(MATCH_NOMATCH);
5004 }
5005 break;
5006
5007 case OP_HSPACE:
5008 switch(c)
5009 {
5010 default: RRETURN(MATCH_NOMATCH);
5011 case 0x09: /* HT */
5012 case 0x20: /* SPACE */
5013 case 0xa0: /* NBSP */
5014 case 0x1680: /* OGHAM SPACE MARK */
5015 case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
5016 case 0x2000: /* EN QUAD */
5017 case 0x2001: /* EM QUAD */
5018 case 0x2002: /* EN SPACE */
5019 case 0x2003: /* EM SPACE */
5020 case 0x2004: /* THREE-PER-EM SPACE */
5021 case 0x2005: /* FOUR-PER-EM SPACE */
5022 case 0x2006: /* SIX-PER-EM SPACE */
5023 case 0x2007: /* FIGURE SPACE */
5024 case 0x2008: /* PUNCTUATION SPACE */
5025 case 0x2009: /* THIN SPACE */
5026 case 0x200A: /* HAIR SPACE */
5027 case 0x202f: /* NARROW NO-BREAK SPACE */
5028 case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
5029 case 0x3000: /* IDEOGRAPHIC SPACE */
5030 break;
5031 }
5032 break;
5033
5034 case OP_NOT_VSPACE:
5035 switch(c)
5036 {
5037 default: break;
5038 case 0x0a: /* LF */
5039 case 0x0b: /* VT */
5040 case 0x0c: /* FF */
5041 case 0x0d: /* CR */
5042 case 0x85: /* NEL */
5043 case 0x2028: /* LINE SEPARATOR */
5044 case 0x2029: /* PARAGRAPH SEPARATOR */
5045 RRETURN(MATCH_NOMATCH);
5046 }
5047 break;
5048
5049 case OP_VSPACE:
5050 switch(c)
5051 {
5052 default: RRETURN(MATCH_NOMATCH);
5053 case 0x0a: /* LF */
5054 case 0x0b: /* VT */
5055 case 0x0c: /* FF */
5056 case 0x0d: /* CR */
5057 case 0x85: /* NEL */
5058 case 0x2028: /* LINE SEPARATOR */
5059 case 0x2029: /* PARAGRAPH SEPARATOR */
5060 break;
5061 }
5062 break;
5063
5064 case OP_NOT_DIGIT:
5065 if (c < 256 && (md->ctypes[c] & ctype_digit) != 0)
5066 RRETURN(MATCH_NOMATCH);
5067 break;
5068
5069 case OP_DIGIT:
5070 if (c >= 256 || (md->ctypes[c] & ctype_digit) == 0)
5071 RRETURN(MATCH_NOMATCH);
5072 break;
5073
5074 case OP_NOT_WHITESPACE:
5075 if (c < 256 && (md->ctypes[c] & ctype_space) != 0)
5076 RRETURN(MATCH_NOMATCH);
5077 break;
5078
5079 case OP_WHITESPACE:
5080 if (c >= 256 || (md->ctypes[c] & ctype_space) == 0)
5081 RRETURN(MATCH_NOMATCH);
5082 break;
5083
5084 case OP_NOT_WORDCHAR:
5085 if (c < 256 && (md->ctypes[c] & ctype_word) != 0)
5086 RRETURN(MATCH_NOMATCH);
5087 break;
5088
5089 case OP_WORDCHAR:
5090 if (c >= 256 || (md->ctypes[c] & ctype_word) == 0)
5091 RRETURN(MATCH_NOMATCH);
5092 break;
5093
5094 default:
5095 RRETURN(PCRE_ERROR_INTERNAL);
5096 }
5097 }
5098 }
5099 else
5100 #endif
5101 /* Not UTF mode */
5102 {
5103 for (fi = min;; fi++)
5104 {
5105 RMATCH(eptr, ecode, offset_top, md, eptrb, RM43);
5106 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
5107 if (fi >= max) RRETURN(MATCH_NOMATCH);
5108 if (eptr >= md->end_subject)
5109 {
5110 SCHECK_PARTIAL();
5111 RRETURN(MATCH_NOMATCH);
5112 }
5113 if (ctype == OP_ANY && IS_NEWLINE(eptr))
5114 RRETURN(MATCH_NOMATCH);
5115 c = *eptr++;
5116 switch(ctype)
5117 {
5118 case OP_ANY: /* This is the non-NL case */
5119 case OP_ALLANY:
5120 case OP_ANYBYTE:
5121 break;
5122
5123 case OP_ANYNL:
5124 switch(c)
5125 {
5126 default: RRETURN(MATCH_NOMATCH);
5127 case 0x000d:
5128 if (eptr < md->end_subject && *eptr == 0x0a) eptr++;
5129 break;
5130
5131 case 0x000a:
5132 break;
5133
5134 case 0x000b:
5135 case 0x000c:
5136 case 0x0085:
5137 #ifdef COMPILE_PCRE16
5138 case 0x2028:
5139 case 0x2029:
5140 #endif
5141 if (md->bsr_anycrlf) RRETURN(MATCH_NOMATCH);
5142 break;
5143 }
5144 break;
5145
5146 case OP_NOT_HSPACE:
5147 switch(c)
5148 {
5149 default: break;
5150 case 0x09: /* HT */
5151 case 0x20: /* SPACE */
5152 case 0xa0: /* NBSP */
5153 #ifdef COMPILE_PCRE16
5154 case 0x1680: /* OGHAM SPACE MARK */
5155 case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
5156 case 0x2000: /* EN QUAD */
5157 case 0x2001: /* EM QUAD */
5158 case 0x2002: /* EN SPACE */
5159 case 0x2003: /* EM SPACE */
5160 case 0x2004: /* THREE-PER-EM SPACE */
5161 case 0x2005: /* FOUR-PER-EM SPACE */
5162 case 0x2006: /* SIX-PER-EM SPACE */
5163 case 0x2007: /* FIGURE SPACE */
5164 case 0x2008: /* PUNCTUATION SPACE */
5165 case 0x2009: /* THIN SPACE */
5166 case 0x200A: /* HAIR SPACE */
5167 case 0x202f: /* NARROW NO-BREAK SPACE */
5168 case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
5169 case 0x3000: /* IDEOGRAPHIC SPACE */
5170 #endif
5171 RRETURN(MATCH_NOMATCH);
5172 }
5173 break;
5174
5175 case OP_HSPACE:
5176 switch(c)
5177 {
5178 default: RRETURN(MATCH_NOMATCH);
5179 case 0x09: /* HT */
5180 case 0x20: /* SPACE */
5181 case 0xa0: /* NBSP */
5182 #ifdef COMPILE_PCRE16
5183 case 0x1680: /* OGHAM SPACE MARK */
5184 case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
5185 case 0x2000: /* EN QUAD */
5186 case 0x2001: /* EM QUAD */
5187 case 0x2002: /* EN SPACE */
5188 case 0x2003: /* EM SPACE */
5189 case 0x2004: /* THREE-PER-EM SPACE */
5190 case 0x2005: /* FOUR-PER-EM SPACE */
5191 case 0x2006: /* SIX-PER-EM SPACE */
5192 case 0x2007: /* FIGURE SPACE */
5193 case 0x2008: /* PUNCTUATION SPACE */
5194 case 0x2009: /* THIN SPACE */
5195 case 0x200A: /* HAIR SPACE */
5196 case 0x202f: /* NARROW NO-BREAK SPACE */
5197 case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
5198 case 0x3000: /* IDEOGRAPHIC SPACE */
5199 #endif
5200 break;
5201 }
5202 break;
5203
5204 case OP_NOT_VSPACE:
5205 switch(c)
5206 {
5207 default: break;
5208 case 0x0a: /* LF */
5209 case 0x0b: /* VT */
5210 case 0x0c: /* FF */
5211 case 0x0d: /* CR */
5212 case 0x85: /* NEL */
5213 #ifdef COMPILE_PCRE16
5214 case 0x2028: /* LINE SEPARATOR */
5215 case 0x2029: /* PARAGRAPH SEPARATOR */
5216 #endif
5217 RRETURN(MATCH_NOMATCH);
5218 }
5219 break;
5220
5221 case OP_VSPACE:
5222 switch(c)
5223 {
5224 default: RRETURN(MATCH_NOMATCH);
5225 case 0x0a: /* LF */
5226 case 0x0b: /* VT */
5227 case 0x0c: /* FF */
5228 case 0x0d: /* CR */
5229 case 0x85: /* NEL */
5230 #ifdef COMPILE_PCRE16
5231 case 0x2028: /* LINE SEPARATOR */
5232 case 0x2029: /* PARAGRAPH SEPARATOR */
5233 #endif
5234 break;
5235 }
5236 break;
5237
5238 case OP_NOT_DIGIT:
5239 if (MAX_255(c) && (md->ctypes[c] & ctype_digit) != 0) RRETURN(MATCH_NOMATCH);
5240 break;
5241
5242 case OP_DIGIT:
5243 if (!MAX_255(c) || (md->ctypes[c] & ctype_digit) == 0) RRETURN(MATCH_NOMATCH);
5244 break;
5245
5246 case OP_NOT_WHITESPACE:
5247 if (MAX_255(c) && (md->ctypes[c] & ctype_space) != 0) RRETURN(MATCH_NOMATCH);
5248 break;
5249
5250 case OP_WHITESPACE:
5251 if (!MAX_255(c) || (md->ctypes[c] & ctype_space) == 0) RRETURN(MATCH_NOMATCH);
5252 break;
5253
5254 case OP_NOT_WORDCHAR:
5255 if (MAX_255(c) && (md->ctypes[c] & ctype_word) != 0) RRETURN(MATCH_NOMATCH);
5256 break;
5257
5258 case OP_WORDCHAR:
5259 if (!MAX_255(c) || (md->ctypes[c] & ctype_word) == 0) RRETURN(MATCH_NOMATCH);
5260 break;
5261
5262 default:
5263 RRETURN(PCRE_ERROR_INTERNAL);
5264 }
5265 }
5266 }
5267 /* Control never gets here */
5268 }
5269
5270 /* If maximizing, it is worth using inline code for speed, doing the type
5271 test once at the start (i.e. keep it out of the loop). Again, keep the
5272 UTF-8 and UCP stuff separate. */
5273
5274 else
5275 {
5276 pp = eptr; /* Remember where we started */
5277
5278 #ifdef SUPPORT_UCP
5279 if (prop_type >= 0)
5280 {
5281 switch(prop_type)
5282 {
5283 case PT_ANY:
5284 for (i = min; i < max; i++)
5285 {
5286 int len = 1;
5287 if (eptr >= md->end_subject)
5288 {
5289 SCHECK_PARTIAL();
5290 break;
5291 }
5292 GETCHARLENTEST(c, eptr, len);
5293 if (prop_fail_result) break;
5294 eptr+= len;
5295 }
5296 break;
5297
5298 case PT_LAMP:
5299 for (i = min; i < max; i++)
5300 {
5301 int chartype;
5302 int len = 1;
5303 if (eptr >= md->end_subject)
5304 {
5305 SCHECK_PARTIAL();
5306 break;
5307 }
5308 GETCHARLENTEST(c, eptr, len);
5309 chartype = UCD_CHARTYPE(c);
5310 if ((chartype == ucp_Lu ||
5311 chartype == ucp_Ll ||
5312 chartype == ucp_Lt) == prop_fail_result)
5313 break;
5314 eptr+= len;
5315 }
5316 break;
5317
5318 case PT_GC:
5319 for (i = min; i < max; i++)
5320 {
5321 int len = 1;
5322 if (eptr >= md->end_subject)
5323 {
5324 SCHECK_PARTIAL();
5325 break;
5326 }
5327 GETCHARLENTEST(c, eptr, len);
5328 if ((UCD_CATEGORY(c) == prop_value) == prop_fail_result) break;
5329 eptr+= len;
5330 }
5331 break;
5332
5333 case PT_PC:
5334 for (i = min; i < max; i++)
5335 {
5336 int len = 1;
5337 if (eptr >= md->end_subject)
5338 {
5339 SCHECK_PARTIAL();
5340 break;
5341 }
5342 GETCHARLENTEST(c, eptr, len);
5343 if ((UCD_CHARTYPE(c) == prop_value) == prop_fail_result) break;
5344 eptr+= len;
5345 }
5346 break;
5347
5348 case PT_SC:
5349 for (i = min; i < max; i++)
5350 {
5351 int len = 1;
5352 if (eptr >= md->end_subject)
5353 {
5354 SCHECK_PARTIAL();
5355 break;
5356 }
5357 GETCHARLENTEST(c, eptr, len);
5358 if ((UCD_SCRIPT(c) == prop_value) == prop_fail_result) break;
5359 eptr+= len;
5360 }
5361 break;
5362
5363 case PT_ALNUM:
5364 for (i = min; i < max; i++)
5365 {
5366 int category;
5367 int len = 1;
5368 if (eptr >= md->end_subject)
5369 {
5370 SCHECK_PARTIAL();
5371 break;
5372 }
5373 GETCHARLENTEST(c, eptr, len);
5374 category = UCD_CATEGORY(c);
5375 if ((category == ucp_L || category == ucp_N) == prop_fail_result)
5376 break;
5377 eptr+= len;
5378 }
5379 break;
5380
5381 case PT_SPACE: /* Perl space */
5382 for (i = min; i < max; i++)
5383 {
5384 int len = 1;
5385 if (eptr >= md->end_subject)
5386 {
5387 SCHECK_PARTIAL();
5388 break;
5389 }
5390 GETCHARLENTEST(c, eptr, len);
5391 if ((UCD_CATEGORY(c) == ucp_Z || c == CHAR_HT || c == CHAR_NL ||
5392 c == CHAR_FF || c == CHAR_CR)
5393 == prop_fail_result)
5394 break;
5395 eptr+= len;
5396 }
5397 break;
5398
5399 case PT_PXSPACE: /* POSIX space */
5400 for (i = min; i < max; i++)
5401 {
5402 int len = 1;
5403 if (eptr >= md->end_subject)
5404 {
5405 SCHECK_PARTIAL();
5406 break;
5407 }
5408 GETCHARLENTEST(c, eptr, len);
5409 if ((UCD_CATEGORY(c) == ucp_Z || c == CHAR_HT || c == CHAR_NL ||
5410 c == CHAR_VT || c == CHAR_FF || c == CHAR_CR)
5411 == prop_fail_result)
5412 break;
5413 eptr+= len;
5414 }
5415 break;
5416
5417 case PT_WORD:
5418 for (i = min; i < max; i++)
5419 {
5420 int category;
5421 int len = 1;
5422 if (eptr >= md->end_subject)
5423 {
5424 SCHECK_PARTIAL();
5425 break;
5426 }
5427 GETCHARLENTEST(c, eptr, len);
5428 category = UCD_CATEGORY(c);
5429 if ((category == ucp_L || category == ucp_N ||
5430 c == CHAR_UNDERSCORE) == prop_fail_result)
5431 break;
5432 eptr+= len;
5433 }
5434 break;
5435
5436 default:
5437 RRETURN(PCRE_ERROR_INTERNAL);
5438 }
5439
5440 /* eptr is now past the end of the maximum run */
5441
5442 if (possessive) continue;
5443 for(;;)
5444 {
5445 RMATCH(eptr, ecode, offset_top, md, eptrb, RM44);
5446 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
5447 if (eptr-- == pp) break; /* Stop if tried at original pos */
5448 if (utf) BACKCHAR(eptr);
5449 }
5450 }
5451
5452 /* Match extended Unicode sequences. We will get here only if the
5453 support is in the binary; otherwise a compile-time error occurs. */
5454
5455 else if (ctype == OP_EXTUNI)
5456 {
5457 for (i = min; i < max; i++)
5458 {
5459 int len = 1;
5460 if (eptr >= md->end_subject)
5461 {
5462 SCHECK_PARTIAL();
5463 break;
5464 }
5465 if (!utf) c = *eptr; else { GETCHARLEN(c, eptr, len); }
5466 if (UCD_CATEGORY(c) == ucp_M) break;
5467 eptr += len;
5468 while (eptr < md->end_subject)
5469 {
5470 len = 1;
5471 if (!utf) c = *eptr; else { GETCHARLEN(c, eptr, len); }
5472 if (UCD_CATEGORY(c) != ucp_M) break;
5473 eptr += len;
5474 }
5475 }
5476
5477 /* eptr is now past the end of the maximum run */
5478
5479 if (possessive) continue;
5480
5481 for(;;)
5482 {
5483 RMATCH(eptr, ecode, offset_top, md, eptrb, RM45);
5484 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
5485 if (eptr-- == pp) break; /* Stop if tried at original pos */
5486 for (;;) /* Move back over one extended */
5487 {
5488 if (!utf) c = *eptr; else
5489 {
5490 BACKCHAR(eptr);
5491 GETCHAR(c, eptr);
5492 }
5493 if (UCD_CATEGORY(c) != ucp_M) break;
5494 eptr--;
5495 }
5496 }
5497 }
5498
5499 else
5500 #endif /* SUPPORT_UCP */
5501
5502 #ifdef SUPPORT_UTF
5503 if (utf)
5504 {
5505 switch(ctype)
5506 {
5507 case OP_ANY:
5508 if (max < INT_MAX)
5509 {
5510 for (i = min; i < max; i++)
5511 {
5512 if (eptr >= md->end_subject)
5513 {
5514 SCHECK_PARTIAL();
5515 break;
5516 }
5517 if (IS_NEWLINE(eptr)) break;
5518 eptr++;
5519 ACROSSCHAR(eptr < md->end_subject, *eptr, eptr++);
5520 }
5521 }
5522
5523 /* Handle unlimited UTF-8 repeat */
5524
5525 else
5526 {
5527 for (i = min; i < max; i++)
5528 {
5529 if (eptr >= md->end_subject)
5530 {
5531 SCHECK_PARTIAL();
5532 break;
5533 }
5534 if (IS_NEWLINE(eptr)) break;
5535 eptr++;
5536 ACROSSCHAR(eptr < md->end_subject, *eptr, eptr++);
5537 }
5538 }
5539 break;
5540
5541 case OP_ALLANY:
5542 if (max < INT_MAX)
5543 {
5544 for (i = min; i < max; i++)
5545 {
5546 if (eptr >= md->end_subject)
5547 {
5548 SCHECK_PARTIAL();
5549 break;
5550 }
5551 eptr++;
5552 ACROSSCHAR(eptr < md->end_subject, *eptr, eptr++);
5553 }
5554 }
5555 else
5556 {
5557 eptr = md->end_subject; /* Unlimited UTF-8 repeat */
5558 SCHECK_PARTIAL();
5559 }
5560 break;
5561
5562 /* The byte case is the same as non-UTF8 */
5563
5564 case OP_ANYBYTE:
5565 c = max - min;
5566 if (c > (unsigned int)(md->end_subject - eptr))
5567 {
5568 eptr = md->end_subject;
5569 SCHECK_PARTIAL();
5570 }
5571 else eptr += c;
5572 break;
5573
5574 case OP_ANYNL:
5575 for (i = min; i < max; i++)
5576 {
5577 int len = 1;
5578 if (eptr >= md->end_subject)
5579 {
5580 SCHECK_PARTIAL();
5581 break;
5582 }
5583 GETCHARLEN(c, eptr, len);
5584 if (c == 0x000d)
5585 {
5586 if (++eptr >= md->end_subject) break;
5587 if (*eptr == 0x000a) eptr++;
5588 }
5589 else
5590 {
5591 if (c != 0x000a &&
5592 (md->bsr_anycrlf ||
5593 (c != 0x000b && c != 0x000c &&
5594 c != 0x0085 && c != 0x2028 && c != 0x2029)))
5595 break;
5596 eptr += len;
5597 }
5598 }
5599 break;
5600
5601 case OP_NOT_HSPACE:
5602 case OP_HSPACE:
5603 for (i = min; i < max; i++)
5604 {
5605 BOOL gotspace;
5606 int len = 1;
5607 if (eptr >= md->end_subject)
5608 {
5609 SCHECK_PARTIAL();
5610 break;
5611 }
5612 GETCHARLEN(c, eptr, len);
5613 switch(c)
5614 {
5615 default: gotspace = FALSE; break;
5616 case 0x09: /* HT */
5617 case 0x20: /* SPACE */
5618 case 0xa0: /* NBSP */
5619 case 0x1680: /* OGHAM SPACE MARK */
5620 case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */
5621 case 0x2000: /* EN QUAD */
5622 case 0x2001: /* EM QUAD */
5623 case 0x2002: /* EN SPACE */
5624 case 0x2003: /* EM SPACE */
5625 case 0x2004: /* THREE-PER-EM SPACE */
5626 case 0x2005: /* FOUR-PER-EM SPACE */
5627 case 0x2006: /* SIX-PER-EM SPACE */
5628 case 0x2007: /* FIGURE SPACE */
5629 case 0x2008: /* PUNCTUATION SPACE */
5630 case 0x2009: /* THIN SPACE */
5631 case 0x200A: /* HAIR SPACE */
5632 case 0x202f: /* NARROW NO-BREAK SPACE */
5633 case 0x205f: /* MEDIUM MATHEMATICAL SPACE */
5634 case 0x3000: /* IDEOGRAPHIC SPACE */
5635 gotspace = TRUE;
5636 break;
5637 }
5638 if (gotspace == (ctype == OP_NOT_HSPACE)) break;
5639 eptr += len;
5640 }
5641 break;
5642
5643 case OP_NOT_VSPACE:
5644 case OP_VSPACE:
5645 for (i = min; i < max; i++)
5646 {
5647 BOOL gotspace;
5648 int len = 1;
5649 if (eptr >= md->end_subject)
5650 {
5651 SCHECK_PARTIAL();
5652 break;
5653 }
5654 GETCHARLEN(c, eptr, len);
5655 switch(c)
5656 {
5657 default: gotspace = FALSE; break;
5658 case 0x0a: /* LF */
5659 case 0x0b: /* VT */
5660 case 0x0c: /* FF */
5661 case 0x0d: /* CR */
5662 case 0x85: /* NEL */
5663 case 0x2028: /* LINE SEPARATOR */
5664 case 0x2029: /* PARAGRAPH SEPARATOR */
5665 gotspace = TRUE;
5666 break;
5667 }
5668 if (gotspace == (ctype == OP_NOT_VSPACE)) break;
5669 eptr += len;
5670 }
5671 break;
5672
5673 case OP_NOT_DIGIT:
5674 for (i = min; i < max; i++)
5675 {
5676 int len = 1;
5677 if (eptr >= md->end_subject)
5678 {
5679 SCHECK_PARTIAL();
5680 break;
5681 }
5682 GETCHARLEN(c, eptr, len);
5683 if (c < 256 && (md->ctypes[c] & ctype_digit) != 0) break;
5684 eptr+= len;
5685 }
5686 break;
5687
5688 case OP_DIGIT:
5689 for (i = min; i < max; i++)
5690 {
5691 int len = 1;
5692 if (eptr >= md->end_subject)
5693 {
5694 SCHECK_PARTIAL();
5695 break;
5696 }
5697 GETCHARLEN(c, eptr, len);
5698 if (c >= 256 ||(md->ctypes[c] & ctype_digit) == 0) break;
5699 eptr+= len;
5700 }
5701 break;
5702
5703 case OP_NOT_WHITESPACE:
5704 for (i = min; i < max; i++)
5705 {
5706 int len = 1;
5707 if (eptr >= md->end_subject)
5708 {
5709 SCHECK_PARTIAL();
5710 break;
5711 }
5712 GETCHARLEN(c, eptr, len);
5713 if (c < 256 && (md->ctypes[c] & ctype_space) != 0) break;
5714 eptr+= len;
5715 }
5716 break;
5717
5718 case OP_WHITESPACE:
5719 for (i = min; i < max; i++)
5720 {
5721 int len = 1;
5722 if (eptr >= md->end_subject)
5723 {
5724 SCHECK_PARTIAL();
5725 break;
5726 }
5727 GETCHARLEN(c, eptr, len);
5728 if (c >= 256 ||(md->ctypes[c] & ctype_space) == 0) break;
5729 eptr+= len;
5730 }
5731 break;
5732
5733 case OP_NOT_WORDCHAR:
5734 for (i = min; i < max; i++)
5735 {
5736 int len = 1;
5737 if (eptr >= md->end_subject)
5738 {
5739 SCHECK_PARTIAL();
5740 break;
5741 }
5742 GETCHARLEN(c, eptr, len);
5743 if (c < 256 && (md->ctypes[c] & ctype_word) != 0) break;
5744 eptr+= len;
5745 }
5746 break;
5747
5748 case OP_WORDCHAR:
5749 for (i = min; i < max; i++)
5750 {
5751 int len = 1;
5752 if (eptr >= md->end_subject)
5753 {
5754 SCHECK_PARTIAL();
5755 break;
5756 }
5757 GETCHARLEN(c, eptr, len);
5758 if (c >= 256 || (md->ctypes[c] & ctype_word) == 0) break;
5759 eptr+= len;
5760 }
5761 break;
5762
5763 default:
5764 RRETURN(PCRE_ERROR_INTERNAL);
5765 }
5766
5767 /* eptr is now past the end of the maximum run. If possessive, we are
5768 done (no backing up). Otherwise, match at this position; anything other
5769 than no match is immediately returned. For nomatch, back up one
5770 character, unless we are matching \R and the last thing matched was
5771 \r\n, in which case, back up two bytes. */
5772
5773 if (possessive) continue;
5774 for(;;)
5775 {
5776 RMATCH(eptr, ecode, offset_top, md, eptrb, RM46);
5777 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
5778 if (eptr-- == pp) break; /* Stop if tried at original pos */
5779 BACKCHAR(eptr);
5780 if (ctype == OP_ANYNL && eptr > pp && *eptr == '\n' &&
5781 eptr[-1] == '\r') eptr--;
5782 }
5783 }
5784 else
5785 #endif /* SUPPORT_UTF */
5786 /* Not UTF mode */
5787 {
5788 switch(ctype)
5789 {
5790 case OP_ANY:
5791 for (i = min; i < max; i++)
5792 {
5793 if (eptr >= md->end_subject)
5794 {
5795 SCHECK_PARTIAL();
5796 break;
5797 }
5798 if (IS_NEWLINE(eptr)) break;
5799 eptr++;
5800 }
5801 break;
5802
5803 case OP_ALLANY:
5804 case OP_ANYBYTE:
5805 c = max - min;
5806 if (c > (unsigned int)(md->end_subject - eptr))
5807 {
5808 eptr = md->end_subject;
5809 SCHECK_PARTIAL();
5810 }
5811 else eptr += c;
5812 break;
5813
5814 case OP_ANYNL:
5815 for (i = min; i < max; i++)
5816 {
5817 if (eptr >= md->end_subject)
5818 {
5819 SCHECK_PARTIAL();
5820 break;
5821 }
5822 c = *eptr;
5823 if (c == 0x000d)
5824 {
5825 if (++eptr >= md->end_subject) break;
5826 if (*eptr == 0x000a) eptr++;
5827 }
5828 else
5829 {
5830 if (c != 0x000a && (md->bsr_anycrlf ||
5831 (c != 0x000b && c != 0x000c && c != 0x0085
5832 #ifdef COMPILE_PCRE16
5833 && c != 0x2028 && c != 0x2029
5834 #endif
5835 ))) break;
5836 eptr++;
5837 }
5838 }
5839 break;
5840
5841 case OP_NOT_HSPACE:
5842 for (i = min; i < max; i++)
5843 {
5844 if (eptr >= md->end_subject)
5845 {
5846 SCHECK_PARTIAL();
5847 break;
5848 }
5849 c = *eptr;
5850 if (c == 0x09 || c == 0x20 || c == 0xa0
5851 #ifdef COMPILE_PCRE16
5852 || c == 0x1680 || c == 0x180e || (c >= 0x2000 && c <= 0x200A)
5853 || c == 0x202f || c == 0x205f || c == 0x3000
5854 #endif
5855 ) break;
5856 eptr++;
5857 }
5858 break;
5859
5860 case OP_HSPACE:
5861 for (i = min; i < max; i++)
5862 {
5863 if (eptr >= md->end_subject)
5864 {
5865 SCHECK_PARTIAL();
5866 break;
5867 }
5868 c = *eptr;
5869 if (c != 0x09 && c != 0x20 && c != 0xa0
5870 #ifdef COMPILE_PCRE16
5871 && c != 0x1680 && c != 0x180e && (c < 0x2000 || c > 0x200A)
5872 && c != 0x202f && c != 0x205f && c != 0x3000
5873 #endif
5874 ) break;
5875 eptr++;
5876 }
5877 break;
5878
5879 case OP_NOT_VSPACE:
5880 for (i = min; i < max; i++)
5881 {
5882 if (eptr >= md->end_subject)
5883 {
5884 SCHECK_PARTIAL();
5885 break;
5886 }
5887 c = *eptr;
5888 if (c == 0x0a || c == 0x0b || c == 0x0c || c == 0x0d || c == 0x85
5889 #ifdef COMPILE_PCRE16
5890 || c == 0x2028 || c == 0x2029
5891 #endif
5892 ) break;
5893 eptr++;
5894 }
5895 break;
5896
5897 case OP_VSPACE:
5898 for (i = min; i < max; i++)
5899 {
5900 if (eptr >= md->end_subject)
5901 {
5902 SCHECK_PARTIAL();
5903 break;
5904 }
5905 c = *eptr;
5906 if (c != 0x0a && c != 0x0b && c != 0x0c && c != 0x0d && c != 0x85
5907 #ifdef COMPILE_PCRE16
5908 && c != 0x2028 && c != 0x2029
5909 #endif
5910 ) break;
5911 eptr++;
5912 }
5913 break;
5914
5915 case OP_NOT_DIGIT:
5916 for (i = min; i < max; i++)
5917 {
5918 if (eptr >= md->end_subject)
5919 {
5920 SCHECK_PARTIAL();
5921 break;
5922 }
5923 if (MAX_255(*eptr) && (md->ctypes[*eptr] & ctype_digit) != 0) break;
5924 eptr++;
5925 }
5926 break;
5927
5928 case OP_DIGIT:
5929 for (i = min; i < max; i++)
5930 {
5931 if (eptr >= md->end_subject)
5932 {
5933 SCHECK_PARTIAL();
5934 break;
5935 }
5936 if (!MAX_255(*eptr) || (md->ctypes[*eptr] & ctype_digit) == 0) break;
5937 eptr++;
5938 }
5939 break;
5940
5941 case OP_NOT_WHITESPACE:
5942 for (i = min; i < max; i++)
5943 {
5944 if (eptr >= md->end_subject)
5945 {
5946 SCHECK_PARTIAL();
5947 break;
5948 }
5949 if (MAX_255(*eptr) && (md->ctypes[*eptr] & ctype_space) != 0) break;
5950 eptr++;
5951 }
5952 break;
5953
5954 case OP_WHITESPACE:
5955 for (i = min; i < max; i++)
5956 {
5957 if (eptr >= md->end_subject)
5958 {
5959 SCHECK_PARTIAL();
5960 break;
5961 }
5962 if (!MAX_255(*eptr) || (md->ctypes[*eptr] & ctype_space) == 0) break;
5963 eptr++;
5964 }
5965 break;
5966
5967 case OP_NOT_WORDCHAR:
5968 for (i = min; i < max; i++)
5969 {
5970 if (eptr >= md->end_subject)
5971 {
5972 SCHECK_PARTIAL();
5973 break;
5974 }
5975 if (MAX_255(*eptr) && (md->ctypes[*eptr] & ctype_word) != 0) break;
5976 eptr++;
5977 }
5978 break;
5979
5980 case OP_WORDCHAR:
5981 for (i = min; i < max; i++)
5982 {
5983 if (eptr >= md->end_subject)
5984 {
5985 SCHECK_PARTIAL();
5986 break;
5987 }
5988 if (!MAX_255(*eptr) || (md->ctypes[*eptr] & ctype_word) == 0) break;
5989 eptr++;
5990 }
5991 break;
5992
5993 default:
5994 RRETURN(PCRE_ERROR_INTERNAL);
5995 }
5996
5997 /* eptr is now past the end of the maximum run. If possessive, we are
5998 done (no backing up). Otherwise, match at this position; anything other
5999 than no match is immediately returned. For nomatch, back up one
6000 character (byte), unless we are matching \R and the last thing matched
6001 was \r\n, in which case, back up two bytes. */
6002
6003 if (possessive) continue;
6004 while (eptr >= pp)
6005 {
6006 RMATCH(eptr, ecode, offset_top, md, eptrb, RM47);
6007 if (rrc != MATCH_NOMATCH) RRETURN(rrc);
6008 eptr--;
6009 if (ctype == OP_ANYNL && eptr > pp && *eptr == '\n' &&
6010 eptr[-1] == '\r') eptr--;
6011 }
6012 }
6013
6014 /* Get here if we can't make it match with any permitted repetitions */
6015
6016 RRETURN(MATCH_NOMATCH);
6017 }
6018 /* Control never gets here */
6019
6020 /* There's been some horrible disaster. Arrival here can only mean there is
6021 something seriously wrong in the code above or the OP_xxx definitions. */
6022
6023 default:
6024 DPRINTF(("Unknown opcode %d\n", *ecode));
6025 RRETURN(PCRE_ERROR_UNKNOWN_OPCODE);
6026 }
6027
6028 /* Do not stick any code in here without much thought; it is assumed
6029 that "continue" in the code above comes out to here to repeat the main
6030 loop. */
6031
6032 } /* End of main loop */
6033 /* Control never reaches here */
6034
6035
6036 /* When compiling to use the heap rather than the stack for recursive calls to
6037 match(), the RRETURN() macro jumps here. The number that is saved in
6038 frame->Xwhere indicates which label we actually want to return to. */
6039
6040 #ifdef NO_RECURSE
6041 #define LBL(val) case val: goto L_RM##val;
6042 HEAP_RETURN:
6043 switch (frame->Xwhere)
6044 {
6045 LBL( 1) LBL( 2) LBL( 3) LBL( 4) LBL( 5) LBL( 6) LBL( 7) LBL( 8)
6046 LBL( 9) LBL(10) LBL(11) LBL(12) LBL(13) LBL(14) LBL(15) LBL(17)
6047 LBL(19) LBL(24) LBL(25) LBL(26) LBL(27) LBL(29) LBL(31) LBL(33)
6048 LBL(35) LBL(43) LBL(47) LBL(48) LBL(49) LBL(50) LBL(51) LBL(52)
6049 LBL(53) LBL(54) LBL(55) LBL(56) LBL(57) LBL(58) LBL(63) LBL(64)
6050 LBL(65) LBL(66)
6051 #if defined SUPPORT_UTF || !defined COMPILE_PCRE8
6052 LBL(21)
6053 #endif
6054 #ifdef SUPPORT_UTF
6055 LBL(16) LBL(18) LBL(20)
6056 LBL(22) LBL(23) LBL(28) LBL(30)
6057 LBL(32) LBL(34) LBL(42) LBL(46)
6058 #ifdef SUPPORT_UCP
6059 LBL(36) LBL(37) LBL(38) LBL(39) LBL(40) LBL(41) LBL(44) LBL(45)
6060 LBL(59) LBL(60) LBL(61) LBL(62)
6061 #endif /* SUPPORT_UCP */
6062 #endif /* SUPPORT_UTF */
6063 default:
6064 DPRINTF(("jump error in pcre match: label %d non-existent\n", frame->Xwhere));
6065
6066 printf("+++jump error in pcre match: label %d non-existent\n", frame->Xwhere);
6067
6068 return PCRE_ERROR_INTERNAL;
6069 }
6070 #undef LBL
6071 #endif /* NO_RECURSE */
6072 }
6073
6074
6075 /***************************************************************************
6076 ****************************************************************************
6077 RECURSION IN THE match() FUNCTION
6078
6079 Undefine all the macros that were defined above to handle this. */
6080
6081 #ifdef NO_RECURSE
6082 #undef eptr
6083 #undef ecode
6084 #undef mstart
6085 #undef offset_top
6086 #undef eptrb
6087 #undef flags
6088
6089 #undef callpat
6090 #undef charptr
6091 #undef data
6092 #undef next
6093 #undef pp
6094 #undef prev
6095 #undef saved_eptr
6096
6097 #undef new_recursive
6098
6099 #undef cur_is_word
6100 #undef condition
6101 #undef prev_is_word
6102
6103 #undef ctype
6104 #undef length
6105 #undef max
6106 #undef min
6107 #undef number
6108 #undef offset
6109 #undef op
6110 #undef save_capture_last
6111 #undef save_offset1
6112 #undef save_offset2
6113 #undef save_offset3
6114 #undef stacksave
6115
6116 #undef newptrb
6117
6118 #endif
6119
6120 /* These two are defined as macros in both cases */
6121
6122 #undef fc
6123 #undef fi
6124
6125 /***************************************************************************
6126 ***************************************************************************/
6127
6128
6129
6130 /*************************************************
6131 * Execute a Regular Expression *
6132 *************************************************/
6133
6134 /* This function applies a compiled re to a subject string and picks out
6135 portions of the string if it matches. Two elements in the vector are set for
6136 each substring: the offsets to the start and end of the substring.
6137
6138 Arguments:
6139 argument_re points to the compiled expression
6140 extra_data points to extra data or is NULL
6141 subject points to the subject string
6142 length length of subject string (may contain binary zeros)
6143 start_offset where to start in the subject string
6144 options option bits
6145 offsets points to a vector of ints to be filled in with offsets
6146 offsetcount the number of elements in the vector
6147
6148 Returns: > 0 => success; value is the number of elements filled in
6149 = 0 => success, but offsets is not big enough
6150 -1 => failed to match
6151 < -1 => some kind of unexpected problem
6152 */
6153
6154 #ifdef COMPILE_PCRE8
6155 PCRE_EXP_DEFN int PCRE_CALL_CONVENTION
6156 pcre_exec(const pcre *argument_re, const pcre_extra *extra_data,
6157 PCRE_SPTR subject, int length, int start_offset, int options, int *offsets,
6158 int offsetcount)
6159 #else
6160 PCRE_EXP_DEFN int PCRE_CALL_CONVENTION
6161 pcre16_exec(const pcre16 *argument_re, const pcre16_extra *extra_data,
6162 PCRE_SPTR16 subject, int length, int start_offset, int options, int *offsets,
6163 int offsetcount)
6164 #endif
6165 {
6166 int rc, ocount, arg_offset_max;
6167 int newline;
6168 BOOL using_temporary_offsets = FALSE;
6169 BOOL anchored;
6170 BOOL startline;
6171 BOOL firstline;
6172 BOOL utf;
6173 BOOL has_first_char = FALSE;
6174 BOOL has_req_char = FALSE;
6175 pcre_uchar first_char = 0;
6176 pcre_uchar first_char2 = 0;
6177 pcre_uchar req_char = 0;
6178 pcre_uchar req_char2 = 0;
6179 match_data match_block;
6180 match_data *md = &match_block;
6181 const pcre_uint8 *tables;
6182 const pcre_uint8 *start_bits = NULL;
6183 PCRE_PUCHAR start_match = (PCRE_PUCHAR)subject + start_offset;
6184 PCRE_PUCHAR end_subject;
6185 PCRE_PUCHAR start_partial = NULL;
6186 PCRE_PUCHAR req_char_ptr = start_match - 1;
6187
6188 const pcre_study_data *study;
6189 const REAL_PCRE *re = (const REAL_PCRE *)argument_re;
6190
6191 /* Plausibility checks */
6192
6193 if ((options & ~PUBLIC_EXEC_OPTIONS) != 0) return PCRE_ERROR_BADOPTION;
6194 if (re == NULL || subject == NULL ||
6195 (offsets == NULL && offsetcount > 0)) return PCRE_ERROR_NULL;
6196 if (offsetcount < 0) return PCRE_ERROR_BADCOUNT;
6197 if (start_offset < 0 || start_offset > length) return PCRE_ERROR_BADOFFSET;
6198
6199 /* These two settings are used in the code for checking a UTF-8 string that
6200 follows immediately afterwards. Other values in the md block are used only
6201 during "normal" pcre_exec() processing, not when the JIT support is in use,
6202 so they are set up later. */
6203
6204 /* PCRE_UTF16 has the same value as PCRE_UTF8. */
6205 utf = md->utf = (re->options & PCRE_UTF8) != 0;
6206 md->partial = ((options & PCRE_PARTIAL_HARD) != 0)? 2 :
6207 ((options & PCRE_PARTIAL_SOFT) != 0)? 1 : 0;
6208
6209 /* Check a UTF-8 string if required. Pass back the character offset and error
6210 code for an invalid string if a results vector is available. */
6211
6212 #ifdef SUPPORT_UTF
6213 if (utf && (options & PCRE_NO_UTF8_CHECK) == 0)
6214 {
6215 int erroroffset;
6216 int errorcode = PRIV(valid_utf)((PCRE_PUCHAR)subject, length, &erroroffset);
6217 if (errorcode != 0)
6218 {
6219 if (offsetcount >= 2)
6220 {
6221 offsets[0] = erroroffset;
6222 offsets[1] = errorcode;
6223 }
6224 #ifdef COMPILE_PCRE16
6225 return (errorcode <= PCRE_UTF16_ERR1 && md->partial > 1)?
6226 PCRE_ERROR_SHORTUTF16 : PCRE_ERROR_BADUTF16;
6227 #else
6228 return (errorcode <= PCRE_UTF8_ERR5 && md->partial > 1)?
6229 PCRE_ERROR_SHORTUTF8 : PCRE_ERROR_BADUTF8;
6230 #endif
6231 }
6232
6233 /* Check that a start_offset points to the start of a UTF character. */
6234 if (start_offset > 0 && start_offset < length &&
6235 NOT_FIRSTCHAR(((PCRE_PUCHAR)subject)[start_offset]))
6236 return PCRE_ERROR_BADUTF8_OFFSET;
6237 }
6238 #endif
6239
6240 /* If the pattern was successfully studied with JIT support, run the JIT
6241 executable instead of the rest of this function. Most options must be set at
6242 compile time for the JIT code to be usable. Fallback to the normal code path if
6243 an unsupported flag is set. In particular, JIT does not support partial
6244 matching. */
6245
6246 #ifdef SUPPORT_JIT
6247 if (extra_data != NULL
6248 && (extra_data->flags & PCRE_EXTRA_EXECUTABLE_JIT) != 0
6249 && extra_data->executable_jit != NULL
6250 && (extra_data->flags & PCRE_EXTRA_TABLES) == 0
6251 && (options & ~(PCRE_NO_UTF8_CHECK | PCRE_NOTBOL | PCRE_NOTEOL |
6252 PCRE_NOTEMPTY | PCRE_NOTEMPTY_ATSTART)) == 0)
6253 return PRIV(jit_exec)(re, extra_data->executable_jit,
6254 (const pcre_uchar *)subject, length, start_offset, options,
6255 ((extra_data->flags & PCRE_EXTRA_MATCH_LIMIT) == 0)
6256 ? MATCH_LIMIT : extra_data->match_limit, offsets, offsetcount);
6257 #endif
6258
6259 /* Carry on with non-JIT matching. This information is for finding all the
6260 numbers associated with a given name, for condition testing. */
6261
6262 md->name_table = (pcre_uchar *)re + re->name_table_offset;
6263 md->name_count = re->name_count;
6264 md->name_entry_size = re->name_entry_size;
6265
6266 /* Fish out the optional data from the extra_data structure, first setting
6267 the default values. */
6268
6269 study = NULL;
6270 md->match_limit = MATCH_LIMIT;
6271 md->match_limit_recursion = MATCH_LIMIT_RECURSION;
6272 md->callout_data = NULL;
6273
6274 /* The table pointer is always in native byte order. */
6275
6276 tables = re->tables;
6277
6278 if (extra_data != NULL)
6279 {
6280 register unsigned int flags = extra_data->flags;
6281 if ((flags & PCRE_EXTRA_STUDY_DATA) != 0)
6282 study = (const pcre_study_data *)extra_data->study_data;
6283 if ((flags & PCRE_EXTRA_MATCH_LIMIT) != 0)
6284 md->match_limit = extra_data->match_limit;
6285 if ((flags & PCRE_EXTRA_MATCH_LIMIT_RECURSION) != 0)
6286 md->match_limit_recursion = extra_data->match_limit_recursion;
6287 if ((flags & PCRE_EXTRA_CALLOUT_DATA) != 0)
6288 md->callout_data = extra_data->callout_data;
6289 if ((flags & PCRE_EXTRA_TABLES) != 0) tables = extra_data->tables;
6290 }
6291
6292 /* If the exec call supplied NULL for tables, use the inbuilt ones. This
6293 is a feature that makes it possible to save compiled regex and re-use them
6294 in other programs later. */
6295
6296 if (tables == NULL) tables = PRIV(default_tables);
6297
6298 /* Check that the first field in the block is the magic number. If it is not,
6299 return with PCRE_ERROR_BADMAGIC. However, if the magic number is equal to
6300 REVERSED_MAGIC_NUMBER we return with PCRE_ERROR_BADENDIANNESS, which
6301 means that the pattern is likely compiled with different endianness. */
6302
6303 if (re->magic_number != MAGIC_NUMBER)
6304 return re->magic_number == REVERSED_MAGIC_NUMBER?
6305 PCRE_ERROR_BADENDIANNESS:PCRE_ERROR_BADMAGIC;
6306 if ((re->flags & PCRE_MODE) == 0) return PCRE_ERROR_BADMODE;
6307
6308 /* Set up other data */
6309
6310 anchored = ((re->options | options) & PCRE_ANCHORED) != 0;
6311 startline = (re->flags & PCRE_STARTLINE) != 0;
6312 firstline = (re->options & PCRE_FIRSTLINE) != 0;
6313
6314 /* The code starts after the real_pcre block and the capture name table. */
6315
6316 md->start_code = (const pcre_uchar *)re + re->name_table_offset +
6317 re->name_count * re->name_entry_size;
6318
6319 md->start_subject = (PCRE_PUCHAR)subject;
6320 md->start_offset = start_offset;
6321 md->end_subject = md->start_subject + length;
6322 end_subject = md->end_subject;
6323
6324 md->endonly = (re->options & PCRE_DOLLAR_ENDONLY) != 0;
6325 md->use_ucp = (re->options & PCRE_UCP) != 0;
6326 md->jscript_compat = (re->options & PCRE_JAVASCRIPT_COMPAT) != 0;
6327 md->ignore_skip_arg = FALSE;
6328
6329 /* Some options are unpacked into BOOL variables in the hope that testing
6330 them will be faster than individual option bits. */
6331
6332 md->notbol = (options & PCRE_NOTBOL) != 0;
6333 md->noteol = (options & PCRE_NOTEOL) != 0;
6334 md->notempty = (options & PCRE_NOTEMPTY) != 0;
6335 md->notempty_atstart = (options & PCRE_NOTEMPTY_ATSTART) != 0;
6336
6337 md->hitend = FALSE;
6338 md->mark = md->nomatch_mark = NULL; /* In case never set */
6339
6340 md->recursive = NULL; /* No recursion at top level */
6341 md->hasthen = (re->flags & PCRE_HASTHEN) != 0;
6342
6343 md->lcc = tables + lcc_offset;
6344 md->fcc = tables + fcc_offset;
6345 md->ctypes = tables + ctypes_offset;
6346
6347 /* Handle different \R options. */
6348
6349 switch (options & (PCRE_BSR_ANYCRLF|PCRE_BSR_UNICODE))
6350 {
6351 case 0:
6352 if ((re->options & (PCRE_BSR_ANYCRLF|PCRE_BSR_UNICODE)) != 0)
6353 md->bsr_anycrlf = (re->options & PCRE_BSR_ANYCRLF) != 0;
6354 else
6355 #ifdef BSR_ANYCRLF
6356 md->bsr_anycrlf = TRUE;
6357 #else
6358 md->bsr_anycrlf = FALSE;
6359 #endif
6360 break;
6361
6362 case PCRE_BSR_ANYCRLF:
6363 md->bsr_anycrlf = TRUE;
6364 break;
6365
6366 case PCRE_BSR_UNICODE:
6367 md->bsr_anycrlf = FALSE;
6368 break;
6369
6370 default: return PCRE_ERROR_BADNEWLINE;
6371 }
6372
6373 /* Handle different types of newline. The three bits give eight cases. If
6374 nothing is set at run time, whatever was used at compile time applies. */
6375
6376 switch ((((options & PCRE_NEWLINE_BITS) == 0)? re->options :
6377 (pcre_uint32)options) & PCRE_NEWLINE_BITS)
6378 {
6379 case 0: newline = NEWLINE; break; /* Compile-time default */
6380 case PCRE_NEWLINE_CR: newline = CHAR_CR; break;
6381 case PCRE_NEWLINE_LF: newline = CHAR_NL; break;
6382 case PCRE_NEWLINE_CR+
6383 PCRE_NEWLINE_LF: newline = (CHAR_CR << 8) | CHAR_NL; break;
6384 case PCRE_NEWLINE_ANY: newline = -1; break;
6385 case PCRE_NEWLINE_ANYCRLF: newline = -2; break;
6386 default: return PCRE_ERROR_BADNEWLINE;
6387 }
6388
6389 if (newline == -2)
6390 {
6391 md->nltype = NLTYPE_ANYCRLF;
6392 }
6393 else if (newline < 0)
6394 {
6395 md->nltype = NLTYPE_ANY;
6396 }
6397 else
6398 {
6399 md->nltype = NLTYPE_FIXED;
6400 if (newline > 255)
6401 {
6402 md->nllen = 2;
6403 md->nl[0] = (newline >> 8) & 255;
6404 md->nl[1] = newline & 255;
6405 }
6406 else
6407 {
6408 md->nllen = 1;
6409 md->nl[0] = newline;
6410 }
6411 }
6412
6413 /* Partial matching was originally supported only for a restricted set of
6414 regexes; from release 8.00 there are no restrictions, but the bits are still
6415 defined (though never set). So there's no harm in leaving this code. */
6416
6417 if (md->partial && (re->flags & PCRE_NOPARTIAL) != 0)
6418 return PCRE_ERROR_BADPARTIAL;
6419
6420 /* If the expression has got more back references than the offsets supplied can
6421 hold, we get a temporary chunk of working store to use during the matching.
6422 Otherwise, we can use the vector supplied, rounding down its size to a multiple
6423 of 3. */
6424
6425 ocount = offsetcount - (offsetcount % 3);
6426 arg_offset_max = (2*ocount)/3;
6427
6428 if (re->top_backref > 0 && re->top_backref >= ocount/3)
6429 {
6430 ocount = re->top_backref * 3 + 3;
6431 md->offset_vector = (int *)(PUBL(malloc))(ocount * sizeof(int));
6432 if (md->offset_vector == NULL) return PCRE_ERROR_NOMEMORY;
6433 using_temporary_offsets = TRUE;
6434 DPRINTF(("Got memory to hold back references\n"));
6435 }
6436 else md->offset_vector = offsets;
6437
6438 md->offset_end = ocount;
6439 md->offset_max = (2*ocount)/3;
6440 md->offset_overflow = FALSE;
6441 md->capture_last = -1;
6442
6443 /* Reset the working variable associated with each extraction. These should
6444 never be used unless previously set, but they get saved and restored, and so we
6445 initialize them to avoid reading uninitialized locations. Also, unset the
6446 offsets for the matched string. This is really just for tidiness with callouts,
6447 in case they inspect these fields. */
6448
6449 if (md->offset_vector != NULL)
6450 {
6451 register int *iptr = md->offset_vector + ocount;
6452 register int *iend = iptr - re->top_bracket;
6453 if (iend < md->offset_vector + 2) iend = md->offset_vector + 2;
6454 while (--iptr >= iend) *iptr = -1;
6455 md->offset_vector[0] = md->offset_vector[1] = -1;
6456 }
6457
6458 /* Set up the first character to match, if available. The first_char value is
6459 never set for an anchored regular expression, but the anchoring may be forced
6460 at run time, so we have to test for anchoring. The first char may be unset for
6461 an unanchored pattern, of course. If there's no first char and the pattern was
6462 studied, there may be a bitmap of possible first characters. */
6463
6464 if (!anchored)
6465 {
6466 if ((re->flags & PCRE_FIRSTSET) != 0)
6467 {
6468 has_first_char = TRUE;
6469 first_char = first_char2 = re->first_char;
6470 if ((re->flags & PCRE_FCH_CASELESS) != 0)
6471 {
6472 first_char2 = TABLE_GET(first_char, md->fcc, first_char);
6473 #if defined SUPPORT_UCP && !(defined COMPILE_PCRE8)
6474 if (utf && first_char > 127)
6475 first_char2 = UCD_OTHERCASE(first_char);
6476 #endif
6477 }
6478 }
6479 else
6480 if (!startline && study != NULL &&
6481 (study->flags & PCRE_STUDY_MAPPED) != 0)
6482 start_bits = study->start_bits;
6483 }
6484
6485 /* For anchored or unanchored matches, there may be a "last known required
6486 character" set. */
6487
6488 if ((re->flags & PCRE_REQCHSET) != 0)
6489 {
6490 has_req_char = TRUE;
6491 req_char = req_char2 = re->req_char;
6492 if ((re->flags & PCRE_RCH_CASELESS) != 0)
6493 {
6494 req_char2 = TABLE_GET(req_char, md->fcc, req_char);
6495 #if defined SUPPORT_UCP && !(defined COMPILE_PCRE8)
6496 if (utf && req_char > 127)
6497 req_char2 = UCD_OTHERCASE(req_char);
6498 #endif
6499 }
6500 }
6501
6502
6503 /* ==========================================================================*/
6504
6505 /* Loop for handling unanchored repeated matching attempts; for anchored regexs
6506 the loop runs just once. */
6507
6508 for(;;)
6509 {
6510 PCRE_PUCHAR save_end_subject = end_subject;
6511 PCRE_PUCHAR new_start_match;
6512
6513 /* If firstline is TRUE, the start of the match is constrained to the first
6514 line of a multiline string. That is, the match must be before or at the first
6515 newline. Implement this by temporarily adjusting end_subject so that we stop
6516 scanning at a newline. If the match fails at the newline, later code breaks
6517 this loop. */
6518
6519 if (firstline)
6520 {
6521 PCRE_PUCHAR t = start_match;
6522 #ifdef SUPPORT_UTF
6523 if (utf)
6524 {
6525 while (t < md->end_subject && !IS_NEWLINE(t))
6526 {
6527 t++;
6528 ACROSSCHAR(t < end_subject, *t, t++);
6529 }
6530 }
6531 else
6532 #endif
6533 while (t < md->end_subject && !IS_NEWLINE(t)) t++;
6534 end_subject = t;
6535 }
6536
6537 /* There are some optimizations that avoid running the match if a known
6538 starting point is not found, or if a known later character is not present.
6539 However, there is an option that disables these, for testing and for ensuring
6540 that all callouts do actually occur. The option can be set in the regex by
6541 (*NO_START_OPT) or passed in match-time options. */
6542
6543 if (((options | re->options) & PCRE_NO_START_OPTIMIZE) == 0)
6544 {
6545 /* Advance to a unique first char if there is one. */
6546
6547 if (has_first_char)
6548 {
6549 if (first_char != first_char2)
6550 while (start_match < end_subject &&
6551 *start_match != first_char && *start_match != first_char2)
6552 start_match++;
6553 else
6554 while (start_match < end_subject && *start_match != first_char)
6555 start_match++;
6556 }
6557
6558 /* Or to just after a linebreak for a multiline match */
6559
6560 else if (startline)
6561 {
6562 if (start_match > md->start_subject + start_offset)
6563 {
6564 #ifdef SUPPORT_UTF
6565 if (utf)
6566 {
6567 while (start_match < end_subject && !WAS_NEWLINE(start_match))
6568 {
6569 start_match++;
6570 ACROSSCHAR(start_match < end_subject, *start_match,
6571 start_match++);
6572 }
6573 }
6574 else
6575 #endif
6576 while (start_match < end_subject && !WAS_NEWLINE(start_match))
6577 start_match++;
6578
6579 /* If we have just passed a CR and the newline option is ANY or ANYCRLF,
6580 and we are now at a LF, advance the match position by one more character.
6581 */
6582
6583 if (start_match[-1] == CHAR_CR &&
6584 (md->nltype == NLTYPE_ANY || md->nltype == NLTYPE_ANYCRLF) &&
6585 start_match < end_subject &&
6586 *start_match == CHAR_NL)
6587 start_match++;
6588 }
6589 }
6590
6591 /* Or to a non-unique first byte after study */
6592
6593 else if (start_bits != NULL)
6594 {
6595 while (start_match < end_subject)
6596 {
6597 register unsigned int c = *start_match;
6598 #ifndef COMPILE_PCRE8
6599 if (c > 255) c = 255;
6600 #endif
6601 if ((start_bits[c/8] & (1 << (c&7))) == 0)
6602 {
6603 start_match++;
6604 #if defined SUPPORT_UTF && defined COMPILE_PCRE8
6605 /* In non 8-bit mode, the iteration will stop for
6606 characters > 255 at the beginning or not stop at all. */
6607 if (utf)
6608 ACROSSCHAR(start_match < end_subject, *start_match,
6609 start_match++);
6610 #endif
6611 }
6612 else break;
6613 }
6614 }
6615 } /* Starting optimizations */
6616
6617 /* Restore fudged end_subject */
6618
6619 end_subject = save_end_subject;
6620
6621 /* The following two optimizations are disabled for partial matching or if
6622 disabling is explicitly requested. */
6623
6624 if (((options | re->options) & PCRE_NO_START_OPTIMIZE) == 0 && !md->partial)
6625 {
6626 /* If the pattern was studied, a minimum subject length may be set. This is
6627 a lower bound; no actual string of that length may actually match the
6628 pattern. Although the value is, strictly, in characters, we treat it as
6629 bytes to avoid spending too much time in this optimization. */
6630
6631 if (study != NULL && (study->flags & PCRE_STUDY_MINLEN) != 0 &&
6632 (pcre_uint32)(end_subject - start_match) < study->minlength)
6633 {
6634 rc = MATCH_NOMATCH;
6635 break;
6636 }
6637
6638 /* If req_char is set, we know that that character must appear in the
6639 subject for the match to succeed. If the first character is set, req_char
6640 must be later in the subject; otherwise the test starts at the match point.
6641 This optimization can save a huge amount of backtracking in patterns with
6642 nested unlimited repeats that aren't going to match. Writing separate code
6643 for cased/caseless versions makes it go faster, as does using an
6644 autoincrement and backing off on a match.
6645
6646 HOWEVER: when the subject string is very, very long, searching to its end
6647 can take a long time, and give bad performance on quite ordinary patterns.
6648 This showed up when somebody was matching something like /^\d+C/ on a
6649 32-megabyte string... so we don't do this when the string is sufficiently
6650 long. */
6651
6652 if (has_req_char && end_subject - start_match < REQ_BYTE_MAX)
6653 {
6654 register PCRE_PUCHAR p = start_match + (has_first_char? 1:0);
6655
6656 /* We don't need to repeat the search if we haven't yet reached the
6657 place we found it at last time. */
6658
6659 if (p > req_char_ptr)
6660 {
6661 if (req_char != req_char2)
6662 {
6663 while (p < end_subject)
6664 {
6665 register int pp = *p++;
6666 if (pp == req_char || pp == req_char2) { p--; break; }
6667 }
6668 }
6669 else
6670 {
6671 while (p < end_subject)
6672 {
6673 if (*p++ == req_char) { p--; break; }
6674 }
6675 }
6676
6677 /* If we can't find the required character, break the matching loop,
6678 forcing a match failure. */
6679
6680 if (p >= end_subject)
6681 {
6682 rc = MATCH_NOMATCH;
6683 break;
6684 }
6685
6686 /* If we have found the required character, save the point where we
6687 found it, so that we don't search again next time round the loop if
6688 the start hasn't passed this character yet. */
6689
6690 req_char_ptr = p;
6691 }
6692 }
6693 }
6694
6695 #ifdef PCRE_DEBUG /* Sigh. Some compilers never learn. */
6696 printf(">>>> Match against: ");
6697 pchars(start_match, end_subject - start_match, TRUE, md);
6698 printf("\n");
6699 #endif
6700
6701 /* OK, we can now run the match. If "hitend" is set afterwards, remember the
6702 first starting point for which a partial match was found. */
6703
6704 md->start_match_ptr = start_match;
6705 md->start_used_ptr = start_match;
6706 md->match_call_count = 0;
6707 md->match_function_type = 0;
6708 md->end_offset_top = 0;
6709 rc = match(start_match, md->start_code, start_match, 2, md, NULL, 0);
6710 if (md->hitend && start_partial == NULL) start_partial = md->start_used_ptr;
6711
6712 switch(rc)
6713 {
6714 /* If MATCH_SKIP_ARG reaches this level it means that a MARK that matched
6715 the SKIP's arg was not found. In this circumstance, Perl ignores the SKIP
6716 entirely. The only way we can do that is to re-do the match at the same
6717 point, with a flag to force SKIP with an argument to be ignored. Just
6718 treating this case as NOMATCH does not work because it does not check other
6719 alternatives in patterns such as A(*SKIP:A)B|AC when the subject is AC. */
6720
6721 case MATCH_SKIP_ARG:
6722 new_start_match = start_match;
6723 md->ignore_skip_arg = TRUE;
6724 break;
6725
6726 /* SKIP passes back the next starting point explicitly, but if it is the
6727 same as the match we have just done, treat it as NOMATCH. */
6728
6729 case MATCH_SKIP:
6730 if (md->start_match_ptr != start_match)
6731 {
6732 new_start_match = md->start_match_ptr;
6733 break;
6734 }
6735 /* Fall through */
6736
6737 /* NOMATCH and PRUNE advance by on