182    (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
187    (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
290     s->hash_shift =  ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);  in deflateInit2_()
363     while (s->lookahead >= MIN_MATCH) {  in deflateSetDictionary()
365         n = s->lookahead - (MIN_MATCH-1);  in deflateSetDictionary()
367             UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);  in deflateSetDictionary()
375         s->lookahead = MIN_MATCH-1;  in deflateSetDictionary()
382     s->match_length = s->prev_length = MIN_MATCH-1;  in deflateSetDictionary()
1123     s->match_length = s->prev_length = MIN_MATCH-1;  in lm_init()
1318     if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;  in longest_match()
1343     if (len < MIN_MATCH) return MIN_MATCH - 1;  in longest_match()
1470         if (s->lookahead + s->insert >= MIN_MATCH) {  in fill_window()
1474 #if MIN_MATCH != 3  in fill_window()
1475             Call UPDATE_HASH() MIN_MATCH-3 more times  in fill_window()
1478                 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);  in fill_window()
1485                 if (s->lookahead + s->insert < MIN_MATCH)  in fill_window()
1652         if (s->lookahead >= MIN_MATCH) {  in deflate_fast()
1667         if (s->match_length >= MIN_MATCH) {  in deflate_fast()
1671                            s->match_length - MIN_MATCH, bflush);  in deflate_fast()
1680                 s->lookahead >= MIN_MATCH) {  in deflate_fast()
1697 #if MIN_MATCH != 3  in deflate_fast()
1698                 Call UPDATE_HASH() MIN_MATCH-3 more times  in deflate_fast()
1713     s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;  in deflate_fast()
1755         if (s->lookahead >= MIN_MATCH) {  in deflate_slow()
1762         s->match_length = MIN_MATCH-1;  in deflate_slow()
1775                 || (s->match_length == MIN_MATCH &&  in deflate_slow()
1783                 s->match_length = MIN_MATCH-1;  in deflate_slow()
1789         if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {  in deflate_slow()
1790             uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;  in deflate_slow()
1796                            s->prev_length - MIN_MATCH, bflush);  in deflate_slow()
1811             s->match_length = MIN_MATCH-1;  in deflate_slow()
1844     s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;  in deflate_slow()
1883         if (s->lookahead >= MIN_MATCH && s->strstart > 0) {  in deflate_rle()
1902         if (s->match_length >= MIN_MATCH) {  in deflate_rle()
1905             _tr_tally_dist(s, 1, s->match_length - MIN_MATCH, bflush);  in deflate_rle()