Cross Reference: /src/common/dist/zlib/deflate.c

Lines Matching refs:MIN_MATCH
129 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
153  *    characters and the first MIN_MATCH bytes of str are valid (except for
154  *    the last MIN_MATCH-1 bytes of the input file).
158    (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
163    (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
309         if (s->lookahead + s->insert >= MIN_MATCH) {
313 #if MIN_MATCH != 3
314             Call UPDATE_HASH() MIN_MATCH-3 more times
317                 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
324                 if (s->lookahead + s->insert < MIN_MATCH)
328         /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
449     s->hash_shift =  ((s->hash_bits + MIN_MATCH-1) / MIN_MATCH);
590     while (s->lookahead >= MIN_MATCH) {
592         n = s->lookahead - (MIN_MATCH-1);
594             UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
602         s->lookahead = MIN_MATCH-1;
609     s->match_length = s->prev_length = MIN_MATCH-1;
691     s->match_length = s->prev_length = MIN_MATCH-1;
1518     if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1543     if (len < MIN_MATCH) return MIN_MATCH - 1;
1820          * for the next match, plus MIN_MATCH bytes to insert the
1835         if (s->lookahead >= MIN_MATCH) {
1840          * At this point we have always match_length < MIN_MATCH
1850         if (s->match_length >= MIN_MATCH) {
1854                            s->match_length - MIN_MATCH, bflush);
1863                 s->lookahead >= MIN_MATCH) {
1869                      * always MIN_MATCH bytes ahead.
1880 #if MIN_MATCH != 3
1881                 Call UPDATE_HASH() MIN_MATCH-3 more times
1883                 /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
1896     s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;
1920          * for the next match, plus MIN_MATCH bytes to insert the
1935         if (s->lookahead >= MIN_MATCH) {
1942         s->match_length = MIN_MATCH-1;
1955                 || (s->match_length == MIN_MATCH &&
1960                 /* If prev_match is also MIN_MATCH, match_start is garbage
1963                 s->match_length = MIN_MATCH-1;
1969         if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
1970             uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1976                            s->prev_length - MIN_MATCH, bflush);
1991             s->match_length = MIN_MATCH-1;
2024     s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;
2060         if (s->lookahead >= MIN_MATCH && s->strstart > 0) {
2079         /* Emit match if have run of MIN_MATCH or longer, else emit literal */
2080         if (s->match_length >= MIN_MATCH) {
2083             _tr_tally_dist(s, 1, s->match_length - MIN_MATCH, bflush);
OpenGrok
