x86, numa: Fix numa emulation calculation of big nodes
authorDavid Rientjes <rientjes@google.com>
Mon, 15 Feb 2010 21:43:25 +0000 (13:43 -0800)
committerH. Peter Anvin <hpa@zytor.com>
Mon, 15 Feb 2010 22:34:04 +0000 (14:34 -0800)
commit68fd111e02b979876359c7b471a8bcbca0628b75
tree6b8cd2a098fd5bbe6ced2a7c313c52ae3bf48d59
parent0271f91003d3703675be13b8865618359a6caa1f
x86, numa: Fix numa emulation calculation of big nodes

numa=fake=N uses split_nodes_interleave() to partition the system into N
fake nodes.  Each node size must have be a multiple of
FAKE_NODE_MIN_SIZE, otherwise it is possible to get strange alignments.
Because of this, the remaining memory from each node when rounded to
FAKE_NODE_MIN_SIZE is consolidated into a number of "big nodes" that are
bigger than the rest.

The calculation of the number of big nodes is incorrect since it is using
a logical AND operator when it should be multiplying the rounded-off
portion of each node with N.

Signed-off-by: David Rientjes <rientjes@google.com>
LKML-Reference: <alpine.DEB.2.00.1002151342230.26927@chino.kir.corp.google.com>
Signed-off-by: H. Peter Anvin <hpa@zytor.com>
arch/x86/mm/numa_64.c