Lines Matching defs:MIN_MATCH
133 #define MIN_MATCH 3
418 * step. It must be such that after MIN_MATCH steps, the
420 * hash_shift * MIN_MATCH >= hash_bits
571 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
574 * See deflate.c for comments about the MIN_MATCH+1.
746 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
749 * See deflate.c for comments about the MIN_MATCH+1.
781 * Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
811 * input characters and the first MIN_MATCH bytes of str are valid
812 * (except for the last MIN_MATCH-1 bytes of the input file).
816 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
821 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
916 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
966 if (length < MIN_MATCH)
987 for (n = 0; n <= length - MIN_MATCH; n++) {
1428 s->match_length = s->prev_length = MIN_MATCH-1;
1643 return (MIN_MATCH-1);
1670 if (len < MIN_MATCH)
1671 return (MIN_MATCH - 1);
1820 if (s->lookahead >= MIN_MATCH) {
1823 #if MIN_MATCH != 3
1824 Call UPDATE_HASH() MIN_MATCH-3 more times
1828 * If the whole input has less than MIN_MATCH bytes,
1951 * MAX_MATCH bytes for the next match, plus MIN_MATCH
1970 if (s->lookahead >= MIN_MATCH) {
1977 * match_length < MIN_MATCH
1993 if (s->match_length >= MIN_MATCH) {
1998 s->match_length - MIN_MATCH, bflush);
2009 s->lookahead >= MIN_MATCH) {
2019 * are always MIN_MATCH bytes
2032 #if MIN_MATCH != 3
2033 Call UPDATE_HASH() MIN_MATCH-3 more times
2036 * If lookahead < MIN_MATCH, ins_h is
2074 * MAX_MATCH bytes for the next match, plus MIN_MATCH
2094 if (s->lookahead >= MIN_MATCH) {
2104 s->match_length = MIN_MATCH-1;
2122 (s->match_length == MIN_MATCH &&
2126 * If prev_match is also MIN_MATCH,
2130 s->match_length = MIN_MATCH-1;
2138 if (s->prev_length >= MIN_MATCH &&
2141 MIN_MATCH;
2148 s->prev_length - MIN_MATCH, bflush);
2166 s->match_length = MIN_MATCH-1;
2326 local uch _length_code[MAX_MATCH-MIN_MATCH+1];
2327 /* length code for each normalized match length (0 == MIN_MATCH) */
2330 /* First normalized length for each code (0 = MIN_MATCH) */
3307 /* match length-MIN_MATCH or unmatched char (if dist==0) */
3317 /* Here, lc is the match length - MIN_MATCH */
3320 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
3378 /* Here, lc is the match length - MIN_MATCH */