Searched refs:huffNode (Results 1 - 1 of 1) sorted by relevance
| /linux-master/lib/zstd/compress/ |
| H A D | huf_compress.c | 287 * Enforces maxNbBits on the Huffman tree described in huffNode.
293 * where largestBits == huffNode[lastNonNull].nbBits.
297 * @param huffNode The Huffman tree modified in place to enforce maxNbBits.
305 static U32 HUF_setMaxHeight(nodeElt* huffNode, U32 lastNonNull, U32 maxNbBits) argument
307 const U32 largestBits = huffNode[lastNonNull].nbBits;
320 while (huffNode[n].nbBits > maxNbBits) {
321 totalCost += baseCost - (1 << (largestBits - huffNode[n].nbBits));
322 huffNode[n].nbBits = (BYTE)maxNbBits;
325 /* n stops at huffNode[n].nbBits <= maxNbBits */
326 assert(huffNode[
471 HUF_isSorted(nodeElt huffNode[], U32 const maxSymbolValue1) argument
482 HUF_insertionSort(nodeElt huffNode[], int const low, int const high) argument
547 HUF_sort(nodeElt huffNode[], const unsigned count[], U32 const maxSymbolValue, rankPos rankPosition[]) argument
607 HUF_buildTree(nodeElt* huffNode, U32 maxSymbolValue) argument
653 HUF_buildCTableFromTree(HUF_CElt* CTable, nodeElt const* huffNode, int nonNullRank, U32 maxSymbolValue, U32 maxNbBits) argument
681 nodeElt* const huffNode = huffNode0+1; local
[all...] |
Completed in 102 milliseconds