2 * Procedures for maintaining information about logical memory blocks.
4 * Peter Bergner, IBM Corp. June 2001.
5 * Copyright (C) 2001 Peter Bergner.
7 * This program is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version
10 * 2 of the License, or (at your option) any later version.
13 #include <linux/kernel.h>
14 #include <linux/slab.h>
15 #include <linux/init.h>
16 #include <linux/bitops.h>
17 #include <linux/poison.h>
18 #include <linux/pfn.h>
19 #include <linux/debugfs.h>
20 #include <linux/seq_file.h>
21 #include <linux/memblock.h>
23 #include <asm/sections.h>
28 static struct memblock_region memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock;
29 static struct memblock_region memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock;
30 #ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
31 static struct memblock_region memblock_physmem_init_regions[INIT_PHYSMEM_REGIONS] __initdata_memblock;
34 struct memblock memblock __initdata_memblock = {
35 .memory.regions = memblock_memory_init_regions,
36 .memory.cnt = 1, /* empty dummy entry */
37 .memory.max = INIT_MEMBLOCK_REGIONS,
38 .memory.name = "memory",
40 .reserved.regions = memblock_reserved_init_regions,
41 .reserved.cnt = 1, /* empty dummy entry */
42 .reserved.max = INIT_MEMBLOCK_REGIONS,
43 .reserved.name = "reserved",
45 #ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
46 .physmem.regions = memblock_physmem_init_regions,
47 .physmem.cnt = 1, /* empty dummy entry */
48 .physmem.max = INIT_PHYSMEM_REGIONS,
49 .physmem.name = "physmem",
53 .current_limit = MEMBLOCK_ALLOC_ANYWHERE,
56 int memblock_debug __initdata_memblock;
57 static bool system_has_some_mirror __initdata_memblock = false;
58 static int memblock_can_resize __initdata_memblock;
59 static int memblock_memory_in_slab __initdata_memblock = 0;
60 static int memblock_reserved_in_slab __initdata_memblock = 0;
62 ulong __init_memblock choose_memblock_flags(void)
64 return system_has_some_mirror ? MEMBLOCK_MIRROR : MEMBLOCK_NONE;
67 /* adjust *@size so that (@base + *@size) doesn't overflow, return new size */
68 static inline phys_addr_t memblock_cap_size(phys_addr_t base, phys_addr_t *size)
70 return *size = min(*size, (phys_addr_t)ULLONG_MAX - base);
74 * Address comparison utilities
76 static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1,
77 phys_addr_t base2, phys_addr_t size2)
79 return ((base1 < (base2 + size2)) && (base2 < (base1 + size1)));
82 bool __init_memblock memblock_overlaps_region(struct memblock_type *type,
83 phys_addr_t base, phys_addr_t size)
87 for (i = 0; i < type->cnt; i++)
88 if (memblock_addrs_overlap(base, size, type->regions[i].base,
89 type->regions[i].size))
95 * __memblock_find_range_bottom_up - find free area utility in bottom-up
96 * @start: start of candidate range
97 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
98 * @size: size of free area to find
99 * @align: alignment of free area to find
100 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
101 * @flags: pick from blocks based on memory attributes
103 * Utility called from memblock_find_in_range_node(), find free area bottom-up.
106 * Found address on success, 0 on failure.
108 static phys_addr_t __init_memblock
109 __memblock_find_range_bottom_up(phys_addr_t start, phys_addr_t end,
110 phys_addr_t size, phys_addr_t align, int nid,
113 phys_addr_t this_start, this_end, cand;
116 for_each_free_mem_range(i, nid, flags, &this_start, &this_end, NULL) {
117 this_start = clamp(this_start, start, end);
118 this_end = clamp(this_end, start, end);
120 cand = round_up(this_start, align);
121 if (cand < this_end && this_end - cand >= size)
129 * __memblock_find_range_top_down - find free area utility, in top-down
130 * @start: start of candidate range
131 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
132 * @size: size of free area to find
133 * @align: alignment of free area to find
134 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
135 * @flags: pick from blocks based on memory attributes
137 * Utility called from memblock_find_in_range_node(), find free area top-down.
140 * Found address on success, 0 on failure.
142 static phys_addr_t __init_memblock
143 __memblock_find_range_top_down(phys_addr_t start, phys_addr_t end,
144 phys_addr_t size, phys_addr_t align, int nid,
147 phys_addr_t this_start, this_end, cand;
150 for_each_free_mem_range_reverse(i, nid, flags, &this_start, &this_end,
152 this_start = clamp(this_start, start, end);
153 this_end = clamp(this_end, start, end);
158 cand = round_down(this_end - size, align);
159 if (cand >= this_start)
167 * memblock_find_in_range_node - find free area in given range and node
168 * @size: size of free area to find
169 * @align: alignment of free area to find
170 * @start: start of candidate range
171 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
172 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
173 * @flags: pick from blocks based on memory attributes
175 * Find @size free area aligned to @align in the specified range and node.
178 * Found address on success, 0 on failure.
180 phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t size,
181 phys_addr_t align, phys_addr_t start,
182 phys_addr_t end, int nid, ulong flags)
185 if (end == MEMBLOCK_ALLOC_ACCESSIBLE)
186 end = memblock.current_limit;
188 /* avoid allocating the first page */
189 start = max_t(phys_addr_t, start, PAGE_SIZE);
190 end = max(start, end);
192 if (memblock_bottom_up())
193 return __memblock_find_range_bottom_up(start, end, size, align,
196 return __memblock_find_range_top_down(start, end, size, align,
201 * memblock_find_in_range - find free area in given range
202 * @start: start of candidate range
203 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
204 * @size: size of free area to find
205 * @align: alignment of free area to find
207 * Find @size free area aligned to @align in the specified range.
210 * Found address on success, 0 on failure.
212 phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start,
213 phys_addr_t end, phys_addr_t size,
217 ulong flags = choose_memblock_flags();
220 ret = memblock_find_in_range_node(size, align, start, end,
221 NUMA_NO_NODE, flags);
223 if (!ret && (flags & MEMBLOCK_MIRROR)) {
224 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
226 flags &= ~MEMBLOCK_MIRROR;
233 static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r)
235 type->total_size -= type->regions[r].size;
236 memmove(&type->regions[r], &type->regions[r + 1],
237 (type->cnt - (r + 1)) * sizeof(type->regions[r]));
240 /* Special case for empty arrays */
241 if (type->cnt == 0) {
242 WARN_ON(type->total_size != 0);
244 type->regions[0].base = 0;
245 type->regions[0].size = 0;
246 type->regions[0].flags = 0;
247 memblock_set_region_node(&type->regions[0], MAX_NUMNODES);
251 #ifdef CONFIG_ARCH_DISCARD_MEMBLOCK
253 * Discard memory and reserved arrays if they were allocated
255 void __init memblock_discard(void)
257 phys_addr_t addr, size;
259 if (memblock.reserved.regions != memblock_reserved_init_regions) {
260 addr = __pa(memblock.reserved.regions);
261 size = PAGE_ALIGN(sizeof(struct memblock_region) *
262 memblock.reserved.max);
263 __memblock_free_late(addr, size);
266 if (memblock.memory.regions != memblock_memory_init_regions) {
267 addr = __pa(memblock.memory.regions);
268 size = PAGE_ALIGN(sizeof(struct memblock_region) *
269 memblock.memory.max);
270 __memblock_free_late(addr, size);
276 * memblock_double_array - double the size of the memblock regions array
277 * @type: memblock type of the regions array being doubled
278 * @new_area_start: starting address of memory range to avoid overlap with
279 * @new_area_size: size of memory range to avoid overlap with
281 * Double the size of the @type regions array. If memblock is being used to
282 * allocate memory for a new reserved regions array and there is a previously
283 * allocated memory range [@new_area_start,@new_area_start+@new_area_size]
284 * waiting to be reserved, ensure the memory used by the new array does
288 * 0 on success, -1 on failure.
290 static int __init_memblock memblock_double_array(struct memblock_type *type,
291 phys_addr_t new_area_start,
292 phys_addr_t new_area_size)
294 struct memblock_region *new_array, *old_array;
295 phys_addr_t old_alloc_size, new_alloc_size;
296 phys_addr_t old_size, new_size, addr;
297 int use_slab = slab_is_available();
300 /* We don't allow resizing until we know about the reserved regions
301 * of memory that aren't suitable for allocation
303 if (!memblock_can_resize)
306 /* Calculate new doubled size */
307 old_size = type->max * sizeof(struct memblock_region);
308 new_size = old_size << 1;
310 * We need to allocated new one align to PAGE_SIZE,
311 * so we can free them completely later.
313 old_alloc_size = PAGE_ALIGN(old_size);
314 new_alloc_size = PAGE_ALIGN(new_size);
316 /* Retrieve the slab flag */
317 if (type == &memblock.memory)
318 in_slab = &memblock_memory_in_slab;
320 in_slab = &memblock_reserved_in_slab;
322 /* Try to find some space for it.
324 * WARNING: We assume that either slab_is_available() and we use it or
325 * we use MEMBLOCK for allocations. That means that this is unsafe to
326 * use when bootmem is currently active (unless bootmem itself is
327 * implemented on top of MEMBLOCK which isn't the case yet)
329 * This should however not be an issue for now, as we currently only
330 * call into MEMBLOCK while it's still active, or much later when slab
331 * is active for memory hotplug operations
334 new_array = kmalloc(new_size, GFP_KERNEL);
335 addr = new_array ? __pa(new_array) : 0;
337 /* only exclude range when trying to double reserved.regions */
338 if (type != &memblock.reserved)
339 new_area_start = new_area_size = 0;
341 addr = memblock_find_in_range(new_area_start + new_area_size,
342 memblock.current_limit,
343 new_alloc_size, PAGE_SIZE);
344 if (!addr && new_area_size)
345 addr = memblock_find_in_range(0,
346 min(new_area_start, memblock.current_limit),
347 new_alloc_size, PAGE_SIZE);
349 new_array = addr ? __va(addr) : NULL;
352 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
353 type->name, type->max, type->max * 2);
357 memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]",
358 type->name, type->max * 2, (u64)addr,
359 (u64)addr + new_size - 1);
362 * Found space, we now need to move the array over before we add the
363 * reserved region since it may be our reserved array itself that is
366 memcpy(new_array, type->regions, old_size);
367 memset(new_array + type->max, 0, old_size);
368 old_array = type->regions;
369 type->regions = new_array;
372 /* Free old array. We needn't free it if the array is the static one */
375 else if (old_array != memblock_memory_init_regions &&
376 old_array != memblock_reserved_init_regions)
377 memblock_free(__pa(old_array), old_alloc_size);
380 * Reserve the new array if that comes from the memblock. Otherwise, we
384 BUG_ON(memblock_reserve(addr, new_alloc_size));
386 /* Update slab flag */
393 * memblock_merge_regions - merge neighboring compatible regions
394 * @type: memblock type to scan
396 * Scan @type and merge neighboring compatible regions.
398 static void __init_memblock memblock_merge_regions(struct memblock_type *type)
402 /* cnt never goes below 1 */
403 while (i < type->cnt - 1) {
404 struct memblock_region *this = &type->regions[i];
405 struct memblock_region *next = &type->regions[i + 1];
407 if (this->base + this->size != next->base ||
408 memblock_get_region_node(this) !=
409 memblock_get_region_node(next) ||
410 this->flags != next->flags) {
411 BUG_ON(this->base + this->size > next->base);
416 this->size += next->size;
417 /* move forward from next + 1, index of which is i + 2 */
418 memmove(next, next + 1, (type->cnt - (i + 2)) * sizeof(*next));
424 * memblock_insert_region - insert new memblock region
425 * @type: memblock type to insert into
426 * @idx: index for the insertion point
427 * @base: base address of the new region
428 * @size: size of the new region
429 * @nid: node id of the new region
430 * @flags: flags of the new region
432 * Insert new memblock region [@base,@base+@size) into @type at @idx.
433 * @type must already have extra room to accommodate the new region.
435 static void __init_memblock memblock_insert_region(struct memblock_type *type,
436 int idx, phys_addr_t base,
438 int nid, unsigned long flags)
440 struct memblock_region *rgn = &type->regions[idx];
442 BUG_ON(type->cnt >= type->max);
443 memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn));
447 memblock_set_region_node(rgn, nid);
449 type->total_size += size;
453 * memblock_add_range - add new memblock region
454 * @type: memblock type to add new region into
455 * @base: base address of the new region
456 * @size: size of the new region
457 * @nid: nid of the new region
458 * @flags: flags of the new region
460 * Add new memblock region [@base,@base+@size) into @type. The new region
461 * is allowed to overlap with existing ones - overlaps don't affect already
462 * existing regions. @type is guaranteed to be minimal (all neighbouring
463 * compatible regions are merged) after the addition.
466 * 0 on success, -errno on failure.
468 int __init_memblock memblock_add_range(struct memblock_type *type,
469 phys_addr_t base, phys_addr_t size,
470 int nid, unsigned long flags)
473 phys_addr_t obase = base;
474 phys_addr_t end = base + memblock_cap_size(base, &size);
476 struct memblock_region *rgn;
481 /* special case for empty array */
482 if (type->regions[0].size == 0) {
483 WARN_ON(type->cnt != 1 || type->total_size);
484 type->regions[0].base = base;
485 type->regions[0].size = size;
486 type->regions[0].flags = flags;
487 memblock_set_region_node(&type->regions[0], nid);
488 type->total_size = size;
493 * The following is executed twice. Once with %false @insert and
494 * then with %true. The first counts the number of regions needed
495 * to accommodate the new area. The second actually inserts them.
500 for_each_memblock_type(type, rgn) {
501 phys_addr_t rbase = rgn->base;
502 phys_addr_t rend = rbase + rgn->size;
509 * @rgn overlaps. If it separates the lower part of new
510 * area, insert that portion.
513 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
514 WARN_ON(nid != memblock_get_region_node(rgn));
516 WARN_ON(flags != rgn->flags);
519 memblock_insert_region(type, idx++, base,
523 /* area below @rend is dealt with, forget about it */
524 base = min(rend, end);
527 /* insert the remaining portion */
531 memblock_insert_region(type, idx, base, end - base,
539 * If this was the first round, resize array and repeat for actual
540 * insertions; otherwise, merge and return.
543 while (type->cnt + nr_new > type->max)
544 if (memblock_double_array(type, obase, size) < 0)
549 memblock_merge_regions(type);
554 int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size,
557 return memblock_add_range(&memblock.memory, base, size, nid, 0);
560 int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size)
562 phys_addr_t end = base + size - 1;
564 memblock_dbg("memblock_add: [%pa-%pa] %pF\n",
565 &base, &end, (void *)_RET_IP_);
567 return memblock_add_range(&memblock.memory, base, size, MAX_NUMNODES, 0);
571 * memblock_isolate_range - isolate given range into disjoint memblocks
572 * @type: memblock type to isolate range for
573 * @base: base of range to isolate
574 * @size: size of range to isolate
575 * @start_rgn: out parameter for the start of isolated region
576 * @end_rgn: out parameter for the end of isolated region
578 * Walk @type and ensure that regions don't cross the boundaries defined by
579 * [@base,@base+@size). Crossing regions are split at the boundaries,
580 * which may create at most two more regions. The index of the first
581 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
584 * 0 on success, -errno on failure.
586 static int __init_memblock memblock_isolate_range(struct memblock_type *type,
587 phys_addr_t base, phys_addr_t size,
588 int *start_rgn, int *end_rgn)
590 phys_addr_t end = base + memblock_cap_size(base, &size);
592 struct memblock_region *rgn;
594 *start_rgn = *end_rgn = 0;
599 /* we'll create at most two more regions */
600 while (type->cnt + 2 > type->max)
601 if (memblock_double_array(type, base, size) < 0)
604 for_each_memblock_type(type, rgn) {
605 phys_addr_t rbase = rgn->base;
606 phys_addr_t rend = rbase + rgn->size;
615 * @rgn intersects from below. Split and continue
616 * to process the next region - the new top half.
619 rgn->size -= base - rbase;
620 type->total_size -= base - rbase;
621 memblock_insert_region(type, idx, rbase, base - rbase,
622 memblock_get_region_node(rgn),
624 } else if (rend > end) {
626 * @rgn intersects from above. Split and redo the
627 * current region - the new bottom half.
630 rgn->size -= end - rbase;
631 type->total_size -= end - rbase;
632 memblock_insert_region(type, idx--, rbase, end - rbase,
633 memblock_get_region_node(rgn),
636 /* @rgn is fully contained, record it */
646 static int __init_memblock memblock_remove_range(struct memblock_type *type,
647 phys_addr_t base, phys_addr_t size)
649 int start_rgn, end_rgn;
652 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
656 for (i = end_rgn - 1; i >= start_rgn; i--)
657 memblock_remove_region(type, i);
661 int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size)
663 return memblock_remove_range(&memblock.memory, base, size);
667 int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size)
669 phys_addr_t end = base + size - 1;
671 memblock_dbg(" memblock_free: [%pa-%pa] %pF\n",
672 &base, &end, (void *)_RET_IP_);
674 kmemleak_free_part_phys(base, size);
675 return memblock_remove_range(&memblock.reserved, base, size);
678 int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size)
680 phys_addr_t end = base + size - 1;
682 memblock_dbg("memblock_reserve: [%pa-%pa] %pF\n",
683 &base, &end, (void *)_RET_IP_);
685 return memblock_add_range(&memblock.reserved, base, size, MAX_NUMNODES, 0);
690 * This function isolates region [@base, @base + @size), and sets/clears flag
692 * Return 0 on success, -errno on failure.
694 static int __init_memblock memblock_setclr_flag(phys_addr_t base,
695 phys_addr_t size, int set, int flag)
697 struct memblock_type *type = &memblock.memory;
698 int i, ret, start_rgn, end_rgn;
700 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
704 for (i = start_rgn; i < end_rgn; i++)
706 memblock_set_region_flags(&type->regions[i], flag);
708 memblock_clear_region_flags(&type->regions[i], flag);
710 memblock_merge_regions(type);
715 * memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG.
716 * @base: the base phys addr of the region
717 * @size: the size of the region
719 * Return 0 on success, -errno on failure.
721 int __init_memblock memblock_mark_hotplug(phys_addr_t base, phys_addr_t size)
723 return memblock_setclr_flag(base, size, 1, MEMBLOCK_HOTPLUG);
727 * memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region.
728 * @base: the base phys addr of the region
729 * @size: the size of the region
731 * Return 0 on success, -errno on failure.
733 int __init_memblock memblock_clear_hotplug(phys_addr_t base, phys_addr_t size)
735 return memblock_setclr_flag(base, size, 0, MEMBLOCK_HOTPLUG);
739 * memblock_mark_mirror - Mark mirrored memory with flag MEMBLOCK_MIRROR.
740 * @base: the base phys addr of the region
741 * @size: the size of the region
743 * Return 0 on success, -errno on failure.
745 int __init_memblock memblock_mark_mirror(phys_addr_t base, phys_addr_t size)
747 system_has_some_mirror = true;
749 return memblock_setclr_flag(base, size, 1, MEMBLOCK_MIRROR);
753 * memblock_mark_nomap - Mark a memory region with flag MEMBLOCK_NOMAP.
754 * @base: the base phys addr of the region
755 * @size: the size of the region
757 * Return 0 on success, -errno on failure.
759 int __init_memblock memblock_mark_nomap(phys_addr_t base, phys_addr_t size)
761 return memblock_setclr_flag(base, size, 1, MEMBLOCK_NOMAP);
765 * memblock_clear_nomap - Clear flag MEMBLOCK_NOMAP for a specified region.
766 * @base: the base phys addr of the region
767 * @size: the size of the region
769 * Return 0 on success, -errno on failure.
771 int __init_memblock memblock_clear_nomap(phys_addr_t base, phys_addr_t size)
773 return memblock_setclr_flag(base, size, 0, MEMBLOCK_NOMAP);
777 * __next_reserved_mem_region - next function for for_each_reserved_region()
778 * @idx: pointer to u64 loop variable
779 * @out_start: ptr to phys_addr_t for start address of the region, can be %NULL
780 * @out_end: ptr to phys_addr_t for end address of the region, can be %NULL
782 * Iterate over all reserved memory regions.
784 void __init_memblock __next_reserved_mem_region(u64 *idx,
785 phys_addr_t *out_start,
786 phys_addr_t *out_end)
788 struct memblock_type *type = &memblock.reserved;
790 if (*idx < type->cnt) {
791 struct memblock_region *r = &type->regions[*idx];
792 phys_addr_t base = r->base;
793 phys_addr_t size = r->size;
798 *out_end = base + size - 1;
804 /* signal end of iteration */
809 * __next__mem_range - next function for for_each_free_mem_range() etc.
810 * @idx: pointer to u64 loop variable
811 * @nid: node selector, %NUMA_NO_NODE for all nodes
812 * @flags: pick from blocks based on memory attributes
813 * @type_a: pointer to memblock_type from where the range is taken
814 * @type_b: pointer to memblock_type which excludes memory from being taken
815 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
816 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
817 * @out_nid: ptr to int for nid of the range, can be %NULL
819 * Find the first area from *@idx which matches @nid, fill the out
820 * parameters, and update *@idx for the next iteration. The lower 32bit of
821 * *@idx contains index into type_a and the upper 32bit indexes the
822 * areas before each region in type_b. For example, if type_b regions
823 * look like the following,
825 * 0:[0-16), 1:[32-48), 2:[128-130)
827 * The upper 32bit indexes the following regions.
829 * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX)
831 * As both region arrays are sorted, the function advances the two indices
832 * in lockstep and returns each intersection.
834 void __init_memblock __next_mem_range(u64 *idx, int nid, ulong flags,
835 struct memblock_type *type_a,
836 struct memblock_type *type_b,
837 phys_addr_t *out_start,
838 phys_addr_t *out_end, int *out_nid)
840 int idx_a = *idx & 0xffffffff;
841 int idx_b = *idx >> 32;
843 if (WARN_ONCE(nid == MAX_NUMNODES,
844 "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
847 for (; idx_a < type_a->cnt; idx_a++) {
848 struct memblock_region *m = &type_a->regions[idx_a];
850 phys_addr_t m_start = m->base;
851 phys_addr_t m_end = m->base + m->size;
852 int m_nid = memblock_get_region_node(m);
854 /* only memory regions are associated with nodes, check it */
855 if (nid != NUMA_NO_NODE && nid != m_nid)
858 /* skip hotpluggable memory regions if needed */
859 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
862 /* if we want mirror memory skip non-mirror memory regions */
863 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
866 /* skip nomap memory unless we were asked for it explicitly */
867 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
872 *out_start = m_start;
878 *idx = (u32)idx_a | (u64)idx_b << 32;
882 /* scan areas before each reservation */
883 for (; idx_b < type_b->cnt + 1; idx_b++) {
884 struct memblock_region *r;
888 r = &type_b->regions[idx_b];
889 r_start = idx_b ? r[-1].base + r[-1].size : 0;
890 r_end = idx_b < type_b->cnt ?
891 r->base : ULLONG_MAX;
894 * if idx_b advanced past idx_a,
895 * break out to advance idx_a
897 if (r_start >= m_end)
899 /* if the two regions intersect, we're done */
900 if (m_start < r_end) {
903 max(m_start, r_start);
905 *out_end = min(m_end, r_end);
909 * The region which ends first is
910 * advanced for the next iteration.
916 *idx = (u32)idx_a | (u64)idx_b << 32;
922 /* signal end of iteration */
927 * __next_mem_range_rev - generic next function for for_each_*_range_rev()
929 * Finds the next range from type_a which is not marked as unsuitable
932 * @idx: pointer to u64 loop variable
933 * @nid: node selector, %NUMA_NO_NODE for all nodes
934 * @flags: pick from blocks based on memory attributes
935 * @type_a: pointer to memblock_type from where the range is taken
936 * @type_b: pointer to memblock_type which excludes memory from being taken
937 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
938 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
939 * @out_nid: ptr to int for nid of the range, can be %NULL
941 * Reverse of __next_mem_range().
943 void __init_memblock __next_mem_range_rev(u64 *idx, int nid, ulong flags,
944 struct memblock_type *type_a,
945 struct memblock_type *type_b,
946 phys_addr_t *out_start,
947 phys_addr_t *out_end, int *out_nid)
949 int idx_a = *idx & 0xffffffff;
950 int idx_b = *idx >> 32;
952 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
955 if (*idx == (u64)ULLONG_MAX) {
956 idx_a = type_a->cnt - 1;
963 for (; idx_a >= 0; idx_a--) {
964 struct memblock_region *m = &type_a->regions[idx_a];
966 phys_addr_t m_start = m->base;
967 phys_addr_t m_end = m->base + m->size;
968 int m_nid = memblock_get_region_node(m);
970 /* only memory regions are associated with nodes, check it */
971 if (nid != NUMA_NO_NODE && nid != m_nid)
974 /* skip hotpluggable memory regions if needed */
975 if (movable_node_is_enabled() && memblock_is_hotpluggable(m))
978 /* if we want mirror memory skip non-mirror memory regions */
979 if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m))
982 /* skip nomap memory unless we were asked for it explicitly */
983 if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m))
988 *out_start = m_start;
994 *idx = (u32)idx_a | (u64)idx_b << 32;
998 /* scan areas before each reservation */
999 for (; idx_b >= 0; idx_b--) {
1000 struct memblock_region *r;
1001 phys_addr_t r_start;
1004 r = &type_b->regions[idx_b];
1005 r_start = idx_b ? r[-1].base + r[-1].size : 0;
1006 r_end = idx_b < type_b->cnt ?
1007 r->base : ULLONG_MAX;
1009 * if idx_b advanced past idx_a,
1010 * break out to advance idx_a
1013 if (r_end <= m_start)
1015 /* if the two regions intersect, we're done */
1016 if (m_end > r_start) {
1018 *out_start = max(m_start, r_start);
1020 *out_end = min(m_end, r_end);
1023 if (m_start >= r_start)
1027 *idx = (u32)idx_a | (u64)idx_b << 32;
1032 /* signal end of iteration */
1036 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1038 * Common iterator interface used to define for_each_mem_range().
1040 void __init_memblock __next_mem_pfn_range(int *idx, int nid,
1041 unsigned long *out_start_pfn,
1042 unsigned long *out_end_pfn, int *out_nid)
1044 struct memblock_type *type = &memblock.memory;
1045 struct memblock_region *r;
1047 while (++*idx < type->cnt) {
1048 r = &type->regions[*idx];
1050 if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size))
1052 if (nid == MAX_NUMNODES || nid == r->nid)
1055 if (*idx >= type->cnt) {
1061 *out_start_pfn = PFN_UP(r->base);
1063 *out_end_pfn = PFN_DOWN(r->base + r->size);
1069 * memblock_set_node - set node ID on memblock regions
1070 * @base: base of area to set node ID for
1071 * @size: size of area to set node ID for
1072 * @type: memblock type to set node ID for
1073 * @nid: node ID to set
1075 * Set the nid of memblock @type regions in [@base,@base+@size) to @nid.
1076 * Regions which cross the area boundaries are split as necessary.
1079 * 0 on success, -errno on failure.
1081 int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size,
1082 struct memblock_type *type, int nid)
1084 int start_rgn, end_rgn;
1087 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
1091 for (i = start_rgn; i < end_rgn; i++)
1092 memblock_set_region_node(&type->regions[i], nid);
1094 memblock_merge_regions(type);
1097 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
1099 static phys_addr_t __init memblock_alloc_range_nid(phys_addr_t size,
1100 phys_addr_t align, phys_addr_t start,
1101 phys_addr_t end, int nid, ulong flags)
1106 align = SMP_CACHE_BYTES;
1108 found = memblock_find_in_range_node(size, align, start, end, nid,
1110 if (found && !memblock_reserve(found, size)) {
1112 * The min_count is set to 0 so that memblock allocations are
1113 * never reported as leaks.
1115 kmemleak_alloc_phys(found, size, 0, 0);
1121 phys_addr_t __init memblock_alloc_range(phys_addr_t size, phys_addr_t align,
1122 phys_addr_t start, phys_addr_t end,
1125 return memblock_alloc_range_nid(size, align, start, end, NUMA_NO_NODE,
1129 static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size,
1130 phys_addr_t align, phys_addr_t max_addr,
1131 int nid, ulong flags)
1133 return memblock_alloc_range_nid(size, align, 0, max_addr, nid, flags);
1136 phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid)
1138 ulong flags = choose_memblock_flags();
1142 ret = memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE,
1145 if (!ret && (flags & MEMBLOCK_MIRROR)) {
1146 flags &= ~MEMBLOCK_MIRROR;
1152 phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
1154 return memblock_alloc_base_nid(size, align, max_addr, NUMA_NO_NODE,
1158 phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
1162 alloc = __memblock_alloc_base(size, align, max_addr);
1165 panic("ERROR: Failed to allocate %pa bytes below %pa.\n",
1171 phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align)
1173 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
1176 phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid)
1178 phys_addr_t res = memblock_alloc_nid(size, align, nid);
1182 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
1186 * memblock_virt_alloc_internal - allocate boot memory block
1187 * @size: size of memory block to be allocated in bytes
1188 * @align: alignment of the region and block's size
1189 * @min_addr: the lower bound of the memory region to allocate (phys address)
1190 * @max_addr: the upper bound of the memory region to allocate (phys address)
1191 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1193 * The @min_addr limit is dropped if it can not be satisfied and the allocation
1194 * will fall back to memory below @min_addr. Also, allocation may fall back
1195 * to any node in the system if the specified node can not
1196 * hold the requested memory.
1198 * The allocation is performed from memory region limited by
1199 * memblock.current_limit if @max_addr == %BOOTMEM_ALLOC_ACCESSIBLE.
1201 * The memory block is aligned on SMP_CACHE_BYTES if @align == 0.
1203 * The phys address of allocated boot memory block is converted to virtual and
1204 * allocated memory is reset to 0.
1206 * In addition, function sets the min_count to 0 using kmemleak_alloc for
1207 * allocated boot memory block, so that it is never reported as leaks.
1210 * Virtual address of allocated memory block on success, NULL on failure.
1212 static void * __init memblock_virt_alloc_internal(
1213 phys_addr_t size, phys_addr_t align,
1214 phys_addr_t min_addr, phys_addr_t max_addr,
1219 ulong flags = choose_memblock_flags();
1221 if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
1225 * Detect any accidental use of these APIs after slab is ready, as at
1226 * this moment memblock may be deinitialized already and its
1227 * internal data may be destroyed (after execution of free_all_bootmem)
1229 if (WARN_ON_ONCE(slab_is_available()))
1230 return kzalloc_node(size, GFP_NOWAIT, nid);
1233 align = SMP_CACHE_BYTES;
1235 if (max_addr > memblock.current_limit)
1236 max_addr = memblock.current_limit;
1238 alloc = memblock_find_in_range_node(size, align, min_addr, max_addr,
1240 if (alloc && !memblock_reserve(alloc, size))
1243 if (nid != NUMA_NO_NODE) {
1244 alloc = memblock_find_in_range_node(size, align, min_addr,
1245 max_addr, NUMA_NO_NODE,
1247 if (alloc && !memblock_reserve(alloc, size))
1256 if (flags & MEMBLOCK_MIRROR) {
1257 flags &= ~MEMBLOCK_MIRROR;
1258 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
1265 ptr = phys_to_virt(alloc);
1266 memset(ptr, 0, size);
1269 * The min_count is set to 0 so that bootmem allocated blocks
1270 * are never reported as leaks. This is because many of these blocks
1271 * are only referred via the physical address which is not
1272 * looked up by kmemleak.
1274 kmemleak_alloc(ptr, size, 0, 0);
1280 * memblock_virt_alloc_try_nid_nopanic - allocate boot memory block
1281 * @size: size of memory block to be allocated in bytes
1282 * @align: alignment of the region and block's size
1283 * @min_addr: the lower bound of the memory region from where the allocation
1284 * is preferred (phys address)
1285 * @max_addr: the upper bound of the memory region from where the allocation
1286 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1287 * allocate only from memory limited by memblock.current_limit value
1288 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1290 * Public version of _memblock_virt_alloc_try_nid_nopanic() which provides
1291 * additional debug information (including caller info), if enabled.
1294 * Virtual address of allocated memory block on success, NULL on failure.
1296 void * __init memblock_virt_alloc_try_nid_nopanic(
1297 phys_addr_t size, phys_addr_t align,
1298 phys_addr_t min_addr, phys_addr_t max_addr,
1301 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1302 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1303 (u64)max_addr, (void *)_RET_IP_);
1304 return memblock_virt_alloc_internal(size, align, min_addr,
1309 * memblock_virt_alloc_try_nid - allocate boot memory block with panicking
1310 * @size: size of memory block to be allocated in bytes
1311 * @align: alignment of the region and block's size
1312 * @min_addr: the lower bound of the memory region from where the allocation
1313 * is preferred (phys address)
1314 * @max_addr: the upper bound of the memory region from where the allocation
1315 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1316 * allocate only from memory limited by memblock.current_limit value
1317 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1319 * Public panicking version of _memblock_virt_alloc_try_nid_nopanic()
1320 * which provides debug information (including caller info), if enabled,
1321 * and panics if the request can not be satisfied.
1324 * Virtual address of allocated memory block on success, NULL on failure.
1326 void * __init memblock_virt_alloc_try_nid(
1327 phys_addr_t size, phys_addr_t align,
1328 phys_addr_t min_addr, phys_addr_t max_addr,
1333 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1334 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1335 (u64)max_addr, (void *)_RET_IP_);
1336 ptr = memblock_virt_alloc_internal(size, align,
1337 min_addr, max_addr, nid);
1341 panic("%s: Failed to allocate %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx\n",
1342 __func__, (u64)size, (u64)align, nid, (u64)min_addr,
1348 * __memblock_free_early - free boot memory block
1349 * @base: phys starting address of the boot memory block
1350 * @size: size of the boot memory block in bytes
1352 * Free boot memory block previously allocated by memblock_virt_alloc_xx() API.
1353 * The freeing memory will not be released to the buddy allocator.
1355 void __init __memblock_free_early(phys_addr_t base, phys_addr_t size)
1357 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1358 __func__, (u64)base, (u64)base + size - 1,
1360 kmemleak_free_part_phys(base, size);
1361 memblock_remove_range(&memblock.reserved, base, size);
1365 * __memblock_free_late - free bootmem block pages directly to buddy allocator
1366 * @addr: phys starting address of the boot memory block
1367 * @size: size of the boot memory block in bytes
1369 * This is only useful when the bootmem allocator has already been torn
1370 * down, but we are still initializing the system. Pages are released directly
1371 * to the buddy allocator, no bootmem metadata is updated because it is gone.
1373 void __init __memblock_free_late(phys_addr_t base, phys_addr_t size)
1377 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1378 __func__, (u64)base, (u64)base + size - 1,
1380 kmemleak_free_part_phys(base, size);
1381 cursor = PFN_UP(base);
1382 end = PFN_DOWN(base + size);
1384 for (; cursor < end; cursor++) {
1385 __free_pages_bootmem(pfn_to_page(cursor), cursor, 0);
1391 * Remaining API functions
1394 phys_addr_t __init_memblock memblock_phys_mem_size(void)
1396 return memblock.memory.total_size;
1399 phys_addr_t __init_memblock memblock_reserved_size(void)
1401 return memblock.reserved.total_size;
1404 phys_addr_t __init memblock_mem_size(unsigned long limit_pfn)
1406 unsigned long pages = 0;
1407 struct memblock_region *r;
1408 unsigned long start_pfn, end_pfn;
1410 for_each_memblock(memory, r) {
1411 start_pfn = memblock_region_memory_base_pfn(r);
1412 end_pfn = memblock_region_memory_end_pfn(r);
1413 start_pfn = min_t(unsigned long, start_pfn, limit_pfn);
1414 end_pfn = min_t(unsigned long, end_pfn, limit_pfn);
1415 pages += end_pfn - start_pfn;
1418 return PFN_PHYS(pages);
1421 /* lowest address */
1422 phys_addr_t __init_memblock memblock_start_of_DRAM(void)
1424 return memblock.memory.regions[0].base;
1427 phys_addr_t __init_memblock memblock_end_of_DRAM(void)
1429 int idx = memblock.memory.cnt - 1;
1431 return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
1434 static phys_addr_t __init_memblock __find_max_addr(phys_addr_t limit)
1436 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
1437 struct memblock_region *r;
1440 * translate the memory @limit size into the max address within one of
1441 * the memory memblock regions, if the @limit exceeds the total size
1442 * of those regions, max_addr will keep original value ULLONG_MAX
1444 for_each_memblock(memory, r) {
1445 if (limit <= r->size) {
1446 max_addr = r->base + limit;
1455 void __init memblock_enforce_memory_limit(phys_addr_t limit)
1457 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
1462 max_addr = __find_max_addr(limit);
1464 /* @limit exceeds the total size of the memory, do nothing */
1465 if (max_addr == (phys_addr_t)ULLONG_MAX)
1468 /* truncate both memory and reserved regions */
1469 memblock_remove_range(&memblock.memory, max_addr,
1470 (phys_addr_t)ULLONG_MAX);
1471 memblock_remove_range(&memblock.reserved, max_addr,
1472 (phys_addr_t)ULLONG_MAX);
1475 void __init memblock_cap_memory_range(phys_addr_t base, phys_addr_t size)
1477 int start_rgn, end_rgn;
1483 ret = memblock_isolate_range(&memblock.memory, base, size,
1484 &start_rgn, &end_rgn);
1488 /* remove all the MAP regions */
1489 for (i = memblock.memory.cnt - 1; i >= end_rgn; i--)
1490 if (!memblock_is_nomap(&memblock.memory.regions[i]))
1491 memblock_remove_region(&memblock.memory, i);
1493 for (i = start_rgn - 1; i >= 0; i--)
1494 if (!memblock_is_nomap(&memblock.memory.regions[i]))
1495 memblock_remove_region(&memblock.memory, i);
1497 /* truncate the reserved regions */
1498 memblock_remove_range(&memblock.reserved, 0, base);
1499 memblock_remove_range(&memblock.reserved,
1500 base + size, (phys_addr_t)ULLONG_MAX);
1503 void __init memblock_mem_limit_remove_map(phys_addr_t limit)
1505 phys_addr_t max_addr;
1510 max_addr = __find_max_addr(limit);
1512 /* @limit exceeds the total size of the memory, do nothing */
1513 if (max_addr == (phys_addr_t)ULLONG_MAX)
1516 memblock_cap_memory_range(0, max_addr);
1519 static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr)
1521 unsigned int left = 0, right = type->cnt;
1524 unsigned int mid = (right + left) / 2;
1526 if (addr < type->regions[mid].base)
1528 else if (addr >= (type->regions[mid].base +
1529 type->regions[mid].size))
1533 } while (left < right);
1537 bool __init memblock_is_reserved(phys_addr_t addr)
1539 return memblock_search(&memblock.reserved, addr) != -1;
1542 bool __init_memblock memblock_is_memory(phys_addr_t addr)
1544 return memblock_search(&memblock.memory, addr) != -1;
1547 int __init_memblock memblock_is_map_memory(phys_addr_t addr)
1549 int i = memblock_search(&memblock.memory, addr);
1553 return !memblock_is_nomap(&memblock.memory.regions[i]);
1556 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1557 int __init_memblock memblock_search_pfn_nid(unsigned long pfn,
1558 unsigned long *start_pfn, unsigned long *end_pfn)
1560 struct memblock_type *type = &memblock.memory;
1561 int mid = memblock_search(type, PFN_PHYS(pfn));
1566 *start_pfn = PFN_DOWN(type->regions[mid].base);
1567 *end_pfn = PFN_DOWN(type->regions[mid].base + type->regions[mid].size);
1569 return type->regions[mid].nid;
1574 * memblock_is_region_memory - check if a region is a subset of memory
1575 * @base: base of region to check
1576 * @size: size of region to check
1578 * Check if the region [@base, @base+@size) is a subset of a memory block.
1581 * 0 if false, non-zero if true
1583 int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size)
1585 int idx = memblock_search(&memblock.memory, base);
1586 phys_addr_t end = base + memblock_cap_size(base, &size);
1590 return (memblock.memory.regions[idx].base +
1591 memblock.memory.regions[idx].size) >= end;
1595 * memblock_is_region_reserved - check if a region intersects reserved memory
1596 * @base: base of region to check
1597 * @size: size of region to check
1599 * Check if the region [@base, @base+@size) intersects a reserved memory block.
1602 * True if they intersect, false if not.
1604 bool __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size)
1606 memblock_cap_size(base, &size);
1607 return memblock_overlaps_region(&memblock.reserved, base, size);
1610 void __init_memblock memblock_trim_memory(phys_addr_t align)
1612 phys_addr_t start, end, orig_start, orig_end;
1613 struct memblock_region *r;
1615 for_each_memblock(memory, r) {
1616 orig_start = r->base;
1617 orig_end = r->base + r->size;
1618 start = round_up(orig_start, align);
1619 end = round_down(orig_end, align);
1621 if (start == orig_start && end == orig_end)
1626 r->size = end - start;
1628 memblock_remove_region(&memblock.memory,
1629 r - memblock.memory.regions);
1635 void __init_memblock memblock_set_current_limit(phys_addr_t limit)
1637 memblock.current_limit = limit;
1640 phys_addr_t __init_memblock memblock_get_current_limit(void)
1642 return memblock.current_limit;
1645 static void __init_memblock memblock_dump(struct memblock_type *type)
1647 phys_addr_t base, end, size;
1648 unsigned long flags;
1650 struct memblock_region *rgn;
1652 pr_info(" %s.cnt = 0x%lx\n", type->name, type->cnt);
1654 for_each_memblock_type(type, rgn) {
1655 char nid_buf[32] = "";
1659 end = base + size - 1;
1661 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1662 if (memblock_get_region_node(rgn) != MAX_NUMNODES)
1663 snprintf(nid_buf, sizeof(nid_buf), " on node %d",
1664 memblock_get_region_node(rgn));
1666 pr_info(" %s[%#x]\t[%pa-%pa], %pa bytes%s flags: %#lx\n",
1667 type->name, idx, &base, &end, &size, nid_buf, flags);
1671 extern unsigned long __init_memblock
1672 memblock_reserved_memory_within(phys_addr_t start_addr, phys_addr_t end_addr)
1674 struct memblock_region *rgn;
1675 unsigned long size = 0;
1678 for_each_memblock_type((&memblock.reserved), rgn) {
1679 phys_addr_t start, end;
1681 if (rgn->base + rgn->size < start_addr)
1683 if (rgn->base > end_addr)
1687 end = start + rgn->size;
1688 size += end - start;
1694 void __init_memblock __memblock_dump_all(void)
1696 pr_info("MEMBLOCK configuration:\n");
1697 pr_info(" memory size = %pa reserved size = %pa\n",
1698 &memblock.memory.total_size,
1699 &memblock.reserved.total_size);
1701 memblock_dump(&memblock.memory);
1702 memblock_dump(&memblock.reserved);
1703 #ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
1704 memblock_dump(&memblock.physmem);
1708 void __init memblock_allow_resize(void)
1710 memblock_can_resize = 1;
1713 static int __init early_memblock(char *p)
1715 if (p && strstr(p, "debug"))
1719 early_param("memblock", early_memblock);
1721 #if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
1723 static int memblock_debug_show(struct seq_file *m, void *private)
1725 struct memblock_type *type = m->private;
1726 struct memblock_region *reg;
1730 for (i = 0; i < type->cnt; i++) {
1731 reg = &type->regions[i];
1732 end = reg->base + reg->size - 1;
1734 seq_printf(m, "%4d: ", i);
1735 seq_printf(m, "%pa..%pa\n", ®->base, &end);
1740 static int memblock_debug_open(struct inode *inode, struct file *file)
1742 return single_open(file, memblock_debug_show, inode->i_private);
1745 static const struct file_operations memblock_debug_fops = {
1746 .open = memblock_debug_open,
1748 .llseek = seq_lseek,
1749 .release = single_release,
1752 static int __init memblock_init_debugfs(void)
1754 struct dentry *root = debugfs_create_dir("memblock", NULL);
1757 debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops);
1758 debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops);
1759 #ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
1760 debugfs_create_file("physmem", S_IRUGO, root, &memblock.physmem, &memblock_debug_fops);
1765 __initcall(memblock_init_debugfs);
1767 #endif /* CONFIG_DEBUG_FS */