Searched refs:nbPerRank (Results 1 – 2 of 2) sorted by relevance
254 { U16 nbPerRank[HUF_TABLELOG_MAX+2] = {0}; /* support w=0=>n=tableLog+1 */ in HUF_readCTable() local256 { U32 n; for (n=0; n<nbSymbols; n++) nbPerRank[HUF_getNbBits(ct[n])]++; } in HUF_readCTable()262 min += nbPerRank[n]; in HUF_readCTable()661 U16 nbPerRank[HUF_TABLELOG_MAX+1] = {0}; in HUF_buildCTableFromTree() local665 nbPerRank[huffNode[n].nbBits]++; in HUF_buildCTableFromTree()670 min += nbPerRank[n]; in HUF_buildCTableFromTree()
328 { U16 nbPerRank[HUF_TABLELOG_MAX+2] = {0}; /* support w=0=>n=tableLog+1 */ in HUF_readCTable() local330 { U32 n; for (n=0; n<nbSymbols; n++) nbPerRank[HUF_getNbBits(ct[n])]++; } in HUF_readCTable()336 min += nbPerRank[n]; in HUF_readCTable()736 U16 nbPerRank[HUF_TABLELOG_MAX+1] = {0}; in HUF_buildCTableFromTree() local740 nbPerRank[huffNode[n].nbBits]++; in HUF_buildCTableFromTree()745 min += nbPerRank[n]; in HUF_buildCTableFromTree()