Lines Matching refs:prev_length
645 s->match_length = s->prev_length = MIN_MATCH-1;
727 s->match_length = s->prev_length = MIN_MATCH-1;
1388 * return its length. Matches shorter or equal to prev_length are discarded,
1389 * in which case the result is equal to prev_length and match_start is
1392 * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
1400 int best_len = (int)s->prev_length; /* best match length so far */
1429 if (s->prev_length >= s->good_match) {
1894 /* Find the longest match, discarding those <= prev_length.
1997 /* Find the longest match, discarding those <= prev_length.
1999 s->prev_length = s->match_length, s->prev_match = s->match_start;
2002 if (hash_head != NIL && s->prev_length < s->max_lazy_match &&
2027 if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
2034 check_match(s, s->strstart, s->prev_match + 1, s->prev_length - 1);
2036 check_match(s, s->strstart - 1, s->prev_match, s->prev_length);
2040 s->prev_length - MIN_MATCH, bflush);
2047 s->lookahead -= s->prev_length - 1;
2048 s->prev_length -= 2;
2053 } while (--s->prev_length != 0);