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>
28 static struct memblock_region memblock_memory_init_regions
[INIT_MEMBLOCK_REGIONS
] __initdata_memblock
;
29 static struct memblock_region memblock_reserved_init_regions
[INIT_MEMBLOCK_REGIONS
] __initdata_memblock
;
30 #ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
31 static struct memblock_region memblock_physmem_init_regions
[INIT_PHYSMEM_REGIONS
] __initdata_memblock
;
34 struct memblock memblock __initdata_memblock
= {
35 .memory
.regions
= memblock_memory_init_regions
,
36 .memory
.cnt
= 1, /* empty dummy entry */
37 .memory
.max
= INIT_MEMBLOCK_REGIONS
,
39 .reserved
.regions
= memblock_reserved_init_regions
,
40 .reserved
.cnt
= 1, /* empty dummy entry */
41 .reserved
.max
= INIT_MEMBLOCK_REGIONS
,
43 #ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
44 .physmem
.regions
= memblock_physmem_init_regions
,
45 .physmem
.cnt
= 1, /* empty dummy entry */
46 .physmem
.max
= INIT_PHYSMEM_REGIONS
,
50 .current_limit
= MEMBLOCK_ALLOC_ANYWHERE
,
53 int memblock_debug __initdata_memblock
;
54 #ifdef CONFIG_MOVABLE_NODE
55 bool movable_node_enabled __initdata_memblock
= false;
57 static bool system_has_some_mirror __initdata_memblock
= false;
58 static int memblock_can_resize __initdata_memblock
;
59 static int memblock_memory_in_slab __initdata_memblock
= 0;
60 static int memblock_reserved_in_slab __initdata_memblock
= 0;
62 ulong __init_memblock
choose_memblock_flags(void)
64 return system_has_some_mirror
? MEMBLOCK_MIRROR
: MEMBLOCK_NONE
;
67 /* inline so we don't get a warning when pr_debug is compiled out */
68 static __init_memblock
const char *
69 memblock_type_name(struct memblock_type
*type
)
71 if (type
== &memblock
.memory
)
73 else if (type
== &memblock
.reserved
)
79 /* adjust *@size so that (@base + *@size) doesn't overflow, return new size */
80 static inline phys_addr_t
memblock_cap_size(phys_addr_t base
, phys_addr_t
*size
)
82 return *size
= min(*size
, (phys_addr_t
)ULLONG_MAX
- base
);
86 * Address comparison utilities
88 static unsigned long __init_memblock
memblock_addrs_overlap(phys_addr_t base1
, phys_addr_t size1
,
89 phys_addr_t base2
, phys_addr_t size2
)
91 return ((base1
< (base2
+ size2
)) && (base2
< (base1
+ size1
)));
94 bool __init_memblock
memblock_overlaps_region(struct memblock_type
*type
,
95 phys_addr_t base
, phys_addr_t size
)
99 for (i
= 0; i
< type
->cnt
; i
++)
100 if (memblock_addrs_overlap(base
, size
, type
->regions
[i
].base
,
101 type
->regions
[i
].size
))
103 return i
< type
->cnt
;
107 * __memblock_find_range_bottom_up - find free area utility in bottom-up
108 * @start: start of candidate range
109 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
110 * @size: size of free area to find
111 * @align: alignment of free area to find
112 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
113 * @flags: pick from blocks based on memory attributes
115 * Utility called from memblock_find_in_range_node(), find free area bottom-up.
118 * Found address on success, 0 on failure.
120 static phys_addr_t __init_memblock
121 __memblock_find_range_bottom_up(phys_addr_t start
, phys_addr_t end
,
122 phys_addr_t size
, phys_addr_t align
, int nid
,
125 phys_addr_t this_start
, this_end
, cand
;
128 for_each_free_mem_range(i
, nid
, flags
, &this_start
, &this_end
, NULL
) {
129 this_start
= clamp(this_start
, start
, end
);
130 this_end
= clamp(this_end
, start
, end
);
132 cand
= round_up(this_start
, align
);
133 if (cand
< this_end
&& this_end
- cand
>= size
)
141 * __memblock_find_range_top_down - find free area utility, in top-down
142 * @start: start of candidate range
143 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
144 * @size: size of free area to find
145 * @align: alignment of free area to find
146 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
147 * @flags: pick from blocks based on memory attributes
149 * Utility called from memblock_find_in_range_node(), find free area top-down.
152 * Found address on success, 0 on failure.
154 static phys_addr_t __init_memblock
155 __memblock_find_range_top_down(phys_addr_t start
, phys_addr_t end
,
156 phys_addr_t size
, phys_addr_t align
, int nid
,
159 phys_addr_t this_start
, this_end
, cand
;
162 for_each_free_mem_range_reverse(i
, nid
, flags
, &this_start
, &this_end
,
164 this_start
= clamp(this_start
, start
, end
);
165 this_end
= clamp(this_end
, start
, end
);
170 cand
= round_down(this_end
- size
, align
);
171 if (cand
>= this_start
)
179 * memblock_find_in_range_node - find free area in given range and node
180 * @size: size of free area to find
181 * @align: alignment of free area to find
182 * @start: start of candidate range
183 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
184 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
185 * @flags: pick from blocks based on memory attributes
187 * Find @size free area aligned to @align in the specified range and node.
189 * When allocation direction is bottom-up, the @start should be greater
190 * than the end of the kernel image. Otherwise, it will be trimmed. The
191 * reason is that we want the bottom-up allocation just near the kernel
192 * image so it is highly likely that the allocated memory and the kernel
193 * will reside in the same node.
195 * If bottom-up allocation failed, will try to allocate memory top-down.
198 * Found address on success, 0 on failure.
200 phys_addr_t __init_memblock
memblock_find_in_range_node(phys_addr_t size
,
201 phys_addr_t align
, phys_addr_t start
,
202 phys_addr_t end
, int nid
, ulong flags
)
204 phys_addr_t kernel_end
, ret
;
207 if (end
== MEMBLOCK_ALLOC_ACCESSIBLE
)
208 end
= memblock
.current_limit
;
210 /* avoid allocating the first page */
211 start
= max_t(phys_addr_t
, start
, PAGE_SIZE
);
212 end
= max(start
, end
);
213 kernel_end
= __pa_symbol(_end
);
216 * try bottom-up allocation only when bottom-up mode
217 * is set and @end is above the kernel image.
219 if (memblock_bottom_up() && end
> kernel_end
) {
220 phys_addr_t bottom_up_start
;
222 /* make sure we will allocate above the kernel */
223 bottom_up_start
= max(start
, kernel_end
);
225 /* ok, try bottom-up allocation first */
226 ret
= __memblock_find_range_bottom_up(bottom_up_start
, end
,
227 size
, align
, nid
, flags
);
232 * we always limit bottom-up allocation above the kernel,
233 * but top-down allocation doesn't have the limit, so
234 * retrying top-down allocation may succeed when bottom-up
237 * bottom-up allocation is expected to be fail very rarely,
238 * so we use WARN_ONCE() here to see the stack trace if
241 WARN_ONCE(1, "memblock: bottom-up allocation failed, "
242 "memory hotunplug may be affected\n");
245 return __memblock_find_range_top_down(start
, end
, size
, align
, nid
,
250 * memblock_find_in_range - find free area in given range
251 * @start: start of candidate range
252 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
253 * @size: size of free area to find
254 * @align: alignment of free area to find
256 * Find @size free area aligned to @align in the specified range.
259 * Found address on success, 0 on failure.
261 phys_addr_t __init_memblock
memblock_find_in_range(phys_addr_t start
,
262 phys_addr_t end
, phys_addr_t size
,
266 ulong flags
= choose_memblock_flags();
269 ret
= memblock_find_in_range_node(size
, align
, start
, end
,
270 NUMA_NO_NODE
, flags
);
272 if (!ret
&& (flags
& MEMBLOCK_MIRROR
)) {
273 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
275 flags
&= ~MEMBLOCK_MIRROR
;
282 static void __init_memblock
memblock_remove_region(struct memblock_type
*type
, unsigned long r
)
284 type
->total_size
-= type
->regions
[r
].size
;
285 memmove(&type
->regions
[r
], &type
->regions
[r
+ 1],
286 (type
->cnt
- (r
+ 1)) * sizeof(type
->regions
[r
]));
289 /* Special case for empty arrays */
290 if (type
->cnt
== 0) {
291 WARN_ON(type
->total_size
!= 0);
293 type
->regions
[0].base
= 0;
294 type
->regions
[0].size
= 0;
295 type
->regions
[0].flags
= 0;
296 memblock_set_region_node(&type
->regions
[0], MAX_NUMNODES
);
300 #ifdef CONFIG_ARCH_DISCARD_MEMBLOCK
302 phys_addr_t __init_memblock
get_allocated_memblock_reserved_regions_info(
305 if (memblock
.reserved
.regions
== memblock_reserved_init_regions
)
308 *addr
= __pa(memblock
.reserved
.regions
);
310 return PAGE_ALIGN(sizeof(struct memblock_region
) *
311 memblock
.reserved
.max
);
314 phys_addr_t __init_memblock
get_allocated_memblock_memory_regions_info(
317 if (memblock
.memory
.regions
== memblock_memory_init_regions
)
320 *addr
= __pa(memblock
.memory
.regions
);
322 return PAGE_ALIGN(sizeof(struct memblock_region
) *
323 memblock
.memory
.max
);
329 * memblock_double_array - double the size of the memblock regions array
330 * @type: memblock type of the regions array being doubled
331 * @new_area_start: starting address of memory range to avoid overlap with
332 * @new_area_size: size of memory range to avoid overlap with
334 * Double the size of the @type regions array. If memblock is being used to
335 * allocate memory for a new reserved regions array and there is a previously
336 * allocated memory range [@new_area_start,@new_area_start+@new_area_size]
337 * waiting to be reserved, ensure the memory used by the new array does
341 * 0 on success, -1 on failure.
343 static int __init_memblock
memblock_double_array(struct memblock_type
*type
,
344 phys_addr_t new_area_start
,
345 phys_addr_t new_area_size
)
347 struct memblock_region
*new_array
, *old_array
;
348 phys_addr_t old_alloc_size
, new_alloc_size
;
349 phys_addr_t old_size
, new_size
, addr
;
350 int use_slab
= slab_is_available();
353 /* We don't allow resizing until we know about the reserved regions
354 * of memory that aren't suitable for allocation
356 if (!memblock_can_resize
)
359 /* Calculate new doubled size */
360 old_size
= type
->max
* sizeof(struct memblock_region
);
361 new_size
= old_size
<< 1;
363 * We need to allocated new one align to PAGE_SIZE,
364 * so we can free them completely later.
366 old_alloc_size
= PAGE_ALIGN(old_size
);
367 new_alloc_size
= PAGE_ALIGN(new_size
);
369 /* Retrieve the slab flag */
370 if (type
== &memblock
.memory
)
371 in_slab
= &memblock_memory_in_slab
;
373 in_slab
= &memblock_reserved_in_slab
;
375 /* Try to find some space for it.
377 * WARNING: We assume that either slab_is_available() and we use it or
378 * we use MEMBLOCK for allocations. That means that this is unsafe to
379 * use when bootmem is currently active (unless bootmem itself is
380 * implemented on top of MEMBLOCK which isn't the case yet)
382 * This should however not be an issue for now, as we currently only
383 * call into MEMBLOCK while it's still active, or much later when slab
384 * is active for memory hotplug operations
387 new_array
= kmalloc(new_size
, GFP_KERNEL
);
388 addr
= new_array
? __pa(new_array
) : 0;
390 /* only exclude range when trying to double reserved.regions */
391 if (type
!= &memblock
.reserved
)
392 new_area_start
= new_area_size
= 0;
394 addr
= memblock_find_in_range(new_area_start
+ new_area_size
,
395 memblock
.current_limit
,
396 new_alloc_size
, PAGE_SIZE
);
397 if (!addr
&& new_area_size
)
398 addr
= memblock_find_in_range(0,
399 min(new_area_start
, memblock
.current_limit
),
400 new_alloc_size
, PAGE_SIZE
);
402 new_array
= addr
? __va(addr
) : NULL
;
405 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
406 memblock_type_name(type
), type
->max
, type
->max
* 2);
410 memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]",
411 memblock_type_name(type
), type
->max
* 2, (u64
)addr
,
412 (u64
)addr
+ new_size
- 1);
415 * Found space, we now need to move the array over before we add the
416 * reserved region since it may be our reserved array itself that is
419 memcpy(new_array
, type
->regions
, old_size
);
420 memset(new_array
+ type
->max
, 0, old_size
);
421 old_array
= type
->regions
;
422 type
->regions
= new_array
;
425 /* Free old array. We needn't free it if the array is the static one */
428 else if (old_array
!= memblock_memory_init_regions
&&
429 old_array
!= memblock_reserved_init_regions
)
430 memblock_free(__pa(old_array
), old_alloc_size
);
433 * Reserve the new array if that comes from the memblock. Otherwise, we
437 BUG_ON(memblock_reserve(addr
, new_alloc_size
));
439 /* Update slab flag */
446 * memblock_merge_regions - merge neighboring compatible regions
447 * @type: memblock type to scan
449 * Scan @type and merge neighboring compatible regions.
451 static void __init_memblock
memblock_merge_regions(struct memblock_type
*type
)
455 /* cnt never goes below 1 */
456 while (i
< type
->cnt
- 1) {
457 struct memblock_region
*this = &type
->regions
[i
];
458 struct memblock_region
*next
= &type
->regions
[i
+ 1];
460 if (this->base
+ this->size
!= next
->base
||
461 memblock_get_region_node(this) !=
462 memblock_get_region_node(next
) ||
463 this->flags
!= next
->flags
) {
464 BUG_ON(this->base
+ this->size
> next
->base
);
469 this->size
+= next
->size
;
470 /* move forward from next + 1, index of which is i + 2 */
471 memmove(next
, next
+ 1, (type
->cnt
- (i
+ 2)) * sizeof(*next
));
477 * memblock_insert_region - insert new memblock region
478 * @type: memblock type to insert into
479 * @idx: index for the insertion point
480 * @base: base address of the new region
481 * @size: size of the new region
482 * @nid: node id of the new region
483 * @flags: flags of the new region
485 * Insert new memblock region [@base,@base+@size) into @type at @idx.
486 * @type must already have extra room to accomodate the new region.
488 static void __init_memblock
memblock_insert_region(struct memblock_type
*type
,
489 int idx
, phys_addr_t base
,
491 int nid
, unsigned long flags
)
493 struct memblock_region
*rgn
= &type
->regions
[idx
];
495 BUG_ON(type
->cnt
>= type
->max
);
496 memmove(rgn
+ 1, rgn
, (type
->cnt
- idx
) * sizeof(*rgn
));
500 memblock_set_region_node(rgn
, nid
);
502 type
->total_size
+= size
;
506 * memblock_add_range - add new memblock region
507 * @type: memblock type to add new region into
508 * @base: base address of the new region
509 * @size: size of the new region
510 * @nid: nid of the new region
511 * @flags: flags of the new region
513 * Add new memblock region [@base,@base+@size) into @type. The new region
514 * is allowed to overlap with existing ones - overlaps don't affect already
515 * existing regions. @type is guaranteed to be minimal (all neighbouring
516 * compatible regions are merged) after the addition.
519 * 0 on success, -errno on failure.
521 int __init_memblock
memblock_add_range(struct memblock_type
*type
,
522 phys_addr_t base
, phys_addr_t size
,
523 int nid
, unsigned long flags
)
526 phys_addr_t obase
= base
;
527 phys_addr_t end
= base
+ memblock_cap_size(base
, &size
);
529 struct memblock_region
*rgn
;
534 /* special case for empty array */
535 if (type
->regions
[0].size
== 0) {
536 WARN_ON(type
->cnt
!= 1 || type
->total_size
);
537 type
->regions
[0].base
= base
;
538 type
->regions
[0].size
= size
;
539 type
->regions
[0].flags
= flags
;
540 memblock_set_region_node(&type
->regions
[0], nid
);
541 type
->total_size
= size
;
546 * The following is executed twice. Once with %false @insert and
547 * then with %true. The first counts the number of regions needed
548 * to accomodate the new area. The second actually inserts them.
553 for_each_memblock_type(type
, rgn
) {
554 phys_addr_t rbase
= rgn
->base
;
555 phys_addr_t rend
= rbase
+ rgn
->size
;
562 * @rgn overlaps. If it separates the lower part of new
563 * area, insert that portion.
566 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
567 WARN_ON(nid
!= memblock_get_region_node(rgn
));
569 WARN_ON(flags
!= rgn
->flags
);
572 memblock_insert_region(type
, idx
++, base
,
576 /* area below @rend is dealt with, forget about it */
577 base
= min(rend
, end
);
580 /* insert the remaining portion */
584 memblock_insert_region(type
, idx
, base
, end
- base
,
589 * If this was the first round, resize array and repeat for actual
590 * insertions; otherwise, merge and return.
593 while (type
->cnt
+ nr_new
> type
->max
)
594 if (memblock_double_array(type
, obase
, size
) < 0)
599 memblock_merge_regions(type
);
604 int __init_memblock
memblock_add_node(phys_addr_t base
, phys_addr_t size
,
607 return memblock_add_range(&memblock
.memory
, base
, size
, nid
, 0);
610 static int __init_memblock
memblock_add_region(phys_addr_t base
,
615 memblock_dbg("memblock_add: [%#016llx-%#016llx] flags %#02lx %pF\n",
616 (unsigned long long)base
,
617 (unsigned long long)base
+ size
- 1,
618 flags
, (void *)_RET_IP_
);
620 return memblock_add_range(&memblock
.memory
, base
, size
, nid
, flags
);
623 int __init_memblock
memblock_add(phys_addr_t base
, phys_addr_t size
)
625 return memblock_add_region(base
, size
, MAX_NUMNODES
, 0);
629 * memblock_isolate_range - isolate given range into disjoint memblocks
630 * @type: memblock type to isolate range for
631 * @base: base of range to isolate
632 * @size: size of range to isolate
633 * @start_rgn: out parameter for the start of isolated region
634 * @end_rgn: out parameter for the end of isolated region
636 * Walk @type and ensure that regions don't cross the boundaries defined by
637 * [@base,@base+@size). Crossing regions are split at the boundaries,
638 * which may create at most two more regions. The index of the first
639 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
642 * 0 on success, -errno on failure.
644 static int __init_memblock
memblock_isolate_range(struct memblock_type
*type
,
645 phys_addr_t base
, phys_addr_t size
,
646 int *start_rgn
, int *end_rgn
)
648 phys_addr_t end
= base
+ memblock_cap_size(base
, &size
);
650 struct memblock_region
*rgn
;
652 *start_rgn
= *end_rgn
= 0;
657 /* we'll create at most two more regions */
658 while (type
->cnt
+ 2 > type
->max
)
659 if (memblock_double_array(type
, base
, size
) < 0)
662 for_each_memblock_type(type
, rgn
) {
663 phys_addr_t rbase
= rgn
->base
;
664 phys_addr_t rend
= rbase
+ rgn
->size
;
673 * @rgn intersects from below. Split and continue
674 * to process the next region - the new top half.
677 rgn
->size
-= base
- rbase
;
678 type
->total_size
-= base
- rbase
;
679 memblock_insert_region(type
, idx
, rbase
, base
- rbase
,
680 memblock_get_region_node(rgn
),
682 } else if (rend
> end
) {
684 * @rgn intersects from above. Split and redo the
685 * current region - the new bottom half.
688 rgn
->size
-= end
- rbase
;
689 type
->total_size
-= end
- rbase
;
690 memblock_insert_region(type
, idx
--, rbase
, end
- rbase
,
691 memblock_get_region_node(rgn
),
694 /* @rgn is fully contained, record it */
704 static int __init_memblock
memblock_remove_range(struct memblock_type
*type
,
705 phys_addr_t base
, phys_addr_t size
)
707 int start_rgn
, end_rgn
;
710 ret
= memblock_isolate_range(type
, base
, size
, &start_rgn
, &end_rgn
);
714 for (i
= end_rgn
- 1; i
>= start_rgn
; i
--)
715 memblock_remove_region(type
, i
);
719 int __init_memblock
memblock_remove(phys_addr_t base
, phys_addr_t size
)
721 return memblock_remove_range(&memblock
.memory
, base
, size
);
725 int __init_memblock
memblock_free(phys_addr_t base
, phys_addr_t size
)
727 memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n",
728 (unsigned long long)base
,
729 (unsigned long long)base
+ size
- 1,
732 kmemleak_free_part(__va(base
), size
);
733 return memblock_remove_range(&memblock
.reserved
, base
, size
);
736 static int __init_memblock
memblock_reserve_region(phys_addr_t base
,
741 memblock_dbg("memblock_reserve: [%#016llx-%#016llx] flags %#02lx %pF\n",
742 (unsigned long long)base
,
743 (unsigned long long)base
+ size
- 1,
744 flags
, (void *)_RET_IP_
);
746 return memblock_add_range(&memblock
.reserved
, base
, size
, nid
, flags
);
749 int __init_memblock
memblock_reserve(phys_addr_t base
, phys_addr_t size
)
751 return memblock_reserve_region(base
, size
, MAX_NUMNODES
, 0);
756 * This function isolates region [@base, @base + @size), and sets/clears flag
758 * Return 0 on success, -errno on failure.
760 static int __init_memblock
memblock_setclr_flag(phys_addr_t base
,
761 phys_addr_t size
, int set
, int flag
)
763 struct memblock_type
*type
= &memblock
.memory
;
764 int i
, ret
, start_rgn
, end_rgn
;
766 ret
= memblock_isolate_range(type
, base
, size
, &start_rgn
, &end_rgn
);
770 for (i
= start_rgn
; i
< end_rgn
; i
++)
772 memblock_set_region_flags(&type
->regions
[i
], flag
);
774 memblock_clear_region_flags(&type
->regions
[i
], flag
);
776 memblock_merge_regions(type
);
781 * memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG.
782 * @base: the base phys addr of the region
783 * @size: the size of the region
785 * Return 0 on success, -errno on failure.
787 int __init_memblock
memblock_mark_hotplug(phys_addr_t base
, phys_addr_t size
)
789 return memblock_setclr_flag(base
, size
, 1, MEMBLOCK_HOTPLUG
);
793 * memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region.
794 * @base: the base phys addr of the region
795 * @size: the size of the region
797 * Return 0 on success, -errno on failure.
799 int __init_memblock
memblock_clear_hotplug(phys_addr_t base
, phys_addr_t size
)
801 return memblock_setclr_flag(base
, size
, 0, MEMBLOCK_HOTPLUG
);
805 * memblock_mark_mirror - Mark mirrored memory with flag MEMBLOCK_MIRROR.
806 * @base: the base phys addr of the region
807 * @size: the size of the region
809 * Return 0 on success, -errno on failure.
811 int __init_memblock
memblock_mark_mirror(phys_addr_t base
, phys_addr_t size
)
813 system_has_some_mirror
= true;
815 return memblock_setclr_flag(base
, size
, 1, MEMBLOCK_MIRROR
);
819 * memblock_mark_nomap - Mark a memory region with flag MEMBLOCK_NOMAP.
820 * @base: the base phys addr of the region
821 * @size: the size of the region
823 * Return 0 on success, -errno on failure.
825 int __init_memblock
memblock_mark_nomap(phys_addr_t base
, phys_addr_t size
)
827 return memblock_setclr_flag(base
, size
, 1, MEMBLOCK_NOMAP
);
831 * __next_reserved_mem_region - next function for for_each_reserved_region()
832 * @idx: pointer to u64 loop variable
833 * @out_start: ptr to phys_addr_t for start address of the region, can be %NULL
834 * @out_end: ptr to phys_addr_t for end address of the region, can be %NULL
836 * Iterate over all reserved memory regions.
838 void __init_memblock
__next_reserved_mem_region(u64
*idx
,
839 phys_addr_t
*out_start
,
840 phys_addr_t
*out_end
)
842 struct memblock_type
*type
= &memblock
.reserved
;
844 if (*idx
>= 0 && *idx
< type
->cnt
) {
845 struct memblock_region
*r
= &type
->regions
[*idx
];
846 phys_addr_t base
= r
->base
;
847 phys_addr_t size
= r
->size
;
852 *out_end
= base
+ size
- 1;
858 /* signal end of iteration */
863 * __next__mem_range - next function for for_each_free_mem_range() etc.
864 * @idx: pointer to u64 loop variable
865 * @nid: node selector, %NUMA_NO_NODE for all nodes
866 * @flags: pick from blocks based on memory attributes
867 * @type_a: pointer to memblock_type from where the range is taken
868 * @type_b: pointer to memblock_type which excludes memory from being taken
869 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
870 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
871 * @out_nid: ptr to int for nid of the range, can be %NULL
873 * Find the first area from *@idx which matches @nid, fill the out
874 * parameters, and update *@idx for the next iteration. The lower 32bit of
875 * *@idx contains index into type_a and the upper 32bit indexes the
876 * areas before each region in type_b. For example, if type_b regions
877 * look like the following,
879 * 0:[0-16), 1:[32-48), 2:[128-130)
881 * The upper 32bit indexes the following regions.
883 * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX)
885 * As both region arrays are sorted, the function advances the two indices
886 * in lockstep and returns each intersection.
888 void __init_memblock
__next_mem_range(u64
*idx
, int nid
, ulong flags
,
889 struct memblock_type
*type_a
,
890 struct memblock_type
*type_b
,
891 phys_addr_t
*out_start
,
892 phys_addr_t
*out_end
, int *out_nid
)
894 int idx_a
= *idx
& 0xffffffff;
895 int idx_b
= *idx
>> 32;
897 if (WARN_ONCE(nid
== MAX_NUMNODES
,
898 "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
901 for (; idx_a
< type_a
->cnt
; idx_a
++) {
902 struct memblock_region
*m
= &type_a
->regions
[idx_a
];
904 phys_addr_t m_start
= m
->base
;
905 phys_addr_t m_end
= m
->base
+ m
->size
;
906 int m_nid
= memblock_get_region_node(m
);
908 /* only memory regions are associated with nodes, check it */
909 if (nid
!= NUMA_NO_NODE
&& nid
!= m_nid
)
912 /* skip hotpluggable memory regions if needed */
913 if (movable_node_is_enabled() && memblock_is_hotpluggable(m
))
916 /* if we want mirror memory skip non-mirror memory regions */
917 if ((flags
& MEMBLOCK_MIRROR
) && !memblock_is_mirror(m
))
920 /* skip nomap memory unless we were asked for it explicitly */
921 if (!(flags
& MEMBLOCK_NOMAP
) && memblock_is_nomap(m
))
926 *out_start
= m_start
;
932 *idx
= (u32
)idx_a
| (u64
)idx_b
<< 32;
936 /* scan areas before each reservation */
937 for (; idx_b
< type_b
->cnt
+ 1; idx_b
++) {
938 struct memblock_region
*r
;
942 r
= &type_b
->regions
[idx_b
];
943 r_start
= idx_b
? r
[-1].base
+ r
[-1].size
: 0;
944 r_end
= idx_b
< type_b
->cnt
?
945 r
->base
: ULLONG_MAX
;
948 * if idx_b advanced past idx_a,
949 * break out to advance idx_a
951 if (r_start
>= m_end
)
953 /* if the two regions intersect, we're done */
954 if (m_start
< r_end
) {
957 max(m_start
, r_start
);
959 *out_end
= min(m_end
, r_end
);
963 * The region which ends first is
964 * advanced for the next iteration.
970 *idx
= (u32
)idx_a
| (u64
)idx_b
<< 32;
976 /* signal end of iteration */
981 * __next_mem_range_rev - generic next function for for_each_*_range_rev()
983 * Finds the next range from type_a which is not marked as unsuitable
986 * @idx: pointer to u64 loop variable
987 * @nid: node selector, %NUMA_NO_NODE for all nodes
988 * @flags: pick from blocks based on memory attributes
989 * @type_a: pointer to memblock_type from where the range is taken
990 * @type_b: pointer to memblock_type which excludes memory from being taken
991 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
992 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
993 * @out_nid: ptr to int for nid of the range, can be %NULL
995 * Reverse of __next_mem_range().
997 void __init_memblock
__next_mem_range_rev(u64
*idx
, int nid
, ulong flags
,
998 struct memblock_type
*type_a
,
999 struct memblock_type
*type_b
,
1000 phys_addr_t
*out_start
,
1001 phys_addr_t
*out_end
, int *out_nid
)
1003 int idx_a
= *idx
& 0xffffffff;
1004 int idx_b
= *idx
>> 32;
1006 if (WARN_ONCE(nid
== MAX_NUMNODES
, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
1009 if (*idx
== (u64
)ULLONG_MAX
) {
1010 idx_a
= type_a
->cnt
- 1;
1011 idx_b
= type_b
->cnt
;
1014 for (; idx_a
>= 0; idx_a
--) {
1015 struct memblock_region
*m
= &type_a
->regions
[idx_a
];
1017 phys_addr_t m_start
= m
->base
;
1018 phys_addr_t m_end
= m
->base
+ m
->size
;
1019 int m_nid
= memblock_get_region_node(m
);
1021 /* only memory regions are associated with nodes, check it */
1022 if (nid
!= NUMA_NO_NODE
&& nid
!= m_nid
)
1025 /* skip hotpluggable memory regions if needed */
1026 if (movable_node_is_enabled() && memblock_is_hotpluggable(m
))
1029 /* if we want mirror memory skip non-mirror memory regions */
1030 if ((flags
& MEMBLOCK_MIRROR
) && !memblock_is_mirror(m
))
1033 /* skip nomap memory unless we were asked for it explicitly */
1034 if (!(flags
& MEMBLOCK_NOMAP
) && memblock_is_nomap(m
))
1039 *out_start
= m_start
;
1045 *idx
= (u32
)idx_a
| (u64
)idx_b
<< 32;
1049 /* scan areas before each reservation */
1050 for (; idx_b
>= 0; idx_b
--) {
1051 struct memblock_region
*r
;
1052 phys_addr_t r_start
;
1055 r
= &type_b
->regions
[idx_b
];
1056 r_start
= idx_b
? r
[-1].base
+ r
[-1].size
: 0;
1057 r_end
= idx_b
< type_b
->cnt
?
1058 r
->base
: ULLONG_MAX
;
1060 * if idx_b advanced past idx_a,
1061 * break out to advance idx_a
1064 if (r_end
<= m_start
)
1066 /* if the two regions intersect, we're done */
1067 if (m_end
> r_start
) {
1069 *out_start
= max(m_start
, r_start
);
1071 *out_end
= min(m_end
, r_end
);
1074 if (m_start
>= r_start
)
1078 *idx
= (u32
)idx_a
| (u64
)idx_b
<< 32;
1083 /* signal end of iteration */
1087 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1089 * Common iterator interface used to define for_each_mem_range().
1091 void __init_memblock
__next_mem_pfn_range(int *idx
, int nid
,
1092 unsigned long *out_start_pfn
,
1093 unsigned long *out_end_pfn
, int *out_nid
)
1095 struct memblock_type
*type
= &memblock
.memory
;
1096 struct memblock_region
*r
;
1098 while (++*idx
< type
->cnt
) {
1099 r
= &type
->regions
[*idx
];
1101 if (PFN_UP(r
->base
) >= PFN_DOWN(r
->base
+ r
->size
))
1103 if (nid
== MAX_NUMNODES
|| nid
== r
->nid
)
1106 if (*idx
>= type
->cnt
) {
1112 *out_start_pfn
= PFN_UP(r
->base
);
1114 *out_end_pfn
= PFN_DOWN(r
->base
+ r
->size
);
1120 * memblock_set_node - set node ID on memblock regions
1121 * @base: base of area to set node ID for
1122 * @size: size of area to set node ID for
1123 * @type: memblock type to set node ID for
1124 * @nid: node ID to set
1126 * Set the nid of memblock @type regions in [@base,@base+@size) to @nid.
1127 * Regions which cross the area boundaries are split as necessary.
1130 * 0 on success, -errno on failure.
1132 int __init_memblock
memblock_set_node(phys_addr_t base
, phys_addr_t size
,
1133 struct memblock_type
*type
, int nid
)
1135 int start_rgn
, end_rgn
;
1138 ret
= memblock_isolate_range(type
, base
, size
, &start_rgn
, &end_rgn
);
1142 for (i
= start_rgn
; i
< end_rgn
; i
++)
1143 memblock_set_region_node(&type
->regions
[i
], nid
);
1145 memblock_merge_regions(type
);
1148 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
1150 static phys_addr_t __init
memblock_alloc_range_nid(phys_addr_t size
,
1151 phys_addr_t align
, phys_addr_t start
,
1152 phys_addr_t end
, int nid
, ulong flags
)
1157 align
= SMP_CACHE_BYTES
;
1159 found
= memblock_find_in_range_node(size
, align
, start
, end
, nid
,
1161 if (found
&& !memblock_reserve(found
, size
)) {
1163 * The min_count is set to 0 so that memblock allocations are
1164 * never reported as leaks.
1166 kmemleak_alloc(__va(found
), size
, 0, 0);
1172 phys_addr_t __init
memblock_alloc_range(phys_addr_t size
, phys_addr_t align
,
1173 phys_addr_t start
, phys_addr_t end
,
1176 return memblock_alloc_range_nid(size
, align
, start
, end
, NUMA_NO_NODE
,
1180 static phys_addr_t __init
memblock_alloc_base_nid(phys_addr_t size
,
1181 phys_addr_t align
, phys_addr_t max_addr
,
1182 int nid
, ulong flags
)
1184 return memblock_alloc_range_nid(size
, align
, 0, max_addr
, nid
, flags
);
1187 phys_addr_t __init
memblock_alloc_nid(phys_addr_t size
, phys_addr_t align
, int nid
)
1189 ulong flags
= choose_memblock_flags();
1193 ret
= memblock_alloc_base_nid(size
, align
, MEMBLOCK_ALLOC_ACCESSIBLE
,
1196 if (!ret
&& (flags
& MEMBLOCK_MIRROR
)) {
1197 flags
&= ~MEMBLOCK_MIRROR
;
1203 phys_addr_t __init
__memblock_alloc_base(phys_addr_t size
, phys_addr_t align
, phys_addr_t max_addr
)
1205 return memblock_alloc_base_nid(size
, align
, max_addr
, NUMA_NO_NODE
,
1209 phys_addr_t __init
memblock_alloc_base(phys_addr_t size
, phys_addr_t align
, phys_addr_t max_addr
)
1213 alloc
= __memblock_alloc_base(size
, align
, max_addr
);
1216 panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n",
1217 (unsigned long long) size
, (unsigned long long) max_addr
);
1222 phys_addr_t __init
memblock_alloc(phys_addr_t size
, phys_addr_t align
)
1224 return memblock_alloc_base(size
, align
, MEMBLOCK_ALLOC_ACCESSIBLE
);
1227 phys_addr_t __init
memblock_alloc_try_nid(phys_addr_t size
, phys_addr_t align
, int nid
)
1229 phys_addr_t res
= memblock_alloc_nid(size
, align
, nid
);
1233 return memblock_alloc_base(size
, align
, MEMBLOCK_ALLOC_ACCESSIBLE
);
1237 * memblock_virt_alloc_internal - allocate boot memory block
1238 * @size: size of memory block to be allocated in bytes
1239 * @align: alignment of the region and block's size
1240 * @min_addr: the lower bound of the memory region to allocate (phys address)
1241 * @max_addr: the upper bound of the memory region to allocate (phys address)
1242 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1244 * The @min_addr limit is dropped if it can not be satisfied and the allocation
1245 * will fall back to memory below @min_addr. Also, allocation may fall back
1246 * to any node in the system if the specified node can not
1247 * hold the requested memory.
1249 * The allocation is performed from memory region limited by
1250 * memblock.current_limit if @max_addr == %BOOTMEM_ALLOC_ACCESSIBLE.
1252 * The memory block is aligned on SMP_CACHE_BYTES if @align == 0.
1254 * The phys address of allocated boot memory block is converted to virtual and
1255 * allocated memory is reset to 0.
1257 * In addition, function sets the min_count to 0 using kmemleak_alloc for
1258 * allocated boot memory block, so that it is never reported as leaks.
1261 * Virtual address of allocated memory block on success, NULL on failure.
1263 static void * __init
memblock_virt_alloc_internal(
1264 phys_addr_t size
, phys_addr_t align
,
1265 phys_addr_t min_addr
, phys_addr_t max_addr
,
1270 ulong flags
= choose_memblock_flags();
1272 if (WARN_ONCE(nid
== MAX_NUMNODES
, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
1276 * Detect any accidental use of these APIs after slab is ready, as at
1277 * this moment memblock may be deinitialized already and its
1278 * internal data may be destroyed (after execution of free_all_bootmem)
1280 if (WARN_ON_ONCE(slab_is_available()))
1281 return kzalloc_node(size
, GFP_NOWAIT
, nid
);
1284 align
= SMP_CACHE_BYTES
;
1286 if (max_addr
> memblock
.current_limit
)
1287 max_addr
= memblock
.current_limit
;
1290 alloc
= memblock_find_in_range_node(size
, align
, min_addr
, max_addr
,
1295 if (nid
!= NUMA_NO_NODE
) {
1296 alloc
= memblock_find_in_range_node(size
, align
, min_addr
,
1297 max_addr
, NUMA_NO_NODE
,
1308 if (flags
& MEMBLOCK_MIRROR
) {
1309 flags
&= ~MEMBLOCK_MIRROR
;
1310 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
1317 memblock_reserve(alloc
, size
);
1318 ptr
= phys_to_virt(alloc
);
1319 memset(ptr
, 0, size
);
1322 * The min_count is set to 0 so that bootmem allocated blocks
1323 * are never reported as leaks. This is because many of these blocks
1324 * are only referred via the physical address which is not
1325 * looked up by kmemleak.
1327 kmemleak_alloc(ptr
, size
, 0, 0);
1333 * memblock_virt_alloc_try_nid_nopanic - allocate boot memory block
1334 * @size: size of memory block to be allocated in bytes
1335 * @align: alignment of the region and block's size
1336 * @min_addr: the lower bound of the memory region from where the allocation
1337 * is preferred (phys address)
1338 * @max_addr: the upper bound of the memory region from where the allocation
1339 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1340 * allocate only from memory limited by memblock.current_limit value
1341 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1343 * Public version of _memblock_virt_alloc_try_nid_nopanic() which provides
1344 * additional debug information (including caller info), if enabled.
1347 * Virtual address of allocated memory block on success, NULL on failure.
1349 void * __init
memblock_virt_alloc_try_nid_nopanic(
1350 phys_addr_t size
, phys_addr_t align
,
1351 phys_addr_t min_addr
, phys_addr_t max_addr
,
1354 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1355 __func__
, (u64
)size
, (u64
)align
, nid
, (u64
)min_addr
,
1356 (u64
)max_addr
, (void *)_RET_IP_
);
1357 return memblock_virt_alloc_internal(size
, align
, min_addr
,
1362 * memblock_virt_alloc_try_nid - allocate boot memory block with panicking
1363 * @size: size of memory block to be allocated in bytes
1364 * @align: alignment of the region and block's size
1365 * @min_addr: the lower bound of the memory region from where the allocation
1366 * is preferred (phys address)
1367 * @max_addr: the upper bound of the memory region from where the allocation
1368 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1369 * allocate only from memory limited by memblock.current_limit value
1370 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1372 * Public panicking version of _memblock_virt_alloc_try_nid_nopanic()
1373 * which provides debug information (including caller info), if enabled,
1374 * and panics if the request can not be satisfied.
1377 * Virtual address of allocated memory block on success, NULL on failure.
1379 void * __init
memblock_virt_alloc_try_nid(
1380 phys_addr_t size
, phys_addr_t align
,
1381 phys_addr_t min_addr
, phys_addr_t max_addr
,
1386 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1387 __func__
, (u64
)size
, (u64
)align
, nid
, (u64
)min_addr
,
1388 (u64
)max_addr
, (void *)_RET_IP_
);
1389 ptr
= memblock_virt_alloc_internal(size
, align
,
1390 min_addr
, max_addr
, nid
);
1394 panic("%s: Failed to allocate %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx\n",
1395 __func__
, (u64
)size
, (u64
)align
, nid
, (u64
)min_addr
,
1401 * __memblock_free_early - free boot memory block
1402 * @base: phys starting address of the boot memory block
1403 * @size: size of the boot memory block in bytes
1405 * Free boot memory block previously allocated by memblock_virt_alloc_xx() API.
1406 * The freeing memory will not be released to the buddy allocator.
1408 void __init
__memblock_free_early(phys_addr_t base
, phys_addr_t size
)
1410 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1411 __func__
, (u64
)base
, (u64
)base
+ size
- 1,
1413 kmemleak_free_part(__va(base
), size
);
1414 memblock_remove_range(&memblock
.reserved
, base
, size
);
1418 * __memblock_free_late - free bootmem block pages directly to buddy allocator
1419 * @addr: phys starting address of the boot memory block
1420 * @size: size of the boot memory block in bytes
1422 * This is only useful when the bootmem allocator has already been torn
1423 * down, but we are still initializing the system. Pages are released directly
1424 * to the buddy allocator, no bootmem metadata is updated because it is gone.
1426 void __init
__memblock_free_late(phys_addr_t base
, phys_addr_t size
)
1430 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1431 __func__
, (u64
)base
, (u64
)base
+ size
- 1,
1433 kmemleak_free_part(__va(base
), size
);
1434 cursor
= PFN_UP(base
);
1435 end
= PFN_DOWN(base
+ size
);
1437 for (; cursor
< end
; cursor
++) {
1438 __free_pages_bootmem(pfn_to_page(cursor
), cursor
, 0);
1444 * Remaining API functions
1447 phys_addr_t __init_memblock
memblock_phys_mem_size(void)
1449 return memblock
.memory
.total_size
;
1452 phys_addr_t __init
memblock_mem_size(unsigned long limit_pfn
)
1454 unsigned long pages
= 0;
1455 struct memblock_region
*r
;
1456 unsigned long start_pfn
, end_pfn
;
1458 for_each_memblock(memory
, r
) {
1459 start_pfn
= memblock_region_memory_base_pfn(r
);
1460 end_pfn
= memblock_region_memory_end_pfn(r
);
1461 start_pfn
= min_t(unsigned long, start_pfn
, limit_pfn
);
1462 end_pfn
= min_t(unsigned long, end_pfn
, limit_pfn
);
1463 pages
+= end_pfn
- start_pfn
;
1466 return PFN_PHYS(pages
);
1469 /* lowest address */
1470 phys_addr_t __init_memblock
memblock_start_of_DRAM(void)
1472 return memblock
.memory
.regions
[0].base
;
1475 phys_addr_t __init_memblock
memblock_end_of_DRAM(void)
1477 int idx
= memblock
.memory
.cnt
- 1;
1479 return (memblock
.memory
.regions
[idx
].base
+ memblock
.memory
.regions
[idx
].size
);
1482 void __init
memblock_enforce_memory_limit(phys_addr_t limit
)
1484 phys_addr_t max_addr
= (phys_addr_t
)ULLONG_MAX
;
1485 struct memblock_region
*r
;
1490 /* find out max address */
1491 for_each_memblock(memory
, r
) {
1492 if (limit
<= r
->size
) {
1493 max_addr
= r
->base
+ limit
;
1499 /* truncate both memory and reserved regions */
1500 memblock_remove_range(&memblock
.memory
, max_addr
,
1501 (phys_addr_t
)ULLONG_MAX
);
1502 memblock_remove_range(&memblock
.reserved
, max_addr
,
1503 (phys_addr_t
)ULLONG_MAX
);
1506 static int __init_memblock
memblock_search(struct memblock_type
*type
, phys_addr_t addr
)
1508 unsigned int left
= 0, right
= type
->cnt
;
1511 unsigned int mid
= (right
+ left
) / 2;
1513 if (addr
< type
->regions
[mid
].base
)
1515 else if (addr
>= (type
->regions
[mid
].base
+
1516 type
->regions
[mid
].size
))
1520 } while (left
< right
);
1524 bool __init
memblock_is_reserved(phys_addr_t addr
)
1526 return memblock_search(&memblock
.reserved
, addr
) != -1;
1529 bool __init_memblock
memblock_is_memory(phys_addr_t addr
)
1531 return memblock_search(&memblock
.memory
, addr
) != -1;
1534 int __init_memblock
memblock_is_map_memory(phys_addr_t addr
)
1536 int i
= memblock_search(&memblock
.memory
, addr
);
1540 return !memblock_is_nomap(&memblock
.memory
.regions
[i
]);
1543 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1544 int __init_memblock
memblock_search_pfn_nid(unsigned long pfn
,
1545 unsigned long *start_pfn
, unsigned long *end_pfn
)
1547 struct memblock_type
*type
= &memblock
.memory
;
1548 int mid
= memblock_search(type
, PFN_PHYS(pfn
));
1553 *start_pfn
= PFN_DOWN(type
->regions
[mid
].base
);
1554 *end_pfn
= PFN_DOWN(type
->regions
[mid
].base
+ type
->regions
[mid
].size
);
1556 return type
->regions
[mid
].nid
;
1561 * memblock_is_region_memory - check if a region is a subset of memory
1562 * @base: base of region to check
1563 * @size: size of region to check
1565 * Check if the region [@base, @base+@size) is a subset of a memory block.
1568 * 0 if false, non-zero if true
1570 int __init_memblock
memblock_is_region_memory(phys_addr_t base
, phys_addr_t size
)
1572 int idx
= memblock_search(&memblock
.memory
, base
);
1573 phys_addr_t end
= base
+ memblock_cap_size(base
, &size
);
1577 return memblock
.memory
.regions
[idx
].base
<= base
&&
1578 (memblock
.memory
.regions
[idx
].base
+
1579 memblock
.memory
.regions
[idx
].size
) >= end
;
1583 * memblock_is_region_reserved - check if a region intersects reserved memory
1584 * @base: base of region to check
1585 * @size: size of region to check
1587 * Check if the region [@base, @base+@size) intersects a reserved memory block.
1590 * True if they intersect, false if not.
1592 bool __init_memblock
memblock_is_region_reserved(phys_addr_t base
, phys_addr_t size
)
1594 memblock_cap_size(base
, &size
);
1595 return memblock_overlaps_region(&memblock
.reserved
, base
, size
);
1598 void __init_memblock
memblock_trim_memory(phys_addr_t align
)
1600 phys_addr_t start
, end
, orig_start
, orig_end
;
1601 struct memblock_region
*r
;
1603 for_each_memblock(memory
, r
) {
1604 orig_start
= r
->base
;
1605 orig_end
= r
->base
+ r
->size
;
1606 start
= round_up(orig_start
, align
);
1607 end
= round_down(orig_end
, align
);
1609 if (start
== orig_start
&& end
== orig_end
)
1614 r
->size
= end
- start
;
1616 memblock_remove_region(&memblock
.memory
,
1617 r
- memblock
.memory
.regions
);
1623 void __init_memblock
memblock_set_current_limit(phys_addr_t limit
)
1625 memblock
.current_limit
= limit
;
1628 phys_addr_t __init_memblock
memblock_get_current_limit(void)
1630 return memblock
.current_limit
;
1633 static void __init_memblock
memblock_dump(struct memblock_type
*type
, char *name
)
1635 unsigned long long base
, size
;
1636 unsigned long flags
;
1638 struct memblock_region
*rgn
;
1640 pr_info(" %s.cnt = 0x%lx\n", name
, type
->cnt
);
1642 for_each_memblock_type(type
, rgn
) {
1643 char nid_buf
[32] = "";
1648 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1649 if (memblock_get_region_node(rgn
) != MAX_NUMNODES
)
1650 snprintf(nid_buf
, sizeof(nid_buf
), " on node %d",
1651 memblock_get_region_node(rgn
));
1653 pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s flags: %#lx\n",
1654 name
, idx
, base
, base
+ size
- 1, size
, nid_buf
, flags
);
1658 void __init_memblock
__memblock_dump_all(void)
1660 pr_info("MEMBLOCK configuration:\n");
1661 pr_info(" memory size = %#llx reserved size = %#llx\n",
1662 (unsigned long long)memblock
.memory
.total_size
,
1663 (unsigned long long)memblock
.reserved
.total_size
);
1665 memblock_dump(&memblock
.memory
, "memory");
1666 memblock_dump(&memblock
.reserved
, "reserved");
1669 void __init
memblock_allow_resize(void)
1671 memblock_can_resize
= 1;
1674 static int __init
early_memblock(char *p
)
1676 if (p
&& strstr(p
, "debug"))
1680 early_param("memblock", early_memblock
);
1682 #if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
1684 static int memblock_debug_show(struct seq_file
*m
, void *private)
1686 struct memblock_type
*type
= m
->private;
1687 struct memblock_region
*reg
;
1690 for (i
= 0; i
< type
->cnt
; i
++) {
1691 reg
= &type
->regions
[i
];
1692 seq_printf(m
, "%4d: ", i
);
1693 if (sizeof(phys_addr_t
) == 4)
1694 seq_printf(m
, "0x%08lx..0x%08lx\n",
1695 (unsigned long)reg
->base
,
1696 (unsigned long)(reg
->base
+ reg
->size
- 1));
1698 seq_printf(m
, "0x%016llx..0x%016llx\n",
1699 (unsigned long long)reg
->base
,
1700 (unsigned long long)(reg
->base
+ reg
->size
- 1));
1706 static int memblock_debug_open(struct inode
*inode
, struct file
*file
)
1708 return single_open(file
, memblock_debug_show
, inode
->i_private
);
1711 static const struct file_operations memblock_debug_fops
= {
1712 .open
= memblock_debug_open
,
1714 .llseek
= seq_lseek
,
1715 .release
= single_release
,
1718 static int __init
memblock_init_debugfs(void)
1720 struct dentry
*root
= debugfs_create_dir("memblock", NULL
);
1723 debugfs_create_file("memory", S_IRUGO
, root
, &memblock
.memory
, &memblock_debug_fops
);
1724 debugfs_create_file("reserved", S_IRUGO
, root
, &memblock
.reserved
, &memblock_debug_fops
);
1725 #ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
1726 debugfs_create_file("physmem", S_IRUGO
, root
, &memblock
.physmem
, &memblock_debug_fops
);
1731 __initcall(memblock_init_debugfs
);
1733 #endif /* CONFIG_DEBUG_FS */