aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
-rw-r--r--kernel/sched.c8
1 files changed, 5 insertions, 3 deletions
diff --git a/kernel/sched.c b/kernel/sched.c
index 3d8a1b2680ee..da9338150484 100644
--- a/kernel/sched.c
+++ b/kernel/sched.c
@@ -6807,7 +6807,7 @@ __setup("isolcpus=", isolated_cpu_setup);
6807 */ 6807 */
6808static int find_next_best_node(int node, nodemask_t *used_nodes) 6808static int find_next_best_node(int node, nodemask_t *used_nodes)
6809{ 6809{
6810 int i, n, val, min_val, best_node = 0; 6810 int i, n, val, min_val, best_node = -1;
6811 6811
6812 min_val = INT_MAX; 6812 min_val = INT_MAX;
6813 6813
@@ -6831,7 +6831,8 @@ static int find_next_best_node(int node, nodemask_t *used_nodes)
6831 } 6831 }
6832 } 6832 }
6833 6833
6834 node_set(best_node, *used_nodes); 6834 if (best_node != -1)
6835 node_set(best_node, *used_nodes);
6835 return best_node; 6836 return best_node;
6836} 6837}
6837 6838
@@ -6857,7 +6858,8 @@ static void sched_domain_node_span(int node, struct cpumask *span)
6857 6858
6858 for (i = 1; i < SD_NODES_PER_DOMAIN; i++) { 6859 for (i = 1; i < SD_NODES_PER_DOMAIN; i++) {
6859 int next_node = find_next_best_node(node, &used_nodes); 6860 int next_node = find_next_best_node(node, &used_nodes);
6860 6861 if (next_node < 0)
6862 break;
6861 cpumask_or(span, span, cpumask_of_node(next_node)); 6863 cpumask_or(span, span, cpumask_of_node(next_node));
6862 } 6864 }
6863} 6865}