Lines Matching defs:more
21 * is preferable to spend more time in matches to allow very fast string
27 * A previous version of this file used a more sophisticated algorithm
29 * time, but has a larger average cost, uses more memory and is patented.
66 need_more, /* block not completed, need more input or more output */
68 finish_started, /* finish started, need only more output at next deflate */
69 finish_done /* finish done, accept no more input or output */
255 unsigned more; /* Amount of free space at the end of the window. */
261 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
265 if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
266 more = wsize;
268 } else if (more == (unsigned)(-1)) {
272 more--;
281 zmemcpy(s->window, s->window + wsize, (unsigned)wsize - more);
288 more += wsize;
294 * more == window_size - lookahead - strstart
295 * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
296 * => more >= window_size - 2*WSIZE + 2
299 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
300 * Otherwise, window_size == 2*WSIZE so more >= 2.
301 * If there was sliding, more >= WSIZE. So in all cases, more >= 2.
303 Assert(more >= 2, "more < 2");
305 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
314 Call UPDATE_HASH() MIN_MATCH-3 more times
972 * more output space, but possibly with both pending and
990 /* User must not provide more input after the first FINISH: */
1420 * necessary to put more guard bytes at the end of the window, or
1421 * to check more often for insufficient lookahead.
1622 * allowed here, then the hash table will be cleared, since two or more slides
1767 have += s->w_size; /* more space now */
1881 Call UPDATE_HASH() MIN_MATCH-3 more times