Home
last modified time | relevance | path

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

/src/sys/contrib/zlib/
H A Ddeflate.c1408 Bytef *strend = s->window + s->strstart + MAX_MATCH - 1; in longest_match()
1412 Bytef *strend = s->window + s->strstart + MAX_MATCH; in longest_match()
1420 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); in longest_match()
1446 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258) in longest_match()
1477 len = (MAX_MATCH - 1) - (int)(strend - scan); in longest_match()
1478 scan = strend - (MAX_MATCH-1); in longest_match()
1509 len = MAX_MATCH - (int)(strend - scan); in longest_match()
1510 scan = strend - MAX_MATCH; in longest_match()
1541 Bytef *strend = s->window + s->strstart + MAX_MATCH; in longest_match()
1546 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); in longest_match()
[all …]
H A Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
H A Ddeflate.h296 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
306 #define WIN_INIT MAX_MATCH
H A Dtrees.c104 uch _length_code[MAX_MATCH-MIN_MATCH+1];
416 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
418 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1112 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
H A Dzutil.h93 #define MAX_MATCH 258 macro
/src/contrib/sendmail/src/
H A Dmap.c7521 # define MAX_MATCH 32 macro
7693 int *fields = (int *) xalloc(sizeof(int) * (MAX_MATCH + 1));
7701 if (substrings >= MAX_MATCH)
7703 syserr("too many substrings, %d max", MAX_MATCH);
7713 MAX_MATCH + 1, substrings) == -1)
7767 regmatch_t pmatch[MAX_MATCH];
7781 name, MAX_MATCH, pmatch, 0);
7798 int fields[MAX_MATCH + 1];
7811 if (parse_fields(av[1], fields, MAX_MATCH + 1,
7835 if (*ip >= MAX_MATCH ||