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,
39 .reserved.regions = memblock_reserved_init_regions,
40 .reserved.cnt = 1, /* empty dummy entry */
41 .reserved.max = INIT_MEMBLOCK_REGIONS,
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,
50 .current_limit = MEMBLOCK_ALLOC_ANYWHERE,
53 int memblock_debug __initdata_memblock;
54 #ifdef CONFIG_MOVABLE_NODE
55 bool movable_node_enabled __initdata_memblock = false;
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 /* inline so we don't get a warning when pr_debug is compiled out */
68 static __init_memblock const char *
69 memblock_type_name(struct memblock_type *type)
71 if (type == &memblock.memory)
73 else if (type == &memblock.reserved)
79 /* adjust *@size so that (@base + *@size) doesn't overflow, return new size */
80 static inline phys_addr_t memblock_cap_size(phys_addr_t base, phys_addr_t *size)
82 return *size = min(*size, (phys_addr_t)ULLONG_MAX - base);
86 * Address comparison utilities
88 static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1,
89 phys_addr_t base2, phys_addr_t size2)
91 return ((base1 < (base2 + size2)) && (base2 < (base1 + size1)));
94 bool __init_memblock memblock_overlaps_region(struct memblock_type *type,
95 phys_addr_t base, phys_addr_t size)
99 for (i = 0; i < type->cnt; i++)
100 if (memblock_addrs_overlap(base, size, type->regions[i].base,
101 type->regions[i].size))
103 return i < type->cnt;
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
112 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
113 * @flags: pick from blocks based on memory attributes
115 * Utility called from memblock_find_in_range_node(), find free area bottom-up.
118 * Found address on success, 0 on failure.
120 static phys_addr_t __init_memblock
121 __memblock_find_range_bottom_up(phys_addr_t start, phys_addr_t end,
122 phys_addr_t size, phys_addr_t align, int nid,
125 phys_addr_t this_start, this_end, cand;
128 for_each_free_mem_range(i, nid, flags, &this_start, &this_end, NULL) {
129 this_start = clamp(this_start, start, end);
130 this_end = clamp(this_end, start, end);
132 cand = round_up(this_start, align);
133 if (cand < this_end && this_end - cand >= size)
141 * __memblock_find_range_top_down - find free area utility, in top-down
142 * @start: start of candidate range
143 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
144 * @size: size of free area to find
145 * @align: alignment of free area to find
146 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
147 * @flags: pick from blocks based on memory attributes
149 * Utility called from memblock_find_in_range_node(), find free area top-down.
152 * Found address on success, 0 on failure.
154 static phys_addr_t __init_memblock
155 __memblock_find_range_top_down(phys_addr_t start, phys_addr_t end,
156 phys_addr_t size, phys_addr_t align, int nid,
159 phys_addr_t this_start, this_end, cand;
162 for_each_free_mem_range_reverse(i, nid, flags, &this_start, &this_end,
164 this_start = clamp(this_start, start, end);
165 this_end = clamp(this_end, start, end);
170 cand = round_down(this_end - size, align);
171 if (cand >= this_start)
179 * memblock_find_in_range_node - find free area in given range and node
180 * @size: size of free area to find
181 * @align: alignment of free area to find
182 * @start: start of candidate range
183 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
184 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
185 * @flags: pick from blocks based on memory attributes
187 * Find @size free area aligned to @align in the specified range and node.
190 * Found address on success, 0 on failure.
192 phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t size,
193 phys_addr_t align, phys_addr_t start,
194 phys_addr_t end, int nid, ulong flags)
197 if (end == MEMBLOCK_ALLOC_ACCESSIBLE)
198 end = memblock.current_limit;
200 /* avoid allocating the first page */
201 start = max_t(phys_addr_t, start, PAGE_SIZE);
202 end = max(start, end);
204 if (memblock_bottom_up())
205 return __memblock_find_range_bottom_up(start, end, size, align,
208 return __memblock_find_range_top_down(start, end, size, align,
213 * memblock_find_in_range - find free area in given range
214 * @start: start of candidate range
215 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
216 * @size: size of free area to find
217 * @align: alignment of free area to find
219 * Find @size free area aligned to @align in the specified range.
222 * Found address on success, 0 on failure.
224 phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start,
225 phys_addr_t end, phys_addr_t size,
229 ulong flags = choose_memblock_flags();
232 ret = memblock_find_in_range_node(size, align, start, end,
233 NUMA_NO_NODE, flags);
235 if (!ret && (flags & MEMBLOCK_MIRROR)) {
236 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
238 flags &= ~MEMBLOCK_MIRROR;
245 static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r)
247 type->total_size -= type->regions[r].size;
248 memmove(&type->regions[r], &type->regions[r + 1],
249 (type->cnt - (r + 1)) * sizeof(type->regions[r]));
252 /* Special case for empty arrays */
253 if (type->cnt == 0) {
254 WARN_ON(type->total_size != 0);
256 type->regions[0].base = 0;
257 type->regions[0].size = 0;
258 type->regions[0].flags = 0;
259 memblock_set_region_node(&type->regions[0], MAX_NUMNODES);
263 #ifdef CONFIG_ARCH_DISCARD_MEMBLOCK
265 * Discard memory and reserved arrays if they were allocated
267 void __init memblock_discard(void)
269 phys_addr_t addr, size;
271 if (memblock.reserved.regions != memblock_reserved_init_regions) {
272 addr = __pa(memblock.reserved.regions);
273 size = PAGE_ALIGN(sizeof(struct memblock_region) *
274 memblock.reserved.max);
275 __memblock_free_late(addr, size);
278 if (memblock.memory.regions != memblock_memory_init_regions) {
279 addr = __pa(memblock.memory.regions);
280 size = PAGE_ALIGN(sizeof(struct memblock_region) *
281 memblock.memory.max);
282 __memblock_free_late(addr, size);
288 * memblock_double_array - double the size of the memblock regions array
289 * @type: memblock type of the regions array being doubled
290 * @new_area_start: starting address of memory range to avoid overlap with
291 * @new_area_size: size of memory range to avoid overlap with
293 * Double the size of the @type regions array. If memblock is being used to
294 * allocate memory for a new reserved regions array and there is a previously
295 * allocated memory range [@new_area_start,@new_area_start+@new_area_size]
296 * waiting to be reserved, ensure the memory used by the new array does
300 * 0 on success, -1 on failure.
302 static int __init_memblock memblock_double_array(struct memblock_type *type,
303 phys_addr_t new_area_start,
304 phys_addr_t new_area_size)
306 struct memblock_region *new_array, *old_array;
307 phys_addr_t old_alloc_size, new_alloc_size;
308 phys_addr_t old_size, new_size, addr;
309 int use_slab = slab_is_available();
312 /* We don't allow resizing until we know about the reserved regions
313 * of memory that aren't suitable for allocation
315 if (!memblock_can_resize)
318 /* Calculate new doubled size */
319 old_size = type->max * sizeof(struct memblock_region);
320 new_size = old_size << 1;
322 * We need to allocated new one align to PAGE_SIZE,
323 * so we can free them completely later.
325 old_alloc_size = PAGE_ALIGN(old_size);
326 new_alloc_size = PAGE_ALIGN(new_size);
328 /* Retrieve the slab flag */
329 if (type == &memblock.memory)
330 in_slab = &memblock_memory_in_slab;
332 in_slab = &memblock_reserved_in_slab;
334 /* Try to find some space for it.
336 * WARNING: We assume that either slab_is_available() and we use it or
337 * we use MEMBLOCK for allocations. That means that this is unsafe to
338 * use when bootmem is currently active (unless bootmem itself is
339 * implemented on top of MEMBLOCK which isn't the case yet)
341 * This should however not be an issue for now, as we currently only
342 * call into MEMBLOCK while it's still active, or much later when slab
343 * is active for memory hotplug operations
346 new_array = kmalloc(new_size, GFP_KERNEL);
347 addr = new_array ? __pa(new_array) : 0;
349 /* only exclude range when trying to double reserved.regions */
350 if (type != &memblock.reserved)
351 new_area_start = new_area_size = 0;
353 addr = memblock_find_in_range(new_area_start + new_area_size,
354 memblock.current_limit,
355 new_alloc_size, PAGE_SIZE);
356 if (!addr && new_area_size)
357 addr = memblock_find_in_range(0,
358 min(new_area_start, memblock.current_limit),
359 new_alloc_size, PAGE_SIZE);
361 new_array = addr ? __va(addr) : NULL;
364 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
365 memblock_type_name(type), type->max, type->max * 2);
369 memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]",
370 memblock_type_name(type), type->max * 2, (u64)addr,
371 (u64)addr + new_size - 1);
374 * Found space, we now need to move the array over before we add the
375 * reserved region since it may be our reserved array itself that is
378 memcpy(new_array, type->regions, old_size);
379 memset(new_array + type->max, 0, old_size);
380 old_array = type->regions;
381 type->regions = new_array;
384 /* Free old array. We needn't free it if the array is the static one */
387 else if (old_array != memblock_memory_init_regions &&
388 old_array != memblock_reserved_init_regions)
389 memblock_free(__pa(old_array), old_alloc_size);
392 * Reserve the new array if that comes from the memblock. Otherwise, we
396 BUG_ON(memblock_reserve(addr, new_alloc_size));
398 /* Update slab flag */
405 * memblock_merge_regions - merge neighboring compatible regions
406 * @type: memblock type to scan
408 * Scan @type and merge neighboring compatible regions.
410 static void __init_memblock memblock_merge_regions(struct memblock_type *type)
414 /* cnt never goes below 1 */
415 while (i < type->cnt - 1) {
416 struct memblock_region *this = &type->regions[i];
417 struct memblock_region *next = &type->regions[i + 1];
419 if (this->base + this->size != next->base ||
420 memblock_get_region_node(this) !=
421 memblock_get_region_node(next) ||
422 this->flags != next->flags) {
423 BUG_ON(this->base + this->size > next->base);
428 this->size += next->size;
429 /* move forward from next + 1, index of which is i + 2 */
430 memmove(next, next + 1, (type->cnt - (i + 2)) * sizeof(*next));
436 * memblock_insert_region - insert new memblock region
437 * @type: memblock type to insert into
438 * @idx: index for the insertion point
439 * @base: base address of the new region
440 * @size: size of the new region
441 * @nid: node id of the new region
442 * @flags: flags of the new region
444 * Insert new memblock region [@base,@base+@size) into @type at @idx.
445 * @type must already have extra room to accommodate the new region.
447 static void __init_memblock memblock_insert_region(struct memblock_type *type,
448 int idx, phys_addr_t base,
450 int nid, unsigned long flags)
452 struct memblock_region *rgn = &type->regions[idx];
454 BUG_ON(type->cnt >= type->max);
455 memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn));
459 memblock_set_region_node(rgn, nid);
461 type->total_size += size;
465 * memblock_add_range - add new memblock region
466 * @type: memblock type to add new region into
467 * @base: base address of the new region
468 * @size: size of the new region
469 * @nid: nid of the new region
470 * @flags: flags of the new region
472 * Add new memblock region [@base,@base+@size) into @type. The new region
473 * is allowed to overlap with existing ones - overlaps don't affect already
474 * existing regions. @type is guaranteed to be minimal (all neighbouring
475 * compatible regions are merged) after the addition.
478 * 0 on success, -errno on failure.
480 int __init_memblock memblock_add_range(struct memblock_type *type,
481 phys_addr_t base, phys_addr_t size,
482 int nid, unsigned long flags)
485 phys_addr_t obase = base;
486 phys_addr_t end = base + memblock_cap_size(base, &size);
488 struct memblock_region *rgn;
493 /* special case for empty array */
494 if (type->regions[0].size == 0) {
495 WARN_ON(type->cnt != 1 || type->total_size);
496 type->regions[0].base = base;
497 type->regions[0].size = size;
498 type->regions[0].flags = flags;
499 memblock_set_region_node(&type->regions[0], nid);
500 type->total_size = size;
505 * The following is executed twice. Once with %false @insert and
506 * then with %true. The first counts the number of regions needed
507 * to accommodate the new area. The second actually inserts them.
512 for_each_memblock_type(type, rgn) {
513 phys_addr_t rbase = rgn->base;
514 phys_addr_t rend = rbase + rgn->size;
521 * @rgn overlaps. If it separates the lower part of new
522 * area, insert that portion.
525 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
526 WARN_ON(nid != memblock_get_region_node(rgn));
528 WARN_ON(flags != rgn->flags);
531 memblock_insert_region(type, idx++, base,
535 /* area below @rend is dealt with, forget about it */
536 base = min(rend, end);
539 /* insert the remaining portion */
543 memblock_insert_region(type, idx, base, end - base,
551 * If this was the first round, resize array and repeat for actual
552 * insertions; otherwise, merge and return.
555 while (type->cnt + nr_new > type->max)
556 if (memblock_double_array(type, obase, size) < 0)
561 memblock_merge_regions(type);
566 int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size,
569 return memblock_add_range(&memblock.memory, base, size, nid, 0);
572 int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size)
574 memblock_dbg("memblock_add: [%#016llx-%#016llx] flags %#02lx %pF\n",
575 (unsigned long long)base,
576 (unsigned long long)base + size - 1,
577 0UL, (void *)_RET_IP_);
579 return memblock_add_range(&memblock.memory, base, size, MAX_NUMNODES, 0);
583 * memblock_isolate_range - isolate given range into disjoint memblocks
584 * @type: memblock type to isolate range for
585 * @base: base of range to isolate
586 * @size: size of range to isolate
587 * @start_rgn: out parameter for the start of isolated region
588 * @end_rgn: out parameter for the end of isolated region
590 * Walk @type and ensure that regions don't cross the boundaries defined by
591 * [@base,@base+@size). Crossing regions are split at the boundaries,
592 * which may create at most two more regions. The index of the first
593 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
596 * 0 on success, -errno on failure.
598 static int __init_memblock memblock_isolate_range(struct memblock_type *type,
599 phys_addr_t base, phys_addr_t size,
600 int *start_rgn, int *end_rgn)
602 phys_addr_t end = base + memblock_cap_size(base, &size);
604 struct memblock_region *rgn;
606 *start_rgn = *end_rgn = 0;
611 /* we'll create at most two more regions */
612 while (type->cnt + 2 > type->max)
613 if (memblock_double_array(type, base, size) < 0)
616 for_each_memblock_type(type, rgn) {
617 phys_addr_t rbase = rgn->base;
618 phys_addr_t rend = rbase + rgn->size;
627 * @rgn intersects from below. Split and continue
628 * to process the next region - the new top half.
631 rgn->size -= base - rbase;
632 type->total_size -= base - rbase;
633 memblock_insert_region(type, idx, rbase, base - rbase,
634 memblock_get_region_node(rgn),
636 } else if (rend > end) {
638 * @rgn intersects from above. Split and redo the
639 * current region - the new bottom half.
642 rgn->size -= end - rbase;
643 type->total_size -= end - rbase;
644 memblock_insert_region(type, idx--, rbase, end - rbase,
645 memblock_get_region_node(rgn),
648 /* @rgn is fully contained, record it */
658 static int __init_memblock memblock_remove_range(struct memblock_type *type,
659 phys_addr_t base, phys_addr_t size)
661 int start_rgn, end_rgn;
664 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
668 for (i = end_rgn - 1; i >= start_rgn; i--)
669 memblock_remove_region(type, i);
673 int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size)
675 return memblock_remove_range(&memblock.memory, base, size);
679 int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size)
681 memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n",
682 (unsigned long long)base,
683 (unsigned long long)base + size - 1,
686 kmemleak_free_part_phys(base, size);
687 return memblock_remove_range(&memblock.reserved, base, size);
690 int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size)
692 memblock_dbg("memblock_reserve: [%#016llx-%#016llx] flags %#02lx %pF\n",
693 (unsigned long long)base,
694 (unsigned long long)base + size - 1,
695 0UL, (void *)_RET_IP_);
697 return memblock_add_range(&memblock.reserved, base, size, MAX_NUMNODES, 0);
702 * This function isolates region [@base, @base + @size), and sets/clears flag
704 * Return 0 on success, -errno on failure.
706 static int __init_memblock memblock_setclr_flag(phys_addr_t base,
707 phys_addr_t size, int set, int flag)
709 struct memblock_type *type = &memblock.memory;
710 int i, ret, start_rgn, end_rgn;
712 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
716 for (i = start_rgn; i < end_rgn; i++)
718 memblock_set_region_flags(&type->regions[i], flag);
720 memblock_clear_region_flags(&type->regions[i], flag);
722 memblock_merge_regions(type);
727 * memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG.
728 * @base: the base phys addr of the region
729 * @size: the size of the region
731 * Return 0 on success, -errno on failure.
733 int __init_memblock memblock_mark_hotplug(phys_addr_t base, phys_addr_t size)
735 return memblock_setclr_flag(base, size, 1, MEMBLOCK_HOTPLUG);
739 * memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region.
740 * @base: the base phys addr of the region
741 * @size: the size of the region
743 * Return 0 on success, -errno on failure.
745 int __init_memblock memblock_clear_hotplug(phys_addr_t base, phys_addr_t size)
747 return memblock_setclr_flag(base, size, 0, MEMBLOCK_HOTPLUG);
751 * memblock_mark_mirror - Mark mirrored memory with flag MEMBLOCK_MIRROR.
752 * @base: the base phys addr of the region
753 * @size: the size of the region
755 * Return 0 on success, -errno on failure.
757 int __init_memblock memblock_mark_mirror(phys_addr_t base, phys_addr_t size)
759 system_has_some_mirror = true;
761 return memblock_setclr_flag(base, size, 1, MEMBLOCK_MIRROR);
765 * memblock_mark_nomap - Mark a memory region with flag MEMBLOCK_NOMAP.
766 * @base: the base phys addr of the region
767 * @size: the size of the region
769 * Return 0 on success, -errno on failure.
771 int __init_memblock memblock_mark_nomap(phys_addr_t base, phys_addr_t size)
773 return memblock_setclr_flag(base, size, 1, MEMBLOCK_NOMAP);
777 * __next_reserved_mem_region - next function for for_each_reserved_region()
778 * @idx: pointer to u64 loop variable
779 * @out_start: ptr to phys_addr_t for start address of the region, can be %NULL
780 * @out_end: ptr to phys_addr_t for end address of the region, can be %NULL
782 * Iterate over all reserved memory regions.
784 void __init_memblock __next_reserved_mem_region(u64 *idx,
785 phys_addr_t *out_start,
786 phys_addr_t *out_end)
788 struct memblock_type *type = &memblock.reserved;
790 if (*idx < type->cnt) {
791 struct memblock_region *r = &type->regions[*idx];
792 phys_addr_t base = r->base;
793 phys_addr_t size = r->size;
798 *out_end = base + size - 1;
804 /* signal end of iteration */
809 * __next__mem_range - next function for for_each_free_mem_range() etc.
810 * @idx: pointer to u64 loop variable
811 * @nid: node selector, %NUMA_NO_NODE for all nodes
812 * @flags: pick from blocks based on memory attributes
813 * @type_a: pointer to memblock_type from where the range is taken
814 * @type_b: pointer to memblock_type which excludes memory from being taken
815 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
816 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
817 * @out_nid: ptr to int for nid of the range, can be %NULL
819 * Find the first area from *@idx which matches @nid, fill the out
820 * parameters, and update *@idx for the next iteration. The lower 32bit of
821 * *@idx contains index into type_a and the upper 32bit indexes the
822 * areas before each region in type_b. For example, if type_b regions
823 * look like the following,
825 * 0:[0-16), 1:[32-48), 2:[128-130)
827 * The upper 32bit indexes the following regions.
829 * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX)
831 * As both region arrays are sorted, the function advances the two indices
832 * in lockstep and returns each intersection.
834 void __init_memblock __next_mem_range(u64 *idx, int nid, ulong flags,
835 struct memblock_type *type_a,
836 struct memblock_type *type_b,
837 phys_addr_t *out_start,
838 phys_addr_t *out_end, int *out_nid)
840 int idx_a = *idx & 0xffffffff;
841 int idx_b = *idx >> 32;
843 if (WARN_ONCE(nid == MAX_NUMNODES,
844 "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
847 for (; idx_a < type_a->cnt; idx_a++) {
848 struct memblock_region *m = &type_a->regions[idx_a];
850 phys_addr_t m_start = m->base;
851 phys_addr_t m_end = m->base + m->size;
852 int m_nid = memblock_get_region_node(m);
854 /* only memory regions are associated with nodes, check it */
855 if (nid != NUMA_NO_NODE && nid != m_nid)
858 /* skip hotpluggable memory regions if needed */
859 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
862 /* if we want mirror memory skip non-mirror memory regions */
863 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
866 /* skip nomap memory unless we were asked for it explicitly */
867 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
872 *out_start = m_start;
878 *idx = (u32)idx_a | (u64)idx_b << 32;
882 /* scan areas before each reservation */
883 for (; idx_b < type_b->cnt + 1; idx_b++) {
884 struct memblock_region *r;
888 r = &type_b->regions[idx_b];
889 r_start = idx_b ? r[-1].base + r[-1].size : 0;
890 r_end = idx_b < type_b->cnt ?
891 r->base : ULLONG_MAX;
894 * if idx_b advanced past idx_a,
895 * break out to advance idx_a
897 if (r_start >= m_end)
899 /* if the two regions intersect, we're done */
900 if (m_start < r_end) {
903 max(m_start, r_start);
905 *out_end = min(m_end, r_end);
909 * The region which ends first is
910 * advanced for the next iteration.
916 *idx = (u32)idx_a | (u64)idx_b << 32;
922 /* signal end of iteration */
927 * __next_mem_range_rev - generic next function for for_each_*_range_rev()
929 * Finds the next range from type_a which is not marked as unsuitable
932 * @idx: pointer to u64 loop variable
933 * @nid: node selector, %NUMA_NO_NODE for all nodes
934 * @flags: pick from blocks based on memory attributes
935 * @type_a: pointer to memblock_type from where the range is taken
936 * @type_b: pointer to memblock_type which excludes memory from being taken
937 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
938 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
939 * @out_nid: ptr to int for nid of the range, can be %NULL
941 * Reverse of __next_mem_range().
943 void __init_memblock __next_mem_range_rev(u64 *idx, int nid, ulong flags,
944 struct memblock_type *type_a,
945 struct memblock_type *type_b,
946 phys_addr_t *out_start,
947 phys_addr_t *out_end, int *out_nid)
949 int idx_a = *idx & 0xffffffff;
950 int idx_b = *idx >> 32;
952 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
955 if (*idx == (u64)ULLONG_MAX) {
956 idx_a = type_a->cnt - 1;
963 for (; idx_a >= 0; idx_a--) {
964 struct memblock_region *m = &type_a->regions[idx_a];
966 phys_addr_t m_start = m->base;
967 phys_addr_t m_end = m->base + m->size;
968 int m_nid = memblock_get_region_node(m);
970 /* only memory regions are associated with nodes, check it */
971 if (nid != NUMA_NO_NODE && nid != m_nid)
974 /* skip hotpluggable memory regions if needed */
975 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
978 /* if we want mirror memory skip non-mirror memory regions */
979 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
982 /* skip nomap memory unless we were asked for it explicitly */
983 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
988 *out_start = m_start;
994 *idx = (u32)idx_a | (u64)idx_b << 32;
998 /* scan areas before each reservation */
999 for (; idx_b >= 0; idx_b--) {
1000 struct memblock_region *r;
1001 phys_addr_t r_start;
1004 r = &type_b->regions[idx_b];
1005 r_start = idx_b ? r[-1].base + r[-1].size : 0;
1006 r_end = idx_b < type_b->cnt ?
1007 r->base : ULLONG_MAX;
1009 * if idx_b advanced past idx_a,
1010 * break out to advance idx_a
1013 if (r_end <= m_start)
1015 /* if the two regions intersect, we're done */
1016 if (m_end > r_start) {
1018 *out_start = max(m_start, r_start);
1020 *out_end = min(m_end, r_end);
1023 if (m_start >= r_start)
1027 *idx = (u32)idx_a | (u64)idx_b << 32;
1032 /* signal end of iteration */
1036 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1038 * Common iterator interface used to define for_each_mem_range().
1040 void __init_memblock __next_mem_pfn_range(int *idx, int nid,
1041 unsigned long *out_start_pfn,
1042 unsigned long *out_end_pfn, int *out_nid)
1044 struct memblock_type *type = &memblock.memory;
1045 struct memblock_region *r;
1047 while (++*idx < type->cnt) {
1048 r = &type->regions[*idx];
1050 if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size))
1052 if (nid == MAX_NUMNODES || nid == r->nid)
1055 if (*idx >= type->cnt) {
1061 *out_start_pfn = PFN_UP(r->base);
1063 *out_end_pfn = PFN_DOWN(r->base + r->size);
1069 * memblock_set_node - set node ID on memblock regions
1070 * @base: base of area to set node ID for
1071 * @size: size of area to set node ID for
1072 * @type: memblock type to set node ID for
1073 * @nid: node ID to set
1075 * Set the nid of memblock @type regions in [@base,@base+@size) to @nid.
1076 * Regions which cross the area boundaries are split as necessary.
1079 * 0 on success, -errno on failure.
1081 int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size,
1082 struct memblock_type *type, int nid)
1084 int start_rgn, end_rgn;
1087 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
1091 for (i = start_rgn; i < end_rgn; i++)
1092 memblock_set_region_node(&type->regions[i], nid);
1094 memblock_merge_regions(type);
1097 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
1099 static phys_addr_t __init memblock_alloc_range_nid(phys_addr_t size,
1100 phys_addr_t align, phys_addr_t start,
1101 phys_addr_t end, int nid, ulong flags)
1106 align = SMP_CACHE_BYTES;
1108 found = memblock_find_in_range_node(size, align, start, end, nid,
1110 if (found && !memblock_reserve(found, size)) {
1112 * The min_count is set to 0 so that memblock allocations are
1113 * never reported as leaks.
1115 kmemleak_alloc_phys(found, size, 0, 0);
1121 phys_addr_t __init memblock_alloc_range(phys_addr_t size, phys_addr_t align,
1122 phys_addr_t start, phys_addr_t end,
1125 return memblock_alloc_range_nid(size, align, start, end, NUMA_NO_NODE,
1129 static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size,
1130 phys_addr_t align, phys_addr_t max_addr,
1131 int nid, ulong flags)
1133 return memblock_alloc_range_nid(size, align, 0, max_addr, nid, flags);
1136 phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid)
1138 ulong flags = choose_memblock_flags();
1142 ret = memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE,
1145 if (!ret && (flags & MEMBLOCK_MIRROR)) {
1146 flags &= ~MEMBLOCK_MIRROR;
1152 phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
1154 return memblock_alloc_base_nid(size, align, max_addr, NUMA_NO_NODE,
1158 phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
1162 alloc = __memblock_alloc_base(size, align, max_addr);
1165 panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n",
1166 (unsigned long long) size, (unsigned long long) max_addr);
1171 phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align)
1173 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
1176 phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid)
1178 phys_addr_t res = memblock_alloc_nid(size, align, nid);
1182 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
1186 * memblock_virt_alloc_internal - allocate boot memory block
1187 * @size: size of memory block to be allocated in bytes
1188 * @align: alignment of the region and block's size
1189 * @min_addr: the lower bound of the memory region to allocate (phys address)
1190 * @max_addr: the upper bound of the memory region to allocate (phys address)
1191 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1193 * The @min_addr limit is dropped if it can not be satisfied and the allocation
1194 * will fall back to memory below @min_addr. Also, allocation may fall back
1195 * to any node in the system if the specified node can not
1196 * hold the requested memory.
1198 * The allocation is performed from memory region limited by
1199 * memblock.current_limit if @max_addr == %BOOTMEM_ALLOC_ACCESSIBLE.
1201 * The memory block is aligned on SMP_CACHE_BYTES if @align == 0.
1203 * The phys address of allocated boot memory block is converted to virtual and
1204 * allocated memory is reset to 0.
1206 * In addition, function sets the min_count to 0 using kmemleak_alloc for
1207 * allocated boot memory block, so that it is never reported as leaks.
1210 * Virtual address of allocated memory block on success, NULL on failure.
1212 static void * __init memblock_virt_alloc_internal(
1213 phys_addr_t size, phys_addr_t align,
1214 phys_addr_t min_addr, phys_addr_t max_addr,
1219 ulong flags = choose_memblock_flags();
1221 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
1225 * Detect any accidental use of these APIs after slab is ready, as at
1226 * this moment memblock may be deinitialized already and its
1227 * internal data may be destroyed (after execution of free_all_bootmem)
1229 if (WARN_ON_ONCE(slab_is_available()))
1230 return kzalloc_node(size, GFP_NOWAIT, nid);
1233 align = SMP_CACHE_BYTES;
1235 if (max_addr > memblock.current_limit)
1236 max_addr = memblock.current_limit;
1239 alloc = memblock_find_in_range_node(size, align, min_addr, max_addr,
1244 if (nid != NUMA_NO_NODE) {
1245 alloc = memblock_find_in_range_node(size, align, min_addr,
1246 max_addr, NUMA_NO_NODE,
1257 if (flags & MEMBLOCK_MIRROR) {
1258 flags &= ~MEMBLOCK_MIRROR;
1259 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
1266 memblock_reserve(alloc, size);
1267 ptr = phys_to_virt(alloc);
1268 memset(ptr, 0, size);
1271 * The min_count is set to 0 so that bootmem allocated blocks
1272 * are never reported as leaks. This is because many of these blocks
1273 * are only referred via the physical address which is not
1274 * looked up by kmemleak.
1276 kmemleak_alloc(ptr, size, 0, 0);
1282 * memblock_virt_alloc_try_nid_nopanic - allocate boot memory block
1283 * @size: size of memory block to be allocated in bytes
1284 * @align: alignment of the region and block's size
1285 * @min_addr: the lower bound of the memory region from where the allocation
1286 * is preferred (phys address)
1287 * @max_addr: the upper bound of the memory region from where the allocation
1288 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1289 * allocate only from memory limited by memblock.current_limit value
1290 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1292 * Public version of _memblock_virt_alloc_try_nid_nopanic() which provides
1293 * additional debug information (including caller info), if enabled.
1296 * Virtual address of allocated memory block on success, NULL on failure.
1298 void * __init memblock_virt_alloc_try_nid_nopanic(
1299 phys_addr_t size, phys_addr_t align,
1300 phys_addr_t min_addr, phys_addr_t max_addr,
1303 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1304 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1305 (u64)max_addr, (void *)_RET_IP_);
1306 return memblock_virt_alloc_internal(size, align, min_addr,
1311 * memblock_virt_alloc_try_nid - allocate boot memory block with panicking
1312 * @size: size of memory block to be allocated in bytes
1313 * @align: alignment of the region and block's size
1314 * @min_addr: the lower bound of the memory region from where the allocation
1315 * is preferred (phys address)
1316 * @max_addr: the upper bound of the memory region from where the allocation
1317 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1318 * allocate only from memory limited by memblock.current_limit value
1319 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1321 * Public panicking version of _memblock_virt_alloc_try_nid_nopanic()
1322 * which provides debug information (including caller info), if enabled,
1323 * and panics if the request can not be satisfied.
1326 * Virtual address of allocated memory block on success, NULL on failure.
1328 void * __init memblock_virt_alloc_try_nid(
1329 phys_addr_t size, phys_addr_t align,
1330 phys_addr_t min_addr, phys_addr_t max_addr,
1335 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1336 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1337 (u64)max_addr, (void *)_RET_IP_);
1338 ptr = memblock_virt_alloc_internal(size, align,
1339 min_addr, max_addr, nid);
1343 panic("%s: Failed to allocate %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx\n",
1344 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1350 * __memblock_free_early - free boot memory block
1351 * @base: phys starting address of the boot memory block
1352 * @size: size of the boot memory block in bytes
1354 * Free boot memory block previously allocated by memblock_virt_alloc_xx() API.
1355 * The freeing memory will not be released to the buddy allocator.
1357 void __init __memblock_free_early(phys_addr_t base, phys_addr_t size)
1359 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1360 __func__, (u64)base, (u64)base + size - 1,
1362 kmemleak_free_part_phys(base, size);
1363 memblock_remove_range(&memblock.reserved, base, size);
1367 * __memblock_free_late - free bootmem block pages directly to buddy allocator
1368 * @addr: phys starting address of the boot memory block
1369 * @size: size of the boot memory block in bytes
1371 * This is only useful when the bootmem allocator has already been torn
1372 * down, but we are still initializing the system. Pages are released directly
1373 * to the buddy allocator, no bootmem metadata is updated because it is gone.
1375 void __init __memblock_free_late(phys_addr_t base, phys_addr_t size)
1379 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1380 __func__, (u64)base, (u64)base + size - 1,
1382 kmemleak_free_part_phys(base, size);
1383 cursor = PFN_UP(base);
1384 end = PFN_DOWN(base + size);
1386 for (; cursor < end; cursor++) {
1387 __free_pages_bootmem(pfn_to_page(cursor), cursor, 0);
1393 * Remaining API functions
1396 phys_addr_t __init_memblock memblock_phys_mem_size(void)
1398 return memblock.memory.total_size;
1401 phys_addr_t __init_memblock memblock_reserved_size(void)
1403 return memblock.reserved.total_size;
1406 phys_addr_t __init memblock_mem_size(unsigned long limit_pfn)
1408 unsigned long pages = 0;
1409 struct memblock_region *r;
1410 unsigned long start_pfn, end_pfn;
1412 for_each_memblock(memory, r) {
1413 start_pfn = memblock_region_memory_base_pfn(r);
1414 end_pfn = memblock_region_memory_end_pfn(r);
1415 start_pfn = min_t(unsigned long, start_pfn, limit_pfn);
1416 end_pfn = min_t(unsigned long, end_pfn, limit_pfn);
1417 pages += end_pfn - start_pfn;
1420 return PFN_PHYS(pages);
1423 /* lowest address */
1424 phys_addr_t __init_memblock memblock_start_of_DRAM(void)
1426 return memblock.memory.regions[0].base;
1429 phys_addr_t __init_memblock memblock_end_of_DRAM(void)
1431 int idx = memblock.memory.cnt - 1;
1433 return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
1436 static phys_addr_t __init_memblock __find_max_addr(phys_addr_t limit)
1438 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
1439 struct memblock_region *r;
1442 * translate the memory @limit size into the max address within one of
1443 * the memory memblock regions, if the @limit exceeds the total size
1444 * of those regions, max_addr will keep original value ULLONG_MAX
1446 for_each_memblock(memory, r) {
1447 if (limit <= r->size) {
1448 max_addr = r->base + limit;
1457 void __init memblock_enforce_memory_limit(phys_addr_t limit)
1459 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
1464 max_addr = __find_max_addr(limit);
1466 /* @limit exceeds the total size of the memory, do nothing */
1467 if (max_addr == (phys_addr_t)ULLONG_MAX)
1470 /* truncate both memory and reserved regions */
1471 memblock_remove_range(&memblock.memory, max_addr,
1472 (phys_addr_t)ULLONG_MAX);
1473 memblock_remove_range(&memblock.reserved, max_addr,
1474 (phys_addr_t)ULLONG_MAX);
1477 void __init memblock_mem_limit_remove_map(phys_addr_t limit)
1479 struct memblock_type *type = &memblock.memory;
1480 phys_addr_t max_addr;
1481 int i, ret, start_rgn, end_rgn;
1486 max_addr = __find_max_addr(limit);
1488 /* @limit exceeds the total size of the memory, do nothing */
1489 if (max_addr == (phys_addr_t)ULLONG_MAX)
1492 ret = memblock_isolate_range(type, max_addr, (phys_addr_t)ULLONG_MAX,
1493 &start_rgn, &end_rgn);
1497 /* remove all the MAP regions above the limit */
1498 for (i = end_rgn - 1; i >= start_rgn; i--) {
1499 if (!memblock_is_nomap(&type->regions[i]))
1500 memblock_remove_region(type, i);
1502 /* truncate the reserved regions */
1503 memblock_remove_range(&memblock.reserved, max_addr,
1504 (phys_addr_t)ULLONG_MAX);
1507 static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr)
1509 unsigned int left = 0, right = type->cnt;
1512 unsigned int mid = (right + left) / 2;
1514 if (addr < type->regions[mid].base)
1516 else if (addr >= (type->regions[mid].base +
1517 type->regions[mid].size))
1521 } while (left < right);
1525 bool __init memblock_is_reserved(phys_addr_t addr)
1527 return memblock_search(&memblock.reserved, addr) != -1;
1530 bool __init_memblock memblock_is_memory(phys_addr_t addr)
1532 return memblock_search(&memblock.memory, addr) != -1;
1535 int __init_memblock memblock_is_map_memory(phys_addr_t addr)
1537 int i = memblock_search(&memblock.memory, addr);
1541 return !memblock_is_nomap(&memblock.memory.regions[i]);
1544 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1545 int __init_memblock memblock_search_pfn_nid(unsigned long pfn,
1546 unsigned long *start_pfn, unsigned long *end_pfn)
1548 struct memblock_type *type = &memblock.memory;
1549 int mid = memblock_search(type, PFN_PHYS(pfn));
1554 *start_pfn = PFN_DOWN(type->regions[mid].base);
1555 *end_pfn = PFN_DOWN(type->regions[mid].base + type->regions[mid].size);
1557 return type->regions[mid].nid;
1562 * memblock_is_region_memory - check if a region is a subset of memory
1563 * @base: base of region to check
1564 * @size: size of region to check
1566 * Check if the region [@base, @base+@size) is a subset of a memory block.
1569 * 0 if false, non-zero if true
1571 int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size)
1573 int idx = memblock_search(&memblock.memory, base);
1574 phys_addr_t end = base + memblock_cap_size(base, &size);
1578 return memblock.memory.regions[idx].base <= base &&
1579 (memblock.memory.regions[idx].base +
1580 memblock.memory.regions[idx].size) >= end;
1584 * memblock_is_region_reserved - check if a region intersects reserved memory
1585 * @base: base of region to check
1586 * @size: size of region to check
1588 * Check if the region [@base, @base+@size) intersects a reserved memory block.
1591 * True if they intersect, false if not.
1593 bool __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size)
1595 memblock_cap_size(base, &size);
1596 return memblock_overlaps_region(&memblock.reserved, base, size);
1599 void __init_memblock memblock_trim_memory(phys_addr_t align)
1601 phys_addr_t start, end, orig_start, orig_end;
1602 struct memblock_region *r;
1604 for_each_memblock(memory, r) {
1605 orig_start = r->base;
1606 orig_end = r->base + r->size;
1607 start = round_up(orig_start, align);
1608 end = round_down(orig_end, align);
1610 if (start == orig_start && end == orig_end)
1615 r->size = end - start;
1617 memblock_remove_region(&memblock.memory,
1618 r - memblock.memory.regions);
1624 void __init_memblock memblock_set_current_limit(phys_addr_t limit)
1626 memblock.current_limit = limit;
1629 phys_addr_t __init_memblock memblock_get_current_limit(void)
1631 return memblock.current_limit;
1634 static void __init_memblock memblock_dump(struct memblock_type *type, char *name)
1636 unsigned long long base, size;
1637 unsigned long flags;
1639 struct memblock_region *rgn;
1641 pr_info(" %s.cnt = 0x%lx\n", name, type->cnt);
1643 for_each_memblock_type(type, rgn) {
1644 char nid_buf[32] = "";
1649 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1650 if (memblock_get_region_node(rgn) != MAX_NUMNODES)
1651 snprintf(nid_buf, sizeof(nid_buf), " on node %d",
1652 memblock_get_region_node(rgn));
1654 pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s flags: %#lx\n",
1655 name, idx, base, base + size - 1, size, nid_buf, flags);
1659 extern unsigned long __init_memblock
1660 memblock_reserved_memory_within(phys_addr_t start_addr, phys_addr_t end_addr)
1662 struct memblock_region *rgn;
1663 unsigned long size = 0;
1666 for_each_memblock_type((&memblock.reserved), rgn) {
1667 phys_addr_t start, end;
1669 if (rgn->base + rgn->size < start_addr)
1671 if (rgn->base > end_addr)
1675 end = start + rgn->size;
1676 size += end - start;
1682 void __init_memblock __memblock_dump_all(void)
1684 pr_info("MEMBLOCK configuration:\n");
1685 pr_info(" memory size = %#llx reserved size = %#llx\n",
1686 (unsigned long long)memblock.memory.total_size,
1687 (unsigned long long)memblock.reserved.total_size);
1689 memblock_dump(&memblock.memory, "memory");
1690 memblock_dump(&memblock.reserved, "reserved");
1693 void __init memblock_allow_resize(void)
1695 memblock_can_resize = 1;
1698 static int __init early_memblock(char *p)
1700 if (p && strstr(p, "debug"))
1704 early_param("memblock", early_memblock);
1706 #if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
1708 static int memblock_debug_show(struct seq_file *m, void *private)
1710 struct memblock_type *type = m->private;
1711 struct memblock_region *reg;
1714 for (i = 0; i < type->cnt; i++) {
1715 reg = &type->regions[i];
1716 seq_printf(m, "%4d: ", i);
1717 if (sizeof(phys_addr_t) == 4)
1718 seq_printf(m, "0x%08lx..0x%08lx\n",
1719 (unsigned long)reg->base,
1720 (unsigned long)(reg->base + reg->size - 1));
1722 seq_printf(m, "0x%016llx..0x%016llx\n",
1723 (unsigned long long)reg->base,
1724 (unsigned long long)(reg->base + reg->size - 1));
1730 static int memblock_debug_open(struct inode *inode, struct file *file)
1732 return single_open(file, memblock_debug_show, inode->i_private);
1735 static const struct file_operations memblock_debug_fops = {
1736 .open = memblock_debug_open,
1738 .llseek = seq_lseek,
1739 .release = single_release,
1742 static int __init memblock_init_debugfs(void)
1744 struct dentry *root = debugfs_create_dir("memblock", NULL);
1747 debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops);
1748 debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops);
1749 #ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
1750 debugfs_create_file("physmem", S_IRUGO, root, &memblock.physmem, &memblock_debug_fops);
1755 __initcall(memblock_init_debugfs);
1757 #endif /* CONFIG_DEBUG_FS */