|
@@ -464,20 +464,17 @@ static void update_min_vruntime(struct cfs_rq *cfs_rq)
|
|
|
{
|
|
|
u64 vruntime = cfs_rq->min_vruntime;
|
|
|
|
|
|
- if (cfs_rq->curr)
|
|
|
- vruntime = cfs_rq->curr->vruntime;
|
|
|
-
|
|
|
if (cfs_rq->rb_leftmost) {
|
|
|
struct sched_entity *se = rb_entry(cfs_rq->rb_leftmost,
|
|
|
struct sched_entity,
|
|
|
run_node);
|
|
|
|
|
|
- if (!cfs_rq->curr)
|
|
|
- vruntime = se->vruntime;
|
|
|
- else
|
|
|
- vruntime = min_vruntime(vruntime, se->vruntime);
|
|
|
+ vruntime = se->vruntime;
|
|
|
}
|
|
|
|
|
|
+ if (cfs_rq->curr)
|
|
|
+ vruntime = min_vruntime(vruntime, cfs_rq->curr->vruntime);
|
|
|
+
|
|
|
/* ensure we never gain time by being placed backwards. */
|
|
|
cfs_rq->min_vruntime = max_vruntime(cfs_rq->min_vruntime, vruntime);
|
|
|
#ifndef CONFIG_64BIT
|
|
@@ -5988,7 +5985,7 @@ static bool yield_to_task_fair(struct rq *rq, struct task_struct *p, bool preemp
|
|
|
*
|
|
|
* The adjacency matrix of the resulting graph is given by:
|
|
|
*
|
|
|
- * log_2 n
|
|
|
+ * log_2 n
|
|
|
* A_i,j = \Union (i % 2^k == 0) && i / 2^(k+1) == j / 2^(k+1) (6)
|
|
|
* k = 0
|
|
|
*
|
|
@@ -6034,7 +6031,7 @@ static bool yield_to_task_fair(struct rq *rq, struct task_struct *p, bool preemp
|
|
|
*
|
|
|
* [XXX write more on how we solve this.. _after_ merging pjt's patches that
|
|
|
* rewrite all of this once again.]
|
|
|
- */
|
|
|
+ */
|
|
|
|
|
|
static unsigned long __read_mostly max_load_balance_interval = HZ/10;
|
|
|
|
|
@@ -6696,7 +6693,7 @@ void update_group_capacity(struct sched_domain *sd, int cpu)
|
|
|
/*
|
|
|
* !SD_OVERLAP domains can assume that child groups
|
|
|
* span the current group.
|
|
|
- */
|
|
|
+ */
|
|
|
|
|
|
group = child->groups;
|
|
|
do {
|