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-generic/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.
189 * When allocation direction is bottom-up, the @start should be greater
190 * than the end of the kernel image. Otherwise, it will be trimmed. The
191 * reason is that we want the bottom-up allocation just near the kernel
192 * image so it is highly likely that the allocated memory and the kernel
193 * will reside in the same node.
195 * If bottom-up allocation failed, will try to allocate memory top-down.
198 * Found address on success, 0 on failure.
200 phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t size,
201 phys_addr_t align, phys_addr_t start,
202 phys_addr_t end, int nid, ulong flags)
204 phys_addr_t kernel_end, ret;
207 if (end == MEMBLOCK_ALLOC_ACCESSIBLE)
208 end = memblock.current_limit;
210 /* avoid allocating the first page */
211 start = max_t(phys_addr_t, start, PAGE_SIZE);
212 end = max(start, end);
213 kernel_end = __pa_symbol(_end);
216 * try bottom-up allocation only when bottom-up mode
217 * is set and @end is above the kernel image.
219 if (memblock_bottom_up() && end > kernel_end) {
220 phys_addr_t bottom_up_start;
222 /* make sure we will allocate above the kernel */
223 bottom_up_start = max(start, kernel_end);
225 /* ok, try bottom-up allocation first */
226 ret = __memblock_find_range_bottom_up(bottom_up_start, end,
227 size, align, nid, flags);
232 * we always limit bottom-up allocation above the kernel,
233 * but top-down allocation doesn't have the limit, so
234 * retrying top-down allocation may succeed when bottom-up
237 * bottom-up allocation is expected to be fail very rarely,
238 * so we use WARN_ONCE() here to see the stack trace if
241 WARN_ONCE(1, "memblock: bottom-up allocation failed, "
242 "memory hotunplug may be affected\n");
245 return __memblock_find_range_top_down(start, end, size, align, nid,
250 * memblock_find_in_range - find free area in given range
251 * @start: start of candidate range
252 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
253 * @size: size of free area to find
254 * @align: alignment of free area to find
256 * Find @size free area aligned to @align in the specified range.
259 * Found address on success, 0 on failure.
261 phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start,
262 phys_addr_t end, phys_addr_t size,
266 ulong flags = choose_memblock_flags();
269 ret = memblock_find_in_range_node(size, align, start, end,
270 NUMA_NO_NODE, flags);
272 if (!ret && (flags & MEMBLOCK_MIRROR)) {
273 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
275 flags &= ~MEMBLOCK_MIRROR;
282 static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r)
284 type->total_size -= type->regions[r].size;
285 memmove(&type->regions[r], &type->regions[r + 1],
286 (type->cnt - (r + 1)) * sizeof(type->regions[r]));
289 /* Special case for empty arrays */
290 if (type->cnt == 0) {
291 WARN_ON(type->total_size != 0);
293 type->regions[0].base = 0;
294 type->regions[0].size = 0;
295 type->regions[0].flags = 0;
296 memblock_set_region_node(&type->regions[0], MAX_NUMNODES);
300 #ifdef CONFIG_ARCH_DISCARD_MEMBLOCK
302 phys_addr_t __init_memblock get_allocated_memblock_reserved_regions_info(
305 if (memblock.reserved.regions == memblock_reserved_init_regions)
308 *addr = __pa(memblock.reserved.regions);
310 return PAGE_ALIGN(sizeof(struct memblock_region) *
311 memblock.reserved.max);
314 phys_addr_t __init_memblock get_allocated_memblock_memory_regions_info(
317 if (memblock.memory.regions == memblock_memory_init_regions)
320 *addr = __pa(memblock.memory.regions);
322 return PAGE_ALIGN(sizeof(struct memblock_region) *
323 memblock.memory.max);
329 * memblock_double_array - double the size of the memblock regions array
330 * @type: memblock type of the regions array being doubled
331 * @new_area_start: starting address of memory range to avoid overlap with
332 * @new_area_size: size of memory range to avoid overlap with
334 * Double the size of the @type regions array. If memblock is being used to
335 * allocate memory for a new reserved regions array and there is a previously
336 * allocated memory range [@new_area_start,@new_area_start+@new_area_size]
337 * waiting to be reserved, ensure the memory used by the new array does
341 * 0 on success, -1 on failure.
343 static int __init_memblock memblock_double_array(struct memblock_type *type,
344 phys_addr_t new_area_start,
345 phys_addr_t new_area_size)
347 struct memblock_region *new_array, *old_array;
348 phys_addr_t old_alloc_size, new_alloc_size;
349 phys_addr_t old_size, new_size, addr;
350 int use_slab = slab_is_available();
353 /* We don't allow resizing until we know about the reserved regions
354 * of memory that aren't suitable for allocation
356 if (!memblock_can_resize)
359 /* Calculate new doubled size */
360 old_size = type->max * sizeof(struct memblock_region);
361 new_size = old_size << 1;
363 * We need to allocated new one align to PAGE_SIZE,
364 * so we can free them completely later.
366 old_alloc_size = PAGE_ALIGN(old_size);
367 new_alloc_size = PAGE_ALIGN(new_size);
369 /* Retrieve the slab flag */
370 if (type == &memblock.memory)
371 in_slab = &memblock_memory_in_slab;
373 in_slab = &memblock_reserved_in_slab;
375 /* Try to find some space for it.
377 * WARNING: We assume that either slab_is_available() and we use it or
378 * we use MEMBLOCK for allocations. That means that this is unsafe to
379 * use when bootmem is currently active (unless bootmem itself is
380 * implemented on top of MEMBLOCK which isn't the case yet)
382 * This should however not be an issue for now, as we currently only
383 * call into MEMBLOCK while it's still active, or much later when slab
384 * is active for memory hotplug operations
387 new_array = kmalloc(new_size, GFP_KERNEL);
388 addr = new_array ? __pa(new_array) : 0;
390 /* only exclude range when trying to double reserved.regions */
391 if (type != &memblock.reserved)
392 new_area_start = new_area_size = 0;
394 addr = memblock_find_in_range(new_area_start + new_area_size,
395 memblock.current_limit,
396 new_alloc_size, PAGE_SIZE);
397 if (!addr && new_area_size)
398 addr = memblock_find_in_range(0,
399 min(new_area_start, memblock.current_limit),
400 new_alloc_size, PAGE_SIZE);
402 new_array = addr ? __va(addr) : NULL;
405 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
406 memblock_type_name(type), type->max, type->max * 2);
410 memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]",
411 memblock_type_name(type), type->max * 2, (u64)addr,
412 (u64)addr + new_size - 1);
415 * Found space, we now need to move the array over before we add the
416 * reserved region since it may be our reserved array itself that is
419 memcpy(new_array, type->regions, old_size);
420 memset(new_array + type->max, 0, old_size);
421 old_array = type->regions;
422 type->regions = new_array;
425 /* Free old array. We needn't free it if the array is the static one */
428 else if (old_array != memblock_memory_init_regions &&
429 old_array != memblock_reserved_init_regions)
430 memblock_free(__pa(old_array), old_alloc_size);
433 * Reserve the new array if that comes from the memblock. Otherwise, we
437 BUG_ON(memblock_reserve(addr, new_alloc_size));
439 /* Update slab flag */
446 * memblock_merge_regions - merge neighboring compatible regions
447 * @type: memblock type to scan
449 * Scan @type and merge neighboring compatible regions.
451 static void __init_memblock memblock_merge_regions(struct memblock_type *type)
455 /* cnt never goes below 1 */
456 while (i < type->cnt - 1) {
457 struct memblock_region *this = &type->regions[i];
458 struct memblock_region *next = &type->regions[i + 1];
460 if (this->base + this->size != next->base ||
461 memblock_get_region_node(this) !=
462 memblock_get_region_node(next) ||
463 this->flags != next->flags) {
464 BUG_ON(this->base + this->size > next->base);
469 this->size += next->size;
470 /* move forward from next + 1, index of which is i + 2 */
471 memmove(next, next + 1, (type->cnt - (i + 2)) * sizeof(*next));
477 * memblock_insert_region - insert new memblock region
478 * @type: memblock type to insert into
479 * @idx: index for the insertion point
480 * @base: base address of the new region
481 * @size: size of the new region
482 * @nid: node id of the new region
483 * @flags: flags of the new region
485 * Insert new memblock region [@base,@base+@size) into @type at @idx.
486 * @type must already have extra room to accomodate the new region.
488 static void __init_memblock memblock_insert_region(struct memblock_type *type,
489 int idx, phys_addr_t base,
491 int nid, unsigned long flags)
493 struct memblock_region *rgn = &type->regions[idx];
495 BUG_ON(type->cnt >= type->max);
496 memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn));
500 memblock_set_region_node(rgn, nid);
502 type->total_size += size;
506 * memblock_add_range - add new memblock region
507 * @type: memblock type to add new region into
508 * @base: base address of the new region
509 * @size: size of the new region
510 * @nid: nid of the new region
511 * @flags: flags of the new region
513 * Add new memblock region [@base,@base+@size) into @type. The new region
514 * is allowed to overlap with existing ones - overlaps don't affect already
515 * existing regions. @type is guaranteed to be minimal (all neighbouring
516 * compatible regions are merged) after the addition.
519 * 0 on success, -errno on failure.
521 int __init_memblock memblock_add_range(struct memblock_type *type,
522 phys_addr_t base, phys_addr_t size,
523 int nid, unsigned long flags)
526 phys_addr_t obase = base;
527 phys_addr_t end = base + memblock_cap_size(base, &size);
529 struct memblock_region *rgn;
534 /* special case for empty array */
535 if (type->regions[0].size == 0) {
536 WARN_ON(type->cnt != 1 || type->total_size);
537 type->regions[0].base = base;
538 type->regions[0].size = size;
539 type->regions[0].flags = flags;
540 memblock_set_region_node(&type->regions[0], nid);
541 type->total_size = size;
546 * The following is executed twice. Once with %false @insert and
547 * then with %true. The first counts the number of regions needed
548 * to accomodate the new area. The second actually inserts them.
553 for_each_memblock_type(type, rgn) {
554 phys_addr_t rbase = rgn->base;
555 phys_addr_t rend = rbase + rgn->size;
562 * @rgn overlaps. If it separates the lower part of new
563 * area, insert that portion.
566 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
567 WARN_ON(nid != memblock_get_region_node(rgn));
569 WARN_ON(flags != rgn->flags);
572 memblock_insert_region(type, idx++, base,
576 /* area below @rend is dealt with, forget about it */
577 base = min(rend, end);
580 /* insert the remaining portion */
584 memblock_insert_region(type, idx, base, end - base,
592 * If this was the first round, resize array and repeat for actual
593 * insertions; otherwise, merge and return.
596 while (type->cnt + nr_new > type->max)
597 if (memblock_double_array(type, obase, size) < 0)
602 memblock_merge_regions(type);
607 int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size,
610 return memblock_add_range(&memblock.memory, base, size, nid, 0);
613 static int __init_memblock memblock_add_region(phys_addr_t base,
618 memblock_dbg("memblock_add: [%#016llx-%#016llx] flags %#02lx %pF\n",
619 (unsigned long long)base,
620 (unsigned long long)base + size - 1,
621 flags, (void *)_RET_IP_);
623 return memblock_add_range(&memblock.memory, base, size, nid, flags);
626 int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size)
628 return memblock_add_region(base, size, MAX_NUMNODES, 0);
632 * memblock_isolate_range - isolate given range into disjoint memblocks
633 * @type: memblock type to isolate range for
634 * @base: base of range to isolate
635 * @size: size of range to isolate
636 * @start_rgn: out parameter for the start of isolated region
637 * @end_rgn: out parameter for the end of isolated region
639 * Walk @type and ensure that regions don't cross the boundaries defined by
640 * [@base,@base+@size). Crossing regions are split at the boundaries,
641 * which may create at most two more regions. The index of the first
642 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
645 * 0 on success, -errno on failure.
647 static int __init_memblock memblock_isolate_range(struct memblock_type *type,
648 phys_addr_t base, phys_addr_t size,
649 int *start_rgn, int *end_rgn)
651 phys_addr_t end = base + memblock_cap_size(base, &size);
653 struct memblock_region *rgn;
655 *start_rgn = *end_rgn = 0;
660 /* we'll create at most two more regions */
661 while (type->cnt + 2 > type->max)
662 if (memblock_double_array(type, base, size) < 0)
665 for_each_memblock_type(type, rgn) {
666 phys_addr_t rbase = rgn->base;
667 phys_addr_t rend = rbase + rgn->size;
676 * @rgn intersects from below. Split and continue
677 * to process the next region - the new top half.
680 rgn->size -= base - rbase;
681 type->total_size -= base - rbase;
682 memblock_insert_region(type, idx, rbase, base - rbase,
683 memblock_get_region_node(rgn),
685 } else if (rend > end) {
687 * @rgn intersects from above. Split and redo the
688 * current region - the new bottom half.
691 rgn->size -= end - rbase;
692 type->total_size -= end - rbase;
693 memblock_insert_region(type, idx--, rbase, end - rbase,
694 memblock_get_region_node(rgn),
697 /* @rgn is fully contained, record it */
707 static int __init_memblock memblock_remove_range(struct memblock_type *type,
708 phys_addr_t base, phys_addr_t size)
710 int start_rgn, end_rgn;
713 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
717 for (i = end_rgn - 1; i >= start_rgn; i--)
718 memblock_remove_region(type, i);
722 int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size)
724 return memblock_remove_range(&memblock.memory, base, size);
728 int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size)
730 memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n",
731 (unsigned long long)base,
732 (unsigned long long)base + size - 1,
735 kmemleak_free_part(__va(base), size);
736 return memblock_remove_range(&memblock.reserved, base, size);
739 static int __init_memblock memblock_reserve_region(phys_addr_t base,
744 memblock_dbg("memblock_reserve: [%#016llx-%#016llx] flags %#02lx %pF\n",
745 (unsigned long long)base,
746 (unsigned long long)base + size - 1,
747 flags, (void *)_RET_IP_);
749 return memblock_add_range(&memblock.reserved, base, size, nid, flags);
752 int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size)
754 return memblock_reserve_region(base, size, MAX_NUMNODES, 0);
759 * This function isolates region [@base, @base + @size), and sets/clears flag
761 * Return 0 on success, -errno on failure.
763 static int __init_memblock memblock_setclr_flag(phys_addr_t base,
764 phys_addr_t size, int set, int flag)
766 struct memblock_type *type = &memblock.memory;
767 int i, ret, start_rgn, end_rgn;
769 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
773 for (i = start_rgn; i < end_rgn; i++)
775 memblock_set_region_flags(&type->regions[i], flag);
777 memblock_clear_region_flags(&type->regions[i], flag);
779 memblock_merge_regions(type);
784 * memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG.
785 * @base: the base phys addr of the region
786 * @size: the size of the region
788 * Return 0 on success, -errno on failure.
790 int __init_memblock memblock_mark_hotplug(phys_addr_t base, phys_addr_t size)
792 return memblock_setclr_flag(base, size, 1, MEMBLOCK_HOTPLUG);
796 * memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region.
797 * @base: the base phys addr of the region
798 * @size: the size of the region
800 * Return 0 on success, -errno on failure.
802 int __init_memblock memblock_clear_hotplug(phys_addr_t base, phys_addr_t size)
804 return memblock_setclr_flag(base, size, 0, MEMBLOCK_HOTPLUG);
808 * memblock_mark_mirror - Mark mirrored memory with flag MEMBLOCK_MIRROR.
809 * @base: the base phys addr of the region
810 * @size: the size of the region
812 * Return 0 on success, -errno on failure.
814 int __init_memblock memblock_mark_mirror(phys_addr_t base, phys_addr_t size)
816 system_has_some_mirror = true;
818 return memblock_setclr_flag(base, size, 1, MEMBLOCK_MIRROR);
822 * memblock_mark_nomap - Mark a memory region with flag MEMBLOCK_NOMAP.
823 * @base: the base phys addr of the region
824 * @size: the size of the region
826 * Return 0 on success, -errno on failure.
828 int __init_memblock memblock_mark_nomap(phys_addr_t base, phys_addr_t size)
830 return memblock_setclr_flag(base, size, 1, MEMBLOCK_NOMAP);
834 * __next_reserved_mem_region - next function for for_each_reserved_region()
835 * @idx: pointer to u64 loop variable
836 * @out_start: ptr to phys_addr_t for start address of the region, can be %NULL
837 * @out_end: ptr to phys_addr_t for end address of the region, can be %NULL
839 * Iterate over all reserved memory regions.
841 void __init_memblock __next_reserved_mem_region(u64 *idx,
842 phys_addr_t *out_start,
843 phys_addr_t *out_end)
845 struct memblock_type *type = &memblock.reserved;
847 if (*idx >= 0 && *idx < type->cnt) {
848 struct memblock_region *r = &type->regions[*idx];
849 phys_addr_t base = r->base;
850 phys_addr_t size = r->size;
855 *out_end = base + size - 1;
861 /* signal end of iteration */
866 * __next__mem_range - next function for for_each_free_mem_range() etc.
867 * @idx: pointer to u64 loop variable
868 * @nid: node selector, %NUMA_NO_NODE for all nodes
869 * @flags: pick from blocks based on memory attributes
870 * @type_a: pointer to memblock_type from where the range is taken
871 * @type_b: pointer to memblock_type which excludes memory from being taken
872 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
873 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
874 * @out_nid: ptr to int for nid of the range, can be %NULL
876 * Find the first area from *@idx which matches @nid, fill the out
877 * parameters, and update *@idx for the next iteration. The lower 32bit of
878 * *@idx contains index into type_a and the upper 32bit indexes the
879 * areas before each region in type_b. For example, if type_b regions
880 * look like the following,
882 * 0:[0-16), 1:[32-48), 2:[128-130)
884 * The upper 32bit indexes the following regions.
886 * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX)
888 * As both region arrays are sorted, the function advances the two indices
889 * in lockstep and returns each intersection.
891 void __init_memblock __next_mem_range(u64 *idx, int nid, ulong flags,
892 struct memblock_type *type_a,
893 struct memblock_type *type_b,
894 phys_addr_t *out_start,
895 phys_addr_t *out_end, int *out_nid)
897 int idx_a = *idx & 0xffffffff;
898 int idx_b = *idx >> 32;
900 if (WARN_ONCE(nid == MAX_NUMNODES,
901 "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
904 for (; idx_a < type_a->cnt; idx_a++) {
905 struct memblock_region *m = &type_a->regions[idx_a];
907 phys_addr_t m_start = m->base;
908 phys_addr_t m_end = m->base + m->size;
909 int m_nid = memblock_get_region_node(m);
911 /* only memory regions are associated with nodes, check it */
912 if (nid != NUMA_NO_NODE && nid != m_nid)
915 /* skip hotpluggable memory regions if needed */
916 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
919 /* if we want mirror memory skip non-mirror memory regions */
920 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
923 /* skip nomap memory unless we were asked for it explicitly */
924 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
929 *out_start = m_start;
935 *idx = (u32)idx_a | (u64)idx_b << 32;
939 /* scan areas before each reservation */
940 for (; idx_b < type_b->cnt + 1; idx_b++) {
941 struct memblock_region *r;
945 r = &type_b->regions[idx_b];
946 r_start = idx_b ? r[-1].base + r[-1].size : 0;
947 r_end = idx_b < type_b->cnt ?
948 r->base : ULLONG_MAX;
951 * if idx_b advanced past idx_a,
952 * break out to advance idx_a
954 if (r_start >= m_end)
956 /* if the two regions intersect, we're done */
957 if (m_start < r_end) {
960 max(m_start, r_start);
962 *out_end = min(m_end, r_end);
966 * The region which ends first is
967 * advanced for the next iteration.
973 *idx = (u32)idx_a | (u64)idx_b << 32;
979 /* signal end of iteration */
984 * __next_mem_range_rev - generic next function for for_each_*_range_rev()
986 * Finds the next range from type_a which is not marked as unsuitable
989 * @idx: pointer to u64 loop variable
990 * @nid: node selector, %NUMA_NO_NODE for all nodes
991 * @flags: pick from blocks based on memory attributes
992 * @type_a: pointer to memblock_type from where the range is taken
993 * @type_b: pointer to memblock_type which excludes memory from being taken
994 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
995 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
996 * @out_nid: ptr to int for nid of the range, can be %NULL
998 * Reverse of __next_mem_range().
1000 void __init_memblock __next_mem_range_rev(u64 *idx, int nid, ulong flags,
1001 struct memblock_type *type_a,
1002 struct memblock_type *type_b,
1003 phys_addr_t *out_start,
1004 phys_addr_t *out_end, int *out_nid)
1006 int idx_a = *idx & 0xffffffff;
1007 int idx_b = *idx >> 32;
1009 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
1012 if (*idx == (u64)ULLONG_MAX) {
1013 idx_a = type_a->cnt - 1;
1014 idx_b = type_b->cnt;
1017 for (; idx_a >= 0; idx_a--) {
1018 struct memblock_region *m = &type_a->regions[idx_a];
1020 phys_addr_t m_start = m->base;
1021 phys_addr_t m_end = m->base + m->size;
1022 int m_nid = memblock_get_region_node(m);
1024 /* only memory regions are associated with nodes, check it */
1025 if (nid != NUMA_NO_NODE && nid != m_nid)
1028 /* skip hotpluggable memory regions if needed */
1029 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
1032 /* if we want mirror memory skip non-mirror memory regions */
1033 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
1036 /* skip nomap memory unless we were asked for it explicitly */
1037 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
1042 *out_start = m_start;
1048 *idx = (u32)idx_a | (u64)idx_b << 32;
1052 /* scan areas before each reservation */
1053 for (; idx_b >= 0; idx_b--) {
1054 struct memblock_region *r;
1055 phys_addr_t r_start;
1058 r = &type_b->regions[idx_b];
1059 r_start = idx_b ? r[-1].base + r[-1].size : 0;
1060 r_end = idx_b < type_b->cnt ?
1061 r->base : ULLONG_MAX;
1063 * if idx_b advanced past idx_a,
1064 * break out to advance idx_a
1067 if (r_end <= m_start)
1069 /* if the two regions intersect, we're done */
1070 if (m_end > r_start) {
1072 *out_start = max(m_start, r_start);
1074 *out_end = min(m_end, r_end);
1077 if (m_start >= r_start)
1081 *idx = (u32)idx_a | (u64)idx_b << 32;
1086 /* signal end of iteration */
1090 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1092 * Common iterator interface used to define for_each_mem_range().
1094 void __init_memblock __next_mem_pfn_range(int *idx, int nid,
1095 unsigned long *out_start_pfn,
1096 unsigned long *out_end_pfn, int *out_nid)
1098 struct memblock_type *type = &memblock.memory;
1099 struct memblock_region *r;
1101 while (++*idx < type->cnt) {
1102 r = &type->regions[*idx];
1104 if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size))
1106 if (nid == MAX_NUMNODES || nid == r->nid)
1109 if (*idx >= type->cnt) {
1115 *out_start_pfn = PFN_UP(r->base);
1117 *out_end_pfn = PFN_DOWN(r->base + r->size);
1123 * memblock_set_node - set node ID on memblock regions
1124 * @base: base of area to set node ID for
1125 * @size: size of area to set node ID for
1126 * @type: memblock type to set node ID for
1127 * @nid: node ID to set
1129 * Set the nid of memblock @type regions in [@base,@base+@size) to @nid.
1130 * Regions which cross the area boundaries are split as necessary.
1133 * 0 on success, -errno on failure.
1135 int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size,
1136 struct memblock_type *type, int nid)
1138 int start_rgn, end_rgn;
1141 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
1145 for (i = start_rgn; i < end_rgn; i++)
1146 memblock_set_region_node(&type->regions[i], nid);
1148 memblock_merge_regions(type);
1151 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
1153 static phys_addr_t __init memblock_alloc_range_nid(phys_addr_t size,
1154 phys_addr_t align, phys_addr_t start,
1155 phys_addr_t end, int nid, ulong flags)
1160 align = SMP_CACHE_BYTES;
1162 found = memblock_find_in_range_node(size, align, start, end, nid,
1164 if (found && !memblock_reserve(found, size)) {
1166 * The min_count is set to 0 so that memblock allocations are
1167 * never reported as leaks.
1169 kmemleak_alloc(__va(found), size, 0, 0);
1175 phys_addr_t __init memblock_alloc_range(phys_addr_t size, phys_addr_t align,
1176 phys_addr_t start, phys_addr_t end,
1179 return memblock_alloc_range_nid(size, align, start, end, NUMA_NO_NODE,
1183 static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size,
1184 phys_addr_t align, phys_addr_t max_addr,
1185 int nid, ulong flags)
1187 return memblock_alloc_range_nid(size, align, 0, max_addr, nid, flags);
1190 phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid)
1192 ulong flags = choose_memblock_flags();
1196 ret = memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE,
1199 if (!ret && (flags & MEMBLOCK_MIRROR)) {
1200 flags &= ~MEMBLOCK_MIRROR;
1206 phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
1208 return memblock_alloc_base_nid(size, align, max_addr, NUMA_NO_NODE,
1212 phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
1216 alloc = __memblock_alloc_base(size, align, max_addr);
1219 panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n",
1220 (unsigned long long) size, (unsigned long long) max_addr);
1225 phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align)
1227 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
1230 phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid)
1232 phys_addr_t res = memblock_alloc_nid(size, align, nid);
1236 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
1240 * memblock_virt_alloc_internal - allocate boot memory block
1241 * @size: size of memory block to be allocated in bytes
1242 * @align: alignment of the region and block's size
1243 * @min_addr: the lower bound of the memory region to allocate (phys address)
1244 * @max_addr: the upper bound of the memory region to allocate (phys address)
1245 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1247 * The @min_addr limit is dropped if it can not be satisfied and the allocation
1248 * will fall back to memory below @min_addr. Also, allocation may fall back
1249 * to any node in the system if the specified node can not
1250 * hold the requested memory.
1252 * The allocation is performed from memory region limited by
1253 * memblock.current_limit if @max_addr == %BOOTMEM_ALLOC_ACCESSIBLE.
1255 * The memory block is aligned on SMP_CACHE_BYTES if @align == 0.
1257 * The phys address of allocated boot memory block is converted to virtual and
1258 * allocated memory is reset to 0.
1260 * In addition, function sets the min_count to 0 using kmemleak_alloc for
1261 * allocated boot memory block, so that it is never reported as leaks.
1264 * Virtual address of allocated memory block on success, NULL on failure.
1266 static void * __init memblock_virt_alloc_internal(
1267 phys_addr_t size, phys_addr_t align,
1268 phys_addr_t min_addr, phys_addr_t max_addr,
1273 ulong flags = choose_memblock_flags();
1275 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
1279 * Detect any accidental use of these APIs after slab is ready, as at
1280 * this moment memblock may be deinitialized already and its
1281 * internal data may be destroyed (after execution of free_all_bootmem)
1283 if (WARN_ON_ONCE(slab_is_available()))
1284 return kzalloc_node(size, GFP_NOWAIT, nid);
1287 align = SMP_CACHE_BYTES;
1289 if (max_addr > memblock.current_limit)
1290 max_addr = memblock.current_limit;
1293 alloc = memblock_find_in_range_node(size, align, min_addr, max_addr,
1298 if (nid != NUMA_NO_NODE) {
1299 alloc = memblock_find_in_range_node(size, align, min_addr,
1300 max_addr, NUMA_NO_NODE,
1311 if (flags & MEMBLOCK_MIRROR) {
1312 flags &= ~MEMBLOCK_MIRROR;
1313 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
1320 memblock_reserve(alloc, size);
1321 ptr = phys_to_virt(alloc);
1322 memset(ptr, 0, size);
1325 * The min_count is set to 0 so that bootmem allocated blocks
1326 * are never reported as leaks. This is because many of these blocks
1327 * are only referred via the physical address which is not
1328 * looked up by kmemleak.
1330 kmemleak_alloc(ptr, size, 0, 0);
1336 * memblock_virt_alloc_try_nid_nopanic - allocate boot memory block
1337 * @size: size of memory block to be allocated in bytes
1338 * @align: alignment of the region and block's size
1339 * @min_addr: the lower bound of the memory region from where the allocation
1340 * is preferred (phys address)
1341 * @max_addr: the upper bound of the memory region from where the allocation
1342 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1343 * allocate only from memory limited by memblock.current_limit value
1344 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1346 * Public version of _memblock_virt_alloc_try_nid_nopanic() which provides
1347 * additional debug information (including caller info), if enabled.
1350 * Virtual address of allocated memory block on success, NULL on failure.
1352 void * __init memblock_virt_alloc_try_nid_nopanic(
1353 phys_addr_t size, phys_addr_t align,
1354 phys_addr_t min_addr, phys_addr_t max_addr,
1357 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1358 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1359 (u64)max_addr, (void *)_RET_IP_);
1360 return memblock_virt_alloc_internal(size, align, min_addr,
1365 * memblock_virt_alloc_try_nid - allocate boot memory block with panicking
1366 * @size: size of memory block to be allocated in bytes
1367 * @align: alignment of the region and block's size
1368 * @min_addr: the lower bound of the memory region from where the allocation
1369 * is preferred (phys address)
1370 * @max_addr: the upper bound of the memory region from where the allocation
1371 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1372 * allocate only from memory limited by memblock.current_limit value
1373 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1375 * Public panicking version of _memblock_virt_alloc_try_nid_nopanic()
1376 * which provides debug information (including caller info), if enabled,
1377 * and panics if the request can not be satisfied.
1380 * Virtual address of allocated memory block on success, NULL on failure.
1382 void * __init memblock_virt_alloc_try_nid(
1383 phys_addr_t size, phys_addr_t align,
1384 phys_addr_t min_addr, phys_addr_t max_addr,
1389 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1390 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1391 (u64)max_addr, (void *)_RET_IP_);
1392 ptr = memblock_virt_alloc_internal(size, align,
1393 min_addr, max_addr, nid);
1397 panic("%s: Failed to allocate %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx\n",
1398 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1404 * __memblock_free_early - free boot memory block
1405 * @base: phys starting address of the boot memory block
1406 * @size: size of the boot memory block in bytes
1408 * Free boot memory block previously allocated by memblock_virt_alloc_xx() API.
1409 * The freeing memory will not be released to the buddy allocator.
1411 void __init __memblock_free_early(phys_addr_t base, phys_addr_t size)
1413 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1414 __func__, (u64)base, (u64)base + size - 1,
1416 kmemleak_free_part(__va(base), size);
1417 memblock_remove_range(&memblock.reserved, base, size);
1421 * __memblock_free_late - free bootmem block pages directly to buddy allocator
1422 * @addr: phys starting address of the boot memory block
1423 * @size: size of the boot memory block in bytes
1425 * This is only useful when the bootmem allocator has already been torn
1426 * down, but we are still initializing the system. Pages are released directly
1427 * to the buddy allocator, no bootmem metadata is updated because it is gone.
1429 void __init __memblock_free_late(phys_addr_t base, phys_addr_t size)
1433 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1434 __func__, (u64)base, (u64)base + size - 1,
1436 kmemleak_free_part(__va(base), size);
1437 cursor = PFN_UP(base);
1438 end = PFN_DOWN(base + size);
1440 for (; cursor < end; cursor++) {
1441 __free_pages_bootmem(pfn_to_page(cursor), cursor, 0);
1447 * Remaining API functions
1450 phys_addr_t __init_memblock memblock_phys_mem_size(void)
1452 return memblock.memory.total_size;
1455 phys_addr_t __init memblock_mem_size(unsigned long limit_pfn)
1457 unsigned long pages = 0;
1458 struct memblock_region *r;
1459 unsigned long start_pfn, end_pfn;
1461 for_each_memblock(memory, r) {
1462 start_pfn = memblock_region_memory_base_pfn(r);
1463 end_pfn = memblock_region_memory_end_pfn(r);
1464 start_pfn = min_t(unsigned long, start_pfn, limit_pfn);
1465 end_pfn = min_t(unsigned long, end_pfn, limit_pfn);
1466 pages += end_pfn - start_pfn;
1469 return PFN_PHYS(pages);
1472 /* lowest address */
1473 phys_addr_t __init_memblock memblock_start_of_DRAM(void)
1475 return memblock.memory.regions[0].base;
1478 phys_addr_t __init_memblock memblock_end_of_DRAM(void)
1480 int idx = memblock.memory.cnt - 1;
1482 return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
1485 void __init memblock_enforce_memory_limit(phys_addr_t limit)
1487 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
1488 struct memblock_region *r;
1493 /* find out max address */
1494 for_each_memblock(memory, r) {
1495 if (limit <= r->size) {
1496 max_addr = r->base + limit;
1502 /* truncate both memory and reserved regions */
1503 memblock_remove_range(&memblock.memory, max_addr,
1504 (phys_addr_t)ULLONG_MAX);
1505 memblock_remove_range(&memblock.reserved, max_addr,
1506 (phys_addr_t)ULLONG_MAX);
1509 static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr)
1511 unsigned int left = 0, right = type->cnt;
1514 unsigned int mid = (right + left) / 2;
1516 if (addr < type->regions[mid].base)
1518 else if (addr >= (type->regions[mid].base +
1519 type->regions[mid].size))
1523 } while (left < right);
1527 bool __init memblock_is_reserved(phys_addr_t addr)
1529 return memblock_search(&memblock.reserved, addr) != -1;
1532 bool __init_memblock memblock_is_memory(phys_addr_t addr)
1534 return memblock_search(&memblock.memory, addr) != -1;
1537 int __init_memblock memblock_is_map_memory(phys_addr_t addr)
1539 int i = memblock_search(&memblock.memory, addr);
1543 return !memblock_is_nomap(&memblock.memory.regions[i]);
1546 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1547 int __init_memblock memblock_search_pfn_nid(unsigned long pfn,
1548 unsigned long *start_pfn, unsigned long *end_pfn)
1550 struct memblock_type *type = &memblock.memory;
1551 int mid = memblock_search(type, PFN_PHYS(pfn));
1556 *start_pfn = PFN_DOWN(type->regions[mid].base);
1557 *end_pfn = PFN_DOWN(type->regions[mid].base + type->regions[mid].size);
1559 return type->regions[mid].nid;
1564 * memblock_is_region_memory - check if a region is a subset of memory
1565 * @base: base of region to check
1566 * @size: size of region to check
1568 * Check if the region [@base, @base+@size) is a subset of a memory block.
1571 * 0 if false, non-zero if true
1573 int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size)
1575 int idx = memblock_search(&memblock.memory, base);
1576 phys_addr_t end = base + memblock_cap_size(base, &size);
1580 return memblock.memory.regions[idx].base <= base &&
1581 (memblock.memory.regions[idx].base +
1582 memblock.memory.regions[idx].size) >= end;
1586 * memblock_is_region_reserved - check if a region intersects reserved memory
1587 * @base: base of region to check
1588 * @size: size of region to check
1590 * Check if the region [@base, @base+@size) intersects a reserved memory block.
1593 * True if they intersect, false if not.
1595 bool __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size)
1597 memblock_cap_size(base, &size);
1598 return memblock_overlaps_region(&memblock.reserved, base, size);
1601 void __init_memblock memblock_trim_memory(phys_addr_t align)
1603 phys_addr_t start, end, orig_start, orig_end;
1604 struct memblock_region *r;
1606 for_each_memblock(memory, r) {
1607 orig_start = r->base;
1608 orig_end = r->base + r->size;
1609 start = round_up(orig_start, align);
1610 end = round_down(orig_end, align);
1612 if (start == orig_start && end == orig_end)
1617 r->size = end - start;
1619 memblock_remove_region(&memblock.memory,
1620 r - memblock.memory.regions);
1626 void __init_memblock memblock_set_current_limit(phys_addr_t limit)
1628 memblock.current_limit = limit;
1631 phys_addr_t __init_memblock memblock_get_current_limit(void)
1633 return memblock.current_limit;
1636 static void __init_memblock memblock_dump(struct memblock_type *type, char *name)
1638 unsigned long long base, size;
1639 unsigned long flags;
1641 struct memblock_region *rgn;
1643 pr_info(" %s.cnt = 0x%lx\n", name, type->cnt);
1645 for_each_memblock_type(type, rgn) {
1646 char nid_buf[32] = "";
1651 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1652 if (memblock_get_region_node(rgn) != MAX_NUMNODES)
1653 snprintf(nid_buf, sizeof(nid_buf), " on node %d",
1654 memblock_get_region_node(rgn));
1656 pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s flags: %#lx\n",
1657 name, idx, base, base + size - 1, size, nid_buf, flags);
1661 void __init_memblock __memblock_dump_all(void)
1663 pr_info("MEMBLOCK configuration:\n");
1664 pr_info(" memory size = %#llx reserved size = %#llx\n",
1665 (unsigned long long)memblock.memory.total_size,
1666 (unsigned long long)memblock.reserved.total_size);
1668 memblock_dump(&memblock.memory, "memory");
1669 memblock_dump(&memblock.reserved, "reserved");
1672 void __init memblock_allow_resize(void)
1674 memblock_can_resize = 1;
1677 static int __init early_memblock(char *p)
1679 if (p && strstr(p, "debug"))
1683 early_param("memblock", early_memblock);
1685 #if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
1687 static int memblock_debug_show(struct seq_file *m, void *private)
1689 struct memblock_type *type = m->private;
1690 struct memblock_region *reg;
1693 for (i = 0; i < type->cnt; i++) {
1694 reg = &type->regions[i];
1695 seq_printf(m, "%4d: ", i);
1696 if (sizeof(phys_addr_t) == 4)
1697 seq_printf(m, "0x%08lx..0x%08lx\n",
1698 (unsigned long)reg->base,
1699 (unsigned long)(reg->base + reg->size - 1));
1701 seq_printf(m, "0x%016llx..0x%016llx\n",
1702 (unsigned long long)reg->base,
1703 (unsigned long long)(reg->base + reg->size - 1));
1709 static int memblock_debug_open(struct inode *inode, struct file *file)
1711 return single_open(file, memblock_debug_show, inode->i_private);
1714 static const struct file_operations memblock_debug_fops = {
1715 .open = memblock_debug_open,
1717 .llseek = seq_lseek,
1718 .release = single_release,
1721 static int __init memblock_init_debugfs(void)
1723 struct dentry *root = debugfs_create_dir("memblock", NULL);
1726 debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops);
1727 debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops);
1728 #ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
1729 debugfs_create_file("physmem", S_IRUGO, root, &memblock.physmem, &memblock_debug_fops);
1734 __initcall(memblock_init_debugfs);
1736 #endif /* CONFIG_DEBUG_FS */