Lines Matching refs:have
450 have = strm->avail_in; \
461 strm->avail_in = have; \
477 if (have == 0) goto inf_leave; \
478 have--; \
552 would all have to actually be part of the saved state in case NEEDBITS()
595 unsigned have, left; /* available input and output */
618 in = have;
729 if (copy > have) copy = have;
741 have -= copy;
752 if (have == 0) goto inf_leave;
760 } while (len && copy < have);
763 have -= copy;
774 if (have == 0) goto inf_leave;
782 } while (len && copy < have);
785 have -= copy;
885 if (copy > have) copy = have;
889 have -= copy;
915 state->have = 0;
919 while (state->have < state->ncode) {
921 state->lens[order[state->have++]] = (unsigned short)BITS(3);
924 while (state->have < 19)
925 state->lens[order[state->have++]] = 0;
937 state->have = 0;
941 while (state->have < state->nlen + state->ndist) {
949 state->lens[state->have++] = here.val;
955 if (state->have == 0) {
960 len = state->lens[state->have - 1];
978 if (state->have + copy > state->nlen + state->ndist) {
984 state->lens[state->have++] = (unsigned short)len;
991 /* check for end-of-block code (better have one) */
1028 if (have >= INFLATE_FAST_MIN_INPUT &&
1348 or when out of input. When called, *have is the number of pattern bytes
1349 found in order so far, in 0..3. On return *have is updated to the new
1350 state. If on return *have equals four, then the pattern was found and the
1352 pattern. If *have is less than four, then the pattern has not been found
1354 called again with more data and the *have state. *have is initialized to
1357 local unsigned syncsearch(unsigned FAR *have, const unsigned char FAR *buf,
1362 got = *have;
1373 *have = got;
1400 state->have = 0;
1401 syncsearch(&(state->have), buf, len);
1405 len = syncsearch(&(state->have), strm->next_in, strm->avail_in);
1411 if (state->have != 4) return Z_DATA_ERROR;