Searched refs:MAX_RT_PRIO (Results 1 – 9 of 9) sorted by relevance
23 #define MAX_RT_PRIO MAX_USER_RT_PRIO macro25 #define MAX_PRIO (MAX_RT_PRIO + NICE_WIDTH)26 #define DEFAULT_PRIO (MAX_RT_PRIO + NICE_WIDTH / 2)41 #define USER_PRIO(p) ((p)-MAX_RT_PRIO)
11 if (unlikely(prio < MAX_RT_PRIO)) in rt_prio()
36 else if (prio >= MAX_RT_PRIO) in convert_prio()39 cpupri = MAX_RT_PRIO - prio + 1; in convert_prio()
3 #define CPUPRI_NR_PRIORITIES (MAX_RT_PRIO + 2)
84 for (i = 0; i < MAX_RT_PRIO; i++) { in init_rt_rq()89 __set_bit(MAX_RT_PRIO, array->bitmap); in init_rt_rq()92 rt_rq->highest_prio.curr = MAX_RT_PRIO; in init_rt_rq()93 rt_rq->highest_prio.next = MAX_RT_PRIO; in init_rt_rq()164 rt_rq->highest_prio.curr = MAX_RT_PRIO; in init_tg_rt_entry()397 rq->rt.highest_prio.next = MAX_RT_PRIO; in dequeue_pushable_task()1151 rt_rq->highest_prio.curr = MAX_RT_PRIO; in dec_rt_prio()1605 BUG_ON(idx >= MAX_RT_PRIO); in pick_next_rt_entity()
850 int prio = p->static_prio - MAX_RT_PRIO; in set_load_weight()1625 prio = MAX_RT_PRIO-1 - p->rt_priority; in normal_prio()2378 struct sched_param param = { .sched_priority = MAX_RT_PRIO - 1 }; in sched_set_stop_task()5071 return p->prio - MAX_RT_PRIO; in task_prio()5218 MAX_RT_PRIO - 1 - attr->sched_priority; in __sched_setscheduler()5250 (!p->mm && attr->sched_priority > MAX_RT_PRIO-1)) in __sched_setscheduler()5565 struct sched_param sp = { .sched_priority = MAX_RT_PRIO / 2 }; in sched_set_fifo()8306 return PRIO_TO_NICE(prio - 1 + MAX_RT_PRIO); in cpu_weight_nice_read_s64()8318 idx = NICE_TO_PRIO(nice) - MAX_RT_PRIO; in cpu_weight_nice_write_s64()
245 DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */246 struct list_head queue[MAX_RT_PRIO];
2231 prio = min(current->normal_prio, MAX_RT_PRIO); in __queue_me()
1775 max_data->nice = tsk->static_prio - 20 - MAX_RT_PRIO; in __update_max_tr()
