50         if (strm->avail_in) {       /* copy what's there to the start */  in gz_avail()
53             unsigned n = strm->avail_in;  in gz_avail()
58         if (gz_load(state, state->in + strm->avail_in,  in gz_avail()
59                     state->size - strm->avail_in, &got) == -1)  in gz_avail()
61         strm->avail_in += got;  in gz_avail()
96         state->strm.avail_in = 0;  in gz_look()
108     if (strm->avail_in < 2) {  in gz_look()
111         if (strm->avail_in == 0)  in gz_look()
122     if (strm->avail_in > 1 &&  in gz_look()
133         strm->avail_in = 0;  in gz_look()
143     memcpy(state->x.next, strm->next_in, strm->avail_in);  in gz_look()
144     state->x.have = strm->avail_in;  in gz_look()
145     strm->avail_in = 0;  in gz_look()
165         if (strm->avail_in == 0 && gz_avail(state) == -1)  in gz_decomp()
167         if (strm->avail_in == 0) {  in gz_decomp()
231     } while (state->x.have == 0 && (!state->eof || strm->avail_in));  in gz_fetch()
252         else if (state->eof && state->strm.avail_in == 0)  in gz_skip()
301         else if (state->eof && state->strm.avail_in == 0) {  in gz_read()