Lines Matching defs:have
451 have = strm->avail_in; \
462 strm->avail_in = have; \
478 if (have == 0) goto inf_leave; \
479 have--; \
553 would all have to actually be part of the saved state in case NEEDBITS()
596 unsigned have, left; /* available input and output */
626 in = have;
737 if (copy > have) copy = have;
749 have -= copy;
760 if (have == 0) goto inf_leave;
768 } while (len && copy < have);
771 have -= copy;
782 if (have == 0) goto inf_leave;
790 } while (len && copy < have);
793 have -= copy;
893 if (copy > have) copy = have;
897 have -= copy;
923 state->have = 0;
927 while (state->have < state->ncode) {
929 state->lens[order[state->have++]] = (unsigned short)BITS(3);
932 while (state->have < 19)
933 state->lens[order[state->have++]] = 0;
945 state->have = 0;
949 while (state->have < state->nlen + state->ndist) {
957 state->lens[state->have++] = here.val;
963 if (state->have == 0) {
968 len = state->lens[state->have - 1];
986 if (state->have + copy > state->nlen + state->ndist) {
992 state->lens[state->have++] = (unsigned short)len;
999 /* check for end-of-block code (better have one) */
1036 if (have >= 6 && left >= 258) {
1355 or when out of input. When called, *have is the number of pattern bytes
1356 found in order so far, in 0..3. On return *have is updated to the new
1357 state. If on return *have equals four, then the pattern was found and the
1359 pattern. If *have is less than four, then the pattern has not been found
1361 called again with more data and the *have state. *have is initialized to
1364 local unsigned syncsearch(unsigned FAR *have, const unsigned char FAR *buf,
1369 got = *have;
1380 *have = got;
1407 state->have = 0;
1408 syncsearch(&(state->have), buf, len);
1412 len = syncsearch(&(state->have), strm->next_in, strm->avail_in);
1418 if (state->have != 4) return Z_DATA_ERROR;