HomeSort by: relevance | last modified time | path
    Searched refs:PRI_COUNT (Results 1 - 6 of 6) sorted by relevancy

  /src/sys/kern/
sched_m2.c 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 */
127 for (p = (PRI_HIGHEST_TS + 1); p < PRI_COUNT; p++) {
kern_runq.c 159 size = roundup2(sizeof(spc->spc_queue[0]) * PRI_COUNT, coherency_unit) +
166 for (i = 0; i < PRI_COUNT; i++)
177 KASSERT(prio < PRI_COUNT);
509 bestpri = PRI_COUNT;
1208 i = (PRI_COUNT >> BITMAP_SHIFT) - 1;
kern_threadpool.c 376 return (pri == PRI_NONE || (pri >= PRI_USER && pri < PRI_COUNT));
  /src/tests/kernel/threadpool_tester/
threadpool_tester.c 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));
449 for (pri = PRI_NONE/*-1*/; pri < PRI_COUNT; pri++) {
  /src/tests/modules/threadpool_tester/
threadpool_tester.c 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));
449 for (pri = PRI_NONE/*-1*/; pri < PRI_COUNT; pri++) {
  /src/sys/sys/
param.h 332 #define PRI_COUNT 224

Completed in 16 milliseconds