Lines Matching refs:MIN_MATCH

180    (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
185    (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
280     s->hash_shift =  ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
331     if (length < MIN_MATCH) return Z_OK;
346     for (n = 0; n <= length - MIN_MATCH; n++) {
1038     s->match_length = s->prev_length = MIN_MATCH-1;
1233     if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1258     if (len < MIN_MATCH) return MIN_MATCH - 1;
1383         if (s->lookahead >= MIN_MATCH) {
1386 #if MIN_MATCH != 3
1387             Call UPDATE_HASH() MIN_MATCH-3 more times
1544         if (s->lookahead >= MIN_MATCH) {
1559         if (s->match_length >= MIN_MATCH) {
1563                            s->match_length - MIN_MATCH, bflush);
1572                 s->lookahead >= MIN_MATCH) {
1589 #if MIN_MATCH != 3
1590                 Call UPDATE_HASH() MIN_MATCH-3 more times
1641         if (s->lookahead >= MIN_MATCH) {
1648         s->match_length = MIN_MATCH-1;
1661                 || (s->match_length == MIN_MATCH &&
1669                 s->match_length = MIN_MATCH-1;
1675         if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
1676             uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1682                            s->prev_length - MIN_MATCH, bflush);
1697             s->match_length = MIN_MATCH-1;
1763         if (s->lookahead >= MIN_MATCH && s->strstart > 0) {
1781         if (s->match_length >= MIN_MATCH) {
1784             _tr_tally_dist(s, 1, s->match_length - MIN_MATCH, bflush);