Lines Matching refs:MIN_MATCH

113 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
185    (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
190    (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
285     s->hash_shift =  ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
334     if (length < MIN_MATCH) return Z_OK;
349     for (n = 0; n <= length - MIN_MATCH; n++) {
1003     s->match_length = s->prev_length = MIN_MATCH-1;
1197     if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1222     if (len < MIN_MATCH) return MIN_MATCH - 1;
1346         if (s->lookahead >= MIN_MATCH) {
1349 #if MIN_MATCH != 3
1350             Call UPDATE_HASH() MIN_MATCH-3 more times
1472         if (s->lookahead >= MIN_MATCH) {
1498         if (s->match_length >= MIN_MATCH) {
1502                            s->match_length - MIN_MATCH, bflush);
1511                 s->lookahead >= MIN_MATCH) {
1528 #if MIN_MATCH != 3
1529                 Call UPDATE_HASH() MIN_MATCH-3 more times
1579         if (s->lookahead >= MIN_MATCH) {
1586         s->match_length = MIN_MATCH-1;
1603                 || (s->match_length == MIN_MATCH &&
1611                 s->match_length = MIN_MATCH-1;
1617         if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
1618             uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1624                            s->prev_length - MIN_MATCH, bflush);
1639             s->match_length = MIN_MATCH-1;
1719         if (run >= MIN_MATCH) {
1721             _tr_tally_dist(s, 1, run - MIN_MATCH, bflush);