summaryrefslogtreecommitdiff
path: root/lib/libc/regex/regcomp.c
diff options
context:
space:
mode:
authorDaniel C. Sobral <dcs@FreeBSD.org>2000-07-06 06:34:15 +0000
committerDaniel C. Sobral <dcs@FreeBSD.org>2000-07-06 06:34:15 +0000
commit9868274b74837957cbd36be821c1ce8ffe7437bf (patch)
tree9c0f9fb9a7b0fe02ae16541cdf85e00281c2a56b /lib/libc/regex/regcomp.c
parent95674596b9c0f5f5054b9542c9fce1418ac754ae (diff)
Notes
Diffstat (limited to 'lib/libc/regex/regcomp.c')
-rw-r--r--lib/libc/regex/regcomp.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/libc/regex/regcomp.c b/lib/libc/regex/regcomp.c
index 9d1887895e30..30d1b01f9cff 100644
--- a/lib/libc/regex/regcomp.c
+++ b/lib/libc/regex/regcomp.c
@@ -1849,7 +1849,7 @@ register struct re_guts *g;
/*
- altoffset - choose biggest offset among multiple choices
- = static int altoffset(sop *scan, int offset, int mccs);
+ == static int altoffset(sop *scan, int offset, int mccs);
*
* Compute, recursively if necessary, the largest offset among multiple
* re paths.
@@ -2034,7 +2034,7 @@ struct re_guts *g;
ssuffix = pmatches[suffix];
while (suffix < g->mlen) {
- while (suffix <= ssuffix) {
+ while (suffix <= ssuffix && suffix < g->mlen) {
g->matchjump[suffix] = MIN(g->matchjump[suffix],
g->mlen + ssuffix - suffix);
suffix++;