Searched refs:valPerRank (Results 1 – 2 of 2) sorted by relevance
175 U16 valPerRank[HUF_TABLELOG_MAX+2] = {0}; in HUF_readCTable() local178 valPerRank[tableLog+1] = 0; /* for w==0 */ in HUF_readCTable()181 valPerRank[n] = min; /* get starting value within each rank */ in HUF_readCTable()186 { U32 n; for (n=0; n<nbSymbols; n++) CTable[n].val = valPerRank[CTable[n].nbBits]++; } in HUF_readCTable()477 U16 valPerRank[HUF_TABLELOG_MAX+1] = {0}; in HUF_buildCTableFromTree() local484 valPerRank[n] = min; /* get starting value within each rank */ in HUF_buildCTableFromTree()491 … CTable[n].val = valPerRank[CTable[n].nbBits]++; /* assign value within rank, symbol order */ in HUF_buildCTableFromTree()
8546 U16 valPerRank[HUF_TABLELOG_MAX+2] = {0}; in HUF_readCTable() local8549 valPerRank[tableLog+1] = 0; /* for w==0 */ in HUF_readCTable()8552 valPerRank[n] = min; /* get starting value within each rank */ in HUF_readCTable()8557 { U32 n; for (n=0; n<nbSymbols; n++) CTable[n].val = valPerRank[CTable[n].nbBits]++; } in HUF_readCTable()8755 U16 valPerRank[HUF_TABLELOG_MAX+1] = {0}; in HUF_buildCTable_wksp() local8763 valPerRank[n] = min; /* get starting value within each rank */ in HUF_buildCTable_wksp()8770 … tree[n].val = valPerRank[tree[n].nbBits]++; /* assign value within rank, symbol order */ in HUF_buildCTable_wksp()