Bommels05/Mozilla
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix simple-match optimization for positive and negative lookahead assertions (254296, r=shaver).

Browse Source 
git-svn-id: svn://10.0.0.236/trunk@160646 18797224-902f-48f8-a5cc-f745e15eee43
This commit is contained in:
brendan%mozilla.org
2004-08-11 02:27:29 +00:00
parent 5d37cefb31
commit 8e4956796a
1 changed files with 4 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
mozilla/js/src/jsregexp.c
View File

@@ -2504,7 +2504,8 @@ ExecuteREBytecode(REGlobalData *gData, REMatchState *x)
pc += ARG_LEN; /* start of ASSERT child */
op = (REOp) *pc++;
if (REOP_IS_SIMPLE(op) &&
!SimpleMatch(gData, x, op, &pc, JS_FALSE)) {
(!SimpleMatch(gData, x, op, &pc, JS_FALSE) ||
pc != nextpc)) {
result = NULL;
break;
}
@@ -2524,7 +2525,8 @@ ExecuteREBytecode(REGlobalData *gData, REMatchState *x)
pc += ARG_LEN;
op = (REOp) *pc++;
if (REOP_IS_SIMPLE(op) /* Note - fail to fail! */ &&
SimpleMatch(gData, x, op, &pc, JS_FALSE)) {
SimpleMatch(gData, x, op, &pc, JS_FALSE) &&
pc == nextpc) {
result = NULL;
break;
}