blob: 42b98af6a41586dd5eba8def1c12ac2d353e639c [file] [log] [blame]
Yinghai Lu95f72d12010-07-12 14:36:09 +10001/*
2 * Procedures for maintaining information about logical memory blocks.
3 *
4 * Peter Bergner, IBM Corp. June 2001.
5 * Copyright (C) 2001 Peter Bergner.
6 *
7 * This program is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version
10 * 2 of the License, or (at your option) any later version.
11 */
12
13#include <linux/kernel.h>
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -070014#include <linux/slab.h>
Yinghai Lu95f72d12010-07-12 14:36:09 +100015#include <linux/init.h>
16#include <linux/bitops.h>
Benjamin Herrenschmidt449e8df2010-07-06 15:39:07 -070017#include <linux/poison.h>
Benjamin Herrenschmidtc196f762010-07-06 15:39:16 -070018#include <linux/pfn.h>
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -070019#include <linux/debugfs.h>
20#include <linux/seq_file.h>
Yinghai Lu95f72d12010-07-12 14:36:09 +100021#include <linux/memblock.h>
22
Christoph Hellwigc4c5ad62016-07-28 15:48:06 -070023#include <asm/sections.h>
Santosh Shilimkar26f09e92014-01-21 15:50:19 -080024#include <linux/io.h>
25
26#include "internal.h"
Tang Chen79442ed2013-11-12 15:07:59 -080027
Tejun Heofe091c22011-12-08 10:22:07 -080028static struct memblock_region memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock;
29static struct memblock_region memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock;
Philipp Hachtmann70210ed2014-01-29 18:16:01 +010030#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
31static struct memblock_region memblock_physmem_init_regions[INIT_PHYSMEM_REGIONS] __initdata_memblock;
32#endif
Tejun Heofe091c22011-12-08 10:22:07 -080033
34struct memblock memblock __initdata_memblock = {
35 .memory.regions = memblock_memory_init_regions,
36 .memory.cnt = 1, /* empty dummy entry */
37 .memory.max = INIT_MEMBLOCK_REGIONS,
38
39 .reserved.regions = memblock_reserved_init_regions,
40 .reserved.cnt = 1, /* empty dummy entry */
41 .reserved.max = INIT_MEMBLOCK_REGIONS,
42
Philipp Hachtmann70210ed2014-01-29 18:16:01 +010043#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
44 .physmem.regions = memblock_physmem_init_regions,
45 .physmem.cnt = 1, /* empty dummy entry */
46 .physmem.max = INIT_PHYSMEM_REGIONS,
47#endif
48
Tang Chen79442ed2013-11-12 15:07:59 -080049 .bottom_up = false,
Tejun Heofe091c22011-12-08 10:22:07 -080050 .current_limit = MEMBLOCK_ALLOC_ANYWHERE,
51};
Yinghai Lu95f72d12010-07-12 14:36:09 +100052
Yinghai Lu10d06432010-07-28 15:43:02 +100053int memblock_debug __initdata_memblock;
Tang Chen55ac5902014-01-21 15:49:35 -080054#ifdef CONFIG_MOVABLE_NODE
55bool movable_node_enabled __initdata_memblock = false;
56#endif
Tony Lucka3f5baf2015-06-24 16:58:12 -070057static bool system_has_some_mirror __initdata_memblock = false;
Tejun Heo1aadc052011-12-08 10:22:08 -080058static int memblock_can_resize __initdata_memblock;
Gavin Shan181eb392012-05-29 15:06:50 -070059static int memblock_memory_in_slab __initdata_memblock = 0;
60static int memblock_reserved_in_slab __initdata_memblock = 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +100061
Tony Lucka3f5baf2015-06-24 16:58:12 -070062ulong __init_memblock choose_memblock_flags(void)
63{
64 return system_has_some_mirror ? MEMBLOCK_MIRROR : MEMBLOCK_NONE;
65}
66
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -070067/* inline so we don't get a warning when pr_debug is compiled out */
Raghavendra D Prabhuc2233112012-10-08 16:33:55 -070068static __init_memblock const char *
69memblock_type_name(struct memblock_type *type)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -070070{
71 if (type == &memblock.memory)
72 return "memory";
73 else if (type == &memblock.reserved)
74 return "reserved";
75 else
76 return "unknown";
77}
78
Tejun Heoeb18f1b2011-12-08 10:22:07 -080079/* adjust *@size so that (@base + *@size) doesn't overflow, return new size */
80static inline phys_addr_t memblock_cap_size(phys_addr_t base, phys_addr_t *size)
81{
82 return *size = min(*size, (phys_addr_t)ULLONG_MAX - base);
83}
84
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100085/*
86 * Address comparison utilities
87 */
Yinghai Lu10d06432010-07-28 15:43:02 +100088static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1,
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +100089 phys_addr_t base2, phys_addr_t size2)
Yinghai Lu95f72d12010-07-12 14:36:09 +100090{
91 return ((base1 < (base2 + size2)) && (base2 < (base1 + size1)));
92}
93
Tang Chen95cf82e2015-09-08 15:02:03 -070094bool __init_memblock memblock_overlaps_region(struct memblock_type *type,
H Hartley Sweeten2d7d3eb2011-10-31 17:09:15 -070095 phys_addr_t base, phys_addr_t size)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100096{
97 unsigned long i;
98
Alexander Kuleshovf14516f2016-01-14 15:20:39 -080099 for (i = 0; i < type->cnt; i++)
100 if (memblock_addrs_overlap(base, size, type->regions[i].base,
101 type->regions[i].size))
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000102 break;
Tang Chenc5c5c9d2015-09-08 15:02:00 -0700103 return i < type->cnt;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000104}
105
Tang Chen79442ed2013-11-12 15:07:59 -0800106/*
107 * __memblock_find_range_bottom_up - find free area utility in bottom-up
108 * @start: start of candidate range
109 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
110 * @size: size of free area to find
111 * @align: alignment of free area to find
Grygorii Strashkob1154232014-01-21 15:50:16 -0800112 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Tony Luckfc6daaf2015-06-24 16:58:09 -0700113 * @flags: pick from blocks based on memory attributes
Tang Chen79442ed2013-11-12 15:07:59 -0800114 *
115 * Utility called from memblock_find_in_range_node(), find free area bottom-up.
116 *
117 * RETURNS:
118 * Found address on success, 0 on failure.
119 */
120static phys_addr_t __init_memblock
121__memblock_find_range_bottom_up(phys_addr_t start, phys_addr_t end,
Tony Luckfc6daaf2015-06-24 16:58:09 -0700122 phys_addr_t size, phys_addr_t align, int nid,
123 ulong flags)
Tang Chen79442ed2013-11-12 15:07:59 -0800124{
125 phys_addr_t this_start, this_end, cand;
126 u64 i;
127
Tony Luckfc6daaf2015-06-24 16:58:09 -0700128 for_each_free_mem_range(i, nid, flags, &this_start, &this_end, NULL) {
Tang Chen79442ed2013-11-12 15:07:59 -0800129 this_start = clamp(this_start, start, end);
130 this_end = clamp(this_end, start, end);
131
132 cand = round_up(this_start, align);
133 if (cand < this_end && this_end - cand >= size)
134 return cand;
135 }
136
137 return 0;
138}
139
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800140/**
Tang Chen14028992013-11-12 15:07:57 -0800141 * __memblock_find_range_top_down - find free area utility, in top-down
142 * @start: start of candidate range
143 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
144 * @size: size of free area to find
145 * @align: alignment of free area to find
Grygorii Strashkob1154232014-01-21 15:50:16 -0800146 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Tony Luckfc6daaf2015-06-24 16:58:09 -0700147 * @flags: pick from blocks based on memory attributes
Tang Chen14028992013-11-12 15:07:57 -0800148 *
149 * Utility called from memblock_find_in_range_node(), find free area top-down.
150 *
151 * RETURNS:
Tang Chen79442ed2013-11-12 15:07:59 -0800152 * Found address on success, 0 on failure.
Tang Chen14028992013-11-12 15:07:57 -0800153 */
154static phys_addr_t __init_memblock
155__memblock_find_range_top_down(phys_addr_t start, phys_addr_t end,
Tony Luckfc6daaf2015-06-24 16:58:09 -0700156 phys_addr_t size, phys_addr_t align, int nid,
157 ulong flags)
Tang Chen14028992013-11-12 15:07:57 -0800158{
159 phys_addr_t this_start, this_end, cand;
160 u64 i;
161
Tony Luckfc6daaf2015-06-24 16:58:09 -0700162 for_each_free_mem_range_reverse(i, nid, flags, &this_start, &this_end,
163 NULL) {
Tang Chen14028992013-11-12 15:07:57 -0800164 this_start = clamp(this_start, start, end);
165 this_end = clamp(this_end, start, end);
166
167 if (this_end < size)
168 continue;
169
170 cand = round_down(this_end - size, align);
171 if (cand >= this_start)
172 return cand;
173 }
174
175 return 0;
176}
177
178/**
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800179 * memblock_find_in_range_node - find free area in given range and node
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800180 * @size: size of free area to find
181 * @align: alignment of free area to find
Grygorii Strashko87029ee2014-01-21 15:50:14 -0800182 * @start: start of candidate range
183 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
Grygorii Strashkob1154232014-01-21 15:50:16 -0800184 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Tony Luckfc6daaf2015-06-24 16:58:09 -0700185 * @flags: pick from blocks based on memory attributes
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800186 *
187 * Find @size free area aligned to @align in the specified range and node.
188 *
Tang Chen79442ed2013-11-12 15:07:59 -0800189 * When allocation direction is bottom-up, the @start should be greater
190 * than the end of the kernel image. Otherwise, it will be trimmed. The
191 * reason is that we want the bottom-up allocation just near the kernel
192 * image so it is highly likely that the allocated memory and the kernel
193 * will reside in the same node.
194 *
195 * If bottom-up allocation failed, will try to allocate memory top-down.
196 *
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800197 * RETURNS:
Tang Chen79442ed2013-11-12 15:07:59 -0800198 * Found address on success, 0 on failure.
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000199 */
Grygorii Strashko87029ee2014-01-21 15:50:14 -0800200phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t size,
201 phys_addr_t align, phys_addr_t start,
Tony Luckfc6daaf2015-06-24 16:58:09 -0700202 phys_addr_t end, int nid, ulong flags)
Tang Chenf7210e62013-02-22 16:33:51 -0800203{
Tang Chen0cfb8f02014-08-29 15:18:31 -0700204 phys_addr_t kernel_end, ret;
Tang Chen79442ed2013-11-12 15:07:59 -0800205
Tang Chenf7210e62013-02-22 16:33:51 -0800206 /* pump up @end */
207 if (end == MEMBLOCK_ALLOC_ACCESSIBLE)
208 end = memblock.current_limit;
209
210 /* avoid allocating the first page */
211 start = max_t(phys_addr_t, start, PAGE_SIZE);
212 end = max(start, end);
Tang Chen79442ed2013-11-12 15:07:59 -0800213 kernel_end = __pa_symbol(_end);
214
215 /*
216 * try bottom-up allocation only when bottom-up mode
217 * is set and @end is above the kernel image.
218 */
219 if (memblock_bottom_up() && end > kernel_end) {
220 phys_addr_t bottom_up_start;
221
222 /* make sure we will allocate above the kernel */
223 bottom_up_start = max(start, kernel_end);
224
225 /* ok, try bottom-up allocation first */
226 ret = __memblock_find_range_bottom_up(bottom_up_start, end,
Tony Luckfc6daaf2015-06-24 16:58:09 -0700227 size, align, nid, flags);
Tang Chen79442ed2013-11-12 15:07:59 -0800228 if (ret)
229 return ret;
230
231 /*
232 * we always limit bottom-up allocation above the kernel,
233 * but top-down allocation doesn't have the limit, so
234 * retrying top-down allocation may succeed when bottom-up
235 * allocation failed.
236 *
237 * bottom-up allocation is expected to be fail very rarely,
238 * so we use WARN_ONCE() here to see the stack trace if
239 * fail happens.
240 */
Joe Perches756a025f02016-03-17 14:19:47 -0700241 WARN_ONCE(1, "memblock: bottom-up allocation failed, memory hotunplug may be affected\n");
Tang Chen79442ed2013-11-12 15:07:59 -0800242 }
Tang Chenf7210e62013-02-22 16:33:51 -0800243
Tony Luckfc6daaf2015-06-24 16:58:09 -0700244 return __memblock_find_range_top_down(start, end, size, align, nid,
245 flags);
Tang Chenf7210e62013-02-22 16:33:51 -0800246}
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000247
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800248/**
249 * memblock_find_in_range - find free area in given range
250 * @start: start of candidate range
251 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
252 * @size: size of free area to find
253 * @align: alignment of free area to find
254 *
255 * Find @size free area aligned to @align in the specified range.
256 *
257 * RETURNS:
Tang Chen79442ed2013-11-12 15:07:59 -0800258 * Found address on success, 0 on failure.
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800259 */
260phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start,
261 phys_addr_t end, phys_addr_t size,
262 phys_addr_t align)
263{
Tony Lucka3f5baf2015-06-24 16:58:12 -0700264 phys_addr_t ret;
265 ulong flags = choose_memblock_flags();
266
267again:
268 ret = memblock_find_in_range_node(size, align, start, end,
269 NUMA_NO_NODE, flags);
270
271 if (!ret && (flags & MEMBLOCK_MIRROR)) {
272 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
273 &size);
274 flags &= ~MEMBLOCK_MIRROR;
275 goto again;
276 }
277
278 return ret;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800279}
280
Yinghai Lu10d06432010-07-28 15:43:02 +1000281static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000282{
Tejun Heo1440c4e2011-12-08 10:22:08 -0800283 type->total_size -= type->regions[r].size;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200284 memmove(&type->regions[r], &type->regions[r + 1],
285 (type->cnt - (r + 1)) * sizeof(type->regions[r]));
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000286 type->cnt--;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000287
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700288 /* Special case for empty arrays */
289 if (type->cnt == 0) {
Tejun Heo1440c4e2011-12-08 10:22:08 -0800290 WARN_ON(type->total_size != 0);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700291 type->cnt = 1;
292 type->regions[0].base = 0;
293 type->regions[0].size = 0;
Tang Chen66a20752014-01-21 15:49:20 -0800294 type->regions[0].flags = 0;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200295 memblock_set_region_node(&type->regions[0], MAX_NUMNODES);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700296 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000297}
298
Philipp Hachtmann354f17e2014-01-23 15:53:24 -0800299#ifdef CONFIG_ARCH_DISCARD_MEMBLOCK
Pavel Tatashin87395ee2017-08-18 15:16:05 -0700300/**
301 * Discard memory and reserved arrays if they were allocated
302 */
303void __init memblock_discard(void)
Yinghai Lu29f67382012-07-11 14:02:56 -0700304{
Pavel Tatashin87395ee2017-08-18 15:16:05 -0700305 phys_addr_t addr, size;
Yinghai Lu29f67382012-07-11 14:02:56 -0700306
Pavel Tatashin87395ee2017-08-18 15:16:05 -0700307 if (memblock.reserved.regions != memblock_reserved_init_regions) {
308 addr = __pa(memblock.reserved.regions);
309 size = PAGE_ALIGN(sizeof(struct memblock_region) *
310 memblock.reserved.max);
311 __memblock_free_late(addr, size);
312 }
Yinghai Lu29f67382012-07-11 14:02:56 -0700313
Pavel Tatashin9d263322017-08-25 15:55:46 -0700314 if (memblock.memory.regions != memblock_memory_init_regions) {
Pavel Tatashin87395ee2017-08-18 15:16:05 -0700315 addr = __pa(memblock.memory.regions);
316 size = PAGE_ALIGN(sizeof(struct memblock_region) *
317 memblock.memory.max);
318 __memblock_free_late(addr, size);
319 }
Yinghai Lu29f67382012-07-11 14:02:56 -0700320}
Philipp Hachtmann5e270e22014-01-23 15:53:11 -0800321#endif
322
Greg Pearson48c3b582012-06-20 12:53:05 -0700323/**
324 * memblock_double_array - double the size of the memblock regions array
325 * @type: memblock type of the regions array being doubled
326 * @new_area_start: starting address of memory range to avoid overlap with
327 * @new_area_size: size of memory range to avoid overlap with
328 *
329 * Double the size of the @type regions array. If memblock is being used to
330 * allocate memory for a new reserved regions array and there is a previously
331 * allocated memory range [@new_area_start,@new_area_start+@new_area_size]
332 * waiting to be reserved, ensure the memory used by the new array does
333 * not overlap.
334 *
335 * RETURNS:
336 * 0 on success, -1 on failure.
337 */
338static int __init_memblock memblock_double_array(struct memblock_type *type,
339 phys_addr_t new_area_start,
340 phys_addr_t new_area_size)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700341{
342 struct memblock_region *new_array, *old_array;
Yinghai Lu29f67382012-07-11 14:02:56 -0700343 phys_addr_t old_alloc_size, new_alloc_size;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700344 phys_addr_t old_size, new_size, addr;
345 int use_slab = slab_is_available();
Gavin Shan181eb392012-05-29 15:06:50 -0700346 int *in_slab;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700347
348 /* We don't allow resizing until we know about the reserved regions
349 * of memory that aren't suitable for allocation
350 */
351 if (!memblock_can_resize)
352 return -1;
353
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700354 /* Calculate new doubled size */
355 old_size = type->max * sizeof(struct memblock_region);
356 new_size = old_size << 1;
Yinghai Lu29f67382012-07-11 14:02:56 -0700357 /*
358 * We need to allocated new one align to PAGE_SIZE,
359 * so we can free them completely later.
360 */
361 old_alloc_size = PAGE_ALIGN(old_size);
362 new_alloc_size = PAGE_ALIGN(new_size);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700363
Gavin Shan181eb392012-05-29 15:06:50 -0700364 /* Retrieve the slab flag */
365 if (type == &memblock.memory)
366 in_slab = &memblock_memory_in_slab;
367 else
368 in_slab = &memblock_reserved_in_slab;
369
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700370 /* Try to find some space for it.
371 *
372 * WARNING: We assume that either slab_is_available() and we use it or
Andrew Mortonfd073832012-07-31 16:42:40 -0700373 * we use MEMBLOCK for allocations. That means that this is unsafe to
374 * use when bootmem is currently active (unless bootmem itself is
375 * implemented on top of MEMBLOCK which isn't the case yet)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700376 *
377 * This should however not be an issue for now, as we currently only
Andrew Mortonfd073832012-07-31 16:42:40 -0700378 * call into MEMBLOCK while it's still active, or much later when slab
379 * is active for memory hotplug operations
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700380 */
381 if (use_slab) {
382 new_array = kmalloc(new_size, GFP_KERNEL);
Tejun Heo1f5026a2011-07-12 09:58:09 +0200383 addr = new_array ? __pa(new_array) : 0;
Gavin Shan4e2f0772012-05-29 15:06:50 -0700384 } else {
Greg Pearson48c3b582012-06-20 12:53:05 -0700385 /* only exclude range when trying to double reserved.regions */
386 if (type != &memblock.reserved)
387 new_area_start = new_area_size = 0;
388
389 addr = memblock_find_in_range(new_area_start + new_area_size,
390 memblock.current_limit,
Yinghai Lu29f67382012-07-11 14:02:56 -0700391 new_alloc_size, PAGE_SIZE);
Greg Pearson48c3b582012-06-20 12:53:05 -0700392 if (!addr && new_area_size)
393 addr = memblock_find_in_range(0,
Andrew Mortonfd073832012-07-31 16:42:40 -0700394 min(new_area_start, memblock.current_limit),
395 new_alloc_size, PAGE_SIZE);
Greg Pearson48c3b582012-06-20 12:53:05 -0700396
Sachin Kamat15674862012-09-04 13:55:05 +0530397 new_array = addr ? __va(addr) : NULL;
Gavin Shan4e2f0772012-05-29 15:06:50 -0700398 }
Tejun Heo1f5026a2011-07-12 09:58:09 +0200399 if (!addr) {
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700400 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
401 memblock_type_name(type), type->max, type->max * 2);
402 return -1;
403 }
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700404
Andrew Mortonfd073832012-07-31 16:42:40 -0700405 memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]",
406 memblock_type_name(type), type->max * 2, (u64)addr,
407 (u64)addr + new_size - 1);
Yinghai Luea9e4372010-07-28 15:13:22 +1000408
Andrew Mortonfd073832012-07-31 16:42:40 -0700409 /*
410 * Found space, we now need to move the array over before we add the
411 * reserved region since it may be our reserved array itself that is
412 * full.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700413 */
414 memcpy(new_array, type->regions, old_size);
415 memset(new_array + type->max, 0, old_size);
416 old_array = type->regions;
417 type->regions = new_array;
418 type->max <<= 1;
419
Andrew Mortonfd073832012-07-31 16:42:40 -0700420 /* Free old array. We needn't free it if the array is the static one */
Gavin Shan181eb392012-05-29 15:06:50 -0700421 if (*in_slab)
422 kfree(old_array);
423 else if (old_array != memblock_memory_init_regions &&
424 old_array != memblock_reserved_init_regions)
Yinghai Lu29f67382012-07-11 14:02:56 -0700425 memblock_free(__pa(old_array), old_alloc_size);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700426
Andrew Mortonfd073832012-07-31 16:42:40 -0700427 /*
428 * Reserve the new array if that comes from the memblock. Otherwise, we
429 * needn't do it
Gavin Shan181eb392012-05-29 15:06:50 -0700430 */
431 if (!use_slab)
Yinghai Lu29f67382012-07-11 14:02:56 -0700432 BUG_ON(memblock_reserve(addr, new_alloc_size));
Gavin Shan181eb392012-05-29 15:06:50 -0700433
434 /* Update slab flag */
435 *in_slab = use_slab;
436
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700437 return 0;
438}
439
Tejun Heo784656f92011-07-12 11:15:55 +0200440/**
441 * memblock_merge_regions - merge neighboring compatible regions
442 * @type: memblock type to scan
443 *
444 * Scan @type and merge neighboring compatible regions.
445 */
446static void __init_memblock memblock_merge_regions(struct memblock_type *type)
447{
448 int i = 0;
449
450 /* cnt never goes below 1 */
451 while (i < type->cnt - 1) {
452 struct memblock_region *this = &type->regions[i];
453 struct memblock_region *next = &type->regions[i + 1];
454
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200455 if (this->base + this->size != next->base ||
456 memblock_get_region_node(this) !=
Tang Chen66a20752014-01-21 15:49:20 -0800457 memblock_get_region_node(next) ||
458 this->flags != next->flags) {
Tejun Heo784656f92011-07-12 11:15:55 +0200459 BUG_ON(this->base + this->size > next->base);
460 i++;
461 continue;
462 }
463
464 this->size += next->size;
Lin Fengc0232ae2013-01-11 14:31:44 -0800465 /* move forward from next + 1, index of which is i + 2 */
466 memmove(next, next + 1, (type->cnt - (i + 2)) * sizeof(*next));
Tejun Heo784656f92011-07-12 11:15:55 +0200467 type->cnt--;
468 }
469}
470
471/**
472 * memblock_insert_region - insert new memblock region
Tang Chen209ff862013-04-29 15:08:41 -0700473 * @type: memblock type to insert into
474 * @idx: index for the insertion point
475 * @base: base address of the new region
476 * @size: size of the new region
477 * @nid: node id of the new region
Tang Chen66a20752014-01-21 15:49:20 -0800478 * @flags: flags of the new region
Tejun Heo784656f92011-07-12 11:15:55 +0200479 *
480 * Insert new memblock region [@base,@base+@size) into @type at @idx.
Alexander Kuleshov412d0002016-08-04 15:31:46 -0700481 * @type must already have extra room to accommodate the new region.
Tejun Heo784656f92011-07-12 11:15:55 +0200482 */
483static void __init_memblock memblock_insert_region(struct memblock_type *type,
484 int idx, phys_addr_t base,
Tang Chen66a20752014-01-21 15:49:20 -0800485 phys_addr_t size,
486 int nid, unsigned long flags)
Tejun Heo784656f92011-07-12 11:15:55 +0200487{
488 struct memblock_region *rgn = &type->regions[idx];
489
490 BUG_ON(type->cnt >= type->max);
491 memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn));
492 rgn->base = base;
493 rgn->size = size;
Tang Chen66a20752014-01-21 15:49:20 -0800494 rgn->flags = flags;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200495 memblock_set_region_node(rgn, nid);
Tejun Heo784656f92011-07-12 11:15:55 +0200496 type->cnt++;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800497 type->total_size += size;
Tejun Heo784656f92011-07-12 11:15:55 +0200498}
499
500/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100501 * memblock_add_range - add new memblock region
Tejun Heo784656f92011-07-12 11:15:55 +0200502 * @type: memblock type to add new region into
503 * @base: base address of the new region
504 * @size: size of the new region
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800505 * @nid: nid of the new region
Tang Chen66a20752014-01-21 15:49:20 -0800506 * @flags: flags of the new region
Tejun Heo784656f92011-07-12 11:15:55 +0200507 *
508 * Add new memblock region [@base,@base+@size) into @type. The new region
509 * is allowed to overlap with existing ones - overlaps don't affect already
510 * existing regions. @type is guaranteed to be minimal (all neighbouring
511 * compatible regions are merged) after the addition.
512 *
513 * RETURNS:
514 * 0 on success, -errno on failure.
515 */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100516int __init_memblock memblock_add_range(struct memblock_type *type,
Tang Chen66a20752014-01-21 15:49:20 -0800517 phys_addr_t base, phys_addr_t size,
518 int nid, unsigned long flags)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000519{
Tejun Heo784656f92011-07-12 11:15:55 +0200520 bool insert = false;
Tejun Heoeb18f1b2011-12-08 10:22:07 -0800521 phys_addr_t obase = base;
522 phys_addr_t end = base + memblock_cap_size(base, &size);
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800523 int idx, nr_new;
524 struct memblock_region *rgn;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000525
Tejun Heob3dc6272012-04-20 08:31:34 -0700526 if (!size)
527 return 0;
528
Tejun Heo784656f92011-07-12 11:15:55 +0200529 /* special case for empty array */
530 if (type->regions[0].size == 0) {
Tejun Heo1440c4e2011-12-08 10:22:08 -0800531 WARN_ON(type->cnt != 1 || type->total_size);
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000532 type->regions[0].base = base;
533 type->regions[0].size = size;
Tang Chen66a20752014-01-21 15:49:20 -0800534 type->regions[0].flags = flags;
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800535 memblock_set_region_node(&type->regions[0], nid);
Tejun Heo1440c4e2011-12-08 10:22:08 -0800536 type->total_size = size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000537 return 0;
538 }
Tejun Heo784656f92011-07-12 11:15:55 +0200539repeat:
540 /*
541 * The following is executed twice. Once with %false @insert and
542 * then with %true. The first counts the number of regions needed
Alexander Kuleshov412d0002016-08-04 15:31:46 -0700543 * to accommodate the new area. The second actually inserts them.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700544 */
Tejun Heo784656f92011-07-12 11:15:55 +0200545 base = obase;
546 nr_new = 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000547
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800548 for_each_memblock_type(type, rgn) {
Tejun Heo784656f92011-07-12 11:15:55 +0200549 phys_addr_t rbase = rgn->base;
550 phys_addr_t rend = rbase + rgn->size;
551
552 if (rbase >= end)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000553 break;
Tejun Heo784656f92011-07-12 11:15:55 +0200554 if (rend <= base)
555 continue;
556 /*
557 * @rgn overlaps. If it separates the lower part of new
558 * area, insert that portion.
559 */
560 if (rbase > base) {
Wei Yangc0a29492015-09-04 15:47:38 -0700561#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
562 WARN_ON(nid != memblock_get_region_node(rgn));
563#endif
Wei Yang4fcab5f2015-09-08 14:59:53 -0700564 WARN_ON(flags != rgn->flags);
Tejun Heo784656f92011-07-12 11:15:55 +0200565 nr_new++;
566 if (insert)
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800567 memblock_insert_region(type, idx++, base,
Tang Chen66a20752014-01-21 15:49:20 -0800568 rbase - base, nid,
569 flags);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000570 }
Tejun Heo784656f92011-07-12 11:15:55 +0200571 /* area below @rend is dealt with, forget about it */
572 base = min(rend, end);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000573 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000574
Tejun Heo784656f92011-07-12 11:15:55 +0200575 /* insert the remaining portion */
576 if (base < end) {
577 nr_new++;
578 if (insert)
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800579 memblock_insert_region(type, idx, base, end - base,
Tang Chen66a20752014-01-21 15:49:20 -0800580 nid, flags);
Tejun Heo784656f92011-07-12 11:15:55 +0200581 }
582
nimisoloef3cc4d2016-07-26 15:24:56 -0700583 if (!nr_new)
584 return 0;
585
Tejun Heo784656f92011-07-12 11:15:55 +0200586 /*
587 * If this was the first round, resize array and repeat for actual
588 * insertions; otherwise, merge and return.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700589 */
Tejun Heo784656f92011-07-12 11:15:55 +0200590 if (!insert) {
591 while (type->cnt + nr_new > type->max)
Greg Pearson48c3b582012-06-20 12:53:05 -0700592 if (memblock_double_array(type, obase, size) < 0)
Tejun Heo784656f92011-07-12 11:15:55 +0200593 return -ENOMEM;
594 insert = true;
595 goto repeat;
596 } else {
597 memblock_merge_regions(type);
598 return 0;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700599 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000600}
601
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800602int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size,
603 int nid)
604{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100605 return memblock_add_range(&memblock.memory, base, size, nid, 0);
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800606}
607
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700608int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size)
Alexander Kuleshov6a4055b2015-04-15 16:14:44 -0700609{
Alexander Kuleshov6a4055b2015-04-15 16:14:44 -0700610 memblock_dbg("memblock_add: [%#016llx-%#016llx] flags %#02lx %pF\n",
611 (unsigned long long)base,
612 (unsigned long long)base + size - 1,
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700613 0UL, (void *)_RET_IP_);
Alexander Kuleshov6a4055b2015-04-15 16:14:44 -0700614
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700615 return memblock_add_range(&memblock.memory, base, size, MAX_NUMNODES, 0);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000616}
617
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800618/**
619 * memblock_isolate_range - isolate given range into disjoint memblocks
620 * @type: memblock type to isolate range for
621 * @base: base of range to isolate
622 * @size: size of range to isolate
623 * @start_rgn: out parameter for the start of isolated region
624 * @end_rgn: out parameter for the end of isolated region
625 *
626 * Walk @type and ensure that regions don't cross the boundaries defined by
627 * [@base,@base+@size). Crossing regions are split at the boundaries,
628 * which may create at most two more regions. The index of the first
629 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
630 *
631 * RETURNS:
632 * 0 on success, -errno on failure.
633 */
634static int __init_memblock memblock_isolate_range(struct memblock_type *type,
635 phys_addr_t base, phys_addr_t size,
636 int *start_rgn, int *end_rgn)
637{
Tejun Heoeb18f1b2011-12-08 10:22:07 -0800638 phys_addr_t end = base + memblock_cap_size(base, &size);
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800639 int idx;
640 struct memblock_region *rgn;
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800641
642 *start_rgn = *end_rgn = 0;
643
Tejun Heob3dc6272012-04-20 08:31:34 -0700644 if (!size)
645 return 0;
646
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800647 /* we'll create at most two more regions */
648 while (type->cnt + 2 > type->max)
Greg Pearson48c3b582012-06-20 12:53:05 -0700649 if (memblock_double_array(type, base, size) < 0)
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800650 return -ENOMEM;
651
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800652 for_each_memblock_type(type, rgn) {
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800653 phys_addr_t rbase = rgn->base;
654 phys_addr_t rend = rbase + rgn->size;
655
656 if (rbase >= end)
657 break;
658 if (rend <= base)
659 continue;
660
661 if (rbase < base) {
662 /*
663 * @rgn intersects from below. Split and continue
664 * to process the next region - the new top half.
665 */
666 rgn->base = base;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800667 rgn->size -= base - rbase;
668 type->total_size -= base - rbase;
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800669 memblock_insert_region(type, idx, rbase, base - rbase,
Tang Chen66a20752014-01-21 15:49:20 -0800670 memblock_get_region_node(rgn),
671 rgn->flags);
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800672 } else if (rend > end) {
673 /*
674 * @rgn intersects from above. Split and redo the
675 * current region - the new bottom half.
676 */
677 rgn->base = end;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800678 rgn->size -= end - rbase;
679 type->total_size -= end - rbase;
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800680 memblock_insert_region(type, idx--, rbase, end - rbase,
Tang Chen66a20752014-01-21 15:49:20 -0800681 memblock_get_region_node(rgn),
682 rgn->flags);
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800683 } else {
684 /* @rgn is fully contained, record it */
685 if (!*end_rgn)
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800686 *start_rgn = idx;
687 *end_rgn = idx + 1;
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800688 }
689 }
690
691 return 0;
692}
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800693
Alexander Kuleshov35bd16a2015-11-05 18:47:00 -0800694static int __init_memblock memblock_remove_range(struct memblock_type *type,
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100695 phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000696{
Tejun Heo71936182011-12-08 10:22:07 -0800697 int start_rgn, end_rgn;
698 int i, ret;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000699
Tejun Heo71936182011-12-08 10:22:07 -0800700 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
701 if (ret)
702 return ret;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000703
Tejun Heo71936182011-12-08 10:22:07 -0800704 for (i = end_rgn - 1; i >= start_rgn; i--)
705 memblock_remove_region(type, i);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700706 return 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000707}
708
Tejun Heo581adcb2011-12-08 10:22:06 -0800709int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000710{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100711 return memblock_remove_range(&memblock.memory, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000712}
713
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100714
Tejun Heo581adcb2011-12-08 10:22:06 -0800715int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000716{
Tejun Heo24aa0782011-07-12 11:16:06 +0200717 memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n",
H. Peter Anvina1504392011-07-14 11:57:10 -0700718 (unsigned long long)base,
Grygorii Strashko931d13f2014-01-21 15:49:17 -0800719 (unsigned long long)base + size - 1,
H. Peter Anvina1504392011-07-14 11:57:10 -0700720 (void *)_RET_IP_);
Tejun Heo24aa0782011-07-12 11:16:06 +0200721
Catalin Marinas9099dae2016-10-11 13:55:11 -0700722 kmemleak_free_part_phys(base, size);
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100723 return memblock_remove_range(&memblock.reserved, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000724}
725
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700726int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000727{
Tang Chen66a20752014-01-21 15:49:20 -0800728 memblock_dbg("memblock_reserve: [%#016llx-%#016llx] flags %#02lx %pF\n",
H. Peter Anvina1504392011-07-14 11:57:10 -0700729 (unsigned long long)base,
Grygorii Strashko931d13f2014-01-21 15:49:17 -0800730 (unsigned long long)base + size - 1,
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700731 0UL, (void *)_RET_IP_);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000732
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700733 return memblock_add_range(&memblock.reserved, base, size, MAX_NUMNODES, 0);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000734}
735
Tejun Heo35fd0802011-07-12 11:15:59 +0200736/**
Tang Chen66b16ed2014-01-21 15:49:23 -0800737 *
Tony Luck4308ce12014-12-12 16:54:59 -0800738 * This function isolates region [@base, @base + @size), and sets/clears flag
Tang Chen66b16ed2014-01-21 15:49:23 -0800739 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700740 * Return 0 on success, -errno on failure.
Tang Chen66b16ed2014-01-21 15:49:23 -0800741 */
Tony Luck4308ce12014-12-12 16:54:59 -0800742static int __init_memblock memblock_setclr_flag(phys_addr_t base,
743 phys_addr_t size, int set, int flag)
Tang Chen66b16ed2014-01-21 15:49:23 -0800744{
745 struct memblock_type *type = &memblock.memory;
746 int i, ret, start_rgn, end_rgn;
747
748 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
749 if (ret)
750 return ret;
751
752 for (i = start_rgn; i < end_rgn; i++)
Tony Luck4308ce12014-12-12 16:54:59 -0800753 if (set)
754 memblock_set_region_flags(&type->regions[i], flag);
755 else
756 memblock_clear_region_flags(&type->regions[i], flag);
Tang Chen66b16ed2014-01-21 15:49:23 -0800757
758 memblock_merge_regions(type);
759 return 0;
760}
761
762/**
Tony Luck4308ce12014-12-12 16:54:59 -0800763 * memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG.
764 * @base: the base phys addr of the region
765 * @size: the size of the region
766 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700767 * Return 0 on success, -errno on failure.
Tony Luck4308ce12014-12-12 16:54:59 -0800768 */
769int __init_memblock memblock_mark_hotplug(phys_addr_t base, phys_addr_t size)
770{
771 return memblock_setclr_flag(base, size, 1, MEMBLOCK_HOTPLUG);
772}
773
774/**
Tang Chen66b16ed2014-01-21 15:49:23 -0800775 * memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region.
776 * @base: the base phys addr of the region
777 * @size: the size of the region
778 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700779 * Return 0 on success, -errno on failure.
Tang Chen66b16ed2014-01-21 15:49:23 -0800780 */
781int __init_memblock memblock_clear_hotplug(phys_addr_t base, phys_addr_t size)
782{
Tony Luck4308ce12014-12-12 16:54:59 -0800783 return memblock_setclr_flag(base, size, 0, MEMBLOCK_HOTPLUG);
Tang Chen66b16ed2014-01-21 15:49:23 -0800784}
785
786/**
Tony Lucka3f5baf2015-06-24 16:58:12 -0700787 * memblock_mark_mirror - Mark mirrored memory with flag MEMBLOCK_MIRROR.
788 * @base: the base phys addr of the region
789 * @size: the size of the region
790 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700791 * Return 0 on success, -errno on failure.
Tony Lucka3f5baf2015-06-24 16:58:12 -0700792 */
793int __init_memblock memblock_mark_mirror(phys_addr_t base, phys_addr_t size)
794{
795 system_has_some_mirror = true;
796
797 return memblock_setclr_flag(base, size, 1, MEMBLOCK_MIRROR);
798}
799
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +0100800/**
801 * memblock_mark_nomap - Mark a memory region with flag MEMBLOCK_NOMAP.
802 * @base: the base phys addr of the region
803 * @size: the size of the region
804 *
805 * Return 0 on success, -errno on failure.
806 */
807int __init_memblock memblock_mark_nomap(phys_addr_t base, phys_addr_t size)
808{
809 return memblock_setclr_flag(base, size, 1, MEMBLOCK_NOMAP);
810}
Tony Lucka3f5baf2015-06-24 16:58:12 -0700811
812/**
Robin Holt8e7a7f82015-06-30 14:56:41 -0700813 * __next_reserved_mem_region - next function for for_each_reserved_region()
814 * @idx: pointer to u64 loop variable
815 * @out_start: ptr to phys_addr_t for start address of the region, can be %NULL
816 * @out_end: ptr to phys_addr_t for end address of the region, can be %NULL
817 *
818 * Iterate over all reserved memory regions.
819 */
820void __init_memblock __next_reserved_mem_region(u64 *idx,
821 phys_addr_t *out_start,
822 phys_addr_t *out_end)
823{
Alexander Kuleshov567d1172015-09-08 15:03:33 -0700824 struct memblock_type *type = &memblock.reserved;
Robin Holt8e7a7f82015-06-30 14:56:41 -0700825
Richard Leitnercd33a762016-05-20 16:58:33 -0700826 if (*idx < type->cnt) {
Alexander Kuleshov567d1172015-09-08 15:03:33 -0700827 struct memblock_region *r = &type->regions[*idx];
Robin Holt8e7a7f82015-06-30 14:56:41 -0700828 phys_addr_t base = r->base;
829 phys_addr_t size = r->size;
830
831 if (out_start)
832 *out_start = base;
833 if (out_end)
834 *out_end = base + size - 1;
835
836 *idx += 1;
837 return;
838 }
839
840 /* signal end of iteration */
841 *idx = ULLONG_MAX;
842}
843
844/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100845 * __next__mem_range - next function for for_each_free_mem_range() etc.
Tejun Heo35fd0802011-07-12 11:15:59 +0200846 * @idx: pointer to u64 loop variable
Grygorii Strashkob1154232014-01-21 15:50:16 -0800847 * @nid: node selector, %NUMA_NO_NODE for all nodes
Tony Luckfc6daaf2015-06-24 16:58:09 -0700848 * @flags: pick from blocks based on memory attributes
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100849 * @type_a: pointer to memblock_type from where the range is taken
850 * @type_b: pointer to memblock_type which excludes memory from being taken
Wanpeng Lidad75572012-06-20 12:53:01 -0700851 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
852 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
853 * @out_nid: ptr to int for nid of the range, can be %NULL
Tejun Heo35fd0802011-07-12 11:15:59 +0200854 *
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100855 * Find the first area from *@idx which matches @nid, fill the out
Tejun Heo35fd0802011-07-12 11:15:59 +0200856 * parameters, and update *@idx for the next iteration. The lower 32bit of
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100857 * *@idx contains index into type_a and the upper 32bit indexes the
858 * areas before each region in type_b. For example, if type_b regions
Tejun Heo35fd0802011-07-12 11:15:59 +0200859 * look like the following,
860 *
861 * 0:[0-16), 1:[32-48), 2:[128-130)
862 *
863 * The upper 32bit indexes the following regions.
864 *
865 * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX)
866 *
867 * As both region arrays are sorted, the function advances the two indices
868 * in lockstep and returns each intersection.
869 */
Tony Luckfc6daaf2015-06-24 16:58:09 -0700870void __init_memblock __next_mem_range(u64 *idx, int nid, ulong flags,
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100871 struct memblock_type *type_a,
872 struct memblock_type *type_b,
873 phys_addr_t *out_start,
874 phys_addr_t *out_end, int *out_nid)
Tejun Heo35fd0802011-07-12 11:15:59 +0200875{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100876 int idx_a = *idx & 0xffffffff;
877 int idx_b = *idx >> 32;
Grygorii Strashkob1154232014-01-21 15:50:16 -0800878
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100879 if (WARN_ONCE(nid == MAX_NUMNODES,
880 "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
Grygorii Strashko560dca272014-01-21 15:50:55 -0800881 nid = NUMA_NO_NODE;
Tejun Heo35fd0802011-07-12 11:15:59 +0200882
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100883 for (; idx_a < type_a->cnt; idx_a++) {
884 struct memblock_region *m = &type_a->regions[idx_a];
885
Tejun Heo35fd0802011-07-12 11:15:59 +0200886 phys_addr_t m_start = m->base;
887 phys_addr_t m_end = m->base + m->size;
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100888 int m_nid = memblock_get_region_node(m);
Tejun Heo35fd0802011-07-12 11:15:59 +0200889
890 /* only memory regions are associated with nodes, check it */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100891 if (nid != NUMA_NO_NODE && nid != m_nid)
Tejun Heo35fd0802011-07-12 11:15:59 +0200892 continue;
893
Xishi Qiu0a313a92014-09-09 14:50:46 -0700894 /* skip hotpluggable memory regions if needed */
895 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
896 continue;
897
Tony Lucka3f5baf2015-06-24 16:58:12 -0700898 /* if we want mirror memory skip non-mirror memory regions */
899 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
900 continue;
901
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +0100902 /* skip nomap memory unless we were asked for it explicitly */
903 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
904 continue;
905
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100906 if (!type_b) {
907 if (out_start)
908 *out_start = m_start;
909 if (out_end)
910 *out_end = m_end;
911 if (out_nid)
912 *out_nid = m_nid;
913 idx_a++;
914 *idx = (u32)idx_a | (u64)idx_b << 32;
915 return;
916 }
Tejun Heo35fd0802011-07-12 11:15:59 +0200917
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100918 /* scan areas before each reservation */
919 for (; idx_b < type_b->cnt + 1; idx_b++) {
920 struct memblock_region *r;
921 phys_addr_t r_start;
922 phys_addr_t r_end;
923
924 r = &type_b->regions[idx_b];
925 r_start = idx_b ? r[-1].base + r[-1].size : 0;
926 r_end = idx_b < type_b->cnt ?
927 r->base : ULLONG_MAX;
928
929 /*
930 * if idx_b advanced past idx_a,
931 * break out to advance idx_a
932 */
Tejun Heo35fd0802011-07-12 11:15:59 +0200933 if (r_start >= m_end)
934 break;
935 /* if the two regions intersect, we're done */
936 if (m_start < r_end) {
937 if (out_start)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100938 *out_start =
939 max(m_start, r_start);
Tejun Heo35fd0802011-07-12 11:15:59 +0200940 if (out_end)
941 *out_end = min(m_end, r_end);
942 if (out_nid)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100943 *out_nid = m_nid;
Tejun Heo35fd0802011-07-12 11:15:59 +0200944 /*
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100945 * The region which ends first is
946 * advanced for the next iteration.
Tejun Heo35fd0802011-07-12 11:15:59 +0200947 */
948 if (m_end <= r_end)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100949 idx_a++;
Tejun Heo35fd0802011-07-12 11:15:59 +0200950 else
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100951 idx_b++;
952 *idx = (u32)idx_a | (u64)idx_b << 32;
Tejun Heo35fd0802011-07-12 11:15:59 +0200953 return;
954 }
955 }
956 }
957
958 /* signal end of iteration */
959 *idx = ULLONG_MAX;
960}
961
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800962/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100963 * __next_mem_range_rev - generic next function for for_each_*_range_rev()
964 *
965 * Finds the next range from type_a which is not marked as unsuitable
966 * in type_b.
967 *
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800968 * @idx: pointer to u64 loop variable
Alexander Kuleshovad5ea8c2015-09-08 15:04:22 -0700969 * @nid: node selector, %NUMA_NO_NODE for all nodes
Tony Luckfc6daaf2015-06-24 16:58:09 -0700970 * @flags: pick from blocks based on memory attributes
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100971 * @type_a: pointer to memblock_type from where the range is taken
972 * @type_b: pointer to memblock_type which excludes memory from being taken
Wanpeng Lidad75572012-06-20 12:53:01 -0700973 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
974 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
975 * @out_nid: ptr to int for nid of the range, can be %NULL
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800976 *
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100977 * Reverse of __next_mem_range().
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800978 */
Tony Luckfc6daaf2015-06-24 16:58:09 -0700979void __init_memblock __next_mem_range_rev(u64 *idx, int nid, ulong flags,
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100980 struct memblock_type *type_a,
981 struct memblock_type *type_b,
982 phys_addr_t *out_start,
983 phys_addr_t *out_end, int *out_nid)
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800984{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100985 int idx_a = *idx & 0xffffffff;
986 int idx_b = *idx >> 32;
Grygorii Strashkob1154232014-01-21 15:50:16 -0800987
Grygorii Strashko560dca272014-01-21 15:50:55 -0800988 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
989 nid = NUMA_NO_NODE;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800990
991 if (*idx == (u64)ULLONG_MAX) {
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100992 idx_a = type_a->cnt - 1;
zijun_hue47608a2016-08-04 15:32:00 -0700993 if (type_b != NULL)
994 idx_b = type_b->cnt;
995 else
996 idx_b = 0;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800997 }
998
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100999 for (; idx_a >= 0; idx_a--) {
1000 struct memblock_region *m = &type_a->regions[idx_a];
1001
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001002 phys_addr_t m_start = m->base;
1003 phys_addr_t m_end = m->base + m->size;
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001004 int m_nid = memblock_get_region_node(m);
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001005
1006 /* only memory regions are associated with nodes, check it */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001007 if (nid != NUMA_NO_NODE && nid != m_nid)
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001008 continue;
1009
Tang Chen55ac5902014-01-21 15:49:35 -08001010 /* skip hotpluggable memory regions if needed */
1011 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
1012 continue;
1013
Tony Lucka3f5baf2015-06-24 16:58:12 -07001014 /* if we want mirror memory skip non-mirror memory regions */
1015 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
1016 continue;
1017
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +01001018 /* skip nomap memory unless we were asked for it explicitly */
1019 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
1020 continue;
1021
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001022 if (!type_b) {
1023 if (out_start)
1024 *out_start = m_start;
1025 if (out_end)
1026 *out_end = m_end;
1027 if (out_nid)
1028 *out_nid = m_nid;
zijun_hufb399b42016-07-28 15:48:56 -07001029 idx_a--;
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001030 *idx = (u32)idx_a | (u64)idx_b << 32;
1031 return;
1032 }
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001033
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001034 /* scan areas before each reservation */
1035 for (; idx_b >= 0; idx_b--) {
1036 struct memblock_region *r;
1037 phys_addr_t r_start;
1038 phys_addr_t r_end;
1039
1040 r = &type_b->regions[idx_b];
1041 r_start = idx_b ? r[-1].base + r[-1].size : 0;
1042 r_end = idx_b < type_b->cnt ?
1043 r->base : ULLONG_MAX;
1044 /*
1045 * if idx_b advanced past idx_a,
1046 * break out to advance idx_a
1047 */
1048
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001049 if (r_end <= m_start)
1050 break;
1051 /* if the two regions intersect, we're done */
1052 if (m_end > r_start) {
1053 if (out_start)
1054 *out_start = max(m_start, r_start);
1055 if (out_end)
1056 *out_end = min(m_end, r_end);
1057 if (out_nid)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001058 *out_nid = m_nid;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001059 if (m_start >= r_start)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001060 idx_a--;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001061 else
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001062 idx_b--;
1063 *idx = (u32)idx_a | (u64)idx_b << 32;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001064 return;
1065 }
1066 }
1067 }
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001068 /* signal end of iteration */
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001069 *idx = ULLONG_MAX;
1070}
1071
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001072#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1073/*
1074 * Common iterator interface used to define for_each_mem_range().
1075 */
1076void __init_memblock __next_mem_pfn_range(int *idx, int nid,
1077 unsigned long *out_start_pfn,
1078 unsigned long *out_end_pfn, int *out_nid)
1079{
1080 struct memblock_type *type = &memblock.memory;
1081 struct memblock_region *r;
1082
1083 while (++*idx < type->cnt) {
1084 r = &type->regions[*idx];
1085
1086 if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size))
1087 continue;
1088 if (nid == MAX_NUMNODES || nid == r->nid)
1089 break;
1090 }
1091 if (*idx >= type->cnt) {
1092 *idx = -1;
1093 return;
1094 }
1095
1096 if (out_start_pfn)
1097 *out_start_pfn = PFN_UP(r->base);
1098 if (out_end_pfn)
1099 *out_end_pfn = PFN_DOWN(r->base + r->size);
1100 if (out_nid)
1101 *out_nid = r->nid;
1102}
1103
1104/**
1105 * memblock_set_node - set node ID on memblock regions
1106 * @base: base of area to set node ID for
1107 * @size: size of area to set node ID for
Tang Chene7e8de52014-01-21 15:49:26 -08001108 * @type: memblock type to set node ID for
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001109 * @nid: node ID to set
1110 *
Tang Chene7e8de52014-01-21 15:49:26 -08001111 * Set the nid of memblock @type regions in [@base,@base+@size) to @nid.
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001112 * Regions which cross the area boundaries are split as necessary.
1113 *
1114 * RETURNS:
1115 * 0 on success, -errno on failure.
1116 */
1117int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size,
Tang Chene7e8de52014-01-21 15:49:26 -08001118 struct memblock_type *type, int nid)
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001119{
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001120 int start_rgn, end_rgn;
1121 int i, ret;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001122
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001123 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
1124 if (ret)
1125 return ret;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001126
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001127 for (i = start_rgn; i < end_rgn; i++)
Wanpeng Lie9d24ad2012-10-08 16:32:21 -07001128 memblock_set_region_node(&type->regions[i], nid);
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001129
1130 memblock_merge_regions(type);
1131 return 0;
1132}
1133#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
1134
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001135static phys_addr_t __init memblock_alloc_range_nid(phys_addr_t size,
1136 phys_addr_t align, phys_addr_t start,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001137 phys_addr_t end, int nid, ulong flags)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001138{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001139 phys_addr_t found;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001140
Grygorii Strashko79f40fa2014-01-21 15:50:12 -08001141 if (!align)
1142 align = SMP_CACHE_BYTES;
Vineet Gupta94f3d3a2013-04-29 15:06:15 -07001143
Tony Luckfc6daaf2015-06-24 16:58:09 -07001144 found = memblock_find_in_range_node(size, align, start, end, nid,
1145 flags);
Catalin Marinasaedf95e2014-06-06 14:38:20 -07001146 if (found && !memblock_reserve(found, size)) {
1147 /*
1148 * The min_count is set to 0 so that memblock allocations are
1149 * never reported as leaks.
1150 */
Catalin Marinas9099dae2016-10-11 13:55:11 -07001151 kmemleak_alloc_phys(found, size, 0, 0);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001152 return found;
Catalin Marinasaedf95e2014-06-06 14:38:20 -07001153 }
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001154 return 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001155}
1156
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001157phys_addr_t __init memblock_alloc_range(phys_addr_t size, phys_addr_t align,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001158 phys_addr_t start, phys_addr_t end,
1159 ulong flags)
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001160{
Tony Luckfc6daaf2015-06-24 16:58:09 -07001161 return memblock_alloc_range_nid(size, align, start, end, NUMA_NO_NODE,
1162 flags);
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001163}
1164
1165static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size,
1166 phys_addr_t align, phys_addr_t max_addr,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001167 int nid, ulong flags)
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001168{
Tony Luckfc6daaf2015-06-24 16:58:09 -07001169 return memblock_alloc_range_nid(size, align, 0, max_addr, nid, flags);
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001170}
1171
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001172phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid)
1173{
Tony Lucka3f5baf2015-06-24 16:58:12 -07001174 ulong flags = choose_memblock_flags();
1175 phys_addr_t ret;
1176
1177again:
1178 ret = memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE,
1179 nid, flags);
1180
1181 if (!ret && (flags & MEMBLOCK_MIRROR)) {
1182 flags &= ~MEMBLOCK_MIRROR;
1183 goto again;
1184 }
1185 return ret;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001186}
1187
1188phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
1189{
Tony Luckfc6daaf2015-06-24 16:58:09 -07001190 return memblock_alloc_base_nid(size, align, max_addr, NUMA_NO_NODE,
1191 MEMBLOCK_NONE);
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001192}
1193
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001194phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001195{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001196 phys_addr_t alloc;
1197
1198 alloc = __memblock_alloc_base(size, align, max_addr);
1199
1200 if (alloc == 0)
1201 panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n",
1202 (unsigned long long) size, (unsigned long long) max_addr);
1203
1204 return alloc;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001205}
1206
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001207phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001208{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001209 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001210}
1211
Benjamin Herrenschmidt9d1e2492010-07-06 15:39:17 -07001212phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid)
1213{
1214 phys_addr_t res = memblock_alloc_nid(size, align, nid);
1215
1216 if (res)
1217 return res;
Tejun Heo15fb0972011-07-12 09:58:07 +02001218 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001219}
1220
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001221/**
1222 * memblock_virt_alloc_internal - allocate boot memory block
1223 * @size: size of memory block to be allocated in bytes
1224 * @align: alignment of the region and block's size
1225 * @min_addr: the lower bound of the memory region to allocate (phys address)
1226 * @max_addr: the upper bound of the memory region to allocate (phys address)
1227 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1228 *
1229 * The @min_addr limit is dropped if it can not be satisfied and the allocation
1230 * will fall back to memory below @min_addr. Also, allocation may fall back
1231 * to any node in the system if the specified node can not
1232 * hold the requested memory.
1233 *
1234 * The allocation is performed from memory region limited by
1235 * memblock.current_limit if @max_addr == %BOOTMEM_ALLOC_ACCESSIBLE.
1236 *
1237 * The memory block is aligned on SMP_CACHE_BYTES if @align == 0.
1238 *
1239 * The phys address of allocated boot memory block is converted to virtual and
1240 * allocated memory is reset to 0.
1241 *
1242 * In addition, function sets the min_count to 0 using kmemleak_alloc for
1243 * allocated boot memory block, so that it is never reported as leaks.
1244 *
1245 * RETURNS:
1246 * Virtual address of allocated memory block on success, NULL on failure.
1247 */
1248static void * __init memblock_virt_alloc_internal(
1249 phys_addr_t size, phys_addr_t align,
1250 phys_addr_t min_addr, phys_addr_t max_addr,
1251 int nid)
1252{
1253 phys_addr_t alloc;
1254 void *ptr;
Tony Lucka3f5baf2015-06-24 16:58:12 -07001255 ulong flags = choose_memblock_flags();
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001256
Grygorii Strashko560dca272014-01-21 15:50:55 -08001257 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
1258 nid = NUMA_NO_NODE;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001259
1260 /*
1261 * Detect any accidental use of these APIs after slab is ready, as at
1262 * this moment memblock may be deinitialized already and its
1263 * internal data may be destroyed (after execution of free_all_bootmem)
1264 */
1265 if (WARN_ON_ONCE(slab_is_available()))
1266 return kzalloc_node(size, GFP_NOWAIT, nid);
1267
1268 if (!align)
1269 align = SMP_CACHE_BYTES;
1270
Yinghai Luf544e142014-01-29 14:05:52 -08001271 if (max_addr > memblock.current_limit)
1272 max_addr = memblock.current_limit;
1273
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001274again:
1275 alloc = memblock_find_in_range_node(size, align, min_addr, max_addr,
Tony Lucka3f5baf2015-06-24 16:58:12 -07001276 nid, flags);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001277 if (alloc)
1278 goto done;
1279
1280 if (nid != NUMA_NO_NODE) {
1281 alloc = memblock_find_in_range_node(size, align, min_addr,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001282 max_addr, NUMA_NO_NODE,
Tony Lucka3f5baf2015-06-24 16:58:12 -07001283 flags);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001284 if (alloc)
1285 goto done;
1286 }
1287
1288 if (min_addr) {
1289 min_addr = 0;
1290 goto again;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001291 }
1292
Tony Lucka3f5baf2015-06-24 16:58:12 -07001293 if (flags & MEMBLOCK_MIRROR) {
1294 flags &= ~MEMBLOCK_MIRROR;
1295 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
1296 &size);
1297 goto again;
1298 }
1299
1300 return NULL;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001301done:
1302 memblock_reserve(alloc, size);
1303 ptr = phys_to_virt(alloc);
1304 memset(ptr, 0, size);
1305
1306 /*
1307 * The min_count is set to 0 so that bootmem allocated blocks
1308 * are never reported as leaks. This is because many of these blocks
1309 * are only referred via the physical address which is not
1310 * looked up by kmemleak.
1311 */
1312 kmemleak_alloc(ptr, size, 0, 0);
1313
1314 return ptr;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001315}
1316
1317/**
1318 * memblock_virt_alloc_try_nid_nopanic - allocate boot memory block
1319 * @size: size of memory block to be allocated in bytes
1320 * @align: alignment of the region and block's size
1321 * @min_addr: the lower bound of the memory region from where the allocation
1322 * is preferred (phys address)
1323 * @max_addr: the upper bound of the memory region from where the allocation
1324 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1325 * allocate only from memory limited by memblock.current_limit value
1326 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1327 *
1328 * Public version of _memblock_virt_alloc_try_nid_nopanic() which provides
1329 * additional debug information (including caller info), if enabled.
1330 *
1331 * RETURNS:
1332 * Virtual address of allocated memory block on success, NULL on failure.
1333 */
1334void * __init memblock_virt_alloc_try_nid_nopanic(
1335 phys_addr_t size, phys_addr_t align,
1336 phys_addr_t min_addr, phys_addr_t max_addr,
1337 int nid)
1338{
1339 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1340 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1341 (u64)max_addr, (void *)_RET_IP_);
1342 return memblock_virt_alloc_internal(size, align, min_addr,
1343 max_addr, nid);
1344}
1345
1346/**
1347 * memblock_virt_alloc_try_nid - allocate boot memory block with panicking
1348 * @size: size of memory block to be allocated in bytes
1349 * @align: alignment of the region and block's size
1350 * @min_addr: the lower bound of the memory region from where the allocation
1351 * is preferred (phys address)
1352 * @max_addr: the upper bound of the memory region from where the allocation
1353 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1354 * allocate only from memory limited by memblock.current_limit value
1355 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1356 *
1357 * Public panicking version of _memblock_virt_alloc_try_nid_nopanic()
1358 * which provides debug information (including caller info), if enabled,
1359 * and panics if the request can not be satisfied.
1360 *
1361 * RETURNS:
1362 * Virtual address of allocated memory block on success, NULL on failure.
1363 */
1364void * __init memblock_virt_alloc_try_nid(
1365 phys_addr_t size, phys_addr_t align,
1366 phys_addr_t min_addr, phys_addr_t max_addr,
1367 int nid)
1368{
1369 void *ptr;
1370
1371 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1372 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1373 (u64)max_addr, (void *)_RET_IP_);
1374 ptr = memblock_virt_alloc_internal(size, align,
1375 min_addr, max_addr, nid);
1376 if (ptr)
1377 return ptr;
1378
1379 panic("%s: Failed to allocate %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx\n",
1380 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1381 (u64)max_addr);
1382 return NULL;
1383}
1384
1385/**
1386 * __memblock_free_early - free boot memory block
1387 * @base: phys starting address of the boot memory block
1388 * @size: size of the boot memory block in bytes
1389 *
1390 * Free boot memory block previously allocated by memblock_virt_alloc_xx() API.
1391 * The freeing memory will not be released to the buddy allocator.
1392 */
1393void __init __memblock_free_early(phys_addr_t base, phys_addr_t size)
1394{
1395 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1396 __func__, (u64)base, (u64)base + size - 1,
1397 (void *)_RET_IP_);
Catalin Marinas9099dae2016-10-11 13:55:11 -07001398 kmemleak_free_part_phys(base, size);
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001399 memblock_remove_range(&memblock.reserved, base, size);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001400}
1401
1402/*
1403 * __memblock_free_late - free bootmem block pages directly to buddy allocator
1404 * @addr: phys starting address of the boot memory block
1405 * @size: size of the boot memory block in bytes
1406 *
1407 * This is only useful when the bootmem allocator has already been torn
1408 * down, but we are still initializing the system. Pages are released directly
1409 * to the buddy allocator, no bootmem metadata is updated because it is gone.
1410 */
1411void __init __memblock_free_late(phys_addr_t base, phys_addr_t size)
1412{
1413 u64 cursor, end;
1414
1415 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1416 __func__, (u64)base, (u64)base + size - 1,
1417 (void *)_RET_IP_);
Catalin Marinas9099dae2016-10-11 13:55:11 -07001418 kmemleak_free_part_phys(base, size);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001419 cursor = PFN_UP(base);
1420 end = PFN_DOWN(base + size);
1421
1422 for (; cursor < end; cursor++) {
Mel Gormand70ddd72015-06-30 14:56:52 -07001423 __free_pages_bootmem(pfn_to_page(cursor), cursor, 0);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001424 totalram_pages++;
1425 }
1426}
Benjamin Herrenschmidt9d1e2492010-07-06 15:39:17 -07001427
1428/*
1429 * Remaining API functions
1430 */
1431
David Gibson1f1ffb8a2016-02-05 15:36:19 -08001432phys_addr_t __init_memblock memblock_phys_mem_size(void)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001433{
Tejun Heo1440c4e2011-12-08 10:22:08 -08001434 return memblock.memory.total_size;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001435}
1436
Srikar Dronamraju8907de52016-10-07 16:59:18 -07001437phys_addr_t __init_memblock memblock_reserved_size(void)
1438{
1439 return memblock.reserved.total_size;
1440}
1441
Yinghai Lu595ad9a2013-01-24 12:20:09 -08001442phys_addr_t __init memblock_mem_size(unsigned long limit_pfn)
1443{
1444 unsigned long pages = 0;
1445 struct memblock_region *r;
1446 unsigned long start_pfn, end_pfn;
1447
1448 for_each_memblock(memory, r) {
1449 start_pfn = memblock_region_memory_base_pfn(r);
1450 end_pfn = memblock_region_memory_end_pfn(r);
1451 start_pfn = min_t(unsigned long, start_pfn, limit_pfn);
1452 end_pfn = min_t(unsigned long, end_pfn, limit_pfn);
1453 pages += end_pfn - start_pfn;
1454 }
1455
Fabian Frederick16763232014-04-07 15:37:53 -07001456 return PFN_PHYS(pages);
Yinghai Lu595ad9a2013-01-24 12:20:09 -08001457}
1458
Sam Ravnborg0a93ebe2011-10-31 17:08:16 -07001459/* lowest address */
1460phys_addr_t __init_memblock memblock_start_of_DRAM(void)
1461{
1462 return memblock.memory.regions[0].base;
1463}
1464
Yinghai Lu10d06432010-07-28 15:43:02 +10001465phys_addr_t __init_memblock memblock_end_of_DRAM(void)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001466{
1467 int idx = memblock.memory.cnt - 1;
1468
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +10001469 return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001470}
1471
Dennis Chena571d4e2016-07-28 15:48:26 -07001472static phys_addr_t __init_memblock __find_max_addr(phys_addr_t limit)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001473{
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001474 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
Emil Medve136199f2014-04-07 15:37:52 -07001475 struct memblock_region *r;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001476
Dennis Chena571d4e2016-07-28 15:48:26 -07001477 /*
1478 * translate the memory @limit size into the max address within one of
1479 * the memory memblock regions, if the @limit exceeds the total size
1480 * of those regions, max_addr will keep original value ULLONG_MAX
1481 */
Emil Medve136199f2014-04-07 15:37:52 -07001482 for_each_memblock(memory, r) {
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001483 if (limit <= r->size) {
1484 max_addr = r->base + limit;
1485 break;
1486 }
1487 limit -= r->size;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001488 }
1489
Dennis Chena571d4e2016-07-28 15:48:26 -07001490 return max_addr;
1491}
1492
1493void __init memblock_enforce_memory_limit(phys_addr_t limit)
1494{
1495 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
1496
1497 if (!limit)
1498 return;
1499
1500 max_addr = __find_max_addr(limit);
1501
1502 /* @limit exceeds the total size of the memory, do nothing */
1503 if (max_addr == (phys_addr_t)ULLONG_MAX)
1504 return;
1505
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001506 /* truncate both memory and reserved regions */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001507 memblock_remove_range(&memblock.memory, max_addr,
1508 (phys_addr_t)ULLONG_MAX);
1509 memblock_remove_range(&memblock.reserved, max_addr,
1510 (phys_addr_t)ULLONG_MAX);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001511}
1512
Dennis Chena571d4e2016-07-28 15:48:26 -07001513void __init memblock_mem_limit_remove_map(phys_addr_t limit)
1514{
1515 struct memblock_type *type = &memblock.memory;
1516 phys_addr_t max_addr;
1517 int i, ret, start_rgn, end_rgn;
1518
1519 if (!limit)
1520 return;
1521
1522 max_addr = __find_max_addr(limit);
1523
1524 /* @limit exceeds the total size of the memory, do nothing */
1525 if (max_addr == (phys_addr_t)ULLONG_MAX)
1526 return;
1527
1528 ret = memblock_isolate_range(type, max_addr, (phys_addr_t)ULLONG_MAX,
1529 &start_rgn, &end_rgn);
1530 if (ret)
1531 return;
1532
1533 /* remove all the MAP regions above the limit */
1534 for (i = end_rgn - 1; i >= start_rgn; i--) {
1535 if (!memblock_is_nomap(&type->regions[i]))
1536 memblock_remove_region(type, i);
1537 }
1538 /* truncate the reserved regions */
1539 memblock_remove_range(&memblock.reserved, max_addr,
1540 (phys_addr_t)ULLONG_MAX);
1541}
1542
Yinghai Lucd794812010-10-11 12:34:09 -07001543static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001544{
1545 unsigned int left = 0, right = type->cnt;
1546
1547 do {
1548 unsigned int mid = (right + left) / 2;
1549
1550 if (addr < type->regions[mid].base)
1551 right = mid;
1552 else if (addr >= (type->regions[mid].base +
1553 type->regions[mid].size))
1554 left = mid + 1;
1555 else
1556 return mid;
1557 } while (left < right);
1558 return -1;
1559}
1560
Yaowei Baib4ad0c72016-01-14 15:18:54 -08001561bool __init memblock_is_reserved(phys_addr_t addr)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001562{
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001563 return memblock_search(&memblock.reserved, addr) != -1;
1564}
Yinghai Lu95f72d12010-07-12 14:36:09 +10001565
Yaowei Baib4ad0c72016-01-14 15:18:54 -08001566bool __init_memblock memblock_is_memory(phys_addr_t addr)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001567{
1568 return memblock_search(&memblock.memory, addr) != -1;
1569}
1570
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +01001571int __init_memblock memblock_is_map_memory(phys_addr_t addr)
1572{
1573 int i = memblock_search(&memblock.memory, addr);
1574
1575 if (i == -1)
1576 return false;
1577 return !memblock_is_nomap(&memblock.memory.regions[i]);
1578}
1579
Yinghai Lue76b63f2013-09-11 14:22:17 -07001580#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1581int __init_memblock memblock_search_pfn_nid(unsigned long pfn,
1582 unsigned long *start_pfn, unsigned long *end_pfn)
1583{
1584 struct memblock_type *type = &memblock.memory;
Fabian Frederick16763232014-04-07 15:37:53 -07001585 int mid = memblock_search(type, PFN_PHYS(pfn));
Yinghai Lue76b63f2013-09-11 14:22:17 -07001586
1587 if (mid == -1)
1588 return -1;
1589
Fabian Frederickf7e2f7e2014-06-04 16:07:51 -07001590 *start_pfn = PFN_DOWN(type->regions[mid].base);
1591 *end_pfn = PFN_DOWN(type->regions[mid].base + type->regions[mid].size);
Yinghai Lue76b63f2013-09-11 14:22:17 -07001592
1593 return type->regions[mid].nid;
1594}
1595#endif
1596
Stephen Boydeab30942012-05-24 00:45:21 -07001597/**
1598 * memblock_is_region_memory - check if a region is a subset of memory
1599 * @base: base of region to check
1600 * @size: size of region to check
1601 *
1602 * Check if the region [@base, @base+@size) is a subset of a memory block.
1603 *
1604 * RETURNS:
1605 * 0 if false, non-zero if true
1606 */
Yinghai Lu3661ca62010-09-15 13:05:29 -07001607int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001608{
Tomi Valkeinenabb65272011-01-20 14:44:20 -08001609 int idx = memblock_search(&memblock.memory, base);
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001610 phys_addr_t end = base + memblock_cap_size(base, &size);
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001611
1612 if (idx == -1)
1613 return 0;
Tomi Valkeinenabb65272011-01-20 14:44:20 -08001614 return memblock.memory.regions[idx].base <= base &&
1615 (memblock.memory.regions[idx].base +
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001616 memblock.memory.regions[idx].size) >= end;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001617}
1618
Stephen Boydeab30942012-05-24 00:45:21 -07001619/**
1620 * memblock_is_region_reserved - check if a region intersects reserved memory
1621 * @base: base of region to check
1622 * @size: size of region to check
1623 *
1624 * Check if the region [@base, @base+@size) intersects a reserved memory block.
1625 *
1626 * RETURNS:
Tang Chenc5c5c9d2015-09-08 15:02:00 -07001627 * True if they intersect, false if not.
Stephen Boydeab30942012-05-24 00:45:21 -07001628 */
Tang Chenc5c5c9d2015-09-08 15:02:00 -07001629bool __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001630{
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001631 memblock_cap_size(base, &size);
Tang Chenc5c5c9d2015-09-08 15:02:00 -07001632 return memblock_overlaps_region(&memblock.reserved, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001633}
1634
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001635void __init_memblock memblock_trim_memory(phys_addr_t align)
1636{
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001637 phys_addr_t start, end, orig_start, orig_end;
Emil Medve136199f2014-04-07 15:37:52 -07001638 struct memblock_region *r;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001639
Emil Medve136199f2014-04-07 15:37:52 -07001640 for_each_memblock(memory, r) {
1641 orig_start = r->base;
1642 orig_end = r->base + r->size;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001643 start = round_up(orig_start, align);
1644 end = round_down(orig_end, align);
1645
1646 if (start == orig_start && end == orig_end)
1647 continue;
1648
1649 if (start < end) {
Emil Medve136199f2014-04-07 15:37:52 -07001650 r->base = start;
1651 r->size = end - start;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001652 } else {
Emil Medve136199f2014-04-07 15:37:52 -07001653 memblock_remove_region(&memblock.memory,
1654 r - memblock.memory.regions);
1655 r--;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001656 }
1657 }
1658}
Benjamin Herrenschmidte63075a2010-07-06 15:39:01 -07001659
Yinghai Lu3661ca62010-09-15 13:05:29 -07001660void __init_memblock memblock_set_current_limit(phys_addr_t limit)
Benjamin Herrenschmidte63075a2010-07-06 15:39:01 -07001661{
1662 memblock.current_limit = limit;
1663}
1664
Laura Abbottfec51012014-02-27 01:23:43 +01001665phys_addr_t __init_memblock memblock_get_current_limit(void)
1666{
1667 return memblock.current_limit;
1668}
1669
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001670static void __init_memblock memblock_dump(struct memblock_type *type, char *name)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001671{
1672 unsigned long long base, size;
Tang Chen66a20752014-01-21 15:49:20 -08001673 unsigned long flags;
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -08001674 int idx;
1675 struct memblock_region *rgn;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001676
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001677 pr_info(" %s.cnt = 0x%lx\n", name, type->cnt);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001678
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -08001679 for_each_memblock_type(type, rgn) {
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001680 char nid_buf[32] = "";
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001681
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001682 base = rgn->base;
1683 size = rgn->size;
Tang Chen66a20752014-01-21 15:49:20 -08001684 flags = rgn->flags;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001685#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1686 if (memblock_get_region_node(rgn) != MAX_NUMNODES)
1687 snprintf(nid_buf, sizeof(nid_buf), " on node %d",
1688 memblock_get_region_node(rgn));
1689#endif
Tang Chen66a20752014-01-21 15:49:20 -08001690 pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s flags: %#lx\n",
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -08001691 name, idx, base, base + size - 1, size, nid_buf, flags);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001692 }
1693}
1694
Michal Hocko292f70c2017-06-02 14:46:49 -07001695extern unsigned long __init_memblock
1696memblock_reserved_memory_within(phys_addr_t start_addr, phys_addr_t end_addr)
1697{
1698 struct memblock_region *rgn;
1699 unsigned long size = 0;
1700 int idx;
1701
1702 for_each_memblock_type((&memblock.reserved), rgn) {
1703 phys_addr_t start, end;
1704
1705 if (rgn->base + rgn->size < start_addr)
1706 continue;
1707 if (rgn->base > end_addr)
1708 continue;
1709
1710 start = rgn->base;
1711 end = start + rgn->size;
1712 size += end - start;
1713 }
1714
1715 return size;
1716}
1717
Tejun Heo4ff7b822011-12-08 10:22:06 -08001718void __init_memblock __memblock_dump_all(void)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001719{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001720 pr_info("MEMBLOCK configuration:\n");
Tejun Heo1440c4e2011-12-08 10:22:08 -08001721 pr_info(" memory size = %#llx reserved size = %#llx\n",
1722 (unsigned long long)memblock.memory.total_size,
1723 (unsigned long long)memblock.reserved.total_size);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001724
1725 memblock_dump(&memblock.memory, "memory");
1726 memblock_dump(&memblock.reserved, "reserved");
1727}
1728
Tejun Heo1aadc052011-12-08 10:22:08 -08001729void __init memblock_allow_resize(void)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001730{
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -07001731 memblock_can_resize = 1;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001732}
1733
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001734static int __init early_memblock(char *p)
1735{
1736 if (p && strstr(p, "debug"))
1737 memblock_debug = 1;
1738 return 0;
1739}
1740early_param("memblock", early_memblock);
1741
Tejun Heoc378ddd2011-07-14 11:46:03 +02001742#if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001743
1744static int memblock_debug_show(struct seq_file *m, void *private)
1745{
1746 struct memblock_type *type = m->private;
1747 struct memblock_region *reg;
1748 int i;
1749
1750 for (i = 0; i < type->cnt; i++) {
1751 reg = &type->regions[i];
1752 seq_printf(m, "%4d: ", i);
1753 if (sizeof(phys_addr_t) == 4)
1754 seq_printf(m, "0x%08lx..0x%08lx\n",
1755 (unsigned long)reg->base,
1756 (unsigned long)(reg->base + reg->size - 1));
1757 else
1758 seq_printf(m, "0x%016llx..0x%016llx\n",
1759 (unsigned long long)reg->base,
1760 (unsigned long long)(reg->base + reg->size - 1));
1761
1762 }
1763 return 0;
1764}
1765
1766static int memblock_debug_open(struct inode *inode, struct file *file)
1767{
1768 return single_open(file, memblock_debug_show, inode->i_private);
1769}
1770
1771static const struct file_operations memblock_debug_fops = {
1772 .open = memblock_debug_open,
1773 .read = seq_read,
1774 .llseek = seq_lseek,
1775 .release = single_release,
1776};
1777
1778static int __init memblock_init_debugfs(void)
1779{
1780 struct dentry *root = debugfs_create_dir("memblock", NULL);
1781 if (!root)
1782 return -ENXIO;
1783 debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops);
1784 debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops);
Philipp Hachtmann70210ed2014-01-29 18:16:01 +01001785#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
1786 debugfs_create_file("physmem", S_IRUGO, root, &memblock.physmem, &memblock_debug_fops);
1787#endif
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001788
1789 return 0;
1790}
1791__initcall(memblock_init_debugfs);
1792
1793#endif /* CONFIG_DEBUG_FS */