Lines Matching refs:avail_in
415 avail = strm->avail_in;
417 strm->avail_in = dictLength;
442 strm->avail_in = avail;
598 if (strm->avail_in || (s->strstart - s->block_start) + s->lookahead)
779 (strm->avail_in != 0 && strm->next_in == Z_NULL) ||
794 * avail_in equal to zero. There won't be anything to do,
806 } else if (strm->avail_in == 0 && RANK(flush) <= RANK(old_flush) &&
812 if (s->status == FINISH_STATE && strm->avail_in != 0) {
999 if (strm->avail_in != 0 || s->lookahead != 0 ||
1172 unsigned len = strm->avail_in;
1177 strm->avail_in -= len;
1481 * At least one byte has been read, or avail_in == 0; reads are
1522 if (s->strm->avail_in == 0) break;
1564 } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0);
1663 unsigned used = s->strm->avail_in;
1676 if (len > (ulg)left + s->strm->avail_in)
1677 len = left + s->strm->avail_in; /* limit len to the input */
1688 len != left + s->strm->avail_in))
1694 last = flush == Z_FINISH && len == left + s->strm->avail_in ? 1 : 0;
1741 used -= s->strm->avail_in; /* number of input bytes directly copied */
1774 s->strm->avail_in == 0 && (long)s->strstart == s->block_start)
1779 if (s->strm->avail_in > have && s->block_start >= (long)s->w_size) {
1788 if (have > s->strm->avail_in)
1789 have = s->strm->avail_in;
1809 s->strm->avail_in == 0 && left <= have)) {
1811 last = flush == Z_FINISH && s->strm->avail_in == 0 &&