Parent Directory
|
Revision Log
|
Patch
revision 123 by ph10, Mon Mar 12 15:19:06 2007 UTC | revision 476 by ph10, Sun Jan 3 15:37:24 2010 UTC | |
---|---|---|
# | Line 6 | Line 6 |
6 | and semantics are as close as possible to those of the Perl 5 language. | and semantics are as close as possible to those of the Perl 5 language. |
7 | ||
8 | Written by Philip Hazel | Written by Philip Hazel |
9 | Copyright (c) 1997-2007 University of Cambridge | Copyright (c) 1997-2010 University of Cambridge |
10 | ||
11 | ----------------------------------------------------------------------------- | ----------------------------------------------------------------------------- |
12 | Redistribution and use in source and binary forms, with or without | Redistribution and use in source and binary forms, with or without |
# | Line 42 POSSIBILITY OF SUCH DAMAGE. | Line 42 POSSIBILITY OF SUCH DAMAGE. |
42 | pattern matching using an NFA algorithm, trying to mimic Perl as closely as | pattern matching using an NFA algorithm, trying to mimic Perl as closely as |
43 | possible. There are also some static supporting functions. */ | 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 */ | #define NLBLOCK md /* Block containing newline information */ |
50 | #define PSSTART start_subject /* Field containing processed string start */ | #define PSSTART start_subject /* Field containing processed string start */ |
51 | #define PSEND end_subject /* Field containing processed string end */ | #define PSEND end_subject /* Field containing processed string end */ |
52 | ||
53 | #include "pcre_internal.h" | #include "pcre_internal.h" |
54 | ||
55 | /* The chain of eptrblocks for tail recursions uses memory in stack workspace, | /* Undefine some potentially clashing cpp symbols */ |
obtained at top level, the size of which is defined by EPTR_WORK_SIZE. */ | ||
56 | ||
57 | #define EPTR_WORK_SIZE (1000) | #undef min |
58 | #undef max | |
59 | ||
60 | /* Flag bits for the match() function */ | /* Flag bits for the match() function */ |
61 | ||
62 | #define match_condassert 0x01 /* Called to check a condition assertion */ | #define match_condassert 0x01 /* Called to check a condition assertion */ |
63 | #define match_cbegroup 0x02 /* Could-be-empty unlimited repeat group */ | #define match_cbegroup 0x02 /* Could-be-empty unlimited repeat group */ |
#define match_tail_recursed 0x04 /* Tail recursive call */ | ||
64 | ||
65 | /* Non-error returns from the match() function. Error returns are externally | /* Non-error returns from the match() function. Error returns are externally |
66 | defined PCRE_ERROR_xxx codes, which are all negative. */ | defined PCRE_ERROR_xxx codes, which are all negative. */ |
# | Line 65 defined PCRE_ERROR_xxx codes, which are | Line 68 defined PCRE_ERROR_xxx codes, which are |
68 | #define MATCH_MATCH 1 | #define MATCH_MATCH 1 |
69 | #define MATCH_NOMATCH 0 | #define MATCH_NOMATCH 0 |
70 | ||
71 | /* Special internal returns from the match() function. Make them sufficiently | |
72 | negative to avoid the external error codes. */ | |
73 | ||
74 | #define MATCH_COMMIT (-999) | |
75 | #define MATCH_PRUNE (-998) | |
76 | #define MATCH_SKIP (-997) | |
77 | #define MATCH_THEN (-996) | |
78 | ||
79 | /* Maximum number of ints of offset to save on the stack for recursive calls. | /* Maximum number of ints of offset to save on the stack for recursive calls. |
80 | If the offset vector is bigger, malloc is used. This should be a multiple of 3, | If the offset vector is bigger, malloc is used. This should be a multiple of 3, |
81 | because the offset vector is always a multiple of 3 long. */ | because the offset vector is always a multiple of 3 long. */ |
# | Line 78 static const char rep_max[] = { 0, 0, 0, | Line 89 static const char rep_max[] = { 0, 0, 0, |
89 | ||
90 | ||
91 | ||
92 | #ifdef DEBUG | #ifdef PCRE_DEBUG |
93 | /************************************************* | /************************************************* |
94 | * Debugging function to print chars * | * Debugging function to print chars * |
95 | *************************************************/ | *************************************************/ |
# | Line 130 match_ref(int offset, register USPTR ept | Line 141 match_ref(int offset, register USPTR ept |
141 | { | { |
142 | USPTR p = md->start_subject + md->offset_vector[offset]; | USPTR p = md->start_subject + md->offset_vector[offset]; |
143 | ||
144 | #ifdef DEBUG | #ifdef PCRE_DEBUG |
145 | if (eptr >= md->end_subject) | if (eptr >= md->end_subject) |
146 | printf("matching subject <null>"); | printf("matching subject <null>"); |
147 | else | else |
# | Line 147 printf("\n"); | Line 158 printf("\n"); |
158 | ||
159 | if (length > md->end_subject - eptr) return FALSE; | if (length > md->end_subject - eptr) return FALSE; |
160 | ||
161 | /* Separate the caselesss case for speed */ | /* Separate the caseless case for speed. In UTF-8 mode we can only do this |
162 | properly if Unicode properties are supported. Otherwise, we can check only | |
163 | ASCII characters. */ | |
164 | ||
165 | if ((ims & PCRE_CASELESS) != 0) | if ((ims & PCRE_CASELESS) != 0) |
166 | { | { |
167 | #ifdef SUPPORT_UTF8 | |
168 | #ifdef SUPPORT_UCP | |
169 | if (md->utf8) | |
170 | { | |
171 | USPTR endptr = eptr + length; | |
172 | while (eptr < endptr) | |
173 | { | |
174 | int c, d; | |
175 | GETCHARINC(c, eptr); | |
176 | GETCHARINC(d, p); | |
177 | if (c != d && c != UCD_OTHERCASE(d)) return FALSE; | |
178 | } | |
179 | } | |
180 | else | |
181 | #endif | |
182 | #endif | |
183 | ||
184 | /* The same code works when not in UTF-8 mode and in UTF-8 mode when there | |
185 | is no UCP support. */ | |
186 | ||
187 | while (length-- > 0) | while (length-- > 0) |
188 | if (md->lcc[*p++] != md->lcc[*eptr++]) return FALSE; | { if (md->lcc[*p++] != md->lcc[*eptr++]) return FALSE; } |
189 | } | } |
190 | ||
191 | /* In the caseful case, we can just compare the bytes, whether or not we | |
192 | are in UTF-8 mode. */ | |
193 | ||
194 | else | else |
195 | { while (length-- > 0) if (*p++ != *eptr++) return FALSE; } | { while (length-- > 0) if (*p++ != *eptr++) return FALSE; } |
196 | ||
# | Line 183 calls by keeping local variables that ne | Line 220 calls by keeping local variables that ne |
220 | obtained from malloc() instead instead of on the stack. Macros are used to | obtained from malloc() instead instead of on the stack. Macros are used to |
221 | achieve this so that the actual code doesn't look very different to what it | achieve this so that the actual code doesn't look very different to what it |
222 | always used to. | always used to. |
223 | ||
224 | The original heap-recursive code used longjmp(). However, it seems that this | |
225 | can be very slow on some operating systems. Following a suggestion from Stan | |
226 | Switzer, the use of longjmp() has been abolished, at the cost of having to | |
227 | provide a unique number for each call to RMATCH. There is no way of generating | |
228 | a sequence of numbers at compile time in C. I have given them names, to make | |
229 | them stand out more clearly. | |
230 | ||
231 | Crude tests on x86 Linux show a small speedup of around 5-8%. However, on | |
232 | FreeBSD, avoiding longjmp() more than halves the time taken to run the standard | |
233 | tests. Furthermore, not using longjmp() means that local dynamic variables | |
234 | don't have indeterminate values; this has meant that the frame size can be | |
235 | reduced because the result can be "passed back" by straight setting of the | |
236 | variable instead of being passed in the frame. | |
237 | **************************************************************************** | **************************************************************************** |
238 | ***************************************************************************/ | ***************************************************************************/ |
239 | ||
240 | /* Numbers for RMATCH calls. When this list is changed, the code at HEAP_RETURN | |
241 | below must be updated in sync. */ | |
242 | ||
243 | enum { RM1=1, RM2, RM3, RM4, RM5, RM6, RM7, RM8, RM9, RM10, | |
244 | RM11, RM12, RM13, RM14, RM15, RM16, RM17, RM18, RM19, RM20, | |
245 | RM21, RM22, RM23, RM24, RM25, RM26, RM27, RM28, RM29, RM30, | |
246 | RM31, RM32, RM33, RM34, RM35, RM36, RM37, RM38, RM39, RM40, | |
247 | RM41, RM42, RM43, RM44, RM45, RM46, RM47, RM48, RM49, RM50, | |
248 | RM51, RM52, RM53, RM54 }; | |
249 | ||
250 | /* These versions of the macros use the stack, as normal. There are debugging | /* These versions of the macros use the stack, as normal. There are debugging |
251 | versions and production versions. */ | versions and production versions. Note that the "rw" argument of RMATCH isn't |
252 | actuall used in this definition. */ | |
253 | ||
254 | #ifndef NO_RECURSE | #ifndef NO_RECURSE |
255 | #define REGISTER register | #define REGISTER register |
256 | #ifdef DEBUG | |
257 | #define RMATCH(rx,ra,rb,rc,rd,re,rf,rg) \ | #ifdef PCRE_DEBUG |
258 | #define RMATCH(ra,rb,rc,rd,re,rf,rg,rw) \ | |
259 | { \ | { \ |
260 | printf("match() called in line %d\n", __LINE__); \ | printf("match() called in line %d\n", __LINE__); \ |
261 | rx = match(ra,rb,rc,rd,re,rf,rg,rdepth+1); \ | rrc = match(ra,rb,mstart,rc,rd,re,rf,rg,rdepth+1); \ |
262 | printf("to line %d\n", __LINE__); \ | printf("to line %d\n", __LINE__); \ |
263 | } | } |
264 | #define RRETURN(ra) \ | #define RRETURN(ra) \ |
# | Line 205 versions and production versions. */ | Line 267 versions and production versions. */ |
267 | return ra; \ | return ra; \ |
268 | } | } |
269 | #else | #else |
270 | #define RMATCH(rx,ra,rb,rc,rd,re,rf,rg) \ | #define RMATCH(ra,rb,rc,rd,re,rf,rg,rw) \ |
271 | rx = match(ra,rb,rc,rd,re,rf,rg,rdepth+1) | rrc = match(ra,rb,mstart,rc,rd,re,rf,rg,rdepth+1) |
272 | #define RRETURN(ra) return ra | #define RRETURN(ra) return ra |
273 | #endif | #endif |
274 | ||
275 | #else | #else |
276 | ||
277 | ||
278 | /* These versions of the macros manage a private stack on the heap. Note | /* These versions of the macros manage a private stack on the heap. Note that |
279 | that the rd argument of RMATCH isn't actually used. It's the md argument of | the "rd" argument of RMATCH isn't actually used in this definition. It's the md |
280 | match(), which never changes. */ | argument of match(), which never changes. */ |
281 | ||
282 | #define REGISTER | #define REGISTER |
283 | ||
284 | #define RMATCH(rx,ra,rb,rc,rd,re,rf,rg)\ | #define RMATCH(ra,rb,rc,rd,re,rf,rg,rw)\ |
285 | {\ | {\ |
286 | heapframe *newframe = (pcre_stack_malloc)(sizeof(heapframe));\ | heapframe *newframe = (pcre_stack_malloc)(sizeof(heapframe));\ |
287 | if (setjmp(frame->Xwhere) == 0)\ | frame->Xwhere = rw; \ |
288 | {\ | newframe->Xeptr = ra;\ |
289 | newframe->Xeptr = ra;\ | newframe->Xecode = rb;\ |
290 | newframe->Xecode = rb;\ | newframe->Xmstart = mstart;\ |
291 | newframe->Xoffset_top = rc;\ | newframe->Xoffset_top = rc;\ |
292 | newframe->Xims = re;\ | newframe->Xims = re;\ |
293 | newframe->Xeptrb = rf;\ | newframe->Xeptrb = rf;\ |
294 | newframe->Xflags = rg;\ | newframe->Xflags = rg;\ |
295 | newframe->Xrdepth = frame->Xrdepth + 1;\ | newframe->Xrdepth = frame->Xrdepth + 1;\ |
296 | newframe->Xprevframe = frame;\ | newframe->Xprevframe = frame;\ |
297 | frame = newframe;\ | frame = newframe;\ |
298 | DPRINTF(("restarting from line %d\n", __LINE__));\ | DPRINTF(("restarting from line %d\n", __LINE__));\ |
299 | goto HEAP_RECURSE;\ | goto HEAP_RECURSE;\ |
300 | }\ | L_##rw:\ |
301 | else\ | DPRINTF(("jumped back to line %d\n", __LINE__));\ |
{\ | ||
DPRINTF(("longjumped back to line %d\n", __LINE__));\ | ||
frame = md->thisframe;\ | ||
rx = frame->Xresult;\ | ||
}\ | ||
302 | } | } |
303 | ||
304 | #define RRETURN(ra)\ | #define RRETURN(ra)\ |
# | Line 251 match(), which never changes. */ | Line 308 match(), which never changes. */ |
308 | (pcre_stack_free)(newframe);\ | (pcre_stack_free)(newframe);\ |
309 | if (frame != NULL)\ | if (frame != NULL)\ |
310 | {\ | {\ |
311 | frame->Xresult = ra;\ | rrc = ra;\ |
312 | md->thisframe = frame;\ | goto HEAP_RETURN;\ |
longjmp(frame->Xwhere, 1);\ | ||
313 | }\ | }\ |
314 | return ra;\ | return ra;\ |
315 | } | } |
# | Line 266 typedef struct heapframe { | Line 322 typedef struct heapframe { |
322 | ||
323 | /* Function arguments that may change */ | /* Function arguments that may change */ |
324 | ||
325 | const uschar *Xeptr; | USPTR Xeptr; |
326 | const uschar *Xecode; | const uschar *Xecode; |
327 | USPTR Xmstart; | |
328 | int Xoffset_top; | int Xoffset_top; |
329 | long int Xims; | long int Xims; |
330 | eptrblock *Xeptrb; | eptrblock *Xeptrb; |
# | Line 276 typedef struct heapframe { | Line 333 typedef struct heapframe { |
333 | ||
334 | /* Function local variables */ | /* Function local variables */ |
335 | ||
336 | const uschar *Xcallpat; | USPTR Xcallpat; |
337 | const uschar *Xcharptr; | #ifdef SUPPORT_UTF8 |
338 | const uschar *Xdata; | USPTR Xcharptr; |
339 | const uschar *Xnext; | #endif |
340 | const uschar *Xpp; | USPTR Xdata; |
341 | const uschar *Xprev; | USPTR Xnext; |
342 | const uschar *Xsaved_eptr; | USPTR Xpp; |
343 | USPTR Xprev; | |
344 | USPTR Xsaved_eptr; | |
345 | ||
346 | recursion_info Xnew_recursive; | recursion_info Xnew_recursive; |
347 | ||
# | Line 303 typedef struct heapframe { | Line 362 typedef struct heapframe { |
362 | uschar Xocchars[8]; | uschar Xocchars[8]; |
363 | #endif | #endif |
364 | ||
365 | int Xcodelink; | |
366 | int Xctype; | int Xctype; |
367 | unsigned int Xfc; | unsigned int Xfc; |
368 | int Xfi; | int Xfi; |
# | Line 318 typedef struct heapframe { | Line 378 typedef struct heapframe { |
378 | ||
379 | eptrblock Xnewptrb; | eptrblock Xnewptrb; |
380 | ||
381 | /* Place to pass back result, and where to jump back to */ | /* Where to jump back to */ |
382 | ||
383 | int Xresult; | int Xwhere; |
jmp_buf Xwhere; | ||
384 | ||
385 | } heapframe; | } heapframe; |
386 | ||
# | Line 339 typedef struct heapframe { | Line 398 typedef struct heapframe { |
398 | ||
399 | /* This function is called recursively in many circumstances. Whenever it | /* This function is called recursively in many circumstances. Whenever it |
400 | returns a negative (error) response, the outer incarnation must also return the | returns a negative (error) response, the outer incarnation must also return the |
401 | same response. | same response. */ |
402 | ||
403 | /* These macros pack up tests that are used for partial matching, and which | |
404 | appears several times in the code. We set the "hit end" flag if the pointer is | |
405 | at the end of the subject and also past the start of the subject (i.e. | |
406 | something has been matched). For hard partial matching, we then return | |
407 | immediately. The second one is used when we already know we are past the end of | |
408 | the subject. */ | |
409 | ||
410 | #define CHECK_PARTIAL()\ | |
411 | if (md->partial != 0 && eptr >= md->end_subject && eptr > mstart)\ | |
412 | {\ | |
413 | md->hitend = TRUE;\ | |
414 | if (md->partial > 1) RRETURN(PCRE_ERROR_PARTIAL);\ | |
415 | } | |
416 | ||
417 | Performance note: It might be tempting to extract commonly used fields from the | #define SCHECK_PARTIAL()\ |
418 | md structure (e.g. utf8, end_subject) into individual variables to improve | if (md->partial != 0 && eptr > mstart)\ |
419 | {\ | |
420 | md->hitend = TRUE;\ | |
421 | if (md->partial > 1) RRETURN(PCRE_ERROR_PARTIAL);\ | |
422 | } | |
423 | ||
424 | ||
425 | /* Performance note: It might be tempting to extract commonly used fields from | |
426 | the md structure (e.g. utf8, end_subject) into individual variables to improve | |
427 | performance. Tests using gcc on a SPARC disproved this; in the first case, it | performance. Tests using gcc on a SPARC disproved this; in the first case, it |
428 | made performance worse. | made performance worse. |
429 | ||
430 | Arguments: | Arguments: |
431 | eptr pointer to current character in subject | eptr pointer to current character in subject |
432 | ecode pointer to current position in compiled code | ecode pointer to current position in compiled code |
433 | mstart pointer to the current match start position (can be modified | |
434 | by encountering \K) | |
435 | offset_top current top pointer | offset_top current top pointer |
436 | md pointer to "static" info for the match | md pointer to "static" info for the match |
437 | ims current /i, /m, and /s options | ims current /i, /m, and /s options |
# | Line 358 Arguments: | Line 441 Arguments: |
441 | match_condassert - this is an assertion condition | match_condassert - this is an assertion condition |
442 | match_cbegroup - this is the start of an unlimited repeat | match_cbegroup - this is the start of an unlimited repeat |
443 | group that can match an empty string | group that can match an empty string |
match_tail_recursed - this is a tail_recursed group | ||
444 | rdepth the recursion depth | rdepth the recursion depth |
445 | ||
446 | Returns: MATCH_MATCH if matched ) these values are >= 0 | Returns: MATCH_MATCH if matched ) these values are >= 0 |
# | Line 368 Returns: MATCH_MATCH if matched | Line 450 Returns: MATCH_MATCH if matched |
450 | */ | */ |
451 | ||
452 | static int | static int |
453 | match(REGISTER USPTR eptr, REGISTER const uschar *ecode, | match(REGISTER USPTR eptr, REGISTER const uschar *ecode, USPTR mstart, |
454 | int offset_top, match_data *md, unsigned long int ims, eptrblock *eptrb, | int offset_top, match_data *md, unsigned long int ims, eptrblock *eptrb, |
455 | int flags, unsigned int rdepth) | int flags, unsigned int rdepth) |
456 | { | { |
# | Line 382 register unsigned int c; /* Character | Line 464 register unsigned int c; /* Character |
464 | register BOOL utf8; /* Local copy of UTF-8 flag for speed */ | register BOOL utf8; /* Local copy of UTF-8 flag for speed */ |
465 | ||
466 | BOOL minimize, possessive; /* Quantifier options */ | BOOL minimize, possessive; /* Quantifier options */ |
467 | int condcode; | |
468 | ||
469 | /* When recursion is not being used, all "local" variables that have to be | /* When recursion is not being used, all "local" variables that have to be |
470 | preserved over calls to RMATCH() are part of a "frame" which is obtained from | preserved over calls to RMATCH() are part of a "frame" which is obtained from |
# | Line 396 frame->Xprevframe = NULL; /* | Line 479 frame->Xprevframe = NULL; /* |
479 | ||
480 | frame->Xeptr = eptr; | frame->Xeptr = eptr; |
481 | frame->Xecode = ecode; | frame->Xecode = ecode; |
482 | frame->Xmstart = mstart; | |
483 | frame->Xoffset_top = offset_top; | frame->Xoffset_top = offset_top; |
484 | frame->Xims = ims; | frame->Xims = ims; |
485 | frame->Xeptrb = eptrb; | frame->Xeptrb = eptrb; |
# | Line 410 HEAP_RECURSE: | Line 494 HEAP_RECURSE: |
494 | ||
495 | #define eptr frame->Xeptr | #define eptr frame->Xeptr |
496 | #define ecode frame->Xecode | #define ecode frame->Xecode |
497 | #define mstart frame->Xmstart | |
498 | #define offset_top frame->Xoffset_top | #define offset_top frame->Xoffset_top |
499 | #define ims frame->Xims | #define ims frame->Xims |
500 | #define eptrb frame->Xeptrb | #define eptrb frame->Xeptrb |
# | Line 422 HEAP_RECURSE: | Line 507 HEAP_RECURSE: |
507 | #define charptr frame->Xcharptr | #define charptr frame->Xcharptr |
508 | #endif | #endif |
509 | #define callpat frame->Xcallpat | #define callpat frame->Xcallpat |
510 | #define codelink frame->Xcodelink | |
511 | #define data frame->Xdata | #define data frame->Xdata |
512 | #define next frame->Xnext | #define next frame->Xnext |
513 | #define pp frame->Xpp | #define pp frame->Xpp |
# | Line 502 int oclength; | Line 588 int oclength; |
588 | uschar occhars[8]; | uschar occhars[8]; |
589 | #endif | #endif |
590 | ||
591 | int codelink; | |
592 | int ctype; | int ctype; |
593 | int length; | int length; |
594 | int max; | int max; |
# | Line 535 TAIL_RECURSE: | Line 622 TAIL_RECURSE: |
622 | /* OK, now we can get on with the real code of the function. Recursive calls | /* OK, now we can get on with the real code of the function. Recursive calls |
623 | are specified by the macro RMATCH and RRETURN is used to return. When | are specified by the macro RMATCH and RRETURN is used to return. When |
624 | NO_RECURSE is *not* defined, these just turn into a recursive call to match() | NO_RECURSE is *not* defined, these just turn into a recursive call to match() |
625 | and a "return", respectively (possibly with some debugging if DEBUG is | and a "return", respectively (possibly with some debugging if PCRE_DEBUG is |
626 | defined). However, RMATCH isn't like a function call because it's quite a | defined). However, RMATCH isn't like a function call because it's quite a |
627 | complicated macro. It has to be used in one particular way. This shouldn't, | complicated macro. It has to be used in one particular way. This shouldn't, |
628 | however, impact performance when true recursion is being used. */ | however, impact performance when true recursion is being used. */ |
629 | ||
630 | #ifdef SUPPORT_UTF8 | |
631 | utf8 = md->utf8; /* Local copy of the flag */ | |
632 | #else | |
633 | utf8 = FALSE; | |
634 | #endif | |
635 | ||
636 | /* First check that we haven't called match() too many times, or that we | /* First check that we haven't called match() too many times, or that we |
637 | haven't exceeded the recursive call limit. */ | haven't exceeded the recursive call limit. */ |
638 | ||
# | Line 548 if (rdepth >= md->match_limit_recursion) | Line 641 if (rdepth >= md->match_limit_recursion) |
641 | ||
642 | original_ims = ims; /* Save for resetting on ')' */ | original_ims = ims; /* Save for resetting on ')' */ |
643 | ||
#ifdef SUPPORT_UTF8 | ||
utf8 = md->utf8; /* Local copy of the flag */ | ||
#else | ||
utf8 = FALSE; | ||
#endif | ||
644 | /* At the start of a group with an unlimited repeat that may match an empty | /* At the start of a group with an unlimited repeat that may match an empty |
645 | string, the match_cbegroup flag is set. When this is the case, add the current | string, the match_cbegroup flag is set. When this is the case, add the current |
646 | subject pointer to the chain of such remembered pointers, to be checked when we | subject pointer to the chain of such remembered pointers, to be checked when we |
647 | hit the closing ket, in order to break infinite loops that match no characters. | hit the closing ket, in order to break infinite loops that match no characters. |
648 | When match() is called in other circumstances, don't add to the chain. If this | When match() is called in other circumstances, don't add to the chain. The |
649 | is a tail recursion, use a block from the workspace, as the one on the stack is | match_cbegroup flag must NOT be used with tail recursion, because the memory |
650 | already used. */ | block that is used is on the stack, so a new one may be required for each |
651 | match(). */ | |
652 | ||
653 | if ((flags & match_cbegroup) != 0) | if ((flags & match_cbegroup) != 0) |
654 | { | { |
655 | eptrblock *p; | newptrb.epb_saved_eptr = eptr; |
656 | if ((flags & match_tail_recursed) != 0) | newptrb.epb_prev = eptrb; |
657 | { | eptrb = &newptrb; |
if (md->eptrn >= EPTR_WORK_SIZE) RRETURN(PCRE_ERROR_NULLWSLIMIT); | ||
p = md->eptrchain + md->eptrn++; | ||
} | ||
else p = &newptrb; | ||
p->epb_saved_eptr = eptr; | ||
p->epb_prev = eptrb; | ||
eptrb = p; | ||
658 | } | } |
659 | ||
660 | /* Now start processing the opcodes. */ | /* Now start processing the opcodes. */ |
# | Line 583 for (;;) | Line 664 for (;;) |
664 | minimize = possessive = FALSE; | minimize = possessive = FALSE; |
665 | op = *ecode; | op = *ecode; |
666 | ||
/* For partial matching, remember if we ever hit the end of the subject after | ||
matching at least one subject character. */ | ||
if (md->partial && | ||
eptr >= md->end_subject && | ||
eptr > md->start_match) | ||
md->hitend = TRUE; | ||
667 | switch(op) | switch(op) |
668 | { | { |
669 | case OP_FAIL: | |
670 | RRETURN(MATCH_NOMATCH); | |
671 | ||
672 | case OP_PRUNE: | |
673 | RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, | |
674 | ims, eptrb, flags, RM51); | |
675 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | |
676 | RRETURN(MATCH_PRUNE); | |
677 | ||
678 | case OP_COMMIT: | |
679 | RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, | |
680 | ims, eptrb, flags, RM52); | |
681 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | |
682 | RRETURN(MATCH_COMMIT); | |
683 | ||
684 | case OP_SKIP: | |
685 | RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, | |
686 | ims, eptrb, flags, RM53); | |
687 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | |
688 | md->start_match_ptr = eptr; /* Pass back current position */ | |
689 | RRETURN(MATCH_SKIP); | |
690 | ||
691 | case OP_THEN: | |
692 | RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, | |
693 | ims, eptrb, flags, RM54); | |
694 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | |
695 | RRETURN(MATCH_THEN); | |
696 | ||
697 | /* Handle a capturing bracket. If there is space in the offset vector, save | /* Handle a capturing bracket. If there is space in the offset vector, save |
698 | the current subject position in the working slot at the top of the vector. | the current subject position in the working slot at the top of the vector. |
699 | We mustn't change the current values of the data slot, because they may be | We mustn't change the current values of the data slot, because they may be |
# | Line 612 for (;;) | Line 713 for (;;) |
713 | number = GET2(ecode, 1+LINK_SIZE); | number = GET2(ecode, 1+LINK_SIZE); |
714 | offset = number << 1; | offset = number << 1; |
715 | ||
716 | #ifdef DEBUG | #ifdef PCRE_DEBUG |
717 | printf("start bracket %d\n", number); | printf("start bracket %d\n", number); |
718 | printf("subject="); | printf("subject="); |
719 | pchars(eptr, 16, TRUE, md); | pchars(eptr, 16, TRUE, md); |
# | Line 632 for (;;) | Line 733 for (;;) |
733 | flags = (op == OP_SCBRA)? match_cbegroup : 0; | flags = (op == OP_SCBRA)? match_cbegroup : 0; |
734 | do | do |
735 | { | { |
736 | RMATCH(rrc, eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, | RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, |
737 | ims, eptrb, flags); | ims, eptrb, flags, RM1); |
738 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc); |
739 | md->capture_last = save_capture_last; | md->capture_last = save_capture_last; |
740 | ecode += GET(ecode, 1); | ecode += GET(ecode, 1); |
741 | } | } |
# | Line 649 for (;;) | Line 750 for (;;) |
750 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
751 | } | } |
752 | ||
753 | /* Insufficient room for saving captured contents. Treat as a non-capturing | /* FALL THROUGH ... Insufficient room for saving captured contents. Treat |
754 | bracket. */ | as a non-capturing bracket. */ |
755 | ||
756 | /* VVVVVVVVVVVVVVVVVVVVVVVVV */ | |
757 | /* VVVVVVVVVVVVVVVVVVVVVVVVV */ | |
758 | ||
759 | DPRINTF(("insufficient capture room: treat as non-capturing\n")); | DPRINTF(("insufficient capture room: treat as non-capturing\n")); |
760 | ||
761 | /* VVVVVVVVVVVVVVVVVVVVVVVVV */ | |
762 | /* VVVVVVVVVVVVVVVVVVVVVVVVV */ | |
763 | ||
764 | /* Non-capturing bracket. Loop for all the alternatives. When we get to the | /* Non-capturing bracket. Loop for all the alternatives. When we get to the |
765 | final alternative within the brackets, we would return the result of a | final alternative within the brackets, we would return the result of a |
766 | recursive call to match() whatever happened. We can reduce stack usage by | recursive call to match() whatever happened. We can reduce stack usage by |
767 | turning this into a tail recursion. */ | turning this into a tail recursion, except in the case when match_cbegroup |
768 | is set.*/ | |
769 | ||
770 | case OP_BRA: | case OP_BRA: |
771 | case OP_SBRA: | case OP_SBRA: |
# | Line 665 for (;;) | Line 773 for (;;) |
773 | flags = (op >= OP_SBRA)? match_cbegroup : 0; | flags = (op >= OP_SBRA)? match_cbegroup : 0; |
774 | for (;;) | for (;;) |
775 | { | { |
776 | if (ecode[GET(ecode, 1)] != OP_ALT) | if (ecode[GET(ecode, 1)] != OP_ALT) /* Final alternative */ |
777 | { | { |
778 | ecode += _pcre_OP_lengths[*ecode]; | if (flags == 0) /* Not a possibly empty group */ |
779 | flags |= match_tail_recursed; | { |
780 | DPRINTF(("bracket 0 tail recursion\n")); | ecode += _pcre_OP_lengths[*ecode]; |
781 | goto TAIL_RECURSE; | DPRINTF(("bracket 0 tail recursion\n")); |
782 | goto TAIL_RECURSE; | |
783 | } | |
784 | ||
785 | /* Possibly empty group; can't use tail recursion. */ | |
786 | ||
787 | RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, ims, | |
788 | eptrb, flags, RM48); | |
789 | RRETURN(rrc); | |
790 | } | } |
791 | ||
792 | /* For non-final alternatives, continue the loop for a NOMATCH result; | /* For non-final alternatives, continue the loop for a NOMATCH result; |
793 | otherwise return. */ | otherwise return. */ |
794 | ||
795 | RMATCH(rrc, eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, ims, | RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, ims, |
796 | eptrb, flags); | eptrb, flags, RM2); |
797 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc); |
798 | ecode += GET(ecode, 1); | ecode += GET(ecode, 1); |
799 | } | } |
800 | /* Control never reaches here. */ | /* Control never reaches here. */ |
# | Line 691 for (;;) | Line 807 for (;;) |
807 | ||
808 | case OP_COND: | case OP_COND: |
809 | case OP_SCOND: | case OP_SCOND: |
810 | if (ecode[LINK_SIZE+1] == OP_RREF) /* Recursion test */ | codelink= GET(ecode, 1); |
811 | ||
812 | /* Because of the way auto-callout works during compile, a callout item is | |
813 | inserted between OP_COND and an assertion condition. */ | |
814 | ||
815 | if (ecode[LINK_SIZE+1] == OP_CALLOUT) | |
816 | { | { |
817 | offset = GET2(ecode, LINK_SIZE + 2); /* Recursion group number*/ | if (pcre_callout != NULL) |
818 | condition = md->recursive != NULL && | { |
819 | (offset == RREF_ANY || offset == md->recursive->group_num); | pcre_callout_block cb; |
820 | ecode += condition? 3 : GET(ecode, 1); | cb.version = 1; /* Version 1 of the callout block */ |
821 | cb.callout_number = ecode[LINK_SIZE+2]; | |
822 | cb.offset_vector = md->offset_vector; | |
823 | cb.subject = (PCRE_SPTR)md->start_subject; | |
824 | cb.subject_length = md->end_subject - md->start_subject; | |
825 | cb.start_match = mstart - md->start_subject; | |
826 | cb.current_position = eptr - md->start_subject; | |
827 | cb.pattern_position = GET(ecode, LINK_SIZE + 3); | |
828 | cb.next_item_length = GET(ecode, 3 + 2*LINK_SIZE); | |
829 | cb.capture_top = offset_top/2; | |
830 | cb.capture_last = md->capture_last; | |
831 | cb.callout_data = md->callout_data; | |
832 | if ((rrc = (*pcre_callout)(&cb)) > 0) RRETURN(MATCH_NOMATCH); | |
833 | if (rrc < 0) RRETURN(rrc); | |
834 | } | |
835 | ecode += _pcre_OP_lengths[OP_CALLOUT]; | |
836 | } | |
837 | ||
838 | condcode = ecode[LINK_SIZE+1]; | |
839 | ||
840 | /* Now see what the actual condition is */ | |
841 | ||
842 | if (condcode == OP_RREF || condcode == OP_NRREF) /* Recursion test */ | |
843 | { | |
844 | if (md->recursive == NULL) /* Not recursing => FALSE */ | |
845 | { | |
846 | condition = FALSE; | |
847 | ecode += GET(ecode, 1); | |
848 | } | |
849 | else | |
850 | { | |
851 | int recno = GET2(ecode, LINK_SIZE + 2); /* Recursion group number*/ | |
852 | condition = (recno == RREF_ANY || recno == md->recursive->group_num); | |
853 | ||
854 | /* If the test is for recursion into a specific subpattern, and it is | |
855 | false, but the test was set up by name, scan the table to see if the | |
856 | name refers to any other numbers, and test them. The condition is true | |
857 | if any one is set. */ | |
858 | ||
859 | if (!condition && condcode == OP_NRREF && recno != RREF_ANY) | |
860 | { | |
861 | uschar *slotA = md->name_table; | |
862 | for (i = 0; i < md->name_count; i++) | |
863 | { | |
864 | if (GET2(slotA, 0) == recno) break; | |
865 | slotA += md->name_entry_size; | |
866 | } | |
867 | ||
868 | /* Found a name for the number - there can be only one; duplicate | |
869 | names for different numbers are allowed, but not vice versa. First | |
870 | scan down for duplicates. */ | |
871 | ||
872 | if (i < md->name_count) | |
873 | { | |
874 | uschar *slotB = slotA; | |
875 | while (slotB > md->name_table) | |
876 | { | |
877 | slotB -= md->name_entry_size; | |
878 | if (strcmp((char *)slotA + 2, (char *)slotB + 2) == 0) | |
879 | { | |
880 | condition = GET2(slotB, 0) == md->recursive->group_num; | |
881 | if (condition) break; | |
882 | } | |
883 | else break; | |
884 | } | |
885 | ||
886 | /* Scan up for duplicates */ | |
887 | ||
888 | if (!condition) | |
889 | { | |
890 | slotB = slotA; | |
891 | for (i++; i < md->name_count; i++) | |
892 | { | |
893 | slotB += md->name_entry_size; | |
894 | if (strcmp((char *)slotA + 2, (char *)slotB + 2) == 0) | |
895 | { | |
896 | condition = GET2(slotB, 0) == md->recursive->group_num; | |
897 | if (condition) break; | |
898 | } | |
899 | else break; | |
900 | } | |
901 | } | |
902 | } | |
903 | } | |
904 | ||
905 | /* Chose branch according to the condition */ | |
906 | ||
907 | ecode += condition? 3 : GET(ecode, 1); | |
908 | } | |
909 | } | } |
910 | ||
911 | else if (ecode[LINK_SIZE+1] == OP_CREF) /* Group used test */ | else if (condcode == OP_CREF || condcode == OP_NCREF) /* Group used test */ |
912 | { | { |
913 | offset = GET2(ecode, LINK_SIZE+2) << 1; /* Doubled ref number */ | offset = GET2(ecode, LINK_SIZE+2) << 1; /* Doubled ref number */ |
914 | condition = offset < offset_top && md->offset_vector[offset] >= 0; | condition = offset < offset_top && md->offset_vector[offset] >= 0; |
915 | ||
916 | /* If the numbered capture is unset, but the reference was by name, | |
917 | scan the table to see if the name refers to any other numbers, and test | |
918 | them. The condition is true if any one is set. This is tediously similar | |
919 | to the code above, but not close enough to try to amalgamate. */ | |
920 | ||
921 | if (!condition && condcode == OP_NCREF) | |
922 | { | |
923 | int refno = offset >> 1; | |
924 | uschar *slotA = md->name_table; | |
925 | ||
926 | for (i = 0; i < md->name_count; i++) | |
927 | { | |
928 | if (GET2(slotA, 0) == refno) break; | |
929 | slotA += md->name_entry_size; | |
930 | } | |
931 | ||
932 | /* Found a name for the number - there can be only one; duplicate names | |
933 | for different numbers are allowed, but not vice versa. First scan down | |
934 | for duplicates. */ | |
935 | ||
936 | if (i < md->name_count) | |
937 | { | |
938 | uschar *slotB = slotA; | |
939 | while (slotB > md->name_table) | |
940 | { | |
941 | slotB -= md->name_entry_size; | |
942 | if (strcmp((char *)slotA + 2, (char *)slotB + 2) == 0) | |
943 | { | |
944 | offset = GET2(slotB, 0) << 1; | |
945 | condition = offset < offset_top && | |
946 | md->offset_vector[offset] >= 0; | |
947 | if (condition) break; | |
948 | } | |
949 | else break; | |
950 | } | |
951 | ||
952 | /* Scan up for duplicates */ | |
953 | ||
954 | if (!condition) | |
955 | { | |
956 | slotB = slotA; | |
957 | for (i++; i < md->name_count; i++) | |
958 | { | |
959 | slotB += md->name_entry_size; | |
960 | if (strcmp((char *)slotA + 2, (char *)slotB + 2) == 0) | |
961 | { | |
962 | offset = GET2(slotB, 0) << 1; | |
963 | condition = offset < offset_top && | |
964 | md->offset_vector[offset] >= 0; | |
965 | if (condition) break; | |
966 | } | |
967 | else break; | |
968 | } | |
969 | } | |
970 | } | |
971 | } | |
972 | ||
973 | /* Chose branch according to the condition */ | |
974 | ||
975 | ecode += condition? 3 : GET(ecode, 1); | ecode += condition? 3 : GET(ecode, 1); |
976 | } | } |
977 | ||
978 | else if (ecode[LINK_SIZE+1] == OP_DEF) /* DEFINE - always false */ | else if (condcode == OP_DEF) /* DEFINE - always false */ |
979 | { | { |
980 | condition = FALSE; | condition = FALSE; |
981 | ecode += GET(ecode, 1); | ecode += GET(ecode, 1); |
# | Line 718 for (;;) | Line 987 for (;;) |
987 | ||
988 | else | else |
989 | { | { |
990 | RMATCH(rrc, eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, NULL, | RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, NULL, |
991 | match_condassert); | match_condassert, RM3); |
992 | if (rrc == MATCH_MATCH) | if (rrc == MATCH_MATCH) |
993 | { | { |
994 | condition = TRUE; | condition = TRUE; |
995 | ecode += 1 + LINK_SIZE + GET(ecode, LINK_SIZE + 2); | ecode += 1 + LINK_SIZE + GET(ecode, LINK_SIZE + 2); |
996 | while (*ecode == OP_ALT) ecode += GET(ecode, 1); | while (*ecode == OP_ALT) ecode += GET(ecode, 1); |
997 | } | } |
998 | else if (rrc != MATCH_NOMATCH) | else if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) |
999 | { | { |
1000 | RRETURN(rrc); /* Need braces because of following else */ | RRETURN(rrc); /* Need braces because of following else */ |
1001 | } | } |
1002 | else | else |
1003 | { | { |
1004 | condition = FALSE; | condition = FALSE; |
1005 | ecode += GET(ecode, 1); | ecode += codelink; |
1006 | } | } |
1007 | } | } |
1008 | ||
1009 | /* We are now at the branch that is to be obeyed. As there is only one, | /* We are now at the branch that is to be obeyed. As there is only one, |
1010 | we can use tail recursion to avoid using another stack frame. If the second | we can use tail recursion to avoid using another stack frame, except when |
1011 | alternative doesn't exist, we can just plough on. */ | match_cbegroup is required for an unlimited repeat of a possibly empty |
1012 | group. If the second alternative doesn't exist, we can just plough on. */ | |
1013 | ||
1014 | if (condition || *ecode == OP_ALT) | if (condition || *ecode == OP_ALT) |
1015 | { | { |
1016 | ecode += 1 + LINK_SIZE; | ecode += 1 + LINK_SIZE; |
1017 | flags = match_tail_recursed | ((op == OP_SCOND)? match_cbegroup : 0); | if (op == OP_SCOND) /* Possibly empty group */ |
1018 | goto TAIL_RECURSE; | { |
1019 | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, match_cbegroup, RM49); | |
1020 | RRETURN(rrc); | |
1021 | } | |
1022 | else /* Group must match something */ | |
1023 | { | |
1024 | flags = 0; | |
1025 | goto TAIL_RECURSE; | |
1026 | } | |
1027 | } | } |
1028 | else | else /* Condition false & no alternative */ |
1029 | { | { |
1030 | ecode += 1 + LINK_SIZE; | ecode += 1 + LINK_SIZE; |
1031 | } | } |
1032 | break; | break; |
1033 | ||
1034 | ||
1035 | /* End of the pattern. If we are in a top-level recursion, we should | /* Before OP_ACCEPT there may be any number of OP_CLOSE opcodes, |
1036 | restore the offsets appropriately and continue from after the call. */ | to close any currently open capturing brackets. */ |
1037 | ||
1038 | case OP_CLOSE: | |
1039 | number = GET2(ecode, 1); | |
1040 | offset = number << 1; | |
1041 | ||
1042 | #ifdef PCRE_DEBUG | |
1043 | printf("end bracket %d at *ACCEPT", number); | |
1044 | printf("\n"); | |
1045 | #endif | |
1046 | ||
1047 | md->capture_last = number; | |
1048 | if (offset >= md->offset_max) md->offset_overflow = TRUE; else | |
1049 | { | |
1050 | md->offset_vector[offset] = | |
1051 | md->offset_vector[md->offset_end - number]; | |
1052 | md->offset_vector[offset+1] = eptr - md->start_subject; | |
1053 | if (offset_top <= offset) offset_top = offset + 2; | |
1054 | } | |
1055 | ecode += 3; | |
1056 | break; | |
1057 | ||
1058 | ||
1059 | /* End of the pattern, either real or forced. If we are in a top-level | |
1060 | recursion, we should restore the offsets appropriately and continue from | |
1061 | after the call. */ | |
1062 | ||
1063 | case OP_ACCEPT: | |
1064 | case OP_END: | case OP_END: |
1065 | if (md->recursive != NULL && md->recursive->group_num == 0) | if (md->recursive != NULL && md->recursive->group_num == 0) |
1066 | { | { |
# | Line 765 for (;;) | Line 1069 for (;;) |
1069 | md->recursive = rec->prevrec; | md->recursive = rec->prevrec; |
1070 | memmove(md->offset_vector, rec->offset_save, | memmove(md->offset_vector, rec->offset_save, |
1071 | rec->saved_max * sizeof(int)); | rec->saved_max * sizeof(int)); |
1072 | md->start_match = rec->save_start; | offset_top = rec->save_offset_top; |
1073 | mstart = rec->save_start; | |
1074 | ims = original_ims; | ims = original_ims; |
1075 | ecode = rec->after_call; | ecode = rec->after_call; |
1076 | break; | break; |
1077 | } | } |
1078 | ||
1079 | /* Otherwise, if PCRE_NOTEMPTY is set, fail if we have matched an empty | /* Otherwise, if we have matched an empty string, fail if PCRE_NOTEMPTY is |
1080 | string - backtracking will then try other alternatives, if any. */ | set, or if PCRE_NOTEMPTY_ATSTART is set and we have matched at the start of |
1081 | the subject. In both cases, backtracking will then try other alternatives, | |
1082 | if any. */ | |
1083 | ||
1084 | if (eptr == mstart && | |
1085 | (md->notempty || | |
1086 | (md->notempty_atstart && | |
1087 | mstart == md->start_subject + md->start_offset))) | |
1088 | RRETURN(MATCH_NOMATCH); | |
1089 | ||
1090 | /* Otherwise, we have a match. */ | |
1091 | ||
1092 | if (md->notempty && eptr == md->start_match) RRETURN(MATCH_NOMATCH); | md->end_match_ptr = eptr; /* Record where we ended */ |
1093 | md->end_match_ptr = eptr; /* Record where we ended */ | md->end_offset_top = offset_top; /* and how many extracts were taken */ |
1094 | md->end_offset_top = offset_top; /* and how many extracts were taken */ | md->start_match_ptr = mstart; /* and the start (\K can modify) */ |
1095 | RRETURN(MATCH_MATCH); | RRETURN(MATCH_MATCH); |
1096 | ||
1097 | /* Change option settings */ | /* Change option settings */ |
# | Line 797 for (;;) | Line 1112 for (;;) |
1112 | case OP_ASSERTBACK: | case OP_ASSERTBACK: |
1113 | do | do |
1114 | { | { |
1115 | RMATCH(rrc, eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, NULL, 0); | RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, NULL, 0, |
1116 | RM4); | |
1117 | if (rrc == MATCH_MATCH) break; | if (rrc == MATCH_MATCH) break; |
1118 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc); |
1119 | ecode += GET(ecode, 1); | ecode += GET(ecode, 1); |
1120 | } | } |
1121 | while (*ecode == OP_ALT); | while (*ecode == OP_ALT); |
# | Line 817 for (;;) | Line 1133 for (;;) |
1133 | offset_top = md->end_offset_top; | offset_top = md->end_offset_top; |
1134 | continue; | continue; |
1135 | ||
1136 | /* Negative assertion: all branches must fail to match */ | /* Negative assertion: all branches must fail to match. Encountering SKIP, |
1137 | PRUNE, or COMMIT means we must assume failure without checking subsequent | |
1138 | branches. */ | |
1139 | ||
1140 | case OP_ASSERT_NOT: | case OP_ASSERT_NOT: |
1141 | case OP_ASSERTBACK_NOT: | case OP_ASSERTBACK_NOT: |
1142 | do | do |
1143 | { | { |
1144 | RMATCH(rrc, eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, NULL, 0); | RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, NULL, 0, |
1145 | RM5); | |
1146 | if (rrc == MATCH_MATCH) RRETURN(MATCH_NOMATCH); | if (rrc == MATCH_MATCH) RRETURN(MATCH_NOMATCH); |
1147 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc == MATCH_SKIP || rrc == MATCH_PRUNE || rrc == MATCH_COMMIT) |
1148 | { | |
1149 | do ecode += GET(ecode,1); while (*ecode == OP_ALT); | |
1150 | break; | |
1151 | } | |
1152 | if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc); | |
1153 | ecode += GET(ecode,1); | ecode += GET(ecode,1); |
1154 | } | } |
1155 | while (*ecode == OP_ALT); | while (*ecode == OP_ALT); |
# | Line 849 for (;;) | Line 1173 for (;;) |
1173 | { | { |
1174 | eptr--; | eptr--; |
1175 | if (eptr < md->start_subject) RRETURN(MATCH_NOMATCH); | if (eptr < md->start_subject) RRETURN(MATCH_NOMATCH); |
1176 | BACKCHAR(eptr) | BACKCHAR(eptr); |
1177 | } | } |
1178 | } | } |
1179 | else | else |
# | Line 862 for (;;) | Line 1186 for (;;) |
1186 | if (eptr < md->start_subject) RRETURN(MATCH_NOMATCH); | if (eptr < md->start_subject) RRETURN(MATCH_NOMATCH); |
1187 | } | } |
1188 | ||
1189 | /* Skip to next op code */ | /* Save the earliest consulted character, then skip to next op code */ |
1190 | ||
1191 | if (eptr < md->start_used_ptr) md->start_used_ptr = eptr; | |
1192 | ecode += 1 + LINK_SIZE; | ecode += 1 + LINK_SIZE; |
1193 | break; | break; |
1194 | ||
# | Line 880 for (;;) | Line 1205 for (;;) |
1205 | cb.offset_vector = md->offset_vector; | cb.offset_vector = md->offset_vector; |
1206 | cb.subject = (PCRE_SPTR)md->start_subject; | cb.subject = (PCRE_SPTR)md->start_subject; |
1207 | cb.subject_length = md->end_subject - md->start_subject; | cb.subject_length = md->end_subject - md->start_subject; |
1208 | cb.start_match = md->start_match - md->start_subject; | cb.start_match = mstart - md->start_subject; |
1209 | cb.current_position = eptr - md->start_subject; | cb.current_position = eptr - md->start_subject; |
1210 | cb.pattern_position = GET(ecode, 2); | cb.pattern_position = GET(ecode, 2); |
1211 | cb.next_item_length = GET(ecode, 2 + LINK_SIZE); | cb.next_item_length = GET(ecode, 2 + LINK_SIZE); |
# | Line 942 for (;;) | Line 1267 for (;;) |
1267 | ||
1268 | memcpy(new_recursive.offset_save, md->offset_vector, | memcpy(new_recursive.offset_save, md->offset_vector, |
1269 | new_recursive.saved_max * sizeof(int)); | new_recursive.saved_max * sizeof(int)); |
1270 | new_recursive.save_start = md->start_match; | new_recursive.save_start = mstart; |
1271 | md->start_match = eptr; | new_recursive.save_offset_top = offset_top; |
1272 | mstart = eptr; | |
1273 | ||
1274 | /* OK, now we can do the recursion. For each top-level alternative we | /* OK, now we can do the recursion. For each top-level alternative we |
1275 | restore the offset and recursion data. */ | restore the offset and recursion data. */ |
# | Line 952 for (;;) | Line 1278 for (;;) |
1278 | flags = (*callpat >= OP_SBRA)? match_cbegroup : 0; | flags = (*callpat >= OP_SBRA)? match_cbegroup : 0; |
1279 | do | do |
1280 | { | { |
1281 | RMATCH(rrc, eptr, callpat + _pcre_OP_lengths[*callpat], offset_top, | RMATCH(eptr, callpat + _pcre_OP_lengths[*callpat], offset_top, |
1282 | md, ims, eptrb, flags); | md, ims, eptrb, flags, RM6); |
1283 | if (rrc == MATCH_MATCH) | if (rrc == MATCH_MATCH) |
1284 | { | { |
1285 | DPRINTF(("Recursion matched\n")); | DPRINTF(("Recursion matched\n")); |
# | Line 962 for (;;) | Line 1288 for (;;) |
1288 | (pcre_free)(new_recursive.offset_save); | (pcre_free)(new_recursive.offset_save); |
1289 | RRETURN(MATCH_MATCH); | RRETURN(MATCH_MATCH); |
1290 | } | } |
1291 | else if (rrc != MATCH_NOMATCH) | else if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) |
1292 | { | { |
1293 | DPRINTF(("Recursion gave error %d\n", rrc)); | DPRINTF(("Recursion gave error %d\n", rrc)); |
1294 | if (new_recursive.offset_save != stacksave) | |
1295 | (pcre_free)(new_recursive.offset_save); | |
1296 | RRETURN(rrc); | RRETURN(rrc); |
1297 | } | } |
1298 | ||
# | Line 996 for (;;) | Line 1324 for (;;) |
1324 | ||
1325 | do | do |
1326 | { | { |
1327 | RMATCH(rrc, eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, | RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, eptrb, 0, RM7); |
eptrb, 0); | ||
1328 | if (rrc == MATCH_MATCH) break; | if (rrc == MATCH_MATCH) break; |
1329 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc); |
1330 | ecode += GET(ecode,1); | ecode += GET(ecode,1); |
1331 | } | } |
1332 | while (*ecode == OP_ALT); | while (*ecode == OP_ALT); |
# | Line 1042 for (;;) | Line 1369 for (;;) |
1369 | ||
1370 | if (*ecode == OP_KETRMIN) | if (*ecode == OP_KETRMIN) |
1371 | { | { |
1372 | RMATCH(rrc, eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, eptrb, 0, RM8); |
1373 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
1374 | ecode = prev; | ecode = prev; |
1375 | flags = match_tail_recursed; | flags = 0; |
1376 | goto TAIL_RECURSE; | goto TAIL_RECURSE; |
1377 | } | } |
1378 | else /* OP_KETRMAX */ | else /* OP_KETRMAX */ |
1379 | { | { |
1380 | RMATCH(rrc, eptr, prev, offset_top, md, ims, eptrb, match_cbegroup); | RMATCH(eptr, prev, offset_top, md, ims, eptrb, match_cbegroup, RM9); |
1381 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
1382 | ecode += 1 + LINK_SIZE; | ecode += 1 + LINK_SIZE; |
1383 | flags = match_tail_recursed; | flags = 0; |
1384 | goto TAIL_RECURSE; | goto TAIL_RECURSE; |
1385 | } | } |
1386 | /* Control never gets here */ | /* Control never gets here */ |
# | Line 1065 for (;;) | Line 1392 for (;;) |
1392 | do ecode += GET(ecode,1); while (*ecode == OP_ALT); | do ecode += GET(ecode,1); while (*ecode == OP_ALT); |
1393 | break; | break; |
1394 | ||
1395 | /* BRAZERO and BRAMINZERO occur just before a bracket group, indicating | /* BRAZERO, BRAMINZERO and SKIPZERO occur just before a bracket group, |
1396 | that it may occur zero times. It may repeat infinitely, or not at all - | indicating that it may occur zero times. It may repeat infinitely, or not |
1397 | i.e. it could be ()* or ()? in the pattern. Brackets with fixed upper | at all - i.e. it could be ()* or ()? or even (){0} in the pattern. Brackets |
1398 | repeat limits are compiled as a number of copies, with the optional ones | with fixed upper repeat limits are compiled as a number of copies, with the |
1399 | preceded by BRAZERO or BRAMINZERO. */ | optional ones preceded by BRAZERO or BRAMINZERO. */ |
1400 | ||
1401 | case OP_BRAZERO: | case OP_BRAZERO: |
1402 | { | { |
1403 | next = ecode+1; | next = ecode+1; |
1404 | RMATCH(rrc, eptr, next, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, next, offset_top, md, ims, eptrb, 0, RM10); |
1405 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
1406 | do next += GET(next,1); while (*next == OP_ALT); | do next += GET(next,1); while (*next == OP_ALT); |
1407 | ecode = next + 1 + LINK_SIZE; | ecode = next + 1 + LINK_SIZE; |
# | Line 1085 for (;;) | Line 1412 for (;;) |
1412 | { | { |
1413 | next = ecode+1; | next = ecode+1; |
1414 | do next += GET(next, 1); while (*next == OP_ALT); | do next += GET(next, 1); while (*next == OP_ALT); |
1415 | RMATCH(rrc, eptr, next + 1+LINK_SIZE, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, next + 1+LINK_SIZE, offset_top, md, ims, eptrb, 0, RM11); |
1416 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
1417 | ecode++; | ecode++; |
1418 | } | } |
1419 | break; | break; |
1420 | ||
1421 | case OP_SKIPZERO: | |
1422 | { | |
1423 | next = ecode+1; | |
1424 | do next += GET(next,1); while (*next == OP_ALT); | |
1425 | ecode = next + 1 + LINK_SIZE; | |
1426 | } | |
1427 | break; | |
1428 | ||
1429 | /* End of a group, repeated or non-repeating. */ | /* End of a group, repeated or non-repeating. */ |
1430 | ||
1431 | case OP_KET: | case OP_KET: |
# | Line 1133 for (;;) | Line 1468 for (;;) |
1468 | number = GET2(prev, 1+LINK_SIZE); | number = GET2(prev, 1+LINK_SIZE); |
1469 | offset = number << 1; | offset = number << 1; |
1470 | ||
1471 | #ifdef DEBUG | #ifdef PCRE_DEBUG |
1472 | printf("end bracket %d", number); | printf("end bracket %d", number); |
1473 | printf("\n"); | printf("\n"); |
1474 | #endif | #endif |
# | Line 1155 for (;;) | Line 1490 for (;;) |
1490 | recursion_info *rec = md->recursive; | recursion_info *rec = md->recursive; |
1491 | DPRINTF(("Recursion (%d) succeeded - continuing\n", number)); | DPRINTF(("Recursion (%d) succeeded - continuing\n", number)); |
1492 | md->recursive = rec->prevrec; | md->recursive = rec->prevrec; |
1493 | md->start_match = rec->save_start; | mstart = rec->save_start; |
1494 | memcpy(md->offset_vector, rec->offset_save, | memcpy(md->offset_vector, rec->offset_save, |
1495 | rec->saved_max * sizeof(int)); | rec->saved_max * sizeof(int)); |
1496 | offset_top = rec->save_offset_top; | |
1497 | ecode = rec->after_call; | ecode = rec->after_call; |
1498 | ims = original_ims; | ims = original_ims; |
1499 | break; | break; |
# | Line 1184 for (;;) | Line 1520 for (;;) |
1520 | ||
1521 | /* The repeating kets try the rest of the pattern or restart from the | /* The repeating kets try the rest of the pattern or restart from the |
1522 | preceding bracket, in the appropriate order. In the second case, we can use | preceding bracket, in the appropriate order. In the second case, we can use |
1523 | tail recursion to avoid using another stack frame. */ | tail recursion to avoid using another stack frame, unless we have an |
1524 | unlimited repeat of a group that can match an empty string. */ | |
1525 | ||
1526 | flags = (*prev >= OP_SBRA)? match_cbegroup : 0; | flags = (*prev >= OP_SBRA)? match_cbegroup : 0; |
1527 | ||
1528 | if (*ecode == OP_KETRMIN) | if (*ecode == OP_KETRMIN) |
1529 | { | { |
1530 | RMATCH(rrc, eptr, ecode + 1+LINK_SIZE, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, eptrb, 0, RM12); |
1531 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
1532 | if (flags != 0) /* Could match an empty string */ | |
1533 | { | |
1534 | RMATCH(eptr, prev, offset_top, md, ims, eptrb, flags, RM50); | |
1535 | RRETURN(rrc); | |
1536 | } | |
1537 | ecode = prev; | ecode = prev; |
flags |= match_tail_recursed; | ||
1538 | goto TAIL_RECURSE; | goto TAIL_RECURSE; |
1539 | } | } |
1540 | else /* OP_KETRMAX */ | else /* OP_KETRMAX */ |
1541 | { | { |
1542 | RMATCH(rrc, eptr, prev, offset_top, md, ims, eptrb, flags); | RMATCH(eptr, prev, offset_top, md, ims, eptrb, flags, RM13); |
1543 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
1544 | ecode += 1 + LINK_SIZE; | ecode += 1 + LINK_SIZE; |
1545 | flags = match_tail_recursed; | flags = 0; |
1546 | goto TAIL_RECURSE; | goto TAIL_RECURSE; |
1547 | } | } |
1548 | /* Control never gets here */ | /* Control never gets here */ |
# | Line 1234 for (;;) | Line 1575 for (;;) |
1575 | ecode++; | ecode++; |
1576 | break; | break; |
1577 | ||
1578 | /* Reset the start of match point */ | |
1579 | ||
1580 | case OP_SET_SOM: | |
1581 | mstart = eptr; | |
1582 | ecode++; | |
1583 | break; | |
1584 | ||
1585 | /* Assert before internal newline if multiline, or before a terminating | /* Assert before internal newline if multiline, or before a terminating |
1586 | newline unless endonly is set, else end of subject unless noteol is set. */ | newline unless endonly is set, else end of subject unless noteol is set. */ |
1587 | ||
# | Line 1285 for (;;) | Line 1633 for (;;) |
1633 | ||
1634 | /* Find out if the previous and current characters are "word" characters. | /* Find out if the previous and current characters are "word" characters. |
1635 | It takes a bit more work in UTF-8 mode. Characters > 255 are assumed to | It takes a bit more work in UTF-8 mode. Characters > 255 are assumed to |
1636 | be "non-word" characters. */ | be "non-word" characters. Remember the earliest consulted character for |
1637 | partial matching. */ | |
1638 | ||
1639 | #ifdef SUPPORT_UTF8 | #ifdef SUPPORT_UTF8 |
1640 | if (utf8) | if (utf8) |
1641 | { | { |
1642 | if (eptr == md->start_subject) prev_is_word = FALSE; else | if (eptr == md->start_subject) prev_is_word = FALSE; else |
1643 | { | { |
1644 | const uschar *lastptr = eptr - 1; | USPTR lastptr = eptr - 1; |
1645 | while((*lastptr & 0xc0) == 0x80) lastptr--; | while((*lastptr & 0xc0) == 0x80) lastptr--; |
1646 | if (lastptr < md->start_used_ptr) md->start_used_ptr = lastptr; | |
1647 | GETCHAR(c, lastptr); | GETCHAR(c, lastptr); |
1648 | prev_is_word = c < 256 && (md->ctypes[c] & ctype_word) != 0; | prev_is_word = c < 256 && (md->ctypes[c] & ctype_word) != 0; |
1649 | } | } |
1650 | if (eptr >= md->end_subject) cur_is_word = FALSE; else | if (eptr >= md->end_subject) |
1651 | { | |
1652 | SCHECK_PARTIAL(); | |
1653 | cur_is_word = FALSE; | |
1654 | } | |
1655 | else | |
1656 | { | { |
1657 | GETCHAR(c, eptr); | GETCHAR(c, eptr); |
1658 | cur_is_word = c < 256 && (md->ctypes[c] & ctype_word) != 0; | cur_is_word = c < 256 && (md->ctypes[c] & ctype_word) != 0; |
# | Line 1306 for (;;) | Line 1661 for (;;) |
1661 | else | else |
1662 | #endif | #endif |
1663 | ||
1664 | /* More streamlined when not in UTF-8 mode */ | /* Not in UTF-8 mode */ |
1665 | ||
1666 | { | { |
1667 | prev_is_word = (eptr != md->start_subject) && | if (eptr == md->start_subject) prev_is_word = FALSE; else |
1668 | ((md->ctypes[eptr[-1]] & ctype_word) != 0); | { |
1669 | cur_is_word = (eptr < md->end_subject) && | if (eptr <= md->start_used_ptr) md->start_used_ptr = eptr - 1; |
1670 | ((md->ctypes[*eptr] & ctype_word) != 0); | prev_is_word = ((md->ctypes[eptr[-1]] & ctype_word) != 0); |
1671 | } | |
1672 | if (eptr >= md->end_subject) | |
1673 | { | |
1674 | SCHECK_PARTIAL(); | |
1675 | cur_is_word = FALSE; | |
1676 | } | |
1677 | else cur_is_word = ((md->ctypes[*eptr] & ctype_word) != 0); | |
1678 | } | } |
1679 | ||
1680 | /* Now see if the situation is what we want */ | /* Now see if the situation is what we want */ |
# | Line 1326 for (;;) | Line 1688 for (;;) |
1688 | /* Match a single character type; inline for speed */ | /* Match a single character type; inline for speed */ |
1689 | ||
1690 | case OP_ANY: | case OP_ANY: |
1691 | if ((ims & PCRE_DOTALL) == 0) | if (IS_NEWLINE(eptr)) RRETURN(MATCH_NOMATCH); |
1692 | /* Fall through */ | |
1693 | ||
1694 | case OP_ALLANY: | |
1695 | if (eptr++ >= md->end_subject) | |
1696 | { | { |
1697 | if (IS_NEWLINE(eptr)) RRETURN(MATCH_NOMATCH); | SCHECK_PARTIAL(); |
1698 | RRETURN(MATCH_NOMATCH); | |
1699 | } | } |
1700 | if (eptr++ >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (utf8) while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++; |
if (utf8) | ||
while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++; | ||
1701 | ecode++; | ecode++; |
1702 | break; | break; |
1703 | ||
# | Line 1340 for (;;) | Line 1705 for (;;) |
1705 | any byte, even newline, independent of the setting of PCRE_DOTALL. */ | any byte, even newline, independent of the setting of PCRE_DOTALL. */ |
1706 | ||
1707 | case OP_ANYBYTE: | case OP_ANYBYTE: |
1708 | if (eptr++ >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr++ >= md->end_subject) |
1709 | { | |
1710 | SCHECK_PARTIAL(); | |
1711 | RRETURN(MATCH_NOMATCH); | |
1712 | } | |
1713 | ecode++; | ecode++; |
1714 | break; | break; |
1715 | ||
1716 | case OP_NOT_DIGIT: | case OP_NOT_DIGIT: |
1717 | if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr >= md->end_subject) |
1718 | { | |
1719 | SCHECK_PARTIAL(); | |
1720 | RRETURN(MATCH_NOMATCH); | |
1721 | } | |
1722 | GETCHARINCTEST(c, eptr); | GETCHARINCTEST(c, eptr); |
1723 | if ( | if ( |
1724 | #ifdef SUPPORT_UTF8 | #ifdef SUPPORT_UTF8 |
# | Line 1358 for (;;) | Line 1731 for (;;) |
1731 | break; | break; |
1732 | ||
1733 | case OP_DIGIT: | case OP_DIGIT: |
1734 | if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr >= md->end_subject) |
1735 | { | |
1736 | SCHECK_PARTIAL(); | |
1737 | RRETURN(MATCH_NOMATCH); | |
1738 | } | |
1739 | GETCHARINCTEST(c, eptr); | GETCHARINCTEST(c, eptr); |
1740 | if ( | if ( |
1741 | #ifdef SUPPORT_UTF8 | #ifdef SUPPORT_UTF8 |
# | Line 1371 for (;;) | Line 1748 for (;;) |
1748 | break; | break; |
1749 | ||
1750 | case OP_NOT_WHITESPACE: | case OP_NOT_WHITESPACE: |
1751 | if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr >= md->end_subject) |
1752 | { | |
1753 | SCHECK_PARTIAL(); | |
1754 | RRETURN(MATCH_NOMATCH); | |
1755 | } | |
1756 | GETCHARINCTEST(c, eptr); | GETCHARINCTEST(c, eptr); |
1757 | if ( | if ( |
1758 | #ifdef SUPPORT_UTF8 | #ifdef SUPPORT_UTF8 |
# | Line 1384 for (;;) | Line 1765 for (;;) |
1765 | break; | break; |
1766 | ||
1767 | case OP_WHITESPACE: | case OP_WHITESPACE: |
1768 | if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr >= md->end_subject) |
1769 | { | |
1770 | SCHECK_PARTIAL(); | |
1771 | RRETURN(MATCH_NOMATCH); | |
1772 | } | |
1773 | GETCHARINCTEST(c, eptr); | GETCHARINCTEST(c, eptr); |
1774 | if ( | if ( |
1775 | #ifdef SUPPORT_UTF8 | #ifdef SUPPORT_UTF8 |
# | Line 1397 for (;;) | Line 1782 for (;;) |
1782 | break; | break; |
1783 | ||
1784 | case OP_NOT_WORDCHAR: | case OP_NOT_WORDCHAR: |
1785 | if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr >= md->end_subject) |
1786 | { | |
1787 | SCHECK_PARTIAL(); | |
1788 | RRETURN(MATCH_NOMATCH); | |
1789 | } | |
1790 | GETCHARINCTEST(c, eptr); | GETCHARINCTEST(c, eptr); |
1791 | if ( | if ( |
1792 | #ifdef SUPPORT_UTF8 | #ifdef SUPPORT_UTF8 |
# | Line 1410 for (;;) | Line 1799 for (;;) |
1799 | break; | break; |
1800 | ||
1801 | case OP_WORDCHAR: | case OP_WORDCHAR: |
1802 | if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr >= md->end_subject) |
1803 | { | |
1804 | SCHECK_PARTIAL(); | |
1805 | RRETURN(MATCH_NOMATCH); | |
1806 | } | |
1807 | GETCHARINCTEST(c, eptr); | GETCHARINCTEST(c, eptr); |
1808 | if ( | if ( |
1809 | #ifdef SUPPORT_UTF8 | #ifdef SUPPORT_UTF8 |
# | Line 1423 for (;;) | Line 1816 for (;;) |
1816 | break; | break; |
1817 | ||
1818 | case OP_ANYNL: | case OP_ANYNL: |
1819 | if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr >= md->end_subject) |
1820 | { | |
1821 | SCHECK_PARTIAL(); | |
1822 | RRETURN(MATCH_NOMATCH); | |
1823 | } | |
1824 | GETCHARINCTEST(c, eptr); | GETCHARINCTEST(c, eptr); |
1825 | switch(c) | switch(c) |
1826 | { | { |
# | Line 1431 for (;;) | Line 1828 for (;;) |
1828 | case 0x000d: | case 0x000d: |
1829 | if (eptr < md->end_subject && *eptr == 0x0a) eptr++; | if (eptr < md->end_subject && *eptr == 0x0a) eptr++; |
1830 | break; | break; |
1831 | ||
1832 | case 0x000a: | case 0x000a: |
1833 | break; | |
1834 | ||
1835 | case 0x000b: | case 0x000b: |
1836 | case 0x000c: | case 0x000c: |
1837 | case 0x0085: | case 0x0085: |
1838 | case 0x2028: | case 0x2028: |
1839 | case 0x2029: | case 0x2029: |
1840 | if (md->bsr_anycrlf) RRETURN(MATCH_NOMATCH); | |
1841 | break; | |
1842 | } | |
1843 | ecode++; | |
1844 | break; | |
1845 | ||
1846 | case OP_NOT_HSPACE: | |
1847 | if (eptr >= md->end_subject) | |
1848 | { | |
1849 | SCHECK_PARTIAL(); | |
1850 | RRETURN(MATCH_NOMATCH); | |
1851 | } | |
1852 | GETCHARINCTEST(c, eptr); | |
1853 | switch(c) | |
1854 | { | |
1855 | default: break; | |
1856 | case 0x09: /* HT */ | |
1857 | case 0x20: /* SPACE */ | |
1858 | case 0xa0: /* NBSP */ | |
1859 | case 0x1680: /* OGHAM SPACE MARK */ | |
1860 | case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */ | |
1861 | case 0x2000: /* EN QUAD */ | |
1862 | case 0x2001: /* EM QUAD */ | |
1863 | case 0x2002: /* EN SPACE */ | |
1864 | case 0x2003: /* EM SPACE */ | |
1865 | case 0x2004: /* THREE-PER-EM SPACE */ | |
1866 | case 0x2005: /* FOUR-PER-EM SPACE */ | |
1867 | case 0x2006: /* SIX-PER-EM SPACE */ | |
1868 | case 0x2007: /* FIGURE SPACE */ | |
1869 | case 0x2008: /* PUNCTUATION SPACE */ | |
1870 | case 0x2009: /* THIN SPACE */ | |
1871 | case 0x200A: /* HAIR SPACE */ | |
1872 | case 0x202f: /* NARROW NO-BREAK SPACE */ | |
1873 | case 0x205f: /* MEDIUM MATHEMATICAL SPACE */ | |
1874 | case 0x3000: /* IDEOGRAPHIC SPACE */ | |
1875 | RRETURN(MATCH_NOMATCH); | |
1876 | } | |
1877 | ecode++; | |
1878 | break; | |
1879 | ||
1880 | case OP_HSPACE: | |
1881 | if (eptr >= md->end_subject) | |
1882 | { | |
1883 | SCHECK_PARTIAL(); | |
1884 | RRETURN(MATCH_NOMATCH); | |
1885 | } | |
1886 | GETCHARINCTEST(c, eptr); | |
1887 | switch(c) | |
1888 | { | |
1889 | default: RRETURN(MATCH_NOMATCH); | |
1890 | case 0x09: /* HT */ | |
1891 | case 0x20: /* SPACE */ | |
1892 | case 0xa0: /* NBSP */ | |
1893 | case 0x1680: /* OGHAM SPACE MARK */ | |
1894 | case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */ | |
1895 | case 0x2000: /* EN QUAD */ | |
1896 | case 0x2001: /* EM QUAD */ | |
1897 | case 0x2002: /* EN SPACE */ | |
1898 | case 0x2003: /* EM SPACE */ | |
1899 | case 0x2004: /* THREE-PER-EM SPACE */ | |
1900 | case 0x2005: /* FOUR-PER-EM SPACE */ | |
1901 | case 0x2006: /* SIX-PER-EM SPACE */ | |
1902 | case 0x2007: /* FIGURE SPACE */ | |
1903 | case 0x2008: /* PUNCTUATION SPACE */ | |
1904 | case 0x2009: /* THIN SPACE */ | |
1905 | case 0x200A: /* HAIR SPACE */ | |
1906 | case 0x202f: /* NARROW NO-BREAK SPACE */ | |
1907 | case 0x205f: /* MEDIUM MATHEMATICAL SPACE */ | |
1908 | case 0x3000: /* IDEOGRAPHIC SPACE */ | |
1909 | break; | |
1910 | } | |
1911 | ecode++; | |
1912 | break; | |
1913 | ||
1914 | case OP_NOT_VSPACE: | |
1915 | if (eptr >= md->end_subject) | |
1916 | { | |
1917 | SCHECK_PARTIAL(); | |
1918 | RRETURN(MATCH_NOMATCH); | |
1919 | } | |
1920 | GETCHARINCTEST(c, eptr); | |
1921 | switch(c) | |
1922 | { | |
1923 | default: break; | |
1924 | case 0x0a: /* LF */ | |
1925 | case 0x0b: /* VT */ | |
1926 | case 0x0c: /* FF */ | |
1927 | case 0x0d: /* CR */ | |
1928 | case 0x85: /* NEL */ | |
1929 | case 0x2028: /* LINE SEPARATOR */ | |
1930 | case 0x2029: /* PARAGRAPH SEPARATOR */ | |
1931 | RRETURN(MATCH_NOMATCH); | |
1932 | } | |
1933 | ecode++; | |
1934 | break; | |
1935 | ||
1936 | case OP_VSPACE: | |
1937 | if (eptr >= md->end_subject) | |
1938 | { | |
1939 | SCHECK_PARTIAL(); | |
1940 | RRETURN(MATCH_NOMATCH); | |
1941 | } | |
1942 | GETCHARINCTEST(c, eptr); | |
1943 | switch(c) | |
1944 | { | |
1945 | default: RRETURN(MATCH_NOMATCH); | |
1946 | case 0x0a: /* LF */ | |
1947 | case 0x0b: /* VT */ | |
1948 | case 0x0c: /* FF */ | |
1949 | case 0x0d: /* CR */ | |
1950 | case 0x85: /* NEL */ | |
1951 | case 0x2028: /* LINE SEPARATOR */ | |
1952 | case 0x2029: /* PARAGRAPH SEPARATOR */ | |
1953 | break; | break; |
1954 | } | } |
1955 | ecode++; | ecode++; |
# | Line 1448 for (;;) | Line 1961 for (;;) |
1961 | ||
1962 | case OP_PROP: | case OP_PROP: |
1963 | case OP_NOTPROP: | case OP_NOTPROP: |
1964 | if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr >= md->end_subject) |
1965 | { | |
1966 | SCHECK_PARTIAL(); | |
1967 | RRETURN(MATCH_NOMATCH); | |
1968 | } | |
1969 | GETCHARINCTEST(c, eptr); | GETCHARINCTEST(c, eptr); |
1970 | { | { |
1971 | int chartype, script; | const ucd_record *prop = GET_UCD(c); |
int category = _pcre_ucp_findprop(c, &chartype, &script); | ||
1972 | ||
1973 | switch(ecode[1]) | switch(ecode[1]) |
1974 | { | { |
# | Line 1461 for (;;) | Line 1977 for (;;) |
1977 | break; | break; |
1978 | ||
1979 | case PT_LAMP: | case PT_LAMP: |
1980 | if ((chartype == ucp_Lu || | if ((prop->chartype == ucp_Lu || |
1981 | chartype == ucp_Ll || | prop->chartype == ucp_Ll || |
1982 | chartype == ucp_Lt) == (op == OP_NOTPROP)) | prop->chartype == ucp_Lt) == (op == OP_NOTPROP)) |
1983 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
1984 | break; | break; |
1985 | ||
1986 | case PT_GC: | case PT_GC: |
1987 | if ((ecode[2] != category) == (op == OP_PROP)) | if ((ecode[2] != _pcre_ucp_gentype[prop->chartype]) == (op == OP_PROP)) |
1988 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
1989 | break; | break; |
1990 | ||
1991 | case PT_PC: | case PT_PC: |
1992 | if ((ecode[2] != chartype) == (op == OP_PROP)) | if ((ecode[2] != prop->chartype) == (op == OP_PROP)) |
1993 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
1994 | break; | break; |
1995 | ||
1996 | case PT_SC: | case PT_SC: |
1997 | if ((ecode[2] != script) == (op == OP_PROP)) | if ((ecode[2] != prop->script) == (op == OP_PROP)) |
1998 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
1999 | break; | break; |
2000 | ||
# | Line 1494 for (;;) | Line 2010 for (;;) |
2010 | is in the binary; otherwise a compile-time error occurs. */ | is in the binary; otherwise a compile-time error occurs. */ |
2011 | ||
2012 | case OP_EXTUNI: | case OP_EXTUNI: |
2013 | if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr >= md->end_subject) |
2014 | { | |
2015 | SCHECK_PARTIAL(); | |
2016 | RRETURN(MATCH_NOMATCH); | |
2017 | } | |
2018 | GETCHARINCTEST(c, eptr); | GETCHARINCTEST(c, eptr); |
2019 | { | { |
2020 | int chartype, script; | int category = UCD_CATEGORY(c); |
int category = _pcre_ucp_findprop(c, &chartype, &script); | ||
2021 | if (category == ucp_M) RRETURN(MATCH_NOMATCH); | if (category == ucp_M) RRETURN(MATCH_NOMATCH); |
2022 | while (eptr < md->end_subject) | while (eptr < md->end_subject) |
2023 | { | { |
# | Line 1507 for (;;) | Line 2026 for (;;) |
2026 | { | { |
2027 | GETCHARLEN(c, eptr, len); | GETCHARLEN(c, eptr, len); |
2028 | } | } |
2029 | category = _pcre_ucp_findprop(c, &chartype, &script); | category = UCD_CATEGORY(c); |
2030 | if (category != ucp_M) break; | if (category != ucp_M) break; |
2031 | eptr += len; | eptr += len; |
2032 | } | } |
# | Line 1528 for (;;) | Line 2047 for (;;) |
2047 | case OP_REF: | case OP_REF: |
2048 | { | { |
2049 | offset = GET2(ecode, 1) << 1; /* Doubled ref number */ | offset = GET2(ecode, 1) << 1; /* Doubled ref number */ |
2050 | ecode += 3; /* Advance past item */ | ecode += 3; |
2051 | ||
2052 | /* If the reference is unset, there are two possibilities: | |
2053 | ||
2054 | (a) In the default, Perl-compatible state, set the length to be longer | |
2055 | than the amount of subject left; this ensures that every attempt at a | |
2056 | match fails. We can't just fail here, because of the possibility of | |
2057 | quantifiers with zero minima. | |
2058 | ||
2059 | (b) If the JavaScript compatibility flag is set, set the length to zero | |
2060 | so that the back reference matches an empty string. | |
2061 | ||
2062 | Otherwise, set the length to the length of what was matched by the | |
2063 | referenced subpattern. */ | |
2064 | ||
2065 | /* If the reference is unset, set the length to be longer than the amount | if (offset >= offset_top || md->offset_vector[offset] < 0) |
2066 | of subject left; this ensures that every attempt at a match fails. We | length = (md->jscript_compat)? 0 : md->end_subject - eptr + 1; |
2067 | can't just fail here, because of the possibility of quantifiers with zero | else |
2068 | minima. */ | length = md->offset_vector[offset+1] - md->offset_vector[offset]; |
length = (offset >= offset_top || md->offset_vector[offset] < 0)? | ||
md->end_subject - eptr + 1 : | ||
md->offset_vector[offset+1] - md->offset_vector[offset]; | ||
2069 | ||
2070 | /* Set up for repetition, or handle the non-repeated case */ | /* Set up for repetition, or handle the non-repeated case */ |
2071 | ||
# | Line 1566 for (;;) | Line 2094 for (;;) |
2094 | break; | break; |
2095 | ||
2096 | default: /* No repeat follows */ | default: /* No repeat follows */ |
2097 | if (!match_ref(offset, eptr, length, md, ims)) RRETURN(MATCH_NOMATCH); | if (!match_ref(offset, eptr, length, md, ims)) |
2098 | { | |
2099 | CHECK_PARTIAL(); | |
2100 | RRETURN(MATCH_NOMATCH); | |
2101 | } | |
2102 | eptr += length; | eptr += length; |
2103 | continue; /* With the main loop */ | continue; /* With the main loop */ |
2104 | } | } |
# | Line 1582 for (;;) | Line 2114 for (;;) |
2114 | ||
2115 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
2116 | { | { |
2117 | if (!match_ref(offset, eptr, length, md, ims)) RRETURN(MATCH_NOMATCH); | if (!match_ref(offset, eptr, length, md, ims)) |
2118 | { | |
2119 | CHECK_PARTIAL(); | |
2120 | RRETURN(MATCH_NOMATCH); | |
2121 | } | |
2122 | eptr += length; | eptr += length; |
2123 | } | } |
2124 | ||
# | Line 1597 for (;;) | Line 2133 for (;;) |
2133 | { | { |
2134 | for (fi = min;; fi++) | for (fi = min;; fi++) |
2135 | { | { |
2136 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM14); |
2137 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
2138 | if (fi >= max || !match_ref(offset, eptr, length, md, ims)) | if (fi >= max) RRETURN(MATCH_NOMATCH); |
2139 | if (!match_ref(offset, eptr, length, md, ims)) | |
2140 | { | |
2141 | CHECK_PARTIAL(); | |
2142 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
2143 | } | |
2144 | eptr += length; | eptr += length; |
2145 | } | } |
2146 | /* Control never gets here */ | /* Control never gets here */ |
# | Line 1613 for (;;) | Line 2153 for (;;) |
2153 | pp = eptr; | pp = eptr; |
2154 | for (i = min; i < max; i++) | for (i = min; i < max; i++) |
2155 | { | { |
2156 | if (!match_ref(offset, eptr, length, md, ims)) break; | if (!match_ref(offset, eptr, length, md, ims)) |
2157 | { | |
2158 | CHECK_PARTIAL(); | |
2159 | break; | |
2160 | } | |
2161 | eptr += length; | eptr += length; |
2162 | } | } |
2163 | while (eptr >= pp) | while (eptr >= pp) |
2164 | { | { |
2165 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM15); |
2166 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
2167 | eptr -= length; | eptr -= length; |
2168 | } | } |
# | Line 1627 for (;;) | Line 2171 for (;;) |
2171 | } | } |
2172 | /* Control never gets here */ | /* Control never gets here */ |
2173 | ||
2174 | /* Match a bit-mapped character class, possibly repeatedly. This op code is | /* Match a bit-mapped character class, possibly repeatedly. This op code is |
2175 | used when all the characters in the class have values in the range 0-255, | used when all the characters in the class have values in the range 0-255, |
2176 | and either the matching is caseful, or the characters are in the range | and either the matching is caseful, or the characters are in the range |
# | Line 1683 for (;;) | Line 2225 for (;;) |
2225 | { | { |
2226 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
2227 | { | { |
2228 | if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr >= md->end_subject) |
2229 | { | |
2230 | SCHECK_PARTIAL(); | |
2231 | RRETURN(MATCH_NOMATCH); | |
2232 | } | |
2233 | GETCHARINC(c, eptr); | GETCHARINC(c, eptr); |
2234 | if (c > 255) | if (c > 255) |
2235 | { | { |
# | Line 1701 for (;;) | Line 2247 for (;;) |
2247 | { | { |
2248 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
2249 | { | { |
2250 | if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr >= md->end_subject) |
2251 | { | |
2252 | SCHECK_PARTIAL(); | |
2253 | RRETURN(MATCH_NOMATCH); | |
2254 | } | |
2255 | c = *eptr++; | c = *eptr++; |
2256 | if ((data[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH); | if ((data[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH); |
2257 | } | } |
# | Line 1723 for (;;) | Line 2273 for (;;) |
2273 | { | { |
2274 | for (fi = min;; fi++) | for (fi = min;; fi++) |
2275 | { | { |
2276 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM16); |
2277 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
2278 | if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (fi >= max) RRETURN(MATCH_NOMATCH); |
2279 | if (eptr >= md->end_subject) | |
2280 | { | |
2281 | SCHECK_PARTIAL(); | |
2282 | RRETURN(MATCH_NOMATCH); | |
2283 | } | |
2284 | GETCHARINC(c, eptr); | GETCHARINC(c, eptr); |
2285 | if (c > 255) | if (c > 255) |
2286 | { | { |
# | Line 1743 for (;;) | Line 2298 for (;;) |
2298 | { | { |
2299 | for (fi = min;; fi++) | for (fi = min;; fi++) |
2300 | { | { |
2301 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM17); |
2302 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
2303 | if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (fi >= max) RRETURN(MATCH_NOMATCH); |
2304 | if (eptr >= md->end_subject) | |
2305 | { | |
2306 | SCHECK_PARTIAL(); | |
2307 | RRETURN(MATCH_NOMATCH); | |
2308 | } | |
2309 | c = *eptr++; | c = *eptr++; |
2310 | if ((data[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH); | if ((data[c/8] & (1 << (c&7))) == 0) RRETURN(MATCH_NOMATCH); |
2311 | } | } |
# | Line 1766 for (;;) | Line 2326 for (;;) |
2326 | for (i = min; i < max; i++) | for (i = min; i < max; i++) |
2327 | { | { |
2328 | int len = 1; | int len = 1; |
2329 | if (eptr >= md->end_subject) break; | if (eptr >= md->end_subject) |
2330 | { | |
2331 | SCHECK_PARTIAL(); | |
2332 | break; | |
2333 | } | |
2334 | GETCHARLEN(c, eptr, len); | GETCHARLEN(c, eptr, len); |
2335 | if (c > 255) | if (c > 255) |
2336 | { | { |
# | Line 1780 for (;;) | Line 2344 for (;;) |
2344 | } | } |
2345 | for (;;) | for (;;) |
2346 | { | { |
2347 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM18); |
2348 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
2349 | if (eptr-- == pp) break; /* Stop if tried at original pos */ | if (eptr-- == pp) break; /* Stop if tried at original pos */ |
2350 | BACKCHAR(eptr); | BACKCHAR(eptr); |
# | Line 1792 for (;;) | Line 2356 for (;;) |
2356 | { | { |
2357 | for (i = min; i < max; i++) | for (i = min; i < max; i++) |
2358 | { | { |
2359 | if (eptr >= md->end_subject) break; | if (eptr >= md->end_subject) |
2360 | { | |
2361 | SCHECK_PARTIAL(); | |
2362 | break; | |
2363 | } | |
2364 | c = *eptr; | c = *eptr; |
2365 | if ((data[c/8] & (1 << (c&7))) == 0) break; | if ((data[c/8] & (1 << (c&7))) == 0) break; |
2366 | eptr++; | eptr++; |
2367 | } | } |
2368 | while (eptr >= pp) | while (eptr >= pp) |
2369 | { | { |
2370 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM19); |
2371 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
2372 | eptr--; | eptr--; |
2373 | } | } |
# | Line 1812 for (;;) | Line 2380 for (;;) |
2380 | ||
2381 | ||
2382 | /* Match an extended character class. This opcode is encountered only | /* Match an extended character class. This opcode is encountered only |
2383 | in UTF-8 mode, because that's the only time it is compiled. */ | when UTF-8 mode mode is supported. Nevertheless, we may not be in UTF-8 |
2384 | mode, because Unicode properties are supported in non-UTF-8 mode. */ | |
2385 | ||
2386 | #ifdef SUPPORT_UTF8 | #ifdef SUPPORT_UTF8 |
2387 | case OP_XCLASS: | case OP_XCLASS: |
# | Line 1853 for (;;) | Line 2422 for (;;) |
2422 | ||
2423 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
2424 | { | { |
2425 | if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr >= md->end_subject) |
2426 | GETCHARINC(c, eptr); | { |
2427 | SCHECK_PARTIAL(); | |
2428 | RRETURN(MATCH_NOMATCH); | |
2429 | } | |
2430 | GETCHARINCTEST(c, eptr); | |
2431 | if (!_pcre_xclass(c, data)) RRETURN(MATCH_NOMATCH); | if (!_pcre_xclass(c, data)) RRETURN(MATCH_NOMATCH); |
2432 | } | } |
2433 | ||
# | Line 1870 for (;;) | Line 2443 for (;;) |
2443 | { | { |
2444 | for (fi = min;; fi++) | for (fi = min;; fi++) |
2445 | { | { |
2446 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM20); |
2447 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
2448 | if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (fi >= max) RRETURN(MATCH_NOMATCH); |
2449 | GETCHARINC(c, eptr); | if (eptr >= md->end_subject) |
2450 | { | |
2451 | SCHECK_PARTIAL(); | |
2452 | RRETURN(MATCH_NOMATCH); | |
2453 | } | |
2454 | GETCHARINCTEST(c, eptr); | |
2455 | if (!_pcre_xclass(c, data)) RRETURN(MATCH_NOMATCH); | if (!_pcre_xclass(c, data)) RRETURN(MATCH_NOMATCH); |
2456 | } | } |
2457 | /* Control never gets here */ | /* Control never gets here */ |
# | Line 1887 for (;;) | Line 2465 for (;;) |
2465 | for (i = min; i < max; i++) | for (i = min; i < max; i++) |
2466 | { | { |
2467 | int len = 1; | int len = 1; |
2468 | if (eptr >= md->end_subject) break; | if (eptr >= md->end_subject) |
2469 | GETCHARLEN(c, eptr, len); | { |
2470 | SCHECK_PARTIAL(); | |
2471 | break; | |
2472 | } | |
2473 | GETCHARLENTEST(c, eptr, len); | |
2474 | if (!_pcre_xclass(c, data)) break; | if (!_pcre_xclass(c, data)) break; |
2475 | eptr += len; | eptr += len; |
2476 | } | } |
2477 | for(;;) | for(;;) |
2478 | { | { |
2479 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM21); |
2480 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
2481 | if (eptr-- == pp) break; /* Stop if tried at original pos */ | if (eptr-- == pp) break; /* Stop if tried at original pos */ |
2482 | BACKCHAR(eptr) | if (utf8) BACKCHAR(eptr); |
2483 | } | } |
2484 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
2485 | } | } |
# | Line 1915 for (;;) | Line 2497 for (;;) |
2497 | length = 1; | length = 1; |
2498 | ecode++; | ecode++; |
2499 | GETCHARLEN(fc, ecode, length); | GETCHARLEN(fc, ecode, length); |
2500 | if (length > md->end_subject - eptr) RRETURN(MATCH_NOMATCH); | if (length > md->end_subject - eptr) |
2501 | { | |
2502 | CHECK_PARTIAL(); /* Not SCHECK_PARTIAL() */ | |
2503 | RRETURN(MATCH_NOMATCH); | |
2504 | } | |
2505 | while (length-- > 0) if (*ecode++ != *eptr++) RRETURN(MATCH_NOMATCH); | while (length-- > 0) if (*ecode++ != *eptr++) RRETURN(MATCH_NOMATCH); |
2506 | } | } |
2507 | else | else |
# | Line 1923 for (;;) | Line 2509 for (;;) |
2509 | ||
2510 | /* Non-UTF-8 mode */ | /* Non-UTF-8 mode */ |
2511 | { | { |
2512 | if (md->end_subject - eptr < 1) RRETURN(MATCH_NOMATCH); | if (md->end_subject - eptr < 1) |
2513 | { | |
2514 | SCHECK_PARTIAL(); /* This one can use SCHECK_PARTIAL() */ | |
2515 | RRETURN(MATCH_NOMATCH); | |
2516 | } | |
2517 | if (ecode[1] != *eptr++) RRETURN(MATCH_NOMATCH); | if (ecode[1] != *eptr++) RRETURN(MATCH_NOMATCH); |
2518 | ecode += 2; | ecode += 2; |
2519 | } | } |
# | Line 1939 for (;;) | Line 2529 for (;;) |
2529 | ecode++; | ecode++; |
2530 | GETCHARLEN(fc, ecode, length); | GETCHARLEN(fc, ecode, length); |
2531 | ||
2532 | if (length > md->end_subject - eptr) RRETURN(MATCH_NOMATCH); | if (length > md->end_subject - eptr) |
2533 | { | |
2534 | CHECK_PARTIAL(); /* Not SCHECK_PARTIAL() */ | |
2535 | RRETURN(MATCH_NOMATCH); | |
2536 | } | |
2537 | ||
2538 | /* If the pattern character's value is < 128, we have only one byte, and | /* If the pattern character's value is < 128, we have only one byte, and |
2539 | can use the fast lookup table. */ | can use the fast lookup table. */ |
# | Line 1963 for (;;) | Line 2557 for (;;) |
2557 | if (fc != dc) | if (fc != dc) |
2558 | { | { |
2559 | #ifdef SUPPORT_UCP | #ifdef SUPPORT_UCP |
2560 | if (dc != _pcre_ucp_othercase(fc)) | if (dc != UCD_OTHERCASE(fc)) |
2561 | #endif | #endif |
2562 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
2563 | } | } |
# | Line 1974 for (;;) | Line 2568 for (;;) |
2568 | ||
2569 | /* Non-UTF-8 mode */ | /* Non-UTF-8 mode */ |
2570 | { | { |
2571 | if (md->end_subject - eptr < 1) RRETURN(MATCH_NOMATCH); | if (md->end_subject - eptr < 1) |
2572 | { | |
2573 | SCHECK_PARTIAL(); /* This one can use SCHECK_PARTIAL() */ | |
2574 | RRETURN(MATCH_NOMATCH); | |
2575 | } | |
2576 | if (md->lcc[ecode[1]] != md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH); | if (md->lcc[ecode[1]] != md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH); |
2577 | ecode += 2; | ecode += 2; |
2578 | } | } |
# | Line 2028 for (;;) | Line 2626 for (;;) |
2626 | case OP_MINQUERY: | case OP_MINQUERY: |
2627 | c = *ecode++ - OP_STAR; | c = *ecode++ - OP_STAR; |
2628 | minimize = (c & 1) != 0; | minimize = (c & 1) != 0; |
2629 | ||
2630 | min = rep_min[c]; /* Pick up values from tables; */ | min = rep_min[c]; /* Pick up values from tables; */ |
2631 | max = rep_max[c]; /* zero for max => infinity */ | max = rep_max[c]; /* zero for max => infinity */ |
2632 | if (max == 0) max = INT_MAX; | if (max == 0) max = INT_MAX; |
2633 | ||
2634 | /* Common code for all repeated single-character matches. We can give | /* Common code for all repeated single-character matches. */ |
up quickly if there are fewer than the minimum number of characters left in | ||
the subject. */ | ||
2635 | ||
2636 | REPEATCHAR: | REPEATCHAR: |
2637 | #ifdef SUPPORT_UTF8 | #ifdef SUPPORT_UTF8 |
# | Line 2043 for (;;) | Line 2640 for (;;) |
2640 | length = 1; | length = 1; |
2641 | charptr = ecode; | charptr = ecode; |
2642 | GETCHARLEN(fc, ecode, length); | GETCHARLEN(fc, ecode, length); |
if (min * length > md->end_subject - eptr) RRETURN(MATCH_NOMATCH); | ||
2643 | ecode += length; | ecode += length; |
2644 | ||
2645 | /* Handle multibyte character matching specially here. There is | /* Handle multibyte character matching specially here. There is |
# | Line 2054 for (;;) | Line 2650 for (;;) |
2650 | #ifdef SUPPORT_UCP | #ifdef SUPPORT_UCP |
2651 | unsigned int othercase; | unsigned int othercase; |
2652 | if ((ims & PCRE_CASELESS) != 0 && | if ((ims & PCRE_CASELESS) != 0 && |
2653 | (othercase = _pcre_ucp_othercase(fc)) != NOTACHAR) | (othercase = UCD_OTHERCASE(fc)) != fc) |
2654 | oclength = _pcre_ord2utf8(othercase, occhars); | oclength = _pcre_ord2utf8(othercase, occhars); |
2655 | else oclength = 0; | else oclength = 0; |
2656 | #endif /* SUPPORT_UCP */ | #endif /* SUPPORT_UCP */ |
2657 | ||
2658 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
2659 | { | { |
2660 | if (memcmp(eptr, charptr, length) == 0) eptr += length; | if (eptr <= md->end_subject - length && |
2661 | memcmp(eptr, charptr, length) == 0) eptr += length; | |
2662 | #ifdef SUPPORT_UCP | #ifdef SUPPORT_UCP |
2663 | /* Need braces because of following else */ | else if (oclength > 0 && |
2664 | else if (oclength == 0) { RRETURN(MATCH_NOMATCH); } | eptr <= md->end_subject - oclength && |
2665 | memcmp(eptr, occhars, oclength) == 0) eptr += oclength; | |
2666 | #endif /* SUPPORT_UCP */ | |
2667 | else | else |
2668 | { | { |
2669 | if (memcmp(eptr, occhars, oclength) != 0) RRETURN(MATCH_NOMATCH); | CHECK_PARTIAL(); |
2670 | eptr += oclength; | RRETURN(MATCH_NOMATCH); |
2671 | } | } |
#else /* without SUPPORT_UCP */ | ||
else { RRETURN(MATCH_NOMATCH); } | ||
#endif /* SUPPORT_UCP */ | ||
2672 | } | } |
2673 | ||
2674 | if (min == max) continue; | if (min == max) continue; |
# | Line 2081 for (;;) | Line 2677 for (;;) |
2677 | { | { |
2678 | for (fi = min;; fi++) | for (fi = min;; fi++) |
2679 | { | { |
2680 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM22); |
2681 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
2682 | if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (fi >= max) RRETURN(MATCH_NOMATCH); |
2683 | if (memcmp(eptr, charptr, length) == 0) eptr += length; | if (eptr <= md->end_subject - length && |
2684 | memcmp(eptr, charptr, length) == 0) eptr += length; | |
2685 | #ifdef SUPPORT_UCP | #ifdef SUPPORT_UCP |
2686 | /* Need braces because of following else */ | else if (oclength > 0 && |
2687 | else if (oclength == 0) { RRETURN(MATCH_NOMATCH); } | eptr <= md->end_subject - oclength && |
2688 | memcmp(eptr, occhars, oclength) == 0) eptr += oclength; | |
2689 | #endif /* SUPPORT_UCP */ | |
2690 | else | else |
2691 | { | { |
2692 | if (memcmp(eptr, occhars, oclength) != 0) RRETURN(MATCH_NOMATCH); | CHECK_PARTIAL(); |
2693 | eptr += oclength; | RRETURN(MATCH_NOMATCH); |
2694 | } | } |
#else /* without SUPPORT_UCP */ | ||
else { RRETURN (MATCH_NOMATCH); } | ||
#endif /* SUPPORT_UCP */ | ||
2695 | } | } |
2696 | /* Control never gets here */ | /* Control never gets here */ |
2697 | } | } |
# | Line 2105 for (;;) | Line 2701 for (;;) |
2701 | pp = eptr; | pp = eptr; |
2702 | for (i = min; i < max; i++) | for (i = min; i < max; i++) |
2703 | { | { |
2704 | if (eptr > md->end_subject - length) break; | if (eptr <= md->end_subject - length && |
2705 | if (memcmp(eptr, charptr, length) == 0) eptr += length; | memcmp(eptr, charptr, length) == 0) eptr += length; |
2706 | #ifdef SUPPORT_UCP | #ifdef SUPPORT_UCP |
2707 | else if (oclength == 0) break; | else if (oclength > 0 && |
2708 | eptr <= md->end_subject - oclength && | |
2709 | memcmp(eptr, occhars, oclength) == 0) eptr += oclength; | |
2710 | #endif /* SUPPORT_UCP */ | |
2711 | else | else |
2712 | { | { |
2713 | if (memcmp(eptr, occhars, oclength) != 0) break; | CHECK_PARTIAL(); |
2714 | eptr += oclength; | break; |
2715 | } | } |
#else /* without SUPPORT_UCP */ | ||
else break; | ||
#endif /* SUPPORT_UCP */ | ||
2716 | } | } |
2717 | ||
2718 | if (possessive) continue; | if (possessive) continue; |
2719 | ||
2720 | for(;;) | for(;;) |
2721 | { | { |
2722 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM23); |
2723 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
2724 | if (eptr == pp) RRETURN(MATCH_NOMATCH); | if (eptr == pp) { RRETURN(MATCH_NOMATCH); } |
2725 | #ifdef SUPPORT_UCP | #ifdef SUPPORT_UCP |
2726 | eptr--; | eptr--; |
2727 | BACKCHAR(eptr); | BACKCHAR(eptr); |
2728 | #else /* without SUPPORT_UCP */ | #else /* without SUPPORT_UCP */ |
2729 | eptr -= length; | eptr -= length; |
2730 | #endif /* SUPPORT_UCP */ | #endif /* SUPPORT_UCP */ |
2731 | } | } |
2732 | } | } |
2733 | /* Control never gets here */ | /* Control never gets here */ |
2734 | } | } |
# | Line 2144 for (;;) | Line 2741 for (;;) |
2741 | #endif /* SUPPORT_UTF8 */ | #endif /* SUPPORT_UTF8 */ |
2742 | ||
2743 | /* When not in UTF-8 mode, load a single-byte character. */ | /* When not in UTF-8 mode, load a single-byte character. */ |
2744 | { | |
2745 | if (min > md->end_subject - eptr) RRETURN(MATCH_NOMATCH); | fc = *ecode++; |
fc = *ecode++; | ||
} | ||
2746 | ||
2747 | /* The value of fc at this point is always less than 256, though we may or | /* The value of fc at this point is always less than 256, though we may or |
2748 | may not be in UTF-8 mode. The code is duplicated for the caseless and | may not be in UTF-8 mode. The code is duplicated for the caseless and |
# | Line 2165 for (;;) | Line 2760 for (;;) |
2760 | { | { |
2761 | fc = md->lcc[fc]; | fc = md->lcc[fc]; |
2762 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
2763 | { | |
2764 | if (eptr >= md->end_subject) | |
2765 | { | |
2766 | SCHECK_PARTIAL(); | |
2767 | RRETURN(MATCH_NOMATCH); | |
2768 | } | |
2769 | if (fc != md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH); | if (fc != md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH); |
2770 | } | |
2771 | if (min == max) continue; | if (min == max) continue; |
2772 | if (minimize) | if (minimize) |
2773 | { | { |
2774 | for (fi = min;; fi++) | for (fi = min;; fi++) |
2775 | { | { |
2776 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM24); |
2777 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
2778 | if (fi >= max || eptr >= md->end_subject || | if (fi >= max) RRETURN(MATCH_NOMATCH); |
2779 | fc != md->lcc[*eptr++]) | if (eptr >= md->end_subject) |
2780 | { | |
2781 | SCHECK_PARTIAL(); | |
2782 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
2783 | } | |
2784 | if (fc != md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH); | |
2785 | } | } |
2786 | /* Control never gets here */ | /* Control never gets here */ |
2787 | } | } |
# | Line 2184 for (;;) | Line 2790 for (;;) |
2790 | pp = eptr; | pp = eptr; |
2791 | for (i = min; i < max; i++) | for (i = min; i < max; i++) |
2792 | { | { |
2793 | if (eptr >= md->end_subject || fc != md->lcc[*eptr]) break; | if (eptr >= md->end_subject) |
2794 | { | |
2795 | SCHECK_PARTIAL(); | |
2796 | break; | |
2797 | } | |
2798 | if (fc != md->lcc[*eptr]) break; | |
2799 | eptr++; | eptr++; |
2800 | } | } |
2801 | ||
2802 | if (possessive) continue; | if (possessive) continue; |
2803 | ||
2804 | while (eptr >= pp) | while (eptr >= pp) |
2805 | { | { |
2806 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM25); |
2807 | eptr--; | eptr--; |
2808 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
2809 | } | } |
# | Line 2203 for (;;) | Line 2816 for (;;) |
2816 | ||
2817 | else | else |
2818 | { | { |
2819 | for (i = 1; i <= min; i++) if (fc != *eptr++) RRETURN(MATCH_NOMATCH); | for (i = 1; i <= min; i++) |
2820 | { | |
2821 | if (eptr >= md->end_subject) | |
2822 | { | |
2823 | SCHECK_PARTIAL(); | |
2824 | RRETURN(MATCH_NOMATCH); | |
2825 | } | |
2826 | if (fc != *eptr++) RRETURN(MATCH_NOMATCH); | |
2827 | } | |
2828 | ||
2829 | if (min == max) continue; | if (min == max) continue; |
2830 | ||
2831 | if (minimize) | if (minimize) |
2832 | { | { |
2833 | for (fi = min;; fi++) | for (fi = min;; fi++) |
2834 | { | { |
2835 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM26); |
2836 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
2837 | if (fi >= max || eptr >= md->end_subject || fc != *eptr++) | if (fi >= max) RRETURN(MATCH_NOMATCH); |
2838 | if (eptr >= md->end_subject) | |
2839 | { | |
2840 | SCHECK_PARTIAL(); | |
2841 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
2842 | } | |
2843 | if (fc != *eptr++) RRETURN(MATCH_NOMATCH); | |
2844 | } | } |
2845 | /* Control never gets here */ | /* Control never gets here */ |
2846 | } | } |
# | Line 2221 for (;;) | Line 2849 for (;;) |
2849 | pp = eptr; | pp = eptr; |
2850 | for (i = min; i < max; i++) | for (i = min; i < max; i++) |
2851 | { | { |
2852 | if (eptr >= md->end_subject || fc != *eptr) break; | if (eptr >= md->end_subject) |
2853 | { | |
2854 | SCHECK_PARTIAL(); | |
2855 | break; | |
2856 | } | |
2857 | if (fc != *eptr) break; | |
2858 | eptr++; | eptr++; |
2859 | } | } |
2860 | if (possessive) continue; | if (possessive) continue; |
2861 | ||
2862 | while (eptr >= pp) | while (eptr >= pp) |
2863 | { | { |
2864 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM27); |
2865 | eptr--; | eptr--; |
2866 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
2867 | } | } |
# | Line 2240 for (;;) | Line 2874 for (;;) |
2874 | checking can be multibyte. */ | checking can be multibyte. */ |
2875 | ||
2876 | case OP_NOT: | case OP_NOT: |
2877 | if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr >= md->end_subject) |
2878 | { | |
2879 | SCHECK_PARTIAL(); | |
2880 | RRETURN(MATCH_NOMATCH); | |
2881 | } | |
2882 | ecode++; | ecode++; |
2883 | GETCHARINCTEST(c, eptr); | GETCHARINCTEST(c, eptr); |
2884 | if ((ims & PCRE_CASELESS) != 0) | if ((ims & PCRE_CASELESS) != 0) |
# | Line 2317 for (;;) | Line 2955 for (;;) |
2955 | max = rep_max[c]; /* zero for max => infinity */ | max = rep_max[c]; /* zero for max => infinity */ |
2956 | if (max == 0) max = INT_MAX; | if (max == 0) max = INT_MAX; |
2957 | ||
2958 | /* Common code for all repeated single-byte matches. We can give up quickly | /* Common code for all repeated single-byte matches. */ |
if there are fewer than the minimum number of bytes left in the | ||
subject. */ | ||
2959 | ||
2960 | REPEATNOTCHAR: | REPEATNOTCHAR: |
if (min > md->end_subject - eptr) RRETURN(MATCH_NOMATCH); | ||
2961 | fc = *ecode++; | fc = *ecode++; |
2962 | ||
2963 | /* The code is duplicated for the caseless and caseful cases, for speed, | /* The code is duplicated for the caseless and caseful cases, for speed, |
# | Line 2347 for (;;) | Line 2982 for (;;) |
2982 | register unsigned int d; | register unsigned int d; |
2983 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
2984 | { | { |
2985 | if (eptr >= md->end_subject) | |
2986 | { | |
2987 | SCHECK_PARTIAL(); | |
2988 | RRETURN(MATCH_NOMATCH); | |
2989 | } | |
2990 | GETCHARINC(d, eptr); | GETCHARINC(d, eptr); |
2991 | if (d < 256) d = md->lcc[d]; | if (d < 256) d = md->lcc[d]; |
2992 | if (fc == d) RRETURN(MATCH_NOMATCH); | if (fc == d) RRETURN(MATCH_NOMATCH); |
# | Line 2358 for (;;) | Line 2998 for (;;) |
2998 | /* Not UTF-8 mode */ | /* Not UTF-8 mode */ |
2999 | { | { |
3000 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3001 | { | |
3002 | if (eptr >= md->end_subject) | |
3003 | { | |
3004 | SCHECK_PARTIAL(); | |
3005 | RRETURN(MATCH_NOMATCH); | |
3006 | } | |
3007 | if (fc == md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH); | if (fc == md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH); |
3008 | } | |
3009 | } | } |
3010 | ||
3011 | if (min == max) continue; | if (min == max) continue; |
# | Line 2372 for (;;) | Line 3019 for (;;) |
3019 | register unsigned int d; | register unsigned int d; |
3020 | for (fi = min;; fi++) | for (fi = min;; fi++) |
3021 | { | { |
3022 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM28); |
3023 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
3024 | if (fi >= max) RRETURN(MATCH_NOMATCH); | |
3025 | if (eptr >= md->end_subject) | |
3026 | { | |
3027 | SCHECK_PARTIAL(); | |
3028 | RRETURN(MATCH_NOMATCH); | |
3029 | } | |
3030 | GETCHARINC(d, eptr); | GETCHARINC(d, eptr); |
3031 | if (d < 256) d = md->lcc[d]; | if (d < 256) d = md->lcc[d]; |
3032 | if (fi >= max || eptr >= md->end_subject || fc == d) | if (fc == d) RRETURN(MATCH_NOMATCH); |
RRETURN(MATCH_NOMATCH); | ||
3033 | } | } |
3034 | } | } |
3035 | else | else |
# | Line 2386 for (;;) | Line 3038 for (;;) |
3038 | { | { |
3039 | for (fi = min;; fi++) | for (fi = min;; fi++) |
3040 | { | { |
3041 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM29); |
3042 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
3043 | if (fi >= max || eptr >= md->end_subject || fc == md->lcc[*eptr++]) | if (fi >= max) RRETURN(MATCH_NOMATCH); |
3044 | if (eptr >= md->end_subject) | |
3045 | { | |
3046 | SCHECK_PARTIAL(); | |
3047 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
3048 | } | |
3049 | if (fc == md->lcc[*eptr++]) RRETURN(MATCH_NOMATCH); | |
3050 | } | } |
3051 | } | } |
3052 | /* Control never gets here */ | /* Control never gets here */ |
# | Line 2409 for (;;) | Line 3066 for (;;) |
3066 | for (i = min; i < max; i++) | for (i = min; i < max; i++) |
3067 | { | { |
3068 | int len = 1; | int len = 1; |
3069 | if (eptr >= md->end_subject) break; | if (eptr >= md->end_subject) |
3070 | { | |
3071 | SCHECK_PARTIAL(); | |
3072 | break; | |
3073 | } | |
3074 | GETCHARLEN(d, eptr, len); | GETCHARLEN(d, eptr, len); |
3075 | if (d < 256) d = md->lcc[d]; | if (d < 256) d = md->lcc[d]; |
3076 | if (fc == d) break; | if (fc == d) break; |
# | Line 2418 for (;;) | Line 3079 for (;;) |
3079 | if (possessive) continue; | if (possessive) continue; |
3080 | for(;;) | for(;;) |
3081 | { | { |
3082 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM30); |
3083 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
3084 | if (eptr-- == pp) break; /* Stop if tried at original pos */ | if (eptr-- == pp) break; /* Stop if tried at original pos */ |
3085 | BACKCHAR(eptr); | BACKCHAR(eptr); |
# | Line 2430 for (;;) | Line 3091 for (;;) |
3091 | { | { |
3092 | for (i = min; i < max; i++) | for (i = min; i < max; i++) |
3093 | { | { |
3094 | if (eptr >= md->end_subject || fc == md->lcc[*eptr]) break; | if (eptr >= md->end_subject) |
3095 | { | |
3096 | SCHECK_PARTIAL(); | |
3097 | break; | |
3098 | } | |
3099 | if (fc == md->lcc[*eptr]) break; | |
3100 | eptr++; | eptr++; |
3101 | } | } |
3102 | if (possessive) continue; | if (possessive) continue; |
3103 | while (eptr >= pp) | while (eptr >= pp) |
3104 | { | { |
3105 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM31); |
3106 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
3107 | eptr--; | eptr--; |
3108 | } | } |
# | Line 2458 for (;;) | Line 3124 for (;;) |
3124 | register unsigned int d; | register unsigned int d; |
3125 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3126 | { | { |
3127 | if (eptr >= md->end_subject) | |
3128 | { | |
3129 | SCHECK_PARTIAL(); | |
3130 | RRETURN(MATCH_NOMATCH); | |
3131 | } | |
3132 | GETCHARINC(d, eptr); | GETCHARINC(d, eptr); |
3133 | if (fc == d) RRETURN(MATCH_NOMATCH); | if (fc == d) RRETURN(MATCH_NOMATCH); |
3134 | } | } |
# | Line 2467 for (;;) | Line 3138 for (;;) |
3138 | /* Not UTF-8 mode */ | /* Not UTF-8 mode */ |
3139 | { | { |
3140 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3141 | { | |
3142 | if (eptr >= md->end_subject) | |
3143 | { | |
3144 | SCHECK_PARTIAL(); | |
3145 | RRETURN(MATCH_NOMATCH); | |
3146 | } | |
3147 | if (fc == *eptr++) RRETURN(MATCH_NOMATCH); | if (fc == *eptr++) RRETURN(MATCH_NOMATCH); |
3148 | } | |
3149 | } | } |
3150 | ||
3151 | if (min == max) continue; | if (min == max) continue; |
# | Line 2481 for (;;) | Line 3159 for (;;) |
3159 | register unsigned int d; | register unsigned int d; |
3160 | for (fi = min;; fi++) | for (fi = min;; fi++) |
3161 | { | { |
3162 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM32); |
3163 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
3164 | GETCHARINC(d, eptr); | if (fi >= max) RRETURN(MATCH_NOMATCH); |
3165 | if (fi >= max || eptr >= md->end_subject || fc == d) | if (eptr >= md->end_subject) |
3166 | { | |
3167 | SCHECK_PARTIAL(); | |
3168 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
3169 | } | |
3170 | GETCHARINC(d, eptr); | |
3171 | if (fc == d) RRETURN(MATCH_NOMATCH); | |
3172 | } | } |
3173 | } | } |
3174 | else | else |
# | Line 2494 for (;;) | Line 3177 for (;;) |
3177 | { | { |
3178 | for (fi = min;; fi++) | for (fi = min;; fi++) |
3179 | { | { |
3180 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM33); |
3181 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
3182 | if (fi >= max || eptr >= md->end_subject || fc == *eptr++) | if (fi >= max) RRETURN(MATCH_NOMATCH); |
3183 | if (eptr >= md->end_subject) | |
3184 | { | |
3185 | SCHECK_PARTIAL(); | |
3186 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
3187 | } | |
3188 | if (fc == *eptr++) RRETURN(MATCH_NOMATCH); | |
3189 | } | } |
3190 | } | } |
3191 | /* Control never gets here */ | /* Control never gets here */ |
# | Line 2517 for (;;) | Line 3205 for (;;) |
3205 | for (i = min; i < max; i++) | for (i = min; i < max; i++) |
3206 | { | { |
3207 | int len = 1; | int len = 1; |
3208 | if (eptr >= md->end_subject) break; | if (eptr >= md->end_subject) |
3209 | { | |
3210 | SCHECK_PARTIAL(); | |
3211 | break; | |
3212 | } | |
3213 | GETCHARLEN(d, eptr, len); | GETCHARLEN(d, eptr, len); |
3214 | if (fc == d) break; | if (fc == d) break; |
3215 | eptr += len; | eptr += len; |
# | Line 2525 for (;;) | Line 3217 for (;;) |
3217 | if (possessive) continue; | if (possessive) continue; |
3218 | for(;;) | for(;;) |
3219 | { | { |
3220 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM34); |
3221 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
3222 | if (eptr-- == pp) break; /* Stop if tried at original pos */ | if (eptr-- == pp) break; /* Stop if tried at original pos */ |
3223 | BACKCHAR(eptr); | BACKCHAR(eptr); |
# | Line 2537 for (;;) | Line 3229 for (;;) |
3229 | { | { |
3230 | for (i = min; i < max; i++) | for (i = min; i < max; i++) |
3231 | { | { |
3232 | if (eptr >= md->end_subject || fc == *eptr) break; | if (eptr >= md->end_subject) |
3233 | { | |
3234 | SCHECK_PARTIAL(); | |
3235 | break; | |
3236 | } | |
3237 | if (fc == *eptr) break; | |
3238 | eptr++; | eptr++; |
3239 | } | } |
3240 | if (possessive) continue; | if (possessive) continue; |
3241 | while (eptr >= pp) | while (eptr >= pp) |
3242 | { | { |
3243 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM35); |
3244 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
3245 | eptr--; | eptr--; |
3246 | } | } |
# | Line 2631 for (;;) | Line 3328 for (;;) |
3328 | ||
3329 | /* First, ensure the minimum number of matches are present. Use inline | /* First, ensure the minimum number of matches are present. Use inline |
3330 | code for maximizing the speed, and do the type test once at the start | code for maximizing the speed, and do the type test once at the start |
3331 | (i.e. keep it out of the loop). Also we can test that there are at least | (i.e. keep it out of the loop). Separate the UTF-8 code completely as that |
the minimum number of bytes before we start. This isn't as effective in | ||
UTF-8 mode, but it does no harm. Separate the UTF-8 code completely as that | ||
3332 | is tidier. Also separate the UCP code, which can be the same for both UTF-8 | is tidier. Also separate the UCP code, which can be the same for both UTF-8 |
3333 | and single-bytes. */ | and single-bytes. */ |
3334 | ||
if (min > md->end_subject - eptr) RRETURN(MATCH_NOMATCH); | ||
3335 | if (min > 0) | if (min > 0) |
3336 | { | { |
3337 | #ifdef SUPPORT_UCP | #ifdef SUPPORT_UCP |
# | Line 2649 for (;;) | Line 3343 for (;;) |
3343 | if (prop_fail_result) RRETURN(MATCH_NOMATCH); | if (prop_fail_result) RRETURN(MATCH_NOMATCH); |
3344 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3345 | { | { |
3346 | if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr >= md->end_subject) |
3347 | GETCHARINC(c, eptr); | { |
3348 | SCHECK_PARTIAL(); | |
3349 | RRETURN(MATCH_NOMATCH); | |
3350 | } | |
3351 | GETCHARINCTEST(c, eptr); | |
3352 | } | } |
3353 | break; | break; |
3354 | ||
3355 | case PT_LAMP: | case PT_LAMP: |
3356 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3357 | { | { |
3358 | if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr >= md->end_subject) |
3359 | GETCHARINC(c, eptr); | { |
3360 | prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script); | SCHECK_PARTIAL(); |
3361 | RRETURN(MATCH_NOMATCH); | |
3362 | } | |
3363 | GETCHARINCTEST(c, eptr); | |
3364 | prop_chartype = UCD_CHARTYPE(c); | |
3365 | if ((prop_chartype == ucp_Lu || | if ((prop_chartype == ucp_Lu || |
3366 | prop_chartype == ucp_Ll || | prop_chartype == ucp_Ll || |
3367 | prop_chartype == ucp_Lt) == prop_fail_result) | prop_chartype == ucp_Lt) == prop_fail_result) |
# | Line 2670 for (;;) | Line 3372 for (;;) |
3372 | case PT_GC: | case PT_GC: |
3373 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3374 | { | { |
3375 | if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr >= md->end_subject) |
3376 | GETCHARINC(c, eptr); | { |
3377 | prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script); | SCHECK_PARTIAL(); |
3378 | RRETURN(MATCH_NOMATCH); | |
3379 | } | |
3380 | GETCHARINCTEST(c, eptr); | |
3381 | prop_category = UCD_CATEGORY(c); | |
3382 | if ((prop_category == prop_value) == prop_fail_result) | if ((prop_category == prop_value) == prop_fail_result) |
3383 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
3384 | } | } |
# | Line 2681 for (;;) | Line 3387 for (;;) |
3387 | case PT_PC: | case PT_PC: |
3388 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3389 | { | { |
3390 | if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr >= md->end_subject) |
3391 | GETCHARINC(c, eptr); | { |
3392 | prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script); | SCHECK_PARTIAL(); |
3393 | RRETURN(MATCH_NOMATCH); | |
3394 | } | |
3395 | GETCHARINCTEST(c, eptr); | |
3396 | prop_chartype = UCD_CHARTYPE(c); | |
3397 | if ((prop_chartype == prop_value) == prop_fail_result) | if ((prop_chartype == prop_value) == prop_fail_result) |
3398 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
3399 | } | } |
# | Line 2692 for (;;) | Line 3402 for (;;) |
3402 | case PT_SC: | case PT_SC: |
3403 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3404 | { | { |
3405 | if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr >= md->end_subject) |
3406 | GETCHARINC(c, eptr); | { |
3407 | prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script); | SCHECK_PARTIAL(); |
3408 | RRETURN(MATCH_NOMATCH); | |
3409 | } | |
3410 | GETCHARINCTEST(c, eptr); | |
3411 | prop_script = UCD_SCRIPT(c); | |
3412 | if ((prop_script == prop_value) == prop_fail_result) | if ((prop_script == prop_value) == prop_fail_result) |
3413 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
3414 | } | } |
# | Line 2712 for (;;) | Line 3426 for (;;) |
3426 | { | { |
3427 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3428 | { | { |
3429 | if (eptr >= md->end_subject) | |
3430 | { | |
3431 | SCHECK_PARTIAL(); | |
3432 | RRETURN(MATCH_NOMATCH); | |
3433 | } | |
3434 | GETCHARINCTEST(c, eptr); | GETCHARINCTEST(c, eptr); |
3435 | prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script); | prop_category = UCD_CATEGORY(c); |
3436 | if (prop_category == ucp_M) RRETURN(MATCH_NOMATCH); | if (prop_category == ucp_M) RRETURN(MATCH_NOMATCH); |
3437 | while (eptr < md->end_subject) | while (eptr < md->end_subject) |
3438 | { | { |
3439 | int len = 1; | int len = 1; |
3440 | if (!utf8) c = *eptr; else | if (!utf8) c = *eptr; |
3441 | { | else { GETCHARLEN(c, eptr, len); } |
3442 | GETCHARLEN(c, eptr, len); | prop_category = UCD_CATEGORY(c); |
} | ||
prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script); | ||
3443 | if (prop_category != ucp_M) break; | if (prop_category != ucp_M) break; |
3444 | eptr += len; | eptr += len; |
3445 | } | } |
# | Line 2740 for (;;) | Line 3457 for (;;) |
3457 | case OP_ANY: | case OP_ANY: |
3458 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3459 | { | { |
3460 | if (eptr >= md->end_subject || | if (eptr >= md->end_subject) |
3461 | ((ims & PCRE_DOTALL) == 0 && IS_NEWLINE(eptr))) | { |
3462 | SCHECK_PARTIAL(); | |
3463 | RRETURN(MATCH_NOMATCH); | |
3464 | } | |
3465 | if (IS_NEWLINE(eptr)) RRETURN(MATCH_NOMATCH); | |
3466 | eptr++; | |
3467 | while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++; | |
3468 | } | |
3469 | break; | |
3470 | ||
3471 | case OP_ALLANY: | |
3472 | for (i = 1; i <= min; i++) | |
3473 | { | |
3474 | if (eptr >= md->end_subject) | |
3475 | { | |
3476 | SCHECK_PARTIAL(); | |
3477 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
3478 | } | |
3479 | eptr++; | eptr++; |
3480 | while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++; | while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++; |
3481 | } | } |
3482 | break; | break; |
3483 | ||
3484 | case OP_ANYBYTE: | case OP_ANYBYTE: |
3485 | if (eptr > md->end_subject - min) RRETURN(MATCH_NOMATCH); | |
3486 | eptr += min; | eptr += min; |
3487 | break; | break; |
3488 | ||
3489 | case OP_ANYNL: | case OP_ANYNL: |
3490 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3491 | { | { |
3492 | if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr >= md->end_subject) |
3493 | { | |
3494 | SCHECK_PARTIAL(); | |
3495 | RRETURN(MATCH_NOMATCH); | |
3496 | } | |
3497 | GETCHARINC(c, eptr); | GETCHARINC(c, eptr); |
3498 | switch(c) | switch(c) |
3499 | { | { |
# | Line 2763 for (;;) | Line 3501 for (;;) |
3501 | case 0x000d: | case 0x000d: |
3502 | if (eptr < md->end_subject && *eptr == 0x0a) eptr++; | if (eptr < md->end_subject && *eptr == 0x0a) eptr++; |
3503 | break; | break; |
3504 | ||
3505 | case 0x000a: | case 0x000a: |
3506 | break; | |
3507 | ||
3508 | case 0x000b: | case 0x000b: |
3509 | case 0x000c: | case 0x000c: |
3510 | case 0x0085: | case 0x0085: |
3511 | case 0x2028: | case 0x2028: |
3512 | case 0x2029: | case 0x2029: |
3513 | if (md->bsr_anycrlf) RRETURN(MATCH_NOMATCH); | |
3514 | break; | break; |
3515 | } | } |
3516 | } | } |
3517 | break; | break; |
3518 | ||
3519 | case OP_NOT_DIGIT: | case OP_NOT_HSPACE: |
3520 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3521 | { | { |
3522 | if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr >= md->end_subject) |
3523 | { | |
3524 | SCHECK_PARTIAL(); | |
3525 | RRETURN(MATCH_NOMATCH); | |
3526 | } | |
3527 | GETCHARINC(c, eptr); | GETCHARINC(c, eptr); |
3528 | if (c < 128 && (md->ctypes[c] & ctype_digit) != 0) | switch(c) |
3529 | { | |
3530 | default: break; | |
3531 | case 0x09: /* HT */ | |
3532 | case 0x20: /* SPACE */ | |
3533 | case 0xa0: /* NBSP */ | |
3534 | case 0x1680: /* OGHAM SPACE MARK */ | |
3535 | case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */ | |
3536 | case 0x2000: /* EN QUAD */ | |
3537 | case 0x2001: /* EM QUAD */ | |
3538 | case 0x2002: /* EN SPACE */ | |
3539 | case 0x2003: /* EM SPACE */ | |
3540 | case 0x2004: /* THREE-PER-EM SPACE */ | |
3541 | case 0x2005: /* FOUR-PER-EM SPACE */ | |
3542 | case 0x2006: /* SIX-PER-EM SPACE */ | |
3543 | case 0x2007: /* FIGURE SPACE */ | |
3544 | case 0x2008: /* PUNCTUATION SPACE */ | |
3545 | case 0x2009: /* THIN SPACE */ | |
3546 | case 0x200A: /* HAIR SPACE */ | |
3547 | case 0x202f: /* NARROW NO-BREAK SPACE */ | |
3548 | case 0x205f: /* MEDIUM MATHEMATICAL SPACE */ | |
3549 | case 0x3000: /* IDEOGRAPHIC SPACE */ | |
3550 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
3551 | } | |
3552 | } | } |
3553 | break; | break; |
3554 | ||
3555 | case OP_DIGIT: | case OP_HSPACE: |
3556 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3557 | { | { |
3558 | if (eptr >= md->end_subject || | if (eptr >= md->end_subject) |
3559 | *eptr >= 128 || (md->ctypes[*eptr++] & ctype_digit) == 0) | { |
3560 | SCHECK_PARTIAL(); | |
3561 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
3562 | /* No need to skip more bytes - we know it's a 1-byte character */ | } |
3563 | GETCHARINC(c, eptr); | |
3564 | switch(c) | |
3565 | { | |
3566 | default: RRETURN(MATCH_NOMATCH); | |
3567 | case 0x09: /* HT */ | |
3568 | case 0x20: /* SPACE */ | |
3569 | case 0xa0: /* NBSP */ | |
3570 | case 0x1680: /* OGHAM SPACE MARK */ | |
3571 | case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */ | |
3572 | case 0x2000: /* EN QUAD */ | |
3573 | case 0x2001: /* EM QUAD */ | |
3574 | case 0x2002: /* EN SPACE */ | |
3575 | case 0x2003: /* EM SPACE */ | |
3576 | case 0x2004: /* THREE-PER-EM SPACE */ | |
3577 | case 0x2005: /* FOUR-PER-EM SPACE */ | |
3578 | case 0x2006: /* SIX-PER-EM SPACE */ | |
3579 | case 0x2007: /* FIGURE SPACE */ | |
3580 | case 0x2008: /* PUNCTUATION SPACE */ | |
3581 | case 0x2009: /* THIN SPACE */ | |
3582 | case 0x200A: /* HAIR SPACE */ | |
3583 | case 0x202f: /* NARROW NO-BREAK SPACE */ | |
3584 | case 0x205f: /* MEDIUM MATHEMATICAL SPACE */ | |
3585 | case 0x3000: /* IDEOGRAPHIC SPACE */ | |
3586 | break; | |
3587 | } | |
3588 | } | } |
3589 | break; | break; |
3590 | ||
3591 | case OP_NOT_WHITESPACE: | case OP_NOT_VSPACE: |
3592 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3593 | { | { |
3594 | if (eptr >= md->end_subject || | if (eptr >= md->end_subject) |
3595 | (*eptr < 128 && (md->ctypes[*eptr++] & ctype_space) != 0)) | { |
3596 | SCHECK_PARTIAL(); | |
3597 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
3598 | while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++; | } |
3599 | GETCHARINC(c, eptr); | |
3600 | switch(c) | |
3601 | { | |
3602 | default: break; | |
3603 | case 0x0a: /* LF */ | |
3604 | case 0x0b: /* VT */ | |
3605 | case 0x0c: /* FF */ | |
3606 | case 0x0d: /* CR */ | |
3607 | case 0x85: /* NEL */ | |
3608 | case 0x2028: /* LINE SEPARATOR */ | |
3609 | case 0x2029: /* PARAGRAPH SEPARATOR */ | |
3610 | RRETURN(MATCH_NOMATCH); | |
3611 | } | |
3612 | } | } |
3613 | break; | break; |
3614 | ||
3615 | case OP_WHITESPACE: | case OP_VSPACE: |
3616 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3617 | { | { |
3618 | if (eptr >= md->end_subject || | if (eptr >= md->end_subject) |
3619 | *eptr >= 128 || (md->ctypes[*eptr++] & ctype_space) == 0) | { |
3620 | SCHECK_PARTIAL(); | |
3621 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
3622 | /* No need to skip more bytes - we know it's a 1-byte character */ | } |
3623 | GETCHARINC(c, eptr); | |
3624 | switch(c) | |
3625 | { | |
3626 | default: RRETURN(MATCH_NOMATCH); | |
3627 | case 0x0a: /* LF */ | |
3628 | case 0x0b: /* VT */ | |
3629 | case 0x0c: /* FF */ | |
3630 | case 0x0d: /* CR */ | |
3631 | case 0x85: /* NEL */ | |
3632 | case 0x2028: /* LINE SEPARATOR */ | |
3633 | case 0x2029: /* PARAGRAPH SEPARATOR */ | |
3634 | break; | |
3635 | } | |
3636 | } | } |
3637 | break; | break; |
3638 | ||
3639 | case OP_NOT_WORDCHAR: | case OP_NOT_DIGIT: |
3640 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3641 | { | { |
3642 | if (eptr >= md->end_subject || | if (eptr >= md->end_subject) |
3643 | (*eptr < 128 && (md->ctypes[*eptr++] & ctype_word) != 0)) | { |
3644 | SCHECK_PARTIAL(); | |
3645 | RRETURN(MATCH_NOMATCH); | |
3646 | } | |
3647 | GETCHARINC(c, eptr); | |
3648 | if (c < 128 && (md->ctypes[c] & ctype_digit) != 0) | |
3649 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++; | ||
3650 | } | } |
3651 | break; | break; |
3652 | ||
3653 | case OP_WORDCHAR: | case OP_DIGIT: |
3654 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3655 | { | { |
3656 | if (eptr >= md->end_subject || | if (eptr >= md->end_subject) |
3657 | *eptr >= 128 || (md->ctypes[*eptr++] & ctype_word) == 0) | { |
3658 | SCHECK_PARTIAL(); | |
3659 | RRETURN(MATCH_NOMATCH); | |
3660 | } | |
3661 | if (*eptr >= 128 || (md->ctypes[*eptr++] & ctype_digit) == 0) | |
3662 | RRETURN(MATCH_NOMATCH); | |
3663 | /* No need to skip more bytes - we know it's a 1-byte character */ | |
3664 | } | |
3665 | break; | |
3666 | ||
3667 | case OP_NOT_WHITESPACE: | |
3668 | for (i = 1; i <= min; i++) | |
3669 | { | |
3670 | if (eptr >= md->end_subject) | |
3671 | { | |
3672 | SCHECK_PARTIAL(); | |
3673 | RRETURN(MATCH_NOMATCH); | |
3674 | } | |
3675 | if (*eptr < 128 && (md->ctypes[*eptr] & ctype_space) != 0) | |
3676 | RRETURN(MATCH_NOMATCH); | |
3677 | while (++eptr < md->end_subject && (*eptr & 0xc0) == 0x80); | |
3678 | } | |
3679 | break; | |
3680 | ||
3681 | case OP_WHITESPACE: | |
3682 | for (i = 1; i <= min; i++) | |
3683 | { | |
3684 | if (eptr >= md->end_subject) | |
3685 | { | |
3686 | SCHECK_PARTIAL(); | |
3687 | RRETURN(MATCH_NOMATCH); | |
3688 | } | |
3689 | if (*eptr >= 128 || (md->ctypes[*eptr++] & ctype_space) == 0) | |
3690 | RRETURN(MATCH_NOMATCH); | |
3691 | /* No need to skip more bytes - we know it's a 1-byte character */ | |
3692 | } | |
3693 | break; | |
3694 | ||
3695 | case OP_NOT_WORDCHAR: | |
3696 | for (i = 1; i <= min; i++) | |
3697 | { | |
3698 | if (eptr >= md->end_subject || | |
3699 | (*eptr < 128 && (md->ctypes[*eptr] & ctype_word) != 0)) | |
3700 | RRETURN(MATCH_NOMATCH); | |
3701 | while (++eptr < md->end_subject && (*eptr & 0xc0) == 0x80); | |
3702 | } | |
3703 | break; | |
3704 | ||
3705 | case OP_WORDCHAR: | |
3706 | for (i = 1; i <= min; i++) | |
3707 | { | |
3708 | if (eptr >= md->end_subject) | |
3709 | { | |
3710 | SCHECK_PARTIAL(); | |
3711 | RRETURN(MATCH_NOMATCH); | |
3712 | } | |
3713 | if (*eptr >= 128 || (md->ctypes[*eptr++] & ctype_word) == 0) | |
3714 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
3715 | /* No need to skip more bytes - we know it's a 1-byte character */ | /* No need to skip more bytes - we know it's a 1-byte character */ |
3716 | } | } |
# | Line 2842 for (;;) | Line 3724 for (;;) |
3724 | #endif /* SUPPORT_UTF8 */ | #endif /* SUPPORT_UTF8 */ |
3725 | ||
3726 | /* Code for the non-UTF-8 case for minimum matching of operators other | /* Code for the non-UTF-8 case for minimum matching of operators other |
3727 | than OP_PROP and OP_NOTPROP. We can assume that there are the minimum | than OP_PROP and OP_NOTPROP. */ |
number of bytes present, as this was tested above. */ | ||
3728 | ||
3729 | switch(ctype) | switch(ctype) |
3730 | { | { |
3731 | case OP_ANY: | case OP_ANY: |
3732 | if ((ims & PCRE_DOTALL) == 0) | for (i = 1; i <= min; i++) |
3733 | { | { |
3734 | for (i = 1; i <= min; i++) | if (eptr >= md->end_subject) |
3735 | { | { |
3736 | if (IS_NEWLINE(eptr)) RRETURN(MATCH_NOMATCH); | SCHECK_PARTIAL(); |
3737 | eptr++; | RRETURN(MATCH_NOMATCH); |
3738 | } | } |
3739 | if (IS_NEWLINE(eptr)) RRETURN(MATCH_NOMATCH); | |
3740 | eptr++; | |
3741 | } | } |
else eptr += min; | ||
3742 | break; | break; |
3743 | ||
3744 | case OP_ANYBYTE: | case OP_ALLANY: |
3745 | if (eptr > md->end_subject - min) | |
3746 | { | |
3747 | SCHECK_PARTIAL(); | |
3748 | RRETURN(MATCH_NOMATCH); | |
3749 | } | |
3750 | eptr += min; | eptr += min; |
3751 | break; | break; |
3752 | ||
3753 | /* Because of the CRLF case, we can't assume the minimum number of | case OP_ANYBYTE: |
3754 | bytes are present in this case. */ | if (eptr > md->end_subject - min) |
3755 | { | |
3756 | SCHECK_PARTIAL(); | |
3757 | RRETURN(MATCH_NOMATCH); | |
3758 | } | |
3759 | eptr += min; | |
3760 | break; | |
3761 | ||
3762 | case OP_ANYNL: | case OP_ANYNL: |
3763 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3764 | { | { |
3765 | if (eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (eptr >= md->end_subject) |
3766 | { | |
3767 | SCHECK_PARTIAL(); | |
3768 | RRETURN(MATCH_NOMATCH); | |
3769 | } | |
3770 | switch(*eptr++) | switch(*eptr++) |
3771 | { | { |
3772 | default: RRETURN(MATCH_NOMATCH); | default: RRETURN(MATCH_NOMATCH); |
# | Line 2877 for (;;) | Line 3774 for (;;) |
3774 | if (eptr < md->end_subject && *eptr == 0x0a) eptr++; | if (eptr < md->end_subject && *eptr == 0x0a) eptr++; |
3775 | break; | break; |
3776 | case 0x000a: | case 0x000a: |
3777 | break; | |
3778 | ||
3779 | case 0x000b: | case 0x000b: |
3780 | case 0x000c: | case 0x000c: |
3781 | case 0x0085: | case 0x0085: |
3782 | if (md->bsr_anycrlf) RRETURN(MATCH_NOMATCH); | |
3783 | break; | |
3784 | } | |
3785 | } | |
3786 | break; | |
3787 | ||
3788 | case OP_NOT_HSPACE: | |
3789 | for (i = 1; i <= min; i++) | |
3790 | { | |
3791 | if (eptr >= md->end_subject) | |
3792 | { | |
3793 | SCHECK_PARTIAL(); | |
3794 | RRETURN(MATCH_NOMATCH); | |
3795 | } | |
3796 | switch(*eptr++) | |
3797 | { | |
3798 | default: break; | |
3799 | case 0x09: /* HT */ | |
3800 | case 0x20: /* SPACE */ | |
3801 | case 0xa0: /* NBSP */ | |
3802 | RRETURN(MATCH_NOMATCH); | |
3803 | } | |
3804 | } | |
3805 | break; | |
3806 | ||
3807 | case OP_HSPACE: | |
3808 | for (i = 1; i <= min; i++) | |
3809 | { | |
3810 | if (eptr >= md->end_subject) | |
3811 | { | |
3812 | SCHECK_PARTIAL(); | |
3813 | RRETURN(MATCH_NOMATCH); | |
3814 | } | |
3815 | switch(*eptr++) | |
3816 | { | |
3817 | default: RRETURN(MATCH_NOMATCH); | |
3818 | case 0x09: /* HT */ | |
3819 | case 0x20: /* SPACE */ | |
3820 | case 0xa0: /* NBSP */ | |
3821 | break; | |
3822 | } | |
3823 | } | |
3824 | break; | |
3825 | ||
3826 | case OP_NOT_VSPACE: | |
3827 | for (i = 1; i <= min; i++) | |
3828 | { | |
3829 | if (eptr >= md->end_subject) | |
3830 | { | |
3831 | SCHECK_PARTIAL(); | |
3832 | RRETURN(MATCH_NOMATCH); | |
3833 | } | |
3834 | switch(*eptr++) | |
3835 | { | |
3836 | default: break; | |
3837 | case 0x0a: /* LF */ | |
3838 | case 0x0b: /* VT */ | |
3839 | case 0x0c: /* FF */ | |
3840 | case 0x0d: /* CR */ | |
3841 | case 0x85: /* NEL */ | |
3842 | RRETURN(MATCH_NOMATCH); | |
3843 | } | |
3844 | } | |
3845 | break; | |
3846 | ||
3847 | case OP_VSPACE: | |
3848 | for (i = 1; i <= min; i++) | |
3849 | { | |
3850 | if (eptr >= md->end_subject) | |
3851 | { | |
3852 | SCHECK_PARTIAL(); | |
3853 | RRETURN(MATCH_NOMATCH); | |
3854 | } | |
3855 | switch(*eptr++) | |
3856 | { | |
3857 | default: RRETURN(MATCH_NOMATCH); | |
3858 | case 0x0a: /* LF */ | |
3859 | case 0x0b: /* VT */ | |
3860 | case 0x0c: /* FF */ | |
3861 | case 0x0d: /* CR */ | |
3862 | case 0x85: /* NEL */ | |
3863 | break; | break; |
3864 | } | } |
3865 | } | } |
# | Line 2887 for (;;) | Line 3867 for (;;) |
3867 | ||
3868 | case OP_NOT_DIGIT: | case OP_NOT_DIGIT: |
3869 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3870 | { | |
3871 | if (eptr >= md->end_subject) | |
3872 | { | |
3873 | SCHECK_PARTIAL(); | |
3874 | RRETURN(MATCH_NOMATCH); | |
3875 | } | |
3876 | if ((md->ctypes[*eptr++] & ctype_digit) != 0) RRETURN(MATCH_NOMATCH); | if ((md->ctypes[*eptr++] & ctype_digit) != 0) RRETURN(MATCH_NOMATCH); |
3877 | } | |
3878 | break; | break; |
3879 | ||
3880 | case OP_DIGIT: | case OP_DIGIT: |
3881 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3882 | { | |
3883 | if (eptr >= md->end_subject) | |
3884 | { | |
3885 | SCHECK_PARTIAL(); | |
3886 | RRETURN(MATCH_NOMATCH); | |
3887 | } | |
3888 | if ((md->ctypes[*eptr++] & ctype_digit) == 0) RRETURN(MATCH_NOMATCH); | if ((md->ctypes[*eptr++] & ctype_digit) == 0) RRETURN(MATCH_NOMATCH); |
3889 | } | |
3890 | break; | break; |
3891 | ||
3892 | case OP_NOT_WHITESPACE: | case OP_NOT_WHITESPACE: |
3893 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3894 | { | |
3895 | if (eptr >= md->end_subject) | |
3896 | { | |
3897 | SCHECK_PARTIAL(); | |
3898 | RRETURN(MATCH_NOMATCH); | |
3899 | } | |
3900 | if ((md->ctypes[*eptr++] & ctype_space) != 0) RRETURN(MATCH_NOMATCH); | if ((md->ctypes[*eptr++] & ctype_space) != 0) RRETURN(MATCH_NOMATCH); |
3901 | } | |
3902 | break; | break; |
3903 | ||
3904 | case OP_WHITESPACE: | case OP_WHITESPACE: |
3905 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3906 | { | |
3907 | if (eptr >= md->end_subject) | |
3908 | { | |
3909 | SCHECK_PARTIAL(); | |
3910 | RRETURN(MATCH_NOMATCH); | |
3911 | } | |
3912 | if ((md->ctypes[*eptr++] & ctype_space) == 0) RRETURN(MATCH_NOMATCH); | if ((md->ctypes[*eptr++] & ctype_space) == 0) RRETURN(MATCH_NOMATCH); |
3913 | } | |
3914 | break; | break; |
3915 | ||
3916 | case OP_NOT_WORDCHAR: | case OP_NOT_WORDCHAR: |
3917 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3918 | { | |
3919 | if (eptr >= md->end_subject) | |
3920 | { | |
3921 | SCHECK_PARTIAL(); | |
3922 | RRETURN(MATCH_NOMATCH); | |
3923 | } | |
3924 | if ((md->ctypes[*eptr++] & ctype_word) != 0) | if ((md->ctypes[*eptr++] & ctype_word) != 0) |
3925 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
3926 | } | |
3927 | break; | break; |
3928 | ||
3929 | case OP_WORDCHAR: | case OP_WORDCHAR: |
3930 | for (i = 1; i <= min; i++) | for (i = 1; i <= min; i++) |
3931 | { | |
3932 | if (eptr >= md->end_subject) | |
3933 | { | |
3934 | SCHECK_PARTIAL(); | |
3935 | RRETURN(MATCH_NOMATCH); | |
3936 | } | |
3937 | if ((md->ctypes[*eptr++] & ctype_word) == 0) | if ((md->ctypes[*eptr++] & ctype_word) == 0) |
3938 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
3939 | } | |
3940 | break; | break; |
3941 | ||
3942 | default: | default: |
# | Line 2940 for (;;) | Line 3962 for (;;) |
3962 | case PT_ANY: | case PT_ANY: |
3963 | for (fi = min;; fi++) | for (fi = min;; fi++) |
3964 | { | { |
3965 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM36); |
3966 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
3967 | if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (fi >= max) RRETURN(MATCH_NOMATCH); |
3968 | if (eptr >= md->end_subject) | |
3969 | { | |
3970 | SCHECK_PARTIAL(); | |
3971 | RRETURN(MATCH_NOMATCH); | |
3972 | } | |
3973 | GETCHARINC(c, eptr); | GETCHARINC(c, eptr); |
3974 | if (prop_fail_result) RRETURN(MATCH_NOMATCH); | if (prop_fail_result) RRETURN(MATCH_NOMATCH); |
3975 | } | } |
# | Line 2951 for (;;) | Line 3978 for (;;) |
3978 | case PT_LAMP: | case PT_LAMP: |
3979 | for (fi = min;; fi++) | for (fi = min;; fi++) |
3980 | { | { |
3981 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM37); |
3982 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
3983 | if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (fi >= max) RRETURN(MATCH_NOMATCH); |
3984 | if (eptr >= md->end_subject) | |
3985 | { | |
3986 | SCHECK_PARTIAL(); | |
3987 | RRETURN(MATCH_NOMATCH); | |
3988 | } | |
3989 | GETCHARINC(c, eptr); | GETCHARINC(c, eptr); |
3990 | prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script); | prop_chartype = UCD_CHARTYPE(c); |
3991 | if ((prop_chartype == ucp_Lu || | if ((prop_chartype == ucp_Lu || |
3992 | prop_chartype == ucp_Ll || | prop_chartype == ucp_Ll || |
3993 | prop_chartype == ucp_Lt) == prop_fail_result) | prop_chartype == ucp_Lt) == prop_fail_result) |
# | Line 2966 for (;;) | Line 3998 for (;;) |
3998 | case PT_GC: | case PT_GC: |
3999 | for (fi = min;; fi++) | for (fi = min;; fi++) |
4000 | { | { |
4001 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM38); |
4002 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
4003 | if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (fi >= max) RRETURN(MATCH_NOMATCH); |
4004 | if (eptr >= md->end_subject) | |
4005 | { | |
4006 | SCHECK_PARTIAL(); | |
4007 | RRETURN(MATCH_NOMATCH); | |
4008 | } | |
4009 | GETCHARINC(c, eptr); | GETCHARINC(c, eptr); |
4010 | prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script); | prop_category = UCD_CATEGORY(c); |
4011 | if ((prop_category == prop_value) == prop_fail_result) | if ((prop_category == prop_value) == prop_fail_result) |
4012 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
4013 | } | } |
# | Line 2979 for (;;) | Line 4016 for (;;) |
4016 | case PT_PC: | case PT_PC: |
4017 | for (fi = min;; fi++) | for (fi = min;; fi++) |
4018 | { | { |
4019 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM39); |
4020 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
4021 | if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (fi >= max) RRETURN(MATCH_NOMATCH); |
4022 | if (eptr >= md->end_subject) | |
4023 | { | |
4024 | SCHECK_PARTIAL(); | |
4025 | RRETURN(MATCH_NOMATCH); | |
4026 | } | |
4027 | GETCHARINC(c, eptr); | GETCHARINC(c, eptr); |
4028 | prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script); | prop_chartype = UCD_CHARTYPE(c); |
4029 | if ((prop_chartype == prop_value) == prop_fail_result) | if ((prop_chartype == prop_value) == prop_fail_result) |
4030 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
4031 | } | } |
# | Line 2992 for (;;) | Line 4034 for (;;) |
4034 | case PT_SC: | case PT_SC: |
4035 | for (fi = min;; fi++) | for (fi = min;; fi++) |
4036 | { | { |
4037 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM40); |
4038 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
4039 | if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (fi >= max) RRETURN(MATCH_NOMATCH); |
4040 | if (eptr >= md->end_subject) | |
4041 | { | |
4042 | SCHECK_PARTIAL(); | |
4043 | RRETURN(MATCH_NOMATCH); | |
4044 | } | |
4045 | GETCHARINC(c, eptr); | GETCHARINC(c, eptr); |
4046 | prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script); | prop_script = UCD_SCRIPT(c); |
4047 | if ((prop_script == prop_value) == prop_fail_result) | if ((prop_script == prop_value) == prop_fail_result) |
4048 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
4049 | } | } |
# | Line 3014 for (;;) | Line 4061 for (;;) |
4061 | { | { |
4062 | for (fi = min;; fi++) | for (fi = min;; fi++) |
4063 | { | { |
4064 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM41); |
4065 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
4066 | if (fi >= max || eptr >= md->end_subject) RRETURN(MATCH_NOMATCH); | if (fi >= max) RRETURN(MATCH_NOMATCH); |
4067 | if (eptr >= md->end_subject) | |
4068 | { | |
4069 | SCHECK_PARTIAL(); | |
4070 | RRETURN(MATCH_NOMATCH); | |
4071 | } | |
4072 | GETCHARINCTEST(c, eptr); | GETCHARINCTEST(c, eptr); |
4073 | prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script); | prop_category = UCD_CATEGORY(c); |
4074 | if (prop_category == ucp_M) RRETURN(MATCH_NOMATCH); | if (prop_category == ucp_M) RRETURN(MATCH_NOMATCH); |
4075 | while (eptr < md->end_subject) | while (eptr < md->end_subject) |
4076 | { | { |
4077 | int len = 1; | int len = 1; |
4078 | if (!utf8) c = *eptr; else | if (!utf8) c = *eptr; |
4079 | { | else { GETCHARLEN(c, eptr, len); } |
4080 | GETCHARLEN(c, eptr, len); | prop_category = UCD_CATEGORY(c); |
} | ||
prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script); | ||
4081 | if (prop_category != ucp_M) break; | if (prop_category != ucp_M) break; |
4082 | eptr += len; | eptr += len; |
4083 | } | } |
# | Line 3043 for (;;) | Line 4093 for (;;) |
4093 | { | { |
4094 | for (fi = min;; fi++) | for (fi = min;; fi++) |
4095 | { | { |
4096 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM42); |
4097 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
4098 | if (fi >= max || eptr >= md->end_subject || | if (fi >= max) RRETURN(MATCH_NOMATCH); |
4099 | (ctype == OP_ANY && (ims & PCRE_DOTALL) == 0 && | if (eptr >= md->end_subject) |
4100 | IS_NEWLINE(eptr))) | { |
4101 | SCHECK_PARTIAL(); | |
4102 | RRETURN(MATCH_NOMATCH); | |
4103 | } | |
4104 | if (ctype == OP_ANY && IS_NEWLINE(eptr)) | |
4105 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
4106 | GETCHARINC(c, eptr); | GETCHARINC(c, eptr); |
4107 | switch(ctype) | switch(ctype) |
4108 | { | { |
4109 | case OP_ANY: /* This is the DOTALL case */ | case OP_ANY: /* This is the non-NL case */ |
4110 | break; | case OP_ALLANY: |
4111 | case OP_ANYBYTE: | case OP_ANYBYTE: |
4112 | break; | break; |
4113 | ||
# | Line 3067 for (;;) | Line 4119 for (;;) |
4119 | if (eptr < md->end_subject && *eptr == 0x0a) eptr++; | if (eptr < md->end_subject && *eptr == 0x0a) eptr++; |
4120 | break; | break; |
4121 | case 0x000a: | case 0x000a: |
4122 | break; | |
4123 | ||
4124 | case 0x000b: | case 0x000b: |
4125 | case 0x000c: | case 0x000c: |
4126 | case 0x0085: | case 0x0085: |
4127 | case 0x2028: | case 0x2028: |
4128 | case 0x2029: | case 0x2029: |
4129 | if (md->bsr_anycrlf) RRETURN(MATCH_NOMATCH); | |
4130 | break; | |
4131 | } | |
4132 | break; | |
4133 | ||
4134 | case OP_NOT_HSPACE: | |
4135 | switch(c) | |
4136 | { | |
4137 | default: break; | |
4138 | case 0x09: /* HT */ | |
4139 | case 0x20: /* SPACE */ | |
4140 | case 0xa0: /* NBSP */ | |
4141 | case 0x1680: /* OGHAM SPACE MARK */ | |
4142 | case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */ | |
4143 | case 0x2000: /* EN QUAD */ | |
4144 | case 0x2001: /* EM QUAD */ | |
4145 | case 0x2002: /* EN SPACE */ | |
4146 | case 0x2003: /* EM SPACE */ | |
4147 | case 0x2004: /* THREE-PER-EM SPACE */ | |
4148 | case 0x2005: /* FOUR-PER-EM SPACE */ | |
4149 | case 0x2006: /* SIX-PER-EM SPACE */ | |
4150 | case 0x2007: /* FIGURE SPACE */ | |
4151 | case 0x2008: /* PUNCTUATION SPACE */ | |
4152 | case 0x2009: /* THIN SPACE */ | |
4153 | case 0x200A: /* HAIR SPACE */ | |
4154 | case 0x202f: /* NARROW NO-BREAK SPACE */ | |
4155 | case 0x205f: /* MEDIUM MATHEMATICAL SPACE */ | |
4156 | case 0x3000: /* IDEOGRAPHIC SPACE */ | |
4157 | RRETURN(MATCH_NOMATCH); | |
4158 | } | |
4159 | break; | |
4160 | ||
4161 | case OP_HSPACE: | |
4162 | switch(c) | |
4163 | { | |
4164 | default: RRETURN(MATCH_NOMATCH); | |
4165 | case 0x09: /* HT */ | |
4166 | case 0x20: /* SPACE */ | |
4167 | case 0xa0: /* NBSP */ | |
4168 | case 0x1680: /* OGHAM SPACE MARK */ | |
4169 | case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */ | |
4170 | case 0x2000: /* EN QUAD */ | |
4171 | case 0x2001: /* EM QUAD */ | |
4172 | case 0x2002: /* EN SPACE */ | |
4173 | case 0x2003: /* EM SPACE */ | |
4174 | case 0x2004: /* THREE-PER-EM SPACE */ | |
4175 | case 0x2005: /* FOUR-PER-EM SPACE */ | |
4176 | case 0x2006: /* SIX-PER-EM SPACE */ | |
4177 | case 0x2007: /* FIGURE SPACE */ | |
4178 | case 0x2008: /* PUNCTUATION SPACE */ | |
4179 | case 0x2009: /* THIN SPACE */ | |
4180 | case 0x200A: /* HAIR SPACE */ | |
4181 | case 0x202f: /* NARROW NO-BREAK SPACE */ | |
4182 | case 0x205f: /* MEDIUM MATHEMATICAL SPACE */ | |
4183 | case 0x3000: /* IDEOGRAPHIC SPACE */ | |
4184 | break; | |
4185 | } | |
4186 | break; | |
4187 | ||
4188 | case OP_NOT_VSPACE: | |
4189 | switch(c) | |
4190 | { | |
4191 | default: break; | |
4192 | case 0x0a: /* LF */ | |
4193 | case 0x0b: /* VT */ | |
4194 | case 0x0c: /* FF */ | |
4195 | case 0x0d: /* CR */ | |
4196 | case 0x85: /* NEL */ | |
4197 | case 0x2028: /* LINE SEPARATOR */ | |
4198 | case 0x2029: /* PARAGRAPH SEPARATOR */ | |
4199 | RRETURN(MATCH_NOMATCH); | |
4200 | } | |
4201 | break; | |
4202 | ||
4203 | case OP_VSPACE: | |
4204 | switch(c) | |
4205 | { | |
4206 | default: RRETURN(MATCH_NOMATCH); | |
4207 | case 0x0a: /* LF */ | |
4208 | case 0x0b: /* VT */ | |
4209 | case 0x0c: /* FF */ | |
4210 | case 0x0d: /* CR */ | |
4211 | case 0x85: /* NEL */ | |
4212 | case 0x2028: /* LINE SEPARATOR */ | |
4213 | case 0x2029: /* PARAGRAPH SEPARATOR */ | |
4214 | break; | break; |
4215 | } | } |
4216 | break; | break; |
# | Line 3117 for (;;) | Line 4256 for (;;) |
4256 | { | { |
4257 | for (fi = min;; fi++) | for (fi = min;; fi++) |
4258 | { | { |
4259 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM43); |
4260 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
4261 | if (fi >= max || eptr >= md->end_subject || | if (fi >= max) RRETURN(MATCH_NOMATCH); |
4262 | ((ims & PCRE_DOTALL) == 0 && IS_NEWLINE(eptr))) | if (eptr >= md->end_subject) |
4263 | { | |
4264 | SCHECK_PARTIAL(); | |
4265 | RRETURN(MATCH_NOMATCH); | |
4266 | } | |
4267 | if (ctype == OP_ANY && IS_NEWLINE(eptr)) | |
4268 | RRETURN(MATCH_NOMATCH); | RRETURN(MATCH_NOMATCH); |
4269 | c = *eptr++; | c = *eptr++; |
4270 | switch(ctype) | switch(ctype) |
4271 | { | { |
4272 | case OP_ANY: /* This is the DOTALL case */ | case OP_ANY: /* This is the non-NL case */ |
4273 | break; | case OP_ALLANY: |
4274 | case OP_ANYBYTE: | case OP_ANYBYTE: |
4275 | break; | break; |
4276 | ||
# | Line 3139 for (;;) | Line 4281 for (;;) |
4281 | case 0x000d: | case 0x000d: |
4282 | if (eptr < md->end_subject && *eptr == 0x0a) eptr++; | if (eptr < md->end_subject && *eptr == 0x0a) eptr++; |
4283 | break; | break; |
4284 | ||
4285 | case 0x000a: | case 0x000a: |
4286 | break; | |
4287 | ||
4288 | case 0x000b: | case 0x000b: |
4289 | case 0x000c: | case 0x000c: |
4290 | case 0x0085: | case 0x0085: |
4291 | if (md->bsr_anycrlf) RRETURN(MATCH_NOMATCH); | |
4292 | break; | |
4293 | } | |
4294 | break; | |
4295 | ||
4296 | case OP_NOT_HSPACE: | |
4297 | switch(c) | |
4298 | { | |
4299 | default: break; | |
4300 | case 0x09: /* HT */ | |
4301 | case 0x20: /* SPACE */ | |
4302 | case 0xa0: /* NBSP */ | |
4303 | RRETURN(MATCH_NOMATCH); | |
4304 | } | |
4305 | break; | |
4306 | ||
4307 | case OP_HSPACE: | |
4308 | switch(c) | |
4309 | { | |
4310 | default: RRETURN(MATCH_NOMATCH); | |
4311 | case 0x09: /* HT */ | |
4312 | case 0x20: /* SPACE */ | |
4313 | case 0xa0: /* NBSP */ | |
4314 | break; | |
4315 | } | |
4316 | break; | |
4317 | ||
4318 | case OP_NOT_VSPACE: | |
4319 | switch(c) | |
4320 | { | |
4321 | default: break; | |
4322 | case 0x0a: /* LF */ | |
4323 | case 0x0b: /* VT */ | |
4324 | case 0x0c: /* FF */ | |
4325 | case 0x0d: /* CR */ | |
4326 | case 0x85: /* NEL */ | |
4327 | RRETURN(MATCH_NOMATCH); | |
4328 | } | |
4329 | break; | |
4330 | ||
4331 | case OP_VSPACE: | |
4332 | switch(c) | |
4333 | { | |
4334 | default: RRETURN(MATCH_NOMATCH); | |
4335 | case 0x0a: /* LF */ | |
4336 | case 0x0b: /* VT */ | |
4337 | case 0x0c: /* FF */ | |
4338 | case 0x0d: /* CR */ | |
4339 | case 0x85: /* NEL */ | |
4340 | break; | break; |
4341 | } | } |
4342 | break; | break; |
# | Line 3196 for (;;) | Line 4390 for (;;) |
4390 | for (i = min; i < max; i++) | for (i = min; i < max; i++) |
4391 | { | { |
4392 | int len = 1; | int len = 1; |
4393 | if (eptr >= md->end_subject) break; | if (eptr >= md->end_subject) |
4394 | { | |
4395 | SCHECK_PARTIAL(); | |
4396 | break; | |
4397 | } | |
4398 | GETCHARLEN(c, eptr, len); | GETCHARLEN(c, eptr, len); |
4399 | if (prop_fail_result) break; | if (prop_fail_result) break; |
4400 | eptr+= len; | eptr+= len; |
# | Line 3207 for (;;) | Line 4405 for (;;) |
4405 | for (i = min; i < max; i++) | for (i = min; i < max; i++) |
4406 | { | { |
4407 | int len = 1; | int len = 1; |
4408 | if (eptr >= md->end_subject) break; | if (eptr >= md->end_subject) |
4409 | { | |
4410 | SCHECK_PARTIAL(); | |
4411 | break; | |
4412 | } | |
4413 | GETCHARLEN(c, eptr, len); | GETCHARLEN(c, eptr, len); |
4414 | prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script); | prop_chartype = UCD_CHARTYPE(c); |
4415 | if ((prop_chartype == ucp_Lu || | if ((prop_chartype == ucp_Lu || |
4416 | prop_chartype == ucp_Ll || | prop_chartype == ucp_Ll || |
4417 | prop_chartype == ucp_Lt) == prop_fail_result) | prop_chartype == ucp_Lt) == prop_fail_result) |
# | Line 3222 for (;;) | Line 4424 for (;;) |
4424 | for (i = min; i < max; i++) | for (i = min; i < max; i++) |
4425 | { | { |
4426 | int len = 1; | int len = 1; |
4427 | if (eptr >= md->end_subject) break; | if (eptr >= md->end_subject) |
4428 | { | |
4429 | SCHECK_PARTIAL(); | |
4430 | break; | |
4431 | } | |
4432 | GETCHARLEN(c, eptr, len); | GETCHARLEN(c, eptr, len); |
4433 | prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script); | prop_category = UCD_CATEGORY(c); |
4434 | if ((prop_category == prop_value) == prop_fail_result) | if ((prop_category == prop_value) == prop_fail_result) |
4435 | break; | break; |
4436 | eptr+= len; | eptr+= len; |
# | Line 3235 for (;;) | Line 4441 for (;;) |
4441 | for (i = min; i < max; i++) | for (i = min; i < max; i++) |
4442 | { | { |
4443 | int len = 1; | int len = 1; |
4444 | if (eptr >= md->end_subject) break; | if (eptr >= md->end_subject) |
4445 | { | |
4446 | SCHECK_PARTIAL(); | |
4447 | break; | |
4448 | } | |
4449 | GETCHARLEN(c, eptr, len); | GETCHARLEN(c, eptr, len); |
4450 | prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script); | prop_chartype = UCD_CHARTYPE(c); |
4451 | if ((prop_chartype == prop_value) == prop_fail_result) | if ((prop_chartype == prop_value) == prop_fail_result) |
4452 | break; | break; |
4453 | eptr+= len; | eptr+= len; |
# | Line 3248 for (;;) | Line 4458 for (;;) |
4458 | for (i = min; i < max; i++) | for (i = min; i < max; i++) |
4459 | { | { |
4460 | int len = 1; | int len = 1; |
4461 | if (eptr >= md->end_subject) break; | if (eptr >= md->end_subject) |
4462 | { | |
4463 | SCHECK_PARTIAL(); | |
4464 | break; | |
4465 | } | |
4466 | GETCHARLEN(c, eptr, len); | GETCHARLEN(c, eptr, len); |
4467 | prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script); | prop_script = UCD_SCRIPT(c); |
4468 | if ((prop_script == prop_value) == prop_fail_result) | if ((prop_script == prop_value) == prop_fail_result) |
4469 | break; | break; |
4470 | eptr+= len; | eptr+= len; |
# | Line 3263 for (;;) | Line 4477 for (;;) |
4477 | if (possessive) continue; | if (possessive) continue; |
4478 | for(;;) | for(;;) |
4479 | { | { |
4480 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM44); |
4481 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
4482 | if (eptr-- == pp) break; /* Stop if tried at original pos */ | if (eptr-- == pp) break; /* Stop if tried at original pos */ |
4483 | BACKCHAR(eptr); | if (utf8) BACKCHAR(eptr); |
4484 | } | } |
4485 | } | } |
4486 | ||
# | Line 3277 for (;;) | Line 4491 for (;;) |
4491 | { | { |
4492 | for (i = min; i < max; i++) | for (i = min; i < max; i++) |
4493 | { | { |
4494 | if (eptr >= md->end_subject) break; | if (eptr >= md->end_subject) |
4495 | { | |
4496 | SCHECK_PARTIAL(); | |
4497 | break; | |
4498 | } | |
4499 | GETCHARINCTEST(c, eptr); | GETCHARINCTEST(c, eptr); |
4500 | prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script); | prop_category = UCD_CATEGORY(c); |
4501 | if (prop_category == ucp_M) break; | if (prop_category == ucp_M) break; |
4502 | while (eptr < md->end_subject) | while (eptr < md->end_subject) |
4503 | { | { |
# | Line 3288 for (;;) | Line 4506 for (;;) |
4506 | { | { |
4507 | GETCHARLEN(c, eptr, len); | GETCHARLEN(c, eptr, len); |
4508 | } | } |
4509 | prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script); | prop_category = UCD_CATEGORY(c); |
4510 | if (prop_category != ucp_M) break; | if (prop_category != ucp_M) break; |
4511 | eptr += len; | eptr += len; |
4512 | } | } |
# | Line 3297 for (;;) | Line 4515 for (;;) |
4515 | /* eptr is now past the end of the maximum run */ | /* eptr is now past the end of the maximum run */ |
4516 | ||
4517 | if (possessive) continue; | if (possessive) continue; |
4518 | ||
4519 | for(;;) | for(;;) |
4520 | { | { |
4521 | RMATCH(rrc, eptr, ecode, offset_top, md, ims, eptrb, 0); | RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM45); |
4522 | if (rrc != MATCH_NOMATCH) RRETURN(rrc); | if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
4523 | if (eptr-- == pp) break; /* Stop if tried at original pos */ | if (eptr-- == pp) break; /* Stop if tried at original pos */ |
4524 | for (;;) /* Move back over one extended */ | for (;;) /* Move back over one extended */ |
4525 | { | { |
4526 | int len = 1; | int len = 1; |
BACKCHAR(eptr); | ||
4527 | if (!utf8) c = *eptr; else | if (!utf8) c = *eptr; else |
4528 | { | { |
4529 | BACKCHAR(eptr); | |
4530 | GETCHARLEN(c, eptr, len); | GETCHARLEN(c, eptr, len); |
4531 | } | } |
4532 | prop_category = _pcre_ucp_findprop(c, &prop_chartype, &prop_script); | prop_category = UCD_CATEGORY(c); |
4533 | if (prop_category != ucp_M) break; | if (prop_category != ucp_M) break; |
4534 | eptr--; | eptr--; |
4535 | } | } |
# | Line 3328 for (;;) | Line 4547 for (;;) |
4547 | switch(ctype) | switch(ctype) |
4548 | { | { |
4549 | case OP_ANY: | case OP_ANY: |
/* Special code is required for UTF8, but when the maximum is | ||
unlimited we don't need it, so we repeat the non-UTF8 code. This is | ||
probably worth it, because .* is quite a common idiom. */ | ||
4550 | if (max < INT_MAX) | if (max < INT_MAX) |
4551 | { | { |
4552 | if ((ims & PCRE_DOTALL) == 0) | for (i = min; i < max; i++) |
{ | ||
for (i = min; i < max; i++) | ||
{ | ||
if (eptr >= md->end_subject || IS_NEWLINE(eptr)) break; | ||
eptr++; | ||
while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++; | ||
} | ||
} | ||
else | ||
4553 | { | { |
4554 | for (i = min; i < max; i++) | if (eptr >= md->end_subject) |
4555 | { | { |
4556 | if (eptr >= md->end_subject) break; | SCHECK_PARTIAL(); |
4557 | eptr++; | break; |
while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++; | ||
4558 | } | } |
4559 | if (IS_NEWLINE(eptr)) break; | |
4560 | eptr++; | |
4561 | while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++; | |
4562 | } | } |
4563 | } | } |
4564 | ||
# | Line 3359 for (;;) | Line 4566 for (;;) |
4566 | ||
4567 | else | else |
4568 | { | { |
4569 | if ((ims & PCRE_DOTALL) == 0) | for (i = min; i < max; i++) |
4570 | { | { |
4571 | for (i = min; i < max; i++) | if (eptr >= md->end_subject) |
4572 | { | { |
4573 | if (eptr >= md->end_subject || IS_NEWLINE(eptr)) break; | SCHECK_PARTIAL(); |
4574 | eptr++; | break; |
4575 | } | } |
4576 | break; | if (IS_NEWLINE(eptr)) break; |
4577 | eptr++; | |
4578 | while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++; | |
4579 | } | } |
4580 | else | } |
4581 | break; | |
4582 | ||
4583 | case OP_ALLANY: | |
4584 | if (max < INT_MAX) | |
4585 | { | |
4586 | for (i = min; i < max; i++) | |
4587 | { | { |
4588 | c = max - min; | if (eptr >= md->end_subject) |
4589 | if (c > (unsigned int)(md->end_subject - eptr)) | { |
4590 | c = md->end_subject - eptr; | SCHECK_PARTIAL(); |
4591 | eptr += c; | break; |
4592 | } | |
4593 | eptr++; | |
4594 | while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++; | |
4595 | } | } |
4596 | } | } |
4597 | else eptr = md->end_subject; /* Unlimited UTF-8 repeat */ | |
4598 | break; | break; |
4599 | ||
4600 | /* The byte case is the same as non-UTF8 */ | /* The byte case is the same as non-UTF8 */ |
# | Line 3383 for (;;) | Line 4602 for (;;) |
4602 | case OP_ANYBYTE: | case OP_ANYBYTE: |
4603 | c = max - min; | c = max - min; |
4604 | if (c > (unsigned int)(md->end_subject - eptr)) | if (c > (unsigned int)(md->end_subject - eptr)) |
4605 | c = md->end_subject - eptr; | { |
4606 | eptr += c; | eptr = md->end_subject; |
4607 | SCHECK_PARTIAL(); | |
4608 | } | |
4609 | else eptr += c; | |
4610 | break; | break; |
4611 | ||
4612 | case OP_ANYNL: | case OP_ANYNL: |
4613 | for (i = min; i < max; i++) | for (i = min; i < max; i++) |
4614 | { | { |
4615 | int len = 1; | int len = 1; |
4616 | if (eptr >= md->end_subject) break; | if (eptr >= md->end_subject) |
4617 | { | |
4618 | SCHECK_PARTIAL(); | |
4619 | break; | |
4620 | } | |
4621 | GETCHARLEN(c, eptr, len); | GETCHARLEN(c, eptr, len); |
4622 | if (c == 0x000d) | if (c == 0x000d) |
4623 | { | { |
# | Line 3400 for (;;) | Line 4626 for (;;) |
4626 | } | } |
4627 | else | else |
4628 | { | { |
4629 | if (c != 0x000a && c != 0x000b && c != 0x000c && | if (c != 0x000a && |
4630 | c != 0x0085 && c != 0x2028 && c != 0x2029) | (md->bsr_anycrlf || |
4631 | (c != 0x000b && c != 0x000c && | |
4632 | c != 0x0085 && c != 0x2028 && c != 0x2029))) | |
4633 | break; | break; |
4634 | eptr += len; | eptr += len; |
4635 | } | } |
4636 | } | } |
4637 | break; | break; |
4638 | ||
4639 | case OP_NOT_HSPACE: | |
4640 | case OP_HSPACE: | |
4641 | for (i = min; i < max; i++) | |
4642 | { | |
4643 | BOOL gotspace; | |
4644 | int len = 1; | |
4645 | if (eptr >= md->end_subject) | |
4646 | { | |
4647 | SCHECK_PARTIAL(); | |
4648 | break; | |
4649 | } | |
4650 | GETCHARLEN(c, eptr, len); | |
4651 | switch(c) | |
4652 | { | |
4653 | default: gotspace = FALSE; break; | |
4654 | case 0x09: /* HT */ | |
4655 | case 0x20: /* SPACE */ | |
4656 | case 0xa0: /* NBSP */ | |
4657 | case 0x1680: /* OGHAM SPACE MARK */ | |
4658 | case 0x180e: /* MONGOLIAN VOWEL SEPARATOR */ | |
4659 | case 0x2000: /* EN QUAD */ | |
4660 | case 0x2001: /* EM QUAD */ | |
4661 | case 0x2002: /* EN SPACE */ | |
4662 | case 0x2003: /* EM SPACE */ | |
4663 | case 0x2004: /* THREE-PER-EM SPACE */ | |
4664 | case 0x2005: /* FOUR-PER-EM SPACE */ | |
4665 | case 0x2006: /* SIX-PER-EM SPACE */ | |
4666 | case 0x2007: /* FIGURE SPACE */ | |
4667 | case 0x2008: /* PUNCTUATION SPACE */ | |
4668 | case 0x2009: /* THIN SPACE */ | |
4669 | case 0x200A: /* HAIR SPACE */ | |
4670 | case 0x202f: /* NARROW NO-BREAK SPACE */ | |
4671 | case 0x205f: /* MEDIUM MATHEMATICAL SPACE */ | |
4672 | case 0x3000: /* IDEOGRAPHIC SPACE */ | |
4673 | gotspace = TRUE; | |
4674 | break; | |
4675 | } | |
4676 | if (gotspace == (ctype == OP_NOT_HSPACE)) break; | |
4677 | eptr += len; | |
4678 | } | |
4679 | break; | |
4680 | ||
4681 | case OP_NOT_VSPACE: | |
4682 | case OP_VSPACE: | |
4683 | for (i = min; i < max; i++) | |
4684 | { | |
4685 | BOOL gotspace; | |
4686 | int len = 1; | |
4687 | if (eptr >= md->end_subject) | |
4688 | { | |
4689 | SCHECK_PARTIAL(); | |
4690 | break; | |
4691 | } | |
4692 | GETCHARLEN(c, eptr, len); | |
4693 | switch(c) | |
4694 | { | |
4695 | default: gotspace = FALSE; break; | |
4696 | case 0x0a: /* LF */ | |
4697 | case 0x0b: /* VT */ | |
4698 | case 0x0c: /* FF */ | |
4699 | case 0x0d: /* CR */ | |
4700 | case 0x85: /* NEL */ | |
4701 | case 0x2028: /* LINE SEPARATOR */ | |
4702 | case 0x2029: /* PARAGRAPH SEPARATOR */ | |
4703 | gotspace = TRUE; | |
4704 | break; | |
4705 | } | |
4706 | if (gotspace == (ctype == OP_NOT_VSPACE)) break; | |
4707 | eptr += len; | |
4708 | } | |
4709 | break; | |
4710 | ||
4711 | case OP_NOT_DIGIT: | case OP_NOT_DIGIT: |
4712 | for (i = min; i < max; i++) | for (i = min; i < max; i++) |
4713 | { | { |
4714 | int len = 1; | int len = 1; |
4715 | if (eptr >= md->end_subject) break; | if (eptr >= md->end_subject) |
4716 | { | |
4717 | SCHECK_PARTIAL(); | |
4718 | break; | |
4719 | } | |
4720 | GETCHARLEN(c, eptr, len); | GETCHARLEN(c, eptr, len); |
4721 | if (c < 256 && (md->ctypes[c] & ctype_digit) != 0) break; | if (c < 256 && (md->ctypes[c] & ctype_digit) != 0) break; |
4722 | eptr+= len; | eptr+= len; |
# | Line 3423 for (;;) | Line 4727 for (;;) |
4727 | for (i = min; i < max; i++) | &nb |