blob: 6d2f219a48b01d371c1eb763f611d29a346890d9 [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
Tejun Heo1aadc052011-12-08 10:22:08 -080057static int memblock_can_resize __initdata_memblock;
Gavin Shan181eb392012-05-29 15:06:50 -070058static int memblock_memory_in_slab __initdata_memblock = 0;
59static int memblock_reserved_in_slab __initdata_memblock = 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +100060
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -070061/* inline so we don't get a warning when pr_debug is compiled out */
Raghavendra D Prabhuc2233112012-10-08 16:33:55 -070062static __init_memblock const char *
63memblock_type_name(struct memblock_type *type)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -070064{
65 if (type == &memblock.memory)
66 return "memory";
67 else if (type == &memblock.reserved)
68 return "reserved";
69 else
70 return "unknown";
71}
72
Tejun Heoeb18f1b2011-12-08 10:22:07 -080073/* adjust *@size so that (@base + *@size) doesn't overflow, return new size */
74static inline phys_addr_t memblock_cap_size(phys_addr_t base, phys_addr_t *size)
75{
76 return *size = min(*size, (phys_addr_t)ULLONG_MAX - base);
77}
78
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100079/*
80 * Address comparison utilities
81 */
Yinghai Lu10d06432010-07-28 15:43:02 +100082static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1,
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +100083 phys_addr_t base2, phys_addr_t size2)
Yinghai Lu95f72d12010-07-12 14:36:09 +100084{
85 return ((base1 < (base2 + size2)) && (base2 < (base1 + size1)));
86}
87
H Hartley Sweeten2d7d3eb2011-10-31 17:09:15 -070088static long __init_memblock memblock_overlaps_region(struct memblock_type *type,
89 phys_addr_t base, phys_addr_t size)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100090{
91 unsigned long i;
92
93 for (i = 0; i < type->cnt; i++) {
94 phys_addr_t rgnbase = type->regions[i].base;
95 phys_addr_t rgnsize = type->regions[i].size;
96 if (memblock_addrs_overlap(base, size, rgnbase, rgnsize))
97 break;
98 }
99
100 return (i < type->cnt) ? i : -1;
101}
102
Tang Chen79442ed2013-11-12 15:07:59 -0800103/*
104 * __memblock_find_range_bottom_up - find free area utility in bottom-up
105 * @start: start of candidate range
106 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
107 * @size: size of free area to find
108 * @align: alignment of free area to find
Grygorii Strashkob1154232014-01-21 15:50:16 -0800109 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Tang Chen79442ed2013-11-12 15:07:59 -0800110 *
111 * Utility called from memblock_find_in_range_node(), find free area bottom-up.
112 *
113 * RETURNS:
114 * Found address on success, 0 on failure.
115 */
116static phys_addr_t __init_memblock
117__memblock_find_range_bottom_up(phys_addr_t start, phys_addr_t end,
118 phys_addr_t size, phys_addr_t align, int nid)
119{
120 phys_addr_t this_start, this_end, cand;
121 u64 i;
122
123 for_each_free_mem_range(i, nid, &this_start, &this_end, NULL) {
124 this_start = clamp(this_start, start, end);
125 this_end = clamp(this_end, start, end);
126
127 cand = round_up(this_start, align);
128 if (cand < this_end && this_end - cand >= size)
129 return cand;
130 }
131
132 return 0;
133}
134
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800135/**
Tang Chen14028992013-11-12 15:07:57 -0800136 * __memblock_find_range_top_down - find free area utility, in top-down
137 * @start: start of candidate range
138 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
139 * @size: size of free area to find
140 * @align: alignment of free area to find
Grygorii Strashkob1154232014-01-21 15:50:16 -0800141 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Tang Chen14028992013-11-12 15:07:57 -0800142 *
143 * Utility called from memblock_find_in_range_node(), find free area top-down.
144 *
145 * RETURNS:
Tang Chen79442ed2013-11-12 15:07:59 -0800146 * Found address on success, 0 on failure.
Tang Chen14028992013-11-12 15:07:57 -0800147 */
148static phys_addr_t __init_memblock
149__memblock_find_range_top_down(phys_addr_t start, phys_addr_t end,
150 phys_addr_t size, phys_addr_t align, int nid)
151{
152 phys_addr_t this_start, this_end, cand;
153 u64 i;
154
155 for_each_free_mem_range_reverse(i, nid, &this_start, &this_end, NULL) {
156 this_start = clamp(this_start, start, end);
157 this_end = clamp(this_end, start, end);
158
159 if (this_end < size)
160 continue;
161
162 cand = round_down(this_end - size, align);
163 if (cand >= this_start)
164 return cand;
165 }
166
167 return 0;
168}
169
170/**
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800171 * memblock_find_in_range_node - find free area in given range and node
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800172 * @size: size of free area to find
173 * @align: alignment of free area to find
Grygorii Strashko87029ee2014-01-21 15:50:14 -0800174 * @start: start of candidate range
175 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
Grygorii Strashkob1154232014-01-21 15:50:16 -0800176 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800177 *
178 * Find @size free area aligned to @align in the specified range and node.
179 *
Tang Chen79442ed2013-11-12 15:07:59 -0800180 * When allocation direction is bottom-up, the @start should be greater
181 * than the end of the kernel image. Otherwise, it will be trimmed. The
182 * reason is that we want the bottom-up allocation just near the kernel
183 * image so it is highly likely that the allocated memory and the kernel
184 * will reside in the same node.
185 *
186 * If bottom-up allocation failed, will try to allocate memory top-down.
187 *
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800188 * RETURNS:
Tang Chen79442ed2013-11-12 15:07:59 -0800189 * Found address on success, 0 on failure.
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000190 */
Grygorii Strashko87029ee2014-01-21 15:50:14 -0800191phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t size,
192 phys_addr_t align, phys_addr_t start,
193 phys_addr_t end, int nid)
Tang Chenf7210e62013-02-22 16:33:51 -0800194{
Tang Chen79442ed2013-11-12 15:07:59 -0800195 int ret;
196 phys_addr_t kernel_end;
197
Tang Chenf7210e62013-02-22 16:33:51 -0800198 /* pump up @end */
199 if (end == MEMBLOCK_ALLOC_ACCESSIBLE)
200 end = memblock.current_limit;
201
202 /* avoid allocating the first page */
203 start = max_t(phys_addr_t, start, PAGE_SIZE);
204 end = max(start, end);
Tang Chen79442ed2013-11-12 15:07:59 -0800205 kernel_end = __pa_symbol(_end);
206
207 /*
208 * try bottom-up allocation only when bottom-up mode
209 * is set and @end is above the kernel image.
210 */
211 if (memblock_bottom_up() && end > kernel_end) {
212 phys_addr_t bottom_up_start;
213
214 /* make sure we will allocate above the kernel */
215 bottom_up_start = max(start, kernel_end);
216
217 /* ok, try bottom-up allocation first */
218 ret = __memblock_find_range_bottom_up(bottom_up_start, end,
219 size, align, nid);
220 if (ret)
221 return ret;
222
223 /*
224 * we always limit bottom-up allocation above the kernel,
225 * but top-down allocation doesn't have the limit, so
226 * retrying top-down allocation may succeed when bottom-up
227 * allocation failed.
228 *
229 * bottom-up allocation is expected to be fail very rarely,
230 * so we use WARN_ONCE() here to see the stack trace if
231 * fail happens.
232 */
233 WARN_ONCE(1, "memblock: bottom-up allocation failed, "
234 "memory hotunplug may be affected\n");
235 }
Tang Chenf7210e62013-02-22 16:33:51 -0800236
Tang Chen14028992013-11-12 15:07:57 -0800237 return __memblock_find_range_top_down(start, end, size, align, nid);
Tang Chenf7210e62013-02-22 16:33:51 -0800238}
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000239
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800240/**
241 * memblock_find_in_range - find free area in given range
242 * @start: start of candidate range
243 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
244 * @size: size of free area to find
245 * @align: alignment of free area to find
246 *
247 * Find @size free area aligned to @align in the specified range.
248 *
249 * RETURNS:
Tang Chen79442ed2013-11-12 15:07:59 -0800250 * Found address on success, 0 on failure.
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800251 */
252phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start,
253 phys_addr_t end, phys_addr_t size,
254 phys_addr_t align)
255{
Grygorii Strashko87029ee2014-01-21 15:50:14 -0800256 return memblock_find_in_range_node(size, align, start, end,
Grygorii Strashkob1154232014-01-21 15:50:16 -0800257 NUMA_NO_NODE);
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800258}
259
Yinghai Lu10d06432010-07-28 15:43:02 +1000260static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000261{
Tejun Heo1440c4e2011-12-08 10:22:08 -0800262 type->total_size -= type->regions[r].size;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200263 memmove(&type->regions[r], &type->regions[r + 1],
264 (type->cnt - (r + 1)) * sizeof(type->regions[r]));
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000265 type->cnt--;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000266
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700267 /* Special case for empty arrays */
268 if (type->cnt == 0) {
Tejun Heo1440c4e2011-12-08 10:22:08 -0800269 WARN_ON(type->total_size != 0);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700270 type->cnt = 1;
271 type->regions[0].base = 0;
272 type->regions[0].size = 0;
Tang Chen66a20752014-01-21 15:49:20 -0800273 type->regions[0].flags = 0;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200274 memblock_set_region_node(&type->regions[0], MAX_NUMNODES);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700275 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000276}
277
Philipp Hachtmann354f17e2014-01-23 15:53:24 -0800278#ifdef CONFIG_ARCH_DISCARD_MEMBLOCK
279
Yinghai Lu29f67382012-07-11 14:02:56 -0700280phys_addr_t __init_memblock get_allocated_memblock_reserved_regions_info(
281 phys_addr_t *addr)
282{
283 if (memblock.reserved.regions == memblock_reserved_init_regions)
284 return 0;
285
286 *addr = __pa(memblock.reserved.regions);
287
288 return PAGE_ALIGN(sizeof(struct memblock_region) *
289 memblock.reserved.max);
290}
291
Philipp Hachtmann5e270e22014-01-23 15:53:11 -0800292phys_addr_t __init_memblock get_allocated_memblock_memory_regions_info(
293 phys_addr_t *addr)
294{
295 if (memblock.memory.regions == memblock_memory_init_regions)
296 return 0;
297
298 *addr = __pa(memblock.memory.regions);
299
300 return PAGE_ALIGN(sizeof(struct memblock_region) *
301 memblock.memory.max);
302}
303
304#endif
305
Greg Pearson48c3b582012-06-20 12:53:05 -0700306/**
307 * memblock_double_array - double the size of the memblock regions array
308 * @type: memblock type of the regions array being doubled
309 * @new_area_start: starting address of memory range to avoid overlap with
310 * @new_area_size: size of memory range to avoid overlap with
311 *
312 * Double the size of the @type regions array. If memblock is being used to
313 * allocate memory for a new reserved regions array and there is a previously
314 * allocated memory range [@new_area_start,@new_area_start+@new_area_size]
315 * waiting to be reserved, ensure the memory used by the new array does
316 * not overlap.
317 *
318 * RETURNS:
319 * 0 on success, -1 on failure.
320 */
321static int __init_memblock memblock_double_array(struct memblock_type *type,
322 phys_addr_t new_area_start,
323 phys_addr_t new_area_size)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700324{
325 struct memblock_region *new_array, *old_array;
Yinghai Lu29f67382012-07-11 14:02:56 -0700326 phys_addr_t old_alloc_size, new_alloc_size;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700327 phys_addr_t old_size, new_size, addr;
328 int use_slab = slab_is_available();
Gavin Shan181eb392012-05-29 15:06:50 -0700329 int *in_slab;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700330
331 /* We don't allow resizing until we know about the reserved regions
332 * of memory that aren't suitable for allocation
333 */
334 if (!memblock_can_resize)
335 return -1;
336
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700337 /* Calculate new doubled size */
338 old_size = type->max * sizeof(struct memblock_region);
339 new_size = old_size << 1;
Yinghai Lu29f67382012-07-11 14:02:56 -0700340 /*
341 * We need to allocated new one align to PAGE_SIZE,
342 * so we can free them completely later.
343 */
344 old_alloc_size = PAGE_ALIGN(old_size);
345 new_alloc_size = PAGE_ALIGN(new_size);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700346
Gavin Shan181eb392012-05-29 15:06:50 -0700347 /* Retrieve the slab flag */
348 if (type == &memblock.memory)
349 in_slab = &memblock_memory_in_slab;
350 else
351 in_slab = &memblock_reserved_in_slab;
352
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700353 /* Try to find some space for it.
354 *
355 * WARNING: We assume that either slab_is_available() and we use it or
Andrew Mortonfd073832012-07-31 16:42:40 -0700356 * we use MEMBLOCK for allocations. That means that this is unsafe to
357 * use when bootmem is currently active (unless bootmem itself is
358 * implemented on top of MEMBLOCK which isn't the case yet)
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700359 *
360 * This should however not be an issue for now, as we currently only
Andrew Mortonfd073832012-07-31 16:42:40 -0700361 * call into MEMBLOCK while it's still active, or much later when slab
362 * is active for memory hotplug operations
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700363 */
364 if (use_slab) {
365 new_array = kmalloc(new_size, GFP_KERNEL);
Tejun Heo1f5026a2011-07-12 09:58:09 +0200366 addr = new_array ? __pa(new_array) : 0;
Gavin Shan4e2f0772012-05-29 15:06:50 -0700367 } else {
Greg Pearson48c3b582012-06-20 12:53:05 -0700368 /* only exclude range when trying to double reserved.regions */
369 if (type != &memblock.reserved)
370 new_area_start = new_area_size = 0;
371
372 addr = memblock_find_in_range(new_area_start + new_area_size,
373 memblock.current_limit,
Yinghai Lu29f67382012-07-11 14:02:56 -0700374 new_alloc_size, PAGE_SIZE);
Greg Pearson48c3b582012-06-20 12:53:05 -0700375 if (!addr && new_area_size)
376 addr = memblock_find_in_range(0,
Andrew Mortonfd073832012-07-31 16:42:40 -0700377 min(new_area_start, memblock.current_limit),
378 new_alloc_size, PAGE_SIZE);
Greg Pearson48c3b582012-06-20 12:53:05 -0700379
Sachin Kamat15674862012-09-04 13:55:05 +0530380 new_array = addr ? __va(addr) : NULL;
Gavin Shan4e2f0772012-05-29 15:06:50 -0700381 }
Tejun Heo1f5026a2011-07-12 09:58:09 +0200382 if (!addr) {
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700383 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
384 memblock_type_name(type), type->max, type->max * 2);
385 return -1;
386 }
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700387
Andrew Mortonfd073832012-07-31 16:42:40 -0700388 memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]",
389 memblock_type_name(type), type->max * 2, (u64)addr,
390 (u64)addr + new_size - 1);
Yinghai Luea9e4372010-07-28 15:13:22 +1000391
Andrew Mortonfd073832012-07-31 16:42:40 -0700392 /*
393 * Found space, we now need to move the array over before we add the
394 * reserved region since it may be our reserved array itself that is
395 * full.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700396 */
397 memcpy(new_array, type->regions, old_size);
398 memset(new_array + type->max, 0, old_size);
399 old_array = type->regions;
400 type->regions = new_array;
401 type->max <<= 1;
402
Andrew Mortonfd073832012-07-31 16:42:40 -0700403 /* Free old array. We needn't free it if the array is the static one */
Gavin Shan181eb392012-05-29 15:06:50 -0700404 if (*in_slab)
405 kfree(old_array);
406 else if (old_array != memblock_memory_init_regions &&
407 old_array != memblock_reserved_init_regions)
Yinghai Lu29f67382012-07-11 14:02:56 -0700408 memblock_free(__pa(old_array), old_alloc_size);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700409
Andrew Mortonfd073832012-07-31 16:42:40 -0700410 /*
411 * Reserve the new array if that comes from the memblock. Otherwise, we
412 * needn't do it
Gavin Shan181eb392012-05-29 15:06:50 -0700413 */
414 if (!use_slab)
Yinghai Lu29f67382012-07-11 14:02:56 -0700415 BUG_ON(memblock_reserve(addr, new_alloc_size));
Gavin Shan181eb392012-05-29 15:06:50 -0700416
417 /* Update slab flag */
418 *in_slab = use_slab;
419
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700420 return 0;
421}
422
Tejun Heo784656f92011-07-12 11:15:55 +0200423/**
424 * memblock_merge_regions - merge neighboring compatible regions
425 * @type: memblock type to scan
426 *
427 * Scan @type and merge neighboring compatible regions.
428 */
429static void __init_memblock memblock_merge_regions(struct memblock_type *type)
430{
431 int i = 0;
432
433 /* cnt never goes below 1 */
434 while (i < type->cnt - 1) {
435 struct memblock_region *this = &type->regions[i];
436 struct memblock_region *next = &type->regions[i + 1];
437
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200438 if (this->base + this->size != next->base ||
439 memblock_get_region_node(this) !=
Tang Chen66a20752014-01-21 15:49:20 -0800440 memblock_get_region_node(next) ||
441 this->flags != next->flags) {
Tejun Heo784656f92011-07-12 11:15:55 +0200442 BUG_ON(this->base + this->size > next->base);
443 i++;
444 continue;
445 }
446
447 this->size += next->size;
Lin Fengc0232ae2013-01-11 14:31:44 -0800448 /* move forward from next + 1, index of which is i + 2 */
449 memmove(next, next + 1, (type->cnt - (i + 2)) * sizeof(*next));
Tejun Heo784656f92011-07-12 11:15:55 +0200450 type->cnt--;
451 }
452}
453
454/**
455 * memblock_insert_region - insert new memblock region
Tang Chen209ff862013-04-29 15:08:41 -0700456 * @type: memblock type to insert into
457 * @idx: index for the insertion point
458 * @base: base address of the new region
459 * @size: size of the new region
460 * @nid: node id of the new region
Tang Chen66a20752014-01-21 15:49:20 -0800461 * @flags: flags of the new region
Tejun Heo784656f92011-07-12 11:15:55 +0200462 *
463 * Insert new memblock region [@base,@base+@size) into @type at @idx.
464 * @type must already have extra room to accomodate the new region.
465 */
466static void __init_memblock memblock_insert_region(struct memblock_type *type,
467 int idx, phys_addr_t base,
Tang Chen66a20752014-01-21 15:49:20 -0800468 phys_addr_t size,
469 int nid, unsigned long flags)
Tejun Heo784656f92011-07-12 11:15:55 +0200470{
471 struct memblock_region *rgn = &type->regions[idx];
472
473 BUG_ON(type->cnt >= type->max);
474 memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn));
475 rgn->base = base;
476 rgn->size = size;
Tang Chen66a20752014-01-21 15:49:20 -0800477 rgn->flags = flags;
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200478 memblock_set_region_node(rgn, nid);
Tejun Heo784656f92011-07-12 11:15:55 +0200479 type->cnt++;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800480 type->total_size += size;
Tejun Heo784656f92011-07-12 11:15:55 +0200481}
482
483/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100484 * memblock_add_range - add new memblock region
Tejun Heo784656f92011-07-12 11:15:55 +0200485 * @type: memblock type to add new region into
486 * @base: base address of the new region
487 * @size: size of the new region
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800488 * @nid: nid of the new region
Tang Chen66a20752014-01-21 15:49:20 -0800489 * @flags: flags of the new region
Tejun Heo784656f92011-07-12 11:15:55 +0200490 *
491 * Add new memblock region [@base,@base+@size) into @type. The new region
492 * is allowed to overlap with existing ones - overlaps don't affect already
493 * existing regions. @type is guaranteed to be minimal (all neighbouring
494 * compatible regions are merged) after the addition.
495 *
496 * RETURNS:
497 * 0 on success, -errno on failure.
498 */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100499int __init_memblock memblock_add_range(struct memblock_type *type,
Tang Chen66a20752014-01-21 15:49:20 -0800500 phys_addr_t base, phys_addr_t size,
501 int nid, unsigned long flags)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000502{
Tejun Heo784656f92011-07-12 11:15:55 +0200503 bool insert = false;
Tejun Heoeb18f1b2011-12-08 10:22:07 -0800504 phys_addr_t obase = base;
505 phys_addr_t end = base + memblock_cap_size(base, &size);
Tejun Heo784656f92011-07-12 11:15:55 +0200506 int i, nr_new;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000507
Tejun Heob3dc6272012-04-20 08:31:34 -0700508 if (!size)
509 return 0;
510
Tejun Heo784656f92011-07-12 11:15:55 +0200511 /* special case for empty array */
512 if (type->regions[0].size == 0) {
Tejun Heo1440c4e2011-12-08 10:22:08 -0800513 WARN_ON(type->cnt != 1 || type->total_size);
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000514 type->regions[0].base = base;
515 type->regions[0].size = size;
Tang Chen66a20752014-01-21 15:49:20 -0800516 type->regions[0].flags = flags;
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800517 memblock_set_region_node(&type->regions[0], nid);
Tejun Heo1440c4e2011-12-08 10:22:08 -0800518 type->total_size = size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000519 return 0;
520 }
Tejun Heo784656f92011-07-12 11:15:55 +0200521repeat:
522 /*
523 * The following is executed twice. Once with %false @insert and
524 * then with %true. The first counts the number of regions needed
525 * to accomodate the new area. The second actually inserts them.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700526 */
Tejun Heo784656f92011-07-12 11:15:55 +0200527 base = obase;
528 nr_new = 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000529
Tejun Heo784656f92011-07-12 11:15:55 +0200530 for (i = 0; i < type->cnt; i++) {
531 struct memblock_region *rgn = &type->regions[i];
532 phys_addr_t rbase = rgn->base;
533 phys_addr_t rend = rbase + rgn->size;
534
535 if (rbase >= end)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000536 break;
Tejun Heo784656f92011-07-12 11:15:55 +0200537 if (rend <= base)
538 continue;
539 /*
540 * @rgn overlaps. If it separates the lower part of new
541 * area, insert that portion.
542 */
543 if (rbase > base) {
544 nr_new++;
545 if (insert)
546 memblock_insert_region(type, i++, base,
Tang Chen66a20752014-01-21 15:49:20 -0800547 rbase - base, nid,
548 flags);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000549 }
Tejun Heo784656f92011-07-12 11:15:55 +0200550 /* area below @rend is dealt with, forget about it */
551 base = min(rend, end);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000552 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000553
Tejun Heo784656f92011-07-12 11:15:55 +0200554 /* insert the remaining portion */
555 if (base < end) {
556 nr_new++;
557 if (insert)
Tang Chen66a20752014-01-21 15:49:20 -0800558 memblock_insert_region(type, i, base, end - base,
559 nid, flags);
Tejun Heo784656f92011-07-12 11:15:55 +0200560 }
561
562 /*
563 * If this was the first round, resize array and repeat for actual
564 * insertions; otherwise, merge and return.
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700565 */
Tejun Heo784656f92011-07-12 11:15:55 +0200566 if (!insert) {
567 while (type->cnt + nr_new > type->max)
Greg Pearson48c3b582012-06-20 12:53:05 -0700568 if (memblock_double_array(type, obase, size) < 0)
Tejun Heo784656f92011-07-12 11:15:55 +0200569 return -ENOMEM;
570 insert = true;
571 goto repeat;
572 } else {
573 memblock_merge_regions(type);
574 return 0;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700575 }
Yinghai Lu95f72d12010-07-12 14:36:09 +1000576}
577
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800578int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size,
579 int nid)
580{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100581 return memblock_add_range(&memblock.memory, base, size, nid, 0);
Tejun Heo7fb0bc32011-12-08 10:22:08 -0800582}
583
Tejun Heo581adcb2011-12-08 10:22:06 -0800584int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000585{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100586 return memblock_add_range(&memblock.memory, base, size,
Tang Chen66a20752014-01-21 15:49:20 -0800587 MAX_NUMNODES, 0);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000588}
589
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800590/**
591 * memblock_isolate_range - isolate given range into disjoint memblocks
592 * @type: memblock type to isolate range for
593 * @base: base of range to isolate
594 * @size: size of range to isolate
595 * @start_rgn: out parameter for the start of isolated region
596 * @end_rgn: out parameter for the end of isolated region
597 *
598 * Walk @type and ensure that regions don't cross the boundaries defined by
599 * [@base,@base+@size). Crossing regions are split at the boundaries,
600 * which may create at most two more regions. The index of the first
601 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
602 *
603 * RETURNS:
604 * 0 on success, -errno on failure.
605 */
606static int __init_memblock memblock_isolate_range(struct memblock_type *type,
607 phys_addr_t base, phys_addr_t size,
608 int *start_rgn, int *end_rgn)
609{
Tejun Heoeb18f1b2011-12-08 10:22:07 -0800610 phys_addr_t end = base + memblock_cap_size(base, &size);
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800611 int i;
612
613 *start_rgn = *end_rgn = 0;
614
Tejun Heob3dc6272012-04-20 08:31:34 -0700615 if (!size)
616 return 0;
617
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800618 /* we'll create at most two more regions */
619 while (type->cnt + 2 > type->max)
Greg Pearson48c3b582012-06-20 12:53:05 -0700620 if (memblock_double_array(type, base, size) < 0)
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800621 return -ENOMEM;
622
623 for (i = 0; i < type->cnt; i++) {
624 struct memblock_region *rgn = &type->regions[i];
625 phys_addr_t rbase = rgn->base;
626 phys_addr_t rend = rbase + rgn->size;
627
628 if (rbase >= end)
629 break;
630 if (rend <= base)
631 continue;
632
633 if (rbase < base) {
634 /*
635 * @rgn intersects from below. Split and continue
636 * to process the next region - the new top half.
637 */
638 rgn->base = base;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800639 rgn->size -= base - rbase;
640 type->total_size -= base - rbase;
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800641 memblock_insert_region(type, i, rbase, base - rbase,
Tang Chen66a20752014-01-21 15:49:20 -0800642 memblock_get_region_node(rgn),
643 rgn->flags);
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800644 } else if (rend > end) {
645 /*
646 * @rgn intersects from above. Split and redo the
647 * current region - the new bottom half.
648 */
649 rgn->base = end;
Tejun Heo1440c4e2011-12-08 10:22:08 -0800650 rgn->size -= end - rbase;
651 type->total_size -= end - rbase;
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800652 memblock_insert_region(type, i--, rbase, end - rbase,
Tang Chen66a20752014-01-21 15:49:20 -0800653 memblock_get_region_node(rgn),
654 rgn->flags);
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800655 } else {
656 /* @rgn is fully contained, record it */
657 if (!*end_rgn)
658 *start_rgn = i;
659 *end_rgn = i + 1;
660 }
661 }
662
663 return 0;
664}
Tejun Heo6a9ceb32011-12-08 10:22:07 -0800665
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100666int __init_memblock memblock_remove_range(struct memblock_type *type,
667 phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000668{
Tejun Heo71936182011-12-08 10:22:07 -0800669 int start_rgn, end_rgn;
670 int i, ret;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000671
Tejun Heo71936182011-12-08 10:22:07 -0800672 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
673 if (ret)
674 return ret;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000675
Tejun Heo71936182011-12-08 10:22:07 -0800676 for (i = end_rgn - 1; i >= start_rgn; i--)
677 memblock_remove_region(type, i);
Benjamin Herrenschmidt8f7a6602011-03-22 16:33:43 -0700678 return 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000679}
680
Tejun Heo581adcb2011-12-08 10:22:06 -0800681int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000682{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100683 return memblock_remove_range(&memblock.memory, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000684}
685
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100686
Tejun Heo581adcb2011-12-08 10:22:06 -0800687int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000688{
Tejun Heo24aa0782011-07-12 11:16:06 +0200689 memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n",
H. Peter Anvina1504392011-07-14 11:57:10 -0700690 (unsigned long long)base,
Grygorii Strashko931d13f2014-01-21 15:49:17 -0800691 (unsigned long long)base + size - 1,
H. Peter Anvina1504392011-07-14 11:57:10 -0700692 (void *)_RET_IP_);
Tejun Heo24aa0782011-07-12 11:16:06 +0200693
Catalin Marinasaedf95e2014-06-06 14:38:20 -0700694 kmemleak_free_part(__va(base), size);
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100695 return memblock_remove_range(&memblock.reserved, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000696}
697
Tang Chen66a20752014-01-21 15:49:20 -0800698static int __init_memblock memblock_reserve_region(phys_addr_t base,
699 phys_addr_t size,
700 int nid,
701 unsigned long flags)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000702{
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000703 struct memblock_type *_rgn = &memblock.reserved;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000704
Tang Chen66a20752014-01-21 15:49:20 -0800705 memblock_dbg("memblock_reserve: [%#016llx-%#016llx] flags %#02lx %pF\n",
H. Peter Anvina1504392011-07-14 11:57:10 -0700706 (unsigned long long)base,
Grygorii Strashko931d13f2014-01-21 15:49:17 -0800707 (unsigned long long)base + size - 1,
Tang Chen66a20752014-01-21 15:49:20 -0800708 flags, (void *)_RET_IP_);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000709
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100710 return memblock_add_range(_rgn, base, size, nid, flags);
Tang Chen66a20752014-01-21 15:49:20 -0800711}
712
713int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size)
714{
715 return memblock_reserve_region(base, size, MAX_NUMNODES, 0);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000716}
717
Tejun Heo35fd0802011-07-12 11:15:59 +0200718/**
Tang Chen66b16ed2014-01-21 15:49:23 -0800719 * memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG.
720 * @base: the base phys addr of the region
721 * @size: the size of the region
722 *
723 * This function isolates region [@base, @base + @size), and mark it with flag
724 * MEMBLOCK_HOTPLUG.
725 *
726 * Return 0 on succees, -errno on failure.
727 */
728int __init_memblock memblock_mark_hotplug(phys_addr_t base, phys_addr_t size)
729{
730 struct memblock_type *type = &memblock.memory;
731 int i, ret, start_rgn, end_rgn;
732
733 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
734 if (ret)
735 return ret;
736
737 for (i = start_rgn; i < end_rgn; i++)
738 memblock_set_region_flags(&type->regions[i], MEMBLOCK_HOTPLUG);
739
740 memblock_merge_regions(type);
741 return 0;
742}
743
744/**
745 * memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region.
746 * @base: the base phys addr of the region
747 * @size: the size of the region
748 *
749 * This function isolates region [@base, @base + @size), and clear flag
750 * MEMBLOCK_HOTPLUG for the isolated regions.
751 *
752 * Return 0 on succees, -errno on failure.
753 */
754int __init_memblock memblock_clear_hotplug(phys_addr_t base, phys_addr_t size)
755{
756 struct memblock_type *type = &memblock.memory;
757 int i, ret, start_rgn, end_rgn;
758
759 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
760 if (ret)
761 return ret;
762
763 for (i = start_rgn; i < end_rgn; i++)
764 memblock_clear_region_flags(&type->regions[i],
765 MEMBLOCK_HOTPLUG);
766
767 memblock_merge_regions(type);
768 return 0;
769}
770
771/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100772 * __next__mem_range - next function for for_each_free_mem_range() etc.
Tejun Heo35fd0802011-07-12 11:15:59 +0200773 * @idx: pointer to u64 loop variable
Grygorii Strashkob1154232014-01-21 15:50:16 -0800774 * @nid: node selector, %NUMA_NO_NODE for all nodes
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100775 * @type_a: pointer to memblock_type from where the range is taken
776 * @type_b: pointer to memblock_type which excludes memory from being taken
Wanpeng Lidad75572012-06-20 12:53:01 -0700777 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
778 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
779 * @out_nid: ptr to int for nid of the range, can be %NULL
Tejun Heo35fd0802011-07-12 11:15:59 +0200780 *
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100781 * Find the first area from *@idx which matches @nid, fill the out
Tejun Heo35fd0802011-07-12 11:15:59 +0200782 * parameters, and update *@idx for the next iteration. The lower 32bit of
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100783 * *@idx contains index into type_a and the upper 32bit indexes the
784 * areas before each region in type_b. For example, if type_b regions
Tejun Heo35fd0802011-07-12 11:15:59 +0200785 * look like the following,
786 *
787 * 0:[0-16), 1:[32-48), 2:[128-130)
788 *
789 * The upper 32bit indexes the following regions.
790 *
791 * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX)
792 *
793 * As both region arrays are sorted, the function advances the two indices
794 * in lockstep and returns each intersection.
795 */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100796void __init_memblock __next_mem_range(u64 *idx, int nid,
797 struct memblock_type *type_a,
798 struct memblock_type *type_b,
799 phys_addr_t *out_start,
800 phys_addr_t *out_end, int *out_nid)
Tejun Heo35fd0802011-07-12 11:15:59 +0200801{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100802 int idx_a = *idx & 0xffffffff;
803 int idx_b = *idx >> 32;
Grygorii Strashkob1154232014-01-21 15:50:16 -0800804
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100805 if (WARN_ONCE(nid == MAX_NUMNODES,
806 "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
Grygorii Strashko560dca272014-01-21 15:50:55 -0800807 nid = NUMA_NO_NODE;
Tejun Heo35fd0802011-07-12 11:15:59 +0200808
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100809 for (; idx_a < type_a->cnt; idx_a++) {
810 struct memblock_region *m = &type_a->regions[idx_a];
811
Tejun Heo35fd0802011-07-12 11:15:59 +0200812 phys_addr_t m_start = m->base;
813 phys_addr_t m_end = m->base + m->size;
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100814 int m_nid = memblock_get_region_node(m);
Tejun Heo35fd0802011-07-12 11:15:59 +0200815
816 /* only memory regions are associated with nodes, check it */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100817 if (nid != NUMA_NO_NODE && nid != m_nid)
Tejun Heo35fd0802011-07-12 11:15:59 +0200818 continue;
819
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100820 if (!type_b) {
821 if (out_start)
822 *out_start = m_start;
823 if (out_end)
824 *out_end = m_end;
825 if (out_nid)
826 *out_nid = m_nid;
827 idx_a++;
828 *idx = (u32)idx_a | (u64)idx_b << 32;
829 return;
830 }
Tejun Heo35fd0802011-07-12 11:15:59 +0200831
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100832 /* scan areas before each reservation */
833 for (; idx_b < type_b->cnt + 1; idx_b++) {
834 struct memblock_region *r;
835 phys_addr_t r_start;
836 phys_addr_t r_end;
837
838 r = &type_b->regions[idx_b];
839 r_start = idx_b ? r[-1].base + r[-1].size : 0;
840 r_end = idx_b < type_b->cnt ?
841 r->base : ULLONG_MAX;
842
843 /*
844 * if idx_b advanced past idx_a,
845 * break out to advance idx_a
846 */
Tejun Heo35fd0802011-07-12 11:15:59 +0200847 if (r_start >= m_end)
848 break;
849 /* if the two regions intersect, we're done */
850 if (m_start < r_end) {
851 if (out_start)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100852 *out_start =
853 max(m_start, r_start);
Tejun Heo35fd0802011-07-12 11:15:59 +0200854 if (out_end)
855 *out_end = min(m_end, r_end);
856 if (out_nid)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100857 *out_nid = m_nid;
Tejun Heo35fd0802011-07-12 11:15:59 +0200858 /*
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100859 * The region which ends first is
860 * advanced for the next iteration.
Tejun Heo35fd0802011-07-12 11:15:59 +0200861 */
862 if (m_end <= r_end)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100863 idx_a++;
Tejun Heo35fd0802011-07-12 11:15:59 +0200864 else
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100865 idx_b++;
866 *idx = (u32)idx_a | (u64)idx_b << 32;
Tejun Heo35fd0802011-07-12 11:15:59 +0200867 return;
868 }
869 }
870 }
871
872 /* signal end of iteration */
873 *idx = ULLONG_MAX;
874}
875
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800876/**
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100877 * __next_mem_range_rev - generic next function for for_each_*_range_rev()
878 *
879 * Finds the next range from type_a which is not marked as unsuitable
880 * in type_b.
881 *
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800882 * @idx: pointer to u64 loop variable
Grygorii Strashkob1154232014-01-21 15:50:16 -0800883 * @nid: nid: node selector, %NUMA_NO_NODE for all nodes
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100884 * @type_a: pointer to memblock_type from where the range is taken
885 * @type_b: pointer to memblock_type which excludes memory from being taken
Wanpeng Lidad75572012-06-20 12:53:01 -0700886 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
887 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
888 * @out_nid: ptr to int for nid of the range, can be %NULL
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800889 *
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100890 * Reverse of __next_mem_range().
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800891 */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100892void __init_memblock __next_mem_range_rev(u64 *idx, int nid,
893 struct memblock_type *type_a,
894 struct memblock_type *type_b,
895 phys_addr_t *out_start,
896 phys_addr_t *out_end, int *out_nid)
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800897{
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100898 int idx_a = *idx & 0xffffffff;
899 int idx_b = *idx >> 32;
Grygorii Strashkob1154232014-01-21 15:50:16 -0800900
Grygorii Strashko560dca272014-01-21 15:50:55 -0800901 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
902 nid = NUMA_NO_NODE;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800903
904 if (*idx == (u64)ULLONG_MAX) {
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100905 idx_a = type_a->cnt - 1;
906 idx_b = type_b->cnt;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800907 }
908
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100909 for (; idx_a >= 0; idx_a--) {
910 struct memblock_region *m = &type_a->regions[idx_a];
911
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800912 phys_addr_t m_start = m->base;
913 phys_addr_t m_end = m->base + m->size;
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100914 int m_nid = memblock_get_region_node(m);
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800915
916 /* only memory regions are associated with nodes, check it */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100917 if (nid != NUMA_NO_NODE && nid != m_nid)
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800918 continue;
919
Tang Chen55ac5902014-01-21 15:49:35 -0800920 /* skip hotpluggable memory regions if needed */
921 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
922 continue;
923
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100924 if (!type_b) {
925 if (out_start)
926 *out_start = m_start;
927 if (out_end)
928 *out_end = m_end;
929 if (out_nid)
930 *out_nid = m_nid;
931 idx_a++;
932 *idx = (u32)idx_a | (u64)idx_b << 32;
933 return;
934 }
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800935
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100936 /* scan areas before each reservation */
937 for (; idx_b >= 0; idx_b--) {
938 struct memblock_region *r;
939 phys_addr_t r_start;
940 phys_addr_t r_end;
941
942 r = &type_b->regions[idx_b];
943 r_start = idx_b ? r[-1].base + r[-1].size : 0;
944 r_end = idx_b < type_b->cnt ?
945 r->base : ULLONG_MAX;
946 /*
947 * if idx_b advanced past idx_a,
948 * break out to advance idx_a
949 */
950
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800951 if (r_end <= m_start)
952 break;
953 /* if the two regions intersect, we're done */
954 if (m_end > r_start) {
955 if (out_start)
956 *out_start = max(m_start, r_start);
957 if (out_end)
958 *out_end = min(m_end, r_end);
959 if (out_nid)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100960 *out_nid = m_nid;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800961 if (m_start >= r_start)
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100962 idx_a--;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800963 else
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100964 idx_b--;
965 *idx = (u32)idx_a | (u64)idx_b << 32;
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800966 return;
967 }
968 }
969 }
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +0100970 /* signal end of iteration */
Tejun Heo7bd0b0f2011-12-08 10:22:09 -0800971 *idx = ULLONG_MAX;
972}
973
Tejun Heo7c0caeb2011-07-14 11:43:42 +0200974#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
975/*
976 * Common iterator interface used to define for_each_mem_range().
977 */
978void __init_memblock __next_mem_pfn_range(int *idx, int nid,
979 unsigned long *out_start_pfn,
980 unsigned long *out_end_pfn, int *out_nid)
981{
982 struct memblock_type *type = &memblock.memory;
983 struct memblock_region *r;
984
985 while (++*idx < type->cnt) {
986 r = &type->regions[*idx];
987
988 if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size))
989 continue;
990 if (nid == MAX_NUMNODES || nid == r->nid)
991 break;
992 }
993 if (*idx >= type->cnt) {
994 *idx = -1;
995 return;
996 }
997
998 if (out_start_pfn)
999 *out_start_pfn = PFN_UP(r->base);
1000 if (out_end_pfn)
1001 *out_end_pfn = PFN_DOWN(r->base + r->size);
1002 if (out_nid)
1003 *out_nid = r->nid;
1004}
1005
1006/**
1007 * memblock_set_node - set node ID on memblock regions
1008 * @base: base of area to set node ID for
1009 * @size: size of area to set node ID for
Tang Chene7e8de52014-01-21 15:49:26 -08001010 * @type: memblock type to set node ID for
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001011 * @nid: node ID to set
1012 *
Tang Chene7e8de52014-01-21 15:49:26 -08001013 * Set the nid of memblock @type regions in [@base,@base+@size) to @nid.
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001014 * Regions which cross the area boundaries are split as necessary.
1015 *
1016 * RETURNS:
1017 * 0 on success, -errno on failure.
1018 */
1019int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size,
Tang Chene7e8de52014-01-21 15:49:26 -08001020 struct memblock_type *type, int nid)
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001021{
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001022 int start_rgn, end_rgn;
1023 int i, ret;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001024
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001025 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
1026 if (ret)
1027 return ret;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001028
Tejun Heo6a9ceb32011-12-08 10:22:07 -08001029 for (i = start_rgn; i < end_rgn; i++)
Wanpeng Lie9d24ad2012-10-08 16:32:21 -07001030 memblock_set_region_node(&type->regions[i], nid);
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001031
1032 memblock_merge_regions(type);
1033 return 0;
1034}
1035#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
1036
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001037static phys_addr_t __init memblock_alloc_range_nid(phys_addr_t size,
1038 phys_addr_t align, phys_addr_t start,
1039 phys_addr_t end, int nid)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001040{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001041 phys_addr_t found;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001042
Grygorii Strashko79f40fa2014-01-21 15:50:12 -08001043 if (!align)
1044 align = SMP_CACHE_BYTES;
Vineet Gupta94f3d3a2013-04-29 15:06:15 -07001045
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001046 found = memblock_find_in_range_node(size, align, start, end, nid);
Catalin Marinasaedf95e2014-06-06 14:38:20 -07001047 if (found && !memblock_reserve(found, size)) {
1048 /*
1049 * The min_count is set to 0 so that memblock allocations are
1050 * never reported as leaks.
1051 */
1052 kmemleak_alloc(__va(found), size, 0, 0);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001053 return found;
Catalin Marinasaedf95e2014-06-06 14:38:20 -07001054 }
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001055 return 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001056}
1057
Akinobu Mita2bfc2862014-06-04 16:06:53 -07001058phys_addr_t __init memblock_alloc_range(phys_addr_t size, phys_addr_t align,
1059 phys_addr_t start, phys_addr_t end)
1060{
1061 return memblock_alloc_range_nid(size, align, start, end, NUMA_NO_NODE);
1062}
1063
1064static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size,
1065 phys_addr_t align, phys_addr_t max_addr,
1066 int nid)
1067{
1068 return memblock_alloc_range_nid(size, align, 0, max_addr, nid);
1069}
1070
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001071phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid)
1072{
1073 return memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE, nid);
1074}
1075
1076phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
1077{
Grygorii Strashkob1154232014-01-21 15:50:16 -08001078 return memblock_alloc_base_nid(size, align, max_addr, NUMA_NO_NODE);
Tejun Heo7bd0b0f2011-12-08 10:22:09 -08001079}
1080
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001081phys_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 +10001082{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001083 phys_addr_t alloc;
1084
1085 alloc = __memblock_alloc_base(size, align, max_addr);
1086
1087 if (alloc == 0)
1088 panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n",
1089 (unsigned long long) size, (unsigned long long) max_addr);
1090
1091 return alloc;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001092}
1093
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001094phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001095{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001096 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001097}
1098
Benjamin Herrenschmidt9d1e2492010-07-06 15:39:17 -07001099phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid)
1100{
1101 phys_addr_t res = memblock_alloc_nid(size, align, nid);
1102
1103 if (res)
1104 return res;
Tejun Heo15fb0972011-07-12 09:58:07 +02001105 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001106}
1107
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001108/**
1109 * memblock_virt_alloc_internal - allocate boot memory block
1110 * @size: size of memory block to be allocated in bytes
1111 * @align: alignment of the region and block's size
1112 * @min_addr: the lower bound of the memory region to allocate (phys address)
1113 * @max_addr: the upper bound of the memory region to allocate (phys address)
1114 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1115 *
1116 * The @min_addr limit is dropped if it can not be satisfied and the allocation
1117 * will fall back to memory below @min_addr. Also, allocation may fall back
1118 * to any node in the system if the specified node can not
1119 * hold the requested memory.
1120 *
1121 * The allocation is performed from memory region limited by
1122 * memblock.current_limit if @max_addr == %BOOTMEM_ALLOC_ACCESSIBLE.
1123 *
1124 * The memory block is aligned on SMP_CACHE_BYTES if @align == 0.
1125 *
1126 * The phys address of allocated boot memory block is converted to virtual and
1127 * allocated memory is reset to 0.
1128 *
1129 * In addition, function sets the min_count to 0 using kmemleak_alloc for
1130 * allocated boot memory block, so that it is never reported as leaks.
1131 *
1132 * RETURNS:
1133 * Virtual address of allocated memory block on success, NULL on failure.
1134 */
1135static void * __init memblock_virt_alloc_internal(
1136 phys_addr_t size, phys_addr_t align,
1137 phys_addr_t min_addr, phys_addr_t max_addr,
1138 int nid)
1139{
1140 phys_addr_t alloc;
1141 void *ptr;
1142
Grygorii Strashko560dca272014-01-21 15:50:55 -08001143 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
1144 nid = NUMA_NO_NODE;
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001145
1146 /*
1147 * Detect any accidental use of these APIs after slab is ready, as at
1148 * this moment memblock may be deinitialized already and its
1149 * internal data may be destroyed (after execution of free_all_bootmem)
1150 */
1151 if (WARN_ON_ONCE(slab_is_available()))
1152 return kzalloc_node(size, GFP_NOWAIT, nid);
1153
1154 if (!align)
1155 align = SMP_CACHE_BYTES;
1156
Yinghai Luf544e142014-01-29 14:05:52 -08001157 if (max_addr > memblock.current_limit)
1158 max_addr = memblock.current_limit;
1159
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001160again:
1161 alloc = memblock_find_in_range_node(size, align, min_addr, max_addr,
1162 nid);
1163 if (alloc)
1164 goto done;
1165
1166 if (nid != NUMA_NO_NODE) {
1167 alloc = memblock_find_in_range_node(size, align, min_addr,
1168 max_addr, NUMA_NO_NODE);
1169 if (alloc)
1170 goto done;
1171 }
1172
1173 if (min_addr) {
1174 min_addr = 0;
1175 goto again;
1176 } else {
1177 goto error;
1178 }
1179
1180done:
1181 memblock_reserve(alloc, size);
1182 ptr = phys_to_virt(alloc);
1183 memset(ptr, 0, size);
1184
1185 /*
1186 * The min_count is set to 0 so that bootmem allocated blocks
1187 * are never reported as leaks. This is because many of these blocks
1188 * are only referred via the physical address which is not
1189 * looked up by kmemleak.
1190 */
1191 kmemleak_alloc(ptr, size, 0, 0);
1192
1193 return ptr;
1194
1195error:
1196 return NULL;
1197}
1198
1199/**
1200 * memblock_virt_alloc_try_nid_nopanic - allocate boot memory block
1201 * @size: size of memory block to be allocated in bytes
1202 * @align: alignment of the region and block's size
1203 * @min_addr: the lower bound of the memory region from where the allocation
1204 * is preferred (phys address)
1205 * @max_addr: the upper bound of the memory region from where the allocation
1206 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1207 * allocate only from memory limited by memblock.current_limit value
1208 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1209 *
1210 * Public version of _memblock_virt_alloc_try_nid_nopanic() which provides
1211 * additional debug information (including caller info), if enabled.
1212 *
1213 * RETURNS:
1214 * Virtual address of allocated memory block on success, NULL on failure.
1215 */
1216void * __init memblock_virt_alloc_try_nid_nopanic(
1217 phys_addr_t size, phys_addr_t align,
1218 phys_addr_t min_addr, phys_addr_t max_addr,
1219 int nid)
1220{
1221 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1222 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1223 (u64)max_addr, (void *)_RET_IP_);
1224 return memblock_virt_alloc_internal(size, align, min_addr,
1225 max_addr, nid);
1226}
1227
1228/**
1229 * memblock_virt_alloc_try_nid - allocate boot memory block with panicking
1230 * @size: size of memory block to be allocated in bytes
1231 * @align: alignment of the region and block's size
1232 * @min_addr: the lower bound of the memory region from where the allocation
1233 * is preferred (phys address)
1234 * @max_addr: the upper bound of the memory region from where the allocation
1235 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1236 * allocate only from memory limited by memblock.current_limit value
1237 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1238 *
1239 * Public panicking version of _memblock_virt_alloc_try_nid_nopanic()
1240 * which provides debug information (including caller info), if enabled,
1241 * and panics if the request can not be satisfied.
1242 *
1243 * RETURNS:
1244 * Virtual address of allocated memory block on success, NULL on failure.
1245 */
1246void * __init memblock_virt_alloc_try_nid(
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 void *ptr;
1252
1253 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1254 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1255 (u64)max_addr, (void *)_RET_IP_);
1256 ptr = memblock_virt_alloc_internal(size, align,
1257 min_addr, max_addr, nid);
1258 if (ptr)
1259 return ptr;
1260
1261 panic("%s: Failed to allocate %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx\n",
1262 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1263 (u64)max_addr);
1264 return NULL;
1265}
1266
1267/**
1268 * __memblock_free_early - free boot memory block
1269 * @base: phys starting address of the boot memory block
1270 * @size: size of the boot memory block in bytes
1271 *
1272 * Free boot memory block previously allocated by memblock_virt_alloc_xx() API.
1273 * The freeing memory will not be released to the buddy allocator.
1274 */
1275void __init __memblock_free_early(phys_addr_t base, phys_addr_t size)
1276{
1277 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1278 __func__, (u64)base, (u64)base + size - 1,
1279 (void *)_RET_IP_);
1280 kmemleak_free_part(__va(base), size);
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001281 memblock_remove_range(&memblock.reserved, base, size);
Santosh Shilimkar26f09e92014-01-21 15:50:19 -08001282}
1283
1284/*
1285 * __memblock_free_late - free bootmem block pages directly to buddy allocator
1286 * @addr: phys starting address of the boot memory block
1287 * @size: size of the boot memory block in bytes
1288 *
1289 * This is only useful when the bootmem allocator has already been torn
1290 * down, but we are still initializing the system. Pages are released directly
1291 * to the buddy allocator, no bootmem metadata is updated because it is gone.
1292 */
1293void __init __memblock_free_late(phys_addr_t base, phys_addr_t size)
1294{
1295 u64 cursor, end;
1296
1297 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1298 __func__, (u64)base, (u64)base + size - 1,
1299 (void *)_RET_IP_);
1300 kmemleak_free_part(__va(base), size);
1301 cursor = PFN_UP(base);
1302 end = PFN_DOWN(base + size);
1303
1304 for (; cursor < end; cursor++) {
1305 __free_pages_bootmem(pfn_to_page(cursor), 0);
1306 totalram_pages++;
1307 }
1308}
Benjamin Herrenschmidt9d1e2492010-07-06 15:39:17 -07001309
1310/*
1311 * Remaining API functions
1312 */
1313
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +10001314phys_addr_t __init memblock_phys_mem_size(void)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001315{
Tejun Heo1440c4e2011-12-08 10:22:08 -08001316 return memblock.memory.total_size;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001317}
1318
Yinghai Lu595ad9a2013-01-24 12:20:09 -08001319phys_addr_t __init memblock_mem_size(unsigned long limit_pfn)
1320{
1321 unsigned long pages = 0;
1322 struct memblock_region *r;
1323 unsigned long start_pfn, end_pfn;
1324
1325 for_each_memblock(memory, r) {
1326 start_pfn = memblock_region_memory_base_pfn(r);
1327 end_pfn = memblock_region_memory_end_pfn(r);
1328 start_pfn = min_t(unsigned long, start_pfn, limit_pfn);
1329 end_pfn = min_t(unsigned long, end_pfn, limit_pfn);
1330 pages += end_pfn - start_pfn;
1331 }
1332
Fabian Frederick16763232014-04-07 15:37:53 -07001333 return PFN_PHYS(pages);
Yinghai Lu595ad9a2013-01-24 12:20:09 -08001334}
1335
Sam Ravnborg0a93ebe2011-10-31 17:08:16 -07001336/* lowest address */
1337phys_addr_t __init_memblock memblock_start_of_DRAM(void)
1338{
1339 return memblock.memory.regions[0].base;
1340}
1341
Yinghai Lu10d06432010-07-28 15:43:02 +10001342phys_addr_t __init_memblock memblock_end_of_DRAM(void)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001343{
1344 int idx = memblock.memory.cnt - 1;
1345
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +10001346 return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001347}
1348
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001349void __init memblock_enforce_memory_limit(phys_addr_t limit)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001350{
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001351 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
Emil Medve136199f2014-04-07 15:37:52 -07001352 struct memblock_region *r;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001353
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001354 if (!limit)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001355 return;
1356
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001357 /* find out max address */
Emil Medve136199f2014-04-07 15:37:52 -07001358 for_each_memblock(memory, r) {
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001359 if (limit <= r->size) {
1360 max_addr = r->base + limit;
1361 break;
1362 }
1363 limit -= r->size;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001364 }
1365
Tejun Heoc0ce8fe2011-12-08 10:22:07 -08001366 /* truncate both memory and reserved regions */
Philipp Hachtmannf1af9d32014-01-29 18:16:01 +01001367 memblock_remove_range(&memblock.memory, max_addr,
1368 (phys_addr_t)ULLONG_MAX);
1369 memblock_remove_range(&memblock.reserved, max_addr,
1370 (phys_addr_t)ULLONG_MAX);
Yinghai Lu95f72d12010-07-12 14:36:09 +10001371}
1372
Yinghai Lucd794812010-10-11 12:34:09 -07001373static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001374{
1375 unsigned int left = 0, right = type->cnt;
1376
1377 do {
1378 unsigned int mid = (right + left) / 2;
1379
1380 if (addr < type->regions[mid].base)
1381 right = mid;
1382 else if (addr >= (type->regions[mid].base +
1383 type->regions[mid].size))
1384 left = mid + 1;
1385 else
1386 return mid;
1387 } while (left < right);
1388 return -1;
1389}
1390
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +10001391int __init memblock_is_reserved(phys_addr_t addr)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001392{
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001393 return memblock_search(&memblock.reserved, addr) != -1;
1394}
Yinghai Lu95f72d12010-07-12 14:36:09 +10001395
Yinghai Lu3661ca62010-09-15 13:05:29 -07001396int __init_memblock memblock_is_memory(phys_addr_t addr)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001397{
1398 return memblock_search(&memblock.memory, addr) != -1;
1399}
1400
Yinghai Lue76b63f2013-09-11 14:22:17 -07001401#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1402int __init_memblock memblock_search_pfn_nid(unsigned long pfn,
1403 unsigned long *start_pfn, unsigned long *end_pfn)
1404{
1405 struct memblock_type *type = &memblock.memory;
Fabian Frederick16763232014-04-07 15:37:53 -07001406 int mid = memblock_search(type, PFN_PHYS(pfn));
Yinghai Lue76b63f2013-09-11 14:22:17 -07001407
1408 if (mid == -1)
1409 return -1;
1410
Fabian Frederickf7e2f7e2014-06-04 16:07:51 -07001411 *start_pfn = PFN_DOWN(type->regions[mid].base);
1412 *end_pfn = PFN_DOWN(type->regions[mid].base + type->regions[mid].size);
Yinghai Lue76b63f2013-09-11 14:22:17 -07001413
1414 return type->regions[mid].nid;
1415}
1416#endif
1417
Stephen Boydeab30942012-05-24 00:45:21 -07001418/**
1419 * memblock_is_region_memory - check if a region is a subset of memory
1420 * @base: base of region to check
1421 * @size: size of region to check
1422 *
1423 * Check if the region [@base, @base+@size) is a subset of a memory block.
1424 *
1425 * RETURNS:
1426 * 0 if false, non-zero if true
1427 */
Yinghai Lu3661ca62010-09-15 13:05:29 -07001428int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001429{
Tomi Valkeinenabb65272011-01-20 14:44:20 -08001430 int idx = memblock_search(&memblock.memory, base);
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001431 phys_addr_t end = base + memblock_cap_size(base, &size);
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +10001432
1433 if (idx == -1)
1434 return 0;
Tomi Valkeinenabb65272011-01-20 14:44:20 -08001435 return memblock.memory.regions[idx].base <= base &&
1436 (memblock.memory.regions[idx].base +
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001437 memblock.memory.regions[idx].size) >= end;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001438}
1439
Stephen Boydeab30942012-05-24 00:45:21 -07001440/**
1441 * memblock_is_region_reserved - check if a region intersects reserved memory
1442 * @base: base of region to check
1443 * @size: size of region to check
1444 *
1445 * Check if the region [@base, @base+@size) intersects a reserved memory block.
1446 *
1447 * RETURNS:
1448 * 0 if false, non-zero if true
1449 */
Yinghai Lu10d06432010-07-28 15:43:02 +10001450int __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +10001451{
Tejun Heoeb18f1b2011-12-08 10:22:07 -08001452 memblock_cap_size(base, &size);
Benjamin Herrenschmidtf1c2c192010-08-04 14:17:17 +10001453 return memblock_overlaps_region(&memblock.reserved, base, size) >= 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +10001454}
1455
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001456void __init_memblock memblock_trim_memory(phys_addr_t align)
1457{
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001458 phys_addr_t start, end, orig_start, orig_end;
Emil Medve136199f2014-04-07 15:37:52 -07001459 struct memblock_region *r;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001460
Emil Medve136199f2014-04-07 15:37:52 -07001461 for_each_memblock(memory, r) {
1462 orig_start = r->base;
1463 orig_end = r->base + r->size;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001464 start = round_up(orig_start, align);
1465 end = round_down(orig_end, align);
1466
1467 if (start == orig_start && end == orig_end)
1468 continue;
1469
1470 if (start < end) {
Emil Medve136199f2014-04-07 15:37:52 -07001471 r->base = start;
1472 r->size = end - start;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001473 } else {
Emil Medve136199f2014-04-07 15:37:52 -07001474 memblock_remove_region(&memblock.memory,
1475 r - memblock.memory.regions);
1476 r--;
Yinghai Lu6ede1fd2012-10-22 16:35:18 -07001477 }
1478 }
1479}
Benjamin Herrenschmidte63075a2010-07-06 15:39:01 -07001480
Yinghai Lu3661ca62010-09-15 13:05:29 -07001481void __init_memblock memblock_set_current_limit(phys_addr_t limit)
Benjamin Herrenschmidte63075a2010-07-06 15:39:01 -07001482{
1483 memblock.current_limit = limit;
1484}
1485
Laura Abbottfec51012014-02-27 01:23:43 +01001486phys_addr_t __init_memblock memblock_get_current_limit(void)
1487{
1488 return memblock.current_limit;
1489}
1490
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001491static void __init_memblock memblock_dump(struct memblock_type *type, char *name)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001492{
1493 unsigned long long base, size;
Tang Chen66a20752014-01-21 15:49:20 -08001494 unsigned long flags;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001495 int i;
1496
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001497 pr_info(" %s.cnt = 0x%lx\n", name, type->cnt);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001498
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001499 for (i = 0; i < type->cnt; i++) {
1500 struct memblock_region *rgn = &type->regions[i];
1501 char nid_buf[32] = "";
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001502
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001503 base = rgn->base;
1504 size = rgn->size;
Tang Chen66a20752014-01-21 15:49:20 -08001505 flags = rgn->flags;
Tejun Heo7c0caeb2011-07-14 11:43:42 +02001506#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1507 if (memblock_get_region_node(rgn) != MAX_NUMNODES)
1508 snprintf(nid_buf, sizeof(nid_buf), " on node %d",
1509 memblock_get_region_node(rgn));
1510#endif
Tang Chen66a20752014-01-21 15:49:20 -08001511 pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s flags: %#lx\n",
1512 name, i, base, base + size - 1, size, nid_buf, flags);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001513 }
1514}
1515
Tejun Heo4ff7b822011-12-08 10:22:06 -08001516void __init_memblock __memblock_dump_all(void)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001517{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001518 pr_info("MEMBLOCK configuration:\n");
Tejun Heo1440c4e2011-12-08 10:22:08 -08001519 pr_info(" memory size = %#llx reserved size = %#llx\n",
1520 (unsigned long long)memblock.memory.total_size,
1521 (unsigned long long)memblock.reserved.total_size);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001522
1523 memblock_dump(&memblock.memory, "memory");
1524 memblock_dump(&memblock.reserved, "reserved");
1525}
1526
Tejun Heo1aadc052011-12-08 10:22:08 -08001527void __init memblock_allow_resize(void)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001528{
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -07001529 memblock_can_resize = 1;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001530}
1531
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +10001532static int __init early_memblock(char *p)
1533{
1534 if (p && strstr(p, "debug"))
1535 memblock_debug = 1;
1536 return 0;
1537}
1538early_param("memblock", early_memblock);
1539
Tejun Heoc378ddd2011-07-14 11:46:03 +02001540#if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001541
1542static int memblock_debug_show(struct seq_file *m, void *private)
1543{
1544 struct memblock_type *type = m->private;
1545 struct memblock_region *reg;
1546 int i;
1547
1548 for (i = 0; i < type->cnt; i++) {
1549 reg = &type->regions[i];
1550 seq_printf(m, "%4d: ", i);
1551 if (sizeof(phys_addr_t) == 4)
1552 seq_printf(m, "0x%08lx..0x%08lx\n",
1553 (unsigned long)reg->base,
1554 (unsigned long)(reg->base + reg->size - 1));
1555 else
1556 seq_printf(m, "0x%016llx..0x%016llx\n",
1557 (unsigned long long)reg->base,
1558 (unsigned long long)(reg->base + reg->size - 1));
1559
1560 }
1561 return 0;
1562}
1563
1564static int memblock_debug_open(struct inode *inode, struct file *file)
1565{
1566 return single_open(file, memblock_debug_show, inode->i_private);
1567}
1568
1569static const struct file_operations memblock_debug_fops = {
1570 .open = memblock_debug_open,
1571 .read = seq_read,
1572 .llseek = seq_lseek,
1573 .release = single_release,
1574};
1575
1576static int __init memblock_init_debugfs(void)
1577{
1578 struct dentry *root = debugfs_create_dir("memblock", NULL);
1579 if (!root)
1580 return -ENXIO;
1581 debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops);
1582 debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops);
Philipp Hachtmann70210ed2014-01-29 18:16:01 +01001583#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
1584 debugfs_create_file("physmem", S_IRUGO, root, &memblock.physmem, &memblock_debug_fops);
1585#endif
Benjamin Herrenschmidt6d03b882010-07-06 15:39:19 -07001586
1587 return 0;
1588}
1589__initcall(memblock_init_debugfs);
1590
1591#endif /* CONFIG_DEBUG_FS */