Home
last modified time | relevance | path

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

/external/zlib/contrib/asm586/
Dmatch.S14 #define MAX_MATCH (258) macro
16 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
17 #define MAX_MATCH_8 ((MAX_MATCH + 7) & ~7)
301 cmpl $MAX_MATCH, %eax
342 movl $MAX_MATCH, bestlen(%esp)
/external/zlib/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)
283 cmpl $MAX_MATCH, %eax
321 movl $MAX_MATCH, bestlen(%esp)
/external/zlib/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/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/contrib/masm686/
Dmatch.asm25 MAX_MATCH EQU 258 define
27 MIN_LOOKAHEAD EQU (MAX_MATCH + MIN_MATCH + 1)
28 MAX_MATCH_8 EQU ((MAX_MATCH + 7) AND (NOT 7))
344 cmp eax, MAX_MATCH
386 mov DWORD PTR[esp+bestlen], MAX_MATCH
/external/qemu/distrib/zlib-1.2.3/
Ddeflate.c113 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
1049 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1053 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1061 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1086 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1116 len = (MAX_MATCH - 1) - (int)(strend-scan);
1117 scan = strend - (MAX_MATCH-1);
1147 len = MAX_MATCH - (int)(strend - scan);
1148 scan = strend - MAX_MATCH;
1182 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
[all …]
Dtrees.h102 const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {
Dzutil.h82 #define MAX_MATCH 258 macro
Ddeflate.h271 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
Dtrees.c108 uch _length_code[MAX_MATCH-MIN_MATCH+1];
358 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
360 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1037 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
/external/zlib/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)
Dgvmat32.asm874 ;;; Calculate the length of the match. If it is longer than MAX_MATCH,
880 cmp eax, MAX_MATCH
918 mov dword ptr [bestlen], MAX_MATCH
/external/zlib/
Ddeflate.c1085 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1089 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1097 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1122 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1152 len = (MAX_MATCH - 1) - (int)(strend-scan);
1153 scan = strend - (MAX_MATCH-1);
1183 len = MAX_MATCH - (int)(strend - scan);
1184 scan = strend - MAX_MATCH;
1219 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1224 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.h278 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
288 #define WIN_INIT MAX_MATCH
Dzutil.h72 #define MAX_MATCH 258 macro
Dtrees.c109 uch _length_code[MAX_MATCH-MIN_MATCH+1];
362 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
364 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1041 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
/external/zlib/contrib/masmx64/
Dgvmat64.asm120 MAX_MATCH equ 258 define
122 MIN_LOOKAHEAD equ (MAX_MATCH+MIN_MATCH+1)