Lines Matching defs:more
31 * is preferable to spend more time in matches to allow very fast string
37 * A previous version of this file used a more sophisticated algorithm
39 * time, but has a larger average cost, uses more memory and is patented.
476 * necessary to put more guard bytes at the end of the window, or
477 * to check more often for insufficient lookahead.
594 unsigned more; /* Amount of free space at the end of the window. */
597 more = (unsigned)(window_size - (ulg)lookahead - (ulg)strstart);
602 if (more == (unsigned)EOF) {
606 more--;
621 * more == 0 with more == 64K on a 16 bit machine.
640 more += WSIZE;
669 * more == window_size - lookahead - strstart
670 * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
671 * => more >= window_size - 2*WSIZE + 2
674 * strstart + lookahead <= input_size => more >= MIN_LOOKAHEAD.
675 * Otherwise, window_size == 2*WSIZE so more >= 2.
676 * If there was sliding, more >= WSIZE. So in all cases, more >= 2.
678 Assert(more >= 2, "more < 2");
680 n = (*read_buf)((char*)window+strstart+lookahead, more);
767 Call UPDATE_HASH() MIN_MATCH-3 more times