godzil/tack
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

fixes from bruce: there are four, not three types of pattern that the

Browse Source 
routine findworst should look for
This commit is contained in:
ceriel
1988-09-27 11:16:04 +00:00
parent eb533b6430
commit 9e8d7bc6dd
2 changed files with 23 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
modules/src/em_opt/findworst.c
View File

@@ -23,11 +23,14 @@ findworst(patt,repl)
/* and a goto to state 0.
/* c) pattern of form: ri ri+1 ... rn pc ... pd
/* i.e. a suffix of <repl> starts a pattern.
/* requires a backup of n-i+1 instructions and a goto to state 0.
/* requires a backup of j-i+1 instructions and a goto to state 0.
/* d) pattern of the form: ri ri+1 ... rj
/* i.e. a substring of <repl> is a complete pattern
/* requires a backup of j-i+1 instructions and a goto to state 0.
*/
int n = repl.m_len;
int diff = patt.m_len - repl.m_len;
int first,i;
int first,i,j;
int s;
int mostbackups = 0;
if(n==0) {
@@ -56,6 +59,16 @@ findworst(patt,repl)
UPDATEWORST(n-i+1);
}
}
/* look for case d */
for(i=2;i<=n;i++) {
for(j=n-1;j>i;j--) {
if((first=leftmatch(patterns[s],repl,i,j)) &&
(first==1)&&
(j-i+1 == patterns[s].m_len)) {
UPDATEWORST(n-i+1);
}
}
}
}
fprintf(ofile,"\t\tOO_mkrepl(%d,%d,%d);\n",n,diff,mostbackups);
}