Lines Matching refs:nbBits
146 BYTE nbBits;
180 huffWeight[n] = bitsToWeight[CTable[n].nbBits];
243 /* fill nbBits */
248 CTable[n].nbBits = (BYTE)(tableLog + 1 - w);
259 nbPerRank[CTable[n].nbBits]++;
276 CTable[n].val = valPerRank[CTable[n].nbBits]++;
287 BYTE nbBits;
292 const U32 largestBits = huffNode[lastNonNull].nbBits;
302 while (huffNode[n].nbBits > maxNbBits) {
303 totalCost += baseCost - (1 << (largestBits - huffNode[n].nbBits));
304 huffNode[n].nbBits = (BYTE)maxNbBits;
306 } /* n stops at huffNode[n].nbBits <= maxNbBits */
307 while (huffNode[n].nbBits == maxNbBits)
324 if (huffNode[pos].nbBits >= currNbBits)
326 currNbBits = huffNode[pos].nbBits; /* < maxNbBits */
354 huffNode[rankLast[nBitsToDecrease]].nbBits++;
359 if (huffNode[rankLast[nBitsToDecrease]].nbBits != maxNbBits - nBitsToDecrease)
367 while (huffNode[n].nbBits == maxNbBits)
369 huffNode[n + 1].nbBits--;
374 huffNode[rankLast[1] + 1].nbBits--;
466 huffNode[nodeRoot].nbBits = 0;
468 huffNode[n].nbBits = huffNode[huffNode[n].parent].nbBits + 1;
470 huffNode[n].nbBits = huffNode[huffNode[n].parent].nbBits + 1;
475 /* fill result into tree (val, nbBits) */
482 nbPerRank[huffNode[n].nbBits]++;
493 tree[huffNode[n].byte].nbBits = huffNode[n].nbBits; /* push nbBits per symbol, symbol order */
495 tree[n].val = valPerRank[tree[n].nbBits]++; /* assign value within rank, symbol order */
503 size_t nbBits = 0;
506 nbBits += CTable[s].nbBits * count[s];
508 return nbBits >> 3;
516 bad |= (count[s] != 0) & (CTable[s].nbBits == 0);
523 BIT_addBitsFast(bitCPtr, CTable[symbol].val, CTable[symbol].nbBits);