Home
last modified time | relevance | path

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

/openbsd/src/sys/lib/libz/
Ddeflate.c1371 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1; in longest_match()
1375 register Bytef *strend = s->window + s->strstart + MAX_MATCH; in longest_match()
1383 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); in longest_match()
1409 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258) in longest_match()
1440 len = (MAX_MATCH - 1) - (int)(strend - scan); in longest_match()
1441 scan = strend - (MAX_MATCH-1); in longest_match()
1472 len = MAX_MATCH - (int)(strend - scan); in longest_match()
1473 scan = strend - MAX_MATCH; in longest_match()
1504 register Bytef *strend = s->window + s->strstart + MAX_MATCH; in longest_match()
1509 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); in longest_match()
[all …]
Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
Ddeflate.h291 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
301 #define WIN_INIT MAX_MATCH
Dtrees.c102 uch _length_code[MAX_MATCH-MIN_MATCH+1];
414 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
416 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1110 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
Dzutil.h104 #define MAX_MATCH 258 macro
/openbsd/src/gnu/usr.bin/perl/cpan/Compress-Raw-Zlib/zlib-src/
Ddeflate.c1367 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1; in longest_match()
1371 register Bytef *strend = s->window + s->strstart + MAX_MATCH; in longest_match()
1379 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); in longest_match()
1405 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258) in longest_match()
1436 len = (MAX_MATCH - 1) - (int)(strend - scan); in longest_match()
1437 scan = strend - (MAX_MATCH-1); in longest_match()
1468 len = MAX_MATCH - (int)(strend - scan); in longest_match()
1469 scan = strend - MAX_MATCH; in longest_match()
1500 register Bytef *strend = s->window + s->strstart + MAX_MATCH; in longest_match()
1505 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); in longest_match()
[all …]
Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
Ddeflate.h290 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
300 #define WIN_INIT MAX_MATCH
Dtrees.c104 uch _length_code[MAX_MATCH-MIN_MATCH+1];
415 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
417 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1110 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
Dzutil.h85 #define MAX_MATCH 258 macro
/openbsd/src/lib/libz/
Ddeflate.c1371 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1; in longest_match()
1375 register Bytef *strend = s->window + s->strstart + MAX_MATCH; in longest_match()
1383 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); in longest_match()
1409 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258) in longest_match()
1440 len = (MAX_MATCH - 1) - (int)(strend - scan); in longest_match()
1441 scan = strend - (MAX_MATCH-1); in longest_match()
1472 len = MAX_MATCH - (int)(strend - scan); in longest_match()
1473 scan = strend - MAX_MATCH; in longest_match()
1504 register Bytef *strend = s->window + s->strstart + MAX_MATCH; in longest_match()
1509 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); in longest_match()
[all …]
Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
Ddeflate.h291 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
301 #define WIN_INIT MAX_MATCH
Dtrees.c102 uch _length_code[MAX_MATCH-MIN_MATCH+1];
414 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
416 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1110 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
Dzutil.h91 #define MAX_MATCH 258 macro