提交 5510db9c 编写于 作者: T Tejun Heo 提交者: H. Peter Anvin

x86-32, numa: Reorganize calculate_numa_remap_page()

Separate the outer node walking loop and per-node logic from
calculate_numa_remap_pages().  The outer loop is collapsed into
initmem_init() and the per-node logic is moved into a new function -
init_alloc_remap().

The new function name is confusing with the existing
init_remap_allocator() and the behavior is the function isn't very
clean either at this point, but this is to prepare for further
cleanups and it will become prettier.

This function doesn't introduce any behavior change.
Signed-off-by: NTejun Heo <tj@kernel.org>
Link: http://lkml.kernel.org/r/1301955840-7246-5-git-send-email-tj@kernel.orgAcked-by: NYinghai Lu <yinghai@kernel.org>
Cc: David Rientjes <rientjes@google.com>
Signed-off-by: NH. Peter Anvin <hpa@zytor.com>
上级 5b8443b2
...@@ -264,70 +264,64 @@ void resume_map_numa_kva(pgd_t *pgd_base) ...@@ -264,70 +264,64 @@ void resume_map_numa_kva(pgd_t *pgd_base)
} }
#endif #endif
static __init unsigned long calculate_numa_remap_pages(void) static __init unsigned long init_alloc_remap(int nid, unsigned long offset)
{ {
int nid; unsigned long size;
unsigned long size, reserve_pages = 0; u64 node_kva;
for_each_online_node(nid) { /*
u64 node_kva; * The acpi/srat node info can show hot-add memroy zones where
* memory could be added but not currently present.
/* */
* The acpi/srat node info can show hot-add memroy zones printk(KERN_DEBUG "node %d pfn: [%lx - %lx]\n",
* where memory could be added but not currently present. nid, node_start_pfn[nid], node_end_pfn[nid]);
*/ if (node_start_pfn[nid] > max_pfn)
printk(KERN_DEBUG "node %d pfn: [%lx - %lx]\n", return 0;
nid, node_start_pfn[nid], node_end_pfn[nid]); if (!node_end_pfn[nid])
if (node_start_pfn[nid] > max_pfn) return 0;
continue; if (node_end_pfn[nid] > max_pfn)
if (!node_end_pfn[nid]) node_end_pfn[nid] = max_pfn;
continue;
if (node_end_pfn[nid] > max_pfn) /* ensure the remap includes space for the pgdat. */
node_end_pfn[nid] = max_pfn; size = node_remap_size[nid];
size += ALIGN(sizeof(pg_data_t), PAGE_SIZE);
/* ensure the remap includes space for the pgdat. */
size = node_remap_size[nid]; /* convert size to large (pmd size) pages, rounding up */
size += ALIGN(sizeof(pg_data_t), PAGE_SIZE); size = (size + LARGE_PAGE_BYTES - 1) / LARGE_PAGE_BYTES;
/* now the roundup is correct, convert to PAGE_SIZE pages */
/* convert size to large (pmd size) pages, rounding up */ size = size * PTRS_PER_PTE;
size = (size + LARGE_PAGE_BYTES - 1) / LARGE_PAGE_BYTES;
/* now the roundup is correct, convert to PAGE_SIZE pages */ node_kva = memblock_find_in_range(node_start_pfn[nid] << PAGE_SHIFT,
size = size * PTRS_PER_PTE; (u64)node_end_pfn[nid] << PAGE_SHIFT,
(u64)size << PAGE_SHIFT,
node_kva = memblock_find_in_range(node_start_pfn[nid] << PAGE_SHIFT, LARGE_PAGE_BYTES);
((u64)node_end_pfn[nid])<<PAGE_SHIFT, if (node_kva == MEMBLOCK_ERROR)
((u64)size)<<PAGE_SHIFT, panic("Can not get kva ram\n");
LARGE_PAGE_BYTES);
if (node_kva == MEMBLOCK_ERROR) node_remap_size[nid] = size;
panic("Can not get kva ram\n"); node_remap_offset[nid] = offset;
printk(KERN_DEBUG "Reserving %ld pages of KVA for lmem_map of node %d at %llx\n",
node_remap_size[nid] = size; size, nid, node_kva >> PAGE_SHIFT);
node_remap_offset[nid] = reserve_pages;
reserve_pages += size; /*
printk(KERN_DEBUG "Reserving %ld pages of KVA for lmem_map of" * prevent kva address below max_low_pfn want it on system
" node %d at %llx\n", * with less memory later.
size, nid, node_kva >> PAGE_SHIFT); * layout will be: KVA address , KVA RAM
*
/* * we are supposed to only record the one less then
* prevent kva address below max_low_pfn want it on system * max_low_pfn but we could have some hole in high memory,
* with less memory later. * and it will only check page_is_ram(pfn) &&
* layout will be: KVA address , KVA RAM * !page_is_reserved_early(pfn) to decide to use it as free.
* * So memblock_x86_reserve_range here, hope we don't run out
* we are supposed to only record the one less then max_low_pfn * of that array
* but we could have some hole in high memory, and it will only */
* check page_is_ram(pfn) && !page_is_reserved_early(pfn) to decide memblock_x86_reserve_range(node_kva,
* to use it as free. node_kva + ((u64)size << PAGE_SHIFT),
* So memblock_x86_reserve_range here, hope we don't run out of that array "KVA RAM");
*/
memblock_x86_reserve_range(node_kva, node_remap_start_pfn[nid] = node_kva >> PAGE_SHIFT;
node_kva + (((u64)size)<<PAGE_SHIFT),
"KVA RAM"); return size;
node_remap_start_pfn[nid] = node_kva >> PAGE_SHIFT;
}
printk(KERN_INFO "Reserving total of %lx pages for numa KVA remap\n",
reserve_pages);
return reserve_pages;
} }
static void init_remap_allocator(int nid) static void init_remap_allocator(int nid)
...@@ -346,6 +340,7 @@ static void init_remap_allocator(int nid) ...@@ -346,6 +340,7 @@ static void init_remap_allocator(int nid)
void __init initmem_init(void) void __init initmem_init(void)
{ {
unsigned long reserve_pages = 0;
int nid; int nid;
/* /*
...@@ -359,7 +354,11 @@ void __init initmem_init(void) ...@@ -359,7 +354,11 @@ void __init initmem_init(void)
get_memcfg_numa(); get_memcfg_numa();
numa_init_array(); numa_init_array();
kva_pages = roundup(calculate_numa_remap_pages(), PTRS_PER_PTE); for_each_online_node(nid)
reserve_pages += init_alloc_remap(nid, reserve_pages);
kva_pages = roundup(reserve_pages, PTRS_PER_PTE);
printk(KERN_INFO "Reserving total of %lx pages for numa KVA remap\n",
reserve_pages);
kva_start_pfn = memblock_find_in_range(min_low_pfn << PAGE_SHIFT, kva_start_pfn = memblock_find_in_range(min_low_pfn << PAGE_SHIFT,
max_low_pfn << PAGE_SHIFT, max_low_pfn << PAGE_SHIFT,
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册