deflate.c - OpenGrok cross reference for /third

Lines Matching refs:MIN_MATCH
145 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
307             if (s->lookahead + s->insert > MIN_MATCH) {
313                     if (s->lookahead + s->insert <= MIN_MATCH)
319         if (s->lookahead + s->insert >= MIN_MATCH) {
323 #if MIN_MATCH != 3
324             Call UPDATE_HASH() MIN_MATCH-3 more times
327                 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
334                 if (s->lookahead + s->insert < MIN_MATCH)
338         /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
477     s->hash_shift =  ((s->hash_bits + MIN_MATCH-1) / MIN_MATCH);
630     while (s->lookahead >= MIN_MATCH) {
632         n = s->lookahead - (MIN_MATCH-1);
638         s->lookahead = MIN_MATCH-1;
645     s->match_length = s->prev_length = MIN_MATCH-1;
727     s->match_length = s->prev_length = MIN_MATCH-1;
1581     if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1606     if (len < MIN_MATCH) return MIN_MATCH - 1;
1875          * for the next match, plus MIN_MATCH bytes to insert the
1890         if (s->lookahead >= MIN_MATCH) {
1895          * At this point we have always match_length < MIN_MATCH
1905         if (s->match_length >= MIN_MATCH) {
1909                            s->match_length - MIN_MATCH, bflush);
1918                 s->lookahead >= MIN_MATCH) {
1924                      * always MIN_MATCH bytes ahead.
1937 #if MIN_MATCH != 3
1938                   Call UPDATE_HASH() MIN_MATCH-3 more times
1940                   /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
1954     s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;
1978          * for the next match, plus MIN_MATCH bytes to insert the
1993         if (s->lookahead >= MIN_MATCH) {
2000         s->match_length = MIN_MATCH-1;
2013                 || (s->match_length == MIN_MATCH &&
2018                 /* If prev_match is also MIN_MATCH, match_start is garbage
2021                 s->match_length = MIN_MATCH-1;
2027         if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
2028             uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
2040                            s->prev_length - MIN_MATCH, bflush);
2055             s->match_length = MIN_MATCH-1;
2088     s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;
2124         if (s->lookahead >= MIN_MATCH && s->strstart > 0) {
2143         /* Emit match if have run of MIN_MATCH or longer, else emit literal */
2144         if (s->match_length >= MIN_MATCH) {
2147             _tr_tally_dist(s, 1, s->match_length - MIN_MATCH, bflush);