Lines Matching refs:next
659 struct rb_node *next = rb_next(&se->run_node);
661 if (!next) {
665 return rb_entry(next, struct sched_entity, run_node);
869 * such that the next switched_to_fair() has the
2238 * period will be for the next scan window. If local/(local+remote) ratio is
2838 work->next = work;
2875 * the next time around.
2950 * would find the !migratable VMA on the next scan but not reset the
2988 p->numa_work.next = &p->numa_work;
3026 if ((curr->flags & (PF_EXITING | PF_KTHREAD)) || work->next != work) {
3452 void set_task_rq_fair(struct sched_entity *se, struct cfs_rq *prev, struct cfs_rq *next)
3479 n_last_update_time_copy = next->load_last_update_time_copy;
3484 n_last_update_time = next->avg.last_update_time;
3489 n_last_update_time = next->avg.last_update_time;
4496 if (cfs_rq->next != se) {
4500 cfs_rq->next = NULL;
4522 if (cfs_rq->next == se) {
4662 * Pick the next process, keeping these things in mind, in this order:
4664 * 2) pick the "next" process, since someone really wants that to run
4704 if (cfs_rq->next && wakeup_preempt_entity(cfs_rq->next, left) < 1) {
4708 se = cfs_rq->next;
5163 goto next;
5185 next:
5550 if (!cfs_b->throttled_cfs_rq.next) {
5774 struct sched_entity *next;
5779 if (cfs->next)
5780 next = cfs->next;
5782 next = __pick_first_entity(cfs);
5783 if (next && wakeup_preempt_entity(next, se) == 1)
7022 for (; pd; pd = pd->next) {
7357 cfs_rq_of(se)->next = se;
7385 * next-buddy nomination below.
7478 * likely that a next task is from the same cgroup as the current.
7567 * Move the next running task to the front of
7677 /* Tell the scheduler that we'd really like pse to run next. */
7909 (&p->se == cfs_rq_of(&p->se)->next || &p->se == cfs_rq_of(&p->se)->last)) {
8191 goto next;
8206 goto next;
8216 goto next;
8225 goto next;
8238 goto next;
8270 next:
8744 group = group->next;
8797 * This is a somewhat tricky proposition since the next run might not find the
9394 } while (group = group->next, group != sd->groups);
9556 sg = sg->next;
9639 * the imbalance. The next load balance will take care of
9939 * task, the next balance pass can still reduce the busiest
9943 * the next pass will adjust the group classification and
10454 unsigned long interval, next;
10458 next = sd->last_balance + interval;
10460 if (time_after(*next_balance, next)) {
10461 *next_balance = next;
11121 * If time for next balance is due,
11359 /* Move the next balance forward */
11782 * Move the next running task to the front of the list, so our