Lines Matching defs:have
102 local unsigned syncsearch OF((unsigned FAR *have, const unsigned char FAR *buf,
481 have = strm->avail_in; \
492 strm->avail_in = have; \
508 if (have == 0) goto inf_leave; \
509 have--; \
583 would all have to actually be part of the saved state in case NEEDBITS()
629 unsigned have, left; /* available input and output */
652 in = have;
759 if (copy > have) copy = have;
770 have -= copy;
780 if (have == 0) goto inf_leave;
788 } while (len && copy < have);
791 have -= copy;
801 if (have == 0) goto inf_leave;
809 } while (len && copy < have);
812 have -= copy;
906 if (copy > have) copy = have;
910 have -= copy;
936 state->have = 0;
939 while (state->have < state->ncode) {
941 state->lens[order[state->have++]] = (unsigned short)BITS(3);
944 while (state->have < 19)
945 state->lens[order[state->have++]] = 0;
957 state->have = 0;
960 while (state->have < state->nlen + state->ndist) {
968 state->lens[state->have++] = here.val;
974 if (state->have == 0) {
979 len = state->lens[state->have - 1];
997 if (state->have + copy > state->nlen + state->ndist) {
1003 state->lens[state->have++] = (unsigned short)len;
1010 /* check for end-of-block code (better have one) */
1045 if (have >= 6 && left >= 258) {
1368 or when out of input. When called, *have is the number of pattern bytes
1369 found in order so far, in 0..3. On return *have is updated to the new
1370 state. If on return *have equals four, then the pattern was found and the
1372 pattern. If *have is less than four, then the pattern has not been found
1374 called again with more data and the *have state. *have is initialized to
1377 local unsigned syncsearch(have, buf, len)
1378 unsigned FAR *have;
1385 got = *have;
1396 *have = got;
1424 state->have = 0;
1425 syncsearch(&(state->have), buf, len);
1429 len = syncsearch(&(state->have), strm->next_in, strm->avail_in);
1435 if (state->have != 4) return Z_DATA_ERROR;