2 * Procedures for maintaining information about logical memory blocks.
4 * Peter Bergner, IBM Corp. June 2001.
5 * Copyright (C) 2001 Peter Bergner.
7 * This program is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version
10 * 2 of the License, or (at your option) any later version.
13 #include <linux/kernel.h>
14 #include <linux/slab.h>
15 #include <linux/init.h>
16 #include <linux/bitops.h>
17 #include <linux/poison.h>
18 #include <linux/pfn.h>
19 #include <linux/debugfs.h>
20 #include <linux/seq_file.h>
21 #include <linux/memblock.h>
23 #include <asm-generic/sections.h>
25 static struct memblock_region memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock;
26 static struct memblock_region memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock;
28 struct memblock memblock __initdata_memblock = {
29 .memory.regions = memblock_memory_init_regions,
30 .memory.cnt = 1, /* empty dummy entry */
31 .memory.max = INIT_MEMBLOCK_REGIONS,
33 .reserved.regions = memblock_reserved_init_regions,
34 .reserved.cnt = 1, /* empty dummy entry */
35 .reserved.max = INIT_MEMBLOCK_REGIONS,
38 .current_limit = MEMBLOCK_ALLOC_ANYWHERE,
41 int memblock_debug __initdata_memblock;
42 static int memblock_can_resize __initdata_memblock;
43 static int memblock_memory_in_slab __initdata_memblock = 0;
44 static int memblock_reserved_in_slab __initdata_memblock = 0;
46 /* inline so we don't get a warning when pr_debug is compiled out */
47 static __init_memblock const char *
48 memblock_type_name(struct memblock_type *type)
50 if (type == &memblock.memory)
52 else if (type == &memblock.reserved)
58 /* adjust *@size so that (@base + *@size) doesn't overflow, return new size */
59 static inline phys_addr_t memblock_cap_size(phys_addr_t base, phys_addr_t *size)
61 return *size = min(*size, (phys_addr_t)ULLONG_MAX - base);
65 * Address comparison utilities
67 static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1,
68 phys_addr_t base2, phys_addr_t size2)
70 return ((base1 < (base2 + size2)) && (base2 < (base1 + size1)));
73 static long __init_memblock memblock_overlaps_region(struct memblock_type *type,
74 phys_addr_t base, phys_addr_t size)
78 for (i = 0; i < type->cnt; i++) {
79 phys_addr_t rgnbase = type->regions[i].base;
80 phys_addr_t rgnsize = type->regions[i].size;
81 if (memblock_addrs_overlap(base, size, rgnbase, rgnsize))
85 return (i < type->cnt) ? i : -1;
89 * __memblock_find_range_bottom_up - find free area utility in bottom-up
90 * @start: start of candidate range
91 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
92 * @size: size of free area to find
93 * @align: alignment of free area to find
94 * @nid: nid of the free area to find, %MAX_NUMNODES for any node
96 * Utility called from memblock_find_in_range_node(), find free area bottom-up.
99 * Found address on success, 0 on failure.
101 static phys_addr_t __init_memblock
102 __memblock_find_range_bottom_up(phys_addr_t start, phys_addr_t end,
103 phys_addr_t size, phys_addr_t align, int nid)
105 phys_addr_t this_start, this_end, cand;
108 for_each_free_mem_range(i, nid, &this_start, &this_end, NULL) {
109 this_start = clamp(this_start, start, end);
110 this_end = clamp(this_end, start, end);
112 cand = round_up(this_start, align);
113 if (cand < this_end && this_end - cand >= size)
121 * __memblock_find_range_top_down - find free area utility, in top-down
122 * @start: start of candidate range
123 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
124 * @size: size of free area to find
125 * @align: alignment of free area to find
126 * @nid: nid of the free area to find, %MAX_NUMNODES for any node
128 * Utility called from memblock_find_in_range_node(), find free area top-down.
131 * Found address on success, 0 on failure.
133 static phys_addr_t __init_memblock
134 __memblock_find_range_top_down(phys_addr_t start, phys_addr_t end,
135 phys_addr_t size, phys_addr_t align, int nid)
137 phys_addr_t this_start, this_end, cand;
140 for_each_free_mem_range_reverse(i, nid, &this_start, &this_end, NULL) {
141 this_start = clamp(this_start, start, end);
142 this_end = clamp(this_end, start, end);
147 cand = round_down(this_end - size, align);
148 if (cand >= this_start)
156 * memblock_find_in_range_node - find free area in given range and node
157 * @start: start of candidate range
158 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
159 * @size: size of free area to find
160 * @align: alignment of free area to find
161 * @nid: nid of the free area to find, %MAX_NUMNODES for any node
163 * Find @size free area aligned to @align in the specified range and node.
165 * When allocation direction is bottom-up, the @start should be greater
166 * than the end of the kernel image. Otherwise, it will be trimmed. The
167 * reason is that we want the bottom-up allocation just near the kernel
168 * image so it is highly likely that the allocated memory and the kernel
169 * will reside in the same node.
171 * If bottom-up allocation failed, will try to allocate memory top-down.
174 * Found address on success, 0 on failure.
176 phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t start,
177 phys_addr_t end, phys_addr_t size,
178 phys_addr_t align, int nid)
181 phys_addr_t kernel_end;
184 if (end == MEMBLOCK_ALLOC_ACCESSIBLE)
185 end = memblock.current_limit;
187 /* avoid allocating the first page */
188 start = max_t(phys_addr_t, start, PAGE_SIZE);
189 end = max(start, end);
190 kernel_end = __pa_symbol(_end);
193 * try bottom-up allocation only when bottom-up mode
194 * is set and @end is above the kernel image.
196 if (memblock_bottom_up() && end > kernel_end) {
197 phys_addr_t bottom_up_start;
199 /* make sure we will allocate above the kernel */
200 bottom_up_start = max(start, kernel_end);
202 /* ok, try bottom-up allocation first */
203 ret = __memblock_find_range_bottom_up(bottom_up_start, end,
209 * we always limit bottom-up allocation above the kernel,
210 * but top-down allocation doesn't have the limit, so
211 * retrying top-down allocation may succeed when bottom-up
214 * bottom-up allocation is expected to be fail very rarely,
215 * so we use WARN_ONCE() here to see the stack trace if
218 WARN_ONCE(1, "memblock: bottom-up allocation failed, "
219 "memory hotunplug may be affected\n");
222 return __memblock_find_range_top_down(start, end, size, align, nid);
226 * memblock_find_in_range - find free area in given range
227 * @start: start of candidate range
228 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
229 * @size: size of free area to find
230 * @align: alignment of free area to find
232 * Find @size free area aligned to @align in the specified range.
235 * Found address on success, 0 on failure.
237 phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start,
238 phys_addr_t end, phys_addr_t size,
241 return memblock_find_in_range_node(start, end, size, align,
245 static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r)
247 type->total_size -= type->regions[r].size;
248 memmove(&type->regions[r], &type->regions[r + 1],
249 (type->cnt - (r + 1)) * sizeof(type->regions[r]));
252 /* Special case for empty arrays */
253 if (type->cnt == 0) {
254 WARN_ON(type->total_size != 0);
256 type->regions[0].base = 0;
257 type->regions[0].size = 0;
258 type->regions[0].flags = 0;
259 memblock_set_region_node(&type->regions[0], MAX_NUMNODES);
263 phys_addr_t __init_memblock get_allocated_memblock_reserved_regions_info(
266 if (memblock.reserved.regions == memblock_reserved_init_regions)
269 *addr = __pa(memblock.reserved.regions);
271 return PAGE_ALIGN(sizeof(struct memblock_region) *
272 memblock.reserved.max);
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 memblock_type_name(type), type->max, type->max * 2);
357 memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]",
358 memblock_type_name(type), 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 accomodate 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_region - 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 static int __init_memblock memblock_add_region(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);
480 /* special case for empty array */
481 if (type->regions[0].size == 0) {
482 WARN_ON(type->cnt != 1 || type->total_size);
483 type->regions[0].base = base;
484 type->regions[0].size = size;
485 type->regions[0].flags = flags;
486 memblock_set_region_node(&type->regions[0], nid);
487 type->total_size = size;
492 * The following is executed twice. Once with %false @insert and
493 * then with %true. The first counts the number of regions needed
494 * to accomodate the new area. The second actually inserts them.
499 for (i = 0; i < type->cnt; i++) {
500 struct memblock_region *rgn = &type->regions[i];
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.
515 memblock_insert_region(type, i++, base,
519 /* area below @rend is dealt with, forget about it */
520 base = min(rend, end);
523 /* insert the remaining portion */
527 memblock_insert_region(type, i, base, end - base,
532 * If this was the first round, resize array and repeat for actual
533 * insertions; otherwise, merge and return.
536 while (type->cnt + nr_new > type->max)
537 if (memblock_double_array(type, obase, size) < 0)
542 memblock_merge_regions(type);
547 int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size,
550 return memblock_add_region(&memblock.memory, base, size, nid, 0);
553 int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size)
555 return memblock_add_region(&memblock.memory, base, size,
560 * memblock_isolate_range - isolate given range into disjoint memblocks
561 * @type: memblock type to isolate range for
562 * @base: base of range to isolate
563 * @size: size of range to isolate
564 * @start_rgn: out parameter for the start of isolated region
565 * @end_rgn: out parameter for the end of isolated region
567 * Walk @type and ensure that regions don't cross the boundaries defined by
568 * [@base,@base+@size). Crossing regions are split at the boundaries,
569 * which may create at most two more regions. The index of the first
570 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
573 * 0 on success, -errno on failure.
575 static int __init_memblock memblock_isolate_range(struct memblock_type *type,
576 phys_addr_t base, phys_addr_t size,
577 int *start_rgn, int *end_rgn)
579 phys_addr_t end = base + memblock_cap_size(base, &size);
582 *start_rgn = *end_rgn = 0;
587 /* we'll create at most two more regions */
588 while (type->cnt + 2 > type->max)
589 if (memblock_double_array(type, base, size) < 0)
592 for (i = 0; i < type->cnt; i++) {
593 struct memblock_region *rgn = &type->regions[i];
594 phys_addr_t rbase = rgn->base;
595 phys_addr_t rend = rbase + rgn->size;
604 * @rgn intersects from below. Split and continue
605 * to process the next region - the new top half.
608 rgn->size -= base - rbase;
609 type->total_size -= base - rbase;
610 memblock_insert_region(type, i, rbase, base - rbase,
611 memblock_get_region_node(rgn),
613 } else if (rend > end) {
615 * @rgn intersects from above. Split and redo the
616 * current region - the new bottom half.
619 rgn->size -= end - rbase;
620 type->total_size -= end - rbase;
621 memblock_insert_region(type, i--, rbase, end - rbase,
622 memblock_get_region_node(rgn),
625 /* @rgn is fully contained, record it */
635 static int __init_memblock __memblock_remove(struct memblock_type *type,
636 phys_addr_t base, phys_addr_t size)
638 int start_rgn, end_rgn;
641 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
645 for (i = end_rgn - 1; i >= start_rgn; i--)
646 memblock_remove_region(type, i);
650 int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size)
652 return __memblock_remove(&memblock.memory, base, size);
655 int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size)
657 memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n",
658 (unsigned long long)base,
659 (unsigned long long)base + size - 1,
662 return __memblock_remove(&memblock.reserved, base, size);
665 static int __init_memblock memblock_reserve_region(phys_addr_t base,
670 struct memblock_type *_rgn = &memblock.reserved;
672 memblock_dbg("memblock_reserve: [%#016llx-%#016llx] flags %#02lx %pF\n",
673 (unsigned long long)base,
674 (unsigned long long)base + size - 1,
675 flags, (void *)_RET_IP_);
677 return memblock_add_region(_rgn, base, size, nid, flags);
680 int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size)
682 return memblock_reserve_region(base, size, MAX_NUMNODES, 0);
686 * memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG.
687 * @base: the base phys addr of the region
688 * @size: the size of the region
690 * This function isolates region [@base, @base + @size), and mark it with flag
693 * Return 0 on succees, -errno on failure.
695 int __init_memblock memblock_mark_hotplug(phys_addr_t base, phys_addr_t size)
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++)
705 memblock_set_region_flags(&type->regions[i], MEMBLOCK_HOTPLUG);
707 memblock_merge_regions(type);
712 * memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region.
713 * @base: the base phys addr of the region
714 * @size: the size of the region
716 * This function isolates region [@base, @base + @size), and clear flag
717 * MEMBLOCK_HOTPLUG for the isolated regions.
719 * Return 0 on succees, -errno on failure.
721 int __init_memblock memblock_clear_hotplug(phys_addr_t base, phys_addr_t size)
723 struct memblock_type *type = &memblock.memory;
724 int i, ret, start_rgn, end_rgn;
726 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
730 for (i = start_rgn; i < end_rgn; i++)
731 memblock_clear_region_flags(&type->regions[i],
734 memblock_merge_regions(type);
739 * __next_free_mem_range - next function for for_each_free_mem_range()
740 * @idx: pointer to u64 loop variable
741 * @nid: node selector, %MAX_NUMNODES for all nodes
742 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
743 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
744 * @out_nid: ptr to int for nid of the range, can be %NULL
746 * Find the first free area from *@idx which matches @nid, fill the out
747 * parameters, and update *@idx for the next iteration. The lower 32bit of
748 * *@idx contains index into memory region and the upper 32bit indexes the
749 * areas before each reserved region. For example, if reserved regions
750 * look like the following,
752 * 0:[0-16), 1:[32-48), 2:[128-130)
754 * The upper 32bit indexes the following regions.
756 * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX)
758 * As both region arrays are sorted, the function advances the two indices
759 * in lockstep and returns each intersection.
761 void __init_memblock __next_free_mem_range(u64 *idx, int nid,
762 phys_addr_t *out_start,
763 phys_addr_t *out_end, int *out_nid)
765 struct memblock_type *mem = &memblock.memory;
766 struct memblock_type *rsv = &memblock.reserved;
767 int mi = *idx & 0xffffffff;
770 for ( ; mi < mem->cnt; mi++) {
771 struct memblock_region *m = &mem->regions[mi];
772 phys_addr_t m_start = m->base;
773 phys_addr_t m_end = m->base + m->size;
775 /* only memory regions are associated with nodes, check it */
776 if (nid != MAX_NUMNODES && nid != memblock_get_region_node(m))
779 /* scan areas before each reservation for intersection */
780 for ( ; ri < rsv->cnt + 1; ri++) {
781 struct memblock_region *r = &rsv->regions[ri];
782 phys_addr_t r_start = ri ? r[-1].base + r[-1].size : 0;
783 phys_addr_t r_end = ri < rsv->cnt ? r->base : ULLONG_MAX;
785 /* if ri advanced past mi, break out to advance mi */
786 if (r_start >= m_end)
788 /* if the two regions intersect, we're done */
789 if (m_start < r_end) {
791 *out_start = max(m_start, r_start);
793 *out_end = min(m_end, r_end);
795 *out_nid = memblock_get_region_node(m);
797 * The region which ends first is advanced
798 * for the next iteration.
804 *idx = (u32)mi | (u64)ri << 32;
810 /* signal end of iteration */
815 * __next_free_mem_range_rev - next function for for_each_free_mem_range_reverse()
816 * @idx: pointer to u64 loop variable
817 * @nid: nid: node selector, %MAX_NUMNODES for all nodes
818 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
819 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
820 * @out_nid: ptr to int for nid of the range, can be %NULL
822 * Reverse of __next_free_mem_range().
824 void __init_memblock __next_free_mem_range_rev(u64 *idx, int nid,
825 phys_addr_t *out_start,
826 phys_addr_t *out_end, int *out_nid)
828 struct memblock_type *mem = &memblock.memory;
829 struct memblock_type *rsv = &memblock.reserved;
830 int mi = *idx & 0xffffffff;
833 if (*idx == (u64)ULLONG_MAX) {
838 for ( ; mi >= 0; mi--) {
839 struct memblock_region *m = &mem->regions[mi];
840 phys_addr_t m_start = m->base;
841 phys_addr_t m_end = m->base + m->size;
843 /* only memory regions are associated with nodes, check it */
844 if (nid != MAX_NUMNODES && nid != memblock_get_region_node(m))
847 /* scan areas before each reservation for intersection */
848 for ( ; ri >= 0; ri--) {
849 struct memblock_region *r = &rsv->regions[ri];
850 phys_addr_t r_start = ri ? r[-1].base + r[-1].size : 0;
851 phys_addr_t r_end = ri < rsv->cnt ? r->base : ULLONG_MAX;
853 /* if ri advanced past mi, break out to advance mi */
854 if (r_end <= m_start)
856 /* if the two regions intersect, we're done */
857 if (m_end > r_start) {
859 *out_start = max(m_start, r_start);
861 *out_end = min(m_end, r_end);
863 *out_nid = memblock_get_region_node(m);
865 if (m_start >= r_start)
869 *idx = (u32)mi | (u64)ri << 32;
878 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
880 * Common iterator interface used to define for_each_mem_range().
882 void __init_memblock __next_mem_pfn_range(int *idx, int nid,
883 unsigned long *out_start_pfn,
884 unsigned long *out_end_pfn, int *out_nid)
886 struct memblock_type *type = &memblock.memory;
887 struct memblock_region *r;
889 while (++*idx < type->cnt) {
890 r = &type->regions[*idx];
892 if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size))
894 if (nid == MAX_NUMNODES || nid == r->nid)
897 if (*idx >= type->cnt) {
903 *out_start_pfn = PFN_UP(r->base);
905 *out_end_pfn = PFN_DOWN(r->base + r->size);
911 * memblock_set_node - set node ID on memblock regions
912 * @base: base of area to set node ID for
913 * @size: size of area to set node ID for
914 * @nid: node ID to set
916 * Set the nid of memblock memory regions in [@base,@base+@size) to @nid.
917 * Regions which cross the area boundaries are split as necessary.
920 * 0 on success, -errno on failure.
922 int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size,
925 struct memblock_type *type = &memblock.memory;
926 int start_rgn, end_rgn;
929 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
933 for (i = start_rgn; i < end_rgn; i++)
934 memblock_set_region_node(&type->regions[i], nid);
936 memblock_merge_regions(type);
939 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
941 static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size,
942 phys_addr_t align, phys_addr_t max_addr,
948 align = __alignof__(long long);
950 /* align @size to avoid excessive fragmentation on reserved array */
951 size = round_up(size, align);
953 found = memblock_find_in_range_node(0, max_addr, size, align, nid);
954 if (found && !memblock_reserve(found, size))
960 phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid)
962 return memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE, nid);
965 phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
967 return memblock_alloc_base_nid(size, align, max_addr, MAX_NUMNODES);
970 phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
974 alloc = __memblock_alloc_base(size, align, max_addr);
977 panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n",
978 (unsigned long long) size, (unsigned long long) max_addr);
983 phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align)
985 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
988 phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid)
990 phys_addr_t res = memblock_alloc_nid(size, align, nid);
994 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
999 * Remaining API functions
1002 phys_addr_t __init memblock_phys_mem_size(void)
1004 return memblock.memory.total_size;
1007 phys_addr_t __init memblock_mem_size(unsigned long limit_pfn)
1009 unsigned long pages = 0;
1010 struct memblock_region *r;
1011 unsigned long start_pfn, end_pfn;
1013 for_each_memblock(memory, r) {
1014 start_pfn = memblock_region_memory_base_pfn(r);
1015 end_pfn = memblock_region_memory_end_pfn(r);
1016 start_pfn = min_t(unsigned long, start_pfn, limit_pfn);
1017 end_pfn = min_t(unsigned long, end_pfn, limit_pfn);
1018 pages += end_pfn - start_pfn;
1021 return (phys_addr_t)pages << PAGE_SHIFT;
1024 /* lowest address */
1025 phys_addr_t __init_memblock memblock_start_of_DRAM(void)
1027 return memblock.memory.regions[0].base;
1030 phys_addr_t __init_memblock memblock_end_of_DRAM(void)
1032 int idx = memblock.memory.cnt - 1;
1034 return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
1037 void __init memblock_enforce_memory_limit(phys_addr_t limit)
1040 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
1045 /* find out max address */
1046 for (i = 0; i < memblock.memory.cnt; i++) {
1047 struct memblock_region *r = &memblock.memory.regions[i];
1049 if (limit <= r->size) {
1050 max_addr = r->base + limit;
1056 /* truncate both memory and reserved regions */
1057 __memblock_remove(&memblock.memory, max_addr, (phys_addr_t)ULLONG_MAX);
1058 __memblock_remove(&memblock.reserved, max_addr, (phys_addr_t)ULLONG_MAX);
1061 static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr)
1063 unsigned int left = 0, right = type->cnt;
1066 unsigned int mid = (right + left) / 2;
1068 if (addr < type->regions[mid].base)
1070 else if (addr >= (type->regions[mid].base +
1071 type->regions[mid].size))
1075 } while (left < right);
1079 int __init memblock_is_reserved(phys_addr_t addr)
1081 return memblock_search(&memblock.reserved, addr) != -1;
1084 int __init_memblock memblock_is_memory(phys_addr_t addr)
1086 return memblock_search(&memblock.memory, addr) != -1;
1089 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1090 int __init_memblock memblock_search_pfn_nid(unsigned long pfn,
1091 unsigned long *start_pfn, unsigned long *end_pfn)
1093 struct memblock_type *type = &memblock.memory;
1094 int mid = memblock_search(type, (phys_addr_t)pfn << PAGE_SHIFT);
1099 *start_pfn = type->regions[mid].base >> PAGE_SHIFT;
1100 *end_pfn = (type->regions[mid].base + type->regions[mid].size)
1103 return type->regions[mid].nid;
1108 * memblock_is_region_memory - check if a region is a subset of memory
1109 * @base: base of region to check
1110 * @size: size of region to check
1112 * Check if the region [@base, @base+@size) is a subset of a memory block.
1115 * 0 if false, non-zero if true
1117 int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size)
1119 int idx = memblock_search(&memblock.memory, base);
1120 phys_addr_t end = base + memblock_cap_size(base, &size);
1124 return memblock.memory.regions[idx].base <= base &&
1125 (memblock.memory.regions[idx].base +
1126 memblock.memory.regions[idx].size) >= end;
1130 * memblock_is_region_reserved - check if a region intersects reserved memory
1131 * @base: base of region to check
1132 * @size: size of region to check
1134 * Check if the region [@base, @base+@size) intersects a reserved memory block.
1137 * 0 if false, non-zero if true
1139 int __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size)
1141 memblock_cap_size(base, &size);
1142 return memblock_overlaps_region(&memblock.reserved, base, size) >= 0;
1145 void __init_memblock memblock_trim_memory(phys_addr_t align)
1148 phys_addr_t start, end, orig_start, orig_end;
1149 struct memblock_type *mem = &memblock.memory;
1151 for (i = 0; i < mem->cnt; i++) {
1152 orig_start = mem->regions[i].base;
1153 orig_end = mem->regions[i].base + mem->regions[i].size;
1154 start = round_up(orig_start, align);
1155 end = round_down(orig_end, align);
1157 if (start == orig_start && end == orig_end)
1161 mem->regions[i].base = start;
1162 mem->regions[i].size = end - start;
1164 memblock_remove_region(mem, i);
1170 void __init_memblock memblock_set_current_limit(phys_addr_t limit)
1172 memblock.current_limit = limit;
1175 static void __init_memblock memblock_dump(struct memblock_type *type, char *name)
1177 unsigned long long base, size;
1178 unsigned long flags;
1181 pr_info(" %s.cnt = 0x%lx\n", name, type->cnt);
1183 for (i = 0; i < type->cnt; i++) {
1184 struct memblock_region *rgn = &type->regions[i];
1185 char nid_buf[32] = "";
1190 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1191 if (memblock_get_region_node(rgn) != MAX_NUMNODES)
1192 snprintf(nid_buf, sizeof(nid_buf), " on node %d",
1193 memblock_get_region_node(rgn));
1195 pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s flags: %#lx\n",
1196 name, i, base, base + size - 1, size, nid_buf, flags);
1200 void __init_memblock __memblock_dump_all(void)
1202 pr_info("MEMBLOCK configuration:\n");
1203 pr_info(" memory size = %#llx reserved size = %#llx\n",
1204 (unsigned long long)memblock.memory.total_size,
1205 (unsigned long long)memblock.reserved.total_size);
1207 memblock_dump(&memblock.memory, "memory");
1208 memblock_dump(&memblock.reserved, "reserved");
1211 void __init memblock_allow_resize(void)
1213 memblock_can_resize = 1;
1216 static int __init early_memblock(char *p)
1218 if (p && strstr(p, "debug"))
1222 early_param("memblock", early_memblock);
1224 #if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
1226 static int memblock_debug_show(struct seq_file *m, void *private)
1228 struct memblock_type *type = m->private;
1229 struct memblock_region *reg;
1232 for (i = 0; i < type->cnt; i++) {
1233 reg = &type->regions[i];
1234 seq_printf(m, "%4d: ", i);
1235 if (sizeof(phys_addr_t) == 4)
1236 seq_printf(m, "0x%08lx..0x%08lx\n",
1237 (unsigned long)reg->base,
1238 (unsigned long)(reg->base + reg->size - 1));
1240 seq_printf(m, "0x%016llx..0x%016llx\n",
1241 (unsigned long long)reg->base,
1242 (unsigned long long)(reg->base + reg->size - 1));
1248 static int memblock_debug_open(struct inode *inode, struct file *file)
1250 return single_open(file, memblock_debug_show, inode->i_private);
1253 static const struct file_operations memblock_debug_fops = {
1254 .open = memblock_debug_open,
1256 .llseek = seq_lseek,
1257 .release = single_release,
1260 static int __init memblock_init_debugfs(void)
1262 struct dentry *root = debugfs_create_dir("memblock", NULL);
1265 debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops);
1266 debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops);
1270 __initcall(memblock_init_debugfs);
1272 #endif /* CONFIG_DEBUG_FS */