blob: 7fe5354e7552c0507eb6a6b778eee42d1c2182af [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;
30
31struct memblock memblock __initdata_memblock = {
32 .memory.regions = memblock_memory_init_regions,
33 .memory.cnt = 1, /* empty dummy entry */
34 .memory.max = INIT_MEMBLOCK_REGIONS,
35
36 .reserved.regions = memblock_reserved_init_regions,
37 .reserved.cnt = 1, /* empty dummy entry */
38 .reserved.max = INIT_MEMBLOCK_REGIONS,
39
Tang Chen79442ed2013-11-12 15:07:59 -080040 .bottom_up = false,
Tejun Heofe091c22011-12-08 10:22:07 -080041 .current_limit = MEMBLOCK_ALLOC_ANYWHERE,
42};
Yinghai Lu95f72d12010-07-12 14:36:09 +100043
Yinghai Lu10d06432010-07-28 15:43:02 +100044int memblock_debug __initdata_memblock;
Tang Chen55ac5902014-01-21 15:49:35 -080045#ifdef CONFIG_MOVABLE_NODE
46bool movable_node_enabled __initdata_memblock = false;
47#endif
Tejun Heo1aadc052011-12-08 10:22:08 -080048static int memblock_can_resize __initdata_memblock;
Gavin Shan181eb392012-05-29 15:06:50 -070049static int memblock_memory_in_slab __initdata_memblock = 0;
50static int memblock_reserved_in_slab __initdata_memblock = 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +100051
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -070052/* inline so we don't get a warning when pr_debug is compiled out */
Raghavendra D Prabhuc2233112012-10-08 16:33:55 -070053static __init_memblock const char *
54memblock_type_name(struct memblock_type *type)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -070055{
56 if (type == &memblock.memory)
57 return "memory";
58 else if (type == &memblock.reserved)
59 return "reserved";
60 else
61 return "unknown";
62}
63
Tejun Heoeb18f1b2011-12-08 10:22:07 -080064/* adjust *@size so that (@base + *@size) doesn't overflow, return new size */
65static inline phys_addr_t memblock_cap_size(phys_addr_t base, phys_addr_t *size)
66{
67 return *size = min(*size, (phys_addr_t)ULLONG_MAX - base);
68}
69
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100070/*
71 * Address comparison utilities
72 */
Yinghai Lu10d06432010-07-28 15:43:02 +100073static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1,
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +100074 phys_addr_t base2, phys_addr_t size2)
Yinghai Lu95f72d12010-07-12 14:36:09 +100075{
76 return ((base1 < (base2 + size2)) && (base2 < (base1 + size1)));
77}
78
H Hartley Sweeten2d7d3eb2011-10-31 17:09:15 -070079static long __init_memblock memblock_overlaps_region(struct memblock_type *type,
80 phys_addr_t base, phys_addr_t size)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100081{
82 unsigned long i;
83
84 for (i = 0; i < type->cnt; i++) {
85 phys_addr_t rgnbase = type->regions[i].base;
86 phys_addr_t rgnsize = type->regions[i].size;
87 if (memblock_addrs_overlap(base, size, rgnbase, rgnsize))
88 break;
89 }
90
91 return (i < type->cnt) ? i : -1;
92}
93
Tang Chen79442ed2013-11-12 15:07:59 -080094/*
95 * __memblock_find_range_bottom_up - find free area utility in bottom-up
96 * @start: start of candidate range
97 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
98 * @size: size of free area to find
99 * @align: alignment of free area to find
Grygorii Strashkob1154232014-01-21 15:50:16 -0800100 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Tang Chen79442ed2013-11-12 15:07:59 -0800101 *
102 * Utility called from memblock_find_in_range_node(), find free area bottom-up.
103 *
104 * RETURNS:
105 * Found address on success, 0 on failure.
106 */
107static phys_addr_t __init_memblock
108__memblock_find_range_bottom_up(phys_addr_t start, phys_addr_t end,
109 phys_addr_t size, phys_addr_t align, int nid)
110{
111 phys_addr_t this_start, this_end, cand;
112 u64 i;
113
114 for_each_free_mem_range(i, nid, &this_start, &this_end, NULL) {
115 this_start = clamp(this_start, start, end);
116 this_end = clamp(this_end, start, end);
117
118 cand = round_up(this_start, align);
119 if (cand < this_end && this_end - cand >= size)
120 return cand;
121 }
122
123 return 0;
124}
125
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800126/**
Tang Chen14028992013-11-12 15:07:57 -0800127 * __memblock_find_range_top_down - find free area utility, in top-down
128 * @start: start of candidate range
129 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
130 * @size: size of free area to find
131 * @align: alignment of free area to find
Grygorii Strashkob1154232014-01-21 15:50:16 -0800132 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Tang Chen14028992013-11-12 15:07:57 -0800133 *
134 * Utility called from memblock_find_in_range_node(), find free area top-down.
135 *
136 * RETURNS:
Tang Chen79442ed2013-11-12 15:07:59 -0800137 * Found address on success, 0 on failure.
Tang Chen14028992013-11-12 15:07:57 -0800138 */
139static phys_addr_t __init_memblock
140__memblock_find_range_top_down(phys_addr_t start, phys_addr_t end,
141 phys_addr_t size, phys_addr_t align, int nid)
142{
143 phys_addr_t this_start, this_end, cand;
144 u64 i;
145
146 for_each_free_mem_range_reverse(i, nid, &this_start, &this_end, NULL) {
147 this_start = clamp(this_start, start, end);
148 this_end = clamp(this_end, start, end);
149
150 if (this_end < size)
151 continue;
152
153 cand = round_down(this_end - size, align);
154 if (cand >= this_start)
155 return cand;
156 }
157
158 return 0;
159}
160
161/**
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800162 * memblock_find_in_range_node - find free area in given range and node
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800163 * @size: size of free area to find
164 * @align: alignment of free area to find
Grygorii Strashko87029ee2014-01-21 15:50:14 -0800165 * @start: start of candidate range
166 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
Grygorii Strashkob1154232014-01-21 15:50:16 -0800167 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800168 *
169 * Find @size free area aligned to @align in the specified range and node.
170 *
Tang Chen79442ed2013-11-12 15:07:59 -0800171 * When allocation direction is bottom-up, the @start should be greater
172 * than the end of the kernel image. Otherwise, it will be trimmed. The
173 * reason is that we want the bottom-up allocation just near the kernel
174 * image so it is highly likely that the allocated memory and the kernel
175 * will reside in the same node.
176 *
177 * If bottom-up allocation failed, will try to allocate memory top-down.
178 *
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800179 * RETURNS:
Tang Chen79442ed2013-11-12 15:07:59 -0800180 * Found address on success, 0 on failure.
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000181 */
Grygorii Strashko87029ee2014-01-21 15:50:14 -0800182phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t size,
183 phys_addr_t align, phys_addr_t start,
184 phys_addr_t end, int nid)
Tang Chenf7210e62013-02-22 16:33:51 -0800185{
Tang Chen79442ed2013-11-12 15:07:59 -0800186 int ret;
187 phys_addr_t kernel_end;
188
Tang Chenf7210e62013-02-22 16:33:51 -0800189 /* pump up @end */
190 if (end == MEMBLOCK_ALLOC_ACCESSIBLE)
191 end = memblock.current_limit;
192
193 /* avoid allocating the first page */
194 start = max_t(phys_addr_t, start, PAGE_SIZE);
195 end = max(start, end);
Tang Chen79442ed2013-11-12 15:07:59 -0800196 kernel_end = __pa_symbol(_end);
197
198 /*
199 * try bottom-up allocation only when bottom-up mode
200 * is set and @end is above the kernel image.
201 */
202 if (memblock_bottom_up() && end > kernel_end) {
203 phys_addr_t bottom_up_start;
204
205 /* make sure we will allocate above the kernel */
206 bottom_up_start = max(start, kernel_end);
207
208 /* ok, try bottom-up allocation first */
209 ret = __memblock_find_range_bottom_up(bottom_up_start, end,
210 size, align, nid);
211 if (ret)
212 return ret;
213
214 /*
215 * we always limit bottom-up allocation above the kernel,
216 * but top-down allocation doesn't have the limit, so
217 * retrying top-down allocation may succeed when bottom-up
218 * allocation failed.
219 *
220 * bottom-up allocation is expected to be fail very rarely,
221 * so we use WARN_ONCE() here to see the stack trace if
222 * fail happens.
223 */
224 WARN_ONCE(1, "memblock: bottom-up allocation failed, "
225 "memory hotunplug may be affected\n");
226 }
Tang Chenf7210e62013-02-22 16:33:51 -0800227
Tang Chen14028992013-11-12 15:07:57 -0800228 return __memblock_find_range_top_down(start, end, size, align, nid);
Tang Chenf7210e62013-02-22 16:33:51 -0800229}
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000230
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800231/**
232 * memblock_find_in_range - find free area in given range
233 * @start: start of candidate range
234 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
235 * @size: size of free area to find
236 * @align: alignment of free area to find
237 *
238 * Find @size free area aligned to @align in the specified range.
239 *
240 * RETURNS:
Tang Chen79442ed2013-11-12 15:07:59 -0800241 * Found address on success, 0 on failure.
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800242 */
243phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start,
244 phys_addr_t end, phys_addr_t size,
245 phys_addr_t align)
246{
Grygorii Strashko87029ee2014-01-21 15:50:14 -0800247 return memblock_find_in_range_node(size, align, start, end,
Grygorii Strashkob1154232014-01-21 15:50:16 -0800248 NUMA_NO_NODE);
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800249}
250
Yinghai Lu10d06432010-07-28 15:43:02 +1000251static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000252{
Tejun Heo1440c4e2011-12-08 10:22:08 -0800253 type->total_size -= type->regions[r].size;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200254 memmove(&type->regions[r], &type->regions[r + 1],
255 (type->cnt - (r + 1)) * sizeof(type->regions[r]));
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000256 type->cnt--;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000257
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700258 /* Special case for empty arrays */
259 if (type->cnt == 0) {
Tejun Heo1440c4e2011-12-08 10:22:08 -0800260 WARN_ON(type->total_size != 0);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700261 type->cnt = 1;
262 type->regions[0].base = 0;
263 type->regions[0].size = 0;
Tang Chen66a20752014-01-21 15:49:20 -0800264 type->regions[0].flags = 0;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200265 memblock_set_region_node(&type->regions[0], MAX_NUMNODES);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700266 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000267}
268
Philipp Hachtmann354f17e2014-01-23 15:53:24 -0800269#ifdef CONFIG_ARCH_DISCARD_MEMBLOCK
270
Yinghai Lu29f67382012-07-11 14:02:56 -0700271phys_addr_t __init_memblock get_allocated_memblock_reserved_regions_info(
272 phys_addr_t *addr)
273{
274 if (memblock.reserved.regions == memblock_reserved_init_regions)
275 return 0;
276
277 *addr = __pa(memblock.reserved.regions);
278
279 return PAGE_ALIGN(sizeof(struct memblock_region) *
280 memblock.reserved.max);
281}
282
Philipp Hachtmann5e270e22014-01-23 15:53:11 -0800283phys_addr_t __init_memblock get_allocated_memblock_memory_regions_info(
284 phys_addr_t *addr)
285{
286 if (memblock.memory.regions == memblock_memory_init_regions)
287 return 0;
288
289 *addr = __pa(memblock.memory.regions);
290
291 return PAGE_ALIGN(sizeof(struct memblock_region) *
292 memblock.memory.max);
293}
294
295#endif
296
Greg Pearson48c3b582012-06-20 12:53:05 -0700297/**
298 * memblock_double_array - double the size of the memblock regions array
299 * @type: memblock type of the regions array being doubled
300 * @new_area_start: starting address of memory range to avoid overlap with
301 * @new_area_size: size of memory range to avoid overlap with
302 *
303 * Double the size of the @type regions array. If memblock is being used to
304 * allocate memory for a new reserved regions array and there is a previously
305 * allocated memory range [@new_area_start,@new_area_start+@new_area_size]
306 * waiting to be reserved, ensure the memory used by the new array does
307 * not overlap.
308 *
309 * RETURNS:
310 * 0 on success, -1 on failure.
311 */
312static int __init_memblock memblock_double_array(struct memblock_type *type,
313 phys_addr_t new_area_start,
314 phys_addr_t new_area_size)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700315{
316 struct memblock_region *new_array, *old_array;
Yinghai Lu29f67382012-07-11 14:02:56 -0700317 phys_addr_t old_alloc_size, new_alloc_size;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700318 phys_addr_t old_size, new_size, addr;
319 int use_slab = slab_is_available();
Gavin Shan181eb392012-05-29 15:06:50 -0700320 int *in_slab;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700321
322 /* We don't allow resizing until we know about the reserved regions
323 * of memory that aren't suitable for allocation
324 */
325 if (!memblock_can_resize)
326 return -1;
327
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700328 /* Calculate new doubled size */
329 old_size = type->max * sizeof(struct memblock_region);
330 new_size = old_size << 1;
Yinghai Lu29f67382012-07-11 14:02:56 -0700331 /*
332 * We need to allocated new one align to PAGE_SIZE,
333 * so we can free them completely later.
334 */
335 old_alloc_size = PAGE_ALIGN(old_size);
336 new_alloc_size = PAGE_ALIGN(new_size);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700337
Gavin Shan181eb392012-05-29 15:06:50 -0700338 /* Retrieve the slab flag */
339 if (type == &memblock.memory)
340 in_slab = &memblock_memory_in_slab;
341 else
342 in_slab = &memblock_reserved_in_slab;
343
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700344 /* Try to find some space for it.
345 *
346 * WARNING: We assume that either slab_is_available() and we use it or
Andrew Mortonfd073832012-07-31 16:42:40 -0700347 * we use MEMBLOCK for allocations. That means that this is unsafe to
348 * use when bootmem is currently active (unless bootmem itself is
349 * implemented on top of MEMBLOCK which isn't the case yet)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700350 *
351 * This should however not be an issue for now, as we currently only
Andrew Mortonfd073832012-07-31 16:42:40 -0700352 * call into MEMBLOCK while it's still active, or much later when slab
353 * is active for memory hotplug operations
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700354 */
355 if (use_slab) {
356 new_array = kmalloc(new_size, GFP_KERNEL);
Tejun Heo1f5026a2011-07-12 09:58:09 +0200357 addr = new_array ? __pa(new_array) : 0;
Gavin Shan4e2f0772012-05-29 15:06:50 -0700358 } else {
Greg Pearson48c3b582012-06-20 12:53:05 -0700359 /* only exclude range when trying to double reserved.regions */
360 if (type != &memblock.reserved)
361 new_area_start = new_area_size = 0;
362
363 addr = memblock_find_in_range(new_area_start + new_area_size,
364 memblock.current_limit,
Yinghai Lu29f67382012-07-11 14:02:56 -0700365 new_alloc_size, PAGE_SIZE);
Greg Pearson48c3b582012-06-20 12:53:05 -0700366 if (!addr && new_area_size)
367 addr = memblock_find_in_range(0,
Andrew Mortonfd073832012-07-31 16:42:40 -0700368 min(new_area_start, memblock.current_limit),
369 new_alloc_size, PAGE_SIZE);
Greg Pearson48c3b582012-06-20 12:53:05 -0700370
Sachin Kamat15674862012-09-04 13:55:05 +0530371 new_array = addr ? __va(addr) : NULL;
Gavin Shan4e2f0772012-05-29 15:06:50 -0700372 }
Tejun Heo1f5026a2011-07-12 09:58:09 +0200373 if (!addr) {
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700374 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
375 memblock_type_name(type), type->max, type->max * 2);
376 return -1;
377 }
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700378
Andrew Mortonfd073832012-07-31 16:42:40 -0700379 memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]",
380 memblock_type_name(type), type->max * 2, (u64)addr,
381 (u64)addr + new_size - 1);
Yinghai Luea9e4372010-07-28 15:13:22 +1000382
Andrew Mortonfd073832012-07-31 16:42:40 -0700383 /*
384 * Found space, we now need to move the array over before we add the
385 * reserved region since it may be our reserved array itself that is
386 * full.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700387 */
388 memcpy(new_array, type->regions, old_size);
389 memset(new_array + type->max, 0, old_size);
390 old_array = type->regions;
391 type->regions = new_array;
392 type->max <<= 1;
393
Andrew Mortonfd073832012-07-31 16:42:40 -0700394 /* Free old array. We needn't free it if the array is the static one */
Gavin Shan181eb392012-05-29 15:06:50 -0700395 if (*in_slab)
396 kfree(old_array);
397 else if (old_array != memblock_memory_init_regions &&
398 old_array != memblock_reserved_init_regions)
Yinghai Lu29f67382012-07-11 14:02:56 -0700399 memblock_free(__pa(old_array), old_alloc_size);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700400
Andrew Mortonfd073832012-07-31 16:42:40 -0700401 /*
402 * Reserve the new array if that comes from the memblock. Otherwise, we
403 * needn't do it
Gavin Shan181eb392012-05-29 15:06:50 -0700404 */
405 if (!use_slab)
Yinghai Lu29f67382012-07-11 14:02:56 -0700406 BUG_ON(memblock_reserve(addr, new_alloc_size));
Gavin Shan181eb392012-05-29 15:06:50 -0700407
408 /* Update slab flag */
409 *in_slab = use_slab;
410
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700411 return 0;
412}
413
Tejun Heo784656f92011-07-12 11:15:55 +0200414/**
415 * memblock_merge_regions - merge neighboring compatible regions
416 * @type: memblock type to scan
417 *
418 * Scan @type and merge neighboring compatible regions.
419 */
420static void __init_memblock memblock_merge_regions(struct memblock_type *type)
421{
422 int i = 0;
423
424 /* cnt never goes below 1 */
425 while (i < type->cnt - 1) {
426 struct memblock_region *this = &type->regions[i];
427 struct memblock_region *next = &type->regions[i + 1];
428
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200429 if (this->base + this->size != next->base ||
430 memblock_get_region_node(this) !=
Tang Chen66a20752014-01-21 15:49:20 -0800431 memblock_get_region_node(next) ||
432 this->flags != next->flags) {
Tejun Heo784656f92011-07-12 11:15:55 +0200433 BUG_ON(this->base + this->size > next->base);
434 i++;
435 continue;
436 }
437
438 this->size += next->size;
Lin Fengc0232ae2013-01-11 14:31:44 -0800439 /* move forward from next + 1, index of which is i + 2 */
440 memmove(next, next + 1, (type->cnt - (i + 2)) * sizeof(*next));
Tejun Heo784656f92011-07-12 11:15:55 +0200441 type->cnt--;
442 }
443}
444
445/**
446 * memblock_insert_region - insert new memblock region
Tang Chen209ff862013-04-29 15:08:41 -0700447 * @type: memblock type to insert into
448 * @idx: index for the insertion point
449 * @base: base address of the new region
450 * @size: size of the new region
451 * @nid: node id of the new region
Tang Chen66a20752014-01-21 15:49:20 -0800452 * @flags: flags of the new region
Tejun Heo784656f92011-07-12 11:15:55 +0200453 *
454 * Insert new memblock region [@base,@base+@size) into @type at @idx.
455 * @type must already have extra room to accomodate the new region.
456 */
457static void __init_memblock memblock_insert_region(struct memblock_type *type,
458 int idx, phys_addr_t base,
Tang Chen66a20752014-01-21 15:49:20 -0800459 phys_addr_t size,
460 int nid, unsigned long flags)
Tejun Heo784656f92011-07-12 11:15:55 +0200461{
462 struct memblock_region *rgn = &type->regions[idx];
463
464 BUG_ON(type->cnt >= type->max);
465 memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn));
466 rgn->base = base;
467 rgn->size = size;
Tang Chen66a20752014-01-21 15:49:20 -0800468 rgn->flags = flags;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200469 memblock_set_region_node(rgn, nid);
Tejun Heo784656f92011-07-12 11:15:55 +0200470 type->cnt++;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800471 type->total_size += size;
Tejun Heo784656f92011-07-12 11:15:55 +0200472}
473
474/**
475 * memblock_add_region - add new memblock region
476 * @type: memblock type to add new region into
477 * @base: base address of the new region
478 * @size: size of the new region
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800479 * @nid: nid of the new region
Tang Chen66a20752014-01-21 15:49:20 -0800480 * @flags: flags of the new region
Tejun Heo784656f92011-07-12 11:15:55 +0200481 *
482 * Add new memblock region [@base,@base+@size) into @type. The new region
483 * is allowed to overlap with existing ones - overlaps don't affect already
484 * existing regions. @type is guaranteed to be minimal (all neighbouring
485 * compatible regions are merged) after the addition.
486 *
487 * RETURNS:
488 * 0 on success, -errno on failure.
489 */
Tejun Heo581adcb2011-12-08 10:22:06 -0800490static int __init_memblock memblock_add_region(struct memblock_type *type,
Tang Chen66a20752014-01-21 15:49:20 -0800491 phys_addr_t base, phys_addr_t size,
492 int nid, unsigned long flags)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000493{
Tejun Heo784656f92011-07-12 11:15:55 +0200494 bool insert = false;
Tejun Heoeb18f1b2011-12-08 10:22:07 -0800495 phys_addr_t obase = base;
496 phys_addr_t end = base + memblock_cap_size(base, &size);
Tejun Heo784656f92011-07-12 11:15:55 +0200497 int i, nr_new;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000498
Tejun Heob3dc6272012-04-20 08:31:34 -0700499 if (!size)
500 return 0;
501
Tejun Heo784656f92011-07-12 11:15:55 +0200502 /* special case for empty array */
503 if (type->regions[0].size == 0) {
Tejun Heo1440c4e2011-12-08 10:22:08 -0800504 WARN_ON(type->cnt != 1 || type->total_size);
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000505 type->regions[0].base = base;
506 type->regions[0].size = size;
Tang Chen66a20752014-01-21 15:49:20 -0800507 type->regions[0].flags = flags;
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800508 memblock_set_region_node(&type->regions[0], nid);
Tejun Heo1440c4e2011-12-08 10:22:08 -0800509 type->total_size = size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000510 return 0;
511 }
Tejun Heo784656f92011-07-12 11:15:55 +0200512repeat:
513 /*
514 * The following is executed twice. Once with %false @insert and
515 * then with %true. The first counts the number of regions needed
516 * to accomodate the new area. The second actually inserts them.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700517 */
Tejun Heo784656f92011-07-12 11:15:55 +0200518 base = obase;
519 nr_new = 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000520
Tejun Heo784656f92011-07-12 11:15:55 +0200521 for (i = 0; i < type->cnt; i++) {
522 struct memblock_region *rgn = &type->regions[i];
523 phys_addr_t rbase = rgn->base;
524 phys_addr_t rend = rbase + rgn->size;
525
526 if (rbase >= end)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000527 break;
Tejun Heo784656f92011-07-12 11:15:55 +0200528 if (rend <= base)
529 continue;
530 /*
531 * @rgn overlaps. If it separates the lower part of new
532 * area, insert that portion.
533 */
534 if (rbase > base) {
535 nr_new++;
536 if (insert)
537 memblock_insert_region(type, i++, base,
Tang Chen66a20752014-01-21 15:49:20 -0800538 rbase - base, nid,
539 flags);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000540 }
Tejun Heo784656f92011-07-12 11:15:55 +0200541 /* area below @rend is dealt with, forget about it */
542 base = min(rend, end);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000543 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000544
Tejun Heo784656f92011-07-12 11:15:55 +0200545 /* insert the remaining portion */
546 if (base < end) {
547 nr_new++;
548 if (insert)
Tang Chen66a20752014-01-21 15:49:20 -0800549 memblock_insert_region(type, i, base, end - base,
550 nid, flags);
Tejun Heo784656f92011-07-12 11:15:55 +0200551 }
552
553 /*
554 * If this was the first round, resize array and repeat for actual
555 * insertions; otherwise, merge and return.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700556 */
Tejun Heo784656f92011-07-12 11:15:55 +0200557 if (!insert) {
558 while (type->cnt + nr_new > type->max)
Greg Pearson48c3b582012-06-20 12:53:05 -0700559 if (memblock_double_array(type, obase, size) < 0)
Tejun Heo784656f92011-07-12 11:15:55 +0200560 return -ENOMEM;
561 insert = true;
562 goto repeat;
563 } else {
564 memblock_merge_regions(type);
565 return 0;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700566 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000567}
568
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800569int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size,
570 int nid)
571{
Tang Chen66a20752014-01-21 15:49:20 -0800572 return memblock_add_region(&memblock.memory, base, size, nid, 0);
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800573}
574
Tejun Heo581adcb2011-12-08 10:22:06 -0800575int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000576{
Tang Chen66a20752014-01-21 15:49:20 -0800577 return memblock_add_region(&memblock.memory, base, size,
578 MAX_NUMNODES, 0);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000579}
580
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800581/**
582 * memblock_isolate_range - isolate given range into disjoint memblocks
583 * @type: memblock type to isolate range for
584 * @base: base of range to isolate
585 * @size: size of range to isolate
586 * @start_rgn: out parameter for the start of isolated region
587 * @end_rgn: out parameter for the end of isolated region
588 *
589 * Walk @type and ensure that regions don't cross the boundaries defined by
590 * [@base,@base+@size). Crossing regions are split at the boundaries,
591 * which may create at most two more regions. The index of the first
592 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
593 *
594 * RETURNS:
595 * 0 on success, -errno on failure.
596 */
597static int __init_memblock memblock_isolate_range(struct memblock_type *type,
598 phys_addr_t base, phys_addr_t size,
599 int *start_rgn, int *end_rgn)
600{
Tejun Heoeb18f1b2011-12-08 10:22:07 -0800601 phys_addr_t end = base + memblock_cap_size(base, &size);
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800602 int i;
603
604 *start_rgn = *end_rgn = 0;
605
Tejun Heob3dc6272012-04-20 08:31:34 -0700606 if (!size)
607 return 0;
608
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800609 /* we'll create at most two more regions */
610 while (type->cnt + 2 > type->max)
Greg Pearson48c3b582012-06-20 12:53:05 -0700611 if (memblock_double_array(type, base, size) < 0)
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800612 return -ENOMEM;
613
614 for (i = 0; i < type->cnt; i++) {
615 struct memblock_region *rgn = &type->regions[i];
616 phys_addr_t rbase = rgn->base;
617 phys_addr_t rend = rbase + rgn->size;
618
619 if (rbase >= end)
620 break;
621 if (rend <= base)
622 continue;
623
624 if (rbase < base) {
625 /*
626 * @rgn intersects from below. Split and continue
627 * to process the next region - the new top half.
628 */
629 rgn->base = base;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800630 rgn->size -= base - rbase;
631 type->total_size -= base - rbase;
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800632 memblock_insert_region(type, i, rbase, base - rbase,
Tang Chen66a20752014-01-21 15:49:20 -0800633 memblock_get_region_node(rgn),
634 rgn->flags);
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800635 } else if (rend > end) {
636 /*
637 * @rgn intersects from above. Split and redo the
638 * current region - the new bottom half.
639 */
640 rgn->base = end;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800641 rgn->size -= end - rbase;
642 type->total_size -= end - rbase;
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800643 memblock_insert_region(type, i--, rbase, end - rbase,
Tang Chen66a20752014-01-21 15:49:20 -0800644 memblock_get_region_node(rgn),
645 rgn->flags);
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800646 } else {
647 /* @rgn is fully contained, record it */
648 if (!*end_rgn)
649 *start_rgn = i;
650 *end_rgn = i + 1;
651 }
652 }
653
654 return 0;
655}
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800656
Tejun Heo581adcb2011-12-08 10:22:06 -0800657static int __init_memblock __memblock_remove(struct memblock_type *type,
658 phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000659{
Tejun Heo71936182011-12-08 10:22:07 -0800660 int start_rgn, end_rgn;
661 int i, ret;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000662
Tejun Heo71936182011-12-08 10:22:07 -0800663 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
664 if (ret)
665 return ret;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000666
Tejun Heo71936182011-12-08 10:22:07 -0800667 for (i = end_rgn - 1; i >= start_rgn; i--)
668 memblock_remove_region(type, i);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700669 return 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000670}
671
Tejun Heo581adcb2011-12-08 10:22:06 -0800672int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000673{
674 return __memblock_remove(&memblock.memory, base, size);
675}
676
Tejun Heo581adcb2011-12-08 10:22:06 -0800677int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000678{
Tejun Heo24aa0782011-07-12 11:16:06 +0200679 memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n",
H. Peter Anvina1504392011-07-14 11:57:10 -0700680 (unsigned long long)base,
Grygorii Strashko931d13f2014-01-21 15:49:17 -0800681 (unsigned long long)base + size - 1,
H. Peter Anvina1504392011-07-14 11:57:10 -0700682 (void *)_RET_IP_);
Tejun Heo24aa0782011-07-12 11:16:06 +0200683
Yinghai Lu95f72d12010-07-12 14:36:09 +1000684 return __memblock_remove(&memblock.reserved, base, size);
685}
686
Tang Chen66a20752014-01-21 15:49:20 -0800687static int __init_memblock memblock_reserve_region(phys_addr_t base,
688 phys_addr_t size,
689 int nid,
690 unsigned long flags)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000691{
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000692 struct memblock_type *_rgn = &memblock.reserved;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000693
Tang Chen66a20752014-01-21 15:49:20 -0800694 memblock_dbg("memblock_reserve: [%#016llx-%#016llx] flags %#02lx %pF\n",
H. Peter Anvina1504392011-07-14 11:57:10 -0700695 (unsigned long long)base,
Grygorii Strashko931d13f2014-01-21 15:49:17 -0800696 (unsigned long long)base + size - 1,
Tang Chen66a20752014-01-21 15:49:20 -0800697 flags, (void *)_RET_IP_);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000698
Tang Chen66a20752014-01-21 15:49:20 -0800699 return memblock_add_region(_rgn, base, size, nid, flags);
700}
701
702int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size)
703{
704 return memblock_reserve_region(base, size, MAX_NUMNODES, 0);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000705}
706
Tejun Heo35fd0802011-07-12 11:15:59 +0200707/**
Tang Chen66b16ed2014-01-21 15:49:23 -0800708 * memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG.
709 * @base: the base phys addr of the region
710 * @size: the size of the region
711 *
712 * This function isolates region [@base, @base + @size), and mark it with flag
713 * MEMBLOCK_HOTPLUG.
714 *
715 * Return 0 on succees, -errno on failure.
716 */
717int __init_memblock memblock_mark_hotplug(phys_addr_t base, phys_addr_t size)
718{
719 struct memblock_type *type = &memblock.memory;
720 int i, ret, start_rgn, end_rgn;
721
722 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
723 if (ret)
724 return ret;
725
726 for (i = start_rgn; i < end_rgn; i++)
727 memblock_set_region_flags(&type->regions[i], MEMBLOCK_HOTPLUG);
728
729 memblock_merge_regions(type);
730 return 0;
731}
732
733/**
734 * memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region.
735 * @base: the base phys addr of the region
736 * @size: the size of the region
737 *
738 * This function isolates region [@base, @base + @size), and clear flag
739 * MEMBLOCK_HOTPLUG for the isolated regions.
740 *
741 * Return 0 on succees, -errno on failure.
742 */
743int __init_memblock memblock_clear_hotplug(phys_addr_t base, phys_addr_t size)
744{
745 struct memblock_type *type = &memblock.memory;
746 int i, ret, start_rgn, end_rgn;
747
748 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
749 if (ret)
750 return ret;
751
752 for (i = start_rgn; i < end_rgn; i++)
753 memblock_clear_region_flags(&type->regions[i],
754 MEMBLOCK_HOTPLUG);
755
756 memblock_merge_regions(type);
757 return 0;
758}
759
760/**
Tejun Heo35fd0802011-07-12 11:15:59 +0200761 * __next_free_mem_range - next function for for_each_free_mem_range()
762 * @idx: pointer to u64 loop variable
Grygorii Strashkob1154232014-01-21 15:50:16 -0800763 * @nid: node selector, %NUMA_NO_NODE for all nodes
Wanpeng Lidad75572012-06-20 12:53:01 -0700764 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
765 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
766 * @out_nid: ptr to int for nid of the range, can be %NULL
Tejun Heo35fd0802011-07-12 11:15:59 +0200767 *
768 * Find the first free area from *@idx which matches @nid, fill the out
769 * parameters, and update *@idx for the next iteration. The lower 32bit of
770 * *@idx contains index into memory region and the upper 32bit indexes the
771 * areas before each reserved region. For example, if reserved regions
772 * look like the following,
773 *
774 * 0:[0-16), 1:[32-48), 2:[128-130)
775 *
776 * The upper 32bit indexes the following regions.
777 *
778 * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX)
779 *
780 * As both region arrays are sorted, the function advances the two indices
781 * in lockstep and returns each intersection.
782 */
783void __init_memblock __next_free_mem_range(u64 *idx, int nid,
784 phys_addr_t *out_start,
785 phys_addr_t *out_end, int *out_nid)
786{
787 struct memblock_type *mem = &memblock.memory;
788 struct memblock_type *rsv = &memblock.reserved;
789 int mi = *idx & 0xffffffff;
790 int ri = *idx >> 32;
Grygorii Strashkob1154232014-01-21 15:50:16 -0800791
Grygorii Strashko560dca272014-01-21 15:50:55 -0800792 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
793 nid = NUMA_NO_NODE;
Tejun Heo35fd0802011-07-12 11:15:59 +0200794
795 for ( ; mi < mem->cnt; mi++) {
796 struct memblock_region *m = &mem->regions[mi];
797 phys_addr_t m_start = m->base;
798 phys_addr_t m_end = m->base + m->size;
799
800 /* only memory regions are associated with nodes, check it */
Grygorii Strashko560dca272014-01-21 15:50:55 -0800801 if (nid != NUMA_NO_NODE && nid != memblock_get_region_node(m))
Tejun Heo35fd0802011-07-12 11:15:59 +0200802 continue;
803
804 /* scan areas before each reservation for intersection */
805 for ( ; ri < rsv->cnt + 1; ri++) {
806 struct memblock_region *r = &rsv->regions[ri];
807 phys_addr_t r_start = ri ? r[-1].base + r[-1].size : 0;
808 phys_addr_t r_end = ri < rsv->cnt ? r->base : ULLONG_MAX;
809
810 /* if ri advanced past mi, break out to advance mi */
811 if (r_start >= m_end)
812 break;
813 /* if the two regions intersect, we're done */
814 if (m_start < r_end) {
815 if (out_start)
816 *out_start = max(m_start, r_start);
817 if (out_end)
818 *out_end = min(m_end, r_end);
819 if (out_nid)
820 *out_nid = memblock_get_region_node(m);
821 /*
822 * The region which ends first is advanced
823 * for the next iteration.
824 */
825 if (m_end <= r_end)
826 mi++;
827 else
828 ri++;
829 *idx = (u32)mi | (u64)ri << 32;
830 return;
831 }
832 }
833 }
834
835 /* signal end of iteration */
836 *idx = ULLONG_MAX;
837}
838
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800839/**
840 * __next_free_mem_range_rev - next function for for_each_free_mem_range_reverse()
841 * @idx: pointer to u64 loop variable
Grygorii Strashkob1154232014-01-21 15:50:16 -0800842 * @nid: nid: node selector, %NUMA_NO_NODE for all nodes
Wanpeng Lidad75572012-06-20 12:53:01 -0700843 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
844 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
845 * @out_nid: ptr to int for nid of the range, can be %NULL
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800846 *
847 * Reverse of __next_free_mem_range().
Tang Chen55ac5902014-01-21 15:49:35 -0800848 *
849 * Linux kernel cannot migrate pages used by itself. Memory hotplug users won't
850 * be able to hot-remove hotpluggable memory used by the kernel. So this
851 * function skip hotpluggable regions if needed when allocating memory for the
852 * kernel.
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800853 */
854void __init_memblock __next_free_mem_range_rev(u64 *idx, int nid,
855 phys_addr_t *out_start,
856 phys_addr_t *out_end, int *out_nid)
857{
858 struct memblock_type *mem = &memblock.memory;
859 struct memblock_type *rsv = &memblock.reserved;
860 int mi = *idx & 0xffffffff;
861 int ri = *idx >> 32;
Grygorii Strashkob1154232014-01-21 15:50:16 -0800862
Grygorii Strashko560dca272014-01-21 15:50:55 -0800863 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
864 nid = NUMA_NO_NODE;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800865
866 if (*idx == (u64)ULLONG_MAX) {
867 mi = mem->cnt - 1;
868 ri = rsv->cnt;
869 }
870
871 for ( ; mi >= 0; mi--) {
872 struct memblock_region *m = &mem->regions[mi];
873 phys_addr_t m_start = m->base;
874 phys_addr_t m_end = m->base + m->size;
875
876 /* only memory regions are associated with nodes, check it */
Grygorii Strashko560dca272014-01-21 15:50:55 -0800877 if (nid != NUMA_NO_NODE && nid != memblock_get_region_node(m))
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800878 continue;
879
Tang Chen55ac5902014-01-21 15:49:35 -0800880 /* skip hotpluggable memory regions if needed */
881 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
882 continue;
883
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800884 /* scan areas before each reservation for intersection */
885 for ( ; ri >= 0; ri--) {
886 struct memblock_region *r = &rsv->regions[ri];
887 phys_addr_t r_start = ri ? r[-1].base + r[-1].size : 0;
888 phys_addr_t r_end = ri < rsv->cnt ? r->base : ULLONG_MAX;
889
890 /* if ri advanced past mi, break out to advance mi */
891 if (r_end <= m_start)
892 break;
893 /* if the two regions intersect, we're done */
894 if (m_end > r_start) {
895 if (out_start)
896 *out_start = max(m_start, r_start);
897 if (out_end)
898 *out_end = min(m_end, r_end);
899 if (out_nid)
900 *out_nid = memblock_get_region_node(m);
901
902 if (m_start >= r_start)
903 mi--;
904 else
905 ri--;
906 *idx = (u32)mi | (u64)ri << 32;
907 return;
908 }
909 }
910 }
911
912 *idx = ULLONG_MAX;
913}
914
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200915#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
916/*
917 * Common iterator interface used to define for_each_mem_range().
918 */
919void __init_memblock __next_mem_pfn_range(int *idx, int nid,
920 unsigned long *out_start_pfn,
921 unsigned long *out_end_pfn, int *out_nid)
922{
923 struct memblock_type *type = &memblock.memory;
924 struct memblock_region *r;
925
926 while (++*idx < type->cnt) {
927 r = &type->regions[*idx];
928
929 if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size))
930 continue;
931 if (nid == MAX_NUMNODES || nid == r->nid)
932 break;
933 }
934 if (*idx >= type->cnt) {
935 *idx = -1;
936 return;
937 }
938
939 if (out_start_pfn)
940 *out_start_pfn = PFN_UP(r->base);
941 if (out_end_pfn)
942 *out_end_pfn = PFN_DOWN(r->base + r->size);
943 if (out_nid)
944 *out_nid = r->nid;
945}
946
947/**
948 * memblock_set_node - set node ID on memblock regions
949 * @base: base of area to set node ID for
950 * @size: size of area to set node ID for
Tang Chene7e8de52014-01-21 15:49:26 -0800951 * @type: memblock type to set node ID for
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200952 * @nid: node ID to set
953 *
Tang Chene7e8de52014-01-21 15:49:26 -0800954 * Set the nid of memblock @type regions in [@base,@base+@size) to @nid.
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200955 * Regions which cross the area boundaries are split as necessary.
956 *
957 * RETURNS:
958 * 0 on success, -errno on failure.
959 */
960int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size,
Tang Chene7e8de52014-01-21 15:49:26 -0800961 struct memblock_type *type, int nid)
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200962{
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800963 int start_rgn, end_rgn;
964 int i, ret;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200965
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800966 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
967 if (ret)
968 return ret;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200969
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800970 for (i = start_rgn; i < end_rgn; i++)
Wanpeng Lie9d24ad2012-10-08 16:32:21 -0700971 memblock_set_region_node(&type->regions[i], nid);
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200972
973 memblock_merge_regions(type);
974 return 0;
975}
976#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
977
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800978static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size,
979 phys_addr_t align, phys_addr_t max_addr,
980 int nid)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000981{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000982 phys_addr_t found;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000983
Grygorii Strashko79f40fa2014-01-21 15:50:12 -0800984 if (!align)
985 align = SMP_CACHE_BYTES;
Vineet Gupta94f3d3a2013-04-29 15:06:15 -0700986
Grygorii Strashko87029ee2014-01-21 15:50:14 -0800987 found = memblock_find_in_range_node(size, align, 0, max_addr, nid);
Tejun Heo9c8c27e2011-12-08 10:22:06 -0800988 if (found && !memblock_reserve(found, size))
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000989 return found;
990
991 return 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000992}
993
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800994phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid)
995{
996 return memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE, nid);
997}
998
999phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
1000{
Grygorii Strashkob1154232014-01-21 15:50:16 -08001001 return memblock_alloc_base_nid(size, align, max_addr, NUMA_NO_NODE);
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001002}
1003
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001004phys_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 +10001005{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001006 phys_addr_t alloc;
1007
1008 alloc = __memblock_alloc_base(size, align, max_addr);
1009
1010 if (alloc == 0)
1011 panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n",
1012 (unsigned long long) size, (unsigned long long) max_addr);
1013
1014 return alloc;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001015}
1016
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001017phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001018{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001019 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001020}
1021
Benjamin Herrenschmidt9d1e2492010-07-06 15:39:17 -07001022phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid)
1023{
1024 phys_addr_t res = memblock_alloc_nid(size, align, nid);
1025
1026 if (res)
1027 return res;
Tejun Heo15fb0972011-07-12 09:58:07 +02001028 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001029}
1030
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001031/**
1032 * memblock_virt_alloc_internal - allocate boot memory block
1033 * @size: size of memory block to be allocated in bytes
1034 * @align: alignment of the region and block's size
1035 * @min_addr: the lower bound of the memory region to allocate (phys address)
1036 * @max_addr: the upper bound of the memory region to allocate (phys address)
1037 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1038 *
1039 * The @min_addr limit is dropped if it can not be satisfied and the allocation
1040 * will fall back to memory below @min_addr. Also, allocation may fall back
1041 * to any node in the system if the specified node can not
1042 * hold the requested memory.
1043 *
1044 * The allocation is performed from memory region limited by
1045 * memblock.current_limit if @max_addr == %BOOTMEM_ALLOC_ACCESSIBLE.
1046 *
1047 * The memory block is aligned on SMP_CACHE_BYTES if @align == 0.
1048 *
1049 * The phys address of allocated boot memory block is converted to virtual and
1050 * allocated memory is reset to 0.
1051 *
1052 * In addition, function sets the min_count to 0 using kmemleak_alloc for
1053 * allocated boot memory block, so that it is never reported as leaks.
1054 *
1055 * RETURNS:
1056 * Virtual address of allocated memory block on success, NULL on failure.
1057 */
1058static void * __init memblock_virt_alloc_internal(
1059 phys_addr_t size, phys_addr_t align,
1060 phys_addr_t min_addr, phys_addr_t max_addr,
1061 int nid)
1062{
1063 phys_addr_t alloc;
1064 void *ptr;
1065
Grygorii Strashko560dca272014-01-21 15:50:55 -08001066 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
1067 nid = NUMA_NO_NODE;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001068
1069 /*
1070 * Detect any accidental use of these APIs after slab is ready, as at
1071 * this moment memblock may be deinitialized already and its
1072 * internal data may be destroyed (after execution of free_all_bootmem)
1073 */
1074 if (WARN_ON_ONCE(slab_is_available()))
1075 return kzalloc_node(size, GFP_NOWAIT, nid);
1076
1077 if (!align)
1078 align = SMP_CACHE_BYTES;
1079
Yinghai Luf544e142014-01-29 14:05:52 -08001080 if (max_addr > memblock.current_limit)
1081 max_addr = memblock.current_limit;
1082
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001083again:
1084 alloc = memblock_find_in_range_node(size, align, min_addr, max_addr,
1085 nid);
1086 if (alloc)
1087 goto done;
1088
1089 if (nid != NUMA_NO_NODE) {
1090 alloc = memblock_find_in_range_node(size, align, min_addr,
1091 max_addr, NUMA_NO_NODE);
1092 if (alloc)
1093 goto done;
1094 }
1095
1096 if (min_addr) {
1097 min_addr = 0;
1098 goto again;
1099 } else {
1100 goto error;
1101 }
1102
1103done:
1104 memblock_reserve(alloc, size);
1105 ptr = phys_to_virt(alloc);
1106 memset(ptr, 0, size);
1107
1108 /*
1109 * The min_count is set to 0 so that bootmem allocated blocks
1110 * are never reported as leaks. This is because many of these blocks
1111 * are only referred via the physical address which is not
1112 * looked up by kmemleak.
1113 */
1114 kmemleak_alloc(ptr, size, 0, 0);
1115
1116 return ptr;
1117
1118error:
1119 return NULL;
1120}
1121
1122/**
1123 * memblock_virt_alloc_try_nid_nopanic - allocate boot memory block
1124 * @size: size of memory block to be allocated in bytes
1125 * @align: alignment of the region and block's size
1126 * @min_addr: the lower bound of the memory region from where the allocation
1127 * is preferred (phys address)
1128 * @max_addr: the upper bound of the memory region from where the allocation
1129 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1130 * allocate only from memory limited by memblock.current_limit value
1131 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1132 *
1133 * Public version of _memblock_virt_alloc_try_nid_nopanic() which provides
1134 * additional debug information (including caller info), if enabled.
1135 *
1136 * RETURNS:
1137 * Virtual address of allocated memory block on success, NULL on failure.
1138 */
1139void * __init memblock_virt_alloc_try_nid_nopanic(
1140 phys_addr_t size, phys_addr_t align,
1141 phys_addr_t min_addr, phys_addr_t max_addr,
1142 int nid)
1143{
1144 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1145 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1146 (u64)max_addr, (void *)_RET_IP_);
1147 return memblock_virt_alloc_internal(size, align, min_addr,
1148 max_addr, nid);
1149}
1150
1151/**
1152 * memblock_virt_alloc_try_nid - allocate boot memory block with panicking
1153 * @size: size of memory block to be allocated in bytes
1154 * @align: alignment of the region and block's size
1155 * @min_addr: the lower bound of the memory region from where the allocation
1156 * is preferred (phys address)
1157 * @max_addr: the upper bound of the memory region from where the allocation
1158 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1159 * allocate only from memory limited by memblock.current_limit value
1160 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1161 *
1162 * Public panicking version of _memblock_virt_alloc_try_nid_nopanic()
1163 * which provides debug information (including caller info), if enabled,
1164 * and panics if the request can not be satisfied.
1165 *
1166 * RETURNS:
1167 * Virtual address of allocated memory block on success, NULL on failure.
1168 */
1169void * __init memblock_virt_alloc_try_nid(
1170 phys_addr_t size, phys_addr_t align,
1171 phys_addr_t min_addr, phys_addr_t max_addr,
1172 int nid)
1173{
1174 void *ptr;
1175
1176 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1177 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1178 (u64)max_addr, (void *)_RET_IP_);
1179 ptr = memblock_virt_alloc_internal(size, align,
1180 min_addr, max_addr, nid);
1181 if (ptr)
1182 return ptr;
1183
1184 panic("%s: Failed to allocate %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx\n",
1185 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1186 (u64)max_addr);
1187 return NULL;
1188}
1189
1190/**
1191 * __memblock_free_early - free boot memory block
1192 * @base: phys starting address of the boot memory block
1193 * @size: size of the boot memory block in bytes
1194 *
1195 * Free boot memory block previously allocated by memblock_virt_alloc_xx() API.
1196 * The freeing memory will not be released to the buddy allocator.
1197 */
1198void __init __memblock_free_early(phys_addr_t base, phys_addr_t size)
1199{
1200 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1201 __func__, (u64)base, (u64)base + size - 1,
1202 (void *)_RET_IP_);
1203 kmemleak_free_part(__va(base), size);
1204 __memblock_remove(&memblock.reserved, base, size);
1205}
1206
1207/*
1208 * __memblock_free_late - free bootmem block pages directly to buddy allocator
1209 * @addr: phys starting address of the boot memory block
1210 * @size: size of the boot memory block in bytes
1211 *
1212 * This is only useful when the bootmem allocator has already been torn
1213 * down, but we are still initializing the system. Pages are released directly
1214 * to the buddy allocator, no bootmem metadata is updated because it is gone.
1215 */
1216void __init __memblock_free_late(phys_addr_t base, phys_addr_t size)
1217{
1218 u64 cursor, end;
1219
1220 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1221 __func__, (u64)base, (u64)base + size - 1,
1222 (void *)_RET_IP_);
1223 kmemleak_free_part(__va(base), size);
1224 cursor = PFN_UP(base);
1225 end = PFN_DOWN(base + size);
1226
1227 for (; cursor < end; cursor++) {
1228 __free_pages_bootmem(pfn_to_page(cursor), 0);
1229 totalram_pages++;
1230 }
1231}
Benjamin Herrenschmidt9d1e2492010-07-06 15:39:17 -07001232
1233/*
1234 * Remaining API functions
1235 */
1236
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +10001237phys_addr_t __init memblock_phys_mem_size(void)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001238{
Tejun Heo1440c4e2011-12-08 10:22:08 -08001239 return memblock.memory.total_size;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001240}
1241
Yinghai Lu595ad9a2013-01-24 12:20:09 -08001242phys_addr_t __init memblock_mem_size(unsigned long limit_pfn)
1243{
1244 unsigned long pages = 0;
1245 struct memblock_region *r;
1246 unsigned long start_pfn, end_pfn;
1247
1248 for_each_memblock(memory, r) {
1249 start_pfn = memblock_region_memory_base_pfn(r);
1250 end_pfn = memblock_region_memory_end_pfn(r);
1251 start_pfn = min_t(unsigned long, start_pfn, limit_pfn);
1252 end_pfn = min_t(unsigned long, end_pfn, limit_pfn);
1253 pages += end_pfn - start_pfn;
1254 }
1255
1256 return (phys_addr_t)pages << PAGE_SHIFT;
1257}
1258
Sam Ravnborg0a93ebe2011-10-31 17:08:16 -07001259/* lowest address */
1260phys_addr_t __init_memblock memblock_start_of_DRAM(void)
1261{
1262 return memblock.memory.regions[0].base;
1263}
1264
Yinghai Lu10d06432010-07-28 15:43:02 +10001265phys_addr_t __init_memblock memblock_end_of_DRAM(void)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001266{
1267 int idx = memblock.memory.cnt - 1;
1268
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +10001269 return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001270}
1271
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001272void __init memblock_enforce_memory_limit(phys_addr_t limit)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001273{
1274 unsigned long i;
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001275 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001276
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001277 if (!limit)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001278 return;
1279
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001280 /* find out max address */
Yinghai Lu95f72d12010-07-12 14:36:09 +10001281 for (i = 0; i < memblock.memory.cnt; i++) {
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001282 struct memblock_region *r = &memblock.memory.regions[i];
Yinghai Lu95f72d12010-07-12 14:36:09 +10001283
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001284 if (limit <= r->size) {
1285 max_addr = r->base + limit;
1286 break;
1287 }
1288 limit -= r->size;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001289 }
1290
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001291 /* truncate both memory and reserved regions */
1292 __memblock_remove(&memblock.memory, max_addr, (phys_addr_t)ULLONG_MAX);
1293 __memblock_remove(&memblock.reserved, max_addr, (phys_addr_t)ULLONG_MAX);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001294}
1295
Yinghai Lucd794812010-10-11 12:34:09 -07001296static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001297{
1298 unsigned int left = 0, right = type->cnt;
1299
1300 do {
1301 unsigned int mid = (right + left) / 2;
1302
1303 if (addr < type->regions[mid].base)
1304 right = mid;
1305 else if (addr >= (type->regions[mid].base +
1306 type->regions[mid].size))
1307 left = mid + 1;
1308 else
1309 return mid;
1310 } while (left < right);
1311 return -1;
1312}
1313
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +10001314int __init memblock_is_reserved(phys_addr_t addr)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001315{
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001316 return memblock_search(&memblock.reserved, addr) != -1;
1317}
Yinghai Lu95f72d12010-07-12 14:36:09 +10001318
Yinghai Lu3661ca62010-09-15 13:05:29 -07001319int __init_memblock memblock_is_memory(phys_addr_t addr)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001320{
1321 return memblock_search(&memblock.memory, addr) != -1;
1322}
1323
Yinghai Lue76b63f2013-09-11 14:22:17 -07001324#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1325int __init_memblock memblock_search_pfn_nid(unsigned long pfn,
1326 unsigned long *start_pfn, unsigned long *end_pfn)
1327{
1328 struct memblock_type *type = &memblock.memory;
1329 int mid = memblock_search(type, (phys_addr_t)pfn << PAGE_SHIFT);
1330
1331 if (mid == -1)
1332 return -1;
1333
1334 *start_pfn = type->regions[mid].base >> PAGE_SHIFT;
1335 *end_pfn = (type->regions[mid].base + type->regions[mid].size)
1336 >> PAGE_SHIFT;
1337
1338 return type->regions[mid].nid;
1339}
1340#endif
1341
Stephen Boydeab30942012-05-24 00:45:21 -07001342/**
1343 * memblock_is_region_memory - check if a region is a subset of memory
1344 * @base: base of region to check
1345 * @size: size of region to check
1346 *
1347 * Check if the region [@base, @base+@size) is a subset of a memory block.
1348 *
1349 * RETURNS:
1350 * 0 if false, non-zero if true
1351 */
Yinghai Lu3661ca62010-09-15 13:05:29 -07001352int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001353{
Tomi Valkeinenabb65272011-01-20 14:44:20 -08001354 int idx = memblock_search(&memblock.memory, base);
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001355 phys_addr_t end = base + memblock_cap_size(base, &size);
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001356
1357 if (idx == -1)
1358 return 0;
Tomi Valkeinenabb65272011-01-20 14:44:20 -08001359 return memblock.memory.regions[idx].base <= base &&
1360 (memblock.memory.regions[idx].base +
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001361 memblock.memory.regions[idx].size) >= end;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001362}
1363
Stephen Boydeab30942012-05-24 00:45:21 -07001364/**
1365 * memblock_is_region_reserved - check if a region intersects reserved memory
1366 * @base: base of region to check
1367 * @size: size of region to check
1368 *
1369 * Check if the region [@base, @base+@size) intersects a reserved memory block.
1370 *
1371 * RETURNS:
1372 * 0 if false, non-zero if true
1373 */
Yinghai Lu10d06432010-07-28 15:43:02 +10001374int __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001375{
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001376 memblock_cap_size(base, &size);
Benjamin Herrenschmidtf1c2c192010-08-04 14:17:17 +10001377 return memblock_overlaps_region(&memblock.reserved, base, size) >= 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001378}
1379
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001380void __init_memblock memblock_trim_memory(phys_addr_t align)
1381{
1382 int i;
1383 phys_addr_t start, end, orig_start, orig_end;
1384 struct memblock_type *mem = &memblock.memory;
1385
1386 for (i = 0; i < mem->cnt; i++) {
1387 orig_start = mem->regions[i].base;
1388 orig_end = mem->regions[i].base + mem->regions[i].size;
1389 start = round_up(orig_start, align);
1390 end = round_down(orig_end, align);
1391
1392 if (start == orig_start && end == orig_end)
1393 continue;
1394
1395 if (start < end) {
1396 mem->regions[i].base = start;
1397 mem->regions[i].size = end - start;
1398 } else {
1399 memblock_remove_region(mem, i);
1400 i--;
1401 }
1402 }
1403}
Benjamin Herrenschmidte63075a2010-07-06 15:39:01 -07001404
Yinghai Lu3661ca62010-09-15 13:05:29 -07001405void __init_memblock memblock_set_current_limit(phys_addr_t limit)
Benjamin Herrenschmidte63075a2010-07-06 15:39:01 -07001406{
1407 memblock.current_limit = limit;
1408}
1409
Laura Abbottfec51012014-02-27 01:23:43 +01001410phys_addr_t __init_memblock memblock_get_current_limit(void)
1411{
1412 return memblock.current_limit;
1413}
1414
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001415static void __init_memblock memblock_dump(struct memblock_type *type, char *name)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001416{
1417 unsigned long long base, size;
Tang Chen66a20752014-01-21 15:49:20 -08001418 unsigned long flags;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001419 int i;
1420
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001421 pr_info(" %s.cnt = 0x%lx\n", name, type->cnt);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001422
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001423 for (i = 0; i < type->cnt; i++) {
1424 struct memblock_region *rgn = &type->regions[i];
1425 char nid_buf[32] = "";
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001426
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001427 base = rgn->base;
1428 size = rgn->size;
Tang Chen66a20752014-01-21 15:49:20 -08001429 flags = rgn->flags;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001430#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1431 if (memblock_get_region_node(rgn) != MAX_NUMNODES)
1432 snprintf(nid_buf, sizeof(nid_buf), " on node %d",
1433 memblock_get_region_node(rgn));
1434#endif
Tang Chen66a20752014-01-21 15:49:20 -08001435 pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s flags: %#lx\n",
1436 name, i, base, base + size - 1, size, nid_buf, flags);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001437 }
1438}
1439
Tejun Heo4ff7b822011-12-08 10:22:06 -08001440void __init_memblock __memblock_dump_all(void)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001441{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001442 pr_info("MEMBLOCK configuration:\n");
Tejun Heo1440c4e2011-12-08 10:22:08 -08001443 pr_info(" memory size = %#llx reserved size = %#llx\n",
1444 (unsigned long long)memblock.memory.total_size,
1445 (unsigned long long)memblock.reserved.total_size);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001446
1447 memblock_dump(&memblock.memory, "memory");
1448 memblock_dump(&memblock.reserved, "reserved");
1449}
1450
Tejun Heo1aadc052011-12-08 10:22:08 -08001451void __init memblock_allow_resize(void)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001452{
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -07001453 memblock_can_resize = 1;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001454}
1455
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001456static int __init early_memblock(char *p)
1457{
1458 if (p && strstr(p, "debug"))
1459 memblock_debug = 1;
1460 return 0;
1461}
1462early_param("memblock", early_memblock);
1463
Tejun Heoc378ddd2011-07-14 11:46:03 +02001464#if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001465
1466static int memblock_debug_show(struct seq_file *m, void *private)
1467{
1468 struct memblock_type *type = m->private;
1469 struct memblock_region *reg;
1470 int i;
1471
1472 for (i = 0; i < type->cnt; i++) {
1473 reg = &type->regions[i];
1474 seq_printf(m, "%4d: ", i);
1475 if (sizeof(phys_addr_t) == 4)
1476 seq_printf(m, "0x%08lx..0x%08lx\n",
1477 (unsigned long)reg->base,
1478 (unsigned long)(reg->base + reg->size - 1));
1479 else
1480 seq_printf(m, "0x%016llx..0x%016llx\n",
1481 (unsigned long long)reg->base,
1482 (unsigned long long)(reg->base + reg->size - 1));
1483
1484 }
1485 return 0;
1486}
1487
1488static int memblock_debug_open(struct inode *inode, struct file *file)
1489{
1490 return single_open(file, memblock_debug_show, inode->i_private);
1491}
1492
1493static const struct file_operations memblock_debug_fops = {
1494 .open = memblock_debug_open,
1495 .read = seq_read,
1496 .llseek = seq_lseek,
1497 .release = single_release,
1498};
1499
1500static int __init memblock_init_debugfs(void)
1501{
1502 struct dentry *root = debugfs_create_dir("memblock", NULL);
1503 if (!root)
1504 return -ENXIO;
1505 debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops);
1506 debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops);
1507
1508 return 0;
1509}
1510__initcall(memblock_init_debugfs);
1511
1512#endif /* CONFIG_DEBUG_FS */