lib/zlib/deflate.c

179    (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
184    (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
279     s->hash_shift =  ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
330     if (length < MIN_MATCH) return Z_OK;
345     for (n = 0; n <= length - MIN_MATCH; n++) {
1037     s->match_length = s->prev_length = MIN_MATCH-1;
1232     if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1257     if (len < MIN_MATCH) return MIN_MATCH - 1;
1382         if (s->lookahead >= MIN_MATCH) {
1385 #if MIN_MATCH != 3
1386             Call UPDATE_HASH() MIN_MATCH-3 more times
1543         if (s->lookahead >= MIN_MATCH) {
1558         if (s->match_length >= MIN_MATCH) {
1562                            s->match_length - MIN_MATCH, bflush);
1571                 s->lookahead >= MIN_MATCH) {
1588 #if MIN_MATCH != 3
1589                 Call UPDATE_HASH() MIN_MATCH-3 more times
1640         if (s->lookahead >= MIN_MATCH) {
1647         s->match_length = MIN_MATCH-1;
1660                 || (s->match_length == MIN_MATCH &&
1668                 s->match_length = MIN_MATCH-1;
1674         if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
1675             uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1681                            s->prev_length - MIN_MATCH, bflush);
1696             s->match_length = MIN_MATCH-1;
1762         if (s->lookahead >= MIN_MATCH && s->strstart > 0) {
1780         if (s->match_length >= MIN_MATCH) {
1783             _tr_tally_dist(s, 1, s->match_length - MIN_MATCH, bflush);