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 static struct memblock_region memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock;
24 static struct memblock_region memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock;
26 struct memblock memblock __initdata_memblock = {
27 .memory.regions = memblock_memory_init_regions,
28 .memory.cnt = 1, /* empty dummy entry */
29 .memory.max = INIT_MEMBLOCK_REGIONS,
31 .reserved.regions = memblock_reserved_init_regions,
32 .reserved.cnt = 1, /* empty dummy entry */
33 .reserved.max = INIT_MEMBLOCK_REGIONS,
35 .current_limit = MEMBLOCK_ALLOC_ANYWHERE,
38 int memblock_debug __initdata_memblock;
39 int memblock_can_resize __initdata_memblock;
41 /* inline so we don't get a warning when pr_debug is compiled out */
42 static inline const char *memblock_type_name(struct memblock_type *type)
44 if (type == &memblock.memory)
46 else if (type == &memblock.reserved)
53 * Address comparison utilities
55 static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1,
56 phys_addr_t base2, phys_addr_t size2)
58 return ((base1 < (base2 + size2)) && (base2 < (base1 + size1)));
61 static long __init_memblock memblock_overlaps_region(struct memblock_type *type,
62 phys_addr_t base, phys_addr_t size)
66 for (i = 0; i < type->cnt; i++) {
67 phys_addr_t rgnbase = type->regions[i].base;
68 phys_addr_t rgnsize = type->regions[i].size;
69 if (memblock_addrs_overlap(base, size, rgnbase, rgnsize))
73 return (i < type->cnt) ? i : -1;
77 * Find, allocate, deallocate or reserve unreserved regions. All allocations
81 static phys_addr_t __init_memblock memblock_find_region(phys_addr_t start, phys_addr_t end,
82 phys_addr_t size, phys_addr_t align)
84 phys_addr_t base, res_base;
87 /* In case, huge size is requested */
91 base = round_down(end - size, align);
93 /* Prevent allocations returning 0 as it's also used to
94 * indicate an allocation failure
99 while (start <= base) {
100 j = memblock_overlaps_region(&memblock.reserved, base, size);
103 res_base = memblock.reserved.regions[j].base;
106 base = round_down(res_base - size, align);
113 * Find a free area with specified alignment in a specific range.
115 phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start, phys_addr_t end,
116 phys_addr_t size, phys_addr_t align)
122 /* Pump up max_addr */
123 if (end == MEMBLOCK_ALLOC_ACCESSIBLE)
124 end = memblock.current_limit;
126 /* We do a top-down search, this tends to limit memory
127 * fragmentation by keeping early boot allocs near the
130 for (i = memblock.memory.cnt - 1; i >= 0; i--) {
131 phys_addr_t memblockbase = memblock.memory.regions[i].base;
132 phys_addr_t memblocksize = memblock.memory.regions[i].size;
133 phys_addr_t bottom, top, found;
135 if (memblocksize < size)
137 if ((memblockbase + memblocksize) <= start)
139 bottom = max(memblockbase, start);
140 top = min(memblockbase + memblocksize, end);
143 found = memblock_find_region(bottom, top, size, align);
151 * Free memblock.reserved.regions
153 int __init_memblock memblock_free_reserved_regions(void)
155 if (memblock.reserved.regions == memblock_reserved_init_regions)
158 return memblock_free(__pa(memblock.reserved.regions),
159 sizeof(struct memblock_region) * memblock.reserved.max);
163 * Reserve memblock.reserved.regions
165 int __init_memblock memblock_reserve_reserved_regions(void)
167 if (memblock.reserved.regions == memblock_reserved_init_regions)
170 return memblock_reserve(__pa(memblock.reserved.regions),
171 sizeof(struct memblock_region) * memblock.reserved.max);
174 static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r)
176 memmove(&type->regions[r], &type->regions[r + 1],
177 (type->cnt - (r + 1)) * sizeof(type->regions[r]));
180 /* Special case for empty arrays */
181 if (type->cnt == 0) {
183 type->regions[0].base = 0;
184 type->regions[0].size = 0;
185 memblock_set_region_node(&type->regions[0], MAX_NUMNODES);
189 static int __init_memblock memblock_double_array(struct memblock_type *type)
191 struct memblock_region *new_array, *old_array;
192 phys_addr_t old_size, new_size, addr;
193 int use_slab = slab_is_available();
195 /* We don't allow resizing until we know about the reserved regions
196 * of memory that aren't suitable for allocation
198 if (!memblock_can_resize)
201 /* Calculate new doubled size */
202 old_size = type->max * sizeof(struct memblock_region);
203 new_size = old_size << 1;
205 /* Try to find some space for it.
207 * WARNING: We assume that either slab_is_available() and we use it or
208 * we use MEMBLOCK for allocations. That means that this is unsafe to use
209 * when bootmem is currently active (unless bootmem itself is implemented
210 * on top of MEMBLOCK which isn't the case yet)
212 * This should however not be an issue for now, as we currently only
213 * call into MEMBLOCK while it's still active, or much later when slab is
214 * active for memory hotplug operations
217 new_array = kmalloc(new_size, GFP_KERNEL);
218 addr = new_array ? __pa(new_array) : 0;
220 addr = memblock_find_in_range(0, MEMBLOCK_ALLOC_ACCESSIBLE, new_size, sizeof(phys_addr_t));
222 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
223 memblock_type_name(type), type->max, type->max * 2);
226 new_array = __va(addr);
228 memblock_dbg("memblock: %s array is doubled to %ld at [%#010llx-%#010llx]",
229 memblock_type_name(type), type->max * 2, (u64)addr, (u64)addr + new_size - 1);
231 /* Found space, we now need to move the array over before
232 * we add the reserved region since it may be our reserved
233 * array itself that is full.
235 memcpy(new_array, type->regions, old_size);
236 memset(new_array + type->max, 0, old_size);
237 old_array = type->regions;
238 type->regions = new_array;
241 /* If we use SLAB that's it, we are done */
245 /* Add the new reserved region now. Should not fail ! */
246 BUG_ON(memblock_reserve(addr, new_size));
248 /* If the array wasn't our static init one, then free it. We only do
249 * that before SLAB is available as later on, we don't know whether
250 * to use kfree or free_bootmem_pages(). Shouldn't be a big deal
253 if (old_array != memblock_memory_init_regions &&
254 old_array != memblock_reserved_init_regions)
255 memblock_free(__pa(old_array), old_size);
261 * memblock_merge_regions - merge neighboring compatible regions
262 * @type: memblock type to scan
264 * Scan @type and merge neighboring compatible regions.
266 static void __init_memblock memblock_merge_regions(struct memblock_type *type)
270 /* cnt never goes below 1 */
271 while (i < type->cnt - 1) {
272 struct memblock_region *this = &type->regions[i];
273 struct memblock_region *next = &type->regions[i + 1];
275 if (this->base + this->size != next->base ||
276 memblock_get_region_node(this) !=
277 memblock_get_region_node(next)) {
278 BUG_ON(this->base + this->size > next->base);
283 this->size += next->size;
284 memmove(next, next + 1, (type->cnt - (i + 1)) * sizeof(*next));
290 * memblock_insert_region - insert new memblock region
291 * @type: memblock type to insert into
292 * @idx: index for the insertion point
293 * @base: base address of the new region
294 * @size: size of the new region
296 * Insert new memblock region [@base,@base+@size) into @type at @idx.
297 * @type must already have extra room to accomodate the new region.
299 static void __init_memblock memblock_insert_region(struct memblock_type *type,
300 int idx, phys_addr_t base,
301 phys_addr_t size, int nid)
303 struct memblock_region *rgn = &type->regions[idx];
305 BUG_ON(type->cnt >= type->max);
306 memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn));
309 memblock_set_region_node(rgn, nid);
314 * memblock_add_region - add new memblock region
315 * @type: memblock type to add new region into
316 * @base: base address of the new region
317 * @size: size of the new region
319 * Add new memblock region [@base,@base+@size) into @type. The new region
320 * is allowed to overlap with existing ones - overlaps don't affect already
321 * existing regions. @type is guaranteed to be minimal (all neighbouring
322 * compatible regions are merged) after the addition.
325 * 0 on success, -errno on failure.
327 static int __init_memblock memblock_add_region(struct memblock_type *type,
328 phys_addr_t base, phys_addr_t size)
331 phys_addr_t obase = base, end = base + size;
334 /* special case for empty array */
335 if (type->regions[0].size == 0) {
336 WARN_ON(type->cnt != 1);
337 type->regions[0].base = base;
338 type->regions[0].size = size;
339 memblock_set_region_node(&type->regions[0], MAX_NUMNODES);
344 * The following is executed twice. Once with %false @insert and
345 * then with %true. The first counts the number of regions needed
346 * to accomodate the new area. The second actually inserts them.
351 for (i = 0; i < type->cnt; i++) {
352 struct memblock_region *rgn = &type->regions[i];
353 phys_addr_t rbase = rgn->base;
354 phys_addr_t rend = rbase + rgn->size;
361 * @rgn overlaps. If it separates the lower part of new
362 * area, insert that portion.
367 memblock_insert_region(type, i++, base,
368 rbase - base, MAX_NUMNODES);
370 /* area below @rend is dealt with, forget about it */
371 base = min(rend, end);
374 /* insert the remaining portion */
378 memblock_insert_region(type, i, base, end - base,
383 * If this was the first round, resize array and repeat for actual
384 * insertions; otherwise, merge and return.
387 while (type->cnt + nr_new > type->max)
388 if (memblock_double_array(type) < 0)
393 memblock_merge_regions(type);
398 int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size)
400 return memblock_add_region(&memblock.memory, base, size);
404 * memblock_isolate_range - isolate given range into disjoint memblocks
405 * @type: memblock type to isolate range for
406 * @base: base of range to isolate
407 * @size: size of range to isolate
408 * @start_rgn: out parameter for the start of isolated region
409 * @end_rgn: out parameter for the end of isolated region
411 * Walk @type and ensure that regions don't cross the boundaries defined by
412 * [@base,@base+@size). Crossing regions are split at the boundaries,
413 * which may create at most two more regions. The index of the first
414 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
417 * 0 on success, -errno on failure.
419 static int __init_memblock memblock_isolate_range(struct memblock_type *type,
420 phys_addr_t base, phys_addr_t size,
421 int *start_rgn, int *end_rgn)
423 phys_addr_t end = base + size;
426 *start_rgn = *end_rgn = 0;
428 /* we'll create at most two more regions */
429 while (type->cnt + 2 > type->max)
430 if (memblock_double_array(type) < 0)
433 for (i = 0; i < type->cnt; i++) {
434 struct memblock_region *rgn = &type->regions[i];
435 phys_addr_t rbase = rgn->base;
436 phys_addr_t rend = rbase + rgn->size;
445 * @rgn intersects from below. Split and continue
446 * to process the next region - the new top half.
449 rgn->size = rend - rgn->base;
450 memblock_insert_region(type, i, rbase, base - rbase,
451 memblock_get_region_node(rgn));
452 } else if (rend > end) {
454 * @rgn intersects from above. Split and redo the
455 * current region - the new bottom half.
458 rgn->size = rend - rgn->base;
459 memblock_insert_region(type, i--, rbase, end - rbase,
460 memblock_get_region_node(rgn));
462 /* @rgn is fully contained, record it */
472 static int __init_memblock __memblock_remove(struct memblock_type *type,
473 phys_addr_t base, phys_addr_t size)
475 int start_rgn, end_rgn;
478 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
482 for (i = end_rgn - 1; i >= start_rgn; i--)
483 memblock_remove_region(type, i);
487 int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size)
489 return __memblock_remove(&memblock.memory, base, size);
492 int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size)
494 memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n",
495 (unsigned long long)base,
496 (unsigned long long)base + size,
499 return __memblock_remove(&memblock.reserved, base, size);
502 int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size)
504 struct memblock_type *_rgn = &memblock.reserved;
506 memblock_dbg("memblock_reserve: [%#016llx-%#016llx] %pF\n",
507 (unsigned long long)base,
508 (unsigned long long)base + size,
512 return memblock_add_region(_rgn, base, size);
516 * __next_free_mem_range - next function for for_each_free_mem_range()
517 * @idx: pointer to u64 loop variable
518 * @nid: nid: node selector, %MAX_NUMNODES for all nodes
519 * @p_start: ptr to phys_addr_t for start address of the range, can be %NULL
520 * @p_end: ptr to phys_addr_t for end address of the range, can be %NULL
521 * @p_nid: ptr to int for nid of the range, can be %NULL
523 * Find the first free area from *@idx which matches @nid, fill the out
524 * parameters, and update *@idx for the next iteration. The lower 32bit of
525 * *@idx contains index into memory region and the upper 32bit indexes the
526 * areas before each reserved region. For example, if reserved regions
527 * look like the following,
529 * 0:[0-16), 1:[32-48), 2:[128-130)
531 * The upper 32bit indexes the following regions.
533 * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX)
535 * As both region arrays are sorted, the function advances the two indices
536 * in lockstep and returns each intersection.
538 void __init_memblock __next_free_mem_range(u64 *idx, int nid,
539 phys_addr_t *out_start,
540 phys_addr_t *out_end, int *out_nid)
542 struct memblock_type *mem = &memblock.memory;
543 struct memblock_type *rsv = &memblock.reserved;
544 int mi = *idx & 0xffffffff;
547 for ( ; mi < mem->cnt; mi++) {
548 struct memblock_region *m = &mem->regions[mi];
549 phys_addr_t m_start = m->base;
550 phys_addr_t m_end = m->base + m->size;
552 /* only memory regions are associated with nodes, check it */
553 if (nid != MAX_NUMNODES && nid != memblock_get_region_node(m))
556 /* scan areas before each reservation for intersection */
557 for ( ; ri < rsv->cnt + 1; ri++) {
558 struct memblock_region *r = &rsv->regions[ri];
559 phys_addr_t r_start = ri ? r[-1].base + r[-1].size : 0;
560 phys_addr_t r_end = ri < rsv->cnt ? r->base : ULLONG_MAX;
562 /* if ri advanced past mi, break out to advance mi */
563 if (r_start >= m_end)
565 /* if the two regions intersect, we're done */
566 if (m_start < r_end) {
568 *out_start = max(m_start, r_start);
570 *out_end = min(m_end, r_end);
572 *out_nid = memblock_get_region_node(m);
574 * The region which ends first is advanced
575 * for the next iteration.
581 *idx = (u32)mi | (u64)ri << 32;
587 /* signal end of iteration */
591 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
593 * Common iterator interface used to define for_each_mem_range().
595 void __init_memblock __next_mem_pfn_range(int *idx, int nid,
596 unsigned long *out_start_pfn,
597 unsigned long *out_end_pfn, int *out_nid)
599 struct memblock_type *type = &memblock.memory;
600 struct memblock_region *r;
602 while (++*idx < type->cnt) {
603 r = &type->regions[*idx];
605 if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size))
607 if (nid == MAX_NUMNODES || nid == r->nid)
610 if (*idx >= type->cnt) {
616 *out_start_pfn = PFN_UP(r->base);
618 *out_end_pfn = PFN_DOWN(r->base + r->size);
624 * memblock_set_node - set node ID on memblock regions
625 * @base: base of area to set node ID for
626 * @size: size of area to set node ID for
627 * @nid: node ID to set
629 * Set the nid of memblock memory regions in [@base,@base+@size) to @nid.
630 * Regions which cross the area boundaries are split as necessary.
633 * 0 on success, -errno on failure.
635 int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size,
638 struct memblock_type *type = &memblock.memory;
639 int start_rgn, end_rgn;
642 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
646 for (i = start_rgn; i < end_rgn; i++)
647 type->regions[i].nid = nid;
649 memblock_merge_regions(type);
652 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
654 phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
658 /* We align the size to limit fragmentation. Without this, a lot of
659 * small allocs quickly eat up the whole reserve array on sparc
661 size = round_up(size, align);
663 found = memblock_find_in_range(0, max_addr, size, align);
664 if (found && !memblock_reserve(found, size))
670 phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
674 alloc = __memblock_alloc_base(size, align, max_addr);
677 panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n",
678 (unsigned long long) size, (unsigned long long) max_addr);
683 phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align)
685 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
690 * Additional node-local top-down allocators.
692 * WARNING: Only available after early_node_map[] has been populated,
693 * on some architectures, that is after all the calls to add_active_range()
694 * have been done to populate it.
697 static phys_addr_t __init memblock_nid_range_rev(phys_addr_t start,
698 phys_addr_t end, int *nid)
700 #ifdef CONFIG_ARCH_POPULATES_NODE_MAP
701 unsigned long start_pfn, end_pfn;
704 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, nid)
705 if (end > PFN_PHYS(start_pfn) && end <= PFN_PHYS(end_pfn))
706 return max(start, PFN_PHYS(start_pfn));
712 phys_addr_t __init memblock_find_in_range_node(phys_addr_t start,
715 phys_addr_t align, int nid)
717 struct memblock_type *mem = &memblock.memory;
722 /* Pump up max_addr */
723 if (end == MEMBLOCK_ALLOC_ACCESSIBLE)
724 end = memblock.current_limit;
726 for (i = mem->cnt - 1; i >= 0; i--) {
727 struct memblock_region *r = &mem->regions[i];
728 phys_addr_t base = max(start, r->base);
729 phys_addr_t top = min(end, r->base + r->size);
732 phys_addr_t tbase, ret;
735 tbase = memblock_nid_range_rev(base, top, &tnid);
736 if (nid == MAX_NUMNODES || tnid == nid) {
737 ret = memblock_find_region(tbase, top, size, align);
748 phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid)
753 * We align the size to limit fragmentation. Without this, a lot of
754 * small allocs quickly eat up the whole reserve array on sparc
756 size = round_up(size, align);
758 found = memblock_find_in_range_node(0, MEMBLOCK_ALLOC_ACCESSIBLE,
760 if (found && !memblock_reserve(found, size))
766 phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid)
768 phys_addr_t res = memblock_alloc_nid(size, align, nid);
772 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
777 * Remaining API functions
780 /* You must call memblock_analyze() before this. */
781 phys_addr_t __init memblock_phys_mem_size(void)
783 return memblock.memory_size;
787 phys_addr_t __init_memblock memblock_start_of_DRAM(void)
789 return memblock.memory.regions[0].base;
792 phys_addr_t __init_memblock memblock_end_of_DRAM(void)
794 int idx = memblock.memory.cnt - 1;
796 return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
799 /* You must call memblock_analyze() after this. */
800 void __init memblock_enforce_memory_limit(phys_addr_t memory_limit)
804 struct memblock_region *p;
809 /* Truncate the memblock regions to satisfy the memory limit. */
810 limit = memory_limit;
811 for (i = 0; i < memblock.memory.cnt; i++) {
812 if (limit > memblock.memory.regions[i].size) {
813 limit -= memblock.memory.regions[i].size;
817 memblock.memory.regions[i].size = limit;
818 memblock.memory.cnt = i + 1;
822 memory_limit = memblock_end_of_DRAM();
824 /* And truncate any reserves above the limit also. */
825 for (i = 0; i < memblock.reserved.cnt; i++) {
826 p = &memblock.reserved.regions[i];
828 if (p->base > memory_limit)
830 else if ((p->base + p->size) > memory_limit)
831 p->size = memory_limit - p->base;
834 memblock_remove_region(&memblock.reserved, i);
840 static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr)
842 unsigned int left = 0, right = type->cnt;
845 unsigned int mid = (right + left) / 2;
847 if (addr < type->regions[mid].base)
849 else if (addr >= (type->regions[mid].base +
850 type->regions[mid].size))
854 } while (left < right);
858 int __init memblock_is_reserved(phys_addr_t addr)
860 return memblock_search(&memblock.reserved, addr) != -1;
863 int __init_memblock memblock_is_memory(phys_addr_t addr)
865 return memblock_search(&memblock.memory, addr) != -1;
868 int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size)
870 int idx = memblock_search(&memblock.memory, base);
874 return memblock.memory.regions[idx].base <= base &&
875 (memblock.memory.regions[idx].base +
876 memblock.memory.regions[idx].size) >= (base + size);
879 int __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size)
881 return memblock_overlaps_region(&memblock.reserved, base, size) >= 0;
885 void __init_memblock memblock_set_current_limit(phys_addr_t limit)
887 memblock.current_limit = limit;
890 static void __init_memblock memblock_dump(struct memblock_type *type, char *name)
892 unsigned long long base, size;
895 pr_info(" %s.cnt = 0x%lx\n", name, type->cnt);
897 for (i = 0; i < type->cnt; i++) {
898 struct memblock_region *rgn = &type->regions[i];
899 char nid_buf[32] = "";
903 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
904 if (memblock_get_region_node(rgn) != MAX_NUMNODES)
905 snprintf(nid_buf, sizeof(nid_buf), " on node %d",
906 memblock_get_region_node(rgn));
908 pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s\n",
909 name, i, base, base + size - 1, size, nid_buf);
913 void __init_memblock __memblock_dump_all(void)
915 pr_info("MEMBLOCK configuration:\n");
916 pr_info(" memory size = 0x%llx\n", (unsigned long long)memblock.memory_size);
918 memblock_dump(&memblock.memory, "memory");
919 memblock_dump(&memblock.reserved, "reserved");
922 void __init memblock_analyze(void)
926 memblock.memory_size = 0;
928 for (i = 0; i < memblock.memory.cnt; i++)
929 memblock.memory_size += memblock.memory.regions[i].size;
931 /* We allow resizing from there */
932 memblock_can_resize = 1;
935 static int __init early_memblock(char *p)
937 if (p && strstr(p, "debug"))
941 early_param("memblock", early_memblock);
943 #if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
945 static int memblock_debug_show(struct seq_file *m, void *private)
947 struct memblock_type *type = m->private;
948 struct memblock_region *reg;
951 for (i = 0; i < type->cnt; i++) {
952 reg = &type->regions[i];
953 seq_printf(m, "%4d: ", i);
954 if (sizeof(phys_addr_t) == 4)
955 seq_printf(m, "0x%08lx..0x%08lx\n",
956 (unsigned long)reg->base,
957 (unsigned long)(reg->base + reg->size - 1));
959 seq_printf(m, "0x%016llx..0x%016llx\n",
960 (unsigned long long)reg->base,
961 (unsigned long long)(reg->base + reg->size - 1));
967 static int memblock_debug_open(struct inode *inode, struct file *file)
969 return single_open(file, memblock_debug_show, inode->i_private);
972 static const struct file_operations memblock_debug_fops = {
973 .open = memblock_debug_open,
976 .release = single_release,
979 static int __init memblock_init_debugfs(void)
981 struct dentry *root = debugfs_create_dir("memblock", NULL);
984 debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops);
985 debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops);
989 __initcall(memblock_init_debugfs);
991 #endif /* CONFIG_DEBUG_FS */