huffNode          290 lib/zstd/huf_compress.c static U32 HUF_setMaxHeight(nodeElt *huffNode, U32 lastNonNull, U32 maxNbBits)
huffNode          292 lib/zstd/huf_compress.c 	const U32 largestBits = huffNode[lastNonNull].nbBits;
huffNode          302 lib/zstd/huf_compress.c 		while (huffNode[n].nbBits > maxNbBits) {
huffNode          303 lib/zstd/huf_compress.c 			totalCost += baseCost - (1 << (largestBits - huffNode[n].nbBits));
huffNode          304 lib/zstd/huf_compress.c 			huffNode[n].nbBits = (BYTE)maxNbBits;
huffNode          307 lib/zstd/huf_compress.c 		while (huffNode[n].nbBits == maxNbBits)
huffNode          324 lib/zstd/huf_compress.c 					if (huffNode[pos].nbBits >= currNbBits)
huffNode          326 lib/zstd/huf_compress.c 					currNbBits = huffNode[pos].nbBits; /* < maxNbBits */
huffNode          341 lib/zstd/huf_compress.c 						U32 const highTotal = huffNode[highPos].count;
huffNode          342 lib/zstd/huf_compress.c 						U32 const lowTotal = 2 * huffNode[lowPos].count;
huffNode          354 lib/zstd/huf_compress.c 				huffNode[rankLast[nBitsToDecrease]].nbBits++;
huffNode          359 lib/zstd/huf_compress.c 					if (huffNode[rankLast[nBitsToDecrease]].nbBits != maxNbBits - nBitsToDecrease)
huffNode          367 lib/zstd/huf_compress.c 					while (huffNode[n].nbBits == maxNbBits)
huffNode          369 lib/zstd/huf_compress.c 					huffNode[n + 1].nbBits--;
huffNode          374 lib/zstd/huf_compress.c 				huffNode[rankLast[1] + 1].nbBits--;
huffNode          389 lib/zstd/huf_compress.c static void HUF_sort(nodeElt *huffNode, const U32 *count, U32 maxSymbolValue)
huffNode          407 lib/zstd/huf_compress.c 		while ((pos > rank[r].base) && (c > huffNode[pos - 1].count))
huffNode          408 lib/zstd/huf_compress.c 			huffNode[pos] = huffNode[pos - 1], pos--;
huffNode          409 lib/zstd/huf_compress.c 		huffNode[pos].count = c;
huffNode          410 lib/zstd/huf_compress.c 		huffNode[pos].byte = (BYTE)n;
huffNode          423 lib/zstd/huf_compress.c 	nodeElt *const huffNode = huffNode0 + 1;
huffNode          439 lib/zstd/huf_compress.c 	HUF_sort(huffNode, count, maxSymbolValue);
huffNode          443 lib/zstd/huf_compress.c 	while (huffNode[nonNullRank].count == 0)
huffNode          448 lib/zstd/huf_compress.c 	huffNode[nodeNb].count = huffNode[lowS].count + huffNode[lowS - 1].count;
huffNode          449 lib/zstd/huf_compress.c 	huffNode[lowS].parent = huffNode[lowS - 1].parent = nodeNb;
huffNode          453 lib/zstd/huf_compress.c 		huffNode[n].count = (U32)(1U << 30);
huffNode          458 lib/zstd/huf_compress.c 		U32 n1 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++;
huffNode          459 lib/zstd/huf_compress.c 		U32 n2 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++;
huffNode          460 lib/zstd/huf_compress.c 		huffNode[nodeNb].count = huffNode[n1].count + huffNode[n2].count;
huffNode          461 lib/zstd/huf_compress.c 		huffNode[n1].parent = huffNode[n2].parent = nodeNb;
huffNode          466 lib/zstd/huf_compress.c 	huffNode[nodeRoot].nbBits = 0;
huffNode          468 lib/zstd/huf_compress.c 		huffNode[n].nbBits = huffNode[huffNode[n].parent].nbBits + 1;
huffNode          470 lib/zstd/huf_compress.c 		huffNode[n].nbBits = huffNode[huffNode[n].parent].nbBits + 1;
huffNode          473 lib/zstd/huf_compress.c 	maxNbBits = HUF_setMaxHeight(huffNode, nonNullRank, maxNbBits);
huffNode          482 lib/zstd/huf_compress.c 			nbPerRank[huffNode[n].nbBits]++;
huffNode          493 lib/zstd/huf_compress.c 			tree[huffNode[n].byte].nbBits = huffNode[n].nbBits; /* push nbBits per symbol, symbol order */