Lines Matching defs:have
124 have = strm->avail_in; \
135 strm->avail_in = have; \
151 if (have == 0) { \
152 have = in(in_desc, &next); \
153 if (have == 0) { \
166 have--; \
251 unsigned have, left; /* available input and output */
274 have = next != Z_NULL ? strm->avail_in : 0;
336 if (copy > have) copy = have;
339 have -= copy;
368 state->have = 0;
369 while (state->have < state->ncode) {
371 state->lens[order[state->have++]] = (unsigned short)BITS(3);
374 while (state->have < 19)
375 state->lens[order[state->have++]] = 0;
389 state->have = 0;
390 while (state->have < state->nlen + state->ndist) {
399 state->lens[state->have++] = this.val;
405 if (state->have == 0) {
410 len = (unsigned)(state->lens[state->have - 1]);
428 if (state->have + copy > state->nlen + state->ndist) {
434 state->lens[state->have++] = (unsigned short)len;
465 /* use inflate_fast() if we have enough input and output */
466 if (have >= 6 && left >= 258) {
610 strm->avail_in = have;
