60         if (strm->avail_in) {       /* copy what's there to the start */  in gz_avail()
63             unsigned n = strm->avail_in;  in gz_avail()
68         if (gz_load(state, state->in + strm->avail_in,  in gz_avail()
69                     state->size - strm->avail_in, &got) == -1)  in gz_avail()
71         strm->avail_in += got;  in gz_avail()
110         state->strm.avail_in = 0;  in gz_look()
122     if (strm->avail_in < 2) {  in gz_look()
125         if (strm->avail_in == 0)  in gz_look()
136     if (strm->avail_in > 1 &&  in gz_look()
147         strm->avail_in = 0;  in gz_look()
157     if (strm->avail_in) {  in gz_look()
158         memcpy(state->x.next, strm->next_in, strm->avail_in);  in gz_look()
159         state->x.have = strm->avail_in;  in gz_look()
160         strm->avail_in = 0;  in gz_look()
183         if (strm->avail_in == 0 && gz_avail(state) == -1)  in gz_decomp()
185         if (strm->avail_in == 0) {  in gz_decomp()
251     } while (state->x.have == 0 && (!state->eof || strm->avail_in));  in gz_fetch()
275         else if (state->eof && state->strm.avail_in == 0)  in gz_skip()
338         else if (state->eof && strm->avail_in == 0) {  in gzread()