Searched refs:MAX_MATCH (Results 1 - 25 of 27) sorted by relevance

12

/macosx-10.10/rsync-45/rsync/zlib/
H A Dtrees.h102 const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {
H A Ddeflate.c115 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
1051 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1055 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1060 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
1063 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1088 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1100 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
1118 len = (MAX_MATCH - 1) - (int)(strend-scan);
1119 scan = strend - (MAX_MATCH-1);
1149 len = MAX_MATCH
[all...]
H A Ddeflate.h117 * wSize-MAX_MATCH bytes, but this ensures that IO is always
271 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
H A Dtrees.c108 uch _length_code[MAX_MATCH-MIN_MATCH+1];
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));
1037 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
H A Dzutil.h85 #define MAX_MATCH 258 macro
/macosx-10.10/sudo-73/src/zlib/
H A Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
H A Ddeflate.c1168 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1172 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1177 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
1180 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1205 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1217 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
1235 len = (MAX_MATCH - 1) - (int)(strend-scan);
1236 scan = strend - (MAX_MATCH-1);
1266 len = MAX_MATCH - (int)(strend - scan);
1267 scan = strend - MAX_MATCH;
[all...]
H A Ddeflate.h120 * 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 Dtrees.c104 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));
1023 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
H A Dzutil.h76 #define MAX_MATCH 258 macro
/macosx-10.10/xnu-2782.1.97/libkern/zlib/
H A Dtrees.h129 const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {
H A Ddeflate.c140 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
1078 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1082 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1087 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
1090 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1115 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1127 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
1145 len = (MAX_MATCH - 1) - (int)(strend-scan);
1146 scan = strend - (MAX_MATCH-1);
1176 len = MAX_MATCH
[all...]
H A Ddeflate.h144 * wSize-MAX_MATCH bytes, but this ensures that IO is always
298 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
H A Dtrees.c135 uch _length_code[MAX_MATCH-MIN_MATCH+1];
384 fprintf(header, "const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {\n");
385 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {
387 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));
1064 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
H A Dzutil.h121 #define MAX_MATCH 258 macro
/macosx-10.10/zlib-55/zlib/
H A Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
H A Ddeflate.c1085 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1089 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1094 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
1097 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1122 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1134 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
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;
[all...]
H A Ddeflate.h117 * wSize-MAX_MATCH bytes, but this ensures that IO is always
278 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
288 #define WIN_INIT MAX_MATCH
H A Dzutil.h72 #define MAX_MATCH 258 macro
/macosx-10.10/zlib-55/zlib/contrib/asm686/
H A Dmatch.S28 #define MAX_MATCH (258) define
30 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
31 #define MAX_MATCH_8 ((MAX_MATCH + 7) & ~7)
277 /* Calculate the length of the match. If it is longer than MAX_MATCH, */
283 cmpl $MAX_MATCH, %eax
321 movl $MAX_MATCH, bestlen(%esp)
/macosx-10.10/zlib-55/zlib/contrib/amd64/
H A Damd64-match.S39 #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
/macosx-10.10/zlib-55/zlib/contrib/gcc_gvmat64/
H A Dgvmat64.S93 #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
/macosx-10.10/zlib-55/zlib/contrib/masmx86/
H A 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)
387 ;;; Calculate the length of the match. If it is longer than MAX_MATCH,
393 cmp eax, MAX_MATCH
431 mov dword ptr [bestlen], MAX_MATCH
/macosx-10.10/zlib-55/zlib/contrib/masmx64/
H A Dgvmat64.asm120 MAX_MATCH equ 258 define
122 MIN_LOOKAHEAD equ (MAX_MATCH+MIN_MATCH+1)
471 ;;; Calculate the length of the match. If it is longer than MAX_MATCH,
476 cmp eax, MAX_MATCH
513 mov r11d,MAX_MATCH
/macosx-10.10/ppp-786.1.1/Helpers/pppdump/
H A Dzlib.c105 #define MAX_MATCH 258 macro
260 * wSize-MAX_MATCH bytes, but this ensures that IO is always
419 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
508 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
982 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
986 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
991 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
994 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1009 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1021 * at strstart+257. If MAX_MATCH
[all...]

Completed in 263 milliseconds

12