mm: fix some typos in mm/zsmalloc.c
[linux-2.6-block.git] / mm / memblock.c
CommitLineData
95f72d1e
YL
1/*
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>
142b45a7 14#include <linux/slab.h>
95f72d1e
YL
15#include <linux/init.h>
16#include <linux/bitops.h>
449e8df3 17#include <linux/poison.h>
c196f76f 18#include <linux/pfn.h>
6d03b885
BH
19#include <linux/debugfs.h>
20#include <linux/seq_file.h>
95f72d1e
YL
21#include <linux/memblock.h>
22
c4c5ad6b 23#include <asm/sections.h>
26f09e9b
SS
24#include <linux/io.h>
25
26#include "internal.h"
79442ed1 27
fe091c20
TH
28static 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;
70210ed9
PH
30#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
31static struct memblock_region memblock_physmem_init_regions[INIT_PHYSMEM_REGIONS] __initdata_memblock;
32#endif
fe091c20
TH
33
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
70210ed9
PH
43#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
79442ed1 49 .bottom_up = false,
fe091c20
TH
50 .current_limit = MEMBLOCK_ALLOC_ANYWHERE,
51};
95f72d1e 52
10d06439 53int memblock_debug __initdata_memblock;
55ac590c
TC
54#ifdef CONFIG_MOVABLE_NODE
55bool movable_node_enabled __initdata_memblock = false;
56#endif
a3f5bafc 57static bool system_has_some_mirror __initdata_memblock = false;
1aadc056 58static int memblock_can_resize __initdata_memblock;
181eb394
GS
59static int memblock_memory_in_slab __initdata_memblock = 0;
60static int memblock_reserved_in_slab __initdata_memblock = 0;
95f72d1e 61
a3f5bafc
TL
62ulong __init_memblock choose_memblock_flags(void)
63{
64 return system_has_some_mirror ? MEMBLOCK_MIRROR : MEMBLOCK_NONE;
65}
66
142b45a7 67/* inline so we don't get a warning when pr_debug is compiled out */
c2233116
RP
68static __init_memblock const char *
69memblock_type_name(struct memblock_type *type)
142b45a7
BH
70{
71 if (type == &memblock.memory)
72 return "memory";
73 else if (type == &memblock.reserved)
74 return "reserved";
75 else
76 return "unknown";
77}
78
eb18f1b5
TH
79/* adjust *@size so that (@base + *@size) doesn't overflow, return new size */
80static inline phys_addr_t memblock_cap_size(phys_addr_t base, phys_addr_t *size)
81{
82 return *size = min(*size, (phys_addr_t)ULLONG_MAX - base);
83}
84
6ed311b2
BH
85/*
86 * Address comparison utilities
87 */
10d06439 88static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1,
2898cc4c 89 phys_addr_t base2, phys_addr_t size2)
95f72d1e
YL
90{
91 return ((base1 < (base2 + size2)) && (base2 < (base1 + size1)));
92}
93
95cf82ec 94bool __init_memblock memblock_overlaps_region(struct memblock_type *type,
2d7d3eb2 95 phys_addr_t base, phys_addr_t size)
6ed311b2
BH
96{
97 unsigned long i;
98
f14516fb
AK
99 for (i = 0; i < type->cnt; i++)
100 if (memblock_addrs_overlap(base, size, type->regions[i].base,
101 type->regions[i].size))
6ed311b2 102 break;
c5c5c9d1 103 return i < type->cnt;
6ed311b2
BH
104}
105
79442ed1
TC
106/*
107 * __memblock_find_range_bottom_up - find free area utility in bottom-up
108 * @start: start of candidate range
109 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
110 * @size: size of free area to find
111 * @align: alignment of free area to find
b1154233 112 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
fc6daaf9 113 * @flags: pick from blocks based on memory attributes
79442ed1
TC
114 *
115 * Utility called from memblock_find_in_range_node(), find free area bottom-up.
116 *
117 * RETURNS:
118 * Found address on success, 0 on failure.
119 */
120static phys_addr_t __init_memblock
121__memblock_find_range_bottom_up(phys_addr_t start, phys_addr_t end,
fc6daaf9
TL
122 phys_addr_t size, phys_addr_t align, int nid,
123 ulong flags)
79442ed1
TC
124{
125 phys_addr_t this_start, this_end, cand;
126 u64 i;
127
fc6daaf9 128 for_each_free_mem_range(i, nid, flags, &this_start, &this_end, NULL) {
79442ed1
TC
129 this_start = clamp(this_start, start, end);
130 this_end = clamp(this_end, start, end);
131
132 cand = round_up(this_start, align);
133 if (cand < this_end && this_end - cand >= size)
134 return cand;
135 }
136
137 return 0;
138}
139
7bd0b0f0 140/**
1402899e 141 * __memblock_find_range_top_down - find free area utility, in top-down
7bd0b0f0
TH
142 * @start: start of candidate range
143 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
144 * @size: size of free area to find
145 * @align: alignment of free area to find
b1154233 146 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
fc6daaf9 147 * @flags: pick from blocks based on memory attributes
7bd0b0f0 148 *
1402899e 149 * Utility called from memblock_find_in_range_node(), find free area top-down.
7bd0b0f0
TH
150 *
151 * RETURNS:
79442ed1 152 * Found address on success, 0 on failure.
6ed311b2 153 */
1402899e
TC
154static phys_addr_t __init_memblock
155__memblock_find_range_top_down(phys_addr_t start, phys_addr_t end,
fc6daaf9
TL
156 phys_addr_t size, phys_addr_t align, int nid,
157 ulong flags)
f7210e6c
TC
158{
159 phys_addr_t this_start, this_end, cand;
160 u64 i;
161
fc6daaf9
TL
162 for_each_free_mem_range_reverse(i, nid, flags, &this_start, &this_end,
163 NULL) {
f7210e6c
TC
164 this_start = clamp(this_start, start, end);
165 this_end = clamp(this_end, start, end);
166
167 if (this_end < size)
168 continue;
169
170 cand = round_down(this_end - size, align);
171 if (cand >= this_start)
172 return cand;
173 }
1402899e 174
f7210e6c
TC
175 return 0;
176}
6ed311b2 177
1402899e
TC
178/**
179 * memblock_find_in_range_node - find free area in given range and node
1402899e
TC
180 * @size: size of free area to find
181 * @align: alignment of free area to find
87029ee9
GS
182 * @start: start of candidate range
183 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
b1154233 184 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
fc6daaf9 185 * @flags: pick from blocks based on memory attributes
1402899e
TC
186 *
187 * Find @size free area aligned to @align in the specified range and node.
188 *
79442ed1
TC
189 * When allocation direction is bottom-up, the @start should be greater
190 * than the end of the kernel image. Otherwise, it will be trimmed. The
191 * reason is that we want the bottom-up allocation just near the kernel
192 * image so it is highly likely that the allocated memory and the kernel
193 * will reside in the same node.
194 *
195 * If bottom-up allocation failed, will try to allocate memory top-down.
196 *
1402899e 197 * RETURNS:
79442ed1 198 * Found address on success, 0 on failure.
1402899e 199 */
87029ee9
GS
200phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t size,
201 phys_addr_t align, phys_addr_t start,
fc6daaf9 202 phys_addr_t end, int nid, ulong flags)
1402899e 203{
0cfb8f0c 204 phys_addr_t kernel_end, ret;
79442ed1 205
1402899e
TC
206 /* pump up @end */
207 if (end == MEMBLOCK_ALLOC_ACCESSIBLE)
208 end = memblock.current_limit;
209
210 /* avoid allocating the first page */
211 start = max_t(phys_addr_t, start, PAGE_SIZE);
212 end = max(start, end);
79442ed1
TC
213 kernel_end = __pa_symbol(_end);
214
215 /*
216 * try bottom-up allocation only when bottom-up mode
217 * is set and @end is above the kernel image.
218 */
219 if (memblock_bottom_up() && end > kernel_end) {
220 phys_addr_t bottom_up_start;
221
222 /* make sure we will allocate above the kernel */
223 bottom_up_start = max(start, kernel_end);
224
225 /* ok, try bottom-up allocation first */
226 ret = __memblock_find_range_bottom_up(bottom_up_start, end,
fc6daaf9 227 size, align, nid, flags);
79442ed1
TC
228 if (ret)
229 return ret;
230
231 /*
232 * we always limit bottom-up allocation above the kernel,
233 * but top-down allocation doesn't have the limit, so
234 * retrying top-down allocation may succeed when bottom-up
235 * allocation failed.
236 *
237 * bottom-up allocation is expected to be fail very rarely,
238 * so we use WARN_ONCE() here to see the stack trace if
239 * fail happens.
240 */
756a025f 241 WARN_ONCE(1, "memblock: bottom-up allocation failed, memory hotunplug may be affected\n");
79442ed1 242 }
1402899e 243
fc6daaf9
TL
244 return __memblock_find_range_top_down(start, end, size, align, nid,
245 flags);
1402899e
TC
246}
247
7bd0b0f0
TH
248/**
249 * memblock_find_in_range - find free area in given range
250 * @start: start of candidate range
251 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
252 * @size: size of free area to find
253 * @align: alignment of free area to find
254 *
255 * Find @size free area aligned to @align in the specified range.
256 *
257 * RETURNS:
79442ed1 258 * Found address on success, 0 on failure.
fc769a8e 259 */
7bd0b0f0
TH
260phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start,
261 phys_addr_t end, phys_addr_t size,
262 phys_addr_t align)
6ed311b2 263{
a3f5bafc
TL
264 phys_addr_t ret;
265 ulong flags = choose_memblock_flags();
266
267again:
268 ret = memblock_find_in_range_node(size, align, start, end,
269 NUMA_NO_NODE, flags);
270
271 if (!ret && (flags & MEMBLOCK_MIRROR)) {
272 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
273 &size);
274 flags &= ~MEMBLOCK_MIRROR;
275 goto again;
276 }
277
278 return ret;
6ed311b2
BH
279}
280
10d06439 281static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r)
95f72d1e 282{
1440c4e2 283 type->total_size -= type->regions[r].size;
7c0caeb8
TH
284 memmove(&type->regions[r], &type->regions[r + 1],
285 (type->cnt - (r + 1)) * sizeof(type->regions[r]));
e3239ff9 286 type->cnt--;
95f72d1e 287
8f7a6605
BH
288 /* Special case for empty arrays */
289 if (type->cnt == 0) {
1440c4e2 290 WARN_ON(type->total_size != 0);
8f7a6605
BH
291 type->cnt = 1;
292 type->regions[0].base = 0;
293 type->regions[0].size = 0;
66a20757 294 type->regions[0].flags = 0;
7c0caeb8 295 memblock_set_region_node(&type->regions[0], MAX_NUMNODES);
8f7a6605 296 }
95f72d1e
YL
297}
298
354f17e1
PH
299#ifdef CONFIG_ARCH_DISCARD_MEMBLOCK
300
29f67386
YL
301phys_addr_t __init_memblock get_allocated_memblock_reserved_regions_info(
302 phys_addr_t *addr)
303{
304 if (memblock.reserved.regions == memblock_reserved_init_regions)
305 return 0;
306
307 *addr = __pa(memblock.reserved.regions);
308
309 return PAGE_ALIGN(sizeof(struct memblock_region) *
310 memblock.reserved.max);
311}
312
5e270e25
PH
313phys_addr_t __init_memblock get_allocated_memblock_memory_regions_info(
314 phys_addr_t *addr)
315{
316 if (memblock.memory.regions == memblock_memory_init_regions)
317 return 0;
318
319 *addr = __pa(memblock.memory.regions);
320
321 return PAGE_ALIGN(sizeof(struct memblock_region) *
322 memblock.memory.max);
323}
324
325#endif
326
48c3b583
GP
327/**
328 * memblock_double_array - double the size of the memblock regions array
329 * @type: memblock type of the regions array being doubled
330 * @new_area_start: starting address of memory range to avoid overlap with
331 * @new_area_size: size of memory range to avoid overlap with
332 *
333 * Double the size of the @type regions array. If memblock is being used to
334 * allocate memory for a new reserved regions array and there is a previously
335 * allocated memory range [@new_area_start,@new_area_start+@new_area_size]
336 * waiting to be reserved, ensure the memory used by the new array does
337 * not overlap.
338 *
339 * RETURNS:
340 * 0 on success, -1 on failure.
341 */
342static int __init_memblock memblock_double_array(struct memblock_type *type,
343 phys_addr_t new_area_start,
344 phys_addr_t new_area_size)
142b45a7
BH
345{
346 struct memblock_region *new_array, *old_array;
29f67386 347 phys_addr_t old_alloc_size, new_alloc_size;
142b45a7
BH
348 phys_addr_t old_size, new_size, addr;
349 int use_slab = slab_is_available();
181eb394 350 int *in_slab;
142b45a7
BH
351
352 /* We don't allow resizing until we know about the reserved regions
353 * of memory that aren't suitable for allocation
354 */
355 if (!memblock_can_resize)
356 return -1;
357
142b45a7
BH
358 /* Calculate new doubled size */
359 old_size = type->max * sizeof(struct memblock_region);
360 new_size = old_size << 1;
29f67386
YL
361 /*
362 * We need to allocated new one align to PAGE_SIZE,
363 * so we can free them completely later.
364 */
365 old_alloc_size = PAGE_ALIGN(old_size);
366 new_alloc_size = PAGE_ALIGN(new_size);
142b45a7 367
181eb394
GS
368 /* Retrieve the slab flag */
369 if (type == &memblock.memory)
370 in_slab = &memblock_memory_in_slab;
371 else
372 in_slab = &memblock_reserved_in_slab;
373
142b45a7
BH
374 /* Try to find some space for it.
375 *
376 * WARNING: We assume that either slab_is_available() and we use it or
fd07383b
AM
377 * we use MEMBLOCK for allocations. That means that this is unsafe to
378 * use when bootmem is currently active (unless bootmem itself is
379 * implemented on top of MEMBLOCK which isn't the case yet)
142b45a7
BH
380 *
381 * This should however not be an issue for now, as we currently only
fd07383b
AM
382 * call into MEMBLOCK while it's still active, or much later when slab
383 * is active for memory hotplug operations
142b45a7
BH
384 */
385 if (use_slab) {
386 new_array = kmalloc(new_size, GFP_KERNEL);
1f5026a7 387 addr = new_array ? __pa(new_array) : 0;
4e2f0775 388 } else {
48c3b583
GP
389 /* only exclude range when trying to double reserved.regions */
390 if (type != &memblock.reserved)
391 new_area_start = new_area_size = 0;
392
393 addr = memblock_find_in_range(new_area_start + new_area_size,
394 memblock.current_limit,
29f67386 395 new_alloc_size, PAGE_SIZE);
48c3b583
GP
396 if (!addr && new_area_size)
397 addr = memblock_find_in_range(0,
fd07383b
AM
398 min(new_area_start, memblock.current_limit),
399 new_alloc_size, PAGE_SIZE);
48c3b583 400
15674868 401 new_array = addr ? __va(addr) : NULL;
4e2f0775 402 }
1f5026a7 403 if (!addr) {
142b45a7
BH
404 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
405 memblock_type_name(type), type->max, type->max * 2);
406 return -1;
407 }
142b45a7 408
fd07383b
AM
409 memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]",
410 memblock_type_name(type), type->max * 2, (u64)addr,
411 (u64)addr + new_size - 1);
ea9e4376 412
fd07383b
AM
413 /*
414 * Found space, we now need to move the array over before we add the
415 * reserved region since it may be our reserved array itself that is
416 * full.
142b45a7
BH
417 */
418 memcpy(new_array, type->regions, old_size);
419 memset(new_array + type->max, 0, old_size);
420 old_array = type->regions;
421 type->regions = new_array;
422 type->max <<= 1;
423
fd07383b 424 /* Free old array. We needn't free it if the array is the static one */
181eb394
GS
425 if (*in_slab)
426 kfree(old_array);
427 else if (old_array != memblock_memory_init_regions &&
428 old_array != memblock_reserved_init_regions)
29f67386 429 memblock_free(__pa(old_array), old_alloc_size);
142b45a7 430
fd07383b
AM
431 /*
432 * Reserve the new array if that comes from the memblock. Otherwise, we
433 * needn't do it
181eb394
GS
434 */
435 if (!use_slab)
29f67386 436 BUG_ON(memblock_reserve(addr, new_alloc_size));
181eb394
GS
437
438 /* Update slab flag */
439 *in_slab = use_slab;
440
142b45a7
BH
441 return 0;
442}
443
784656f9
TH
444/**
445 * memblock_merge_regions - merge neighboring compatible regions
446 * @type: memblock type to scan
447 *
448 * Scan @type and merge neighboring compatible regions.
449 */
450static void __init_memblock memblock_merge_regions(struct memblock_type *type)
95f72d1e 451{
784656f9 452 int i = 0;
95f72d1e 453
784656f9
TH
454 /* cnt never goes below 1 */
455 while (i < type->cnt - 1) {
456 struct memblock_region *this = &type->regions[i];
457 struct memblock_region *next = &type->regions[i + 1];
95f72d1e 458
7c0caeb8
TH
459 if (this->base + this->size != next->base ||
460 memblock_get_region_node(this) !=
66a20757
TC
461 memblock_get_region_node(next) ||
462 this->flags != next->flags) {
784656f9
TH
463 BUG_ON(this->base + this->size > next->base);
464 i++;
465 continue;
8f7a6605
BH
466 }
467
784656f9 468 this->size += next->size;
c0232ae8
LF
469 /* move forward from next + 1, index of which is i + 2 */
470 memmove(next, next + 1, (type->cnt - (i + 2)) * sizeof(*next));
784656f9 471 type->cnt--;
95f72d1e 472 }
784656f9 473}
95f72d1e 474
784656f9
TH
475/**
476 * memblock_insert_region - insert new memblock region
209ff86d
TC
477 * @type: memblock type to insert into
478 * @idx: index for the insertion point
479 * @base: base address of the new region
480 * @size: size of the new region
481 * @nid: node id of the new region
66a20757 482 * @flags: flags of the new region
784656f9
TH
483 *
484 * Insert new memblock region [@base,@base+@size) into @type at @idx.
412d0008 485 * @type must already have extra room to accommodate the new region.
784656f9
TH
486 */
487static void __init_memblock memblock_insert_region(struct memblock_type *type,
488 int idx, phys_addr_t base,
66a20757
TC
489 phys_addr_t size,
490 int nid, unsigned long flags)
784656f9
TH
491{
492 struct memblock_region *rgn = &type->regions[idx];
493
494 BUG_ON(type->cnt >= type->max);
495 memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn));
496 rgn->base = base;
497 rgn->size = size;
66a20757 498 rgn->flags = flags;
7c0caeb8 499 memblock_set_region_node(rgn, nid);
784656f9 500 type->cnt++;
1440c4e2 501 type->total_size += size;
784656f9
TH
502}
503
504/**
f1af9d3a 505 * memblock_add_range - add new memblock region
784656f9
TH
506 * @type: memblock type to add new region into
507 * @base: base address of the new region
508 * @size: size of the new region
7fb0bc3f 509 * @nid: nid of the new region
66a20757 510 * @flags: flags of the new region
784656f9
TH
511 *
512 * Add new memblock region [@base,@base+@size) into @type. The new region
513 * is allowed to overlap with existing ones - overlaps don't affect already
514 * existing regions. @type is guaranteed to be minimal (all neighbouring
515 * compatible regions are merged) after the addition.
516 *
517 * RETURNS:
518 * 0 on success, -errno on failure.
519 */
f1af9d3a 520int __init_memblock memblock_add_range(struct memblock_type *type,
66a20757
TC
521 phys_addr_t base, phys_addr_t size,
522 int nid, unsigned long flags)
784656f9
TH
523{
524 bool insert = false;
eb18f1b5
TH
525 phys_addr_t obase = base;
526 phys_addr_t end = base + memblock_cap_size(base, &size);
8c9c1701
AK
527 int idx, nr_new;
528 struct memblock_region *rgn;
784656f9 529
b3dc627c
TH
530 if (!size)
531 return 0;
532
784656f9
TH
533 /* special case for empty array */
534 if (type->regions[0].size == 0) {
1440c4e2 535 WARN_ON(type->cnt != 1 || type->total_size);
8f7a6605
BH
536 type->regions[0].base = base;
537 type->regions[0].size = size;
66a20757 538 type->regions[0].flags = flags;
7fb0bc3f 539 memblock_set_region_node(&type->regions[0], nid);
1440c4e2 540 type->total_size = size;
8f7a6605 541 return 0;
95f72d1e 542 }
784656f9
TH
543repeat:
544 /*
545 * The following is executed twice. Once with %false @insert and
546 * then with %true. The first counts the number of regions needed
412d0008 547 * to accommodate the new area. The second actually inserts them.
142b45a7 548 */
784656f9
TH
549 base = obase;
550 nr_new = 0;
95f72d1e 551
8c9c1701 552 for_each_memblock_type(type, rgn) {
784656f9
TH
553 phys_addr_t rbase = rgn->base;
554 phys_addr_t rend = rbase + rgn->size;
555
556 if (rbase >= end)
95f72d1e 557 break;
784656f9
TH
558 if (rend <= base)
559 continue;
560 /*
561 * @rgn overlaps. If it separates the lower part of new
562 * area, insert that portion.
563 */
564 if (rbase > base) {
c0a29498
WY
565#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
566 WARN_ON(nid != memblock_get_region_node(rgn));
567#endif
4fcab5f4 568 WARN_ON(flags != rgn->flags);
784656f9
TH
569 nr_new++;
570 if (insert)
8c9c1701 571 memblock_insert_region(type, idx++, base,
66a20757
TC
572 rbase - base, nid,
573 flags);
95f72d1e 574 }
784656f9
TH
575 /* area below @rend is dealt with, forget about it */
576 base = min(rend, end);
95f72d1e 577 }
784656f9
TH
578
579 /* insert the remaining portion */
580 if (base < end) {
581 nr_new++;
582 if (insert)
8c9c1701 583 memblock_insert_region(type, idx, base, end - base,
66a20757 584 nid, flags);
95f72d1e 585 }
95f72d1e 586
ef3cc4db 587 if (!nr_new)
588 return 0;
589
784656f9
TH
590 /*
591 * If this was the first round, resize array and repeat for actual
592 * insertions; otherwise, merge and return.
142b45a7 593 */
784656f9
TH
594 if (!insert) {
595 while (type->cnt + nr_new > type->max)
48c3b583 596 if (memblock_double_array(type, obase, size) < 0)
784656f9
TH
597 return -ENOMEM;
598 insert = true;
599 goto repeat;
600 } else {
601 memblock_merge_regions(type);
602 return 0;
142b45a7 603 }
95f72d1e
YL
604}
605
7fb0bc3f
TH
606int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size,
607 int nid)
608{
f1af9d3a 609 return memblock_add_range(&memblock.memory, base, size, nid, 0);
7fb0bc3f
TH
610}
611
f705ac4b 612int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size)
6a4055bc 613{
6a4055bc
AK
614 memblock_dbg("memblock_add: [%#016llx-%#016llx] flags %#02lx %pF\n",
615 (unsigned long long)base,
616 (unsigned long long)base + size - 1,
f705ac4b 617 0UL, (void *)_RET_IP_);
6a4055bc 618
f705ac4b 619 return memblock_add_range(&memblock.memory, base, size, MAX_NUMNODES, 0);
95f72d1e
YL
620}
621
6a9ceb31
TH
622/**
623 * memblock_isolate_range - isolate given range into disjoint memblocks
624 * @type: memblock type to isolate range for
625 * @base: base of range to isolate
626 * @size: size of range to isolate
627 * @start_rgn: out parameter for the start of isolated region
628 * @end_rgn: out parameter for the end of isolated region
629 *
630 * Walk @type and ensure that regions don't cross the boundaries defined by
631 * [@base,@base+@size). Crossing regions are split at the boundaries,
632 * which may create at most two more regions. The index of the first
633 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
634 *
635 * RETURNS:
636 * 0 on success, -errno on failure.
637 */
638static int __init_memblock memblock_isolate_range(struct memblock_type *type,
639 phys_addr_t base, phys_addr_t size,
640 int *start_rgn, int *end_rgn)
641{
eb18f1b5 642 phys_addr_t end = base + memblock_cap_size(base, &size);
8c9c1701
AK
643 int idx;
644 struct memblock_region *rgn;
6a9ceb31
TH
645
646 *start_rgn = *end_rgn = 0;
647
b3dc627c
TH
648 if (!size)
649 return 0;
650
6a9ceb31
TH
651 /* we'll create at most two more regions */
652 while (type->cnt + 2 > type->max)
48c3b583 653 if (memblock_double_array(type, base, size) < 0)
6a9ceb31
TH
654 return -ENOMEM;
655
8c9c1701 656 for_each_memblock_type(type, rgn) {
6a9ceb31
TH
657 phys_addr_t rbase = rgn->base;
658 phys_addr_t rend = rbase + rgn->size;
659
660 if (rbase >= end)
661 break;
662 if (rend <= base)
663 continue;
664
665 if (rbase < base) {
666 /*
667 * @rgn intersects from below. Split and continue
668 * to process the next region - the new top half.
669 */
670 rgn->base = base;
1440c4e2
TH
671 rgn->size -= base - rbase;
672 type->total_size -= base - rbase;
8c9c1701 673 memblock_insert_region(type, idx, rbase, base - rbase,
66a20757
TC
674 memblock_get_region_node(rgn),
675 rgn->flags);
6a9ceb31
TH
676 } else if (rend > end) {
677 /*
678 * @rgn intersects from above. Split and redo the
679 * current region - the new bottom half.
680 */
681 rgn->base = end;
1440c4e2
TH
682 rgn->size -= end - rbase;
683 type->total_size -= end - rbase;
8c9c1701 684 memblock_insert_region(type, idx--, rbase, end - rbase,
66a20757
TC
685 memblock_get_region_node(rgn),
686 rgn->flags);
6a9ceb31
TH
687 } else {
688 /* @rgn is fully contained, record it */
689 if (!*end_rgn)
8c9c1701
AK
690 *start_rgn = idx;
691 *end_rgn = idx + 1;
6a9ceb31
TH
692 }
693 }
694
695 return 0;
696}
6a9ceb31 697
35bd16a2 698static int __init_memblock memblock_remove_range(struct memblock_type *type,
f1af9d3a 699 phys_addr_t base, phys_addr_t size)
95f72d1e 700{
71936180
TH
701 int start_rgn, end_rgn;
702 int i, ret;
95f72d1e 703
71936180
TH
704 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
705 if (ret)
706 return ret;
95f72d1e 707
71936180
TH
708 for (i = end_rgn - 1; i >= start_rgn; i--)
709 memblock_remove_region(type, i);
8f7a6605 710 return 0;
95f72d1e
YL
711}
712
581adcbe 713int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size)
95f72d1e 714{
f1af9d3a 715 return memblock_remove_range(&memblock.memory, base, size);
95f72d1e
YL
716}
717
f1af9d3a 718
581adcbe 719int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size)
95f72d1e 720{
24aa0788 721 memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n",
a150439c 722 (unsigned long long)base,
931d13f5 723 (unsigned long long)base + size - 1,
a150439c 724 (void *)_RET_IP_);
24aa0788 725
9099daed 726 kmemleak_free_part_phys(base, size);
f1af9d3a 727 return memblock_remove_range(&memblock.reserved, base, size);
95f72d1e
YL
728}
729
f705ac4b 730int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size)
95f72d1e 731{
66a20757 732 memblock_dbg("memblock_reserve: [%#016llx-%#016llx] flags %#02lx %pF\n",
a150439c 733 (unsigned long long)base,
931d13f5 734 (unsigned long long)base + size - 1,
f705ac4b 735 0UL, (void *)_RET_IP_);
95f72d1e 736
f705ac4b 737 return memblock_add_range(&memblock.reserved, base, size, MAX_NUMNODES, 0);
95f72d1e
YL
738}
739
66b16edf 740/**
66b16edf 741 *
4308ce17 742 * This function isolates region [@base, @base + @size), and sets/clears flag
66b16edf 743 *
c1153931 744 * Return 0 on success, -errno on failure.
66b16edf 745 */
4308ce17
TL
746static int __init_memblock memblock_setclr_flag(phys_addr_t base,
747 phys_addr_t size, int set, int flag)
66b16edf
TC
748{
749 struct memblock_type *type = &memblock.memory;
750 int i, ret, start_rgn, end_rgn;
751
752 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
753 if (ret)
754 return ret;
755
756 for (i = start_rgn; i < end_rgn; i++)
4308ce17
TL
757 if (set)
758 memblock_set_region_flags(&type->regions[i], flag);
759 else
760 memblock_clear_region_flags(&type->regions[i], flag);
66b16edf
TC
761
762 memblock_merge_regions(type);
763 return 0;
764}
765
766/**
4308ce17 767 * memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG.
66b16edf
TC
768 * @base: the base phys addr of the region
769 * @size: the size of the region
770 *
c1153931 771 * Return 0 on success, -errno on failure.
4308ce17
TL
772 */
773int __init_memblock memblock_mark_hotplug(phys_addr_t base, phys_addr_t size)
774{
775 return memblock_setclr_flag(base, size, 1, MEMBLOCK_HOTPLUG);
776}
777
778/**
779 * memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region.
780 * @base: the base phys addr of the region
781 * @size: the size of the region
66b16edf 782 *
c1153931 783 * Return 0 on success, -errno on failure.
66b16edf
TC
784 */
785int __init_memblock memblock_clear_hotplug(phys_addr_t base, phys_addr_t size)
786{
4308ce17 787 return memblock_setclr_flag(base, size, 0, MEMBLOCK_HOTPLUG);
66b16edf
TC
788}
789
a3f5bafc
TL
790/**
791 * memblock_mark_mirror - Mark mirrored memory with flag MEMBLOCK_MIRROR.
792 * @base: the base phys addr of the region
793 * @size: the size of the region
794 *
c1153931 795 * Return 0 on success, -errno on failure.
a3f5bafc
TL
796 */
797int __init_memblock memblock_mark_mirror(phys_addr_t base, phys_addr_t size)
798{
799 system_has_some_mirror = true;
800
801 return memblock_setclr_flag(base, size, 1, MEMBLOCK_MIRROR);
802}
803
bf3d3cc5
AB
804/**
805 * memblock_mark_nomap - Mark a memory region with flag MEMBLOCK_NOMAP.
806 * @base: the base phys addr of the region
807 * @size: the size of the region
808 *
809 * Return 0 on success, -errno on failure.
810 */
811int __init_memblock memblock_mark_nomap(phys_addr_t base, phys_addr_t size)
812{
813 return memblock_setclr_flag(base, size, 1, MEMBLOCK_NOMAP);
814}
a3f5bafc 815
8e7a7f86
RH
816/**
817 * __next_reserved_mem_region - next function for for_each_reserved_region()
818 * @idx: pointer to u64 loop variable
819 * @out_start: ptr to phys_addr_t for start address of the region, can be %NULL
820 * @out_end: ptr to phys_addr_t for end address of the region, can be %NULL
821 *
822 * Iterate over all reserved memory regions.
823 */
824void __init_memblock __next_reserved_mem_region(u64 *idx,
825 phys_addr_t *out_start,
826 phys_addr_t *out_end)
827{
567d117b 828 struct memblock_type *type = &memblock.reserved;
8e7a7f86 829
cd33a76b 830 if (*idx < type->cnt) {
567d117b 831 struct memblock_region *r = &type->regions[*idx];
8e7a7f86
RH
832 phys_addr_t base = r->base;
833 phys_addr_t size = r->size;
834
835 if (out_start)
836 *out_start = base;
837 if (out_end)
838 *out_end = base + size - 1;
839
840 *idx += 1;
841 return;
842 }
843
844 /* signal end of iteration */
845 *idx = ULLONG_MAX;
846}
847
35fd0808 848/**
f1af9d3a 849 * __next__mem_range - next function for for_each_free_mem_range() etc.
35fd0808 850 * @idx: pointer to u64 loop variable
b1154233 851 * @nid: node selector, %NUMA_NO_NODE for all nodes
fc6daaf9 852 * @flags: pick from blocks based on memory attributes
f1af9d3a
PH
853 * @type_a: pointer to memblock_type from where the range is taken
854 * @type_b: pointer to memblock_type which excludes memory from being taken
dad7557e
WL
855 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
856 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
857 * @out_nid: ptr to int for nid of the range, can be %NULL
35fd0808 858 *
f1af9d3a 859 * Find the first area from *@idx which matches @nid, fill the out
35fd0808 860 * parameters, and update *@idx for the next iteration. The lower 32bit of
f1af9d3a
PH
861 * *@idx contains index into type_a and the upper 32bit indexes the
862 * areas before each region in type_b. For example, if type_b regions
35fd0808
TH
863 * look like the following,
864 *
865 * 0:[0-16), 1:[32-48), 2:[128-130)
866 *
867 * The upper 32bit indexes the following regions.
868 *
869 * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX)
870 *
871 * As both region arrays are sorted, the function advances the two indices
872 * in lockstep and returns each intersection.
873 */
fc6daaf9 874void __init_memblock __next_mem_range(u64 *idx, int nid, ulong flags,
f1af9d3a
PH
875 struct memblock_type *type_a,
876 struct memblock_type *type_b,
877 phys_addr_t *out_start,
878 phys_addr_t *out_end, int *out_nid)
35fd0808 879{
f1af9d3a
PH
880 int idx_a = *idx & 0xffffffff;
881 int idx_b = *idx >> 32;
b1154233 882
f1af9d3a
PH
883 if (WARN_ONCE(nid == MAX_NUMNODES,
884 "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
560dca27 885 nid = NUMA_NO_NODE;
35fd0808 886
f1af9d3a
PH
887 for (; idx_a < type_a->cnt; idx_a++) {
888 struct memblock_region *m = &type_a->regions[idx_a];
889
35fd0808
TH
890 phys_addr_t m_start = m->base;
891 phys_addr_t m_end = m->base + m->size;
f1af9d3a 892 int m_nid = memblock_get_region_node(m);
35fd0808
TH
893
894 /* only memory regions are associated with nodes, check it */
f1af9d3a 895 if (nid != NUMA_NO_NODE && nid != m_nid)
35fd0808
TH
896 continue;
897
0a313a99
XQ
898 /* skip hotpluggable memory regions if needed */
899 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
900 continue;
901
a3f5bafc
TL
902 /* if we want mirror memory skip non-mirror memory regions */
903 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
904 continue;
905
bf3d3cc5
AB
906 /* skip nomap memory unless we were asked for it explicitly */
907 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
908 continue;
909
f1af9d3a
PH
910 if (!type_b) {
911 if (out_start)
912 *out_start = m_start;
913 if (out_end)
914 *out_end = m_end;
915 if (out_nid)
916 *out_nid = m_nid;
917 idx_a++;
918 *idx = (u32)idx_a | (u64)idx_b << 32;
919 return;
920 }
921
922 /* scan areas before each reservation */
923 for (; idx_b < type_b->cnt + 1; idx_b++) {
924 struct memblock_region *r;
925 phys_addr_t r_start;
926 phys_addr_t r_end;
927
928 r = &type_b->regions[idx_b];
929 r_start = idx_b ? r[-1].base + r[-1].size : 0;
930 r_end = idx_b < type_b->cnt ?
931 r->base : ULLONG_MAX;
35fd0808 932
f1af9d3a
PH
933 /*
934 * if idx_b advanced past idx_a,
935 * break out to advance idx_a
936 */
35fd0808
TH
937 if (r_start >= m_end)
938 break;
939 /* if the two regions intersect, we're done */
940 if (m_start < r_end) {
941 if (out_start)
f1af9d3a
PH
942 *out_start =
943 max(m_start, r_start);
35fd0808
TH
944 if (out_end)
945 *out_end = min(m_end, r_end);
946 if (out_nid)
f1af9d3a 947 *out_nid = m_nid;
35fd0808 948 /*
f1af9d3a
PH
949 * The region which ends first is
950 * advanced for the next iteration.
35fd0808
TH
951 */
952 if (m_end <= r_end)
f1af9d3a 953 idx_a++;
35fd0808 954 else
f1af9d3a
PH
955 idx_b++;
956 *idx = (u32)idx_a | (u64)idx_b << 32;
35fd0808
TH
957 return;
958 }
959 }
960 }
961
962 /* signal end of iteration */
963 *idx = ULLONG_MAX;
964}
965
7bd0b0f0 966/**
f1af9d3a
PH
967 * __next_mem_range_rev - generic next function for for_each_*_range_rev()
968 *
969 * Finds the next range from type_a which is not marked as unsuitable
970 * in type_b.
971 *
7bd0b0f0 972 * @idx: pointer to u64 loop variable
ad5ea8cd 973 * @nid: node selector, %NUMA_NO_NODE for all nodes
fc6daaf9 974 * @flags: pick from blocks based on memory attributes
f1af9d3a
PH
975 * @type_a: pointer to memblock_type from where the range is taken
976 * @type_b: pointer to memblock_type which excludes memory from being taken
dad7557e
WL
977 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
978 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
979 * @out_nid: ptr to int for nid of the range, can be %NULL
7bd0b0f0 980 *
f1af9d3a 981 * Reverse of __next_mem_range().
7bd0b0f0 982 */
fc6daaf9 983void __init_memblock __next_mem_range_rev(u64 *idx, int nid, ulong flags,
f1af9d3a
PH
984 struct memblock_type *type_a,
985 struct memblock_type *type_b,
986 phys_addr_t *out_start,
987 phys_addr_t *out_end, int *out_nid)
7bd0b0f0 988{
f1af9d3a
PH
989 int idx_a = *idx & 0xffffffff;
990 int idx_b = *idx >> 32;
b1154233 991
560dca27
GS
992 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
993 nid = NUMA_NO_NODE;
7bd0b0f0
TH
994
995 if (*idx == (u64)ULLONG_MAX) {
f1af9d3a 996 idx_a = type_a->cnt - 1;
e47608ab 997 if (type_b != NULL)
998 idx_b = type_b->cnt;
999 else
1000 idx_b = 0;
7bd0b0f0
TH
1001 }
1002
f1af9d3a
PH
1003 for (; idx_a >= 0; idx_a--) {
1004 struct memblock_region *m = &type_a->regions[idx_a];
1005
7bd0b0f0
TH
1006 phys_addr_t m_start = m->base;
1007 phys_addr_t m_end = m->base + m->size;
f1af9d3a 1008 int m_nid = memblock_get_region_node(m);
7bd0b0f0
TH
1009
1010 /* only memory regions are associated with nodes, check it */
f1af9d3a 1011 if (nid != NUMA_NO_NODE && nid != m_nid)
7bd0b0f0
TH
1012 continue;
1013
55ac590c
TC
1014 /* skip hotpluggable memory regions if needed */
1015 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
1016 continue;
1017
a3f5bafc
TL
1018 /* if we want mirror memory skip non-mirror memory regions */
1019 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
1020 continue;
1021
bf3d3cc5
AB
1022 /* skip nomap memory unless we were asked for it explicitly */
1023 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
1024 continue;
1025
f1af9d3a
PH
1026 if (!type_b) {
1027 if (out_start)
1028 *out_start = m_start;
1029 if (out_end)
1030 *out_end = m_end;
1031 if (out_nid)
1032 *out_nid = m_nid;
fb399b48 1033 idx_a--;
f1af9d3a
PH
1034 *idx = (u32)idx_a | (u64)idx_b << 32;
1035 return;
1036 }
1037
1038 /* scan areas before each reservation */
1039 for (; idx_b >= 0; idx_b--) {
1040 struct memblock_region *r;
1041 phys_addr_t r_start;
1042 phys_addr_t r_end;
1043
1044 r = &type_b->regions[idx_b];
1045 r_start = idx_b ? r[-1].base + r[-1].size : 0;
1046 r_end = idx_b < type_b->cnt ?
1047 r->base : ULLONG_MAX;
1048 /*
1049 * if idx_b advanced past idx_a,
1050 * break out to advance idx_a
1051 */
7bd0b0f0 1052
7bd0b0f0
TH
1053 if (r_end <= m_start)
1054 break;
1055 /* if the two regions intersect, we're done */
1056 if (m_end > r_start) {
1057 if (out_start)
1058 *out_start = max(m_start, r_start);
1059 if (out_end)
1060 *out_end = min(m_end, r_end);
1061 if (out_nid)
f1af9d3a 1062 *out_nid = m_nid;
7bd0b0f0 1063 if (m_start >= r_start)
f1af9d3a 1064 idx_a--;
7bd0b0f0 1065 else
f1af9d3a
PH
1066 idx_b--;
1067 *idx = (u32)idx_a | (u64)idx_b << 32;
7bd0b0f0
TH
1068 return;
1069 }
1070 }
1071 }
f1af9d3a 1072 /* signal end of iteration */
7bd0b0f0
TH
1073 *idx = ULLONG_MAX;
1074}
1075
7c0caeb8
TH
1076#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1077/*
1078 * Common iterator interface used to define for_each_mem_range().
1079 */
1080void __init_memblock __next_mem_pfn_range(int *idx, int nid,
1081 unsigned long *out_start_pfn,
1082 unsigned long *out_end_pfn, int *out_nid)
1083{
1084 struct memblock_type *type = &memblock.memory;
1085 struct memblock_region *r;
1086
1087 while (++*idx < type->cnt) {
1088 r = &type->regions[*idx];
1089
1090 if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size))
1091 continue;
1092 if (nid == MAX_NUMNODES || nid == r->nid)
1093 break;
1094 }
1095 if (*idx >= type->cnt) {
1096 *idx = -1;
1097 return;
1098 }
1099
1100 if (out_start_pfn)
1101 *out_start_pfn = PFN_UP(r->base);
1102 if (out_end_pfn)
1103 *out_end_pfn = PFN_DOWN(r->base + r->size);
1104 if (out_nid)
1105 *out_nid = r->nid;
1106}
1107
b92df1de
PB
1108unsigned long __init_memblock memblock_next_valid_pfn(unsigned long pfn,
1109 unsigned long max_pfn)
1110{
1111 struct memblock_type *type = &memblock.memory;
1112 unsigned int right = type->cnt;
1113 unsigned int mid, left = 0;
1114 phys_addr_t addr = PFN_PHYS(pfn + 1);
1115
1116 do {
1117 mid = (right + left) / 2;
1118
1119 if (addr < type->regions[mid].base)
1120 right = mid;
1121 else if (addr >= (type->regions[mid].base +
1122 type->regions[mid].size))
1123 left = mid + 1;
1124 else {
1125 /* addr is within the region, so pfn + 1 is valid */
1126 return min(pfn + 1, max_pfn);
1127 }
1128 } while (left < right);
1129
1130 return min(PHYS_PFN(type->regions[right].base), max_pfn);
1131}
1132
7c0caeb8
TH
1133/**
1134 * memblock_set_node - set node ID on memblock regions
1135 * @base: base of area to set node ID for
1136 * @size: size of area to set node ID for
e7e8de59 1137 * @type: memblock type to set node ID for
7c0caeb8
TH
1138 * @nid: node ID to set
1139 *
e7e8de59 1140 * Set the nid of memblock @type regions in [@base,@base+@size) to @nid.
7c0caeb8
TH
1141 * Regions which cross the area boundaries are split as necessary.
1142 *
1143 * RETURNS:
1144 * 0 on success, -errno on failure.
1145 */
1146int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size,
e7e8de59 1147 struct memblock_type *type, int nid)
7c0caeb8 1148{
6a9ceb31
TH
1149 int start_rgn, end_rgn;
1150 int i, ret;
7c0caeb8 1151
6a9ceb31
TH
1152 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
1153 if (ret)
1154 return ret;
7c0caeb8 1155
6a9ceb31 1156 for (i = start_rgn; i < end_rgn; i++)
e9d24ad3 1157 memblock_set_region_node(&type->regions[i], nid);
7c0caeb8
TH
1158
1159 memblock_merge_regions(type);
1160 return 0;
1161}
1162#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
1163
2bfc2862
AM
1164static phys_addr_t __init memblock_alloc_range_nid(phys_addr_t size,
1165 phys_addr_t align, phys_addr_t start,
fc6daaf9 1166 phys_addr_t end, int nid, ulong flags)
95f72d1e 1167{
6ed311b2 1168 phys_addr_t found;
95f72d1e 1169
79f40fab
GS
1170 if (!align)
1171 align = SMP_CACHE_BYTES;
94f3d3af 1172
fc6daaf9
TL
1173 found = memblock_find_in_range_node(size, align, start, end, nid,
1174 flags);
aedf95ea
CM
1175 if (found && !memblock_reserve(found, size)) {
1176 /*
1177 * The min_count is set to 0 so that memblock allocations are
1178 * never reported as leaks.
1179 */
9099daed 1180 kmemleak_alloc_phys(found, size, 0, 0);
6ed311b2 1181 return found;
aedf95ea 1182 }
6ed311b2 1183 return 0;
95f72d1e
YL
1184}
1185
2bfc2862 1186phys_addr_t __init memblock_alloc_range(phys_addr_t size, phys_addr_t align,
fc6daaf9
TL
1187 phys_addr_t start, phys_addr_t end,
1188 ulong flags)
2bfc2862 1189{
fc6daaf9
TL
1190 return memblock_alloc_range_nid(size, align, start, end, NUMA_NO_NODE,
1191 flags);
2bfc2862
AM
1192}
1193
1194static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size,
1195 phys_addr_t align, phys_addr_t max_addr,
fc6daaf9 1196 int nid, ulong flags)
2bfc2862 1197{
fc6daaf9 1198 return memblock_alloc_range_nid(size, align, 0, max_addr, nid, flags);
2bfc2862
AM
1199}
1200
7bd0b0f0
TH
1201phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid)
1202{
a3f5bafc
TL
1203 ulong flags = choose_memblock_flags();
1204 phys_addr_t ret;
1205
1206again:
1207 ret = memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE,
1208 nid, flags);
1209
1210 if (!ret && (flags & MEMBLOCK_MIRROR)) {
1211 flags &= ~MEMBLOCK_MIRROR;
1212 goto again;
1213 }
1214 return ret;
7bd0b0f0
TH
1215}
1216
1217phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
1218{
fc6daaf9
TL
1219 return memblock_alloc_base_nid(size, align, max_addr, NUMA_NO_NODE,
1220 MEMBLOCK_NONE);
7bd0b0f0
TH
1221}
1222
6ed311b2 1223phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
95f72d1e 1224{
6ed311b2
BH
1225 phys_addr_t alloc;
1226
1227 alloc = __memblock_alloc_base(size, align, max_addr);
1228
1229 if (alloc == 0)
1230 panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n",
1231 (unsigned long long) size, (unsigned long long) max_addr);
1232
1233 return alloc;
95f72d1e
YL
1234}
1235
6ed311b2 1236phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align)
95f72d1e 1237{
6ed311b2
BH
1238 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
1239}
95f72d1e 1240
9d1e2492
BH
1241phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid)
1242{
1243 phys_addr_t res = memblock_alloc_nid(size, align, nid);
1244
1245 if (res)
1246 return res;
15fb0972 1247 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
95f72d1e
YL
1248}
1249
26f09e9b
SS
1250/**
1251 * memblock_virt_alloc_internal - allocate boot memory block
1252 * @size: size of memory block to be allocated in bytes
1253 * @align: alignment of the region and block's size
1254 * @min_addr: the lower bound of the memory region to allocate (phys address)
1255 * @max_addr: the upper bound of the memory region to allocate (phys address)
1256 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1257 *
1258 * The @min_addr limit is dropped if it can not be satisfied and the allocation
1259 * will fall back to memory below @min_addr. Also, allocation may fall back
1260 * to any node in the system if the specified node can not
1261 * hold the requested memory.
1262 *
1263 * The allocation is performed from memory region limited by
1264 * memblock.current_limit if @max_addr == %BOOTMEM_ALLOC_ACCESSIBLE.
1265 *
1266 * The memory block is aligned on SMP_CACHE_BYTES if @align == 0.
1267 *
1268 * The phys address of allocated boot memory block is converted to virtual and
1269 * allocated memory is reset to 0.
1270 *
1271 * In addition, function sets the min_count to 0 using kmemleak_alloc for
1272 * allocated boot memory block, so that it is never reported as leaks.
1273 *
1274 * RETURNS:
1275 * Virtual address of allocated memory block on success, NULL on failure.
1276 */
1277static void * __init memblock_virt_alloc_internal(
1278 phys_addr_t size, phys_addr_t align,
1279 phys_addr_t min_addr, phys_addr_t max_addr,
1280 int nid)
1281{
1282 phys_addr_t alloc;
1283 void *ptr;
a3f5bafc 1284 ulong flags = choose_memblock_flags();
26f09e9b 1285
560dca27
GS
1286 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
1287 nid = NUMA_NO_NODE;
26f09e9b
SS
1288
1289 /*
1290 * Detect any accidental use of these APIs after slab is ready, as at
1291 * this moment memblock may be deinitialized already and its
1292 * internal data may be destroyed (after execution of free_all_bootmem)
1293 */
1294 if (WARN_ON_ONCE(slab_is_available()))
1295 return kzalloc_node(size, GFP_NOWAIT, nid);
1296
1297 if (!align)
1298 align = SMP_CACHE_BYTES;
1299
f544e14f
YL
1300 if (max_addr > memblock.current_limit)
1301 max_addr = memblock.current_limit;
1302
26f09e9b
SS
1303again:
1304 alloc = memblock_find_in_range_node(size, align, min_addr, max_addr,
a3f5bafc 1305 nid, flags);
26f09e9b
SS
1306 if (alloc)
1307 goto done;
1308
1309 if (nid != NUMA_NO_NODE) {
1310 alloc = memblock_find_in_range_node(size, align, min_addr,
fc6daaf9 1311 max_addr, NUMA_NO_NODE,
a3f5bafc 1312 flags);
26f09e9b
SS
1313 if (alloc)
1314 goto done;
1315 }
1316
1317 if (min_addr) {
1318 min_addr = 0;
1319 goto again;
26f09e9b
SS
1320 }
1321
a3f5bafc
TL
1322 if (flags & MEMBLOCK_MIRROR) {
1323 flags &= ~MEMBLOCK_MIRROR;
1324 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
1325 &size);
1326 goto again;
1327 }
1328
1329 return NULL;
26f09e9b
SS
1330done:
1331 memblock_reserve(alloc, size);
1332 ptr = phys_to_virt(alloc);
1333 memset(ptr, 0, size);
1334
1335 /*
1336 * The min_count is set to 0 so that bootmem allocated blocks
1337 * are never reported as leaks. This is because many of these blocks
1338 * are only referred via the physical address which is not
1339 * looked up by kmemleak.
1340 */
1341 kmemleak_alloc(ptr, size, 0, 0);
1342
1343 return ptr;
26f09e9b
SS
1344}
1345
1346/**
1347 * memblock_virt_alloc_try_nid_nopanic - allocate boot memory block
1348 * @size: size of memory block to be allocated in bytes
1349 * @align: alignment of the region and block's size
1350 * @min_addr: the lower bound of the memory region from where the allocation
1351 * is preferred (phys address)
1352 * @max_addr: the upper bound of the memory region from where the allocation
1353 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1354 * allocate only from memory limited by memblock.current_limit value
1355 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1356 *
1357 * Public version of _memblock_virt_alloc_try_nid_nopanic() which provides
1358 * additional debug information (including caller info), if enabled.
1359 *
1360 * RETURNS:
1361 * Virtual address of allocated memory block on success, NULL on failure.
1362 */
1363void * __init memblock_virt_alloc_try_nid_nopanic(
1364 phys_addr_t size, phys_addr_t align,
1365 phys_addr_t min_addr, phys_addr_t max_addr,
1366 int nid)
1367{
1368 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1369 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1370 (u64)max_addr, (void *)_RET_IP_);
1371 return memblock_virt_alloc_internal(size, align, min_addr,
1372 max_addr, nid);
1373}
1374
1375/**
1376 * memblock_virt_alloc_try_nid - allocate boot memory block with panicking
1377 * @size: size of memory block to be allocated in bytes
1378 * @align: alignment of the region and block's size
1379 * @min_addr: the lower bound of the memory region from where the allocation
1380 * is preferred (phys address)
1381 * @max_addr: the upper bound of the memory region from where the allocation
1382 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1383 * allocate only from memory limited by memblock.current_limit value
1384 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1385 *
1386 * Public panicking version of _memblock_virt_alloc_try_nid_nopanic()
1387 * which provides debug information (including caller info), if enabled,
1388 * and panics if the request can not be satisfied.
1389 *
1390 * RETURNS:
1391 * Virtual address of allocated memory block on success, NULL on failure.
1392 */
1393void * __init memblock_virt_alloc_try_nid(
1394 phys_addr_t size, phys_addr_t align,
1395 phys_addr_t min_addr, phys_addr_t max_addr,
1396 int nid)
1397{
1398 void *ptr;
1399
1400 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1401 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1402 (u64)max_addr, (void *)_RET_IP_);
1403 ptr = memblock_virt_alloc_internal(size, align,
1404 min_addr, max_addr, nid);
1405 if (ptr)
1406 return ptr;
1407
1408 panic("%s: Failed to allocate %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx\n",
1409 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1410 (u64)max_addr);
1411 return NULL;
1412}
1413
1414/**
1415 * __memblock_free_early - free boot memory block
1416 * @base: phys starting address of the boot memory block
1417 * @size: size of the boot memory block in bytes
1418 *
1419 * Free boot memory block previously allocated by memblock_virt_alloc_xx() API.
1420 * The freeing memory will not be released to the buddy allocator.
1421 */
1422void __init __memblock_free_early(phys_addr_t base, phys_addr_t size)
1423{
1424 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1425 __func__, (u64)base, (u64)base + size - 1,
1426 (void *)_RET_IP_);
9099daed 1427 kmemleak_free_part_phys(base, size);
f1af9d3a 1428 memblock_remove_range(&memblock.reserved, base, size);
26f09e9b
SS
1429}
1430
1431/*
1432 * __memblock_free_late - free bootmem block pages directly to buddy allocator
1433 * @addr: phys starting address of the boot memory block
1434 * @size: size of the boot memory block in bytes
1435 *
1436 * This is only useful when the bootmem allocator has already been torn
1437 * down, but we are still initializing the system. Pages are released directly
1438 * to the buddy allocator, no bootmem metadata is updated because it is gone.
1439 */
1440void __init __memblock_free_late(phys_addr_t base, phys_addr_t size)
1441{
1442 u64 cursor, end;
1443
1444 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1445 __func__, (u64)base, (u64)base + size - 1,
1446 (void *)_RET_IP_);
9099daed 1447 kmemleak_free_part_phys(base, size);
26f09e9b
SS
1448 cursor = PFN_UP(base);
1449 end = PFN_DOWN(base + size);
1450
1451 for (; cursor < end; cursor++) {
d70ddd7a 1452 __free_pages_bootmem(pfn_to_page(cursor), cursor, 0);
26f09e9b
SS
1453 totalram_pages++;
1454 }
1455}
9d1e2492
BH
1456
1457/*
1458 * Remaining API functions
1459 */
1460
1f1ffb8a 1461phys_addr_t __init_memblock memblock_phys_mem_size(void)
95f72d1e 1462{
1440c4e2 1463 return memblock.memory.total_size;
95f72d1e
YL
1464}
1465
8907de5d
SD
1466phys_addr_t __init_memblock memblock_reserved_size(void)
1467{
1468 return memblock.reserved.total_size;
1469}
1470
595ad9af
YL
1471phys_addr_t __init memblock_mem_size(unsigned long limit_pfn)
1472{
1473 unsigned long pages = 0;
1474 struct memblock_region *r;
1475 unsigned long start_pfn, end_pfn;
1476
1477 for_each_memblock(memory, r) {
1478 start_pfn = memblock_region_memory_base_pfn(r);
1479 end_pfn = memblock_region_memory_end_pfn(r);
1480 start_pfn = min_t(unsigned long, start_pfn, limit_pfn);
1481 end_pfn = min_t(unsigned long, end_pfn, limit_pfn);
1482 pages += end_pfn - start_pfn;
1483 }
1484
16763230 1485 return PFN_PHYS(pages);
595ad9af
YL
1486}
1487
0a93ebef
SR
1488/* lowest address */
1489phys_addr_t __init_memblock memblock_start_of_DRAM(void)
1490{
1491 return memblock.memory.regions[0].base;
1492}
1493
10d06439 1494phys_addr_t __init_memblock memblock_end_of_DRAM(void)
95f72d1e
YL
1495{
1496 int idx = memblock.memory.cnt - 1;
1497
e3239ff9 1498 return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
95f72d1e
YL
1499}
1500
a571d4eb 1501static phys_addr_t __init_memblock __find_max_addr(phys_addr_t limit)
95f72d1e 1502{
c0ce8fef 1503 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
136199f0 1504 struct memblock_region *r;
95f72d1e 1505
a571d4eb
DC
1506 /*
1507 * translate the memory @limit size into the max address within one of
1508 * the memory memblock regions, if the @limit exceeds the total size
1509 * of those regions, max_addr will keep original value ULLONG_MAX
1510 */
136199f0 1511 for_each_memblock(memory, r) {
c0ce8fef
TH
1512 if (limit <= r->size) {
1513 max_addr = r->base + limit;
1514 break;
95f72d1e 1515 }
c0ce8fef 1516 limit -= r->size;
95f72d1e 1517 }
c0ce8fef 1518
a571d4eb
DC
1519 return max_addr;
1520}
1521
1522void __init memblock_enforce_memory_limit(phys_addr_t limit)
1523{
1524 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
1525
1526 if (!limit)
1527 return;
1528
1529 max_addr = __find_max_addr(limit);
1530
1531 /* @limit exceeds the total size of the memory, do nothing */
1532 if (max_addr == (phys_addr_t)ULLONG_MAX)
1533 return;
1534
c0ce8fef 1535 /* truncate both memory and reserved regions */
f1af9d3a
PH
1536 memblock_remove_range(&memblock.memory, max_addr,
1537 (phys_addr_t)ULLONG_MAX);
1538 memblock_remove_range(&memblock.reserved, max_addr,
1539 (phys_addr_t)ULLONG_MAX);
95f72d1e
YL
1540}
1541
a571d4eb
DC
1542void __init memblock_mem_limit_remove_map(phys_addr_t limit)
1543{
1544 struct memblock_type *type = &memblock.memory;
1545 phys_addr_t max_addr;
1546 int i, ret, start_rgn, end_rgn;
1547
1548 if (!limit)
1549 return;
1550
1551 max_addr = __find_max_addr(limit);
1552
1553 /* @limit exceeds the total size of the memory, do nothing */
1554 if (max_addr == (phys_addr_t)ULLONG_MAX)
1555 return;
1556
1557 ret = memblock_isolate_range(type, max_addr, (phys_addr_t)ULLONG_MAX,
1558 &start_rgn, &end_rgn);
1559 if (ret)
1560 return;
1561
1562 /* remove all the MAP regions above the limit */
1563 for (i = end_rgn - 1; i >= start_rgn; i--) {
1564 if (!memblock_is_nomap(&type->regions[i]))
1565 memblock_remove_region(type, i);
1566 }
1567 /* truncate the reserved regions */
1568 memblock_remove_range(&memblock.reserved, max_addr,
1569 (phys_addr_t)ULLONG_MAX);
1570}
1571
cd79481d 1572static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr)
72d4b0b4
BH
1573{
1574 unsigned int left = 0, right = type->cnt;
1575
1576 do {
1577 unsigned int mid = (right + left) / 2;
1578
1579 if (addr < type->regions[mid].base)
1580 right = mid;
1581 else if (addr >= (type->regions[mid].base +
1582 type->regions[mid].size))
1583 left = mid + 1;
1584 else
1585 return mid;
1586 } while (left < right);
1587 return -1;
1588}
1589
b4ad0c7e 1590bool __init memblock_is_reserved(phys_addr_t addr)
95f72d1e 1591{
72d4b0b4
BH
1592 return memblock_search(&memblock.reserved, addr) != -1;
1593}
95f72d1e 1594
b4ad0c7e 1595bool __init_memblock memblock_is_memory(phys_addr_t addr)
72d4b0b4
BH
1596{
1597 return memblock_search(&memblock.memory, addr) != -1;
1598}
1599
bf3d3cc5
AB
1600int __init_memblock memblock_is_map_memory(phys_addr_t addr)
1601{
1602 int i = memblock_search(&memblock.memory, addr);
1603
1604 if (i == -1)
1605 return false;
1606 return !memblock_is_nomap(&memblock.memory.regions[i]);
1607}
1608
e76b63f8
YL
1609#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1610int __init_memblock memblock_search_pfn_nid(unsigned long pfn,
1611 unsigned long *start_pfn, unsigned long *end_pfn)
1612{
1613 struct memblock_type *type = &memblock.memory;
16763230 1614 int mid = memblock_search(type, PFN_PHYS(pfn));
e76b63f8
YL
1615
1616 if (mid == -1)
1617 return -1;
1618
f7e2f7e8
FF
1619 *start_pfn = PFN_DOWN(type->regions[mid].base);
1620 *end_pfn = PFN_DOWN(type->regions[mid].base + type->regions[mid].size);
e76b63f8
YL
1621
1622 return type->regions[mid].nid;
1623}
1624#endif
1625
eab30949
SB
1626/**
1627 * memblock_is_region_memory - check if a region is a subset of memory
1628 * @base: base of region to check
1629 * @size: size of region to check
1630 *
1631 * Check if the region [@base, @base+@size) is a subset of a memory block.
1632 *
1633 * RETURNS:
1634 * 0 if false, non-zero if true
1635 */
3661ca66 1636int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size)
72d4b0b4 1637{
abb65272 1638 int idx = memblock_search(&memblock.memory, base);
eb18f1b5 1639 phys_addr_t end = base + memblock_cap_size(base, &size);
72d4b0b4
BH
1640
1641 if (idx == -1)
1642 return 0;
abb65272
TV
1643 return memblock.memory.regions[idx].base <= base &&
1644 (memblock.memory.regions[idx].base +
eb18f1b5 1645 memblock.memory.regions[idx].size) >= end;
95f72d1e
YL
1646}
1647
eab30949
SB
1648/**
1649 * memblock_is_region_reserved - check if a region intersects reserved memory
1650 * @base: base of region to check
1651 * @size: size of region to check
1652 *
1653 * Check if the region [@base, @base+@size) intersects a reserved memory block.
1654 *
1655 * RETURNS:
c5c5c9d1 1656 * True if they intersect, false if not.
eab30949 1657 */
c5c5c9d1 1658bool __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size)
95f72d1e 1659{
eb18f1b5 1660 memblock_cap_size(base, &size);
c5c5c9d1 1661 return memblock_overlaps_region(&memblock.reserved, base, size);
95f72d1e
YL
1662}
1663
6ede1fd3
YL
1664void __init_memblock memblock_trim_memory(phys_addr_t align)
1665{
6ede1fd3 1666 phys_addr_t start, end, orig_start, orig_end;
136199f0 1667 struct memblock_region *r;
6ede1fd3 1668
136199f0
EM
1669 for_each_memblock(memory, r) {
1670 orig_start = r->base;
1671 orig_end = r->base + r->size;
6ede1fd3
YL
1672 start = round_up(orig_start, align);
1673 end = round_down(orig_end, align);
1674
1675 if (start == orig_start && end == orig_end)
1676 continue;
1677
1678 if (start < end) {
136199f0
EM
1679 r->base = start;
1680 r->size = end - start;
6ede1fd3 1681 } else {
136199f0
EM
1682 memblock_remove_region(&memblock.memory,
1683 r - memblock.memory.regions);
1684 r--;
6ede1fd3
YL
1685 }
1686 }
1687}
e63075a3 1688
3661ca66 1689void __init_memblock memblock_set_current_limit(phys_addr_t limit)
e63075a3
BH
1690{
1691 memblock.current_limit = limit;
1692}
1693
fec51014
LA
1694phys_addr_t __init_memblock memblock_get_current_limit(void)
1695{
1696 return memblock.current_limit;
1697}
1698
7c0caeb8 1699static void __init_memblock memblock_dump(struct memblock_type *type, char *name)
6ed311b2
BH
1700{
1701 unsigned long long base, size;
66a20757 1702 unsigned long flags;
8c9c1701
AK
1703 int idx;
1704 struct memblock_region *rgn;
6ed311b2 1705
7c0caeb8 1706 pr_info(" %s.cnt = 0x%lx\n", name, type->cnt);
6ed311b2 1707
8c9c1701 1708 for_each_memblock_type(type, rgn) {
7c0caeb8
TH
1709 char nid_buf[32] = "";
1710
1711 base = rgn->base;
1712 size = rgn->size;
66a20757 1713 flags = rgn->flags;
7c0caeb8
TH
1714#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1715 if (memblock_get_region_node(rgn) != MAX_NUMNODES)
1716 snprintf(nid_buf, sizeof(nid_buf), " on node %d",
1717 memblock_get_region_node(rgn));
1718#endif
66a20757 1719 pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s flags: %#lx\n",
8c9c1701 1720 name, idx, base, base + size - 1, size, nid_buf, flags);
6ed311b2
BH
1721 }
1722}
1723
4ff7b82f 1724void __init_memblock __memblock_dump_all(void)
6ed311b2 1725{
6ed311b2 1726 pr_info("MEMBLOCK configuration:\n");
1440c4e2
TH
1727 pr_info(" memory size = %#llx reserved size = %#llx\n",
1728 (unsigned long long)memblock.memory.total_size,
1729 (unsigned long long)memblock.reserved.total_size);
6ed311b2
BH
1730
1731 memblock_dump(&memblock.memory, "memory");
1732 memblock_dump(&memblock.reserved, "reserved");
1733}
1734
1aadc056 1735void __init memblock_allow_resize(void)
6ed311b2 1736{
142b45a7 1737 memblock_can_resize = 1;
6ed311b2
BH
1738}
1739
6ed311b2
BH
1740static int __init early_memblock(char *p)
1741{
1742 if (p && strstr(p, "debug"))
1743 memblock_debug = 1;
1744 return 0;
1745}
1746early_param("memblock", early_memblock);
1747
c378ddd5 1748#if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
6d03b885
BH
1749
1750static int memblock_debug_show(struct seq_file *m, void *private)
1751{
1752 struct memblock_type *type = m->private;
1753 struct memblock_region *reg;
1754 int i;
1755
1756 for (i = 0; i < type->cnt; i++) {
1757 reg = &type->regions[i];
1758 seq_printf(m, "%4d: ", i);
1759 if (sizeof(phys_addr_t) == 4)
1760 seq_printf(m, "0x%08lx..0x%08lx\n",
1761 (unsigned long)reg->base,
1762 (unsigned long)(reg->base + reg->size - 1));
1763 else
1764 seq_printf(m, "0x%016llx..0x%016llx\n",
1765 (unsigned long long)reg->base,
1766 (unsigned long long)(reg->base + reg->size - 1));
1767
1768 }
1769 return 0;
1770}
1771
1772static int memblock_debug_open(struct inode *inode, struct file *file)
1773{
1774 return single_open(file, memblock_debug_show, inode->i_private);
1775}
1776
1777static const struct file_operations memblock_debug_fops = {
1778 .open = memblock_debug_open,
1779 .read = seq_read,
1780 .llseek = seq_lseek,
1781 .release = single_release,
1782};
1783
1784static int __init memblock_init_debugfs(void)
1785{
1786 struct dentry *root = debugfs_create_dir("memblock", NULL);
1787 if (!root)
1788 return -ENXIO;
1789 debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops);
1790 debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops);
70210ed9
PH
1791#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
1792 debugfs_create_file("physmem", S_IRUGO, root, &memblock.physmem, &memblock_debug_fops);
1793#endif
6d03b885
BH
1794
1795 return 0;
1796}
1797__initcall(memblock_init_debugfs);
1798
1799#endif /* CONFIG_DEBUG_FS */