Cross Reference: /src/common/dist/zlib/examples/zran.c

Lines Matching defs:have
52 // be constrained to have access points at block boundaries, but would require
87         index->have = 0;
96     else if (index->have == index->mode) {
107     // Fill in the access point and increment how many we have.
108     point_t *next = (point_t *)(index->list) + index->have++;
109     if (index->have < 0) {
122     // Return the index, which may have been newly allocated or destroyed.
229     point_t *list = realloc(index->list, sizeof(point_t) * index->have);
238     return index->have;
243 // that do not have inflatePrime().
247 // Append the low bits bits of value to in[] at bit position *have, updating
248 // *have. value must be zero above its low bits bits. bits must be positive.
249 // This assumes that any bits above the *have bits in the last byte are zeros.
250 // That assumption is preserved on return, as any bits above *have + bits in
253                                unsigned char *in, int *have) {
254     in += *have >> 3;           // where the first bits from value will go
255     int k = *have & 7;          // the number of bits already there
256     *have += bits;
294     int have = 0;
300         have = dynlen;
302     while ((have + bits) & 7)
305         append_bits(2, 10, in, &have);
308     append_bits(value, bits, in, &have);
315     // output byte from a fixed block. The last two bytes of the buffer have to
318     strm->avail_in = have >> 3;
333     if (index == NULL || index->have < 1 || index->list[0].out != 0)
341     int lo = -1, hi = index->have;
419                         // The input does not have a complete trailer.
447         // Continue until we have the requested data, the deflate data has
OpenGrok
