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 static 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)
52 /* adjust *@size so that (@base + *@size) doesn't overflow, return new size */
53 static inline phys_addr_t memblock_cap_size(phys_addr_t base, phys_addr_t *size)
55 return *size = min(*size, (phys_addr_t)ULLONG_MAX - base);
59 * Address comparison utilities
61 static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1,
62 phys_addr_t base2, phys_addr_t size2)
64 return ((base1 < (base2 + size2)) && (base2 < (base1 + size1)));
67 static long __init_memblock memblock_overlaps_region(struct memblock_type *type,
68 phys_addr_t base, phys_addr_t size)
72 for (i = 0; i < type->cnt; i++) {
73 phys_addr_t rgnbase = type->regions[i].base;
74 phys_addr_t rgnsize = type->regions[i].size;
75 if (memblock_addrs_overlap(base, size, rgnbase, rgnsize))
79 return (i < type->cnt) ? i : -1;
83 * memblock_find_in_range_node - find free area in given range and node
84 * @start: start of candidate range
85 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
86 * @size: size of free area to find
87 * @align: alignment of free area to find
88 * @nid: nid of the free area to find, %MAX_NUMNODES for any node
90 * Find @size free area aligned to @align in the specified range and node.
93 * Found address on success, %0 on failure.
95 phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t start,
96 phys_addr_t end, phys_addr_t size,
97 phys_addr_t align, int nid)
99 phys_addr_t this_start, this_end, cand;
103 if (end == MEMBLOCK_ALLOC_ACCESSIBLE)
104 end = memblock.current_limit;
106 /* avoid allocating the first page */
107 start = max_t(phys_addr_t, start, PAGE_SIZE);
108 end = max(start, end);
110 for_each_free_mem_range_reverse(i, nid, &this_start, &this_end, NULL) {
111 this_start = clamp(this_start, start, end);
112 this_end = clamp(this_end, start, end);
117 cand = round_down(this_end - size, align);
118 if (cand >= this_start)
125 * memblock_find_in_range - find free area in given range
126 * @start: start of candidate range
127 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
128 * @size: size of free area to find
129 * @align: alignment of free area to find
131 * Find @size free area aligned to @align in the specified range.
134 * Found address on success, %0 on failure.
136 phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start,
137 phys_addr_t end, phys_addr_t size,
140 return memblock_find_in_range_node(start, end, size, align,
145 * Free memblock.reserved.regions
147 int __init_memblock memblock_free_reserved_regions(void)
149 if (memblock.reserved.regions == memblock_reserved_init_regions)
152 return memblock_free(__pa(memblock.reserved.regions),
153 sizeof(struct memblock_region) * memblock.reserved.max);
157 * Reserve memblock.reserved.regions
159 int __init_memblock memblock_reserve_reserved_regions(void)
161 if (memblock.reserved.regions == memblock_reserved_init_regions)
164 return memblock_reserve(__pa(memblock.reserved.regions),
165 sizeof(struct memblock_region) * memblock.reserved.max);
168 static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r)
170 type->total_size -= type->regions[r].size;
171 memmove(&type->regions[r], &type->regions[r + 1],
172 (type->cnt - (r + 1)) * sizeof(type->regions[r]));
175 /* Special case for empty arrays */
176 if (type->cnt == 0) {
177 WARN_ON(type->total_size != 0);
179 type->regions[0].base = 0;
180 type->regions[0].size = 0;
181 memblock_set_region_node(&type->regions[0], MAX_NUMNODES);
185 static int __init_memblock memblock_double_array(struct memblock_type *type)
187 struct memblock_region *new_array, *old_array;
188 phys_addr_t old_size, new_size, addr;
189 int use_slab = slab_is_available();
191 /* We don't allow resizing until we know about the reserved regions
192 * of memory that aren't suitable for allocation
194 if (!memblock_can_resize)
197 /* Calculate new doubled size */
198 old_size = type->max * sizeof(struct memblock_region);
199 new_size = old_size << 1;
201 /* Try to find some space for it.
203 * WARNING: We assume that either slab_is_available() and we use it or
204 * we use MEMBLOCK for allocations. That means that this is unsafe to use
205 * when bootmem is currently active (unless bootmem itself is implemented
206 * on top of MEMBLOCK which isn't the case yet)
208 * This should however not be an issue for now, as we currently only
209 * call into MEMBLOCK while it's still active, or much later when slab is
210 * active for memory hotplug operations
213 new_array = kmalloc(new_size, GFP_KERNEL);
214 addr = new_array ? __pa(new_array) : 0;
216 addr = memblock_find_in_range(0, MEMBLOCK_ALLOC_ACCESSIBLE, new_size, sizeof(phys_addr_t));
217 new_array = addr ? __va(addr) : 0;
220 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
221 memblock_type_name(type), type->max, type->max * 2);
225 memblock_dbg("memblock: %s array is doubled to %ld at [%#010llx-%#010llx]",
226 memblock_type_name(type), type->max * 2, (u64)addr, (u64)addr + new_size - 1);
228 /* Found space, we now need to move the array over before
229 * we add the reserved region since it may be our reserved
230 * array itself that is full.
232 memcpy(new_array, type->regions, old_size);
233 memset(new_array + type->max, 0, old_size);
234 old_array = type->regions;
235 type->regions = new_array;
238 /* If we use SLAB that's it, we are done */
242 /* Add the new reserved region now. Should not fail ! */
243 BUG_ON(memblock_reserve(addr, new_size));
245 /* If the array wasn't our static init one, then free it. We only do
246 * that before SLAB is available as later on, we don't know whether
247 * to use kfree or free_bootmem_pages(). Shouldn't be a big deal
250 if (old_array != memblock_memory_init_regions &&
251 old_array != memblock_reserved_init_regions)
252 memblock_free(__pa(old_array), old_size);
258 * memblock_merge_regions - merge neighboring compatible regions
259 * @type: memblock type to scan
261 * Scan @type and merge neighboring compatible regions.
263 static void __init_memblock memblock_merge_regions(struct memblock_type *type)
267 /* cnt never goes below 1 */
268 while (i < type->cnt - 1) {
269 struct memblock_region *this = &type->regions[i];
270 struct memblock_region *next = &type->regions[i + 1];
272 if (this->base + this->size != next->base ||
273 memblock_get_region_node(this) !=
274 memblock_get_region_node(next)) {
275 BUG_ON(this->base + this->size > next->base);
280 this->size += next->size;
281 memmove(next, next + 1, (type->cnt - (i + 1)) * sizeof(*next));
287 * memblock_insert_region - insert new memblock region
288 * @type: memblock type to insert into
289 * @idx: index for the insertion point
290 * @base: base address of the new region
291 * @size: size of the new region
293 * Insert new memblock region [@base,@base+@size) into @type at @idx.
294 * @type must already have extra room to accomodate the new region.
296 static void __init_memblock memblock_insert_region(struct memblock_type *type,
297 int idx, phys_addr_t base,
298 phys_addr_t size, int nid)
300 struct memblock_region *rgn = &type->regions[idx];
302 BUG_ON(type->cnt >= type->max);
303 memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn));
306 memblock_set_region_node(rgn, nid);
308 type->total_size += size;
312 * memblock_add_region - add new memblock region
313 * @type: memblock type to add new region into
314 * @base: base address of the new region
315 * @size: size of the new region
316 * @nid: nid of the new region
318 * Add new memblock region [@base,@base+@size) into @type. The new region
319 * is allowed to overlap with existing ones - overlaps don't affect already
320 * existing regions. @type is guaranteed to be minimal (all neighbouring
321 * compatible regions are merged) after the addition.
324 * 0 on success, -errno on failure.
326 static int __init_memblock memblock_add_region(struct memblock_type *type,
327 phys_addr_t base, phys_addr_t size, int nid)
330 phys_addr_t obase = base;
331 phys_addr_t end = base + memblock_cap_size(base, &size);
337 /* special case for empty array */
338 if (type->regions[0].size == 0) {
339 WARN_ON(type->cnt != 1 || type->total_size);
340 type->regions[0].base = base;
341 type->regions[0].size = size;
342 memblock_set_region_node(&type->regions[0], nid);
343 type->total_size = size;
348 * The following is executed twice. Once with %false @insert and
349 * then with %true. The first counts the number of regions needed
350 * to accomodate the new area. The second actually inserts them.
355 for (i = 0; i < type->cnt; i++) {
356 struct memblock_region *rgn = &type->regions[i];
357 phys_addr_t rbase = rgn->base;
358 phys_addr_t rend = rbase + rgn->size;
365 * @rgn overlaps. If it separates the lower part of new
366 * area, insert that portion.
371 memblock_insert_region(type, i++, base,
374 /* area below @rend is dealt with, forget about it */
375 base = min(rend, end);
378 /* insert the remaining portion */
382 memblock_insert_region(type, i, base, end - base, nid);
386 * If this was the first round, resize array and repeat for actual
387 * insertions; otherwise, merge and return.
390 while (type->cnt + nr_new > type->max)
391 if (memblock_double_array(type) < 0)
396 memblock_merge_regions(type);
401 int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size,
404 return memblock_add_region(&memblock.memory, base, size, nid);
407 int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size)
409 return memblock_add_region(&memblock.memory, base, size, MAX_NUMNODES);
413 * memblock_isolate_range - isolate given range into disjoint memblocks
414 * @type: memblock type to isolate range for
415 * @base: base of range to isolate
416 * @size: size of range to isolate
417 * @start_rgn: out parameter for the start of isolated region
418 * @end_rgn: out parameter for the end of isolated region
420 * Walk @type and ensure that regions don't cross the boundaries defined by
421 * [@base,@base+@size). Crossing regions are split at the boundaries,
422 * which may create at most two more regions. The index of the first
423 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
426 * 0 on success, -errno on failure.
428 static int __init_memblock memblock_isolate_range(struct memblock_type *type,
429 phys_addr_t base, phys_addr_t size,
430 int *start_rgn, int *end_rgn)
432 phys_addr_t end = base + memblock_cap_size(base, &size);
435 *start_rgn = *end_rgn = 0;
440 /* we'll create at most two more regions */
441 while (type->cnt + 2 > type->max)
442 if (memblock_double_array(type) < 0)
445 for (i = 0; i < type->cnt; i++) {
446 struct memblock_region *rgn = &type->regions[i];
447 phys_addr_t rbase = rgn->base;
448 phys_addr_t rend = rbase + rgn->size;
457 * @rgn intersects from below. Split and continue
458 * to process the next region - the new top half.
461 rgn->size -= base - rbase;
462 type->total_size -= base - rbase;
463 memblock_insert_region(type, i, rbase, base - rbase,
464 memblock_get_region_node(rgn));
465 } else if (rend > end) {
467 * @rgn intersects from above. Split and redo the
468 * current region - the new bottom half.
471 rgn->size -= end - rbase;
472 type->total_size -= end - rbase;
473 memblock_insert_region(type, i--, rbase, end - rbase,
474 memblock_get_region_node(rgn));
476 /* @rgn is fully contained, record it */
486 static int __init_memblock __memblock_remove(struct memblock_type *type,
487 phys_addr_t base, phys_addr_t size)
489 int start_rgn, end_rgn;
492 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
496 for (i = end_rgn - 1; i >= start_rgn; i--)
497 memblock_remove_region(type, i);
501 int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size)
503 return __memblock_remove(&memblock.memory, base, size);
506 int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size)
508 memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n",
509 (unsigned long long)base,
510 (unsigned long long)base + size,
513 return __memblock_remove(&memblock.reserved, base, size);
516 int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size)
518 struct memblock_type *_rgn = &memblock.reserved;
520 memblock_dbg("memblock_reserve: [%#016llx-%#016llx] %pF\n",
521 (unsigned long long)base,
522 (unsigned long long)base + size,
525 return memblock_add_region(_rgn, base, size, MAX_NUMNODES);
529 * __next_free_mem_range - next function for for_each_free_mem_range()
530 * @idx: pointer to u64 loop variable
531 * @nid: nid: node selector, %MAX_NUMNODES for all nodes
532 * @p_start: ptr to phys_addr_t for start address of the range, can be %NULL
533 * @p_end: ptr to phys_addr_t for end address of the range, can be %NULL
534 * @p_nid: ptr to int for nid of the range, can be %NULL
536 * Find the first free area from *@idx which matches @nid, fill the out
537 * parameters, and update *@idx for the next iteration. The lower 32bit of
538 * *@idx contains index into memory region and the upper 32bit indexes the
539 * areas before each reserved region. For example, if reserved regions
540 * look like the following,
542 * 0:[0-16), 1:[32-48), 2:[128-130)
544 * The upper 32bit indexes the following regions.
546 * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX)
548 * As both region arrays are sorted, the function advances the two indices
549 * in lockstep and returns each intersection.
551 void __init_memblock __next_free_mem_range(u64 *idx, int nid,
552 phys_addr_t *out_start,
553 phys_addr_t *out_end, int *out_nid)
555 struct memblock_type *mem = &memblock.memory;
556 struct memblock_type *rsv = &memblock.reserved;
557 int mi = *idx & 0xffffffff;
560 for ( ; mi < mem->cnt; mi++) {
561 struct memblock_region *m = &mem->regions[mi];
562 phys_addr_t m_start = m->base;
563 phys_addr_t m_end = m->base + m->size;
565 /* only memory regions are associated with nodes, check it */
566 if (nid != MAX_NUMNODES && nid != memblock_get_region_node(m))
569 /* scan areas before each reservation for intersection */
570 for ( ; ri < rsv->cnt + 1; ri++) {
571 struct memblock_region *r = &rsv->regions[ri];
572 phys_addr_t r_start = ri ? r[-1].base + r[-1].size : 0;
573 phys_addr_t r_end = ri < rsv->cnt ? r->base : ULLONG_MAX;
575 /* if ri advanced past mi, break out to advance mi */
576 if (r_start >= m_end)
578 /* if the two regions intersect, we're done */
579 if (m_start < r_end) {
581 *out_start = max(m_start, r_start);
583 *out_end = min(m_end, r_end);
585 *out_nid = memblock_get_region_node(m);
587 * The region which ends first is advanced
588 * for the next iteration.
594 *idx = (u32)mi | (u64)ri << 32;
600 /* signal end of iteration */
605 * __next_free_mem_range_rev - next function for for_each_free_mem_range_reverse()
606 * @idx: pointer to u64 loop variable
607 * @nid: nid: node selector, %MAX_NUMNODES for all nodes
608 * @p_start: ptr to phys_addr_t for start address of the range, can be %NULL
609 * @p_end: ptr to phys_addr_t for end address of the range, can be %NULL
610 * @p_nid: ptr to int for nid of the range, can be %NULL
612 * Reverse of __next_free_mem_range().
614 void __init_memblock __next_free_mem_range_rev(u64 *idx, int nid,
615 phys_addr_t *out_start,
616 phys_addr_t *out_end, int *out_nid)
618 struct memblock_type *mem = &memblock.memory;
619 struct memblock_type *rsv = &memblock.reserved;
620 int mi = *idx & 0xffffffff;
623 if (*idx == (u64)ULLONG_MAX) {
628 for ( ; mi >= 0; mi--) {
629 struct memblock_region *m = &mem->regions[mi];
630 phys_addr_t m_start = m->base;
631 phys_addr_t m_end = m->base + m->size;
633 /* only memory regions are associated with nodes, check it */
634 if (nid != MAX_NUMNODES && nid != memblock_get_region_node(m))
637 /* scan areas before each reservation for intersection */
638 for ( ; ri >= 0; ri--) {
639 struct memblock_region *r = &rsv->regions[ri];
640 phys_addr_t r_start = ri ? r[-1].base + r[-1].size : 0;
641 phys_addr_t r_end = ri < rsv->cnt ? r->base : ULLONG_MAX;
643 /* if ri advanced past mi, break out to advance mi */
644 if (r_end <= m_start)
646 /* if the two regions intersect, we're done */
647 if (m_end > r_start) {
649 *out_start = max(m_start, r_start);
651 *out_end = min(m_end, r_end);
653 *out_nid = memblock_get_region_node(m);
655 if (m_start >= r_start)
659 *idx = (u32)mi | (u64)ri << 32;
668 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
670 * Common iterator interface used to define for_each_mem_range().
672 void __init_memblock __next_mem_pfn_range(int *idx, int nid,
673 unsigned long *out_start_pfn,
674 unsigned long *out_end_pfn, int *out_nid)
676 struct memblock_type *type = &memblock.memory;
677 struct memblock_region *r;
679 while (++*idx < type->cnt) {
680 r = &type->regions[*idx];
682 if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size))
684 if (nid == MAX_NUMNODES || nid == r->nid)
687 if (*idx >= type->cnt) {
693 *out_start_pfn = PFN_UP(r->base);
695 *out_end_pfn = PFN_DOWN(r->base + r->size);
701 * memblock_set_node - set node ID on memblock regions
702 * @base: base of area to set node ID for
703 * @size: size of area to set node ID for
704 * @nid: node ID to set
706 * Set the nid of memblock memory regions in [@base,@base+@size) to @nid.
707 * Regions which cross the area boundaries are split as necessary.
710 * 0 on success, -errno on failure.
712 int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size,
715 struct memblock_type *type = &memblock.memory;
716 int start_rgn, end_rgn;
719 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
723 for (i = start_rgn; i < end_rgn; i++)
724 type->regions[i].nid = nid;
726 memblock_merge_regions(type);
729 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
731 static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size,
732 phys_addr_t align, phys_addr_t max_addr,
737 /* align @size to avoid excessive fragmentation on reserved array */
738 size = round_up(size, align);
740 found = memblock_find_in_range_node(0, max_addr, size, align, nid);
741 if (found && !memblock_reserve(found, size))
747 phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid)
749 return memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE, nid);
752 phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
754 return memblock_alloc_base_nid(size, align, max_addr, MAX_NUMNODES);
757 phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
761 alloc = __memblock_alloc_base(size, align, max_addr);
764 panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n",
765 (unsigned long long) size, (unsigned long long) max_addr);
770 phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align)
772 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
775 phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid)
777 phys_addr_t res = memblock_alloc_nid(size, align, nid);
781 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
786 * Remaining API functions
789 phys_addr_t __init memblock_phys_mem_size(void)
791 return memblock.memory.total_size;
795 phys_addr_t __init_memblock memblock_start_of_DRAM(void)
797 return memblock.memory.regions[0].base;
800 phys_addr_t __init_memblock memblock_end_of_DRAM(void)
802 int idx = memblock.memory.cnt - 1;
804 return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
807 void __init memblock_enforce_memory_limit(phys_addr_t limit)
810 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
815 /* find out max address */
816 for (i = 0; i < memblock.memory.cnt; i++) {
817 struct memblock_region *r = &memblock.memory.regions[i];
819 if (limit <= r->size) {
820 max_addr = r->base + limit;
826 /* truncate both memory and reserved regions */
827 __memblock_remove(&memblock.memory, max_addr, (phys_addr_t)ULLONG_MAX);
828 __memblock_remove(&memblock.reserved, max_addr, (phys_addr_t)ULLONG_MAX);
831 static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr)
833 unsigned int left = 0, right = type->cnt;
836 unsigned int mid = (right + left) / 2;
838 if (addr < type->regions[mid].base)
840 else if (addr >= (type->regions[mid].base +
841 type->regions[mid].size))
845 } while (left < right);
849 int __init memblock_is_reserved(phys_addr_t addr)
851 return memblock_search(&memblock.reserved, addr) != -1;
854 int __init_memblock memblock_is_memory(phys_addr_t addr)
856 return memblock_search(&memblock.memory, addr) != -1;
859 int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size)
861 int idx = memblock_search(&memblock.memory, base);
862 phys_addr_t end = base + memblock_cap_size(base, &size);
866 return memblock.memory.regions[idx].base <= base &&
867 (memblock.memory.regions[idx].base +
868 memblock.memory.regions[idx].size) >= end;
871 int __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size)
873 memblock_cap_size(base, &size);
874 return memblock_overlaps_region(&memblock.reserved, base, size) >= 0;
878 void __init_memblock memblock_set_current_limit(phys_addr_t limit)
880 memblock.current_limit = limit;
883 static void __init_memblock memblock_dump(struct memblock_type *type, char *name)
885 unsigned long long base, size;
888 pr_info(" %s.cnt = 0x%lx\n", name, type->cnt);
890 for (i = 0; i < type->cnt; i++) {
891 struct memblock_region *rgn = &type->regions[i];
892 char nid_buf[32] = "";
896 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
897 if (memblock_get_region_node(rgn) != MAX_NUMNODES)
898 snprintf(nid_buf, sizeof(nid_buf), " on node %d",
899 memblock_get_region_node(rgn));
901 pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s\n",
902 name, i, base, base + size - 1, size, nid_buf);
906 void __init_memblock __memblock_dump_all(void)
908 pr_info("MEMBLOCK configuration:\n");
909 pr_info(" memory size = %#llx reserved size = %#llx\n",
910 (unsigned long long)memblock.memory.total_size,
911 (unsigned long long)memblock.reserved.total_size);
913 memblock_dump(&memblock.memory, "memory");
914 memblock_dump(&memblock.reserved, "reserved");
917 void __init memblock_allow_resize(void)
919 memblock_can_resize = 1;
922 static int __init early_memblock(char *p)
924 if (p && strstr(p, "debug"))
928 early_param("memblock", early_memblock);
930 #if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
932 static int memblock_debug_show(struct seq_file *m, void *private)
934 struct memblock_type *type = m->private;
935 struct memblock_region *reg;
938 for (i = 0; i < type->cnt; i++) {
939 reg = &type->regions[i];
940 seq_printf(m, "%4d: ", i);
941 if (sizeof(phys_addr_t) == 4)
942 seq_printf(m, "0x%08lx..0x%08lx\n",
943 (unsigned long)reg->base,
944 (unsigned long)(reg->base + reg->size - 1));
946 seq_printf(m, "0x%016llx..0x%016llx\n",
947 (unsigned long long)reg->base,
948 (unsigned long long)(reg->base + reg->size - 1));
954 static int memblock_debug_open(struct inode *inode, struct file *file)
956 return single_open(file, memblock_debug_show, inode->i_private);
959 static const struct file_operations memblock_debug_fops = {
960 .open = memblock_debug_open,
963 .release = single_release,
966 static int __init memblock_init_debugfs(void)
968 struct dentry *root = debugfs_create_dir("memblock", NULL);
971 debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops);
972 debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops);
976 __initcall(memblock_init_debugfs);
978 #endif /* CONFIG_DEBUG_FS */