Home
last modified time | relevance | path

Searched refs:highest_prio (Results 1 - 7 of 7) sorted by relevance

/kernel/linux/linux-5.10/net/sched/
H A Dsch_skbprio.c36 u16 highest_prio; member
44 for (prio = q->highest_prio - 1; prio >= q->lowest_prio; prio--) { in calc_new_high_prio()
57 for (prio = q->lowest_prio + 1; prio <= q->highest_prio; prio++) { in calc_new_low_prio()
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()
142 struct sk_buff_head *hpq = &q->qdiscs[q->highest_prio]; in skbprio_dequeue()
[all...]
/kernel/linux/linux-6.6/net/sched/
H A Dsch_skbprio.c36 u16 highest_prio; member
44 for (prio = q->highest_prio - 1; prio >= q->lowest_prio; prio--) { in calc_new_high_prio()
57 for (prio = q->lowest_prio + 1; prio <= q->highest_prio; prio++) { in calc_new_low_prio()
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()
142 struct sk_buff_head *hpq = &q->qdiscs[q->highest_prio]; in skbprio_dequeue()
[all...]
/kernel/linux/linux-5.10/kernel/sched/
H A Drt.c101 rt_rq->highest_prio.curr = MAX_RT_PRIO; in init_rt_rq()
102 rt_rq->highest_prio.next = MAX_RT_PRIO; in init_rt_rq()
173 rt_rq->highest_prio.curr = MAX_RT_PRIO; in init_tg_rt_entry()
280 return rq->rt.highest_prio.curr > prev->prio && in need_pull_rt_task()
396 if (p->prio < rq->rt.highest_prio.next) in enqueue_pushable_task()
397 rq->rt.highest_prio.next = p->prio; in enqueue_pushable_task()
408 rq->rt.highest_prio.next = p->prio; in dequeue_pushable_task()
410 rq->rt.highest_prio.next = MAX_RT_PRIO; in dequeue_pushable_task()
556 if (rt_rq->highest_prio.curr < curr->prio) in sched_rt_rq_enqueue()
954 return rt_rq->highest_prio in rt_se_prio()
[all...]
H A Dsched.h730 } highest_prio; member
/kernel/linux/linux-6.6/kernel/sched/
H A Drt.c158 rt_rq->highest_prio.curr = MAX_RT_PRIO-1; in init_rt_rq()
159 rt_rq->highest_prio.next = MAX_RT_PRIO-1; in init_rt_rq()
234 rt_rq->highest_prio.curr = MAX_RT_PRIO-1; in init_tg_rt_entry()
338 return rq->online && rq->rt.highest_prio.curr > prev->prio && in need_pull_rt_task()
454 if (p->prio < rq->rt.highest_prio.next) in enqueue_pushable_task()
455 rq->rt.highest_prio.next = p->prio; in enqueue_pushable_task()
466 rq->rt.highest_prio.next = p->prio; in dequeue_pushable_task()
468 rq->rt.highest_prio.next = MAX_RT_PRIO-1; in dequeue_pushable_task()
606 if (rt_rq->highest_prio.curr < curr->prio) in sched_rt_rq_enqueue()
1007 return rt_rq->highest_prio in rt_se_prio()
[all...]
H A Ddeadline.c1480 cpupri_set(&rq->rd->cpupri, rq->cpu, rq->rt.highest_prio.curr); in dec_dl_deadline()
H A Dsched.h776 } highest_prio; member

Completed in 25 milliseconds