|
@@ -3866,13 +3866,26 @@ static void set_curr_task_fair(struct rq *rq)
|
|
}
|
|
}
|
|
|
|
|
|
#ifdef CONFIG_FAIR_GROUP_SCHED
|
|
#ifdef CONFIG_FAIR_GROUP_SCHED
|
|
-static void moved_group_fair(struct task_struct *p, int on_rq)
|
|
|
|
|
|
+static void task_move_group_fair(struct task_struct *p, int on_rq)
|
|
{
|
|
{
|
|
- struct cfs_rq *cfs_rq = task_cfs_rq(p);
|
|
|
|
-
|
|
|
|
- update_curr(cfs_rq);
|
|
|
|
|
|
+ /*
|
|
|
|
+ * If the task was not on the rq at the time of this cgroup movement
|
|
|
|
+ * it must have been asleep, sleeping tasks keep their ->vruntime
|
|
|
|
+ * absolute on their old rq until wakeup (needed for the fair sleeper
|
|
|
|
+ * bonus in place_entity()).
|
|
|
|
+ *
|
|
|
|
+ * If it was on the rq, we've just 'preempted' it, which does convert
|
|
|
|
+ * ->vruntime to a relative base.
|
|
|
|
+ *
|
|
|
|
+ * Make sure both cases convert their relative position when migrating
|
|
|
|
+ * to another cgroup's rq. This does somewhat interfere with the
|
|
|
|
+ * fair sleeper stuff for the first placement, but who cares.
|
|
|
|
+ */
|
|
|
|
+ if (!on_rq)
|
|
|
|
+ p->se.vruntime -= cfs_rq_of(&p->se)->min_vruntime;
|
|
|
|
+ set_task_rq(p, task_cpu(p));
|
|
if (!on_rq)
|
|
if (!on_rq)
|
|
- place_entity(cfs_rq, &p->se, 1);
|
|
|
|
|
|
+ p->se.vruntime += cfs_rq_of(&p->se)->min_vruntime;
|
|
}
|
|
}
|
|
#endif
|
|
#endif
|
|
|
|
|
|
@@ -3924,7 +3937,7 @@ static const struct sched_class fair_sched_class = {
|
|
.get_rr_interval = get_rr_interval_fair,
|
|
.get_rr_interval = get_rr_interval_fair,
|
|
|
|
|
|
#ifdef CONFIG_FAIR_GROUP_SCHED
|
|
#ifdef CONFIG_FAIR_GROUP_SCHED
|
|
- .moved_group = moved_group_fair,
|
|
|
|
|
|
+ .task_move_group = task_move_group_fair,
|
|
#endif
|
|
#endif
|
|
};
|
|
};
|
|
|
|
|