Lines Matching refs:MIN_MATCH

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++) {
1039     s->match_length = s->prev_length = MIN_MATCH-1;
1234     if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1259     if (len < MIN_MATCH) return MIN_MATCH - 1;
1384         if (s->lookahead >= MIN_MATCH) {
1387 #if MIN_MATCH != 3
1388             Call UPDATE_HASH() MIN_MATCH-3 more times
1545         if (s->lookahead >= MIN_MATCH) {
1560         if (s->match_length >= MIN_MATCH) {
1564                            s->match_length - MIN_MATCH, bflush);
1573                 s->lookahead >= MIN_MATCH) {
1590 #if MIN_MATCH != 3
1591                 Call UPDATE_HASH() MIN_MATCH-3 more times
1642         if (s->lookahead >= MIN_MATCH) {
1649         s->match_length = MIN_MATCH-1;
1662                 || (s->match_length == MIN_MATCH &&
1670                 s->match_length = MIN_MATCH-1;
1676         if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
1677             uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1683                            s->prev_length - MIN_MATCH, bflush);
1698             s->match_length = MIN_MATCH-1;
1764         if (s->lookahead >= MIN_MATCH && s->strstart > 0) {
1782         if (s->match_length >= MIN_MATCH) {
1785             _tr_tally_dist(s, 1, s->match_length - MIN_MATCH, bflush);