Lines Matching defs:more
19 * is preferable to spend more time in matches to allow very fast string
25 * A previous version of this file used a more sophisticated algorithm
27 * time, but has a larger average cost, uses more memory and is patented.
64 need_more, /* block not completed, need more input or more output */
66 finish_started, /* finish started, need only more output at next deflate */
67 finish_done /* finish done, accept no more input or output */
256 unsigned more; /* Amount of free space at the end of the window. */
262 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
266 if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
267 more = wsize;
269 } else if (more == (unsigned)(-1)) {
273 more--;
282 zmemcpy(s->window, s->window + wsize, (unsigned)wsize - more);
289 more += wsize;
295 * more == window_size - lookahead - strstart
296 * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
297 * => more >= window_size - 2*WSIZE + 2
300 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
301 * Otherwise, window_size == 2*WSIZE so more >= 2.
302 * If there was sliding, more >= WSIZE. So in all cases, more >= 2.
304 Assert(more >= 2, "more < 2");
306 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
315 Call UPDATE_HASH() MIN_MATCH-3 more times
978 * more output space, but possibly with both pending and
996 /* User must not provide more input after the first FINISH: */
1427 * necessary to put more guard bytes at the end of the window, or
1428 * to check more often for insufficient lookahead.
1631 * allowed here, then the hash table will be cleared, since two or more slides
1777 have += s->w_size; /* more space now */
1892 Call UPDATE_HASH() MIN_MATCH-3 more times