/external/chromium_org/third_party/zlib/ |
H A D | trees.h | 102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
|
H A D | deflate.c | 1161 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1; 1165 register Bytef *strend = s->window + s->strstart + MAX_MATCH; 1170 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. 1173 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); 1201 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258) 1213 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is 1231 len = (MAX_MATCH - 1) - (int)(strend-scan); 1232 scan = strend - (MAX_MATCH-1); 1272 len = MAX_MATCH - (int)(strend - scan); 1273 scan = strend - MAX_MATCH; [all...] |
H A D | deflate.h | 120 * wSize-MAX_MATCH bytes, but this ensures that IO is always 283 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 293 #define WIN_INIT MAX_MATCH
|
H A D | zutil.h | 87 #define MAX_MATCH 258 macro
|
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/ |
H A D | trees.h | 102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
|
H A D | fx_zlib_deflate.c | 1169 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1; 1173 register Bytef *strend = s->window + s->strstart + MAX_MATCH; 1178 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. 1181 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); 1206 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258) 1218 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is 1236 len = (MAX_MATCH - 1) - (int)(strend-scan); 1237 scan = strend - (MAX_MATCH-1); 1267 len = MAX_MATCH - (int)(strend - scan); 1268 scan = strend - MAX_MATCH; [all...] |
H A D | deflate.h | 120 * wSize-MAX_MATCH bytes, but this ensures that IO is always 281 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 291 #define WIN_INIT MAX_MATCH
|
H A D | fx_zlib_trees.c | 104 uch _length_code[MAX_MATCH-MIN_MATCH+1]; 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)); 1025 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
|
H A D | zutil.h | 78 #define MAX_MATCH 258 macro
|
/external/qemu/distrib/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 | 1170 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1; 1174 register Bytef *strend = s->window + s->strstart + MAX_MATCH; 1179 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. 1182 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); 1207 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258) 1219 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is 1237 len = (MAX_MATCH - 1) - (int)(strend-scan); 1238 scan = strend - (MAX_MATCH-1); 1268 len = MAX_MATCH - (int)(strend - scan); 1269 scan = strend - MAX_MATCH; [all...] |
H A D | deflate.h | 120 * wSize-MAX_MATCH bytes, but this ensures that IO is always 281 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 291 #define WIN_INIT MAX_MATCH
|
H A D | trees.c | 104 uch _length_code[MAX_MATCH-MIN_MATCH+1]; 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)); 1025 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
|
H A D | zutil.h | 76 #define MAX_MATCH 258 macro
|
/external/zlib/src/ |
H A D | trees.h | 102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
|
H A D | deflate.c | 1170 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1; 1174 register Bytef *strend = s->window + s->strstart + MAX_MATCH; 1179 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. 1182 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); 1207 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258) 1219 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is 1237 len = (MAX_MATCH - 1) - (int)(strend-scan); 1238 scan = strend - (MAX_MATCH-1); 1268 len = MAX_MATCH - (int)(strend - scan); 1269 scan = strend - MAX_MATCH; [all...] |
H A D | deflate.h | 120 * wSize-MAX_MATCH bytes, but this ensures that IO is always 281 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 291 #define WIN_INIT MAX_MATCH
|
H A D | trees.c | 104 uch _length_code[MAX_MATCH-MIN_MATCH+1]; 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)); 1025 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
|
H A D | zutil.h | 76 #define MAX_MATCH 258 macro
|
/external/zlib/src/contrib/asm686/ |
H A D | match.S | 28 #define MAX_MATCH (258) define 30 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1) 31 #define MAX_MATCH_8 ((MAX_MATCH + 7) & ~7) 285 /* Calculate the length of the match. If it is longer than MAX_MATCH, */ 291 cmpl $MAX_MATCH, %eax 329 movl $MAX_MATCH, bestlen(%esp)
|
/external/zlib/src/contrib/amd64/ |
H A D | amd64-match.S | 39 #define MAX_MATCH (258) define 41 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1) 42 #define MAX_MATCH_8 ((MAX_MATCH + 7) & ~7) 389 /* Calculate the length of the match. If it is longer than MAX_MATCH, */ 394 cmpl $MAX_MATCH, %eax 429 movl $MAX_MATCH, %bestlend
|
/external/zlib/src/contrib/gcc_gvmat64/ |
H A D | gvmat64.S | 93 #define MAX_MATCH 258
define 95 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
488 //;;; Calculate the length of the match. If it is longer than MAX_MATCH,
493 cmp eax, MAX_MATCH
538 mov r11d,MAX_MATCH
|
/external/freetype/src/gzip/ |
H A D | zutil.h | 65 #define MAX_MATCH 258 macro
|
/external/zlib/src/contrib/masmx86/ |
H A D | match686.asm | 106 MAX_MATCH equ 258
define 108 MIN_LOOKAHEAD equ (MAX_MATCH+MIN_MATCH+1)
112 MAX_MATCH equ 258
define 114 MIN_LOOKAHEAD equ (MAX_MATCH + MIN_MATCH + 1)
115 MAX_MATCH_8_ equ ((MAX_MATCH + 7) AND 0FFF0h)
388 ;;; Calculate the length of the match. If it is longer than MAX_MATCH,
394 cmp eax, MAX_MATCH
432 mov dword ptr [bestlen], MAX_MATCH
|
/external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/tests/ |
H A D | opt-gvmat64.asm | 83 %define MAX_MATCH 258 85 %define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 431 ;;; Calculate the length of the match. If it is longer than MAX_MATCH, 436 cmp eax, MAX_MATCH 473 mov r11d,MAX_MATCH
|