Home
last modified time | relevance | path

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

/external/zstd/lib/legacy/
Dzstd_v02.c2582 U32 Dtime[3]; in HUF_decompress() local
2595 Dtime[n] = algoTime[Q][n].tableTime + (algoTime[Q][n].decode256Time * D256); in HUF_decompress()
2597 …Dtime[1] += Dtime[1] >> 4; Dtime[2] += Dtime[2] >> 3; /* advantage to algorithms using less memory… in HUF_decompress()
2599 if (Dtime[1] < Dtime[0]) algoNb = 1; in HUF_decompress()
2600 if (Dtime[2] < Dtime[algoNb]) algoNb = 2; in HUF_decompress()
Dzstd_v03.c2222 U32 Dtime[3]; in HUF_decompress() local
2235 Dtime[n] = algoTime[Q][n].tableTime + (algoTime[Q][n].decode256Time * D256); in HUF_decompress()
2237 …Dtime[1] += Dtime[1] >> 4; Dtime[2] += Dtime[2] >> 3; /* advantage to algorithms using less memory… in HUF_decompress()
2239 if (Dtime[1] < Dtime[0]) algoNb = 1; in HUF_decompress()
Dzstd_v04.c2369 U32 Dtime[3]; in HUF_decompress() local
2382 Dtime[n] = algoTime[Q][n].tableTime + (algoTime[Q][n].decode256Time * D256); in HUF_decompress()
2384 …Dtime[1] += Dtime[1] >> 4; Dtime[2] += Dtime[2] >> 3; /* advantage to algorithms using less memory… in HUF_decompress()
2386 if (Dtime[1] < Dtime[0]) algoNb = 1; in HUF_decompress()
Dzstd_v05.c2522 U32 Dtime[3]; in HUFv05_decompress() local
2534 Dtime[n] = algoTime[Q][n].tableTime + (algoTime[Q][n].decode256Time * D256); in HUFv05_decompress()
2536 …Dtime[1] += Dtime[1] >> 4; Dtime[2] += Dtime[2] >> 3; /* advantage to algorithms using less memory… in HUFv05_decompress()
2538 if (Dtime[1] < Dtime[0]) algoNb = 1; in HUFv05_decompress()
Dzstd_v06.c2648 U32 Dtime[3]; /* decompression time estimation */ in HUFv06_decompress() local
2660 Dtime[n] = algoTime[Q][n].tableTime + (algoTime[Q][n].decode256Time * D256); in HUFv06_decompress()
2663 …Dtime[1] += Dtime[1] >> 4; Dtime[2] += Dtime[2] >> 3; /* advantage to algorithms using less memory… in HUFv06_decompress()
2666 if (Dtime[1] < Dtime[0]) algoNb = 1; in HUFv06_decompress()