Lines 50-56
Link Here
|
50 |
register u_char *p, *s; |
50 |
register u_char *p, *s; |
51 |
register int c; |
51 |
register int c; |
52 |
int count, umlaut; |
52 |
int count, umlaut; |
53 |
u_char bigram1[NBG], bigram2[NBG], path[MAXPATHLEN]; |
53 |
u_char bigram1[NBG], bigram2[NBG], path[LOCPATHLEN]; |
54 |
for (c = 0, p = bigram1, s = bigram2; c < NBG; c++) { |
54 |
for (c = 0, p = bigram1, s = bigram2; c < NBG; c++) { |
55 |
p[c] = check_bigram_char(getc(fp)); |
55 |
p[c] = check_bigram_char(getc(fp)); |
Lines 143-149
Link Here
|
143 |
register int c, cc; |
143 |
register int c, cc; |
144 |
int count, found, globflag; |
144 |
int count, found, globflag; |
145 |
u_char *cutoff; |
145 |
u_char *cutoff; |
146 |
u_char bigram1[NBG], bigram2[NBG], path[MAXPATHLEN]; |
146 |
u_char bigram1[NBG], bigram2[NBG], path[LOCPATHLEN]; |
147 |
#ifdef FF_ICASE |
147 |
#ifdef FF_ICASE |
148 |
/* use a lookup table for case insensitive search */ |
148 |
/* use a lookup table for case insensitive search */ |
Lines 213-219
Link Here
|
213 |
count += c - OFFSET; |
213 |
count += c - OFFSET; |
214 |
} |
214 |
} |
215 |
if (count < 0 || count > MAXPATHLEN) |
215 |
if (count < 0 || count > LOCPATHLEN) |
216 |
errx(1, "corrupted database: %s", database); |
216 |
errx(1, "corrupted database: %s", database); |
217 |
/* overlay old path */ |
217 |
/* overlay old path */ |
218 |
p = path + count; |
218 |
p = path + count; |