Lines Matching refs:MIN_MATCH
113 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
115 * See deflate.c for comments about the MIN_MATCH+1.
152 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
180 * input characters and the first MIN_MATCH bytes of str are valid
181 * (except for the last MIN_MATCH-1 bytes of the input file).
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
1353 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
1458 * for the next match, plus MIN_MATCH bytes to insert the
1472 if (s->lookahead >= MIN_MATCH) {
1477 * At this point we have always match_length < MIN_MATCH
1498 if (s->match_length >= MIN_MATCH) {
1502 s->match_length - MIN_MATCH, bflush);
1511 s->lookahead >= MIN_MATCH) {
1517 * always MIN_MATCH bytes ahead.
1528 #if MIN_MATCH != 3
1529 Call UPDATE_HASH() MIN_MATCH-3 more times
1531 /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
1565 * for the next match, plus MIN_MATCH bytes to insert the
1579 if (s->lookahead >= MIN_MATCH) {
1586 s->match_length = MIN_MATCH-1;
1603 || (s->match_length == MIN_MATCH &&
1608 /* If prev_match is also MIN_MATCH, match_start is garbage
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;
1718 /* Emit match if have run of MIN_MATCH or longer, else emit literal */
1719 if (run >= MIN_MATCH) {
1721 _tr_tally_dist(s, 1, run - MIN_MATCH, bflush);