/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/lzo-2.06/src/ |
H A D | lzo1a_de.h | 98 #define MIN_MATCH 3 macro 99 #define THRESHOLD (MIN_MATCH - 1) 102 #define MIN_MATCH_SHORT (MIN_MATCH)
|
H A D | lzo1.c | 118 #define MIN_MATCH 3 macro 119 #define THRESHOLD (MIN_MATCH - 1) 122 #define MIN_MATCH_SHORT MIN_MATCH 434 /* we already matched MIN_MATCH bytes, 435 * m_pos also already advanced MIN_MATCH bytes */ 436 ip += MIN_MATCH; 439 /* try to match another MIN_MATCH_LONG - MIN_MATCH bytes 444 #if (MIN_MATCH_LONG - MIN_MATCH == 2) /* MBITS == 2 */ 446 #elif (MIN_MATCH_LONG - MIN_MATCH == 6) /* MBITS == 3 */ 448 #elif (MIN_MATCH_LONG - MIN_MATCH [all...] |
H A D | lzo1a.c | 342 if (ip - r1 == MIN_MATCH + 1) 347 * short match of length MIN_MATCH. 351 * - use 000ooooo to indicate a MIN_MATCH match (this 356 assert((op[-2] >> OBITS) == (MIN_MATCH - THRESHOLD)); 409 /* we already matched MIN_MATCH bytes, 410 * m_pos also already advanced MIN_MATCH bytes */ 411 ip += MIN_MATCH; 414 /* try to match another MIN_MATCH_LONG - MIN_MATCH bytes 419 #if (MIN_MATCH_LONG - MIN_MATCH == 2) /* MBITS == 2 */ 421 #elif (MIN_MATCH_LONG - MIN_MATCH [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zip30/human68k/ |
H A D | match.s | 37 MIN_MATCH equ 3 define 39 MAX_DIST equ WSIZE-MAX_MATCH-MIN_MATCH-1 73 lea _window+MIN_MATCH,Match_Ini 88 move.w -MIN_MATCH(Scan_Ini),Scan_Start 89 move.w -MIN_MATCH-1(Scan_Ini,Best_Len.w),Scan_End 91 move.b -MIN_MATCH(Scan_Ini),Scan_Start 93 move.b -MIN_MATCH+1(Scan_Ini),Scan_Start 94 move.b -MIN_MATCH-1(Scan_Ini,Best_Len.w),Scan_End 96 move.b -MIN_MATCH(Scan_Ini,Best_Len.w),Scan_End 104 move.w -MIN_MATCH [all...] |
H A D | deflate.s | 98 MIN_MATCH equ 3 define 104 MAX_DIST equ WSIZE-MAX_MATCH-MIN_MATCH-1 105 MIN_LOOKAHEAD equ MAX_MATCH+MIN_MATCH+1 117 H_SHIFT equ (HASH_BITS+MIN_MATCH-1)/MIN_MATCH 313 addq #MIN_MATCH,Match_Ini ; optimizes inner loop 362 move.b -MIN_MATCH-1(Match,Best_Len.w),Scan_Test 364 move.b -MIN_MATCH(Match,Best_Len.w),Scan_Test 367 move.b -MIN_MATCH(Match),Scan_Test 369 move.b -MIN_MATCH [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/zlib-1.2.8/ |
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...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/src/zlib/ |
H A D | trees.h | 102 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...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/zlib-1.2.3/ |
H A D | trees.h | 102 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...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/transmission/zlib-1.2.3/ |
H A D | trees.h | 102 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...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/zlib-1.2.7/ |
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...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zip30/qdos/ |
H A D | match.s | 38 MIN_MATCH equ 3 define 40 MAX_DIST equ WSIZE-MAX_MATCH-MIN_MATCH-1 66 lea _window+MIN_MATCH,a4 80 move.b -MIN_MATCH(a3),d3 82 move.b -MIN_MATCH+1(a3),d3 83 move.b -MIN_MATCH-1(a3,d1),d4 85 move.b -MIN_MATCH(a3,d1),d4 91 move.b -MIN_MATCH-1(a3,d1),d4 93 move.b -MIN_MATCH(a3,d1),d4 106 move.b -MIN_MATCH [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zip30/ |
H A D | deflate.c | 178 #define H_SHIFT ((HASH_BITS+MIN_MATCH-1)/MIN_MATCH) 180 * input step. It must be such that after MIN_MATCH steps, the oldest 182 * H_SHIFT * MIN_MATCH >= HASH_BITS 248 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4 286 * input characters and the first MIN_MATCH bytes of s are valid 287 * (except for the last MIN_MATCH-1 bytes of the input file). 290 (UPDATE_HASH(ins_h, window[(s) + (MIN_MATCH-1)]), \ 379 for (j=0; j<MIN_MATCH-1; j++) UPDATE_HASH(ins_h, window[j]); 380 /* 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...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/lib/zlib_deflate/ |
H A D | deflate.c | 96 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 98 * See deflate.c for comments about the MIN_MATCH+1. 128 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4 150 * input characters and the first MIN_MATCH bytes of str are valid 151 * (except for the last MIN_MATCH-1 bytes of the input file). 154 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ 214 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH); 529 s->match_length = s->prev_length = MIN_MATCH-1; 801 if (s->lookahead >= MIN_MATCH) { [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/include/linux/ |
H A D | zutil.h | 31 #define MIN_MATCH 3 macro
|
/netgear-R7000-V1.0.7.12_1.2.5/src/router/busybox-1.x/archival/ |
H A D | gzip.c | 111 #define MIN_MATCH 3 macro 115 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 117 * See deflate.c for comments about the MIN_MATCH+1. 231 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4 247 #define H_SHIFT ((HASH_BITS+MIN_MATCH-1) / MIN_MATCH) 249 * input step. It must be such that after MIN_MATCH steps, the oldest 251 * H_SHIFT * MIN_MATCH >= HASH_BITS 914 uch length_code[MAX_MATCH - MIN_MATCH + 1]; 916 /* length code for each normalized match length (0 == MIN_MATCH) */ [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/libcryptoxx-5.6.0/ |
H A D | zdeflate.h | 82 enum {MIN_MATCH = 3, MAX_MATCH = 258}; enumerator in enum:Deflator::__anon109
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/zlib-1.2.8/contrib/asm686/ |
H A D | match.S | 29 #define MIN_MATCH (3) define 30 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/zlib-1.2.3/contrib/asm586/ |
H A D | match.S | 15 #define MIN_MATCH (3) define 16 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/zlib-1.2.3/contrib/asm686/ |
H A D | match.S | 15 #define MIN_MATCH (3) define 16 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
|