blob: 5108356ad8aaddc9d24d9a0edf716553d75507b5 [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>
Randy Dunlap514c6032018-04-05 16:25:34 -070020#include <linux/kmemleak.h>
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -070021#include <linux/seq_file.h>
Yinghai Lu95f72d12010-07-12 14:36:09 +100022#include <linux/memblock.h>
23
Christoph Hellwigc4c5ad62016-07-28 15:48:06 -070024#include <asm/sections.h>
Santosh Shilimkar26f09e92014-01-21 15:50:19 -080025#include <linux/io.h>
26
27#include "internal.h"
Tang Chen79442ed2013-11-12 15:07:59 -080028
Tejun Heofe091c22011-12-08 10:22:07 -080029static struct memblock_region memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock;
30static struct memblock_region memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock;
Philipp Hachtmann70210ed2014-01-29 18:16:01 +010031#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
32static struct memblock_region memblock_physmem_init_regions[INIT_PHYSMEM_REGIONS] __initdata_memblock;
33#endif
Tejun Heofe091c22011-12-08 10:22:07 -080034
35struct memblock memblock __initdata_memblock = {
36 .memory.regions = memblock_memory_init_regions,
37 .memory.cnt = 1, /* empty dummy entry */
38 .memory.max = INIT_MEMBLOCK_REGIONS,
Heiko Carstens0262d9c2017-02-24 14:55:59 -080039 .memory.name = "memory",
Tejun Heofe091c22011-12-08 10:22:07 -080040
41 .reserved.regions = memblock_reserved_init_regions,
42 .reserved.cnt = 1, /* empty dummy entry */
43 .reserved.max = INIT_MEMBLOCK_REGIONS,
Heiko Carstens0262d9c2017-02-24 14:55:59 -080044 .reserved.name = "reserved",
Tejun Heofe091c22011-12-08 10:22:07 -080045
Philipp Hachtmann70210ed2014-01-29 18:16:01 +010046#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
47 .physmem.regions = memblock_physmem_init_regions,
48 .physmem.cnt = 1, /* empty dummy entry */
49 .physmem.max = INIT_PHYSMEM_REGIONS,
Heiko Carstens0262d9c2017-02-24 14:55:59 -080050 .physmem.name = "physmem",
Philipp Hachtmann70210ed2014-01-29 18:16:01 +010051#endif
52
Tang Chen79442ed2013-11-12 15:07:59 -080053 .bottom_up = false,
Tejun Heofe091c22011-12-08 10:22:07 -080054 .current_limit = MEMBLOCK_ALLOC_ANYWHERE,
55};
Yinghai Lu95f72d12010-07-12 14:36:09 +100056
Yinghai Lu10d06432010-07-28 15:43:02 +100057int memblock_debug __initdata_memblock;
Tony Lucka3f5baf2015-06-24 16:58:12 -070058static bool system_has_some_mirror __initdata_memblock = false;
Tejun Heo1aadc052011-12-08 10:22:08 -080059static int memblock_can_resize __initdata_memblock;
Gavin Shan181eb392012-05-29 15:06:50 -070060static int memblock_memory_in_slab __initdata_memblock = 0;
61static int memblock_reserved_in_slab __initdata_memblock = 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +100062
Tony Lucka3f5baf2015-06-24 16:58:12 -070063ulong __init_memblock choose_memblock_flags(void)
64{
65 return system_has_some_mirror ? MEMBLOCK_MIRROR : MEMBLOCK_NONE;
66}
67
Tejun Heoeb18f1b2011-12-08 10:22:07 -080068/* adjust *@size so that (@base + *@size) doesn't overflow, return new size */
69static inline phys_addr_t memblock_cap_size(phys_addr_t base, phys_addr_t *size)
70{
71 return *size = min(*size, (phys_addr_t)ULLONG_MAX - base);
72}
73
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100074/*
75 * Address comparison utilities
76 */
Yinghai Lu10d06432010-07-28 15:43:02 +100077static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1,
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +100078 phys_addr_t base2, phys_addr_t size2)
Yinghai Lu95f72d12010-07-12 14:36:09 +100079{
80 return ((base1 < (base2 + size2)) && (base2 < (base1 + size1)));
81}
82
Tang Chen95cf82e2015-09-08 15:02:03 -070083bool __init_memblock memblock_overlaps_region(struct memblock_type *type,
H Hartley Sweeten2d7d3eb2011-10-31 17:09:15 -070084 phys_addr_t base, phys_addr_t size)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100085{
86 unsigned long i;
87
Alexander Kuleshovf14516f2016-01-14 15:20:39 -080088 for (i = 0; i < type->cnt; i++)
89 if (memblock_addrs_overlap(base, size, type->regions[i].base,
90 type->regions[i].size))
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100091 break;
Tang Chenc5c5c9d2015-09-08 15:02:00 -070092 return i < type->cnt;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100093}
94
Tang Chen79442ed2013-11-12 15:07:59 -080095/*
96 * __memblock_find_range_bottom_up - find free area utility in bottom-up
97 * @start: start of candidate range
98 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
99 * @size: size of free area to find
100 * @align: alignment of free area to find
Grygorii Strashkob1154232014-01-21 15:50:16 -0800101 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Tony Luckfc6daaf2015-06-24 16:58:09 -0700102 * @flags: pick from blocks based on memory attributes
Tang Chen79442ed2013-11-12 15:07:59 -0800103 *
104 * Utility called from memblock_find_in_range_node(), find free area bottom-up.
105 *
106 * RETURNS:
107 * Found address on success, 0 on failure.
108 */
109static phys_addr_t __init_memblock
110__memblock_find_range_bottom_up(phys_addr_t start, phys_addr_t end,
Tony Luckfc6daaf2015-06-24 16:58:09 -0700111 phys_addr_t size, phys_addr_t align, int nid,
112 ulong flags)
Tang Chen79442ed2013-11-12 15:07:59 -0800113{
114 phys_addr_t this_start, this_end, cand;
115 u64 i;
116
Tony Luckfc6daaf2015-06-24 16:58:09 -0700117 for_each_free_mem_range(i, nid, flags, &this_start, &this_end, NULL) {
Tang Chen79442ed2013-11-12 15:07:59 -0800118 this_start = clamp(this_start, start, end);
119 this_end = clamp(this_end, start, end);
120
121 cand = round_up(this_start, align);
122 if (cand < this_end && this_end - cand >= size)
123 return cand;
124 }
125
126 return 0;
127}
128
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800129/**
Tang Chen14028992013-11-12 15:07:57 -0800130 * __memblock_find_range_top_down - find free area utility, in top-down
131 * @start: start of candidate range
132 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
133 * @size: size of free area to find
134 * @align: alignment of free area to find
Grygorii Strashkob1154232014-01-21 15:50:16 -0800135 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Tony Luckfc6daaf2015-06-24 16:58:09 -0700136 * @flags: pick from blocks based on memory attributes
Tang Chen14028992013-11-12 15:07:57 -0800137 *
138 * Utility called from memblock_find_in_range_node(), find free area top-down.
139 *
140 * RETURNS:
Tang Chen79442ed2013-11-12 15:07:59 -0800141 * Found address on success, 0 on failure.
Tang Chen14028992013-11-12 15:07:57 -0800142 */
143static phys_addr_t __init_memblock
144__memblock_find_range_top_down(phys_addr_t start, phys_addr_t end,
Tony Luckfc6daaf2015-06-24 16:58:09 -0700145 phys_addr_t size, phys_addr_t align, int nid,
146 ulong flags)
Tang Chen14028992013-11-12 15:07:57 -0800147{
148 phys_addr_t this_start, this_end, cand;
149 u64 i;
150
Tony Luckfc6daaf2015-06-24 16:58:09 -0700151 for_each_free_mem_range_reverse(i, nid, flags, &this_start, &this_end,
152 NULL) {
Tang Chen14028992013-11-12 15:07:57 -0800153 this_start = clamp(this_start, start, end);
154 this_end = clamp(this_end, start, end);
155
156 if (this_end < size)
157 continue;
158
159 cand = round_down(this_end - size, align);
160 if (cand >= this_start)
161 return cand;
162 }
163
164 return 0;
165}
166
167/**
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800168 * memblock_find_in_range_node - find free area in given range and node
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800169 * @size: size of free area to find
170 * @align: alignment of free area to find
Grygorii Strashko87029ee2014-01-21 15:50:14 -0800171 * @start: start of candidate range
172 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
Grygorii Strashkob1154232014-01-21 15:50:16 -0800173 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Tony Luckfc6daaf2015-06-24 16:58:09 -0700174 * @flags: pick from blocks based on memory attributes
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800175 *
176 * Find @size free area aligned to @align in the specified range and node.
177 *
Tang Chen79442ed2013-11-12 15:07:59 -0800178 * When allocation direction is bottom-up, the @start should be greater
179 * than the end of the kernel image. Otherwise, it will be trimmed. The
180 * reason is that we want the bottom-up allocation just near the kernel
181 * image so it is highly likely that the allocated memory and the kernel
182 * will reside in the same node.
183 *
184 * If bottom-up allocation failed, will try to allocate memory top-down.
185 *
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800186 * RETURNS:
Tang Chen79442ed2013-11-12 15:07:59 -0800187 * Found address on success, 0 on failure.
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000188 */
Grygorii Strashko87029ee2014-01-21 15:50:14 -0800189phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t size,
190 phys_addr_t align, phys_addr_t start,
Tony Luckfc6daaf2015-06-24 16:58:09 -0700191 phys_addr_t end, int nid, ulong flags)
Tang Chenf7210e62013-02-22 16:33:51 -0800192{
Tang Chen0cfb8f02014-08-29 15:18:31 -0700193 phys_addr_t kernel_end, ret;
Tang Chen79442ed2013-11-12 15:07:59 -0800194
Tang Chenf7210e62013-02-22 16:33:51 -0800195 /* pump up @end */
196 if (end == MEMBLOCK_ALLOC_ACCESSIBLE)
197 end = memblock.current_limit;
198
199 /* avoid allocating the first page */
200 start = max_t(phys_addr_t, start, PAGE_SIZE);
201 end = max(start, end);
Tang Chen79442ed2013-11-12 15:07:59 -0800202 kernel_end = __pa_symbol(_end);
203
204 /*
205 * try bottom-up allocation only when bottom-up mode
206 * is set and @end is above the kernel image.
207 */
208 if (memblock_bottom_up() && end > kernel_end) {
209 phys_addr_t bottom_up_start;
210
211 /* make sure we will allocate above the kernel */
212 bottom_up_start = max(start, kernel_end);
213
214 /* ok, try bottom-up allocation first */
215 ret = __memblock_find_range_bottom_up(bottom_up_start, end,
Tony Luckfc6daaf2015-06-24 16:58:09 -0700216 size, align, nid, flags);
Tang Chen79442ed2013-11-12 15:07:59 -0800217 if (ret)
218 return ret;
219
220 /*
221 * we always limit bottom-up allocation above the kernel,
222 * but top-down allocation doesn't have the limit, so
223 * retrying top-down allocation may succeed when bottom-up
224 * allocation failed.
225 *
226 * bottom-up allocation is expected to be fail very rarely,
227 * so we use WARN_ONCE() here to see the stack trace if
228 * fail happens.
229 */
Joe Perches756a0252016-03-17 14:19:47 -0700230 WARN_ONCE(1, "memblock: bottom-up allocation failed, memory hotunplug may be affected\n");
Tang Chen79442ed2013-11-12 15:07:59 -0800231 }
Tang Chenf7210e62013-02-22 16:33:51 -0800232
Tony Luckfc6daaf2015-06-24 16:58:09 -0700233 return __memblock_find_range_top_down(start, end, size, align, nid,
234 flags);
Tang Chenf7210e62013-02-22 16:33:51 -0800235}
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000236
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800237/**
238 * memblock_find_in_range - find free area in given range
239 * @start: start of candidate range
240 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
241 * @size: size of free area to find
242 * @align: alignment of free area to find
243 *
244 * Find @size free area aligned to @align in the specified range.
245 *
246 * RETURNS:
Tang Chen79442ed2013-11-12 15:07:59 -0800247 * Found address on success, 0 on failure.
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800248 */
249phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start,
250 phys_addr_t end, phys_addr_t size,
251 phys_addr_t align)
252{
Tony Lucka3f5baf2015-06-24 16:58:12 -0700253 phys_addr_t ret;
254 ulong flags = choose_memblock_flags();
255
256again:
257 ret = memblock_find_in_range_node(size, align, start, end,
258 NUMA_NO_NODE, flags);
259
260 if (!ret && (flags & MEMBLOCK_MIRROR)) {
261 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
262 &size);
263 flags &= ~MEMBLOCK_MIRROR;
264 goto again;
265 }
266
267 return ret;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800268}
269
Yinghai Lu10d06432010-07-28 15:43:02 +1000270static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000271{
Tejun Heo1440c4e2011-12-08 10:22:08 -0800272 type->total_size -= type->regions[r].size;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200273 memmove(&type->regions[r], &type->regions[r + 1],
274 (type->cnt - (r + 1)) * sizeof(type->regions[r]));
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000275 type->cnt--;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000276
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700277 /* Special case for empty arrays */
278 if (type->cnt == 0) {
Tejun Heo1440c4e2011-12-08 10:22:08 -0800279 WARN_ON(type->total_size != 0);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700280 type->cnt = 1;
281 type->regions[0].base = 0;
282 type->regions[0].size = 0;
Tang Chen66a20752014-01-21 15:49:20 -0800283 type->regions[0].flags = 0;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200284 memblock_set_region_node(&type->regions[0], MAX_NUMNODES);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700285 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000286}
287
Philipp Hachtmann354f17e2014-01-23 15:53:24 -0800288#ifdef CONFIG_ARCH_DISCARD_MEMBLOCK
Pavel Tatashin3010f872017-08-18 15:16:05 -0700289/**
290 * Discard memory and reserved arrays if they were allocated
291 */
292void __init memblock_discard(void)
Yinghai Lu29f67382012-07-11 14:02:56 -0700293{
Pavel Tatashin3010f872017-08-18 15:16:05 -0700294 phys_addr_t addr, size;
Yinghai Lu29f67382012-07-11 14:02:56 -0700295
Pavel Tatashin3010f872017-08-18 15:16:05 -0700296 if (memblock.reserved.regions != memblock_reserved_init_regions) {
297 addr = __pa(memblock.reserved.regions);
298 size = PAGE_ALIGN(sizeof(struct memblock_region) *
299 memblock.reserved.max);
300 __memblock_free_late(addr, size);
301 }
Yinghai Lu29f67382012-07-11 14:02:56 -0700302
Pavel Tatashin91b540f2017-08-25 15:55:46 -0700303 if (memblock.memory.regions != memblock_memory_init_regions) {
Pavel Tatashin3010f872017-08-18 15:16:05 -0700304 addr = __pa(memblock.memory.regions);
305 size = PAGE_ALIGN(sizeof(struct memblock_region) *
306 memblock.memory.max);
307 __memblock_free_late(addr, size);
308 }
Yinghai Lu29f67382012-07-11 14:02:56 -0700309}
Philipp Hachtmann5e270e22014-01-23 15:53:11 -0800310#endif
311
Greg Pearson48c3b582012-06-20 12:53:05 -0700312/**
313 * memblock_double_array - double the size of the memblock regions array
314 * @type: memblock type of the regions array being doubled
315 * @new_area_start: starting address of memory range to avoid overlap with
316 * @new_area_size: size of memory range to avoid overlap with
317 *
318 * Double the size of the @type regions array. If memblock is being used to
319 * allocate memory for a new reserved regions array and there is a previously
320 * allocated memory range [@new_area_start,@new_area_start+@new_area_size]
321 * waiting to be reserved, ensure the memory used by the new array does
322 * not overlap.
323 *
324 * RETURNS:
325 * 0 on success, -1 on failure.
326 */
327static int __init_memblock memblock_double_array(struct memblock_type *type,
328 phys_addr_t new_area_start,
329 phys_addr_t new_area_size)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700330{
331 struct memblock_region *new_array, *old_array;
Yinghai Lu29f67382012-07-11 14:02:56 -0700332 phys_addr_t old_alloc_size, new_alloc_size;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700333 phys_addr_t old_size, new_size, addr;
334 int use_slab = slab_is_available();
Gavin Shan181eb392012-05-29 15:06:50 -0700335 int *in_slab;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700336
337 /* We don't allow resizing until we know about the reserved regions
338 * of memory that aren't suitable for allocation
339 */
340 if (!memblock_can_resize)
341 return -1;
342
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700343 /* Calculate new doubled size */
344 old_size = type->max * sizeof(struct memblock_region);
345 new_size = old_size << 1;
Yinghai Lu29f67382012-07-11 14:02:56 -0700346 /*
347 * We need to allocated new one align to PAGE_SIZE,
348 * so we can free them completely later.
349 */
350 old_alloc_size = PAGE_ALIGN(old_size);
351 new_alloc_size = PAGE_ALIGN(new_size);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700352
Gavin Shan181eb392012-05-29 15:06:50 -0700353 /* Retrieve the slab flag */
354 if (type == &memblock.memory)
355 in_slab = &memblock_memory_in_slab;
356 else
357 in_slab = &memblock_reserved_in_slab;
358
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700359 /* Try to find some space for it.
360 *
361 * WARNING: We assume that either slab_is_available() and we use it or
Andrew Mortonfd073832012-07-31 16:42:40 -0700362 * we use MEMBLOCK for allocations. That means that this is unsafe to
363 * use when bootmem is currently active (unless bootmem itself is
364 * implemented on top of MEMBLOCK which isn't the case yet)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700365 *
366 * This should however not be an issue for now, as we currently only
Andrew Mortonfd073832012-07-31 16:42:40 -0700367 * call into MEMBLOCK while it's still active, or much later when slab
368 * is active for memory hotplug operations
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700369 */
370 if (use_slab) {
371 new_array = kmalloc(new_size, GFP_KERNEL);
Tejun Heo1f5026a2011-07-12 09:58:09 +0200372 addr = new_array ? __pa(new_array) : 0;
Gavin Shan4e2f0772012-05-29 15:06:50 -0700373 } else {
Greg Pearson48c3b582012-06-20 12:53:05 -0700374 /* only exclude range when trying to double reserved.regions */
375 if (type != &memblock.reserved)
376 new_area_start = new_area_size = 0;
377
378 addr = memblock_find_in_range(new_area_start + new_area_size,
379 memblock.current_limit,
Yinghai Lu29f67382012-07-11 14:02:56 -0700380 new_alloc_size, PAGE_SIZE);
Greg Pearson48c3b582012-06-20 12:53:05 -0700381 if (!addr && new_area_size)
382 addr = memblock_find_in_range(0,
Andrew Mortonfd073832012-07-31 16:42:40 -0700383 min(new_area_start, memblock.current_limit),
384 new_alloc_size, PAGE_SIZE);
Greg Pearson48c3b582012-06-20 12:53:05 -0700385
Sachin Kamat15674862012-09-04 13:55:05 +0530386 new_array = addr ? __va(addr) : NULL;
Gavin Shan4e2f0772012-05-29 15:06:50 -0700387 }
Tejun Heo1f5026a2011-07-12 09:58:09 +0200388 if (!addr) {
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700389 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
Heiko Carstens0262d9c2017-02-24 14:55:59 -0800390 type->name, type->max, type->max * 2);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700391 return -1;
392 }
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700393
Andrew Mortonfd073832012-07-31 16:42:40 -0700394 memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]",
Heiko Carstens0262d9c2017-02-24 14:55:59 -0800395 type->name, type->max * 2, (u64)addr,
Andrew Mortonfd073832012-07-31 16:42:40 -0700396 (u64)addr + new_size - 1);
Yinghai Luea9e4372010-07-28 15:13:22 +1000397
Andrew Mortonfd073832012-07-31 16:42:40 -0700398 /*
399 * Found space, we now need to move the array over before we add the
400 * reserved region since it may be our reserved array itself that is
401 * full.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700402 */
403 memcpy(new_array, type->regions, old_size);
404 memset(new_array + type->max, 0, old_size);
405 old_array = type->regions;
406 type->regions = new_array;
407 type->max <<= 1;
408
Andrew Mortonfd073832012-07-31 16:42:40 -0700409 /* Free old array. We needn't free it if the array is the static one */
Gavin Shan181eb392012-05-29 15:06:50 -0700410 if (*in_slab)
411 kfree(old_array);
412 else if (old_array != memblock_memory_init_regions &&
413 old_array != memblock_reserved_init_regions)
Yinghai Lu29f67382012-07-11 14:02:56 -0700414 memblock_free(__pa(old_array), old_alloc_size);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700415
Andrew Mortonfd073832012-07-31 16:42:40 -0700416 /*
417 * Reserve the new array if that comes from the memblock. Otherwise, we
418 * needn't do it
Gavin Shan181eb392012-05-29 15:06:50 -0700419 */
420 if (!use_slab)
Yinghai Lu29f67382012-07-11 14:02:56 -0700421 BUG_ON(memblock_reserve(addr, new_alloc_size));
Gavin Shan181eb392012-05-29 15:06:50 -0700422
423 /* Update slab flag */
424 *in_slab = use_slab;
425
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700426 return 0;
427}
428
Tejun Heo784656f92011-07-12 11:15:55 +0200429/**
430 * memblock_merge_regions - merge neighboring compatible regions
431 * @type: memblock type to scan
432 *
433 * Scan @type and merge neighboring compatible regions.
434 */
435static void __init_memblock memblock_merge_regions(struct memblock_type *type)
436{
437 int i = 0;
438
439 /* cnt never goes below 1 */
440 while (i < type->cnt - 1) {
441 struct memblock_region *this = &type->regions[i];
442 struct memblock_region *next = &type->regions[i + 1];
443
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200444 if (this->base + this->size != next->base ||
445 memblock_get_region_node(this) !=
Tang Chen66a20752014-01-21 15:49:20 -0800446 memblock_get_region_node(next) ||
447 this->flags != next->flags) {
Tejun Heo784656f92011-07-12 11:15:55 +0200448 BUG_ON(this->base + this->size > next->base);
449 i++;
450 continue;
451 }
452
453 this->size += next->size;
Lin Fengc0232ae2013-01-11 14:31:44 -0800454 /* move forward from next + 1, index of which is i + 2 */
455 memmove(next, next + 1, (type->cnt - (i + 2)) * sizeof(*next));
Tejun Heo784656f92011-07-12 11:15:55 +0200456 type->cnt--;
457 }
458}
459
460/**
461 * memblock_insert_region - insert new memblock region
Tang Chen209ff862013-04-29 15:08:41 -0700462 * @type: memblock type to insert into
463 * @idx: index for the insertion point
464 * @base: base address of the new region
465 * @size: size of the new region
466 * @nid: node id of the new region
Tang Chen66a20752014-01-21 15:49:20 -0800467 * @flags: flags of the new region
Tejun Heo784656f92011-07-12 11:15:55 +0200468 *
469 * Insert new memblock region [@base,@base+@size) into @type at @idx.
Alexander Kuleshov412d0002016-08-04 15:31:46 -0700470 * @type must already have extra room to accommodate the new region.
Tejun Heo784656f92011-07-12 11:15:55 +0200471 */
472static void __init_memblock memblock_insert_region(struct memblock_type *type,
473 int idx, phys_addr_t base,
Tang Chen66a20752014-01-21 15:49:20 -0800474 phys_addr_t size,
475 int nid, unsigned long flags)
Tejun Heo784656f92011-07-12 11:15:55 +0200476{
477 struct memblock_region *rgn = &type->regions[idx];
478
479 BUG_ON(type->cnt >= type->max);
480 memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn));
481 rgn->base = base;
482 rgn->size = size;
Tang Chen66a20752014-01-21 15:49:20 -0800483 rgn->flags = flags;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200484 memblock_set_region_node(rgn, nid);
Tejun Heo784656f92011-07-12 11:15:55 +0200485 type->cnt++;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800486 type->total_size += size;
Tejun Heo784656f92011-07-12 11:15:55 +0200487}
488
489/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100490 * memblock_add_range - add new memblock region
Tejun Heo784656f92011-07-12 11:15:55 +0200491 * @type: memblock type to add new region into
492 * @base: base address of the new region
493 * @size: size of the new region
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800494 * @nid: nid of the new region
Tang Chen66a20752014-01-21 15:49:20 -0800495 * @flags: flags of the new region
Tejun Heo784656f92011-07-12 11:15:55 +0200496 *
497 * Add new memblock region [@base,@base+@size) into @type. The new region
498 * is allowed to overlap with existing ones - overlaps don't affect already
499 * existing regions. @type is guaranteed to be minimal (all neighbouring
500 * compatible regions are merged) after the addition.
501 *
502 * RETURNS:
503 * 0 on success, -errno on failure.
504 */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100505int __init_memblock memblock_add_range(struct memblock_type *type,
Tang Chen66a20752014-01-21 15:49:20 -0800506 phys_addr_t base, phys_addr_t size,
507 int nid, unsigned long flags)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000508{
Tejun Heo784656f92011-07-12 11:15:55 +0200509 bool insert = false;
Tejun Heoeb18f1b2011-12-08 10:22:07 -0800510 phys_addr_t obase = base;
511 phys_addr_t end = base + memblock_cap_size(base, &size);
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800512 int idx, nr_new;
513 struct memblock_region *rgn;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000514
Tejun Heob3dc6272012-04-20 08:31:34 -0700515 if (!size)
516 return 0;
517
Tejun Heo784656f92011-07-12 11:15:55 +0200518 /* special case for empty array */
519 if (type->regions[0].size == 0) {
Tejun Heo1440c4e2011-12-08 10:22:08 -0800520 WARN_ON(type->cnt != 1 || type->total_size);
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000521 type->regions[0].base = base;
522 type->regions[0].size = size;
Tang Chen66a20752014-01-21 15:49:20 -0800523 type->regions[0].flags = flags;
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800524 memblock_set_region_node(&type->regions[0], nid);
Tejun Heo1440c4e2011-12-08 10:22:08 -0800525 type->total_size = size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000526 return 0;
527 }
Tejun Heo784656f92011-07-12 11:15:55 +0200528repeat:
529 /*
530 * The following is executed twice. Once with %false @insert and
531 * then with %true. The first counts the number of regions needed
Alexander Kuleshov412d0002016-08-04 15:31:46 -0700532 * to accommodate the new area. The second actually inserts them.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700533 */
Tejun Heo784656f92011-07-12 11:15:55 +0200534 base = obase;
535 nr_new = 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000536
Gioh Kim66e8b432017-11-15 17:33:42 -0800537 for_each_memblock_type(idx, type, rgn) {
Tejun Heo784656f92011-07-12 11:15:55 +0200538 phys_addr_t rbase = rgn->base;
539 phys_addr_t rend = rbase + rgn->size;
540
541 if (rbase >= end)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000542 break;
Tejun Heo784656f92011-07-12 11:15:55 +0200543 if (rend <= base)
544 continue;
545 /*
546 * @rgn overlaps. If it separates the lower part of new
547 * area, insert that portion.
548 */
549 if (rbase > base) {
Wei Yangc0a29492015-09-04 15:47:38 -0700550#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
551 WARN_ON(nid != memblock_get_region_node(rgn));
552#endif
Wei Yang4fcab5f2015-09-08 14:59:53 -0700553 WARN_ON(flags != rgn->flags);
Tejun Heo784656f92011-07-12 11:15:55 +0200554 nr_new++;
555 if (insert)
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800556 memblock_insert_region(type, idx++, base,
Tang Chen66a20752014-01-21 15:49:20 -0800557 rbase - base, nid,
558 flags);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000559 }
Tejun Heo784656f92011-07-12 11:15:55 +0200560 /* area below @rend is dealt with, forget about it */
561 base = min(rend, end);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000562 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000563
Tejun Heo784656f92011-07-12 11:15:55 +0200564 /* insert the remaining portion */
565 if (base < end) {
566 nr_new++;
567 if (insert)
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800568 memblock_insert_region(type, idx, base, end - base,
Tang Chen66a20752014-01-21 15:49:20 -0800569 nid, flags);
Tejun Heo784656f92011-07-12 11:15:55 +0200570 }
571
nimisoloef3cc4d2016-07-26 15:24:56 -0700572 if (!nr_new)
573 return 0;
574
Tejun Heo784656f92011-07-12 11:15:55 +0200575 /*
576 * If this was the first round, resize array and repeat for actual
577 * insertions; otherwise, merge and return.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700578 */
Tejun Heo784656f92011-07-12 11:15:55 +0200579 if (!insert) {
580 while (type->cnt + nr_new > type->max)
Greg Pearson48c3b582012-06-20 12:53:05 -0700581 if (memblock_double_array(type, obase, size) < 0)
Tejun Heo784656f92011-07-12 11:15:55 +0200582 return -ENOMEM;
583 insert = true;
584 goto repeat;
585 } else {
586 memblock_merge_regions(type);
587 return 0;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700588 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000589}
590
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800591int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size,
592 int nid)
593{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100594 return memblock_add_range(&memblock.memory, base, size, nid, 0);
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800595}
596
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700597int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size)
Alexander Kuleshov6a4055b2015-04-15 16:14:44 -0700598{
Miles Chen5d63f812017-02-22 15:46:42 -0800599 phys_addr_t end = base + size - 1;
600
601 memblock_dbg("memblock_add: [%pa-%pa] %pF\n",
602 &base, &end, (void *)_RET_IP_);
Alexander Kuleshov6a4055b2015-04-15 16:14:44 -0700603
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700604 return memblock_add_range(&memblock.memory, base, size, MAX_NUMNODES, 0);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000605}
606
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800607/**
608 * memblock_isolate_range - isolate given range into disjoint memblocks
609 * @type: memblock type to isolate range for
610 * @base: base of range to isolate
611 * @size: size of range to isolate
612 * @start_rgn: out parameter for the start of isolated region
613 * @end_rgn: out parameter for the end of isolated region
614 *
615 * Walk @type and ensure that regions don't cross the boundaries defined by
616 * [@base,@base+@size). Crossing regions are split at the boundaries,
617 * which may create at most two more regions. The index of the first
618 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
619 *
620 * RETURNS:
621 * 0 on success, -errno on failure.
622 */
623static int __init_memblock memblock_isolate_range(struct memblock_type *type,
624 phys_addr_t base, phys_addr_t size,
625 int *start_rgn, int *end_rgn)
626{
Tejun Heoeb18f1b2011-12-08 10:22:07 -0800627 phys_addr_t end = base + memblock_cap_size(base, &size);
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800628 int idx;
629 struct memblock_region *rgn;
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800630
631 *start_rgn = *end_rgn = 0;
632
Tejun Heob3dc6272012-04-20 08:31:34 -0700633 if (!size)
634 return 0;
635
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800636 /* we'll create at most two more regions */
637 while (type->cnt + 2 > type->max)
Greg Pearson48c3b582012-06-20 12:53:05 -0700638 if (memblock_double_array(type, base, size) < 0)
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800639 return -ENOMEM;
640
Gioh Kim66e8b432017-11-15 17:33:42 -0800641 for_each_memblock_type(idx, type, rgn) {
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800642 phys_addr_t rbase = rgn->base;
643 phys_addr_t rend = rbase + rgn->size;
644
645 if (rbase >= end)
646 break;
647 if (rend <= base)
648 continue;
649
650 if (rbase < base) {
651 /*
652 * @rgn intersects from below. Split and continue
653 * to process the next region - the new top half.
654 */
655 rgn->base = base;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800656 rgn->size -= base - rbase;
657 type->total_size -= base - rbase;
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800658 memblock_insert_region(type, idx, rbase, base - rbase,
Tang Chen66a20752014-01-21 15:49:20 -0800659 memblock_get_region_node(rgn),
660 rgn->flags);
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800661 } else if (rend > end) {
662 /*
663 * @rgn intersects from above. Split and redo the
664 * current region - the new bottom half.
665 */
666 rgn->base = end;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800667 rgn->size -= end - rbase;
668 type->total_size -= end - rbase;
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800669 memblock_insert_region(type, idx--, rbase, end - rbase,
Tang Chen66a20752014-01-21 15:49:20 -0800670 memblock_get_region_node(rgn),
671 rgn->flags);
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800672 } else {
673 /* @rgn is fully contained, record it */
674 if (!*end_rgn)
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800675 *start_rgn = idx;
676 *end_rgn = idx + 1;
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800677 }
678 }
679
680 return 0;
681}
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800682
Alexander Kuleshov35bd16a2015-11-05 18:47:00 -0800683static int __init_memblock memblock_remove_range(struct memblock_type *type,
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100684 phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000685{
Tejun Heo71936182011-12-08 10:22:07 -0800686 int start_rgn, end_rgn;
687 int i, ret;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000688
Tejun Heo71936182011-12-08 10:22:07 -0800689 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
690 if (ret)
691 return ret;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000692
Tejun Heo71936182011-12-08 10:22:07 -0800693 for (i = end_rgn - 1; i >= start_rgn; i--)
694 memblock_remove_region(type, i);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700695 return 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000696}
697
Tejun Heo581adcb2011-12-08 10:22:06 -0800698int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000699{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100700 return memblock_remove_range(&memblock.memory, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000701}
702
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100703
Tejun Heo581adcb2011-12-08 10:22:06 -0800704int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000705{
Miles Chen5d63f812017-02-22 15:46:42 -0800706 phys_addr_t end = base + size - 1;
707
708 memblock_dbg(" memblock_free: [%pa-%pa] %pF\n",
709 &base, &end, (void *)_RET_IP_);
Tejun Heo24aa0782011-07-12 11:16:06 +0200710
Catalin Marinas9099dae2016-10-11 13:55:11 -0700711 kmemleak_free_part_phys(base, size);
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100712 return memblock_remove_range(&memblock.reserved, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000713}
714
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700715int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000716{
Miles Chen5d63f812017-02-22 15:46:42 -0800717 phys_addr_t end = base + size - 1;
718
719 memblock_dbg("memblock_reserve: [%pa-%pa] %pF\n",
720 &base, &end, (void *)_RET_IP_);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000721
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700722 return memblock_add_range(&memblock.reserved, base, size, MAX_NUMNODES, 0);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000723}
724
Tejun Heo35fd0802011-07-12 11:15:59 +0200725/**
Tang Chen66b16ed2014-01-21 15:49:23 -0800726 *
Tony Luck4308ce12014-12-12 16:54:59 -0800727 * This function isolates region [@base, @base + @size), and sets/clears flag
Tang Chen66b16ed2014-01-21 15:49:23 -0800728 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700729 * Return 0 on success, -errno on failure.
Tang Chen66b16ed2014-01-21 15:49:23 -0800730 */
Tony Luck4308ce12014-12-12 16:54:59 -0800731static int __init_memblock memblock_setclr_flag(phys_addr_t base,
732 phys_addr_t size, int set, int flag)
Tang Chen66b16ed2014-01-21 15:49:23 -0800733{
734 struct memblock_type *type = &memblock.memory;
735 int i, ret, start_rgn, end_rgn;
736
737 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
738 if (ret)
739 return ret;
740
741 for (i = start_rgn; i < end_rgn; i++)
Tony Luck4308ce12014-12-12 16:54:59 -0800742 if (set)
743 memblock_set_region_flags(&type->regions[i], flag);
744 else
745 memblock_clear_region_flags(&type->regions[i], flag);
Tang Chen66b16ed2014-01-21 15:49:23 -0800746
747 memblock_merge_regions(type);
748 return 0;
749}
750
751/**
Tony Luck4308ce12014-12-12 16:54:59 -0800752 * memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG.
753 * @base: the base phys addr of the region
754 * @size: the size of the region
755 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700756 * Return 0 on success, -errno on failure.
Tony Luck4308ce12014-12-12 16:54:59 -0800757 */
758int __init_memblock memblock_mark_hotplug(phys_addr_t base, phys_addr_t size)
759{
760 return memblock_setclr_flag(base, size, 1, MEMBLOCK_HOTPLUG);
761}
762
763/**
Tang Chen66b16ed2014-01-21 15:49:23 -0800764 * memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region.
765 * @base: the base phys addr of the region
766 * @size: the size of the region
767 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700768 * Return 0 on success, -errno on failure.
Tang Chen66b16ed2014-01-21 15:49:23 -0800769 */
770int __init_memblock memblock_clear_hotplug(phys_addr_t base, phys_addr_t size)
771{
Tony Luck4308ce12014-12-12 16:54:59 -0800772 return memblock_setclr_flag(base, size, 0, MEMBLOCK_HOTPLUG);
Tang Chen66b16ed2014-01-21 15:49:23 -0800773}
774
775/**
Tony Lucka3f5baf2015-06-24 16:58:12 -0700776 * memblock_mark_mirror - Mark mirrored memory with flag MEMBLOCK_MIRROR.
777 * @base: the base phys addr of the region
778 * @size: the size of the region
779 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700780 * Return 0 on success, -errno on failure.
Tony Lucka3f5baf2015-06-24 16:58:12 -0700781 */
782int __init_memblock memblock_mark_mirror(phys_addr_t base, phys_addr_t size)
783{
784 system_has_some_mirror = true;
785
786 return memblock_setclr_flag(base, size, 1, MEMBLOCK_MIRROR);
787}
788
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +0100789/**
790 * memblock_mark_nomap - Mark a memory region with flag MEMBLOCK_NOMAP.
791 * @base: the base phys addr of the region
792 * @size: the size of the region
793 *
794 * Return 0 on success, -errno on failure.
795 */
796int __init_memblock memblock_mark_nomap(phys_addr_t base, phys_addr_t size)
797{
798 return memblock_setclr_flag(base, size, 1, MEMBLOCK_NOMAP);
799}
Tony Lucka3f5baf2015-06-24 16:58:12 -0700800
801/**
AKASHI Takahiro4c546b82017-04-03 11:23:54 +0900802 * memblock_clear_nomap - Clear flag MEMBLOCK_NOMAP for a specified region.
803 * @base: the base phys addr of the region
804 * @size: the size of the region
805 *
806 * Return 0 on success, -errno on failure.
807 */
808int __init_memblock memblock_clear_nomap(phys_addr_t base, phys_addr_t size)
809{
810 return memblock_setclr_flag(base, size, 0, MEMBLOCK_NOMAP);
811}
812
813/**
Robin Holt8e7a7f82015-06-30 14:56:41 -0700814 * __next_reserved_mem_region - next function for for_each_reserved_region()
815 * @idx: pointer to u64 loop variable
816 * @out_start: ptr to phys_addr_t for start address of the region, can be %NULL
817 * @out_end: ptr to phys_addr_t for end address of the region, can be %NULL
818 *
819 * Iterate over all reserved memory regions.
820 */
821void __init_memblock __next_reserved_mem_region(u64 *idx,
822 phys_addr_t *out_start,
823 phys_addr_t *out_end)
824{
Alexander Kuleshov567d1172015-09-08 15:03:33 -0700825 struct memblock_type *type = &memblock.reserved;
Robin Holt8e7a7f82015-06-30 14:56:41 -0700826
Richard Leitnercd33a762016-05-20 16:58:33 -0700827 if (*idx < type->cnt) {
Alexander Kuleshov567d1172015-09-08 15:03:33 -0700828 struct memblock_region *r = &type->regions[*idx];
Robin Holt8e7a7f82015-06-30 14:56:41 -0700829 phys_addr_t base = r->base;
830 phys_addr_t size = r->size;
831
832 if (out_start)
833 *out_start = base;
834 if (out_end)
835 *out_end = base + size - 1;
836
837 *idx += 1;
838 return;
839 }
840
841 /* signal end of iteration */
842 *idx = ULLONG_MAX;
843}
844
845/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100846 * __next__mem_range - next function for for_each_free_mem_range() etc.
Tejun Heo35fd0802011-07-12 11:15:59 +0200847 * @idx: pointer to u64 loop variable
Grygorii Strashkob1154232014-01-21 15:50:16 -0800848 * @nid: node selector, %NUMA_NO_NODE for all nodes
Tony Luckfc6daaf2015-06-24 16:58:09 -0700849 * @flags: pick from blocks based on memory attributes
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100850 * @type_a: pointer to memblock_type from where the range is taken
851 * @type_b: pointer to memblock_type which excludes memory from being taken
Wanpeng Lidad75572012-06-20 12:53:01 -0700852 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
853 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
854 * @out_nid: ptr to int for nid of the range, can be %NULL
Tejun Heo35fd0802011-07-12 11:15:59 +0200855 *
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100856 * Find the first area from *@idx which matches @nid, fill the out
Tejun Heo35fd0802011-07-12 11:15:59 +0200857 * parameters, and update *@idx for the next iteration. The lower 32bit of
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100858 * *@idx contains index into type_a and the upper 32bit indexes the
859 * areas before each region in type_b. For example, if type_b regions
Tejun Heo35fd0802011-07-12 11:15:59 +0200860 * look like the following,
861 *
862 * 0:[0-16), 1:[32-48), 2:[128-130)
863 *
864 * The upper 32bit indexes the following regions.
865 *
866 * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX)
867 *
868 * As both region arrays are sorted, the function advances the two indices
869 * in lockstep and returns each intersection.
870 */
Tony Luckfc6daaf2015-06-24 16:58:09 -0700871void __init_memblock __next_mem_range(u64 *idx, int nid, ulong flags,
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100872 struct memblock_type *type_a,
873 struct memblock_type *type_b,
874 phys_addr_t *out_start,
875 phys_addr_t *out_end, int *out_nid)
Tejun Heo35fd0802011-07-12 11:15:59 +0200876{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100877 int idx_a = *idx & 0xffffffff;
878 int idx_b = *idx >> 32;
Grygorii Strashkob1154232014-01-21 15:50:16 -0800879
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100880 if (WARN_ONCE(nid == MAX_NUMNODES,
881 "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
Grygorii Strashko560dca272014-01-21 15:50:55 -0800882 nid = NUMA_NO_NODE;
Tejun Heo35fd0802011-07-12 11:15:59 +0200883
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100884 for (; idx_a < type_a->cnt; idx_a++) {
885 struct memblock_region *m = &type_a->regions[idx_a];
886
Tejun Heo35fd0802011-07-12 11:15:59 +0200887 phys_addr_t m_start = m->base;
888 phys_addr_t m_end = m->base + m->size;
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100889 int m_nid = memblock_get_region_node(m);
Tejun Heo35fd0802011-07-12 11:15:59 +0200890
891 /* only memory regions are associated with nodes, check it */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100892 if (nid != NUMA_NO_NODE && nid != m_nid)
Tejun Heo35fd0802011-07-12 11:15:59 +0200893 continue;
894
Xishi Qiu0a313a92014-09-09 14:50:46 -0700895 /* skip hotpluggable memory regions if needed */
896 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
897 continue;
898
Tony Lucka3f5baf2015-06-24 16:58:12 -0700899 /* if we want mirror memory skip non-mirror memory regions */
900 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
901 continue;
902
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +0100903 /* skip nomap memory unless we were asked for it explicitly */
904 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
905 continue;
906
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100907 if (!type_b) {
908 if (out_start)
909 *out_start = m_start;
910 if (out_end)
911 *out_end = m_end;
912 if (out_nid)
913 *out_nid = m_nid;
914 idx_a++;
915 *idx = (u32)idx_a | (u64)idx_b << 32;
916 return;
917 }
Tejun Heo35fd0802011-07-12 11:15:59 +0200918
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100919 /* scan areas before each reservation */
920 for (; idx_b < type_b->cnt + 1; idx_b++) {
921 struct memblock_region *r;
922 phys_addr_t r_start;
923 phys_addr_t r_end;
924
925 r = &type_b->regions[idx_b];
926 r_start = idx_b ? r[-1].base + r[-1].size : 0;
927 r_end = idx_b < type_b->cnt ?
Stefan Agner644d87d2018-04-05 16:25:38 -0700928 r->base : (phys_addr_t)ULLONG_MAX;
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100929
930 /*
931 * if idx_b advanced past idx_a,
932 * break out to advance idx_a
933 */
Tejun Heo35fd0802011-07-12 11:15:59 +0200934 if (r_start >= m_end)
935 break;
936 /* if the two regions intersect, we're done */
937 if (m_start < r_end) {
938 if (out_start)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100939 *out_start =
940 max(m_start, r_start);
Tejun Heo35fd0802011-07-12 11:15:59 +0200941 if (out_end)
942 *out_end = min(m_end, r_end);
943 if (out_nid)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100944 *out_nid = m_nid;
Tejun Heo35fd0802011-07-12 11:15:59 +0200945 /*
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100946 * The region which ends first is
947 * advanced for the next iteration.
Tejun Heo35fd0802011-07-12 11:15:59 +0200948 */
949 if (m_end <= r_end)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100950 idx_a++;
Tejun Heo35fd0802011-07-12 11:15:59 +0200951 else
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100952 idx_b++;
953 *idx = (u32)idx_a | (u64)idx_b << 32;
Tejun Heo35fd0802011-07-12 11:15:59 +0200954 return;
955 }
956 }
957 }
958
959 /* signal end of iteration */
960 *idx = ULLONG_MAX;
961}
962
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800963/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100964 * __next_mem_range_rev - generic next function for for_each_*_range_rev()
965 *
966 * Finds the next range from type_a which is not marked as unsuitable
967 * in type_b.
968 *
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800969 * @idx: pointer to u64 loop variable
Alexander Kuleshovad5ea8c2015-09-08 15:04:22 -0700970 * @nid: node selector, %NUMA_NO_NODE for all nodes
Tony Luckfc6daaf2015-06-24 16:58:09 -0700971 * @flags: pick from blocks based on memory attributes
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100972 * @type_a: pointer to memblock_type from where the range is taken
973 * @type_b: pointer to memblock_type which excludes memory from being taken
Wanpeng Lidad75572012-06-20 12:53:01 -0700974 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
975 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
976 * @out_nid: ptr to int for nid of the range, can be %NULL
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800977 *
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100978 * Reverse of __next_mem_range().
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800979 */
Tony Luckfc6daaf2015-06-24 16:58:09 -0700980void __init_memblock __next_mem_range_rev(u64 *idx, int nid, ulong flags,
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100981 struct memblock_type *type_a,
982 struct memblock_type *type_b,
983 phys_addr_t *out_start,
984 phys_addr_t *out_end, int *out_nid)
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800985{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100986 int idx_a = *idx & 0xffffffff;
987 int idx_b = *idx >> 32;
Grygorii Strashkob1154232014-01-21 15:50:16 -0800988
Grygorii Strashko560dca272014-01-21 15:50:55 -0800989 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
990 nid = NUMA_NO_NODE;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800991
992 if (*idx == (u64)ULLONG_MAX) {
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100993 idx_a = type_a->cnt - 1;
zijun_hue47608a2016-08-04 15:32:00 -0700994 if (type_b != NULL)
995 idx_b = type_b->cnt;
996 else
997 idx_b = 0;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800998 }
999
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001000 for (; idx_a >= 0; idx_a--) {
1001 struct memblock_region *m = &type_a->regions[idx_a];
1002
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001003 phys_addr_t m_start = m->base;
1004 phys_addr_t m_end = m->base + m->size;
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001005 int m_nid = memblock_get_region_node(m);
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001006
1007 /* only memory regions are associated with nodes, check it */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001008 if (nid != NUMA_NO_NODE && nid != m_nid)
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001009 continue;
1010
Tang Chen55ac5902014-01-21 15:49:35 -08001011 /* skip hotpluggable memory regions if needed */
1012 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
1013 continue;
1014
Tony Lucka3f5baf2015-06-24 16:58:12 -07001015 /* if we want mirror memory skip non-mirror memory regions */
1016 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
1017 continue;
1018
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +01001019 /* skip nomap memory unless we were asked for it explicitly */
1020 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
1021 continue;
1022
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001023 if (!type_b) {
1024 if (out_start)
1025 *out_start = m_start;
1026 if (out_end)
1027 *out_end = m_end;
1028 if (out_nid)
1029 *out_nid = m_nid;
zijun_hufb399b42016-07-28 15:48:56 -07001030 idx_a--;
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001031 *idx = (u32)idx_a | (u64)idx_b << 32;
1032 return;
1033 }
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001034
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001035 /* scan areas before each reservation */
1036 for (; idx_b >= 0; idx_b--) {
1037 struct memblock_region *r;
1038 phys_addr_t r_start;
1039 phys_addr_t r_end;
1040
1041 r = &type_b->regions[idx_b];
1042 r_start = idx_b ? r[-1].base + r[-1].size : 0;
1043 r_end = idx_b < type_b->cnt ?
Stefan Agner644d87d2018-04-05 16:25:38 -07001044 r->base : (phys_addr_t)ULLONG_MAX;
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001045 /*
1046 * if idx_b advanced past idx_a,
1047 * break out to advance idx_a
1048 */
1049
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001050 if (r_end <= m_start)
1051 break;
1052 /* if the two regions intersect, we're done */
1053 if (m_end > r_start) {
1054 if (out_start)
1055 *out_start = max(m_start, r_start);
1056 if (out_end)
1057 *out_end = min(m_end, r_end);
1058 if (out_nid)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001059 *out_nid = m_nid;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001060 if (m_start >= r_start)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001061 idx_a--;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001062 else
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001063 idx_b--;
1064 *idx = (u32)idx_a | (u64)idx_b << 32;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001065 return;
1066 }
1067 }
1068 }
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001069 /* signal end of iteration */
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001070 *idx = ULLONG_MAX;
1071}
1072
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001073#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1074/*
1075 * Common iterator interface used to define for_each_mem_range().
1076 */
1077void __init_memblock __next_mem_pfn_range(int *idx, int nid,
1078 unsigned long *out_start_pfn,
1079 unsigned long *out_end_pfn, int *out_nid)
1080{
1081 struct memblock_type *type = &memblock.memory;
1082 struct memblock_region *r;
1083
1084 while (++*idx < type->cnt) {
1085 r = &type->regions[*idx];
1086
1087 if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size))
1088 continue;
1089 if (nid == MAX_NUMNODES || nid == r->nid)
1090 break;
1091 }
1092 if (*idx >= type->cnt) {
1093 *idx = -1;
1094 return;
1095 }
1096
1097 if (out_start_pfn)
1098 *out_start_pfn = PFN_UP(r->base);
1099 if (out_end_pfn)
1100 *out_end_pfn = PFN_DOWN(r->base + r->size);
1101 if (out_nid)
1102 *out_nid = r->nid;
1103}
1104
1105/**
1106 * memblock_set_node - set node ID on memblock regions
1107 * @base: base of area to set node ID for
1108 * @size: size of area to set node ID for
Tang Chene7e8de52014-01-21 15:49:26 -08001109 * @type: memblock type to set node ID for
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001110 * @nid: node ID to set
1111 *
Tang Chene7e8de52014-01-21 15:49:26 -08001112 * Set the nid of memblock @type regions in [@base,@base+@size) to @nid.
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001113 * Regions which cross the area boundaries are split as necessary.
1114 *
1115 * RETURNS:
1116 * 0 on success, -errno on failure.
1117 */
1118int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size,
Tang Chene7e8de52014-01-21 15:49:26 -08001119 struct memblock_type *type, int nid)
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001120{
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001121 int start_rgn, end_rgn;
1122 int i, ret;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001123
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001124 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
1125 if (ret)
1126 return ret;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001127
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001128 for (i = start_rgn; i < end_rgn; i++)
Wanpeng Lie9d24ad2012-10-08 16:32:21 -07001129 memblock_set_region_node(&type->regions[i], nid);
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001130
1131 memblock_merge_regions(type);
1132 return 0;
1133}
1134#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
1135
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001136static phys_addr_t __init memblock_alloc_range_nid(phys_addr_t size,
1137 phys_addr_t align, phys_addr_t start,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001138 phys_addr_t end, int nid, ulong flags)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001139{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001140 phys_addr_t found;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001141
Grygorii Strashko79f40fa2014-01-21 15:50:12 -08001142 if (!align)
1143 align = SMP_CACHE_BYTES;
Vineet Gupta94f3d3a2013-04-29 15:06:15 -07001144
Tony Luckfc6daaf2015-06-24 16:58:09 -07001145 found = memblock_find_in_range_node(size, align, start, end, nid,
1146 flags);
Catalin Marinasaedf95e2014-06-06 14:38:20 -07001147 if (found && !memblock_reserve(found, size)) {
1148 /*
1149 * The min_count is set to 0 so that memblock allocations are
1150 * never reported as leaks.
1151 */
Catalin Marinas9099dae2016-10-11 13:55:11 -07001152 kmemleak_alloc_phys(found, size, 0, 0);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001153 return found;
Catalin Marinasaedf95e2014-06-06 14:38:20 -07001154 }
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001155 return 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001156}
1157
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001158phys_addr_t __init memblock_alloc_range(phys_addr_t size, phys_addr_t align,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001159 phys_addr_t start, phys_addr_t end,
1160 ulong flags)
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001161{
Tony Luckfc6daaf2015-06-24 16:58:09 -07001162 return memblock_alloc_range_nid(size, align, start, end, NUMA_NO_NODE,
1163 flags);
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001164}
1165
Nicholas Pigginb575454f2018-02-14 01:08:15 +10001166phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size,
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001167 phys_addr_t align, phys_addr_t max_addr,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001168 int nid, ulong flags)
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001169{
Tony Luckfc6daaf2015-06-24 16:58:09 -07001170 return memblock_alloc_range_nid(size, align, 0, max_addr, nid, flags);
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001171}
1172
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001173phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid)
1174{
Tony Lucka3f5baf2015-06-24 16:58:12 -07001175 ulong flags = choose_memblock_flags();
1176 phys_addr_t ret;
1177
1178again:
1179 ret = memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE,
1180 nid, flags);
1181
1182 if (!ret && (flags & MEMBLOCK_MIRROR)) {
1183 flags &= ~MEMBLOCK_MIRROR;
1184 goto again;
1185 }
1186 return ret;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001187}
1188
1189phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
1190{
Tony Luckfc6daaf2015-06-24 16:58:09 -07001191 return memblock_alloc_base_nid(size, align, max_addr, NUMA_NO_NODE,
1192 MEMBLOCK_NONE);
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001193}
1194
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001195phys_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 +10001196{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001197 phys_addr_t alloc;
1198
1199 alloc = __memblock_alloc_base(size, align, max_addr);
1200
1201 if (alloc == 0)
Miles Chen5d63f812017-02-22 15:46:42 -08001202 panic("ERROR: Failed to allocate %pa bytes below %pa.\n",
1203 &size, &max_addr);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001204
1205 return alloc;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001206}
1207
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001208phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001209{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001210 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001211}
1212
Benjamin Herrenschmidt9d1e2492010-07-06 15:39:17 -07001213phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid)
1214{
1215 phys_addr_t res = memblock_alloc_nid(size, align, nid);
1216
1217 if (res)
1218 return res;
Tejun Heo15fb0972011-07-12 09:58:07 +02001219 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001220}
1221
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001222/**
1223 * memblock_virt_alloc_internal - allocate boot memory block
1224 * @size: size of memory block to be allocated in bytes
1225 * @align: alignment of the region and block's size
1226 * @min_addr: the lower bound of the memory region to allocate (phys address)
1227 * @max_addr: the upper bound of the memory region to allocate (phys address)
1228 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1229 *
1230 * The @min_addr limit is dropped if it can not be satisfied and the allocation
1231 * will fall back to memory below @min_addr. Also, allocation may fall back
1232 * to any node in the system if the specified node can not
1233 * hold the requested memory.
1234 *
1235 * The allocation is performed from memory region limited by
1236 * memblock.current_limit if @max_addr == %BOOTMEM_ALLOC_ACCESSIBLE.
1237 *
1238 * The memory block is aligned on SMP_CACHE_BYTES if @align == 0.
1239 *
1240 * The phys address of allocated boot memory block is converted to virtual and
1241 * allocated memory is reset to 0.
1242 *
1243 * In addition, function sets the min_count to 0 using kmemleak_alloc for
1244 * allocated boot memory block, so that it is never reported as leaks.
1245 *
1246 * RETURNS:
1247 * Virtual address of allocated memory block on success, NULL on failure.
1248 */
1249static void * __init memblock_virt_alloc_internal(
1250 phys_addr_t size, phys_addr_t align,
1251 phys_addr_t min_addr, phys_addr_t max_addr,
1252 int nid)
1253{
1254 phys_addr_t alloc;
1255 void *ptr;
Tony Lucka3f5baf2015-06-24 16:58:12 -07001256 ulong flags = choose_memblock_flags();
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001257
Grygorii Strashko560dca272014-01-21 15:50:55 -08001258 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
1259 nid = NUMA_NO_NODE;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001260
1261 /*
1262 * Detect any accidental use of these APIs after slab is ready, as at
1263 * this moment memblock may be deinitialized already and its
1264 * internal data may be destroyed (after execution of free_all_bootmem)
1265 */
1266 if (WARN_ON_ONCE(slab_is_available()))
1267 return kzalloc_node(size, GFP_NOWAIT, nid);
1268
1269 if (!align)
1270 align = SMP_CACHE_BYTES;
1271
Yinghai Luf544e142014-01-29 14:05:52 -08001272 if (max_addr > memblock.current_limit)
1273 max_addr = memblock.current_limit;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001274again:
1275 alloc = memblock_find_in_range_node(size, align, min_addr, max_addr,
Tony Lucka3f5baf2015-06-24 16:58:12 -07001276 nid, flags);
Wei Yang7d41c032017-02-22 15:45:07 -08001277 if (alloc && !memblock_reserve(alloc, size))
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001278 goto done;
1279
1280 if (nid != NUMA_NO_NODE) {
1281 alloc = memblock_find_in_range_node(size, align, min_addr,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001282 max_addr, NUMA_NO_NODE,
Tony Lucka3f5baf2015-06-24 16:58:12 -07001283 flags);
Wei Yang7d41c032017-02-22 15:45:07 -08001284 if (alloc && !memblock_reserve(alloc, size))
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001285 goto done;
1286 }
1287
1288 if (min_addr) {
1289 min_addr = 0;
1290 goto again;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001291 }
1292
Tony Lucka3f5baf2015-06-24 16:58:12 -07001293 if (flags & MEMBLOCK_MIRROR) {
1294 flags &= ~MEMBLOCK_MIRROR;
1295 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
1296 &size);
1297 goto again;
1298 }
1299
1300 return NULL;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001301done:
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001302 ptr = phys_to_virt(alloc);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001303
1304 /*
1305 * The min_count is set to 0 so that bootmem allocated blocks
1306 * are never reported as leaks. This is because many of these blocks
1307 * are only referred via the physical address which is not
1308 * looked up by kmemleak.
1309 */
1310 kmemleak_alloc(ptr, size, 0, 0);
1311
1312 return ptr;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001313}
1314
1315/**
Pavel Tatashinea1f5f32017-11-15 17:36:27 -08001316 * memblock_virt_alloc_try_nid_raw - allocate boot memory block without zeroing
1317 * memory and without panicking
1318 * @size: size of memory block to be allocated in bytes
1319 * @align: alignment of the region and block's size
1320 * @min_addr: the lower bound of the memory region from where the allocation
1321 * is preferred (phys address)
1322 * @max_addr: the upper bound of the memory region from where the allocation
1323 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1324 * allocate only from memory limited by memblock.current_limit value
1325 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1326 *
1327 * Public function, provides additional debug information (including caller
1328 * info), if enabled. Does not zero allocated memory, does not panic if request
1329 * cannot be satisfied.
1330 *
1331 * RETURNS:
1332 * Virtual address of allocated memory block on success, NULL on failure.
1333 */
1334void * __init memblock_virt_alloc_try_nid_raw(
1335 phys_addr_t size, phys_addr_t align,
1336 phys_addr_t min_addr, phys_addr_t max_addr,
1337 int nid)
1338{
1339 void *ptr;
1340
1341 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1342 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1343 (u64)max_addr, (void *)_RET_IP_);
1344
1345 ptr = memblock_virt_alloc_internal(size, align,
1346 min_addr, max_addr, nid);
1347#ifdef CONFIG_DEBUG_VM
1348 if (ptr && size > 0)
Pavel Tatashinf165b372018-04-05 16:22:47 -07001349 memset(ptr, PAGE_POISON_PATTERN, size);
Pavel Tatashinea1f5f32017-11-15 17:36:27 -08001350#endif
1351 return ptr;
1352}
1353
1354/**
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001355 * memblock_virt_alloc_try_nid_nopanic - allocate boot memory block
1356 * @size: size of memory block to be allocated in bytes
1357 * @align: alignment of the region and block's size
1358 * @min_addr: the lower bound of the memory region from where the allocation
1359 * is preferred (phys address)
1360 * @max_addr: the upper bound of the memory region from where the allocation
1361 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1362 * allocate only from memory limited by memblock.current_limit value
1363 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1364 *
Pavel Tatashinea1f5f32017-11-15 17:36:27 -08001365 * Public function, provides additional debug information (including caller
1366 * info), if enabled. This function zeroes the allocated memory.
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001367 *
1368 * RETURNS:
1369 * Virtual address of allocated memory block on success, NULL on failure.
1370 */
1371void * __init memblock_virt_alloc_try_nid_nopanic(
1372 phys_addr_t size, phys_addr_t align,
1373 phys_addr_t min_addr, phys_addr_t max_addr,
1374 int nid)
1375{
Pavel Tatashinea1f5f32017-11-15 17:36:27 -08001376 void *ptr;
1377
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001378 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1379 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1380 (u64)max_addr, (void *)_RET_IP_);
Pavel Tatashinea1f5f32017-11-15 17:36:27 -08001381
1382 ptr = memblock_virt_alloc_internal(size, align,
1383 min_addr, max_addr, nid);
1384 if (ptr)
1385 memset(ptr, 0, size);
1386 return ptr;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001387}
1388
1389/**
1390 * memblock_virt_alloc_try_nid - allocate boot memory block with panicking
1391 * @size: size of memory block to be allocated in bytes
1392 * @align: alignment of the region and block's size
1393 * @min_addr: the lower bound of the memory region from where the allocation
1394 * is preferred (phys address)
1395 * @max_addr: the upper bound of the memory region from where the allocation
1396 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1397 * allocate only from memory limited by memblock.current_limit value
1398 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1399 *
Pavel Tatashinea1f5f32017-11-15 17:36:27 -08001400 * Public panicking version of memblock_virt_alloc_try_nid_nopanic()
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001401 * which provides debug information (including caller info), if enabled,
1402 * and panics if the request can not be satisfied.
1403 *
1404 * RETURNS:
1405 * Virtual address of allocated memory block on success, NULL on failure.
1406 */
1407void * __init memblock_virt_alloc_try_nid(
1408 phys_addr_t size, phys_addr_t align,
1409 phys_addr_t min_addr, phys_addr_t max_addr,
1410 int nid)
1411{
1412 void *ptr;
1413
1414 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1415 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1416 (u64)max_addr, (void *)_RET_IP_);
1417 ptr = memblock_virt_alloc_internal(size, align,
1418 min_addr, max_addr, nid);
Pavel Tatashinea1f5f32017-11-15 17:36:27 -08001419 if (ptr) {
1420 memset(ptr, 0, size);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001421 return ptr;
Pavel Tatashinea1f5f32017-11-15 17:36:27 -08001422 }
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001423
1424 panic("%s: Failed to allocate %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx\n",
1425 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1426 (u64)max_addr);
1427 return NULL;
1428}
1429
1430/**
1431 * __memblock_free_early - free boot memory block
1432 * @base: phys starting address of the boot memory block
1433 * @size: size of the boot memory block in bytes
1434 *
1435 * Free boot memory block previously allocated by memblock_virt_alloc_xx() API.
1436 * The freeing memory will not be released to the buddy allocator.
1437 */
1438void __init __memblock_free_early(phys_addr_t base, phys_addr_t size)
1439{
1440 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1441 __func__, (u64)base, (u64)base + size - 1,
1442 (void *)_RET_IP_);
Catalin Marinas9099dae2016-10-11 13:55:11 -07001443 kmemleak_free_part_phys(base, size);
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001444 memblock_remove_range(&memblock.reserved, base, size);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001445}
1446
1447/*
1448 * __memblock_free_late - free bootmem block pages directly to buddy allocator
1449 * @addr: phys starting address of the boot memory block
1450 * @size: size of the boot memory block in bytes
1451 *
1452 * This is only useful when the bootmem allocator has already been torn
1453 * down, but we are still initializing the system. Pages are released directly
1454 * to the buddy allocator, no bootmem metadata is updated because it is gone.
1455 */
1456void __init __memblock_free_late(phys_addr_t base, phys_addr_t size)
1457{
1458 u64 cursor, end;
1459
1460 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1461 __func__, (u64)base, (u64)base + size - 1,
1462 (void *)_RET_IP_);
Catalin Marinas9099dae2016-10-11 13:55:11 -07001463 kmemleak_free_part_phys(base, size);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001464 cursor = PFN_UP(base);
1465 end = PFN_DOWN(base + size);
1466
1467 for (; cursor < end; cursor++) {
Mel Gormand70ddd72015-06-30 14:56:52 -07001468 __free_pages_bootmem(pfn_to_page(cursor), cursor, 0);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001469 totalram_pages++;
1470 }
1471}
Benjamin Herrenschmidt9d1e2492010-07-06 15:39:17 -07001472
1473/*
1474 * Remaining API functions
1475 */
1476
David Gibson1f1ffb8a2016-02-05 15:36:19 -08001477phys_addr_t __init_memblock memblock_phys_mem_size(void)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001478{
Tejun Heo1440c4e2011-12-08 10:22:08 -08001479 return memblock.memory.total_size;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001480}
1481
Srikar Dronamraju8907de52016-10-07 16:59:18 -07001482phys_addr_t __init_memblock memblock_reserved_size(void)
1483{
1484 return memblock.reserved.total_size;
1485}
1486
Yinghai Lu595ad9a2013-01-24 12:20:09 -08001487phys_addr_t __init memblock_mem_size(unsigned long limit_pfn)
1488{
1489 unsigned long pages = 0;
1490 struct memblock_region *r;
1491 unsigned long start_pfn, end_pfn;
1492
1493 for_each_memblock(memory, r) {
1494 start_pfn = memblock_region_memory_base_pfn(r);
1495 end_pfn = memblock_region_memory_end_pfn(r);
1496 start_pfn = min_t(unsigned long, start_pfn, limit_pfn);
1497 end_pfn = min_t(unsigned long, end_pfn, limit_pfn);
1498 pages += end_pfn - start_pfn;
1499 }
1500
Fabian Frederick16763232014-04-07 15:37:53 -07001501 return PFN_PHYS(pages);
Yinghai Lu595ad9a2013-01-24 12:20:09 -08001502}
1503
Sam Ravnborg0a93ebe2011-10-31 17:08:16 -07001504/* lowest address */
1505phys_addr_t __init_memblock memblock_start_of_DRAM(void)
1506{
1507 return memblock.memory.regions[0].base;
1508}
1509
Yinghai Lu10d06432010-07-28 15:43:02 +10001510phys_addr_t __init_memblock memblock_end_of_DRAM(void)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001511{
1512 int idx = memblock.memory.cnt - 1;
1513
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +10001514 return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001515}
1516
Dennis Chena571d4e2016-07-28 15:48:26 -07001517static phys_addr_t __init_memblock __find_max_addr(phys_addr_t limit)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001518{
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001519 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
Emil Medve136199f2014-04-07 15:37:52 -07001520 struct memblock_region *r;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001521
Dennis Chena571d4e2016-07-28 15:48:26 -07001522 /*
1523 * translate the memory @limit size into the max address within one of
1524 * the memory memblock regions, if the @limit exceeds the total size
1525 * of those regions, max_addr will keep original value ULLONG_MAX
1526 */
Emil Medve136199f2014-04-07 15:37:52 -07001527 for_each_memblock(memory, r) {
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001528 if (limit <= r->size) {
1529 max_addr = r->base + limit;
1530 break;
1531 }
1532 limit -= r->size;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001533 }
1534
Dennis Chena571d4e2016-07-28 15:48:26 -07001535 return max_addr;
1536}
1537
1538void __init memblock_enforce_memory_limit(phys_addr_t limit)
1539{
1540 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
1541
1542 if (!limit)
1543 return;
1544
1545 max_addr = __find_max_addr(limit);
1546
1547 /* @limit exceeds the total size of the memory, do nothing */
1548 if (max_addr == (phys_addr_t)ULLONG_MAX)
1549 return;
1550
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001551 /* truncate both memory and reserved regions */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001552 memblock_remove_range(&memblock.memory, max_addr,
1553 (phys_addr_t)ULLONG_MAX);
1554 memblock_remove_range(&memblock.reserved, max_addr,
1555 (phys_addr_t)ULLONG_MAX);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001556}
1557
AKASHI Takahiroc9ca9b42017-04-03 11:23:55 +09001558void __init memblock_cap_memory_range(phys_addr_t base, phys_addr_t size)
1559{
1560 int start_rgn, end_rgn;
1561 int i, ret;
1562
1563 if (!size)
1564 return;
1565
1566 ret = memblock_isolate_range(&memblock.memory, base, size,
1567 &start_rgn, &end_rgn);
1568 if (ret)
1569 return;
1570
1571 /* remove all the MAP regions */
1572 for (i = memblock.memory.cnt - 1; i >= end_rgn; i--)
1573 if (!memblock_is_nomap(&memblock.memory.regions[i]))
1574 memblock_remove_region(&memblock.memory, i);
1575
1576 for (i = start_rgn - 1; i >= 0; i--)
1577 if (!memblock_is_nomap(&memblock.memory.regions[i]))
1578 memblock_remove_region(&memblock.memory, i);
1579
1580 /* truncate the reserved regions */
1581 memblock_remove_range(&memblock.reserved, 0, base);
1582 memblock_remove_range(&memblock.reserved,
1583 base + size, (phys_addr_t)ULLONG_MAX);
1584}
1585
Dennis Chena571d4e2016-07-28 15:48:26 -07001586void __init memblock_mem_limit_remove_map(phys_addr_t limit)
1587{
Dennis Chena571d4e2016-07-28 15:48:26 -07001588 phys_addr_t max_addr;
Dennis Chena571d4e2016-07-28 15:48:26 -07001589
1590 if (!limit)
1591 return;
1592
1593 max_addr = __find_max_addr(limit);
1594
1595 /* @limit exceeds the total size of the memory, do nothing */
1596 if (max_addr == (phys_addr_t)ULLONG_MAX)
1597 return;
1598
AKASHI Takahiroc9ca9b42017-04-03 11:23:55 +09001599 memblock_cap_memory_range(0, max_addr);
Dennis Chena571d4e2016-07-28 15:48:26 -07001600}
1601
Yinghai Lucd794812010-10-11 12:34:09 -07001602static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001603{
1604 unsigned int left = 0, right = type->cnt;
1605
1606 do {
1607 unsigned int mid = (right + left) / 2;
1608
1609 if (addr < type->regions[mid].base)
1610 right = mid;
1611 else if (addr >= (type->regions[mid].base +
1612 type->regions[mid].size))
1613 left = mid + 1;
1614 else
1615 return mid;
1616 } while (left < right);
1617 return -1;
1618}
1619
Yaowei Baib4ad0c72016-01-14 15:18:54 -08001620bool __init memblock_is_reserved(phys_addr_t addr)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001621{
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001622 return memblock_search(&memblock.reserved, addr) != -1;
1623}
Yinghai Lu95f72d12010-07-12 14:36:09 +10001624
Yaowei Baib4ad0c72016-01-14 15:18:54 -08001625bool __init_memblock memblock_is_memory(phys_addr_t addr)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001626{
1627 return memblock_search(&memblock.memory, addr) != -1;
1628}
1629
Yaowei Bai937f0c22018-02-06 15:41:18 -08001630bool __init_memblock memblock_is_map_memory(phys_addr_t addr)
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +01001631{
1632 int i = memblock_search(&memblock.memory, addr);
1633
1634 if (i == -1)
1635 return false;
1636 return !memblock_is_nomap(&memblock.memory.regions[i]);
1637}
1638
Yinghai Lue76b63f2013-09-11 14:22:17 -07001639#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1640int __init_memblock memblock_search_pfn_nid(unsigned long pfn,
1641 unsigned long *start_pfn, unsigned long *end_pfn)
1642{
1643 struct memblock_type *type = &memblock.memory;
Fabian Frederick16763232014-04-07 15:37:53 -07001644 int mid = memblock_search(type, PFN_PHYS(pfn));
Yinghai Lue76b63f2013-09-11 14:22:17 -07001645
1646 if (mid == -1)
1647 return -1;
1648
Fabian Frederickf7e2f7e2014-06-04 16:07:51 -07001649 *start_pfn = PFN_DOWN(type->regions[mid].base);
1650 *end_pfn = PFN_DOWN(type->regions[mid].base + type->regions[mid].size);
Yinghai Lue76b63f2013-09-11 14:22:17 -07001651
1652 return type->regions[mid].nid;
1653}
1654#endif
1655
Stephen Boydeab30942012-05-24 00:45:21 -07001656/**
1657 * memblock_is_region_memory - check if a region is a subset of memory
1658 * @base: base of region to check
1659 * @size: size of region to check
1660 *
1661 * Check if the region [@base, @base+@size) is a subset of a memory block.
1662 *
1663 * RETURNS:
1664 * 0 if false, non-zero if true
1665 */
Yaowei Bai937f0c22018-02-06 15:41:18 -08001666bool __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001667{
Tomi Valkeinenabb65272011-01-20 14:44:20 -08001668 int idx = memblock_search(&memblock.memory, base);
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001669 phys_addr_t end = base + memblock_cap_size(base, &size);
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001670
1671 if (idx == -1)
Yaowei Bai937f0c22018-02-06 15:41:18 -08001672 return false;
Wei Yangef415ef2017-02-22 15:45:04 -08001673 return (memblock.memory.regions[idx].base +
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001674 memblock.memory.regions[idx].size) >= end;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001675}
1676
Stephen Boydeab30942012-05-24 00:45:21 -07001677/**
1678 * memblock_is_region_reserved - check if a region intersects reserved memory
1679 * @base: base of region to check
1680 * @size: size of region to check
1681 *
1682 * Check if the region [@base, @base+@size) intersects a reserved memory block.
1683 *
1684 * RETURNS:
Tang Chenc5c5c9d2015-09-08 15:02:00 -07001685 * True if they intersect, false if not.
Stephen Boydeab30942012-05-24 00:45:21 -07001686 */
Tang Chenc5c5c9d2015-09-08 15:02:00 -07001687bool __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001688{
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001689 memblock_cap_size(base, &size);
Tang Chenc5c5c9d2015-09-08 15:02:00 -07001690 return memblock_overlaps_region(&memblock.reserved, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001691}
1692
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001693void __init_memblock memblock_trim_memory(phys_addr_t align)
1694{
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001695 phys_addr_t start, end, orig_start, orig_end;
Emil Medve136199f2014-04-07 15:37:52 -07001696 struct memblock_region *r;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001697
Emil Medve136199f2014-04-07 15:37:52 -07001698 for_each_memblock(memory, r) {
1699 orig_start = r->base;
1700 orig_end = r->base + r->size;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001701 start = round_up(orig_start, align);
1702 end = round_down(orig_end, align);
1703
1704 if (start == orig_start && end == orig_end)
1705 continue;
1706
1707 if (start < end) {
Emil Medve136199f2014-04-07 15:37:52 -07001708 r->base = start;
1709 r->size = end - start;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001710 } else {
Emil Medve136199f2014-04-07 15:37:52 -07001711 memblock_remove_region(&memblock.memory,
1712 r - memblock.memory.regions);
1713 r--;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001714 }
1715 }
1716}
Benjamin Herrenschmidte63075a2010-07-06 15:39:01 -07001717
Yinghai Lu3661ca62010-09-15 13:05:29 -07001718void __init_memblock memblock_set_current_limit(phys_addr_t limit)
Benjamin Herrenschmidte63075a2010-07-06 15:39:01 -07001719{
1720 memblock.current_limit = limit;
1721}
1722
Laura Abbottfec51012014-02-27 01:23:43 +01001723phys_addr_t __init_memblock memblock_get_current_limit(void)
1724{
1725 return memblock.current_limit;
1726}
1727
Heiko Carstens0262d9c2017-02-24 14:55:59 -08001728static void __init_memblock memblock_dump(struct memblock_type *type)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001729{
Miles Chen5d63f812017-02-22 15:46:42 -08001730 phys_addr_t base, end, size;
Tang Chen66a20752014-01-21 15:49:20 -08001731 unsigned long flags;
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -08001732 int idx;
1733 struct memblock_region *rgn;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001734
Heiko Carstens0262d9c2017-02-24 14:55:59 -08001735 pr_info(" %s.cnt = 0x%lx\n", type->name, type->cnt);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001736
Gioh Kim66e8b432017-11-15 17:33:42 -08001737 for_each_memblock_type(idx, type, rgn) {
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001738 char nid_buf[32] = "";
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001739
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001740 base = rgn->base;
1741 size = rgn->size;
Miles Chen5d63f812017-02-22 15:46:42 -08001742 end = base + size - 1;
Tang Chen66a20752014-01-21 15:49:20 -08001743 flags = rgn->flags;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001744#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1745 if (memblock_get_region_node(rgn) != MAX_NUMNODES)
1746 snprintf(nid_buf, sizeof(nid_buf), " on node %d",
1747 memblock_get_region_node(rgn));
1748#endif
Miles Chen5d63f812017-02-22 15:46:42 -08001749 pr_info(" %s[%#x]\t[%pa-%pa], %pa bytes%s flags: %#lx\n",
Heiko Carstens0262d9c2017-02-24 14:55:59 -08001750 type->name, idx, &base, &end, &size, nid_buf, flags);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001751 }
1752}
1753
Tejun Heo4ff7b822011-12-08 10:22:06 -08001754void __init_memblock __memblock_dump_all(void)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001755{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001756 pr_info("MEMBLOCK configuration:\n");
Miles Chen5d63f812017-02-22 15:46:42 -08001757 pr_info(" memory size = %pa reserved size = %pa\n",
1758 &memblock.memory.total_size,
1759 &memblock.reserved.total_size);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001760
Heiko Carstens0262d9c2017-02-24 14:55:59 -08001761 memblock_dump(&memblock.memory);
1762 memblock_dump(&memblock.reserved);
Heiko Carstens409efd42017-02-24 14:55:56 -08001763#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
Heiko Carstens0262d9c2017-02-24 14:55:59 -08001764 memblock_dump(&memblock.physmem);
Heiko Carstens409efd42017-02-24 14:55:56 -08001765#endif
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001766}
1767
Tejun Heo1aadc052011-12-08 10:22:08 -08001768void __init memblock_allow_resize(void)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001769{
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -07001770 memblock_can_resize = 1;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001771}
1772
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001773static int __init early_memblock(char *p)
1774{
1775 if (p && strstr(p, "debug"))
1776 memblock_debug = 1;
1777 return 0;
1778}
1779early_param("memblock", early_memblock);
1780
Tejun Heoc378ddd2011-07-14 11:46:03 +02001781#if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001782
1783static int memblock_debug_show(struct seq_file *m, void *private)
1784{
1785 struct memblock_type *type = m->private;
1786 struct memblock_region *reg;
1787 int i;
Miles Chen5d63f812017-02-22 15:46:42 -08001788 phys_addr_t end;
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001789
1790 for (i = 0; i < type->cnt; i++) {
1791 reg = &type->regions[i];
Miles Chen5d63f812017-02-22 15:46:42 -08001792 end = reg->base + reg->size - 1;
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001793
Miles Chen5d63f812017-02-22 15:46:42 -08001794 seq_printf(m, "%4d: ", i);
1795 seq_printf(m, "%pa..%pa\n", &reg->base, &end);
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001796 }
1797 return 0;
1798}
Andy Shevchenko5ad35092018-04-05 16:23:16 -07001799DEFINE_SHOW_ATTRIBUTE(memblock_debug);
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001800
1801static int __init memblock_init_debugfs(void)
1802{
1803 struct dentry *root = debugfs_create_dir("memblock", NULL);
1804 if (!root)
1805 return -ENXIO;
1806 debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops);
1807 debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops);
Philipp Hachtmann70210ed2014-01-29 18:16:01 +01001808#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
1809 debugfs_create_file("physmem", S_IRUGO, root, &memblock.physmem, &memblock_debug_fops);
1810#endif
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001811
1812 return 0;
1813}
1814__initcall(memblock_init_debugfs);
1815
1816#endif /* CONFIG_DEBUG_FS */