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 if (memblock_reserved_in_slab)
276 kfree(memblock.reserved.regions);
278 __memblock_free_late(addr, size);
281 if (memblock.memory.regions != memblock_memory_init_regions) {
282 addr = __pa(memblock.memory.regions);
283 size = PAGE_ALIGN(sizeof(struct memblock_region) *
284 memblock.memory.max);
285 if (memblock_memory_in_slab)
286 kfree(memblock.memory.regions);
288 __memblock_free_late(addr, size);
294 * memblock_double_array - double the size of the memblock regions array
295 * @type: memblock type of the regions array being doubled
296 * @new_area_start: starting address of memory range to avoid overlap with
297 * @new_area_size: size of memory range to avoid overlap with
299 * Double the size of the @type regions array. If memblock is being used to
300 * allocate memory for a new reserved regions array and there is a previously
301 * allocated memory range [@new_area_start,@new_area_start+@new_area_size]
302 * waiting to be reserved, ensure the memory used by the new array does
306 * 0 on success, -1 on failure.
308 static int __init_memblock memblock_double_array(struct memblock_type *type,
309 phys_addr_t new_area_start,
310 phys_addr_t new_area_size)
312 struct memblock_region *new_array, *old_array;
313 phys_addr_t old_alloc_size, new_alloc_size;
314 phys_addr_t old_size, new_size, addr;
315 int use_slab = slab_is_available();
318 /* We don't allow resizing until we know about the reserved regions
319 * of memory that aren't suitable for allocation
321 if (!memblock_can_resize)
324 /* Calculate new doubled size */
325 old_size = type->max * sizeof(struct memblock_region);
326 new_size = old_size << 1;
328 * We need to allocated new one align to PAGE_SIZE,
329 * so we can free them completely later.
331 old_alloc_size = PAGE_ALIGN(old_size);
332 new_alloc_size = PAGE_ALIGN(new_size);
334 /* Retrieve the slab flag */
335 if (type == &memblock.memory)
336 in_slab = &memblock_memory_in_slab;
338 in_slab = &memblock_reserved_in_slab;
340 /* Try to find some space for it.
342 * WARNING: We assume that either slab_is_available() and we use it or
343 * we use MEMBLOCK for allocations. That means that this is unsafe to
344 * use when bootmem is currently active (unless bootmem itself is
345 * implemented on top of MEMBLOCK which isn't the case yet)
347 * This should however not be an issue for now, as we currently only
348 * call into MEMBLOCK while it's still active, or much later when slab
349 * is active for memory hotplug operations
352 new_array = kmalloc(new_size, GFP_KERNEL);
353 addr = new_array ? __pa(new_array) : 0;
355 /* only exclude range when trying to double reserved.regions */
356 if (type != &memblock.reserved)
357 new_area_start = new_area_size = 0;
359 addr = memblock_find_in_range(new_area_start + new_area_size,
360 memblock.current_limit,
361 new_alloc_size, PAGE_SIZE);
362 if (!addr && new_area_size)
363 addr = memblock_find_in_range(0,
364 min(new_area_start, memblock.current_limit),
365 new_alloc_size, PAGE_SIZE);
367 new_array = addr ? __va(addr) : NULL;
370 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
371 memblock_type_name(type), type->max, type->max * 2);
375 memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]",
376 memblock_type_name(type), type->max * 2, (u64)addr,
377 (u64)addr + new_size - 1);
380 * Found space, we now need to move the array over before we add the
381 * reserved region since it may be our reserved array itself that is
384 memcpy(new_array, type->regions, old_size);
385 memset(new_array + type->max, 0, old_size);
386 old_array = type->regions;
387 type->regions = new_array;
390 /* Free old array. We needn't free it if the array is the static one */
393 else if (old_array != memblock_memory_init_regions &&
394 old_array != memblock_reserved_init_regions)
395 memblock_free(__pa(old_array), old_alloc_size);
398 * Reserve the new array if that comes from the memblock. Otherwise, we
402 BUG_ON(memblock_reserve(addr, new_alloc_size));
404 /* Update slab flag */
411 * memblock_merge_regions - merge neighboring compatible regions
412 * @type: memblock type to scan
414 * Scan @type and merge neighboring compatible regions.
416 static void __init_memblock memblock_merge_regions(struct memblock_type *type)
420 /* cnt never goes below 1 */
421 while (i < type->cnt - 1) {
422 struct memblock_region *this = &type->regions[i];
423 struct memblock_region *next = &type->regions[i + 1];
425 if (this->base + this->size != next->base ||
426 memblock_get_region_node(this) !=
427 memblock_get_region_node(next) ||
428 this->flags != next->flags) {
429 BUG_ON(this->base + this->size > next->base);
434 this->size += next->size;
435 /* move forward from next + 1, index of which is i + 2 */
436 memmove(next, next + 1, (type->cnt - (i + 2)) * sizeof(*next));
442 * memblock_insert_region - insert new memblock region
443 * @type: memblock type to insert into
444 * @idx: index for the insertion point
445 * @base: base address of the new region
446 * @size: size of the new region
447 * @nid: node id of the new region
448 * @flags: flags of the new region
450 * Insert new memblock region [@base,@base+@size) into @type at @idx.
451 * @type must already have extra room to accommodate the new region.
453 static void __init_memblock memblock_insert_region(struct memblock_type *type,
454 int idx, phys_addr_t base,
456 int nid, unsigned long flags)
458 struct memblock_region *rgn = &type->regions[idx];
460 BUG_ON(type->cnt >= type->max);
461 memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn));
465 memblock_set_region_node(rgn, nid);
467 type->total_size += size;
471 * memblock_add_range - add new memblock region
472 * @type: memblock type to add new region into
473 * @base: base address of the new region
474 * @size: size of the new region
475 * @nid: nid of the new region
476 * @flags: flags of the new region
478 * Add new memblock region [@base,@base+@size) into @type. The new region
479 * is allowed to overlap with existing ones - overlaps don't affect already
480 * existing regions. @type is guaranteed to be minimal (all neighbouring
481 * compatible regions are merged) after the addition.
484 * 0 on success, -errno on failure.
486 int __init_memblock memblock_add_range(struct memblock_type *type,
487 phys_addr_t base, phys_addr_t size,
488 int nid, unsigned long flags)
491 phys_addr_t obase = base;
492 phys_addr_t end = base + memblock_cap_size(base, &size);
494 struct memblock_region *rgn;
499 /* special case for empty array */
500 if (type->regions[0].size == 0) {
501 WARN_ON(type->cnt != 1 || type->total_size);
502 type->regions[0].base = base;
503 type->regions[0].size = size;
504 type->regions[0].flags = flags;
505 memblock_set_region_node(&type->regions[0], nid);
506 type->total_size = size;
511 * The following is executed twice. Once with %false @insert and
512 * then with %true. The first counts the number of regions needed
513 * to accommodate the new area. The second actually inserts them.
518 for_each_memblock_type(type, rgn) {
519 phys_addr_t rbase = rgn->base;
520 phys_addr_t rend = rbase + rgn->size;
527 * @rgn overlaps. If it separates the lower part of new
528 * area, insert that portion.
531 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
532 WARN_ON(nid != memblock_get_region_node(rgn));
534 WARN_ON(flags != rgn->flags);
537 memblock_insert_region(type, idx++, base,
541 /* area below @rend is dealt with, forget about it */
542 base = min(rend, end);
545 /* insert the remaining portion */
549 memblock_insert_region(type, idx, base, end - base,
557 * If this was the first round, resize array and repeat for actual
558 * insertions; otherwise, merge and return.
561 while (type->cnt + nr_new > type->max)
562 if (memblock_double_array(type, obase, size) < 0)
567 memblock_merge_regions(type);
572 int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size,
575 return memblock_add_range(&memblock.memory, base, size, nid, 0);
578 int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size)
580 memblock_dbg("memblock_add: [%#016llx-%#016llx] flags %#02lx %pF\n",
581 (unsigned long long)base,
582 (unsigned long long)base + size - 1,
583 0UL, (void *)_RET_IP_);
585 return memblock_add_range(&memblock.memory, base, size, MAX_NUMNODES, 0);
589 * memblock_isolate_range - isolate given range into disjoint memblocks
590 * @type: memblock type to isolate range for
591 * @base: base of range to isolate
592 * @size: size of range to isolate
593 * @start_rgn: out parameter for the start of isolated region
594 * @end_rgn: out parameter for the end of isolated region
596 * Walk @type and ensure that regions don't cross the boundaries defined by
597 * [@base,@base+@size). Crossing regions are split at the boundaries,
598 * which may create at most two more regions. The index of the first
599 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
602 * 0 on success, -errno on failure.
604 static int __init_memblock memblock_isolate_range(struct memblock_type *type,
605 phys_addr_t base, phys_addr_t size,
606 int *start_rgn, int *end_rgn)
608 phys_addr_t end = base + memblock_cap_size(base, &size);
610 struct memblock_region *rgn;
612 *start_rgn = *end_rgn = 0;
617 /* we'll create at most two more regions */
618 while (type->cnt + 2 > type->max)
619 if (memblock_double_array(type, base, size) < 0)
622 for_each_memblock_type(type, rgn) {
623 phys_addr_t rbase = rgn->base;
624 phys_addr_t rend = rbase + rgn->size;
633 * @rgn intersects from below. Split and continue
634 * to process the next region - the new top half.
637 rgn->size -= base - rbase;
638 type->total_size -= base - rbase;
639 memblock_insert_region(type, idx, rbase, base - rbase,
640 memblock_get_region_node(rgn),
642 } else if (rend > end) {
644 * @rgn intersects from above. Split and redo the
645 * current region - the new bottom half.
648 rgn->size -= end - rbase;
649 type->total_size -= end - rbase;
650 memblock_insert_region(type, idx--, rbase, end - rbase,
651 memblock_get_region_node(rgn),
654 /* @rgn is fully contained, record it */
664 static int __init_memblock memblock_remove_range(struct memblock_type *type,
665 phys_addr_t base, phys_addr_t size)
667 int start_rgn, end_rgn;
670 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
674 for (i = end_rgn - 1; i >= start_rgn; i--)
675 memblock_remove_region(type, i);
679 int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size)
681 return memblock_remove_range(&memblock.memory, base, size);
685 int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size)
687 memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n",
688 (unsigned long long)base,
689 (unsigned long long)base + size - 1,
692 kmemleak_free_part_phys(base, size);
693 return memblock_remove_range(&memblock.reserved, base, size);
696 int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size)
698 memblock_dbg("memblock_reserve: [%#016llx-%#016llx] flags %#02lx %pF\n",
699 (unsigned long long)base,
700 (unsigned long long)base + size - 1,
701 0UL, (void *)_RET_IP_);
703 return memblock_add_range(&memblock.reserved, base, size, MAX_NUMNODES, 0);
708 * This function isolates region [@base, @base + @size), and sets/clears flag
710 * Return 0 on success, -errno on failure.
712 static int __init_memblock memblock_setclr_flag(phys_addr_t base,
713 phys_addr_t size, int set, int flag)
715 struct memblock_type *type = &memblock.memory;
716 int i, ret, start_rgn, end_rgn;
718 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
722 for (i = start_rgn; i < end_rgn; i++)
724 memblock_set_region_flags(&type->regions[i], flag);
726 memblock_clear_region_flags(&type->regions[i], flag);
728 memblock_merge_regions(type);
733 * memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG.
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_mark_hotplug(phys_addr_t base, phys_addr_t size)
741 return memblock_setclr_flag(base, size, 1, MEMBLOCK_HOTPLUG);
745 * memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region.
746 * @base: the base phys addr of the region
747 * @size: the size of the region
749 * Return 0 on success, -errno on failure.
751 int __init_memblock memblock_clear_hotplug(phys_addr_t base, phys_addr_t size)
753 return memblock_setclr_flag(base, size, 0, MEMBLOCK_HOTPLUG);
757 * memblock_mark_mirror - Mark mirrored memory with flag MEMBLOCK_MIRROR.
758 * @base: the base phys addr of the region
759 * @size: the size of the region
761 * Return 0 on success, -errno on failure.
763 int __init_memblock memblock_mark_mirror(phys_addr_t base, phys_addr_t size)
765 system_has_some_mirror = true;
767 return memblock_setclr_flag(base, size, 1, MEMBLOCK_MIRROR);
771 * memblock_mark_nomap - Mark a memory region with flag MEMBLOCK_NOMAP.
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_mark_nomap(phys_addr_t base, phys_addr_t size)
779 return memblock_setclr_flag(base, size, 1, 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 0x%llx bytes below 0x%llx.\n",
1172 (unsigned long long) size, (unsigned long long) max_addr);
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;
1245 alloc = memblock_find_in_range_node(size, align, min_addr, max_addr,
1250 if (nid != NUMA_NO_NODE) {
1251 alloc = memblock_find_in_range_node(size, align, min_addr,
1252 max_addr, NUMA_NO_NODE,
1263 if (flags & MEMBLOCK_MIRROR) {
1264 flags &= ~MEMBLOCK_MIRROR;
1265 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
1272 memblock_reserve(alloc, size);
1273 ptr = phys_to_virt(alloc);
1274 memset(ptr, 0, size);
1277 * The min_count is set to 0 so that bootmem allocated blocks
1278 * are never reported as leaks. This is because many of these blocks
1279 * are only referred via the physical address which is not
1280 * looked up by kmemleak.
1282 kmemleak_alloc(ptr, size, 0, 0);
1288 * memblock_virt_alloc_try_nid_nopanic - allocate boot memory block
1289 * @size: size of memory block to be allocated in bytes
1290 * @align: alignment of the region and block's size
1291 * @min_addr: the lower bound of the memory region from where the allocation
1292 * is preferred (phys address)
1293 * @max_addr: the upper bound of the memory region from where the allocation
1294 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1295 * allocate only from memory limited by memblock.current_limit value
1296 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1298 * Public version of _memblock_virt_alloc_try_nid_nopanic() which provides
1299 * additional debug information (including caller info), if enabled.
1302 * Virtual address of allocated memory block on success, NULL on failure.
1304 void * __init memblock_virt_alloc_try_nid_nopanic(
1305 phys_addr_t size, phys_addr_t align,
1306 phys_addr_t min_addr, phys_addr_t max_addr,
1309 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1310 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1311 (u64)max_addr, (void *)_RET_IP_);
1312 return memblock_virt_alloc_internal(size, align, min_addr,
1317 * memblock_virt_alloc_try_nid - allocate boot memory block with panicking
1318 * @size: size of memory block to be allocated in bytes
1319 * @align: alignment of the region and block's size
1320 * @min_addr: the lower bound of the memory region from where the allocation
1321 * is preferred (phys address)
1322 * @max_addr: the upper bound of the memory region from where the allocation
1323 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1324 * allocate only from memory limited by memblock.current_limit value
1325 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1327 * Public panicking version of _memblock_virt_alloc_try_nid_nopanic()
1328 * which provides debug information (including caller info), if enabled,
1329 * and panics if the request can not be satisfied.
1332 * Virtual address of allocated memory block on success, NULL on failure.
1334 void * __init memblock_virt_alloc_try_nid(
1335 phys_addr_t size, phys_addr_t align,
1336 phys_addr_t min_addr, phys_addr_t max_addr,
1341 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1342 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1343 (u64)max_addr, (void *)_RET_IP_);
1344 ptr = memblock_virt_alloc_internal(size, align,
1345 min_addr, max_addr, nid);
1349 panic("%s: Failed to allocate %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx\n",
1350 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1356 * __memblock_free_early - free boot memory block
1357 * @base: phys starting address of the boot memory block
1358 * @size: size of the boot memory block in bytes
1360 * Free boot memory block previously allocated by memblock_virt_alloc_xx() API.
1361 * The freeing memory will not be released to the buddy allocator.
1363 void __init __memblock_free_early(phys_addr_t base, phys_addr_t size)
1365 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1366 __func__, (u64)base, (u64)base + size - 1,
1368 kmemleak_free_part_phys(base, size);
1369 memblock_remove_range(&memblock.reserved, base, size);
1373 * __memblock_free_late - free bootmem block pages directly to buddy allocator
1374 * @addr: phys starting address of the boot memory block
1375 * @size: size of the boot memory block in bytes
1377 * This is only useful when the bootmem allocator has already been torn
1378 * down, but we are still initializing the system. Pages are released directly
1379 * to the buddy allocator, no bootmem metadata is updated because it is gone.
1381 void __init __memblock_free_late(phys_addr_t base, phys_addr_t size)
1385 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1386 __func__, (u64)base, (u64)base + size - 1,
1388 kmemleak_free_part_phys(base, size);
1389 cursor = PFN_UP(base);
1390 end = PFN_DOWN(base + size);
1392 for (; cursor < end; cursor++) {
1393 __free_pages_bootmem(pfn_to_page(cursor), cursor, 0);
1399 * Remaining API functions
1402 phys_addr_t __init_memblock memblock_phys_mem_size(void)
1404 return memblock.memory.total_size;
1407 phys_addr_t __init_memblock memblock_reserved_size(void)
1409 return memblock.reserved.total_size;
1412 phys_addr_t __init memblock_mem_size(unsigned long limit_pfn)
1414 unsigned long pages = 0;
1415 struct memblock_region *r;
1416 unsigned long start_pfn, end_pfn;
1418 for_each_memblock(memory, r) {
1419 start_pfn = memblock_region_memory_base_pfn(r);
1420 end_pfn = memblock_region_memory_end_pfn(r);
1421 start_pfn = min_t(unsigned long, start_pfn, limit_pfn);
1422 end_pfn = min_t(unsigned long, end_pfn, limit_pfn);
1423 pages += end_pfn - start_pfn;
1426 return PFN_PHYS(pages);
1429 /* lowest address */
1430 phys_addr_t __init_memblock memblock_start_of_DRAM(void)
1432 return memblock.memory.regions[0].base;
1435 phys_addr_t __init_memblock memblock_end_of_DRAM(void)
1437 int idx = memblock.memory.cnt - 1;
1439 return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
1442 static phys_addr_t __init_memblock __find_max_addr(phys_addr_t limit)
1444 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
1445 struct memblock_region *r;
1448 * translate the memory @limit size into the max address within one of
1449 * the memory memblock regions, if the @limit exceeds the total size
1450 * of those regions, max_addr will keep original value ULLONG_MAX
1452 for_each_memblock(memory, r) {
1453 if (limit <= r->size) {
1454 max_addr = r->base + limit;
1463 void __init memblock_enforce_memory_limit(phys_addr_t limit)
1465 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
1470 max_addr = __find_max_addr(limit);
1472 /* @limit exceeds the total size of the memory, do nothing */
1473 if (max_addr == (phys_addr_t)ULLONG_MAX)
1476 /* truncate both memory and reserved regions */
1477 memblock_remove_range(&memblock.memory, max_addr,
1478 (phys_addr_t)ULLONG_MAX);
1479 memblock_remove_range(&memblock.reserved, max_addr,
1480 (phys_addr_t)ULLONG_MAX);
1483 void __init memblock_mem_limit_remove_map(phys_addr_t limit)
1485 struct memblock_type *type = &memblock.memory;
1486 phys_addr_t max_addr;
1487 int i, ret, start_rgn, end_rgn;
1492 max_addr = __find_max_addr(limit);
1494 /* @limit exceeds the total size of the memory, do nothing */
1495 if (max_addr == (phys_addr_t)ULLONG_MAX)
1498 ret = memblock_isolate_range(type, max_addr, (phys_addr_t)ULLONG_MAX,
1499 &start_rgn, &end_rgn);
1503 /* remove all the MAP regions above the limit */
1504 for (i = end_rgn - 1; i >= start_rgn; i--) {
1505 if (!memblock_is_nomap(&type->regions[i]))
1506 memblock_remove_region(type, i);
1508 /* truncate the reserved regions */
1509 memblock_remove_range(&memblock.reserved, max_addr,
1510 (phys_addr_t)ULLONG_MAX);
1513 static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr)
1515 unsigned int left = 0, right = type->cnt;
1518 unsigned int mid = (right + left) / 2;
1520 if (addr < type->regions[mid].base)
1522 else if (addr >= (type->regions[mid].base +
1523 type->regions[mid].size))
1527 } while (left < right);
1531 bool __init memblock_is_reserved(phys_addr_t addr)
1533 return memblock_search(&memblock.reserved, addr) != -1;
1536 bool __init_memblock memblock_is_memory(phys_addr_t addr)
1538 return memblock_search(&memblock.memory, addr) != -1;
1541 int __init_memblock memblock_is_map_memory(phys_addr_t addr)
1543 int i = memblock_search(&memblock.memory, addr);
1547 return !memblock_is_nomap(&memblock.memory.regions[i]);
1550 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1551 int __init_memblock memblock_search_pfn_nid(unsigned long pfn,
1552 unsigned long *start_pfn, unsigned long *end_pfn)
1554 struct memblock_type *type = &memblock.memory;
1555 int mid = memblock_search(type, PFN_PHYS(pfn));
1560 *start_pfn = PFN_DOWN(type->regions[mid].base);
1561 *end_pfn = PFN_DOWN(type->regions[mid].base + type->regions[mid].size);
1563 return type->regions[mid].nid;
1568 * memblock_is_region_memory - check if a region is a subset of memory
1569 * @base: base of region to check
1570 * @size: size of region to check
1572 * Check if the region [@base, @base+@size) is a subset of a memory block.
1575 * 0 if false, non-zero if true
1577 int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size)
1579 int idx = memblock_search(&memblock.memory, base);
1580 phys_addr_t end = base + memblock_cap_size(base, &size);
1584 return memblock.memory.regions[idx].base <= base &&
1585 (memblock.memory.regions[idx].base +
1586 memblock.memory.regions[idx].size) >= end;
1590 * memblock_is_region_reserved - check if a region intersects reserved memory
1591 * @base: base of region to check
1592 * @size: size of region to check
1594 * Check if the region [@base, @base+@size) intersects a reserved memory block.
1597 * True if they intersect, false if not.
1599 bool __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size)
1601 memblock_cap_size(base, &size);
1602 return memblock_overlaps_region(&memblock.reserved, base, size);
1605 void __init_memblock memblock_trim_memory(phys_addr_t align)
1607 phys_addr_t start, end, orig_start, orig_end;
1608 struct memblock_region *r;
1610 for_each_memblock(memory, r) {
1611 orig_start = r->base;
1612 orig_end = r->base + r->size;
1613 start = round_up(orig_start, align);
1614 end = round_down(orig_end, align);
1616 if (start == orig_start && end == orig_end)
1621 r->size = end - start;
1623 memblock_remove_region(&memblock.memory,
1624 r - memblock.memory.regions);
1630 void __init_memblock memblock_set_current_limit(phys_addr_t limit)
1632 memblock.current_limit = limit;
1635 phys_addr_t __init_memblock memblock_get_current_limit(void)
1637 return memblock.current_limit;
1640 static void __init_memblock memblock_dump(struct memblock_type *type, char *name)
1642 unsigned long long base, size;
1643 unsigned long flags;
1645 struct memblock_region *rgn;
1647 pr_info(" %s.cnt = 0x%lx\n", name, type->cnt);
1649 for_each_memblock_type(type, rgn) {
1650 char nid_buf[32] = "";
1655 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1656 if (memblock_get_region_node(rgn) != MAX_NUMNODES)
1657 snprintf(nid_buf, sizeof(nid_buf), " on node %d",
1658 memblock_get_region_node(rgn));
1660 pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s flags: %#lx\n",
1661 name, idx, base, base + size - 1, size, nid_buf, flags);
1665 extern unsigned long __init_memblock
1666 memblock_reserved_memory_within(phys_addr_t start_addr, phys_addr_t end_addr)
1668 struct memblock_region *rgn;
1669 unsigned long size = 0;
1672 for_each_memblock_type((&memblock.reserved), rgn) {
1673 phys_addr_t start, end;
1675 if (rgn->base + rgn->size < start_addr)
1677 if (rgn->base > end_addr)
1681 end = start + rgn->size;
1682 size += end - start;
1688 void __init_memblock __memblock_dump_all(void)
1690 pr_info("MEMBLOCK configuration:\n");
1691 pr_info(" memory size = %#llx reserved size = %#llx\n",
1692 (unsigned long long)memblock.memory.total_size,
1693 (unsigned long long)memblock.reserved.total_size);
1695 memblock_dump(&memblock.memory, "memory");
1696 memblock_dump(&memblock.reserved, "reserved");
1699 void __init memblock_allow_resize(void)
1701 memblock_can_resize = 1;
1704 static int __init early_memblock(char *p)
1706 if (p && strstr(p, "debug"))
1710 early_param("memblock", early_memblock);
1712 #if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
1714 static int memblock_debug_show(struct seq_file *m, void *private)
1716 struct memblock_type *type = m->private;
1717 struct memblock_region *reg;
1720 for (i = 0; i < type->cnt; i++) {
1721 reg = &type->regions[i];
1722 seq_printf(m, "%4d: ", i);
1723 if (sizeof(phys_addr_t) == 4)
1724 seq_printf(m, "0x%08lx..0x%08lx\n",
1725 (unsigned long)reg->base,
1726 (unsigned long)(reg->base + reg->size - 1));
1728 seq_printf(m, "0x%016llx..0x%016llx\n",
1729 (unsigned long long)reg->base,
1730 (unsigned long long)(reg->base + reg->size - 1));
1736 static int memblock_debug_open(struct inode *inode, struct file *file)
1738 return single_open(file, memblock_debug_show, inode->i_private);
1741 static const struct file_operations memblock_debug_fops = {
1742 .open = memblock_debug_open,
1744 .llseek = seq_lseek,
1745 .release = single_release,
1748 static int __init memblock_init_debugfs(void)
1750 struct dentry *root = debugfs_create_dir("memblock", NULL);
1753 debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops);
1754 debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops);
1755 #ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
1756 debugfs_create_file("physmem", S_IRUGO, root, &memblock.physmem, &memblock_debug_fops);
1761 __initcall(memblock_init_debugfs);
1763 #endif /* CONFIG_DEBUG_FS */