Lines Matching refs:avail_in
72 /* Compress whatever is at avail_in and next_in and write to the output file.
92 while (strm->avail_in) {
93 put = strm->avail_in > max ? max : strm->avail_in;
99 strm->avail_in -= (unsigned)writ;
159 if (strm->avail_in && gz_comp(state, Z_NO_FLUSH) == -1)
171 strm->avail_in = n;
211 if (state.state->strm.avail_in == 0)
213 have = (unsigned)((state.state->strm.next_in + state.state->strm.avail_in) -
219 state.state->strm.avail_in += copy;
229 if (state.state->strm.avail_in && gz_comp(state, Z_NO_FLUSH) == -1)
238 state.state->strm.avail_in = (z_uInt)n;
339 if (strm->avail_in == 0)
341 have = (unsigned)((strm->next_in + strm->avail_in) - state.state->in);
344 strm->avail_in++;
417 if (strm->avail_in == 0)
419 next = (char *)(state.state->in + (strm->next_in - state.state->in) + strm->avail_in);
443 strm->avail_in += (unsigned)len;
445 if (strm->avail_in >= state.state->size) {
446 left = strm->avail_in - state.state->size;
447 strm->avail_in = state.state->size;
452 strm->avail_in = left;
511 if (strm->avail_in == 0)
513 next = (char *)(strm->next_in + strm->avail_in);
542 strm->avail_in += len;
544 if (strm->avail_in >= state.state->size) {
545 left = strm->avail_in - state.state->size;
546 strm->avail_in = state.state->size;
551 strm->avail_in = left;
623 if (strm->avail_in && gz_comp(state, Z_BLOCK) == -1)