Lines Matching refs:avail_in
62 /* Compress whatever is at avail_in and next_in and write to the output file.
80 while (strm->avail_in) {
81 put = strm->avail_in > max ? max : strm->avail_in;
87 strm->avail_in -= (unsigned)writ;
96 if (strm->avail_in == 0)
154 if (strm->avail_in && gz_comp(state, Z_NO_FLUSH) == -1)
166 strm->avail_in = n;
203 if (state->strm.avail_in == 0)
205 have = (unsigned)((state->strm.next_in + state->strm.avail_in) -
211 state->strm.avail_in += copy;
221 if (state->strm.avail_in && gz_comp(state, Z_NO_FLUSH) == -1)
230 state->strm.avail_in = n;
320 if (strm->avail_in == 0)
322 have = (unsigned)((strm->next_in + strm->avail_in) - state->in);
325 strm->avail_in++;
397 if (strm->avail_in == 0)
399 next = (char *)(state->in + (strm->next_in - state->in) + strm->avail_in);
423 strm->avail_in += (unsigned)len;
425 if (strm->avail_in >= state->size) {
426 left = strm->avail_in - state->size;
427 strm->avail_in = state->size;
432 strm->avail_in = left;
487 if (strm->avail_in == 0)
489 next = (char *)(strm->next_in + strm->avail_in);
518 strm->avail_in += len;
520 if (strm->avail_in >= state->size) {
521 left = strm->avail_in - state->size;
522 strm->avail_in = state->size;
527 strm->avail_in = left;
592 if (strm->avail_in && gz_comp(state, Z_BLOCK) == -1)