Lines Matching refs:more
20 * is preferable to spend more time in matches to allow very fast string
26 * A previous version of this file used a more sophisticated algorithm
28 * time, but has a larger average cost, uses more memory and is patented.
60 need_more, /* block not completed, need more input or more output */
62 finish_started, /* finish started, need only more output at next deflate */
63 finish_done /* finish done, accept no more input or output */
366 * more output space, but possibly with both pending and
384 /* User must not provide more input after the first FINISH: */
614 * necessary to put more guard bytes at the end of the window, or
615 * to check more often for insufficient lookahead.
731 unsigned more; /* Amount of free space at the end of the window. */
735 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
738 if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
739 more = wsize;
741 } else if (more == (unsigned)(-1)) {
745 more--;
780 more += wsize;
786 * more == window_size - lookahead - strstart
787 * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
788 * => more >= window_size - 2*WSIZE + 2
791 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
792 * Otherwise, window_size == 2*WSIZE so more >= 2.
793 * If there was sliding, more >= WSIZE. So in all cases, more >= 2.
795 Assert(more >= 2, "more < 2");
797 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
805 Call UPDATE_HASH() MIN_MATCH-3 more times
974 Call UPDATE_HASH() MIN_MATCH-3 more times