Home
last modified time | relevance | path

Searched refs:lowest_prio (Results 1 - 2 of 2) sorted by relevance

/kernel/linux/linux-5.10/net/sched/
H A Dsch_skbprio.c37 u16 lowest_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()
91 if (prio < q->lowest_prio) in skbprio_enqueue()
92 q->lowest_prio = prio; in skbprio_enqueue()
99 lp = q->lowest_prio; in skbprio_enqueue()
123 if (q->lowest_prio == q->highest_prio) { in skbprio_enqueue()
126 q->lowest_prio = prio; in skbprio_enqueue()
129 q->lowest_prio = calc_new_low_prio(q); in skbprio_enqueue()
156 if (q->lowest_prio in skbprio_dequeue()
[all...]
/kernel/linux/linux-6.6/net/sched/
H A Dsch_skbprio.c37 u16 lowest_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()
91 if (prio < q->lowest_prio) in skbprio_enqueue()
92 q->lowest_prio = prio; in skbprio_enqueue()
99 lp = q->lowest_prio; in skbprio_enqueue()
123 if (q->lowest_prio == q->highest_prio) { in skbprio_enqueue()
126 q->lowest_prio = prio; in skbprio_enqueue()
129 q->lowest_prio = calc_new_low_prio(q); in skbprio_enqueue()
156 if (q->lowest_prio in skbprio_dequeue()
[all...]

Completed in 2 milliseconds