Home
last modified time | relevance | path

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

/freebsd/lib/libc/stdlib/
H A Dtsearch_path.h45 unsigned int nsteps; member
53 p->nsteps = 0; in path_init()
63 p->steps[p->nsteps / STEPS_BIT] |= in path_taking_left()
64 (uintptr_t)1 << (p->nsteps % STEPS_BIT); in path_taking_left()
65 ++p->nsteps; in path_taking_left()
73 p->steps[p->nsteps / STEPS_BIT] &= in path_taking_right()
74 ~((uintptr_t)1 << (p->nsteps % STEPS_BIT)); in path_taking_right()
75 ++p->nsteps; in path_taking_right()
/freebsd/contrib/processor-trace/libipt/internal/include/
H A Dpt_insn.h210 size_t nsteps);
/freebsd/cddl/contrib/opensolaris/lib/libdtrace/common/
H A Ddt_consume.c74 #define llquantize_nsteps u.llquantize.nsteps
83 uint16_t nsteps; member
1165 uint16_t factor, low, high, nsteps; in dt_format_llquantize_prepare() local
1181 nsteps = DTRACE_LLQUANTIZE_NSTEP(arg); in dt_format_llquantize_prepare()
1188 nsteps == 0 || factor > nsteps) { in dt_format_llquantize_prepare()
1219 step = next > nsteps ? next / nsteps : 1; in dt_format_llquantize_prepare()
1226 args->llquantize_nsteps = nsteps; in dt_format_llquantize_prepare()
1241 uint16_t factor, low, high, nsteps; in dt_format_llquantize() local
1258 nsteps = args.llquantize_nsteps; in dt_format_llquantize()
1292 step = next > nsteps ? next / nsteps : 1; in dt_format_llquantize()
[all …]
H A Ddt_aggregate.c232 uint16_t nsteps = DTRACE_LLQUANTIZE_NSTEP(arg); in dt_aggregate_llquantizedsum() local
237 assert(nsteps >= factor); in dt_aggregate_llquantizedsum()
238 assert(nsteps % factor == 0); in dt_aggregate_llquantizedsum()
246 step = next > nsteps ? next / nsteps : 1; in dt_aggregate_llquantizedsum()
256 step = next > nsteps ? next / nsteps : 1; in dt_aggregate_llquantizedsum()
/freebsd/sys/cddl/contrib/opensolaris/uts/common/dtrace/
H A Ddtrace.c2418 uint16_t high, uint16_t nsteps, int64_t value) in dtrace_aggregate_llquantize_bucket() argument
2423 ASSERT(factor <= nsteps); in dtrace_aggregate_llquantize_bucket()
2424 ASSERT(nsteps % factor == 0); in dtrace_aggregate_llquantize_bucket()
2437 int nbuckets = this > nsteps ? nsteps : this; in dtrace_aggregate_llquantize_bucket()
2479 uint16_t nsteps = DTRACE_LLQUANTIZE_NSTEP(arg); in dtrace_aggregate_llquantize() local
2482 low, high, nsteps, nval)] += incr; in dtrace_aggregate_llquantize()
11350 uint16_t nsteps = DTRACE_LLQUANTIZE_NSTEP(desc->dtad_arg); local
11356 if (factor < 2 || low >= high || nsteps < factor)
11364 for (v = factor; v < nsteps; v *= factor)
11367 if ((v % nsteps) || (nsteps % factor))
[all …]