Home
last modified time | relevance | path

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

/openbsd/src/sys/lib/libz/
Ddeflate.c152 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
157 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
303 if (s->lookahead + s->insert >= MIN_MATCH) { in fill_window()
307 #if MIN_MATCH != 3 in fill_window()
308 Call UPDATE_HASH() MIN_MATCH-3 more times in fill_window()
311 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); in fill_window()
318 if (s->lookahead + s->insert < MIN_MATCH) in fill_window()
443 s->hash_shift = ((s->hash_bits + MIN_MATCH-1) / MIN_MATCH); in deflateInit2_()
584 while (s->lookahead >= MIN_MATCH) { in deflateSetDictionary()
586 n = s->lookahead - (MIN_MATCH-1); in deflateSetDictionary()
[all …]
Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
Dtrees.c102 uch _length_code[MAX_MATCH-MIN_MATCH+1];
414 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
416 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1110 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
Dzutil.h103 #define MIN_MATCH 3 macro
Ddeflate.h291 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
/openbsd/src/gnu/usr.bin/perl/cpan/Compress-Raw-Zlib/zlib-src/
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)]), \
307 if (s->lookahead + s->insert >= MIN_MATCH) { in fill_window()
311 #if MIN_MATCH != 3 in fill_window()
312 Call UPDATE_HASH() MIN_MATCH-3 more times in fill_window()
315 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); in fill_window()
322 if (s->lookahead + s->insert < MIN_MATCH) in fill_window()
447 s->hash_shift = ((s->hash_bits + MIN_MATCH-1) / MIN_MATCH); in deflateInit2_()
588 while (s->lookahead >= MIN_MATCH) { in deflateSetDictionary()
590 n = s->lookahead - (MIN_MATCH-1); in deflateSetDictionary()
[all …]
Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
Dtrees.c104 uch _length_code[MAX_MATCH-MIN_MATCH+1];
415 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
417 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1110 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
Dzutil.h84 #define MIN_MATCH 3 macro
Ddeflate.h290 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
/openbsd/src/lib/libz/
Ddeflate.c152 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
157 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
303 if (s->lookahead + s->insert >= MIN_MATCH) { in fill_window()
307 #if MIN_MATCH != 3 in fill_window()
308 Call UPDATE_HASH() MIN_MATCH-3 more times in fill_window()
311 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); in fill_window()
318 if (s->lookahead + s->insert < MIN_MATCH) in fill_window()
443 s->hash_shift = ((s->hash_bits + MIN_MATCH-1) / MIN_MATCH); in deflateInit2_()
584 while (s->lookahead >= MIN_MATCH) { in deflateSetDictionary()
586 n = s->lookahead - (MIN_MATCH-1); in deflateSetDictionary()
[all …]
Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
Dtrees.c102 uch _length_code[MAX_MATCH-MIN_MATCH+1];
414 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
416 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1110 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
Dzutil.h90 #define MIN_MATCH 3 macro
Ddeflate.h291 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)