Searched refs:nsteps (Results 1 – 5 of 5) sorted by relevance
47 unsigned int nsteps; member55 p->nsteps = 0; in path_init()65 p->steps[p->nsteps / STEPS_BIT] |= in path_taking_left()66 (uintptr_t)1 << (p->nsteps % STEPS_BIT); in path_taking_left()67 ++p->nsteps; in path_taking_left()75 p->steps[p->nsteps / STEPS_BIT] &= in path_taking_right()76 ~((uintptr_t)1 << (p->nsteps % STEPS_BIT)); in path_taking_right()77 ++p->nsteps; in path_taking_right()
210 size_t nsteps);
231 uint16_t nsteps = DTRACE_LLQUANTIZE_NSTEP(arg); in dt_aggregate_llquantizedsum() local236 assert(nsteps >= factor); in dt_aggregate_llquantizedsum()237 assert(nsteps % factor == 0); in dt_aggregate_llquantizedsum()245 step = next > nsteps ? next / nsteps : 1; in dt_aggregate_llquantizedsum()255 step = next > nsteps ? next / nsteps : 1; in dt_aggregate_llquantizedsum()
998 uint16_t factor, low, high, nsteps; in dt_print_llquantize() local1015 nsteps = DTRACE_LLQUANTIZE_NSTEP(arg); in dt_print_llquantize()1022 nsteps == 0 || factor > nsteps) in dt_print_llquantize()1061 step = next > nsteps ? next / nsteps : 1; in dt_print_llquantize()1091 step = next > nsteps ? next / nsteps : 1; in dt_print_llquantize()
2402 uint16_t high, uint16_t nsteps, int64_t value) in dtrace_aggregate_llquantize_bucket() argument2407 ASSERT(factor <= nsteps); in dtrace_aggregate_llquantize_bucket()2408 ASSERT(nsteps % factor == 0); in dtrace_aggregate_llquantize_bucket()2421 int nbuckets = this > nsteps ? nsteps : this; in dtrace_aggregate_llquantize_bucket()2463 uint16_t nsteps = DTRACE_LLQUANTIZE_NSTEP(arg); in dtrace_aggregate_llquantize() local2466 low, high, nsteps, nval)] += incr; in dtrace_aggregate_llquantize()11314 uint16_t nsteps = DTRACE_LLQUANTIZE_NSTEP(desc->dtad_arg); local11320 if (factor < 2 || low >= high || nsteps < factor)11328 for (v = factor; v < nsteps; v *= factor)11331 if ((v % nsteps) || (nsteps % factor))[all …]