Lines Matching defs:MIN_MATCH
82 #define MIN_MATCH 3
264 * step. It must be such that after MIN_MATCH steps, the oldest
266 * hash_shift * MIN_MATCH >= hash_bits
397 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
399 * See deflate.c for comments about the MIN_MATCH+1.
486 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
488 * See deflate.c for comments about the MIN_MATCH+1.
518 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
562 * input characters and the first MIN_MATCH bytes of str are valid
563 * (except for the last MIN_MATCH-1 bytes of the input file).
566 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
631 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
919 s->match_length = MIN_MATCH-1;
1186 if (s->lookahead >= MIN_MATCH) {
1189 #if MIN_MATCH != 3
1190 Call UPDATE_HASH() MIN_MATCH-3 more times
1193 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
1233 s->prev_length = MIN_MATCH-1;
1238 * for the next match, plus MIN_MATCH bytes to insert the
1251 if (s->lookahead >= MIN_MATCH) {
1256 * At this point we have always match_length < MIN_MATCH
1270 if (s->match_length >= MIN_MATCH) {
1274 s->match_length - MIN_MATCH);
1282 s->lookahead >= MIN_MATCH) {
1288 * always MIN_MATCH bytes ahead.
1297 #if MIN_MATCH != 3
1298 Call UPDATE_HASH() MIN_MATCH-3 more times
1300 /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
1333 * for the next match, plus MIN_MATCH bytes to insert the
1346 if (s->lookahead >= MIN_MATCH) {
1353 s->match_length = MIN_MATCH-1;
1368 (s->match_length == MIN_MATCH &&
1371 /* If prev_match is also MIN_MATCH, match_start is garbage
1374 s->match_length = MIN_MATCH-1;
1380 if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
1381 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1387 s->prev_length - MIN_MATCH);
1402 s->match_length = MIN_MATCH-1;
1539 local uch length_code[MAX_MATCH-MIN_MATCH+1];
1540 /* length code for each normalized match length (0 == MIN_MATCH) */
1543 /* First normalized length for each code (0 = MIN_MATCH) */
2406 int lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */
2415 /* Here, lc is the match length - MIN_MATCH */
2418 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
2469 /* Here, lc is the match length - MIN_MATCH */