Home
last modified time | relevance | path

Searched refs:highest_prio (Results 1 – 4 of 4) sorted by relevance

/linux/net/sched/
A Dsch_skbprio.c36 u16 highest_prio; member
88 if (prio > q->highest_prio) in skbprio_enqueue()
89 q->highest_prio = prio; in skbprio_enqueue()
123 if (q->lowest_prio == q->highest_prio) { in skbprio_enqueue()
127 q->highest_prio = prio; in skbprio_enqueue()
133 if (prio > q->highest_prio) in skbprio_enqueue()
134 q->highest_prio = prio; in skbprio_enqueue()
156 if (q->lowest_prio == q->highest_prio) { in skbprio_dequeue()
158 q->highest_prio = 0; in skbprio_dequeue()
190 q->highest_prio = 0; in skbprio_init()
[all …]
/linux/kernel/sched/
A Drt.c92 rt_rq->highest_prio.curr = MAX_RT_PRIO-1; in init_rt_rq()
93 rt_rq->highest_prio.next = MAX_RT_PRIO-1; in init_rt_rq()
168 rt_rq->highest_prio.curr = MAX_RT_PRIO-1; in init_tg_rt_entry()
389 if (p->prio < rq->rt.highest_prio.next) in enqueue_pushable_task()
390 rq->rt.highest_prio.next = p->prio; in enqueue_pushable_task()
401 rq->rt.highest_prio.next = p->prio; in dequeue_pushable_task()
950 return rt_rq->highest_prio.curr; in rt_se_prio()
1134 rt_rq->highest_prio.curr = prio; in inc_rt_prio()
1155 rt_rq->highest_prio.curr = in dec_rt_prio()
2332 if (src_rq->rt.highest_prio.next >= in pull_rt_task()
[all …]
A Dsched.h651 } highest_prio; member
A Ddeadline.c1423 cpupri_set(&rq->rd->cpupri, rq->cpu, rq->rt.highest_prio.curr); in dec_dl_deadline()

Completed in 27 milliseconds