Lines Matching refs:have
136 * At the end of a Deflate-compressed PPP packet, we expect to have seen
172 have = strm->avail_in; \
183 strm->avail_in = have; \
199 if (have == 0) goto inf_leave; \
200 have--; \
279 would all have to actually be part of the saved state in case NEEDBITS()
323 unsigned have, left; /* available input and output */
347 in = have;
435 if (copy > have) copy = have;
439 have -= copy;
463 state->have = 0;
466 while (state->have < state->ncode) {
468 state->lens[order[state->have++]] = (unsigned short)BITS(3);
471 while (state->have < 19)
472 state->lens[order[state->have++]] = 0;
483 state->have = 0;
486 while (state->have < state->nlen + state->ndist) {
495 state->lens[state->have++] = this.val;
501 if (state->have == 0) {
506 len = state->lens[state->have - 1];
524 if (state->have + copy > state->nlen + state->ndist) {
530 state->lens[state->have++] = (unsigned short)len;
559 if (have >= 6 && left >= 258) {
758 * the output will also be caught up, and the checksum will have been updated