2010-07-12 06:36:09 +02:00
|
|
|
/*
|
|
|
|
* Procedures for maintaining information about logical memory blocks.
|
|
|
|
*
|
|
|
|
* Peter Bergner, IBM Corp. June 2001.
|
|
|
|
* Copyright (C) 2001 Peter Bergner.
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License
|
|
|
|
* as published by the Free Software Foundation; either version
|
|
|
|
* 2 of the License, or (at your option) any later version.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/kernel.h>
|
2010-07-07 00:39:13 +02:00
|
|
|
#include <linux/slab.h>
|
2010-07-12 06:36:09 +02:00
|
|
|
#include <linux/init.h>
|
|
|
|
#include <linux/bitops.h>
|
2010-07-07 00:39:07 +02:00
|
|
|
#include <linux/poison.h>
|
2010-07-07 00:39:16 +02:00
|
|
|
#include <linux/pfn.h>
|
2010-07-07 00:39:19 +02:00
|
|
|
#include <linux/debugfs.h>
|
|
|
|
#include <linux/seq_file.h>
|
2010-07-12 06:36:09 +02:00
|
|
|
#include <linux/memblock.h>
|
|
|
|
|
2013-11-13 00:07:59 +01:00
|
|
|
#include <asm-generic/sections.h>
|
2014-01-22 00:50:19 +01:00
|
|
|
#include <linux/io.h>
|
|
|
|
|
|
|
|
#include "internal.h"
|
2013-11-13 00:07:59 +01:00
|
|
|
|
2011-12-08 19:22:07 +01:00
|
|
|
static struct memblock_region memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock;
|
|
|
|
static struct memblock_region memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock;
|
|
|
|
|
|
|
|
struct memblock memblock __initdata_memblock = {
|
|
|
|
.memory.regions = memblock_memory_init_regions,
|
|
|
|
.memory.cnt = 1, /* empty dummy entry */
|
|
|
|
.memory.max = INIT_MEMBLOCK_REGIONS,
|
|
|
|
|
|
|
|
.reserved.regions = memblock_reserved_init_regions,
|
|
|
|
.reserved.cnt = 1, /* empty dummy entry */
|
|
|
|
.reserved.max = INIT_MEMBLOCK_REGIONS,
|
|
|
|
|
2013-11-13 00:07:59 +01:00
|
|
|
.bottom_up = false,
|
2011-12-08 19:22:07 +01:00
|
|
|
.current_limit = MEMBLOCK_ALLOC_ANYWHERE,
|
|
|
|
};
|
2010-07-12 06:36:09 +02:00
|
|
|
|
2010-07-28 07:43:02 +02:00
|
|
|
int memblock_debug __initdata_memblock;
|
2014-01-22 00:49:35 +01:00
|
|
|
#ifdef CONFIG_MOVABLE_NODE
|
|
|
|
bool movable_node_enabled __initdata_memblock = false;
|
|
|
|
#endif
|
2011-12-08 19:22:08 +01:00
|
|
|
static int memblock_can_resize __initdata_memblock;
|
2012-05-30 00:06:50 +02:00
|
|
|
static int memblock_memory_in_slab __initdata_memblock = 0;
|
|
|
|
static int memblock_reserved_in_slab __initdata_memblock = 0;
|
2010-07-12 06:36:09 +02:00
|
|
|
|
2010-07-07 00:39:13 +02:00
|
|
|
/* inline so we don't get a warning when pr_debug is compiled out */
|
2012-10-09 01:33:55 +02:00
|
|
|
static __init_memblock const char *
|
|
|
|
memblock_type_name(struct memblock_type *type)
|
2010-07-07 00:39:13 +02:00
|
|
|
{
|
|
|
|
if (type == &memblock.memory)
|
|
|
|
return "memory";
|
|
|
|
else if (type == &memblock.reserved)
|
|
|
|
return "reserved";
|
|
|
|
else
|
|
|
|
return "unknown";
|
|
|
|
}
|
|
|
|
|
2011-12-08 19:22:07 +01:00
|
|
|
/* adjust *@size so that (@base + *@size) doesn't overflow, return new size */
|
|
|
|
static inline phys_addr_t memblock_cap_size(phys_addr_t base, phys_addr_t *size)
|
|
|
|
{
|
|
|
|
return *size = min(*size, (phys_addr_t)ULLONG_MAX - base);
|
|
|
|
}
|
|
|
|
|
2010-07-12 06:36:48 +02:00
|
|
|
/*
|
|
|
|
* Address comparison utilities
|
|
|
|
*/
|
2010-07-28 07:43:02 +02:00
|
|
|
static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1,
|
2010-08-04 05:34:42 +02:00
|
|
|
phys_addr_t base2, phys_addr_t size2)
|
2010-07-12 06:36:09 +02:00
|
|
|
{
|
|
|
|
return ((base1 < (base2 + size2)) && (base2 < (base1 + size1)));
|
|
|
|
}
|
|
|
|
|
2011-11-01 01:09:15 +01:00
|
|
|
static long __init_memblock memblock_overlaps_region(struct memblock_type *type,
|
|
|
|
phys_addr_t base, phys_addr_t size)
|
2010-07-12 06:36:48 +02:00
|
|
|
{
|
|
|
|
unsigned long i;
|
|
|
|
|
|
|
|
for (i = 0; i < type->cnt; i++) {
|
|
|
|
phys_addr_t rgnbase = type->regions[i].base;
|
|
|
|
phys_addr_t rgnsize = type->regions[i].size;
|
|
|
|
if (memblock_addrs_overlap(base, size, rgnbase, rgnsize))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return (i < type->cnt) ? i : -1;
|
|
|
|
}
|
|
|
|
|
2013-11-13 00:07:59 +01:00
|
|
|
/*
|
|
|
|
* __memblock_find_range_bottom_up - find free area utility in bottom-up
|
|
|
|
* @start: start of candidate range
|
|
|
|
* @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
|
|
|
|
* @size: size of free area to find
|
|
|
|
* @align: alignment of free area to find
|
2014-01-22 00:50:16 +01:00
|
|
|
* @nid: nid of the free area to find, %NUMA_NO_NODE for any node
|
2013-11-13 00:07:59 +01:00
|
|
|
*
|
|
|
|
* Utility called from memblock_find_in_range_node(), find free area bottom-up.
|
|
|
|
*
|
|
|
|
* RETURNS:
|
|
|
|
* Found address on success, 0 on failure.
|
|
|
|
*/
|
|
|
|
static phys_addr_t __init_memblock
|
|
|
|
__memblock_find_range_bottom_up(phys_addr_t start, phys_addr_t end,
|
|
|
|
phys_addr_t size, phys_addr_t align, int nid)
|
|
|
|
{
|
|
|
|
phys_addr_t this_start, this_end, cand;
|
|
|
|
u64 i;
|
|
|
|
|
|
|
|
for_each_free_mem_range(i, nid, &this_start, &this_end, NULL) {
|
|
|
|
this_start = clamp(this_start, start, end);
|
|
|
|
this_end = clamp(this_end, start, end);
|
|
|
|
|
|
|
|
cand = round_up(this_start, align);
|
|
|
|
if (cand < this_end && this_end - cand >= size)
|
|
|
|
return cand;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-12-08 19:22:09 +01:00
|
|
|
/**
|
mm/memblock.c: factor out of top-down allocation
[Problem]
The current Linux cannot migrate pages used by the kernel because of the
kernel direct mapping. In Linux kernel space, va = pa + PAGE_OFFSET.
When the pa is changed, we cannot simply update the pagetable and keep the
va unmodified. So the kernel pages are not migratable.
There are also some other issues will cause the kernel pages not
migratable. For example, the physical address may be cached somewhere and
will be used. It is not to update all the caches.
When doing memory hotplug in Linux, we first migrate all the pages in one
memory device somewhere else, and then remove the device. But if pages
are used by the kernel, they are not migratable. As a result, memory used
by the kernel cannot be hot-removed.
Modifying the kernel direct mapping mechanism is too difficult to do. And
it may cause the kernel performance down and unstable. So we use the
following way to do memory hotplug.
[What we are doing]
In Linux, memory in one numa node is divided into several zones. One of
the zones is ZONE_MOVABLE, which the kernel won't use.
In order to implement memory hotplug in Linux, we are going to arrange all
hotpluggable memory in ZONE_MOVABLE so that the kernel won't use these
memory. To do this, we need ACPI's help.
In ACPI, SRAT(System Resource Affinity Table) contains NUMA info. The
memory affinities in SRAT record every memory range in the system, and
also, flags specifying if the memory range is hotpluggable. (Please refer
to ACPI spec 5.0 5.2.16)
With the help of SRAT, we have to do the following two things to achieve our
goal:
1. When doing memory hot-add, allow the users arranging hotpluggable as
ZONE_MOVABLE.
(This has been done by the MOVABLE_NODE functionality in Linux.)
2. when the system is booting, prevent bootmem allocator from allocating
hotpluggable memory for the kernel before the memory initialization
finishes.
The problem 2 is the key problem we are going to solve. But before solving it,
we need some preparation. Please see below.
[Preparation]
Bootloader has to load the kernel image into memory. And this memory must
be unhotpluggable. We cannot prevent this anyway. So in a memory hotplug
system, we can assume any node the kernel resides in is not hotpluggable.
Before SRAT is parsed, we don't know which memory ranges are hotpluggable.
But memblock has already started to work. In the current kernel,
memblock allocates the following memory before SRAT is parsed:
setup_arch()
|->memblock_x86_fill() /* memblock is ready */
|......
|->early_reserve_e820_mpc_new() /* allocate memory under 1MB */
|->reserve_real_mode() /* allocate memory under 1MB */
|->init_mem_mapping() /* allocate page tables, about 2MB to map 1GB memory */
|->dma_contiguous_reserve() /* specified by user, should be low */
|->setup_log_buf() /* specified by user, several mega bytes */
|->relocate_initrd() /* could be large, but will be freed after boot, should reorder */
|->acpi_initrd_override() /* several mega bytes */
|->reserve_crashkernel() /* could be large, should reorder */
|......
|->initmem_init() /* Parse SRAT */
According to Tejun's advice, before SRAT is parsed, we should try our best
to allocate memory near the kernel image. Since the whole node the kernel
resides in won't be hotpluggable, and for a modern server, a node may have
at least 16GB memory, allocating several mega bytes memory around the
kernel image won't cross to hotpluggable memory.
[About this patchset]
So this patchset is the preparation for the problem 2 that we want to
solve. It does the following:
1. Make memblock be able to allocate memory bottom up.
1) Keep all the memblock APIs' prototype unmodified.
2) When the direction is bottom up, keep the start address greater than the
end of kernel image.
2. Improve init_mem_mapping() to support allocate page tables in
bottom up direction.
3. Introduce "movable_node" boot option to enable and disable this
functionality.
This patch (of 6):
Create a new function __memblock_find_range_top_down to factor out of
top-down allocation from memblock_find_in_range_node. This is a
preparation because we will introduce a new bottom-up allocation mode in
the following patch.
Signed-off-by: Tang Chen <tangchen@cn.fujitsu.com>
Signed-off-by: Zhang Yanfei <zhangyanfei@cn.fujitsu.com>
Acked-by: Tejun Heo <tj@kernel.org>
Acked-by: Toshi Kani <toshi.kani@hp.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: "H. Peter Anvin" <hpa@zytor.com>
Cc: Wanpeng Li <liwanp@linux.vnet.ibm.com>
Cc: Thomas Renninger <trenn@suse.de>
Cc: Yinghai Lu <yinghai@kernel.org>
Cc: Jiang Liu <jiang.liu@huawei.com>
Cc: Wen Congyang <wency@cn.fujitsu.com>
Cc: Lai Jiangshan <laijs@cn.fujitsu.com>
Cc: Yasuaki Ishimatsu <isimatu.yasuaki@jp.fujitsu.com>
Cc: Taku Izumi <izumi.taku@jp.fujitsu.com>
Cc: Mel Gorman <mgorman@suse.de>
Cc: Michal Nazarewicz <mina86@mina86.com>
Cc: Minchan Kim <minchan@kernel.org>
Cc: Rik van Riel <riel@redhat.com>
Cc: Johannes Weiner <hannes@cmpxchg.org>
Cc: Kamezawa Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-11-13 00:07:57 +01:00
|
|
|
* __memblock_find_range_top_down - find free area utility, in top-down
|
2011-12-08 19:22:09 +01:00
|
|
|
* @start: start of candidate range
|
|
|
|
* @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
|
|
|
|
* @size: size of free area to find
|
|
|
|
* @align: alignment of free area to find
|
2014-01-22 00:50:16 +01:00
|
|
|
* @nid: nid of the free area to find, %NUMA_NO_NODE for any node
|
2011-12-08 19:22:09 +01:00
|
|
|
*
|
mm/memblock.c: factor out of top-down allocation
[Problem]
The current Linux cannot migrate pages used by the kernel because of the
kernel direct mapping. In Linux kernel space, va = pa + PAGE_OFFSET.
When the pa is changed, we cannot simply update the pagetable and keep the
va unmodified. So the kernel pages are not migratable.
There are also some other issues will cause the kernel pages not
migratable. For example, the physical address may be cached somewhere and
will be used. It is not to update all the caches.
When doing memory hotplug in Linux, we first migrate all the pages in one
memory device somewhere else, and then remove the device. But if pages
are used by the kernel, they are not migratable. As a result, memory used
by the kernel cannot be hot-removed.
Modifying the kernel direct mapping mechanism is too difficult to do. And
it may cause the kernel performance down and unstable. So we use the
following way to do memory hotplug.
[What we are doing]
In Linux, memory in one numa node is divided into several zones. One of
the zones is ZONE_MOVABLE, which the kernel won't use.
In order to implement memory hotplug in Linux, we are going to arrange all
hotpluggable memory in ZONE_MOVABLE so that the kernel won't use these
memory. To do this, we need ACPI's help.
In ACPI, SRAT(System Resource Affinity Table) contains NUMA info. The
memory affinities in SRAT record every memory range in the system, and
also, flags specifying if the memory range is hotpluggable. (Please refer
to ACPI spec 5.0 5.2.16)
With the help of SRAT, we have to do the following two things to achieve our
goal:
1. When doing memory hot-add, allow the users arranging hotpluggable as
ZONE_MOVABLE.
(This has been done by the MOVABLE_NODE functionality in Linux.)
2. when the system is booting, prevent bootmem allocator from allocating
hotpluggable memory for the kernel before the memory initialization
finishes.
The problem 2 is the key problem we are going to solve. But before solving it,
we need some preparation. Please see below.
[Preparation]
Bootloader has to load the kernel image into memory. And this memory must
be unhotpluggable. We cannot prevent this anyway. So in a memory hotplug
system, we can assume any node the kernel resides in is not hotpluggable.
Before SRAT is parsed, we don't know which memory ranges are hotpluggable.
But memblock has already started to work. In the current kernel,
memblock allocates the following memory before SRAT is parsed:
setup_arch()
|->memblock_x86_fill() /* memblock is ready */
|......
|->early_reserve_e820_mpc_new() /* allocate memory under 1MB */
|->reserve_real_mode() /* allocate memory under 1MB */
|->init_mem_mapping() /* allocate page tables, about 2MB to map 1GB memory */
|->dma_contiguous_reserve() /* specified by user, should be low */
|->setup_log_buf() /* specified by user, several mega bytes */
|->relocate_initrd() /* could be large, but will be freed after boot, should reorder */
|->acpi_initrd_override() /* several mega bytes */
|->reserve_crashkernel() /* could be large, should reorder */
|......
|->initmem_init() /* Parse SRAT */
According to Tejun's advice, before SRAT is parsed, we should try our best
to allocate memory near the kernel image. Since the whole node the kernel
resides in won't be hotpluggable, and for a modern server, a node may have
at least 16GB memory, allocating several mega bytes memory around the
kernel image won't cross to hotpluggable memory.
[About this patchset]
So this patchset is the preparation for the problem 2 that we want to
solve. It does the following:
1. Make memblock be able to allocate memory bottom up.
1) Keep all the memblock APIs' prototype unmodified.
2) When the direction is bottom up, keep the start address greater than the
end of kernel image.
2. Improve init_mem_mapping() to support allocate page tables in
bottom up direction.
3. Introduce "movable_node" boot option to enable and disable this
functionality.
This patch (of 6):
Create a new function __memblock_find_range_top_down to factor out of
top-down allocation from memblock_find_in_range_node. This is a
preparation because we will introduce a new bottom-up allocation mode in
the following patch.
Signed-off-by: Tang Chen <tangchen@cn.fujitsu.com>
Signed-off-by: Zhang Yanfei <zhangyanfei@cn.fujitsu.com>
Acked-by: Tejun Heo <tj@kernel.org>
Acked-by: Toshi Kani <toshi.kani@hp.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: "H. Peter Anvin" <hpa@zytor.com>
Cc: Wanpeng Li <liwanp@linux.vnet.ibm.com>
Cc: Thomas Renninger <trenn@suse.de>
Cc: Yinghai Lu <yinghai@kernel.org>
Cc: Jiang Liu <jiang.liu@huawei.com>
Cc: Wen Congyang <wency@cn.fujitsu.com>
Cc: Lai Jiangshan <laijs@cn.fujitsu.com>
Cc: Yasuaki Ishimatsu <isimatu.yasuaki@jp.fujitsu.com>
Cc: Taku Izumi <izumi.taku@jp.fujitsu.com>
Cc: Mel Gorman <mgorman@suse.de>
Cc: Michal Nazarewicz <mina86@mina86.com>
Cc: Minchan Kim <minchan@kernel.org>
Cc: Rik van Riel <riel@redhat.com>
Cc: Johannes Weiner <hannes@cmpxchg.org>
Cc: Kamezawa Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-11-13 00:07:57 +01:00
|
|
|
* Utility called from memblock_find_in_range_node(), find free area top-down.
|
2011-12-08 19:22:09 +01:00
|
|
|
*
|
|
|
|
* RETURNS:
|
2013-11-13 00:07:59 +01:00
|
|
|
* Found address on success, 0 on failure.
|
2010-07-12 06:36:48 +02:00
|
|
|
*/
|
mm/memblock.c: factor out of top-down allocation
[Problem]
The current Linux cannot migrate pages used by the kernel because of the
kernel direct mapping. In Linux kernel space, va = pa + PAGE_OFFSET.
When the pa is changed, we cannot simply update the pagetable and keep the
va unmodified. So the kernel pages are not migratable.
There are also some other issues will cause the kernel pages not
migratable. For example, the physical address may be cached somewhere and
will be used. It is not to update all the caches.
When doing memory hotplug in Linux, we first migrate all the pages in one
memory device somewhere else, and then remove the device. But if pages
are used by the kernel, they are not migratable. As a result, memory used
by the kernel cannot be hot-removed.
Modifying the kernel direct mapping mechanism is too difficult to do. And
it may cause the kernel performance down and unstable. So we use the
following way to do memory hotplug.
[What we are doing]
In Linux, memory in one numa node is divided into several zones. One of
the zones is ZONE_MOVABLE, which the kernel won't use.
In order to implement memory hotplug in Linux, we are going to arrange all
hotpluggable memory in ZONE_MOVABLE so that the kernel won't use these
memory. To do this, we need ACPI's help.
In ACPI, SRAT(System Resource Affinity Table) contains NUMA info. The
memory affinities in SRAT record every memory range in the system, and
also, flags specifying if the memory range is hotpluggable. (Please refer
to ACPI spec 5.0 5.2.16)
With the help of SRAT, we have to do the following two things to achieve our
goal:
1. When doing memory hot-add, allow the users arranging hotpluggable as
ZONE_MOVABLE.
(This has been done by the MOVABLE_NODE functionality in Linux.)
2. when the system is booting, prevent bootmem allocator from allocating
hotpluggable memory for the kernel before the memory initialization
finishes.
The problem 2 is the key problem we are going to solve. But before solving it,
we need some preparation. Please see below.
[Preparation]
Bootloader has to load the kernel image into memory. And this memory must
be unhotpluggable. We cannot prevent this anyway. So in a memory hotplug
system, we can assume any node the kernel resides in is not hotpluggable.
Before SRAT is parsed, we don't know which memory ranges are hotpluggable.
But memblock has already started to work. In the current kernel,
memblock allocates the following memory before SRAT is parsed:
setup_arch()
|->memblock_x86_fill() /* memblock is ready */
|......
|->early_reserve_e820_mpc_new() /* allocate memory under 1MB */
|->reserve_real_mode() /* allocate memory under 1MB */
|->init_mem_mapping() /* allocate page tables, about 2MB to map 1GB memory */
|->dma_contiguous_reserve() /* specified by user, should be low */
|->setup_log_buf() /* specified by user, several mega bytes */
|->relocate_initrd() /* could be large, but will be freed after boot, should reorder */
|->acpi_initrd_override() /* several mega bytes */
|->reserve_crashkernel() /* could be large, should reorder */
|......
|->initmem_init() /* Parse SRAT */
According to Tejun's advice, before SRAT is parsed, we should try our best
to allocate memory near the kernel image. Since the whole node the kernel
resides in won't be hotpluggable, and for a modern server, a node may have
at least 16GB memory, allocating several mega bytes memory around the
kernel image won't cross to hotpluggable memory.
[About this patchset]
So this patchset is the preparation for the problem 2 that we want to
solve. It does the following:
1. Make memblock be able to allocate memory bottom up.
1) Keep all the memblock APIs' prototype unmodified.
2) When the direction is bottom up, keep the start address greater than the
end of kernel image.
2. Improve init_mem_mapping() to support allocate page tables in
bottom up direction.
3. Introduce "movable_node" boot option to enable and disable this
functionality.
This patch (of 6):
Create a new function __memblock_find_range_top_down to factor out of
top-down allocation from memblock_find_in_range_node. This is a
preparation because we will introduce a new bottom-up allocation mode in
the following patch.
Signed-off-by: Tang Chen <tangchen@cn.fujitsu.com>
Signed-off-by: Zhang Yanfei <zhangyanfei@cn.fujitsu.com>
Acked-by: Tejun Heo <tj@kernel.org>
Acked-by: Toshi Kani <toshi.kani@hp.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: "H. Peter Anvin" <hpa@zytor.com>
Cc: Wanpeng Li <liwanp@linux.vnet.ibm.com>
Cc: Thomas Renninger <trenn@suse.de>
Cc: Yinghai Lu <yinghai@kernel.org>
Cc: Jiang Liu <jiang.liu@huawei.com>
Cc: Wen Congyang <wency@cn.fujitsu.com>
Cc: Lai Jiangshan <laijs@cn.fujitsu.com>
Cc: Yasuaki Ishimatsu <isimatu.yasuaki@jp.fujitsu.com>
Cc: Taku Izumi <izumi.taku@jp.fujitsu.com>
Cc: Mel Gorman <mgorman@suse.de>
Cc: Michal Nazarewicz <mina86@mina86.com>
Cc: Minchan Kim <minchan@kernel.org>
Cc: Rik van Riel <riel@redhat.com>
Cc: Johannes Weiner <hannes@cmpxchg.org>
Cc: Kamezawa Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-11-13 00:07:57 +01:00
|
|
|
static phys_addr_t __init_memblock
|
|
|
|
__memblock_find_range_top_down(phys_addr_t start, phys_addr_t end,
|
|
|
|
phys_addr_t size, phys_addr_t align, int nid)
|
2013-02-23 01:33:51 +01:00
|
|
|
{
|
|
|
|
phys_addr_t this_start, this_end, cand;
|
|
|
|
u64 i;
|
|
|
|
|
|
|
|
for_each_free_mem_range_reverse(i, nid, &this_start, &this_end, NULL) {
|
|
|
|
this_start = clamp(this_start, start, end);
|
|
|
|
this_end = clamp(this_end, start, end);
|
|
|
|
|
|
|
|
if (this_end < size)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
cand = round_down(this_end - size, align);
|
|
|
|
if (cand >= this_start)
|
|
|
|
return cand;
|
|
|
|
}
|
mm/memblock.c: factor out of top-down allocation
[Problem]
The current Linux cannot migrate pages used by the kernel because of the
kernel direct mapping. In Linux kernel space, va = pa + PAGE_OFFSET.
When the pa is changed, we cannot simply update the pagetable and keep the
va unmodified. So the kernel pages are not migratable.
There are also some other issues will cause the kernel pages not
migratable. For example, the physical address may be cached somewhere and
will be used. It is not to update all the caches.
When doing memory hotplug in Linux, we first migrate all the pages in one
memory device somewhere else, and then remove the device. But if pages
are used by the kernel, they are not migratable. As a result, memory used
by the kernel cannot be hot-removed.
Modifying the kernel direct mapping mechanism is too difficult to do. And
it may cause the kernel performance down and unstable. So we use the
following way to do memory hotplug.
[What we are doing]
In Linux, memory in one numa node is divided into several zones. One of
the zones is ZONE_MOVABLE, which the kernel won't use.
In order to implement memory hotplug in Linux, we are going to arrange all
hotpluggable memory in ZONE_MOVABLE so that the kernel won't use these
memory. To do this, we need ACPI's help.
In ACPI, SRAT(System Resource Affinity Table) contains NUMA info. The
memory affinities in SRAT record every memory range in the system, and
also, flags specifying if the memory range is hotpluggable. (Please refer
to ACPI spec 5.0 5.2.16)
With the help of SRAT, we have to do the following two things to achieve our
goal:
1. When doing memory hot-add, allow the users arranging hotpluggable as
ZONE_MOVABLE.
(This has been done by the MOVABLE_NODE functionality in Linux.)
2. when the system is booting, prevent bootmem allocator from allocating
hotpluggable memory for the kernel before the memory initialization
finishes.
The problem 2 is the key problem we are going to solve. But before solving it,
we need some preparation. Please see below.
[Preparation]
Bootloader has to load the kernel image into memory. And this memory must
be unhotpluggable. We cannot prevent this anyway. So in a memory hotplug
system, we can assume any node the kernel resides in is not hotpluggable.
Before SRAT is parsed, we don't know which memory ranges are hotpluggable.
But memblock has already started to work. In the current kernel,
memblock allocates the following memory before SRAT is parsed:
setup_arch()
|->memblock_x86_fill() /* memblock is ready */
|......
|->early_reserve_e820_mpc_new() /* allocate memory under 1MB */
|->reserve_real_mode() /* allocate memory under 1MB */
|->init_mem_mapping() /* allocate page tables, about 2MB to map 1GB memory */
|->dma_contiguous_reserve() /* specified by user, should be low */
|->setup_log_buf() /* specified by user, several mega bytes */
|->relocate_initrd() /* could be large, but will be freed after boot, should reorder */
|->acpi_initrd_override() /* several mega bytes */
|->reserve_crashkernel() /* could be large, should reorder */
|......
|->initmem_init() /* Parse SRAT */
According to Tejun's advice, before SRAT is parsed, we should try our best
to allocate memory near the kernel image. Since the whole node the kernel
resides in won't be hotpluggable, and for a modern server, a node may have
at least 16GB memory, allocating several mega bytes memory around the
kernel image won't cross to hotpluggable memory.
[About this patchset]
So this patchset is the preparation for the problem 2 that we want to
solve. It does the following:
1. Make memblock be able to allocate memory bottom up.
1) Keep all the memblock APIs' prototype unmodified.
2) When the direction is bottom up, keep the start address greater than the
end of kernel image.
2. Improve init_mem_mapping() to support allocate page tables in
bottom up direction.
3. Introduce "movable_node" boot option to enable and disable this
functionality.
This patch (of 6):
Create a new function __memblock_find_range_top_down to factor out of
top-down allocation from memblock_find_in_range_node. This is a
preparation because we will introduce a new bottom-up allocation mode in
the following patch.
Signed-off-by: Tang Chen <tangchen@cn.fujitsu.com>
Signed-off-by: Zhang Yanfei <zhangyanfei@cn.fujitsu.com>
Acked-by: Tejun Heo <tj@kernel.org>
Acked-by: Toshi Kani <toshi.kani@hp.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: "H. Peter Anvin" <hpa@zytor.com>
Cc: Wanpeng Li <liwanp@linux.vnet.ibm.com>
Cc: Thomas Renninger <trenn@suse.de>
Cc: Yinghai Lu <yinghai@kernel.org>
Cc: Jiang Liu <jiang.liu@huawei.com>
Cc: Wen Congyang <wency@cn.fujitsu.com>
Cc: Lai Jiangshan <laijs@cn.fujitsu.com>
Cc: Yasuaki Ishimatsu <isimatu.yasuaki@jp.fujitsu.com>
Cc: Taku Izumi <izumi.taku@jp.fujitsu.com>
Cc: Mel Gorman <mgorman@suse.de>
Cc: Michal Nazarewicz <mina86@mina86.com>
Cc: Minchan Kim <minchan@kernel.org>
Cc: Rik van Riel <riel@redhat.com>
Cc: Johannes Weiner <hannes@cmpxchg.org>
Cc: Kamezawa Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-11-13 00:07:57 +01:00
|
|
|
|
2013-02-23 01:33:51 +01:00
|
|
|
return 0;
|
|
|
|
}
|
2010-07-12 06:36:48 +02:00
|
|
|
|
mm/memblock.c: factor out of top-down allocation
[Problem]
The current Linux cannot migrate pages used by the kernel because of the
kernel direct mapping. In Linux kernel space, va = pa + PAGE_OFFSET.
When the pa is changed, we cannot simply update the pagetable and keep the
va unmodified. So the kernel pages are not migratable.
There are also some other issues will cause the kernel pages not
migratable. For example, the physical address may be cached somewhere and
will be used. It is not to update all the caches.
When doing memory hotplug in Linux, we first migrate all the pages in one
memory device somewhere else, and then remove the device. But if pages
are used by the kernel, they are not migratable. As a result, memory used
by the kernel cannot be hot-removed.
Modifying the kernel direct mapping mechanism is too difficult to do. And
it may cause the kernel performance down and unstable. So we use the
following way to do memory hotplug.
[What we are doing]
In Linux, memory in one numa node is divided into several zones. One of
the zones is ZONE_MOVABLE, which the kernel won't use.
In order to implement memory hotplug in Linux, we are going to arrange all
hotpluggable memory in ZONE_MOVABLE so that the kernel won't use these
memory. To do this, we need ACPI's help.
In ACPI, SRAT(System Resource Affinity Table) contains NUMA info. The
memory affinities in SRAT record every memory range in the system, and
also, flags specifying if the memory range is hotpluggable. (Please refer
to ACPI spec 5.0 5.2.16)
With the help of SRAT, we have to do the following two things to achieve our
goal:
1. When doing memory hot-add, allow the users arranging hotpluggable as
ZONE_MOVABLE.
(This has been done by the MOVABLE_NODE functionality in Linux.)
2. when the system is booting, prevent bootmem allocator from allocating
hotpluggable memory for the kernel before the memory initialization
finishes.
The problem 2 is the key problem we are going to solve. But before solving it,
we need some preparation. Please see below.
[Preparation]
Bootloader has to load the kernel image into memory. And this memory must
be unhotpluggable. We cannot prevent this anyway. So in a memory hotplug
system, we can assume any node the kernel resides in is not hotpluggable.
Before SRAT is parsed, we don't know which memory ranges are hotpluggable.
But memblock has already started to work. In the current kernel,
memblock allocates the following memory before SRAT is parsed:
setup_arch()
|->memblock_x86_fill() /* memblock is ready */
|......
|->early_reserve_e820_mpc_new() /* allocate memory under 1MB */
|->reserve_real_mode() /* allocate memory under 1MB */
|->init_mem_mapping() /* allocate page tables, about 2MB to map 1GB memory */
|->dma_contiguous_reserve() /* specified by user, should be low */
|->setup_log_buf() /* specified by user, several mega bytes */
|->relocate_initrd() /* could be large, but will be freed after boot, should reorder */
|->acpi_initrd_override() /* several mega bytes */
|->reserve_crashkernel() /* could be large, should reorder */
|......
|->initmem_init() /* Parse SRAT */
According to Tejun's advice, before SRAT is parsed, we should try our best
to allocate memory near the kernel image. Since the whole node the kernel
resides in won't be hotpluggable, and for a modern server, a node may have
at least 16GB memory, allocating several mega bytes memory around the
kernel image won't cross to hotpluggable memory.
[About this patchset]
So this patchset is the preparation for the problem 2 that we want to
solve. It does the following:
1. Make memblock be able to allocate memory bottom up.
1) Keep all the memblock APIs' prototype unmodified.
2) When the direction is bottom up, keep the start address greater than the
end of kernel image.
2. Improve init_mem_mapping() to support allocate page tables in
bottom up direction.
3. Introduce "movable_node" boot option to enable and disable this
functionality.
This patch (of 6):
Create a new function __memblock_find_range_top_down to factor out of
top-down allocation from memblock_find_in_range_node. This is a
preparation because we will introduce a new bottom-up allocation mode in
the following patch.
Signed-off-by: Tang Chen <tangchen@cn.fujitsu.com>
Signed-off-by: Zhang Yanfei <zhangyanfei@cn.fujitsu.com>
Acked-by: Tejun Heo <tj@kernel.org>
Acked-by: Toshi Kani <toshi.kani@hp.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: "H. Peter Anvin" <hpa@zytor.com>
Cc: Wanpeng Li <liwanp@linux.vnet.ibm.com>
Cc: Thomas Renninger <trenn@suse.de>
Cc: Yinghai Lu <yinghai@kernel.org>
Cc: Jiang Liu <jiang.liu@huawei.com>
Cc: Wen Congyang <wency@cn.fujitsu.com>
Cc: Lai Jiangshan <laijs@cn.fujitsu.com>
Cc: Yasuaki Ishimatsu <isimatu.yasuaki@jp.fujitsu.com>
Cc: Taku Izumi <izumi.taku@jp.fujitsu.com>
Cc: Mel Gorman <mgorman@suse.de>
Cc: Michal Nazarewicz <mina86@mina86.com>
Cc: Minchan Kim <minchan@kernel.org>
Cc: Rik van Riel <riel@redhat.com>
Cc: Johannes Weiner <hannes@cmpxchg.org>
Cc: Kamezawa Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-11-13 00:07:57 +01:00
|
|
|
/**
|
|
|
|
* memblock_find_in_range_node - find free area in given range and node
|
|
|
|
* @size: size of free area to find
|
|
|
|
* @align: alignment of free area to find
|
2014-01-22 00:50:14 +01:00
|
|
|
* @start: start of candidate range
|
|
|
|
* @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
|
2014-01-22 00:50:16 +01:00
|
|
|
* @nid: nid of the free area to find, %NUMA_NO_NODE for any node
|
mm/memblock.c: factor out of top-down allocation
[Problem]
The current Linux cannot migrate pages used by the kernel because of the
kernel direct mapping. In Linux kernel space, va = pa + PAGE_OFFSET.
When the pa is changed, we cannot simply update the pagetable and keep the
va unmodified. So the kernel pages are not migratable.
There are also some other issues will cause the kernel pages not
migratable. For example, the physical address may be cached somewhere and
will be used. It is not to update all the caches.
When doing memory hotplug in Linux, we first migrate all the pages in one
memory device somewhere else, and then remove the device. But if pages
are used by the kernel, they are not migratable. As a result, memory used
by the kernel cannot be hot-removed.
Modifying the kernel direct mapping mechanism is too difficult to do. And
it may cause the kernel performance down and unstable. So we use the
following way to do memory hotplug.
[What we are doing]
In Linux, memory in one numa node is divided into several zones. One of
the zones is ZONE_MOVABLE, which the kernel won't use.
In order to implement memory hotplug in Linux, we are going to arrange all
hotpluggable memory in ZONE_MOVABLE so that the kernel won't use these
memory. To do this, we need ACPI's help.
In ACPI, SRAT(System Resource Affinity Table) contains NUMA info. The
memory affinities in SRAT record every memory range in the system, and
also, flags specifying if the memory range is hotpluggable. (Please refer
to ACPI spec 5.0 5.2.16)
With the help of SRAT, we have to do the following two things to achieve our
goal:
1. When doing memory hot-add, allow the users arranging hotpluggable as
ZONE_MOVABLE.
(This has been done by the MOVABLE_NODE functionality in Linux.)
2. when the system is booting, prevent bootmem allocator from allocating
hotpluggable memory for the kernel before the memory initialization
finishes.
The problem 2 is the key problem we are going to solve. But before solving it,
we need some preparation. Please see below.
[Preparation]
Bootloader has to load the kernel image into memory. And this memory must
be unhotpluggable. We cannot prevent this anyway. So in a memory hotplug
system, we can assume any node the kernel resides in is not hotpluggable.
Before SRAT is parsed, we don't know which memory ranges are hotpluggable.
But memblock has already started to work. In the current kernel,
memblock allocates the following memory before SRAT is parsed:
setup_arch()
|->memblock_x86_fill() /* memblock is ready */
|......
|->early_reserve_e820_mpc_new() /* allocate memory under 1MB */
|->reserve_real_mode() /* allocate memory under 1MB */
|->init_mem_mapping() /* allocate page tables, about 2MB to map 1GB memory */
|->dma_contiguous_reserve() /* specified by user, should be low */
|->setup_log_buf() /* specified by user, several mega bytes */
|->relocate_initrd() /* could be large, but will be freed after boot, should reorder */
|->acpi_initrd_override() /* several mega bytes */
|->reserve_crashkernel() /* could be large, should reorder */
|......
|->initmem_init() /* Parse SRAT */
According to Tejun's advice, before SRAT is parsed, we should try our best
to allocate memory near the kernel image. Since the whole node the kernel
resides in won't be hotpluggable, and for a modern server, a node may have
at least 16GB memory, allocating several mega bytes memory around the
kernel image won't cross to hotpluggable memory.
[About this patchset]
So this patchset is the preparation for the problem 2 that we want to
solve. It does the following:
1. Make memblock be able to allocate memory bottom up.
1) Keep all the memblock APIs' prototype unmodified.
2) When the direction is bottom up, keep the start address greater than the
end of kernel image.
2. Improve init_mem_mapping() to support allocate page tables in
bottom up direction.
3. Introduce "movable_node" boot option to enable and disable this
functionality.
This patch (of 6):
Create a new function __memblock_find_range_top_down to factor out of
top-down allocation from memblock_find_in_range_node. This is a
preparation because we will introduce a new bottom-up allocation mode in
the following patch.
Signed-off-by: Tang Chen <tangchen@cn.fujitsu.com>
Signed-off-by: Zhang Yanfei <zhangyanfei@cn.fujitsu.com>
Acked-by: Tejun Heo <tj@kernel.org>
Acked-by: Toshi Kani <toshi.kani@hp.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: "H. Peter Anvin" <hpa@zytor.com>
Cc: Wanpeng Li <liwanp@linux.vnet.ibm.com>
Cc: Thomas Renninger <trenn@suse.de>
Cc: Yinghai Lu <yinghai@kernel.org>
Cc: Jiang Liu <jiang.liu@huawei.com>
Cc: Wen Congyang <wency@cn.fujitsu.com>
Cc: Lai Jiangshan <laijs@cn.fujitsu.com>
Cc: Yasuaki Ishimatsu <isimatu.yasuaki@jp.fujitsu.com>
Cc: Taku Izumi <izumi.taku@jp.fujitsu.com>
Cc: Mel Gorman <mgorman@suse.de>
Cc: Michal Nazarewicz <mina86@mina86.com>
Cc: Minchan Kim <minchan@kernel.org>
Cc: Rik van Riel <riel@redhat.com>
Cc: Johannes Weiner <hannes@cmpxchg.org>
Cc: Kamezawa Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-11-13 00:07:57 +01:00
|
|
|
*
|
|
|
|
* Find @size free area aligned to @align in the specified range and node.
|
|
|
|
*
|
2013-11-13 00:07:59 +01:00
|
|
|
* When allocation direction is bottom-up, the @start should be greater
|
|
|
|
* than the end of the kernel image. Otherwise, it will be trimmed. The
|
|
|
|
* reason is that we want the bottom-up allocation just near the kernel
|
|
|
|
* image so it is highly likely that the allocated memory and the kernel
|
|
|
|
* will reside in the same node.
|
|
|
|
*
|
|
|
|
* If bottom-up allocation failed, will try to allocate memory top-down.
|
|
|
|
*
|
mm/memblock.c: factor out of top-down allocation
[Problem]
The current Linux cannot migrate pages used by the kernel because of the
kernel direct mapping. In Linux kernel space, va = pa + PAGE_OFFSET.
When the pa is changed, we cannot simply update the pagetable and keep the
va unmodified. So the kernel pages are not migratable.
There are also some other issues will cause the kernel pages not
migratable. For example, the physical address may be cached somewhere and
will be used. It is not to update all the caches.
When doing memory hotplug in Linux, we first migrate all the pages in one
memory device somewhere else, and then remove the device. But if pages
are used by the kernel, they are not migratable. As a result, memory used
by the kernel cannot be hot-removed.
Modifying the kernel direct mapping mechanism is too difficult to do. And
it may cause the kernel performance down and unstable. So we use the
following way to do memory hotplug.
[What we are doing]
In Linux, memory in one numa node is divided into several zones. One of
the zones is ZONE_MOVABLE, which the kernel won't use.
In order to implement memory hotplug in Linux, we are going to arrange all
hotpluggable memory in ZONE_MOVABLE so that the kernel won't use these
memory. To do this, we need ACPI's help.
In ACPI, SRAT(System Resource Affinity Table) contains NUMA info. The
memory affinities in SRAT record every memory range in the system, and
also, flags specifying if the memory range is hotpluggable. (Please refer
to ACPI spec 5.0 5.2.16)
With the help of SRAT, we have to do the following two things to achieve our
goal:
1. When doing memory hot-add, allow the users arranging hotpluggable as
ZONE_MOVABLE.
(This has been done by the MOVABLE_NODE functionality in Linux.)
2. when the system is booting, prevent bootmem allocator from allocating
hotpluggable memory for the kernel before the memory initialization
finishes.
The problem 2 is the key problem we are going to solve. But before solving it,
we need some preparation. Please see below.
[Preparation]
Bootloader has to load the kernel image into memory. And this memory must
be unhotpluggable. We cannot prevent this anyway. So in a memory hotplug
system, we can assume any node the kernel resides in is not hotpluggable.
Before SRAT is parsed, we don't know which memory ranges are hotpluggable.
But memblock has already started to work. In the current kernel,
memblock allocates the following memory before SRAT is parsed:
setup_arch()
|->memblock_x86_fill() /* memblock is ready */
|......
|->early_reserve_e820_mpc_new() /* allocate memory under 1MB */
|->reserve_real_mode() /* allocate memory under 1MB */
|->init_mem_mapping() /* allocate page tables, about 2MB to map 1GB memory */
|->dma_contiguous_reserve() /* specified by user, should be low */
|->setup_log_buf() /* specified by user, several mega bytes */
|->relocate_initrd() /* could be large, but will be freed after boot, should reorder */
|->acpi_initrd_override() /* several mega bytes */
|->reserve_crashkernel() /* could be large, should reorder */
|......
|->initmem_init() /* Parse SRAT */
According to Tejun's advice, before SRAT is parsed, we should try our best
to allocate memory near the kernel image. Since the whole node the kernel
resides in won't be hotpluggable, and for a modern server, a node may have
at least 16GB memory, allocating several mega bytes memory around the
kernel image won't cross to hotpluggable memory.
[About this patchset]
So this patchset is the preparation for the problem 2 that we want to
solve. It does the following:
1. Make memblock be able to allocate memory bottom up.
1) Keep all the memblock APIs' prototype unmodified.
2) When the direction is bottom up, keep the start address greater than the
end of kernel image.
2. Improve init_mem_mapping() to support allocate page tables in
bottom up direction.
3. Introduce "movable_node" boot option to enable and disable this
functionality.
This patch (of 6):
Create a new function __memblock_find_range_top_down to factor out of
top-down allocation from memblock_find_in_range_node. This is a
preparation because we will introduce a new bottom-up allocation mode in
the following patch.
Signed-off-by: Tang Chen <tangchen@cn.fujitsu.com>
Signed-off-by: Zhang Yanfei <zhangyanfei@cn.fujitsu.com>
Acked-by: Tejun Heo <tj@kernel.org>
Acked-by: Toshi Kani <toshi.kani@hp.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: "H. Peter Anvin" <hpa@zytor.com>
Cc: Wanpeng Li <liwanp@linux.vnet.ibm.com>
Cc: Thomas Renninger <trenn@suse.de>
Cc: Yinghai Lu <yinghai@kernel.org>
Cc: Jiang Liu <jiang.liu@huawei.com>
Cc: Wen Congyang <wency@cn.fujitsu.com>
Cc: Lai Jiangshan <laijs@cn.fujitsu.com>
Cc: Yasuaki Ishimatsu <isimatu.yasuaki@jp.fujitsu.com>
Cc: Taku Izumi <izumi.taku@jp.fujitsu.com>
Cc: Mel Gorman <mgorman@suse.de>
Cc: Michal Nazarewicz <mina86@mina86.com>
Cc: Minchan Kim <minchan@kernel.org>
Cc: Rik van Riel <riel@redhat.com>
Cc: Johannes Weiner <hannes@cmpxchg.org>
Cc: Kamezawa Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-11-13 00:07:57 +01:00
|
|
|
* RETURNS:
|
2013-11-13 00:07:59 +01:00
|
|
|
* Found address on success, 0 on failure.
|
mm/memblock.c: factor out of top-down allocation
[Problem]
The current Linux cannot migrate pages used by the kernel because of the
kernel direct mapping. In Linux kernel space, va = pa + PAGE_OFFSET.
When the pa is changed, we cannot simply update the pagetable and keep the
va unmodified. So the kernel pages are not migratable.
There are also some other issues will cause the kernel pages not
migratable. For example, the physical address may be cached somewhere and
will be used. It is not to update all the caches.
When doing memory hotplug in Linux, we first migrate all the pages in one
memory device somewhere else, and then remove the device. But if pages
are used by the kernel, they are not migratable. As a result, memory used
by the kernel cannot be hot-removed.
Modifying the kernel direct mapping mechanism is too difficult to do. And
it may cause the kernel performance down and unstable. So we use the
following way to do memory hotplug.
[What we are doing]
In Linux, memory in one numa node is divided into several zones. One of
the zones is ZONE_MOVABLE, which the kernel won't use.
In order to implement memory hotplug in Linux, we are going to arrange all
hotpluggable memory in ZONE_MOVABLE so that the kernel won't use these
memory. To do this, we need ACPI's help.
In ACPI, SRAT(System Resource Affinity Table) contains NUMA info. The
memory affinities in SRAT record every memory range in the system, and
also, flags specifying if the memory range is hotpluggable. (Please refer
to ACPI spec 5.0 5.2.16)
With the help of SRAT, we have to do the following two things to achieve our
goal:
1. When doing memory hot-add, allow the users arranging hotpluggable as
ZONE_MOVABLE.
(This has been done by the MOVABLE_NODE functionality in Linux.)
2. when the system is booting, prevent bootmem allocator from allocating
hotpluggable memory for the kernel before the memory initialization
finishes.
The problem 2 is the key problem we are going to solve. But before solving it,
we need some preparation. Please see below.
[Preparation]
Bootloader has to load the kernel image into memory. And this memory must
be unhotpluggable. We cannot prevent this anyway. So in a memory hotplug
system, we can assume any node the kernel resides in is not hotpluggable.
Before SRAT is parsed, we don't know which memory ranges are hotpluggable.
But memblock has already started to work. In the current kernel,
memblock allocates the following memory before SRAT is parsed:
setup_arch()
|->memblock_x86_fill() /* memblock is ready */
|......
|->early_reserve_e820_mpc_new() /* allocate memory under 1MB */
|->reserve_real_mode() /* allocate memory under 1MB */
|->init_mem_mapping() /* allocate page tables, about 2MB to map 1GB memory */
|->dma_contiguous_reserve() /* specified by user, should be low */
|->setup_log_buf() /* specified by user, several mega bytes */
|->relocate_initrd() /* could be large, but will be freed after boot, should reorder */
|->acpi_initrd_override() /* several mega bytes */
|->reserve_crashkernel() /* could be large, should reorder */
|......
|->initmem_init() /* Parse SRAT */
According to Tejun's advice, before SRAT is parsed, we should try our best
to allocate memory near the kernel image. Since the whole node the kernel
resides in won't be hotpluggable, and for a modern server, a node may have
at least 16GB memory, allocating several mega bytes memory around the
kernel image won't cross to hotpluggable memory.
[About this patchset]
So this patchset is the preparation for the problem 2 that we want to
solve. It does the following:
1. Make memblock be able to allocate memory bottom up.
1) Keep all the memblock APIs' prototype unmodified.
2) When the direction is bottom up, keep the start address greater than the
end of kernel image.
2. Improve init_mem_mapping() to support allocate page tables in
bottom up direction.
3. Introduce "movable_node" boot option to enable and disable this
functionality.
This patch (of 6):
Create a new function __memblock_find_range_top_down to factor out of
top-down allocation from memblock_find_in_range_node. This is a
preparation because we will introduce a new bottom-up allocation mode in
the following patch.
Signed-off-by: Tang Chen <tangchen@cn.fujitsu.com>
Signed-off-by: Zhang Yanfei <zhangyanfei@cn.fujitsu.com>
Acked-by: Tejun Heo <tj@kernel.org>
Acked-by: Toshi Kani <toshi.kani@hp.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: "H. Peter Anvin" <hpa@zytor.com>
Cc: Wanpeng Li <liwanp@linux.vnet.ibm.com>
Cc: Thomas Renninger <trenn@suse.de>
Cc: Yinghai Lu <yinghai@kernel.org>
Cc: Jiang Liu <jiang.liu@huawei.com>
Cc: Wen Congyang <wency@cn.fujitsu.com>
Cc: Lai Jiangshan <laijs@cn.fujitsu.com>
Cc: Yasuaki Ishimatsu <isimatu.yasuaki@jp.fujitsu.com>
Cc: Taku Izumi <izumi.taku@jp.fujitsu.com>
Cc: Mel Gorman <mgorman@suse.de>
Cc: Michal Nazarewicz <mina86@mina86.com>
Cc: Minchan Kim <minchan@kernel.org>
Cc: Rik van Riel <riel@redhat.com>
Cc: Johannes Weiner <hannes@cmpxchg.org>
Cc: Kamezawa Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-11-13 00:07:57 +01:00
|
|
|
*/
|
2014-01-22 00:50:14 +01:00
|
|
|
phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t size,
|
|
|
|
phys_addr_t align, phys_addr_t start,
|
|
|
|
phys_addr_t end, int nid)
|
mm/memblock.c: factor out of top-down allocation
[Problem]
The current Linux cannot migrate pages used by the kernel because of the
kernel direct mapping. In Linux kernel space, va = pa + PAGE_OFFSET.
When the pa is changed, we cannot simply update the pagetable and keep the
va unmodified. So the kernel pages are not migratable.
There are also some other issues will cause the kernel pages not
migratable. For example, the physical address may be cached somewhere and
will be used. It is not to update all the caches.
When doing memory hotplug in Linux, we first migrate all the pages in one
memory device somewhere else, and then remove the device. But if pages
are used by the kernel, they are not migratable. As a result, memory used
by the kernel cannot be hot-removed.
Modifying the kernel direct mapping mechanism is too difficult to do. And
it may cause the kernel performance down and unstable. So we use the
following way to do memory hotplug.
[What we are doing]
In Linux, memory in one numa node is divided into several zones. One of
the zones is ZONE_MOVABLE, which the kernel won't use.
In order to implement memory hotplug in Linux, we are going to arrange all
hotpluggable memory in ZONE_MOVABLE so that the kernel won't use these
memory. To do this, we need ACPI's help.
In ACPI, SRAT(System Resource Affinity Table) contains NUMA info. The
memory affinities in SRAT record every memory range in the system, and
also, flags specifying if the memory range is hotpluggable. (Please refer
to ACPI spec 5.0 5.2.16)
With the help of SRAT, we have to do the following two things to achieve our
goal:
1. When doing memory hot-add, allow the users arranging hotpluggable as
ZONE_MOVABLE.
(This has been done by the MOVABLE_NODE functionality in Linux.)
2. when the system is booting, prevent bootmem allocator from allocating
hotpluggable memory for the kernel before the memory initialization
finishes.
The problem 2 is the key problem we are going to solve. But before solving it,
we need some preparation. Please see below.
[Preparation]
Bootloader has to load the kernel image into memory. And this memory must
be unhotpluggable. We cannot prevent this anyway. So in a memory hotplug
system, we can assume any node the kernel resides in is not hotpluggable.
Before SRAT is parsed, we don't know which memory ranges are hotpluggable.
But memblock has already started to work. In the current kernel,
memblock allocates the following memory before SRAT is parsed:
setup_arch()
|->memblock_x86_fill() /* memblock is ready */
|......
|->early_reserve_e820_mpc_new() /* allocate memory under 1MB */
|->reserve_real_mode() /* allocate memory under 1MB */
|->init_mem_mapping() /* allocate page tables, about 2MB to map 1GB memory */
|->dma_contiguous_reserve() /* specified by user, should be low */
|->setup_log_buf() /* specified by user, several mega bytes */
|->relocate_initrd() /* could be large, but will be freed after boot, should reorder */
|->acpi_initrd_override() /* several mega bytes */
|->reserve_crashkernel() /* could be large, should reorder */
|......
|->initmem_init() /* Parse SRAT */
According to Tejun's advice, before SRAT is parsed, we should try our best
to allocate memory near the kernel image. Since the whole node the kernel
resides in won't be hotpluggable, and for a modern server, a node may have
at least 16GB memory, allocating several mega bytes memory around the
kernel image won't cross to hotpluggable memory.
[About this patchset]
So this patchset is the preparation for the problem 2 that we want to
solve. It does the following:
1. Make memblock be able to allocate memory bottom up.
1) Keep all the memblock APIs' prototype unmodified.
2) When the direction is bottom up, keep the start address greater than the
end of kernel image.
2. Improve init_mem_mapping() to support allocate page tables in
bottom up direction.
3. Introduce "movable_node" boot option to enable and disable this
functionality.
This patch (of 6):
Create a new function __memblock_find_range_top_down to factor out of
top-down allocation from memblock_find_in_range_node. This is a
preparation because we will introduce a new bottom-up allocation mode in
the following patch.
Signed-off-by: Tang Chen <tangchen@cn.fujitsu.com>
Signed-off-by: Zhang Yanfei <zhangyanfei@cn.fujitsu.com>
Acked-by: Tejun Heo <tj@kernel.org>
Acked-by: Toshi Kani <toshi.kani@hp.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: "H. Peter Anvin" <hpa@zytor.com>
Cc: Wanpeng Li <liwanp@linux.vnet.ibm.com>
Cc: Thomas Renninger <trenn@suse.de>
Cc: Yinghai Lu <yinghai@kernel.org>
Cc: Jiang Liu <jiang.liu@huawei.com>
Cc: Wen Congyang <wency@cn.fujitsu.com>
Cc: Lai Jiangshan <laijs@cn.fujitsu.com>
Cc: Yasuaki Ishimatsu <isimatu.yasuaki@jp.fujitsu.com>
Cc: Taku Izumi <izumi.taku@jp.fujitsu.com>
Cc: Mel Gorman <mgorman@suse.de>
Cc: Michal Nazarewicz <mina86@mina86.com>
Cc: Minchan Kim <minchan@kernel.org>
Cc: Rik van Riel <riel@redhat.com>
Cc: Johannes Weiner <hannes@cmpxchg.org>
Cc: Kamezawa Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-11-13 00:07:57 +01:00
|
|
|
{
|
2013-11-13 00:07:59 +01:00
|
|
|
int ret;
|
|
|
|
phys_addr_t kernel_end;
|
|
|
|
|
mm/memblock.c: factor out of top-down allocation
[Problem]
The current Linux cannot migrate pages used by the kernel because of the
kernel direct mapping. In Linux kernel space, va = pa + PAGE_OFFSET.
When the pa is changed, we cannot simply update the pagetable and keep the
va unmodified. So the kernel pages are not migratable.
There are also some other issues will cause the kernel pages not
migratable. For example, the physical address may be cached somewhere and
will be used. It is not to update all the caches.
When doing memory hotplug in Linux, we first migrate all the pages in one
memory device somewhere else, and then remove the device. But if pages
are used by the kernel, they are not migratable. As a result, memory used
by the kernel cannot be hot-removed.
Modifying the kernel direct mapping mechanism is too difficult to do. And
it may cause the kernel performance down and unstable. So we use the
following way to do memory hotplug.
[What we are doing]
In Linux, memory in one numa node is divided into several zones. One of
the zones is ZONE_MOVABLE, which the kernel won't use.
In order to implement memory hotplug in Linux, we are going to arrange all
hotpluggable memory in ZONE_MOVABLE so that the kernel won't use these
memory. To do this, we need ACPI's help.
In ACPI, SRAT(System Resource Affinity Table) contains NUMA info. The
memory affinities in SRAT record every memory range in the system, and
also, flags specifying if the memory range is hotpluggable. (Please refer
to ACPI spec 5.0 5.2.16)
With the help of SRAT, we have to do the following two things to achieve our
goal:
1. When doing memory hot-add, allow the users arranging hotpluggable as
ZONE_MOVABLE.
(This has been done by the MOVABLE_NODE functionality in Linux.)
2. when the system is booting, prevent bootmem allocator from allocating
hotpluggable memory for the kernel before the memory initialization
finishes.
The problem 2 is the key problem we are going to solve. But before solving it,
we need some preparation. Please see below.
[Preparation]
Bootloader has to load the kernel image into memory. And this memory must
be unhotpluggable. We cannot prevent this anyway. So in a memory hotplug
system, we can assume any node the kernel resides in is not hotpluggable.
Before SRAT is parsed, we don't know which memory ranges are hotpluggable.
But memblock has already started to work. In the current kernel,
memblock allocates the following memory before SRAT is parsed:
setup_arch()
|->memblock_x86_fill() /* memblock is ready */
|......
|->early_reserve_e820_mpc_new() /* allocate memory under 1MB */
|->reserve_real_mode() /* allocate memory under 1MB */
|->init_mem_mapping() /* allocate page tables, about 2MB to map 1GB memory */
|->dma_contiguous_reserve() /* specified by user, should be low */
|->setup_log_buf() /* specified by user, several mega bytes */
|->relocate_initrd() /* could be large, but will be freed after boot, should reorder */
|->acpi_initrd_override() /* several mega bytes */
|->reserve_crashkernel() /* could be large, should reorder */
|......
|->initmem_init() /* Parse SRAT */
According to Tejun's advice, before SRAT is parsed, we should try our best
to allocate memory near the kernel image. Since the whole node the kernel
resides in won't be hotpluggable, and for a modern server, a node may have
at least 16GB memory, allocating several mega bytes memory around the
kernel image won't cross to hotpluggable memory.
[About this patchset]
So this patchset is the preparation for the problem 2 that we want to
solve. It does the following:
1. Make memblock be able to allocate memory bottom up.
1) Keep all the memblock APIs' prototype unmodified.
2) When the direction is bottom up, keep the start address greater than the
end of kernel image.
2. Improve init_mem_mapping() to support allocate page tables in
bottom up direction.
3. Introduce "movable_node" boot option to enable and disable this
functionality.
This patch (of 6):
Create a new function __memblock_find_range_top_down to factor out of
top-down allocation from memblock_find_in_range_node. This is a
preparation because we will introduce a new bottom-up allocation mode in
the following patch.
Signed-off-by: Tang Chen <tangchen@cn.fujitsu.com>
Signed-off-by: Zhang Yanfei <zhangyanfei@cn.fujitsu.com>
Acked-by: Tejun Heo <tj@kernel.org>
Acked-by: Toshi Kani <toshi.kani@hp.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: "H. Peter Anvin" <hpa@zytor.com>
Cc: Wanpeng Li <liwanp@linux.vnet.ibm.com>
Cc: Thomas Renninger <trenn@suse.de>
Cc: Yinghai Lu <yinghai@kernel.org>
Cc: Jiang Liu <jiang.liu@huawei.com>
Cc: Wen Congyang <wency@cn.fujitsu.com>
Cc: Lai Jiangshan <laijs@cn.fujitsu.com>
Cc: Yasuaki Ishimatsu <isimatu.yasuaki@jp.fujitsu.com>
Cc: Taku Izumi <izumi.taku@jp.fujitsu.com>
Cc: Mel Gorman <mgorman@suse.de>
Cc: Michal Nazarewicz <mina86@mina86.com>
Cc: Minchan Kim <minchan@kernel.org>
Cc: Rik van Riel <riel@redhat.com>
Cc: Johannes Weiner <hannes@cmpxchg.org>
Cc: Kamezawa Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-11-13 00:07:57 +01:00
|
|
|
/* pump up @end */
|
|
|
|
if (end == MEMBLOCK_ALLOC_ACCESSIBLE)
|
|
|
|
end = memblock.current_limit;
|
|
|
|
|
|
|
|
/* avoid allocating the first page */
|
|
|
|
start = max_t(phys_addr_t, start, PAGE_SIZE);
|
|
|
|
end = max(start, end);
|
2013-11-13 00:07:59 +01:00
|
|
|
kernel_end = __pa_symbol(_end);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* try bottom-up allocation only when bottom-up mode
|
|
|
|
* is set and @end is above the kernel image.
|
|
|
|
*/
|
|
|
|
if (memblock_bottom_up() && end > kernel_end) {
|
|
|
|
phys_addr_t bottom_up_start;
|
|
|
|
|
|
|
|
/* make sure we will allocate above the kernel */
|
|
|
|
bottom_up_start = max(start, kernel_end);
|
|
|
|
|
|
|
|
/* ok, try bottom-up allocation first */
|
|
|
|
ret = __memblock_find_range_bottom_up(bottom_up_start, end,
|
|
|
|
size, align, nid);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* we always limit bottom-up allocation above the kernel,
|
|
|
|
* but top-down allocation doesn't have the limit, so
|
|
|
|
* retrying top-down allocation may succeed when bottom-up
|
|
|
|
* allocation failed.
|
|
|
|
*
|
|
|
|
* bottom-up allocation is expected to be fail very rarely,
|
|
|
|
* so we use WARN_ONCE() here to see the stack trace if
|
|
|
|
* fail happens.
|
|
|
|
*/
|
|
|
|
WARN_ONCE(1, "memblock: bottom-up allocation failed, "
|
|
|
|
"memory hotunplug may be affected\n");
|
|
|
|
}
|
mm/memblock.c: factor out of top-down allocation
[Problem]
The current Linux cannot migrate pages used by the kernel because of the
kernel direct mapping. In Linux kernel space, va = pa + PAGE_OFFSET.
When the pa is changed, we cannot simply update the pagetable and keep the
va unmodified. So the kernel pages are not migratable.
There are also some other issues will cause the kernel pages not
migratable. For example, the physical address may be cached somewhere and
will be used. It is not to update all the caches.
When doing memory hotplug in Linux, we first migrate all the pages in one
memory device somewhere else, and then remove the device. But if pages
are used by the kernel, they are not migratable. As a result, memory used
by the kernel cannot be hot-removed.
Modifying the kernel direct mapping mechanism is too difficult to do. And
it may cause the kernel performance down and unstable. So we use the
following way to do memory hotplug.
[What we are doing]
In Linux, memory in one numa node is divided into several zones. One of
the zones is ZONE_MOVABLE, which the kernel won't use.
In order to implement memory hotplug in Linux, we are going to arrange all
hotpluggable memory in ZONE_MOVABLE so that the kernel won't use these
memory. To do this, we need ACPI's help.
In ACPI, SRAT(System Resource Affinity Table) contains NUMA info. The
memory affinities in SRAT record every memory range in the system, and
also, flags specifying if the memory range is hotpluggable. (Please refer
to ACPI spec 5.0 5.2.16)
With the help of SRAT, we have to do the following two things to achieve our
goal:
1. When doing memory hot-add, allow the users arranging hotpluggable as
ZONE_MOVABLE.
(This has been done by the MOVABLE_NODE functionality in Linux.)
2. when the system is booting, prevent bootmem allocator from allocating
hotpluggable memory for the kernel before the memory initialization
finishes.
The problem 2 is the key problem we are going to solve. But before solving it,
we need some preparation. Please see below.
[Preparation]
Bootloader has to load the kernel image into memory. And this memory must
be unhotpluggable. We cannot prevent this anyway. So in a memory hotplug
system, we can assume any node the kernel resides in is not hotpluggable.
Before SRAT is parsed, we don't know which memory ranges are hotpluggable.
But memblock has already started to work. In the current kernel,
memblock allocates the following memory before SRAT is parsed:
setup_arch()
|->memblock_x86_fill() /* memblock is ready */
|......
|->early_reserve_e820_mpc_new() /* allocate memory under 1MB */
|->reserve_real_mode() /* allocate memory under 1MB */
|->init_mem_mapping() /* allocate page tables, about 2MB to map 1GB memory */
|->dma_contiguous_reserve() /* specified by user, should be low */
|->setup_log_buf() /* specified by user, several mega bytes */
|->relocate_initrd() /* could be large, but will be freed after boot, should reorder */
|->acpi_initrd_override() /* several mega bytes */
|->reserve_crashkernel() /* could be large, should reorder */
|......
|->initmem_init() /* Parse SRAT */
According to Tejun's advice, before SRAT is parsed, we should try our best
to allocate memory near the kernel image. Since the whole node the kernel
resides in won't be hotpluggable, and for a modern server, a node may have
at least 16GB memory, allocating several mega bytes memory around the
kernel image won't cross to hotpluggable memory.
[About this patchset]
So this patchset is the preparation for the problem 2 that we want to
solve. It does the following:
1. Make memblock be able to allocate memory bottom up.
1) Keep all the memblock APIs' prototype unmodified.
2) When the direction is bottom up, keep the start address greater than the
end of kernel image.
2. Improve init_mem_mapping() to support allocate page tables in
bottom up direction.
3. Introduce "movable_node" boot option to enable and disable this
functionality.
This patch (of 6):
Create a new function __memblock_find_range_top_down to factor out of
top-down allocation from memblock_find_in_range_node. This is a
preparation because we will introduce a new bottom-up allocation mode in
the following patch.
Signed-off-by: Tang Chen <tangchen@cn.fujitsu.com>
Signed-off-by: Zhang Yanfei <zhangyanfei@cn.fujitsu.com>
Acked-by: Tejun Heo <tj@kernel.org>
Acked-by: Toshi Kani <toshi.kani@hp.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: "H. Peter Anvin" <hpa@zytor.com>
Cc: Wanpeng Li <liwanp@linux.vnet.ibm.com>
Cc: Thomas Renninger <trenn@suse.de>
Cc: Yinghai Lu <yinghai@kernel.org>
Cc: Jiang Liu <jiang.liu@huawei.com>
Cc: Wen Congyang <wency@cn.fujitsu.com>
Cc: Lai Jiangshan <laijs@cn.fujitsu.com>
Cc: Yasuaki Ishimatsu <isimatu.yasuaki@jp.fujitsu.com>
Cc: Taku Izumi <izumi.taku@jp.fujitsu.com>
Cc: Mel Gorman <mgorman@suse.de>
Cc: Michal Nazarewicz <mina86@mina86.com>
Cc: Minchan Kim <minchan@kernel.org>
Cc: Rik van Riel <riel@redhat.com>
Cc: Johannes Weiner <hannes@cmpxchg.org>
Cc: Kamezawa Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-11-13 00:07:57 +01:00
|
|
|
|
|
|
|
return __memblock_find_range_top_down(start, end, size, align, nid);
|
|
|
|
}
|
|
|
|
|
2011-12-08 19:22:09 +01:00
|
|
|
/**
|
|
|
|
* memblock_find_in_range - find free area in given range
|
|
|
|
* @start: start of candidate range
|
|
|
|
* @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
|
|
|
|
* @size: size of free area to find
|
|
|
|
* @align: alignment of free area to find
|
|
|
|
*
|
|
|
|
* Find @size free area aligned to @align in the specified range.
|
|
|
|
*
|
|
|
|
* RETURNS:
|
2013-11-13 00:07:59 +01:00
|
|
|
* Found address on success, 0 on failure.
|
2011-07-12 09:58:10 +02:00
|
|
|
*/
|
2011-12-08 19:22:09 +01:00
|
|
|
phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start,
|
|
|
|
phys_addr_t end, phys_addr_t size,
|
|
|
|
phys_addr_t align)
|
2010-07-12 06:36:48 +02:00
|
|
|
{
|
2014-01-22 00:50:14 +01:00
|
|
|
return memblock_find_in_range_node(size, align, start, end,
|
2014-01-22 00:50:16 +01:00
|
|
|
NUMA_NO_NODE);
|
2010-07-12 06:36:48 +02:00
|
|
|
}
|
|
|
|
|
2010-07-28 07:43:02 +02:00
|
|
|
static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r)
|
2010-07-12 06:36:09 +02:00
|
|
|
{
|
2011-12-08 19:22:08 +01:00
|
|
|
type->total_size -= type->regions[r].size;
|
2011-07-14 11:43:42 +02:00
|
|
|
memmove(&type->regions[r], &type->regions[r + 1],
|
|
|
|
(type->cnt - (r + 1)) * sizeof(type->regions[r]));
|
2010-08-04 06:06:41 +02:00
|
|
|
type->cnt--;
|
2010-07-12 06:36:09 +02:00
|
|
|
|
mm/memblock: properly handle overlaps and fix error path
Currently memblock_reserve() or memblock_free() don't handle overlaps of
any kind. There is some special casing for coalescing exactly adjacent
regions but that's about it.
This is annoying because typically memblock_reserve() is used to mark
regions passed by the firmware as reserved and we all know how much we can
trust our firmwares...
Also, with the current code, if we do something it doesn't handle right
such as trying to memblock_reserve() a large range spanning multiple
existing smaller reserved regions for example, or doing overlapping
reservations, it can silently corrupt the internal region array, causing
odd errors much later on, such as allocations returning reserved regions
etc...
This patch rewrites the underlying functions that add or remove a region
to the arrays. The new code is a lot more robust as it fully handles
overlapping regions. It's also, imho, simpler than the previous
implementation.
In addition, while doing so, I found a bug where if we fail to double the
array while adding a region, we would remove the last region of the array
rather than the region we just allocated. This fixes it too.
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Acked-by: Yinghai Lu <yinghai@kernel.org>
Cc: Ingo Molnar <mingo@elte.hu>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-03-23 00:33:43 +01:00
|
|
|
/* Special case for empty arrays */
|
|
|
|
if (type->cnt == 0) {
|
2011-12-08 19:22:08 +01:00
|
|
|
WARN_ON(type->total_size != 0);
|
mm/memblock: properly handle overlaps and fix error path
Currently memblock_reserve() or memblock_free() don't handle overlaps of
any kind. There is some special casing for coalescing exactly adjacent
regions but that's about it.
This is annoying because typically memblock_reserve() is used to mark
regions passed by the firmware as reserved and we all know how much we can
trust our firmwares...
Also, with the current code, if we do something it doesn't handle right
such as trying to memblock_reserve() a large range spanning multiple
existing smaller reserved regions for example, or doing overlapping
reservations, it can silently corrupt the internal region array, causing
odd errors much later on, such as allocations returning reserved regions
etc...
This patch rewrites the underlying functions that add or remove a region
to the arrays. The new code is a lot more robust as it fully handles
overlapping regions. It's also, imho, simpler than the previous
implementation.
In addition, while doing so, I found a bug where if we fail to double the
array while adding a region, we would remove the last region of the array
rather than the region we just allocated. This fixes it too.
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Acked-by: Yinghai Lu <yinghai@kernel.org>
Cc: Ingo Molnar <mingo@elte.hu>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-03-23 00:33:43 +01:00
|
|
|
type->cnt = 1;
|
|
|
|
type->regions[0].base = 0;
|
|
|
|
type->regions[0].size = 0;
|
2014-01-22 00:49:20 +01:00
|
|
|
type->regions[0].flags = 0;
|
2011-07-14 11:43:42 +02:00
|
|
|
memblock_set_region_node(&type->regions[0], MAX_NUMNODES);
|
mm/memblock: properly handle overlaps and fix error path
Currently memblock_reserve() or memblock_free() don't handle overlaps of
any kind. There is some special casing for coalescing exactly adjacent
regions but that's about it.
This is annoying because typically memblock_reserve() is used to mark
regions passed by the firmware as reserved and we all know how much we can
trust our firmwares...
Also, with the current code, if we do something it doesn't handle right
such as trying to memblock_reserve() a large range spanning multiple
existing smaller reserved regions for example, or doing overlapping
reservations, it can silently corrupt the internal region array, causing
odd errors much later on, such as allocations returning reserved regions
etc...
This patch rewrites the underlying functions that add or remove a region
to the arrays. The new code is a lot more robust as it fully handles
overlapping regions. It's also, imho, simpler than the previous
implementation.
In addition, while doing so, I found a bug where if we fail to double the
array while adding a region, we would remove the last region of the array
rather than the region we just allocated. This fixes it too.
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Acked-by: Yinghai Lu <yinghai@kernel.org>
Cc: Ingo Molnar <mingo@elte.hu>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-03-23 00:33:43 +01:00
|
|
|
}
|
2010-07-12 06:36:09 +02:00
|
|
|
}
|
|
|
|
|
2014-01-24 00:53:24 +01:00
|
|
|
#ifdef CONFIG_ARCH_DISCARD_MEMBLOCK
|
|
|
|
|
2012-07-11 23:02:56 +02:00
|
|
|
phys_addr_t __init_memblock get_allocated_memblock_reserved_regions_info(
|
|
|
|
phys_addr_t *addr)
|
|
|
|
{
|
|
|
|
if (memblock.reserved.regions == memblock_reserved_init_regions)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
*addr = __pa(memblock.reserved.regions);
|
|
|
|
|
|
|
|
return PAGE_ALIGN(sizeof(struct memblock_region) *
|
|
|
|
memblock.reserved.max);
|
|
|
|
}
|
|
|
|
|
2014-01-24 00:53:11 +01:00
|
|
|
phys_addr_t __init_memblock get_allocated_memblock_memory_regions_info(
|
|
|
|
phys_addr_t *addr)
|
|
|
|
{
|
|
|
|
if (memblock.memory.regions == memblock_memory_init_regions)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
*addr = __pa(memblock.memory.regions);
|
|
|
|
|
|
|
|
return PAGE_ALIGN(sizeof(struct memblock_region) *
|
|
|
|
memblock.memory.max);
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
2012-06-20 21:53:05 +02:00
|
|
|
/**
|
|
|
|
* memblock_double_array - double the size of the memblock regions array
|
|
|
|
* @type: memblock type of the regions array being doubled
|
|
|
|
* @new_area_start: starting address of memory range to avoid overlap with
|
|
|
|
* @new_area_size: size of memory range to avoid overlap with
|
|
|
|
*
|
|
|
|
* Double the size of the @type regions array. If memblock is being used to
|
|
|
|
* allocate memory for a new reserved regions array and there is a previously
|
|
|
|
* allocated memory range [@new_area_start,@new_area_start+@new_area_size]
|
|
|
|
* waiting to be reserved, ensure the memory used by the new array does
|
|
|
|
* not overlap.
|
|
|
|
*
|
|
|
|
* RETURNS:
|
|
|
|
* 0 on success, -1 on failure.
|
|
|
|
*/
|
|
|
|
static int __init_memblock memblock_double_array(struct memblock_type *type,
|
|
|
|
phys_addr_t new_area_start,
|
|
|
|
phys_addr_t new_area_size)
|
2010-07-07 00:39:13 +02:00
|
|
|
{
|
|
|
|
struct memblock_region *new_array, *old_array;
|
2012-07-11 23:02:56 +02:00
|
|
|
phys_addr_t old_alloc_size, new_alloc_size;
|
2010-07-07 00:39:13 +02:00
|
|
|
phys_addr_t old_size, new_size, addr;
|
|
|
|
int use_slab = slab_is_available();
|
2012-05-30 00:06:50 +02:00
|
|
|
int *in_slab;
|
2010-07-07 00:39:13 +02:00
|
|
|
|
|
|
|
/* We don't allow resizing until we know about the reserved regions
|
|
|
|
* of memory that aren't suitable for allocation
|
|
|
|
*/
|
|
|
|
if (!memblock_can_resize)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
/* Calculate new doubled size */
|
|
|
|
old_size = type->max * sizeof(struct memblock_region);
|
|
|
|
new_size = old_size << 1;
|
2012-07-11 23:02:56 +02:00
|
|
|
/*
|
|
|
|
* We need to allocated new one align to PAGE_SIZE,
|
|
|
|
* so we can free them completely later.
|
|
|
|
*/
|
|
|
|
old_alloc_size = PAGE_ALIGN(old_size);
|
|
|
|
new_alloc_size = PAGE_ALIGN(new_size);
|
2010-07-07 00:39:13 +02:00
|
|
|
|
2012-05-30 00:06:50 +02:00
|
|
|
/* Retrieve the slab flag */
|
|
|
|
if (type == &memblock.memory)
|
|
|
|
in_slab = &memblock_memory_in_slab;
|
|
|
|
else
|
|
|
|
in_slab = &memblock_reserved_in_slab;
|
|
|
|
|
2010-07-07 00:39:13 +02:00
|
|
|
/* Try to find some space for it.
|
|
|
|
*
|
|
|
|
* WARNING: We assume that either slab_is_available() and we use it or
|
2012-08-01 01:42:40 +02:00
|
|
|
* we use MEMBLOCK for allocations. That means that this is unsafe to
|
|
|
|
* use when bootmem is currently active (unless bootmem itself is
|
|
|
|
* implemented on top of MEMBLOCK which isn't the case yet)
|
2010-07-07 00:39:13 +02:00
|
|
|
*
|
|
|
|
* This should however not be an issue for now, as we currently only
|
2012-08-01 01:42:40 +02:00
|
|
|
* call into MEMBLOCK while it's still active, or much later when slab
|
|
|
|
* is active for memory hotplug operations
|
2010-07-07 00:39:13 +02:00
|
|
|
*/
|
|
|
|
if (use_slab) {
|
|
|
|
new_array = kmalloc(new_size, GFP_KERNEL);
|
2011-07-12 09:58:09 +02:00
|
|
|
addr = new_array ? __pa(new_array) : 0;
|
2012-05-30 00:06:50 +02:00
|
|
|
} else {
|
2012-06-20 21:53:05 +02:00
|
|
|
/* only exclude range when trying to double reserved.regions */
|
|
|
|
if (type != &memblock.reserved)
|
|
|
|
new_area_start = new_area_size = 0;
|
|
|
|
|
|
|
|
addr = memblock_find_in_range(new_area_start + new_area_size,
|
|
|
|
memblock.current_limit,
|
2012-07-11 23:02:56 +02:00
|
|
|
new_alloc_size, PAGE_SIZE);
|
2012-06-20 21:53:05 +02:00
|
|
|
if (!addr && new_area_size)
|
|
|
|
addr = memblock_find_in_range(0,
|
2012-08-01 01:42:40 +02:00
|
|
|
min(new_area_start, memblock.current_limit),
|
|
|
|
new_alloc_size, PAGE_SIZE);
|
2012-06-20 21:53:05 +02:00
|
|
|
|
2012-09-04 10:25:05 +02:00
|
|
|
new_array = addr ? __va(addr) : NULL;
|
2012-05-30 00:06:50 +02:00
|
|
|
}
|
2011-07-12 09:58:09 +02:00
|
|
|
if (!addr) {
|
2010-07-07 00:39:13 +02:00
|
|
|
pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
|
|
|
|
memblock_type_name(type), type->max, type->max * 2);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2012-08-01 01:42:40 +02:00
|
|
|
memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]",
|
|
|
|
memblock_type_name(type), type->max * 2, (u64)addr,
|
|
|
|
(u64)addr + new_size - 1);
|
2010-07-28 07:13:22 +02:00
|
|
|
|
2012-08-01 01:42:40 +02:00
|
|
|
/*
|
|
|
|
* Found space, we now need to move the array over before we add the
|
|
|
|
* reserved region since it may be our reserved array itself that is
|
|
|
|
* full.
|
2010-07-07 00:39:13 +02:00
|
|
|
*/
|
|
|
|
memcpy(new_array, type->regions, old_size);
|
|
|
|
memset(new_array + type->max, 0, old_size);
|
|
|
|
old_array = type->regions;
|
|
|
|
type->regions = new_array;
|
|
|
|
type->max <<= 1;
|
|
|
|
|
2012-08-01 01:42:40 +02:00
|
|
|
/* Free old array. We needn't free it if the array is the static one */
|
2012-05-30 00:06:50 +02:00
|
|
|
if (*in_slab)
|
|
|
|
kfree(old_array);
|
|
|
|
else if (old_array != memblock_memory_init_regions &&
|
|
|
|
old_array != memblock_reserved_init_regions)
|
2012-07-11 23:02:56 +02:00
|
|
|
memblock_free(__pa(old_array), old_alloc_size);
|
2010-07-07 00:39:13 +02:00
|
|
|
|
2012-08-01 01:42:40 +02:00
|
|
|
/*
|
|
|
|
* Reserve the new array if that comes from the memblock. Otherwise, we
|
|
|
|
* needn't do it
|
2012-05-30 00:06:50 +02:00
|
|
|
*/
|
|
|
|
if (!use_slab)
|
2012-07-11 23:02:56 +02:00
|
|
|
BUG_ON(memblock_reserve(addr, new_alloc_size));
|
2012-05-30 00:06:50 +02:00
|
|
|
|
|
|
|
/* Update slab flag */
|
|
|
|
*in_slab = use_slab;
|
|
|
|
|
2010-07-07 00:39:13 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-07-12 11:15:55 +02:00
|
|
|
/**
|
|
|
|
* memblock_merge_regions - merge neighboring compatible regions
|
|
|
|
* @type: memblock type to scan
|
|
|
|
*
|
|
|
|
* Scan @type and merge neighboring compatible regions.
|
|
|
|
*/
|
|
|
|
static void __init_memblock memblock_merge_regions(struct memblock_type *type)
|
2010-07-12 06:36:09 +02:00
|
|
|
{
|
2011-07-12 11:15:55 +02:00
|
|
|
int i = 0;
|
2010-07-12 06:36:09 +02:00
|
|
|
|
2011-07-12 11:15:55 +02:00
|
|
|
/* cnt never goes below 1 */
|
|
|
|
while (i < type->cnt - 1) {
|
|
|
|
struct memblock_region *this = &type->regions[i];
|
|
|
|
struct memblock_region *next = &type->regions[i + 1];
|
2010-07-12 06:36:09 +02:00
|
|
|
|
2011-07-14 11:43:42 +02:00
|
|
|
if (this->base + this->size != next->base ||
|
|
|
|
memblock_get_region_node(this) !=
|
2014-01-22 00:49:20 +01:00
|
|
|
memblock_get_region_node(next) ||
|
|
|
|
this->flags != next->flags) {
|
2011-07-12 11:15:55 +02:00
|
|
|
BUG_ON(this->base + this->size > next->base);
|
|
|
|
i++;
|
|
|
|
continue;
|
mm/memblock: properly handle overlaps and fix error path
Currently memblock_reserve() or memblock_free() don't handle overlaps of
any kind. There is some special casing for coalescing exactly adjacent
regions but that's about it.
This is annoying because typically memblock_reserve() is used to mark
regions passed by the firmware as reserved and we all know how much we can
trust our firmwares...
Also, with the current code, if we do something it doesn't handle right
such as trying to memblock_reserve() a large range spanning multiple
existing smaller reserved regions for example, or doing overlapping
reservations, it can silently corrupt the internal region array, causing
odd errors much later on, such as allocations returning reserved regions
etc...
This patch rewrites the underlying functions that add or remove a region
to the arrays. The new code is a lot more robust as it fully handles
overlapping regions. It's also, imho, simpler than the previous
implementation.
In addition, while doing so, I found a bug where if we fail to double the
array while adding a region, we would remove the last region of the array
rather than the region we just allocated. This fixes it too.
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Acked-by: Yinghai Lu <yinghai@kernel.org>
Cc: Ingo Molnar <mingo@elte.hu>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-03-23 00:33:43 +01:00
|
|
|
}
|
|
|
|
|
2011-07-12 11:15:55 +02:00
|
|
|
this->size += next->size;
|
2013-01-11 23:31:44 +01:00
|
|
|
/* move forward from next + 1, index of which is i + 2 */
|
|
|
|
memmove(next, next + 1, (type->cnt - (i + 2)) * sizeof(*next));
|
2011-07-12 11:15:55 +02:00
|
|
|
type->cnt--;
|
2010-07-12 06:36:09 +02:00
|
|
|
}
|
2011-07-12 11:15:55 +02:00
|
|
|
}
|
2010-07-12 06:36:09 +02:00
|
|
|
|
2011-07-12 11:15:55 +02:00
|
|
|
/**
|
|
|
|
* memblock_insert_region - insert new memblock region
|
2013-04-30 00:08:41 +02:00
|
|
|
* @type: memblock type to insert into
|
|
|
|
* @idx: index for the insertion point
|
|
|
|
* @base: base address of the new region
|
|
|
|
* @size: size of the new region
|
|
|
|
* @nid: node id of the new region
|
2014-01-22 00:49:20 +01:00
|
|
|
* @flags: flags of the new region
|
2011-07-12 11:15:55 +02:00
|
|
|
*
|
|
|
|
* Insert new memblock region [@base,@base+@size) into @type at @idx.
|
|
|
|
* @type must already have extra room to accomodate the new region.
|
|
|
|
*/
|
|
|
|
static void __init_memblock memblock_insert_region(struct memblock_type *type,
|
|
|
|
int idx, phys_addr_t base,
|
2014-01-22 00:49:20 +01:00
|
|
|
phys_addr_t size,
|
|
|
|
int nid, unsigned long flags)
|
2011-07-12 11:15:55 +02:00
|
|
|
{
|
|
|
|
struct memblock_region *rgn = &type->regions[idx];
|
|
|
|
|
|
|
|
BUG_ON(type->cnt >= type->max);
|
|
|
|
memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn));
|
|
|
|
rgn->base = base;
|
|
|
|
rgn->size = size;
|
2014-01-22 00:49:20 +01:00
|
|
|
rgn->flags = flags;
|
2011-07-14 11:43:42 +02:00
|
|
|
memblock_set_region_node(rgn, nid);
|
2011-07-12 11:15:55 +02:00
|
|
|
type->cnt++;
|
2011-12-08 19:22:08 +01:00
|
|
|
type->total_size += size;
|
2011-07-12 11:15:55 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* memblock_add_region - add new memblock region
|
|
|
|
* @type: memblock type to add new region into
|
|
|
|
* @base: base address of the new region
|
|
|
|
* @size: size of the new region
|
2011-12-08 19:22:08 +01:00
|
|
|
* @nid: nid of the new region
|
2014-01-22 00:49:20 +01:00
|
|
|
* @flags: flags of the new region
|
2011-07-12 11:15:55 +02:00
|
|
|
*
|
|
|
|
* Add new memblock region [@base,@base+@size) into @type. The new region
|
|
|
|
* is allowed to overlap with existing ones - overlaps don't affect already
|
|
|
|
* existing regions. @type is guaranteed to be minimal (all neighbouring
|
|
|
|
* compatible regions are merged) after the addition.
|
|
|
|
*
|
|
|
|
* RETURNS:
|
|
|
|
* 0 on success, -errno on failure.
|
|
|
|
*/
|
2011-12-08 19:22:06 +01:00
|
|
|
static int __init_memblock memblock_add_region(struct memblock_type *type,
|
2014-01-22 00:49:20 +01:00
|
|
|
phys_addr_t base, phys_addr_t size,
|
|
|
|
int nid, unsigned long flags)
|
2011-07-12 11:15:55 +02:00
|
|
|
{
|
|
|
|
bool insert = false;
|
2011-12-08 19:22:07 +01:00
|
|
|
phys_addr_t obase = base;
|
|
|
|
phys_addr_t end = base + memblock_cap_size(base, &size);
|
2011-07-12 11:15:55 +02:00
|
|
|
int i, nr_new;
|
|
|
|
|
2012-04-20 17:31:34 +02:00
|
|
|
if (!size)
|
|
|
|
return 0;
|
|
|
|
|
2011-07-12 11:15:55 +02:00
|
|
|
/* special case for empty array */
|
|
|
|
if (type->regions[0].size == 0) {
|
2011-12-08 19:22:08 +01:00
|
|
|
WARN_ON(type->cnt != 1 || type->total_size);
|
mm/memblock: properly handle overlaps and fix error path
Currently memblock_reserve() or memblock_free() don't handle overlaps of
any kind. There is some special casing for coalescing exactly adjacent
regions but that's about it.
This is annoying because typically memblock_reserve() is used to mark
regions passed by the firmware as reserved and we all know how much we can
trust our firmwares...
Also, with the current code, if we do something it doesn't handle right
such as trying to memblock_reserve() a large range spanning multiple
existing smaller reserved regions for example, or doing overlapping
reservations, it can silently corrupt the internal region array, causing
odd errors much later on, such as allocations returning reserved regions
etc...
This patch rewrites the underlying functions that add or remove a region
to the arrays. The new code is a lot more robust as it fully handles
overlapping regions. It's also, imho, simpler than the previous
implementation.
In addition, while doing so, I found a bug where if we fail to double the
array while adding a region, we would remove the last region of the array
rather than the region we just allocated. This fixes it too.
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Acked-by: Yinghai Lu <yinghai@kernel.org>
Cc: Ingo Molnar <mingo@elte.hu>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-03-23 00:33:43 +01:00
|
|
|
type->regions[0].base = base;
|
|
|
|
type->regions[0].size = size;
|
2014-01-22 00:49:20 +01:00
|
|
|
type->regions[0].flags = flags;
|
2011-12-08 19:22:08 +01:00
|
|
|
memblock_set_region_node(&type->regions[0], nid);
|
2011-12-08 19:22:08 +01:00
|
|
|
type->total_size = size;
|
mm/memblock: properly handle overlaps and fix error path
Currently memblock_reserve() or memblock_free() don't handle overlaps of
any kind. There is some special casing for coalescing exactly adjacent
regions but that's about it.
This is annoying because typically memblock_reserve() is used to mark
regions passed by the firmware as reserved and we all know how much we can
trust our firmwares...
Also, with the current code, if we do something it doesn't handle right
such as trying to memblock_reserve() a large range spanning multiple
existing smaller reserved regions for example, or doing overlapping
reservations, it can silently corrupt the internal region array, causing
odd errors much later on, such as allocations returning reserved regions
etc...
This patch rewrites the underlying functions that add or remove a region
to the arrays. The new code is a lot more robust as it fully handles
overlapping regions. It's also, imho, simpler than the previous
implementation.
In addition, while doing so, I found a bug where if we fail to double the
array while adding a region, we would remove the last region of the array
rather than the region we just allocated. This fixes it too.
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Acked-by: Yinghai Lu <yinghai@kernel.org>
Cc: Ingo Molnar <mingo@elte.hu>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-03-23 00:33:43 +01:00
|
|
|
return 0;
|
2010-07-12 06:36:09 +02:00
|
|
|
}
|
2011-07-12 11:15:55 +02:00
|
|
|
repeat:
|
|
|
|
/*
|
|
|
|
* The following is executed twice. Once with %false @insert and
|
|
|
|
* then with %true. The first counts the number of regions needed
|
|
|
|
* to accomodate the new area. The second actually inserts them.
|
2010-07-07 00:39:13 +02:00
|
|
|
*/
|
2011-07-12 11:15:55 +02:00
|
|
|
base = obase;
|
|
|
|
nr_new = 0;
|
2010-07-12 06:36:09 +02:00
|
|
|
|
2011-07-12 11:15:55 +02:00
|
|
|
for (i = 0; i < type->cnt; i++) {
|
|
|
|
struct memblock_region *rgn = &type->regions[i];
|
|
|
|
phys_addr_t rbase = rgn->base;
|
|
|
|
phys_addr_t rend = rbase + rgn->size;
|
|
|
|
|
|
|
|
if (rbase >= end)
|
2010-07-12 06:36:09 +02:00
|
|
|
break;
|
2011-07-12 11:15:55 +02:00
|
|
|
if (rend <= base)
|
|
|
|
continue;
|
|
|
|
/*
|
|
|
|
* @rgn overlaps. If it separates the lower part of new
|
|
|
|
* area, insert that portion.
|
|
|
|
*/
|
|
|
|
if (rbase > base) {
|
|
|
|
nr_new++;
|
|
|
|
if (insert)
|
|
|
|
memblock_insert_region(type, i++, base,
|
2014-01-22 00:49:20 +01:00
|
|
|
rbase - base, nid,
|
|
|
|
flags);
|
2010-07-12 06:36:09 +02:00
|
|
|
}
|
2011-07-12 11:15:55 +02:00
|
|
|
/* area below @rend is dealt with, forget about it */
|
|
|
|
base = min(rend, end);
|
2010-07-12 06:36:09 +02:00
|
|
|
}
|
2011-07-12 11:15:55 +02:00
|
|
|
|
|
|
|
/* insert the remaining portion */
|
|
|
|
if (base < end) {
|
|
|
|
nr_new++;
|
|
|
|
if (insert)
|
2014-01-22 00:49:20 +01:00
|
|
|
memblock_insert_region(type, i, base, end - base,
|
|
|
|
nid, flags);
|
2010-07-12 06:36:09 +02:00
|
|
|
}
|
|
|
|
|
2011-07-12 11:15:55 +02:00
|
|
|
/*
|
|
|
|
* If this was the first round, resize array and repeat for actual
|
|
|
|
* insertions; otherwise, merge and return.
|
2010-07-07 00:39:13 +02:00
|
|
|
*/
|
2011-07-12 11:15:55 +02:00
|
|
|
if (!insert) {
|
|
|
|
while (type->cnt + nr_new > type->max)
|
2012-06-20 21:53:05 +02:00
|
|
|
if (memblock_double_array(type, obase, size) < 0)
|
2011-07-12 11:15:55 +02:00
|
|
|
return -ENOMEM;
|
|
|
|
insert = true;
|
|
|
|
goto repeat;
|
|
|
|
} else {
|
|
|
|
memblock_merge_regions(type);
|
|
|
|
return 0;
|
2010-07-07 00:39:13 +02:00
|
|
|
}
|
2010-07-12 06:36:09 +02:00
|
|
|
}
|
|
|
|
|
2011-12-08 19:22:08 +01:00
|
|
|
int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size,
|
|
|
|
int nid)
|
|
|
|
{
|
2014-01-22 00:49:20 +01:00
|
|
|
return memblock_add_region(&memblock.memory, base, size, nid, 0);
|
2011-12-08 19:22:08 +01:00
|
|
|
}
|
|
|
|
|
2011-12-08 19:22:06 +01:00
|
|
|
int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size)
|
2010-07-12 06:36:09 +02:00
|
|
|
{
|
2014-01-22 00:49:20 +01:00
|
|
|
return memblock_add_region(&memblock.memory, base, size,
|
|
|
|
MAX_NUMNODES, 0);
|
2010-07-12 06:36:09 +02:00
|
|
|
}
|
|
|
|
|
2011-12-08 19:22:07 +01:00
|
|
|
/**
|
|
|
|
* memblock_isolate_range - isolate given range into disjoint memblocks
|
|
|
|
* @type: memblock type to isolate range for
|
|
|
|
* @base: base of range to isolate
|
|
|
|
* @size: size of range to isolate
|
|
|
|
* @start_rgn: out parameter for the start of isolated region
|
|
|
|
* @end_rgn: out parameter for the end of isolated region
|
|
|
|
*
|
|
|
|
* Walk @type and ensure that regions don't cross the boundaries defined by
|
|
|
|
* [@base,@base+@size). Crossing regions are split at the boundaries,
|
|
|
|
* which may create at most two more regions. The index of the first
|
|
|
|
* region inside the range is returned in *@start_rgn and end in *@end_rgn.
|
|
|
|
*
|
|
|
|
* RETURNS:
|
|
|
|
* 0 on success, -errno on failure.
|
|
|
|
*/
|
|
|
|
static int __init_memblock memblock_isolate_range(struct memblock_type *type,
|
|
|
|
phys_addr_t base, phys_addr_t size,
|
|
|
|
int *start_rgn, int *end_rgn)
|
|
|
|
{
|
2011-12-08 19:22:07 +01:00
|
|
|
phys_addr_t end = base + memblock_cap_size(base, &size);
|
2011-12-08 19:22:07 +01:00
|
|
|
int i;
|
|
|
|
|
|
|
|
*start_rgn = *end_rgn = 0;
|
|
|
|
|
2012-04-20 17:31:34 +02:00
|
|
|
if (!size)
|
|
|
|
return 0;
|
|
|
|
|
2011-12-08 19:22:07 +01:00
|
|
|
/* we'll create at most two more regions */
|
|
|
|
while (type->cnt + 2 > type->max)
|
2012-06-20 21:53:05 +02:00
|
|
|
if (memblock_double_array(type, base, size) < 0)
|
2011-12-08 19:22:07 +01:00
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
for (i = 0; i < type->cnt; i++) {
|
|
|
|
struct memblock_region *rgn = &type->regions[i];
|
|
|
|
phys_addr_t rbase = rgn->base;
|
|
|
|
phys_addr_t rend = rbase + rgn->size;
|
|
|
|
|
|
|
|
if (rbase >= end)
|
|
|
|
break;
|
|
|
|
if (rend <= base)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (rbase < base) {
|
|
|
|
/*
|
|
|
|
* @rgn intersects from below. Split and continue
|
|
|
|
* to process the next region - the new top half.
|
|
|
|
*/
|
|
|
|
rgn->base = base;
|
2011-12-08 19:22:08 +01:00
|
|
|
rgn->size -= base - rbase;
|
|
|
|
type->total_size -= base - rbase;
|
2011-12-08 19:22:07 +01:00
|
|
|
memblock_insert_region(type, i, rbase, base - rbase,
|
2014-01-22 00:49:20 +01:00
|
|
|
memblock_get_region_node(rgn),
|
|
|
|
rgn->flags);
|
2011-12-08 19:22:07 +01:00
|
|
|
} else if (rend > end) {
|
|
|
|
/*
|
|
|
|
* @rgn intersects from above. Split and redo the
|
|
|
|
* current region - the new bottom half.
|
|
|
|
*/
|
|
|
|
rgn->base = end;
|
2011-12-08 19:22:08 +01:00
|
|
|
rgn->size -= end - rbase;
|
|
|
|
type->total_size -= end - rbase;
|
2011-12-08 19:22:07 +01:00
|
|
|
memblock_insert_region(type, i--, rbase, end - rbase,
|
2014-01-22 00:49:20 +01:00
|
|
|
memblock_get_region_node(rgn),
|
|
|
|
rgn->flags);
|
2011-12-08 19:22:07 +01:00
|
|
|
} else {
|
|
|
|
/* @rgn is fully contained, record it */
|
|
|
|
if (!*end_rgn)
|
|
|
|
*start_rgn = i;
|
|
|
|
*end_rgn = i + 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-12-08 19:22:06 +01:00
|
|
|
static int __init_memblock __memblock_remove(struct memblock_type *type,
|
|
|
|
phys_addr_t base, phys_addr_t size)
|
2010-07-12 06:36:09 +02:00
|
|
|
{
|
2011-12-08 19:22:07 +01:00
|
|
|
int start_rgn, end_rgn;
|
|
|
|
int i, ret;
|
2010-07-12 06:36:09 +02:00
|
|
|
|
2011-12-08 19:22:07 +01:00
|
|
|
ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
2010-07-12 06:36:09 +02:00
|
|
|
|
2011-12-08 19:22:07 +01:00
|
|
|
for (i = end_rgn - 1; i >= start_rgn; i--)
|
|
|
|
memblock_remove_region(type, i);
|
mm/memblock: properly handle overlaps and fix error path
Currently memblock_reserve() or memblock_free() don't handle overlaps of
any kind. There is some special casing for coalescing exactly adjacent
regions but that's about it.
This is annoying because typically memblock_reserve() is used to mark
regions passed by the firmware as reserved and we all know how much we can
trust our firmwares...
Also, with the current code, if we do something it doesn't handle right
such as trying to memblock_reserve() a large range spanning multiple
existing smaller reserved regions for example, or doing overlapping
reservations, it can silently corrupt the internal region array, causing
odd errors much later on, such as allocations returning reserved regions
etc...
This patch rewrites the underlying functions that add or remove a region
to the arrays. The new code is a lot more robust as it fully handles
overlapping regions. It's also, imho, simpler than the previous
implementation.
In addition, while doing so, I found a bug where if we fail to double the
array while adding a region, we would remove the last region of the array
rather than the region we just allocated. This fixes it too.
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Acked-by: Yinghai Lu <yinghai@kernel.org>
Cc: Ingo Molnar <mingo@elte.hu>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-03-23 00:33:43 +01:00
|
|
|
return 0;
|
2010-07-12 06:36:09 +02:00
|
|
|
}
|
|
|
|
|
2011-12-08 19:22:06 +01:00
|
|
|
int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size)
|
2010-07-12 06:36:09 +02:00
|
|
|
{
|
|
|
|
return __memblock_remove(&memblock.memory, base, size);
|
|
|
|
}
|
|
|
|
|
2011-12-08 19:22:06 +01:00
|
|
|
int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size)
|
2010-07-12 06:36:09 +02:00
|
|
|
{
|
2011-07-12 11:16:06 +02:00
|
|
|
memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n",
|
2011-07-14 20:57:10 +02:00
|
|
|
(unsigned long long)base,
|
2014-01-22 00:49:17 +01:00
|
|
|
(unsigned long long)base + size - 1,
|
2011-07-14 20:57:10 +02:00
|
|
|
(void *)_RET_IP_);
|
2011-07-12 11:16:06 +02:00
|
|
|
|
2010-07-12 06:36:09 +02:00
|
|
|
return __memblock_remove(&memblock.reserved, base, size);
|
|
|
|
}
|
|
|
|
|
2014-01-22 00:49:20 +01:00
|
|
|
static int __init_memblock memblock_reserve_region(phys_addr_t base,
|
|
|
|
phys_addr_t size,
|
|
|
|
int nid,
|
|
|
|
unsigned long flags)
|
2010-07-12 06:36:09 +02:00
|
|
|
{
|
2010-08-04 06:06:41 +02:00
|
|
|
struct memblock_type *_rgn = &memblock.reserved;
|
2010-07-12 06:36:09 +02:00
|
|
|
|
2014-01-22 00:49:20 +01:00
|
|
|
memblock_dbg("memblock_reserve: [%#016llx-%#016llx] flags %#02lx %pF\n",
|
2011-07-14 20:57:10 +02:00
|
|
|
(unsigned long long)base,
|
2014-01-22 00:49:17 +01:00
|
|
|
(unsigned long long)base + size - 1,
|
2014-01-22 00:49:20 +01:00
|
|
|
flags, (void *)_RET_IP_);
|
|
|
|
|
|
|
|
return memblock_add_region(_rgn, base, size, nid, flags);
|
|
|
|
}
|
2010-07-12 06:36:09 +02:00
|
|
|
|
2014-01-22 00:49:20 +01:00
|
|
|
int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size)
|
|
|
|
{
|
|
|
|
return memblock_reserve_region(base, size, MAX_NUMNODES, 0);
|
2010-07-12 06:36:09 +02:00
|
|
|
}
|
|
|
|
|
2014-01-22 00:49:23 +01:00
|
|
|
/**
|
|
|
|
* memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG.
|
|
|
|
* @base: the base phys addr of the region
|
|
|
|
* @size: the size of the region
|
|
|
|
*
|
|
|
|
* This function isolates region [@base, @base + @size), and mark it with flag
|
|
|
|
* MEMBLOCK_HOTPLUG.
|
|
|
|
*
|
|
|
|
* Return 0 on succees, -errno on failure.
|
|
|
|
*/
|
|
|
|
int __init_memblock memblock_mark_hotplug(phys_addr_t base, phys_addr_t size)
|
|
|
|
{
|
|
|
|
struct memblock_type *type = &memblock.memory;
|
|
|
|
int i, ret, start_rgn, end_rgn;
|
|
|
|
|
|
|
|
ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
for (i = start_rgn; i < end_rgn; i++)
|
|
|
|
memblock_set_region_flags(&type->regions[i], MEMBLOCK_HOTPLUG);
|
|
|
|
|
|
|
|
memblock_merge_regions(type);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region.
|
|
|
|
* @base: the base phys addr of the region
|
|
|
|
* @size: the size of the region
|
|
|
|
*
|
|
|
|
* This function isolates region [@base, @base + @size), and clear flag
|
|
|
|
* MEMBLOCK_HOTPLUG for the isolated regions.
|
|
|
|
*
|
|
|
|
* Return 0 on succees, -errno on failure.
|
|
|
|
*/
|
|
|
|
int __init_memblock memblock_clear_hotplug(phys_addr_t base, phys_addr_t size)
|
|
|
|
{
|
|
|
|
struct memblock_type *type = &memblock.memory;
|
|
|
|
int i, ret, start_rgn, end_rgn;
|
|
|
|
|
|
|
|
ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
for (i = start_rgn; i < end_rgn; i++)
|
|
|
|
memblock_clear_region_flags(&type->regions[i],
|
|
|
|
MEMBLOCK_HOTPLUG);
|
|
|
|
|
|
|
|
memblock_merge_regions(type);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-07-12 11:15:59 +02:00
|
|
|
/**
|
|
|
|
* __next_free_mem_range - next function for for_each_free_mem_range()
|
|
|
|
* @idx: pointer to u64 loop variable
|
2014-01-22 00:50:16 +01:00
|
|
|
* @nid: node selector, %NUMA_NO_NODE for all nodes
|
2012-06-20 21:53:01 +02:00
|
|
|
* @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
|
|
|
|
* @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
|
|
|
|
* @out_nid: ptr to int for nid of the range, can be %NULL
|
2011-07-12 11:15:59 +02:00
|
|
|
*
|
|
|
|
* Find the first free area from *@idx which matches @nid, fill the out
|
|
|
|
* parameters, and update *@idx for the next iteration. The lower 32bit of
|
|
|
|
* *@idx contains index into memory region and the upper 32bit indexes the
|
|
|
|
* areas before each reserved region. For example, if reserved regions
|
|
|
|
* look like the following,
|
|
|
|
*
|
|
|
|
* 0:[0-16), 1:[32-48), 2:[128-130)
|
|
|
|
*
|
|
|
|
* The upper 32bit indexes the following regions.
|
|
|
|
*
|
|
|
|
* 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX)
|
|
|
|
*
|
|
|
|
* As both region arrays are sorted, the function advances the two indices
|
|
|
|
* in lockstep and returns each intersection.
|
|
|
|
*/
|
|
|
|
void __init_memblock __next_free_mem_range(u64 *idx, int nid,
|
|
|
|
phys_addr_t *out_start,
|
|
|
|
phys_addr_t *out_end, int *out_nid)
|
|
|
|
{
|
|
|
|
struct memblock_type *mem = &memblock.memory;
|
|
|
|
struct memblock_type *rsv = &memblock.reserved;
|
|
|
|
int mi = *idx & 0xffffffff;
|
|
|
|
int ri = *idx >> 32;
|
2014-01-22 00:50:16 +01:00
|
|
|
|
2014-01-22 00:50:55 +01:00
|
|
|
if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
|
|
|
|
nid = NUMA_NO_NODE;
|
2011-07-12 11:15:59 +02:00
|
|
|
|
|
|
|
for ( ; mi < mem->cnt; mi++) {
|
|
|
|
struct memblock_region *m = &mem->regions[mi];
|
|
|
|
phys_addr_t m_start = m->base;
|
|
|
|
phys_addr_t m_end = m->base + m->size;
|
|
|
|
|
|
|
|
/* only memory regions are associated with nodes, check it */
|
2014-01-22 00:50:55 +01:00
|
|
|
if (nid != NUMA_NO_NODE && nid != memblock_get_region_node(m))
|
2011-07-12 11:15:59 +02:00
|
|
|
continue;
|
|
|
|
|
|
|
|
/* scan areas before each reservation for intersection */
|
|
|
|
for ( ; ri < rsv->cnt + 1; ri++) {
|
|
|
|
struct memblock_region *r = &rsv->regions[ri];
|
|
|
|
phys_addr_t r_start = ri ? r[-1].base + r[-1].size : 0;
|
|
|
|
phys_addr_t r_end = ri < rsv->cnt ? r->base : ULLONG_MAX;
|
|
|
|
|
|
|
|
/* if ri advanced past mi, break out to advance mi */
|
|
|
|
if (r_start >= m_end)
|
|
|
|
break;
|
|
|
|
/* if the two regions intersect, we're done */
|
|
|
|
if (m_start < r_end) {
|
|
|
|
if (out_start)
|
|
|
|
*out_start = max(m_start, r_start);
|
|
|
|
if (out_end)
|
|
|
|
*out_end = min(m_end, r_end);
|
|
|
|
if (out_nid)
|
|
|
|
*out_nid = memblock_get_region_node(m);
|
|
|
|
/*
|
|
|
|
* The region which ends first is advanced
|
|
|
|
* for the next iteration.
|
|
|
|
*/
|
|
|
|
if (m_end <= r_end)
|
|
|
|
mi++;
|
|
|
|
else
|
|
|
|
ri++;
|
|
|
|
*idx = (u32)mi | (u64)ri << 32;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* signal end of iteration */
|
|
|
|
*idx = ULLONG_MAX;
|
|
|
|
}
|
|
|
|
|
2011-12-08 19:22:09 +01:00
|
|
|
/**
|
|
|
|
* __next_free_mem_range_rev - next function for for_each_free_mem_range_reverse()
|
|
|
|
* @idx: pointer to u64 loop variable
|
2014-01-22 00:50:16 +01:00
|
|
|
* @nid: nid: node selector, %NUMA_NO_NODE for all nodes
|
2012-06-20 21:53:01 +02:00
|
|
|
* @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
|
|
|
|
* @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
|
|
|
|
* @out_nid: ptr to int for nid of the range, can be %NULL
|
2011-12-08 19:22:09 +01:00
|
|
|
*
|
|
|
|
* Reverse of __next_free_mem_range().
|
2014-01-22 00:49:35 +01:00
|
|
|
*
|
|
|
|
* Linux kernel cannot migrate pages used by itself. Memory hotplug users won't
|
|
|
|
* be able to hot-remove hotpluggable memory used by the kernel. So this
|
|
|
|
* function skip hotpluggable regions if needed when allocating memory for the
|
|
|
|
* kernel.
|
2011-12-08 19:22:09 +01:00
|
|
|
*/
|
|
|
|
void __init_memblock __next_free_mem_range_rev(u64 *idx, int nid,
|
|
|
|
phys_addr_t *out_start,
|
|
|
|
phys_addr_t *out_end, int *out_nid)
|
|
|
|
{
|
|
|
|
struct memblock_type *mem = &memblock.memory;
|
|
|
|
struct memblock_type *rsv = &memblock.reserved;
|
|
|
|
int mi = *idx & 0xffffffff;
|
|
|
|
int ri = *idx >> 32;
|
2014-01-22 00:50:16 +01:00
|
|
|
|
2014-01-22 00:50:55 +01:00
|
|
|
if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
|
|
|
|
nid = NUMA_NO_NODE;
|
2011-12-08 19:22:09 +01:00
|
|
|
|
|
|
|
if (*idx == (u64)ULLONG_MAX) {
|
|
|
|
mi = mem->cnt - 1;
|
|
|
|
ri = rsv->cnt;
|
|
|
|
}
|
|
|
|
|
|
|
|
for ( ; mi >= 0; mi--) {
|
|
|
|
struct memblock_region *m = &mem->regions[mi];
|
|
|
|
phys_addr_t m_start = m->base;
|
|
|
|
phys_addr_t m_end = m->base + m->size;
|
|
|
|
|
|
|
|
/* only memory regions are associated with nodes, check it */
|
2014-01-22 00:50:55 +01:00
|
|
|
if (nid != NUMA_NO_NODE && nid != memblock_get_region_node(m))
|
2011-12-08 19:22:09 +01:00
|
|
|
continue;
|
|
|
|
|
2014-01-22 00:49:35 +01:00
|
|
|
/* skip hotpluggable memory regions if needed */
|
|
|
|
if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
|
|
|
|
continue;
|
|
|
|
|
2011-12-08 19:22:09 +01:00
|
|
|
/* scan areas before each reservation for intersection */
|
|
|
|
for ( ; ri >= 0; ri--) {
|
|
|
|
struct memblock_region *r = &rsv->regions[ri];
|
|
|
|
phys_addr_t r_start = ri ? r[-1].base + r[-1].size : 0;
|
|
|
|
phys_addr_t r_end = ri < rsv->cnt ? r->base : ULLONG_MAX;
|
|
|
|
|
|
|
|
/* if ri advanced past mi, break out to advance mi */
|
|
|
|
if (r_end <= m_start)
|
|
|
|
break;
|
|
|
|
/* if the two regions intersect, we're done */
|
|
|
|
if (m_end > r_start) {
|
|
|
|
if (out_start)
|
|
|
|
*out_start = max(m_start, r_start);
|
|
|
|
if (out_end)
|
|
|
|
*out_end = min(m_end, r_end);
|
|
|
|
if (out_nid)
|
|
|
|
*out_nid = memblock_get_region_node(m);
|
|
|
|
|
|
|
|
if (m_start >= r_start)
|
|
|
|
mi--;
|
|
|
|
else
|
|
|
|
ri--;
|
|
|
|
*idx = (u32)mi | (u64)ri << 32;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
*idx = ULLONG_MAX;
|
|
|
|
}
|
|
|
|
|
2011-07-14 11:43:42 +02:00
|
|
|
#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
|
|
|
|
/*
|
|
|
|
* Common iterator interface used to define for_each_mem_range().
|
|
|
|
*/
|
|
|
|
void __init_memblock __next_mem_pfn_range(int *idx, int nid,
|
|
|
|
unsigned long *out_start_pfn,
|
|
|
|
unsigned long *out_end_pfn, int *out_nid)
|
|
|
|
{
|
|
|
|
struct memblock_type *type = &memblock.memory;
|
|
|
|
struct memblock_region *r;
|
|
|
|
|
|
|
|
while (++*idx < type->cnt) {
|
|
|
|
r = &type->regions[*idx];
|
|
|
|
|
|
|
|
if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size))
|
|
|
|
continue;
|
|
|
|
if (nid == MAX_NUMNODES || nid == r->nid)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (*idx >= type->cnt) {
|
|
|
|
*idx = -1;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (out_start_pfn)
|
|
|
|
*out_start_pfn = PFN_UP(r->base);
|
|
|
|
if (out_end_pfn)
|
|
|
|
*out_end_pfn = PFN_DOWN(r->base + r->size);
|
|
|
|
if (out_nid)
|
|
|
|
*out_nid = r->nid;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* memblock_set_node - set node ID on memblock regions
|
|
|
|
* @base: base of area to set node ID for
|
|
|
|
* @size: size of area to set node ID for
|
2014-01-22 00:49:26 +01:00
|
|
|
* @type: memblock type to set node ID for
|
2011-07-14 11:43:42 +02:00
|
|
|
* @nid: node ID to set
|
|
|
|
*
|
2014-01-22 00:49:26 +01:00
|
|
|
* Set the nid of memblock @type regions in [@base,@base+@size) to @nid.
|
2011-07-14 11:43:42 +02:00
|
|
|
* Regions which cross the area boundaries are split as necessary.
|
|
|
|
*
|
|
|
|
* RETURNS:
|
|
|
|
* 0 on success, -errno on failure.
|
|
|
|
*/
|
|
|
|
int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size,
|
2014-01-22 00:49:26 +01:00
|
|
|
struct memblock_type *type, int nid)
|
2011-07-14 11:43:42 +02:00
|
|
|
{
|
2011-12-08 19:22:07 +01:00
|
|
|
int start_rgn, end_rgn;
|
|
|
|
int i, ret;
|
2011-07-14 11:43:42 +02:00
|
|
|
|
2011-12-08 19:22:07 +01:00
|
|
|
ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
2011-07-14 11:43:42 +02:00
|
|
|
|
2011-12-08 19:22:07 +01:00
|
|
|
for (i = start_rgn; i < end_rgn; i++)
|
2012-10-09 01:32:21 +02:00
|
|
|
memblock_set_region_node(&type->regions[i], nid);
|
2011-07-14 11:43:42 +02:00
|
|
|
|
|
|
|
memblock_merge_regions(type);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
|
|
|
|
|
2011-12-08 19:22:09 +01:00
|
|
|
static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size,
|
|
|
|
phys_addr_t align, phys_addr_t max_addr,
|
|
|
|
int nid)
|
2010-07-12 06:36:09 +02:00
|
|
|
{
|
2010-07-12 06:36:48 +02:00
|
|
|
phys_addr_t found;
|
2010-07-12 06:36:09 +02:00
|
|
|
|
2014-01-22 00:50:12 +01:00
|
|
|
if (!align)
|
|
|
|
align = SMP_CACHE_BYTES;
|
2013-04-30 00:06:15 +02:00
|
|
|
|
2014-01-22 00:50:14 +01:00
|
|
|
found = memblock_find_in_range_node(size, align, 0, max_addr, nid);
|
2011-12-08 19:22:06 +01:00
|
|
|
if (found && !memblock_reserve(found, size))
|
2010-07-12 06:36:48 +02:00
|
|
|
return found;
|
2010-07-12 06:36:09 +02:00
|
|
|
|
2010-07-12 06:36:48 +02:00
|
|
|
return 0;
|
2010-07-12 06:36:09 +02:00
|
|
|
}
|
|
|
|
|
2011-12-08 19:22:09 +01:00
|
|
|
phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid)
|
|
|
|
{
|
|
|
|
return memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE, nid);
|
|
|
|
}
|
|
|
|
|
|
|
|
phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
|
|
|
|
{
|
2014-01-22 00:50:16 +01:00
|
|
|
return memblock_alloc_base_nid(size, align, max_addr, NUMA_NO_NODE);
|
2011-12-08 19:22:09 +01:00
|
|
|
}
|
|
|
|
|
2010-07-12 06:36:48 +02:00
|
|
|
phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
|
2010-07-12 06:36:09 +02:00
|
|
|
{
|
2010-07-12 06:36:48 +02:00
|
|
|
phys_addr_t alloc;
|
|
|
|
|
|
|
|
alloc = __memblock_alloc_base(size, align, max_addr);
|
|
|
|
|
|
|
|
if (alloc == 0)
|
|
|
|
panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n",
|
|
|
|
(unsigned long long) size, (unsigned long long) max_addr);
|
|
|
|
|
|
|
|
return alloc;
|
2010-07-12 06:36:09 +02:00
|
|
|
}
|
|
|
|
|
2010-07-12 06:36:48 +02:00
|
|
|
phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align)
|
2010-07-12 06:36:09 +02:00
|
|
|
{
|
2010-07-12 06:36:48 +02:00
|
|
|
return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
|
|
|
|
}
|
2010-07-12 06:36:09 +02:00
|
|
|
|
2010-07-07 00:39:17 +02:00
|
|
|
phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid)
|
|
|
|
{
|
|
|
|
phys_addr_t res = memblock_alloc_nid(size, align, nid);
|
|
|
|
|
|
|
|
if (res)
|
|
|
|
return res;
|
2011-07-12 09:58:07 +02:00
|
|
|
return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
|
2010-07-12 06:36:09 +02:00
|
|
|
}
|
|
|
|
|
2014-01-22 00:50:19 +01:00
|
|
|
/**
|
|
|
|
* memblock_virt_alloc_internal - allocate boot memory block
|
|
|
|
* @size: size of memory block to be allocated in bytes
|
|
|
|
* @align: alignment of the region and block's size
|
|
|
|
* @min_addr: the lower bound of the memory region to allocate (phys address)
|
|
|
|
* @max_addr: the upper bound of the memory region to allocate (phys address)
|
|
|
|
* @nid: nid of the free area to find, %NUMA_NO_NODE for any node
|
|
|
|
*
|
|
|
|
* The @min_addr limit is dropped if it can not be satisfied and the allocation
|
|
|
|
* will fall back to memory below @min_addr. Also, allocation may fall back
|
|
|
|
* to any node in the system if the specified node can not
|
|
|
|
* hold the requested memory.
|
|
|
|
*
|
|
|
|
* The allocation is performed from memory region limited by
|
|
|
|
* memblock.current_limit if @max_addr == %BOOTMEM_ALLOC_ACCESSIBLE.
|
|
|
|
*
|
|
|
|
* The memory block is aligned on SMP_CACHE_BYTES if @align == 0.
|
|
|
|
*
|
|
|
|
* The phys address of allocated boot memory block is converted to virtual and
|
|
|
|
* allocated memory is reset to 0.
|
|
|
|
*
|
|
|
|
* In addition, function sets the min_count to 0 using kmemleak_alloc for
|
|
|
|
* allocated boot memory block, so that it is never reported as leaks.
|
|
|
|
*
|
|
|
|
* RETURNS:
|
|
|
|
* Virtual address of allocated memory block on success, NULL on failure.
|
|
|
|
*/
|
|
|
|
static void * __init memblock_virt_alloc_internal(
|
|
|
|
phys_addr_t size, phys_addr_t align,
|
|
|
|
phys_addr_t min_addr, phys_addr_t max_addr,
|
|
|
|
int nid)
|
|
|
|
{
|
|
|
|
phys_addr_t alloc;
|
|
|
|
void *ptr;
|
|
|
|
|
2014-01-22 00:50:55 +01:00
|
|
|
if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
|
|
|
|
nid = NUMA_NO_NODE;
|
2014-01-22 00:50:19 +01:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Detect any accidental use of these APIs after slab is ready, as at
|
|
|
|
* this moment memblock may be deinitialized already and its
|
|
|
|
* internal data may be destroyed (after execution of free_all_bootmem)
|
|
|
|
*/
|
|
|
|
if (WARN_ON_ONCE(slab_is_available()))
|
|
|
|
return kzalloc_node(size, GFP_NOWAIT, nid);
|
|
|
|
|
|
|
|
if (!align)
|
|
|
|
align = SMP_CACHE_BYTES;
|
|
|
|
|
2014-01-29 23:05:52 +01:00
|
|
|
if (max_addr > memblock.current_limit)
|
|
|
|
max_addr = memblock.current_limit;
|
|
|
|
|
2014-01-22 00:50:19 +01:00
|
|
|
again:
|
|
|
|
alloc = memblock_find_in_range_node(size, align, min_addr, max_addr,
|
|
|
|
nid);
|
|
|
|
if (alloc)
|
|
|
|
goto done;
|
|
|
|
|
|
|
|
if (nid != NUMA_NO_NODE) {
|
|
|
|
alloc = memblock_find_in_range_node(size, align, min_addr,
|
|
|
|
max_addr, NUMA_NO_NODE);
|
|
|
|
if (alloc)
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (min_addr) {
|
|
|
|
min_addr = 0;
|
|
|
|
goto again;
|
|
|
|
} else {
|
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
|
|
|
|
done:
|
|
|
|
memblock_reserve(alloc, size);
|
|
|
|
ptr = phys_to_virt(alloc);
|
|
|
|
memset(ptr, 0, size);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The min_count is set to 0 so that bootmem allocated blocks
|
|
|
|
* are never reported as leaks. This is because many of these blocks
|
|
|
|
* are only referred via the physical address which is not
|
|
|
|
* looked up by kmemleak.
|
|
|
|
*/
|
|
|
|
kmemleak_alloc(ptr, size, 0, 0);
|
|
|
|
|
|
|
|
return ptr;
|
|
|
|
|
|
|
|
error:
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* memblock_virt_alloc_try_nid_nopanic - allocate boot memory block
|
|
|
|
* @size: size of memory block to be allocated in bytes
|
|
|
|
* @align: alignment of the region and block's size
|
|
|
|
* @min_addr: the lower bound of the memory region from where the allocation
|
|
|
|
* is preferred (phys address)
|
|
|
|
* @max_addr: the upper bound of the memory region from where the allocation
|
|
|
|
* is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
|
|
|
|
* allocate only from memory limited by memblock.current_limit value
|
|
|
|
* @nid: nid of the free area to find, %NUMA_NO_NODE for any node
|
|
|
|
*
|
|
|
|
* Public version of _memblock_virt_alloc_try_nid_nopanic() which provides
|
|
|
|
* additional debug information (including caller info), if enabled.
|
|
|
|
*
|
|
|
|
* RETURNS:
|
|
|
|
* Virtual address of allocated memory block on success, NULL on failure.
|
|
|
|
*/
|
|
|
|
void * __init memblock_virt_alloc_try_nid_nopanic(
|
|
|
|
phys_addr_t size, phys_addr_t align,
|
|
|
|
phys_addr_t min_addr, phys_addr_t max_addr,
|
|
|
|
int nid)
|
|
|
|
{
|
|
|
|
memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
|
|
|
|
__func__, (u64)size, (u64)align, nid, (u64)min_addr,
|
|
|
|
(u64)max_addr, (void *)_RET_IP_);
|
|
|
|
return memblock_virt_alloc_internal(size, align, min_addr,
|
|
|
|
max_addr, nid);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* memblock_virt_alloc_try_nid - allocate boot memory block with panicking
|
|
|
|
* @size: size of memory block to be allocated in bytes
|
|
|
|
* @align: alignment of the region and block's size
|
|
|
|
* @min_addr: the lower bound of the memory region from where the allocation
|
|
|
|
* is preferred (phys address)
|
|
|
|
* @max_addr: the upper bound of the memory region from where the allocation
|
|
|
|
* is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
|
|
|
|
* allocate only from memory limited by memblock.current_limit value
|
|
|
|
* @nid: nid of the free area to find, %NUMA_NO_NODE for any node
|
|
|
|
*
|
|
|
|
* Public panicking version of _memblock_virt_alloc_try_nid_nopanic()
|
|
|
|
* which provides debug information (including caller info), if enabled,
|
|
|
|
* and panics if the request can not be satisfied.
|
|
|
|
*
|
|
|
|
* RETURNS:
|
|
|
|
* Virtual address of allocated memory block on success, NULL on failure.
|
|
|
|
*/
|
|
|
|
void * __init memblock_virt_alloc_try_nid(
|
|
|
|
phys_addr_t size, phys_addr_t align,
|
|
|
|
phys_addr_t min_addr, phys_addr_t max_addr,
|
|
|
|
int nid)
|
|
|
|
{
|
|
|
|
void *ptr;
|
|
|
|
|
|
|
|
memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
|
|
|
|
__func__, (u64)size, (u64)align, nid, (u64)min_addr,
|
|
|
|
(u64)max_addr, (void *)_RET_IP_);
|
|
|
|
ptr = memblock_virt_alloc_internal(size, align,
|
|
|
|
min_addr, max_addr, nid);
|
|
|
|
if (ptr)
|
|
|
|
return ptr;
|
|
|
|
|
|
|
|
panic("%s: Failed to allocate %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx\n",
|
|
|
|
__func__, (u64)size, (u64)align, nid, (u64)min_addr,
|
|
|
|
(u64)max_addr);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* __memblock_free_early - free boot memory block
|
|
|
|
* @base: phys starting address of the boot memory block
|
|
|
|
* @size: size of the boot memory block in bytes
|
|
|
|
*
|
|
|
|
* Free boot memory block previously allocated by memblock_virt_alloc_xx() API.
|
|
|
|
* The freeing memory will not be released to the buddy allocator.
|
|
|
|
*/
|
|
|
|
void __init __memblock_free_early(phys_addr_t base, phys_addr_t size)
|
|
|
|
{
|
|
|
|
memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
|
|
|
|
__func__, (u64)base, (u64)base + size - 1,
|
|
|
|
(void *)_RET_IP_);
|
|
|
|
kmemleak_free_part(__va(base), size);
|
|
|
|
__memblock_remove(&memblock.reserved, base, size);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* __memblock_free_late - free bootmem block pages directly to buddy allocator
|
|
|
|
* @addr: phys starting address of the boot memory block
|
|
|
|
* @size: size of the boot memory block in bytes
|
|
|
|
*
|
|
|
|
* This is only useful when the bootmem allocator has already been torn
|
|
|
|
* down, but we are still initializing the system. Pages are released directly
|
|
|
|
* to the buddy allocator, no bootmem metadata is updated because it is gone.
|
|
|
|
*/
|
|
|
|
void __init __memblock_free_late(phys_addr_t base, phys_addr_t size)
|
|
|
|
{
|
|
|
|
u64 cursor, end;
|
|
|
|
|
|
|
|
memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
|
|
|
|
__func__, (u64)base, (u64)base + size - 1,
|
|
|
|
(void *)_RET_IP_);
|
|
|
|
kmemleak_free_part(__va(base), size);
|
|
|
|
cursor = PFN_UP(base);
|
|
|
|
end = PFN_DOWN(base + size);
|
|
|
|
|
|
|
|
for (; cursor < end; cursor++) {
|
|
|
|
__free_pages_bootmem(pfn_to_page(cursor), 0);
|
|
|
|
totalram_pages++;
|
|
|
|
}
|
|
|
|
}
|
2010-07-07 00:39:17 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Remaining API functions
|
|
|
|
*/
|
|
|
|
|
2010-08-04 05:34:42 +02:00
|
|
|
phys_addr_t __init memblock_phys_mem_size(void)
|
2010-07-12 06:36:09 +02:00
|
|
|
{
|
2011-12-08 19:22:08 +01:00
|
|
|
return memblock.memory.total_size;
|
2010-07-12 06:36:09 +02:00
|
|
|
}
|
|
|
|
|
2013-01-24 21:20:09 +01:00
|
|
|
phys_addr_t __init memblock_mem_size(unsigned long limit_pfn)
|
|
|
|
{
|
|
|
|
unsigned long pages = 0;
|
|
|
|
struct memblock_region *r;
|
|
|
|
unsigned long start_pfn, end_pfn;
|
|
|
|
|
|
|
|
for_each_memblock(memory, r) {
|
|
|
|
start_pfn = memblock_region_memory_base_pfn(r);
|
|
|
|
end_pfn = memblock_region_memory_end_pfn(r);
|
|
|
|
start_pfn = min_t(unsigned long, start_pfn, limit_pfn);
|
|
|
|
end_pfn = min_t(unsigned long, end_pfn, limit_pfn);
|
|
|
|
pages += end_pfn - start_pfn;
|
|
|
|
}
|
|
|
|
|
|
|
|
return (phys_addr_t)pages << PAGE_SHIFT;
|
|
|
|
}
|
|
|
|
|
2011-11-01 01:08:16 +01:00
|
|
|
/* lowest address */
|
|
|
|
phys_addr_t __init_memblock memblock_start_of_DRAM(void)
|
|
|
|
{
|
|
|
|
return memblock.memory.regions[0].base;
|
|
|
|
}
|
|
|
|
|
2010-07-28 07:43:02 +02:00
|
|
|
phys_addr_t __init_memblock memblock_end_of_DRAM(void)
|
2010-07-12 06:36:09 +02:00
|
|
|
{
|
|
|
|
int idx = memblock.memory.cnt - 1;
|
|
|
|
|
2010-08-04 06:06:41 +02:00
|
|
|
return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
|
2010-07-12 06:36:09 +02:00
|
|
|
}
|
|
|
|
|
2011-12-08 19:22:07 +01:00
|
|
|
void __init memblock_enforce_memory_limit(phys_addr_t limit)
|
2010-07-12 06:36:09 +02:00
|
|
|
{
|
|
|
|
unsigned long i;
|
2011-12-08 19:22:07 +01:00
|
|
|
phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
|
2010-07-12 06:36:09 +02:00
|
|
|
|
2011-12-08 19:22:07 +01:00
|
|
|
if (!limit)
|
2010-07-12 06:36:09 +02:00
|
|
|
return;
|
|
|
|
|
2011-12-08 19:22:07 +01:00
|
|
|
/* find out max address */
|
2010-07-12 06:36:09 +02:00
|
|
|
for (i = 0; i < memblock.memory.cnt; i++) {
|
2011-12-08 19:22:07 +01:00
|
|
|
struct memblock_region *r = &memblock.memory.regions[i];
|
2010-07-12 06:36:09 +02:00
|
|
|
|
2011-12-08 19:22:07 +01:00
|
|
|
if (limit <= r->size) {
|
|
|
|
max_addr = r->base + limit;
|
|
|
|
break;
|
2010-07-12 06:36:09 +02:00
|
|
|
}
|
2011-12-08 19:22:07 +01:00
|
|
|
limit -= r->size;
|
2010-07-12 06:36:09 +02:00
|
|
|
}
|
2011-12-08 19:22:07 +01:00
|
|
|
|
|
|
|
/* truncate both memory and reserved regions */
|
|
|
|
__memblock_remove(&memblock.memory, max_addr, (phys_addr_t)ULLONG_MAX);
|
|
|
|
__memblock_remove(&memblock.reserved, max_addr, (phys_addr_t)ULLONG_MAX);
|
2010-07-12 06:36:09 +02:00
|
|
|
}
|
|
|
|
|
2010-10-11 21:34:09 +02:00
|
|
|
static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr)
|
2010-08-04 06:38:47 +02:00
|
|
|
{
|
|
|
|
unsigned int left = 0, right = type->cnt;
|
|
|
|
|
|
|
|
do {
|
|
|
|
unsigned int mid = (right + left) / 2;
|
|
|
|
|
|
|
|
if (addr < type->regions[mid].base)
|
|
|
|
right = mid;
|
|
|
|
else if (addr >= (type->regions[mid].base +
|
|
|
|
type->regions[mid].size))
|
|
|
|
left = mid + 1;
|
|
|
|
else
|
|
|
|
return mid;
|
|
|
|
} while (left < right);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2010-08-04 05:34:42 +02:00
|
|
|
int __init memblock_is_reserved(phys_addr_t addr)
|
2010-07-12 06:36:09 +02:00
|
|
|
{
|
2010-08-04 06:38:47 +02:00
|
|
|
return memblock_search(&memblock.reserved, addr) != -1;
|
|
|
|
}
|
2010-07-12 06:36:09 +02:00
|
|
|
|
2010-09-15 22:05:29 +02:00
|
|
|
int __init_memblock memblock_is_memory(phys_addr_t addr)
|
2010-08-04 06:38:47 +02:00
|
|
|
{
|
|
|
|
return memblock_search(&memblock.memory, addr) != -1;
|
|
|
|
}
|
|
|
|
|
2013-09-11 23:22:17 +02:00
|
|
|
#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
|
|
|
|
int __init_memblock memblock_search_pfn_nid(unsigned long pfn,
|
|
|
|
unsigned long *start_pfn, unsigned long *end_pfn)
|
|
|
|
{
|
|
|
|
struct memblock_type *type = &memblock.memory;
|
|
|
|
int mid = memblock_search(type, (phys_addr_t)pfn << PAGE_SHIFT);
|
|
|
|
|
|
|
|
if (mid == -1)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
*start_pfn = type->regions[mid].base >> PAGE_SHIFT;
|
|
|
|
*end_pfn = (type->regions[mid].base + type->regions[mid].size)
|
|
|
|
>> PAGE_SHIFT;
|
|
|
|
|
|
|
|
return type->regions[mid].nid;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2012-05-24 09:45:21 +02:00
|
|
|
/**
|
|
|
|
* memblock_is_region_memory - check if a region is a subset of memory
|
|
|
|
* @base: base of region to check
|
|
|
|
* @size: size of region to check
|
|
|
|
*
|
|
|
|
* Check if the region [@base, @base+@size) is a subset of a memory block.
|
|
|
|
*
|
|
|
|
* RETURNS:
|
|
|
|
* 0 if false, non-zero if true
|
|
|
|
*/
|
2010-09-15 22:05:29 +02:00
|
|
|
int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size)
|
2010-08-04 06:38:47 +02:00
|
|
|
{
|
2011-01-20 23:44:20 +01:00
|
|
|
int idx = memblock_search(&memblock.memory, base);
|
2011-12-08 19:22:07 +01:00
|
|
|
phys_addr_t end = base + memblock_cap_size(base, &size);
|
2010-08-04 06:38:47 +02:00
|
|
|
|
|
|
|
if (idx == -1)
|
|
|
|
return 0;
|
2011-01-20 23:44:20 +01:00
|
|
|
return memblock.memory.regions[idx].base <= base &&
|
|
|
|
(memblock.memory.regions[idx].base +
|
2011-12-08 19:22:07 +01:00
|
|
|
memblock.memory.regions[idx].size) >= end;
|
2010-07-12 06:36:09 +02:00
|
|
|
}
|
|
|
|
|
2012-05-24 09:45:21 +02:00
|
|
|
/**
|
|
|
|
* memblock_is_region_reserved - check if a region intersects reserved memory
|
|
|
|
* @base: base of region to check
|
|
|
|
* @size: size of region to check
|
|
|
|
*
|
|
|
|
* Check if the region [@base, @base+@size) intersects a reserved memory block.
|
|
|
|
*
|
|
|
|
* RETURNS:
|
|
|
|
* 0 if false, non-zero if true
|
|
|
|
*/
|
2010-07-28 07:43:02 +02:00
|
|
|
int __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size)
|
2010-07-12 06:36:09 +02:00
|
|
|
{
|
2011-12-08 19:22:07 +01:00
|
|
|
memblock_cap_size(base, &size);
|
2010-08-04 06:17:17 +02:00
|
|
|
return memblock_overlaps_region(&memblock.reserved, base, size) >= 0;
|
2010-07-12 06:36:09 +02:00
|
|
|
}
|
|
|
|
|
2012-10-23 01:35:18 +02:00
|
|
|
void __init_memblock memblock_trim_memory(phys_addr_t align)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
phys_addr_t start, end, orig_start, orig_end;
|
|
|
|
struct memblock_type *mem = &memblock.memory;
|
|
|
|
|
|
|
|
for (i = 0; i < mem->cnt; i++) {
|
|
|
|
orig_start = mem->regions[i].base;
|
|
|
|
orig_end = mem->regions[i].base + mem->regions[i].size;
|
|
|
|
start = round_up(orig_start, align);
|
|
|
|
end = round_down(orig_end, align);
|
|
|
|
|
|
|
|
if (start == orig_start && end == orig_end)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (start < end) {
|
|
|
|
mem->regions[i].base = start;
|
|
|
|
mem->regions[i].size = end - start;
|
|
|
|
} else {
|
|
|
|
memblock_remove_region(mem, i);
|
|
|
|
i--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2010-07-07 00:39:01 +02:00
|
|
|
|
2010-09-15 22:05:29 +02:00
|
|
|
void __init_memblock memblock_set_current_limit(phys_addr_t limit)
|
2010-07-07 00:39:01 +02:00
|
|
|
{
|
|
|
|
memblock.current_limit = limit;
|
|
|
|
}
|
|
|
|
|
2014-02-27 01:23:43 +01:00
|
|
|
phys_addr_t __init_memblock memblock_get_current_limit(void)
|
|
|
|
{
|
|
|
|
return memblock.current_limit;
|
|
|
|
}
|
|
|
|
|
2011-07-14 11:43:42 +02:00
|
|
|
static void __init_memblock memblock_dump(struct memblock_type *type, char *name)
|
2010-07-12 06:36:48 +02:00
|
|
|
{
|
|
|
|
unsigned long long base, size;
|
2014-01-22 00:49:20 +01:00
|
|
|
unsigned long flags;
|
2010-07-12 06:36:48 +02:00
|
|
|
int i;
|
|
|
|
|
2011-07-14 11:43:42 +02:00
|
|
|
pr_info(" %s.cnt = 0x%lx\n", name, type->cnt);
|
2010-07-12 06:36:48 +02:00
|
|
|
|
2011-07-14 11:43:42 +02:00
|
|
|
for (i = 0; i < type->cnt; i++) {
|
|
|
|
struct memblock_region *rgn = &type->regions[i];
|
|
|
|
char nid_buf[32] = "";
|
|
|
|
|
|
|
|
base = rgn->base;
|
|
|
|
size = rgn->size;
|
2014-01-22 00:49:20 +01:00
|
|
|
flags = rgn->flags;
|
2011-07-14 11:43:42 +02:00
|
|
|
#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
|
|
|
|
if (memblock_get_region_node(rgn) != MAX_NUMNODES)
|
|
|
|
snprintf(nid_buf, sizeof(nid_buf), " on node %d",
|
|
|
|
memblock_get_region_node(rgn));
|
|
|
|
#endif
|
2014-01-22 00:49:20 +01:00
|
|
|
pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s flags: %#lx\n",
|
|
|
|
name, i, base, base + size - 1, size, nid_buf, flags);
|
2010-07-12 06:36:48 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-12-08 19:22:06 +01:00
|
|
|
void __init_memblock __memblock_dump_all(void)
|
2010-07-12 06:36:48 +02:00
|
|
|
{
|
|
|
|
pr_info("MEMBLOCK configuration:\n");
|
2011-12-08 19:22:08 +01:00
|
|
|
pr_info(" memory size = %#llx reserved size = %#llx\n",
|
|
|
|
(unsigned long long)memblock.memory.total_size,
|
|
|
|
(unsigned long long)memblock.reserved.total_size);
|
2010-07-12 06:36:48 +02:00
|
|
|
|
|
|
|
memblock_dump(&memblock.memory, "memory");
|
|
|
|
memblock_dump(&memblock.reserved, "reserved");
|
|
|
|
}
|
|
|
|
|
2011-12-08 19:22:08 +01:00
|
|
|
void __init memblock_allow_resize(void)
|
2010-07-12 06:36:48 +02:00
|
|
|
{
|
2010-07-07 00:39:13 +02:00
|
|
|
memblock_can_resize = 1;
|
2010-07-12 06:36:48 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
static int __init early_memblock(char *p)
|
|
|
|
{
|
|
|
|
if (p && strstr(p, "debug"))
|
|
|
|
memblock_debug = 1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
early_param("memblock", early_memblock);
|
|
|
|
|
2011-07-14 11:46:03 +02:00
|
|
|
#if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
|
2010-07-07 00:39:19 +02:00
|
|
|
|
|
|
|
static int memblock_debug_show(struct seq_file *m, void *private)
|
|
|
|
{
|
|
|
|
struct memblock_type *type = m->private;
|
|
|
|
struct memblock_region *reg;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < type->cnt; i++) {
|
|
|
|
reg = &type->regions[i];
|
|
|
|
seq_printf(m, "%4d: ", i);
|
|
|
|
if (sizeof(phys_addr_t) == 4)
|
|
|
|
seq_printf(m, "0x%08lx..0x%08lx\n",
|
|
|
|
(unsigned long)reg->base,
|
|
|
|
(unsigned long)(reg->base + reg->size - 1));
|
|
|
|
else
|
|
|
|
seq_printf(m, "0x%016llx..0x%016llx\n",
|
|
|
|
(unsigned long long)reg->base,
|
|
|
|
(unsigned long long)(reg->base + reg->size - 1));
|
|
|
|
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int memblock_debug_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
return single_open(file, memblock_debug_show, inode->i_private);
|
|
|
|
}
|
|
|
|
|
|
|
|
static const struct file_operations memblock_debug_fops = {
|
|
|
|
.open = memblock_debug_open,
|
|
|
|
.read = seq_read,
|
|
|
|
.llseek = seq_lseek,
|
|
|
|
.release = single_release,
|
|
|
|
};
|
|
|
|
|
|
|
|
static int __init memblock_init_debugfs(void)
|
|
|
|
{
|
|
|
|
struct dentry *root = debugfs_create_dir("memblock", NULL);
|
|
|
|
if (!root)
|
|
|
|
return -ENXIO;
|
|
|
|
debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops);
|
|
|
|
debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
__initcall(memblock_init_debugfs);
|
|
|
|
|
|
|
|
#endif /* CONFIG_DEBUG_FS */
|