Lines Matching full:prev_length
382 s->match_length = s->prev_length = MIN_MATCH-1;
1123 s->match_length = s->prev_length = MIN_MATCH-1;
1136 * return its length. Matches shorter or equal to prev_length are discarded,
1137 * in which case the result is equal to prev_length and match_start is
1140 * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
1155 int best_len = s->prev_length; /* best match length so far */
1184 if (s->prev_length >= s->good_match) {
1656 /* Find the longest match, discarding those <= prev_length.
1759 /* Find the longest match, discarding those <= prev_length.
1761 s->prev_length = s->match_length, s->prev_match = s->match_start;
1764 if (hash_head != NIL && s->prev_length < s->max_lazy_match &&
1789 if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
1793 check_match(s, s->strstart-1, s->prev_match, s->prev_length);
1796 s->prev_length - MIN_MATCH, bflush);
1803 s->lookahead -= s->prev_length-1;
1804 s->prev_length -= 2;
1809 } while (--s->prev_length != 0);
