Home
last modified time | relevance | path

Searched refs:MAX_MATCH (Results 1 – 22 of 22) sorted by relevance

/external/zlib/src/contrib/asm686/
Dmatch.S28 #define MAX_MATCH (258) macro
30 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
31 #define MAX_MATCH_8 ((MAX_MATCH + 7) & ~7)
291 cmpl $MAX_MATCH, %eax
329 movl $MAX_MATCH, bestlen(%esp)
/external/zlib/src/contrib/amd64/
Damd64-match.S39 #define MAX_MATCH (258) macro
41 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
42 #define MAX_MATCH_8 ((MAX_MATCH + 7) & ~7)
394 cmpl $MAX_MATCH, %eax
429 movl $MAX_MATCH, %bestlend
/external/zlib/src/contrib/gcc_gvmat64/
Dgvmat64.S93 #define MAX_MATCH 258 macro
95 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
493 cmp eax, MAX_MATCH
538 mov r11d,MAX_MATCH
/external/zlib/src/contrib/masmx86/
Dmatch686.asm106 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)
/external/zlib/src/
Ddeflate.c1170 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1174 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1182 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1207 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
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;
1304 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1309 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
[all …]
Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
Ddeflate.h281 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
291 #define WIN_INIT MAX_MATCH
Dtrees.c104 uch _length_code[MAX_MATCH-MIN_MATCH+1];
357 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
359 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1025 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
Dzutil.h76 #define MAX_MATCH 258 macro
/external/pdfium/third_party/zlib_v128/
Ddeflate.c1169 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1; in longest_match()
1173 register Bytef *strend = s->window + s->strstart + MAX_MATCH; in longest_match()
1181 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); in longest_match()
1206 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258) in longest_match()
1236 len = (MAX_MATCH - 1) - (int)(strend-scan); in longest_match()
1237 scan = strend - (MAX_MATCH-1); in longest_match()
1267 len = MAX_MATCH - (int)(strend - scan); in longest_match()
1268 scan = strend - MAX_MATCH; in longest_match()
1303 register Bytef *strend = s->window + s->strstart + MAX_MATCH; in longest_match()
1308 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); in longest_match()
[all …]
Dtrees.h103 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
Ddeflate.h281 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
291 #define WIN_INIT MAX_MATCH
Dtrees.c104 uch _length_code[MAX_MATCH-MIN_MATCH+1];
357 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
359 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1025 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
Dzutil.h78 #define MAX_MATCH 258 macro
/external/opencv3/3rdparty/zlib/
Ddeflate.c1170 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1174 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1182 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1207 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
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;
1304 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1309 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
[all …]
Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
Ddeflate.h281 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
291 #define WIN_INIT MAX_MATCH
Dtrees.c104 uch _length_code[MAX_MATCH-MIN_MATCH+1];
357 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
359 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1025 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
Dzutil.h76 #define MAX_MATCH 258 macro
/external/freetype/src/gzip/
Dzutil.h65 #define MAX_MATCH 258 macro
/external/zlib/src/contrib/masmx64/
Dgvmat64.asm120 MAX_MATCH equ 258 define
122 MIN_LOOKAHEAD equ (MAX_MATCH+MIN_MATCH+1)
/external/zlib/
Dzutil.h76 #define MAX_MATCH 258 macro