Home
last modified time | relevance | path

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

/freebsd/sys/contrib/openzfs/module/zstd/lib/compress/
H A Dhuf_compress.c345 int nodeNb = STARTNODE; in HUF_buildCTable_wksp() local
363 lowS = nonNullRank; nodeRoot = nodeNb + lowS - 1; lowN = nodeNb; in HUF_buildCTable_wksp()
364 huffNode[nodeNb].count = huffNode[lowS].count + huffNode[lowS-1].count; in HUF_buildCTable_wksp()
365 huffNode[lowS].parent = huffNode[lowS-1].parent = (U16)nodeNb; in HUF_buildCTable_wksp()
366 nodeNb++; lowS-=2; in HUF_buildCTable_wksp()
367 for (n=nodeNb; n<=nodeRoot; n++) huffNode[n].count = (U32)(1U<<30); in HUF_buildCTable_wksp()
371 while (nodeNb <= nodeRoot) { in HUF_buildCTable_wksp()
374 huffNode[nodeNb].count = huffNode[n1].count + huffNode[n2].count; in HUF_buildCTable_wksp()
375 huffNode[n1].parent = huffNode[n2].parent = (U16)nodeNb; in HUF_buildCTable_wksp()
376 nodeNb++; in HUF_buildCTable_wksp()
/freebsd/sys/contrib/zstd/lib/compress/
H A Dhuf_compress.c615 int nodeNb = STARTNODE; in HUF_buildTree() local
620 lowS = nonNullRank; nodeRoot = nodeNb + lowS - 1; lowN = nodeNb; in HUF_buildTree()
621 huffNode[nodeNb].count = huffNode[lowS].count + huffNode[lowS-1].count; in HUF_buildTree()
622 huffNode[lowS].parent = huffNode[lowS-1].parent = (U16)nodeNb; in HUF_buildTree()
623 nodeNb++; lowS-=2; in HUF_buildTree()
624 for (n=nodeNb; n<=nodeRoot; n++) huffNode[n].count = (U32)(1U<<30); in HUF_buildTree()
628 while (nodeNb <= nodeRoot) { in HUF_buildTree()
631 huffNode[nodeNb].count = huffNode[n1].count + huffNode[n2].count; in HUF_buildTree()
632 huffNode[n1].parent = huffNode[n2].parent = (U16)nodeNb; in HUF_buildTree()
633 nodeNb++; in HUF_buildTree()