diff options
author | Paul E. McKenney <paulmck@linux.vnet.ibm.com> | 2012-09-06 00:43:57 -0400 |
---|---|---|
committer | Paul E. McKenney <paulmck@linux.vnet.ibm.com> | 2012-09-23 10:41:56 -0400 |
commit | 4dbd6bb38dd1cbfa5cb21e56e51dffc74aa20038 (patch) | |
tree | db9a40357ca52d6b135c95ea3186c3f89205520e /kernel/rcutree.c | |
parent | d7d6a11e8609f0319d4a2d8ede348f8b3374b652 (diff) |
rcu: Handle unbalanced rcu_node configurations with few CPUs
If CONFIG_RCU_FANOUT_EXACT=y, if there are not enough CPUs (according
to nr_cpu_ids) to require more than a single rcu_node structure, but if
NR_CPUS is larger than would fit into a single rcu_node structure, then
the current rcu_init_levelspread() code is subject to integer overflow
in the eight-bit ->levelspread[] array in the rcu_state structure.
In this case, the solution is -not- to increase the size of the
elements in this array because the values in that array should be
constrained to the number of bits in an unsigned long. Instead, this
commit replaces NR_CPUS with nr_cpu_ids in the rcu_init_levelspread()
function's initialization of the cprv local variable. This results in
all of the arithmetic being consistently based off of the nr_cpu_ids
value, thus avoiding the overflow, which was caused by the mixing of
nr_cpu_ids and NR_CPUS.
Reported-by: Mike Galbraith <efault@gmx.de>
Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Diffstat (limited to 'kernel/rcutree.c')
-rw-r--r-- | kernel/rcutree.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/kernel/rcutree.c b/kernel/rcutree.c index 6194402ec853..8b9496fee235 100644 --- a/kernel/rcutree.c +++ b/kernel/rcutree.c | |||
@@ -2723,7 +2723,7 @@ static void __init rcu_init_levelspread(struct rcu_state *rsp) | |||
2723 | int cprv; | 2723 | int cprv; |
2724 | int i; | 2724 | int i; |
2725 | 2725 | ||
2726 | cprv = NR_CPUS; | 2726 | cprv = nr_cpu_ids; |
2727 | for (i = rcu_num_lvls - 1; i >= 0; i--) { | 2727 | for (i = rcu_num_lvls - 1; i >= 0; i--) { |
2728 | ccur = rsp->levelcnt[i]; | 2728 | ccur = rsp->levelcnt[i]; |
2729 | rsp->levelspread[i] = (cprv + ccur - 1) / ccur; | 2729 | rsp->levelspread[i] = (cprv + ccur - 1) / ccur; |