Lines Matching defs:MIN_MATCH
121 #define MIN_MATCH 3
389 * step. It must be such that after MIN_MATCH steps, the oldest
391 * hash_shift * MIN_MATCH >= hash_bits
517 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
519 * See deflate.c for comments about the MIN_MATCH+1.
647 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
649 * See deflate.c for comments about the MIN_MATCH+1.
679 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
705 * input characters and the first MIN_MATCH bytes of str are valid
706 * (except for the last MIN_MATCH-1 bytes of the input file).
709 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
793 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
840 if (length < MIN_MATCH) return Z_OK;
857 for (n = 0; n <= length - MIN_MATCH; n++) {
1248 s->match_length = s->prev_length = MIN_MATCH-1;
1522 if (s->lookahead >= MIN_MATCH) {
1525 #if MIN_MATCH != 3
1526 Call UPDATE_HASH() MIN_MATCH-3 more times
1529 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
1634 * for the next match, plus MIN_MATCH bytes to insert the
1648 if (s->lookahead >= MIN_MATCH) {
1653 * At this point we have always match_length < MIN_MATCH
1665 if (s->match_length >= MIN_MATCH) {
1669 s->match_length - MIN_MATCH);
1677 s->lookahead >= MIN_MATCH) {
1683 * always MIN_MATCH bytes ahead.
1692 #if MIN_MATCH != 3
1693 Call UPDATE_HASH() MIN_MATCH-3 more times
1695 /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
1728 * for the next match, plus MIN_MATCH bytes to insert the
1742 if (s->lookahead >= MIN_MATCH) {
1749 s->match_length = MIN_MATCH-1;
1763 (s->match_length == MIN_MATCH &&
1766 /* If prev_match is also MIN_MATCH, match_start is garbage
1769 s->match_length = MIN_MATCH-1;
1775 if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
1776 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1782 s->prev_length - MIN_MATCH);
1797 s->match_length = MIN_MATCH-1;
1935 local uch length_code[MAX_MATCH-MIN_MATCH+1];
1936 /* length code for each normalized match length (0 == MIN_MATCH) */
1939 /* First normalized length for each code (0 = MIN_MATCH) */
2798 unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */
2807 /* Here, lc is the match length - MIN_MATCH */
2810 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
2861 /* Here, lc is the match length - MIN_MATCH */