blob: 68849d0ead0975f172260c78562e279e1eba4a1d [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
300
Yinghai Lu29f67382012-07-11 14:02:56 -0700301phys_addr_t __init_memblock get_allocated_memblock_reserved_regions_info(
302 phys_addr_t *addr)
303{
304 if (memblock.reserved.regions == memblock_reserved_init_regions)
305 return 0;
306
307 *addr = __pa(memblock.reserved.regions);
308
309 return PAGE_ALIGN(sizeof(struct memblock_region) *
310 memblock.reserved.max);
311}
312
Philipp Hachtmann5e270e22014-01-23 15:53:11 -0800313phys_addr_t __init_memblock get_allocated_memblock_memory_regions_info(
314 phys_addr_t *addr)
315{
316 if (memblock.memory.regions == memblock_memory_init_regions)
317 return 0;
318
319 *addr = __pa(memblock.memory.regions);
320
321 return PAGE_ALIGN(sizeof(struct memblock_region) *
322 memblock.memory.max);
323}
324
325#endif
326
Greg Pearson48c3b582012-06-20 12:53:05 -0700327/**
328 * memblock_double_array - double the size of the memblock regions array
329 * @type: memblock type of the regions array being doubled
330 * @new_area_start: starting address of memory range to avoid overlap with
331 * @new_area_size: size of memory range to avoid overlap with
332 *
333 * Double the size of the @type regions array. If memblock is being used to
334 * allocate memory for a new reserved regions array and there is a previously
335 * allocated memory range [@new_area_start,@new_area_start+@new_area_size]
336 * waiting to be reserved, ensure the memory used by the new array does
337 * not overlap.
338 *
339 * RETURNS:
340 * 0 on success, -1 on failure.
341 */
342static int __init_memblock memblock_double_array(struct memblock_type *type,
343 phys_addr_t new_area_start,
344 phys_addr_t new_area_size)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700345{
346 struct memblock_region *new_array, *old_array;
Yinghai Lu29f67382012-07-11 14:02:56 -0700347 phys_addr_t old_alloc_size, new_alloc_size;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700348 phys_addr_t old_size, new_size, addr;
349 int use_slab = slab_is_available();
Gavin Shan181eb392012-05-29 15:06:50 -0700350 int *in_slab;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700351
352 /* We don't allow resizing until we know about the reserved regions
353 * of memory that aren't suitable for allocation
354 */
355 if (!memblock_can_resize)
356 return -1;
357
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700358 /* Calculate new doubled size */
359 old_size = type->max * sizeof(struct memblock_region);
360 new_size = old_size << 1;
Yinghai Lu29f67382012-07-11 14:02:56 -0700361 /*
362 * We need to allocated new one align to PAGE_SIZE,
363 * so we can free them completely later.
364 */
365 old_alloc_size = PAGE_ALIGN(old_size);
366 new_alloc_size = PAGE_ALIGN(new_size);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700367
Gavin Shan181eb392012-05-29 15:06:50 -0700368 /* Retrieve the slab flag */
369 if (type == &memblock.memory)
370 in_slab = &memblock_memory_in_slab;
371 else
372 in_slab = &memblock_reserved_in_slab;
373
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700374 /* Try to find some space for it.
375 *
376 * WARNING: We assume that either slab_is_available() and we use it or
Andrew Mortonfd073832012-07-31 16:42:40 -0700377 * we use MEMBLOCK for allocations. That means that this is unsafe to
378 * use when bootmem is currently active (unless bootmem itself is
379 * implemented on top of MEMBLOCK which isn't the case yet)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700380 *
381 * This should however not be an issue for now, as we currently only
Andrew Mortonfd073832012-07-31 16:42:40 -0700382 * call into MEMBLOCK while it's still active, or much later when slab
383 * is active for memory hotplug operations
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700384 */
385 if (use_slab) {
386 new_array = kmalloc(new_size, GFP_KERNEL);
Tejun Heo1f5026a2011-07-12 09:58:09 +0200387 addr = new_array ? __pa(new_array) : 0;
Gavin Shan4e2f0772012-05-29 15:06:50 -0700388 } else {
Greg Pearson48c3b582012-06-20 12:53:05 -0700389 /* only exclude range when trying to double reserved.regions */
390 if (type != &memblock.reserved)
391 new_area_start = new_area_size = 0;
392
393 addr = memblock_find_in_range(new_area_start + new_area_size,
394 memblock.current_limit,
Yinghai Lu29f67382012-07-11 14:02:56 -0700395 new_alloc_size, PAGE_SIZE);
Greg Pearson48c3b582012-06-20 12:53:05 -0700396 if (!addr && new_area_size)
397 addr = memblock_find_in_range(0,
Andrew Mortonfd073832012-07-31 16:42:40 -0700398 min(new_area_start, memblock.current_limit),
399 new_alloc_size, PAGE_SIZE);
Greg Pearson48c3b582012-06-20 12:53:05 -0700400
Sachin Kamat15674862012-09-04 13:55:05 +0530401 new_array = addr ? __va(addr) : NULL;
Gavin Shan4e2f0772012-05-29 15:06:50 -0700402 }
Tejun Heo1f5026a2011-07-12 09:58:09 +0200403 if (!addr) {
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700404 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
405 memblock_type_name(type), type->max, type->max * 2);
406 return -1;
407 }
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700408
Andrew Mortonfd073832012-07-31 16:42:40 -0700409 memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]",
410 memblock_type_name(type), type->max * 2, (u64)addr,
411 (u64)addr + new_size - 1);
Yinghai Luea9e4372010-07-28 15:13:22 +1000412
Andrew Mortonfd073832012-07-31 16:42:40 -0700413 /*
414 * Found space, we now need to move the array over before we add the
415 * reserved region since it may be our reserved array itself that is
416 * full.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700417 */
418 memcpy(new_array, type->regions, old_size);
419 memset(new_array + type->max, 0, old_size);
420 old_array = type->regions;
421 type->regions = new_array;
422 type->max <<= 1;
423
Andrew Mortonfd073832012-07-31 16:42:40 -0700424 /* Free old array. We needn't free it if the array is the static one */
Gavin Shan181eb392012-05-29 15:06:50 -0700425 if (*in_slab)
426 kfree(old_array);
427 else if (old_array != memblock_memory_init_regions &&
428 old_array != memblock_reserved_init_regions)
Yinghai Lu29f67382012-07-11 14:02:56 -0700429 memblock_free(__pa(old_array), old_alloc_size);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700430
Andrew Mortonfd073832012-07-31 16:42:40 -0700431 /*
432 * Reserve the new array if that comes from the memblock. Otherwise, we
433 * needn't do it
Gavin Shan181eb392012-05-29 15:06:50 -0700434 */
435 if (!use_slab)
Yinghai Lu29f67382012-07-11 14:02:56 -0700436 BUG_ON(memblock_reserve(addr, new_alloc_size));
Gavin Shan181eb392012-05-29 15:06:50 -0700437
438 /* Update slab flag */
439 *in_slab = use_slab;
440
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700441 return 0;
442}
443
Tejun Heo784656f92011-07-12 11:15:55 +0200444/**
445 * memblock_merge_regions - merge neighboring compatible regions
446 * @type: memblock type to scan
447 *
448 * Scan @type and merge neighboring compatible regions.
449 */
450static void __init_memblock memblock_merge_regions(struct memblock_type *type)
451{
452 int i = 0;
453
454 /* cnt never goes below 1 */
455 while (i < type->cnt - 1) {
456 struct memblock_region *this = &type->regions[i];
457 struct memblock_region *next = &type->regions[i + 1];
458
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200459 if (this->base + this->size != next->base ||
460 memblock_get_region_node(this) !=
Tang Chen66a20752014-01-21 15:49:20 -0800461 memblock_get_region_node(next) ||
462 this->flags != next->flags) {
Tejun Heo784656f92011-07-12 11:15:55 +0200463 BUG_ON(this->base + this->size > next->base);
464 i++;
465 continue;
466 }
467
468 this->size += next->size;
Lin Fengc0232ae2013-01-11 14:31:44 -0800469 /* move forward from next + 1, index of which is i + 2 */
470 memmove(next, next + 1, (type->cnt - (i + 2)) * sizeof(*next));
Tejun Heo784656f92011-07-12 11:15:55 +0200471 type->cnt--;
472 }
473}
474
475/**
476 * memblock_insert_region - insert new memblock region
Tang Chen209ff862013-04-29 15:08:41 -0700477 * @type: memblock type to insert into
478 * @idx: index for the insertion point
479 * @base: base address of the new region
480 * @size: size of the new region
481 * @nid: node id of the new region
Tang Chen66a20752014-01-21 15:49:20 -0800482 * @flags: flags of the new region
Tejun Heo784656f92011-07-12 11:15:55 +0200483 *
484 * Insert new memblock region [@base,@base+@size) into @type at @idx.
Alexander Kuleshov412d0002016-08-04 15:31:46 -0700485 * @type must already have extra room to accommodate the new region.
Tejun Heo784656f92011-07-12 11:15:55 +0200486 */
487static void __init_memblock memblock_insert_region(struct memblock_type *type,
488 int idx, phys_addr_t base,
Tang Chen66a20752014-01-21 15:49:20 -0800489 phys_addr_t size,
490 int nid, unsigned long flags)
Tejun Heo784656f92011-07-12 11:15:55 +0200491{
492 struct memblock_region *rgn = &type->regions[idx];
493
494 BUG_ON(type->cnt >= type->max);
495 memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn));
496 rgn->base = base;
497 rgn->size = size;
Tang Chen66a20752014-01-21 15:49:20 -0800498 rgn->flags = flags;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200499 memblock_set_region_node(rgn, nid);
Tejun Heo784656f92011-07-12 11:15:55 +0200500 type->cnt++;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800501 type->total_size += size;
Tejun Heo784656f92011-07-12 11:15:55 +0200502}
503
504/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100505 * memblock_add_range - add new memblock region
Tejun Heo784656f92011-07-12 11:15:55 +0200506 * @type: memblock type to add new region into
507 * @base: base address of the new region
508 * @size: size of the new region
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800509 * @nid: nid of the new region
Tang Chen66a20752014-01-21 15:49:20 -0800510 * @flags: flags of the new region
Tejun Heo784656f92011-07-12 11:15:55 +0200511 *
512 * Add new memblock region [@base,@base+@size) into @type. The new region
513 * is allowed to overlap with existing ones - overlaps don't affect already
514 * existing regions. @type is guaranteed to be minimal (all neighbouring
515 * compatible regions are merged) after the addition.
516 *
517 * RETURNS:
518 * 0 on success, -errno on failure.
519 */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100520int __init_memblock memblock_add_range(struct memblock_type *type,
Tang Chen66a20752014-01-21 15:49:20 -0800521 phys_addr_t base, phys_addr_t size,
522 int nid, unsigned long flags)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000523{
Tejun Heo784656f92011-07-12 11:15:55 +0200524 bool insert = false;
Tejun Heoeb18f1b2011-12-08 10:22:07 -0800525 phys_addr_t obase = base;
526 phys_addr_t end = base + memblock_cap_size(base, &size);
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800527 int idx, nr_new;
528 struct memblock_region *rgn;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000529
Tejun Heob3dc6272012-04-20 08:31:34 -0700530 if (!size)
531 return 0;
532
Tejun Heo784656f92011-07-12 11:15:55 +0200533 /* special case for empty array */
534 if (type->regions[0].size == 0) {
Tejun Heo1440c4e2011-12-08 10:22:08 -0800535 WARN_ON(type->cnt != 1 || type->total_size);
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000536 type->regions[0].base = base;
537 type->regions[0].size = size;
Tang Chen66a20752014-01-21 15:49:20 -0800538 type->regions[0].flags = flags;
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800539 memblock_set_region_node(&type->regions[0], nid);
Tejun Heo1440c4e2011-12-08 10:22:08 -0800540 type->total_size = size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000541 return 0;
542 }
Tejun Heo784656f92011-07-12 11:15:55 +0200543repeat:
544 /*
545 * The following is executed twice. Once with %false @insert and
546 * then with %true. The first counts the number of regions needed
Alexander Kuleshov412d0002016-08-04 15:31:46 -0700547 * to accommodate the new area. The second actually inserts them.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700548 */
Tejun Heo784656f92011-07-12 11:15:55 +0200549 base = obase;
550 nr_new = 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000551
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800552 for_each_memblock_type(type, rgn) {
Tejun Heo784656f92011-07-12 11:15:55 +0200553 phys_addr_t rbase = rgn->base;
554 phys_addr_t rend = rbase + rgn->size;
555
556 if (rbase >= end)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000557 break;
Tejun Heo784656f92011-07-12 11:15:55 +0200558 if (rend <= base)
559 continue;
560 /*
561 * @rgn overlaps. If it separates the lower part of new
562 * area, insert that portion.
563 */
564 if (rbase > base) {
Wei Yangc0a29492015-09-04 15:47:38 -0700565#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
566 WARN_ON(nid != memblock_get_region_node(rgn));
567#endif
Wei Yang4fcab5f2015-09-08 14:59:53 -0700568 WARN_ON(flags != rgn->flags);
Tejun Heo784656f92011-07-12 11:15:55 +0200569 nr_new++;
570 if (insert)
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800571 memblock_insert_region(type, idx++, base,
Tang Chen66a20752014-01-21 15:49:20 -0800572 rbase - base, nid,
573 flags);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000574 }
Tejun Heo784656f92011-07-12 11:15:55 +0200575 /* area below @rend is dealt with, forget about it */
576 base = min(rend, end);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000577 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000578
Tejun Heo784656f92011-07-12 11:15:55 +0200579 /* insert the remaining portion */
580 if (base < end) {
581 nr_new++;
582 if (insert)
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800583 memblock_insert_region(type, idx, base, end - base,
Tang Chen66a20752014-01-21 15:49:20 -0800584 nid, flags);
Tejun Heo784656f92011-07-12 11:15:55 +0200585 }
586
nimisoloef3cc4d2016-07-26 15:24:56 -0700587 if (!nr_new)
588 return 0;
589
Tejun Heo784656f92011-07-12 11:15:55 +0200590 /*
591 * If this was the first round, resize array and repeat for actual
592 * insertions; otherwise, merge and return.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700593 */
Tejun Heo784656f92011-07-12 11:15:55 +0200594 if (!insert) {
595 while (type->cnt + nr_new > type->max)
Greg Pearson48c3b582012-06-20 12:53:05 -0700596 if (memblock_double_array(type, obase, size) < 0)
Tejun Heo784656f92011-07-12 11:15:55 +0200597 return -ENOMEM;
598 insert = true;
599 goto repeat;
600 } else {
601 memblock_merge_regions(type);
602 return 0;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700603 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000604}
605
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800606int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size,
607 int nid)
608{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100609 return memblock_add_range(&memblock.memory, base, size, nid, 0);
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800610}
611
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700612int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size)
Alexander Kuleshov6a4055b2015-04-15 16:14:44 -0700613{
Alexander Kuleshov6a4055b2015-04-15 16:14:44 -0700614 memblock_dbg("memblock_add: [%#016llx-%#016llx] flags %#02lx %pF\n",
615 (unsigned long long)base,
616 (unsigned long long)base + size - 1,
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700617 0UL, (void *)_RET_IP_);
Alexander Kuleshov6a4055b2015-04-15 16:14:44 -0700618
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700619 return memblock_add_range(&memblock.memory, base, size, MAX_NUMNODES, 0);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000620}
621
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800622/**
623 * memblock_isolate_range - isolate given range into disjoint memblocks
624 * @type: memblock type to isolate range for
625 * @base: base of range to isolate
626 * @size: size of range to isolate
627 * @start_rgn: out parameter for the start of isolated region
628 * @end_rgn: out parameter for the end of isolated region
629 *
630 * Walk @type and ensure that regions don't cross the boundaries defined by
631 * [@base,@base+@size). Crossing regions are split at the boundaries,
632 * which may create at most two more regions. The index of the first
633 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
634 *
635 * RETURNS:
636 * 0 on success, -errno on failure.
637 */
638static int __init_memblock memblock_isolate_range(struct memblock_type *type,
639 phys_addr_t base, phys_addr_t size,
640 int *start_rgn, int *end_rgn)
641{
Tejun Heoeb18f1b2011-12-08 10:22:07 -0800642 phys_addr_t end = base + memblock_cap_size(base, &size);
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800643 int idx;
644 struct memblock_region *rgn;
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800645
646 *start_rgn = *end_rgn = 0;
647
Tejun Heob3dc6272012-04-20 08:31:34 -0700648 if (!size)
649 return 0;
650
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800651 /* we'll create at most two more regions */
652 while (type->cnt + 2 > type->max)
Greg Pearson48c3b582012-06-20 12:53:05 -0700653 if (memblock_double_array(type, base, size) < 0)
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800654 return -ENOMEM;
655
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800656 for_each_memblock_type(type, rgn) {
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800657 phys_addr_t rbase = rgn->base;
658 phys_addr_t rend = rbase + rgn->size;
659
660 if (rbase >= end)
661 break;
662 if (rend <= base)
663 continue;
664
665 if (rbase < base) {
666 /*
667 * @rgn intersects from below. Split and continue
668 * to process the next region - the new top half.
669 */
670 rgn->base = base;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800671 rgn->size -= base - rbase;
672 type->total_size -= base - rbase;
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800673 memblock_insert_region(type, idx, rbase, base - rbase,
Tang Chen66a20752014-01-21 15:49:20 -0800674 memblock_get_region_node(rgn),
675 rgn->flags);
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800676 } else if (rend > end) {
677 /*
678 * @rgn intersects from above. Split and redo the
679 * current region - the new bottom half.
680 */
681 rgn->base = end;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800682 rgn->size -= end - rbase;
683 type->total_size -= end - rbase;
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800684 memblock_insert_region(type, idx--, rbase, end - rbase,
Tang Chen66a20752014-01-21 15:49:20 -0800685 memblock_get_region_node(rgn),
686 rgn->flags);
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800687 } else {
688 /* @rgn is fully contained, record it */
689 if (!*end_rgn)
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800690 *start_rgn = idx;
691 *end_rgn = idx + 1;
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800692 }
693 }
694
695 return 0;
696}
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800697
Alexander Kuleshov35bd16a2015-11-05 18:47:00 -0800698static int __init_memblock memblock_remove_range(struct memblock_type *type,
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100699 phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000700{
Tejun Heo71936182011-12-08 10:22:07 -0800701 int start_rgn, end_rgn;
702 int i, ret;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000703
Tejun Heo71936182011-12-08 10:22:07 -0800704 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
705 if (ret)
706 return ret;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000707
Tejun Heo71936182011-12-08 10:22:07 -0800708 for (i = end_rgn - 1; i >= start_rgn; i--)
709 memblock_remove_region(type, i);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700710 return 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000711}
712
Tejun Heo581adcb2011-12-08 10:22:06 -0800713int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000714{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100715 return memblock_remove_range(&memblock.memory, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000716}
717
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100718
Tejun Heo581adcb2011-12-08 10:22:06 -0800719int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000720{
Tejun Heo24aa0782011-07-12 11:16:06 +0200721 memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n",
H. Peter Anvina1504392011-07-14 11:57:10 -0700722 (unsigned long long)base,
Grygorii Strashko931d13f2014-01-21 15:49:17 -0800723 (unsigned long long)base + size - 1,
H. Peter Anvina1504392011-07-14 11:57:10 -0700724 (void *)_RET_IP_);
Tejun Heo24aa0782011-07-12 11:16:06 +0200725
Catalin Marinas9099dae2016-10-11 13:55:11 -0700726 kmemleak_free_part_phys(base, size);
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100727 return memblock_remove_range(&memblock.reserved, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000728}
729
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700730int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000731{
Tang Chen66a20752014-01-21 15:49:20 -0800732 memblock_dbg("memblock_reserve: [%#016llx-%#016llx] flags %#02lx %pF\n",
H. Peter Anvina1504392011-07-14 11:57:10 -0700733 (unsigned long long)base,
Grygorii Strashko931d13f2014-01-21 15:49:17 -0800734 (unsigned long long)base + size - 1,
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700735 0UL, (void *)_RET_IP_);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000736
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700737 return memblock_add_range(&memblock.reserved, base, size, MAX_NUMNODES, 0);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000738}
739
Tejun Heo35fd0802011-07-12 11:15:59 +0200740/**
Tang Chen66b16ed2014-01-21 15:49:23 -0800741 *
Tony Luck4308ce12014-12-12 16:54:59 -0800742 * This function isolates region [@base, @base + @size), and sets/clears flag
Tang Chen66b16ed2014-01-21 15:49:23 -0800743 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700744 * Return 0 on success, -errno on failure.
Tang Chen66b16ed2014-01-21 15:49:23 -0800745 */
Tony Luck4308ce12014-12-12 16:54:59 -0800746static int __init_memblock memblock_setclr_flag(phys_addr_t base,
747 phys_addr_t size, int set, int flag)
Tang Chen66b16ed2014-01-21 15:49:23 -0800748{
749 struct memblock_type *type = &memblock.memory;
750 int i, ret, start_rgn, end_rgn;
751
752 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
753 if (ret)
754 return ret;
755
756 for (i = start_rgn; i < end_rgn; i++)
Tony Luck4308ce12014-12-12 16:54:59 -0800757 if (set)
758 memblock_set_region_flags(&type->regions[i], flag);
759 else
760 memblock_clear_region_flags(&type->regions[i], flag);
Tang Chen66b16ed2014-01-21 15:49:23 -0800761
762 memblock_merge_regions(type);
763 return 0;
764}
765
766/**
Tony Luck4308ce12014-12-12 16:54:59 -0800767 * memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG.
768 * @base: the base phys addr of the region
769 * @size: the size of the region
770 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700771 * Return 0 on success, -errno on failure.
Tony Luck4308ce12014-12-12 16:54:59 -0800772 */
773int __init_memblock memblock_mark_hotplug(phys_addr_t base, phys_addr_t size)
774{
775 return memblock_setclr_flag(base, size, 1, MEMBLOCK_HOTPLUG);
776}
777
778/**
Tang Chen66b16ed2014-01-21 15:49:23 -0800779 * memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region.
780 * @base: the base phys addr of the region
781 * @size: the size of the region
782 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700783 * Return 0 on success, -errno on failure.
Tang Chen66b16ed2014-01-21 15:49:23 -0800784 */
785int __init_memblock memblock_clear_hotplug(phys_addr_t base, phys_addr_t size)
786{
Tony Luck4308ce12014-12-12 16:54:59 -0800787 return memblock_setclr_flag(base, size, 0, MEMBLOCK_HOTPLUG);
Tang Chen66b16ed2014-01-21 15:49:23 -0800788}
789
790/**
Tony Lucka3f5baf2015-06-24 16:58:12 -0700791 * memblock_mark_mirror - Mark mirrored memory with flag MEMBLOCK_MIRROR.
792 * @base: the base phys addr of the region
793 * @size: the size of the region
794 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700795 * Return 0 on success, -errno on failure.
Tony Lucka3f5baf2015-06-24 16:58:12 -0700796 */
797int __init_memblock memblock_mark_mirror(phys_addr_t base, phys_addr_t size)
798{
799 system_has_some_mirror = true;
800
801 return memblock_setclr_flag(base, size, 1, MEMBLOCK_MIRROR);
802}
803
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +0100804/**
805 * memblock_mark_nomap - Mark a memory region with flag MEMBLOCK_NOMAP.
806 * @base: the base phys addr of the region
807 * @size: the size of the region
808 *
809 * Return 0 on success, -errno on failure.
810 */
811int __init_memblock memblock_mark_nomap(phys_addr_t base, phys_addr_t size)
812{
813 return memblock_setclr_flag(base, size, 1, MEMBLOCK_NOMAP);
814}
Tony Lucka3f5baf2015-06-24 16:58:12 -0700815
816/**
Robin Holt8e7a7f82015-06-30 14:56:41 -0700817 * __next_reserved_mem_region - next function for for_each_reserved_region()
818 * @idx: pointer to u64 loop variable
819 * @out_start: ptr to phys_addr_t for start address of the region, can be %NULL
820 * @out_end: ptr to phys_addr_t for end address of the region, can be %NULL
821 *
822 * Iterate over all reserved memory regions.
823 */
824void __init_memblock __next_reserved_mem_region(u64 *idx,
825 phys_addr_t *out_start,
826 phys_addr_t *out_end)
827{
Alexander Kuleshov567d1172015-09-08 15:03:33 -0700828 struct memblock_type *type = &memblock.reserved;
Robin Holt8e7a7f82015-06-30 14:56:41 -0700829
Richard Leitnercd33a762016-05-20 16:58:33 -0700830 if (*idx < type->cnt) {
Alexander Kuleshov567d1172015-09-08 15:03:33 -0700831 struct memblock_region *r = &type->regions[*idx];
Robin Holt8e7a7f82015-06-30 14:56:41 -0700832 phys_addr_t base = r->base;
833 phys_addr_t size = r->size;
834
835 if (out_start)
836 *out_start = base;
837 if (out_end)
838 *out_end = base + size - 1;
839
840 *idx += 1;
841 return;
842 }
843
844 /* signal end of iteration */
845 *idx = ULLONG_MAX;
846}
847
848/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100849 * __next__mem_range - next function for for_each_free_mem_range() etc.
Tejun Heo35fd0802011-07-12 11:15:59 +0200850 * @idx: pointer to u64 loop variable
Grygorii Strashkob1154232014-01-21 15:50:16 -0800851 * @nid: node selector, %NUMA_NO_NODE for all nodes
Tony Luckfc6daaf2015-06-24 16:58:09 -0700852 * @flags: pick from blocks based on memory attributes
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100853 * @type_a: pointer to memblock_type from where the range is taken
854 * @type_b: pointer to memblock_type which excludes memory from being taken
Wanpeng Lidad75572012-06-20 12:53:01 -0700855 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
856 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
857 * @out_nid: ptr to int for nid of the range, can be %NULL
Tejun Heo35fd0802011-07-12 11:15:59 +0200858 *
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100859 * Find the first area from *@idx which matches @nid, fill the out
Tejun Heo35fd0802011-07-12 11:15:59 +0200860 * parameters, and update *@idx for the next iteration. The lower 32bit of
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100861 * *@idx contains index into type_a and the upper 32bit indexes the
862 * areas before each region in type_b. For example, if type_b regions
Tejun Heo35fd0802011-07-12 11:15:59 +0200863 * look like the following,
864 *
865 * 0:[0-16), 1:[32-48), 2:[128-130)
866 *
867 * The upper 32bit indexes the following regions.
868 *
869 * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX)
870 *
871 * As both region arrays are sorted, the function advances the two indices
872 * in lockstep and returns each intersection.
873 */
Tony Luckfc6daaf2015-06-24 16:58:09 -0700874void __init_memblock __next_mem_range(u64 *idx, int nid, ulong flags,
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100875 struct memblock_type *type_a,
876 struct memblock_type *type_b,
877 phys_addr_t *out_start,
878 phys_addr_t *out_end, int *out_nid)
Tejun Heo35fd0802011-07-12 11:15:59 +0200879{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100880 int idx_a = *idx & 0xffffffff;
881 int idx_b = *idx >> 32;
Grygorii Strashkob1154232014-01-21 15:50:16 -0800882
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100883 if (WARN_ONCE(nid == MAX_NUMNODES,
884 "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
Grygorii Strashko560dca272014-01-21 15:50:55 -0800885 nid = NUMA_NO_NODE;
Tejun Heo35fd0802011-07-12 11:15:59 +0200886
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100887 for (; idx_a < type_a->cnt; idx_a++) {
888 struct memblock_region *m = &type_a->regions[idx_a];
889
Tejun Heo35fd0802011-07-12 11:15:59 +0200890 phys_addr_t m_start = m->base;
891 phys_addr_t m_end = m->base + m->size;
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100892 int m_nid = memblock_get_region_node(m);
Tejun Heo35fd0802011-07-12 11:15:59 +0200893
894 /* only memory regions are associated with nodes, check it */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100895 if (nid != NUMA_NO_NODE && nid != m_nid)
Tejun Heo35fd0802011-07-12 11:15:59 +0200896 continue;
897
Xishi Qiu0a313a92014-09-09 14:50:46 -0700898 /* skip hotpluggable memory regions if needed */
899 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
900 continue;
901
Tony Lucka3f5baf2015-06-24 16:58:12 -0700902 /* if we want mirror memory skip non-mirror memory regions */
903 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
904 continue;
905
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +0100906 /* skip nomap memory unless we were asked for it explicitly */
907 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
908 continue;
909
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100910 if (!type_b) {
911 if (out_start)
912 *out_start = m_start;
913 if (out_end)
914 *out_end = m_end;
915 if (out_nid)
916 *out_nid = m_nid;
917 idx_a++;
918 *idx = (u32)idx_a | (u64)idx_b << 32;
919 return;
920 }
Tejun Heo35fd0802011-07-12 11:15:59 +0200921
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100922 /* scan areas before each reservation */
923 for (; idx_b < type_b->cnt + 1; idx_b++) {
924 struct memblock_region *r;
925 phys_addr_t r_start;
926 phys_addr_t r_end;
927
928 r = &type_b->regions[idx_b];
929 r_start = idx_b ? r[-1].base + r[-1].size : 0;
930 r_end = idx_b < type_b->cnt ?
931 r->base : ULLONG_MAX;
932
933 /*
934 * if idx_b advanced past idx_a,
935 * break out to advance idx_a
936 */
Tejun Heo35fd0802011-07-12 11:15:59 +0200937 if (r_start >= m_end)
938 break;
939 /* if the two regions intersect, we're done */
940 if (m_start < r_end) {
941 if (out_start)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100942 *out_start =
943 max(m_start, r_start);
Tejun Heo35fd0802011-07-12 11:15:59 +0200944 if (out_end)
945 *out_end = min(m_end, r_end);
946 if (out_nid)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100947 *out_nid = m_nid;
Tejun Heo35fd0802011-07-12 11:15:59 +0200948 /*
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100949 * The region which ends first is
950 * advanced for the next iteration.
Tejun Heo35fd0802011-07-12 11:15:59 +0200951 */
952 if (m_end <= r_end)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100953 idx_a++;
Tejun Heo35fd0802011-07-12 11:15:59 +0200954 else
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100955 idx_b++;
956 *idx = (u32)idx_a | (u64)idx_b << 32;
Tejun Heo35fd0802011-07-12 11:15:59 +0200957 return;
958 }
959 }
960 }
961
962 /* signal end of iteration */
963 *idx = ULLONG_MAX;
964}
965
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800966/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100967 * __next_mem_range_rev - generic next function for for_each_*_range_rev()
968 *
969 * Finds the next range from type_a which is not marked as unsuitable
970 * in type_b.
971 *
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800972 * @idx: pointer to u64 loop variable
Alexander Kuleshovad5ea8c2015-09-08 15:04:22 -0700973 * @nid: node selector, %NUMA_NO_NODE for all nodes
Tony Luckfc6daaf2015-06-24 16:58:09 -0700974 * @flags: pick from blocks based on memory attributes
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100975 * @type_a: pointer to memblock_type from where the range is taken
976 * @type_b: pointer to memblock_type which excludes memory from being taken
Wanpeng Lidad75572012-06-20 12:53:01 -0700977 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
978 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
979 * @out_nid: ptr to int for nid of the range, can be %NULL
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800980 *
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100981 * Reverse of __next_mem_range().
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800982 */
Tony Luckfc6daaf2015-06-24 16:58:09 -0700983void __init_memblock __next_mem_range_rev(u64 *idx, int nid, ulong flags,
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100984 struct memblock_type *type_a,
985 struct memblock_type *type_b,
986 phys_addr_t *out_start,
987 phys_addr_t *out_end, int *out_nid)
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800988{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100989 int idx_a = *idx & 0xffffffff;
990 int idx_b = *idx >> 32;
Grygorii Strashkob1154232014-01-21 15:50:16 -0800991
Grygorii Strashko560dca272014-01-21 15:50:55 -0800992 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
993 nid = NUMA_NO_NODE;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800994
995 if (*idx == (u64)ULLONG_MAX) {
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100996 idx_a = type_a->cnt - 1;
zijun_hue47608a2016-08-04 15:32:00 -0700997 if (type_b != NULL)
998 idx_b = type_b->cnt;
999 else
1000 idx_b = 0;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001001 }
1002
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001003 for (; idx_a >= 0; idx_a--) {
1004 struct memblock_region *m = &type_a->regions[idx_a];
1005
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001006 phys_addr_t m_start = m->base;
1007 phys_addr_t m_end = m->base + m->size;
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001008 int m_nid = memblock_get_region_node(m);
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001009
1010 /* only memory regions are associated with nodes, check it */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001011 if (nid != NUMA_NO_NODE && nid != m_nid)
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001012 continue;
1013
Tang Chen55ac5902014-01-21 15:49:35 -08001014 /* skip hotpluggable memory regions if needed */
1015 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
1016 continue;
1017
Tony Lucka3f5baf2015-06-24 16:58:12 -07001018 /* if we want mirror memory skip non-mirror memory regions */
1019 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
1020 continue;
1021
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +01001022 /* skip nomap memory unless we were asked for it explicitly */
1023 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
1024 continue;
1025
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001026 if (!type_b) {
1027 if (out_start)
1028 *out_start = m_start;
1029 if (out_end)
1030 *out_end = m_end;
1031 if (out_nid)
1032 *out_nid = m_nid;
zijun_hufb399b42016-07-28 15:48:56 -07001033 idx_a--;
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001034 *idx = (u32)idx_a | (u64)idx_b << 32;
1035 return;
1036 }
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001037
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001038 /* scan areas before each reservation */
1039 for (; idx_b >= 0; idx_b--) {
1040 struct memblock_region *r;
1041 phys_addr_t r_start;
1042 phys_addr_t r_end;
1043
1044 r = &type_b->regions[idx_b];
1045 r_start = idx_b ? r[-1].base + r[-1].size : 0;
1046 r_end = idx_b < type_b->cnt ?
1047 r->base : ULLONG_MAX;
1048 /*
1049 * if idx_b advanced past idx_a,
1050 * break out to advance idx_a
1051 */
1052
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001053 if (r_end <= m_start)
1054 break;
1055 /* if the two regions intersect, we're done */
1056 if (m_end > r_start) {
1057 if (out_start)
1058 *out_start = max(m_start, r_start);
1059 if (out_end)
1060 *out_end = min(m_end, r_end);
1061 if (out_nid)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001062 *out_nid = m_nid;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001063 if (m_start >= r_start)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001064 idx_a--;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001065 else
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001066 idx_b--;
1067 *idx = (u32)idx_a | (u64)idx_b << 32;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001068 return;
1069 }
1070 }
1071 }
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001072 /* signal end of iteration */
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001073 *idx = ULLONG_MAX;
1074}
1075
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001076#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1077/*
1078 * Common iterator interface used to define for_each_mem_range().
1079 */
1080void __init_memblock __next_mem_pfn_range(int *idx, int nid,
1081 unsigned long *out_start_pfn,
1082 unsigned long *out_end_pfn, int *out_nid)
1083{
1084 struct memblock_type *type = &memblock.memory;
1085 struct memblock_region *r;
1086
1087 while (++*idx < type->cnt) {
1088 r = &type->regions[*idx];
1089
1090 if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size))
1091 continue;
1092 if (nid == MAX_NUMNODES || nid == r->nid)
1093 break;
1094 }
1095 if (*idx >= type->cnt) {
1096 *idx = -1;
1097 return;
1098 }
1099
1100 if (out_start_pfn)
1101 *out_start_pfn = PFN_UP(r->base);
1102 if (out_end_pfn)
1103 *out_end_pfn = PFN_DOWN(r->base + r->size);
1104 if (out_nid)
1105 *out_nid = r->nid;
1106}
1107
1108/**
1109 * memblock_set_node - set node ID on memblock regions
1110 * @base: base of area to set node ID for
1111 * @size: size of area to set node ID for
Tang Chene7e8de52014-01-21 15:49:26 -08001112 * @type: memblock type to set node ID for
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001113 * @nid: node ID to set
1114 *
Tang Chene7e8de52014-01-21 15:49:26 -08001115 * Set the nid of memblock @type regions in [@base,@base+@size) to @nid.
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001116 * Regions which cross the area boundaries are split as necessary.
1117 *
1118 * RETURNS:
1119 * 0 on success, -errno on failure.
1120 */
1121int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size,
Tang Chene7e8de52014-01-21 15:49:26 -08001122 struct memblock_type *type, int nid)
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001123{
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001124 int start_rgn, end_rgn;
1125 int i, ret;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001126
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001127 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
1128 if (ret)
1129 return ret;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001130
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001131 for (i = start_rgn; i < end_rgn; i++)
Wanpeng Lie9d24ad2012-10-08 16:32:21 -07001132 memblock_set_region_node(&type->regions[i], nid);
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001133
1134 memblock_merge_regions(type);
1135 return 0;
1136}
1137#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
1138
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001139static phys_addr_t __init memblock_alloc_range_nid(phys_addr_t size,
1140 phys_addr_t align, phys_addr_t start,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001141 phys_addr_t end, int nid, ulong flags)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001142{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001143 phys_addr_t found;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001144
Grygorii Strashko79f40fa2014-01-21 15:50:12 -08001145 if (!align)
1146 align = SMP_CACHE_BYTES;
Vineet Gupta94f3d3a2013-04-29 15:06:15 -07001147
Tony Luckfc6daaf2015-06-24 16:58:09 -07001148 found = memblock_find_in_range_node(size, align, start, end, nid,
1149 flags);
Catalin Marinasaedf95e2014-06-06 14:38:20 -07001150 if (found && !memblock_reserve(found, size)) {
1151 /*
1152 * The min_count is set to 0 so that memblock allocations are
1153 * never reported as leaks.
1154 */
Catalin Marinas9099dae2016-10-11 13:55:11 -07001155 kmemleak_alloc_phys(found, size, 0, 0);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001156 return found;
Catalin Marinasaedf95e2014-06-06 14:38:20 -07001157 }
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001158 return 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001159}
1160
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001161phys_addr_t __init memblock_alloc_range(phys_addr_t size, phys_addr_t align,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001162 phys_addr_t start, phys_addr_t end,
1163 ulong flags)
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001164{
Tony Luckfc6daaf2015-06-24 16:58:09 -07001165 return memblock_alloc_range_nid(size, align, start, end, NUMA_NO_NODE,
1166 flags);
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001167}
1168
1169static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size,
1170 phys_addr_t align, phys_addr_t max_addr,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001171 int nid, ulong flags)
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001172{
Tony Luckfc6daaf2015-06-24 16:58:09 -07001173 return memblock_alloc_range_nid(size, align, 0, max_addr, nid, flags);
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001174}
1175
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001176phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid)
1177{
Tony Lucka3f5baf2015-06-24 16:58:12 -07001178 ulong flags = choose_memblock_flags();
1179 phys_addr_t ret;
1180
1181again:
1182 ret = memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE,
1183 nid, flags);
1184
1185 if (!ret && (flags & MEMBLOCK_MIRROR)) {
1186 flags &= ~MEMBLOCK_MIRROR;
1187 goto again;
1188 }
1189 return ret;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001190}
1191
1192phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
1193{
Tony Luckfc6daaf2015-06-24 16:58:09 -07001194 return memblock_alloc_base_nid(size, align, max_addr, NUMA_NO_NODE,
1195 MEMBLOCK_NONE);
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001196}
1197
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001198phys_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 +10001199{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001200 phys_addr_t alloc;
1201
1202 alloc = __memblock_alloc_base(size, align, max_addr);
1203
1204 if (alloc == 0)
1205 panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n",
1206 (unsigned long long) size, (unsigned long long) max_addr);
1207
1208 return alloc;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001209}
1210
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001211phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001212{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001213 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001214}
1215
Benjamin Herrenschmidt9d1e2492010-07-06 15:39:17 -07001216phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid)
1217{
1218 phys_addr_t res = memblock_alloc_nid(size, align, nid);
1219
1220 if (res)
1221 return res;
Tejun Heo15fb0972011-07-12 09:58:07 +02001222 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001223}
1224
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001225/**
1226 * memblock_virt_alloc_internal - allocate boot memory block
1227 * @size: size of memory block to be allocated in bytes
1228 * @align: alignment of the region and block's size
1229 * @min_addr: the lower bound of the memory region to allocate (phys address)
1230 * @max_addr: the upper bound of the memory region to allocate (phys address)
1231 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1232 *
1233 * The @min_addr limit is dropped if it can not be satisfied and the allocation
1234 * will fall back to memory below @min_addr. Also, allocation may fall back
1235 * to any node in the system if the specified node can not
1236 * hold the requested memory.
1237 *
1238 * The allocation is performed from memory region limited by
1239 * memblock.current_limit if @max_addr == %BOOTMEM_ALLOC_ACCESSIBLE.
1240 *
1241 * The memory block is aligned on SMP_CACHE_BYTES if @align == 0.
1242 *
1243 * The phys address of allocated boot memory block is converted to virtual and
1244 * allocated memory is reset to 0.
1245 *
1246 * In addition, function sets the min_count to 0 using kmemleak_alloc for
1247 * allocated boot memory block, so that it is never reported as leaks.
1248 *
1249 * RETURNS:
1250 * Virtual address of allocated memory block on success, NULL on failure.
1251 */
1252static void * __init memblock_virt_alloc_internal(
1253 phys_addr_t size, phys_addr_t align,
1254 phys_addr_t min_addr, phys_addr_t max_addr,
1255 int nid)
1256{
1257 phys_addr_t alloc;
1258 void *ptr;
Tony Lucka3f5baf2015-06-24 16:58:12 -07001259 ulong flags = choose_memblock_flags();
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001260
Grygorii Strashko560dca272014-01-21 15:50:55 -08001261 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
1262 nid = NUMA_NO_NODE;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001263
1264 /*
1265 * Detect any accidental use of these APIs after slab is ready, as at
1266 * this moment memblock may be deinitialized already and its
1267 * internal data may be destroyed (after execution of free_all_bootmem)
1268 */
1269 if (WARN_ON_ONCE(slab_is_available()))
1270 return kzalloc_node(size, GFP_NOWAIT, nid);
1271
1272 if (!align)
1273 align = SMP_CACHE_BYTES;
1274
Yinghai Luf544e142014-01-29 14:05:52 -08001275 if (max_addr > memblock.current_limit)
1276 max_addr = memblock.current_limit;
1277
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001278again:
1279 alloc = memblock_find_in_range_node(size, align, min_addr, max_addr,
Tony Lucka3f5baf2015-06-24 16:58:12 -07001280 nid, flags);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001281 if (alloc)
1282 goto done;
1283
1284 if (nid != NUMA_NO_NODE) {
1285 alloc = memblock_find_in_range_node(size, align, min_addr,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001286 max_addr, NUMA_NO_NODE,
Tony Lucka3f5baf2015-06-24 16:58:12 -07001287 flags);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001288 if (alloc)
1289 goto done;
1290 }
1291
1292 if (min_addr) {
1293 min_addr = 0;
1294 goto again;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001295 }
1296
Tony Lucka3f5baf2015-06-24 16:58:12 -07001297 if (flags & MEMBLOCK_MIRROR) {
1298 flags &= ~MEMBLOCK_MIRROR;
1299 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
1300 &size);
1301 goto again;
1302 }
1303
1304 return NULL;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001305done:
1306 memblock_reserve(alloc, size);
1307 ptr = phys_to_virt(alloc);
1308 memset(ptr, 0, size);
1309
1310 /*
1311 * The min_count is set to 0 so that bootmem allocated blocks
1312 * are never reported as leaks. This is because many of these blocks
1313 * are only referred via the physical address which is not
1314 * looked up by kmemleak.
1315 */
1316 kmemleak_alloc(ptr, size, 0, 0);
1317
1318 return ptr;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001319}
1320
1321/**
1322 * memblock_virt_alloc_try_nid_nopanic - allocate boot memory block
1323 * @size: size of memory block to be allocated in bytes
1324 * @align: alignment of the region and block's size
1325 * @min_addr: the lower bound of the memory region from where the allocation
1326 * is preferred (phys address)
1327 * @max_addr: the upper bound of the memory region from where the allocation
1328 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1329 * allocate only from memory limited by memblock.current_limit value
1330 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1331 *
1332 * Public version of _memblock_virt_alloc_try_nid_nopanic() which provides
1333 * additional debug information (including caller info), if enabled.
1334 *
1335 * RETURNS:
1336 * Virtual address of allocated memory block on success, NULL on failure.
1337 */
1338void * __init memblock_virt_alloc_try_nid_nopanic(
1339 phys_addr_t size, phys_addr_t align,
1340 phys_addr_t min_addr, phys_addr_t max_addr,
1341 int nid)
1342{
1343 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1344 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1345 (u64)max_addr, (void *)_RET_IP_);
1346 return memblock_virt_alloc_internal(size, align, min_addr,
1347 max_addr, nid);
1348}
1349
1350/**
1351 * memblock_virt_alloc_try_nid - allocate boot memory block with panicking
1352 * @size: size of memory block to be allocated in bytes
1353 * @align: alignment of the region and block's size
1354 * @min_addr: the lower bound of the memory region from where the allocation
1355 * is preferred (phys address)
1356 * @max_addr: the upper bound of the memory region from where the allocation
1357 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1358 * allocate only from memory limited by memblock.current_limit value
1359 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1360 *
1361 * Public panicking version of _memblock_virt_alloc_try_nid_nopanic()
1362 * which provides debug information (including caller info), if enabled,
1363 * and panics if the request can not be satisfied.
1364 *
1365 * RETURNS:
1366 * Virtual address of allocated memory block on success, NULL on failure.
1367 */
1368void * __init memblock_virt_alloc_try_nid(
1369 phys_addr_t size, phys_addr_t align,
1370 phys_addr_t min_addr, phys_addr_t max_addr,
1371 int nid)
1372{
1373 void *ptr;
1374
1375 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1376 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1377 (u64)max_addr, (void *)_RET_IP_);
1378 ptr = memblock_virt_alloc_internal(size, align,
1379 min_addr, max_addr, nid);
1380 if (ptr)
1381 return ptr;
1382
1383 panic("%s: Failed to allocate %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx\n",
1384 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1385 (u64)max_addr);
1386 return NULL;
1387}
1388
1389/**
1390 * __memblock_free_early - free boot memory block
1391 * @base: phys starting address of the boot memory block
1392 * @size: size of the boot memory block in bytes
1393 *
1394 * Free boot memory block previously allocated by memblock_virt_alloc_xx() API.
1395 * The freeing memory will not be released to the buddy allocator.
1396 */
1397void __init __memblock_free_early(phys_addr_t base, phys_addr_t size)
1398{
1399 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1400 __func__, (u64)base, (u64)base + size - 1,
1401 (void *)_RET_IP_);
Catalin Marinas9099dae2016-10-11 13:55:11 -07001402 kmemleak_free_part_phys(base, size);
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001403 memblock_remove_range(&memblock.reserved, base, size);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001404}
1405
1406/*
1407 * __memblock_free_late - free bootmem block pages directly to buddy allocator
1408 * @addr: phys starting address of the boot memory block
1409 * @size: size of the boot memory block in bytes
1410 *
1411 * This is only useful when the bootmem allocator has already been torn
1412 * down, but we are still initializing the system. Pages are released directly
1413 * to the buddy allocator, no bootmem metadata is updated because it is gone.
1414 */
1415void __init __memblock_free_late(phys_addr_t base, phys_addr_t size)
1416{
1417 u64 cursor, end;
1418
1419 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1420 __func__, (u64)base, (u64)base + size - 1,
1421 (void *)_RET_IP_);
Catalin Marinas9099dae2016-10-11 13:55:11 -07001422 kmemleak_free_part_phys(base, size);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001423 cursor = PFN_UP(base);
1424 end = PFN_DOWN(base + size);
1425
1426 for (; cursor < end; cursor++) {
Mel Gormand70ddd72015-06-30 14:56:52 -07001427 __free_pages_bootmem(pfn_to_page(cursor), cursor, 0);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001428 totalram_pages++;
1429 }
1430}
Benjamin Herrenschmidt9d1e2492010-07-06 15:39:17 -07001431
1432/*
1433 * Remaining API functions
1434 */
1435
David Gibson1f1ffb8a2016-02-05 15:36:19 -08001436phys_addr_t __init_memblock memblock_phys_mem_size(void)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001437{
Tejun Heo1440c4e2011-12-08 10:22:08 -08001438 return memblock.memory.total_size;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001439}
1440
Srikar Dronamraju8907de52016-10-07 16:59:18 -07001441phys_addr_t __init_memblock memblock_reserved_size(void)
1442{
1443 return memblock.reserved.total_size;
1444}
1445
Yinghai Lu595ad9a2013-01-24 12:20:09 -08001446phys_addr_t __init memblock_mem_size(unsigned long limit_pfn)
1447{
1448 unsigned long pages = 0;
1449 struct memblock_region *r;
1450 unsigned long start_pfn, end_pfn;
1451
1452 for_each_memblock(memory, r) {
1453 start_pfn = memblock_region_memory_base_pfn(r);
1454 end_pfn = memblock_region_memory_end_pfn(r);
1455 start_pfn = min_t(unsigned long, start_pfn, limit_pfn);
1456 end_pfn = min_t(unsigned long, end_pfn, limit_pfn);
1457 pages += end_pfn - start_pfn;
1458 }
1459
Fabian Frederick16763232014-04-07 15:37:53 -07001460 return PFN_PHYS(pages);
Yinghai Lu595ad9a2013-01-24 12:20:09 -08001461}
1462
Sam Ravnborg0a93ebe2011-10-31 17:08:16 -07001463/* lowest address */
1464phys_addr_t __init_memblock memblock_start_of_DRAM(void)
1465{
1466 return memblock.memory.regions[0].base;
1467}
1468
Yinghai Lu10d06432010-07-28 15:43:02 +10001469phys_addr_t __init_memblock memblock_end_of_DRAM(void)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001470{
1471 int idx = memblock.memory.cnt - 1;
1472
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +10001473 return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001474}
1475
Dennis Chena571d4e2016-07-28 15:48:26 -07001476static phys_addr_t __init_memblock __find_max_addr(phys_addr_t limit)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001477{
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001478 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
Emil Medve136199f2014-04-07 15:37:52 -07001479 struct memblock_region *r;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001480
Dennis Chena571d4e2016-07-28 15:48:26 -07001481 /*
1482 * translate the memory @limit size into the max address within one of
1483 * the memory memblock regions, if the @limit exceeds the total size
1484 * of those regions, max_addr will keep original value ULLONG_MAX
1485 */
Emil Medve136199f2014-04-07 15:37:52 -07001486 for_each_memblock(memory, r) {
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001487 if (limit <= r->size) {
1488 max_addr = r->base + limit;
1489 break;
1490 }
1491 limit -= r->size;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001492 }
1493
Dennis Chena571d4e2016-07-28 15:48:26 -07001494 return max_addr;
1495}
1496
1497void __init memblock_enforce_memory_limit(phys_addr_t limit)
1498{
1499 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
1500
1501 if (!limit)
1502 return;
1503
1504 max_addr = __find_max_addr(limit);
1505
1506 /* @limit exceeds the total size of the memory, do nothing */
1507 if (max_addr == (phys_addr_t)ULLONG_MAX)
1508 return;
1509
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001510 /* truncate both memory and reserved regions */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001511 memblock_remove_range(&memblock.memory, max_addr,
1512 (phys_addr_t)ULLONG_MAX);
1513 memblock_remove_range(&memblock.reserved, max_addr,
1514 (phys_addr_t)ULLONG_MAX);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001515}
1516
Dennis Chena571d4e2016-07-28 15:48:26 -07001517void __init memblock_mem_limit_remove_map(phys_addr_t limit)
1518{
1519 struct memblock_type *type = &memblock.memory;
1520 phys_addr_t max_addr;
1521 int i, ret, start_rgn, end_rgn;
1522
1523 if (!limit)
1524 return;
1525
1526 max_addr = __find_max_addr(limit);
1527
1528 /* @limit exceeds the total size of the memory, do nothing */
1529 if (max_addr == (phys_addr_t)ULLONG_MAX)
1530 return;
1531
1532 ret = memblock_isolate_range(type, max_addr, (phys_addr_t)ULLONG_MAX,
1533 &start_rgn, &end_rgn);
1534 if (ret)
1535 return;
1536
1537 /* remove all the MAP regions above the limit */
1538 for (i = end_rgn - 1; i >= start_rgn; i--) {
1539 if (!memblock_is_nomap(&type->regions[i]))
1540 memblock_remove_region(type, i);
1541 }
1542 /* truncate the reserved regions */
1543 memblock_remove_range(&memblock.reserved, max_addr,
1544 (phys_addr_t)ULLONG_MAX);
1545}
1546
Yinghai Lucd794812010-10-11 12:34:09 -07001547static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001548{
1549 unsigned int left = 0, right = type->cnt;
1550
1551 do {
1552 unsigned int mid = (right + left) / 2;
1553
1554 if (addr < type->regions[mid].base)
1555 right = mid;
1556 else if (addr >= (type->regions[mid].base +
1557 type->regions[mid].size))
1558 left = mid + 1;
1559 else
1560 return mid;
1561 } while (left < right);
1562 return -1;
1563}
1564
Yaowei Baib4ad0c72016-01-14 15:18:54 -08001565bool __init memblock_is_reserved(phys_addr_t addr)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001566{
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001567 return memblock_search(&memblock.reserved, addr) != -1;
1568}
Yinghai Lu95f72d12010-07-12 14:36:09 +10001569
Yaowei Baib4ad0c72016-01-14 15:18:54 -08001570bool __init_memblock memblock_is_memory(phys_addr_t addr)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001571{
1572 return memblock_search(&memblock.memory, addr) != -1;
1573}
1574
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +01001575int __init_memblock memblock_is_map_memory(phys_addr_t addr)
1576{
1577 int i = memblock_search(&memblock.memory, addr);
1578
1579 if (i == -1)
1580 return false;
1581 return !memblock_is_nomap(&memblock.memory.regions[i]);
1582}
1583
Yinghai Lue76b63f2013-09-11 14:22:17 -07001584#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1585int __init_memblock memblock_search_pfn_nid(unsigned long pfn,
1586 unsigned long *start_pfn, unsigned long *end_pfn)
1587{
1588 struct memblock_type *type = &memblock.memory;
Fabian Frederick16763232014-04-07 15:37:53 -07001589 int mid = memblock_search(type, PFN_PHYS(pfn));
Yinghai Lue76b63f2013-09-11 14:22:17 -07001590
1591 if (mid == -1)
1592 return -1;
1593
Fabian Frederickf7e2f7e2014-06-04 16:07:51 -07001594 *start_pfn = PFN_DOWN(type->regions[mid].base);
1595 *end_pfn = PFN_DOWN(type->regions[mid].base + type->regions[mid].size);
Yinghai Lue76b63f2013-09-11 14:22:17 -07001596
1597 return type->regions[mid].nid;
1598}
1599#endif
1600
Stephen Boydeab30942012-05-24 00:45:21 -07001601/**
1602 * memblock_is_region_memory - check if a region is a subset of memory
1603 * @base: base of region to check
1604 * @size: size of region to check
1605 *
1606 * Check if the region [@base, @base+@size) is a subset of a memory block.
1607 *
1608 * RETURNS:
1609 * 0 if false, non-zero if true
1610 */
Yinghai Lu3661ca62010-09-15 13:05:29 -07001611int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001612{
Tomi Valkeinenabb65272011-01-20 14:44:20 -08001613 int idx = memblock_search(&memblock.memory, base);
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001614 phys_addr_t end = base + memblock_cap_size(base, &size);
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001615
1616 if (idx == -1)
1617 return 0;
Tomi Valkeinenabb65272011-01-20 14:44:20 -08001618 return memblock.memory.regions[idx].base <= base &&
1619 (memblock.memory.regions[idx].base +
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001620 memblock.memory.regions[idx].size) >= end;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001621}
1622
Stephen Boydeab30942012-05-24 00:45:21 -07001623/**
1624 * memblock_is_region_reserved - check if a region intersects reserved memory
1625 * @base: base of region to check
1626 * @size: size of region to check
1627 *
1628 * Check if the region [@base, @base+@size) intersects a reserved memory block.
1629 *
1630 * RETURNS:
Tang Chenc5c5c9d2015-09-08 15:02:00 -07001631 * True if they intersect, false if not.
Stephen Boydeab30942012-05-24 00:45:21 -07001632 */
Tang Chenc5c5c9d2015-09-08 15:02:00 -07001633bool __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001634{
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001635 memblock_cap_size(base, &size);
Tang Chenc5c5c9d2015-09-08 15:02:00 -07001636 return memblock_overlaps_region(&memblock.reserved, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001637}
1638
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001639void __init_memblock memblock_trim_memory(phys_addr_t align)
1640{
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001641 phys_addr_t start, end, orig_start, orig_end;
Emil Medve136199f2014-04-07 15:37:52 -07001642 struct memblock_region *r;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001643
Emil Medve136199f2014-04-07 15:37:52 -07001644 for_each_memblock(memory, r) {
1645 orig_start = r->base;
1646 orig_end = r->base + r->size;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001647 start = round_up(orig_start, align);
1648 end = round_down(orig_end, align);
1649
1650 if (start == orig_start && end == orig_end)
1651 continue;
1652
1653 if (start < end) {
Emil Medve136199f2014-04-07 15:37:52 -07001654 r->base = start;
1655 r->size = end - start;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001656 } else {
Emil Medve136199f2014-04-07 15:37:52 -07001657 memblock_remove_region(&memblock.memory,
1658 r - memblock.memory.regions);
1659 r--;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001660 }
1661 }
1662}
Benjamin Herrenschmidte63075a2010-07-06 15:39:01 -07001663
Yinghai Lu3661ca62010-09-15 13:05:29 -07001664void __init_memblock memblock_set_current_limit(phys_addr_t limit)
Benjamin Herrenschmidte63075a2010-07-06 15:39:01 -07001665{
1666 memblock.current_limit = limit;
1667}
1668
Laura Abbottfec51012014-02-27 01:23:43 +01001669phys_addr_t __init_memblock memblock_get_current_limit(void)
1670{
1671 return memblock.current_limit;
1672}
1673
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001674static void __init_memblock memblock_dump(struct memblock_type *type, char *name)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001675{
1676 unsigned long long base, size;
Tang Chen66a20752014-01-21 15:49:20 -08001677 unsigned long flags;
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -08001678 int idx;
1679 struct memblock_region *rgn;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001680
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001681 pr_info(" %s.cnt = 0x%lx\n", name, type->cnt);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001682
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -08001683 for_each_memblock_type(type, rgn) {
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001684 char nid_buf[32] = "";
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001685
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001686 base = rgn->base;
1687 size = rgn->size;
Tang Chen66a20752014-01-21 15:49:20 -08001688 flags = rgn->flags;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001689#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1690 if (memblock_get_region_node(rgn) != MAX_NUMNODES)
1691 snprintf(nid_buf, sizeof(nid_buf), " on node %d",
1692 memblock_get_region_node(rgn));
1693#endif
Tang Chen66a20752014-01-21 15:49:20 -08001694 pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s flags: %#lx\n",
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -08001695 name, idx, base, base + size - 1, size, nid_buf, flags);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001696 }
1697}
1698
Michal Hocko292f70c2017-06-02 14:46:49 -07001699extern unsigned long __init_memblock
1700memblock_reserved_memory_within(phys_addr_t start_addr, phys_addr_t end_addr)
1701{
1702 struct memblock_region *rgn;
1703 unsigned long size = 0;
1704 int idx;
1705
1706 for_each_memblock_type((&memblock.reserved), rgn) {
1707 phys_addr_t start, end;
1708
1709 if (rgn->base + rgn->size < start_addr)
1710 continue;
1711 if (rgn->base > end_addr)
1712 continue;
1713
1714 start = rgn->base;
1715 end = start + rgn->size;
1716 size += end - start;
1717 }
1718
1719 return size;
1720}
1721
Tejun Heo4ff7b822011-12-08 10:22:06 -08001722void __init_memblock __memblock_dump_all(void)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001723{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001724 pr_info("MEMBLOCK configuration:\n");
Tejun Heo1440c4e2011-12-08 10:22:08 -08001725 pr_info(" memory size = %#llx reserved size = %#llx\n",
1726 (unsigned long long)memblock.memory.total_size,
1727 (unsigned long long)memblock.reserved.total_size);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001728
1729 memblock_dump(&memblock.memory, "memory");
1730 memblock_dump(&memblock.reserved, "reserved");
1731}
1732
Tejun Heo1aadc052011-12-08 10:22:08 -08001733void __init memblock_allow_resize(void)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001734{
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -07001735 memblock_can_resize = 1;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001736}
1737
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001738static int __init early_memblock(char *p)
1739{
1740 if (p && strstr(p, "debug"))
1741 memblock_debug = 1;
1742 return 0;
1743}
1744early_param("memblock", early_memblock);
1745
Tejun Heoc378ddd2011-07-14 11:46:03 +02001746#if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001747
1748static int memblock_debug_show(struct seq_file *m, void *private)
1749{
1750 struct memblock_type *type = m->private;
1751 struct memblock_region *reg;
1752 int i;
1753
1754 for (i = 0; i < type->cnt; i++) {
1755 reg = &type->regions[i];
1756 seq_printf(m, "%4d: ", i);
1757 if (sizeof(phys_addr_t) == 4)
1758 seq_printf(m, "0x%08lx..0x%08lx\n",
1759 (unsigned long)reg->base,
1760 (unsigned long)(reg->base + reg->size - 1));
1761 else
1762 seq_printf(m, "0x%016llx..0x%016llx\n",
1763 (unsigned long long)reg->base,
1764 (unsigned long long)(reg->base + reg->size - 1));
1765
1766 }
1767 return 0;
1768}
1769
1770static int memblock_debug_open(struct inode *inode, struct file *file)
1771{
1772 return single_open(file, memblock_debug_show, inode->i_private);
1773}
1774
1775static const struct file_operations memblock_debug_fops = {
1776 .open = memblock_debug_open,
1777 .read = seq_read,
1778 .llseek = seq_lseek,
1779 .release = single_release,
1780};
1781
1782static int __init memblock_init_debugfs(void)
1783{
1784 struct dentry *root = debugfs_create_dir("memblock", NULL);
1785 if (!root)
1786 return -ENXIO;
1787 debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops);
1788 debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops);
Philipp Hachtmann70210ed2014-01-29 18:16:01 +01001789#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
1790 debugfs_create_file("physmem", S_IRUGO, root, &memblock.physmem, &memblock_debug_fops);
1791#endif
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001792
1793 return 0;
1794}
1795__initcall(memblock_init_debugfs);
1796
1797#endif /* CONFIG_DEBUG_FS */