nbBits             79 lib/zstd/bitstream.h ZSTD_STATIC void BIT_addBits(BIT_CStream_t *bitC, size_t value, unsigned nbBits);
nbBits            119 lib/zstd/bitstream.h ZSTD_STATIC size_t BIT_readBits(BIT_DStream_t *bitD, unsigned nbBits);
nbBits            136 lib/zstd/bitstream.h ZSTD_STATIC void BIT_addBitsFast(BIT_CStream_t *bitC, size_t value, unsigned nbBits);
nbBits            142 lib/zstd/bitstream.h ZSTD_STATIC size_t BIT_readBitsFast(BIT_DStream_t *bitD, unsigned nbBits);
nbBits            177 lib/zstd/bitstream.h ZSTD_STATIC void BIT_addBits(BIT_CStream_t *bitC, size_t value, unsigned nbBits)
nbBits            179 lib/zstd/bitstream.h 	bitC->bitContainer |= (value & BIT_mask[nbBits]) << bitC->bitPos;
nbBits            180 lib/zstd/bitstream.h 	bitC->bitPos += nbBits;
nbBits            185 lib/zstd/bitstream.h ZSTD_STATIC void BIT_addBitsFast(BIT_CStream_t *bitC, size_t value, unsigned nbBits)
nbBits            188 lib/zstd/bitstream.h 	bitC->bitPos += nbBits;
nbBits            288 lib/zstd/bitstream.h ZSTD_STATIC size_t BIT_getMiddleBits(size_t bitContainer, U32 const start, U32 const nbBits) { return (bitContainer >> start) & BIT_mask[nbBits]; }
nbBits            290 lib/zstd/bitstream.h ZSTD_STATIC size_t BIT_getLowerBits(size_t bitContainer, U32 const nbBits) { return bitContainer & BIT_mask[nbBits]; }
nbBits            299 lib/zstd/bitstream.h ZSTD_STATIC size_t BIT_lookBits(const BIT_DStream_t *bitD, U32 nbBits)
nbBits            302 lib/zstd/bitstream.h 	return ((bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> 1) >> ((bitMask - nbBits) & bitMask);
nbBits            307 lib/zstd/bitstream.h ZSTD_STATIC size_t BIT_lookBitsFast(const BIT_DStream_t *bitD, U32 nbBits)
nbBits            310 lib/zstd/bitstream.h 	return (bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> (((bitMask + 1) - nbBits) & bitMask);
nbBits            313 lib/zstd/bitstream.h ZSTD_STATIC void BIT_skipBits(BIT_DStream_t *bitD, U32 nbBits) { bitD->bitsConsumed += nbBits; }
nbBits            320 lib/zstd/bitstream.h ZSTD_STATIC size_t BIT_readBits(BIT_DStream_t *bitD, U32 nbBits)
nbBits            322 lib/zstd/bitstream.h 	size_t const value = BIT_lookBits(bitD, nbBits);
nbBits            323 lib/zstd/bitstream.h 	BIT_skipBits(bitD, nbBits);
nbBits            329 lib/zstd/bitstream.h ZSTD_STATIC size_t BIT_readBitsFast(BIT_DStream_t *bitD, U32 nbBits)
nbBits            331 lib/zstd/bitstream.h 	size_t const value = BIT_lookBitsFast(bitD, nbBits);
nbBits            332 lib/zstd/bitstream.h 	BIT_skipBits(bitD, nbBits);
nbBits             64 lib/zstd/entropy_common.c 	int nbBits;
nbBits             75 lib/zstd/entropy_common.c 	nbBits = (bitStream & 0xF) + FSE_MIN_TABLELOG; /* extract tableLog */
nbBits             76 lib/zstd/entropy_common.c 	if (nbBits > FSE_TABLELOG_ABSOLUTE_MAX)
nbBits             80 lib/zstd/entropy_common.c 	*tableLogPtr = nbBits;
nbBits             81 lib/zstd/entropy_common.c 	remaining = (1 << nbBits) + 1;
nbBits             82 lib/zstd/entropy_common.c 	threshold = 1 << nbBits;
nbBits             83 lib/zstd/entropy_common.c 	nbBits++;
nbBits            123 lib/zstd/entropy_common.c 				bitCount += nbBits - 1;
nbBits            128 lib/zstd/entropy_common.c 				bitCount += nbBits;
nbBits            136 lib/zstd/entropy_common.c 				nbBits--;
nbBits            266 lib/zstd/fse.h size_t FSE_buildCTable_raw(FSE_CTable *ct, unsigned nbBits);
nbBits            278 lib/zstd/fse.h size_t FSE_buildDTable_raw(FSE_DTable *dt, unsigned nbBits);
nbBits            478 lib/zstd/fse.h 	unsigned char nbBits;
nbBits            499 lib/zstd/fse.h 	U32 const nbBits = DInfo.nbBits;
nbBits            500 lib/zstd/fse.h 	size_t const lowBits = BIT_readBits(bitD, nbBits);
nbBits            507 lib/zstd/fse.h 	U32 const nbBits = DInfo.nbBits;
nbBits            509 lib/zstd/fse.h 	size_t const lowBits = BIT_readBits(bitD, nbBits);
nbBits            520 lib/zstd/fse.h 	U32 const nbBits = DInfo.nbBits;
nbBits            522 lib/zstd/fse.h 	size_t const lowBits = BIT_readBitsFast(bitD, nbBits);
nbBits            209 lib/zstd/fse_compress.c 	int nbBits;
nbBits            227 lib/zstd/fse_compress.c 	nbBits = tableLog + 1;
nbBits            269 lib/zstd/fse_compress.c 			bitCount += nbBits;
nbBits            275 lib/zstd/fse_compress.c 				nbBits--, threshold >>= 1;
nbBits            666 lib/zstd/fse_compress.c size_t FSE_buildCTable_raw(FSE_CTable *ct, unsigned nbBits)
nbBits            668 lib/zstd/fse_compress.c 	const unsigned tableSize = 1 << nbBits;
nbBits            678 lib/zstd/fse_compress.c 	if (nbBits < 1)
nbBits            682 lib/zstd/fse_compress.c 	tableU16[-2] = (U16)nbBits;
nbBits            691 lib/zstd/fse_compress.c 		const U32 deltaNbBits = (nbBits << 16) - (1 << nbBits);
nbBits            159 lib/zstd/fse_decompress.c 			tableDecode[u].nbBits = (BYTE)(tableLog - BIT_highbit32((U32)nextState));
nbBits            160 lib/zstd/fse_decompress.c 			tableDecode[u].newState = (U16)((nextState << tableDecode[u].nbBits) - tableSize);
nbBits            182 lib/zstd/fse_decompress.c 	cell->nbBits = 0;
nbBits            187 lib/zstd/fse_decompress.c size_t FSE_buildDTable_raw(FSE_DTable *dt, unsigned nbBits)
nbBits            193 lib/zstd/fse_decompress.c 	const unsigned tableSize = 1 << nbBits;
nbBits            199 lib/zstd/fse_decompress.c 	if (nbBits < 1)
nbBits            203 lib/zstd/fse_decompress.c 	DTableH->tableLog = (U16)nbBits;
nbBits            208 lib/zstd/fse_decompress.c 		dinfo[s].nbBits = (BYTE)nbBits;
nbBits            146 lib/zstd/huf_compress.c 	BYTE nbBits;
nbBits            180 lib/zstd/huf_compress.c 		huffWeight[n] = bitsToWeight[CTable[n].nbBits];
nbBits            248 lib/zstd/huf_compress.c 			CTable[n].nbBits = (BYTE)(tableLog + 1 - w);
nbBits            259 lib/zstd/huf_compress.c 				nbPerRank[CTable[n].nbBits]++;
nbBits            276 lib/zstd/huf_compress.c 				CTable[n].val = valPerRank[CTable[n].nbBits]++;
nbBits            287 lib/zstd/huf_compress.c 	BYTE nbBits;
nbBits            292 lib/zstd/huf_compress.c 	const U32 largestBits = huffNode[lastNonNull].nbBits;
nbBits            302 lib/zstd/huf_compress.c 		while (huffNode[n].nbBits > maxNbBits) {
nbBits            303 lib/zstd/huf_compress.c 			totalCost += baseCost - (1 << (largestBits - huffNode[n].nbBits));
nbBits            304 lib/zstd/huf_compress.c 			huffNode[n].nbBits = (BYTE)maxNbBits;
nbBits            307 lib/zstd/huf_compress.c 		while (huffNode[n].nbBits == maxNbBits)
nbBits            324 lib/zstd/huf_compress.c 					if (huffNode[pos].nbBits >= currNbBits)
nbBits            326 lib/zstd/huf_compress.c 					currNbBits = huffNode[pos].nbBits; /* < maxNbBits */
nbBits            354 lib/zstd/huf_compress.c 				huffNode[rankLast[nBitsToDecrease]].nbBits++;
nbBits            359 lib/zstd/huf_compress.c 					if (huffNode[rankLast[nBitsToDecrease]].nbBits != maxNbBits - nBitsToDecrease)
nbBits            367 lib/zstd/huf_compress.c 					while (huffNode[n].nbBits == maxNbBits)
nbBits            369 lib/zstd/huf_compress.c 					huffNode[n + 1].nbBits--;
nbBits            374 lib/zstd/huf_compress.c 				huffNode[rankLast[1] + 1].nbBits--;
nbBits            466 lib/zstd/huf_compress.c 	huffNode[nodeRoot].nbBits = 0;
nbBits            468 lib/zstd/huf_compress.c 		huffNode[n].nbBits = huffNode[huffNode[n].parent].nbBits + 1;
nbBits            470 lib/zstd/huf_compress.c 		huffNode[n].nbBits = huffNode[huffNode[n].parent].nbBits + 1;
nbBits            482 lib/zstd/huf_compress.c 			nbPerRank[huffNode[n].nbBits]++;
nbBits            493 lib/zstd/huf_compress.c 			tree[huffNode[n].byte].nbBits = huffNode[n].nbBits; /* push nbBits per symbol, symbol order */
nbBits            495 lib/zstd/huf_compress.c 			tree[n].val = valPerRank[tree[n].nbBits]++; /* assign value within rank, symbol order */
nbBits            503 lib/zstd/huf_compress.c 	size_t nbBits = 0;
nbBits            506 lib/zstd/huf_compress.c 		nbBits += CTable[s].nbBits * count[s];
nbBits            508 lib/zstd/huf_compress.c 	return nbBits >> 3;
nbBits            516 lib/zstd/huf_compress.c 		bad |= (count[s] != 0) & (CTable[s].nbBits == 0);
nbBits            523 lib/zstd/huf_compress.c 	BIT_addBitsFast(bitCPtr, CTable[symbol].val, CTable[symbol].nbBits);
nbBits             87 lib/zstd/huf_decompress.c 	BYTE nbBits;
nbBits            148 lib/zstd/huf_decompress.c 			D.nbBits = (BYTE)(tableLog + 1 - w);
nbBits            162 lib/zstd/huf_decompress.c 	BIT_skipBits(Dstream, dt[val].nbBits);
nbBits            383 lib/zstd/huf_decompress.c 	BYTE nbBits;
nbBits            407 lib/zstd/huf_decompress.c 		DElt.nbBits = (BYTE)(consumed);
nbBits            419 lib/zstd/huf_decompress.c 			const U32 nbBits = nbBitsBaseline - weight;
nbBits            420 lib/zstd/huf_decompress.c 			const U32 length = 1 << (sizeLog - nbBits);
nbBits            426 lib/zstd/huf_decompress.c 			DElt.nbBits = (BYTE)(nbBits + consumed);
nbBits            454 lib/zstd/huf_decompress.c 		const U32 nbBits = nbBitsBaseline - weight;
nbBits            456 lib/zstd/huf_decompress.c 		const U32 length = 1 << (targetLog - nbBits);
nbBits            458 lib/zstd/huf_decompress.c 		if (targetLog - nbBits >= minBits) { /* enough room for a second symbol */
nbBits            460 lib/zstd/huf_decompress.c 			int minWeight = nbBits + scaleLog;
nbBits            464 lib/zstd/huf_decompress.c 			HUF_fillDTableX4Level2(DTable + start, targetLog - nbBits, nbBits, rankValOrigin[nbBits], minWeight, sortedList + sortedRank,
nbBits            469 lib/zstd/huf_decompress.c 			DElt.nbBits = (BYTE)(nbBits);
nbBits            599 lib/zstd/huf_decompress.c 	BIT_skipBits(DStream, dt[val].nbBits);
nbBits            608 lib/zstd/huf_decompress.c 		BIT_skipBits(DStream, dt[val].nbBits);
nbBits            611 lib/zstd/huf_decompress.c 			BIT_skipBits(DStream, dt[val].nbBits);