Home
last modified time | relevance | path

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

/linux/net/sched/
A Dsch_skbprio.c36 u16 highest_prio; member
90 if (prio > q->highest_prio) in skbprio_enqueue()
91 q->highest_prio = prio; in skbprio_enqueue()
125 if (q->lowest_prio == q->highest_prio) { in skbprio_enqueue()
129 q->highest_prio = prio; in skbprio_enqueue()
135 if (prio > q->highest_prio) in skbprio_enqueue()
136 q->highest_prio = prio; in skbprio_enqueue()
158 if (q->lowest_prio == q->highest_prio) { in skbprio_dequeue()
160 q->highest_prio = 0; in skbprio_dequeue()
192 q->highest_prio = 0; in skbprio_init()
[all …]
/linux/kernel/sched/
A Drt.c79 rt_rq->highest_prio.curr = MAX_RT_PRIO-1; in init_rt_rq()
80 rt_rq->highest_prio.next = MAX_RT_PRIO-1; in init_rt_rq()
222 rt_rq->highest_prio.curr = MAX_RT_PRIO-1; in init_tg_rt_entry()
393 if (p->prio < rq->rt.highest_prio.next) in enqueue_pushable_task()
394 rq->rt.highest_prio.next = p->prio; in enqueue_pushable_task()
410 rq->rt.highest_prio.next = p->prio; in dequeue_pushable_task()
979 return rt_rq->highest_prio.curr; in rt_se_prio()
1114 rt_rq->highest_prio.curr = prio; in inc_rt_prio()
1135 rt_rq->highest_prio.curr = in dec_rt_prio()
2324 if (src_rq->rt.highest_prio.next >= in pull_rt_task()
[all …]
A Dsched.h804 } highest_prio; member
A Ddeadline.c1854 cpupri_set(&rq->rd->cpupri, rq->cpu, rq->rt.highest_prio.curr); in dec_dl_deadline()
/linux/fs/notify/
A Dmark.c167 unsigned int highest_prio = 0; in fsnotify_update_sb_watchers() local
173 highest_prio = first_mark->group->priority; in fsnotify_update_sb_watchers()
174 if (WARN_ON(highest_prio >= __FSNOTIFY_PRIO_NUM)) in fsnotify_update_sb_watchers()
175 highest_prio = 0; in fsnotify_update_sb_watchers()
182 for (unsigned int p = conn->prio + 1; p <= highest_prio; p++) in fsnotify_update_sb_watchers()
184 for (unsigned int p = conn->prio; p > highest_prio; p--) in fsnotify_update_sb_watchers()
186 conn->prio = highest_prio; in fsnotify_update_sb_watchers()

Completed in 29 milliseconds