Searched refs:PRI_COUNT (Results 1 – 6 of 6) sorted by relevance
52 struct threadpool *ctx_unbound[PRI_COUNT + 1];53 struct threadpool_percpu *ctx_percpu[PRI_COUNT + 1];58 #define pri_to_idx(pri) ((pri) == PRI_NONE ? PRI_COUNT : (pri))63 return (pri == PRI_NONE || (pri >= PRI_USER && pri < PRI_COUNT)); in pri_is_valid()449 for (pri = PRI_NONE/*-1*/; pri < PRI_COUNT; pri++) { in threadpool_tester_fini()
61 #define PRI_RT_COUNT (PRI_COUNT - PRI_TS_COUNT)71 static u_int ts_map[PRI_COUNT]; /* Map of time-slices */72 static pri_t high_pri[PRI_COUNT]; /* Map for priority increase */119 for (p = (PRI_HIGHEST_TS + 1); p < PRI_COUNT; p++) { in sched_precalcts()
159 size = roundup2(sizeof(spc->spc_queue[0]) * PRI_COUNT, coherency_unit) + in sched_cpuattach()166 for (i = 0; i < PRI_COUNT; i++) in sched_cpuattach()177 KASSERT(prio < PRI_COUNT); in sched_getrq()509 bestpri = PRI_COUNT; in sched_bestcpu()1219 i = (PRI_COUNT >> BITMAP_SHIFT) - 1; in sched_print_runqueue()
376 return (pri == PRI_NONE || (pri >= PRI_USER && pri < PRI_COUNT)); in threadpool_pri_is_valid()
332 #define PRI_COUNT 224 macro