Searched refs:MIN_MATCH (Results 1 – 5 of 5) sorted by relevance
179 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \184 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \279 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);330 if (length < MIN_MATCH) return Z_OK;345 for (n = 0; n <= length - MIN_MATCH; n++) {1037 s->match_length = s->prev_length = MIN_MATCH-1;1232 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;1257 if (len < MIN_MATCH) return MIN_MATCH - 1;1382 if (s->lookahead >= MIN_MATCH) {1385 #if MIN_MATCH != 3[all …]
102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
81 #define MIN_MATCH 3 macro
278 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
109 uch _length_code[MAX_MATCH-MIN_MATCH+1];362 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()364 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()1041 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&