blob: 49b7c1ea2c1513d63e49ba386a8511bc79a31ede [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>
Shiraz Hashime1525702016-02-04 14:53:33 +053022#include <linux/preempt.h>
23#include <linux/seqlock.h>
Shiraz Hashim3eaf6e62016-04-16 11:43:02 +053024#include <linux/irqflags.h>
Yinghai Lu95f72d12010-07-12 14:36:09 +100025
Christoph Hellwigc4c5ad62016-07-28 15:48:06 -070026#include <asm/sections.h>
Santosh Shilimkar26f09e92014-01-21 15:50:19 -080027#include <linux/io.h>
28
29#include "internal.h"
Tang Chen79442ed2013-11-12 15:07:59 -080030
Tejun Heofe091c22011-12-08 10:22:07 -080031static struct memblock_region memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock;
32static struct memblock_region memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock;
Philipp Hachtmann70210ed2014-01-29 18:16:01 +010033#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
34static struct memblock_region memblock_physmem_init_regions[INIT_PHYSMEM_REGIONS] __initdata_memblock;
35#endif
Tejun Heofe091c22011-12-08 10:22:07 -080036
Shiraz Hashime1525702016-02-04 14:53:33 +053037static seqcount_t memblock_seq;
Tejun Heofe091c22011-12-08 10:22:07 -080038struct memblock memblock __initdata_memblock = {
39 .memory.regions = memblock_memory_init_regions,
40 .memory.cnt = 1, /* empty dummy entry */
41 .memory.max = INIT_MEMBLOCK_REGIONS,
42
43 .reserved.regions = memblock_reserved_init_regions,
44 .reserved.cnt = 1, /* empty dummy entry */
45 .reserved.max = INIT_MEMBLOCK_REGIONS,
46
Philipp Hachtmann70210ed2014-01-29 18:16:01 +010047#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
48 .physmem.regions = memblock_physmem_init_regions,
49 .physmem.cnt = 1, /* empty dummy entry */
50 .physmem.max = INIT_PHYSMEM_REGIONS,
51#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;
Tang Chen55ac5902014-01-21 15:49:35 -080058#ifdef CONFIG_MOVABLE_NODE
59bool movable_node_enabled __initdata_memblock = false;
60#endif
Tony Lucka3f5baf2015-06-24 16:58:12 -070061static bool system_has_some_mirror __initdata_memblock = false;
Tejun Heo1aadc052011-12-08 10:22:08 -080062static int memblock_can_resize __initdata_memblock;
Gavin Shan181eb392012-05-29 15:06:50 -070063static int memblock_memory_in_slab __initdata_memblock = 0;
64static int memblock_reserved_in_slab __initdata_memblock = 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +100065
Tony Lucka3f5baf2015-06-24 16:58:12 -070066ulong __init_memblock choose_memblock_flags(void)
67{
68 return system_has_some_mirror ? MEMBLOCK_MIRROR : MEMBLOCK_NONE;
69}
70
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -070071/* inline so we don't get a warning when pr_debug is compiled out */
Raghavendra D Prabhuc2233112012-10-08 16:33:55 -070072static __init_memblock const char *
73memblock_type_name(struct memblock_type *type)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -070074{
75 if (type == &memblock.memory)
76 return "memory";
77 else if (type == &memblock.reserved)
78 return "reserved";
79 else
80 return "unknown";
81}
82
Tejun Heoeb18f1b2011-12-08 10:22:07 -080083/* adjust *@size so that (@base + *@size) doesn't overflow, return new size */
84static inline phys_addr_t memblock_cap_size(phys_addr_t base, phys_addr_t *size)
85{
86 return *size = min(*size, (phys_addr_t)ULLONG_MAX - base);
87}
88
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100089/*
90 * Address comparison utilities
91 */
Yinghai Lu10d06432010-07-28 15:43:02 +100092static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1,
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +100093 phys_addr_t base2, phys_addr_t size2)
Yinghai Lu95f72d12010-07-12 14:36:09 +100094{
95 return ((base1 < (base2 + size2)) && (base2 < (base1 + size1)));
96}
97
Tang Chen95cf82e2015-09-08 15:02:03 -070098bool __init_memblock memblock_overlaps_region(struct memblock_type *type,
H Hartley Sweeten2d7d3eb2011-10-31 17:09:15 -070099 phys_addr_t base, phys_addr_t size)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000100{
101 unsigned long i;
102
Alexander Kuleshovf14516f2016-01-14 15:20:39 -0800103 for (i = 0; i < type->cnt; i++)
104 if (memblock_addrs_overlap(base, size, type->regions[i].base,
105 type->regions[i].size))
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000106 break;
Tang Chenc5c5c9d2015-09-08 15:02:00 -0700107 return i < type->cnt;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000108}
109
Tang Chen79442ed2013-11-12 15:07:59 -0800110/*
111 * __memblock_find_range_bottom_up - find free area utility in bottom-up
112 * @start: start of candidate range
113 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
114 * @size: size of free area to find
115 * @align: alignment of free area to find
Grygorii Strashkob1154232014-01-21 15:50:16 -0800116 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Tony Luckfc6daaf2015-06-24 16:58:09 -0700117 * @flags: pick from blocks based on memory attributes
Tang Chen79442ed2013-11-12 15:07:59 -0800118 *
119 * Utility called from memblock_find_in_range_node(), find free area bottom-up.
120 *
121 * RETURNS:
122 * Found address on success, 0 on failure.
123 */
124static phys_addr_t __init_memblock
125__memblock_find_range_bottom_up(phys_addr_t start, phys_addr_t end,
Tony Luckfc6daaf2015-06-24 16:58:09 -0700126 phys_addr_t size, phys_addr_t align, int nid,
127 ulong flags)
Tang Chen79442ed2013-11-12 15:07:59 -0800128{
129 phys_addr_t this_start, this_end, cand;
130 u64 i;
131
Tony Luckfc6daaf2015-06-24 16:58:09 -0700132 for_each_free_mem_range(i, nid, flags, &this_start, &this_end, NULL) {
Tang Chen79442ed2013-11-12 15:07:59 -0800133 this_start = clamp(this_start, start, end);
134 this_end = clamp(this_end, start, end);
135
136 cand = round_up(this_start, align);
137 if (cand < this_end && this_end - cand >= size)
138 return cand;
139 }
140
141 return 0;
142}
143
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800144/**
Tang Chen14028992013-11-12 15:07:57 -0800145 * __memblock_find_range_top_down - find free area utility, in top-down
146 * @start: start of candidate range
147 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
148 * @size: size of free area to find
149 * @align: alignment of free area to find
Grygorii Strashkob1154232014-01-21 15:50:16 -0800150 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Tony Luckfc6daaf2015-06-24 16:58:09 -0700151 * @flags: pick from blocks based on memory attributes
Tang Chen14028992013-11-12 15:07:57 -0800152 *
153 * Utility called from memblock_find_in_range_node(), find free area top-down.
154 *
155 * RETURNS:
Tang Chen79442ed2013-11-12 15:07:59 -0800156 * Found address on success, 0 on failure.
Tang Chen14028992013-11-12 15:07:57 -0800157 */
158static phys_addr_t __init_memblock
159__memblock_find_range_top_down(phys_addr_t start, phys_addr_t end,
Tony Luckfc6daaf2015-06-24 16:58:09 -0700160 phys_addr_t size, phys_addr_t align, int nid,
161 ulong flags)
Tang Chen14028992013-11-12 15:07:57 -0800162{
163 phys_addr_t this_start, this_end, cand;
164 u64 i;
165
Tony Luckfc6daaf2015-06-24 16:58:09 -0700166 for_each_free_mem_range_reverse(i, nid, flags, &this_start, &this_end,
167 NULL) {
Tang Chen14028992013-11-12 15:07:57 -0800168 this_start = clamp(this_start, start, end);
169 this_end = clamp(this_end, start, end);
170
171 if (this_end < size)
172 continue;
173
174 cand = round_down(this_end - size, align);
175 if (cand >= this_start)
176 return cand;
177 }
178
179 return 0;
180}
181
182/**
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800183 * memblock_find_in_range_node - find free area in given range and node
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800184 * @size: size of free area to find
185 * @align: alignment of free area to find
Grygorii Strashko87029ee2014-01-21 15:50:14 -0800186 * @start: start of candidate range
187 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
Grygorii Strashkob1154232014-01-21 15:50:16 -0800188 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Tony Luckfc6daaf2015-06-24 16:58:09 -0700189 * @flags: pick from blocks based on memory attributes
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800190 *
191 * Find @size free area aligned to @align in the specified range and node.
192 *
Tang Chen79442ed2013-11-12 15:07:59 -0800193 * When allocation direction is bottom-up, the @start should be greater
194 * than the end of the kernel image. Otherwise, it will be trimmed. The
195 * reason is that we want the bottom-up allocation just near the kernel
196 * image so it is highly likely that the allocated memory and the kernel
197 * will reside in the same node.
198 *
199 * If bottom-up allocation failed, will try to allocate memory top-down.
200 *
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800201 * RETURNS:
Tang Chen79442ed2013-11-12 15:07:59 -0800202 * Found address on success, 0 on failure.
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000203 */
Grygorii Strashko87029ee2014-01-21 15:50:14 -0800204phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t size,
205 phys_addr_t align, phys_addr_t start,
Tony Luckfc6daaf2015-06-24 16:58:09 -0700206 phys_addr_t end, int nid, ulong flags)
Tang Chenf7210e62013-02-22 16:33:51 -0800207{
Tang Chen0cfb8f02014-08-29 15:18:31 -0700208 phys_addr_t kernel_end, ret;
Tang Chen79442ed2013-11-12 15:07:59 -0800209
Tang Chenf7210e62013-02-22 16:33:51 -0800210 /* pump up @end */
211 if (end == MEMBLOCK_ALLOC_ACCESSIBLE)
212 end = memblock.current_limit;
213
214 /* avoid allocating the first page */
215 start = max_t(phys_addr_t, start, PAGE_SIZE);
216 end = max(start, end);
Tang Chen79442ed2013-11-12 15:07:59 -0800217 kernel_end = __pa_symbol(_end);
218
219 /*
220 * try bottom-up allocation only when bottom-up mode
221 * is set and @end is above the kernel image.
222 */
223 if (memblock_bottom_up() && end > kernel_end) {
224 phys_addr_t bottom_up_start;
225
226 /* make sure we will allocate above the kernel */
227 bottom_up_start = max(start, kernel_end);
228
229 /* ok, try bottom-up allocation first */
230 ret = __memblock_find_range_bottom_up(bottom_up_start, end,
Tony Luckfc6daaf2015-06-24 16:58:09 -0700231 size, align, nid, flags);
Tang Chen79442ed2013-11-12 15:07:59 -0800232 if (ret)
233 return ret;
234
235 /*
236 * we always limit bottom-up allocation above the kernel,
237 * but top-down allocation doesn't have the limit, so
238 * retrying top-down allocation may succeed when bottom-up
239 * allocation failed.
240 *
241 * bottom-up allocation is expected to be fail very rarely,
242 * so we use WARN_ONCE() here to see the stack trace if
243 * fail happens.
244 */
Joe Perches756a025f02016-03-17 14:19:47 -0700245 WARN_ONCE(1, "memblock: bottom-up allocation failed, memory hotunplug may be affected\n");
Tang Chen79442ed2013-11-12 15:07:59 -0800246 }
Tang Chenf7210e62013-02-22 16:33:51 -0800247
Tony Luckfc6daaf2015-06-24 16:58:09 -0700248 return __memblock_find_range_top_down(start, end, size, align, nid,
249 flags);
Tang Chenf7210e62013-02-22 16:33:51 -0800250}
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000251
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800252/**
253 * memblock_find_in_range - find free area in given range
254 * @start: start of candidate range
255 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
256 * @size: size of free area to find
257 * @align: alignment of free area to find
258 *
259 * Find @size free area aligned to @align in the specified range.
260 *
261 * RETURNS:
Tang Chen79442ed2013-11-12 15:07:59 -0800262 * Found address on success, 0 on failure.
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800263 */
264phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start,
265 phys_addr_t end, phys_addr_t size,
266 phys_addr_t align)
267{
Tony Lucka3f5baf2015-06-24 16:58:12 -0700268 phys_addr_t ret;
269 ulong flags = choose_memblock_flags();
270
271again:
272 ret = memblock_find_in_range_node(size, align, start, end,
273 NUMA_NO_NODE, flags);
274
275 if (!ret && (flags & MEMBLOCK_MIRROR)) {
276 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
277 &size);
278 flags &= ~MEMBLOCK_MIRROR;
279 goto again;
280 }
281
282 return ret;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800283}
284
Yinghai Lu10d06432010-07-28 15:43:02 +1000285static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000286{
Tejun Heo1440c4e2011-12-08 10:22:08 -0800287 type->total_size -= type->regions[r].size;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200288 memmove(&type->regions[r], &type->regions[r + 1],
289 (type->cnt - (r + 1)) * sizeof(type->regions[r]));
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000290 type->cnt--;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000291
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700292 /* Special case for empty arrays */
293 if (type->cnt == 0) {
Tejun Heo1440c4e2011-12-08 10:22:08 -0800294 WARN_ON(type->total_size != 0);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700295 type->cnt = 1;
296 type->regions[0].base = 0;
297 type->regions[0].size = 0;
Tang Chen66a20752014-01-21 15:49:20 -0800298 type->regions[0].flags = 0;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200299 memblock_set_region_node(&type->regions[0], MAX_NUMNODES);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700300 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000301}
302
Philipp Hachtmann354f17e2014-01-23 15:53:24 -0800303#ifdef CONFIG_ARCH_DISCARD_MEMBLOCK
304
Yinghai Lu29f67382012-07-11 14:02:56 -0700305phys_addr_t __init_memblock get_allocated_memblock_reserved_regions_info(
306 phys_addr_t *addr)
307{
308 if (memblock.reserved.regions == memblock_reserved_init_regions)
309 return 0;
310
311 *addr = __pa(memblock.reserved.regions);
312
313 return PAGE_ALIGN(sizeof(struct memblock_region) *
314 memblock.reserved.max);
315}
316
Philipp Hachtmann5e270e22014-01-23 15:53:11 -0800317phys_addr_t __init_memblock get_allocated_memblock_memory_regions_info(
318 phys_addr_t *addr)
319{
320 if (memblock.memory.regions == memblock_memory_init_regions)
321 return 0;
322
323 *addr = __pa(memblock.memory.regions);
324
325 return PAGE_ALIGN(sizeof(struct memblock_region) *
326 memblock.memory.max);
327}
328
329#endif
330
Greg Pearson48c3b582012-06-20 12:53:05 -0700331/**
332 * memblock_double_array - double the size of the memblock regions array
333 * @type: memblock type of the regions array being doubled
334 * @new_area_start: starting address of memory range to avoid overlap with
335 * @new_area_size: size of memory range to avoid overlap with
336 *
337 * Double the size of the @type regions array. If memblock is being used to
338 * allocate memory for a new reserved regions array and there is a previously
339 * allocated memory range [@new_area_start,@new_area_start+@new_area_size]
340 * waiting to be reserved, ensure the memory used by the new array does
341 * not overlap.
342 *
343 * RETURNS:
344 * 0 on success, -1 on failure.
345 */
346static int __init_memblock memblock_double_array(struct memblock_type *type,
347 phys_addr_t new_area_start,
348 phys_addr_t new_area_size)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700349{
350 struct memblock_region *new_array, *old_array;
Yinghai Lu29f67382012-07-11 14:02:56 -0700351 phys_addr_t old_alloc_size, new_alloc_size;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700352 phys_addr_t old_size, new_size, addr;
353 int use_slab = slab_is_available();
Gavin Shan181eb392012-05-29 15:06:50 -0700354 int *in_slab;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700355
356 /* We don't allow resizing until we know about the reserved regions
357 * of memory that aren't suitable for allocation
358 */
359 if (!memblock_can_resize)
360 return -1;
361
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700362 /* Calculate new doubled size */
363 old_size = type->max * sizeof(struct memblock_region);
364 new_size = old_size << 1;
Yinghai Lu29f67382012-07-11 14:02:56 -0700365 /*
366 * We need to allocated new one align to PAGE_SIZE,
367 * so we can free them completely later.
368 */
369 old_alloc_size = PAGE_ALIGN(old_size);
370 new_alloc_size = PAGE_ALIGN(new_size);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700371
Gavin Shan181eb392012-05-29 15:06:50 -0700372 /* Retrieve the slab flag */
373 if (type == &memblock.memory)
374 in_slab = &memblock_memory_in_slab;
375 else
376 in_slab = &memblock_reserved_in_slab;
377
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700378 /* Try to find some space for it.
379 *
380 * WARNING: We assume that either slab_is_available() and we use it or
Andrew Mortonfd073832012-07-31 16:42:40 -0700381 * we use MEMBLOCK for allocations. That means that this is unsafe to
382 * use when bootmem is currently active (unless bootmem itself is
383 * implemented on top of MEMBLOCK which isn't the case yet)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700384 *
385 * This should however not be an issue for now, as we currently only
Andrew Mortonfd073832012-07-31 16:42:40 -0700386 * call into MEMBLOCK while it's still active, or much later when slab
387 * is active for memory hotplug operations
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700388 */
389 if (use_slab) {
390 new_array = kmalloc(new_size, GFP_KERNEL);
Tejun Heo1f5026a2011-07-12 09:58:09 +0200391 addr = new_array ? __pa(new_array) : 0;
Gavin Shan4e2f0772012-05-29 15:06:50 -0700392 } else {
Greg Pearson48c3b582012-06-20 12:53:05 -0700393 /* only exclude range when trying to double reserved.regions */
394 if (type != &memblock.reserved)
395 new_area_start = new_area_size = 0;
396
397 addr = memblock_find_in_range(new_area_start + new_area_size,
398 memblock.current_limit,
Yinghai Lu29f67382012-07-11 14:02:56 -0700399 new_alloc_size, PAGE_SIZE);
Greg Pearson48c3b582012-06-20 12:53:05 -0700400 if (!addr && new_area_size)
401 addr = memblock_find_in_range(0,
Andrew Mortonfd073832012-07-31 16:42:40 -0700402 min(new_area_start, memblock.current_limit),
403 new_alloc_size, PAGE_SIZE);
Greg Pearson48c3b582012-06-20 12:53:05 -0700404
Sachin Kamat15674862012-09-04 13:55:05 +0530405 new_array = addr ? __va(addr) : NULL;
Gavin Shan4e2f0772012-05-29 15:06:50 -0700406 }
Tejun Heo1f5026a2011-07-12 09:58:09 +0200407 if (!addr) {
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700408 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
409 memblock_type_name(type), type->max, type->max * 2);
410 return -1;
411 }
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700412
Andrew Mortonfd073832012-07-31 16:42:40 -0700413 memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]",
414 memblock_type_name(type), type->max * 2, (u64)addr,
415 (u64)addr + new_size - 1);
Yinghai Luea9e4372010-07-28 15:13:22 +1000416
Andrew Mortonfd073832012-07-31 16:42:40 -0700417 /*
418 * Found space, we now need to move the array over before we add the
419 * reserved region since it may be our reserved array itself that is
420 * full.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700421 */
422 memcpy(new_array, type->regions, old_size);
423 memset(new_array + type->max, 0, old_size);
424 old_array = type->regions;
425 type->regions = new_array;
426 type->max <<= 1;
427
Andrew Mortonfd073832012-07-31 16:42:40 -0700428 /* Free old array. We needn't free it if the array is the static one */
Gavin Shan181eb392012-05-29 15:06:50 -0700429 if (*in_slab)
430 kfree(old_array);
431 else if (old_array != memblock_memory_init_regions &&
432 old_array != memblock_reserved_init_regions)
Yinghai Lu29f67382012-07-11 14:02:56 -0700433 memblock_free(__pa(old_array), old_alloc_size);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700434
Andrew Mortonfd073832012-07-31 16:42:40 -0700435 /*
436 * Reserve the new array if that comes from the memblock. Otherwise, we
437 * needn't do it
Gavin Shan181eb392012-05-29 15:06:50 -0700438 */
439 if (!use_slab)
Yinghai Lu29f67382012-07-11 14:02:56 -0700440 BUG_ON(memblock_reserve(addr, new_alloc_size));
Gavin Shan181eb392012-05-29 15:06:50 -0700441
442 /* Update slab flag */
443 *in_slab = use_slab;
444
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700445 return 0;
446}
447
Tejun Heo784656f92011-07-12 11:15:55 +0200448/**
449 * memblock_merge_regions - merge neighboring compatible regions
450 * @type: memblock type to scan
451 *
452 * Scan @type and merge neighboring compatible regions.
453 */
454static void __init_memblock memblock_merge_regions(struct memblock_type *type)
455{
456 int i = 0;
457
458 /* cnt never goes below 1 */
459 while (i < type->cnt - 1) {
460 struct memblock_region *this = &type->regions[i];
461 struct memblock_region *next = &type->regions[i + 1];
462
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200463 if (this->base + this->size != next->base ||
464 memblock_get_region_node(this) !=
Tang Chen66a20752014-01-21 15:49:20 -0800465 memblock_get_region_node(next) ||
466 this->flags != next->flags) {
Tejun Heo784656f92011-07-12 11:15:55 +0200467 BUG_ON(this->base + this->size > next->base);
468 i++;
469 continue;
470 }
471
472 this->size += next->size;
Lin Fengc0232ae2013-01-11 14:31:44 -0800473 /* move forward from next + 1, index of which is i + 2 */
474 memmove(next, next + 1, (type->cnt - (i + 2)) * sizeof(*next));
Tejun Heo784656f92011-07-12 11:15:55 +0200475 type->cnt--;
476 }
477}
478
479/**
480 * memblock_insert_region - insert new memblock region
Tang Chen209ff862013-04-29 15:08:41 -0700481 * @type: memblock type to insert into
482 * @idx: index for the insertion point
483 * @base: base address of the new region
484 * @size: size of the new region
485 * @nid: node id of the new region
Tang Chen66a20752014-01-21 15:49:20 -0800486 * @flags: flags of the new region
Tejun Heo784656f92011-07-12 11:15:55 +0200487 *
488 * Insert new memblock region [@base,@base+@size) into @type at @idx.
Alexander Kuleshov412d0002016-08-04 15:31:46 -0700489 * @type must already have extra room to accommodate the new region.
Tejun Heo784656f92011-07-12 11:15:55 +0200490 */
491static void __init_memblock memblock_insert_region(struct memblock_type *type,
492 int idx, phys_addr_t base,
Tang Chen66a20752014-01-21 15:49:20 -0800493 phys_addr_t size,
494 int nid, unsigned long flags)
Tejun Heo784656f92011-07-12 11:15:55 +0200495{
496 struct memblock_region *rgn = &type->regions[idx];
497
498 BUG_ON(type->cnt >= type->max);
499 memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn));
500 rgn->base = base;
501 rgn->size = size;
Tang Chen66a20752014-01-21 15:49:20 -0800502 rgn->flags = flags;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200503 memblock_set_region_node(rgn, nid);
Tejun Heo784656f92011-07-12 11:15:55 +0200504 type->cnt++;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800505 type->total_size += size;
Tejun Heo784656f92011-07-12 11:15:55 +0200506}
507
508/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100509 * memblock_add_range - add new memblock region
Tejun Heo784656f92011-07-12 11:15:55 +0200510 * @type: memblock type to add new region into
511 * @base: base address of the new region
512 * @size: size of the new region
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800513 * @nid: nid of the new region
Tang Chen66a20752014-01-21 15:49:20 -0800514 * @flags: flags of the new region
Tejun Heo784656f92011-07-12 11:15:55 +0200515 *
516 * Add new memblock region [@base,@base+@size) into @type. The new region
517 * is allowed to overlap with existing ones - overlaps don't affect already
518 * existing regions. @type is guaranteed to be minimal (all neighbouring
519 * compatible regions are merged) after the addition.
520 *
521 * RETURNS:
522 * 0 on success, -errno on failure.
523 */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100524int __init_memblock memblock_add_range(struct memblock_type *type,
Tang Chen66a20752014-01-21 15:49:20 -0800525 phys_addr_t base, phys_addr_t size,
526 int nid, unsigned long flags)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000527{
Tejun Heo784656f92011-07-12 11:15:55 +0200528 bool insert = false;
Tejun Heoeb18f1b2011-12-08 10:22:07 -0800529 phys_addr_t obase = base;
530 phys_addr_t end = base + memblock_cap_size(base, &size);
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800531 int idx, nr_new;
532 struct memblock_region *rgn;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000533
Tejun Heob3dc6272012-04-20 08:31:34 -0700534 if (!size)
535 return 0;
536
Tejun Heo784656f92011-07-12 11:15:55 +0200537 /* special case for empty array */
538 if (type->regions[0].size == 0) {
Tejun Heo1440c4e2011-12-08 10:22:08 -0800539 WARN_ON(type->cnt != 1 || type->total_size);
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000540 type->regions[0].base = base;
541 type->regions[0].size = size;
Tang Chen66a20752014-01-21 15:49:20 -0800542 type->regions[0].flags = flags;
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800543 memblock_set_region_node(&type->regions[0], nid);
Tejun Heo1440c4e2011-12-08 10:22:08 -0800544 type->total_size = size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000545 return 0;
546 }
Tejun Heo784656f92011-07-12 11:15:55 +0200547repeat:
548 /*
549 * The following is executed twice. Once with %false @insert and
550 * then with %true. The first counts the number of regions needed
Alexander Kuleshov412d0002016-08-04 15:31:46 -0700551 * to accommodate the new area. The second actually inserts them.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700552 */
Tejun Heo784656f92011-07-12 11:15:55 +0200553 base = obase;
554 nr_new = 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000555
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800556 for_each_memblock_type(type, rgn) {
Tejun Heo784656f92011-07-12 11:15:55 +0200557 phys_addr_t rbase = rgn->base;
558 phys_addr_t rend = rbase + rgn->size;
559
560 if (rbase >= end)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000561 break;
Tejun Heo784656f92011-07-12 11:15:55 +0200562 if (rend <= base)
563 continue;
564 /*
565 * @rgn overlaps. If it separates the lower part of new
566 * area, insert that portion.
567 */
568 if (rbase > base) {
Wei Yangc0a29492015-09-04 15:47:38 -0700569#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
570 WARN_ON(nid != memblock_get_region_node(rgn));
571#endif
Wei Yang4fcab5f2015-09-08 14:59:53 -0700572 WARN_ON(flags != rgn->flags);
Tejun Heo784656f92011-07-12 11:15:55 +0200573 nr_new++;
574 if (insert)
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800575 memblock_insert_region(type, idx++, base,
Tang Chen66a20752014-01-21 15:49:20 -0800576 rbase - base, nid,
577 flags);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000578 }
Tejun Heo784656f92011-07-12 11:15:55 +0200579 /* area below @rend is dealt with, forget about it */
580 base = min(rend, end);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000581 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000582
Tejun Heo784656f92011-07-12 11:15:55 +0200583 /* insert the remaining portion */
584 if (base < end) {
585 nr_new++;
586 if (insert)
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800587 memblock_insert_region(type, idx, base, end - base,
Tang Chen66a20752014-01-21 15:49:20 -0800588 nid, flags);
Tejun Heo784656f92011-07-12 11:15:55 +0200589 }
590
nimisoloef3cc4d2016-07-26 15:24:56 -0700591 if (!nr_new)
592 return 0;
593
Tejun Heo784656f92011-07-12 11:15:55 +0200594 /*
595 * If this was the first round, resize array and repeat for actual
596 * insertions; otherwise, merge and return.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700597 */
Tejun Heo784656f92011-07-12 11:15:55 +0200598 if (!insert) {
599 while (type->cnt + nr_new > type->max)
Greg Pearson48c3b582012-06-20 12:53:05 -0700600 if (memblock_double_array(type, obase, size) < 0)
Tejun Heo784656f92011-07-12 11:15:55 +0200601 return -ENOMEM;
602 insert = true;
603 goto repeat;
604 } else {
605 memblock_merge_regions(type);
606 return 0;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700607 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000608}
609
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800610int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size,
611 int nid)
612{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100613 return memblock_add_range(&memblock.memory, base, size, nid, 0);
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800614}
615
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700616int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size)
Alexander Kuleshov6a4055b2015-04-15 16:14:44 -0700617{
Alexander Kuleshov6a4055b2015-04-15 16:14:44 -0700618 memblock_dbg("memblock_add: [%#016llx-%#016llx] flags %#02lx %pF\n",
619 (unsigned long long)base,
620 (unsigned long long)base + size - 1,
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700621 0UL, (void *)_RET_IP_);
Alexander Kuleshov6a4055b2015-04-15 16:14:44 -0700622
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700623 return memblock_add_range(&memblock.memory, base, size, MAX_NUMNODES, 0);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000624}
625
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800626/**
627 * memblock_isolate_range - isolate given range into disjoint memblocks
628 * @type: memblock type to isolate range for
629 * @base: base of range to isolate
630 * @size: size of range to isolate
631 * @start_rgn: out parameter for the start of isolated region
632 * @end_rgn: out parameter for the end of isolated region
633 *
634 * Walk @type and ensure that regions don't cross the boundaries defined by
635 * [@base,@base+@size). Crossing regions are split at the boundaries,
636 * which may create at most two more regions. The index of the first
637 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
638 *
639 * RETURNS:
640 * 0 on success, -errno on failure.
641 */
642static int __init_memblock memblock_isolate_range(struct memblock_type *type,
643 phys_addr_t base, phys_addr_t size,
644 int *start_rgn, int *end_rgn)
645{
Tejun Heoeb18f1b2011-12-08 10:22:07 -0800646 phys_addr_t end = base + memblock_cap_size(base, &size);
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800647 int idx;
648 struct memblock_region *rgn;
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800649
650 *start_rgn = *end_rgn = 0;
651
Tejun Heob3dc6272012-04-20 08:31:34 -0700652 if (!size)
653 return 0;
654
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800655 /* we'll create at most two more regions */
656 while (type->cnt + 2 > type->max)
Greg Pearson48c3b582012-06-20 12:53:05 -0700657 if (memblock_double_array(type, base, size) < 0)
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800658 return -ENOMEM;
659
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800660 for_each_memblock_type(type, rgn) {
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800661 phys_addr_t rbase = rgn->base;
662 phys_addr_t rend = rbase + rgn->size;
663
664 if (rbase >= end)
665 break;
666 if (rend <= base)
667 continue;
668
669 if (rbase < base) {
670 /*
671 * @rgn intersects from below. Split and continue
672 * to process the next region - the new top half.
673 */
674 rgn->base = base;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800675 rgn->size -= base - rbase;
676 type->total_size -= base - rbase;
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800677 memblock_insert_region(type, idx, rbase, base - rbase,
Tang Chen66a20752014-01-21 15:49:20 -0800678 memblock_get_region_node(rgn),
679 rgn->flags);
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800680 } else if (rend > end) {
681 /*
682 * @rgn intersects from above. Split and redo the
683 * current region - the new bottom half.
684 */
685 rgn->base = end;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800686 rgn->size -= end - rbase;
687 type->total_size -= end - rbase;
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800688 memblock_insert_region(type, idx--, rbase, end - rbase,
Tang Chen66a20752014-01-21 15:49:20 -0800689 memblock_get_region_node(rgn),
690 rgn->flags);
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800691 } else {
692 /* @rgn is fully contained, record it */
693 if (!*end_rgn)
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800694 *start_rgn = idx;
695 *end_rgn = idx + 1;
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800696 }
697 }
698
699 return 0;
700}
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800701
Alexander Kuleshov35bd16a2015-11-05 18:47:00 -0800702static int __init_memblock memblock_remove_range(struct memblock_type *type,
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100703 phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000704{
Tejun Heo71936182011-12-08 10:22:07 -0800705 int start_rgn, end_rgn;
706 int i, ret;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000707
Tejun Heo71936182011-12-08 10:22:07 -0800708 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
709 if (ret)
710 return ret;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000711
Tejun Heo71936182011-12-08 10:22:07 -0800712 for (i = end_rgn - 1; i >= start_rgn; i--)
713 memblock_remove_region(type, i);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700714 return 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000715}
716
Tejun Heo581adcb2011-12-08 10:22:06 -0800717int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000718{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100719 return memblock_remove_range(&memblock.memory, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000720}
721
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100722
Tejun Heo581adcb2011-12-08 10:22:06 -0800723int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000724{
Tejun Heo24aa0782011-07-12 11:16:06 +0200725 memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n",
H. Peter Anvina1504392011-07-14 11:57:10 -0700726 (unsigned long long)base,
Grygorii Strashko931d13f2014-01-21 15:49:17 -0800727 (unsigned long long)base + size - 1,
H. Peter Anvina1504392011-07-14 11:57:10 -0700728 (void *)_RET_IP_);
Tejun Heo24aa0782011-07-12 11:16:06 +0200729
Shiraz Hashimcb3a9222016-01-19 15:11:10 +0530730 if (base < memblock.current_limit)
Kyle Yan65be4a52016-10-31 15:05:00 -0700731 kmemleak_free_part_phys(base, size);
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100732 return memblock_remove_range(&memblock.reserved, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000733}
734
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700735int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000736{
Tang Chen66a20752014-01-21 15:49:20 -0800737 memblock_dbg("memblock_reserve: [%#016llx-%#016llx] flags %#02lx %pF\n",
H. Peter Anvina1504392011-07-14 11:57:10 -0700738 (unsigned long long)base,
Grygorii Strashko931d13f2014-01-21 15:49:17 -0800739 (unsigned long long)base + size - 1,
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700740 0UL, (void *)_RET_IP_);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000741
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700742 return memblock_add_range(&memblock.reserved, base, size, MAX_NUMNODES, 0);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000743}
744
Tejun Heo35fd0802011-07-12 11:15:59 +0200745/**
Tang Chen66b16ed2014-01-21 15:49:23 -0800746 *
Tony Luck4308ce12014-12-12 16:54:59 -0800747 * This function isolates region [@base, @base + @size), and sets/clears flag
Tang Chen66b16ed2014-01-21 15:49:23 -0800748 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700749 * Return 0 on success, -errno on failure.
Tang Chen66b16ed2014-01-21 15:49:23 -0800750 */
Tony Luck4308ce12014-12-12 16:54:59 -0800751static int __init_memblock memblock_setclr_flag(phys_addr_t base,
752 phys_addr_t size, int set, int flag)
Tang Chen66b16ed2014-01-21 15:49:23 -0800753{
754 struct memblock_type *type = &memblock.memory;
755 int i, ret, start_rgn, end_rgn;
756
757 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
758 if (ret)
759 return ret;
760
761 for (i = start_rgn; i < end_rgn; i++)
Tony Luck4308ce12014-12-12 16:54:59 -0800762 if (set)
763 memblock_set_region_flags(&type->regions[i], flag);
764 else
765 memblock_clear_region_flags(&type->regions[i], flag);
Tang Chen66b16ed2014-01-21 15:49:23 -0800766
767 memblock_merge_regions(type);
768 return 0;
769}
770
771/**
Tony Luck4308ce12014-12-12 16:54:59 -0800772 * memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG.
773 * @base: the base phys addr of the region
774 * @size: the size of the region
775 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700776 * Return 0 on success, -errno on failure.
Tony Luck4308ce12014-12-12 16:54:59 -0800777 */
778int __init_memblock memblock_mark_hotplug(phys_addr_t base, phys_addr_t size)
779{
780 return memblock_setclr_flag(base, size, 1, MEMBLOCK_HOTPLUG);
781}
782
783/**
Tang Chen66b16ed2014-01-21 15:49:23 -0800784 * memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region.
785 * @base: the base phys addr of the region
786 * @size: the size of the region
787 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700788 * Return 0 on success, -errno on failure.
Tang Chen66b16ed2014-01-21 15:49:23 -0800789 */
790int __init_memblock memblock_clear_hotplug(phys_addr_t base, phys_addr_t size)
791{
Tony Luck4308ce12014-12-12 16:54:59 -0800792 return memblock_setclr_flag(base, size, 0, MEMBLOCK_HOTPLUG);
Tang Chen66b16ed2014-01-21 15:49:23 -0800793}
794
795/**
Tony Lucka3f5baf2015-06-24 16:58:12 -0700796 * memblock_mark_mirror - Mark mirrored memory with flag MEMBLOCK_MIRROR.
797 * @base: the base phys addr of the region
798 * @size: the size of the region
799 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700800 * Return 0 on success, -errno on failure.
Tony Lucka3f5baf2015-06-24 16:58:12 -0700801 */
802int __init_memblock memblock_mark_mirror(phys_addr_t base, phys_addr_t size)
803{
804 system_has_some_mirror = true;
805
806 return memblock_setclr_flag(base, size, 1, MEMBLOCK_MIRROR);
807}
808
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +0100809/**
810 * memblock_mark_nomap - Mark a memory region with flag MEMBLOCK_NOMAP.
811 * @base: the base phys addr of the region
812 * @size: the size of the region
813 *
814 * Return 0 on success, -errno on failure.
815 */
816int __init_memblock memblock_mark_nomap(phys_addr_t base, phys_addr_t size)
817{
818 return memblock_setclr_flag(base, size, 1, MEMBLOCK_NOMAP);
819}
Tony Lucka3f5baf2015-06-24 16:58:12 -0700820
821/**
Robin Holt8e7a7f82015-06-30 14:56:41 -0700822 * __next_reserved_mem_region - next function for for_each_reserved_region()
823 * @idx: pointer to u64 loop variable
824 * @out_start: ptr to phys_addr_t for start address of the region, can be %NULL
825 * @out_end: ptr to phys_addr_t for end address of the region, can be %NULL
826 *
827 * Iterate over all reserved memory regions.
828 */
829void __init_memblock __next_reserved_mem_region(u64 *idx,
830 phys_addr_t *out_start,
831 phys_addr_t *out_end)
832{
Alexander Kuleshov567d1172015-09-08 15:03:33 -0700833 struct memblock_type *type = &memblock.reserved;
Robin Holt8e7a7f82015-06-30 14:56:41 -0700834
Richard Leitnercd33a762016-05-20 16:58:33 -0700835 if (*idx < type->cnt) {
Alexander Kuleshov567d1172015-09-08 15:03:33 -0700836 struct memblock_region *r = &type->regions[*idx];
Robin Holt8e7a7f82015-06-30 14:56:41 -0700837 phys_addr_t base = r->base;
838 phys_addr_t size = r->size;
839
840 if (out_start)
841 *out_start = base;
842 if (out_end)
843 *out_end = base + size - 1;
844
845 *idx += 1;
846 return;
847 }
848
849 /* signal end of iteration */
850 *idx = ULLONG_MAX;
851}
852
853/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100854 * __next__mem_range - next function for for_each_free_mem_range() etc.
Tejun Heo35fd0802011-07-12 11:15:59 +0200855 * @idx: pointer to u64 loop variable
Grygorii Strashkob1154232014-01-21 15:50:16 -0800856 * @nid: node selector, %NUMA_NO_NODE for all nodes
Tony Luckfc6daaf2015-06-24 16:58:09 -0700857 * @flags: pick from blocks based on memory attributes
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100858 * @type_a: pointer to memblock_type from where the range is taken
859 * @type_b: pointer to memblock_type which excludes memory from being taken
Wanpeng Lidad75572012-06-20 12:53:01 -0700860 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
861 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
862 * @out_nid: ptr to int for nid of the range, can be %NULL
Tejun Heo35fd0802011-07-12 11:15:59 +0200863 *
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100864 * Find the first area from *@idx which matches @nid, fill the out
Tejun Heo35fd0802011-07-12 11:15:59 +0200865 * parameters, and update *@idx for the next iteration. The lower 32bit of
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100866 * *@idx contains index into type_a and the upper 32bit indexes the
867 * areas before each region in type_b. For example, if type_b regions
Tejun Heo35fd0802011-07-12 11:15:59 +0200868 * look like the following,
869 *
870 * 0:[0-16), 1:[32-48), 2:[128-130)
871 *
872 * The upper 32bit indexes the following regions.
873 *
874 * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX)
875 *
876 * As both region arrays are sorted, the function advances the two indices
877 * in lockstep and returns each intersection.
878 */
Tony Luckfc6daaf2015-06-24 16:58:09 -0700879void __init_memblock __next_mem_range(u64 *idx, int nid, ulong flags,
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100880 struct memblock_type *type_a,
881 struct memblock_type *type_b,
882 phys_addr_t *out_start,
883 phys_addr_t *out_end, int *out_nid)
Tejun Heo35fd0802011-07-12 11:15:59 +0200884{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100885 int idx_a = *idx & 0xffffffff;
886 int idx_b = *idx >> 32;
Grygorii Strashkob1154232014-01-21 15:50:16 -0800887
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100888 if (WARN_ONCE(nid == MAX_NUMNODES,
889 "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
Grygorii Strashko560dca272014-01-21 15:50:55 -0800890 nid = NUMA_NO_NODE;
Tejun Heo35fd0802011-07-12 11:15:59 +0200891
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100892 for (; idx_a < type_a->cnt; idx_a++) {
893 struct memblock_region *m = &type_a->regions[idx_a];
894
Tejun Heo35fd0802011-07-12 11:15:59 +0200895 phys_addr_t m_start = m->base;
896 phys_addr_t m_end = m->base + m->size;
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100897 int m_nid = memblock_get_region_node(m);
Tejun Heo35fd0802011-07-12 11:15:59 +0200898
899 /* only memory regions are associated with nodes, check it */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100900 if (nid != NUMA_NO_NODE && nid != m_nid)
Tejun Heo35fd0802011-07-12 11:15:59 +0200901 continue;
902
Xishi Qiu0a313a92014-09-09 14:50:46 -0700903 /* skip hotpluggable memory regions if needed */
904 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
905 continue;
906
Tony Lucka3f5baf2015-06-24 16:58:12 -0700907 /* if we want mirror memory skip non-mirror memory regions */
908 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
909 continue;
910
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +0100911 /* skip nomap memory unless we were asked for it explicitly */
912 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
913 continue;
914
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100915 if (!type_b) {
916 if (out_start)
917 *out_start = m_start;
918 if (out_end)
919 *out_end = m_end;
920 if (out_nid)
921 *out_nid = m_nid;
922 idx_a++;
923 *idx = (u32)idx_a | (u64)idx_b << 32;
924 return;
925 }
Tejun Heo35fd0802011-07-12 11:15:59 +0200926
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100927 /* scan areas before each reservation */
928 for (; idx_b < type_b->cnt + 1; idx_b++) {
929 struct memblock_region *r;
930 phys_addr_t r_start;
931 phys_addr_t r_end;
932
933 r = &type_b->regions[idx_b];
934 r_start = idx_b ? r[-1].base + r[-1].size : 0;
935 r_end = idx_b < type_b->cnt ?
936 r->base : ULLONG_MAX;
937
938 /*
939 * if idx_b advanced past idx_a,
940 * break out to advance idx_a
941 */
Tejun Heo35fd0802011-07-12 11:15:59 +0200942 if (r_start >= m_end)
943 break;
944 /* if the two regions intersect, we're done */
945 if (m_start < r_end) {
946 if (out_start)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100947 *out_start =
948 max(m_start, r_start);
Tejun Heo35fd0802011-07-12 11:15:59 +0200949 if (out_end)
950 *out_end = min(m_end, r_end);
951 if (out_nid)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100952 *out_nid = m_nid;
Tejun Heo35fd0802011-07-12 11:15:59 +0200953 /*
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100954 * The region which ends first is
955 * advanced for the next iteration.
Tejun Heo35fd0802011-07-12 11:15:59 +0200956 */
957 if (m_end <= r_end)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100958 idx_a++;
Tejun Heo35fd0802011-07-12 11:15:59 +0200959 else
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100960 idx_b++;
961 *idx = (u32)idx_a | (u64)idx_b << 32;
Tejun Heo35fd0802011-07-12 11:15:59 +0200962 return;
963 }
964 }
965 }
966
967 /* signal end of iteration */
968 *idx = ULLONG_MAX;
969}
970
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800971/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100972 * __next_mem_range_rev - generic next function for for_each_*_range_rev()
973 *
974 * Finds the next range from type_a which is not marked as unsuitable
975 * in type_b.
976 *
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800977 * @idx: pointer to u64 loop variable
Alexander Kuleshovad5ea8c2015-09-08 15:04:22 -0700978 * @nid: node selector, %NUMA_NO_NODE for all nodes
Tony Luckfc6daaf2015-06-24 16:58:09 -0700979 * @flags: pick from blocks based on memory attributes
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100980 * @type_a: pointer to memblock_type from where the range is taken
981 * @type_b: pointer to memblock_type which excludes memory from being taken
Wanpeng Lidad75572012-06-20 12:53:01 -0700982 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
983 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
984 * @out_nid: ptr to int for nid of the range, can be %NULL
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800985 *
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100986 * Reverse of __next_mem_range().
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800987 */
Tony Luckfc6daaf2015-06-24 16:58:09 -0700988void __init_memblock __next_mem_range_rev(u64 *idx, int nid, ulong flags,
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100989 struct memblock_type *type_a,
990 struct memblock_type *type_b,
991 phys_addr_t *out_start,
992 phys_addr_t *out_end, int *out_nid)
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800993{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100994 int idx_a = *idx & 0xffffffff;
995 int idx_b = *idx >> 32;
Grygorii Strashkob1154232014-01-21 15:50:16 -0800996
Grygorii Strashko560dca272014-01-21 15:50:55 -0800997 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
998 nid = NUMA_NO_NODE;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800999
1000 if (*idx == (u64)ULLONG_MAX) {
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001001 idx_a = type_a->cnt - 1;
zijun_hue47608a2016-08-04 15:32:00 -07001002 if (type_b != NULL)
1003 idx_b = type_b->cnt;
1004 else
1005 idx_b = 0;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001006 }
1007
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001008 for (; idx_a >= 0; idx_a--) {
1009 struct memblock_region *m = &type_a->regions[idx_a];
1010
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001011 phys_addr_t m_start = m->base;
1012 phys_addr_t m_end = m->base + m->size;
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001013 int m_nid = memblock_get_region_node(m);
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001014
1015 /* only memory regions are associated with nodes, check it */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001016 if (nid != NUMA_NO_NODE && nid != m_nid)
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001017 continue;
1018
Tang Chen55ac5902014-01-21 15:49:35 -08001019 /* skip hotpluggable memory regions if needed */
1020 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
1021 continue;
1022
Tony Lucka3f5baf2015-06-24 16:58:12 -07001023 /* if we want mirror memory skip non-mirror memory regions */
1024 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
1025 continue;
1026
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +01001027 /* skip nomap memory unless we were asked for it explicitly */
1028 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
1029 continue;
1030
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001031 if (!type_b) {
1032 if (out_start)
1033 *out_start = m_start;
1034 if (out_end)
1035 *out_end = m_end;
1036 if (out_nid)
1037 *out_nid = m_nid;
zijun_hufb399b42016-07-28 15:48:56 -07001038 idx_a--;
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001039 *idx = (u32)idx_a | (u64)idx_b << 32;
1040 return;
1041 }
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001042
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001043 /* scan areas before each reservation */
1044 for (; idx_b >= 0; idx_b--) {
1045 struct memblock_region *r;
1046 phys_addr_t r_start;
1047 phys_addr_t r_end;
1048
1049 r = &type_b->regions[idx_b];
1050 r_start = idx_b ? r[-1].base + r[-1].size : 0;
1051 r_end = idx_b < type_b->cnt ?
1052 r->base : ULLONG_MAX;
1053 /*
1054 * if idx_b advanced past idx_a,
1055 * break out to advance idx_a
1056 */
1057
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001058 if (r_end <= m_start)
1059 break;
1060 /* if the two regions intersect, we're done */
1061 if (m_end > r_start) {
1062 if (out_start)
1063 *out_start = max(m_start, r_start);
1064 if (out_end)
1065 *out_end = min(m_end, r_end);
1066 if (out_nid)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001067 *out_nid = m_nid;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001068 if (m_start >= r_start)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001069 idx_a--;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001070 else
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001071 idx_b--;
1072 *idx = (u32)idx_a | (u64)idx_b << 32;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001073 return;
1074 }
1075 }
1076 }
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001077 /* signal end of iteration */
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001078 *idx = ULLONG_MAX;
1079}
1080
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001081#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1082/*
1083 * Common iterator interface used to define for_each_mem_range().
1084 */
1085void __init_memblock __next_mem_pfn_range(int *idx, int nid,
1086 unsigned long *out_start_pfn,
1087 unsigned long *out_end_pfn, int *out_nid)
1088{
1089 struct memblock_type *type = &memblock.memory;
1090 struct memblock_region *r;
1091
1092 while (++*idx < type->cnt) {
1093 r = &type->regions[*idx];
1094
1095 if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size))
1096 continue;
1097 if (nid == MAX_NUMNODES || nid == r->nid)
1098 break;
1099 }
1100 if (*idx >= type->cnt) {
1101 *idx = -1;
1102 return;
1103 }
1104
1105 if (out_start_pfn)
1106 *out_start_pfn = PFN_UP(r->base);
1107 if (out_end_pfn)
1108 *out_end_pfn = PFN_DOWN(r->base + r->size);
1109 if (out_nid)
1110 *out_nid = r->nid;
1111}
1112
1113/**
1114 * memblock_set_node - set node ID on memblock regions
1115 * @base: base of area to set node ID for
1116 * @size: size of area to set node ID for
Tang Chene7e8de52014-01-21 15:49:26 -08001117 * @type: memblock type to set node ID for
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001118 * @nid: node ID to set
1119 *
Tang Chene7e8de52014-01-21 15:49:26 -08001120 * Set the nid of memblock @type regions in [@base,@base+@size) to @nid.
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001121 * Regions which cross the area boundaries are split as necessary.
1122 *
1123 * RETURNS:
1124 * 0 on success, -errno on failure.
1125 */
1126int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size,
Tang Chene7e8de52014-01-21 15:49:26 -08001127 struct memblock_type *type, int nid)
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001128{
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001129 int start_rgn, end_rgn;
1130 int i, ret;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001131
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001132 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
1133 if (ret)
1134 return ret;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001135
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001136 for (i = start_rgn; i < end_rgn; i++)
Wanpeng Lie9d24ad2012-10-08 16:32:21 -07001137 memblock_set_region_node(&type->regions[i], nid);
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001138
1139 memblock_merge_regions(type);
1140 return 0;
1141}
1142#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
1143
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001144static phys_addr_t __init memblock_alloc_range_nid(phys_addr_t size,
1145 phys_addr_t align, phys_addr_t start,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001146 phys_addr_t end, int nid, ulong flags)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001147{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001148 phys_addr_t found;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001149
Grygorii Strashko79f40fa2014-01-21 15:50:12 -08001150 if (!align)
1151 align = SMP_CACHE_BYTES;
Vineet Gupta94f3d3a2013-04-29 15:06:15 -07001152
Tony Luckfc6daaf2015-06-24 16:58:09 -07001153 found = memblock_find_in_range_node(size, align, start, end, nid,
1154 flags);
Catalin Marinasaedf95e2014-06-06 14:38:20 -07001155 if (found && !memblock_reserve(found, size)) {
1156 /*
1157 * The min_count is set to 0 so that memblock allocations are
1158 * never reported as leaks.
1159 */
Shiraz Hashimcb3a9222016-01-19 15:11:10 +05301160 if (found < memblock.current_limit)
Kyle Yan65be4a52016-10-31 15:05:00 -07001161 kmemleak_alloc_phys(found, size, 0, 0);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001162 return found;
Catalin Marinasaedf95e2014-06-06 14:38:20 -07001163 }
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001164 return 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001165}
1166
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001167phys_addr_t __init memblock_alloc_range(phys_addr_t size, phys_addr_t align,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001168 phys_addr_t start, phys_addr_t end,
1169 ulong flags)
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001170{
Tony Luckfc6daaf2015-06-24 16:58:09 -07001171 return memblock_alloc_range_nid(size, align, start, end, NUMA_NO_NODE,
1172 flags);
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001173}
1174
1175static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size,
1176 phys_addr_t align, phys_addr_t max_addr,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001177 int nid, ulong flags)
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001178{
Tony Luckfc6daaf2015-06-24 16:58:09 -07001179 return memblock_alloc_range_nid(size, align, 0, max_addr, nid, flags);
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001180}
1181
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001182phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid)
1183{
Tony Lucka3f5baf2015-06-24 16:58:12 -07001184 ulong flags = choose_memblock_flags();
1185 phys_addr_t ret;
1186
1187again:
1188 ret = memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE,
1189 nid, flags);
1190
1191 if (!ret && (flags & MEMBLOCK_MIRROR)) {
1192 flags &= ~MEMBLOCK_MIRROR;
1193 goto again;
1194 }
1195 return ret;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001196}
1197
1198phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
1199{
Tony Luckfc6daaf2015-06-24 16:58:09 -07001200 return memblock_alloc_base_nid(size, align, max_addr, NUMA_NO_NODE,
1201 MEMBLOCK_NONE);
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001202}
1203
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001204phys_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 +10001205{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001206 phys_addr_t alloc;
1207
1208 alloc = __memblock_alloc_base(size, align, max_addr);
1209
1210 if (alloc == 0)
1211 panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n",
1212 (unsigned long long) size, (unsigned long long) max_addr);
1213
1214 return alloc;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001215}
1216
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001217phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001218{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001219 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001220}
1221
Benjamin Herrenschmidt9d1e2492010-07-06 15:39:17 -07001222phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid)
1223{
1224 phys_addr_t res = memblock_alloc_nid(size, align, nid);
1225
1226 if (res)
1227 return res;
Tejun Heo15fb0972011-07-12 09:58:07 +02001228 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001229}
1230
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001231/**
1232 * memblock_virt_alloc_internal - allocate boot memory block
1233 * @size: size of memory block to be allocated in bytes
1234 * @align: alignment of the region and block's size
1235 * @min_addr: the lower bound of the memory region to allocate (phys address)
1236 * @max_addr: the upper bound of the memory region to allocate (phys address)
1237 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1238 *
1239 * The @min_addr limit is dropped if it can not be satisfied and the allocation
1240 * will fall back to memory below @min_addr. Also, allocation may fall back
1241 * to any node in the system if the specified node can not
1242 * hold the requested memory.
1243 *
1244 * The allocation is performed from memory region limited by
1245 * memblock.current_limit if @max_addr == %BOOTMEM_ALLOC_ACCESSIBLE.
1246 *
1247 * The memory block is aligned on SMP_CACHE_BYTES if @align == 0.
1248 *
1249 * The phys address of allocated boot memory block is converted to virtual and
1250 * allocated memory is reset to 0.
1251 *
1252 * In addition, function sets the min_count to 0 using kmemleak_alloc for
1253 * allocated boot memory block, so that it is never reported as leaks.
1254 *
1255 * RETURNS:
1256 * Virtual address of allocated memory block on success, NULL on failure.
1257 */
1258static void * __init memblock_virt_alloc_internal(
1259 phys_addr_t size, phys_addr_t align,
1260 phys_addr_t min_addr, phys_addr_t max_addr,
1261 int nid)
1262{
1263 phys_addr_t alloc;
1264 void *ptr;
Tony Lucka3f5baf2015-06-24 16:58:12 -07001265 ulong flags = choose_memblock_flags();
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001266
Grygorii Strashko560dca272014-01-21 15:50:55 -08001267 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
1268 nid = NUMA_NO_NODE;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001269
1270 /*
1271 * Detect any accidental use of these APIs after slab is ready, as at
1272 * this moment memblock may be deinitialized already and its
1273 * internal data may be destroyed (after execution of free_all_bootmem)
1274 */
1275 if (WARN_ON_ONCE(slab_is_available()))
1276 return kzalloc_node(size, GFP_NOWAIT, nid);
1277
1278 if (!align)
1279 align = SMP_CACHE_BYTES;
1280
Yinghai Luf544e142014-01-29 14:05:52 -08001281 if (max_addr > memblock.current_limit)
1282 max_addr = memblock.current_limit;
1283
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001284again:
1285 alloc = memblock_find_in_range_node(size, align, min_addr, max_addr,
Tony Lucka3f5baf2015-06-24 16:58:12 -07001286 nid, flags);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001287 if (alloc)
1288 goto done;
1289
1290 if (nid != NUMA_NO_NODE) {
1291 alloc = memblock_find_in_range_node(size, align, min_addr,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001292 max_addr, NUMA_NO_NODE,
Tony Lucka3f5baf2015-06-24 16:58:12 -07001293 flags);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001294 if (alloc)
1295 goto done;
1296 }
1297
1298 if (min_addr) {
1299 min_addr = 0;
1300 goto again;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001301 }
1302
Tony Lucka3f5baf2015-06-24 16:58:12 -07001303 if (flags & MEMBLOCK_MIRROR) {
1304 flags &= ~MEMBLOCK_MIRROR;
1305 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
1306 &size);
1307 goto again;
1308 }
1309
1310 return NULL;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001311done:
1312 memblock_reserve(alloc, size);
1313 ptr = phys_to_virt(alloc);
1314 memset(ptr, 0, size);
1315
1316 /*
1317 * The min_count is set to 0 so that bootmem allocated blocks
1318 * are never reported as leaks. This is because many of these blocks
1319 * are only referred via the physical address which is not
1320 * looked up by kmemleak.
1321 */
1322 kmemleak_alloc(ptr, size, 0, 0);
1323
1324 return ptr;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001325}
1326
1327/**
1328 * memblock_virt_alloc_try_nid_nopanic - allocate boot memory block
1329 * @size: size of memory block to be allocated in bytes
1330 * @align: alignment of the region and block's size
1331 * @min_addr: the lower bound of the memory region from where the allocation
1332 * is preferred (phys address)
1333 * @max_addr: the upper bound of the memory region from where the allocation
1334 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1335 * allocate only from memory limited by memblock.current_limit value
1336 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1337 *
1338 * Public version of _memblock_virt_alloc_try_nid_nopanic() which provides
1339 * additional debug information (including caller info), if enabled.
1340 *
1341 * RETURNS:
1342 * Virtual address of allocated memory block on success, NULL on failure.
1343 */
1344void * __init memblock_virt_alloc_try_nid_nopanic(
1345 phys_addr_t size, phys_addr_t align,
1346 phys_addr_t min_addr, phys_addr_t max_addr,
1347 int nid)
1348{
1349 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1350 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1351 (u64)max_addr, (void *)_RET_IP_);
1352 return memblock_virt_alloc_internal(size, align, min_addr,
1353 max_addr, nid);
1354}
1355
1356/**
1357 * memblock_virt_alloc_try_nid - allocate boot memory block with panicking
1358 * @size: size of memory block to be allocated in bytes
1359 * @align: alignment of the region and block's size
1360 * @min_addr: the lower bound of the memory region from where the allocation
1361 * is preferred (phys address)
1362 * @max_addr: the upper bound of the memory region from where the allocation
1363 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1364 * allocate only from memory limited by memblock.current_limit value
1365 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1366 *
1367 * Public panicking version of _memblock_virt_alloc_try_nid_nopanic()
1368 * which provides debug information (including caller info), if enabled,
1369 * and panics if the request can not be satisfied.
1370 *
1371 * RETURNS:
1372 * Virtual address of allocated memory block on success, NULL on failure.
1373 */
1374void * __init memblock_virt_alloc_try_nid(
1375 phys_addr_t size, phys_addr_t align,
1376 phys_addr_t min_addr, phys_addr_t max_addr,
1377 int nid)
1378{
1379 void *ptr;
1380
1381 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1382 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1383 (u64)max_addr, (void *)_RET_IP_);
1384 ptr = memblock_virt_alloc_internal(size, align,
1385 min_addr, max_addr, nid);
1386 if (ptr)
1387 return ptr;
1388
1389 panic("%s: Failed to allocate %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx\n",
1390 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1391 (u64)max_addr);
1392 return NULL;
1393}
1394
1395/**
1396 * __memblock_free_early - free boot memory block
1397 * @base: phys starting address of the boot memory block
1398 * @size: size of the boot memory block in bytes
1399 *
1400 * Free boot memory block previously allocated by memblock_virt_alloc_xx() API.
1401 * The freeing memory will not be released to the buddy allocator.
1402 */
1403void __init __memblock_free_early(phys_addr_t base, phys_addr_t size)
1404{
1405 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1406 __func__, (u64)base, (u64)base + size - 1,
1407 (void *)_RET_IP_);
Catalin Marinas9099dae2016-10-11 13:55:11 -07001408 kmemleak_free_part_phys(base, size);
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001409 memblock_remove_range(&memblock.reserved, base, size);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001410}
1411
1412/*
1413 * __memblock_free_late - free bootmem block pages directly to buddy allocator
1414 * @addr: phys starting address of the boot memory block
1415 * @size: size of the boot memory block in bytes
1416 *
1417 * This is only useful when the bootmem allocator has already been torn
1418 * down, but we are still initializing the system. Pages are released directly
1419 * to the buddy allocator, no bootmem metadata is updated because it is gone.
1420 */
1421void __init __memblock_free_late(phys_addr_t base, phys_addr_t size)
1422{
1423 u64 cursor, end;
1424
1425 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1426 __func__, (u64)base, (u64)base + size - 1,
1427 (void *)_RET_IP_);
Catalin Marinas9099dae2016-10-11 13:55:11 -07001428 kmemleak_free_part_phys(base, size);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001429 cursor = PFN_UP(base);
1430 end = PFN_DOWN(base + size);
1431
1432 for (; cursor < end; cursor++) {
Mel Gormand70ddd72015-06-30 14:56:52 -07001433 __free_pages_bootmem(pfn_to_page(cursor), cursor, 0);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001434 totalram_pages++;
1435 }
1436}
Benjamin Herrenschmidt9d1e2492010-07-06 15:39:17 -07001437
1438/*
1439 * Remaining API functions
1440 */
1441
David Gibson1f1ffb8a2016-02-05 15:36:19 -08001442phys_addr_t __init_memblock memblock_phys_mem_size(void)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001443{
Tejun Heo1440c4e2011-12-08 10:22:08 -08001444 return memblock.memory.total_size;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001445}
1446
Srikar Dronamraju8907de52016-10-07 16:59:18 -07001447phys_addr_t __init_memblock memblock_reserved_size(void)
1448{
1449 return memblock.reserved.total_size;
1450}
1451
Yinghai Lu595ad9a2013-01-24 12:20:09 -08001452phys_addr_t __init memblock_mem_size(unsigned long limit_pfn)
1453{
1454 unsigned long pages = 0;
1455 struct memblock_region *r;
1456 unsigned long start_pfn, end_pfn;
1457
1458 for_each_memblock(memory, r) {
1459 start_pfn = memblock_region_memory_base_pfn(r);
1460 end_pfn = memblock_region_memory_end_pfn(r);
1461 start_pfn = min_t(unsigned long, start_pfn, limit_pfn);
1462 end_pfn = min_t(unsigned long, end_pfn, limit_pfn);
1463 pages += end_pfn - start_pfn;
1464 }
1465
Fabian Frederick16763232014-04-07 15:37:53 -07001466 return PFN_PHYS(pages);
Yinghai Lu595ad9a2013-01-24 12:20:09 -08001467}
1468
Sam Ravnborg0a93ebe2011-10-31 17:08:16 -07001469/* lowest address */
1470phys_addr_t __init_memblock memblock_start_of_DRAM(void)
1471{
1472 return memblock.memory.regions[0].base;
1473}
1474
Yinghai Lu10d06432010-07-28 15:43:02 +10001475phys_addr_t __init_memblock memblock_end_of_DRAM(void)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001476{
1477 int idx = memblock.memory.cnt - 1;
1478
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +10001479 return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001480}
1481
Dennis Chena571d4e2016-07-28 15:48:26 -07001482static phys_addr_t __init_memblock __find_max_addr(phys_addr_t limit)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001483{
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001484 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
Emil Medve136199f2014-04-07 15:37:52 -07001485 struct memblock_region *r;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001486
Dennis Chena571d4e2016-07-28 15:48:26 -07001487 /*
1488 * translate the memory @limit size into the max address within one of
1489 * the memory memblock regions, if the @limit exceeds the total size
1490 * of those regions, max_addr will keep original value ULLONG_MAX
1491 */
Emil Medve136199f2014-04-07 15:37:52 -07001492 for_each_memblock(memory, r) {
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001493 if (limit <= r->size) {
1494 max_addr = r->base + limit;
1495 break;
1496 }
1497 limit -= r->size;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001498 }
1499
Dennis Chena571d4e2016-07-28 15:48:26 -07001500 return max_addr;
1501}
1502
1503void __init memblock_enforce_memory_limit(phys_addr_t limit)
1504{
1505 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
1506
1507 if (!limit)
1508 return;
1509
1510 max_addr = __find_max_addr(limit);
1511
1512 /* @limit exceeds the total size of the memory, do nothing */
1513 if (max_addr == (phys_addr_t)ULLONG_MAX)
1514 return;
1515
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001516 /* truncate both memory and reserved regions */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001517 memblock_remove_range(&memblock.memory, max_addr,
1518 (phys_addr_t)ULLONG_MAX);
1519 memblock_remove_range(&memblock.reserved, max_addr,
1520 (phys_addr_t)ULLONG_MAX);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001521}
1522
Dennis Chena571d4e2016-07-28 15:48:26 -07001523void __init memblock_mem_limit_remove_map(phys_addr_t limit)
1524{
1525 struct memblock_type *type = &memblock.memory;
1526 phys_addr_t max_addr;
1527 int i, ret, start_rgn, end_rgn;
1528
1529 if (!limit)
1530 return;
1531
1532 max_addr = __find_max_addr(limit);
1533
1534 /* @limit exceeds the total size of the memory, do nothing */
1535 if (max_addr == (phys_addr_t)ULLONG_MAX)
1536 return;
1537
1538 ret = memblock_isolate_range(type, max_addr, (phys_addr_t)ULLONG_MAX,
1539 &start_rgn, &end_rgn);
1540 if (ret)
1541 return;
1542
1543 /* remove all the MAP regions above the limit */
1544 for (i = end_rgn - 1; i >= start_rgn; i--) {
1545 if (!memblock_is_nomap(&type->regions[i]))
1546 memblock_remove_region(type, i);
1547 }
1548 /* truncate the reserved regions */
1549 memblock_remove_range(&memblock.reserved, max_addr,
1550 (phys_addr_t)ULLONG_MAX);
1551}
1552
Shiraz Hashime1525702016-02-04 14:53:33 +05301553static int __init_memblock __memblock_search(struct memblock_type *type,
1554 phys_addr_t addr)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001555{
1556 unsigned int left = 0, right = type->cnt;
1557
1558 do {
1559 unsigned int mid = (right + left) / 2;
1560
1561 if (addr < type->regions[mid].base)
1562 right = mid;
1563 else if (addr >= (type->regions[mid].base +
1564 type->regions[mid].size))
1565 left = mid + 1;
1566 else
1567 return mid;
1568 } while (left < right);
1569 return -1;
1570}
1571
Shiraz Hashime1525702016-02-04 14:53:33 +05301572static int __init_memblock memblock_search(struct memblock_type *type,
1573 phys_addr_t addr)
1574{
1575 int ret;
1576 unsigned long seq;
1577
1578 do {
1579 seq = raw_read_seqcount_begin(&memblock_seq);
1580 ret = __memblock_search(type, addr);
1581 } while (unlikely(read_seqcount_retry(&memblock_seq, seq)));
1582
1583 return ret;
1584}
1585
Yaowei Baib4ad0c72016-01-14 15:18:54 -08001586bool __init memblock_is_reserved(phys_addr_t addr)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001587{
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001588 return memblock_search(&memblock.reserved, addr) != -1;
1589}
Yinghai Lu95f72d12010-07-12 14:36:09 +10001590
Yaowei Baib4ad0c72016-01-14 15:18:54 -08001591bool __init_memblock memblock_is_memory(phys_addr_t addr)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001592{
1593 return memblock_search(&memblock.memory, addr) != -1;
1594}
1595
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +01001596int __init_memblock memblock_is_map_memory(phys_addr_t addr)
1597{
1598 int i = memblock_search(&memblock.memory, addr);
1599
1600 if (i == -1)
1601 return false;
1602 return !memblock_is_nomap(&memblock.memory.regions[i]);
1603}
1604
Yinghai Lue76b63f2013-09-11 14:22:17 -07001605#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1606int __init_memblock memblock_search_pfn_nid(unsigned long pfn,
1607 unsigned long *start_pfn, unsigned long *end_pfn)
1608{
1609 struct memblock_type *type = &memblock.memory;
Fabian Frederick16763232014-04-07 15:37:53 -07001610 int mid = memblock_search(type, PFN_PHYS(pfn));
Yinghai Lue76b63f2013-09-11 14:22:17 -07001611
1612 if (mid == -1)
1613 return -1;
1614
Fabian Frederickf7e2f7e2014-06-04 16:07:51 -07001615 *start_pfn = PFN_DOWN(type->regions[mid].base);
1616 *end_pfn = PFN_DOWN(type->regions[mid].base + type->regions[mid].size);
Yinghai Lue76b63f2013-09-11 14:22:17 -07001617
1618 return type->regions[mid].nid;
1619}
1620#endif
1621
Stephen Boydeab30942012-05-24 00:45:21 -07001622/**
1623 * memblock_is_region_memory - check if a region is a subset of memory
1624 * @base: base of region to check
1625 * @size: size of region to check
1626 *
1627 * Check if the region [@base, @base+@size) is a subset of a memory block.
1628 *
1629 * RETURNS:
1630 * 0 if false, non-zero if true
1631 */
Yinghai Lu3661ca62010-09-15 13:05:29 -07001632int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001633{
Tomi Valkeinenabb65272011-01-20 14:44:20 -08001634 int idx = memblock_search(&memblock.memory, base);
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001635 phys_addr_t end = base + memblock_cap_size(base, &size);
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001636
1637 if (idx == -1)
1638 return 0;
Tomi Valkeinenabb65272011-01-20 14:44:20 -08001639 return memblock.memory.regions[idx].base <= base &&
1640 (memblock.memory.regions[idx].base +
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001641 memblock.memory.regions[idx].size) >= end;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001642}
1643
Stephen Boyd48cc5402017-03-01 16:42:02 -08001644bool __init_memblock memblock_overlaps_memory(phys_addr_t base,
1645 phys_addr_t size)
Stephen Boyd39ea1a32012-05-14 18:55:50 -07001646{
1647 memblock_cap_size(base, &size);
1648
Stephen Boyd48cc5402017-03-01 16:42:02 -08001649 return memblock_overlaps_region(&memblock.memory, base, size);
Stephen Boyd39ea1a32012-05-14 18:55:50 -07001650}
1651
Stephen Boydeab30942012-05-24 00:45:21 -07001652/**
1653 * memblock_is_region_reserved - check if a region intersects reserved memory
1654 * @base: base of region to check
1655 * @size: size of region to check
1656 *
1657 * Check if the region [@base, @base+@size) intersects a reserved memory block.
1658 *
1659 * RETURNS:
Tang Chenc5c5c9d2015-09-08 15:02:00 -07001660 * True if they intersect, false if not.
Stephen Boydeab30942012-05-24 00:45:21 -07001661 */
Tang Chenc5c5c9d2015-09-08 15:02:00 -07001662bool __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001663{
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001664 memblock_cap_size(base, &size);
Tang Chenc5c5c9d2015-09-08 15:02:00 -07001665 return memblock_overlaps_region(&memblock.reserved, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001666}
1667
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001668void __init_memblock memblock_trim_memory(phys_addr_t align)
1669{
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001670 phys_addr_t start, end, orig_start, orig_end;
Emil Medve136199f2014-04-07 15:37:52 -07001671 struct memblock_region *r;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001672
Emil Medve136199f2014-04-07 15:37:52 -07001673 for_each_memblock(memory, r) {
1674 orig_start = r->base;
1675 orig_end = r->base + r->size;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001676 start = round_up(orig_start, align);
1677 end = round_down(orig_end, align);
1678
1679 if (start == orig_start && end == orig_end)
1680 continue;
1681
1682 if (start < end) {
Emil Medve136199f2014-04-07 15:37:52 -07001683 r->base = start;
1684 r->size = end - start;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001685 } else {
Emil Medve136199f2014-04-07 15:37:52 -07001686 memblock_remove_region(&memblock.memory,
1687 r - memblock.memory.regions);
1688 r--;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001689 }
1690 }
1691}
Benjamin Herrenschmidte63075a2010-07-06 15:39:01 -07001692
Yinghai Lu3661ca62010-09-15 13:05:29 -07001693void __init_memblock memblock_set_current_limit(phys_addr_t limit)
Benjamin Herrenschmidte63075a2010-07-06 15:39:01 -07001694{
1695 memblock.current_limit = limit;
1696}
1697
Laura Abbottfec51012014-02-27 01:23:43 +01001698phys_addr_t __init_memblock memblock_get_current_limit(void)
1699{
1700 return memblock.current_limit;
1701}
1702
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001703static void __init_memblock memblock_dump(struct memblock_type *type, char *name)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001704{
1705 unsigned long long base, size;
Tang Chen66a20752014-01-21 15:49:20 -08001706 unsigned long flags;
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -08001707 int idx;
1708 struct memblock_region *rgn;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001709
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001710 pr_info(" %s.cnt = 0x%lx\n", name, type->cnt);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001711
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -08001712 for_each_memblock_type(type, rgn) {
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001713 char nid_buf[32] = "";
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001714
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001715 base = rgn->base;
1716 size = rgn->size;
Tang Chen66a20752014-01-21 15:49:20 -08001717 flags = rgn->flags;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001718#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1719 if (memblock_get_region_node(rgn) != MAX_NUMNODES)
1720 snprintf(nid_buf, sizeof(nid_buf), " on node %d",
1721 memblock_get_region_node(rgn));
1722#endif
Tang Chen66a20752014-01-21 15:49:20 -08001723 pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s flags: %#lx\n",
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -08001724 name, idx, base, base + size - 1, size, nid_buf, flags);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001725 }
1726}
1727
Tejun Heo4ff7b822011-12-08 10:22:06 -08001728void __init_memblock __memblock_dump_all(void)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001729{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001730 pr_info("MEMBLOCK configuration:\n");
Tejun Heo1440c4e2011-12-08 10:22:08 -08001731 pr_info(" memory size = %#llx reserved size = %#llx\n",
1732 (unsigned long long)memblock.memory.total_size,
1733 (unsigned long long)memblock.reserved.total_size);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001734
1735 memblock_dump(&memblock.memory, "memory");
1736 memblock_dump(&memblock.reserved, "reserved");
1737}
1738
Tejun Heo1aadc052011-12-08 10:22:08 -08001739void __init memblock_allow_resize(void)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001740{
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -07001741 memblock_can_resize = 1;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001742}
1743
Shiraz Hashim3eaf6e62016-04-16 11:43:02 +05301744static unsigned long __init_memblock
1745memblock_resize_late(int begin, unsigned long flags)
Shiraz Hashime1525702016-02-04 14:53:33 +05301746{
1747 static int memblock_can_resize_old;
1748
1749 if (begin) {
1750 preempt_disable();
Shiraz Hashim3eaf6e62016-04-16 11:43:02 +05301751 local_irq_save(flags);
Shiraz Hashime1525702016-02-04 14:53:33 +05301752 memblock_can_resize_old = memblock_can_resize;
1753 memblock_can_resize = 0;
1754 raw_write_seqcount_begin(&memblock_seq);
1755 } else {
1756 raw_write_seqcount_end(&memblock_seq);
1757 memblock_can_resize = memblock_can_resize_old;
Shiraz Hashim3eaf6e62016-04-16 11:43:02 +05301758 local_irq_restore(flags);
Shiraz Hashime1525702016-02-04 14:53:33 +05301759 preempt_enable();
1760 }
Shiraz Hashim3eaf6e62016-04-16 11:43:02 +05301761
1762 return flags;
Shiraz Hashime1525702016-02-04 14:53:33 +05301763}
1764
Shiraz Hashim3eaf6e62016-04-16 11:43:02 +05301765unsigned long __init_memblock memblock_region_resize_late_begin(void)
Shiraz Hashime1525702016-02-04 14:53:33 +05301766{
Shiraz Hashim3eaf6e62016-04-16 11:43:02 +05301767 return memblock_resize_late(1, 0);
Shiraz Hashime1525702016-02-04 14:53:33 +05301768}
1769
Shiraz Hashim3eaf6e62016-04-16 11:43:02 +05301770void __init_memblock memblock_region_resize_late_end(unsigned long flags)
Shiraz Hashime1525702016-02-04 14:53:33 +05301771{
Shiraz Hashim3eaf6e62016-04-16 11:43:02 +05301772 memblock_resize_late(0, flags);
Shiraz Hashime1525702016-02-04 14:53:33 +05301773}
1774
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001775static int __init early_memblock(char *p)
1776{
1777 if (p && strstr(p, "debug"))
1778 memblock_debug = 1;
1779 return 0;
1780}
1781early_param("memblock", early_memblock);
1782
Tejun Heoc378ddd2011-07-14 11:46:03 +02001783#if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001784
1785static int memblock_debug_show(struct seq_file *m, void *private)
1786{
1787 struct memblock_type *type = m->private;
1788 struct memblock_region *reg;
1789 int i;
1790
1791 for (i = 0; i < type->cnt; i++) {
1792 reg = &type->regions[i];
1793 seq_printf(m, "%4d: ", i);
1794 if (sizeof(phys_addr_t) == 4)
1795 seq_printf(m, "0x%08lx..0x%08lx\n",
1796 (unsigned long)reg->base,
1797 (unsigned long)(reg->base + reg->size - 1));
1798 else
1799 seq_printf(m, "0x%016llx..0x%016llx\n",
1800 (unsigned long long)reg->base,
1801 (unsigned long long)(reg->base + reg->size - 1));
1802
1803 }
1804 return 0;
1805}
1806
1807static int memblock_debug_open(struct inode *inode, struct file *file)
1808{
1809 return single_open(file, memblock_debug_show, inode->i_private);
1810}
1811
1812static const struct file_operations memblock_debug_fops = {
1813 .open = memblock_debug_open,
1814 .read = seq_read,
1815 .llseek = seq_lseek,
1816 .release = single_release,
1817};
1818
1819static int __init memblock_init_debugfs(void)
1820{
1821 struct dentry *root = debugfs_create_dir("memblock", NULL);
1822 if (!root)
1823 return -ENXIO;
1824 debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops);
1825 debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops);
Philipp Hachtmann70210ed2014-01-29 18:16:01 +01001826#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
1827 debugfs_create_file("physmem", S_IRUGO, root, &memblock.physmem, &memblock_debug_fops);
1828#endif
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001829
1830 return 0;
1831}
1832__initcall(memblock_init_debugfs);
1833
1834#endif /* CONFIG_DEBUG_FS */