maxNbBits         152 lib/zstd/huf.h size_t HUF_buildCTable_wksp(HUF_CElt *tree, const U32 *count, U32 maxSymbolValue, U32 maxNbBits, void *workSpace, size_t wkspSize);
maxNbBits         290 lib/zstd/huf_compress.c static U32 HUF_setMaxHeight(nodeElt *huffNode, U32 lastNonNull, U32 maxNbBits)
maxNbBits         293 lib/zstd/huf_compress.c 	if (largestBits <= maxNbBits)
maxNbBits         299 lib/zstd/huf_compress.c 		const U32 baseCost = 1 << (largestBits - maxNbBits);
maxNbBits         302 lib/zstd/huf_compress.c 		while (huffNode[n].nbBits > maxNbBits) {
maxNbBits         304 lib/zstd/huf_compress.c 			huffNode[n].nbBits = (BYTE)maxNbBits;
maxNbBits         307 lib/zstd/huf_compress.c 		while (huffNode[n].nbBits == maxNbBits)
maxNbBits         311 lib/zstd/huf_compress.c 		totalCost >>= (largestBits - maxNbBits); /* note : totalCost is necessarily a multiple of baseCost */
maxNbBits         322 lib/zstd/huf_compress.c 				U32 currNbBits = maxNbBits;
maxNbBits         327 lib/zstd/huf_compress.c 					rankLast[maxNbBits - currNbBits] = pos;
maxNbBits         359 lib/zstd/huf_compress.c 					if (huffNode[rankLast[nBitsToDecrease]].nbBits != maxNbBits - nBitsToDecrease)
maxNbBits         367 lib/zstd/huf_compress.c 					while (huffNode[n].nbBits == maxNbBits)
maxNbBits         381 lib/zstd/huf_compress.c 	return maxNbBits;
maxNbBits         420 lib/zstd/huf_compress.c size_t HUF_buildCTable_wksp(HUF_CElt *tree, const U32 *count, U32 maxSymbolValue, U32 maxNbBits, void *workSpace, size_t wkspSize)
maxNbBits         432 lib/zstd/huf_compress.c 	if (maxNbBits == 0)
maxNbBits         433 lib/zstd/huf_compress.c 		maxNbBits = HUF_TABLELOG_DEFAULT;
maxNbBits         473 lib/zstd/huf_compress.c 	maxNbBits = HUF_setMaxHeight(huffNode, nonNullRank, maxNbBits);
maxNbBits         479 lib/zstd/huf_compress.c 		if (maxNbBits > HUF_TABLELOG_MAX)
maxNbBits         486 lib/zstd/huf_compress.c 			for (n = maxNbBits; n > 0; n--) {
maxNbBits         498 lib/zstd/huf_compress.c 	return maxNbBits;