Lines Matching defs:have
462 have = strm->avail_in; \
473 strm->avail_in = have; \
489 if (have == 0) goto inf_leave; \
490 have--; \
564 would all have to actually be part of the saved state in case NEEDBITS()
607 unsigned have, left; /* available input and output */
636 in = have;
767 if (copy > have)
769 copy = have;
784 have -= copy;
798 if (have == 0) goto inf_leave;
806 } while (len && copy < have);
811 have -= copy;
827 if (have == 0)
840 } while (len && copy < have);
845 have -= copy;
956 if (copy > have) copy = have;
960 have -= copy;
986 state->have = 0;
990 while (state->have < state->ncode) {
992 state->lens[order[state->have++]] = (unsigned short)BITS(3);
995 while (state->have < 19)
996 state->lens[order[state->have++]] = 0;
1008 state->have = 0;
1012 while (state->have < state->nlen + state->ndist) {
1020 state->lens[state->have++] = here.val;
1026 if (state->have == 0) {
1031 len = state->lens[state->have - 1];
1049 if (state->have + copy > state->nlen + state->ndist) {
1055 state->lens[state->have++] = (unsigned short)len;
1065 /* check for end-of-block code (better have one) */
1105 if (have >= 6 && left >= 258) {
1487 or when out of input. When called, *have is the number of pattern bytes
1488 found in order so far, in 0..3. On return *have is updated to the new
1489 state. If on return *have equals four, then the pattern was found and the
1491 pattern. If *have is less than four, then the pattern has not been found
1493 called again with more data and the *have state. *have is initialized to
1496 local unsigned syncsearch(unsigned FAR *have, const unsigned char FAR *buf,
1501 got = *have;
1518 *have = got;
1551 state->have = 0;
1552 syncsearch(&(state->have), buf, len);
1556 len = syncsearch(&(state->have), strm->next_in, strm->avail_in);
1562 if (state->have != 4)