Lines Matching defs:MAX_MATCH
131 #define MAX_MATCH 258
390 * wSize-MAX_MATCH bytes, but this ensures that IO is always
544 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
717 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
1371 Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1375 Bytef *strend = s->window + s->strstart + MAX_MATCH;
1380 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
1383 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1403 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1415 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
1433 len = (MAX_MATCH - 1) - (int)(strend-scan);
1434 scan = strend - (MAX_MATCH-1);
1464 len = MAX_MATCH - (int)(strend - scan);
1465 scan = strend - MAX_MATCH;
1498 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1500 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
1503 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1536 len = MAX_MATCH - (int)(strend - scan);
1766 * at the end of the input file. We need MAX_MATCH bytes
1816 /* strstart never exceeds WSIZE-MAX_MATCH, so there are
1861 * at the end of the input file. We need MAX_MATCH bytes
2078 uch _length_code[MAX_MATCH-MIN_MATCH+1];
2191 const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {
2455 fprintf(header, "const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {\n");
2456 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {
2458 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));
3131 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
Indexes created Thu Oct 02 10:09:58 GMT 2025