HomeSort by: relevance | last modified time | path
    Searched refs:Dtime (Results 1 - 5 of 5) sorted by relevancy

  /src/external/bsd/zstd/dist/lib/legacy/
zstd_v03.c 2160 U32 Dtime[3];
2173 Dtime[n] = algoTime[Q][n].tableTime + (algoTime[Q][n].decode256Time * D256);
2175 Dtime[1] += Dtime[1] >> 4; Dtime[2] += Dtime[2] >> 3; /* advantage to algorithms using less memory, for cache eviction */
2177 if (Dtime[1] < Dtime[0]) algoNb = 1;
zstd_v02.c 2521 U32 Dtime[3];
2534 Dtime[n] = algoTime[Q][n].tableTime + (algoTime[Q][n].decode256Time * D256);
2536 Dtime[1] += Dtime[1] >> 4; Dtime[2] += Dtime[2] >> 3; /* advantage to algorithms using less memory, for cache eviction */
2538 if (Dtime[1] < Dtime[0]) algoNb = 1;
2539 if (Dtime[2] < Dtime[algoNb]) algoNb = 2
    [all...]
zstd_v04.c 2313 U32 Dtime[3];
2326 Dtime[n] = algoTime[Q][n].tableTime + (algoTime[Q][n].decode256Time * D256);
2328 Dtime[1] += Dtime[1] >> 4; Dtime[2] += Dtime[2] >> 3; /* advantage to algorithms using less memory, for cache eviction */
2330 if (Dtime[1] < Dtime[0]) algoNb = 1;
zstd_v05.c 2470 U32 Dtime[3];
2482 Dtime[n] = algoTime[Q][n].tableTime + (algoTime[Q][n].decode256Time * D256);
2484 Dtime[1] += Dtime[1] >> 4; Dtime[2] += Dtime[2] >> 3; /* advantage to algorithms using less memory, for cache eviction */
2486 if (Dtime[1] < Dtime[0]) algoNb = 1;
zstd_v06.c 2592 U32 Dtime[3]; /* decompression time estimation */
2604 Dtime[n] = algoTime[Q][n].tableTime + (algoTime[Q][n].decode256Time * D256);
2607 Dtime[1] += Dtime[1] >> 4; Dtime[2] += Dtime[2] >> 3; /* advantage to algorithms using less memory, for cache eviction */
2610 if (Dtime[1] < Dtime[0]) algoNb = 1;
2611 /* if (Dtime[2] < Dtime[algoNb]) algoNb = 2; */ /* current speed of HUFv06_decompress4X6 is not good *
    [all...]

Completed in 72 milliseconds