Lines Matching refs:MIN_MATCH
146 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
177 * input characters and the first MIN_MATCH bytes of str are valid
178 * (except for the last MIN_MATCH-1 bytes of the input file).
182 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
187 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
291 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
364 while (s->lookahead >= MIN_MATCH) {
366 n = s->lookahead - (MIN_MATCH-1);
368 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
376 s->lookahead = MIN_MATCH-1;
383 s->match_length = s->prev_length = MIN_MATCH-1;
1122 s->match_length = s->prev_length = MIN_MATCH-1;
1317 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1342 if (len < MIN_MATCH) return MIN_MATCH - 1;
1469 if (s->lookahead + s->insert >= MIN_MATCH) {
1473 #if MIN_MATCH != 3
1474 Call UPDATE_HASH() MIN_MATCH-3 more times
1477 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
1484 if (s->lookahead + s->insert < MIN_MATCH)
1488 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
1636 * for the next match, plus MIN_MATCH bytes to insert the
1651 if (s->lookahead >= MIN_MATCH) {
1656 * At this point we have always match_length < MIN_MATCH
1666 if (s->match_length >= MIN_MATCH) {
1670 s->match_length - MIN_MATCH, bflush);
1679 s->lookahead >= MIN_MATCH) {
1685 * always MIN_MATCH bytes ahead.
1696 #if MIN_MATCH != 3
1697 Call UPDATE_HASH() MIN_MATCH-3 more times
1699 /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
1712 s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;
1739 * for the next match, plus MIN_MATCH bytes to insert the
1754 if (s->lookahead >= MIN_MATCH) {
1761 s->match_length = MIN_MATCH-1;
1774 || (s->match_length == MIN_MATCH &&
1779 /* If prev_match is also MIN_MATCH, match_start is garbage
1782 s->match_length = MIN_MATCH-1;
1788 if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
1789 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1795 s->prev_length - MIN_MATCH, bflush);
1810 s->match_length = MIN_MATCH-1;
1843 s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;
1882 if (s->lookahead >= MIN_MATCH && s->strstart > 0) {
1900 /* Emit match if have run of MIN_MATCH or longer, else emit literal */
1901 if (s->match_length >= MIN_MATCH) {
1904 _tr_tally_dist(s, 1, s->match_length - MIN_MATCH, bflush);