Browse Source

sched: fix typo in the FAIR_GROUP_SCHED branch

while there's no in-tree way to turn group scheduling at the moment,
fix a typo in it nevertheless.

Signed-off-by: Ingo Molnar <mingo@elte.hu>
Ingo Molnar 17 years ago
parent
commit
e56f31aad9
1 changed files with 3 additions and 4 deletions
  1. 3 4
      kernel/sched_fair.c

+ 3 - 4
kernel/sched_fair.c

@@ -959,13 +959,12 @@ load_balance_fair(struct rq *this_rq, int this_cpu, struct rq *busiest,
 	for_each_leaf_cfs_rq(busiest, busy_cfs_rq) {
 	for_each_leaf_cfs_rq(busiest, busy_cfs_rq) {
 #ifdef CONFIG_FAIR_GROUP_SCHED
 #ifdef CONFIG_FAIR_GROUP_SCHED
 		struct cfs_rq *this_cfs_rq;
 		struct cfs_rq *this_cfs_rq;
-		long imbalances;
+		long imbalance;
 		unsigned long maxload;
 		unsigned long maxload;
 
 
 		this_cfs_rq = cpu_cfs_rq(busy_cfs_rq, this_cpu);
 		this_cfs_rq = cpu_cfs_rq(busy_cfs_rq, this_cpu);
 
 
-		imbalance = busy_cfs_rq->load.weight -
-						 this_cfs_rq->load.weight;
+		imbalance = busy_cfs_rq->load.weight - this_cfs_rq->load.weight;
 		/* Don't pull if this_cfs_rq has more load than busy_cfs_rq */
 		/* Don't pull if this_cfs_rq has more load than busy_cfs_rq */
 		if (imbalance <= 0)
 		if (imbalance <= 0)
 			continue;
 			continue;
@@ -976,7 +975,7 @@ load_balance_fair(struct rq *this_rq, int this_cpu, struct rq *busiest,
 
 
 		*this_best_prio = cfs_rq_best_prio(this_cfs_rq);
 		*this_best_prio = cfs_rq_best_prio(this_cfs_rq);
 #else
 #else
-#define maxload rem_load_move
+# define maxload rem_load_move
 #endif
 #endif
 		/* pass busy_cfs_rq argument into
 		/* pass busy_cfs_rq argument into
 		 * load_balance_[start|next]_fair iterators
 		 * load_balance_[start|next]_fair iterators