Lines Matching refs:more
478 * trees more frequently.
559 * is preferable to spend more time in matches to allow very fast string
565 * A previous version of this file used a more sophisticated algorithm
567 * time, but has a larger average cost, uses more memory and is patented.
606 need_more, /* block not completed, need more input or more output */
608 finish_started, /* finish started, need only more output at next deflate */
609 finish_done /* finish done, accept no more input or output */
1022 * more output space, but possibly with both pending and
1040 /* User must not provide more input after the first FINISH: */
1336 * necessary to put more guard bytes at the end of the window, or
1337 * to check more often for insufficient lookahead.
1451 unsigned more; /* Amount of free space at the end of the window. */
1455 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
1458 if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
1459 more = wsize;
1461 } else if (more == (unsigned)(-1)) {
1465 more--;
1500 more += wsize;
1506 * more == window_size - lookahead - strstart
1507 * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
1508 * => more >= window_size - 2*WSIZE + 2
1511 * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
1512 * Otherwise, window_size == 2*WSIZE so more >= 2.
1513 * If there was sliding, more >= WSIZE. So in all cases, more >= 2.
1515 Assert(more >= 2, "more < 2");
1518 more);
1526 Call UPDATE_HASH() MIN_MATCH-3 more times
1693 Call UPDATE_HASH() MIN_MATCH-3 more times
1843 * The "deflation" process uses several Huffman trees. The more
1910 * more than 16 bits on some systems.)
2756 * Otherwise we can't have processed more than WSIZE input bytes since
2892 * binary if more than 20% of the bytes are <= 6 or >= 128, ascii otherwise.
3317 z->msg = (char *)"need more for packet flush";
3453 } more;
3639 would be more efficient, but perhaps a little confusing.) If two
3884 c = h->more.Base;
4109 #define base more.Base
4110 #define next more.Next
4155 shorter, more probable codes, and then point to subsidiary tables for
4174 about one bit more than those, so lbits is 8+1 and dbits is 5+1.
4604 #define base more.Base
4605 #define next more.Next
4813 case WASH: /* o: got eob, possibly more output */
4898 /* see if more to copy at beginning of window */
4954 #define base more.Base
4955 #define next more.Next