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: */
633 * necessary to put more guard bytes at the end of the window, or
634 * to check more often for insufficient lookahead.
750 unsigned more; /* Amount of free space at the end of the window. */
754 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
757 if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
758 more = wsize;
760 } else if (more == (unsigned)(-1)) {
764 more--;
799 more += wsize;
805 * more == window_size - lookahead - strstart
806 * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
807 * => more >= window_size - 2*WSIZE + 2
810 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
811 * Otherwise, window_size == 2*WSIZE so more >= 2.
812 * If there was sliding, more >= WSIZE. So in all cases, more >= 2.
814 Assert(more >= 2, "more < 2");
816 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
824 Call UPDATE_HASH() MIN_MATCH-3 more times
993 Call UPDATE_HASH() MIN_MATCH-3 more times