Lines Matching defs:MIN_MATCH
111 #define MIN_MATCH 3
115 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
117 * See deflate.c for comments about the MIN_MATCH+1.
231 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
247 #define H_SHIFT ((HASH_BITS+MIN_MATCH-1) / MIN_MATCH)
249 * input step. It must be such that after MIN_MATCH steps, the oldest
251 * H_SHIFT * MIN_MATCH >= HASH_BITS
914 uch length_code[MAX_MATCH - MIN_MATCH + 1];
916 /* length code for each normalized match length (0 == MIN_MATCH) */
927 /* First normalized length for each code (0 = MIN_MATCH) */
1490 /* Here, lc is the match length - MIN_MATCH */
1493 && (ush) lc <= (ush) (MAX_MATCH - MIN_MATCH)
1558 /* Here, lc is the match length - MIN_MATCH */
1709 * input characters and the first MIN_MATCH bytes of s are valid
1710 * (except for the last MIN_MATCH-1 bytes of the input file). */
1713 UPDATE_HASH(G1.ins_h, G1.window[(s) + MIN_MATCH-1]); \
1724 unsigned match_length = MIN_MATCH - 1; /* length of best match */
1737 match_length = MIN_MATCH - 1;
1752 if (match_length == MIN_MATCH && G1.strstart - G1.match_start > TOO_FAR) {
1753 /* If prev_match is also MIN_MATCH, G1.match_start is garbage
1762 if (G1.prev_length >= MIN_MATCH && match_length <= G1.prev_length) {
1764 flush = ct_tally(G1.strstart - 1 - prev_match, G1.prev_length - MIN_MATCH);
1775 * always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH
1781 match_length = MIN_MATCH - 1;
1811 * for the next match, plus MIN_MATCH bytes to insert the
1871 for (j = 0; j < MIN_MATCH - 1; j++)
1873 /* If lookahead < MIN_MATCH, ins_h is garbage, but this is