blob: 91205780e6b151f8239574c5f97b8d5ebc89b59f [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
Pavel Tatashin3010f872017-08-18 15:16:05 -0700288/**
289 * Discard memory and reserved arrays if they were allocated
290 */
291void __init memblock_discard(void)
Yinghai Lu29f67382012-07-11 14:02:56 -0700292{
Pavel Tatashin3010f872017-08-18 15:16:05 -0700293 phys_addr_t addr, size;
Yinghai Lu29f67382012-07-11 14:02:56 -0700294
Pavel Tatashin3010f872017-08-18 15:16:05 -0700295 if (memblock.reserved.regions != memblock_reserved_init_regions) {
296 addr = __pa(memblock.reserved.regions);
297 size = PAGE_ALIGN(sizeof(struct memblock_region) *
298 memblock.reserved.max);
299 __memblock_free_late(addr, size);
300 }
Yinghai Lu29f67382012-07-11 14:02:56 -0700301
Pavel Tatashin91b540f2017-08-25 15:55:46 -0700302 if (memblock.memory.regions != memblock_memory_init_regions) {
Pavel Tatashin3010f872017-08-18 15:16:05 -0700303 addr = __pa(memblock.memory.regions);
304 size = PAGE_ALIGN(sizeof(struct memblock_region) *
305 memblock.memory.max);
306 __memblock_free_late(addr, size);
307 }
Yinghai Lu29f67382012-07-11 14:02:56 -0700308}
Philipp Hachtmann5e270e22014-01-23 15:53:11 -0800309#endif
310
Greg Pearson48c3b582012-06-20 12:53:05 -0700311/**
312 * memblock_double_array - double the size of the memblock regions array
313 * @type: memblock type of the regions array being doubled
314 * @new_area_start: starting address of memory range to avoid overlap with
315 * @new_area_size: size of memory range to avoid overlap with
316 *
317 * Double the size of the @type regions array. If memblock is being used to
318 * allocate memory for a new reserved regions array and there is a previously
319 * allocated memory range [@new_area_start,@new_area_start+@new_area_size]
320 * waiting to be reserved, ensure the memory used by the new array does
321 * not overlap.
322 *
323 * RETURNS:
324 * 0 on success, -1 on failure.
325 */
326static int __init_memblock memblock_double_array(struct memblock_type *type,
327 phys_addr_t new_area_start,
328 phys_addr_t new_area_size)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700329{
330 struct memblock_region *new_array, *old_array;
Yinghai Lu29f67382012-07-11 14:02:56 -0700331 phys_addr_t old_alloc_size, new_alloc_size;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700332 phys_addr_t old_size, new_size, addr;
333 int use_slab = slab_is_available();
Gavin Shan181eb392012-05-29 15:06:50 -0700334 int *in_slab;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700335
336 /* We don't allow resizing until we know about the reserved regions
337 * of memory that aren't suitable for allocation
338 */
339 if (!memblock_can_resize)
340 return -1;
341
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700342 /* Calculate new doubled size */
343 old_size = type->max * sizeof(struct memblock_region);
344 new_size = old_size << 1;
Yinghai Lu29f67382012-07-11 14:02:56 -0700345 /*
346 * We need to allocated new one align to PAGE_SIZE,
347 * so we can free them completely later.
348 */
349 old_alloc_size = PAGE_ALIGN(old_size);
350 new_alloc_size = PAGE_ALIGN(new_size);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700351
Gavin Shan181eb392012-05-29 15:06:50 -0700352 /* Retrieve the slab flag */
353 if (type == &memblock.memory)
354 in_slab = &memblock_memory_in_slab;
355 else
356 in_slab = &memblock_reserved_in_slab;
357
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700358 /* Try to find some space for it.
359 *
360 * WARNING: We assume that either slab_is_available() and we use it or
Andrew Mortonfd073832012-07-31 16:42:40 -0700361 * we use MEMBLOCK for allocations. That means that this is unsafe to
362 * use when bootmem is currently active (unless bootmem itself is
363 * implemented on top of MEMBLOCK which isn't the case yet)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700364 *
365 * This should however not be an issue for now, as we currently only
Andrew Mortonfd073832012-07-31 16:42:40 -0700366 * call into MEMBLOCK while it's still active, or much later when slab
367 * is active for memory hotplug operations
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700368 */
369 if (use_slab) {
370 new_array = kmalloc(new_size, GFP_KERNEL);
Tejun Heo1f5026a2011-07-12 09:58:09 +0200371 addr = new_array ? __pa(new_array) : 0;
Gavin Shan4e2f0772012-05-29 15:06:50 -0700372 } else {
Greg Pearson48c3b582012-06-20 12:53:05 -0700373 /* only exclude range when trying to double reserved.regions */
374 if (type != &memblock.reserved)
375 new_area_start = new_area_size = 0;
376
377 addr = memblock_find_in_range(new_area_start + new_area_size,
378 memblock.current_limit,
Yinghai Lu29f67382012-07-11 14:02:56 -0700379 new_alloc_size, PAGE_SIZE);
Greg Pearson48c3b582012-06-20 12:53:05 -0700380 if (!addr && new_area_size)
381 addr = memblock_find_in_range(0,
Andrew Mortonfd073832012-07-31 16:42:40 -0700382 min(new_area_start, memblock.current_limit),
383 new_alloc_size, PAGE_SIZE);
Greg Pearson48c3b582012-06-20 12:53:05 -0700384
Sachin Kamat15674862012-09-04 13:55:05 +0530385 new_array = addr ? __va(addr) : NULL;
Gavin Shan4e2f0772012-05-29 15:06:50 -0700386 }
Tejun Heo1f5026a2011-07-12 09:58:09 +0200387 if (!addr) {
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700388 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
Heiko Carstens0262d9c2017-02-24 14:55:59 -0800389 type->name, type->max, type->max * 2);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700390 return -1;
391 }
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700392
Andrew Mortonfd073832012-07-31 16:42:40 -0700393 memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]",
Heiko Carstens0262d9c2017-02-24 14:55:59 -0800394 type->name, type->max * 2, (u64)addr,
Andrew Mortonfd073832012-07-31 16:42:40 -0700395 (u64)addr + new_size - 1);
Yinghai Luea9e4372010-07-28 15:13:22 +1000396
Andrew Mortonfd073832012-07-31 16:42:40 -0700397 /*
398 * Found space, we now need to move the array over before we add the
399 * reserved region since it may be our reserved array itself that is
400 * full.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700401 */
402 memcpy(new_array, type->regions, old_size);
403 memset(new_array + type->max, 0, old_size);
404 old_array = type->regions;
405 type->regions = new_array;
406 type->max <<= 1;
407
Andrew Mortonfd073832012-07-31 16:42:40 -0700408 /* Free old array. We needn't free it if the array is the static one */
Gavin Shan181eb392012-05-29 15:06:50 -0700409 if (*in_slab)
410 kfree(old_array);
411 else if (old_array != memblock_memory_init_regions &&
412 old_array != memblock_reserved_init_regions)
Yinghai Lu29f67382012-07-11 14:02:56 -0700413 memblock_free(__pa(old_array), old_alloc_size);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700414
Andrew Mortonfd073832012-07-31 16:42:40 -0700415 /*
416 * Reserve the new array if that comes from the memblock. Otherwise, we
417 * needn't do it
Gavin Shan181eb392012-05-29 15:06:50 -0700418 */
419 if (!use_slab)
Yinghai Lu29f67382012-07-11 14:02:56 -0700420 BUG_ON(memblock_reserve(addr, new_alloc_size));
Gavin Shan181eb392012-05-29 15:06:50 -0700421
422 /* Update slab flag */
423 *in_slab = use_slab;
424
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700425 return 0;
426}
427
Tejun Heo784656f92011-07-12 11:15:55 +0200428/**
429 * memblock_merge_regions - merge neighboring compatible regions
430 * @type: memblock type to scan
431 *
432 * Scan @type and merge neighboring compatible regions.
433 */
434static void __init_memblock memblock_merge_regions(struct memblock_type *type)
435{
436 int i = 0;
437
438 /* cnt never goes below 1 */
439 while (i < type->cnt - 1) {
440 struct memblock_region *this = &type->regions[i];
441 struct memblock_region *next = &type->regions[i + 1];
442
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200443 if (this->base + this->size != next->base ||
444 memblock_get_region_node(this) !=
Tang Chen66a20752014-01-21 15:49:20 -0800445 memblock_get_region_node(next) ||
446 this->flags != next->flags) {
Tejun Heo784656f92011-07-12 11:15:55 +0200447 BUG_ON(this->base + this->size > next->base);
448 i++;
449 continue;
450 }
451
452 this->size += next->size;
Lin Fengc0232ae2013-01-11 14:31:44 -0800453 /* move forward from next + 1, index of which is i + 2 */
454 memmove(next, next + 1, (type->cnt - (i + 2)) * sizeof(*next));
Tejun Heo784656f92011-07-12 11:15:55 +0200455 type->cnt--;
456 }
457}
458
459/**
460 * memblock_insert_region - insert new memblock region
Tang Chen209ff862013-04-29 15:08:41 -0700461 * @type: memblock type to insert into
462 * @idx: index for the insertion point
463 * @base: base address of the new region
464 * @size: size of the new region
465 * @nid: node id of the new region
Tang Chen66a20752014-01-21 15:49:20 -0800466 * @flags: flags of the new region
Tejun Heo784656f92011-07-12 11:15:55 +0200467 *
468 * Insert new memblock region [@base,@base+@size) into @type at @idx.
Alexander Kuleshov412d0002016-08-04 15:31:46 -0700469 * @type must already have extra room to accommodate the new region.
Tejun Heo784656f92011-07-12 11:15:55 +0200470 */
471static void __init_memblock memblock_insert_region(struct memblock_type *type,
472 int idx, phys_addr_t base,
Tang Chen66a20752014-01-21 15:49:20 -0800473 phys_addr_t size,
474 int nid, unsigned long flags)
Tejun Heo784656f92011-07-12 11:15:55 +0200475{
476 struct memblock_region *rgn = &type->regions[idx];
477
478 BUG_ON(type->cnt >= type->max);
479 memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn));
480 rgn->base = base;
481 rgn->size = size;
Tang Chen66a20752014-01-21 15:49:20 -0800482 rgn->flags = flags;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200483 memblock_set_region_node(rgn, nid);
Tejun Heo784656f92011-07-12 11:15:55 +0200484 type->cnt++;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800485 type->total_size += size;
Tejun Heo784656f92011-07-12 11:15:55 +0200486}
487
488/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100489 * memblock_add_range - add new memblock region
Tejun Heo784656f92011-07-12 11:15:55 +0200490 * @type: memblock type to add new region into
491 * @base: base address of the new region
492 * @size: size of the new region
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800493 * @nid: nid of the new region
Tang Chen66a20752014-01-21 15:49:20 -0800494 * @flags: flags of the new region
Tejun Heo784656f92011-07-12 11:15:55 +0200495 *
496 * Add new memblock region [@base,@base+@size) into @type. The new region
497 * is allowed to overlap with existing ones - overlaps don't affect already
498 * existing regions. @type is guaranteed to be minimal (all neighbouring
499 * compatible regions are merged) after the addition.
500 *
501 * RETURNS:
502 * 0 on success, -errno on failure.
503 */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100504int __init_memblock memblock_add_range(struct memblock_type *type,
Tang Chen66a20752014-01-21 15:49:20 -0800505 phys_addr_t base, phys_addr_t size,
506 int nid, unsigned long flags)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000507{
Tejun Heo784656f92011-07-12 11:15:55 +0200508 bool insert = false;
Tejun Heoeb18f1b2011-12-08 10:22:07 -0800509 phys_addr_t obase = base;
510 phys_addr_t end = base + memblock_cap_size(base, &size);
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800511 int idx, nr_new;
512 struct memblock_region *rgn;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000513
Tejun Heob3dc6272012-04-20 08:31:34 -0700514 if (!size)
515 return 0;
516
Tejun Heo784656f92011-07-12 11:15:55 +0200517 /* special case for empty array */
518 if (type->regions[0].size == 0) {
Tejun Heo1440c4e2011-12-08 10:22:08 -0800519 WARN_ON(type->cnt != 1 || type->total_size);
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000520 type->regions[0].base = base;
521 type->regions[0].size = size;
Tang Chen66a20752014-01-21 15:49:20 -0800522 type->regions[0].flags = flags;
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800523 memblock_set_region_node(&type->regions[0], nid);
Tejun Heo1440c4e2011-12-08 10:22:08 -0800524 type->total_size = size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000525 return 0;
526 }
Tejun Heo784656f92011-07-12 11:15:55 +0200527repeat:
528 /*
529 * The following is executed twice. Once with %false @insert and
530 * then with %true. The first counts the number of regions needed
Alexander Kuleshov412d0002016-08-04 15:31:46 -0700531 * to accommodate the new area. The second actually inserts them.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700532 */
Tejun Heo784656f92011-07-12 11:15:55 +0200533 base = obase;
534 nr_new = 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000535
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800536 for_each_memblock_type(type, rgn) {
Tejun Heo784656f92011-07-12 11:15:55 +0200537 phys_addr_t rbase = rgn->base;
538 phys_addr_t rend = rbase + rgn->size;
539
540 if (rbase >= end)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000541 break;
Tejun Heo784656f92011-07-12 11:15:55 +0200542 if (rend <= base)
543 continue;
544 /*
545 * @rgn overlaps. If it separates the lower part of new
546 * area, insert that portion.
547 */
548 if (rbase > base) {
Wei Yangc0a29492015-09-04 15:47:38 -0700549#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
550 WARN_ON(nid != memblock_get_region_node(rgn));
551#endif
Wei Yang4fcab5f2015-09-08 14:59:53 -0700552 WARN_ON(flags != rgn->flags);
Tejun Heo784656f92011-07-12 11:15:55 +0200553 nr_new++;
554 if (insert)
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800555 memblock_insert_region(type, idx++, base,
Tang Chen66a20752014-01-21 15:49:20 -0800556 rbase - base, nid,
557 flags);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000558 }
Tejun Heo784656f92011-07-12 11:15:55 +0200559 /* area below @rend is dealt with, forget about it */
560 base = min(rend, end);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000561 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000562
Tejun Heo784656f92011-07-12 11:15:55 +0200563 /* insert the remaining portion */
564 if (base < end) {
565 nr_new++;
566 if (insert)
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800567 memblock_insert_region(type, idx, base, end - base,
Tang Chen66a20752014-01-21 15:49:20 -0800568 nid, flags);
Tejun Heo784656f92011-07-12 11:15:55 +0200569 }
570
nimisoloef3cc4d2016-07-26 15:24:56 -0700571 if (!nr_new)
572 return 0;
573
Tejun Heo784656f92011-07-12 11:15:55 +0200574 /*
575 * If this was the first round, resize array and repeat for actual
576 * insertions; otherwise, merge and return.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700577 */
Tejun Heo784656f92011-07-12 11:15:55 +0200578 if (!insert) {
579 while (type->cnt + nr_new > type->max)
Greg Pearson48c3b582012-06-20 12:53:05 -0700580 if (memblock_double_array(type, obase, size) < 0)
Tejun Heo784656f92011-07-12 11:15:55 +0200581 return -ENOMEM;
582 insert = true;
583 goto repeat;
584 } else {
585 memblock_merge_regions(type);
586 return 0;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700587 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000588}
589
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800590int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size,
591 int nid)
592{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100593 return memblock_add_range(&memblock.memory, base, size, nid, 0);
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800594}
595
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700596int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size)
Alexander Kuleshov6a4055b2015-04-15 16:14:44 -0700597{
Miles Chen5d63f812017-02-22 15:46:42 -0800598 phys_addr_t end = base + size - 1;
599
600 memblock_dbg("memblock_add: [%pa-%pa] %pF\n",
601 &base, &end, (void *)_RET_IP_);
Alexander Kuleshov6a4055b2015-04-15 16:14:44 -0700602
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700603 return memblock_add_range(&memblock.memory, base, size, MAX_NUMNODES, 0);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000604}
605
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800606/**
607 * memblock_isolate_range - isolate given range into disjoint memblocks
608 * @type: memblock type to isolate range for
609 * @base: base of range to isolate
610 * @size: size of range to isolate
611 * @start_rgn: out parameter for the start of isolated region
612 * @end_rgn: out parameter for the end of isolated region
613 *
614 * Walk @type and ensure that regions don't cross the boundaries defined by
615 * [@base,@base+@size). Crossing regions are split at the boundaries,
616 * which may create at most two more regions. The index of the first
617 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
618 *
619 * RETURNS:
620 * 0 on success, -errno on failure.
621 */
622static int __init_memblock memblock_isolate_range(struct memblock_type *type,
623 phys_addr_t base, phys_addr_t size,
624 int *start_rgn, int *end_rgn)
625{
Tejun Heoeb18f1b2011-12-08 10:22:07 -0800626 phys_addr_t end = base + memblock_cap_size(base, &size);
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800627 int idx;
628 struct memblock_region *rgn;
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800629
630 *start_rgn = *end_rgn = 0;
631
Tejun Heob3dc6272012-04-20 08:31:34 -0700632 if (!size)
633 return 0;
634
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800635 /* we'll create at most two more regions */
636 while (type->cnt + 2 > type->max)
Greg Pearson48c3b582012-06-20 12:53:05 -0700637 if (memblock_double_array(type, base, size) < 0)
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800638 return -ENOMEM;
639
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800640 for_each_memblock_type(type, rgn) {
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800641 phys_addr_t rbase = rgn->base;
642 phys_addr_t rend = rbase + rgn->size;
643
644 if (rbase >= end)
645 break;
646 if (rend <= base)
647 continue;
648
649 if (rbase < base) {
650 /*
651 * @rgn intersects from below. Split and continue
652 * to process the next region - the new top half.
653 */
654 rgn->base = base;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800655 rgn->size -= base - rbase;
656 type->total_size -= base - rbase;
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800657 memblock_insert_region(type, idx, rbase, base - rbase,
Tang Chen66a20752014-01-21 15:49:20 -0800658 memblock_get_region_node(rgn),
659 rgn->flags);
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800660 } else if (rend > end) {
661 /*
662 * @rgn intersects from above. Split and redo the
663 * current region - the new bottom half.
664 */
665 rgn->base = end;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800666 rgn->size -= end - rbase;
667 type->total_size -= end - rbase;
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800668 memblock_insert_region(type, idx--, rbase, end - rbase,
Tang Chen66a20752014-01-21 15:49:20 -0800669 memblock_get_region_node(rgn),
670 rgn->flags);
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800671 } else {
672 /* @rgn is fully contained, record it */
673 if (!*end_rgn)
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800674 *start_rgn = idx;
675 *end_rgn = idx + 1;
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800676 }
677 }
678
679 return 0;
680}
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800681
Alexander Kuleshov35bd16a2015-11-05 18:47:00 -0800682static int __init_memblock memblock_remove_range(struct memblock_type *type,
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100683 phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000684{
Tejun Heo71936182011-12-08 10:22:07 -0800685 int start_rgn, end_rgn;
686 int i, ret;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000687
Tejun Heo71936182011-12-08 10:22:07 -0800688 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
689 if (ret)
690 return ret;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000691
Tejun Heo71936182011-12-08 10:22:07 -0800692 for (i = end_rgn - 1; i >= start_rgn; i--)
693 memblock_remove_region(type, i);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700694 return 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000695}
696
Tejun Heo581adcb2011-12-08 10:22:06 -0800697int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000698{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100699 return memblock_remove_range(&memblock.memory, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000700}
701
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100702
Tejun Heo581adcb2011-12-08 10:22:06 -0800703int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000704{
Miles Chen5d63f812017-02-22 15:46:42 -0800705 phys_addr_t end = base + size - 1;
706
707 memblock_dbg(" memblock_free: [%pa-%pa] %pF\n",
708 &base, &end, (void *)_RET_IP_);
Tejun Heo24aa0782011-07-12 11:16:06 +0200709
Catalin Marinas9099dae2016-10-11 13:55:11 -0700710 kmemleak_free_part_phys(base, size);
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100711 return memblock_remove_range(&memblock.reserved, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000712}
713
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700714int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000715{
Miles Chen5d63f812017-02-22 15:46:42 -0800716 phys_addr_t end = base + size - 1;
717
718 memblock_dbg("memblock_reserve: [%pa-%pa] %pF\n",
719 &base, &end, (void *)_RET_IP_);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000720
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700721 return memblock_add_range(&memblock.reserved, base, size, MAX_NUMNODES, 0);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000722}
723
Tejun Heo35fd0802011-07-12 11:15:59 +0200724/**
Tang Chen66b16ed2014-01-21 15:49:23 -0800725 *
Tony Luck4308ce12014-12-12 16:54:59 -0800726 * This function isolates region [@base, @base + @size), and sets/clears flag
Tang Chen66b16ed2014-01-21 15:49:23 -0800727 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700728 * Return 0 on success, -errno on failure.
Tang Chen66b16ed2014-01-21 15:49:23 -0800729 */
Tony Luck4308ce12014-12-12 16:54:59 -0800730static int __init_memblock memblock_setclr_flag(phys_addr_t base,
731 phys_addr_t size, int set, int flag)
Tang Chen66b16ed2014-01-21 15:49:23 -0800732{
733 struct memblock_type *type = &memblock.memory;
734 int i, ret, start_rgn, end_rgn;
735
736 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
737 if (ret)
738 return ret;
739
740 for (i = start_rgn; i < end_rgn; i++)
Tony Luck4308ce12014-12-12 16:54:59 -0800741 if (set)
742 memblock_set_region_flags(&type->regions[i], flag);
743 else
744 memblock_clear_region_flags(&type->regions[i], flag);
Tang Chen66b16ed2014-01-21 15:49:23 -0800745
746 memblock_merge_regions(type);
747 return 0;
748}
749
750/**
Tony Luck4308ce12014-12-12 16:54:59 -0800751 * memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG.
752 * @base: the base phys addr of the region
753 * @size: the size of the region
754 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700755 * Return 0 on success, -errno on failure.
Tony Luck4308ce12014-12-12 16:54:59 -0800756 */
757int __init_memblock memblock_mark_hotplug(phys_addr_t base, phys_addr_t size)
758{
759 return memblock_setclr_flag(base, size, 1, MEMBLOCK_HOTPLUG);
760}
761
762/**
Tang Chen66b16ed2014-01-21 15:49:23 -0800763 * memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region.
764 * @base: the base phys addr of the region
765 * @size: the size of the region
766 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700767 * Return 0 on success, -errno on failure.
Tang Chen66b16ed2014-01-21 15:49:23 -0800768 */
769int __init_memblock memblock_clear_hotplug(phys_addr_t base, phys_addr_t size)
770{
Tony Luck4308ce12014-12-12 16:54:59 -0800771 return memblock_setclr_flag(base, size, 0, MEMBLOCK_HOTPLUG);
Tang Chen66b16ed2014-01-21 15:49:23 -0800772}
773
774/**
Tony Lucka3f5baf2015-06-24 16:58:12 -0700775 * memblock_mark_mirror - Mark mirrored memory with flag MEMBLOCK_MIRROR.
776 * @base: the base phys addr of the region
777 * @size: the size of the region
778 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700779 * Return 0 on success, -errno on failure.
Tony Lucka3f5baf2015-06-24 16:58:12 -0700780 */
781int __init_memblock memblock_mark_mirror(phys_addr_t base, phys_addr_t size)
782{
783 system_has_some_mirror = true;
784
785 return memblock_setclr_flag(base, size, 1, MEMBLOCK_MIRROR);
786}
787
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +0100788/**
789 * memblock_mark_nomap - Mark a memory region with flag MEMBLOCK_NOMAP.
790 * @base: the base phys addr of the region
791 * @size: the size of the region
792 *
793 * Return 0 on success, -errno on failure.
794 */
795int __init_memblock memblock_mark_nomap(phys_addr_t base, phys_addr_t size)
796{
797 return memblock_setclr_flag(base, size, 1, MEMBLOCK_NOMAP);
798}
Tony Lucka3f5baf2015-06-24 16:58:12 -0700799
800/**
AKASHI Takahiro4c546b82017-04-03 11:23:54 +0900801 * memblock_clear_nomap - Clear flag MEMBLOCK_NOMAP for a specified region.
802 * @base: the base phys addr of the region
803 * @size: the size of the region
804 *
805 * Return 0 on success, -errno on failure.
806 */
807int __init_memblock memblock_clear_nomap(phys_addr_t base, phys_addr_t size)
808{
809 return memblock_setclr_flag(base, size, 0, MEMBLOCK_NOMAP);
810}
811
812/**
Robin Holt8e7a7f82015-06-30 14:56:41 -0700813 * __next_reserved_mem_region - next function for for_each_reserved_region()
814 * @idx: pointer to u64 loop variable
815 * @out_start: ptr to phys_addr_t for start address of the region, can be %NULL
816 * @out_end: ptr to phys_addr_t for end address of the region, can be %NULL
817 *
818 * Iterate over all reserved memory regions.
819 */
820void __init_memblock __next_reserved_mem_region(u64 *idx,
821 phys_addr_t *out_start,
822 phys_addr_t *out_end)
823{
Alexander Kuleshov567d1172015-09-08 15:03:33 -0700824 struct memblock_type *type = &memblock.reserved;
Robin Holt8e7a7f82015-06-30 14:56:41 -0700825
Richard Leitnercd33a762016-05-20 16:58:33 -0700826 if (*idx < type->cnt) {
Alexander Kuleshov567d1172015-09-08 15:03:33 -0700827 struct memblock_region *r = &type->regions[*idx];
Robin Holt8e7a7f82015-06-30 14:56:41 -0700828 phys_addr_t base = r->base;
829 phys_addr_t size = r->size;
830
831 if (out_start)
832 *out_start = base;
833 if (out_end)
834 *out_end = base + size - 1;
835
836 *idx += 1;
837 return;
838 }
839
840 /* signal end of iteration */
841 *idx = ULLONG_MAX;
842}
843
844/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100845 * __next__mem_range - next function for for_each_free_mem_range() etc.
Tejun Heo35fd0802011-07-12 11:15:59 +0200846 * @idx: pointer to u64 loop variable
Grygorii Strashkob1154232014-01-21 15:50:16 -0800847 * @nid: node selector, %NUMA_NO_NODE for all nodes
Tony Luckfc6daaf2015-06-24 16:58:09 -0700848 * @flags: pick from blocks based on memory attributes
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100849 * @type_a: pointer to memblock_type from where the range is taken
850 * @type_b: pointer to memblock_type which excludes memory from being taken
Wanpeng Lidad75572012-06-20 12:53:01 -0700851 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
852 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
853 * @out_nid: ptr to int for nid of the range, can be %NULL
Tejun Heo35fd0802011-07-12 11:15:59 +0200854 *
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100855 * Find the first area from *@idx which matches @nid, fill the out
Tejun Heo35fd0802011-07-12 11:15:59 +0200856 * parameters, and update *@idx for the next iteration. The lower 32bit of
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100857 * *@idx contains index into type_a and the upper 32bit indexes the
858 * areas before each region in type_b. For example, if type_b regions
Tejun Heo35fd0802011-07-12 11:15:59 +0200859 * look like the following,
860 *
861 * 0:[0-16), 1:[32-48), 2:[128-130)
862 *
863 * The upper 32bit indexes the following regions.
864 *
865 * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX)
866 *
867 * As both region arrays are sorted, the function advances the two indices
868 * in lockstep and returns each intersection.
869 */
Tony Luckfc6daaf2015-06-24 16:58:09 -0700870void __init_memblock __next_mem_range(u64 *idx, int nid, ulong flags,
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100871 struct memblock_type *type_a,
872 struct memblock_type *type_b,
873 phys_addr_t *out_start,
874 phys_addr_t *out_end, int *out_nid)
Tejun Heo35fd0802011-07-12 11:15:59 +0200875{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100876 int idx_a = *idx & 0xffffffff;
877 int idx_b = *idx >> 32;
Grygorii Strashkob1154232014-01-21 15:50:16 -0800878
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100879 if (WARN_ONCE(nid == MAX_NUMNODES,
880 "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
Grygorii Strashko560dca272014-01-21 15:50:55 -0800881 nid = NUMA_NO_NODE;
Tejun Heo35fd0802011-07-12 11:15:59 +0200882
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100883 for (; idx_a < type_a->cnt; idx_a++) {
884 struct memblock_region *m = &type_a->regions[idx_a];
885
Tejun Heo35fd0802011-07-12 11:15:59 +0200886 phys_addr_t m_start = m->base;
887 phys_addr_t m_end = m->base + m->size;
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100888 int m_nid = memblock_get_region_node(m);
Tejun Heo35fd0802011-07-12 11:15:59 +0200889
890 /* only memory regions are associated with nodes, check it */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100891 if (nid != NUMA_NO_NODE && nid != m_nid)
Tejun Heo35fd0802011-07-12 11:15:59 +0200892 continue;
893
Xishi Qiu0a313a92014-09-09 14:50:46 -0700894 /* skip hotpluggable memory regions if needed */
895 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
896 continue;
897
Tony Lucka3f5baf2015-06-24 16:58:12 -0700898 /* if we want mirror memory skip non-mirror memory regions */
899 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
900 continue;
901
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +0100902 /* skip nomap memory unless we were asked for it explicitly */
903 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
904 continue;
905
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100906 if (!type_b) {
907 if (out_start)
908 *out_start = m_start;
909 if (out_end)
910 *out_end = m_end;
911 if (out_nid)
912 *out_nid = m_nid;
913 idx_a++;
914 *idx = (u32)idx_a | (u64)idx_b << 32;
915 return;
916 }
Tejun Heo35fd0802011-07-12 11:15:59 +0200917
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100918 /* scan areas before each reservation */
919 for (; idx_b < type_b->cnt + 1; idx_b++) {
920 struct memblock_region *r;
921 phys_addr_t r_start;
922 phys_addr_t r_end;
923
924 r = &type_b->regions[idx_b];
925 r_start = idx_b ? r[-1].base + r[-1].size : 0;
926 r_end = idx_b < type_b->cnt ?
927 r->base : ULLONG_MAX;
928
929 /*
930 * if idx_b advanced past idx_a,
931 * break out to advance idx_a
932 */
Tejun Heo35fd0802011-07-12 11:15:59 +0200933 if (r_start >= m_end)
934 break;
935 /* if the two regions intersect, we're done */
936 if (m_start < r_end) {
937 if (out_start)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100938 *out_start =
939 max(m_start, r_start);
Tejun Heo35fd0802011-07-12 11:15:59 +0200940 if (out_end)
941 *out_end = min(m_end, r_end);
942 if (out_nid)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100943 *out_nid = m_nid;
Tejun Heo35fd0802011-07-12 11:15:59 +0200944 /*
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100945 * The region which ends first is
946 * advanced for the next iteration.
Tejun Heo35fd0802011-07-12 11:15:59 +0200947 */
948 if (m_end <= r_end)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100949 idx_a++;
Tejun Heo35fd0802011-07-12 11:15:59 +0200950 else
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100951 idx_b++;
952 *idx = (u32)idx_a | (u64)idx_b << 32;
Tejun Heo35fd0802011-07-12 11:15:59 +0200953 return;
954 }
955 }
956 }
957
958 /* signal end of iteration */
959 *idx = ULLONG_MAX;
960}
961
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800962/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100963 * __next_mem_range_rev - generic next function for for_each_*_range_rev()
964 *
965 * Finds the next range from type_a which is not marked as unsuitable
966 * in type_b.
967 *
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800968 * @idx: pointer to u64 loop variable
Alexander Kuleshovad5ea8c2015-09-08 15:04:22 -0700969 * @nid: node selector, %NUMA_NO_NODE for all nodes
Tony Luckfc6daaf2015-06-24 16:58:09 -0700970 * @flags: pick from blocks based on memory attributes
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100971 * @type_a: pointer to memblock_type from where the range is taken
972 * @type_b: pointer to memblock_type which excludes memory from being taken
Wanpeng Lidad75572012-06-20 12:53:01 -0700973 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
974 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
975 * @out_nid: ptr to int for nid of the range, can be %NULL
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800976 *
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100977 * Reverse of __next_mem_range().
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800978 */
Tony Luckfc6daaf2015-06-24 16:58:09 -0700979void __init_memblock __next_mem_range_rev(u64 *idx, int nid, ulong flags,
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100980 struct memblock_type *type_a,
981 struct memblock_type *type_b,
982 phys_addr_t *out_start,
983 phys_addr_t *out_end, int *out_nid)
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800984{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100985 int idx_a = *idx & 0xffffffff;
986 int idx_b = *idx >> 32;
Grygorii Strashkob1154232014-01-21 15:50:16 -0800987
Grygorii Strashko560dca272014-01-21 15:50:55 -0800988 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
989 nid = NUMA_NO_NODE;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800990
991 if (*idx == (u64)ULLONG_MAX) {
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100992 idx_a = type_a->cnt - 1;
zijun_hue47608a2016-08-04 15:32:00 -0700993 if (type_b != NULL)
994 idx_b = type_b->cnt;
995 else
996 idx_b = 0;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800997 }
998
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100999 for (; idx_a >= 0; idx_a--) {
1000 struct memblock_region *m = &type_a->regions[idx_a];
1001
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001002 phys_addr_t m_start = m->base;
1003 phys_addr_t m_end = m->base + m->size;
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001004 int m_nid = memblock_get_region_node(m);
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001005
1006 /* only memory regions are associated with nodes, check it */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001007 if (nid != NUMA_NO_NODE && nid != m_nid)
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001008 continue;
1009
Tang Chen55ac5902014-01-21 15:49:35 -08001010 /* skip hotpluggable memory regions if needed */
1011 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
1012 continue;
1013
Tony Lucka3f5baf2015-06-24 16:58:12 -07001014 /* if we want mirror memory skip non-mirror memory regions */
1015 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
1016 continue;
1017
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +01001018 /* skip nomap memory unless we were asked for it explicitly */
1019 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
1020 continue;
1021
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001022 if (!type_b) {
1023 if (out_start)
1024 *out_start = m_start;
1025 if (out_end)
1026 *out_end = m_end;
1027 if (out_nid)
1028 *out_nid = m_nid;
zijun_hufb399b42016-07-28 15:48:56 -07001029 idx_a--;
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001030 *idx = (u32)idx_a | (u64)idx_b << 32;
1031 return;
1032 }
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001033
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001034 /* scan areas before each reservation */
1035 for (; idx_b >= 0; idx_b--) {
1036 struct memblock_region *r;
1037 phys_addr_t r_start;
1038 phys_addr_t r_end;
1039
1040 r = &type_b->regions[idx_b];
1041 r_start = idx_b ? r[-1].base + r[-1].size : 0;
1042 r_end = idx_b < type_b->cnt ?
1043 r->base : ULLONG_MAX;
1044 /*
1045 * if idx_b advanced past idx_a,
1046 * break out to advance idx_a
1047 */
1048
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001049 if (r_end <= m_start)
1050 break;
1051 /* if the two regions intersect, we're done */
1052 if (m_end > r_start) {
1053 if (out_start)
1054 *out_start = max(m_start, r_start);
1055 if (out_end)
1056 *out_end = min(m_end, r_end);
1057 if (out_nid)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001058 *out_nid = m_nid;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001059 if (m_start >= r_start)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001060 idx_a--;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001061 else
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001062 idx_b--;
1063 *idx = (u32)idx_a | (u64)idx_b << 32;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001064 return;
1065 }
1066 }
1067 }
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001068 /* signal end of iteration */
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001069 *idx = ULLONG_MAX;
1070}
1071
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001072#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1073/*
1074 * Common iterator interface used to define for_each_mem_range().
1075 */
1076void __init_memblock __next_mem_pfn_range(int *idx, int nid,
1077 unsigned long *out_start_pfn,
1078 unsigned long *out_end_pfn, int *out_nid)
1079{
1080 struct memblock_type *type = &memblock.memory;
1081 struct memblock_region *r;
1082
1083 while (++*idx < type->cnt) {
1084 r = &type->regions[*idx];
1085
1086 if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size))
1087 continue;
1088 if (nid == MAX_NUMNODES || nid == r->nid)
1089 break;
1090 }
1091 if (*idx >= type->cnt) {
1092 *idx = -1;
1093 return;
1094 }
1095
1096 if (out_start_pfn)
1097 *out_start_pfn = PFN_UP(r->base);
1098 if (out_end_pfn)
1099 *out_end_pfn = PFN_DOWN(r->base + r->size);
1100 if (out_nid)
1101 *out_nid = r->nid;
1102}
1103
Paul Burtonb92df1d2017-02-22 15:44:53 -08001104unsigned long __init_memblock memblock_next_valid_pfn(unsigned long pfn,
1105 unsigned long max_pfn)
1106{
1107 struct memblock_type *type = &memblock.memory;
1108 unsigned int right = type->cnt;
1109 unsigned int mid, left = 0;
1110 phys_addr_t addr = PFN_PHYS(pfn + 1);
1111
1112 do {
1113 mid = (right + left) / 2;
1114
1115 if (addr < type->regions[mid].base)
1116 right = mid;
1117 else if (addr >= (type->regions[mid].base +
1118 type->regions[mid].size))
1119 left = mid + 1;
1120 else {
1121 /* addr is within the region, so pfn + 1 is valid */
1122 return min(pfn + 1, max_pfn);
1123 }
1124 } while (left < right);
1125
AKASHI Takahiroc9a1b802017-03-09 16:17:17 -08001126 if (right == type->cnt)
1127 return max_pfn;
1128 else
1129 return min(PHYS_PFN(type->regions[right].base), max_pfn);
Paul Burtonb92df1d2017-02-22 15:44:53 -08001130}
1131
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001132/**
1133 * memblock_set_node - set node ID on memblock regions
1134 * @base: base of area to set node ID for
1135 * @size: size of area to set node ID for
Tang Chene7e8de52014-01-21 15:49:26 -08001136 * @type: memblock type to set node ID for
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001137 * @nid: node ID to set
1138 *
Tang Chene7e8de52014-01-21 15:49:26 -08001139 * Set the nid of memblock @type regions in [@base,@base+@size) to @nid.
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001140 * Regions which cross the area boundaries are split as necessary.
1141 *
1142 * RETURNS:
1143 * 0 on success, -errno on failure.
1144 */
1145int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size,
Tang Chene7e8de52014-01-21 15:49:26 -08001146 struct memblock_type *type, int nid)
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001147{
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001148 int start_rgn, end_rgn;
1149 int i, ret;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001150
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001151 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
1152 if (ret)
1153 return ret;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001154
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001155 for (i = start_rgn; i < end_rgn; i++)
Wanpeng Lie9d24ad2012-10-08 16:32:21 -07001156 memblock_set_region_node(&type->regions[i], nid);
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001157
1158 memblock_merge_regions(type);
1159 return 0;
1160}
1161#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
1162
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001163static phys_addr_t __init memblock_alloc_range_nid(phys_addr_t size,
1164 phys_addr_t align, phys_addr_t start,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001165 phys_addr_t end, int nid, ulong flags)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001166{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001167 phys_addr_t found;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001168
Grygorii Strashko79f40fa2014-01-21 15:50:12 -08001169 if (!align)
1170 align = SMP_CACHE_BYTES;
Vineet Gupta94f3d3a2013-04-29 15:06:15 -07001171
Tony Luckfc6daaf2015-06-24 16:58:09 -07001172 found = memblock_find_in_range_node(size, align, start, end, nid,
1173 flags);
Catalin Marinasaedf95e2014-06-06 14:38:20 -07001174 if (found && !memblock_reserve(found, size)) {
1175 /*
1176 * The min_count is set to 0 so that memblock allocations are
1177 * never reported as leaks.
1178 */
Catalin Marinas9099dae2016-10-11 13:55:11 -07001179 kmemleak_alloc_phys(found, size, 0, 0);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001180 return found;
Catalin Marinasaedf95e2014-06-06 14:38:20 -07001181 }
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001182 return 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001183}
1184
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001185phys_addr_t __init memblock_alloc_range(phys_addr_t size, phys_addr_t align,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001186 phys_addr_t start, phys_addr_t end,
1187 ulong flags)
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001188{
Tony Luckfc6daaf2015-06-24 16:58:09 -07001189 return memblock_alloc_range_nid(size, align, start, end, NUMA_NO_NODE,
1190 flags);
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001191}
1192
1193static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size,
1194 phys_addr_t align, phys_addr_t max_addr,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001195 int nid, ulong flags)
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001196{
Tony Luckfc6daaf2015-06-24 16:58:09 -07001197 return memblock_alloc_range_nid(size, align, 0, max_addr, nid, flags);
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001198}
1199
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001200phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid)
1201{
Tony Lucka3f5baf2015-06-24 16:58:12 -07001202 ulong flags = choose_memblock_flags();
1203 phys_addr_t ret;
1204
1205again:
1206 ret = memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE,
1207 nid, flags);
1208
1209 if (!ret && (flags & MEMBLOCK_MIRROR)) {
1210 flags &= ~MEMBLOCK_MIRROR;
1211 goto again;
1212 }
1213 return ret;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001214}
1215
1216phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
1217{
Tony Luckfc6daaf2015-06-24 16:58:09 -07001218 return memblock_alloc_base_nid(size, align, max_addr, NUMA_NO_NODE,
1219 MEMBLOCK_NONE);
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001220}
1221
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001222phys_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 +10001223{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001224 phys_addr_t alloc;
1225
1226 alloc = __memblock_alloc_base(size, align, max_addr);
1227
1228 if (alloc == 0)
Miles Chen5d63f812017-02-22 15:46:42 -08001229 panic("ERROR: Failed to allocate %pa bytes below %pa.\n",
1230 &size, &max_addr);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001231
1232 return alloc;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001233}
1234
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001235phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001236{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001237 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001238}
1239
Benjamin Herrenschmidt9d1e2492010-07-06 15:39:17 -07001240phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid)
1241{
1242 phys_addr_t res = memblock_alloc_nid(size, align, nid);
1243
1244 if (res)
1245 return res;
Tejun Heo15fb0972011-07-12 09:58:07 +02001246 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001247}
1248
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001249/**
1250 * memblock_virt_alloc_internal - allocate boot memory block
1251 * @size: size of memory block to be allocated in bytes
1252 * @align: alignment of the region and block's size
1253 * @min_addr: the lower bound of the memory region to allocate (phys address)
1254 * @max_addr: the upper bound of the memory region to allocate (phys address)
1255 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1256 *
1257 * The @min_addr limit is dropped if it can not be satisfied and the allocation
1258 * will fall back to memory below @min_addr. Also, allocation may fall back
1259 * to any node in the system if the specified node can not
1260 * hold the requested memory.
1261 *
1262 * The allocation is performed from memory region limited by
1263 * memblock.current_limit if @max_addr == %BOOTMEM_ALLOC_ACCESSIBLE.
1264 *
1265 * The memory block is aligned on SMP_CACHE_BYTES if @align == 0.
1266 *
1267 * The phys address of allocated boot memory block is converted to virtual and
1268 * allocated memory is reset to 0.
1269 *
1270 * In addition, function sets the min_count to 0 using kmemleak_alloc for
1271 * allocated boot memory block, so that it is never reported as leaks.
1272 *
1273 * RETURNS:
1274 * Virtual address of allocated memory block on success, NULL on failure.
1275 */
1276static void * __init memblock_virt_alloc_internal(
1277 phys_addr_t size, phys_addr_t align,
1278 phys_addr_t min_addr, phys_addr_t max_addr,
1279 int nid)
1280{
1281 phys_addr_t alloc;
1282 void *ptr;
Tony Lucka3f5baf2015-06-24 16:58:12 -07001283 ulong flags = choose_memblock_flags();
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001284
Grygorii Strashko560dca272014-01-21 15:50:55 -08001285 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
1286 nid = NUMA_NO_NODE;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001287
1288 /*
1289 * Detect any accidental use of these APIs after slab is ready, as at
1290 * this moment memblock may be deinitialized already and its
1291 * internal data may be destroyed (after execution of free_all_bootmem)
1292 */
1293 if (WARN_ON_ONCE(slab_is_available()))
1294 return kzalloc_node(size, GFP_NOWAIT, nid);
1295
1296 if (!align)
1297 align = SMP_CACHE_BYTES;
1298
Yinghai Luf544e142014-01-29 14:05:52 -08001299 if (max_addr > memblock.current_limit)
1300 max_addr = memblock.current_limit;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001301again:
1302 alloc = memblock_find_in_range_node(size, align, min_addr, max_addr,
Tony Lucka3f5baf2015-06-24 16:58:12 -07001303 nid, flags);
Wei Yang7d41c032017-02-22 15:45:07 -08001304 if (alloc && !memblock_reserve(alloc, size))
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001305 goto done;
1306
1307 if (nid != NUMA_NO_NODE) {
1308 alloc = memblock_find_in_range_node(size, align, min_addr,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001309 max_addr, NUMA_NO_NODE,
Tony Lucka3f5baf2015-06-24 16:58:12 -07001310 flags);
Wei Yang7d41c032017-02-22 15:45:07 -08001311 if (alloc && !memblock_reserve(alloc, size))
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001312 goto done;
1313 }
1314
1315 if (min_addr) {
1316 min_addr = 0;
1317 goto again;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001318 }
1319
Tony Lucka3f5baf2015-06-24 16:58:12 -07001320 if (flags & MEMBLOCK_MIRROR) {
1321 flags &= ~MEMBLOCK_MIRROR;
1322 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
1323 &size);
1324 goto again;
1325 }
1326
1327 return NULL;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001328done:
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001329 ptr = phys_to_virt(alloc);
1330 memset(ptr, 0, size);
1331
1332 /*
1333 * The min_count is set to 0 so that bootmem allocated blocks
1334 * are never reported as leaks. This is because many of these blocks
1335 * are only referred via the physical address which is not
1336 * looked up by kmemleak.
1337 */
1338 kmemleak_alloc(ptr, size, 0, 0);
1339
1340 return ptr;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001341}
1342
1343/**
1344 * memblock_virt_alloc_try_nid_nopanic - allocate boot memory block
1345 * @size: size of memory block to be allocated in bytes
1346 * @align: alignment of the region and block's size
1347 * @min_addr: the lower bound of the memory region from where the allocation
1348 * is preferred (phys address)
1349 * @max_addr: the upper bound of the memory region from where the allocation
1350 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1351 * allocate only from memory limited by memblock.current_limit value
1352 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1353 *
1354 * Public version of _memblock_virt_alloc_try_nid_nopanic() which provides
1355 * additional debug information (including caller info), if enabled.
1356 *
1357 * RETURNS:
1358 * Virtual address of allocated memory block on success, NULL on failure.
1359 */
1360void * __init memblock_virt_alloc_try_nid_nopanic(
1361 phys_addr_t size, phys_addr_t align,
1362 phys_addr_t min_addr, phys_addr_t max_addr,
1363 int nid)
1364{
1365 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1366 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1367 (u64)max_addr, (void *)_RET_IP_);
1368 return memblock_virt_alloc_internal(size, align, min_addr,
1369 max_addr, nid);
1370}
1371
1372/**
1373 * memblock_virt_alloc_try_nid - allocate boot memory block with panicking
1374 * @size: size of memory block to be allocated in bytes
1375 * @align: alignment of the region and block's size
1376 * @min_addr: the lower bound of the memory region from where the allocation
1377 * is preferred (phys address)
1378 * @max_addr: the upper bound of the memory region from where the allocation
1379 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1380 * allocate only from memory limited by memblock.current_limit value
1381 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1382 *
1383 * Public panicking version of _memblock_virt_alloc_try_nid_nopanic()
1384 * which provides debug information (including caller info), if enabled,
1385 * and panics if the request can not be satisfied.
1386 *
1387 * RETURNS:
1388 * Virtual address of allocated memory block on success, NULL on failure.
1389 */
1390void * __init memblock_virt_alloc_try_nid(
1391 phys_addr_t size, phys_addr_t align,
1392 phys_addr_t min_addr, phys_addr_t max_addr,
1393 int nid)
1394{
1395 void *ptr;
1396
1397 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1398 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1399 (u64)max_addr, (void *)_RET_IP_);
1400 ptr = memblock_virt_alloc_internal(size, align,
1401 min_addr, max_addr, nid);
1402 if (ptr)
1403 return ptr;
1404
1405 panic("%s: Failed to allocate %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx\n",
1406 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1407 (u64)max_addr);
1408 return NULL;
1409}
1410
1411/**
1412 * __memblock_free_early - free boot memory block
1413 * @base: phys starting address of the boot memory block
1414 * @size: size of the boot memory block in bytes
1415 *
1416 * Free boot memory block previously allocated by memblock_virt_alloc_xx() API.
1417 * The freeing memory will not be released to the buddy allocator.
1418 */
1419void __init __memblock_free_early(phys_addr_t base, phys_addr_t size)
1420{
1421 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1422 __func__, (u64)base, (u64)base + size - 1,
1423 (void *)_RET_IP_);
Catalin Marinas9099dae2016-10-11 13:55:11 -07001424 kmemleak_free_part_phys(base, size);
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001425 memblock_remove_range(&memblock.reserved, base, size);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001426}
1427
1428/*
1429 * __memblock_free_late - free bootmem block pages directly to buddy allocator
1430 * @addr: phys starting address of the boot memory block
1431 * @size: size of the boot memory block in bytes
1432 *
1433 * This is only useful when the bootmem allocator has already been torn
1434 * down, but we are still initializing the system. Pages are released directly
1435 * to the buddy allocator, no bootmem metadata is updated because it is gone.
1436 */
1437void __init __memblock_free_late(phys_addr_t base, phys_addr_t size)
1438{
1439 u64 cursor, end;
1440
1441 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1442 __func__, (u64)base, (u64)base + size - 1,
1443 (void *)_RET_IP_);
Catalin Marinas9099dae2016-10-11 13:55:11 -07001444 kmemleak_free_part_phys(base, size);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001445 cursor = PFN_UP(base);
1446 end = PFN_DOWN(base + size);
1447
1448 for (; cursor < end; cursor++) {
Mel Gormand70ddd72015-06-30 14:56:52 -07001449 __free_pages_bootmem(pfn_to_page(cursor), cursor, 0);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001450 totalram_pages++;
1451 }
1452}
Benjamin Herrenschmidt9d1e2492010-07-06 15:39:17 -07001453
1454/*
1455 * Remaining API functions
1456 */
1457
David Gibson1f1ffb8a2016-02-05 15:36:19 -08001458phys_addr_t __init_memblock memblock_phys_mem_size(void)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001459{
Tejun Heo1440c4e2011-12-08 10:22:08 -08001460 return memblock.memory.total_size;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001461}
1462
Srikar Dronamraju8907de52016-10-07 16:59:18 -07001463phys_addr_t __init_memblock memblock_reserved_size(void)
1464{
1465 return memblock.reserved.total_size;
1466}
1467
Yinghai Lu595ad9a2013-01-24 12:20:09 -08001468phys_addr_t __init memblock_mem_size(unsigned long limit_pfn)
1469{
1470 unsigned long pages = 0;
1471 struct memblock_region *r;
1472 unsigned long start_pfn, end_pfn;
1473
1474 for_each_memblock(memory, r) {
1475 start_pfn = memblock_region_memory_base_pfn(r);
1476 end_pfn = memblock_region_memory_end_pfn(r);
1477 start_pfn = min_t(unsigned long, start_pfn, limit_pfn);
1478 end_pfn = min_t(unsigned long, end_pfn, limit_pfn);
1479 pages += end_pfn - start_pfn;
1480 }
1481
Fabian Frederick16763232014-04-07 15:37:53 -07001482 return PFN_PHYS(pages);
Yinghai Lu595ad9a2013-01-24 12:20:09 -08001483}
1484
Sam Ravnborg0a93ebe2011-10-31 17:08:16 -07001485/* lowest address */
1486phys_addr_t __init_memblock memblock_start_of_DRAM(void)
1487{
1488 return memblock.memory.regions[0].base;
1489}
1490
Yinghai Lu10d06432010-07-28 15:43:02 +10001491phys_addr_t __init_memblock memblock_end_of_DRAM(void)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001492{
1493 int idx = memblock.memory.cnt - 1;
1494
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +10001495 return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001496}
1497
Dennis Chena571d4e2016-07-28 15:48:26 -07001498static phys_addr_t __init_memblock __find_max_addr(phys_addr_t limit)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001499{
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001500 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
Emil Medve136199f2014-04-07 15:37:52 -07001501 struct memblock_region *r;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001502
Dennis Chena571d4e2016-07-28 15:48:26 -07001503 /*
1504 * translate the memory @limit size into the max address within one of
1505 * the memory memblock regions, if the @limit exceeds the total size
1506 * of those regions, max_addr will keep original value ULLONG_MAX
1507 */
Emil Medve136199f2014-04-07 15:37:52 -07001508 for_each_memblock(memory, r) {
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001509 if (limit <= r->size) {
1510 max_addr = r->base + limit;
1511 break;
1512 }
1513 limit -= r->size;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001514 }
1515
Dennis Chena571d4e2016-07-28 15:48:26 -07001516 return max_addr;
1517}
1518
1519void __init memblock_enforce_memory_limit(phys_addr_t limit)
1520{
1521 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
1522
1523 if (!limit)
1524 return;
1525
1526 max_addr = __find_max_addr(limit);
1527
1528 /* @limit exceeds the total size of the memory, do nothing */
1529 if (max_addr == (phys_addr_t)ULLONG_MAX)
1530 return;
1531
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001532 /* truncate both memory and reserved regions */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001533 memblock_remove_range(&memblock.memory, max_addr,
1534 (phys_addr_t)ULLONG_MAX);
1535 memblock_remove_range(&memblock.reserved, max_addr,
1536 (phys_addr_t)ULLONG_MAX);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001537}
1538
AKASHI Takahiroc9ca9b42017-04-03 11:23:55 +09001539void __init memblock_cap_memory_range(phys_addr_t base, phys_addr_t size)
1540{
1541 int start_rgn, end_rgn;
1542 int i, ret;
1543
1544 if (!size)
1545 return;
1546
1547 ret = memblock_isolate_range(&memblock.memory, base, size,
1548 &start_rgn, &end_rgn);
1549 if (ret)
1550 return;
1551
1552 /* remove all the MAP regions */
1553 for (i = memblock.memory.cnt - 1; i >= end_rgn; i--)
1554 if (!memblock_is_nomap(&memblock.memory.regions[i]))
1555 memblock_remove_region(&memblock.memory, i);
1556
1557 for (i = start_rgn - 1; i >= 0; i--)
1558 if (!memblock_is_nomap(&memblock.memory.regions[i]))
1559 memblock_remove_region(&memblock.memory, i);
1560
1561 /* truncate the reserved regions */
1562 memblock_remove_range(&memblock.reserved, 0, base);
1563 memblock_remove_range(&memblock.reserved,
1564 base + size, (phys_addr_t)ULLONG_MAX);
1565}
1566
Dennis Chena571d4e2016-07-28 15:48:26 -07001567void __init memblock_mem_limit_remove_map(phys_addr_t limit)
1568{
Dennis Chena571d4e2016-07-28 15:48:26 -07001569 phys_addr_t max_addr;
Dennis Chena571d4e2016-07-28 15:48:26 -07001570
1571 if (!limit)
1572 return;
1573
1574 max_addr = __find_max_addr(limit);
1575
1576 /* @limit exceeds the total size of the memory, do nothing */
1577 if (max_addr == (phys_addr_t)ULLONG_MAX)
1578 return;
1579
AKASHI Takahiroc9ca9b42017-04-03 11:23:55 +09001580 memblock_cap_memory_range(0, max_addr);
Dennis Chena571d4e2016-07-28 15:48:26 -07001581}
1582
Yinghai Lucd794812010-10-11 12:34:09 -07001583static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001584{
1585 unsigned int left = 0, right = type->cnt;
1586
1587 do {
1588 unsigned int mid = (right + left) / 2;
1589
1590 if (addr < type->regions[mid].base)
1591 right = mid;
1592 else if (addr >= (type->regions[mid].base +
1593 type->regions[mid].size))
1594 left = mid + 1;
1595 else
1596 return mid;
1597 } while (left < right);
1598 return -1;
1599}
1600
Yaowei Baib4ad0c72016-01-14 15:18:54 -08001601bool __init memblock_is_reserved(phys_addr_t addr)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001602{
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001603 return memblock_search(&memblock.reserved, addr) != -1;
1604}
Yinghai Lu95f72d12010-07-12 14:36:09 +10001605
Yaowei Baib4ad0c72016-01-14 15:18:54 -08001606bool __init_memblock memblock_is_memory(phys_addr_t addr)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001607{
1608 return memblock_search(&memblock.memory, addr) != -1;
1609}
1610
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +01001611int __init_memblock memblock_is_map_memory(phys_addr_t addr)
1612{
1613 int i = memblock_search(&memblock.memory, addr);
1614
1615 if (i == -1)
1616 return false;
1617 return !memblock_is_nomap(&memblock.memory.regions[i]);
1618}
1619
Yinghai Lue76b63f2013-09-11 14:22:17 -07001620#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1621int __init_memblock memblock_search_pfn_nid(unsigned long pfn,
1622 unsigned long *start_pfn, unsigned long *end_pfn)
1623{
1624 struct memblock_type *type = &memblock.memory;
Fabian Frederick16763232014-04-07 15:37:53 -07001625 int mid = memblock_search(type, PFN_PHYS(pfn));
Yinghai Lue76b63f2013-09-11 14:22:17 -07001626
1627 if (mid == -1)
1628 return -1;
1629
Fabian Frederickf7e2f7e2014-06-04 16:07:51 -07001630 *start_pfn = PFN_DOWN(type->regions[mid].base);
1631 *end_pfn = PFN_DOWN(type->regions[mid].base + type->regions[mid].size);
Yinghai Lue76b63f2013-09-11 14:22:17 -07001632
1633 return type->regions[mid].nid;
1634}
1635#endif
1636
Stephen Boydeab30942012-05-24 00:45:21 -07001637/**
1638 * memblock_is_region_memory - check if a region is a subset of memory
1639 * @base: base of region to check
1640 * @size: size of region to check
1641 *
1642 * Check if the region [@base, @base+@size) is a subset of a memory block.
1643 *
1644 * RETURNS:
1645 * 0 if false, non-zero if true
1646 */
Yinghai Lu3661ca62010-09-15 13:05:29 -07001647int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001648{
Tomi Valkeinenabb65272011-01-20 14:44:20 -08001649 int idx = memblock_search(&memblock.memory, base);
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001650 phys_addr_t end = base + memblock_cap_size(base, &size);
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001651
1652 if (idx == -1)
1653 return 0;
Wei Yangef415ef2017-02-22 15:45:04 -08001654 return (memblock.memory.regions[idx].base +
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001655 memblock.memory.regions[idx].size) >= end;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001656}
1657
Stephen Boydeab30942012-05-24 00:45:21 -07001658/**
1659 * memblock_is_region_reserved - check if a region intersects reserved memory
1660 * @base: base of region to check
1661 * @size: size of region to check
1662 *
1663 * Check if the region [@base, @base+@size) intersects a reserved memory block.
1664 *
1665 * RETURNS:
Tang Chenc5c5c9d2015-09-08 15:02:00 -07001666 * True if they intersect, false if not.
Stephen Boydeab30942012-05-24 00:45:21 -07001667 */
Tang Chenc5c5c9d2015-09-08 15:02:00 -07001668bool __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001669{
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001670 memblock_cap_size(base, &size);
Tang Chenc5c5c9d2015-09-08 15:02:00 -07001671 return memblock_overlaps_region(&memblock.reserved, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001672}
1673
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001674void __init_memblock memblock_trim_memory(phys_addr_t align)
1675{
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001676 phys_addr_t start, end, orig_start, orig_end;
Emil Medve136199f2014-04-07 15:37:52 -07001677 struct memblock_region *r;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001678
Emil Medve136199f2014-04-07 15:37:52 -07001679 for_each_memblock(memory, r) {
1680 orig_start = r->base;
1681 orig_end = r->base + r->size;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001682 start = round_up(orig_start, align);
1683 end = round_down(orig_end, align);
1684
1685 if (start == orig_start && end == orig_end)
1686 continue;
1687
1688 if (start < end) {
Emil Medve136199f2014-04-07 15:37:52 -07001689 r->base = start;
1690 r->size = end - start;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001691 } else {
Emil Medve136199f2014-04-07 15:37:52 -07001692 memblock_remove_region(&memblock.memory,
1693 r - memblock.memory.regions);
1694 r--;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001695 }
1696 }
1697}
Benjamin Herrenschmidte63075a2010-07-06 15:39:01 -07001698
Yinghai Lu3661ca62010-09-15 13:05:29 -07001699void __init_memblock memblock_set_current_limit(phys_addr_t limit)
Benjamin Herrenschmidte63075a2010-07-06 15:39:01 -07001700{
1701 memblock.current_limit = limit;
1702}
1703
Laura Abbottfec51012014-02-27 01:23:43 +01001704phys_addr_t __init_memblock memblock_get_current_limit(void)
1705{
1706 return memblock.current_limit;
1707}
1708
Heiko Carstens0262d9c2017-02-24 14:55:59 -08001709static void __init_memblock memblock_dump(struct memblock_type *type)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001710{
Miles Chen5d63f812017-02-22 15:46:42 -08001711 phys_addr_t base, end, size;
Tang Chen66a20752014-01-21 15:49:20 -08001712 unsigned long flags;
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -08001713 int idx;
1714 struct memblock_region *rgn;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001715
Heiko Carstens0262d9c2017-02-24 14:55:59 -08001716 pr_info(" %s.cnt = 0x%lx\n", type->name, type->cnt);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001717
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -08001718 for_each_memblock_type(type, rgn) {
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001719 char nid_buf[32] = "";
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001720
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001721 base = rgn->base;
1722 size = rgn->size;
Miles Chen5d63f812017-02-22 15:46:42 -08001723 end = base + size - 1;
Tang Chen66a20752014-01-21 15:49:20 -08001724 flags = rgn->flags;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001725#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1726 if (memblock_get_region_node(rgn) != MAX_NUMNODES)
1727 snprintf(nid_buf, sizeof(nid_buf), " on node %d",
1728 memblock_get_region_node(rgn));
1729#endif
Miles Chen5d63f812017-02-22 15:46:42 -08001730 pr_info(" %s[%#x]\t[%pa-%pa], %pa bytes%s flags: %#lx\n",
Heiko Carstens0262d9c2017-02-24 14:55:59 -08001731 type->name, idx, &base, &end, &size, nid_buf, flags);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001732 }
1733}
1734
Michal Hocko864b9a32017-06-02 14:46:49 -07001735extern unsigned long __init_memblock
1736memblock_reserved_memory_within(phys_addr_t start_addr, phys_addr_t end_addr)
1737{
1738 struct memblock_region *rgn;
1739 unsigned long size = 0;
1740 int idx;
1741
1742 for_each_memblock_type((&memblock.reserved), rgn) {
1743 phys_addr_t start, end;
1744
1745 if (rgn->base + rgn->size < start_addr)
1746 continue;
1747 if (rgn->base > end_addr)
1748 continue;
1749
1750 start = rgn->base;
1751 end = start + rgn->size;
1752 size += end - start;
1753 }
1754
1755 return size;
1756}
1757
Tejun Heo4ff7b822011-12-08 10:22:06 -08001758void __init_memblock __memblock_dump_all(void)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001759{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001760 pr_info("MEMBLOCK configuration:\n");
Miles Chen5d63f812017-02-22 15:46:42 -08001761 pr_info(" memory size = %pa reserved size = %pa\n",
1762 &memblock.memory.total_size,
1763 &memblock.reserved.total_size);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001764
Heiko Carstens0262d9c2017-02-24 14:55:59 -08001765 memblock_dump(&memblock.memory);
1766 memblock_dump(&memblock.reserved);
Heiko Carstens409efd42017-02-24 14:55:56 -08001767#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
Heiko Carstens0262d9c2017-02-24 14:55:59 -08001768 memblock_dump(&memblock.physmem);
Heiko Carstens409efd42017-02-24 14:55:56 -08001769#endif
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001770}
1771
Tejun Heo1aadc052011-12-08 10:22:08 -08001772void __init memblock_allow_resize(void)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001773{
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -07001774 memblock_can_resize = 1;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001775}
1776
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001777static int __init early_memblock(char *p)
1778{
1779 if (p && strstr(p, "debug"))
1780 memblock_debug = 1;
1781 return 0;
1782}
1783early_param("memblock", early_memblock);
1784
Tejun Heoc378ddd2011-07-14 11:46:03 +02001785#if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001786
1787static int memblock_debug_show(struct seq_file *m, void *private)
1788{
1789 struct memblock_type *type = m->private;
1790 struct memblock_region *reg;
1791 int i;
Miles Chen5d63f812017-02-22 15:46:42 -08001792 phys_addr_t end;
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001793
1794 for (i = 0; i < type->cnt; i++) {
1795 reg = &type->regions[i];
Miles Chen5d63f812017-02-22 15:46:42 -08001796 end = reg->base + reg->size - 1;
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001797
Miles Chen5d63f812017-02-22 15:46:42 -08001798 seq_printf(m, "%4d: ", i);
1799 seq_printf(m, "%pa..%pa\n", &reg->base, &end);
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001800 }
1801 return 0;
1802}
1803
1804static int memblock_debug_open(struct inode *inode, struct file *file)
1805{
1806 return single_open(file, memblock_debug_show, inode->i_private);
1807}
1808
1809static const struct file_operations memblock_debug_fops = {
1810 .open = memblock_debug_open,
1811 .read = seq_read,
1812 .llseek = seq_lseek,
1813 .release = single_release,
1814};
1815
1816static int __init memblock_init_debugfs(void)
1817{
1818 struct dentry *root = debugfs_create_dir("memblock", NULL);
1819 if (!root)
1820 return -ENXIO;
1821 debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops);
1822 debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops);
Philipp Hachtmann70210ed2014-01-29 18:16:01 +01001823#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
1824 debugfs_create_file("physmem", S_IRUGO, root, &memblock.physmem, &memblock_debug_fops);
1825#endif
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001826
1827 return 0;
1828}
1829__initcall(memblock_init_debugfs);
1830
1831#endif /* CONFIG_DEBUG_FS */