From: Christoph Lameter Date: Tue, 16 Oct 2007 08:25:30 +0000 (-0700) Subject: Memoryless nodes: Fix interleave behavior for memoryless nodes X-Git-Tag: v2.6.24-rc1~1161 X-Git-Url: http://review.tizen.org/git/?a=commitdiff_plain;h=6eaf806a223e61dc5f2de4ab591f11beb97a8f3b;p=platform%2Fkernel%2Flinux-3.10.git Memoryless nodes: Fix interleave behavior for memoryless nodes MPOL_INTERLEAVE currently simply loops over all nodes. Allocations on memoryless nodes will be redirected to nodes with memory. This results in an imbalance because the neighboring nodes to memoryless nodes will get significantly more interleave hits that the rest of the nodes on the system. We can avoid this imbalance by clearing the nodes in the interleave node set that have no memory. If we use the node map of the memory nodes instead of the online nodes then we have only the nodes we want. Signed-off-by: Christoph Lameter Signed-off-by: Nishanth Aravamudan Tested-by: Lee Schermerhorn Acked-by: Bob Picco Cc: KAMEZAWA Hiroyuki Cc: Mel Gorman Signed-off-by: Andrew Morton Signed-off-by: Linus Torvalds --- diff --git a/mm/mempolicy.c b/mm/mempolicy.c index ccbdb22..5daf63b 100644 --- a/mm/mempolicy.c +++ b/mm/mempolicy.c @@ -183,7 +183,9 @@ static struct mempolicy *mpol_new(int mode, nodemask_t *nodes) switch (mode) { case MPOL_INTERLEAVE: policy->v.nodes = *nodes; - if (nodes_weight(*nodes) == 0) { + nodes_and(policy->v.nodes, policy->v.nodes, + node_states[N_HIGH_MEMORY]); + if (nodes_weight(policy->v.nodes) == 0) { kmem_cache_free(policy_cache, policy); return ERR_PTR(-EINVAL); }