blob: ac1248933b3172d6d46ddf3ccf0745db2371adce [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
Tang Chen79442ed2013-11-12 15:07:59 -080023#include <asm-generic/sections.h>
Santosh Shilimkar26f09e92014-01-21 15:50:19 -080024#include <linux/io.h>
25
26#include "internal.h"
Tang Chen79442ed2013-11-12 15:07:59 -080027
Tejun Heofe091c22011-12-08 10:22:07 -080028static struct memblock_region memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock;
29static struct memblock_region memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock;
Philipp Hachtmann70210ed2014-01-29 18:16:01 +010030#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
31static struct memblock_region memblock_physmem_init_regions[INIT_PHYSMEM_REGIONS] __initdata_memblock;
32#endif
Tejun Heofe091c22011-12-08 10:22:07 -080033
34struct memblock memblock __initdata_memblock = {
35 .memory.regions = memblock_memory_init_regions,
36 .memory.cnt = 1, /* empty dummy entry */
37 .memory.max = INIT_MEMBLOCK_REGIONS,
38
39 .reserved.regions = memblock_reserved_init_regions,
40 .reserved.cnt = 1, /* empty dummy entry */
41 .reserved.max = INIT_MEMBLOCK_REGIONS,
42
Philipp Hachtmann70210ed2014-01-29 18:16:01 +010043#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
44 .physmem.regions = memblock_physmem_init_regions,
45 .physmem.cnt = 1, /* empty dummy entry */
46 .physmem.max = INIT_PHYSMEM_REGIONS,
47#endif
48
Tang Chen79442ed2013-11-12 15:07:59 -080049 .bottom_up = false,
Tejun Heofe091c22011-12-08 10:22:07 -080050 .current_limit = MEMBLOCK_ALLOC_ANYWHERE,
51};
Yinghai Lu95f72d12010-07-12 14:36:09 +100052
Yinghai Lu10d06432010-07-28 15:43:02 +100053int memblock_debug __initdata_memblock;
Tang Chen55ac5902014-01-21 15:49:35 -080054#ifdef CONFIG_MOVABLE_NODE
55bool movable_node_enabled __initdata_memblock = false;
56#endif
Tony Lucka3f5baf2015-06-24 16:58:12 -070057static bool system_has_some_mirror __initdata_memblock = false;
Tejun Heo1aadc052011-12-08 10:22:08 -080058static int memblock_can_resize __initdata_memblock;
Gavin Shan181eb392012-05-29 15:06:50 -070059static int memblock_memory_in_slab __initdata_memblock = 0;
60static int memblock_reserved_in_slab __initdata_memblock = 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +100061
Tony Lucka3f5baf2015-06-24 16:58:12 -070062ulong __init_memblock choose_memblock_flags(void)
63{
64 return system_has_some_mirror ? MEMBLOCK_MIRROR : MEMBLOCK_NONE;
65}
66
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -070067/* inline so we don't get a warning when pr_debug is compiled out */
Raghavendra D Prabhuc2233112012-10-08 16:33:55 -070068static __init_memblock const char *
69memblock_type_name(struct memblock_type *type)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -070070{
71 if (type == &memblock.memory)
72 return "memory";
73 else if (type == &memblock.reserved)
74 return "reserved";
75 else
76 return "unknown";
77}
78
Tejun Heoeb18f1b2011-12-08 10:22:07 -080079/* adjust *@size so that (@base + *@size) doesn't overflow, return new size */
80static inline phys_addr_t memblock_cap_size(phys_addr_t base, phys_addr_t *size)
81{
82 return *size = min(*size, (phys_addr_t)ULLONG_MAX - base);
83}
84
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100085/*
86 * Address comparison utilities
87 */
Yinghai Lu10d06432010-07-28 15:43:02 +100088static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1,
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +100089 phys_addr_t base2, phys_addr_t size2)
Yinghai Lu95f72d12010-07-12 14:36:09 +100090{
91 return ((base1 < (base2 + size2)) && (base2 < (base1 + size1)));
92}
93
Tang Chen95cf82e2015-09-08 15:02:03 -070094bool __init_memblock memblock_overlaps_region(struct memblock_type *type,
H Hartley Sweeten2d7d3eb2011-10-31 17:09:15 -070095 phys_addr_t base, phys_addr_t size)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100096{
97 unsigned long i;
98
Alexander Kuleshovf14516f2016-01-14 15:20:39 -080099 for (i = 0; i < type->cnt; i++)
100 if (memblock_addrs_overlap(base, size, type->regions[i].base,
101 type->regions[i].size))
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000102 break;
Tang Chenc5c5c9d2015-09-08 15:02:00 -0700103 return i < type->cnt;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000104}
105
Tang Chen79442ed2013-11-12 15:07:59 -0800106/*
107 * __memblock_find_range_bottom_up - find free area utility in bottom-up
108 * @start: start of candidate range
109 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
110 * @size: size of free area to find
111 * @align: alignment of free area to find
Grygorii Strashkob1154232014-01-21 15:50:16 -0800112 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Tony Luckfc6daaf2015-06-24 16:58:09 -0700113 * @flags: pick from blocks based on memory attributes
Tang Chen79442ed2013-11-12 15:07:59 -0800114 *
115 * Utility called from memblock_find_in_range_node(), find free area bottom-up.
116 *
117 * RETURNS:
118 * Found address on success, 0 on failure.
119 */
120static phys_addr_t __init_memblock
121__memblock_find_range_bottom_up(phys_addr_t start, phys_addr_t end,
Tony Luckfc6daaf2015-06-24 16:58:09 -0700122 phys_addr_t size, phys_addr_t align, int nid,
123 ulong flags)
Tang Chen79442ed2013-11-12 15:07:59 -0800124{
125 phys_addr_t this_start, this_end, cand;
126 u64 i;
127
Tony Luckfc6daaf2015-06-24 16:58:09 -0700128 for_each_free_mem_range(i, nid, flags, &this_start, &this_end, NULL) {
Tang Chen79442ed2013-11-12 15:07:59 -0800129 this_start = clamp(this_start, start, end);
130 this_end = clamp(this_end, start, end);
131
132 cand = round_up(this_start, align);
133 if (cand < this_end && this_end - cand >= size)
134 return cand;
135 }
136
137 return 0;
138}
139
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800140/**
Tang Chen14028992013-11-12 15:07:57 -0800141 * __memblock_find_range_top_down - find free area utility, in top-down
142 * @start: start of candidate range
143 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
144 * @size: size of free area to find
145 * @align: alignment of free area to find
Grygorii Strashkob1154232014-01-21 15:50:16 -0800146 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Tony Luckfc6daaf2015-06-24 16:58:09 -0700147 * @flags: pick from blocks based on memory attributes
Tang Chen14028992013-11-12 15:07:57 -0800148 *
149 * Utility called from memblock_find_in_range_node(), find free area top-down.
150 *
151 * RETURNS:
Tang Chen79442ed2013-11-12 15:07:59 -0800152 * Found address on success, 0 on failure.
Tang Chen14028992013-11-12 15:07:57 -0800153 */
154static phys_addr_t __init_memblock
155__memblock_find_range_top_down(phys_addr_t start, phys_addr_t end,
Tony Luckfc6daaf2015-06-24 16:58:09 -0700156 phys_addr_t size, phys_addr_t align, int nid,
157 ulong flags)
Tang Chen14028992013-11-12 15:07:57 -0800158{
159 phys_addr_t this_start, this_end, cand;
160 u64 i;
161
Tony Luckfc6daaf2015-06-24 16:58:09 -0700162 for_each_free_mem_range_reverse(i, nid, flags, &this_start, &this_end,
163 NULL) {
Tang Chen14028992013-11-12 15:07:57 -0800164 this_start = clamp(this_start, start, end);
165 this_end = clamp(this_end, start, end);
166
167 if (this_end < size)
168 continue;
169
170 cand = round_down(this_end - size, align);
171 if (cand >= this_start)
172 return cand;
173 }
174
175 return 0;
176}
177
178/**
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800179 * memblock_find_in_range_node - find free area in given range and node
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800180 * @size: size of free area to find
181 * @align: alignment of free area to find
Grygorii Strashko87029ee2014-01-21 15:50:14 -0800182 * @start: start of candidate range
183 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
Grygorii Strashkob1154232014-01-21 15:50:16 -0800184 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Tony Luckfc6daaf2015-06-24 16:58:09 -0700185 * @flags: pick from blocks based on memory attributes
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800186 *
187 * Find @size free area aligned to @align in the specified range and node.
188 *
Tang Chen79442ed2013-11-12 15:07:59 -0800189 * When allocation direction is bottom-up, the @start should be greater
190 * than the end of the kernel image. Otherwise, it will be trimmed. The
191 * reason is that we want the bottom-up allocation just near the kernel
192 * image so it is highly likely that the allocated memory and the kernel
193 * will reside in the same node.
194 *
195 * If bottom-up allocation failed, will try to allocate memory top-down.
196 *
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800197 * RETURNS:
Tang Chen79442ed2013-11-12 15:07:59 -0800198 * Found address on success, 0 on failure.
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000199 */
Grygorii Strashko87029ee2014-01-21 15:50:14 -0800200phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t size,
201 phys_addr_t align, phys_addr_t start,
Tony Luckfc6daaf2015-06-24 16:58:09 -0700202 phys_addr_t end, int nid, ulong flags)
Tang Chenf7210e62013-02-22 16:33:51 -0800203{
Tang Chen0cfb8f02014-08-29 15:18:31 -0700204 phys_addr_t kernel_end, ret;
Tang Chen79442ed2013-11-12 15:07:59 -0800205
Tang Chenf7210e62013-02-22 16:33:51 -0800206 /* pump up @end */
207 if (end == MEMBLOCK_ALLOC_ACCESSIBLE)
208 end = memblock.current_limit;
209
210 /* avoid allocating the first page */
211 start = max_t(phys_addr_t, start, PAGE_SIZE);
212 end = max(start, end);
Tang Chen79442ed2013-11-12 15:07:59 -0800213 kernel_end = __pa_symbol(_end);
214
215 /*
216 * try bottom-up allocation only when bottom-up mode
217 * is set and @end is above the kernel image.
218 */
219 if (memblock_bottom_up() && end > kernel_end) {
220 phys_addr_t bottom_up_start;
221
222 /* make sure we will allocate above the kernel */
223 bottom_up_start = max(start, kernel_end);
224
225 /* ok, try bottom-up allocation first */
226 ret = __memblock_find_range_bottom_up(bottom_up_start, end,
Tony Luckfc6daaf2015-06-24 16:58:09 -0700227 size, align, nid, flags);
Tang Chen79442ed2013-11-12 15:07:59 -0800228 if (ret)
229 return ret;
230
231 /*
232 * we always limit bottom-up allocation above the kernel,
233 * but top-down allocation doesn't have the limit, so
234 * retrying top-down allocation may succeed when bottom-up
235 * allocation failed.
236 *
237 * bottom-up allocation is expected to be fail very rarely,
238 * so we use WARN_ONCE() here to see the stack trace if
239 * fail happens.
240 */
Joe Perches756a0252016-03-17 14:19:47 -0700241 WARN_ONCE(1, "memblock: bottom-up allocation failed, memory hotunplug may be affected\n");
Tang Chen79442ed2013-11-12 15:07:59 -0800242 }
Tang Chenf7210e62013-02-22 16:33:51 -0800243
Tony Luckfc6daaf2015-06-24 16:58:09 -0700244 return __memblock_find_range_top_down(start, end, size, align, nid,
245 flags);
Tang Chenf7210e62013-02-22 16:33:51 -0800246}
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000247
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800248/**
249 * memblock_find_in_range - find free area in given range
250 * @start: start of candidate range
251 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
252 * @size: size of free area to find
253 * @align: alignment of free area to find
254 *
255 * Find @size free area aligned to @align in the specified range.
256 *
257 * RETURNS:
Tang Chen79442ed2013-11-12 15:07:59 -0800258 * Found address on success, 0 on failure.
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800259 */
260phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start,
261 phys_addr_t end, phys_addr_t size,
262 phys_addr_t align)
263{
Tony Lucka3f5baf2015-06-24 16:58:12 -0700264 phys_addr_t ret;
265 ulong flags = choose_memblock_flags();
266
267again:
268 ret = memblock_find_in_range_node(size, align, start, end,
269 NUMA_NO_NODE, flags);
270
271 if (!ret && (flags & MEMBLOCK_MIRROR)) {
272 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
273 &size);
274 flags &= ~MEMBLOCK_MIRROR;
275 goto again;
276 }
277
278 return ret;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800279}
280
Yinghai Lu10d06432010-07-28 15:43:02 +1000281static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000282{
Tejun Heo1440c4e2011-12-08 10:22:08 -0800283 type->total_size -= type->regions[r].size;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200284 memmove(&type->regions[r], &type->regions[r + 1],
285 (type->cnt - (r + 1)) * sizeof(type->regions[r]));
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000286 type->cnt--;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000287
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700288 /* Special case for empty arrays */
289 if (type->cnt == 0) {
Tejun Heo1440c4e2011-12-08 10:22:08 -0800290 WARN_ON(type->total_size != 0);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700291 type->cnt = 1;
292 type->regions[0].base = 0;
293 type->regions[0].size = 0;
Tang Chen66a20752014-01-21 15:49:20 -0800294 type->regions[0].flags = 0;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200295 memblock_set_region_node(&type->regions[0], MAX_NUMNODES);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700296 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000297}
298
Philipp Hachtmann354f17e2014-01-23 15:53:24 -0800299#ifdef CONFIG_ARCH_DISCARD_MEMBLOCK
300
Yinghai Lu29f67382012-07-11 14:02:56 -0700301phys_addr_t __init_memblock get_allocated_memblock_reserved_regions_info(
302 phys_addr_t *addr)
303{
304 if (memblock.reserved.regions == memblock_reserved_init_regions)
305 return 0;
306
307 *addr = __pa(memblock.reserved.regions);
308
309 return PAGE_ALIGN(sizeof(struct memblock_region) *
310 memblock.reserved.max);
311}
312
Philipp Hachtmann5e270e22014-01-23 15:53:11 -0800313phys_addr_t __init_memblock get_allocated_memblock_memory_regions_info(
314 phys_addr_t *addr)
315{
316 if (memblock.memory.regions == memblock_memory_init_regions)
317 return 0;
318
319 *addr = __pa(memblock.memory.regions);
320
321 return PAGE_ALIGN(sizeof(struct memblock_region) *
322 memblock.memory.max);
323}
324
325#endif
326
Greg Pearson48c3b582012-06-20 12:53:05 -0700327/**
328 * memblock_double_array - double the size of the memblock regions array
329 * @type: memblock type of the regions array being doubled
330 * @new_area_start: starting address of memory range to avoid overlap with
331 * @new_area_size: size of memory range to avoid overlap with
332 *
333 * Double the size of the @type regions array. If memblock is being used to
334 * allocate memory for a new reserved regions array and there is a previously
335 * allocated memory range [@new_area_start,@new_area_start+@new_area_size]
336 * waiting to be reserved, ensure the memory used by the new array does
337 * not overlap.
338 *
339 * RETURNS:
340 * 0 on success, -1 on failure.
341 */
342static int __init_memblock memblock_double_array(struct memblock_type *type,
343 phys_addr_t new_area_start,
344 phys_addr_t new_area_size)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700345{
346 struct memblock_region *new_array, *old_array;
Yinghai Lu29f67382012-07-11 14:02:56 -0700347 phys_addr_t old_alloc_size, new_alloc_size;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700348 phys_addr_t old_size, new_size, addr;
349 int use_slab = slab_is_available();
Gavin Shan181eb392012-05-29 15:06:50 -0700350 int *in_slab;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700351
352 /* We don't allow resizing until we know about the reserved regions
353 * of memory that aren't suitable for allocation
354 */
355 if (!memblock_can_resize)
356 return -1;
357
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700358 /* Calculate new doubled size */
359 old_size = type->max * sizeof(struct memblock_region);
360 new_size = old_size << 1;
Yinghai Lu29f67382012-07-11 14:02:56 -0700361 /*
362 * We need to allocated new one align to PAGE_SIZE,
363 * so we can free them completely later.
364 */
365 old_alloc_size = PAGE_ALIGN(old_size);
366 new_alloc_size = PAGE_ALIGN(new_size);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700367
Gavin Shan181eb392012-05-29 15:06:50 -0700368 /* Retrieve the slab flag */
369 if (type == &memblock.memory)
370 in_slab = &memblock_memory_in_slab;
371 else
372 in_slab = &memblock_reserved_in_slab;
373
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700374 /* Try to find some space for it.
375 *
376 * WARNING: We assume that either slab_is_available() and we use it or
Andrew Mortonfd073832012-07-31 16:42:40 -0700377 * we use MEMBLOCK for allocations. That means that this is unsafe to
378 * use when bootmem is currently active (unless bootmem itself is
379 * implemented on top of MEMBLOCK which isn't the case yet)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700380 *
381 * This should however not be an issue for now, as we currently only
Andrew Mortonfd073832012-07-31 16:42:40 -0700382 * call into MEMBLOCK while it's still active, or much later when slab
383 * is active for memory hotplug operations
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700384 */
385 if (use_slab) {
386 new_array = kmalloc(new_size, GFP_KERNEL);
Tejun Heo1f5026a2011-07-12 09:58:09 +0200387 addr = new_array ? __pa(new_array) : 0;
Gavin Shan4e2f0772012-05-29 15:06:50 -0700388 } else {
Greg Pearson48c3b582012-06-20 12:53:05 -0700389 /* only exclude range when trying to double reserved.regions */
390 if (type != &memblock.reserved)
391 new_area_start = new_area_size = 0;
392
393 addr = memblock_find_in_range(new_area_start + new_area_size,
394 memblock.current_limit,
Yinghai Lu29f67382012-07-11 14:02:56 -0700395 new_alloc_size, PAGE_SIZE);
Greg Pearson48c3b582012-06-20 12:53:05 -0700396 if (!addr && new_area_size)
397 addr = memblock_find_in_range(0,
Andrew Mortonfd073832012-07-31 16:42:40 -0700398 min(new_area_start, memblock.current_limit),
399 new_alloc_size, PAGE_SIZE);
Greg Pearson48c3b582012-06-20 12:53:05 -0700400
Sachin Kamat15674862012-09-04 13:55:05 +0530401 new_array = addr ? __va(addr) : NULL;
Gavin Shan4e2f0772012-05-29 15:06:50 -0700402 }
Tejun Heo1f5026a2011-07-12 09:58:09 +0200403 if (!addr) {
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700404 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
405 memblock_type_name(type), type->max, type->max * 2);
406 return -1;
407 }
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700408
Andrew Mortonfd073832012-07-31 16:42:40 -0700409 memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]",
410 memblock_type_name(type), type->max * 2, (u64)addr,
411 (u64)addr + new_size - 1);
Yinghai Luea9e4372010-07-28 15:13:22 +1000412
Andrew Mortonfd073832012-07-31 16:42:40 -0700413 /*
414 * Found space, we now need to move the array over before we add the
415 * reserved region since it may be our reserved array itself that is
416 * full.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700417 */
418 memcpy(new_array, type->regions, old_size);
419 memset(new_array + type->max, 0, old_size);
420 old_array = type->regions;
421 type->regions = new_array;
422 type->max <<= 1;
423
Andrew Mortonfd073832012-07-31 16:42:40 -0700424 /* Free old array. We needn't free it if the array is the static one */
Gavin Shan181eb392012-05-29 15:06:50 -0700425 if (*in_slab)
426 kfree(old_array);
427 else if (old_array != memblock_memory_init_regions &&
428 old_array != memblock_reserved_init_regions)
Yinghai Lu29f67382012-07-11 14:02:56 -0700429 memblock_free(__pa(old_array), old_alloc_size);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700430
Andrew Mortonfd073832012-07-31 16:42:40 -0700431 /*
432 * Reserve the new array if that comes from the memblock. Otherwise, we
433 * needn't do it
Gavin Shan181eb392012-05-29 15:06:50 -0700434 */
435 if (!use_slab)
Yinghai Lu29f67382012-07-11 14:02:56 -0700436 BUG_ON(memblock_reserve(addr, new_alloc_size));
Gavin Shan181eb392012-05-29 15:06:50 -0700437
438 /* Update slab flag */
439 *in_slab = use_slab;
440
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700441 return 0;
442}
443
Tejun Heo784656f92011-07-12 11:15:55 +0200444/**
445 * memblock_merge_regions - merge neighboring compatible regions
446 * @type: memblock type to scan
447 *
448 * Scan @type and merge neighboring compatible regions.
449 */
450static void __init_memblock memblock_merge_regions(struct memblock_type *type)
451{
452 int i = 0;
453
454 /* cnt never goes below 1 */
455 while (i < type->cnt - 1) {
456 struct memblock_region *this = &type->regions[i];
457 struct memblock_region *next = &type->regions[i + 1];
458
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200459 if (this->base + this->size != next->base ||
460 memblock_get_region_node(this) !=
Tang Chen66a20752014-01-21 15:49:20 -0800461 memblock_get_region_node(next) ||
462 this->flags != next->flags) {
Tejun Heo784656f92011-07-12 11:15:55 +0200463 BUG_ON(this->base + this->size > next->base);
464 i++;
465 continue;
466 }
467
468 this->size += next->size;
Lin Fengc0232ae2013-01-11 14:31:44 -0800469 /* move forward from next + 1, index of which is i + 2 */
470 memmove(next, next + 1, (type->cnt - (i + 2)) * sizeof(*next));
Tejun Heo784656f92011-07-12 11:15:55 +0200471 type->cnt--;
472 }
473}
474
475/**
476 * memblock_insert_region - insert new memblock region
Tang Chen209ff862013-04-29 15:08:41 -0700477 * @type: memblock type to insert into
478 * @idx: index for the insertion point
479 * @base: base address of the new region
480 * @size: size of the new region
481 * @nid: node id of the new region
Tang Chen66a20752014-01-21 15:49:20 -0800482 * @flags: flags of the new region
Tejun Heo784656f92011-07-12 11:15:55 +0200483 *
484 * Insert new memblock region [@base,@base+@size) into @type at @idx.
485 * @type must already have extra room to accomodate the new region.
486 */
487static void __init_memblock memblock_insert_region(struct memblock_type *type,
488 int idx, phys_addr_t base,
Tang Chen66a20752014-01-21 15:49:20 -0800489 phys_addr_t size,
490 int nid, unsigned long flags)
Tejun Heo784656f92011-07-12 11:15:55 +0200491{
492 struct memblock_region *rgn = &type->regions[idx];
493
494 BUG_ON(type->cnt >= type->max);
495 memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn));
496 rgn->base = base;
497 rgn->size = size;
Tang Chen66a20752014-01-21 15:49:20 -0800498 rgn->flags = flags;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200499 memblock_set_region_node(rgn, nid);
Tejun Heo784656f92011-07-12 11:15:55 +0200500 type->cnt++;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800501 type->total_size += size;
Tejun Heo784656f92011-07-12 11:15:55 +0200502}
503
504/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100505 * memblock_add_range - add new memblock region
Tejun Heo784656f92011-07-12 11:15:55 +0200506 * @type: memblock type to add new region into
507 * @base: base address of the new region
508 * @size: size of the new region
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800509 * @nid: nid of the new region
Tang Chen66a20752014-01-21 15:49:20 -0800510 * @flags: flags of the new region
Tejun Heo784656f92011-07-12 11:15:55 +0200511 *
512 * Add new memblock region [@base,@base+@size) into @type. The new region
513 * is allowed to overlap with existing ones - overlaps don't affect already
514 * existing regions. @type is guaranteed to be minimal (all neighbouring
515 * compatible regions are merged) after the addition.
516 *
517 * RETURNS:
518 * 0 on success, -errno on failure.
519 */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100520int __init_memblock memblock_add_range(struct memblock_type *type,
Tang Chen66a20752014-01-21 15:49:20 -0800521 phys_addr_t base, phys_addr_t size,
522 int nid, unsigned long flags)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000523{
Tejun Heo784656f92011-07-12 11:15:55 +0200524 bool insert = false;
Tejun Heoeb18f1b2011-12-08 10:22:07 -0800525 phys_addr_t obase = base;
526 phys_addr_t end = base + memblock_cap_size(base, &size);
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800527 int idx, nr_new;
528 struct memblock_region *rgn;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000529
Tejun Heob3dc6272012-04-20 08:31:34 -0700530 if (!size)
531 return 0;
532
Tejun Heo784656f92011-07-12 11:15:55 +0200533 /* special case for empty array */
534 if (type->regions[0].size == 0) {
Tejun Heo1440c4e2011-12-08 10:22:08 -0800535 WARN_ON(type->cnt != 1 || type->total_size);
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000536 type->regions[0].base = base;
537 type->regions[0].size = size;
Tang Chen66a20752014-01-21 15:49:20 -0800538 type->regions[0].flags = flags;
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800539 memblock_set_region_node(&type->regions[0], nid);
Tejun Heo1440c4e2011-12-08 10:22:08 -0800540 type->total_size = size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000541 return 0;
542 }
Tejun Heo784656f92011-07-12 11:15:55 +0200543repeat:
544 /*
545 * The following is executed twice. Once with %false @insert and
546 * then with %true. The first counts the number of regions needed
547 * to accomodate the new area. The second actually inserts them.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700548 */
Tejun Heo784656f92011-07-12 11:15:55 +0200549 base = obase;
550 nr_new = 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000551
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800552 for_each_memblock_type(type, rgn) {
Tejun Heo784656f92011-07-12 11:15:55 +0200553 phys_addr_t rbase = rgn->base;
554 phys_addr_t rend = rbase + rgn->size;
555
556 if (rbase >= end)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000557 break;
Tejun Heo784656f92011-07-12 11:15:55 +0200558 if (rend <= base)
559 continue;
560 /*
561 * @rgn overlaps. If it separates the lower part of new
562 * area, insert that portion.
563 */
564 if (rbase > base) {
Wei Yangc0a29492015-09-04 15:47:38 -0700565#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
566 WARN_ON(nid != memblock_get_region_node(rgn));
567#endif
Wei Yang4fcab5f2015-09-08 14:59:53 -0700568 WARN_ON(flags != rgn->flags);
Tejun Heo784656f92011-07-12 11:15:55 +0200569 nr_new++;
570 if (insert)
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800571 memblock_insert_region(type, idx++, base,
Tang Chen66a20752014-01-21 15:49:20 -0800572 rbase - base, nid,
573 flags);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000574 }
Tejun Heo784656f92011-07-12 11:15:55 +0200575 /* area below @rend is dealt with, forget about it */
576 base = min(rend, end);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000577 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000578
Tejun Heo784656f92011-07-12 11:15:55 +0200579 /* insert the remaining portion */
580 if (base < end) {
581 nr_new++;
582 if (insert)
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800583 memblock_insert_region(type, idx, base, end - base,
Tang Chen66a20752014-01-21 15:49:20 -0800584 nid, flags);
Tejun Heo784656f92011-07-12 11:15:55 +0200585 }
586
587 /*
588 * If this was the first round, resize array and repeat for actual
589 * insertions; otherwise, merge and return.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700590 */
Tejun Heo784656f92011-07-12 11:15:55 +0200591 if (!insert) {
592 while (type->cnt + nr_new > type->max)
Greg Pearson48c3b582012-06-20 12:53:05 -0700593 if (memblock_double_array(type, obase, size) < 0)
Tejun Heo784656f92011-07-12 11:15:55 +0200594 return -ENOMEM;
595 insert = true;
596 goto repeat;
597 } else {
598 memblock_merge_regions(type);
599 return 0;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700600 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000601}
602
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800603int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size,
604 int nid)
605{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100606 return memblock_add_range(&memblock.memory, base, size, nid, 0);
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800607}
608
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700609int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size)
Alexander Kuleshov6a4055b2015-04-15 16:14:44 -0700610{
Alexander Kuleshov6a4055b2015-04-15 16:14:44 -0700611 memblock_dbg("memblock_add: [%#016llx-%#016llx] flags %#02lx %pF\n",
612 (unsigned long long)base,
613 (unsigned long long)base + size - 1,
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700614 0UL, (void *)_RET_IP_);
Alexander Kuleshov6a4055b2015-04-15 16:14:44 -0700615
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700616 return memblock_add_range(&memblock.memory, base, size, MAX_NUMNODES, 0);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000617}
618
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800619/**
620 * memblock_isolate_range - isolate given range into disjoint memblocks
621 * @type: memblock type to isolate range for
622 * @base: base of range to isolate
623 * @size: size of range to isolate
624 * @start_rgn: out parameter for the start of isolated region
625 * @end_rgn: out parameter for the end of isolated region
626 *
627 * Walk @type and ensure that regions don't cross the boundaries defined by
628 * [@base,@base+@size). Crossing regions are split at the boundaries,
629 * which may create at most two more regions. The index of the first
630 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
631 *
632 * RETURNS:
633 * 0 on success, -errno on failure.
634 */
635static int __init_memblock memblock_isolate_range(struct memblock_type *type,
636 phys_addr_t base, phys_addr_t size,
637 int *start_rgn, int *end_rgn)
638{
Tejun Heoeb18f1b2011-12-08 10:22:07 -0800639 phys_addr_t end = base + memblock_cap_size(base, &size);
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800640 int idx;
641 struct memblock_region *rgn;
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800642
643 *start_rgn = *end_rgn = 0;
644
Tejun Heob3dc6272012-04-20 08:31:34 -0700645 if (!size)
646 return 0;
647
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800648 /* we'll create at most two more regions */
649 while (type->cnt + 2 > type->max)
Greg Pearson48c3b582012-06-20 12:53:05 -0700650 if (memblock_double_array(type, base, size) < 0)
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800651 return -ENOMEM;
652
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800653 for_each_memblock_type(type, rgn) {
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800654 phys_addr_t rbase = rgn->base;
655 phys_addr_t rend = rbase + rgn->size;
656
657 if (rbase >= end)
658 break;
659 if (rend <= base)
660 continue;
661
662 if (rbase < base) {
663 /*
664 * @rgn intersects from below. Split and continue
665 * to process the next region - the new top half.
666 */
667 rgn->base = base;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800668 rgn->size -= base - rbase;
669 type->total_size -= base - rbase;
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800670 memblock_insert_region(type, idx, rbase, base - rbase,
Tang Chen66a20752014-01-21 15:49:20 -0800671 memblock_get_region_node(rgn),
672 rgn->flags);
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800673 } else if (rend > end) {
674 /*
675 * @rgn intersects from above. Split and redo the
676 * current region - the new bottom half.
677 */
678 rgn->base = end;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800679 rgn->size -= end - rbase;
680 type->total_size -= end - rbase;
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800681 memblock_insert_region(type, idx--, rbase, end - rbase,
Tang Chen66a20752014-01-21 15:49:20 -0800682 memblock_get_region_node(rgn),
683 rgn->flags);
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800684 } else {
685 /* @rgn is fully contained, record it */
686 if (!*end_rgn)
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -0800687 *start_rgn = idx;
688 *end_rgn = idx + 1;
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800689 }
690 }
691
692 return 0;
693}
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800694
Alexander Kuleshov35bd16a2015-11-05 18:47:00 -0800695static int __init_memblock memblock_remove_range(struct memblock_type *type,
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100696 phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000697{
Tejun Heo71936182011-12-08 10:22:07 -0800698 int start_rgn, end_rgn;
699 int i, ret;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000700
Tejun Heo71936182011-12-08 10:22:07 -0800701 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
702 if (ret)
703 return ret;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000704
Tejun Heo71936182011-12-08 10:22:07 -0800705 for (i = end_rgn - 1; i >= start_rgn; i--)
706 memblock_remove_region(type, i);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700707 return 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000708}
709
Tejun Heo581adcb2011-12-08 10:22:06 -0800710int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000711{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100712 return memblock_remove_range(&memblock.memory, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000713}
714
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100715
Tejun Heo581adcb2011-12-08 10:22:06 -0800716int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000717{
Tejun Heo24aa0782011-07-12 11:16:06 +0200718 memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n",
H. Peter Anvina1504392011-07-14 11:57:10 -0700719 (unsigned long long)base,
Grygorii Strashko931d13f2014-01-21 15:49:17 -0800720 (unsigned long long)base + size - 1,
H. Peter Anvina1504392011-07-14 11:57:10 -0700721 (void *)_RET_IP_);
Tejun Heo24aa0782011-07-12 11:16:06 +0200722
Catalin Marinasaedf95e2014-06-06 14:38:20 -0700723 kmemleak_free_part(__va(base), size);
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100724 return memblock_remove_range(&memblock.reserved, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000725}
726
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700727int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000728{
Tang Chen66a20752014-01-21 15:49:20 -0800729 memblock_dbg("memblock_reserve: [%#016llx-%#016llx] flags %#02lx %pF\n",
H. Peter Anvina1504392011-07-14 11:57:10 -0700730 (unsigned long long)base,
Grygorii Strashko931d13f2014-01-21 15:49:17 -0800731 (unsigned long long)base + size - 1,
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700732 0UL, (void *)_RET_IP_);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000733
Alexander Kuleshovf705ac42016-05-20 16:57:35 -0700734 return memblock_add_range(&memblock.reserved, base, size, MAX_NUMNODES, 0);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000735}
736
Tejun Heo35fd0802011-07-12 11:15:59 +0200737/**
Tang Chen66b16ed2014-01-21 15:49:23 -0800738 *
Tony Luck4308ce12014-12-12 16:54:59 -0800739 * This function isolates region [@base, @base + @size), and sets/clears flag
Tang Chen66b16ed2014-01-21 15:49:23 -0800740 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700741 * Return 0 on success, -errno on failure.
Tang Chen66b16ed2014-01-21 15:49:23 -0800742 */
Tony Luck4308ce12014-12-12 16:54:59 -0800743static int __init_memblock memblock_setclr_flag(phys_addr_t base,
744 phys_addr_t size, int set, int flag)
Tang Chen66b16ed2014-01-21 15:49:23 -0800745{
746 struct memblock_type *type = &memblock.memory;
747 int i, ret, start_rgn, end_rgn;
748
749 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
750 if (ret)
751 return ret;
752
753 for (i = start_rgn; i < end_rgn; i++)
Tony Luck4308ce12014-12-12 16:54:59 -0800754 if (set)
755 memblock_set_region_flags(&type->regions[i], flag);
756 else
757 memblock_clear_region_flags(&type->regions[i], flag);
Tang Chen66b16ed2014-01-21 15:49:23 -0800758
759 memblock_merge_regions(type);
760 return 0;
761}
762
763/**
Tony Luck4308ce12014-12-12 16:54:59 -0800764 * memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG.
765 * @base: the base phys addr of the region
766 * @size: the size of the region
767 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700768 * Return 0 on success, -errno on failure.
Tony Luck4308ce12014-12-12 16:54:59 -0800769 */
770int __init_memblock memblock_mark_hotplug(phys_addr_t base, phys_addr_t size)
771{
772 return memblock_setclr_flag(base, size, 1, MEMBLOCK_HOTPLUG);
773}
774
775/**
Tang Chen66b16ed2014-01-21 15:49:23 -0800776 * memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region.
777 * @base: the base phys addr of the region
778 * @size: the size of the region
779 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700780 * Return 0 on success, -errno on failure.
Tang Chen66b16ed2014-01-21 15:49:23 -0800781 */
782int __init_memblock memblock_clear_hotplug(phys_addr_t base, phys_addr_t size)
783{
Tony Luck4308ce12014-12-12 16:54:59 -0800784 return memblock_setclr_flag(base, size, 0, MEMBLOCK_HOTPLUG);
Tang Chen66b16ed2014-01-21 15:49:23 -0800785}
786
787/**
Tony Lucka3f5baf2015-06-24 16:58:12 -0700788 * memblock_mark_mirror - Mark mirrored memory with flag MEMBLOCK_MIRROR.
789 * @base: the base phys addr of the region
790 * @size: the size of the region
791 *
Alexander Kuleshovc1153932015-09-08 15:04:02 -0700792 * Return 0 on success, -errno on failure.
Tony Lucka3f5baf2015-06-24 16:58:12 -0700793 */
794int __init_memblock memblock_mark_mirror(phys_addr_t base, phys_addr_t size)
795{
796 system_has_some_mirror = true;
797
798 return memblock_setclr_flag(base, size, 1, MEMBLOCK_MIRROR);
799}
800
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +0100801/**
802 * memblock_mark_nomap - Mark a memory region with flag MEMBLOCK_NOMAP.
803 * @base: the base phys addr of the region
804 * @size: the size of the region
805 *
806 * Return 0 on success, -errno on failure.
807 */
808int __init_memblock memblock_mark_nomap(phys_addr_t base, phys_addr_t size)
809{
810 return memblock_setclr_flag(base, size, 1, MEMBLOCK_NOMAP);
811}
Tony Lucka3f5baf2015-06-24 16:58:12 -0700812
813/**
Robin Holt8e7a7f82015-06-30 14:56:41 -0700814 * __next_reserved_mem_region - next function for for_each_reserved_region()
815 * @idx: pointer to u64 loop variable
816 * @out_start: ptr to phys_addr_t for start address of the region, can be %NULL
817 * @out_end: ptr to phys_addr_t for end address of the region, can be %NULL
818 *
819 * Iterate over all reserved memory regions.
820 */
821void __init_memblock __next_reserved_mem_region(u64 *idx,
822 phys_addr_t *out_start,
823 phys_addr_t *out_end)
824{
Alexander Kuleshov567d1172015-09-08 15:03:33 -0700825 struct memblock_type *type = &memblock.reserved;
Robin Holt8e7a7f82015-06-30 14:56:41 -0700826
Richard Leitnercd33a762016-05-20 16:58:33 -0700827 if (*idx < type->cnt) {
Alexander Kuleshov567d1172015-09-08 15:03:33 -0700828 struct memblock_region *r = &type->regions[*idx];
Robin Holt8e7a7f82015-06-30 14:56:41 -0700829 phys_addr_t base = r->base;
830 phys_addr_t size = r->size;
831
832 if (out_start)
833 *out_start = base;
834 if (out_end)
835 *out_end = base + size - 1;
836
837 *idx += 1;
838 return;
839 }
840
841 /* signal end of iteration */
842 *idx = ULLONG_MAX;
843}
844
845/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100846 * __next__mem_range - next function for for_each_free_mem_range() etc.
Tejun Heo35fd0802011-07-12 11:15:59 +0200847 * @idx: pointer to u64 loop variable
Grygorii Strashkob1154232014-01-21 15:50:16 -0800848 * @nid: node selector, %NUMA_NO_NODE for all nodes
Tony Luckfc6daaf2015-06-24 16:58:09 -0700849 * @flags: pick from blocks based on memory attributes
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100850 * @type_a: pointer to memblock_type from where the range is taken
851 * @type_b: pointer to memblock_type which excludes memory from being taken
Wanpeng Lidad75572012-06-20 12:53:01 -0700852 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
853 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
854 * @out_nid: ptr to int for nid of the range, can be %NULL
Tejun Heo35fd0802011-07-12 11:15:59 +0200855 *
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100856 * Find the first area from *@idx which matches @nid, fill the out
Tejun Heo35fd0802011-07-12 11:15:59 +0200857 * parameters, and update *@idx for the next iteration. The lower 32bit of
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100858 * *@idx contains index into type_a and the upper 32bit indexes the
859 * areas before each region in type_b. For example, if type_b regions
Tejun Heo35fd0802011-07-12 11:15:59 +0200860 * look like the following,
861 *
862 * 0:[0-16), 1:[32-48), 2:[128-130)
863 *
864 * The upper 32bit indexes the following regions.
865 *
866 * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX)
867 *
868 * As both region arrays are sorted, the function advances the two indices
869 * in lockstep and returns each intersection.
870 */
Tony Luckfc6daaf2015-06-24 16:58:09 -0700871void __init_memblock __next_mem_range(u64 *idx, int nid, ulong flags,
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100872 struct memblock_type *type_a,
873 struct memblock_type *type_b,
874 phys_addr_t *out_start,
875 phys_addr_t *out_end, int *out_nid)
Tejun Heo35fd0802011-07-12 11:15:59 +0200876{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100877 int idx_a = *idx & 0xffffffff;
878 int idx_b = *idx >> 32;
Grygorii Strashkob1154232014-01-21 15:50:16 -0800879
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100880 if (WARN_ONCE(nid == MAX_NUMNODES,
881 "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
Grygorii Strashko560dca272014-01-21 15:50:55 -0800882 nid = NUMA_NO_NODE;
Tejun Heo35fd0802011-07-12 11:15:59 +0200883
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100884 for (; idx_a < type_a->cnt; idx_a++) {
885 struct memblock_region *m = &type_a->regions[idx_a];
886
Tejun Heo35fd0802011-07-12 11:15:59 +0200887 phys_addr_t m_start = m->base;
888 phys_addr_t m_end = m->base + m->size;
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100889 int m_nid = memblock_get_region_node(m);
Tejun Heo35fd0802011-07-12 11:15:59 +0200890
891 /* only memory regions are associated with nodes, check it */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100892 if (nid != NUMA_NO_NODE && nid != m_nid)
Tejun Heo35fd0802011-07-12 11:15:59 +0200893 continue;
894
Xishi Qiu0a313a92014-09-09 14:50:46 -0700895 /* skip hotpluggable memory regions if needed */
896 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
897 continue;
898
Tony Lucka3f5baf2015-06-24 16:58:12 -0700899 /* if we want mirror memory skip non-mirror memory regions */
900 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
901 continue;
902
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +0100903 /* skip nomap memory unless we were asked for it explicitly */
904 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
905 continue;
906
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100907 if (!type_b) {
908 if (out_start)
909 *out_start = m_start;
910 if (out_end)
911 *out_end = m_end;
912 if (out_nid)
913 *out_nid = m_nid;
914 idx_a++;
915 *idx = (u32)idx_a | (u64)idx_b << 32;
916 return;
917 }
Tejun Heo35fd0802011-07-12 11:15:59 +0200918
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100919 /* scan areas before each reservation */
920 for (; idx_b < type_b->cnt + 1; idx_b++) {
921 struct memblock_region *r;
922 phys_addr_t r_start;
923 phys_addr_t r_end;
924
925 r = &type_b->regions[idx_b];
926 r_start = idx_b ? r[-1].base + r[-1].size : 0;
927 r_end = idx_b < type_b->cnt ?
928 r->base : ULLONG_MAX;
929
930 /*
931 * if idx_b advanced past idx_a,
932 * break out to advance idx_a
933 */
Tejun Heo35fd0802011-07-12 11:15:59 +0200934 if (r_start >= m_end)
935 break;
936 /* if the two regions intersect, we're done */
937 if (m_start < r_end) {
938 if (out_start)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100939 *out_start =
940 max(m_start, r_start);
Tejun Heo35fd0802011-07-12 11:15:59 +0200941 if (out_end)
942 *out_end = min(m_end, r_end);
943 if (out_nid)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100944 *out_nid = m_nid;
Tejun Heo35fd0802011-07-12 11:15:59 +0200945 /*
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100946 * The region which ends first is
947 * advanced for the next iteration.
Tejun Heo35fd0802011-07-12 11:15:59 +0200948 */
949 if (m_end <= r_end)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100950 idx_a++;
Tejun Heo35fd0802011-07-12 11:15:59 +0200951 else
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100952 idx_b++;
953 *idx = (u32)idx_a | (u64)idx_b << 32;
Tejun Heo35fd0802011-07-12 11:15:59 +0200954 return;
955 }
956 }
957 }
958
959 /* signal end of iteration */
960 *idx = ULLONG_MAX;
961}
962
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800963/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100964 * __next_mem_range_rev - generic next function for for_each_*_range_rev()
965 *
966 * Finds the next range from type_a which is not marked as unsuitable
967 * in type_b.
968 *
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800969 * @idx: pointer to u64 loop variable
Alexander Kuleshovad5ea8c2015-09-08 15:04:22 -0700970 * @nid: node selector, %NUMA_NO_NODE for all nodes
Tony Luckfc6daaf2015-06-24 16:58:09 -0700971 * @flags: pick from blocks based on memory attributes
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100972 * @type_a: pointer to memblock_type from where the range is taken
973 * @type_b: pointer to memblock_type which excludes memory from being taken
Wanpeng Lidad75572012-06-20 12:53:01 -0700974 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
975 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
976 * @out_nid: ptr to int for nid of the range, can be %NULL
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800977 *
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100978 * Reverse of __next_mem_range().
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800979 */
Tony Luckfc6daaf2015-06-24 16:58:09 -0700980void __init_memblock __next_mem_range_rev(u64 *idx, int nid, ulong flags,
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100981 struct memblock_type *type_a,
982 struct memblock_type *type_b,
983 phys_addr_t *out_start,
984 phys_addr_t *out_end, int *out_nid)
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800985{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100986 int idx_a = *idx & 0xffffffff;
987 int idx_b = *idx >> 32;
Grygorii Strashkob1154232014-01-21 15:50:16 -0800988
Grygorii Strashko560dca272014-01-21 15:50:55 -0800989 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
990 nid = NUMA_NO_NODE;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800991
992 if (*idx == (u64)ULLONG_MAX) {
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100993 idx_a = type_a->cnt - 1;
994 idx_b = type_b->cnt;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800995 }
996
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100997 for (; idx_a >= 0; idx_a--) {
998 struct memblock_region *m = &type_a->regions[idx_a];
999
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001000 phys_addr_t m_start = m->base;
1001 phys_addr_t m_end = m->base + m->size;
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001002 int m_nid = memblock_get_region_node(m);
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001003
1004 /* only memory regions are associated with nodes, check it */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001005 if (nid != NUMA_NO_NODE && nid != m_nid)
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001006 continue;
1007
Tang Chen55ac5902014-01-21 15:49:35 -08001008 /* skip hotpluggable memory regions if needed */
1009 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
1010 continue;
1011
Tony Lucka3f5baf2015-06-24 16:58:12 -07001012 /* if we want mirror memory skip non-mirror memory regions */
1013 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
1014 continue;
1015
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +01001016 /* skip nomap memory unless we were asked for it explicitly */
1017 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
1018 continue;
1019
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001020 if (!type_b) {
1021 if (out_start)
1022 *out_start = m_start;
1023 if (out_end)
1024 *out_end = m_end;
1025 if (out_nid)
1026 *out_nid = m_nid;
1027 idx_a++;
1028 *idx = (u32)idx_a | (u64)idx_b << 32;
1029 return;
1030 }
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001031
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001032 /* scan areas before each reservation */
1033 for (; idx_b >= 0; idx_b--) {
1034 struct memblock_region *r;
1035 phys_addr_t r_start;
1036 phys_addr_t r_end;
1037
1038 r = &type_b->regions[idx_b];
1039 r_start = idx_b ? r[-1].base + r[-1].size : 0;
1040 r_end = idx_b < type_b->cnt ?
1041 r->base : ULLONG_MAX;
1042 /*
1043 * if idx_b advanced past idx_a,
1044 * break out to advance idx_a
1045 */
1046
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001047 if (r_end <= m_start)
1048 break;
1049 /* if the two regions intersect, we're done */
1050 if (m_end > r_start) {
1051 if (out_start)
1052 *out_start = max(m_start, r_start);
1053 if (out_end)
1054 *out_end = min(m_end, r_end);
1055 if (out_nid)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001056 *out_nid = m_nid;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001057 if (m_start >= r_start)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001058 idx_a--;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001059 else
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001060 idx_b--;
1061 *idx = (u32)idx_a | (u64)idx_b << 32;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001062 return;
1063 }
1064 }
1065 }
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001066 /* signal end of iteration */
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001067 *idx = ULLONG_MAX;
1068}
1069
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001070#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1071/*
1072 * Common iterator interface used to define for_each_mem_range().
1073 */
1074void __init_memblock __next_mem_pfn_range(int *idx, int nid,
1075 unsigned long *out_start_pfn,
1076 unsigned long *out_end_pfn, int *out_nid)
1077{
1078 struct memblock_type *type = &memblock.memory;
1079 struct memblock_region *r;
1080
1081 while (++*idx < type->cnt) {
1082 r = &type->regions[*idx];
1083
1084 if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size))
1085 continue;
1086 if (nid == MAX_NUMNODES || nid == r->nid)
1087 break;
1088 }
1089 if (*idx >= type->cnt) {
1090 *idx = -1;
1091 return;
1092 }
1093
1094 if (out_start_pfn)
1095 *out_start_pfn = PFN_UP(r->base);
1096 if (out_end_pfn)
1097 *out_end_pfn = PFN_DOWN(r->base + r->size);
1098 if (out_nid)
1099 *out_nid = r->nid;
1100}
1101
1102/**
1103 * memblock_set_node - set node ID on memblock regions
1104 * @base: base of area to set node ID for
1105 * @size: size of area to set node ID for
Tang Chene7e8de52014-01-21 15:49:26 -08001106 * @type: memblock type to set node ID for
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001107 * @nid: node ID to set
1108 *
Tang Chene7e8de52014-01-21 15:49:26 -08001109 * Set the nid of memblock @type regions in [@base,@base+@size) to @nid.
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001110 * Regions which cross the area boundaries are split as necessary.
1111 *
1112 * RETURNS:
1113 * 0 on success, -errno on failure.
1114 */
1115int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size,
Tang Chene7e8de52014-01-21 15:49:26 -08001116 struct memblock_type *type, int nid)
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001117{
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001118 int start_rgn, end_rgn;
1119 int i, ret;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001120
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001121 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
1122 if (ret)
1123 return ret;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001124
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001125 for (i = start_rgn; i < end_rgn; i++)
Wanpeng Lie9d24ad2012-10-08 16:32:21 -07001126 memblock_set_region_node(&type->regions[i], nid);
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001127
1128 memblock_merge_regions(type);
1129 return 0;
1130}
1131#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
1132
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001133static phys_addr_t __init memblock_alloc_range_nid(phys_addr_t size,
1134 phys_addr_t align, phys_addr_t start,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001135 phys_addr_t end, int nid, ulong flags)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001136{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001137 phys_addr_t found;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001138
Grygorii Strashko79f40fa2014-01-21 15:50:12 -08001139 if (!align)
1140 align = SMP_CACHE_BYTES;
Vineet Gupta94f3d3a2013-04-29 15:06:15 -07001141
Tony Luckfc6daaf2015-06-24 16:58:09 -07001142 found = memblock_find_in_range_node(size, align, start, end, nid,
1143 flags);
Catalin Marinasaedf95e2014-06-06 14:38:20 -07001144 if (found && !memblock_reserve(found, size)) {
1145 /*
1146 * The min_count is set to 0 so that memblock allocations are
1147 * never reported as leaks.
1148 */
1149 kmemleak_alloc(__va(found), size, 0, 0);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001150 return found;
Catalin Marinasaedf95e2014-06-06 14:38:20 -07001151 }
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001152 return 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001153}
1154
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001155phys_addr_t __init memblock_alloc_range(phys_addr_t size, phys_addr_t align,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001156 phys_addr_t start, phys_addr_t end,
1157 ulong flags)
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001158{
Tony Luckfc6daaf2015-06-24 16:58:09 -07001159 return memblock_alloc_range_nid(size, align, start, end, NUMA_NO_NODE,
1160 flags);
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001161}
1162
1163static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size,
1164 phys_addr_t align, phys_addr_t max_addr,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001165 int nid, ulong flags)
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001166{
Tony Luckfc6daaf2015-06-24 16:58:09 -07001167 return memblock_alloc_range_nid(size, align, 0, max_addr, nid, flags);
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001168}
1169
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001170phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid)
1171{
Tony Lucka3f5baf2015-06-24 16:58:12 -07001172 ulong flags = choose_memblock_flags();
1173 phys_addr_t ret;
1174
1175again:
1176 ret = memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE,
1177 nid, flags);
1178
1179 if (!ret && (flags & MEMBLOCK_MIRROR)) {
1180 flags &= ~MEMBLOCK_MIRROR;
1181 goto again;
1182 }
1183 return ret;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001184}
1185
1186phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
1187{
Tony Luckfc6daaf2015-06-24 16:58:09 -07001188 return memblock_alloc_base_nid(size, align, max_addr, NUMA_NO_NODE,
1189 MEMBLOCK_NONE);
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001190}
1191
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001192phys_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 +10001193{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001194 phys_addr_t alloc;
1195
1196 alloc = __memblock_alloc_base(size, align, max_addr);
1197
1198 if (alloc == 0)
1199 panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n",
1200 (unsigned long long) size, (unsigned long long) max_addr);
1201
1202 return alloc;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001203}
1204
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001205phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001206{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001207 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001208}
1209
Benjamin Herrenschmidt9d1e2492010-07-06 15:39:17 -07001210phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid)
1211{
1212 phys_addr_t res = memblock_alloc_nid(size, align, nid);
1213
1214 if (res)
1215 return res;
Tejun Heo15fb0972011-07-12 09:58:07 +02001216 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001217}
1218
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001219/**
1220 * memblock_virt_alloc_internal - allocate boot memory block
1221 * @size: size of memory block to be allocated in bytes
1222 * @align: alignment of the region and block's size
1223 * @min_addr: the lower bound of the memory region to allocate (phys address)
1224 * @max_addr: the upper bound of the memory region to allocate (phys address)
1225 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1226 *
1227 * The @min_addr limit is dropped if it can not be satisfied and the allocation
1228 * will fall back to memory below @min_addr. Also, allocation may fall back
1229 * to any node in the system if the specified node can not
1230 * hold the requested memory.
1231 *
1232 * The allocation is performed from memory region limited by
1233 * memblock.current_limit if @max_addr == %BOOTMEM_ALLOC_ACCESSIBLE.
1234 *
1235 * The memory block is aligned on SMP_CACHE_BYTES if @align == 0.
1236 *
1237 * The phys address of allocated boot memory block is converted to virtual and
1238 * allocated memory is reset to 0.
1239 *
1240 * In addition, function sets the min_count to 0 using kmemleak_alloc for
1241 * allocated boot memory block, so that it is never reported as leaks.
1242 *
1243 * RETURNS:
1244 * Virtual address of allocated memory block on success, NULL on failure.
1245 */
1246static void * __init memblock_virt_alloc_internal(
1247 phys_addr_t size, phys_addr_t align,
1248 phys_addr_t min_addr, phys_addr_t max_addr,
1249 int nid)
1250{
1251 phys_addr_t alloc;
1252 void *ptr;
Tony Lucka3f5baf2015-06-24 16:58:12 -07001253 ulong flags = choose_memblock_flags();
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001254
Grygorii Strashko560dca272014-01-21 15:50:55 -08001255 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
1256 nid = NUMA_NO_NODE;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001257
1258 /*
1259 * Detect any accidental use of these APIs after slab is ready, as at
1260 * this moment memblock may be deinitialized already and its
1261 * internal data may be destroyed (after execution of free_all_bootmem)
1262 */
1263 if (WARN_ON_ONCE(slab_is_available()))
1264 return kzalloc_node(size, GFP_NOWAIT, nid);
1265
1266 if (!align)
1267 align = SMP_CACHE_BYTES;
1268
Yinghai Luf544e142014-01-29 14:05:52 -08001269 if (max_addr > memblock.current_limit)
1270 max_addr = memblock.current_limit;
1271
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001272again:
1273 alloc = memblock_find_in_range_node(size, align, min_addr, max_addr,
Tony Lucka3f5baf2015-06-24 16:58:12 -07001274 nid, flags);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001275 if (alloc)
1276 goto done;
1277
1278 if (nid != NUMA_NO_NODE) {
1279 alloc = memblock_find_in_range_node(size, align, min_addr,
Tony Luckfc6daaf2015-06-24 16:58:09 -07001280 max_addr, NUMA_NO_NODE,
Tony Lucka3f5baf2015-06-24 16:58:12 -07001281 flags);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001282 if (alloc)
1283 goto done;
1284 }
1285
1286 if (min_addr) {
1287 min_addr = 0;
1288 goto again;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001289 }
1290
Tony Lucka3f5baf2015-06-24 16:58:12 -07001291 if (flags & MEMBLOCK_MIRROR) {
1292 flags &= ~MEMBLOCK_MIRROR;
1293 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
1294 &size);
1295 goto again;
1296 }
1297
1298 return NULL;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001299done:
1300 memblock_reserve(alloc, size);
1301 ptr = phys_to_virt(alloc);
1302 memset(ptr, 0, size);
1303
1304 /*
1305 * The min_count is set to 0 so that bootmem allocated blocks
1306 * are never reported as leaks. This is because many of these blocks
1307 * are only referred via the physical address which is not
1308 * looked up by kmemleak.
1309 */
1310 kmemleak_alloc(ptr, size, 0, 0);
1311
1312 return ptr;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001313}
1314
1315/**
1316 * memblock_virt_alloc_try_nid_nopanic - allocate boot memory block
1317 * @size: size of memory block to be allocated in bytes
1318 * @align: alignment of the region and block's size
1319 * @min_addr: the lower bound of the memory region from where the allocation
1320 * is preferred (phys address)
1321 * @max_addr: the upper bound of the memory region from where the allocation
1322 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1323 * allocate only from memory limited by memblock.current_limit value
1324 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1325 *
1326 * Public version of _memblock_virt_alloc_try_nid_nopanic() which provides
1327 * additional debug information (including caller info), if enabled.
1328 *
1329 * RETURNS:
1330 * Virtual address of allocated memory block on success, NULL on failure.
1331 */
1332void * __init memblock_virt_alloc_try_nid_nopanic(
1333 phys_addr_t size, phys_addr_t align,
1334 phys_addr_t min_addr, phys_addr_t max_addr,
1335 int nid)
1336{
1337 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1338 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1339 (u64)max_addr, (void *)_RET_IP_);
1340 return memblock_virt_alloc_internal(size, align, min_addr,
1341 max_addr, nid);
1342}
1343
1344/**
1345 * memblock_virt_alloc_try_nid - allocate boot memory block with panicking
1346 * @size: size of memory block to be allocated in bytes
1347 * @align: alignment of the region and block's size
1348 * @min_addr: the lower bound of the memory region from where the allocation
1349 * is preferred (phys address)
1350 * @max_addr: the upper bound of the memory region from where the allocation
1351 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1352 * allocate only from memory limited by memblock.current_limit value
1353 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1354 *
1355 * Public panicking version of _memblock_virt_alloc_try_nid_nopanic()
1356 * which provides debug information (including caller info), if enabled,
1357 * and panics if the request can not be satisfied.
1358 *
1359 * RETURNS:
1360 * Virtual address of allocated memory block on success, NULL on failure.
1361 */
1362void * __init memblock_virt_alloc_try_nid(
1363 phys_addr_t size, phys_addr_t align,
1364 phys_addr_t min_addr, phys_addr_t max_addr,
1365 int nid)
1366{
1367 void *ptr;
1368
1369 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1370 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1371 (u64)max_addr, (void *)_RET_IP_);
1372 ptr = memblock_virt_alloc_internal(size, align,
1373 min_addr, max_addr, nid);
1374 if (ptr)
1375 return ptr;
1376
1377 panic("%s: Failed to allocate %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx\n",
1378 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1379 (u64)max_addr);
1380 return NULL;
1381}
1382
1383/**
1384 * __memblock_free_early - free boot memory block
1385 * @base: phys starting address of the boot memory block
1386 * @size: size of the boot memory block in bytes
1387 *
1388 * Free boot memory block previously allocated by memblock_virt_alloc_xx() API.
1389 * The freeing memory will not be released to the buddy allocator.
1390 */
1391void __init __memblock_free_early(phys_addr_t base, phys_addr_t size)
1392{
1393 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1394 __func__, (u64)base, (u64)base + size - 1,
1395 (void *)_RET_IP_);
1396 kmemleak_free_part(__va(base), size);
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001397 memblock_remove_range(&memblock.reserved, base, size);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001398}
1399
1400/*
1401 * __memblock_free_late - free bootmem block pages directly to buddy allocator
1402 * @addr: phys starting address of the boot memory block
1403 * @size: size of the boot memory block in bytes
1404 *
1405 * This is only useful when the bootmem allocator has already been torn
1406 * down, but we are still initializing the system. Pages are released directly
1407 * to the buddy allocator, no bootmem metadata is updated because it is gone.
1408 */
1409void __init __memblock_free_late(phys_addr_t base, phys_addr_t size)
1410{
1411 u64 cursor, end;
1412
1413 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1414 __func__, (u64)base, (u64)base + size - 1,
1415 (void *)_RET_IP_);
1416 kmemleak_free_part(__va(base), size);
1417 cursor = PFN_UP(base);
1418 end = PFN_DOWN(base + size);
1419
1420 for (; cursor < end; cursor++) {
Mel Gormand70ddd72015-06-30 14:56:52 -07001421 __free_pages_bootmem(pfn_to_page(cursor), cursor, 0);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001422 totalram_pages++;
1423 }
1424}
Benjamin Herrenschmidt9d1e2492010-07-06 15:39:17 -07001425
1426/*
1427 * Remaining API functions
1428 */
1429
David Gibson1f1ffb8a2016-02-05 15:36:19 -08001430phys_addr_t __init_memblock memblock_phys_mem_size(void)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001431{
Tejun Heo1440c4e2011-12-08 10:22:08 -08001432 return memblock.memory.total_size;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001433}
1434
Yinghai Lu595ad9a2013-01-24 12:20:09 -08001435phys_addr_t __init memblock_mem_size(unsigned long limit_pfn)
1436{
1437 unsigned long pages = 0;
1438 struct memblock_region *r;
1439 unsigned long start_pfn, end_pfn;
1440
1441 for_each_memblock(memory, r) {
1442 start_pfn = memblock_region_memory_base_pfn(r);
1443 end_pfn = memblock_region_memory_end_pfn(r);
1444 start_pfn = min_t(unsigned long, start_pfn, limit_pfn);
1445 end_pfn = min_t(unsigned long, end_pfn, limit_pfn);
1446 pages += end_pfn - start_pfn;
1447 }
1448
Fabian Frederick16763232014-04-07 15:37:53 -07001449 return PFN_PHYS(pages);
Yinghai Lu595ad9a2013-01-24 12:20:09 -08001450}
1451
Sam Ravnborg0a93ebe2011-10-31 17:08:16 -07001452/* lowest address */
1453phys_addr_t __init_memblock memblock_start_of_DRAM(void)
1454{
1455 return memblock.memory.regions[0].base;
1456}
1457
Yinghai Lu10d06432010-07-28 15:43:02 +10001458phys_addr_t __init_memblock memblock_end_of_DRAM(void)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001459{
1460 int idx = memblock.memory.cnt - 1;
1461
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +10001462 return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001463}
1464
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001465void __init memblock_enforce_memory_limit(phys_addr_t limit)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001466{
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001467 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
Emil Medve136199f2014-04-07 15:37:52 -07001468 struct memblock_region *r;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001469
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001470 if (!limit)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001471 return;
1472
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001473 /* find out max address */
Emil Medve136199f2014-04-07 15:37:52 -07001474 for_each_memblock(memory, r) {
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001475 if (limit <= r->size) {
1476 max_addr = r->base + limit;
1477 break;
1478 }
1479 limit -= r->size;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001480 }
1481
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001482 /* truncate both memory and reserved regions */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001483 memblock_remove_range(&memblock.memory, max_addr,
1484 (phys_addr_t)ULLONG_MAX);
1485 memblock_remove_range(&memblock.reserved, max_addr,
1486 (phys_addr_t)ULLONG_MAX);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001487}
1488
Yinghai Lucd794812010-10-11 12:34:09 -07001489static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001490{
1491 unsigned int left = 0, right = type->cnt;
1492
1493 do {
1494 unsigned int mid = (right + left) / 2;
1495
1496 if (addr < type->regions[mid].base)
1497 right = mid;
1498 else if (addr >= (type->regions[mid].base +
1499 type->regions[mid].size))
1500 left = mid + 1;
1501 else
1502 return mid;
1503 } while (left < right);
1504 return -1;
1505}
1506
Yaowei Baib4ad0c72016-01-14 15:18:54 -08001507bool __init memblock_is_reserved(phys_addr_t addr)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001508{
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001509 return memblock_search(&memblock.reserved, addr) != -1;
1510}
Yinghai Lu95f72d12010-07-12 14:36:09 +10001511
Yaowei Baib4ad0c72016-01-14 15:18:54 -08001512bool __init_memblock memblock_is_memory(phys_addr_t addr)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001513{
1514 return memblock_search(&memblock.memory, addr) != -1;
1515}
1516
Ard Biesheuvelbf3d3cc2015-11-30 13:28:15 +01001517int __init_memblock memblock_is_map_memory(phys_addr_t addr)
1518{
1519 int i = memblock_search(&memblock.memory, addr);
1520
1521 if (i == -1)
1522 return false;
1523 return !memblock_is_nomap(&memblock.memory.regions[i]);
1524}
1525
Yinghai Lue76b63f2013-09-11 14:22:17 -07001526#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1527int __init_memblock memblock_search_pfn_nid(unsigned long pfn,
1528 unsigned long *start_pfn, unsigned long *end_pfn)
1529{
1530 struct memblock_type *type = &memblock.memory;
Fabian Frederick16763232014-04-07 15:37:53 -07001531 int mid = memblock_search(type, PFN_PHYS(pfn));
Yinghai Lue76b63f2013-09-11 14:22:17 -07001532
1533 if (mid == -1)
1534 return -1;
1535
Fabian Frederickf7e2f7e2014-06-04 16:07:51 -07001536 *start_pfn = PFN_DOWN(type->regions[mid].base);
1537 *end_pfn = PFN_DOWN(type->regions[mid].base + type->regions[mid].size);
Yinghai Lue76b63f2013-09-11 14:22:17 -07001538
1539 return type->regions[mid].nid;
1540}
1541#endif
1542
Stephen Boydeab30942012-05-24 00:45:21 -07001543/**
1544 * memblock_is_region_memory - check if a region is a subset of memory
1545 * @base: base of region to check
1546 * @size: size of region to check
1547 *
1548 * Check if the region [@base, @base+@size) is a subset of a memory block.
1549 *
1550 * RETURNS:
1551 * 0 if false, non-zero if true
1552 */
Yinghai Lu3661ca62010-09-15 13:05:29 -07001553int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001554{
Tomi Valkeinenabb65272011-01-20 14:44:20 -08001555 int idx = memblock_search(&memblock.memory, base);
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001556 phys_addr_t end = base + memblock_cap_size(base, &size);
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001557
1558 if (idx == -1)
1559 return 0;
Tomi Valkeinenabb65272011-01-20 14:44:20 -08001560 return memblock.memory.regions[idx].base <= base &&
1561 (memblock.memory.regions[idx].base +
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001562 memblock.memory.regions[idx].size) >= end;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001563}
1564
Stephen Boydeab30942012-05-24 00:45:21 -07001565/**
1566 * memblock_is_region_reserved - check if a region intersects reserved memory
1567 * @base: base of region to check
1568 * @size: size of region to check
1569 *
1570 * Check if the region [@base, @base+@size) intersects a reserved memory block.
1571 *
1572 * RETURNS:
Tang Chenc5c5c9d2015-09-08 15:02:00 -07001573 * True if they intersect, false if not.
Stephen Boydeab30942012-05-24 00:45:21 -07001574 */
Tang Chenc5c5c9d2015-09-08 15:02:00 -07001575bool __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001576{
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001577 memblock_cap_size(base, &size);
Tang Chenc5c5c9d2015-09-08 15:02:00 -07001578 return memblock_overlaps_region(&memblock.reserved, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001579}
1580
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001581void __init_memblock memblock_trim_memory(phys_addr_t align)
1582{
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001583 phys_addr_t start, end, orig_start, orig_end;
Emil Medve136199f2014-04-07 15:37:52 -07001584 struct memblock_region *r;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001585
Emil Medve136199f2014-04-07 15:37:52 -07001586 for_each_memblock(memory, r) {
1587 orig_start = r->base;
1588 orig_end = r->base + r->size;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001589 start = round_up(orig_start, align);
1590 end = round_down(orig_end, align);
1591
1592 if (start == orig_start && end == orig_end)
1593 continue;
1594
1595 if (start < end) {
Emil Medve136199f2014-04-07 15:37:52 -07001596 r->base = start;
1597 r->size = end - start;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001598 } else {
Emil Medve136199f2014-04-07 15:37:52 -07001599 memblock_remove_region(&memblock.memory,
1600 r - memblock.memory.regions);
1601 r--;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001602 }
1603 }
1604}
Benjamin Herrenschmidte63075a2010-07-06 15:39:01 -07001605
Yinghai Lu3661ca62010-09-15 13:05:29 -07001606void __init_memblock memblock_set_current_limit(phys_addr_t limit)
Benjamin Herrenschmidte63075a2010-07-06 15:39:01 -07001607{
1608 memblock.current_limit = limit;
1609}
1610
Laura Abbottfec51012014-02-27 01:23:43 +01001611phys_addr_t __init_memblock memblock_get_current_limit(void)
1612{
1613 return memblock.current_limit;
1614}
1615
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001616static void __init_memblock memblock_dump(struct memblock_type *type, char *name)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001617{
1618 unsigned long long base, size;
Tang Chen66a20752014-01-21 15:49:20 -08001619 unsigned long flags;
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -08001620 int idx;
1621 struct memblock_region *rgn;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001622
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001623 pr_info(" %s.cnt = 0x%lx\n", name, type->cnt);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001624
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -08001625 for_each_memblock_type(type, rgn) {
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001626 char nid_buf[32] = "";
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001627
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001628 base = rgn->base;
1629 size = rgn->size;
Tang Chen66a20752014-01-21 15:49:20 -08001630 flags = rgn->flags;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001631#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1632 if (memblock_get_region_node(rgn) != MAX_NUMNODES)
1633 snprintf(nid_buf, sizeof(nid_buf), " on node %d",
1634 memblock_get_region_node(rgn));
1635#endif
Tang Chen66a20752014-01-21 15:49:20 -08001636 pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s flags: %#lx\n",
Alexander Kuleshov8c9c1702016-01-14 15:20:42 -08001637 name, idx, base, base + size - 1, size, nid_buf, flags);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001638 }
1639}
1640
Tejun Heo4ff7b822011-12-08 10:22:06 -08001641void __init_memblock __memblock_dump_all(void)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001642{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001643 pr_info("MEMBLOCK configuration:\n");
Tejun Heo1440c4e2011-12-08 10:22:08 -08001644 pr_info(" memory size = %#llx reserved size = %#llx\n",
1645 (unsigned long long)memblock.memory.total_size,
1646 (unsigned long long)memblock.reserved.total_size);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001647
1648 memblock_dump(&memblock.memory, "memory");
1649 memblock_dump(&memblock.reserved, "reserved");
1650}
1651
Tejun Heo1aadc052011-12-08 10:22:08 -08001652void __init memblock_allow_resize(void)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001653{
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -07001654 memblock_can_resize = 1;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001655}
1656
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001657static int __init early_memblock(char *p)
1658{
1659 if (p && strstr(p, "debug"))
1660 memblock_debug = 1;
1661 return 0;
1662}
1663early_param("memblock", early_memblock);
1664
Tejun Heoc378ddd2011-07-14 11:46:03 +02001665#if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001666
1667static int memblock_debug_show(struct seq_file *m, void *private)
1668{
1669 struct memblock_type *type = m->private;
1670 struct memblock_region *reg;
1671 int i;
1672
1673 for (i = 0; i < type->cnt; i++) {
1674 reg = &type->regions[i];
1675 seq_printf(m, "%4d: ", i);
1676 if (sizeof(phys_addr_t) == 4)
1677 seq_printf(m, "0x%08lx..0x%08lx\n",
1678 (unsigned long)reg->base,
1679 (unsigned long)(reg->base + reg->size - 1));
1680 else
1681 seq_printf(m, "0x%016llx..0x%016llx\n",
1682 (unsigned long long)reg->base,
1683 (unsigned long long)(reg->base + reg->size - 1));
1684
1685 }
1686 return 0;
1687}
1688
1689static int memblock_debug_open(struct inode *inode, struct file *file)
1690{
1691 return single_open(file, memblock_debug_show, inode->i_private);
1692}
1693
1694static const struct file_operations memblock_debug_fops = {
1695 .open = memblock_debug_open,
1696 .read = seq_read,
1697 .llseek = seq_lseek,
1698 .release = single_release,
1699};
1700
1701static int __init memblock_init_debugfs(void)
1702{
1703 struct dentry *root = debugfs_create_dir("memblock", NULL);
1704 if (!root)
1705 return -ENXIO;
1706 debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops);
1707 debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops);
Philipp Hachtmann70210ed2014-01-29 18:16:01 +01001708#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
1709 debugfs_create_file("physmem", S_IRUGO, root, &memblock.physmem, &memblock_debug_fops);
1710#endif
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001711
1712 return 0;
1713}
1714__initcall(memblock_init_debugfs);
1715
1716#endif /* CONFIG_DEBUG_FS */