/haiku-fatelf/src/libs/pdflib/libs/flate/ |
H A D | trees.h | 105 const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {
|
H A D | deflate.c | 109 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 111 * See deflate.c for comments about the MIN_MATCH+1. 141 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4 168 * input characters and the first MIN_MATCH bytes of str are valid 169 * (except for the last MIN_MATCH-1 bytes of the input file). 173 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 178 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 264 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH); 313 if (length < MIN_MATCH) retur [all...] |
H A D | deflate.h | 133 * step. It must be such that after MIN_MATCH steps, the oldest 135 * hash_shift * MIN_MATCH >= hash_bits 261 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 263 * See deflate.c for comments about the MIN_MATCH+1.
|
H A D | zutil.h | 71 #define MIN_MATCH 3 macro
|
H A D | trees.c | 109 uch _length_code[MAX_MATCH-MIN_MATCH+1]; 110 /* length code for each normalized match length (0 == MIN_MATCH) */ 113 /* First normalized length for each code (0 = MIN_MATCH) */ 359 fprintf(header, "const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {\n"); 360 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { 362 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...] |
/haiku-fatelf/src/libs/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 174 * input characters and the first MIN_MATCH bytes of str are valid 175 * (except for the last MIN_MATCH-1 bytes of the input file). 179 (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++) { 1039 s->match_length = s->prev_length = MIN_MATCH [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 278 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 280 * See deflate.c for comments about the MIN_MATCH+1.
|
H A D | zutil.h | 71 #define MIN_MATCH 3 macro
|
H A D | trees.c | 109 uch _length_code[MAX_MATCH-MIN_MATCH+1]; 110 /* length code for each normalized match length (0 == MIN_MATCH) */ 113 /* First normalized length for each code (0 = MIN_MATCH) */ 361 "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n"); 362 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { 364 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); 1029 unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ 1038 /* Here, lc is the match length - MIN_MATCH */ 1041 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && 1094 /* Here, lc is the match length - MIN_MATCH */ [all...] |
/haiku-fatelf/src/bin/gzip/ |
H A D | match.S | 49 #define MIN_MATCH 3 define 51 #define MAX_DIST WSIZE - MAX_MATCH - MIN_MATCH - 1 256 #define MIN_MATCH 3 define 258 #define MAX_DIST (WSIZE - MAX_MATCH - MIN_MATCH - 1) 295 movel imm(_window+MIN_MATCH),Match_Ini 309 movew IndBase(-MIN_MATCH,Scan_Ini),Scan_Start 310 movew IndBaseNdxw(-MIN_MATCH-1,Scan_Ini,Best_Len),Scan_End 312 moveb IndBase(-MIN_MATCH,Scan_Ini),Scan_Start 314 moveb IndBase(-MIN_MATCH+1,Scan_Ini),Scan_Start 315 moveb IndBaseNdxw(-MIN_MATCH [all...] |
H A D | deflate.c | 166 #define H_SHIFT ((HASH_BITS+MIN_MATCH-1)/MIN_MATCH) 168 * input step. It must be such that after MIN_MATCH steps, the oldest 170 * H_SHIFT * MIN_MATCH >= HASH_BITS 239 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4 275 * input characters and the first MIN_MATCH bytes of s are valid 276 * (except for the last MIN_MATCH-1 bytes of the input file). 279 (UPDATE_HASH(ins_h, window[(s) + MIN_MATCH-1]), \ 338 for (j=0; j<MIN_MATCH-1; j++) UPDATE_HASH(ins_h, window[j]); 339 /* If lookahead < MIN_MATCH, ins_ [all...] |
H A D | gzip.h | 179 #define MIN_MATCH 3 macro 183 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 185 * See deflate.c for comments about the MIN_MATCH+1.
|
H A D | trees.c | 236 local uch length_code[MAX_MATCH-MIN_MATCH+1]; 237 /* length code for each normalized match length (0 == MIN_MATCH) */ 246 /* First normalized length for each code (0 = MIN_MATCH) */ 960 int lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ 967 /* Here, lc is the match length - MIN_MATCH */ 970 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && 1031 /* Here, lc is the match length - MIN_MATCH */
|
/haiku-fatelf/src/bin/zip/ |
H A D | deflate.c | 176 #define H_SHIFT ((HASH_BITS+MIN_MATCH-1)/MIN_MATCH) 178 * input step. It must be such that after MIN_MATCH steps, the oldest 180 * H_SHIFT * MIN_MATCH >= HASH_BITS 246 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4 283 * input characters and the first MIN_MATCH bytes of s are valid 284 * (except for the last MIN_MATCH-1 bytes of the input file). 287 (UPDATE_HASH(ins_h, window[(s) + (MIN_MATCH-1)]), \ 376 for (j=0; j<MIN_MATCH-1; j++) UPDATE_HASH(ins_h, window[j]); 377 /* If lookahead < MIN_MATCH, ins_ [all...] |
H A D | match.S | 54 #define MIN_MATCH 3 define 56 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1) 317 movel imm(_window+MIN_MATCH),Match_Ini 331 movew IndBase(-MIN_MATCH,Scan_Ini),Scan_Start 332 movew IndBaseNdxw(-MIN_MATCH-1,Scan_Ini,Best_Len),Scan_End 334 moveb IndBase(-MIN_MATCH,Scan_Ini),Scan_Start 336 moveb IndBase(-MIN_MATCH+1,Scan_Ini),Scan_Start 337 moveb IndBaseNdxw(-MIN_MATCH-1,Scan_Ini,Best_Len),Scan_End 339 moveb IndBaseNdxw(-MIN_MATCH,Scan_Ini,Best_Len),Scan_End 345 movew IndBaseNdxw(-MIN_MATCH [all...] |
H A D | zip.h | 74 #define MIN_MATCH 3 macro 86 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 88 * See deflate.c for comments about the MIN_MATCH+1.
|
H A D | trees.c | 289 local uch length_code[MAX_MATCH-MIN_MATCH+1]; 290 /* length code for each normalized match length (0 == MIN_MATCH) */ 299 /* First normalized length for each code (0 = MIN_MATCH) */ 1130 int lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ 1137 /* Here, lc is the match length - MIN_MATCH */ 1140 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && 1201 /* Here, lc is the match length - MIN_MATCH */
|