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)]), \
290 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
363 while (s->lookahead >= MIN_MATCH) {
365 n = s->lookahead - (MIN_MATCH-1);
367 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
375 s->lookahead = MIN_MATCH-1;
382 s->match_length = s->prev_length = MIN_MATCH-1;
1123 s->match_length = s->prev_length = MIN_MATCH-1;
1318 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1343 if (len < MIN_MATCH) return MIN_MATCH - 1;
1470 if (s->lookahead + s->insert >= MIN_MATCH) {
1474 #if MIN_MATCH != 3
1475 Call UPDATE_HASH() MIN_MATCH-3 more times
1478 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
1485 if (s->lookahead + s->insert < MIN_MATCH)
1489 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
1637 * for the next match, plus MIN_MATCH bytes to insert the
1652 if (s->lookahead >= MIN_MATCH) {
1657 * At this point we have always match_length < MIN_MATCH
1667 if (s->match_length >= MIN_MATCH) {
1671 s->match_length - MIN_MATCH, bflush);
1680 s->lookahead >= MIN_MATCH) {
1686 * always MIN_MATCH bytes ahead.
1697 #if MIN_MATCH != 3
1698 Call UPDATE_HASH() MIN_MATCH-3 more times
1700 /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
1713 s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;
1740 * for the next match, plus MIN_MATCH bytes to insert the
1755 if (s->lookahead >= MIN_MATCH) {
1762 s->match_length = MIN_MATCH-1;
1775 || (s->match_length == MIN_MATCH &&
1780 /* If prev_match is also MIN_MATCH, match_start is garbage
1783 s->match_length = MIN_MATCH-1;
1789 if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
1790 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1796 s->prev_length - MIN_MATCH, bflush);
1811 s->match_length = MIN_MATCH-1;
1844 s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;
1883 if (s->lookahead >= MIN_MATCH && s->strstart > 0) {
1901 /* Emit match if have run of MIN_MATCH or longer, else emit literal */
1902 if (s->match_length >= MIN_MATCH) {
1905 _tr_tally_dist(s, 1, s->match_length - MIN_MATCH, bflush);
