[PATCH] Avoid excessive sorting of early_node_map[]
commita6af2bc3d5ce8722b9d09c5bdd5383c91c419653
authorMel Gorman <mel@csn.ul.ie>
Sat, 10 Feb 2007 09:42:57 +0000 (10 01:42 -0800)
committerLinus Torvalds <torvalds@woody.linux-foundation.org>
Sun, 11 Feb 2007 18:51:17 +0000 (11 10:51 -0800)
treed4af36e83f25d84979584b670b692068eb2b5a56
parente10a4437cb37c85f2df95432025b392d98aac2aa
[PATCH] Avoid excessive sorting of early_node_map[]

find_min_pfn_for_node() and find_min_pfn_with_active_regions() sort
early_node_map[] on every call.  This is an excessive amount of sorting and
that can be avoided.  This patch always searches the whole early_node_map[]
in find_min_pfn_for_node() instead of returning the first value found.  The
map is then only sorted once when required.  Successfully boot tested on a
number of machines.

[akpm@osdl.org: cleanup]
Signed-off-by: Mel Gorman <mel@csn.ul.ie>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
mm/page_alloc.c