Searched refs:MIN_MATCH (Results 1 - 6 of 6) sorted by relevance
/ast/src/lib/libz/ |
H A D | trees.h | 151 const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {
|
H A D | deflate.c | 113 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 115 * See deflate.c for comments about the MIN_MATCH+1. 152 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4 180 * input characters and the first MIN_MATCH bytes of str are valid 181 * (except for the last MIN_MATCH-1 bytes of the input file). 185 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 190 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 285 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH); 334 if (length < MIN_MATCH) retur [all...] |
H A D | deflate.h | 143 * step. It must be such that after MIN_MATCH steps, the oldest 145 * hash_shift * MIN_MATCH >= hash_bits 271 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 273 * See deflate.c for comments about the MIN_MATCH+1.
|
H A D | trees.c | 108 uch _length_code[MAX_MATCH-MIN_MATCH+1]; 109 /* length code for each normalized match length (0 == MIN_MATCH) */ 112 /* First normalized length for each code (0 = MIN_MATCH) */ 357 fprintf(header, "const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {\n"); 358 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { 360 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); 1025 unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ 1034 /* Here, lc is the match length - MIN_MATCH */ 1037 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && 1090 /* Here, lc is the match length - MIN_MATCH */ [all...] |
H A D | zutil.h | 81 #define MIN_MATCH 3 macro
|
/ast/src/cmd/INIT/ |
H A D | ratz.c | 621 #define MIN_MATCH 3 macro 1353 * step. It must be such that after MIN_MATCH steps, the oldest 1355 * hash_shift * MIN_MATCH >= hash_bits 1481 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 1483 * See deflate.c for comments about the MIN_MATCH+1.
|
Completed in 66 milliseconds