Lines Matching refs:MIN_MATCH
96 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
98 * See deflate.c for comments about the MIN_MATCH+1.
128 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
150 * input characters and the first MIN_MATCH bytes of str are valid
151 * (except for the last MIN_MATCH-1 bytes of the input file).
154 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
214 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
529 s->match_length = s->prev_length = MIN_MATCH-1;
801 if (s->lookahead >= MIN_MATCH) {
804 #if MIN_MATCH != 3
805 Call UPDATE_HASH() MIN_MATCH-3 more times
808 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
915 * for the next match, plus MIN_MATCH bytes to insert the
929 if (s->lookahead >= MIN_MATCH) {
934 * At this point we have always match_length < MIN_MATCH
946 if (s->match_length >= MIN_MATCH) {
950 s->match_length - MIN_MATCH);
958 s->lookahead >= MIN_MATCH) {
964 * always MIN_MATCH bytes ahead.
973 #if MIN_MATCH != 3
974 Call UPDATE_HASH() MIN_MATCH-3 more times
976 /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
1010 * for the next match, plus MIN_MATCH bytes to insert the
1024 if (s->lookahead >= MIN_MATCH) {
1031 s->match_length = MIN_MATCH-1;
1045 (s->match_length == MIN_MATCH &&
1048 /* If prev_match is also MIN_MATCH, match_start is garbage
1051 s->match_length = MIN_MATCH-1;
1057 if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
1058 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1064 s->prev_length - MIN_MATCH);
1079 s->match_length = MIN_MATCH-1;