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.
77 need_more, /* block not completed, need more input or more output */
79 finish_started, /* finish started, need only more output at next deflate */
80 finish_done /* finish done, accept no more input or output */
251 unsigned more; /* Amount of free space at the end of the window. */
257 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
261 if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
262 more = wsize;
264 } else if (more == (unsigned)(-1)) {
268 more--;
277 zmemcpy(s->window, s->window + wsize, (unsigned)wsize - more);
284 more += wsize;
290 * more == window_size - lookahead - strstart
291 * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
292 * => more >= window_size - 2*WSIZE + 2
295 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
296 * Otherwise, window_size == 2*WSIZE so more >= 2.
297 * If there was sliding, more >= WSIZE. So in all cases, more >= 2.
299 Assert(more >= 2, "more < 2");
301 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
324 Call UPDATE_HASH() MIN_MATCH-3 more times
1008 * more output space, but possibly with both pending and
1026 /* User must not provide more input after the first FINISH: */
1465 * necessary to put more guard bytes at the end of the window, or
1466 * to check more often for insufficient lookahead.
1677 * allowed here, then the hash table will be cleared, since two or more slides
1822 have += s->w_size; /* more space now */
1938 Call UPDATE_HASH() MIN_MATCH-3 more times