Lines Matching defs:prev_length
255 unsigned prev_length;
577 * return its length. Matches shorter or equal to prev_length are discarded,
578 * in which case the result is equal to prev_length and match_start is
581 * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
594 int best_len = G1.prev_length; /* best match length so far */
611 if (G1.prev_length >= good_match) {
1723 /* Find the longest match, discarding those <= prev_length.
1725 G1.prev_length = match_length;
1729 if (hash_head != 0 && G1.prev_length < max_lazy_match
1752 if (G1.prev_length >= MIN_MATCH && match_length <= G1.prev_length) {
1753 check_match(G1.strstart - 1, prev_match, G1.prev_length);
1754 flush = ct_tally(G1.strstart - 1 - prev_match, G1.prev_length - MIN_MATCH);
1759 G1.lookahead -= G1.prev_length - 1;
1760 G1.prev_length -= 2;
1769 } while (--G1.prev_length != 0);