MAX_RT_PRIO
struct sched_param wti_sched_param = { .sched_priority = MAX_RT_PRIO - 1 };
#define MAX_PRIO (MAX_RT_PRIO + NICE_WIDTH)
#define DEFAULT_PRIO (MAX_RT_PRIO + NICE_WIDTH / 2)
return unlikely(prio < MAX_RT_PRIO && prio >= MAX_DL_PRIO);
return unlikely(prio < MAX_RT_PRIO);
prio = min(current->normal_prio, MAX_RT_PRIO);
return PRIO_TO_NICE(prio - 1 + MAX_RT_PRIO);
idx = NICE_TO_PRIO(nice) - MAX_RT_PRIO;
int prio = p->static_prio - MAX_RT_PRIO;
return MAX_RT_PRIO + NICE_WIDTH; /* 140 */
return MAX_RT_PRIO + MAX_NICE + 1; /* 120, squash ext */
return MAX_RT_PRIO + MAX_NICE; /* 119, squash fair */
if (pa == MAX_RT_PRIO + MAX_NICE) /* fair */
if (pa == MAX_RT_PRIO + MAX_NICE + 1) /* ext */
struct sched_param param = { .sched_priority = MAX_RT_PRIO - 1 };
cpupri = MAX_RT_PRIO-1 - prio; /* 1 ... 99 */
case MAX_RT_PRIO-1:
case MAX_RT_PRIO:
#define CPUPRI_NR_PRIORITIES (MAX_RT_PRIO+1)
weight = sched_prio_to_weight[p->static_prio - MAX_RT_PRIO];
rt_rq->highest_prio.curr = MAX_RT_PRIO-1;
BUG_ON(idx >= MAX_RT_PRIO);
rt_rq->highest_prio.curr = MAX_RT_PRIO-1;
rq->rt.highest_prio.next = MAX_RT_PRIO-1;
for (i = 0; i < MAX_RT_PRIO; i++) {
__set_bit(MAX_RT_PRIO, array->bitmap);
rt_rq->highest_prio.curr = MAX_RT_PRIO-1;
rt_rq->highest_prio.next = MAX_RT_PRIO-1;
DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */
struct list_head queue[MAX_RT_PRIO];
ret = MAX_RT_PRIO-1;
return p->prio - MAX_RT_PRIO;
prio = MAX_RT_PRIO - 1 - rt_prio;
if (attr->sched_priority > MAX_RT_PRIO-1)
struct sched_param sp = { .sched_priority = MAX_RT_PRIO / 2 };
struct sched_param sp = { .sched_priority = MAX_RT_PRIO / 2 - 1 };
max_data->nice = tsk->static_prio - 20 - MAX_RT_PRIO;