Lines Matching refs:MIN_MATCH
178 #define H_SHIFT ((HASH_BITS+MIN_MATCH-1)/MIN_MATCH)
180 * input step. It must be such that after MIN_MATCH steps, the oldest
182 * H_SHIFT * MIN_MATCH >= HASH_BITS
248 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
286 * input characters and the first MIN_MATCH bytes of s are valid
287 * (except for the last MIN_MATCH-1 bytes of the input file).
290 (UPDATE_HASH(ins_h, window[(s) + (MIN_MATCH-1)]), \
379 for (j=0; j<MIN_MATCH-1; j++) UPDATE_HASH(ins_h, window[j]);
380 /* If lookahead < MIN_MATCH, ins_h is garbage, but this is
701 prev_length = MIN_MATCH-1;
707 if (lookahead >= MIN_MATCH)
712 * At this point we have always match_length < MIN_MATCH
731 if (match_length >= MIN_MATCH) {
734 flush = ct_tally(strstart-match_start, match_length - MIN_MATCH);
743 && lookahead >= MIN_MATCH
751 * always MIN_MATCH bytes ahead.
754 /* If lookahead < MIN_MATCH these bytes are garbage,
766 #if MIN_MATCH != 3
767 Call UPDATE_HASH() MIN_MATCH-3 more times
781 * for the next match, plus MIN_MATCH bytes to insert the
800 register unsigned match_length = MIN_MATCH-1; /* length of best match */
813 if (lookahead >= MIN_MATCH)
820 match_length = MIN_MATCH-1;
845 if (match_length == MIN_MATCH && strstart-match_start > TOO_FAR){
847 /* If prev_match is also MIN_MATCH, match_start is garbage
850 match_length = MIN_MATCH-1;
856 if (prev_length >= MIN_MATCH && match_length <= prev_length) {
858 unsigned max_insert = strstart + lookahead - MIN_MATCH;
863 flush = ct_tally(strstart-1-prev_match, prev_length - MIN_MATCH);
875 * always MIN_MATCH bytes ahead.
885 * always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH
893 match_length = MIN_MATCH-1;
920 * for the next match, plus MIN_MATCH bytes to insert the