140 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
212    (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
217    (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
305     s->hash_shift =  ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);  in deflateInit2_()
352     if (length < MIN_MATCH) return Z_OK;  in deflateSetDictionary()
367     for (n = 0; n <= length - MIN_MATCH; n++) {  in deflateSetDictionary()
1028     s->match_length = s->prev_length = MIN_MATCH-1;  in lm_init()
1223     if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;  in longest_match_fast()
1249     if (len < MIN_MATCH) return MIN_MATCH - 1;  in longest_match_fast()
1371         if (s->lookahead >= MIN_MATCH) {  in fill_window()
1374 #if MIN_MATCH != 3  in fill_window()
1375             Call UPDATE_HASH() MIN_MATCH-3 more times  in fill_window()
1495         if (s->lookahead >= MIN_MATCH) {  in deflate_fast()
1521         if (s->match_length >= MIN_MATCH) {  in deflate_fast()
1525                            s->match_length - MIN_MATCH, bflush);  in deflate_fast()
1534                 s->lookahead >= MIN_MATCH) {  in deflate_fast()
1551 #if MIN_MATCH != 3  in deflate_fast()
1552                 Call UPDATE_HASH() MIN_MATCH-3 more times  in deflate_fast()
1601         if (s->lookahead >= MIN_MATCH) {  in deflate_slow()
1609         s->match_length = MIN_MATCH-1;  in deflate_slow()
1626                 || (s->match_length == MIN_MATCH &&  in deflate_slow()
1634                 s->match_length = MIN_MATCH-1;  in deflate_slow()
1640         if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {  in deflate_slow()
1641             uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;  in deflate_slow()
1647                            s->prev_length - MIN_MATCH, bflush);  in deflate_slow()
1662             s->match_length = MIN_MATCH-1;  in deflate_slow()
1741         if (run >= MIN_MATCH) {
1743             _tr_tally_dist(s, 1, run - MIN_MATCH, bflush);