Home
last modified time | relevance | path

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

/freebsd-13.1/sys/contrib/zstd/lib/compress/
H A Dhuf_compress.c361 rankPos rankPosition[RANK_POSITION_TABLE_SIZE]; member
374 … void HUF_sort(nodeElt* huffNode, const unsigned* count, U32 maxSymbolValue, rankPos* rankPosition) in HUF_sort() argument
385 ZSTD_memset(rankPosition, 0, sizeof(*rankPosition) * RANK_POSITION_TABLE_SIZE); in HUF_sort()
388 rankPosition[lowerRank].base++; in HUF_sort()
390 assert(rankPosition[RANK_POSITION_TABLE_SIZE - 1].base == 0); in HUF_sort()
392 rankPosition[n-1].base += rankPosition[n].base; in HUF_sort()
393 rankPosition[n-1].curr = rankPosition[n-1].base; in HUF_sort()
399 U32 pos = rankPosition[r].curr++; in HUF_sort()
403 while ((pos > rankPosition[r].base) && (c > huffNode[pos-1].count)) { in HUF_sort()
511 HUF_sort(huffNode, count, maxSymbolValue, wksp_tables->rankPosition); in HUF_buildCTable_wksp()
/freebsd-13.1/sys/contrib/openzfs/module/zstd/lib/
H A Dzstd.c8666 rankPos rankPosition[RANK_POSITION_TABLE_SIZE]; member
8669 … void HUF_sort(nodeElt* huffNode, const unsigned* count, U32 maxSymbolValue, rankPos* rankPosition) in HUF_sort() argument
8673 memset(rankPosition, 0, sizeof(*rankPosition) * RANK_POSITION_TABLE_SIZE); in HUF_sort()
8676 rankPosition[r].base ++; in HUF_sort()
8678 for (n=30; n>0; n--) rankPosition[n-1].base += rankPosition[n].base; in HUF_sort()
8679 for (n=0; n<32; n++) rankPosition[n].current = rankPosition[n].base; in HUF_sort()
8683 U32 pos = rankPosition[r].current++; in HUF_sort()
8684 while ((pos > rankPosition[r].base) && (c > huffNode[pos-1].count)) { in HUF_sort()
8720 HUF_sort(huffNode, count, maxSymbolValue, wksp_tables->rankPosition); in HUF_buildCTable_wksp()