Lines Matching refs: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.
67 need_more, /* block not completed, need more input or more output */
69 finish_started, /* finish started, need only more output at next deflate */
70 finish_done /* finish done, accept no more input or output */
484 * This function could be more sophisticated to provide closer upper bounds
761 * more output space, but possibly with both pending and
779 /* User must not provide more input after the first FINISH: */
1099 * necessary to put more guard bytes at the end of the window, or
1100 * to check more often for insufficient lookahead.
1271 unsigned more; /* Amount of free space at the end of the window. */
1275 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
1279 if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
1280 more = wsize;
1282 } else if (more == (unsigned)(-1)) {
1286 more--;
1325 more += wsize;
1331 * more == window_size - lookahead - strstart
1332 * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
1333 * => more >= window_size - 2*WSIZE + 2
1336 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
1337 * Otherwise, window_size == 2*WSIZE so more >= 2.
1338 * If there was sliding, more >= WSIZE. So in all cases, more >= 2.
1340 Assert(more >= 2, "more < 2");
1342 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
1350 Call UPDATE_HASH() MIN_MATCH-3 more times
1529 Call UPDATE_HASH() MIN_MATCH-3 more times