Lines Matching defs:have
180 have = strm->avail_in; \
191 strm->avail_in = have; \
207 if (have == 0) goto inf_leave; \
208 have--; \
287 would all have to actually be part of the saved state in case NEEDBITS()
330 unsigned have, left; /* available input and output */
353 in = have;
452 if (copy > have) copy = have;
464 have -= copy;
474 if (have == 0) goto inf_leave;
482 } while (len && copy < have);
485 have -= copy;
495 if (have == 0) goto inf_leave;
503 } while (len && copy < have);
506 have -= copy;
594 if (copy > have) copy = have;
598 have -= copy;
624 state->have = 0;
627 while (state->have < state->ncode) {
629 state->lens[order[state->have++]] = (unsigned short)BITS(3);
632 while (state->have < 19)
633 state->lens[order[state->have++]] = 0;
645 state->have = 0;
648 while (state->have < state->nlen + state->ndist) {
657 state->lens[state->have++] = this.val;
663 if (state->have == 0) {
668 len = state->lens[state->have - 1];
686 if (state->have + copy > state->nlen + state->ndist) {
692 state->lens[state->have++] = (unsigned short)len;
723 if (have >= 6 && left >= 258) {