deflate.c - OpenGrok cross reference for /third

Lines Matching refs:MIN_MATCH
127 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
151  *    characters and the first MIN_MATCH bytes of str are valid (except for
152  *    the last MIN_MATCH-1 bytes of the input file).
156    (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
161    (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
310         if (s->lookahead + s->insert >= MIN_MATCH) {
314 #if MIN_MATCH != 3
315             Call UPDATE_HASH() MIN_MATCH-3 more times
318                 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
325                 if (s->lookahead + s->insert < MIN_MATCH)
329         /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
450     s->hash_shift =  ((s->hash_bits + MIN_MATCH-1) / MIN_MATCH);
592     while (s->lookahead >= MIN_MATCH) {
594         n = s->lookahead - (MIN_MATCH-1);
596             UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
604         s->lookahead = MIN_MATCH-1;
611     s->match_length = s->prev_length = MIN_MATCH-1;
694     s->match_length = s->prev_length = MIN_MATCH-1;
1526     if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1551     if (len < MIN_MATCH) return MIN_MATCH - 1;
1831          * for the next match, plus MIN_MATCH bytes to insert the
1846         if (s->lookahead >= MIN_MATCH) {
1851          * At this point we have always match_length < MIN_MATCH
1861         if (s->match_length >= MIN_MATCH) {
1865                            s->match_length - MIN_MATCH, bflush);
1874                 s->lookahead >= MIN_MATCH) {
1880                      * always MIN_MATCH bytes ahead.
1891 #if MIN_MATCH != 3
1892                 Call UPDATE_HASH() MIN_MATCH-3 more times
1894                 /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
1907     s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;
1932          * for the next match, plus MIN_MATCH bytes to insert the
1947         if (s->lookahead >= MIN_MATCH) {
1954         s->match_length = MIN_MATCH-1;
1967                 || (s->match_length == MIN_MATCH &&
1972                 /* If prev_match is also MIN_MATCH, match_start is garbage
1975                 s->match_length = MIN_MATCH-1;
1981         if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
1982             uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1988                            s->prev_length - MIN_MATCH, bflush);
2003             s->match_length = MIN_MATCH-1;
2036     s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;
2073         if (s->lookahead >= MIN_MATCH && s->strstart > 0) {
2092         /* Emit match if have run of MIN_MATCH or longer, else emit literal */
2093         if (s->match_length >= MIN_MATCH) {
2096             _tr_tally_dist(s, 1, s->match_length - MIN_MATCH, bflush);