Lines Matching defs:next
102 rt_rq->highest_prio.next = MAX_RT_PRIO;
411 if (p->prio < rq->rt.highest_prio.next) {
412 rq->rt.highest_prio.next = p->prio;
423 rq->rt.highest_prio.next = p->prio;
425 rq->rt.highest_prio.next = MAX_RT_PRIO;
530 tg = list_entry_rcu(tg->list.next, typeof(struct task_group), list);
735 goto next;
755 next:
1456 return sync && task_has_rt_policy(rq->curr) && p->prio <= rq->rt.highest_prio.next && rq->rt.rt_nr_running <= 0x2;
1678 * - current will be preempted on the next reschedule
1717 struct sched_rt_entity *next = NULL;
1725 next = list_entry(queue->next, struct sched_rt_entity, run_list);
1727 return next;
1902 } while (sg = sg->next, sg != sd->groups);
2197 * run-queue and is also still the next task eligible for
2203 * The task hasn't migrated, and is still the next
2292 int next;
2301 * will return the next CPU found in the rto_mask.
2322 * made prior to the @next value observed.
2326 next = atomic_read_acquire(&rd->rto_loop_next);
2327 if (rd->rto_loop == next) {
2331 rd->rto_loop = next;
2402 /* Pass the IPI to the next rt overloaded queue */
2412 /* Try the next RT overloaded CPU */
2454 * Don't bother taking the src_rq->lock if the next highest
2460 if (src_rq->rt.highest_prio.next >= this_rq->rt.highest_prio.curr) {
2669 /* max may change after cur was read, this will be fixed next tick */
2674 unsigned long next;
2681 next = DIV_ROUND_UP(min(soft, hard), USEC_PER_SEC / HZ);
2682 if (p->rt.timeout > next) {
2729 if (rt_se->run_list.prev != rt_se->run_list.next) {