Home
last modified time | relevance | path

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

/openbmc/linux/lib/zlib_deflate/
H A Ddeflate.c98 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
175 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
259 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH); in zlib_deflateInit2()
548 s->match_length = s->prev_length = MIN_MATCH-1; in lm_init()
820 if (s->lookahead >= MIN_MATCH) { in fill_window()
823 #if MIN_MATCH != 3 in fill_window()
824 Call UPDATE_HASH() MIN_MATCH-3 more times in fill_window()
948 if (s->lookahead >= MIN_MATCH) { in deflate_fast()
965 if (s->match_length >= MIN_MATCH) { in deflate_fast()
969 s->match_length - MIN_MATCH); in deflate_fast()
[all …]
H A Ddefutil.h263 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
H A Ddeftree.c101 static uch length_code[MAX_MATCH-MIN_MATCH+1];
931 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
/openbmc/u-boot/lib/zlib/
H A Ddeflate.c179 (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 …]
H A Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
H A Dzutil.h81 #define MIN_MATCH 3 macro
H A Dtrees.c109 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) &&
H A Ddeflate.h278 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
/openbmc/linux/include/linux/
H A Dzutil.h31 #define MIN_MATCH 3 macro