Lines Matching refs:more
29 * is preferable to spend more time in matches to allow very fast string
35 * A previous version of this file used a more sophisticated algorithm
37 * time, but has a larger average cost, uses more memory and is patented.
473 * necessary to put more guard bytes at the end of the window, or
474 * to check more often for insufficient lookahead.
591 unsigned more; /* Amount of free space at the end of the window. */
594 more = (unsigned)(window_size - (ulg)lookahead - (ulg)strstart);
599 if (more == (unsigned)EOF) {
603 more--;
618 * more == 0 with more == 64K on a 16 bit machine.
637 more += WSIZE;
648 * more == window_size - lookahead - strstart
649 * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
650 * => more >= window_size - 2*WSIZE + 2
653 * strstart + lookahead <= input_size => more >= MIN_LOOKAHEAD.
654 * Otherwise, window_size == 2*WSIZE so more >= 2.
655 * If there was sliding, more >= WSIZE. So in all cases, more >= 2.
657 Assert(more >= 2, "more < 2");
659 n = (*read_buf)((char*)window+strstart+lookahead, more);
746 Call UPDATE_HASH() MIN_MATCH-3 more times