Lines Matching refs:have
52 // be constrained to have access points at block boundaries, but would require
89 index->have = 0;
98 else if (index->have == index->mode) {
109 // Fill in the access point and increment how many we have.
110 point_t *next = (point_t *)(index->list) + index->have++;
111 if (index->have < 0) {
124 // Return the index, which may have been newly allocated or destroyed.
232 point_t *list = realloc(index->list, sizeof(point_t) * index->have);
241 return index->have;
246 // that do not have inflatePrime().
250 // Append the low bits bits of value to in[] at bit position *have, updating
251 // *have. value must be zero above its low bits bits. bits must be positive.
252 // This assumes that any bits above the *have bits in the last byte are zeros.
253 // That assumption is preserved on return, as any bits above *have + bits in
256 unsigned char *in, int *have) {
257 in += *have >> 3; // where the first bits from value will go
258 int k = *have & 7; // the number of bits already there
259 *have += bits;
298 int have = 0;
304 have = dynlen;
306 while ((have + bits) & 7)
309 append_bits(2, 10, in, &have);
312 append_bits(value, bits, in, &have);
319 // output byte from a fixed block. The last two bytes of the buffer have to
322 strm->avail_in = have >> 3;
338 if (index == NULL || index->have < 1 || index->list[0].out != 0)
346 int lo = -1, hi = index->have;
424 // The input does not have a complete trailer.
452 // Continue until we have the requested data, the deflate data has