Searched refs:MIN_MATCH (Results 1 - 5 of 5) sorted by relevance
/forgerock/web-agents-v4/zlib/ |
H A D | trees.h | 102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
|
H A D | deflate.c | 146 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4 177 * input characters and the first MIN_MATCH bytes of str are valid 178 * (except for the last MIN_MATCH-1 bytes of the input file). 182 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 187 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 291 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH); 364 while (s->lookahead >= MIN_MATCH) { 366 n = s->lookahead - (MIN_MATCH-1); 368 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH [all...] |
H A D | deflate.h | 146 * step. It must be such that after MIN_MATCH steps, the oldest 148 * hash_shift * MIN_MATCH >= hash_bits 281 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 283 * See deflate.c for comments about the MIN_MATCH+1.
|
H A D | trees.c | 104 uch _length_code[MAX_MATCH-MIN_MATCH+1]; 105 /* length code for each normalized match length (0 == MIN_MATCH) */ 108 /* First normalized length for each code (0 = MIN_MATCH) */ 356 "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n"); 357 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { 359 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); 1013 unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ 1022 /* Here, lc is the match length - MIN_MATCH */ 1025 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && 1078 /* Here, lc is the match length - MIN_MATCH */ [all...] |
H A D | zutil.h | 75 #define MIN_MATCH 3 macro
|
Completed in 1698 milliseconds