Home
last modified time | relevance | path

Searched refs:Dtime (Results 1 – 5 of 5) sorted by relevance

/external/zstd/lib/legacy/
Dzstd_v02.c2586 U32 Dtime[3]; in HUF_decompress() local
2599 Dtime[n] = algoTime[Q][n].tableTime + (algoTime[Q][n].decode256Time * D256); in HUF_decompress()
2601 …Dtime[1] += Dtime[1] >> 4; Dtime[2] += Dtime[2] >> 3; /* advantage to algorithms using less memory… in HUF_decompress()
2603 if (Dtime[1] < Dtime[0]) algoNb = 1; in HUF_decompress()
2604 if (Dtime[2] < Dtime[algoNb]) algoNb = 2; in HUF_decompress()
Dzstd_v03.c2226 U32 Dtime[3]; in HUF_decompress() local
2239 Dtime[n] = algoTime[Q][n].tableTime + (algoTime[Q][n].decode256Time * D256); in HUF_decompress()
2241 …Dtime[1] += Dtime[1] >> 4; Dtime[2] += Dtime[2] >> 3; /* advantage to algorithms using less memory… in HUF_decompress()
2243 if (Dtime[1] < Dtime[0]) algoNb = 1; in HUF_decompress()
Dzstd_v04.c2373 U32 Dtime[3]; in HUF_decompress() local
2386 Dtime[n] = algoTime[Q][n].tableTime + (algoTime[Q][n].decode256Time * D256); in HUF_decompress()
2388 …Dtime[1] += Dtime[1] >> 4; Dtime[2] += Dtime[2] >> 3; /* advantage to algorithms using less memory… in HUF_decompress()
2390 if (Dtime[1] < Dtime[0]) algoNb = 1; in HUF_decompress()
Dzstd_v05.c2526 U32 Dtime[3]; in HUFv05_decompress() local
2538 Dtime[n] = algoTime[Q][n].tableTime + (algoTime[Q][n].decode256Time * D256); in HUFv05_decompress()
2540 …Dtime[1] += Dtime[1] >> 4; Dtime[2] += Dtime[2] >> 3; /* advantage to algorithms using less memory… in HUFv05_decompress()
2542 if (Dtime[1] < Dtime[0]) algoNb = 1; in HUFv05_decompress()
Dzstd_v06.c2652 U32 Dtime[3]; /* decompression time estimation */ in HUFv06_decompress() local
2664 Dtime[n] = algoTime[Q][n].tableTime + (algoTime[Q][n].decode256Time * D256); in HUFv06_decompress()
2667 …Dtime[1] += Dtime[1] >> 4; Dtime[2] += Dtime[2] >> 3; /* advantage to algorithms using less memory… in HUFv06_decompress()
2670 if (Dtime[1] < Dtime[0]) algoNb = 1; in HUFv06_decompress()