MIN_MATCH 113 lib/zlib/deflate.c #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) MIN_MATCH 182 lib/zlib/deflate.c (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ MIN_MATCH 187 lib/zlib/deflate.c (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ MIN_MATCH 282 lib/zlib/deflate.c s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH); MIN_MATCH 331 lib/zlib/deflate.c if (length < MIN_MATCH) return Z_OK; MIN_MATCH 346 lib/zlib/deflate.c for (n = 0; n <= length - MIN_MATCH; n++) { MIN_MATCH 1000 lib/zlib/deflate.c s->match_length = s->prev_length = MIN_MATCH-1; MIN_MATCH 1194 lib/zlib/deflate.c if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1; MIN_MATCH 1219 lib/zlib/deflate.c if (len < MIN_MATCH) return MIN_MATCH - 1; MIN_MATCH 1346 lib/zlib/deflate.c if (s->lookahead >= MIN_MATCH) { MIN_MATCH 1349 lib/zlib/deflate.c #if MIN_MATCH != 3 MIN_MATCH 1350 lib/zlib/deflate.c Call UPDATE_HASH() MIN_MATCH-3 more times MIN_MATCH 1472 lib/zlib/deflate.c if (s->lookahead >= MIN_MATCH) { MIN_MATCH 1498 lib/zlib/deflate.c if (s->match_length >= MIN_MATCH) { MIN_MATCH 1502 lib/zlib/deflate.c s->match_length - MIN_MATCH, bflush); MIN_MATCH 1511 lib/zlib/deflate.c s->lookahead >= MIN_MATCH) { MIN_MATCH 1528 lib/zlib/deflate.c #if MIN_MATCH != 3 MIN_MATCH 1529 lib/zlib/deflate.c Call UPDATE_HASH() MIN_MATCH-3 more times MIN_MATCH 1579 lib/zlib/deflate.c if (s->lookahead >= MIN_MATCH) { MIN_MATCH 1586 lib/zlib/deflate.c s->match_length = MIN_MATCH-1; MIN_MATCH 1603 lib/zlib/deflate.c || (s->match_length == MIN_MATCH && MIN_MATCH 1611 lib/zlib/deflate.c s->match_length = MIN_MATCH-1; MIN_MATCH 1617 lib/zlib/deflate.c if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) { MIN_MATCH 1618 lib/zlib/deflate.c uInt max_insert = s->strstart + s->lookahead - MIN_MATCH; MIN_MATCH 1624 lib/zlib/deflate.c s->prev_length - MIN_MATCH, bflush); MIN_MATCH 1639 lib/zlib/deflate.c s->match_length = MIN_MATCH-1; MIN_MATCH 1719 lib/zlib/deflate.c if (run >= MIN_MATCH) { MIN_MATCH 1721 lib/zlib/deflate.c _tr_tally_dist(s, 1, run - MIN_MATCH, bflush); MIN_MATCH 271 lib/zlib/deflate.h #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) MIN_MATCH 108 lib/zlib/trees.c uch _length_code[MAX_MATCH-MIN_MATCH+1]; MIN_MATCH 358 lib/zlib/trees.c for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { MIN_MATCH 360 lib/zlib/trees.c SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); MIN_MATCH 1037 lib/zlib/trees.c (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && MIN_MATCH 102 lib/zlib/trees.h const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {