Lines Matching full:prev_length
383 s->match_length = s->prev_length = MIN_MATCH-1;
1122 s->match_length = s->prev_length = MIN_MATCH-1;
1135 * return its length. Matches shorter or equal to prev_length are discarded,
1136 * in which case the result is equal to prev_length and match_start is
1139 * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
1154 int best_len = s->prev_length; /* best match length so far */
1183 if (s->prev_length >= s->good_match) {
1655 /* Find the longest match, discarding those <= prev_length.
1758 /* Find the longest match, discarding those <= prev_length.
1760 s->prev_length = s->match_length, s->prev_match = s->match_start;
1763 if (hash_head != NIL && s->prev_length < s->max_lazy_match &&
1788 if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
1792 check_match(s, s->strstart-1, s->prev_match, s->prev_length);
1795 s->prev_length - MIN_MATCH, bflush);
1802 s->lookahead -= s->prev_length-1;
1803 s->prev_length -= 2;
1808 } while (--s->prev_length != 0);
