sys/kern/kern_runq.c

1208

i = (PRI_COUNT >> BITMAP_SHIFT) - 1;

sys/kern/kern_runq.c

159

size = roundup2(sizeof(spc->spc_queue[0]) * PRI_COUNT, coherency_unit) +

sys/kern/kern_runq.c

166

for (i = 0; i < PRI_COUNT; i++)

sys/kern/kern_runq.c

177

KASSERT(prio < PRI_COUNT);

sys/kern/kern_runq.c

509

bestpri = PRI_COUNT;

sys/kern/kern_threadpool.c

376

return (pri == PRI_NONE || (pri >= PRI_USER && pri < PRI_COUNT));

sys/kern/sched_m2.c

128

for (p = (PRI_HIGHEST_TS + 1); p < PRI_COUNT; p++) {

sys/kern/sched_m2.c

62

#define PRI_RT_COUNT (PRI_COUNT - PRI_TS_COUNT)

sys/kern/sched_m2.c

72

static u_int ts_map[PRI_COUNT]; /* Map of time-slices */

sys/kern/sched_m2.c

73

static pri_t high_pri[PRI_COUNT]; /* Map for priority increase */

tests/kernel/threadpool_tester/threadpool_tester.c

449

for (pri = PRI_NONE/*-1*/; pri < PRI_COUNT; pri++) {

tests/kernel/threadpool_tester/threadpool_tester.c

52

struct threadpool *ctx_unbound[PRI_COUNT + 1];

tests/kernel/threadpool_tester/threadpool_tester.c

53

struct threadpool_percpu *ctx_percpu[PRI_COUNT + 1];

tests/kernel/threadpool_tester/threadpool_tester.c

58

#define pri_to_idx(pri) ((pri) == PRI_NONE ? PRI_COUNT : (pri))

tests/kernel/threadpool_tester/threadpool_tester.c

63

return (pri == PRI_NONE || (pri >= PRI_USER && pri < PRI_COUNT));

tests/modules/threadpool_tester/threadpool_tester.c

449

for (pri = PRI_NONE/*-1*/; pri < PRI_COUNT; pri++) {

tests/modules/threadpool_tester/threadpool_tester.c

52

struct threadpool *ctx_unbound[PRI_COUNT + 1];

tests/modules/threadpool_tester/threadpool_tester.c

53

struct threadpool_percpu *ctx_percpu[PRI_COUNT + 1];

tests/modules/threadpool_tester/threadpool_tester.c

58

#define pri_to_idx(pri) ((pri) == PRI_NONE ? PRI_COUNT : (pri))

tests/modules/threadpool_tester/threadpool_tester.c

63

return (pri == PRI_NONE || (pri >= PRI_USER && pri < PRI_COUNT));