77         while (strm->avail_in) {  in gz_comp()
78             put = strm->avail_in > max ? max : strm->avail_in;  in gz_comp()
84             strm->avail_in -= (unsigned)writ;  in gz_comp()
93         if (strm->avail_in == 0)  in gz_comp()
150     if (strm->avail_in && gz_comp(state, Z_NO_FLUSH) == -1)  in gz_zero()
162         strm->avail_in = n;  in gz_zero()
198             if (state->strm.avail_in == 0)  in gz_write()
200             have = (unsigned)((state->strm.next_in + state->strm.avail_in) -  in gz_write()
206             state->strm.avail_in += copy;  in gz_write()
216         if (state->strm.avail_in && gz_comp(state, Z_NO_FLUSH) == -1)  in gz_write()
225             state->strm.avail_in = n;  in gz_write()
314         if (strm->avail_in == 0)  in gzputc()
316         have = (unsigned)((strm->next_in + strm->avail_in) - state->in);  in gzputc()
319             strm->avail_in++;  in gzputc()
391     if (strm->avail_in == 0)  in gzvprintf()
393     next = (char *)(state->in + (strm->next_in - state->in) + strm->avail_in);  in gzvprintf()
417     strm->avail_in += (unsigned)len;  in gzvprintf()
419     if (strm->avail_in >= state->size) {  in gzvprintf()
420         left = strm->avail_in - state->size;  in gzvprintf()
421         strm->avail_in = state->size;  in gzvprintf()
426         strm->avail_in = left;  in gzvprintf()
481     if (strm->avail_in == 0)  in gzprintf()
483     next = (char *)(strm->next_in + strm->avail_in);  in gzprintf()
512     strm->avail_in += len;  in gzprintf()
514     if (strm->avail_in >= state->size) {  in gzprintf()
515         left = strm->avail_in - state->size;  in gzprintf()
516         strm->avail_in = state->size;  in gzprintf()
521         strm->avail_in = left;  in gzprintf()
586         if (strm->avail_in && gz_comp(state, Z_BLOCK) == -1)  in gzsetparams()