Lines Matching refs:MIN_MATCH
149 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
173 * characters and the first MIN_MATCH bytes of str are valid (except for
174 * the last MIN_MATCH-1 bytes of the input file).
178 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
183 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
319 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
417 while (s->lookahead >= MIN_MATCH) {
419 n = s->lookahead - (MIN_MATCH-1);
421 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
429 s->lookahead = MIN_MATCH-1;
436 s->match_length = s->prev_length = MIN_MATCH-1;
1212 s->match_length = s->prev_length = MIN_MATCH-1;
1407 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1432 if (len < MIN_MATCH) return MIN_MATCH - 1;
1538 if (s->lookahead + s->insert >= MIN_MATCH) {
1542 #if MIN_MATCH != 3
1543 Call UPDATE_HASH() MIN_MATCH-3 more times
1546 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
1553 if (s->lookahead + s->insert < MIN_MATCH)
1557 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
1834 * for the next match, plus MIN_MATCH bytes to insert the
1849 if (s->lookahead >= MIN_MATCH) {
1854 * At this point we have always match_length < MIN_MATCH
1864 if (s->match_length >= MIN_MATCH) {
1868 s->match_length - MIN_MATCH, bflush);
1877 s->lookahead >= MIN_MATCH) {
1883 * always MIN_MATCH bytes ahead.
1894 #if MIN_MATCH != 3
1895 Call UPDATE_HASH() MIN_MATCH-3 more times
1897 /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
1910 s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;
1937 * for the next match, plus MIN_MATCH bytes to insert the
1952 if (s->lookahead >= MIN_MATCH) {
1959 s->match_length = MIN_MATCH-1;
1972 || (s->match_length == MIN_MATCH &&
1977 /* If prev_match is also MIN_MATCH, match_start is garbage
1980 s->match_length = MIN_MATCH-1;
1986 if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
1987 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1993 s->prev_length - MIN_MATCH, bflush);
2008 s->match_length = MIN_MATCH-1;
2041 s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;
2080 if (s->lookahead >= MIN_MATCH && s->strstart > 0) {
2098 /* Emit match if have run of MIN_MATCH or longer, else emit literal */
2099 if (s->match_length >= MIN_MATCH) {
2102 _tr_tally_dist(s, 1, s->match_length - MIN_MATCH, bflush);
