151         have = strm->avail_in; \
162         strm->avail_in = have; \
178         if (have == 0) { \
179             have = in(in_desc, &next); \
180             if (have == 0) { \
193         have--; \
275     unsigned have, left;        /* available input and output */  in inflateBack()  local
298     have = next != Z_NULL ? strm->avail_in : 0;  in inflateBack()
360                 if (copy > have) copy = have;  in inflateBack()
363                 have -= copy;  in inflateBack()
392             state->have = 0;  in inflateBack()
393             while (state->have < state->ncode) {  in inflateBack()
395                 state->lens[order[state->have++]] = (unsigned short)BITS(3);  in inflateBack()
398             while (state->have < 19)  in inflateBack()
399                 state->lens[order[state->have++]] = 0;  in inflateBack()
413             state->have = 0;  in inflateBack()
414             while (state->have < state->nlen + state->ndist) {  in inflateBack()
423                     state->lens[state->have++] = this.val;  in inflateBack()
429                         if (state->have == 0) {  in inflateBack()
434                         len = (unsigned)(state->lens[state->have - 1]);  in inflateBack()
452                     if (state->have + copy > state->nlen + state->ndist) {  in inflateBack()
458                         state->lens[state->have++] = (unsigned short)len;  in inflateBack()
491             if (have >= 6 && left >= 258) {  in inflateBack()
635     strm->avail_in = have;  in inflateBack()