| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/PyMod-2.7.2/Modules/zlib/ |
| zutil.h | 89 #define MIN_MATCH 3
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/zlib/ |
| 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.
|
| 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));
[all...] |
| zutil.h | 75 #define MIN_MATCH 3
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/PyMod-2.7.10/Modules/zlib/ |
| zutil.h | 78 #define MIN_MATCH 3
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/ |
| 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.
|
| 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));
[all...] |
| zutil.h | 89 #define MIN_MATCH 3
|
| /device/linaro/bootloader/edk2/EmbeddedPkg/Library/ZLib/ |
| zutil.h | 77 #define MIN_MATCH 3
|
| /external/python/cpython2/Modules/zlib/ |
| 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.
|
| 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));
[all...] |
| zutil.h | 75 #define MIN_MATCH 3
|
| /external/python/cpython3/Modules/zlib/ |
| deflate.h | 149 * step. It must be such that after MIN_MATCH steps, the oldest
151 * hash_shift * MIN_MATCH >= hash_bits
284 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
286 * See deflate.c for comments about the MIN_MATCH+1.
|
| 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) */
354 "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n");
355 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {
357 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));
[all...] |
| zutil.h | 77 #define MIN_MATCH 3
|
| /external/syslinux/com32/lib/zlib/ |
| 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.
|
| zutil.h | 71 #define MIN_MATCH 3
|
| /external/zlib/src/ |
| deflate.h | 149 * step. It must be such that after MIN_MATCH steps, the oldest
151 * hash_shift * MIN_MATCH >= hash_bits
284 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
286 * See deflate.c for comments about the MIN_MATCH+1.
|
| 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) */
354 "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n");
355 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {
357 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));
[all...] |
| zutil.h | 77 #define MIN_MATCH 3
|
| /toolchain/binutils/binutils-2.27/zlib/ |
| 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.
|
| 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));
[all...] |
| zutil.h | 75 #define MIN_MATCH 3
|
| /external/zlib/src/contrib/masmx86/ |
| match686.asm | 107 MIN_MATCH equ 3
108 MIN_LOOKAHEAD equ (MAX_MATCH+MIN_MATCH+1)
113 MIN_MATCH equ 3
114 MIN_LOOKAHEAD equ (MAX_MATCH + MIN_MATCH + 1)
|
| /toolchain/binutils/binutils-2.27/zlib/contrib/masmx86/ |
| match686.asm | 107 MIN_MATCH equ 3
108 MIN_LOOKAHEAD equ (MAX_MATCH+MIN_MATCH+1)
113 MIN_MATCH equ 3
114 MIN_LOOKAHEAD equ (MAX_MATCH + MIN_MATCH + 1)
|
