Home
last modified time | relevance | path

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

/freebsd-10-stable/contrib/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)
291 cmpl $MAX_MATCH, %eax
329 movl $MAX_MATCH, bestlen(%esp)
/freebsd-10-stable/sys/cddl/contrib/opensolaris/uts/common/zmod/
Ddeflate.c118 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
1055 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1059 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1067 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1092 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1122 len = (MAX_MATCH - 1) - (int)(strend-scan);
1123 scan = strend - (MAX_MATCH-1);
1153 len = MAX_MATCH - (int)(strend - scan);
1154 scan = strend - MAX_MATCH;
1188 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
[all …]
Dzutil.h87 #define MAX_MATCH 258 macro
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) &&
Ddeflate.h271 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
/freebsd-10-stable/contrib/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
/freebsd-10-stable/contrib/zlib/
Ddeflate.c1258 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1262 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1270 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1295 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1325 len = (MAX_MATCH - 1) - (int)(strend-scan);
1326 scan = strend - (MAX_MATCH-1);
1356 len = MAX_MATCH - (int)(strend - scan);
1357 scan = strend - MAX_MATCH;
1392 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1397 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.h284 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
294 #define WIN_INIT MAX_MATCH
Dtrees.c104 uch _length_code[MAX_MATCH-MIN_MATCH+1];
355 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
357 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1029 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
Dzutil.h78 #define MAX_MATCH 258 macro
/freebsd-10-stable/sys/net/
Dzutil.h97 #define MAX_MATCH 258 macro
Dzlib.c133 #define MAX_MATCH 258 macro
528 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
658 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
1302 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1306 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1314 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1334 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1364 len = (MAX_MATCH - 1) - (int)(strend-scan);
1365 scan = strend - (MAX_MATCH-1);
1395 len = MAX_MATCH - (int)(strend - scan);
[all …]
/freebsd-10-stable/contrib/sendmail/src/
Dmap.c6795 # define MAX_MATCH 32 macro
6964 int *fields = (int *) xalloc(sizeof(int) * (MAX_MATCH + 1));
6972 if (substrings >= MAX_MATCH)
6974 syserr("too many substrings, %d max", MAX_MATCH);
6983 MAX_MATCH + 1, substrings) == -1)
7032 regmatch_t pmatch[MAX_MATCH];
7045 name, MAX_MATCH, pmatch, 0);
7062 int fields[MAX_MATCH + 1];
7075 if (parse_fields(av[1], fields, MAX_MATCH + 1,
7099 if (*ip >= MAX_MATCH ||