bits 404 MMgc/GC-inlines.h int bits = GetPageMapValue((uintptr_t)gcItem);
bits 405 MMgc/GC-inlines.h if (bits == kGCAllocPage)
bits 407 MMgc/GC-inlines.h while (bits == kGCLargeAllocPageRest)
bits 410 MMgc/GC-inlines.h bits = GetPageMapValue((uintptr_t)gcItem);
bits 487 MMgc/GC-inlines.h REALLY_INLINE void GC::FreeBits(uint32_t *bits, int sizeClass)
bits 491 MMgc/GC-inlines.h GCAssert(((uint8_t*)bits)[i] == 0);
bits 493 MMgc/GC-inlines.h *(uint32_t**)bits = m_bitsFreelists[sizeClass];
bits 494 MMgc/GC-inlines.h m_bitsFreelists[sizeClass] = bits;
bits 1700 MMgc/GC.cpp int bits = GetPageMapValueGuarded((uintptr_t)gcItem);
bits 1701 MMgc/GC.cpp switch(bits)
bits 1710 MMgc/GC.cpp while(bits == kGCLargeAllocPageRest)
bits 1713 MMgc/GC.cpp bits = GetPageMapValue((uintptr_t)gcItem);
bits 1899 MMgc/GC.cpp int bits = GetPageMapValueGuarded((uintptr_t)item);
bits 1900 MMgc/GC.cpp switch(bits) {
bits 2132 MMgc/GC.cpp int bits = GetPageMapValue((uintptr_t)item);
bits 2134 MMgc/GC.cpp switch(bits)
bits 2271 MMgc/GC.cpp int bits = GetPageMapValue(val);
bits 2272 MMgc/GC.cpp switch(bits)
bits 2306 MMgc/GC.cpp int bits = GetPageMapValue(m);
bits 2307 MMgc/GC.cpp if(bits == kNonGC) {
bits 2310 MMgc/GC.cpp } else if(bits == kGCLargeAllocPageFirst) {
bits 2317 MMgc/GC.cpp } else if(bits == kGCAllocPage) {
bits 2345 MMgc/GC.cpp int bits = GetPageMapValue((uintptr_t)mem);
bits 2364 MMgc/GC.cpp switch(bits)
bits 2434 MMgc/GC.cpp int bits = GetPageMapValue(m);
bits 2435 MMgc/GC.cpp if(bits == kNonGC)
bits 2440 MMgc/GC.cpp else if(bits == kGCLargeAllocPageFirst)
bits 2454 MMgc/GC.cpp else if(bits == kGCAllocPage)
bits 2750 MMgc/GC.cpp return (bits == GC::kGCLargeAllocPageFirst
bits 2751 MMgc/GC.cpp || bits == GC::kGCLargeAllocPageRest);
bits 2755 MMgc/GC.cpp return bits == GC::kGCLargeAllocPageFirst;
bits 2834 MMgc/GC.cpp int bits = GetPageMapValue(val);
bits 2836 MMgc/GC.cpp if (bits == kGCAllocPage)
bits 2913 MMgc/GC.cpp else if (IsLargeAllocPage(bits))
bits 2919 MMgc/GC.cpp if (bits == kGCLargeAllocPageFirst)
bits 3128 MMgc/GC.cpp int bits = GetPageMapValueGuarded((uintptr_t)item);
bits 3129 MMgc/GC.cpp switch(bits) {
bits 3281 MMgc/GC.cpp uint32_t *bits;
bits 3292 MMgc/GC.cpp bits = m_bitsFreelists[sizeClass];
bits 3293 MMgc/GC.cpp m_bitsFreelists[sizeClass] = *(uint32_t**)bits;
bits 3294 MMgc/GC.cpp VMPI_memset(bits, 0, sizeof(uint32_t*));
bits 3295 MMgc/GC.cpp return bits;
bits 3303 MMgc/GC.cpp bits = m_bitsNext;
bits 3323 MMgc/GC.cpp return bits;
bits 3440 MMgc/GC.cpp int bits = GetPageMapValue(m);
bits 3441 MMgc/GC.cpp switch(bits)
bits 1349 MMgc/GC.h void FreeBits(uint32_t *bits, int sizeClass);
bits 68 MMgc/GCAlloc-inlines.h uint32_t *bits = &block->GetBits()[index>>3];
bits 69 MMgc/GCAlloc-inlines.h int set = *bits & mask;
bits 70 MMgc/GCAlloc-inlines.h *bits |= mask;
bits 71 MMgc/GCAlloc-inlines.h *bits &= ~(kQueued << ((index&7)<<2));
bits 101 MMgc/GCAlloc-inlines.h uint32_t* bits = block->GetBits() + (index >> 3);
bits 102 MMgc/GCAlloc-inlines.h if (*bits & (kMark << ((index&7)<<2))) {
bits 103 MMgc/GCAlloc-inlines.h *bits ^= (kMark|kQueued) << ((index&7)<<2);
bits 114 MMgc/GCAlloc-inlines.h uint32_t* bits = block->GetBits() + (index >> 3);
bits 115 MMgc/GCAlloc-inlines.h return (*bits & (kQueued << ((index&7)<<2))) != 0;
bits 243 MMgc/GCAlloc-inlines.h REALLY_INLINE void GCAlloc::ClearBits(GCBlock *block, int index, int bits)
bits 245 MMgc/GCAlloc-inlines.h int mask = bits << ((index&7)<<2);
bits 311 MMgc/GCAlloc-inlines.h return bits;
bits 116 MMgc/GCAlloc.cpp uint32_t* bits = NULL;
bits 120 MMgc/GCAlloc.cpp bits = m_gc->GetBits(m_numBitmapBytes, m_sizeClassIndex);
bits 148 MMgc/GCAlloc.cpp b->bits = m_bitsInPage ? b_32 : bits;
bits 178 MMgc/GCAlloc.cpp if (bits)
bits 179 MMgc/GCAlloc.cpp m_gc->FreeBits(bits, m_sizeClassIndex);
bits 219 MMgc/GCAlloc.cpp b->bits = NULL;
bits 432 MMgc/GCAlloc.cpp uint32_t *bits = (uint32_t*) b->GetBits();
bits 438 MMgc/GCAlloc.cpp uint32_t marks = bits[i];
bits 476 MMgc/GCAlloc.cpp bits[i] &= ~(kFinalize<<(j*4)); // Clear bits first so we won't get second finalization if finalizer longjmps out
bits 526 MMgc/GCAlloc.cpp uint32_t *bits = (uint32_t*) b->GetBits();
bits 532 MMgc/GCAlloc.cpp uint32_t marks = bits[i];
bits 542 MMgc/GCAlloc.cpp bits[i] &= ~(kFreelist<<(j*4));
bits 631 MMgc/GCAlloc.cpp uint32_t *bits = b->GetBits();
bits 638 MMgc/GCAlloc.cpp uint32_t marks = bits[i];
bits 186 MMgc/GCAlloc.h uint32_t* bits;
bits 277 MMgc/GCAlloc.h static void ClearBits(GCBlock *block, int index, int bits);
bits 610 MMgc/ZCT.cpp int32_t bits = gc->GetPageMapValue((uintptr_t)val);
bits 612 MMgc/ZCT.cpp if (bits == GC::kGCAllocPage) {
bits 615 MMgc/ZCT.cpp else if(bits == GC::kGCLargeAllocPageFirst) {
bits 1768 core/AvmCore.cpp Atom a = (Atom)(intptr_t)(int32)bits;
bits 1776 core/AvmCore.cpp buffer << "[unknown: " << bits << "]";
bits 1796 core/AvmCore.cpp uint32 bits = (uint32)*pc++;
bits 1798 core/AvmCore.cpp formatBits(buffer, bits);
bits 648 core/AvmCore.h void formatBits(PrintWriter& buffer, uint32 bits);
bits 95 core/BigInteger.cpp int bits = bitsInTopWord;
bits 102 core/BigInteger.cpp pos -= bits;
bits 109 core/BigInteger.cpp bits = (pos > 31) ? 32 : pos;
bits 110 core/BigInteger.cpp wshift = (pos > 31) ? 0 : 32-bits;
bits 111 core/BigInteger.cpp resultMantissa <<= bits;
bits 128 core/BigInteger.cpp if (bits == 32)
bits 141 core/BigInteger.cpp AvmAssert(bits < 32 && wshift > 0);
bits 61 core/BitSet.h return capacity > kDefaultCapacity ? bits.ptr : bits.ar;
bits 64 core/BitSet.h return capacity > kDefaultCapacity ? bits.ptr : bits.ar;
bits 86 core/BitSet.h mmfx_delete_array(bits.ptr);
bits 87 core/BitSet.h bits.ptr = 0;
bits 94 core/BitSet.h uintptr_t *bits = getbits();
bits 96 core/BitSet.h bits[i] = 0;
bits 133 core/BitSet.h uintptr_t *bits = getbits();
bits 137 core/BitSet.h uintptr_t b = bits[i];
bits 140 core/BitSet.h bits[i] = b|b2;
bits 152 core/BitSet.h uintptr_t *bits = getbits();
bits 154 core/BitSet.h newBits[i] = bits[i];
bits 160 core/BitSet.h mmfx_delete_array( bits );
bits 162 core/BitSet.h this->bits.ptr = newBits;
bits 175 core/BitSet.h bits;
bits 2862 core/Interpreter.cpp uint32_t bits[2];
bits 2864 core/Interpreter.cpp u.bits[0] = (uint32_t)*pc++;
bits 2865 core/Interpreter.cpp u.bits[1] = (uint32_t)*pc++;
bits 932 core/WordcodeEmitter.cpp uint32_t bits[2];
bits 937 core/WordcodeEmitter.cpp *dest++ = v.bits[0];
bits 938 core/WordcodeEmitter.cpp *dest++ = v.bits[1];
bits 961 core/WordcodeEmitter.cpp uint32_t bits[2];
bits 966 core/WordcodeEmitter.cpp *dest++ = v.bits[0];
bits 967 core/WordcodeEmitter.cpp *dest++ = v.bits[1];
bits 1641 eval/eval-lex.cpp uint64_t bits = 0;
bits 1655 eval/eval-lex.cpp bits = bits << 3 | digitValue(*i);
bits 1665 eval/eval-lex.cpp bits = bits << 4 | digitValue(*i);
bits 1682 eval/eval-lex.cpp if (n < 33) { bits <<= 32; n += 32; }
bits 1683 eval/eval-lex.cpp if (n < 49) { bits <<= 16; n += 16; }
bits 1684 eval/eval-lex.cpp if (n < 57) { bits <<= 8; n += 8; }
bits 1685 eval/eval-lex.cpp if (n < 61) { bits <<= 4; n += 4; }
bits 1686 eval/eval-lex.cpp if (n < 63) { bits <<= 2; n += 2; }
bits 1687 eval/eval-lex.cpp if (n < 64) { bits <<= 1; n += 1; }
bits 1690 eval/eval-lex.cpp if ((int64_t)bits > 0) { bits <<= 1; scale--; }
bits 1691 eval/eval-lex.cpp if ((int64_t)bits > 0) { bits <<= 1; scale--; }
bits 1692 eval/eval-lex.cpp if ((int64_t)bits > 0) { bits <<= 1; scale--; }
bits 1695 eval/eval-lex.cpp bits <<= 1;
bits 1696 eval/eval-lex.cpp uint64_t lost = bits & 0xFFF;
bits 1697 eval/eval-lex.cpp bits >>= 12;
bits 1703 eval/eval-lex.cpp bits += 1;
bits 1705 eval/eval-lex.cpp if (bits & 1)
bits 1706 eval/eval-lex.cpp bits += 1;
bits 1708 eval/eval-lex.cpp bits &= ~(uint64_t)0 >> 12;
bits 1712 eval/eval-lex.cpp bits |= (uint64_t)(1023 + scale) << 52;
bits 1714 eval/eval-lex.cpp uint64_t bits;
bits 1717 eval/eval-lex.cpp u.bits = bits;
bits 57 nanojit/Containers.cpp bits[i] = 0;
bits 65 nanojit/Containers.cpp int64_t *bits = this->bits;
bits 66 nanojit/Containers.cpp int64_t *otherbits = other.bits;
bits 69 nanojit/Containers.cpp int64_t b = bits[i];
bits 72 nanojit/Containers.cpp bits[i] = b|b2;
bits 87 nanojit/Containers.cpp bits2[j] = bits[j];
bits 91 nanojit/Containers.cpp bits = bits2;
bits 52 nanojit/Containers.h int64_t *bits;
bits 81 nanojit/Containers.h return (bits[w] & bitnum2mask(i)) != 0;
bits 91 nanojit/Containers.h bits[w] |= bitnum2mask(i);
bits 99 nanojit/Containers.h bits[w] &= ~bitnum2mask(i);
bits 410 other-licenses/zlib/deflate.c strm->state->bi_valid = bits;
bits 411 other-licenses/zlib/deflate.c strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));
bits 83 other-licenses/zlib/infback.c unsigned sym, bits;
bits 94 other-licenses/zlib/infback.c bits = 9;
bits 95 other-licenses/zlib/infback.c inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
bits 101 other-licenses/zlib/infback.c bits = 5;
bits 102 other-licenses/zlib/infback.c inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
bits 126 other-licenses/zlib/infback.c bits = state->bits; \
bits 137 other-licenses/zlib/infback.c state->bits = bits; \
bits 144 other-licenses/zlib/infback.c bits = 0; \
bits 167 other-licenses/zlib/infback.c hold += (unsigned long)(*next++) << bits; \
bits 168 other-licenses/zlib/infback.c bits += 8; \
bits 176 other-licenses/zlib/infback.c while (bits < (unsigned)(n)) \
bits 188 other-licenses/zlib/infback.c bits -= (unsigned)(n); \
bits 194 other-licenses/zlib/infback.c hold >>= bits & 7; \
bits 195 other-licenses/zlib/infback.c bits -= bits & 7; \
bits 253 other-licenses/zlib/infback.c unsigned bits; /* bits in bit buffer */
bits 276 other-licenses/zlib/infback.c bits = 0;
bits 393 other-licenses/zlib/infback.c if ((unsigned)(this.bits) <= bits) break;
bits 397 other-licenses/zlib/infback.c NEEDBITS(this.bits);
bits 398 other-licenses/zlib/infback.c DROPBITS(this.bits);
bits 403 other-licenses/zlib/infback.c NEEDBITS(this.bits + 2);
bits 404 other-licenses/zlib/infback.c DROPBITS(this.bits);
bits 415 other-licenses/zlib/infback.c NEEDBITS(this.bits + 3);
bits 416 other-licenses/zlib/infback.c DROPBITS(this.bits);
bits 422 other-licenses/zlib/infback.c NEEDBITS(this.bits + 7);
bits 423 other-licenses/zlib/infback.c DROPBITS(this.bits);
bits 478 other-licenses/zlib/infback.c if ((unsigned)(this.bits) <= bits) break;
bits 485 other-licenses/zlib/infback.c (BITS(last.bits + last.op) >> last.bits)];
bits 486 other-licenses/zlib/infback.c if ((unsigned)(last.bits + this.bits) <= bits) break;
bits 489 other-licenses/zlib/infback.c DROPBITS(last.bits);
bits 491 other-licenses/zlib/infback.c DROPBITS(this.bits);
bits 532 other-licenses/zlib/infback.c if ((unsigned)(this.bits) <= bits) break;
bits 539 other-licenses/zlib/infback.c (BITS(last.bits + last.op) >> last.bits)];
bits 540 other-licenses/zlib/infback.c if ((unsigned)(last.bits + this.bits) <= bits) break;
bits 543 other-licenses/zlib/infback.c DROPBITS(last.bits);
bits 545 other-licenses/zlib/infback.c DROPBITS(this.bits);
bits 85 other-licenses/zlib/inffast.c unsigned bits; /* local strm->bits */
bits 112 other-licenses/zlib/inffast.c bits = state->bits;
bits 121 other-licenses/zlib/inffast.c if (bits < 15) {
bits 122 other-licenses/zlib/inffast.c hold += (unsigned long)(PUP(in)) << bits;
bits 123 other-licenses/zlib/inffast.c bits += 8;
bits 124 other-licenses/zlib/inffast.c hold += (unsigned long)(PUP(in)) << bits;
bits 125 other-licenses/zlib/inffast.c bits += 8;
bits 129 other-licenses/zlib/inffast.c op = (unsigned)(this.bits);
bits 131 other-licenses/zlib/inffast.c bits -= op;
bits 143 other-licenses/zlib/inffast.c if (bits < op) {
bits 144 other-licenses/zlib/inffast.c hold += (unsigned long)(PUP(in)) << bits;
bits 145 other-licenses/zlib/inffast.c bits += 8;
bits 149 other-licenses/zlib/inffast.c bits -= op;
bits 152 other-licenses/zlib/inffast.c if (bits < 15) {
bits 153 other-licenses/zlib/inffast.c hold += (unsigned long)(PUP(in)) << bits;
bits 154 other-licenses/zlib/inffast.c bits += 8;
bits 155 other-licenses/zlib/inffast.c hold += (unsigned long)(PUP(in)) << bits;
bits 156 other-licenses/zlib/inffast.c bits += 8;
bits 160 other-licenses/zlib/inffast.c op = (unsigned)(this.bits);
bits 162 other-licenses/zlib/inffast.c bits -= op;
bits 167 other-licenses/zlib/inffast.c if (bits < op) {
bits 168 other-licenses/zlib/inffast.c hold += (unsigned long)(PUP(in)) << bits;
bits 169 other-licenses/zlib/inffast.c bits += 8;
bits 170 other-licenses/zlib/inffast.c if (bits < op) {
bits 171 other-licenses/zlib/inffast.c hold += (unsigned long)(PUP(in)) << bits;
bits 172 other-licenses/zlib/inffast.c bits += 8;
bits 184 other-licenses/zlib/inffast.c bits -= op;
bits 288 other-licenses/zlib/inffast.c len = bits >> 3;
bits 290 other-licenses/zlib/inffast.c bits -= len << 3;
bits 291 other-licenses/zlib/inffast.c hold &= (1U << bits) - 1;
bits 300 other-licenses/zlib/inffast.c state->bits = bits;
bits 122 other-licenses/zlib/inflate.c state->bits = 0;
bits 137 other-licenses/zlib/inflate.c if (bits > 16 || state->bits + bits > 32) return Z_STREAM_ERROR;
bits 138 other-licenses/zlib/inflate.c value &= (1L << bits) - 1;
bits 139 other-licenses/zlib/inflate.c state->hold += value << state->bits;
bits 140 other-licenses/zlib/inflate.c state->bits += bits;
bits 215 other-licenses/zlib/inflate.c unsigned sym, bits;
bits 226 other-licenses/zlib/inflate.c bits = 9;
bits 227 other-licenses/zlib/inflate.c inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
bits 233 other-licenses/zlib/inflate.c bits = 5;
bits 234 other-licenses/zlib/inflate.c inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
bits 289 other-licenses/zlib/inflate.c printf("{%u,%u,%d}", state.lencode[low].op, state.lencode[low].bits,
bits 300 other-licenses/zlib/inflate.c printf("{%u,%u,%d}", state.distcode[low].op, state.distcode[low].bits,
bits 410 other-licenses/zlib/inflate.c bits = state->bits; \
bits 421 other-licenses/zlib/inflate.c state->bits = bits; \
bits 428 other-licenses/zlib/inflate.c bits = 0; \
bits 437 other-licenses/zlib/inflate.c hold += (unsigned long)(*next++) << bits; \
bits 438 other-licenses/zlib/inflate.c bits += 8; \
bits 445 other-licenses/zlib/inflate.c while (bits < (unsigned)(n)) \
bits 457 other-licenses/zlib/inflate.c bits -= (unsigned)(n); \
bits 463 other-licenses/zlib/inflate.c hold >>= bits & 7; \
bits 464 other-licenses/zlib/inflate.c bits -= bits & 7; \
bits 563 other-licenses/zlib/inflate.c unsigned bits; /* bits in bit buffer */
bits 880 other-licenses/zlib/inflate.c if ((unsigned)(this.bits) <= bits) break;
bits 884 other-licenses/zlib/inflate.c NEEDBITS(this.bits);
bits 885 other-licenses/zlib/inflate.c DROPBITS(this.bits);
bits 890 other-licenses/zlib/inflate.c NEEDBITS(this.bits + 2);
bits 891 other-licenses/zlib/inflate.c DROPBITS(this.bits);
bits 902 other-licenses/zlib/inflate.c NEEDBITS(this.bits + 3);
bits 903 other-licenses/zlib/inflate.c DROPBITS(this.bits);
bits 909 other-licenses/zlib/inflate.c NEEDBITS(this.bits + 7);
bits 910 other-licenses/zlib/inflate.c DROPBITS(this.bits);
bits 959 other-licenses/zlib/inflate.c if ((unsigned)(this.bits) <= bits) break;
bits 966 other-licenses/zlib/inflate.c (BITS(last.bits + last.op) >> last.bits)];
bits 967 other-licenses/zlib/inflate.c if ((unsigned)(last.bits + this.bits) <= bits) break;
bits 970 other-licenses/zlib/inflate.c DROPBITS(last.bits);
bits 972 other-licenses/zlib/inflate.c DROPBITS(this.bits);
bits 1004 other-licenses/zlib/inflate.c if ((unsigned)(this.bits) <= bits) break;
bits 1011 other-licenses/zlib/inflate.c (BITS(last.bits + last.op) >> last.bits)];
bits 1012 other-licenses/zlib/inflate.c if ((unsigned)(last.bits + this.bits) <= bits) break;
bits 1015 other-licenses/zlib/inflate.c DROPBITS(last.bits);
bits 1017 other-licenses/zlib/inflate.c DROPBITS(this.bits);
bits 1148 other-licenses/zlib/inflate.c strm->data_type = state->bits + (state->last ? 64 : 0) +
bits 1273 other-licenses/zlib/inflate.c if (strm->avail_in == 0 && state->bits < 8) return Z_BUF_ERROR;
bits 1278 other-licenses/zlib/inflate.c state->hold <<= state->bits & 7;
bits 1279 other-licenses/zlib/inflate.c state->bits -= state->bits & 7;
bits 1281 other-licenses/zlib/inflate.c while (state->bits >= 8) {
bits 1284 other-licenses/zlib/inflate.c state->bits -= 8;
bits 1320 other-licenses/zlib/inflate.c return state->mode == STORED && state->bits == 0;
bits 95 other-licenses/zlib/inflate.h unsigned bits; /* number of bits in "in" */
bits 113 other-licenses/zlib/inftrees.c root = *bits;
bits 119 other-licenses/zlib/inftrees.c this.bits = (unsigned char)1;
bits 123 other-licenses/zlib/inftrees.c *bits = 1;
bits 218 other-licenses/zlib/inftrees.c this.bits = (unsigned char)(len - drop);
bits 286 other-licenses/zlib/inftrees.c (*table)[low].bits = (unsigned char)root;
bits 299 other-licenses/zlib/inftrees.c this.bits = (unsigned char)(len - drop);
bits 307 other-licenses/zlib/inftrees.c this.bits = (unsigned char)len;
bits 327 other-licenses/zlib/inftrees.c *bits = root;
bits 26 other-licenses/zlib/inftrees.h unsigned char bits; /* bits in this part of the code */
bits 243 other-licenses/zlib/trees.c int bits; /* bit counter */
bits 293 other-licenses/zlib/trees.c for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
bits 502 other-licenses/zlib/trees.c int bits; /* bit length */
bits 507 other-licenses/zlib/trees.c for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
bits 516 other-licenses/zlib/trees.c bits = tree[tree[n].Dad].Len + 1;
bits 517 other-licenses/zlib/trees.c if (bits > max_length) bits = max_length, overflow++;
bits 518 other-licenses/zlib/trees.c tree[n].Len = (ush)bits;
bits 523 other-licenses/zlib/trees.c s->bl_count[bits]++;
bits 527 other-licenses/zlib/trees.c s->opt_len += (ulg)f * (bits + xbits);
bits 537 other-licenses/zlib/trees.c bits = max_length-1;
bits 538 other-licenses/zlib/trees.c while (s->bl_count[bits] == 0) bits--;
bits 539 other-licenses/zlib/trees.c s->bl_count[bits]--; /* move one leaf down the tree */
bits 540 other-licenses/zlib/trees.c s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
bits 553 other-licenses/zlib/trees.c for (bits = max_length; bits != 0; bits--) {
bits 554 other-licenses/zlib/trees.c n = s->bl_count[bits];
bits 558 other-licenses/zlib/trees.c if ((unsigned) tree[m].Len != (unsigned) bits) {
bits 559 other-licenses/zlib/trees.c Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
bits 560 other-licenses/zlib/trees.c s->opt_len += ((long)bits - (long)tree[m].Len)
bits 562 other-licenses/zlib/trees.c tree[m].Len = (ush)bits;
bits 584 other-licenses/zlib/trees.c int bits; /* bit index */
bits 590 other-licenses/zlib/trees.c for (bits = 1; bits <= MAX_BITS; bits++) {
bits 591 other-licenses/zlib/trees.c next_code[bits] = code = (code + bl_count[bits-1]) << 1;
bits 654 other-licenses/zlib/zlib.h int bits,
bits 800 other-licenses/zlib/zlib.h int bits,