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;
40 static int memblock_memory_in_slab __initdata_memblock = 0;
41 static int memblock_reserved_in_slab __initdata_memblock = 0;
43 /* inline so we don't get a warning when pr_debug is compiled out */
44 static __init_memblock const char *
45 memblock_type_name(struct memblock_type *type)
47 if (type == &memblock.memory)
49 else if (type == &memblock.reserved)
55 /* adjust *@size so that (@base + *@size) doesn't overflow, return new size */
56 static inline phys_addr_t memblock_cap_size(phys_addr_t base, phys_addr_t *size)
58 return *size = min(*size, (phys_addr_t)ULLONG_MAX - base);
62 * Address comparison utilities
64 static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1,
65 phys_addr_t base2, phys_addr_t size2)
67 return ((base1 < (base2 + size2)) && (base2 < (base1 + size1)));
70 static long __init_memblock memblock_overlaps_region(struct memblock_type *type,
71 phys_addr_t base, phys_addr_t size)
75 for (i = 0; i < type->cnt; i++) {
76 phys_addr_t rgnbase = type->regions[i].base;
77 phys_addr_t rgnsize = type->regions[i].size;
78 if (memblock_addrs_overlap(base, size, rgnbase, rgnsize))
82 return (i < type->cnt) ? i : -1;
86 * __memblock_find_range_top_down - find free area utility, in top-down
87 * @start: start of candidate range
88 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
89 * @size: size of free area to find
90 * @align: alignment of free area to find
91 * @nid: nid of the free area to find, %MAX_NUMNODES for any node
93 * Utility called from memblock_find_in_range_node(), find free area top-down.
96 * Found address on success, %0 on failure.
98 static phys_addr_t __init_memblock
99 __memblock_find_range_top_down(phys_addr_t start, phys_addr_t end,
100 phys_addr_t size, phys_addr_t align, int nid)
102 phys_addr_t this_start, this_end, cand;
105 for_each_free_mem_range_reverse(i, nid, &this_start, &this_end, NULL) {
106 this_start = clamp(this_start, start, end);
107 this_end = clamp(this_end, start, end);
112 cand = round_down(this_end - size, align);
113 if (cand >= this_start)
121 * memblock_find_in_range_node - find free area in given range and node
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 * Find @size free area aligned to @align in the specified range and node.
131 * Found address on success, %0 on failure.
133 phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t start,
134 phys_addr_t end, phys_addr_t size,
135 phys_addr_t align, int nid)
138 if (end == MEMBLOCK_ALLOC_ACCESSIBLE)
139 end = memblock.current_limit;
141 /* avoid allocating the first page */
142 start = max_t(phys_addr_t, start, PAGE_SIZE);
143 end = max(start, end);
145 return __memblock_find_range_top_down(start, end, size, align, nid);
149 * memblock_find_in_range - find free area in given range
150 * @start: start of candidate range
151 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
152 * @size: size of free area to find
153 * @align: alignment of free area to find
155 * Find @size free area aligned to @align in the specified range.
158 * Found address on success, %0 on failure.
160 phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start,
161 phys_addr_t end, phys_addr_t size,
164 return memblock_find_in_range_node(start, end, size, align,
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 phys_addr_t __init_memblock get_allocated_memblock_reserved_regions_info(
188 if (memblock.reserved.regions == memblock_reserved_init_regions)
191 *addr = __pa(memblock.reserved.regions);
193 return PAGE_ALIGN(sizeof(struct memblock_region) *
194 memblock.reserved.max);
198 * memblock_double_array - double the size of the memblock regions array
199 * @type: memblock type of the regions array being doubled
200 * @new_area_start: starting address of memory range to avoid overlap with
201 * @new_area_size: size of memory range to avoid overlap with
203 * Double the size of the @type regions array. If memblock is being used to
204 * allocate memory for a new reserved regions array and there is a previously
205 * allocated memory range [@new_area_start,@new_area_start+@new_area_size]
206 * waiting to be reserved, ensure the memory used by the new array does
210 * 0 on success, -1 on failure.
212 static int __init_memblock memblock_double_array(struct memblock_type *type,
213 phys_addr_t new_area_start,
214 phys_addr_t new_area_size)
216 struct memblock_region *new_array, *old_array;
217 phys_addr_t old_alloc_size, new_alloc_size;
218 phys_addr_t old_size, new_size, addr;
219 int use_slab = slab_is_available();
222 /* We don't allow resizing until we know about the reserved regions
223 * of memory that aren't suitable for allocation
225 if (!memblock_can_resize)
228 /* Calculate new doubled size */
229 old_size = type->max * sizeof(struct memblock_region);
230 new_size = old_size << 1;
232 * We need to allocated new one align to PAGE_SIZE,
233 * so we can free them completely later.
235 old_alloc_size = PAGE_ALIGN(old_size);
236 new_alloc_size = PAGE_ALIGN(new_size);
238 /* Retrieve the slab flag */
239 if (type == &memblock.memory)
240 in_slab = &memblock_memory_in_slab;
242 in_slab = &memblock_reserved_in_slab;
244 /* Try to find some space for it.
246 * WARNING: We assume that either slab_is_available() and we use it or
247 * we use MEMBLOCK for allocations. That means that this is unsafe to
248 * use when bootmem is currently active (unless bootmem itself is
249 * implemented on top of MEMBLOCK which isn't the case yet)
251 * This should however not be an issue for now, as we currently only
252 * call into MEMBLOCK while it's still active, or much later when slab
253 * is active for memory hotplug operations
256 new_array = kmalloc(new_size, GFP_KERNEL);
257 addr = new_array ? __pa(new_array) : 0;
259 /* only exclude range when trying to double reserved.regions */
260 if (type != &memblock.reserved)
261 new_area_start = new_area_size = 0;
263 addr = memblock_find_in_range(new_area_start + new_area_size,
264 memblock.current_limit,
265 new_alloc_size, PAGE_SIZE);
266 if (!addr && new_area_size)
267 addr = memblock_find_in_range(0,
268 min(new_area_start, memblock.current_limit),
269 new_alloc_size, PAGE_SIZE);
271 new_array = addr ? __va(addr) : NULL;
274 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
275 memblock_type_name(type), type->max, type->max * 2);
279 memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]",
280 memblock_type_name(type), type->max * 2, (u64)addr,
281 (u64)addr + new_size - 1);
284 * Found space, we now need to move the array over before we add the
285 * reserved region since it may be our reserved array itself that is
288 memcpy(new_array, type->regions, old_size);
289 memset(new_array + type->max, 0, old_size);
290 old_array = type->regions;
291 type->regions = new_array;
294 /* Free old array. We needn't free it if the array is the static one */
297 else if (old_array != memblock_memory_init_regions &&
298 old_array != memblock_reserved_init_regions)
299 memblock_free(__pa(old_array), old_alloc_size);
302 * Reserve the new array if that comes from the memblock. Otherwise, we
306 BUG_ON(memblock_reserve(addr, new_alloc_size));
308 /* Update slab flag */
315 * memblock_merge_regions - merge neighboring compatible regions
316 * @type: memblock type to scan
318 * Scan @type and merge neighboring compatible regions.
320 static void __init_memblock memblock_merge_regions(struct memblock_type *type)
324 /* cnt never goes below 1 */
325 while (i < type->cnt - 1) {
326 struct memblock_region *this = &type->regions[i];
327 struct memblock_region *next = &type->regions[i + 1];
329 if (this->base + this->size != next->base ||
330 memblock_get_region_node(this) !=
331 memblock_get_region_node(next)) {
332 BUG_ON(this->base + this->size > next->base);
337 this->size += next->size;
338 /* move forward from next + 1, index of which is i + 2 */
339 memmove(next, next + 1, (type->cnt - (i + 2)) * sizeof(*next));
345 * memblock_insert_region - insert new memblock region
346 * @type: memblock type to insert into
347 * @idx: index for the insertion point
348 * @base: base address of the new region
349 * @size: size of the new region
350 * @nid: node id of the new region
352 * Insert new memblock region [@base,@base+@size) into @type at @idx.
353 * @type must already have extra room to accomodate the new region.
355 static void __init_memblock memblock_insert_region(struct memblock_type *type,
356 int idx, phys_addr_t base,
357 phys_addr_t size, int nid)
359 struct memblock_region *rgn = &type->regions[idx];
361 BUG_ON(type->cnt >= type->max);
362 memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn));
365 memblock_set_region_node(rgn, nid);
367 type->total_size += size;
371 * memblock_add_region - add new memblock region
372 * @type: memblock type to add new region into
373 * @base: base address of the new region
374 * @size: size of the new region
375 * @nid: nid of the new region
377 * Add new memblock region [@base,@base+@size) into @type. The new region
378 * is allowed to overlap with existing ones - overlaps don't affect already
379 * existing regions. @type is guaranteed to be minimal (all neighbouring
380 * compatible regions are merged) after the addition.
383 * 0 on success, -errno on failure.
385 static int __init_memblock memblock_add_region(struct memblock_type *type,
386 phys_addr_t base, phys_addr_t size, int nid)
389 phys_addr_t obase = base;
390 phys_addr_t end = base + memblock_cap_size(base, &size);
396 /* special case for empty array */
397 if (type->regions[0].size == 0) {
398 WARN_ON(type->cnt != 1 || type->total_size);
399 type->regions[0].base = base;
400 type->regions[0].size = size;
401 memblock_set_region_node(&type->regions[0], nid);
402 type->total_size = size;
407 * The following is executed twice. Once with %false @insert and
408 * then with %true. The first counts the number of regions needed
409 * to accomodate the new area. The second actually inserts them.
414 for (i = 0; i < type->cnt; i++) {
415 struct memblock_region *rgn = &type->regions[i];
416 phys_addr_t rbase = rgn->base;
417 phys_addr_t rend = rbase + rgn->size;
424 * @rgn overlaps. If it separates the lower part of new
425 * area, insert that portion.
430 memblock_insert_region(type, i++, base,
433 /* area below @rend is dealt with, forget about it */
434 base = min(rend, end);
437 /* insert the remaining portion */
441 memblock_insert_region(type, i, base, end - base, nid);
445 * If this was the first round, resize array and repeat for actual
446 * insertions; otherwise, merge and return.
449 while (type->cnt + nr_new > type->max)
450 if (memblock_double_array(type, obase, size) < 0)
455 memblock_merge_regions(type);
460 int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size,
463 return memblock_add_region(&memblock.memory, base, size, nid);
466 int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size)
468 return memblock_add_region(&memblock.memory, base, size, MAX_NUMNODES);
472 * memblock_isolate_range - isolate given range into disjoint memblocks
473 * @type: memblock type to isolate range for
474 * @base: base of range to isolate
475 * @size: size of range to isolate
476 * @start_rgn: out parameter for the start of isolated region
477 * @end_rgn: out parameter for the end of isolated region
479 * Walk @type and ensure that regions don't cross the boundaries defined by
480 * [@base,@base+@size). Crossing regions are split at the boundaries,
481 * which may create at most two more regions. The index of the first
482 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
485 * 0 on success, -errno on failure.
487 static int __init_memblock memblock_isolate_range(struct memblock_type *type,
488 phys_addr_t base, phys_addr_t size,
489 int *start_rgn, int *end_rgn)
491 phys_addr_t end = base + memblock_cap_size(base, &size);
494 *start_rgn = *end_rgn = 0;
499 /* we'll create at most two more regions */
500 while (type->cnt + 2 > type->max)
501 if (memblock_double_array(type, base, size) < 0)
504 for (i = 0; i < type->cnt; i++) {
505 struct memblock_region *rgn = &type->regions[i];
506 phys_addr_t rbase = rgn->base;
507 phys_addr_t rend = rbase + rgn->size;
516 * @rgn intersects from below. Split and continue
517 * to process the next region - the new top half.
520 rgn->size -= base - rbase;
521 type->total_size -= base - rbase;
522 memblock_insert_region(type, i, rbase, base - rbase,
523 memblock_get_region_node(rgn));
524 } else if (rend > end) {
526 * @rgn intersects from above. Split and redo the
527 * current region - the new bottom half.
530 rgn->size -= end - rbase;
531 type->total_size -= end - rbase;
532 memblock_insert_region(type, i--, rbase, end - rbase,
533 memblock_get_region_node(rgn));
535 /* @rgn is fully contained, record it */
545 static int __init_memblock __memblock_remove(struct memblock_type *type,
546 phys_addr_t base, phys_addr_t size)
548 int start_rgn, end_rgn;
551 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
555 for (i = end_rgn - 1; i >= start_rgn; i--)
556 memblock_remove_region(type, i);
560 int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size)
562 return __memblock_remove(&memblock.memory, base, size);
565 int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size)
567 memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n",
568 (unsigned long long)base,
569 (unsigned long long)base + size,
572 return __memblock_remove(&memblock.reserved, base, size);
575 int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size)
577 struct memblock_type *_rgn = &memblock.reserved;
579 memblock_dbg("memblock_reserve: [%#016llx-%#016llx] %pF\n",
580 (unsigned long long)base,
581 (unsigned long long)base + size,
584 return memblock_add_region(_rgn, base, size, MAX_NUMNODES);
588 * __next_free_mem_range - next function for for_each_free_mem_range()
589 * @idx: pointer to u64 loop variable
590 * @nid: node selector, %MAX_NUMNODES for all nodes
591 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
592 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
593 * @out_nid: ptr to int for nid of the range, can be %NULL
595 * Find the first free area from *@idx which matches @nid, fill the out
596 * parameters, and update *@idx for the next iteration. The lower 32bit of
597 * *@idx contains index into memory region and the upper 32bit indexes the
598 * areas before each reserved region. For example, if reserved regions
599 * look like the following,
601 * 0:[0-16), 1:[32-48), 2:[128-130)
603 * The upper 32bit indexes the following regions.
605 * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX)
607 * As both region arrays are sorted, the function advances the two indices
608 * in lockstep and returns each intersection.
610 void __init_memblock __next_free_mem_range(u64 *idx, int nid,
611 phys_addr_t *out_start,
612 phys_addr_t *out_end, int *out_nid)
614 struct memblock_type *mem = &memblock.memory;
615 struct memblock_type *rsv = &memblock.reserved;
616 int mi = *idx & 0xffffffff;
619 for ( ; mi < mem->cnt; mi++) {
620 struct memblock_region *m = &mem->regions[mi];
621 phys_addr_t m_start = m->base;
622 phys_addr_t m_end = m->base + m->size;
624 /* only memory regions are associated with nodes, check it */
625 if (nid != MAX_NUMNODES && nid != memblock_get_region_node(m))
628 /* scan areas before each reservation for intersection */
629 for ( ; ri < rsv->cnt + 1; ri++) {
630 struct memblock_region *r = &rsv->regions[ri];
631 phys_addr_t r_start = ri ? r[-1].base + r[-1].size : 0;
632 phys_addr_t r_end = ri < rsv->cnt ? r->base : ULLONG_MAX;
634 /* if ri advanced past mi, break out to advance mi */
635 if (r_start >= m_end)
637 /* if the two regions intersect, we're done */
638 if (m_start < r_end) {
640 *out_start = max(m_start, r_start);
642 *out_end = min(m_end, r_end);
644 *out_nid = memblock_get_region_node(m);
646 * The region which ends first is advanced
647 * for the next iteration.
653 *idx = (u32)mi | (u64)ri << 32;
659 /* signal end of iteration */
664 * __next_free_mem_range_rev - next function for for_each_free_mem_range_reverse()
665 * @idx: pointer to u64 loop variable
666 * @nid: nid: node selector, %MAX_NUMNODES for all nodes
667 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
668 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
669 * @out_nid: ptr to int for nid of the range, can be %NULL
671 * Reverse of __next_free_mem_range().
673 void __init_memblock __next_free_mem_range_rev(u64 *idx, int nid,
674 phys_addr_t *out_start,
675 phys_addr_t *out_end, int *out_nid)
677 struct memblock_type *mem = &memblock.memory;
678 struct memblock_type *rsv = &memblock.reserved;
679 int mi = *idx & 0xffffffff;
682 if (*idx == (u64)ULLONG_MAX) {
687 for ( ; mi >= 0; mi--) {
688 struct memblock_region *m = &mem->regions[mi];
689 phys_addr_t m_start = m->base;
690 phys_addr_t m_end = m->base + m->size;
692 /* only memory regions are associated with nodes, check it */
693 if (nid != MAX_NUMNODES && nid != memblock_get_region_node(m))
696 /* scan areas before each reservation for intersection */
697 for ( ; ri >= 0; ri--) {
698 struct memblock_region *r = &rsv->regions[ri];
699 phys_addr_t r_start = ri ? r[-1].base + r[-1].size : 0;
700 phys_addr_t r_end = ri < rsv->cnt ? r->base : ULLONG_MAX;
702 /* if ri advanced past mi, break out to advance mi */
703 if (r_end <= m_start)
705 /* if the two regions intersect, we're done */
706 if (m_end > r_start) {
708 *out_start = max(m_start, r_start);
710 *out_end = min(m_end, r_end);
712 *out_nid = memblock_get_region_node(m);
714 if (m_start >= r_start)
718 *idx = (u32)mi | (u64)ri << 32;
727 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
729 * Common iterator interface used to define for_each_mem_range().
731 void __init_memblock __next_mem_pfn_range(int *idx, int nid,
732 unsigned long *out_start_pfn,
733 unsigned long *out_end_pfn, int *out_nid)
735 struct memblock_type *type = &memblock.memory;
736 struct memblock_region *r;
738 while (++*idx < type->cnt) {
739 r = &type->regions[*idx];
741 if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size))
743 if (nid == MAX_NUMNODES || nid == r->nid)
746 if (*idx >= type->cnt) {
752 *out_start_pfn = PFN_UP(r->base);
754 *out_end_pfn = PFN_DOWN(r->base + r->size);
760 * memblock_set_node - set node ID on memblock regions
761 * @base: base of area to set node ID for
762 * @size: size of area to set node ID for
763 * @nid: node ID to set
765 * Set the nid of memblock memory regions in [@base,@base+@size) to @nid.
766 * Regions which cross the area boundaries are split as necessary.
769 * 0 on success, -errno on failure.
771 int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size,
774 struct memblock_type *type = &memblock.memory;
775 int start_rgn, end_rgn;
778 ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn);
782 for (i = start_rgn; i < end_rgn; i++)
783 memblock_set_region_node(&type->regions[i], nid);
785 memblock_merge_regions(type);
788 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
790 static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size,
791 phys_addr_t align, phys_addr_t max_addr,
797 align = __alignof__(long long);
799 /* align @size to avoid excessive fragmentation on reserved array */
800 size = round_up(size, align);
802 found = memblock_find_in_range_node(0, max_addr, size, align, nid);
803 if (found && !memblock_reserve(found, size))
809 phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid)
811 return memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE, nid);
814 phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
816 return memblock_alloc_base_nid(size, align, max_addr, MAX_NUMNODES);
819 phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
823 alloc = __memblock_alloc_base(size, align, max_addr);
826 panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n",
827 (unsigned long long) size, (unsigned long long) max_addr);
832 phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align)
834 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
837 phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid)
839 phys_addr_t res = memblock_alloc_nid(size, align, nid);
843 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
848 * Remaining API functions
851 phys_addr_t __init memblock_phys_mem_size(void)
853 return memblock.memory.total_size;
856 phys_addr_t __init memblock_mem_size(unsigned long limit_pfn)
858 unsigned long pages = 0;
859 struct memblock_region *r;
860 unsigned long start_pfn, end_pfn;
862 for_each_memblock(memory, r) {
863 start_pfn = memblock_region_memory_base_pfn(r);
864 end_pfn = memblock_region_memory_end_pfn(r);
865 start_pfn = min_t(unsigned long, start_pfn, limit_pfn);
866 end_pfn = min_t(unsigned long, end_pfn, limit_pfn);
867 pages += end_pfn - start_pfn;
870 return (phys_addr_t)pages << PAGE_SHIFT;
874 phys_addr_t __init_memblock memblock_start_of_DRAM(void)
876 return memblock.memory.regions[0].base;
879 phys_addr_t __init_memblock memblock_end_of_DRAM(void)
881 int idx = memblock.memory.cnt - 1;
883 return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
886 void __init memblock_enforce_memory_limit(phys_addr_t limit)
889 phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX;
894 /* find out max address */
895 for (i = 0; i < memblock.memory.cnt; i++) {
896 struct memblock_region *r = &memblock.memory.regions[i];
898 if (limit <= r->size) {
899 max_addr = r->base + limit;
905 /* truncate both memory and reserved regions */
906 __memblock_remove(&memblock.memory, max_addr, (phys_addr_t)ULLONG_MAX);
907 __memblock_remove(&memblock.reserved, max_addr, (phys_addr_t)ULLONG_MAX);
910 static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr)
912 unsigned int left = 0, right = type->cnt;
915 unsigned int mid = (right + left) / 2;
917 if (addr < type->regions[mid].base)
919 else if (addr >= (type->regions[mid].base +
920 type->regions[mid].size))
924 } while (left < right);
928 int __init memblock_is_reserved(phys_addr_t addr)
930 return memblock_search(&memblock.reserved, addr) != -1;
933 int __init_memblock memblock_is_memory(phys_addr_t addr)
935 return memblock_search(&memblock.memory, addr) != -1;
938 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
939 int __init_memblock memblock_search_pfn_nid(unsigned long pfn,
940 unsigned long *start_pfn, unsigned long *end_pfn)
942 struct memblock_type *type = &memblock.memory;
943 int mid = memblock_search(type, (phys_addr_t)pfn << PAGE_SHIFT);
948 *start_pfn = type->regions[mid].base >> PAGE_SHIFT;
949 *end_pfn = (type->regions[mid].base + type->regions[mid].size)
952 return type->regions[mid].nid;
957 * memblock_is_region_memory - check if a region is a subset of memory
958 * @base: base of region to check
959 * @size: size of region to check
961 * Check if the region [@base, @base+@size) is a subset of a memory block.
964 * 0 if false, non-zero if true
966 int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size)
968 int idx = memblock_search(&memblock.memory, base);
969 phys_addr_t end = base + memblock_cap_size(base, &size);
973 return memblock.memory.regions[idx].base <= base &&
974 (memblock.memory.regions[idx].base +
975 memblock.memory.regions[idx].size) >= end;
979 * memblock_is_region_reserved - check if a region intersects reserved memory
980 * @base: base of region to check
981 * @size: size of region to check
983 * Check if the region [@base, @base+@size) intersects a reserved memory block.
986 * 0 if false, non-zero if true
988 int __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size)
990 memblock_cap_size(base, &size);
991 return memblock_overlaps_region(&memblock.reserved, base, size) >= 0;
994 void __init_memblock memblock_trim_memory(phys_addr_t align)
997 phys_addr_t start, end, orig_start, orig_end;
998 struct memblock_type *mem = &memblock.memory;
1000 for (i = 0; i < mem->cnt; i++) {
1001 orig_start = mem->regions[i].base;
1002 orig_end = mem->regions[i].base + mem->regions[i].size;
1003 start = round_up(orig_start, align);
1004 end = round_down(orig_end, align);
1006 if (start == orig_start && end == orig_end)
1010 mem->regions[i].base = start;
1011 mem->regions[i].size = end - start;
1013 memblock_remove_region(mem, i);
1019 void __init_memblock memblock_set_current_limit(phys_addr_t limit)
1021 memblock.current_limit = limit;
1024 static void __init_memblock memblock_dump(struct memblock_type *type, char *name)
1026 unsigned long long base, size;
1029 pr_info(" %s.cnt = 0x%lx\n", name, type->cnt);
1031 for (i = 0; i < type->cnt; i++) {
1032 struct memblock_region *rgn = &type->regions[i];
1033 char nid_buf[32] = "";
1037 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1038 if (memblock_get_region_node(rgn) != MAX_NUMNODES)
1039 snprintf(nid_buf, sizeof(nid_buf), " on node %d",
1040 memblock_get_region_node(rgn));
1042 pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s\n",
1043 name, i, base, base + size - 1, size, nid_buf);
1047 void __init_memblock __memblock_dump_all(void)
1049 pr_info("MEMBLOCK configuration:\n");
1050 pr_info(" memory size = %#llx reserved size = %#llx\n",
1051 (unsigned long long)memblock.memory.total_size,
1052 (unsigned long long)memblock.reserved.total_size);
1054 memblock_dump(&memblock.memory, "memory");
1055 memblock_dump(&memblock.reserved, "reserved");
1058 void __init memblock_allow_resize(void)
1060 memblock_can_resize = 1;
1063 static int __init early_memblock(char *p)
1065 if (p && strstr(p, "debug"))
1069 early_param("memblock", early_memblock);
1071 #if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
1073 static int memblock_debug_show(struct seq_file *m, void *private)
1075 struct memblock_type *type = m->private;
1076 struct memblock_region *reg;
1079 for (i = 0; i < type->cnt; i++) {
1080 reg = &type->regions[i];
1081 seq_printf(m, "%4d: ", i);
1082 if (sizeof(phys_addr_t) == 4)
1083 seq_printf(m, "0x%08lx..0x%08lx\n",
1084 (unsigned long)reg->base,
1085 (unsigned long)(reg->base + reg->size - 1));
1087 seq_printf(m, "0x%016llx..0x%016llx\n",
1088 (unsigned long long)reg->base,
1089 (unsigned long long)(reg->base + reg->size - 1));
1095 static int memblock_debug_open(struct inode *inode, struct file *file)
1097 return single_open(file, memblock_debug_show, inode->i_private);
1100 static const struct file_operations memblock_debug_fops = {
1101 .open = memblock_debug_open,
1103 .llseek = seq_lseek,
1104 .release = single_release,
1107 static int __init memblock_init_debugfs(void)
1109 struct dentry *root = debugfs_create_dir("memblock", NULL);
1112 debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops);
1113 debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops);
1117 __initcall(memblock_init_debugfs);
1119 #endif /* CONFIG_DEBUG_FS */