Searched refs:nbLoops (Results 1 – 3 of 3) sorted by relevance
109 unsigned nbLoops) in BMK_benchFunction() argument112 nbLoops += !nbLoops; /* minimum nbLoops is 1 */ in BMK_benchFunction()124 for (loopNb = 0; loopNb < nbLoops; loopNb++) { in BMK_benchFunction()142 rt.nanoSecPerRun = (double)totalTime / nbLoops; in BMK_benchFunction()156 unsigned nbLoops; member194 timedFnState->nbLoops = 1; in BMK_resetTimedFnState()220 BMK_runOutcome_t const runResult = BMK_benchFunction(p, cont->nbLoops); in BMK_benchTimedFn()227 double const loopDuration_ns = newRunTime.nanoSecPerRun * cont->nbLoops; in BMK_benchTimedFn()234 cont->nbLoops = (unsigned)(runBudget_ns / fastestRun_ns) + 1; in BMK_benchTimedFn()238 assert(cont->nbLoops < ((unsigned)-1) / multiplier); /* avoid overflow */ in BMK_benchTimedFn()[all …]
110 BMK_runOutcome_t BMK_benchFunction(BMK_benchParams_t params, unsigned nbLoops);
118 g_nbIterations = nbLoops; in BMK_SetNbIterations()234 U32 nbLoops = 0; in BMK_benchMem() local258 nbLoops++; in BMK_benchMem()287 nbLoops++; in BMK_benchMem()328 nbLoops++; in BMK_benchMem()361 nbLoops++; in BMK_benchMem()365 if (clockSpan < fastestC*nbLoops) fastestC = clockSpan / nbLoops; in BMK_benchMem()388 U32 nbLoops = 0; in BMK_benchMem() local407 nbLoops++; in BMK_benchMem()433 nbLoops++; in BMK_benchMem()[all …]