2 * Procedures for maintaining information about logical memory blocks.
4 * Peter Bergner, IBM Corp. June 2001.
5 * Copyright (C) 2001 Peter Bergner.
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.
13 #include <linux/kernel.h>
14 #include <linux/slab.h>
15 #include <linux/init.h>
16 #include <linux/bitops.h>
17 #include <linux/poison.h>
18 #include <linux/pfn.h>
19 #include <linux/debugfs.h>
20 #include <linux/seq_file.h>
21 #include <linux/memblock.h>
23 #include <asm/sections.h>
28 static struct memblock_region memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock;
29 static struct memblock_region memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock;
30 #ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
31 static struct memblock_region memblock_physmem_init_regions[INIT_PHYSMEM_REGIONS] __initdata_memblock;
34 struct 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 .memory.name = "memory",
40 .reserved.regions = memblock_reserved_init_regions,
41 .reserved.cnt = 1, /* empty dummy entry */
42 .reserved.max = INIT_MEMBLOCK_REGIONS,
43 .reserved.name = "reserved",
45 #ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
46 .physmem.regions = memblock_physmem_init_regions,
47 .physmem.cnt = 1, /* empty dummy entry */
48 .physmem.max = INIT_PHYSMEM_REGIONS,
49 .physmem.name = "physmem",
53 .current_limit = MEMBLOCK_ALLOC_ANYWHERE,
56 int memblock_debug __initdata_memblock;
57 static bool system_has_some_mirror __initdata_memblock = false;
58 static int memblock_can_resize __initdata_memblock;
59 static int memblock_memory_in_slab __initdata_memblock = 0;
60 static int memblock_reserved_in_slab __initdata_memblock = 0;
62 ulong __init_memblock choose_memblock_flags(void)
64 return system_has_some_mirror ? MEMBLOCK_MIRROR : MEMBLOCK_NONE;
67 /* adjust *@size so that (@base + *@size) doesn't overflow, return new size */
68 static inline phys_addr_t memblock_cap_size(phys_addr_t base, phys_addr_t *size)
70 return *size = min(*size, (phys_addr_t)ULLONG_MAX - base);
74 * Address comparison utilities
76 static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1,
77 phys_addr_t base2, phys_addr_t size2)
79 return ((base1 < (base2 + size2)) && (base2 < (base1 + size1)));
82 bool __init_memblock memblock_overlaps_region(struct memblock_type *type,
83 phys_addr_t base, phys_addr_t size)
87 for (i = 0; i < type->cnt; i++)
88 if (memblock_addrs_overlap(base, size, type->regions[i].base,
89 type->regions[i].size))
95 * __memblock_find_range_bottom_up - find free area utility in bottom-up
96 * @start: start of candidate range
97 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
98 * @size: size of free area to find
99 * @align: alignment of free area to find
100 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
101 * @flags: pick from blocks based on memory attributes
103 * Utility called from memblock_find_in_range_node(), find free area bottom-up.
106 * Found address on success, 0 on failure.
108 static phys_addr_t __init_memblock
109 __memblock_find_range_bottom_up(phys_addr_t start, phys_addr_t end,
110 phys_addr_t size, phys_addr_t align, int nid,
113 phys_addr_t this_start, this_end, cand;
116 for_each_free_mem_range(i, nid, flags, &this_start, &this_end, NULL) {
117 this_start = clamp(this_start, start, end);
118 this_end = clamp(this_end, start, end);
120 cand = round_up(this_start, align);
121 if (cand < this_end && this_end - cand >= size)
129 * __memblock_find_range_top_down - find free area utility, in top-down
130 * @start: start of candidate range
131 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
132 * @size: size of free area to find
133 * @align: alignment of free area to find
134 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
135 * @flags: pick from blocks based on memory attributes
137 * Utility called from memblock_find_in_range_node(), find free area top-down.
140 * Found address on success, 0 on failure.
142 static phys_addr_t __init_memblock
143 __memblock_find_range_top_down(phys_addr_t start, phys_addr_t end,
144 phys_addr_t size, phys_addr_t align, int nid,
147 phys_addr_t this_start, this_end, cand;
150 for_each_free_mem_range_reverse(i, nid, flags, &this_start, &this_end,
152 this_start = clamp(this_start, start, end);
153 this_end = clamp(this_end, start, end);
158 cand = round_down(this_end - size, align);
159 if (cand >= this_start)
167 * memblock_find_in_range_node - find free area in given range and node
168 * @size: size of free area to find
169 * @align: alignment of free area to find
170 * @start: start of candidate range
171 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
172 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
173 * @flags: pick from blocks based on memory attributes
175 * Find @size free area aligned to @align in the specified range and node.
178 * Found address on success, 0 on failure.
180 phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t size,
181 phys_addr_t align, phys_addr_t start,
182 phys_addr_t end, int nid, ulong flags)
185 if (end == MEMBLOCK_ALLOC_ACCESSIBLE)
186 end = memblock.current_limit;
188 /* avoid allocating the first page */
189 start = max_t(phys_addr_t, start, PAGE_SIZE);
190 end = max(start, end);
192 if (memblock_bottom_up())
193 return __memblock_find_range_bottom_up(start, end, size, align,
196 return __memblock_find_range_top_down(start, end, size, align,
201 * memblock_find_in_range - find free area in given range
202 * @start: start of candidate range
203 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
204 * @size: size of free area to find
205 * @align: alignment of free area to find
207 * Find @size free area aligned to @align in the specified range.
210 * Found address on success, 0 on failure.
212 phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start,
213 phys_addr_t end, phys_addr_t size,
217 ulong flags = choose_memblock_flags();
220 ret = memblock_find_in_range_node(size, align, start, end,
221 NUMA_NO_NODE, flags);
223 if (!ret && (flags & MEMBLOCK_MIRROR)) {
224 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
226 flags &= ~MEMBLOCK_MIRROR;
233 static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r)
235 type->total_size -= type->regions[r].size;
236 memmove(&type->regions[r], &type->regions[r + 1],
237 (type->cnt - (r + 1)) * sizeof(type->regions[r]));
240 /* Special case for empty arrays */
241 if (type->cnt == 0) {
242 WARN_ON(type->total_size != 0);
244 type->regions[0].base = 0;
245 type->regions[0].size = 0;
246 type->regions[0].flags = 0;
247 memblock_set_region_node(&type->regions[0], MAX_NUMNODES);
251 #ifdef CONFIG_ARCH_DISCARD_MEMBLOCK
253 * Discard memory and reserved arrays if they were allocated
255 void __init memblock_discard(void)
257 phys_addr_t addr, size;
259 if (memblock.reserved.regions != memblock_reserved_init_regions) {
260 addr = __pa(memblock.reserved.regions);
261 size = PAGE_ALIGN(sizeof(struct memblock_region) *
262 memblock.reserved.max);
263 if (memblock_reserved_in_slab)
264 kfree(memblock.reserved.regions);
266 __memblock_free_late(addr, size);
269 if (memblock.memory.regions != memblock_memory_init_regions) {
270 addr = __pa(memblock.memory.regions);
271 size = PAGE_ALIGN(sizeof(struct memblock_region) *
272 memblock.memory.max);
273 if (memblock_memory_in_slab)
274 kfree(memblock.memory.regions);
276 __memblock_free_late(addr, size);
282 * memblock_double_array - double the size of the memblock regions array
283 * @type: memblock type of the regions array being doubled
284 * @new_area_start: starting address of memory range to avoid overlap with
285 * @new_area_size: size of memory range to avoid overlap with
287 * Double the size of the @type regions array. If memblock is being used to
288 * allocate memory for a new reserved regions array and there is a previously
289 * allocated memory range [@new_area_start,@new_area_start+@new_area_size]
290 * waiting to be reserved, ensure the memory used by the new array does
294 * 0 on success, -1 on failure.
296 static int __init_memblock memblock_double_array(struct memblock_type *type,
297 phys_addr_t new_area_start,
298 phys_addr_t new_area_size)
300 struct memblock_region *new_array, *old_array;
301 phys_addr_t old_alloc_size, new_alloc_size;
302 phys_addr_t old_size, new_size, addr;
303 int use_slab = slab_is_available();
306 /* We don't allow resizing until we know about the reserved regions
307 * of memory that aren't suitable for allocation
309 if (!memblock_can_resize)
312 /* Calculate new doubled size */
313 old_size = type->max * sizeof(struct memblock_region);
314 new_size = old_size << 1;
316 * We need to allocated new one align to PAGE_SIZE,
317 * so we can free them completely later.
319 old_alloc_size = PAGE_ALIGN(old_size);
320 new_alloc_size = PAGE_ALIGN(new_size);
322 /* Retrieve the slab flag */
323 if (type == &memblock.memory)
324 in_slab = &memblock_memory_in_slab;
326 in_slab = &memblock_reserved_in_slab;
328 /* Try to find some space for it.
330 * WARNING: We assume that either slab_is_available() and we use it or
331 * we use MEMBLOCK for allocations. That means that this is unsafe to
332 * use when bootmem is currently active (unless bootmem itself is
333 * implemented on top of MEMBLOCK which isn't the case yet)
335 * This should however not be an issue for now, as we currently only
336 * call into MEMBLOCK while it's still active, or much later when slab
337 * is active for memory hotplug operations
340 new_array = kmalloc(new_size, GFP_KERNEL);
341 addr = new_array ? __pa(new_array) : 0;
343 /* only exclude range when trying to double reserved.regions */
344 if (type != &memblock.reserved)
345 new_area_start = new_area_size = 0;
347 addr = memblock_find_in_range(new_area_start + new_area_size,
348 memblock.current_limit,
349 new_alloc_size, PAGE_SIZE);
350 if (!addr && new_area_size)
351 addr = memblock_find_in_range(0,
352 min(new_area_start, memblock.current_limit),
353 new_alloc_size, PAGE_SIZE);
355 new_array = addr ? __va(addr) : NULL;
358 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
359 type->name, type->max, type->max * 2);
363 memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]",
364 type->name, type->max * 2, (u64)addr,
365 (u64)addr + new_size - 1);
368 * Found space, we now need to move the array over before we add the
369 * reserved region since it may be our reserved array itself that is
372 memcpy(new_array, type->regions, old_size);
373 memset(new_array + type->max, 0, old_size);
374 old_array = type->regions;
375 type->regions = new_array;
378 /* Free old array. We needn't free it if the array is the static one */
381 else if (old_array != memblock_memory_init_regions &&
382 old_array != memblock_reserved_init_regions)
383 memblock_free(__pa(old_array), old_alloc_size);
386 * Reserve the new array if that comes from the memblock. Otherwise, we
390 BUG_ON(memblock_reserve(addr, new_alloc_size));
392 /* Update slab flag */
399 * memblock_merge_regions - merge neighboring compatible regions
400 * @type: memblock type to scan
402 * Scan @type and merge neighboring compatible regions.
404 static void __init_memblock memblock_merge_regions(struct memblock_type *type)
408 /* cnt never goes below 1 */
409 while (i < type->cnt - 1) {
410 struct memblock_region *this = &type->regions[i];
411 struct memblock_region *next = &type->regions[i + 1];
413 if (this->base + this->size != next->base ||
414 memblock_get_region_node(this) !=
415 memblock_get_region_node(next) ||
416 this->flags != next->flags) {
417 BUG_ON(this->base + this->size > next->base);
422 this->size += next->size;
423 /* move forward from next + 1, index of which is i + 2 */
424 memmove(next, next + 1, (type->cnt - (i + 2)) * sizeof(*next));
430 * memblock_insert_region - insert new memblock region
431 * @type: memblock type to insert into
432 * @idx: index for the insertion point
433 * @base: base address of the new region
434 * @size: size of the new region
435 * @nid: node id of the new region
436 * @flags: flags of the new region
438 * Insert new memblock region [@base,@base+@size) into @type at @idx.
439 * @type must already have extra room to accommodate the new region.
441 static void __init_memblock memblock_insert_region(struct memblock_type *type,
442 int idx, phys_addr_t base,
444 int nid, unsigned long flags)
446 struct memblock_region *rgn = &type->regions[idx];
448 BUG_ON(type->cnt >= type->max);
449 memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn));
453 memblock_set_region_node(rgn, nid);
455 type->total_size += size;
459 * memblock_add_range - add new memblock region
460 * @type: memblock type to add new region into
461 * @base: base address of the new region
462 * @size: size of the new region
463 * @nid: nid of the new region
464 * @flags: flags of the new region
466 * Add new memblock region [@base,@base+@size) into @type. The new region
467 * is allowed to overlap with existing ones - overlaps don't affect already
468 * existing regions. @type is guaranteed to be minimal (all neighbouring
469 * compatible regions are merged) after the addition.
472 * 0 on success, -errno on failure.
474 int __init_memblock memblock_add_range(struct memblock_type *type,
475 phys_addr_t base, phys_addr_t size,
476 int nid, unsigned long flags)
479 phys_addr_t obase = base;
480 phys_addr_t end = base + memblock_cap_size(base, &size);
482 struct memblock_region *rgn;
487 /* special case for empty array */
488 if (type->regions[0].size == 0) {
489 WARN_ON(type->cnt != 1 || type->total_size);
490 type->regions[0].base = base;
491 type->regions[0].size = size;
492 type->regions[0].flags = flags;
493 memblock_set_region_node(&type->regions[0], nid);
494 type->total_size = size;
499 * The following is executed twice. Once with %false @insert and
500 * then with %true. The first counts the number of regions needed
501 * to accommodate the new area. The second actually inserts them.
506 for_each_memblock_type(type, rgn) {
507 phys_addr_t rbase = rgn->base;
508 phys_addr_t rend = rbase + rgn->size;
515 * @rgn overlaps. If it separates the lower part of new
516 * area, insert that portion.
519 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
520 WARN_ON(nid != memblock_get_region_node(rgn));
522 WARN_ON(flags != rgn->flags);
525 memblock_insert_region(type, idx++, base,
529 /* area below @rend is dealt with, forget about it */
530 base = min(rend, end);
533 /* insert the remaining portion */
537 memblock_insert_region(type, idx, base, end - base,
545 * If this was the first round, resize array and repeat for actual
546 * insertions; otherwise, merge and return.
549 while (type->cnt + nr_new > type->max)
550 if (memblock_double_array(type, obase, size) < 0)
555 memblock_merge_regions(type);
560 int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size,
563 return memblock_add_range(&memblock.memory, base, size, nid, 0);
566 int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size)
568 phys_addr_t end = base + size - 1;
570 memblock_dbg("memblock_add: [%pa-%pa] %pF\n",
571 &base, &end, (void *)_RET_IP_);
573 return memblock_add_range(&memblock.memory, base, size, MAX_NUMNODES, 0);
577 * memblock_isolate_range - isolate given range into disjoint memblocks
578 * @type: memblock type to isolate range for
579 * @base: base of range to isolate
580 * @size: size of range to isolate
581 * @start_rgn: out parameter for the start of isolated region
582 * @end_rgn: out parameter for the end of isolated region
584 * Walk @type and ensure that regions don't cross the boundaries defined by
585 * [@base,@base+@size). Crossing regions are split at the boundaries,
586 * which may create at most two more regions. The index of the first
587 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
590 * 0 on success, -errno on failure.
592 static int __init_memblock memblock_isolate_range(struct memblock_type *type,
593 phys_addr_t base, phys_addr_t size,
594 int *start_rgn, int *end_rgn)
596 phys_addr_t end = base + memblock_cap_size(base, &size);
598 struct memblock_region *rgn;
600 *start_rgn = *end_rgn = 0;
605 /* we'll create at most two more regions */
606 while (type->cnt + 2 > type->max)
607 if (memblock_double_array(type, base, size) < 0)
610 for_each_memblock_type(type, rgn) {
611 phys_addr_t rbase = rgn->base;
612 phys_addr_t rend = rbase + rgn->size;
621 * @rgn intersects from below. Split and continue
622 * to process the next region - the new top half.
625 rgn->size -= base - rbase;
626 type->total_size -= base - rbase;
627 memblock_insert_region(type, idx, rbase, base - rbase,
628 memblock_get_region_node(rgn),
630 } else if (rend > end) {
632 * @rgn intersects from above. Split and redo the
633 * current region - the new bottom half.
636 rgn->size -= end - rbase;
637 type->total_size -= end - rbase;
638 memblock_insert_region(type, idx--, rbase, end - rbase,
639 memblock_get_region_node(rgn),
642 /* @rgn is fully contained, record it */
652 static int __init_memblock memblock_remove_range(struct memblock_type *type,
653 phys_addr_t base, phys_addr_t size)
655 int start_rgn, end_rgn;
658 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
662 for (i = end_rgn - 1; i >= start_rgn; i--)
663 memblock_remove_region(type, i);
667 int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size)
669 return memblock_remove_range(&memblock.memory, base, size);
673 int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size)
675 phys_addr_t end = base + size - 1;
677 memblock_dbg(" memblock_free: [%pa-%pa] %pF\n",
678 &base, &end, (void *)_RET_IP_);
680 kmemleak_free_part_phys(base, size);
681 return memblock_remove_range(&memblock.reserved, base, size);
684 int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size)
686 phys_addr_t end = base + size - 1;
688 memblock_dbg("memblock_reserve: [%pa-%pa] %pF\n",
689 &base, &end, (void *)_RET_IP_);
691 return memblock_add_range(&memblock.reserved, base, size, MAX_NUMNODES, 0);
696 * This function isolates region [@base, @base + @size), and sets/clears flag
698 * Return 0 on success, -errno on failure.
700 static int __init_memblock memblock_setclr_flag(phys_addr_t base,
701 phys_addr_t size, int set, int flag)
703 struct memblock_type *type = &memblock.memory;
704 int i, ret, start_rgn, end_rgn;
706 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
710 for (i = start_rgn; i < end_rgn; i++)
712 memblock_set_region_flags(&type->regions[i], flag);
714 memblock_clear_region_flags(&type->regions[i], flag);
716 memblock_merge_regions(type);
721 * memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG.
722 * @base: the base phys addr of the region
723 * @size: the size of the region
725 * Return 0 on success, -errno on failure.
727 int __init_memblock memblock_mark_hotplug(phys_addr_t base, phys_addr_t size)
729 return memblock_setclr_flag(base, size, 1, MEMBLOCK_HOTPLUG);
733 * memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region.
734 * @base: the base phys addr of the region
735 * @size: the size of the region
737 * Return 0 on success, -errno on failure.
739 int __init_memblock memblock_clear_hotplug(phys_addr_t base, phys_addr_t size)
741 return memblock_setclr_flag(base, size, 0, MEMBLOCK_HOTPLUG);
745 * memblock_mark_mirror - Mark mirrored memory with flag MEMBLOCK_MIRROR.
746 * @base: the base phys addr of the region
747 * @size: the size of the region
749 * Return 0 on success, -errno on failure.
751 int __init_memblock memblock_mark_mirror(phys_addr_t base, phys_addr_t size)
753 system_has_some_mirror = true;
755 return memblock_setclr_flag(base, size, 1, MEMBLOCK_MIRROR);
759 * memblock_mark_nomap - Mark a memory region with flag MEMBLOCK_NOMAP.
760 * @base: the base phys addr of the region
761 * @size: the size of the region
763 * Return 0 on success, -errno on failure.
765 int __init_memblock memblock_mark_nomap(phys_addr_t base, phys_addr_t size)
767 return memblock_setclr_flag(base, size, 1, MEMBLOCK_NOMAP);
771 * memblock_clear_nomap - Clear flag MEMBLOCK_NOMAP for a specified region.
772 * @base: the base phys addr of the region
773 * @size: the size of the region
775 * Return 0 on success, -errno on failure.
777 int __init_memblock memblock_clear_nomap(phys_addr_t base, phys_addr_t size)
779 return memblock_setclr_flag(base, size, 0, MEMBLOCK_NOMAP);
783 * __next_reserved_mem_region - next function for for_each_reserved_region()
784 * @idx: pointer to u64 loop variable
785 * @out_start: ptr to phys_addr_t for start address of the region, can be %NULL
786 * @out_end: ptr to phys_addr_t for end address of the region, can be %NULL
788 * Iterate over all reserved memory regions.
790 void __init_memblock __next_reserved_mem_region(u64 *idx,
791 phys_addr_t *out_start,
792 phys_addr_t *out_end)
794 struct memblock_type *type = &memblock.reserved;
796 if (*idx < type->cnt) {
797 struct memblock_region *r = &type->regions[*idx];
798 phys_addr_t base = r->base;
799 phys_addr_t size = r->size;
804 *out_end = base + size - 1;
810 /* signal end of iteration */
815 * __next__mem_range - next function for for_each_free_mem_range() etc.
816 * @idx: pointer to u64 loop variable
817 * @nid: node selector, %NUMA_NO_NODE for all nodes
818 * @flags: pick from blocks based on memory attributes
819 * @type_a: pointer to memblock_type from where the range is taken
820 * @type_b: pointer to memblock_type which excludes memory from being taken
821 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
822 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
823 * @out_nid: ptr to int for nid of the range, can be %NULL
825 * Find the first area from *@idx which matches @nid, fill the out
826 * parameters, and update *@idx for the next iteration. The lower 32bit of
827 * *@idx contains index into type_a and the upper 32bit indexes the
828 * areas before each region in type_b. For example, if type_b regions
829 * look like the following,
831 * 0:[0-16), 1:[32-48), 2:[128-130)
833 * The upper 32bit indexes the following regions.
835 * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX)
837 * As both region arrays are sorted, the function advances the two indices
838 * in lockstep and returns each intersection.
840 void __init_memblock __next_mem_range(u64 *idx, int nid, ulong flags,
841 struct memblock_type *type_a,
842 struct memblock_type *type_b,
843 phys_addr_t *out_start,
844 phys_addr_t *out_end, int *out_nid)
846 int idx_a = *idx & 0xffffffff;
847 int idx_b = *idx >> 32;
849 if (WARN_ONCE(nid == MAX_NUMNODES,
850 "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
853 for (; idx_a < type_a->cnt; idx_a++) {
854 struct memblock_region *m = &type_a->regions[idx_a];
856 phys_addr_t m_start = m->base;
857 phys_addr_t m_end = m->base + m->size;
858 int m_nid = memblock_get_region_node(m);
860 /* only memory regions are associated with nodes, check it */
861 if (nid != NUMA_NO_NODE && nid != m_nid)
864 /* skip hotpluggable memory regions if needed */
865 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
868 /* if we want mirror memory skip non-mirror memory regions */
869 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
872 /* skip nomap memory unless we were asked for it explicitly */
873 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
878 *out_start = m_start;
884 *idx = (u32)idx_a | (u64)idx_b << 32;
888 /* scan areas before each reservation */
889 for (; idx_b < type_b->cnt + 1; idx_b++) {
890 struct memblock_region *r;
894 r = &type_b->regions[idx_b];
895 r_start = idx_b ? r[-1].base + r[-1].size : 0;
896 r_end = idx_b < type_b->cnt ?
897 r->base : ULLONG_MAX;
900 * if idx_b advanced past idx_a,
901 * break out to advance idx_a
903 if (r_start >= m_end)
905 /* if the two regions intersect, we're done */
906 if (m_start < r_end) {
909 max(m_start, r_start);
911 *out_end = min(m_end, r_end);
915 * The region which ends first is
916 * advanced for the next iteration.
922 *idx = (u32)idx_a | (u64)idx_b << 32;
928 /* signal end of iteration */
933 * __next_mem_range_rev - generic next function for for_each_*_range_rev()
935 * Finds the next range from type_a which is not marked as unsuitable
938 * @idx: pointer to u64 loop variable
939 * @nid: node selector, %NUMA_NO_NODE for all nodes
940 * @flags: pick from blocks based on memory attributes
941 * @type_a: pointer to memblock_type from where the range is taken
942 * @type_b: pointer to memblock_type which excludes memory from being taken
943 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
944 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
945 * @out_nid: ptr to int for nid of the range, can be %NULL
947 * Reverse of __next_mem_range().
949 void __init_memblock __next_mem_range_rev(u64 *idx, int nid, ulong flags,
950 struct memblock_type *type_a,
951 struct memblock_type *type_b,
952 phys_addr_t *out_start,
953 phys_addr_t *out_end, int *out_nid)
955 int idx_a = *idx & 0xffffffff;
956 int idx_b = *idx >> 32;
958 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
961 if (*idx == (u64)ULLONG_MAX) {
962 idx_a = type_a->cnt - 1;
969 for (; idx_a >= 0; idx_a--) {
970 struct memblock_region *m = &type_a->regions[idx_a];
972 phys_addr_t m_start = m->base;
973 phys_addr_t m_end = m->base + m->size;
974 int m_nid = memblock_get_region_node(m);
976 /* only memory regions are associated with nodes, check it */
977 if (nid != NUMA_NO_NODE && nid != m_nid)
980 /* skip hotpluggable memory regions if needed */
981 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
984 /* if we want mirror memory skip non-mirror memory regions */
985 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
988 /* skip nomap memory unless we were asked for it explicitly */
989 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
994 *out_start = m_start;
1000 *idx = (u32)idx_a | (u64)idx_b << 32;
1004 /* scan areas before each reservation */
1005 for (; idx_b >= 0; idx_b--) {
1006 struct memblock_region *r;
1007 phys_addr_t r_start;
1010 r = &type_b->regions[idx_b];
1011 r_start = idx_b ? r[-1].base + r[-1].size : 0;
1012 r_end = idx_b < type_b->cnt ?
1013 r->base : ULLONG_MAX;
1015 * if idx_b advanced past idx_a,
1016 * break out to advance idx_a
1019 if (r_end <= m_start)
1021 /* if the two regions intersect, we're done */
1022 if (m_end > r_start) {
1024 *out_start = max(m_start, r_start);
1026 *out_end = min(m_end, r_end);
1029 if (m_start >= r_start)
1033 *idx = (u32)idx_a | (u64)idx_b << 32;
1038 /* signal end of iteration */
1042 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1044 * Common iterator interface used to define for_each_mem_range().
1046 void __init_memblock __next_mem_pfn_range(int *idx, int nid,
1047 unsigned long *out_start_pfn,
1048 unsigned long *out_end_pfn, int *out_nid)
1050 struct memblock_type *type = &memblock.memory;
1051 struct memblock_region *r;
1053 while (++*idx < type->cnt) {
1054 r = &type->regions[*idx];
1056 if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size))
1058 if (nid == MAX_NUMNODES || nid == r->nid)
1061 if (*idx >= type->cnt) {
1067 *out_start_pfn = PFN_UP(r->base);
1069 *out_end_pfn = PFN_DOWN(r->base + r->size);
1075 * memblock_set_node - set node ID on memblock regions
1076 * @base: base of area to set node ID for
1077 * @size: size of area to set node ID for
1078 * @type: memblock type to set node ID for
1079 * @nid: node ID to set
1081 * Set the nid of memblock @type regions in [@base,@base+@size) to @nid.
1082 * Regions which cross the area boundaries are split as necessary.
1085 * 0 on success, -errno on failure.
1087 int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size,
1088 struct memblock_type *type, int nid)
1090 int start_rgn, end_rgn;
1093 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
1097 for (i = start_rgn; i < end_rgn; i++)
1098 memblock_set_region_node(&type->regions[i], nid);
1100 memblock_merge_regions(type);
1103 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
1105 static phys_addr_t __init memblock_alloc_range_nid(phys_addr_t size,
1106 phys_addr_t align, phys_addr_t start,
1107 phys_addr_t end, int nid, ulong flags)
1112 align = SMP_CACHE_BYTES;
1114 found = memblock_find_in_range_node(size, align, start, end, nid,
1116 if (found && !memblock_reserve(found, size)) {
1118 * The min_count is set to 0 so that memblock allocations are
1119 * never reported as leaks.
1121 kmemleak_alloc_phys(found, size, 0, 0);
1127 phys_addr_t __init memblock_alloc_range(phys_addr_t size, phys_addr_t align,
1128 phys_addr_t start, phys_addr_t end,
1131 return memblock_alloc_range_nid(size, align, start, end, NUMA_NO_NODE,
1135 static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size,
1136 phys_addr_t align, phys_addr_t max_addr,
1137 int nid, ulong flags)
1139 return memblock_alloc_range_nid(size, align, 0, max_addr, nid, flags);
1142 phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid)
1144 ulong flags = choose_memblock_flags();
1148 ret = memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE,
1151 if (!ret && (flags & MEMBLOCK_MIRROR)) {
1152 flags &= ~MEMBLOCK_MIRROR;
1158 phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
1160 return memblock_alloc_base_nid(size, align, max_addr, NUMA_NO_NODE,
1164 phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
1168 alloc = __memblock_alloc_base(size, align, max_addr);
1171 panic("ERROR: Failed to allocate %pa bytes below %pa.\n",
1177 phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align)
1179 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
1182 phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid)
1184 phys_addr_t res = memblock_alloc_nid(size, align, nid);
1188 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
1192 * memblock_virt_alloc_internal - allocate boot memory block
1193 * @size: size of memory block to be allocated in bytes
1194 * @align: alignment of the region and block's size
1195 * @min_addr: the lower bound of the memory region to allocate (phys address)
1196 * @max_addr: the upper bound of the memory region to allocate (phys address)
1197 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1199 * The @min_addr limit is dropped if it can not be satisfied and the allocation
1200 * will fall back to memory below @min_addr. Also, allocation may fall back
1201 * to any node in the system if the specified node can not
1202 * hold the requested memory.
1204 * The allocation is performed from memory region limited by
1205 * memblock.current_limit if @max_addr == %BOOTMEM_ALLOC_ACCESSIBLE.
1207 * The memory block is aligned on SMP_CACHE_BYTES if @align == 0.
1209 * The phys address of allocated boot memory block is converted to virtual and
1210 * allocated memory is reset to 0.
1212 * In addition, function sets the min_count to 0 using kmemleak_alloc for
1213 * allocated boot memory block, so that it is never reported as leaks.
1216 * Virtual address of allocated memory block on success, NULL on failure.
1218 static void * __init memblock_virt_alloc_internal(
1219 phys_addr_t size, phys_addr_t align,
1220 phys_addr_t min_addr, phys_addr_t max_addr,
1225 ulong flags = choose_memblock_flags();
1227 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
1231 * Detect any accidental use of these APIs after slab is ready, as at
1232 * this moment memblock may be deinitialized already and its
1233 * internal data may be destroyed (after execution of free_all_bootmem)
1235 if (WARN_ON_ONCE(slab_is_available()))
1236 return kzalloc_node(size, GFP_NOWAIT, nid);
1239 align = SMP_CACHE_BYTES;
1241 if (max_addr > memblock.current_limit)
1242 max_addr = memblock.current_limit;
1244 alloc = memblock_find_in_range_node(size, align, min_addr, max_addr,
1246 if (alloc && !memblock_reserve(alloc, size))
1249 if (nid != NUMA_NO_NODE) {
1250 alloc = memblock_find_in_range_node(size, align, min_addr,
1251 max_addr, NUMA_NO_NODE,
1253 if (alloc && !memblock_reserve(alloc, size))
1262 if (flags & MEMBLOCK_MIRROR) {
1263 flags &= ~MEMBLOCK_MIRROR;
1264 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
1271 ptr = phys_to_virt(alloc);
1272 memset(ptr, 0, size);
1275 * The min_count is set to 0 so that bootmem allocated blocks
1276 * are never reported as leaks. This is because many of these blocks
1277 * are only referred via the physical address which is not
1278 * looked up by kmemleak.
1280 kmemleak_alloc(ptr, size, 0, 0);
1286 * memblock_virt_alloc_try_nid_nopanic - allocate boot memory block
1287 * @size: size of memory block to be allocated in bytes
1288 * @align: alignment of the region and block's size
1289 * @min_addr: the lower bound of the memory region from where the allocation
1290 * is preferred (phys address)
1291 * @max_addr: the upper bound of the memory region from where the allocation
1292 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1293 * allocate only from memory limited by memblock.current_limit value
1294 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1296 * Public version of _memblock_virt_alloc_try_nid_nopanic() which provides
1297 * additional debug information (including caller info), if enabled.
1300 * Virtual address of allocated memory block on success, NULL on failure.
1302 void * __init memblock_virt_alloc_try_nid_nopanic(
1303 phys_addr_t size, phys_addr_t align,
1304 phys_addr_t min_addr, phys_addr_t max_addr,
1307 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1308 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1309 (u64)max_addr, (void *)_RET_IP_);
1310 return memblock_virt_alloc_internal(size, align, min_addr,
1315 * memblock_virt_alloc_try_nid - allocate boot memory block with panicking
1316 * @size: size of memory block to be allocated in bytes
1317 * @align: alignment of the region and block's size
1318 * @min_addr: the lower bound of the memory region from where the allocation
1319 * is preferred (phys address)
1320 * @max_addr: the upper bound of the memory region from where the allocation
1321 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1322 * allocate only from memory limited by memblock.current_limit value
1323 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1325 * Public panicking version of _memblock_virt_alloc_try_nid_nopanic()
1326 * which provides debug information (including caller info), if enabled,
1327 * and panics if the request can not be satisfied.
1330 * Virtual address of allocated memory block on success, NULL on failure.
1332 void * __init memblock_virt_alloc_try_nid(
1333 phys_addr_t size, phys_addr_t align,
1334 phys_addr_t min_addr, phys_addr_t max_addr,
1339 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1340 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1341 (u64)max_addr, (void *)_RET_IP_);
1342 ptr = memblock_virt_alloc_internal(size, align,
1343 min_addr, max_addr, nid);
1347 panic("%s: Failed to allocate %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx\n",
1348 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1354 * __memblock_free_early - free boot memory block
1355 * @base: phys starting address of the boot memory block
1356 * @size: size of the boot memory block in bytes
1358 * Free boot memory block previously allocated by memblock_virt_alloc_xx() API.
1359 * The freeing memory will not be released to the buddy allocator.
1361 void __init __memblock_free_early(phys_addr_t base, phys_addr_t size)
1363 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1364 __func__, (u64)base, (u64)base + size - 1,
1366 kmemleak_free_part_phys(base, size);
1367 memblock_remove_range(&memblock.reserved, base, size);
1371 * __memblock_free_late - free bootmem block pages directly to buddy allocator
1372 * @addr: phys starting address of the boot memory block
1373 * @size: size of the boot memory block in bytes
1375 * This is only useful when the bootmem allocator has already been torn
1376 * down, but we are still initializing the system. Pages are released directly
1377 * to the buddy allocator, no bootmem metadata is updated because it is gone.
1379 void __init __memblock_free_late(phys_addr_t base, phys_addr_t size)
1383 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1384 __func__, (u64)base, (u64)base + size - 1,
1386 kmemleak_free_part_phys(base, size);
1387 cursor = PFN_UP(base);
1388 end = PFN_DOWN(base + size);
1390 for (; cursor < end; cursor++) {
1391 __free_pages_bootmem(pfn_to_page(cursor), cursor, 0);
1397 * Remaining API functions
1400 phys_addr_t __init_memblock memblock_phys_mem_size(void)
1402 return memblock.memory.total_size;
1405 phys_addr_t __init_memblock memblock_reserved_size(void)
1407 return memblock.reserved.total_size;
1410 phys_addr_t __init memblock_mem_size(unsigned long limit_pfn)
1412 unsigned long pages = 0;
1413 struct memblock_region *r;
1414 unsigned long start_pfn, end_pfn;
1416 for_each_memblock(memory, r) {
1417 start_pfn = memblock_region_memory_base_pfn(r);
1418 end_pfn = memblock_region_memory_end_pfn(r);
1419 start_pfn = min_t(unsigned long, start_pfn, limit_pfn);
1420 end_pfn = min_t(unsigned long, end_pfn, limit_pfn);
1421 pages += end_pfn - start_pfn;
1424 return PFN_PHYS(pages);
1427 /* lowest address */
1428 phys_addr_t __init_memblock memblock_start_of_DRAM(void)
1430 return memblock.memory.regions[0].base;
1433 phys_addr_t __init_memblock memblock_end_of_DRAM(void)
1435 int idx = memblock.memory.cnt - 1;
1437 return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
1440 static phys_addr_t __init_memblock __find_max_addr(phys_addr_t limit)
1442 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
1443 struct memblock_region *r;
1446 * translate the memory @limit size into the max address within one of
1447 * the memory memblock regions, if the @limit exceeds the total size
1448 * of those regions, max_addr will keep original value ULLONG_MAX
1450 for_each_memblock(memory, r) {
1451 if (limit <= r->size) {
1452 max_addr = r->base + limit;
1461 void __init memblock_enforce_memory_limit(phys_addr_t limit)
1463 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
1468 max_addr = __find_max_addr(limit);
1470 /* @limit exceeds the total size of the memory, do nothing */
1471 if (max_addr == (phys_addr_t)ULLONG_MAX)
1474 /* truncate both memory and reserved regions */
1475 memblock_remove_range(&memblock.memory, max_addr,
1476 (phys_addr_t)ULLONG_MAX);
1477 memblock_remove_range(&memblock.reserved, max_addr,
1478 (phys_addr_t)ULLONG_MAX);
1481 void __init memblock_cap_memory_range(phys_addr_t base, phys_addr_t size)
1483 int start_rgn, end_rgn;
1489 ret = memblock_isolate_range(&memblock.memory, base, size,
1490 &start_rgn, &end_rgn);
1494 /* remove all the MAP regions */
1495 for (i = memblock.memory.cnt - 1; i >= end_rgn; i--)
1496 if (!memblock_is_nomap(&memblock.memory.regions[i]))
1497 memblock_remove_region(&memblock.memory, i);
1499 for (i = start_rgn - 1; i >= 0; i--)
1500 if (!memblock_is_nomap(&memblock.memory.regions[i]))
1501 memblock_remove_region(&memblock.memory, i);
1503 /* truncate the reserved regions */
1504 memblock_remove_range(&memblock.reserved, 0, base);
1505 memblock_remove_range(&memblock.reserved,
1506 base + size, (phys_addr_t)ULLONG_MAX);
1509 void __init memblock_mem_limit_remove_map(phys_addr_t limit)
1511 phys_addr_t max_addr;
1516 max_addr = __find_max_addr(limit);
1518 /* @limit exceeds the total size of the memory, do nothing */
1519 if (max_addr == (phys_addr_t)ULLONG_MAX)
1522 memblock_cap_memory_range(0, max_addr);
1525 static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr)
1527 unsigned int left = 0, right = type->cnt;
1530 unsigned int mid = (right + left) / 2;
1532 if (addr < type->regions[mid].base)
1534 else if (addr >= (type->regions[mid].base +
1535 type->regions[mid].size))
1539 } while (left < right);
1543 bool __init memblock_is_reserved(phys_addr_t addr)
1545 return memblock_search(&memblock.reserved, addr) != -1;
1548 bool __init_memblock memblock_is_memory(phys_addr_t addr)
1550 return memblock_search(&memblock.memory, addr) != -1;
1553 int __init_memblock memblock_is_map_memory(phys_addr_t addr)
1555 int i = memblock_search(&memblock.memory, addr);
1559 return !memblock_is_nomap(&memblock.memory.regions[i]);
1562 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1563 int __init_memblock memblock_search_pfn_nid(unsigned long pfn,
1564 unsigned long *start_pfn, unsigned long *end_pfn)
1566 struct memblock_type *type = &memblock.memory;
1567 int mid = memblock_search(type, PFN_PHYS(pfn));
1572 *start_pfn = PFN_DOWN(type->regions[mid].base);
1573 *end_pfn = PFN_DOWN(type->regions[mid].base + type->regions[mid].size);
1575 return type->regions[mid].nid;
1580 * memblock_is_region_memory - check if a region is a subset of memory
1581 * @base: base of region to check
1582 * @size: size of region to check
1584 * Check if the region [@base, @base+@size) is a subset of a memory block.
1587 * 0 if false, non-zero if true
1589 int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size)
1591 int idx = memblock_search(&memblock.memory, base);
1592 phys_addr_t end = base + memblock_cap_size(base, &size);
1596 return (memblock.memory.regions[idx].base +
1597 memblock.memory.regions[idx].size) >= end;
1601 * memblock_is_region_reserved - check if a region intersects reserved memory
1602 * @base: base of region to check
1603 * @size: size of region to check
1605 * Check if the region [@base, @base+@size) intersects a reserved memory block.
1608 * True if they intersect, false if not.
1610 bool __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size)
1612 memblock_cap_size(base, &size);
1613 return memblock_overlaps_region(&memblock.reserved, base, size);
1616 void __init_memblock memblock_trim_memory(phys_addr_t align)
1618 phys_addr_t start, end, orig_start, orig_end;
1619 struct memblock_region *r;
1621 for_each_memblock(memory, r) {
1622 orig_start = r->base;
1623 orig_end = r->base + r->size;
1624 start = round_up(orig_start, align);
1625 end = round_down(orig_end, align);
1627 if (start == orig_start && end == orig_end)
1632 r->size = end - start;
1634 memblock_remove_region(&memblock.memory,
1635 r - memblock.memory.regions);
1641 void __init_memblock memblock_set_current_limit(phys_addr_t limit)
1643 memblock.current_limit = limit;
1646 phys_addr_t __init_memblock memblock_get_current_limit(void)
1648 return memblock.current_limit;
1651 static void __init_memblock memblock_dump(struct memblock_type *type)
1653 phys_addr_t base, end, size;
1654 unsigned long flags;
1656 struct memblock_region *rgn;
1658 pr_info(" %s.cnt = 0x%lx\n", type->name, type->cnt);
1660 for_each_memblock_type(type, rgn) {
1661 char nid_buf[32] = "";
1665 end = base + size - 1;
1667 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1668 if (memblock_get_region_node(rgn) != MAX_NUMNODES)
1669 snprintf(nid_buf, sizeof(nid_buf), " on node %d",
1670 memblock_get_region_node(rgn));
1672 pr_info(" %s[%#x]\t[%pa-%pa], %pa bytes%s flags: %#lx\n",
1673 type->name, idx, &base, &end, &size, nid_buf, flags);
1677 extern unsigned long __init_memblock
1678 memblock_reserved_memory_within(phys_addr_t start_addr, phys_addr_t end_addr)
1680 struct memblock_region *rgn;
1681 unsigned long size = 0;
1684 for_each_memblock_type((&memblock.reserved), rgn) {
1685 phys_addr_t start, end;
1687 if (rgn->base + rgn->size < start_addr)
1689 if (rgn->base > end_addr)
1693 end = start + rgn->size;
1694 size += end - start;
1700 void __init_memblock __memblock_dump_all(void)
1702 pr_info("MEMBLOCK configuration:\n");
1703 pr_info(" memory size = %pa reserved size = %pa\n",
1704 &memblock.memory.total_size,
1705 &memblock.reserved.total_size);
1707 memblock_dump(&memblock.memory);
1708 memblock_dump(&memblock.reserved);
1709 #ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
1710 memblock_dump(&memblock.physmem);
1714 void __init memblock_allow_resize(void)
1716 memblock_can_resize = 1;
1719 static int __init early_memblock(char *p)
1721 if (p && strstr(p, "debug"))
1725 early_param("memblock", early_memblock);
1727 #if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
1729 static int memblock_debug_show(struct seq_file *m, void *private)
1731 struct memblock_type *type = m->private;
1732 struct memblock_region *reg;
1736 for (i = 0; i < type->cnt; i++) {
1737 reg = &type->regions[i];
1738 end = reg->base + reg->size - 1;
1740 seq_printf(m, "%4d: ", i);
1741 seq_printf(m, "%pa..%pa\n", ®->base, &end);
1746 static int memblock_debug_open(struct inode *inode, struct file *file)
1748 return single_open(file, memblock_debug_show, inode->i_private);
1751 static const struct file_operations memblock_debug_fops = {
1752 .open = memblock_debug_open,
1754 .llseek = seq_lseek,
1755 .release = single_release,
1758 static int __init memblock_init_debugfs(void)
1760 struct dentry *root = debugfs_create_dir("memblock", NULL);
1763 debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops);
1764 debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops);
1765 #ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
1766 debugfs_create_file("physmem", S_IRUGO, root, &memblock.physmem, &memblock_debug_fops);
1771 __initcall(memblock_init_debugfs);
1773 #endif /* CONFIG_DEBUG_FS */