evie/android_kernel_oneplus_msm8998
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

x86-64, NUMA: Do not scan two times for setup_node_bootmem()

Browse source 
By the time setup_node_bootmem() is called, all the memblocks are
already registered.  As node_data is allocated from these memblocks,
calling it more than once doesn't make any difference.  Drop the loop.

tj: Dropped comment referencing to the old behavior as suggested by
    David and rephrased the description.

Signed-off-by: Yinghai Lu <yinghai@kernel.org>
Acked-by: David Rientjes <rientjes@google.com>
Signed-off-by: Tejun Heo <tj@kernel.org>
This commit is contained in:
Yinghai Lu 2011-02-21 10:58:13 +01:00 • committed by Tejun Heo
parent 6d496f9f23
commit 69efcc6d90
1 changed files with 12 additions and 20 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

32
arch/x86/mm/numa_64.c
View file

@ -480,7 +480,7 @@ static bool __init numa_meminfo_cover_memory(const struct numa_meminfo *mi)
static int __init numa_register_memblks(struct numa_meminfo *mi) static int __init numa_register_memblks(struct numa_meminfo *mi)
{ {
int i, j, nid; int i, nid;
/* Account for nodes with cpus and no memory */ /* Account for nodes with cpus and no memory */
node_possible_map = numa_nodes_parsed; node_possible_map = numa_nodes_parsed;
@ -506,28 +506,20 @@ static int __init numa_register_memblks(struct numa_meminfo *mi)
init_memory_mapping_high(); init_memory_mapping_high();
/* /* Finally register nodes. */
* Finally register nodes. Do it twice in case setup_node_bootmem for_each_node_mask(nid, node_possible_map) {
* missed one due to missing bootmem. u64 start = (u64)max_pfn << PAGE_SHIFT;
*/ u64 end = 0;
for (i = 0; i < 2; i++) {
for_each_node_mask(nid, node_possible_map) {
u64 start = (u64)max_pfn << PAGE_SHIFT;
u64 end = 0;
if (node_online(nid)) for (i = 0; i < mi->nr_blks; i++) {
if (nid != mi->blk[i].nid)
continue; continue;
start = min(mi->blk[i].start, start);
for (j = 0; j < mi->nr_blks; j++) { end = max(mi->blk[i].end, end);
if (nid != mi->blk[j].nid)
continue;
start = min(mi->blk[j].start, start);
end = max(mi->blk[j].end, end);
}
if (start < end)
setup_node_bootmem(nid, start, end);
} }
if (start < end)
setup_node_bootmem(nid, start, end);
} }
return 0; return 0;