Lines Matching refs:avail_in
59 /* Compress whatever is at avail_in and next_in and write to the output file.
76 while (strm->avail_in) {
77 put = strm->avail_in > max ? max : strm->avail_in;
83 strm->avail_in -= (unsigned)writ;
92 if (strm->avail_in == 0)
149 if (strm->avail_in && gz_comp(state, Z_NO_FLUSH) == -1)
161 strm->avail_in = n;
197 if (state->strm.avail_in == 0)
199 have = (unsigned)((state->strm.next_in + state->strm.avail_in) -
205 state->strm.avail_in += copy;
215 if (state->strm.avail_in && gz_comp(state, Z_NO_FLUSH) == -1)
224 state->strm.avail_in = n;
313 if (strm->avail_in == 0)
315 have = (unsigned)((strm->next_in + strm->avail_in) - state->in);
318 strm->avail_in++;
390 if (strm->avail_in == 0)
392 next = (char *)(state->in + (strm->next_in - state->in) + strm->avail_in);
416 strm->avail_in += (unsigned)len;
418 if (strm->avail_in >= state->size) {
419 left = strm->avail_in - state->size;
420 strm->avail_in = state->size;
425 strm->avail_in = left;
480 if (strm->avail_in == 0)
482 next = (char *)(strm->next_in + strm->avail_in);
511 strm->avail_in += len;
513 if (strm->avail_in >= state->size) {
514 left = strm->avail_in - state->size;
515 strm->avail_in = state->size;
520 strm->avail_in = left;
585 if (strm->avail_in && gz_comp(state, Z_BLOCK) == -1)