| 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-2009 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 |
| 89 |
|
|
| 90 |
|
|
| 91 |
|
|
| 92 |
#ifdef DEBUG |
#ifdef PCRE_DEBUG |
| 93 |
/************************************************* |
/************************************************* |
| 94 |
* Debugging function to print chars * |
* Debugging function to print chars * |
| 95 |
*************************************************/ |
*************************************************/ |
| 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 |
| 254 |
#ifndef NO_RECURSE |
#ifndef NO_RECURSE |
| 255 |
#define REGISTER register |
#define REGISTER register |
| 256 |
|
|
| 257 |
#ifdef DEBUG |
#ifdef PCRE_DEBUG |
| 258 |
#define RMATCH(ra,rb,rc,rd,re,rf,rg,rw) \ |
#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__); \ |
| 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. */ |
| 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); |
| 1039 |
number = GET2(ecode, 1); |
number = GET2(ecode, 1); |
| 1040 |
offset = number << 1; |
offset = number << 1; |
| 1041 |
|
|
| 1042 |
#ifdef DEBUG |
#ifdef PCRE_DEBUG |
| 1043 |
printf("end bracket %d at *ACCEPT", number); |
printf("end bracket %d at *ACCEPT", number); |
| 1044 |
printf("\n"); |
printf("\n"); |
| 1045 |
#endif |
#endif |
| 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: |
| 1144 |
RMATCH(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); |
RM5); |
| 1146 |
if (rrc == MATCH_MATCH) RRETURN(MATCH_NOMATCH); |
if (rrc == MATCH_MATCH) RRETURN(MATCH_NOMATCH); |
| 1147 |
|
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); |
if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc); |
| 1153 |
ecode += GET(ecode,1); |
ecode += GET(ecode,1); |
| 1154 |
} |
} |
| 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 |
| 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)) |
if (!match_ref(offset, eptr, length, md, ims)) |
| 2157 |
{ |
{ |
| 2158 |
CHECK_PARTIAL(); |
CHECK_PARTIAL(); |
| 2159 |
break; |
break; |
| 2160 |
} |
} |
| 2161 |
eptr += length; |
eptr += length; |
| 2162 |
} |
} |
| 2163 |
while (eptr >= pp) |
while (eptr >= pp) |
| 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) |
if (eptr >= md->end_subject) |
| 2330 |
{ |
{ |
| 2331 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 2332 |
break; |
break; |
| 2333 |
} |
} |
| 2334 |
GETCHARLEN(c, eptr, len); |
GETCHARLEN(c, eptr, len); |
| 2335 |
if (c > 255) |
if (c > 255) |
| 2336 |
{ |
{ |
| 2356 |
{ |
{ |
| 2357 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 2358 |
{ |
{ |
| 2359 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 2360 |
{ |
{ |
| 2361 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 2362 |
break; |
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++; |
| 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) |
if (eptr >= md->end_subject) |
| 2469 |
{ |
{ |
| 2470 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 2471 |
break; |
break; |
| 2472 |
} |
} |
| 2473 |
GETCHARLENTEST(c, eptr, len); |
GETCHARLENTEST(c, eptr, len); |
| 2474 |
if (!_pcre_xclass(c, data)) break; |
if (!_pcre_xclass(c, data)) break; |
| 2475 |
eptr += len; |
eptr += len; |
| 2708 |
eptr <= md->end_subject - oclength && |
eptr <= md->end_subject - oclength && |
| 2709 |
memcmp(eptr, occhars, oclength) == 0) eptr += oclength; |
memcmp(eptr, occhars, oclength) == 0) eptr += oclength; |
| 2710 |
#endif /* SUPPORT_UCP */ |
#endif /* SUPPORT_UCP */ |
| 2711 |
else |
else |
| 2712 |
{ |
{ |
| 2713 |
CHECK_PARTIAL(); |
CHECK_PARTIAL(); |
| 2714 |
break; |
break; |
| 2715 |
} |
} |
| 2716 |
} |
} |
| 2717 |
|
|
| 2718 |
if (possessive) continue; |
if (possessive) continue; |
| 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) |
if (eptr >= md->end_subject) |
| 2794 |
{ |
{ |
| 2795 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 2796 |
break; |
break; |
| 2797 |
} |
} |
| 2798 |
if (fc != md->lcc[*eptr]) break; |
if (fc != md->lcc[*eptr]) break; |
| 2799 |
eptr++; |
eptr++; |
| 2800 |
} |
} |
| 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) |
if (eptr >= md->end_subject) |
| 2853 |
{ |
{ |
| 2854 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 2855 |
break; |
break; |
| 2856 |
} |
} |
| 2857 |
if (fc != *eptr) break; |
if (fc != *eptr) break; |
| 2858 |
eptr++; |
eptr++; |
| 2859 |
} |
} |
| 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) |
if (eptr >= md->end_subject) |
| 3070 |
{ |
{ |
| 3071 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 3072 |
break; |
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; |
| 3091 |
{ |
{ |
| 3092 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 3093 |
{ |
{ |
| 3094 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 3095 |
{ |
{ |
| 3096 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 3097 |
break; |
break; |
| 3098 |
} |
} |
| 3099 |
if (fc == md->lcc[*eptr]) break; |
if (fc == md->lcc[*eptr]) break; |
| 3100 |
eptr++; |
eptr++; |
| 3101 |
} |
} |
| 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) |
if (eptr >= md->end_subject) |
| 3209 |
{ |
{ |
| 3210 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 3211 |
break; |
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; |
| 3229 |
{ |
{ |
| 3230 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 3231 |
{ |
{ |
| 3232 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 3233 |
{ |
{ |
| 3234 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 3235 |
break; |
break; |
| 3236 |
} |
} |
| 3237 |
if (fc == *eptr) break; |
if (fc == *eptr) break; |
| 3238 |
eptr++; |
eptr++; |
| 3239 |
} |
} |
| 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) |
if (eptr >= md->end_subject) |
| 4394 |
{ |
{ |
| 4395 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4396 |
break; |
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; |
| 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) |
if (eptr >= md->end_subject) |
| 4409 |
{ |
{ |
| 4410 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4411 |
break; |
break; |
| 4412 |
} |
} |
| 4413 |
GETCHARLEN(c, eptr, len); |
GETCHARLEN(c, eptr, len); |
| 4414 |
prop_chartype = UCD_CHARTYPE(c); |
prop_chartype = UCD_CHARTYPE(c); |
| 4415 |
if ((prop_chartype == ucp_Lu || |
if ((prop_chartype == ucp_Lu || |
| 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) |
if (eptr >= md->end_subject) |
| 4428 |
{ |
{ |
| 4429 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4430 |
break; |
break; |
| 4431 |
} |
} |
| 4432 |
GETCHARLEN(c, eptr, len); |
GETCHARLEN(c, eptr, len); |
| 4433 |
prop_category = UCD_CATEGORY(c); |
prop_category = UCD_CATEGORY(c); |
| 4434 |
if ((prop_category == prop_value) == prop_fail_result) |
if ((prop_category == prop_value) == prop_fail_result) |
| 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) |
if (eptr >= md->end_subject) |
| 4445 |
{ |
{ |
| 4446 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4447 |
break; |
break; |
| 4448 |
} |
} |
| 4449 |
GETCHARLEN(c, eptr, len); |
GETCHARLEN(c, eptr, len); |
| 4450 |
prop_chartype = UCD_CHARTYPE(c); |
prop_chartype = UCD_CHARTYPE(c); |
| 4451 |
if ((prop_chartype == prop_value) == prop_fail_result) |
if ((prop_chartype == prop_value) == prop_fail_result) |
| 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) |
if (eptr >= md->end_subject) |
| 4462 |
{ |
{ |
| 4463 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4464 |
break; |
break; |
| 4465 |
} |
} |
| 4466 |
GETCHARLEN(c, eptr, len); |
GETCHARLEN(c, eptr, len); |
| 4467 |
prop_script = UCD_SCRIPT(c); |
prop_script = UCD_SCRIPT(c); |
| 4468 |
if ((prop_script == prop_value) == prop_fail_result) |
if ((prop_script == prop_value) == prop_fail_result) |
| 4491 |
{ |
{ |
| 4492 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 4493 |
{ |
{ |
| 4494 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4495 |
{ |
{ |
| 4496 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4497 |
break; |
break; |
| 4498 |
} |
} |
| 4499 |
GETCHARINCTEST(c, eptr); |
GETCHARINCTEST(c, eptr); |
| 4500 |
prop_category = UCD_CATEGORY(c); |
prop_category = UCD_CATEGORY(c); |
| 4501 |
if (prop_category == ucp_M) break; |
if (prop_category == ucp_M) break; |
| 4551 |
{ |
{ |
| 4552 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 4553 |
{ |
{ |
| 4554 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4555 |
{ |
{ |
| 4556 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4557 |
break; |
break; |
| 4558 |
} |
} |
| 4559 |
if (IS_NEWLINE(eptr)) break; |
if (IS_NEWLINE(eptr)) break; |
| 4560 |
eptr++; |
eptr++; |
| 4561 |
while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++; |
while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++; |
| 4568 |
{ |
{ |
| 4569 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 4570 |
{ |
{ |
| 4571 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4572 |
{ |
{ |
| 4573 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4574 |
break; |
break; |
| 4575 |
} |
} |
| 4576 |
if (IS_NEWLINE(eptr)) break; |
if (IS_NEWLINE(eptr)) break; |
| 4577 |
eptr++; |
eptr++; |
| 4578 |
while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++; |
while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++; |
| 4585 |
{ |
{ |
| 4586 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 4587 |
{ |
{ |
| 4588 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4589 |
{ |
{ |
| 4590 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4591 |
break; |
break; |
| 4592 |
} |
} |
| 4593 |
eptr++; |
eptr++; |
| 4594 |
while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++; |
while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++; |
| 4595 |
} |
} |
| 4605 |
{ |
{ |
| 4606 |
eptr = md->end_subject; |
eptr = md->end_subject; |
| 4607 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4608 |
} |
} |
| 4609 |
else eptr += c; |
else eptr += c; |
| 4610 |
break; |
break; |
| 4611 |
|
|
| 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) |
if (eptr >= md->end_subject) |
| 4617 |
{ |
{ |
| 4618 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4619 |
break; |
break; |
| 4620 |
} |
} |
| 4621 |
GETCHARLEN(c, eptr, len); |
GETCHARLEN(c, eptr, len); |
| 4622 |
if (c == 0x000d) |
if (c == 0x000d) |
| 4623 |
{ |
{ |
| 4642 |
{ |
{ |
| 4643 |
BOOL gotspace; |
BOOL gotspace; |
| 4644 |
int len = 1; |
int len = 1; |
| 4645 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4646 |
{ |
{ |
| 4647 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4648 |
break; |
break; |
| 4649 |
} |
} |
| 4650 |
GETCHARLEN(c, eptr, len); |
GETCHARLEN(c, eptr, len); |
| 4651 |
switch(c) |
switch(c) |
| 4652 |
{ |
{ |
| 4684 |
{ |
{ |
| 4685 |
BOOL gotspace; |
BOOL gotspace; |
| 4686 |
int len = 1; |
int len = 1; |
| 4687 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4688 |
{ |
{ |
| 4689 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4690 |
break; |
break; |
| 4691 |
} |
} |
| 4692 |
GETCHARLEN(c, eptr, len); |
GETCHARLEN(c, eptr, len); |
| 4693 |
switch(c) |
switch(c) |
| 4694 |
{ |
{ |
| 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) |
if (eptr >= md->end_subject) |
| 4716 |
{ |
{ |
| 4717 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4718 |
break; |
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; |
| 4727 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 4728 |
{ |
{ |
| 4729 |
int len = 1; |
int len = 1; |
| 4730 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4731 |
{ |
{ |
| 4732 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4733 |
break; |
break; |
| 4734 |
} |
} |
| 4735 |
GETCHARLEN(c, eptr, len); |
GETCHARLEN(c, eptr, len); |
| 4736 |
if (c >= 256 ||(md->ctypes[c] & ctype_digit) == 0) break; |
if (c >= 256 ||(md->ctypes[c] & ctype_digit) == 0) break; |
| 4737 |
eptr+= len; |
eptr+= len; |
| 4742 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 4743 |
{ |
{ |
| 4744 |
int len = 1; |
int len = 1; |
| 4745 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4746 |
{ |
{ |
| 4747 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4748 |
break; |
break; |
| 4749 |
} |
} |
| 4750 |
GETCHARLEN(c, eptr, len); |
GETCHARLEN(c, eptr, len); |
| 4751 |
if (c < 256 && (md->ctypes[c] & ctype_space) != 0) break; |
if (c < 256 && (md->ctypes[c] & ctype_space) != 0) break; |
| 4752 |
eptr+= len; |
eptr+= len; |
| 4757 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 4758 |
{ |
{ |
| 4759 |
int len = 1; |
int len = 1; |
| 4760 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4761 |
{ |
{ |
| 4762 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4763 |
break; |
break; |
| 4764 |
} |
} |
| 4765 |
GETCHARLEN(c, eptr, len); |
GETCHARLEN(c, eptr, len); |
| 4766 |
if (c >= 256 ||(md->ctypes[c] & ctype_space) == 0) break; |
if (c >= 256 ||(md->ctypes[c] & ctype_space) == 0) break; |
| 4767 |
eptr+= len; |
eptr+= len; |
| 4772 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 4773 |
{ |
{ |
| 4774 |
int len = 1; |
int len = 1; |
| 4775 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4776 |
{ |
{ |
| 4777 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4778 |
break; |
break; |
| 4779 |
} |
} |
| 4780 |
GETCHARLEN(c, eptr, len); |
GETCHARLEN(c, eptr, len); |
| 4781 |
if (c < 256 && (md->ctypes[c] & ctype_word) != 0) break; |
if (c < 256 && (md->ctypes[c] & ctype_word) != 0) break; |
| 4782 |
eptr+= len; |
eptr+= len; |
| 4787 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 4788 |
{ |
{ |
| 4789 |
int len = 1; |
int len = 1; |
| 4790 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4791 |
{ |
{ |
| 4792 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4793 |
break; |
break; |
| 4794 |
} |
} |
| 4795 |
GETCHARLEN(c, eptr, len); |
GETCHARLEN(c, eptr, len); |
| 4796 |
if (c >= 256 || (md->ctypes[c] & ctype_word) == 0) break; |
if (c >= 256 || (md->ctypes[c] & ctype_word) == 0) break; |
| 4797 |
eptr+= len; |
eptr+= len; |
| 4823 |
case OP_ANY: |
case OP_ANY: |
| 4824 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 4825 |
{ |
{ |
| 4826 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4827 |
{ |
{ |
| 4828 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4829 |
break; |
break; |
| 4830 |
} |
} |
| 4831 |
if (IS_NEWLINE(eptr)) break; |
if (IS_NEWLINE(eptr)) break; |
| 4832 |
eptr++; |
eptr++; |
| 4833 |
} |
} |
| 4840 |
{ |
{ |
| 4841 |
eptr = md->end_subject; |
eptr = md->end_subject; |
| 4842 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4843 |
} |
} |
| 4844 |
else eptr += c; |
else eptr += c; |
| 4845 |
break; |
break; |
| 4846 |
|
|
| 4847 |
case OP_ANYNL: |
case OP_ANYNL: |
| 4848 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 4849 |
{ |
{ |
| 4850 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4851 |
{ |
{ |
| 4852 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4853 |
break; |
break; |
| 4854 |
} |
} |
| 4855 |
c = *eptr; |
c = *eptr; |
| 4856 |
if (c == 0x000d) |
if (c == 0x000d) |
| 4857 |
{ |
{ |
| 4872 |
case OP_NOT_HSPACE: |
case OP_NOT_HSPACE: |
| 4873 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 4874 |
{ |
{ |
| 4875 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4876 |
{ |
{ |
| 4877 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4878 |
break; |
break; |
| 4879 |
} |
} |
| 4880 |
c = *eptr; |
c = *eptr; |
| 4881 |
if (c == 0x09 || c == 0x20 || c == 0xa0) break; |
if (c == 0x09 || c == 0x20 || c == 0xa0) break; |
| 4882 |
eptr++; |
eptr++; |
| 4886 |
case OP_HSPACE: |
case OP_HSPACE: |
| 4887 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 4888 |
{ |
{ |
| 4889 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4890 |
{ |
{ |
| 4891 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4892 |
break; |
break; |
| 4893 |
} |
} |
| 4894 |
c = *eptr; |
c = *eptr; |
| 4895 |
if (c != 0x09 && c != 0x20 && c != 0xa0) break; |
if (c != 0x09 && c != 0x20 && c != 0xa0) break; |
| 4896 |
eptr++; |
eptr++; |
| 4900 |
case OP_NOT_VSPACE: |
case OP_NOT_VSPACE: |
| 4901 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 4902 |
{ |
{ |
| 4903 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4904 |
{ |
{ |
| 4905 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4906 |
break; |
break; |
| 4907 |
} |
} |
| 4908 |
c = *eptr; |
c = *eptr; |
| 4909 |
if (c == 0x0a || c == 0x0b || c == 0x0c || c == 0x0d || c == 0x85) |
if (c == 0x0a || c == 0x0b || c == 0x0c || c == 0x0d || c == 0x85) |
| 4910 |
break; |
break; |
| 4915 |
case OP_VSPACE: |
case OP_VSPACE: |
| 4916 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 4917 |
{ |
{ |
| 4918 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4919 |
{ |
{ |
| 4920 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4921 |
break; |
break; |
| 4922 |
} |
} |
| 4923 |
c = *eptr; |
c = *eptr; |
| 4924 |
if (c != 0x0a && c != 0x0b && c != 0x0c && c != 0x0d && c != 0x85) |
if (c != 0x0a && c != 0x0b && c != 0x0c && c != 0x0d && c != 0x85) |
| 4925 |
break; |
break; |
| 4930 |
case OP_NOT_DIGIT: |
case OP_NOT_DIGIT: |
| 4931 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 4932 |
{ |
{ |
| 4933 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4934 |
{ |
{ |
| 4935 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4936 |
break; |
break; |
| 4937 |
} |
} |
| 4938 |
if ((md->ctypes[*eptr] & ctype_digit) != 0) break; |
if ((md->ctypes[*eptr] & ctype_digit) != 0) break; |
| 4939 |
eptr++; |
eptr++; |
| 4940 |
} |
} |
| 4943 |
case OP_DIGIT: |
case OP_DIGIT: |
| 4944 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 4945 |
{ |
{ |
| 4946 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4947 |
{ |
{ |
| 4948 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4949 |
break; |
break; |
| 4950 |
} |
} |
| 4951 |
if ((md->ctypes[*eptr] & ctype_digit) == 0) break; |
if ((md->ctypes[*eptr] & ctype_digit) == 0) break; |
| 4952 |
eptr++; |
eptr++; |
| 4953 |
} |
} |
| 4956 |
case OP_NOT_WHITESPACE: |
case OP_NOT_WHITESPACE: |
| 4957 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 4958 |
{ |
{ |
| 4959 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4960 |
{ |
{ |
| 4961 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4962 |
break; |
break; |
| 4963 |
} |
} |
| 4964 |
if ((md->ctypes[*eptr] & ctype_space) != 0) break; |
if ((md->ctypes[*eptr] & ctype_space) != 0) break; |
| 4965 |
eptr++; |
eptr++; |
| 4966 |
} |
} |
| 4969 |
case OP_WHITESPACE: |
case OP_WHITESPACE: |
| 4970 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 4971 |
{ |
{ |
| 4972 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4973 |
{ |
{ |
| 4974 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4975 |
break; |
break; |
| 4976 |
} |
} |
| 4977 |
if ((md->ctypes[*eptr] & ctype_space) == 0) break; |
if ((md->ctypes[*eptr] & ctype_space) == 0) break; |
| 4978 |
eptr++; |
eptr++; |
| 4979 |
} |
} |
| 4982 |
case OP_NOT_WORDCHAR: |
case OP_NOT_WORDCHAR: |
| 4983 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 4984 |
{ |
{ |
| 4985 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4986 |
{ |
{ |
| 4987 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 4988 |
break; |
break; |
| 4989 |
} |
} |
| 4990 |
if ((md->ctypes[*eptr] & ctype_word) != 0) break; |
if ((md->ctypes[*eptr] & ctype_word) != 0) break; |
| 4991 |
eptr++; |
eptr++; |
| 4992 |
} |
} |
| 4995 |
case OP_WORDCHAR: |
case OP_WORDCHAR: |
| 4996 |
for (i = min; i < max; i++) |
for (i = min; i < max; i++) |
| 4997 |
{ |
{ |
| 4998 |
if (eptr >= md->end_subject) |
if (eptr >= md->end_subject) |
| 4999 |
{ |
{ |
| 5000 |
SCHECK_PARTIAL(); |
SCHECK_PARTIAL(); |
| 5001 |
break; |
break; |
| 5002 |
} |
} |
| 5003 |
if ((md->ctypes[*eptr] & ctype_word) == 0) break; |
if ((md->ctypes[*eptr] & ctype_word) == 0) break; |
| 5004 |
eptr++; |
eptr++; |
| 5005 |
} |
} |
| 5572 |
bytes to avoid spending too much time in this optimization. */ |
bytes to avoid spending too much time in this optimization. */ |
| 5573 |
|
|
| 5574 |
if (study != NULL && (study->flags & PCRE_STUDY_MINLEN) != 0 && |
if (study != NULL && (study->flags & PCRE_STUDY_MINLEN) != 0 && |
| 5575 |
end_subject - start_match < study->minlength) |
(pcre_uint32)(end_subject - start_match) < study->minlength) |
| 5576 |
{ |
{ |
| 5577 |
rc = MATCH_NOMATCH; |
rc = MATCH_NOMATCH; |
| 5578 |
break; |
break; |
| 5635 |
} |
} |
| 5636 |
} |
} |
| 5637 |
|
|
| 5638 |
#ifdef DEBUG /* Sigh. Some compilers never learn. */ |
#ifdef PCRE_DEBUG /* Sigh. Some compilers never learn. */ |
| 5639 |
printf(">>>> Match against: "); |
printf(">>>> Match against: "); |
| 5640 |
pchars(start_match, end_subject - start_match, TRUE, md); |
pchars(start_match, end_subject - start_match, TRUE, md); |
| 5641 |
printf("\n"); |
printf("\n"); |