Lines Matching refs:more
514 * trees more frequently.
635 * is preferable to spend more time in matches to allow very fast string
641 * A previous version of this file used a more sophisticated algorithm
643 * time, but has a larger average cost, uses more memory and is patented.
681 need_more, /* block not completed, need more input or more output */
683 finish_started, /* finish started, need only more output at next deflate */
684 finish_done /* finish done, accept no more input or output */
1090 * more output space, but possibly with both pending and
1108 /* User must not provide more input after the first FINISH: */
1394 * necessary to put more guard bytes at the end of the window, or
1395 * to check more often for insufficient lookahead.
1564 unsigned more; /* Amount of free space at the end of the window. */
1568 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
1571 if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
1572 more = wsize;
1574 } else if (more == (unsigned)(-1)) {
1578 more--;
1614 more += wsize;
1620 * more == window_size - lookahead - strstart
1621 * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
1622 * => more >= window_size - 2*WSIZE + 2
1625 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
1626 * Otherwise, window_size == 2*WSIZE so more >= 2.
1627 * If there was sliding, more >= WSIZE. So in all cases, more >= 2.
1629 Assert(more >= 2, "more < 2");
1631 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
1639 Call UPDATE_HASH() MIN_MATCH-3 more times
1807 Call UPDATE_HASH() MIN_MATCH-3 more times
1957 * The "deflation" process uses several Huffman trees. The more
2024 * more than 16 bits on some systems.)
3081 * Otherwise we can't have processed more than WSIZE input bytes since
3228 * binary if more than 20% of the bytes are <= 6 or >= 128, ascii otherwise.
3785 value below is more than safe. */
3973 would be more efficient, but perhaps a little confusing.) If two
4417 shorter, more probable codes, and then point to subsidiary tables for
4436 about one bit more than those, so lbits is 8+1 and dbits is 5+1.
5209 case WASH: /* o: got eob, possibly more output */
5294 /* see if more to copy at beginning of window */