largestBits       292 lib/zstd/huf_compress.c 	const U32 largestBits = huffNode[lastNonNull].nbBits;
largestBits       293 lib/zstd/huf_compress.c 	if (largestBits <= maxNbBits)
largestBits       294 lib/zstd/huf_compress.c 		return largestBits; /* early exit : no elt > maxNbBits */
largestBits       299 lib/zstd/huf_compress.c 		const U32 baseCost = 1 << (largestBits - maxNbBits);
largestBits       303 lib/zstd/huf_compress.c 			totalCost += baseCost - (1 << (largestBits - huffNode[n].nbBits));
largestBits       311 lib/zstd/huf_compress.c 		totalCost >>= (largestBits - maxNbBits); /* note : totalCost is necessarily a multiple of baseCost */