Searched refs:MAX_MATCH (Results 1 – 9 of 9) sorted by relevance
98 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)588 register Byte *strend = s->window + s->strstart + MAX_MATCH - 1; in longest_match()592 register Byte *strend = s->window + s->strstart + MAX_MATCH; in longest_match()600 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); in longest_match()620 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258) in longest_match()650 len = (MAX_MATCH - 1) - (int)(strend-scan); in longest_match()651 scan = strend - (MAX_MATCH-1); in longest_match()681 len = MAX_MATCH - (int)(strend - scan); in longest_match()682 scan = strend - MAX_MATCH; in longest_match()
263 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
101 static uch length_code[MAX_MATCH-MIN_MATCH+1];931 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
1087 register Bytef *strend = s->window + s->strstart + MAX_MATCH;1120 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)1150 len = (MAX_MATCH - 1) - (int)(strend-scan);1151 scan = strend - (MAX_MATCH-1);1181 len = MAX_MATCH - (int)(strend - scan);1182 scan = strend - MAX_MATCH;1217 register Bytef *strend = s->window + s->strstart + MAX_MATCH;1255 len = MAX_MATCH - (int)(strend - scan);1752 if (s->lookahead < MAX_MATCH) {1754 if (s->lookahead < MAX_MATCH && flush == Z_NO_FLUSH) {[all …]
278 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)288 #define WIN_INIT MAX_MATCH
82 #define MAX_MATCH 258 macro
109 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) &&
32 #define MAX_MATCH 258 macro