Searched refs:highest_prio (Results 1 – 5 of 5) sorted by relevance
36 u16 highest_prio; member44 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()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()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 …]
81 rt_rq->highest_prio.curr = MAX_RT_PRIO-1; in init_rt_rq()82 rt_rq->highest_prio.next = MAX_RT_PRIO-1; in init_rt_rq()232 rt_rq->highest_prio.curr = MAX_RT_PRIO-1; in init_tg_rt_entry()336 return rq->online && rq->rt.highest_prio.curr > prev->prio; in need_pull_rt_task()404 if (p->prio < rq->rt.highest_prio.next) in enqueue_pushable_task()405 rq->rt.highest_prio.next = p->prio; in enqueue_pushable_task()421 rq->rt.highest_prio.next = p->prio; in dequeue_pushable_task()423 rq->rt.highest_prio.next = MAX_RT_PRIO-1; in dequeue_pushable_task()543 if (rt_rq->highest_prio.curr < donor->prio) in sched_rt_rq_enqueue()964 return rt_rq->highest_prio.curr; in rt_se_prio()[all …]
2026 cpupri_set(&rq->rd->cpupri, rq->cpu, rq->rt.highest_prio.curr); in dec_dl_deadline()
833 } highest_prio; member
177 unsigned int highest_prio = 0; in fsnotify_update_sb_watchers() local183 highest_prio = first_mark->group->priority; in fsnotify_update_sb_watchers()184 if (WARN_ON(highest_prio >= __FSNOTIFY_PRIO_NUM)) in fsnotify_update_sb_watchers()185 highest_prio = 0; in fsnotify_update_sb_watchers()192 for (unsigned int p = conn->prio + 1; p <= highest_prio; p++) in fsnotify_update_sb_watchers()194 for (unsigned int p = conn->prio; p > highest_prio; p--) in fsnotify_update_sb_watchers()196 conn->prio = highest_prio; in fsnotify_update_sb_watchers()