Lines Matching defs: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.
380 * more output space, but possibly with both pending and
398 /* User must not provide more input after the first FINISH: */
626 * necessary to put more guard bytes at the end of the window, or
627 * to check more often for insufficient lookahead.
743 unsigned more; /* Amount of free space at the end of the window. */
747 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
750 if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
751 more = wsize;
753 } else if (more == (unsigned)(-1)) {
757 more--;
792 more += wsize;
798 * more == window_size - lookahead - strstart
799 * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
800 * => more >= window_size - 2*WSIZE + 2
803 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
804 * Otherwise, window_size == 2*WSIZE so more >= 2.
805 * If there was sliding, more >= WSIZE. So in all cases, more >= 2.
807 Assert(more >= 2, "more < 2");
809 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
817 Call UPDATE_HASH() MIN_MATCH-3 more times
986 Call UPDATE_HASH() MIN_MATCH-3 more times