| 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. */ |
| 211 |
**************************************************************************** |
**************************************************************************** |
| 212 |
***************************************************************************/ |
***************************************************************************/ |
| 213 |
|
|
| 214 |
|
/* Numbers for RMATCH calls. When this list is changed, the code at HEAP_RETURN |
| 215 |
/* Numbers for RMATCH calls */ |
below must be updated in sync. */ |
| 216 |
|
|
| 217 |
enum { RM1=1, RM2, RM3, RM4, RM5, RM6, RM7, RM8, RM9, RM10, |
enum { RM1=1, RM2, RM3, RM4, RM5, RM6, RM7, RM8, RM9, RM10, |
| 218 |
RM11, RM12, RM13, RM14, RM15, RM16, RM17, RM18, RM19, RM20, |
RM11, RM12, RM13, RM14, RM15, RM16, RM17, RM18, RM19, RM20, |
| 219 |
RM21, RM22, RM23, RM24, RM25, RM26, RM27, RM28, RM29, RM30, |
RM21, RM22, RM23, RM24, RM25, RM26, RM27, RM28, RM29, RM30, |
| 220 |
RM31, RM32, RM33, RM34, RM35, RM36, RM37, RM38, RM39, RM40, |
RM31, RM32, RM33, RM34, RM35, RM36, RM37, RM38, RM39, RM40, |
| 221 |
RM41, RM42, RM43, RM44, RM45, RM46, RM47, RM48, RM49, RM50 }; |
RM41, RM42, RM43, RM44, RM45, RM46, RM47, RM48, RM49, RM50, |
| 222 |
|
RM51, RM52, RM53, RM54 }; |
| 223 |
|
|
| 224 |
/* 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 |
| 225 |
versions and production versions. Note that the "rw" argument of RMATCH isn't |
versions and production versions. Note that the "rw" argument of RMATCH isn't |
| 617 |
eptr >= md->end_subject && |
eptr >= md->end_subject && |
| 618 |
eptr > mstart) |
eptr > mstart) |
| 619 |
md->hitend = TRUE; |
md->hitend = TRUE; |
| 620 |
|
|
| 621 |
switch(op) |
switch(op) |
| 622 |
{ |
{ |
| 623 |
|
case OP_FAIL: |
| 624 |
|
RRETURN(MATCH_NOMATCH); |
| 625 |
|
|
| 626 |
|
case OP_PRUNE: |
| 627 |
|
RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, |
| 628 |
|
ims, eptrb, flags, RM51); |
| 629 |
|
if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
| 630 |
|
RRETURN(MATCH_PRUNE); |
| 631 |
|
|
| 632 |
|
case OP_COMMIT: |
| 633 |
|
RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, |
| 634 |
|
ims, eptrb, flags, RM52); |
| 635 |
|
if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
| 636 |
|
RRETURN(MATCH_COMMIT); |
| 637 |
|
|
| 638 |
|
case OP_SKIP: |
| 639 |
|
RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, |
| 640 |
|
ims, eptrb, flags, RM53); |
| 641 |
|
if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
| 642 |
|
md->start_match_ptr = eptr; /* Pass back current position */ |
| 643 |
|
RRETURN(MATCH_SKIP); |
| 644 |
|
|
| 645 |
|
case OP_THEN: |
| 646 |
|
RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, |
| 647 |
|
ims, eptrb, flags, RM54); |
| 648 |
|
if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
| 649 |
|
RRETURN(MATCH_THEN); |
| 650 |
|
|
| 651 |
/* 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 |
| 652 |
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. |
| 653 |
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 |
| 689 |
{ |
{ |
| 690 |
RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, |
RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, |
| 691 |
ims, eptrb, flags, RM1); |
ims, eptrb, flags, RM1); |
| 692 |
if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc); |
| 693 |
md->capture_last = save_capture_last; |
md->capture_last = save_capture_last; |
| 694 |
ecode += GET(ecode, 1); |
ecode += GET(ecode, 1); |
| 695 |
} |
} |
| 748 |
|
|
| 749 |
RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, ims, |
RMATCH(eptr, ecode + _pcre_OP_lengths[*ecode], offset_top, md, ims, |
| 750 |
eptrb, flags, RM2); |
eptrb, flags, RM2); |
| 751 |
if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc); |
| 752 |
ecode += GET(ecode, 1); |
ecode += GET(ecode, 1); |
| 753 |
} |
} |
| 754 |
/* Control never reaches here. */ |
/* Control never reaches here. */ |
| 796 |
ecode += 1 + LINK_SIZE + GET(ecode, LINK_SIZE + 2); |
ecode += 1 + LINK_SIZE + GET(ecode, LINK_SIZE + 2); |
| 797 |
while (*ecode == OP_ALT) ecode += GET(ecode, 1); |
while (*ecode == OP_ALT) ecode += GET(ecode, 1); |
| 798 |
} |
} |
| 799 |
else if (rrc != MATCH_NOMATCH) |
else if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) |
| 800 |
{ |
{ |
| 801 |
RRETURN(rrc); /* Need braces because of following else */ |
RRETURN(rrc); /* Need braces because of following else */ |
| 802 |
} |
} |
| 833 |
break; |
break; |
| 834 |
|
|
| 835 |
|
|
| 836 |
/* End of the pattern. If we are in a top-level recursion, we should |
/* End of the pattern, either real or forced. If we are in a top-level |
| 837 |
restore the offsets appropriately and continue from after the call. */ |
recursion, we should restore the offsets appropriately and continue from |
| 838 |
|
after the call. */ |
| 839 |
|
|
| 840 |
|
case OP_ACCEPT: |
| 841 |
case OP_END: |
case OP_END: |
| 842 |
if (md->recursive != NULL && md->recursive->group_num == 0) |
if (md->recursive != NULL && md->recursive->group_num == 0) |
| 843 |
{ |
{ |
| 858 |
if (md->notempty && eptr == mstart) RRETURN(MATCH_NOMATCH); |
if (md->notempty && eptr == mstart) RRETURN(MATCH_NOMATCH); |
| 859 |
md->end_match_ptr = eptr; /* Record where we ended */ |
md->end_match_ptr = eptr; /* Record where we ended */ |
| 860 |
md->end_offset_top = offset_top; /* and how many extracts were taken */ |
md->end_offset_top = offset_top; /* and how many extracts were taken */ |
| 861 |
md->start_match_ptr = mstart; /* and the start (\K can modify) */ |
md->start_match_ptr = mstart; /* and the start (\K can modify) */ |
| 862 |
RRETURN(MATCH_MATCH); |
RRETURN(MATCH_MATCH); |
| 863 |
|
|
| 864 |
/* Change option settings */ |
/* Change option settings */ |
| 882 |
RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, NULL, 0, |
RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, NULL, 0, |
| 883 |
RM4); |
RM4); |
| 884 |
if (rrc == MATCH_MATCH) break; |
if (rrc == MATCH_MATCH) break; |
| 885 |
if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc); |
| 886 |
ecode += GET(ecode, 1); |
ecode += GET(ecode, 1); |
| 887 |
} |
} |
| 888 |
while (*ecode == OP_ALT); |
while (*ecode == OP_ALT); |
| 909 |
RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, NULL, 0, |
RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, NULL, 0, |
| 910 |
RM5); |
RM5); |
| 911 |
if (rrc == MATCH_MATCH) RRETURN(MATCH_NOMATCH); |
if (rrc == MATCH_MATCH) RRETURN(MATCH_NOMATCH); |
| 912 |
if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc); |
| 913 |
ecode += GET(ecode,1); |
ecode += GET(ecode,1); |
| 914 |
} |
} |
| 915 |
while (*ecode == OP_ALT); |
while (*ecode == OP_ALT); |
| 1046 |
(pcre_free)(new_recursive.offset_save); |
(pcre_free)(new_recursive.offset_save); |
| 1047 |
RRETURN(MATCH_MATCH); |
RRETURN(MATCH_MATCH); |
| 1048 |
} |
} |
| 1049 |
else if (rrc != MATCH_NOMATCH) |
else if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) |
| 1050 |
{ |
{ |
| 1051 |
DPRINTF(("Recursion gave error %d\n", rrc)); |
DPRINTF(("Recursion gave error %d\n", rrc)); |
| 1052 |
RRETURN(rrc); |
RRETURN(rrc); |
| 1082 |
{ |
{ |
| 1083 |
RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, eptrb, 0, RM7); |
RMATCH(eptr, ecode + 1 + LINK_SIZE, offset_top, md, ims, eptrb, 0, RM7); |
| 1084 |
if (rrc == MATCH_MATCH) break; |
if (rrc == MATCH_MATCH) break; |
| 1085 |
if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
if (rrc != MATCH_NOMATCH && rrc != MATCH_THEN) RRETURN(rrc); |
| 1086 |
ecode += GET(ecode,1); |
ecode += GET(ecode,1); |
| 1087 |
} |
} |
| 1088 |
while (*ecode == OP_ALT); |
while (*ecode == OP_ALT); |
| 2088 |
RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM21); |
RMATCH(eptr, ecode, offset_top, md, ims, eptrb, 0, RM21); |
| 2089 |
if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
if (rrc != MATCH_NOMATCH) RRETURN(rrc); |
| 2090 |
if (eptr-- == pp) break; /* Stop if tried at original pos */ |
if (eptr-- == pp) break; /* Stop if tried at original pos */ |
| 2091 |
BACKCHAR(eptr); |
if (utf8) BACKCHAR(eptr); |
| 2092 |
} |
} |
| 2093 |
RRETURN(MATCH_NOMATCH); |
RRETURN(MATCH_NOMATCH); |
| 2094 |
} |
} |
| 3093 |
for (i = 1; i <= min; i++) |
for (i = 1; i <= min; i++) |
| 3094 |
{ |
{ |
| 3095 |
if (eptr >= md->end_subject || |
if (eptr >= md->end_subject || |
| 3096 |
(*eptr < 128 && (md->ctypes[*eptr++] & ctype_space) != 0)) |
(*eptr < 128 && (md->ctypes[*eptr] & ctype_space) != 0)) |
| 3097 |
RRETURN(MATCH_NOMATCH); |
RRETURN(MATCH_NOMATCH); |
| 3098 |
while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++; |
while (++eptr < md->end_subject && (*eptr & 0xc0) == 0x80); |
| 3099 |
} |
} |
| 3100 |
break; |
break; |
| 3101 |
|
|
| 3113 |
for (i = 1; i <= min; i++) |
for (i = 1; i <= min; i++) |
| 3114 |
{ |
{ |
| 3115 |
if (eptr >= md->end_subject || |
if (eptr >= md->end_subject || |
| 3116 |
(*eptr < 128 && (md->ctypes[*eptr++] & ctype_word) != 0)) |
(*eptr < 128 && (md->ctypes[*eptr] & ctype_word) != 0)) |
| 3117 |
RRETURN(MATCH_NOMATCH); |
RRETURN(MATCH_NOMATCH); |
| 3118 |
while (eptr < md->end_subject && (*eptr & 0xc0) == 0x80) eptr++; |
while (++eptr < md->end_subject && (*eptr & 0xc0) == 0x80); |
| 3119 |
} |
} |
| 3120 |
break; |
break; |
| 3121 |
|
|
| 4228 |
LBL(17) LBL(18) LBL(19) LBL(20) LBL(21) LBL(22) LBL(23) LBL(24) |
LBL(17) LBL(18) LBL(19) LBL(20) LBL(21) LBL(22) LBL(23) LBL(24) |
| 4229 |
LBL(25) LBL(26) LBL(27) LBL(28) LBL(29) LBL(30) LBL(31) LBL(32) |
LBL(25) LBL(26) LBL(27) LBL(28) LBL(29) LBL(30) LBL(31) LBL(32) |
| 4230 |
LBL(33) LBL(34) LBL(35) LBL(36) LBL(37) LBL(38) LBL(39) LBL(40) |
LBL(33) LBL(34) LBL(35) LBL(36) LBL(37) LBL(38) LBL(39) LBL(40) |
| 4231 |
LBL(41) LBL(42) LBL(43) LBL(44) LBL(45) LBL(46) LBL(47) |
LBL(41) LBL(42) LBL(43) LBL(44) LBL(45) LBL(46) LBL(47) LBL(48) |
| 4232 |
|
LBL(49) LBL(50) LBL(51) LBL(52) LBL(53) LBL(54) |
| 4233 |
default: |
default: |
| 4234 |
DPRINTF(("jump error in pcre match: label %d non-existent\n", frame->Xwhere)); |
DPRINTF(("jump error in pcre match: label %d non-existent\n", frame->Xwhere)); |
| 4235 |
return PCRE_ERROR_INTERNAL; |
return PCRE_ERROR_INTERNAL; |
| 4586 |
for(;;) |
for(;;) |
| 4587 |
{ |
{ |
| 4588 |
USPTR save_end_subject = end_subject; |
USPTR save_end_subject = end_subject; |
| 4589 |
|
USPTR new_start_match; |
| 4590 |
|
|
| 4591 |
/* Reset the maximum number of extractions we might see. */ |
/* Reset the maximum number of extractions we might see. */ |
| 4592 |
|
|
| 4727 |
|
|
| 4728 |
/* OK, we can now run the match. */ |
/* OK, we can now run the match. */ |
| 4729 |
|
|
| 4730 |
md->start_match_ptr = start_match; /* Insurance */ |
md->start_match_ptr = start_match; |
| 4731 |
md->match_call_count = 0; |
md->match_call_count = 0; |
| 4732 |
rc = match(start_match, md->start_code, start_match, 2, md, ims, NULL, 0, 0); |
rc = match(start_match, md->start_code, start_match, 2, md, ims, NULL, 0, 0); |
| 4733 |
|
|
| 4734 |
/* Any return other than MATCH_NOMATCH breaks the loop. */ |
switch(rc) |
| 4735 |
|
{ |
| 4736 |
|
/* NOMATCH and PRUNE advance by one character. THEN at this level acts |
| 4737 |
|
exactly like PRUNE. */ |
| 4738 |
|
|
| 4739 |
|
case MATCH_NOMATCH: |
| 4740 |
|
case MATCH_PRUNE: |
| 4741 |
|
case MATCH_THEN: |
| 4742 |
|
new_start_match = start_match + 1; |
| 4743 |
|
#ifdef SUPPORT_UTF8 |
| 4744 |
|
if (utf8) |
| 4745 |
|
while(new_start_match < end_subject && (*new_start_match & 0xc0) == 0x80) |
| 4746 |
|
new_start_match++; |
| 4747 |
|
#endif |
| 4748 |
|
break; |
| 4749 |
|
|
| 4750 |
|
/* SKIP passes back the next starting point explicitly. */ |
| 4751 |
|
|
| 4752 |
|
case MATCH_SKIP: |
| 4753 |
|
new_start_match = md->start_match_ptr; |
| 4754 |
|
break; |
| 4755 |
|
|
| 4756 |
|
/* COMMIT disables the bumpalong, but otherwise behaves as NOMATCH. */ |
| 4757 |
|
|
| 4758 |
|
case MATCH_COMMIT: |
| 4759 |
|
rc = MATCH_NOMATCH; |
| 4760 |
|
goto ENDLOOP; |
| 4761 |
|
|
| 4762 |
if (rc != MATCH_NOMATCH) break; |
/* Any other return is some kind of error. */ |
| 4763 |
|
|
| 4764 |
|
default: |
| 4765 |
|
goto ENDLOOP; |
| 4766 |
|
} |
| 4767 |
|
|
| 4768 |
|
/* Control reaches here for the various types of "no match at this point" |
| 4769 |
|
result. Reset the code to MATCH_NOMATCH for subsequent checking. */ |
| 4770 |
|
|
| 4771 |
|
rc = MATCH_NOMATCH; |
| 4772 |
|
|
| 4773 |
/* If PCRE_FIRSTLINE is set, the match must happen before or at the first |
/* If PCRE_FIRSTLINE is set, the match must happen before or at the first |
| 4774 |
newline in the subject (though it may continue over the newline). Therefore, |
newline in the subject (though it may continue over the newline). Therefore, |
| 4776 |
|
|
| 4777 |
if (firstline && IS_NEWLINE(start_match)) break; |
if (firstline && IS_NEWLINE(start_match)) break; |
| 4778 |
|
|
| 4779 |
/* Advance the match position by one character. */ |
/* Advance to new matching position */ |
| 4780 |
|
|
| 4781 |
start_match++; |
start_match = new_start_match; |
|
#ifdef SUPPORT_UTF8 |
|
|
if (utf8) |
|
|
while(start_match < end_subject && (*start_match & 0xc0) == 0x80) |
|
|
start_match++; |
|
|
#endif |
|
| 4782 |
|
|
| 4783 |
/* Break the loop if the pattern is anchored or if we have passed the end of |
/* Break the loop if the pattern is anchored or if we have passed the end of |
| 4784 |
the subject. */ |
the subject. */ |
| 4804 |
/* We reach here when rc is not MATCH_NOMATCH, or if one of the stopping |
/* We reach here when rc is not MATCH_NOMATCH, or if one of the stopping |
| 4805 |
conditions is true: |
conditions is true: |
| 4806 |
|
|
| 4807 |
(1) The pattern is anchored; |
(1) The pattern is anchored or the match was failed by (*COMMIT); |
| 4808 |
|
|
| 4809 |
(2) We are past the end of the subject; |
(2) We are past the end of the subject; |
| 4810 |
|
|
| 4819 |
certain parts of the pattern were not used, even though there are more |
certain parts of the pattern were not used, even though there are more |
| 4820 |
capturing parentheses than vector slots. */ |
capturing parentheses than vector slots. */ |
| 4821 |
|
|
| 4822 |
|
ENDLOOP: |
| 4823 |
|
|
| 4824 |
if (rc == MATCH_MATCH) |
if (rc == MATCH_MATCH) |
| 4825 |
{ |
{ |
| 4826 |
if (using_temporary_offsets) |
if (using_temporary_offsets) |