Home
last modified time | relevance | path

Searched refs:minWeight (Results 1 - 2 of 2) sorted by relevance

/kernel/linux/linux-5.10/lib/zstd/
H A Dhuf_decompress.c394 static void HUF_fillDTableX4Level2(HUF_DEltX4 *DTable, U32 sizeLog, const U32 consumed, const U32 *rankValOrigin, const int minWeight, in HUF_fillDTableX4Level2() argument
404 if (minWeight > 1) { in HUF_fillDTableX4Level2()
405 U32 i, skipSize = rankVal[minWeight]; in HUF_fillDTableX4Level2()
460 int minWeight = nbBits + scaleLog; in HUF_fillDTableX4() local
461 if (minWeight < 1) in HUF_fillDTableX4()
462 minWeight = 1; in HUF_fillDTableX4()
463 sortedRank = rankStart[minWeight]; in HUF_fillDTableX4()
464 HUF_fillDTableX4Level2(DTable + start, targetLog - nbBits, nbBits, rankValOrigin[nbBits], minWeight, sortedList + sortedRank, in HUF_fillDTableX4()
/kernel/linux/linux-6.6/lib/zstd/decompress/
H A Dhuf_decompress.c932 const U32* rankVal, const int minWeight, const int maxWeight1, in HUF_fillDTableX2Level2()
936 /* Fill skipped values (all positions up to rankVal[minWeight]). in HUF_fillDTableX2Level2()
940 if (minWeight>1) { in HUF_fillDTableX2Level2()
943 int const skipSize = rankVal[minWeight]; in HUF_fillDTableX2Level2()
972 for (w = minWeight; w < maxWeight1; ++w) { in HUF_fillDTableX2Level2()
1007 int minWeight = nbBits + scaleLog; in HUF_fillDTableX2() local
1009 if (minWeight < 1) minWeight = 1; in HUF_fillDTableX2()
1016 rankValOrigin[nbBits], minWeight, wEnd, in HUF_fillDTableX2()
931 HUF_fillDTableX2Level2(HUF_DEltX2* DTable, U32 targetLog, const U32 consumedBits, const U32* rankVal, const int minWeight, const int maxWeight1, const sortedSymbol_t* sortedSymbols, U32 const* rankStart, U32 nbBitsBaseline, U16 baseSeq) HUF_fillDTableX2Level2() argument

Completed in 6 milliseconds