Cross Reference: /src/sys/net/zlib.c

Lines Matching defs:MIN_MATCH
130 #define MIN_MATCH  3
416      * step. It must be such that after MIN_MATCH steps, the oldest
418      *   hash_shift * MIN_MATCH >= hash_bits
544 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
546  * See deflate.c for comments about the MIN_MATCH+1.
717 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
719  * See deflate.c for comments about the MIN_MATCH+1.
749 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
777  *    input characters and the first MIN_MATCH bytes of str are valid
778  *    (except for the last MIN_MATCH-1 bytes of the input file).
782    (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
787    (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
867     s->hash_shift =  ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
915     if (length < MIN_MATCH) return Z_OK;
932     for (n = 0; n <= length - MIN_MATCH; n++) {
1328     s->match_length = s->prev_length = MIN_MATCH-1;
1513     if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1538     if (len < MIN_MATCH) return MIN_MATCH - 1;
1659         if (s->lookahead >= MIN_MATCH) {
1662 #if MIN_MATCH != 3
1663             Call UPDATE_HASH() MIN_MATCH-3 more times
1666         /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
1767          * for the next match, plus MIN_MATCH bytes to insert the
1781         if (s->lookahead >= MIN_MATCH) {
1786          * At this point we have always match_length < MIN_MATCH
1798         if (s->match_length >= MIN_MATCH) {
1802                            s->match_length - MIN_MATCH, bflush);
1811                 s->lookahead >= MIN_MATCH) {
1817                      * always MIN_MATCH bytes ahead.
1828 #if MIN_MATCH != 3
1829                 Call UPDATE_HASH() MIN_MATCH-3 more times
1831                 /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
1862          * for the next match, plus MIN_MATCH bytes to insert the
1876         if (s->lookahead >= MIN_MATCH) {
1883         s->match_length = MIN_MATCH-1;
1897                  (s->match_length == MIN_MATCH &&
1900                 /* If prev_match is also MIN_MATCH, match_start is garbage
1903                 s->match_length = MIN_MATCH-1;
1909         if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
1910             uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1916 			   s->prev_length - MIN_MATCH, bflush);
1931             s->match_length = MIN_MATCH-1;
2078 uch _length_code[MAX_MATCH-MIN_MATCH+1];
2079 /* length code for each normalized match length (0 == MIN_MATCH) */
2082 /* First normalized length for each code (0 = MIN_MATCH) */
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));
3119 	unsigned lc)	/* match length-MIN_MATCH or unmatched char (if dist==0) */
3128         /* Here, lc is the match length - MIN_MATCH */
3131                (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
3184             /* Here, lc is the match length - MIN_MATCH */
OpenGrok
