Home
last modified time | relevance | path

Searched refs:totalCost (Results 1 – 3 of 3) sorted by relevance

/external/zstd/lib/compress/
Dhuf_compress.c235 { int totalCost = 0; in HUF_setMaxHeight() local
244 totalCost += baseCost - (1 << (largestBits - huffNode[n].nbBits)); in HUF_setMaxHeight()
255 assert((totalCost & (baseCost - 1)) == 0); in HUF_setMaxHeight()
256 totalCost >>= (largestBits - maxNbBits); in HUF_setMaxHeight()
257 assert(totalCost > 0); in HUF_setMaxHeight()
273 while (totalCost > 0) { in HUF_setMaxHeight()
277 U32 nBitsToDecrease = BIT_highbit32((U32)totalCost) + 1; in HUF_setMaxHeight()
297 totalCost -= 1 << (nBitsToDecrease-1); in HUF_setMaxHeight()
328 while (totalCost < 0) { /* Sometimes, cost correction overshoot */ in HUF_setMaxHeight()
337 totalCost++; in HUF_setMaxHeight()
[all …]
/external/eigen/unsupported/Eigen/CXX11/src/Tensor/
DTensorCostModel.h176 double cost = totalCost(output_size, cost_per_coeff); in numThreads()
186 return totalCost(output_size, cost_per_coeff) / kTaskSize; in taskSize()
190 static EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double totalCost( in totalCost() function
/external/lz4/lib/
Dlz4hc.c476 static U32 totalCost = 0; in LZ4HC_encodeSequence() local
487 cost, totalCost); in LZ4HC_encodeSequence()
488 totalCost += cost; in LZ4HC_encodeSequence()