blob: 2cb25fe4452c279c5ff6ff74cbbfee64128d820e [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,
Heiko Carstens0262d9c2017-02-24 14:55:59 -080038 .memory.name = "memory",
Tejun Heofe091c22011-12-08 10:22:07 -080039
40 .reserved.regions = memblock_reserved_init_regions,
41 .reserved.cnt = 1, /* empty dummy entry */
42 .reserved.max = INIT_MEMBLOCK_REGIONS,
Heiko Carstens0262d9c2017-02-24 14:55:59 -080043 .reserved.name = "reserved",
Tejun Heofe091c22011-12-08 10:22:07 -080044
Philipp Hachtmann70210ed2014-01-29 18:16:01 +010045#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
46 .physmem.regions = memblock_physmem_init_regions,
47 .physmem.cnt = 1, /* empty dummy entry */
48 .physmem.max = INIT_PHYSMEM_REGIONS,
Heiko Carstens0262d9c2017-02-24 14:55:59 -080049 .physmem.name = "physmem",
Philipp Hachtmann70210ed2014-01-29 18:16:01 +010050#endif
51
Tang Chen79442ed2013-11-12 15:07:59 -080052 .bottom_up = false,
Tejun Heofe091c22011-12-08 10:22:07 -080053 .current_limit = MEMBLOCK_ALLOC_ANYWHERE,
54};
Yinghai Lu95f72d12010-07-12 14:36:09 +100055
Yinghai Lu10d06432010-07-28 15:43:02 +100056int memblock_debug __initdata_memblock;
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
Tejun Heoeb18f1b2011-12-08 10:22:07 -080067/* adjust *@size so that (@base + *@size) doesn't overflow, return new size */
68static inline phys_addr_t memblock_cap_size(phys_addr_t base, phys_addr_t *size)
69{
70 return *size = min(*size, (phys_addr_t)ULLONG_MAX - base);
71}
72
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100073/*
74 * Address comparison utilities
75 */
Yinghai Lu10d06432010-07-28 15:43:02 +100076static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1,
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +100077 phys_addr_t base2, phys_addr_t size2)
Yinghai Lu95f72d12010-07-12 14:36:09 +100078{
79 return ((base1 < (base2 + size2)) && (base2 < (base1 + size1)));
80}
81
Tang Chen95cf82e2015-09-08 15:02:03 -070082bool __init_memblock memblock_overlaps_region(struct memblock_type *type,
H Hartley Sweeten2d7d3eb2011-10-31 17:09:15 -070083 phys_addr_t base, phys_addr_t size)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100084{
85 unsigned long i;
86
Alexander Kuleshovf14516f2016-01-14 15:20:39 -080087 for (i = 0; i < type->cnt; i++)
88 if (memblock_addrs_overlap(base, size, type->regions[i].base,
89 type->regions[i].size))
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100090 break;
Tang Chenc5c5c9d2015-09-08 15:02:00 -070091 return i < type->cnt;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100092}
93
Tang Chen79442ed2013-11-12 15:07:59 -080094/*
95 * __memblock_find_range_bottom_up - find free area utility in bottom-up
96 * @start: start of candidate range
97 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
98 * @size: size of free area to find
99 * @align: alignment of free area to find
Grygorii Strashkob1154232014-01-21 15:50:16 -0800100 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Tony Luckfc6daaf2015-06-24 16:58:09 -0700101 * @flags: pick from blocks based on memory attributes
Tang Chen79442ed2013-11-12 15:07:59 -0800102 *
103 * Utility called from memblock_find_in_range_node(), find free area bottom-up.
104 *
105 * RETURNS:
106 * Found address on success, 0 on failure.
107 */
108static phys_addr_t __init_memblock
109__memblock_find_range_bottom_up(phys_addr_t start, phys_addr_t end,
Tony Luckfc6daaf2015-06-24 16:58:09 -0700110 phys_addr_t size, phys_addr_t align, int nid,
111 ulong flags)
Tang Chen79442ed2013-11-12 15:07:59 -0800112{
113 phys_addr_t this_start, this_end, cand;
114 u64 i;
115
Tony Luckfc6daaf2015-06-24 16:58:09 -0700116 for_each_free_mem_range(i, nid, flags, &this_start, &this_end, NULL) {
Tang Chen79442ed2013-11-12 15:07:59 -0800117 this_start = clamp(this_start, start, end);
118 this_end = clamp(this_end, start, end);
119
120 cand = round_up(this_start, align);
121 if (cand < this_end && this_end - cand >= size)
122 return cand;
123 }
124
125 return 0;
126}
127
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800128/**
Tang Chen14028992013-11-12 15:07:57 -0800129 * __memblock_find_range_top_down - find free area utility, in top-down
130 * @start: start of candidate range
131 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
132 * @size: size of free area to find
133 * @align: alignment of free area to find
Grygorii Strashkob1154232014-01-21 15:50:16 -0800134 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Tony Luckfc6daaf2015-06-24 16:58:09 -0700135 * @flags: pick from blocks based on memory attributes
Tang Chen14028992013-11-12 15:07:57 -0800136 *
137 * Utility called from memblock_find_in_range_node(), find free area top-down.
138 *
139 * RETURNS:
Tang Chen79442ed2013-11-12 15:07:59 -0800140 * Found address on success, 0 on failure.
Tang Chen14028992013-11-12 15:07:57 -0800141 */
142static phys_addr_t __init_memblock
143__memblock_find_range_top_down(phys_addr_t start, phys_addr_t end,
Tony Luckfc6daaf2015-06-24 16:58:09 -0700144 phys_addr_t size, phys_addr_t align, int nid,
145 ulong flags)
Tang Chen14028992013-11-12 15:07:57 -0800146{
147 phys_addr_t this_start, this_end, cand;
148 u64 i;
149
Tony Luckfc6daaf2015-06-24 16:58:09 -0700150 for_each_free_mem_range_reverse(i, nid, flags, &this_start, &this_end,
151 NULL) {
Tang Chen14028992013-11-12 15:07:57 -0800152 this_start = clamp(this_start, start, end);
153 this_end = clamp(this_end, start, end);
154
155 if (this_end < size)
156 continue;
157
158 cand = round_down(this_end - size, align);
159 if (cand >= this_start)
160 return cand;
161 }
162
163 return 0;
164}
165
166/**
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800167 * memblock_find_in_range_node - find free area in given range and node
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800168 * @size: size of free area to find
169 * @align: alignment of free area to find
Grygorii Strashko87029ee2014-01-21 15:50:14 -0800170 * @start: start of candidate range
171 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
Grygorii Strashkob1154232014-01-21 15:50:16 -0800172 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Tony Luckfc6daaf2015-06-24 16:58:09 -0700173 * @flags: pick from blocks based on memory attributes
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800174 *
175 * Find @size free area aligned to @align in the specified range and node.
176 *
Tang Chen79442ed2013-11-12 15:07:59 -0800177 * When allocation direction is bottom-up, the @start should be greater
178 * than the end of the kernel image. Otherwise, it will be trimmed. The
179 * reason is that we want the bottom-up allocation just near the kernel
180 * image so it is highly likely that the allocated memory and the kernel
181 * will reside in the same node.
182 *
183 * If bottom-up allocation failed, will try to allocate memory top-down.
184 *
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800185 * RETURNS:
Tang Chen79442ed2013-11-12 15:07:59 -0800186 * Found address on success, 0 on failure.
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000187 */
Grygorii Strashko87029ee2014-01-21 15:50:14 -0800188phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t size,
189 phys_addr_t align, phys_addr_t start,
Tony Luckfc6daaf2015-06-24 16:58:09 -0700190 phys_addr_t end, int nid, ulong flags)
Tang Chenf7210e62013-02-22 16:33:51 -0800191{
Tang Chen0cfb8f02014-08-29 15:18:31 -0700192 phys_addr_t kernel_end, ret;
Tang Chen79442ed2013-11-12 15:07:59 -0800193
Tang Chenf7210e62013-02-22 16:33:51 -0800194 /* pump up @end */
195 if (end == MEMBLOCK_ALLOC_ACCESSIBLE)
196 end = memblock.current_limit;
197
198 /* avoid allocating the first page */
199 start = max_t(phys_addr_t, start, PAGE_SIZE);
200 end = max(start, end);
Tang Chen79442ed2013-11-12 15:07:59 -0800201 kernel_end = __pa_symbol(_end);
202
203 /*
204 * try bottom-up allocation only when bottom-up mode
205 * is set and @end is above the kernel image.
206 */
207 if (memblock_bottom_up() && end > kernel_end) {
208 phys_addr_t bottom_up_start;
209
210 /* make sure we will allocate above the kernel */
211 bottom_up_start = max(start, kernel_end);
212
213 /* ok, try bottom-up allocation first */
214 ret = __memblock_find_range_bottom_up(bottom_up_start, end,
Tony Luckfc6daaf2015-06-24 16:58:09 -0700215 size, align, nid, flags);
Tang Chen79442ed2013-11-12 15:07:59 -0800216 if (ret)
217 return ret;
218
219 /*
220 * we always limit bottom-up allocation above the kernel,
221 * but top-down allocation doesn't have the limit, so
222 * retrying top-down allocation may succeed when bottom-up
223 * allocation failed.
224 *
225 * bottom-up allocation is expected to be fail very rarely,
226 * so we use WARN_ONCE() here to see the stack trace if
227 * fail happens.
228 */
Joe Perches756a0252016-03-17 14:19:47 -0700229 WARN_ONCE(1, "memblock: bottom-up allocation failed, memory hotunplug may be affected\n");
Tang Chen79442ed2013-11-12 15:07:59 -0800230 }
Tang Chenf7210e62013-02-22 16:33:51 -0800231
Tony Luckfc6daaf2015-06-24 16:58:09 -0700232 return __memblock_find_range_top_down(start, end, size, align, nid,
233 flags);
Tang Chenf7210e62013-02-22 16:33:51 -0800234}
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000235
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800236/**
237 * memblock_find_in_range - find free area in given range
238 * @start: start of candidate range
239 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
240 * @size: size of free area to find
241 * @align: alignment of free area to find
242 *
243 * Find @size free area aligned to @align in the specified range.
244 *
245 * RETURNS:
Tang Chen79442ed2013-11-12 15:07:59 -0800246 * Found address on success, 0 on failure.
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800247 */
248phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start,
249 phys_addr_t end, phys_addr_t size,
250 phys_addr_t align)
251{
Tony Lucka3f5baf2015-06-24 16:58:12 -0700252 phys_addr_t ret;
253 ulong flags = choose_memblock_flags();
254
255again:
256 ret = memblock_find_in_range_node(size, align, start, end,
257 NUMA_NO_NODE, flags);
258
259 if (!ret && (flags & MEMBLOCK_MIRROR)) {
260 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
261 &size);
262 flags &= ~MEMBLOCK_MIRROR;
263 goto again;
264 }
265
266 return ret;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800267}
268
Yinghai Lu10d06432010-07-28 15:43:02 +1000269static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000270{
Tejun Heo1440c4e2011-12-08 10:22:08 -0800271 type->total_size -= type->regions[r].size;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200272 memmove(&type->regions[r], &type->regions[r + 1],
273 (type->cnt - (r + 1)) * sizeof(type->regions[r]));
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000274 type->cnt--;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000275
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700276 /* Special case for empty arrays */
277 if (type->cnt == 0) {
Tejun Heo1440c4e2011-12-08 10:22:08 -0800278 WARN_ON(type->total_size != 0);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700279 type->cnt = 1;
280 type->regions[0].base = 0;
281 type->regions[0].size = 0;
Tang Chen66a20752014-01-21 15:49:20 -0800282 type->regions[0].flags = 0;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200283 memblock_set_region_node(&type->regions[0], MAX_NUMNODES);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700284 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000285}
286
Philipp Hachtmann354f17e2014-01-23 15:53:24 -0800287#ifdef CONFIG_ARCH_DISCARD_MEMBLOCK
288
Yinghai Lu29f67382012-07-11 14:02:56 -0700289phys_addr_t __init_memblock get_allocated_memblock_reserved_regions_info(
290 phys_addr_t *addr)
291{
292 if (memblock.reserved.regions == memblock_reserved_init_regions)
293 return 0;
294
295 *addr = __pa(memblock.reserved.regions);
296
297 return PAGE_ALIGN(sizeof(struct memblock_region) *
298 memblock.reserved.max);
299}
300
Philipp Hachtmann5e270e22014-01-23 15:53:11 -0800301phys_addr_t __init_memblock get_allocated_memblock_memory_regions_info(
302 phys_addr_t *addr)
303{
304 if (memblock.memory.regions == memblock_memory_init_regions)
305 return 0;
306
307 *addr = __pa(memblock.memory.regions);
308
309 return PAGE_ALIGN(sizeof(struct memblock_region) *
310 memblock.memory.max);
311}
312
313#endif
314
Greg Pearson48c3b582012-06-20 12:53:05 -0700315/**
316 * memblock_double_array - double the size of the memblock regions array
317 * @type: memblock type of the regions array being doubled
318 * @new_area_start: starting address of memory range to avoid overlap with
319 * @new_area_size: size of memory range to avoid overlap with
320 *
321 * Double the size of the @type regions array. If memblock is being used to
322 * allocate memory for a new reserved regions array and there is a previously
323 * allocated memory range [@new_area_start,@new_area_start+@new_area_size]
324 * waiting to be reserved, ensure the memory used by the new array does
325 * not overlap.
326 *
327 * RETURNS:
328 * 0 on success, -1 on failure.
329 */
330static int __init_memblock memblock_double_array(struct memblock_type *type,
331 phys_addr_t new_area_start,
332 phys_addr_t new_area_size)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700333{
334 struct memblock_region *new_array, *old_array;
Yinghai Lu29f67382012-07-11 14:02:56 -0700335 phys_addr_t old_alloc_size, new_alloc_size;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700336 phys_addr_t old_size, new_size, addr;
337 int use_slab = slab_is_available();
Gavin Shan181eb392012-05-29 15:06:50 -0700338 int *in_slab;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700339
340 /* We don't allow resizing until we know about the reserved regions
341 * of memory that aren't suitable for allocation
342 */
343 if (!memblock_can_resize)
344 return -1;
345
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700346 /* Calculate new doubled size */
347 old_size = type->max * sizeof(struct memblock_region);
348 new_size = old_size << 1;
Yinghai Lu29f67382012-07-11 14:02:56 -0700349 /*
350 * We need to allocated new one align to PAGE_SIZE,
351 * so we can free them completely later.
352 */
353 old_alloc_size = PAGE_ALIGN(old_size);
354 new_alloc_size = PAGE_ALIGN(new_size);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700355
Gavin Shan181eb392012-05-29 15:06:50 -0700356 /* Retrieve the slab flag */
357 if (type == &memblock.memory)
358 in_slab = &memblock_memory_in_slab;
359 else
360 in_slab = &memblock_reserved_in_slab;
361
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700362 /* Try to find some space for it.
363 *
364 * WARNING: We assume that either slab_is_available() and we use it or
Andrew Mortonfd073832012-07-31 16:42:40 -0700365 * we use MEMBLOCK for allocations. That means that this is unsafe to
366 * use when bootmem is currently active (unless bootmem itself is
367 * implemented on top of MEMBLOCK which isn't the case yet)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700368 *
369 * This should however not be an issue for now, as we currently only
Andrew Mortonfd073832012-07-31 16:42:40 -0700370 * call into MEMBLOCK while it's still active, or much later when slab
371 * is active for memory hotplug operations
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700372 */
373 if (use_slab) {
374 new_array = kmalloc(new_size, GFP_KERNEL);
Tejun Heo1f5026a2011-07-12 09:58:09 +0200375 addr = new_array ? __pa(new_array) : 0;
Gavin Shan4e2f0772012-05-29 15:06:50 -0700376 } else {
Greg Pearson48c3b582012-06-20 12:53:05 -0700377 /* only exclude range when trying to double reserved.regions */
378 if (type != &memblock.reserved)
379 new_area_start = new_area_size = 0;
380
381 addr = memblock_find_in_range(new_area_start + new_area_size,
382 memblock.current_limit,
Yinghai Lu29f67382012-07-11 14:02:56 -0700383 new_alloc_size, PAGE_SIZE);
Greg Pearson48c3b582012-06-20 12:53:05 -0700384 if (!addr && new_area_size)
385 addr = memblock_find_in_range(0,
Andrew Mortonfd073832012-07-31 16:42:40 -0700386 min(new_area_start, memblock.current_limit),
387 new_alloc_size, PAGE_SIZE);
Greg Pearson48c3b582012-06-20 12:53:05 -0700388
Sachin Kamat15674862012-09-04 13:55:05 +0530389 new_array = addr ? __va(addr) : NULL;
Gavin Shan4e2f0772012-05-29 15:06:50 -0700390 }
Tejun Heo1f5026a2011-07-12 09:58:09 +0200391 if (!addr) {
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700392 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
Heiko Carstens0262d9c2017-02-24 14:55:59 -0800393 type->name, type->max, type->max * 2);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700394 return -1;
395 }
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700396
Andrew Mortonfd073832012-07-31 16:42:40 -0700397 memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]",
Heiko Carstens0262d9c2017-02-24 14:55:59 -0800398 type->name, type->max * 2, (u64)addr,
Andrew Mortonfd073832012-07-31 16:42:40 -0700399 (u64)addr + new_size - 1);
Yinghai Luea9e4372010-07-28 15:13:22 +1000400
Andrew Mortonfd073832012-07-31 16:42:40 -0700401 /*
402 * Found space, we now need to move the array over before we add the
403 * reserved region since it may be our reserved array itself that is
404 * full.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700405 */
406 memcpy(new_array, type->regions, old_size);
407 memset(new_array + type->max, 0, old_size);
408 old_array = type->regions;
409 type->regions = new_array;
410 type->max <<= 1;
411
Andrew Mortonfd073832012-07-31 16:42:40 -0700412 /* Free old array. We needn't free it if the array is the static one */
Gavin Shan181eb392012-05-29 15:06:50 -0700413 if (*in_slab)
414 kfree(old_array);
415 else if (old_array != memblock_memory_init_regions &&
416 old_array != memblock_reserved_init_regions)
Yinghai Lu29f67382012-07-11 14:02:56 -0700417 memblock_free(__pa(old_array), old_alloc_size);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700418
Andrew Mortonfd073832012-07-31 16:42:40 -0700419 /*
420 * Reserve the new array if that comes from the memblock. Otherwise, we
421 * needn't do it
Gavin Shan181eb392012-05-29 15:06:50 -0700422 */
423 if (!use_slab)
Yinghai Lu29f67382012-07-11 14:02:56 -0700424 BUG_ON(memblock_reserve(addr, new_alloc_size));
Gavin Shan181eb392012-05-29 15:06:50 -0700425
426 /* Update slab flag */
427 *in_slab = use_slab;
428
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700429 return 0;
430}
431
Tejun Heo784656f92011-07-12 11:15:55 +0200432/**
433 * memblock_merge_regions - merge neighboring compatible regions
434 * @type: memblock type to scan
435 *
436 * Scan @type and merge neighboring compatible regions.
437 */
438static void __init_memblock memblock_merge_regions(struct memblock_type *type)
439{
440 int i = 0;
441
442 /* cnt never goes below 1 */
443 while (i < type->cnt - 1) {
444 struct memblock_region *this = &type->regions[i];
445 struct memblock_region *next = &type->regions[i + 1];
446
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200447 if (this->base + this->size != next->base ||
448 memblock_get_region_node(this) !=
Tang Chen66a20752014-01-21 15:49:20 -0800449 memblock_get_region_node(next) ||
450 this->flags != next->flags) {
Tejun Heo784656f92011-07-12 11:15:55 +0200451 BUG_ON(this->base + this->size > next->base);
452 i++;
453 continue;
454 }
455
456 this->size += next->size;
Lin Fengc0232ae2013-01-11 14:31:44 -0800457 /* move forward from next + 1, index of which is i + 2 */
458 memmove(next, next + 1, (type->cnt - (i + 2)) * sizeof(*next));
Tejun Heo784656f92011-07-12 11:15:55 +0200459 type->cnt--;
460 }
461}
462
463/**
464 * memblock_insert_region - insert new memblock region
Tang Chen209ff862013-04-29 15:08:41 -0700465 * @type: memblock type to insert into
466 * @idx: index for the insertion point
467 * @base: base address of the new region
468 * @size: size of the new region
469 * @nid: node id of the new region
Tang Chen66a20752014-01-21 15:49:20 -0800470 * @flags: flags of the new region
Tejun Heo784656f92011-07-12 11:15:55 +0200471 *
472 * Insert new memblock region [@base,@base+@size) into @type at @idx.
Alexander Kuleshov412d0002016-08-04 15:31:46 -0700473 * @type must already have extra room to accommodate the new region.
Tejun Heo784656f92011-07-12 11:15:55 +0200474 */
475static void __init_memblock memblock_insert_region(struct memblock_type *type,
476 int idx, phys_addr_t base,
Tang Chen66a20752014-01-21 15:49:20 -0800477 phys_addr_t size,
478 int nid, unsigned long flags)
Tejun Heo784656f92011-07-12 11:15:55 +0200479{
480 struct memblock_region *rgn = &type->regions[idx];
481
482 BUG_ON(type->cnt >= type->max);
483 memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn));
484 rgn->base = base;
485 rgn->size = size;
Tang Chen66a20752014-01-21 15:49:20 -0800486 rgn->flags = flags;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200487 memblock_set_region_node(rgn, nid);
Tejun Heo784656f92011-07-12 11:15:55 +0200488 type->cnt++;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800489 type->total_size += size;
Tejun Heo784656f92011-07-12 11:15:55 +0200490}
491
492/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100493 * memblock_add_range - add new memblock region
Tejun Heo784656f92011-07-12 11:15:55 +0200494 * @type: memblock type to add new region into
495 * @base: base address of the new region
496 * @size: size of the new region
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800497 * @nid: nid of the new region
Tang Chen66a20752014-01-21 15:49:20 -0800498 * @flags: flags of the new region
Tejun Heo784656f92011-07-12 11:15:55 +0200499 *
500 * Add new memblock region [@base,@base+@size) into @type. The new region
501 * is allowed to overlap with existing ones - overlaps don't affect already
502 * existing regions. @type is guaranteed to be minimal (all neighbouring
503 * compatible regions are merged) after the addition.
504 *
505 * RETURNS:
506 * 0 on success, -errno on failure.
507 */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100508int __init_memblock memblock_add_range(struct memblock_type *type,
Tang Chen66a20752014-01-21 15:49:20 -0800509 phys_addr_t base, phys_addr_t size,
510 int nid, unsigned long flags)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000511{
Tejun Heo784656f92011-07-12 11:15:55 +0200512 bool insert = false;
Tejun Heoeb18f1b2011-12-08 10:22:07 -0800513 phys_addr_t obase = base;
514 phys_addr_t end = base + memblock_cap_size(base, &size);
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800515 int idx, nr_new;
516 struct memblock_region *rgn;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000517
Tejun Heob3dc6272012-04-20 08:31:34 -0700518 if (!size)
519 return 0;
520
Tejun Heo784656f92011-07-12 11:15:55 +0200521 /* special case for empty array */
522 if (type->regions[0].size == 0) {
Tejun Heo1440c4e2011-12-08 10:22:08 -0800523 WARN_ON(type->cnt != 1 || type->total_size);
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000524 type->regions[0].base = base;
525 type->regions[0].size = size;
Tang Chen66a20752014-01-21 15:49:20 -0800526 type->regions[0].flags = flags;
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800527 memblock_set_region_node(&type->regions[0], nid);
Tejun Heo1440c4e2011-12-08 10:22:08 -0800528 type->total_size = size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000529 return 0;
530 }
Tejun Heo784656f92011-07-12 11:15:55 +0200531repeat:
532 /*
533 * The following is executed twice. Once with %false @insert and
534 * then with %true. The first counts the number of regions needed
Alexander Kuleshov412d0002016-08-04 15:31:46 -0700535 * to accommodate the new area. The second actually inserts them.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700536 */
Tejun Heo784656f92011-07-12 11:15:55 +0200537 base = obase;
538 nr_new = 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000539
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800540 for_each_memblock_type(type, rgn) {
Tejun Heo784656f92011-07-12 11:15:55 +0200541 phys_addr_t rbase = rgn->base;
542 phys_addr_t rend = rbase + rgn->size;
543
544 if (rbase >= end)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000545 break;
Tejun Heo784656f92011-07-12 11:15:55 +0200546 if (rend <= base)
547 continue;
548 /*
549 * @rgn overlaps. If it separates the lower part of new
550 * area, insert that portion.
551 */
552 if (rbase > base) {
Wei Yangc0a29492015-09-04 15:47:38 -0700553#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
554 WARN_ON(nid != memblock_get_region_node(rgn));
555#endif
Wei Yang4fcab5f2015-09-08 14:59:53 -0700556 WARN_ON(flags != rgn->flags);
Tejun Heo784656f92011-07-12 11:15:55 +0200557 nr_new++;
558 if (insert)
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800559 memblock_insert_region(type, idx++, base,
Tang Chen66a20752014-01-21 15:49:20 -0800560 rbase - base, nid,
561 flags);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000562 }
Tejun Heo784656f92011-07-12 11:15:55 +0200563 /* area below @rend is dealt with, forget about it */
564 base = min(rend, end);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000565 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000566
Tejun Heo784656f92011-07-12 11:15:55 +0200567 /* insert the remaining portion */
568 if (base < end) {
569 nr_new++;
570 if (insert)
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800571 memblock_insert_region(type, idx, base, end - base,
Tang Chen66a20752014-01-21 15:49:20 -0800572 nid, flags);
Tejun Heo784656f92011-07-12 11:15:55 +0200573 }
574
nimisoloef3cc4d2016-07-26 15:24:56 -0700575 if (!nr_new)
576 return 0;
577
Tejun Heo784656f92011-07-12 11:15:55 +0200578 /*
579 * If this was the first round, resize array and repeat for actual
580 * insertions; otherwise, merge and return.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700581 */
Tejun Heo784656f92011-07-12 11:15:55 +0200582 if (!insert) {
583 while (type->cnt + nr_new > type->max)
Greg Pearson48c3b582012-06-20 12:53:05 -0700584 if (memblock_double_array(type, obase, size) < 0)
Tejun Heo784656f92011-07-12 11:15:55 +0200585 return -ENOMEM;
586 insert = true;
587 goto repeat;
588 } else {
589 memblock_merge_regions(type);
590 return 0;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700591 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000592}
593
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800594int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size,
595 int nid)
596{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100597 return memblock_add_range(&memblock.memory, base, size, nid, 0);
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800598}
599
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700600int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size)
Alexander Kuleshov6a4055b2015-04-15 16:14:44 -0700601{
Miles Chen5d63f812017-02-22 15:46:42 -0800602 phys_addr_t end = base + size - 1;
603
604 memblock_dbg("memblock_add: [%pa-%pa] %pF\n",
605 &base, &end, (void *)_RET_IP_);
Alexander Kuleshov6a4055b2015-04-15 16:14:44 -0700606
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700607 return memblock_add_range(&memblock.memory, base, size, MAX_NUMNODES, 0);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000608}
609
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800610/**
611 * memblock_isolate_range - isolate given range into disjoint memblocks
612 * @type: memblock type to isolate range for
613 * @base: base of range to isolate
614 * @size: size of range to isolate
615 * @start_rgn: out parameter for the start of isolated region
616 * @end_rgn: out parameter for the end of isolated region
617 *
618 * Walk @type and ensure that regions don't cross the boundaries defined by
619 * [@base,@base+@size). Crossing regions are split at the boundaries,
620 * which may create at most two more regions. The index of the first
621 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
622 *
623 * RETURNS:
624 * 0 on success, -errno on failure.
625 */
626static int __init_memblock memblock_isolate_range(struct memblock_type *type,
627 phys_addr_t base, phys_addr_t size,
628 int *start_rgn, int *end_rgn)
629{
Tejun Heoeb18f1b2011-12-08 10:22:07 -0800630 phys_addr_t end = base + memblock_cap_size(base, &size);
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800631 int idx;
632 struct memblock_region *rgn;
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800633
634 *start_rgn = *end_rgn = 0;
635
Tejun Heob3dc6272012-04-20 08:31:34 -0700636 if (!size)
637 return 0;
638
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800639 /* we'll create at most two more regions */
640 while (type->cnt + 2 > type->max)
Greg Pearson48c3b582012-06-20 12:53:05 -0700641 if (memblock_double_array(type, base, size) < 0)
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800642 return -ENOMEM;
643
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800644 for_each_memblock_type(type, rgn) {
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800645 phys_addr_t rbase = rgn->base;
646 phys_addr_t rend = rbase + rgn->size;
647
648 if (rbase >= end)
649 break;
650 if (rend <= base)
651 continue;
652
653 if (rbase < base) {
654 /*
655 * @rgn intersects from below. Split and continue
656 * to process the next region - the new top half.
657 */
658 rgn->base = base;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800659 rgn->size -= base - rbase;
660 type->total_size -= base - rbase;
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800661 memblock_insert_region(type, idx, rbase, base - rbase,
Tang Chen66a20752014-01-21 15:49:20 -0800662 memblock_get_region_node(rgn),
663 rgn->flags);
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800664 } else if (rend > end) {
665 /*
666 * @rgn intersects from above. Split and redo the
667 * current region - the new bottom half.
668 */
669 rgn->base = end;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800670 rgn->size -= end - rbase;
671 type->total_size -= end - rbase;
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800672 memblock_insert_region(type, idx--, rbase, end - rbase,
Tang Chen66a20752014-01-21 15:49:20 -0800673 memblock_get_region_node(rgn),
674 rgn->flags);
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800675 } else {
676 /* @rgn is fully contained, record it */
677 if (!*end_rgn)
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800678 *start_rgn = idx;
679 *end_rgn = idx + 1;
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800680 }
681 }
682
683 return 0;
684}
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800685
Alexander Kuleshov35bd16a2015-11-05 18:47:00 -0800686static int __init_memblock memblock_remove_range(struct memblock_type *type,
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100687 phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000688{
Tejun Heo71936182011-12-08 10:22:07 -0800689 int start_rgn, end_rgn;
690 int i, ret;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000691
Tejun Heo71936182011-12-08 10:22:07 -0800692 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
693 if (ret)
694 return ret;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000695
Tejun Heo71936182011-12-08 10:22:07 -0800696 for (i = end_rgn - 1; i >= start_rgn; i--)
697 memblock_remove_region(type, i);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700698 return 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000699}
700
Tejun Heo581adcb2011-12-08 10:22:06 -0800701int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000702{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100703 return memblock_remove_range(&memblock.memory, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000704}
705
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100706
Tejun Heo581adcb2011-12-08 10:22:06 -0800707int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000708{
Miles Chen5d63f812017-02-22 15:46:42 -0800709 phys_addr_t end = base + size - 1;
710
711 memblock_dbg(" memblock_free: [%pa-%pa] %pF\n",
712 &base, &end, (void *)_RET_IP_);
Tejun Heo24aa0782011-07-12 11:16:06 +0200713
Catalin Marinas9099dae2016-10-11 13:55:11 -0700714 kmemleak_free_part_phys(base, size);
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100715 return memblock_remove_range(&memblock.reserved, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000716}
717
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700718int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000719{
Miles Chen5d63f812017-02-22 15:46:42 -0800720 phys_addr_t end = base + size - 1;
721
722 memblock_dbg("memblock_reserve: [%pa-%pa] %pF\n",
723 &base, &end, (void *)_RET_IP_);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000724
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700725 return memblock_add_range(&memblock.reserved, base, size, MAX_NUMNODES, 0);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000726}
727
Tejun Heo35fd0802011-07-12 11:15:59 +0200728/**
Tang Chen66b16ed2014-01-21 15:49:23 -0800729 *
Tony Luck4308ce12014-12-12 16:54:59 -0800730 * This function isolates region [@base, @base + @size), and sets/clears flag
Tang Chen66b16ed2014-01-21 15:49:23 -0800731 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700732 * Return 0 on success, -errno on failure.
Tang Chen66b16ed2014-01-21 15:49:23 -0800733 */
Tony Luck4308ce12014-12-12 16:54:59 -0800734static int __init_memblock memblock_setclr_flag(phys_addr_t base,
735 phys_addr_t size, int set, int flag)
Tang Chen66b16ed2014-01-21 15:49:23 -0800736{
737 struct memblock_type *type = &memblock.memory;
738 int i, ret, start_rgn, end_rgn;
739
740 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
741 if (ret)
742 return ret;
743
744 for (i = start_rgn; i < end_rgn; i++)
Tony Luck4308ce12014-12-12 16:54:59 -0800745 if (set)
746 memblock_set_region_flags(&type->regions[i], flag);
747 else
748 memblock_clear_region_flags(&type->regions[i], flag);
Tang Chen66b16ed2014-01-21 15:49:23 -0800749
750 memblock_merge_regions(type);
751 return 0;
752}
753
754/**
Tony Luck4308ce12014-12-12 16:54:59 -0800755 * memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG.
756 * @base: the base phys addr of the region
757 * @size: the size of the region
758 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700759 * Return 0 on success, -errno on failure.
Tony Luck4308ce12014-12-12 16:54:59 -0800760 */
761int __init_memblock memblock_mark_hotplug(phys_addr_t base, phys_addr_t size)
762{
763 return memblock_setclr_flag(base, size, 1, MEMBLOCK_HOTPLUG);
764}
765
766/**
Tang Chen66b16ed2014-01-21 15:49:23 -0800767 * memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region.
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.
Tang Chen66b16ed2014-01-21 15:49:23 -0800772 */
773int __init_memblock memblock_clear_hotplug(phys_addr_t base, phys_addr_t size)
774{
Tony Luck4308ce12014-12-12 16:54:59 -0800775 return memblock_setclr_flag(base, size, 0, MEMBLOCK_HOTPLUG);
Tang Chen66b16ed2014-01-21 15:49:23 -0800776}
777
778/**
Tony Lucka3f5baf2015-06-24 16:58:12 -0700779 * memblock_mark_mirror - Mark mirrored memory with flag MEMBLOCK_MIRROR.
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.
Tony Lucka3f5baf2015-06-24 16:58:12 -0700784 */
785int __init_memblock memblock_mark_mirror(phys_addr_t base, phys_addr_t size)
786{
787 system_has_some_mirror = true;
788
789 return memblock_setclr_flag(base, size, 1, MEMBLOCK_MIRROR);
790}
791
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +0100792/**
793 * memblock_mark_nomap - Mark a memory region with flag MEMBLOCK_NOMAP.
794 * @base: the base phys addr of the region
795 * @size: the size of the region
796 *
797 * Return 0 on success, -errno on failure.
798 */
799int __init_memblock memblock_mark_nomap(phys_addr_t base, phys_addr_t size)
800{
801 return memblock_setclr_flag(base, size, 1, MEMBLOCK_NOMAP);
802}
Tony Lucka3f5baf2015-06-24 16:58:12 -0700803
804/**
AKASHI Takahiro4c546b82017-04-03 11:23:54 +0900805 * memblock_clear_nomap - Clear flag MEMBLOCK_NOMAP for a specified region.
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_clear_nomap(phys_addr_t base, phys_addr_t size)
812{
813 return memblock_setclr_flag(base, size, 0, MEMBLOCK_NOMAP);
814}
815
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
Paul Burtonb92df1d2017-02-22 15:44:53 -08001108unsigned long __init_memblock memblock_next_valid_pfn(unsigned long pfn,
1109 unsigned long max_pfn)
1110{
1111 struct memblock_type *type = &memblock.memory;
1112 unsigned int right = type->cnt;
1113 unsigned int mid, left = 0;
1114 phys_addr_t addr = PFN_PHYS(pfn + 1);
1115
1116 do {
1117 mid = (right + left) / 2;
1118
1119 if (addr < type->regions[mid].base)
1120 right = mid;
1121 else if (addr >= (type->regions[mid].base +
1122 type->regions[mid].size))
1123 left = mid + 1;
1124 else {
1125 /* addr is within the region, so pfn + 1 is valid */
1126 return min(pfn + 1, max_pfn);
1127 }
1128 } while (left < right);
1129
AKASHI Takahiroc9a1b802017-03-09 16:17:17 -08001130 if (right == type->cnt)
1131 return max_pfn;
1132 else
1133 return min(PHYS_PFN(type->regions[right].base), max_pfn);
Paul Burtonb92df1d2017-02-22 15:44:53 -08001134}
1135
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001136/**
1137 * memblock_set_node - set node ID on memblock regions
1138 * @base: base of area to set node ID for
1139 * @size: size of area to set node ID for
Tang Chene7e8de52014-01-21 15:49:26 -08001140 * @type: memblock type to set node ID for
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001141 * @nid: node ID to set
1142 *
Tang Chene7e8de52014-01-21 15:49:26 -08001143 * Set the nid of memblock @type regions in [@base,@base+@size) to @nid.
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001144 * Regions which cross the area boundaries are split as necessary.
1145 *
1146 * RETURNS:
1147 * 0 on success, -errno on failure.
1148 */
1149int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size,
Tang Chene7e8de52014-01-21 15:49:26 -08001150 struct memblock_type *type, int nid)
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001151{
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001152 int start_rgn, end_rgn;
1153 int i, ret;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001154
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001155 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
1156 if (ret)
1157 return ret;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001158
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001159 for (i = start_rgn; i < end_rgn; i++)
Wanpeng Lie9d24ad2012-10-08 16:32:21 -07001160 memblock_set_region_node(&type->regions[i], nid);
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001161
1162 memblock_merge_regions(type);
1163 return 0;
1164}
1165#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
1166
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001167static phys_addr_t __init memblock_alloc_range_nid(phys_addr_t size,
1168 phys_addr_t align, phys_addr_t start,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001169 phys_addr_t end, int nid, ulong flags)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001170{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001171 phys_addr_t found;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001172
Grygorii Strashko79f40fa2014-01-21 15:50:12 -08001173 if (!align)
1174 align = SMP_CACHE_BYTES;
Vineet Gupta94f3d3a2013-04-29 15:06:15 -07001175
Tony Luckfc6daaf2015-06-24 16:58:09 -07001176 found = memblock_find_in_range_node(size, align, start, end, nid,
1177 flags);
Catalin Marinasaedf95e2014-06-06 14:38:20 -07001178 if (found && !memblock_reserve(found, size)) {
1179 /*
1180 * The min_count is set to 0 so that memblock allocations are
1181 * never reported as leaks.
1182 */
Catalin Marinas9099dae2016-10-11 13:55:11 -07001183 kmemleak_alloc_phys(found, size, 0, 0);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001184 return found;
Catalin Marinasaedf95e2014-06-06 14:38:20 -07001185 }
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001186 return 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001187}
1188
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001189phys_addr_t __init memblock_alloc_range(phys_addr_t size, phys_addr_t align,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001190 phys_addr_t start, phys_addr_t end,
1191 ulong flags)
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001192{
Tony Luckfc6daaf2015-06-24 16:58:09 -07001193 return memblock_alloc_range_nid(size, align, start, end, NUMA_NO_NODE,
1194 flags);
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001195}
1196
1197static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size,
1198 phys_addr_t align, phys_addr_t max_addr,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001199 int nid, ulong flags)
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001200{
Tony Luckfc6daaf2015-06-24 16:58:09 -07001201 return memblock_alloc_range_nid(size, align, 0, max_addr, nid, flags);
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001202}
1203
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001204phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid)
1205{
Tony Lucka3f5baf2015-06-24 16:58:12 -07001206 ulong flags = choose_memblock_flags();
1207 phys_addr_t ret;
1208
1209again:
1210 ret = memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE,
1211 nid, flags);
1212
1213 if (!ret && (flags & MEMBLOCK_MIRROR)) {
1214 flags &= ~MEMBLOCK_MIRROR;
1215 goto again;
1216 }
1217 return ret;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001218}
1219
1220phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
1221{
Tony Luckfc6daaf2015-06-24 16:58:09 -07001222 return memblock_alloc_base_nid(size, align, max_addr, NUMA_NO_NODE,
1223 MEMBLOCK_NONE);
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001224}
1225
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001226phys_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 +10001227{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001228 phys_addr_t alloc;
1229
1230 alloc = __memblock_alloc_base(size, align, max_addr);
1231
1232 if (alloc == 0)
Miles Chen5d63f812017-02-22 15:46:42 -08001233 panic("ERROR: Failed to allocate %pa bytes below %pa.\n",
1234 &size, &max_addr);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001235
1236 return alloc;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001237}
1238
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001239phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001240{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001241 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001242}
1243
Benjamin Herrenschmidt9d1e2492010-07-06 15:39:17 -07001244phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid)
1245{
1246 phys_addr_t res = memblock_alloc_nid(size, align, nid);
1247
1248 if (res)
1249 return res;
Tejun Heo15fb0972011-07-12 09:58:07 +02001250 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001251}
1252
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001253/**
1254 * memblock_virt_alloc_internal - allocate boot memory block
1255 * @size: size of memory block to be allocated in bytes
1256 * @align: alignment of the region and block's size
1257 * @min_addr: the lower bound of the memory region to allocate (phys address)
1258 * @max_addr: the upper bound of the memory region to allocate (phys address)
1259 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1260 *
1261 * The @min_addr limit is dropped if it can not be satisfied and the allocation
1262 * will fall back to memory below @min_addr. Also, allocation may fall back
1263 * to any node in the system if the specified node can not
1264 * hold the requested memory.
1265 *
1266 * The allocation is performed from memory region limited by
1267 * memblock.current_limit if @max_addr == %BOOTMEM_ALLOC_ACCESSIBLE.
1268 *
1269 * The memory block is aligned on SMP_CACHE_BYTES if @align == 0.
1270 *
1271 * The phys address of allocated boot memory block is converted to virtual and
1272 * allocated memory is reset to 0.
1273 *
1274 * In addition, function sets the min_count to 0 using kmemleak_alloc for
1275 * allocated boot memory block, so that it is never reported as leaks.
1276 *
1277 * RETURNS:
1278 * Virtual address of allocated memory block on success, NULL on failure.
1279 */
1280static void * __init memblock_virt_alloc_internal(
1281 phys_addr_t size, phys_addr_t align,
1282 phys_addr_t min_addr, phys_addr_t max_addr,
1283 int nid)
1284{
1285 phys_addr_t alloc;
1286 void *ptr;
Tony Lucka3f5baf2015-06-24 16:58:12 -07001287 ulong flags = choose_memblock_flags();
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001288
Grygorii Strashko560dca272014-01-21 15:50:55 -08001289 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
1290 nid = NUMA_NO_NODE;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001291
1292 /*
1293 * Detect any accidental use of these APIs after slab is ready, as at
1294 * this moment memblock may be deinitialized already and its
1295 * internal data may be destroyed (after execution of free_all_bootmem)
1296 */
1297 if (WARN_ON_ONCE(slab_is_available()))
1298 return kzalloc_node(size, GFP_NOWAIT, nid);
1299
1300 if (!align)
1301 align = SMP_CACHE_BYTES;
1302
Yinghai Luf544e142014-01-29 14:05:52 -08001303 if (max_addr > memblock.current_limit)
1304 max_addr = memblock.current_limit;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001305again:
1306 alloc = memblock_find_in_range_node(size, align, min_addr, max_addr,
Tony Lucka3f5baf2015-06-24 16:58:12 -07001307 nid, flags);
Wei Yang7d41c032017-02-22 15:45:07 -08001308 if (alloc && !memblock_reserve(alloc, size))
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001309 goto done;
1310
1311 if (nid != NUMA_NO_NODE) {
1312 alloc = memblock_find_in_range_node(size, align, min_addr,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001313 max_addr, NUMA_NO_NODE,
Tony Lucka3f5baf2015-06-24 16:58:12 -07001314 flags);
Wei Yang7d41c032017-02-22 15:45:07 -08001315 if (alloc && !memblock_reserve(alloc, size))
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001316 goto done;
1317 }
1318
1319 if (min_addr) {
1320 min_addr = 0;
1321 goto again;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001322 }
1323
Tony Lucka3f5baf2015-06-24 16:58:12 -07001324 if (flags & MEMBLOCK_MIRROR) {
1325 flags &= ~MEMBLOCK_MIRROR;
1326 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
1327 &size);
1328 goto again;
1329 }
1330
1331 return NULL;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001332done:
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001333 ptr = phys_to_virt(alloc);
1334 memset(ptr, 0, size);
1335
1336 /*
1337 * The min_count is set to 0 so that bootmem allocated blocks
1338 * are never reported as leaks. This is because many of these blocks
1339 * are only referred via the physical address which is not
1340 * looked up by kmemleak.
1341 */
1342 kmemleak_alloc(ptr, size, 0, 0);
1343
1344 return ptr;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001345}
1346
1347/**
1348 * memblock_virt_alloc_try_nid_nopanic - allocate boot memory block
1349 * @size: size of memory block to be allocated in bytes
1350 * @align: alignment of the region and block's size
1351 * @min_addr: the lower bound of the memory region from where the allocation
1352 * is preferred (phys address)
1353 * @max_addr: the upper bound of the memory region from where the allocation
1354 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1355 * allocate only from memory limited by memblock.current_limit value
1356 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1357 *
1358 * Public version of _memblock_virt_alloc_try_nid_nopanic() which provides
1359 * additional debug information (including caller info), if enabled.
1360 *
1361 * RETURNS:
1362 * Virtual address of allocated memory block on success, NULL on failure.
1363 */
1364void * __init memblock_virt_alloc_try_nid_nopanic(
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 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1370 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1371 (u64)max_addr, (void *)_RET_IP_);
1372 return memblock_virt_alloc_internal(size, align, min_addr,
1373 max_addr, nid);
1374}
1375
1376/**
1377 * memblock_virt_alloc_try_nid - allocate boot memory block with panicking
1378 * @size: size of memory block to be allocated in bytes
1379 * @align: alignment of the region and block's size
1380 * @min_addr: the lower bound of the memory region from where the allocation
1381 * is preferred (phys address)
1382 * @max_addr: the upper bound of the memory region from where the allocation
1383 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1384 * allocate only from memory limited by memblock.current_limit value
1385 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1386 *
1387 * Public panicking version of _memblock_virt_alloc_try_nid_nopanic()
1388 * which provides debug information (including caller info), if enabled,
1389 * and panics if the request can not be satisfied.
1390 *
1391 * RETURNS:
1392 * Virtual address of allocated memory block on success, NULL on failure.
1393 */
1394void * __init memblock_virt_alloc_try_nid(
1395 phys_addr_t size, phys_addr_t align,
1396 phys_addr_t min_addr, phys_addr_t max_addr,
1397 int nid)
1398{
1399 void *ptr;
1400
1401 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1402 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1403 (u64)max_addr, (void *)_RET_IP_);
1404 ptr = memblock_virt_alloc_internal(size, align,
1405 min_addr, max_addr, nid);
1406 if (ptr)
1407 return ptr;
1408
1409 panic("%s: Failed to allocate %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx\n",
1410 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1411 (u64)max_addr);
1412 return NULL;
1413}
1414
1415/**
1416 * __memblock_free_early - free boot memory block
1417 * @base: phys starting address of the boot memory block
1418 * @size: size of the boot memory block in bytes
1419 *
1420 * Free boot memory block previously allocated by memblock_virt_alloc_xx() API.
1421 * The freeing memory will not be released to the buddy allocator.
1422 */
1423void __init __memblock_free_early(phys_addr_t base, phys_addr_t size)
1424{
1425 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1426 __func__, (u64)base, (u64)base + size - 1,
1427 (void *)_RET_IP_);
Catalin Marinas9099dae2016-10-11 13:55:11 -07001428 kmemleak_free_part_phys(base, size);
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001429 memblock_remove_range(&memblock.reserved, base, size);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001430}
1431
1432/*
1433 * __memblock_free_late - free bootmem block pages directly to buddy allocator
1434 * @addr: phys starting address of the boot memory block
1435 * @size: size of the boot memory block in bytes
1436 *
1437 * This is only useful when the bootmem allocator has already been torn
1438 * down, but we are still initializing the system. Pages are released directly
1439 * to the buddy allocator, no bootmem metadata is updated because it is gone.
1440 */
1441void __init __memblock_free_late(phys_addr_t base, phys_addr_t size)
1442{
1443 u64 cursor, end;
1444
1445 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1446 __func__, (u64)base, (u64)base + size - 1,
1447 (void *)_RET_IP_);
Catalin Marinas9099dae2016-10-11 13:55:11 -07001448 kmemleak_free_part_phys(base, size);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001449 cursor = PFN_UP(base);
1450 end = PFN_DOWN(base + size);
1451
1452 for (; cursor < end; cursor++) {
Mel Gormand70ddd72015-06-30 14:56:52 -07001453 __free_pages_bootmem(pfn_to_page(cursor), cursor, 0);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001454 totalram_pages++;
1455 }
1456}
Benjamin Herrenschmidt9d1e2492010-07-06 15:39:17 -07001457
1458/*
1459 * Remaining API functions
1460 */
1461
David Gibson1f1ffb8a2016-02-05 15:36:19 -08001462phys_addr_t __init_memblock memblock_phys_mem_size(void)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001463{
Tejun Heo1440c4e2011-12-08 10:22:08 -08001464 return memblock.memory.total_size;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001465}
1466
Srikar Dronamraju8907de52016-10-07 16:59:18 -07001467phys_addr_t __init_memblock memblock_reserved_size(void)
1468{
1469 return memblock.reserved.total_size;
1470}
1471
Yinghai Lu595ad9a2013-01-24 12:20:09 -08001472phys_addr_t __init memblock_mem_size(unsigned long limit_pfn)
1473{
1474 unsigned long pages = 0;
1475 struct memblock_region *r;
1476 unsigned long start_pfn, end_pfn;
1477
1478 for_each_memblock(memory, r) {
1479 start_pfn = memblock_region_memory_base_pfn(r);
1480 end_pfn = memblock_region_memory_end_pfn(r);
1481 start_pfn = min_t(unsigned long, start_pfn, limit_pfn);
1482 end_pfn = min_t(unsigned long, end_pfn, limit_pfn);
1483 pages += end_pfn - start_pfn;
1484 }
1485
Fabian Frederick16763232014-04-07 15:37:53 -07001486 return PFN_PHYS(pages);
Yinghai Lu595ad9a2013-01-24 12:20:09 -08001487}
1488
Sam Ravnborg0a93ebe2011-10-31 17:08:16 -07001489/* lowest address */
1490phys_addr_t __init_memblock memblock_start_of_DRAM(void)
1491{
1492 return memblock.memory.regions[0].base;
1493}
1494
Yinghai Lu10d06432010-07-28 15:43:02 +10001495phys_addr_t __init_memblock memblock_end_of_DRAM(void)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001496{
1497 int idx = memblock.memory.cnt - 1;
1498
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +10001499 return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001500}
1501
Dennis Chena571d4e2016-07-28 15:48:26 -07001502static phys_addr_t __init_memblock __find_max_addr(phys_addr_t limit)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001503{
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001504 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
Emil Medve136199f2014-04-07 15:37:52 -07001505 struct memblock_region *r;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001506
Dennis Chena571d4e2016-07-28 15:48:26 -07001507 /*
1508 * translate the memory @limit size into the max address within one of
1509 * the memory memblock regions, if the @limit exceeds the total size
1510 * of those regions, max_addr will keep original value ULLONG_MAX
1511 */
Emil Medve136199f2014-04-07 15:37:52 -07001512 for_each_memblock(memory, r) {
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001513 if (limit <= r->size) {
1514 max_addr = r->base + limit;
1515 break;
1516 }
1517 limit -= r->size;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001518 }
1519
Dennis Chena571d4e2016-07-28 15:48:26 -07001520 return max_addr;
1521}
1522
1523void __init memblock_enforce_memory_limit(phys_addr_t limit)
1524{
1525 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
1526
1527 if (!limit)
1528 return;
1529
1530 max_addr = __find_max_addr(limit);
1531
1532 /* @limit exceeds the total size of the memory, do nothing */
1533 if (max_addr == (phys_addr_t)ULLONG_MAX)
1534 return;
1535
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001536 /* truncate both memory and reserved regions */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001537 memblock_remove_range(&memblock.memory, max_addr,
1538 (phys_addr_t)ULLONG_MAX);
1539 memblock_remove_range(&memblock.reserved, max_addr,
1540 (phys_addr_t)ULLONG_MAX);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001541}
1542
AKASHI Takahiroc9ca9b42017-04-03 11:23:55 +09001543void __init memblock_cap_memory_range(phys_addr_t base, phys_addr_t size)
1544{
1545 int start_rgn, end_rgn;
1546 int i, ret;
1547
1548 if (!size)
1549 return;
1550
1551 ret = memblock_isolate_range(&memblock.memory, base, size,
1552 &start_rgn, &end_rgn);
1553 if (ret)
1554 return;
1555
1556 /* remove all the MAP regions */
1557 for (i = memblock.memory.cnt - 1; i >= end_rgn; i--)
1558 if (!memblock_is_nomap(&memblock.memory.regions[i]))
1559 memblock_remove_region(&memblock.memory, i);
1560
1561 for (i = start_rgn - 1; i >= 0; i--)
1562 if (!memblock_is_nomap(&memblock.memory.regions[i]))
1563 memblock_remove_region(&memblock.memory, i);
1564
1565 /* truncate the reserved regions */
1566 memblock_remove_range(&memblock.reserved, 0, base);
1567 memblock_remove_range(&memblock.reserved,
1568 base + size, (phys_addr_t)ULLONG_MAX);
1569}
1570
Dennis Chena571d4e2016-07-28 15:48:26 -07001571void __init memblock_mem_limit_remove_map(phys_addr_t limit)
1572{
Dennis Chena571d4e2016-07-28 15:48:26 -07001573 phys_addr_t max_addr;
Dennis Chena571d4e2016-07-28 15:48:26 -07001574
1575 if (!limit)
1576 return;
1577
1578 max_addr = __find_max_addr(limit);
1579
1580 /* @limit exceeds the total size of the memory, do nothing */
1581 if (max_addr == (phys_addr_t)ULLONG_MAX)
1582 return;
1583
AKASHI Takahiroc9ca9b42017-04-03 11:23:55 +09001584 memblock_cap_memory_range(0, max_addr);
Dennis Chena571d4e2016-07-28 15:48:26 -07001585}
1586
Yinghai Lucd794812010-10-11 12:34:09 -07001587static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001588{
1589 unsigned int left = 0, right = type->cnt;
1590
1591 do {
1592 unsigned int mid = (right + left) / 2;
1593
1594 if (addr < type->regions[mid].base)
1595 right = mid;
1596 else if (addr >= (type->regions[mid].base +
1597 type->regions[mid].size))
1598 left = mid + 1;
1599 else
1600 return mid;
1601 } while (left < right);
1602 return -1;
1603}
1604
Yaowei Baib4ad0c72016-01-14 15:18:54 -08001605bool __init memblock_is_reserved(phys_addr_t addr)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001606{
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001607 return memblock_search(&memblock.reserved, addr) != -1;
1608}
Yinghai Lu95f72d12010-07-12 14:36:09 +10001609
Yaowei Baib4ad0c72016-01-14 15:18:54 -08001610bool __init_memblock memblock_is_memory(phys_addr_t addr)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001611{
1612 return memblock_search(&memblock.memory, addr) != -1;
1613}
1614
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +01001615int __init_memblock memblock_is_map_memory(phys_addr_t addr)
1616{
1617 int i = memblock_search(&memblock.memory, addr);
1618
1619 if (i == -1)
1620 return false;
1621 return !memblock_is_nomap(&memblock.memory.regions[i]);
1622}
1623
Yinghai Lue76b63f2013-09-11 14:22:17 -07001624#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1625int __init_memblock memblock_search_pfn_nid(unsigned long pfn,
1626 unsigned long *start_pfn, unsigned long *end_pfn)
1627{
1628 struct memblock_type *type = &memblock.memory;
Fabian Frederick16763232014-04-07 15:37:53 -07001629 int mid = memblock_search(type, PFN_PHYS(pfn));
Yinghai Lue76b63f2013-09-11 14:22:17 -07001630
1631 if (mid == -1)
1632 return -1;
1633
Fabian Frederickf7e2f7e2014-06-04 16:07:51 -07001634 *start_pfn = PFN_DOWN(type->regions[mid].base);
1635 *end_pfn = PFN_DOWN(type->regions[mid].base + type->regions[mid].size);
Yinghai Lue76b63f2013-09-11 14:22:17 -07001636
1637 return type->regions[mid].nid;
1638}
1639#endif
1640
Stephen Boydeab30942012-05-24 00:45:21 -07001641/**
1642 * memblock_is_region_memory - check if a region is a subset of memory
1643 * @base: base of region to check
1644 * @size: size of region to check
1645 *
1646 * Check if the region [@base, @base+@size) is a subset of a memory block.
1647 *
1648 * RETURNS:
1649 * 0 if false, non-zero if true
1650 */
Yinghai Lu3661ca62010-09-15 13:05:29 -07001651int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001652{
Tomi Valkeinenabb65272011-01-20 14:44:20 -08001653 int idx = memblock_search(&memblock.memory, base);
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001654 phys_addr_t end = base + memblock_cap_size(base, &size);
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001655
1656 if (idx == -1)
1657 return 0;
Wei Yangef415ef2017-02-22 15:45:04 -08001658 return (memblock.memory.regions[idx].base +
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001659 memblock.memory.regions[idx].size) >= end;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001660}
1661
Stephen Boydeab30942012-05-24 00:45:21 -07001662/**
1663 * memblock_is_region_reserved - check if a region intersects reserved memory
1664 * @base: base of region to check
1665 * @size: size of region to check
1666 *
1667 * Check if the region [@base, @base+@size) intersects a reserved memory block.
1668 *
1669 * RETURNS:
Tang Chenc5c5c9d2015-09-08 15:02:00 -07001670 * True if they intersect, false if not.
Stephen Boydeab30942012-05-24 00:45:21 -07001671 */
Tang Chenc5c5c9d2015-09-08 15:02:00 -07001672bool __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001673{
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001674 memblock_cap_size(base, &size);
Tang Chenc5c5c9d2015-09-08 15:02:00 -07001675 return memblock_overlaps_region(&memblock.reserved, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001676}
1677
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001678void __init_memblock memblock_trim_memory(phys_addr_t align)
1679{
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001680 phys_addr_t start, end, orig_start, orig_end;
Emil Medve136199f2014-04-07 15:37:52 -07001681 struct memblock_region *r;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001682
Emil Medve136199f2014-04-07 15:37:52 -07001683 for_each_memblock(memory, r) {
1684 orig_start = r->base;
1685 orig_end = r->base + r->size;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001686 start = round_up(orig_start, align);
1687 end = round_down(orig_end, align);
1688
1689 if (start == orig_start && end == orig_end)
1690 continue;
1691
1692 if (start < end) {
Emil Medve136199f2014-04-07 15:37:52 -07001693 r->base = start;
1694 r->size = end - start;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001695 } else {
Emil Medve136199f2014-04-07 15:37:52 -07001696 memblock_remove_region(&memblock.memory,
1697 r - memblock.memory.regions);
1698 r--;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001699 }
1700 }
1701}
Benjamin Herrenschmidte63075a2010-07-06 15:39:01 -07001702
Yinghai Lu3661ca62010-09-15 13:05:29 -07001703void __init_memblock memblock_set_current_limit(phys_addr_t limit)
Benjamin Herrenschmidte63075a2010-07-06 15:39:01 -07001704{
1705 memblock.current_limit = limit;
1706}
1707
Laura Abbottfec51012014-02-27 01:23:43 +01001708phys_addr_t __init_memblock memblock_get_current_limit(void)
1709{
1710 return memblock.current_limit;
1711}
1712
Heiko Carstens0262d9c2017-02-24 14:55:59 -08001713static void __init_memblock memblock_dump(struct memblock_type *type)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001714{
Miles Chen5d63f812017-02-22 15:46:42 -08001715 phys_addr_t base, end, size;
Tang Chen66a20752014-01-21 15:49:20 -08001716 unsigned long flags;
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -08001717 int idx;
1718 struct memblock_region *rgn;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001719
Heiko Carstens0262d9c2017-02-24 14:55:59 -08001720 pr_info(" %s.cnt = 0x%lx\n", type->name, type->cnt);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001721
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -08001722 for_each_memblock_type(type, rgn) {
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001723 char nid_buf[32] = "";
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001724
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001725 base = rgn->base;
1726 size = rgn->size;
Miles Chen5d63f812017-02-22 15:46:42 -08001727 end = base + size - 1;
Tang Chen66a20752014-01-21 15:49:20 -08001728 flags = rgn->flags;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001729#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1730 if (memblock_get_region_node(rgn) != MAX_NUMNODES)
1731 snprintf(nid_buf, sizeof(nid_buf), " on node %d",
1732 memblock_get_region_node(rgn));
1733#endif
Miles Chen5d63f812017-02-22 15:46:42 -08001734 pr_info(" %s[%#x]\t[%pa-%pa], %pa bytes%s flags: %#lx\n",
Heiko Carstens0262d9c2017-02-24 14:55:59 -08001735 type->name, idx, &base, &end, &size, nid_buf, flags);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001736 }
1737}
1738
Michal Hocko864b9a32017-06-02 14:46:49 -07001739extern unsigned long __init_memblock
1740memblock_reserved_memory_within(phys_addr_t start_addr, phys_addr_t end_addr)
1741{
1742 struct memblock_region *rgn;
1743 unsigned long size = 0;
1744 int idx;
1745
1746 for_each_memblock_type((&memblock.reserved), rgn) {
1747 phys_addr_t start, end;
1748
1749 if (rgn->base + rgn->size < start_addr)
1750 continue;
1751 if (rgn->base > end_addr)
1752 continue;
1753
1754 start = rgn->base;
1755 end = start + rgn->size;
1756 size += end - start;
1757 }
1758
1759 return size;
1760}
1761
Tejun Heo4ff7b822011-12-08 10:22:06 -08001762void __init_memblock __memblock_dump_all(void)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001763{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001764 pr_info("MEMBLOCK configuration:\n");
Miles Chen5d63f812017-02-22 15:46:42 -08001765 pr_info(" memory size = %pa reserved size = %pa\n",
1766 &memblock.memory.total_size,
1767 &memblock.reserved.total_size);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001768
Heiko Carstens0262d9c2017-02-24 14:55:59 -08001769 memblock_dump(&memblock.memory);
1770 memblock_dump(&memblock.reserved);
Heiko Carstens409efd42017-02-24 14:55:56 -08001771#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
Heiko Carstens0262d9c2017-02-24 14:55:59 -08001772 memblock_dump(&memblock.physmem);
Heiko Carstens409efd42017-02-24 14:55:56 -08001773#endif
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001774}
1775
Tejun Heo1aadc052011-12-08 10:22:08 -08001776void __init memblock_allow_resize(void)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001777{
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -07001778 memblock_can_resize = 1;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001779}
1780
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001781static int __init early_memblock(char *p)
1782{
1783 if (p && strstr(p, "debug"))
1784 memblock_debug = 1;
1785 return 0;
1786}
1787early_param("memblock", early_memblock);
1788
Tejun Heoc378ddd2011-07-14 11:46:03 +02001789#if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001790
1791static int memblock_debug_show(struct seq_file *m, void *private)
1792{
1793 struct memblock_type *type = m->private;
1794 struct memblock_region *reg;
1795 int i;
Miles Chen5d63f812017-02-22 15:46:42 -08001796 phys_addr_t end;
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001797
1798 for (i = 0; i < type->cnt; i++) {
1799 reg = &type->regions[i];
Miles Chen5d63f812017-02-22 15:46:42 -08001800 end = reg->base + reg->size - 1;
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001801
Miles Chen5d63f812017-02-22 15:46:42 -08001802 seq_printf(m, "%4d: ", i);
1803 seq_printf(m, "%pa..%pa\n", &reg->base, &end);
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001804 }
1805 return 0;
1806}
1807
1808static int memblock_debug_open(struct inode *inode, struct file *file)
1809{
1810 return single_open(file, memblock_debug_show, inode->i_private);
1811}
1812
1813static const struct file_operations memblock_debug_fops = {
1814 .open = memblock_debug_open,
1815 .read = seq_read,
1816 .llseek = seq_lseek,
1817 .release = single_release,
1818};
1819
1820static int __init memblock_init_debugfs(void)
1821{
1822 struct dentry *root = debugfs_create_dir("memblock", NULL);
1823 if (!root)
1824 return -ENXIO;
1825 debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops);
1826 debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops);
Philipp Hachtmann70210ed2014-01-29 18:16:01 +01001827#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
1828 debugfs_create_file("physmem", S_IRUGO, root, &memblock.physmem, &memblock_debug_fops);
1829#endif
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001830
1831 return 0;
1832}
1833__initcall(memblock_init_debugfs);
1834
1835#endif /* CONFIG_DEBUG_FS */