Lines Matching defs:have

449         have = strm->avail_in; \
460 strm->avail_in = have; \
476 if (have == 0) goto inf_leave; \
477 have--; \
551 would all have to actually be part of the saved state in case NEEDBITS()
594 unsigned have, left; /* available input and output */
617 in = have;
728 if (copy > have) copy = have;
740 have -= copy;
751 if (have == 0) goto inf_leave;
759 } while (len && copy < have);
762 have -= copy;
773 if (have == 0) goto inf_leave;
781 } while (len && copy < have);
784 have -= copy;
884 if (copy > have) copy = have;
888 have -= copy;
914 state->have = 0;
918 while (state->have < state->ncode) {
920 state->lens[order[state->have++]] = (unsigned short)BITS(3);
923 while (state->have < 19)
924 state->lens[order[state->have++]] = 0;
936 state->have = 0;
940 while (state->have < state->nlen + state->ndist) {
948 state->lens[state->have++] = here.val;
954 if (state->have == 0) {
959 len = state->lens[state->have - 1];
977 if (state->have + copy > state->nlen + state->ndist) {
983 state->lens[state->have++] = (unsigned short)len;
990 /* check for end-of-block code (better have one) */
1027 if (have >= 6 && left >= 258) {
1346 or when out of input. When called, *have is the number of pattern bytes
1347 found in order so far, in 0..3. On return *have is updated to the new
1348 state. If on return *have equals four, then the pattern was found and the
1350 pattern. If *have is less than four, then the pattern has not been found
1352 called again with more data and the *have state. *have is initialized to
1355 local unsigned syncsearch(unsigned FAR *have, const unsigned char FAR *buf,
1360 got = *have;
1371 *have = got;
1398 state->have = 0;
1399 syncsearch(&(state->have), buf, len);
1403 len = syncsearch(&(state->have), strm->next_in, strm->avail_in);
1409 if (state->have != 4) return Z_DATA_ERROR;