zstd/compress/huf_compress.c

610     int nonNullRank;
615     nonNullRank = (int)maxSymbolValue;
616     while(huffNode[nonNullRank].count == 0) nonNullRank--;
617     lowS = nonNullRank; nodeRoot = nodeNb + lowS - 1; lowN = nodeNb;
637     for (n=0; n<=nonNullRank; n++)
640     return nonNullRank;
649  * @param      nonNullRank    The last and smallest node in the Huffman tree.
653 static void HUF_buildCTableFromTree(HUF_CElt* CTable, nodeElt const* huffNode, int nonNullRank, U32 maxSymbolValue, U32 maxNbBits)
661     for (n=0; n<=nonNullRank; n++)
682     int nonNullRank;
696     nonNullRank = HUF_buildTree(huffNode, maxSymbolValue);
699     maxNbBits = HUF_setMaxHeight(huffNode, (U32)nonNullRank, maxNbBits);
702     HUF_buildCTableFromTree(CTable, huffNode, nonNullRank, maxSymbolValue, maxNbBits);