Home
last modified time | relevance | path

Searched refs:huffNode (Results 1 – 1 of 1) sorted by relevance

/linux-6.3-rc2/lib/zstd/compress/
A Dhuf_compress.c474 if (huffNode[i].count > huffNode[i-1].count) { in HUF_isSorted()
485 huffNode += low; in HUF_insertionSort()
490 huffNode[j + 1] = huffNode[j]; in HUF_insertionSort()
618 huffNode[nodeNb].count = huffNode[lowS].count + huffNode[lowS-1].count; in HUF_buildTree()
619 huffNode[lowS].parent = huffNode[lowS-1].parent = (U16)nodeNb; in HUF_buildTree()
626 int const n1 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++; in HUF_buildTree()
627 int const n2 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++; in HUF_buildTree()
628 huffNode[nodeNb].count = huffNode[n1].count + huffNode[n2].count; in HUF_buildTree()
629 huffNode[n1].parent = huffNode[n2].parent = (U16)nodeNb; in HUF_buildTree()
636 huffNode[n].nbBits = huffNode[ huffNode[n].parent ].nbBits + 1; in HUF_buildTree()
[all …]

Completed in 6 milliseconds