Searched refs:MIN_MATCH (Results 1 - 5 of 5) sorted by relevance
/darwin-on-arm/xnu/libkern/zlib/ |
H A D | trees.h | 129 const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {
|
H A D | deflate.c | 140 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 142 * See deflate.c for comments about the MIN_MATCH+1. 179 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4 207 * input characters and the first MIN_MATCH bytes of str are valid 208 * (except for the last MIN_MATCH-1 bytes of the input file). 212 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 217 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 314 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH); 363 if (length < MIN_MATCH) retur [all...] |
H A D | deflate.h | 170 * step. It must be such that after MIN_MATCH steps, the oldest 172 * hash_shift * MIN_MATCH >= hash_bits 298 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 300 * See deflate.c for comments about the MIN_MATCH+1.
|
H A D | trees.c | 135 uch _length_code[MAX_MATCH-MIN_MATCH+1]; 136 /* length code for each normalized match length (0 == MIN_MATCH) */ 139 /* First normalized length for each code (0 = MIN_MATCH) */ 384 fprintf(header, "const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {\n"); 385 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { 387 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); 1052 unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ 1061 /* Here, lc is the match length - MIN_MATCH */ 1064 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && 1117 /* Here, lc is the match length - MIN_MATCH */ [all...] |
H A D | zutil.h | 120 #define MIN_MATCH 3 macro
|
Completed in 22 milliseconds