Lines Matching defs:have
127 have = strm->avail_in; \
138 strm->avail_in = have; \
154 if (have == 0) { \
155 have = in(in_desc, &next); \
156 if (have == 0) { \
169 have--; \
249 unsigned have, left; /* available input and output */
272 have = next != Z_NULL ? strm->avail_in : 0;
334 if (copy > have) copy = have;
337 have -= copy;
366 state->have = 0;
367 while (state->have < state->ncode) {
369 state->lens[order[state->have++]] = (unsigned short)BITS(3);
372 while (state->have < 19)
373 state->lens[order[state->have++]] = 0;
387 state->have = 0;
388 while (state->have < state->nlen + state->ndist) {
396 state->lens[state->have++] = here.val;
402 if (state->have == 0) {
407 len = (unsigned)(state->lens[state->have - 1]);
425 if (state->have + copy > state->nlen + state->ndist) {
431 state->lens[state->have++] = (unsigned short)len;
438 /* check for end-of-block code (better have one) */
472 /* use inflate_fast() if we have enough input and output */
473 if (have >= 6 && left >= 258) {
619 strm->avail_in = have;