contrib/zlib/deflate.c

94  * the desired pack level (0..9). The values given below have been tuned to
281             s->strstart    -= wsize; /* we now have strstart >= MAX_DIST */
306         /* Initialize the hash value now that we have some input: */
332     /* If the WIN_INIT bytes after the end of the current data have never been
473      * code is written. At that time, 31*(n - 2) bits have been written, just
474      * after 24*(n - 2) bits have been consumed from sym_buf. sym_buf starts at
826  * the data being compressed may have slid out of the sliding window, impeding
1197              * that the flush is complete. So we don't have to output an
1280  * doesn't have enough memory anyway to duplicate compression states).
1381     /* Do not waste too much time if we already have a good match: */
1627  * maximizes the opportunities to have a single copy from next_in to next_out.
1640     unsigned len, left, have, last = 0;
1648         have = (s->bi_valid + 42) >> 3;         /* number of header bytes */
1649         if (s->strm->avail_out < have)          /* need room for header */
1652         have = s->strm->avail_out - have;
1656         if (len > have)
1657             len = have;                         /* limit len to the output */
1759     have = s->window_size - s->strstart;
1760     if (s->strm->avail_in > have && s->block_start >= (long)s->w_size) {
1767         have += s->w_size;          /* more space now */
1771     if (have > s->strm->avail_in)
1772         have = s->strm->avail_in;
1773     if (have) {
1774         read_buf(s->strm, s->window + s->strstart, have);
1775         s->strstart += have;
1776         s->insert += MIN(have, s->w_size - s->insert);
1783      * have enough input for a worthy block, or if flushing and there is enough
1786     have = (s->bi_valid + 42) >> 3;         /* number of header bytes */
1788     have = MIN(s->pending_buf_size - have, MAX_STORED);
1789     min_block = MIN(have, s->w_size);
1793          s->strm->avail_in == 0 && left <= have)) {
1794         len = MIN(left, have);
1818         /* Make sure that we always have enough lookahead, except
1840          * At this point we have always match_length < MIN_MATCH
1844              * of window index 0 (in particular we have to avoid a match
1918         /* Make sure that we always have enough lookahead, except
1947              * of window index 0 (in particular we have to avoid a match
2046         /* Make sure that we always have enough lookahead, except
2079         /* Emit match if have run of MIN_MATCH or longer, else emit literal */
2115         /* Make sure that we have a literal to write. */