Home
last modified time | relevance | path

Searched refs:MIN_MATCH (Results 1 – 5 of 5) sorted by relevance

/src/sys/contrib/zlib/
H A Ddeflate.c156 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
161 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
315 if (s->lookahead + s->insert >= MIN_MATCH) { in fill_window()
319 #if MIN_MATCH != 3 in fill_window()
320 Call UPDATE_HASH() MIN_MATCH-3 more times in fill_window()
323 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); in fill_window()
330 if (s->lookahead + s->insert < MIN_MATCH) in fill_window()
456 s->hash_shift = ((s->hash_bits + MIN_MATCH-1) / MIN_MATCH); in deflateInit2_()
597 while (s->lookahead >= MIN_MATCH) { in deflateSetDictionary()
599 n = s->lookahead - (MIN_MATCH-1); in deflateSetDictionary()
[all …]
H A Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
H A Dtrees.c104 uch _length_code[MAX_MATCH-MIN_MATCH+1];
416 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
418 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1112 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
H A Dzutil.h92 #define MIN_MATCH 3 macro
H A Ddeflate.h296 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)