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 phys_addr_t rgnbase
= type
->regions
[i
].base
;
101 phys_addr_t rgnsize
= type
->regions
[i
].size
;
102 if (memblock_addrs_overlap(base
, size
, rgnbase
, rgnsize
))
106 return i
< type
->cnt
;
110 * __memblock_find_range_bottom_up - find free area utility in bottom-up
111 * @start: start of candidate range
112 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
113 * @size: size of free area to find
114 * @align: alignment of free area to find
115 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
116 * @flags: pick from blocks based on memory attributes
118 * Utility called from memblock_find_in_range_node(), find free area bottom-up.
121 * Found address on success, 0 on failure.
123 static phys_addr_t __init_memblock
124 __memblock_find_range_bottom_up(phys_addr_t start
, phys_addr_t end
,
125 phys_addr_t size
, phys_addr_t align
, int nid
,
128 phys_addr_t this_start
, this_end
, cand
;
131 for_each_free_mem_range(i
, nid
, flags
, &this_start
, &this_end
, NULL
) {
132 this_start
= clamp(this_start
, start
, end
);
133 this_end
= clamp(this_end
, start
, end
);
135 cand
= round_up(this_start
, align
);
136 if (cand
< this_end
&& this_end
- cand
>= size
)
144 * __memblock_find_range_top_down - find free area utility, in top-down
145 * @start: start of candidate range
146 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
147 * @size: size of free area to find
148 * @align: alignment of free area to find
149 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
150 * @flags: pick from blocks based on memory attributes
152 * Utility called from memblock_find_in_range_node(), find free area top-down.
155 * Found address on success, 0 on failure.
157 static phys_addr_t __init_memblock
158 __memblock_find_range_top_down(phys_addr_t start
, phys_addr_t end
,
159 phys_addr_t size
, phys_addr_t align
, int nid
,
162 phys_addr_t this_start
, this_end
, cand
;
165 for_each_free_mem_range_reverse(i
, nid
, flags
, &this_start
, &this_end
,
167 this_start
= clamp(this_start
, start
, end
);
168 this_end
= clamp(this_end
, start
, end
);
173 cand
= round_down(this_end
- size
, align
);
174 if (cand
>= this_start
)
182 * memblock_find_in_range_node - find free area in given range and node
183 * @size: size of free area to find
184 * @align: alignment of free area to find
185 * @start: start of candidate range
186 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
187 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
188 * @flags: pick from blocks based on memory attributes
190 * Find @size free area aligned to @align in the specified range and node.
192 * When allocation direction is bottom-up, the @start should be greater
193 * than the end of the kernel image. Otherwise, it will be trimmed. The
194 * reason is that we want the bottom-up allocation just near the kernel
195 * image so it is highly likely that the allocated memory and the kernel
196 * will reside in the same node.
198 * If bottom-up allocation failed, will try to allocate memory top-down.
201 * Found address on success, 0 on failure.
203 phys_addr_t __init_memblock
memblock_find_in_range_node(phys_addr_t size
,
204 phys_addr_t align
, phys_addr_t start
,
205 phys_addr_t end
, int nid
, ulong flags
)
207 phys_addr_t kernel_end
, ret
;
210 if (end
== MEMBLOCK_ALLOC_ACCESSIBLE
)
211 end
= memblock
.current_limit
;
213 /* avoid allocating the first page */
214 start
= max_t(phys_addr_t
, start
, PAGE_SIZE
);
215 end
= max(start
, end
);
216 kernel_end
= __pa_symbol(_end
);
219 * try bottom-up allocation only when bottom-up mode
220 * is set and @end is above the kernel image.
222 if (memblock_bottom_up() && end
> kernel_end
) {
223 phys_addr_t bottom_up_start
;
225 /* make sure we will allocate above the kernel */
226 bottom_up_start
= max(start
, kernel_end
);
228 /* ok, try bottom-up allocation first */
229 ret
= __memblock_find_range_bottom_up(bottom_up_start
, end
,
230 size
, align
, nid
, flags
);
235 * we always limit bottom-up allocation above the kernel,
236 * but top-down allocation doesn't have the limit, so
237 * retrying top-down allocation may succeed when bottom-up
240 * bottom-up allocation is expected to be fail very rarely,
241 * so we use WARN_ONCE() here to see the stack trace if
244 WARN_ONCE(1, "memblock: bottom-up allocation failed, "
245 "memory hotunplug may be affected\n");
248 return __memblock_find_range_top_down(start
, end
, size
, align
, nid
,
253 * memblock_find_in_range - find free area in given range
254 * @start: start of candidate range
255 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
256 * @size: size of free area to find
257 * @align: alignment of free area to find
259 * Find @size free area aligned to @align in the specified range.
262 * Found address on success, 0 on failure.
264 phys_addr_t __init_memblock
memblock_find_in_range(phys_addr_t start
,
265 phys_addr_t end
, phys_addr_t size
,
269 ulong flags
= choose_memblock_flags();
272 ret
= memblock_find_in_range_node(size
, align
, start
, end
,
273 NUMA_NO_NODE
, flags
);
275 if (!ret
&& (flags
& MEMBLOCK_MIRROR
)) {
276 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
278 flags
&= ~MEMBLOCK_MIRROR
;
285 static void __init_memblock
memblock_remove_region(struct memblock_type
*type
, unsigned long r
)
287 type
->total_size
-= type
->regions
[r
].size
;
288 memmove(&type
->regions
[r
], &type
->regions
[r
+ 1],
289 (type
->cnt
- (r
+ 1)) * sizeof(type
->regions
[r
]));
292 /* Special case for empty arrays */
293 if (type
->cnt
== 0) {
294 WARN_ON(type
->total_size
!= 0);
296 type
->regions
[0].base
= 0;
297 type
->regions
[0].size
= 0;
298 type
->regions
[0].flags
= 0;
299 memblock_set_region_node(&type
->regions
[0], MAX_NUMNODES
);
303 #ifdef CONFIG_ARCH_DISCARD_MEMBLOCK
305 phys_addr_t __init_memblock
get_allocated_memblock_reserved_regions_info(
308 if (memblock
.reserved
.regions
== memblock_reserved_init_regions
)
311 *addr
= __pa(memblock
.reserved
.regions
);
313 return PAGE_ALIGN(sizeof(struct memblock_region
) *
314 memblock
.reserved
.max
);
317 phys_addr_t __init_memblock
get_allocated_memblock_memory_regions_info(
320 if (memblock
.memory
.regions
== memblock_memory_init_regions
)
323 *addr
= __pa(memblock
.memory
.regions
);
325 return PAGE_ALIGN(sizeof(struct memblock_region
) *
326 memblock
.memory
.max
);
332 * memblock_double_array - double the size of the memblock regions array
333 * @type: memblock type of the regions array being doubled
334 * @new_area_start: starting address of memory range to avoid overlap with
335 * @new_area_size: size of memory range to avoid overlap with
337 * Double the size of the @type regions array. If memblock is being used to
338 * allocate memory for a new reserved regions array and there is a previously
339 * allocated memory range [@new_area_start,@new_area_start+@new_area_size]
340 * waiting to be reserved, ensure the memory used by the new array does
344 * 0 on success, -1 on failure.
346 static int __init_memblock
memblock_double_array(struct memblock_type
*type
,
347 phys_addr_t new_area_start
,
348 phys_addr_t new_area_size
)
350 struct memblock_region
*new_array
, *old_array
;
351 phys_addr_t old_alloc_size
, new_alloc_size
;
352 phys_addr_t old_size
, new_size
, addr
;
353 int use_slab
= slab_is_available();
356 /* We don't allow resizing until we know about the reserved regions
357 * of memory that aren't suitable for allocation
359 if (!memblock_can_resize
)
362 /* Calculate new doubled size */
363 old_size
= type
->max
* sizeof(struct memblock_region
);
364 new_size
= old_size
<< 1;
366 * We need to allocated new one align to PAGE_SIZE,
367 * so we can free them completely later.
369 old_alloc_size
= PAGE_ALIGN(old_size
);
370 new_alloc_size
= PAGE_ALIGN(new_size
);
372 /* Retrieve the slab flag */
373 if (type
== &memblock
.memory
)
374 in_slab
= &memblock_memory_in_slab
;
376 in_slab
= &memblock_reserved_in_slab
;
378 /* Try to find some space for it.
380 * WARNING: We assume that either slab_is_available() and we use it or
381 * we use MEMBLOCK for allocations. That means that this is unsafe to
382 * use when bootmem is currently active (unless bootmem itself is
383 * implemented on top of MEMBLOCK which isn't the case yet)
385 * This should however not be an issue for now, as we currently only
386 * call into MEMBLOCK while it's still active, or much later when slab
387 * is active for memory hotplug operations
390 new_array
= kmalloc(new_size
, GFP_KERNEL
);
391 addr
= new_array
? __pa(new_array
) : 0;
393 /* only exclude range when trying to double reserved.regions */
394 if (type
!= &memblock
.reserved
)
395 new_area_start
= new_area_size
= 0;
397 addr
= memblock_find_in_range(new_area_start
+ new_area_size
,
398 memblock
.current_limit
,
399 new_alloc_size
, PAGE_SIZE
);
400 if (!addr
&& new_area_size
)
401 addr
= memblock_find_in_range(0,
402 min(new_area_start
, memblock
.current_limit
),
403 new_alloc_size
, PAGE_SIZE
);
405 new_array
= addr
? __va(addr
) : NULL
;
408 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
409 memblock_type_name(type
), type
->max
, type
->max
* 2);
413 memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]",
414 memblock_type_name(type
), type
->max
* 2, (u64
)addr
,
415 (u64
)addr
+ new_size
- 1);
418 * Found space, we now need to move the array over before we add the
419 * reserved region since it may be our reserved array itself that is
422 memcpy(new_array
, type
->regions
, old_size
);
423 memset(new_array
+ type
->max
, 0, old_size
);
424 old_array
= type
->regions
;
425 type
->regions
= new_array
;
428 /* Free old array. We needn't free it if the array is the static one */
431 else if (old_array
!= memblock_memory_init_regions
&&
432 old_array
!= memblock_reserved_init_regions
)
433 memblock_free(__pa(old_array
), old_alloc_size
);
436 * Reserve the new array if that comes from the memblock. Otherwise, we
440 BUG_ON(memblock_reserve(addr
, new_alloc_size
));
442 /* Update slab flag */
449 * memblock_merge_regions - merge neighboring compatible regions
450 * @type: memblock type to scan
452 * Scan @type and merge neighboring compatible regions.
454 static void __init_memblock
memblock_merge_regions(struct memblock_type
*type
)
458 /* cnt never goes below 1 */
459 while (i
< type
->cnt
- 1) {
460 struct memblock_region
*this = &type
->regions
[i
];
461 struct memblock_region
*next
= &type
->regions
[i
+ 1];
463 if (this->base
+ this->size
!= next
->base
||
464 memblock_get_region_node(this) !=
465 memblock_get_region_node(next
) ||
466 this->flags
!= next
->flags
) {
467 BUG_ON(this->base
+ this->size
> next
->base
);
472 this->size
+= next
->size
;
473 /* move forward from next + 1, index of which is i + 2 */
474 memmove(next
, next
+ 1, (type
->cnt
- (i
+ 2)) * sizeof(*next
));
480 * memblock_insert_region - insert new memblock region
481 * @type: memblock type to insert into
482 * @idx: index for the insertion point
483 * @base: base address of the new region
484 * @size: size of the new region
485 * @nid: node id of the new region
486 * @flags: flags of the new region
488 * Insert new memblock region [@base,@base+@size) into @type at @idx.
489 * @type must already have extra room to accomodate the new region.
491 static void __init_memblock
memblock_insert_region(struct memblock_type
*type
,
492 int idx
, phys_addr_t base
,
494 int nid
, unsigned long flags
)
496 struct memblock_region
*rgn
= &type
->regions
[idx
];
498 BUG_ON(type
->cnt
>= type
->max
);
499 memmove(rgn
+ 1, rgn
, (type
->cnt
- idx
) * sizeof(*rgn
));
503 memblock_set_region_node(rgn
, nid
);
505 type
->total_size
+= size
;
509 * memblock_add_range - add new memblock region
510 * @type: memblock type to add new region into
511 * @base: base address of the new region
512 * @size: size of the new region
513 * @nid: nid of the new region
514 * @flags: flags of the new region
516 * Add new memblock region [@base,@base+@size) into @type. The new region
517 * is allowed to overlap with existing ones - overlaps don't affect already
518 * existing regions. @type is guaranteed to be minimal (all neighbouring
519 * compatible regions are merged) after the addition.
522 * 0 on success, -errno on failure.
524 int __init_memblock
memblock_add_range(struct memblock_type
*type
,
525 phys_addr_t base
, phys_addr_t size
,
526 int nid
, unsigned long flags
)
529 phys_addr_t obase
= base
;
530 phys_addr_t end
= base
+ memblock_cap_size(base
, &size
);
536 /* special case for empty array */
537 if (type
->regions
[0].size
== 0) {
538 WARN_ON(type
->cnt
!= 1 || type
->total_size
);
539 type
->regions
[0].base
= base
;
540 type
->regions
[0].size
= size
;
541 type
->regions
[0].flags
= flags
;
542 memblock_set_region_node(&type
->regions
[0], nid
);
543 type
->total_size
= size
;
548 * The following is executed twice. Once with %false @insert and
549 * then with %true. The first counts the number of regions needed
550 * to accomodate the new area. The second actually inserts them.
555 for (i
= 0; i
< type
->cnt
; i
++) {
556 struct memblock_region
*rgn
= &type
->regions
[i
];
557 phys_addr_t rbase
= rgn
->base
;
558 phys_addr_t rend
= rbase
+ rgn
->size
;
565 * @rgn overlaps. If it separates the lower part of new
566 * area, insert that portion.
569 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
570 WARN_ON(nid
!= memblock_get_region_node(rgn
));
572 WARN_ON(flags
!= rgn
->flags
);
575 memblock_insert_region(type
, i
++, base
,
579 /* area below @rend is dealt with, forget about it */
580 base
= min(rend
, end
);
583 /* insert the remaining portion */
587 memblock_insert_region(type
, i
, base
, end
- base
,
592 * If this was the first round, resize array and repeat for actual
593 * insertions; otherwise, merge and return.
596 while (type
->cnt
+ nr_new
> type
->max
)
597 if (memblock_double_array(type
, obase
, size
) < 0)
602 memblock_merge_regions(type
);
607 int __init_memblock
memblock_add_node(phys_addr_t base
, phys_addr_t size
,
610 return memblock_add_range(&memblock
.memory
, base
, size
, nid
, 0);
613 static int __init_memblock
memblock_add_region(phys_addr_t base
,
618 struct memblock_type
*type
= &memblock
.memory
;
620 memblock_dbg("memblock_add: [%#016llx-%#016llx] flags %#02lx %pF\n",
621 (unsigned long long)base
,
622 (unsigned long long)base
+ size
- 1,
623 flags
, (void *)_RET_IP_
);
625 return memblock_add_range(type
, base
, size
, nid
, flags
);
628 int __init_memblock
memblock_add(phys_addr_t base
, phys_addr_t size
)
630 return memblock_add_region(base
, size
, MAX_NUMNODES
, 0);
634 * memblock_isolate_range - isolate given range into disjoint memblocks
635 * @type: memblock type to isolate range for
636 * @base: base of range to isolate
637 * @size: size of range to isolate
638 * @start_rgn: out parameter for the start of isolated region
639 * @end_rgn: out parameter for the end of isolated region
641 * Walk @type and ensure that regions don't cross the boundaries defined by
642 * [@base,@base+@size). Crossing regions are split at the boundaries,
643 * which may create at most two more regions. The index of the first
644 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
647 * 0 on success, -errno on failure.
649 static int __init_memblock
memblock_isolate_range(struct memblock_type
*type
,
650 phys_addr_t base
, phys_addr_t size
,
651 int *start_rgn
, int *end_rgn
)
653 phys_addr_t end
= base
+ memblock_cap_size(base
, &size
);
656 *start_rgn
= *end_rgn
= 0;
661 /* we'll create at most two more regions */
662 while (type
->cnt
+ 2 > type
->max
)
663 if (memblock_double_array(type
, base
, size
) < 0)
666 for (i
= 0; i
< type
->cnt
; i
++) {
667 struct memblock_region
*rgn
= &type
->regions
[i
];
668 phys_addr_t rbase
= rgn
->base
;
669 phys_addr_t rend
= rbase
+ rgn
->size
;
678 * @rgn intersects from below. Split and continue
679 * to process the next region - the new top half.
682 rgn
->size
-= base
- rbase
;
683 type
->total_size
-= base
- rbase
;
684 memblock_insert_region(type
, i
, rbase
, base
- rbase
,
685 memblock_get_region_node(rgn
),
687 } else if (rend
> end
) {
689 * @rgn intersects from above. Split and redo the
690 * current region - the new bottom half.
693 rgn
->size
-= end
- rbase
;
694 type
->total_size
-= end
- rbase
;
695 memblock_insert_region(type
, i
--, rbase
, end
- rbase
,
696 memblock_get_region_node(rgn
),
699 /* @rgn is fully contained, record it */
709 static int __init_memblock
memblock_remove_range(struct memblock_type
*type
,
710 phys_addr_t base
, phys_addr_t size
)
712 int start_rgn
, end_rgn
;
715 ret
= memblock_isolate_range(type
, base
, size
, &start_rgn
, &end_rgn
);
719 for (i
= end_rgn
- 1; i
>= start_rgn
; i
--)
720 memblock_remove_region(type
, i
);
724 int __init_memblock
memblock_remove(phys_addr_t base
, phys_addr_t size
)
726 return memblock_remove_range(&memblock
.memory
, base
, size
);
730 int __init_memblock
memblock_free(phys_addr_t base
, phys_addr_t size
)
732 memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n",
733 (unsigned long long)base
,
734 (unsigned long long)base
+ size
- 1,
737 kmemleak_free_part(__va(base
), size
);
738 return memblock_remove_range(&memblock
.reserved
, base
, size
);
741 static int __init_memblock
memblock_reserve_region(phys_addr_t base
,
746 struct memblock_type
*type
= &memblock
.reserved
;
748 memblock_dbg("memblock_reserve: [%#016llx-%#016llx] flags %#02lx %pF\n",
749 (unsigned long long)base
,
750 (unsigned long long)base
+ size
- 1,
751 flags
, (void *)_RET_IP_
);
753 return memblock_add_range(type
, base
, size
, nid
, flags
);
756 int __init_memblock
memblock_reserve(phys_addr_t base
, phys_addr_t size
)
758 return memblock_reserve_region(base
, size
, MAX_NUMNODES
, 0);
763 * This function isolates region [@base, @base + @size), and sets/clears flag
765 * Return 0 on success, -errno on failure.
767 static int __init_memblock
memblock_setclr_flag(phys_addr_t base
,
768 phys_addr_t size
, int set
, int flag
)
770 struct memblock_type
*type
= &memblock
.memory
;
771 int i
, ret
, start_rgn
, end_rgn
;
773 ret
= memblock_isolate_range(type
, base
, size
, &start_rgn
, &end_rgn
);
777 for (i
= start_rgn
; i
< end_rgn
; i
++)
779 memblock_set_region_flags(&type
->regions
[i
], flag
);
781 memblock_clear_region_flags(&type
->regions
[i
], flag
);
783 memblock_merge_regions(type
);
788 * memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG.
789 * @base: the base phys addr of the region
790 * @size: the size of the region
792 * Return 0 on success, -errno on failure.
794 int __init_memblock
memblock_mark_hotplug(phys_addr_t base
, phys_addr_t size
)
796 return memblock_setclr_flag(base
, size
, 1, MEMBLOCK_HOTPLUG
);
800 * memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region.
801 * @base: the base phys addr of the region
802 * @size: the size of the region
804 * Return 0 on success, -errno on failure.
806 int __init_memblock
memblock_clear_hotplug(phys_addr_t base
, phys_addr_t size
)
808 return memblock_setclr_flag(base
, size
, 0, MEMBLOCK_HOTPLUG
);
812 * memblock_mark_mirror - Mark mirrored memory with flag MEMBLOCK_MIRROR.
813 * @base: the base phys addr of the region
814 * @size: the size of the region
816 * Return 0 on success, -errno on failure.
818 int __init_memblock
memblock_mark_mirror(phys_addr_t base
, phys_addr_t size
)
820 system_has_some_mirror
= true;
822 return memblock_setclr_flag(base
, size
, 1, MEMBLOCK_MIRROR
);
826 * memblock_mark_nomap - Mark a memory region with flag MEMBLOCK_NOMAP.
827 * @base: the base phys addr of the region
828 * @size: the size of the region
830 * Return 0 on success, -errno on failure.
832 int __init_memblock
memblock_mark_nomap(phys_addr_t base
, phys_addr_t size
)
834 return memblock_setclr_flag(base
, size
, 1, MEMBLOCK_NOMAP
);
838 * __next_reserved_mem_region - next function for for_each_reserved_region()
839 * @idx: pointer to u64 loop variable
840 * @out_start: ptr to phys_addr_t for start address of the region, can be %NULL
841 * @out_end: ptr to phys_addr_t for end address of the region, can be %NULL
843 * Iterate over all reserved memory regions.
845 void __init_memblock
__next_reserved_mem_region(u64
*idx
,
846 phys_addr_t
*out_start
,
847 phys_addr_t
*out_end
)
849 struct memblock_type
*type
= &memblock
.reserved
;
851 if (*idx
>= 0 && *idx
< type
->cnt
) {
852 struct memblock_region
*r
= &type
->regions
[*idx
];
853 phys_addr_t base
= r
->base
;
854 phys_addr_t size
= r
->size
;
859 *out_end
= base
+ size
- 1;
865 /* signal end of iteration */
870 * __next__mem_range - next function for for_each_free_mem_range() etc.
871 * @idx: pointer to u64 loop variable
872 * @nid: node selector, %NUMA_NO_NODE for all nodes
873 * @flags: pick from blocks based on memory attributes
874 * @type_a: pointer to memblock_type from where the range is taken
875 * @type_b: pointer to memblock_type which excludes memory from being taken
876 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
877 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
878 * @out_nid: ptr to int for nid of the range, can be %NULL
880 * Find the first area from *@idx which matches @nid, fill the out
881 * parameters, and update *@idx for the next iteration. The lower 32bit of
882 * *@idx contains index into type_a and the upper 32bit indexes the
883 * areas before each region in type_b. For example, if type_b regions
884 * look like the following,
886 * 0:[0-16), 1:[32-48), 2:[128-130)
888 * The upper 32bit indexes the following regions.
890 * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX)
892 * As both region arrays are sorted, the function advances the two indices
893 * in lockstep and returns each intersection.
895 void __init_memblock
__next_mem_range(u64
*idx
, int nid
, ulong flags
,
896 struct memblock_type
*type_a
,
897 struct memblock_type
*type_b
,
898 phys_addr_t
*out_start
,
899 phys_addr_t
*out_end
, int *out_nid
)
901 int idx_a
= *idx
& 0xffffffff;
902 int idx_b
= *idx
>> 32;
904 if (WARN_ONCE(nid
== MAX_NUMNODES
,
905 "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
908 for (; idx_a
< type_a
->cnt
; idx_a
++) {
909 struct memblock_region
*m
= &type_a
->regions
[idx_a
];
911 phys_addr_t m_start
= m
->base
;
912 phys_addr_t m_end
= m
->base
+ m
->size
;
913 int m_nid
= memblock_get_region_node(m
);
915 /* only memory regions are associated with nodes, check it */
916 if (nid
!= NUMA_NO_NODE
&& nid
!= m_nid
)
919 /* skip hotpluggable memory regions if needed */
920 if (movable_node_is_enabled() && memblock_is_hotpluggable(m
))
923 /* if we want mirror memory skip non-mirror memory regions */
924 if ((flags
& MEMBLOCK_MIRROR
) && !memblock_is_mirror(m
))
927 /* skip nomap memory unless we were asked for it explicitly */
928 if (!(flags
& MEMBLOCK_NOMAP
) && memblock_is_nomap(m
))
933 *out_start
= m_start
;
939 *idx
= (u32
)idx_a
| (u64
)idx_b
<< 32;
943 /* scan areas before each reservation */
944 for (; idx_b
< type_b
->cnt
+ 1; idx_b
++) {
945 struct memblock_region
*r
;
949 r
= &type_b
->regions
[idx_b
];
950 r_start
= idx_b
? r
[-1].base
+ r
[-1].size
: 0;
951 r_end
= idx_b
< type_b
->cnt
?
952 r
->base
: ULLONG_MAX
;
955 * if idx_b advanced past idx_a,
956 * break out to advance idx_a
958 if (r_start
>= m_end
)
960 /* if the two regions intersect, we're done */
961 if (m_start
< r_end
) {
964 max(m_start
, r_start
);
966 *out_end
= min(m_end
, r_end
);
970 * The region which ends first is
971 * advanced for the next iteration.
977 *idx
= (u32
)idx_a
| (u64
)idx_b
<< 32;
983 /* signal end of iteration */
988 * __next_mem_range_rev - generic next function for for_each_*_range_rev()
990 * Finds the next range from type_a which is not marked as unsuitable
993 * @idx: pointer to u64 loop variable
994 * @nid: node selector, %NUMA_NO_NODE for all nodes
995 * @flags: pick from blocks based on memory attributes
996 * @type_a: pointer to memblock_type from where the range is taken
997 * @type_b: pointer to memblock_type which excludes memory from being taken
998 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
999 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
1000 * @out_nid: ptr to int for nid of the range, can be %NULL
1002 * Reverse of __next_mem_range().
1004 void __init_memblock
__next_mem_range_rev(u64
*idx
, int nid
, ulong flags
,
1005 struct memblock_type
*type_a
,
1006 struct memblock_type
*type_b
,
1007 phys_addr_t
*out_start
,
1008 phys_addr_t
*out_end
, int *out_nid
)
1010 int idx_a
= *idx
& 0xffffffff;
1011 int idx_b
= *idx
>> 32;
1013 if (WARN_ONCE(nid
== MAX_NUMNODES
, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
1016 if (*idx
== (u64
)ULLONG_MAX
) {
1017 idx_a
= type_a
->cnt
- 1;
1018 idx_b
= type_b
->cnt
;
1021 for (; idx_a
>= 0; idx_a
--) {
1022 struct memblock_region
*m
= &type_a
->regions
[idx_a
];
1024 phys_addr_t m_start
= m
->base
;
1025 phys_addr_t m_end
= m
->base
+ m
->size
;
1026 int m_nid
= memblock_get_region_node(m
);
1028 /* only memory regions are associated with nodes, check it */
1029 if (nid
!= NUMA_NO_NODE
&& nid
!= m_nid
)
1032 /* skip hotpluggable memory regions if needed */
1033 if (movable_node_is_enabled() && memblock_is_hotpluggable(m
))
1036 /* if we want mirror memory skip non-mirror memory regions */
1037 if ((flags
& MEMBLOCK_MIRROR
) && !memblock_is_mirror(m
))
1040 /* skip nomap memory unless we were asked for it explicitly */
1041 if (!(flags
& MEMBLOCK_NOMAP
) && memblock_is_nomap(m
))
1046 *out_start
= m_start
;
1052 *idx
= (u32
)idx_a
| (u64
)idx_b
<< 32;
1056 /* scan areas before each reservation */
1057 for (; idx_b
>= 0; idx_b
--) {
1058 struct memblock_region
*r
;
1059 phys_addr_t r_start
;
1062 r
= &type_b
->regions
[idx_b
];
1063 r_start
= idx_b
? r
[-1].base
+ r
[-1].size
: 0;
1064 r_end
= idx_b
< type_b
->cnt
?
1065 r
->base
: ULLONG_MAX
;
1067 * if idx_b advanced past idx_a,
1068 * break out to advance idx_a
1071 if (r_end
<= m_start
)
1073 /* if the two regions intersect, we're done */
1074 if (m_end
> r_start
) {
1076 *out_start
= max(m_start
, r_start
);
1078 *out_end
= min(m_end
, r_end
);
1081 if (m_start
>= r_start
)
1085 *idx
= (u32
)idx_a
| (u64
)idx_b
<< 32;
1090 /* signal end of iteration */
1094 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1096 * Common iterator interface used to define for_each_mem_range().
1098 void __init_memblock
__next_mem_pfn_range(int *idx
, int nid
,
1099 unsigned long *out_start_pfn
,
1100 unsigned long *out_end_pfn
, int *out_nid
)
1102 struct memblock_type
*type
= &memblock
.memory
;
1103 struct memblock_region
*r
;
1105 while (++*idx
< type
->cnt
) {
1106 r
= &type
->regions
[*idx
];
1108 if (PFN_UP(r
->base
) >= PFN_DOWN(r
->base
+ r
->size
))
1110 if (nid
== MAX_NUMNODES
|| nid
== r
->nid
)
1113 if (*idx
>= type
->cnt
) {
1119 *out_start_pfn
= PFN_UP(r
->base
);
1121 *out_end_pfn
= PFN_DOWN(r
->base
+ r
->size
);
1127 * memblock_set_node - set node ID on memblock regions
1128 * @base: base of area to set node ID for
1129 * @size: size of area to set node ID for
1130 * @type: memblock type to set node ID for
1131 * @nid: node ID to set
1133 * Set the nid of memblock @type regions in [@base,@base+@size) to @nid.
1134 * Regions which cross the area boundaries are split as necessary.
1137 * 0 on success, -errno on failure.
1139 int __init_memblock
memblock_set_node(phys_addr_t base
, phys_addr_t size
,
1140 struct memblock_type
*type
, int nid
)
1142 int start_rgn
, end_rgn
;
1145 ret
= memblock_isolate_range(type
, base
, size
, &start_rgn
, &end_rgn
);
1149 for (i
= start_rgn
; i
< end_rgn
; i
++)
1150 memblock_set_region_node(&type
->regions
[i
], nid
);
1152 memblock_merge_regions(type
);
1155 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
1157 static phys_addr_t __init
memblock_alloc_range_nid(phys_addr_t size
,
1158 phys_addr_t align
, phys_addr_t start
,
1159 phys_addr_t end
, int nid
, ulong flags
)
1164 align
= SMP_CACHE_BYTES
;
1166 found
= memblock_find_in_range_node(size
, align
, start
, end
, nid
,
1168 if (found
&& !memblock_reserve(found
, size
)) {
1170 * The min_count is set to 0 so that memblock allocations are
1171 * never reported as leaks.
1173 kmemleak_alloc(__va(found
), size
, 0, 0);
1179 phys_addr_t __init
memblock_alloc_range(phys_addr_t size
, phys_addr_t align
,
1180 phys_addr_t start
, phys_addr_t end
,
1183 return memblock_alloc_range_nid(size
, align
, start
, end
, NUMA_NO_NODE
,
1187 static phys_addr_t __init
memblock_alloc_base_nid(phys_addr_t size
,
1188 phys_addr_t align
, phys_addr_t max_addr
,
1189 int nid
, ulong flags
)
1191 return memblock_alloc_range_nid(size
, align
, 0, max_addr
, nid
, flags
);
1194 phys_addr_t __init
memblock_alloc_nid(phys_addr_t size
, phys_addr_t align
, int nid
)
1196 ulong flags
= choose_memblock_flags();
1200 ret
= memblock_alloc_base_nid(size
, align
, MEMBLOCK_ALLOC_ACCESSIBLE
,
1203 if (!ret
&& (flags
& MEMBLOCK_MIRROR
)) {
1204 flags
&= ~MEMBLOCK_MIRROR
;
1210 phys_addr_t __init
__memblock_alloc_base(phys_addr_t size
, phys_addr_t align
, phys_addr_t max_addr
)
1212 return memblock_alloc_base_nid(size
, align
, max_addr
, NUMA_NO_NODE
,
1216 phys_addr_t __init
memblock_alloc_base(phys_addr_t size
, phys_addr_t align
, phys_addr_t max_addr
)
1220 alloc
= __memblock_alloc_base(size
, align
, max_addr
);
1223 panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n",
1224 (unsigned long long) size
, (unsigned long long) max_addr
);
1229 phys_addr_t __init
memblock_alloc(phys_addr_t size
, phys_addr_t align
)
1231 return memblock_alloc_base(size
, align
, MEMBLOCK_ALLOC_ACCESSIBLE
);
1234 phys_addr_t __init
memblock_alloc_try_nid(phys_addr_t size
, phys_addr_t align
, int nid
)
1236 phys_addr_t res
= memblock_alloc_nid(size
, align
, nid
);
1240 return memblock_alloc_base(size
, align
, MEMBLOCK_ALLOC_ACCESSIBLE
);
1244 * memblock_virt_alloc_internal - allocate boot memory block
1245 * @size: size of memory block to be allocated in bytes
1246 * @align: alignment of the region and block's size
1247 * @min_addr: the lower bound of the memory region to allocate (phys address)
1248 * @max_addr: the upper bound of the memory region to allocate (phys address)
1249 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1251 * The @min_addr limit is dropped if it can not be satisfied and the allocation
1252 * will fall back to memory below @min_addr. Also, allocation may fall back
1253 * to any node in the system if the specified node can not
1254 * hold the requested memory.
1256 * The allocation is performed from memory region limited by
1257 * memblock.current_limit if @max_addr == %BOOTMEM_ALLOC_ACCESSIBLE.
1259 * The memory block is aligned on SMP_CACHE_BYTES if @align == 0.
1261 * The phys address of allocated boot memory block is converted to virtual and
1262 * allocated memory is reset to 0.
1264 * In addition, function sets the min_count to 0 using kmemleak_alloc for
1265 * allocated boot memory block, so that it is never reported as leaks.
1268 * Virtual address of allocated memory block on success, NULL on failure.
1270 static void * __init
memblock_virt_alloc_internal(
1271 phys_addr_t size
, phys_addr_t align
,
1272 phys_addr_t min_addr
, phys_addr_t max_addr
,
1277 ulong flags
= choose_memblock_flags();
1279 if (WARN_ONCE(nid
== MAX_NUMNODES
, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n"))
1283 * Detect any accidental use of these APIs after slab is ready, as at
1284 * this moment memblock may be deinitialized already and its
1285 * internal data may be destroyed (after execution of free_all_bootmem)
1287 if (WARN_ON_ONCE(slab_is_available()))
1288 return kzalloc_node(size
, GFP_NOWAIT
, nid
);
1291 align
= SMP_CACHE_BYTES
;
1293 if (max_addr
> memblock
.current_limit
)
1294 max_addr
= memblock
.current_limit
;
1297 alloc
= memblock_find_in_range_node(size
, align
, min_addr
, max_addr
,
1302 if (nid
!= NUMA_NO_NODE
) {
1303 alloc
= memblock_find_in_range_node(size
, align
, min_addr
,
1304 max_addr
, NUMA_NO_NODE
,
1315 if (flags
& MEMBLOCK_MIRROR
) {
1316 flags
&= ~MEMBLOCK_MIRROR
;
1317 pr_warn("Could not allocate %pap bytes of mirrored memory\n",
1324 memblock_reserve(alloc
, size
);
1325 ptr
= phys_to_virt(alloc
);
1326 memset(ptr
, 0, size
);
1329 * The min_count is set to 0 so that bootmem allocated blocks
1330 * are never reported as leaks. This is because many of these blocks
1331 * are only referred via the physical address which is not
1332 * looked up by kmemleak.
1334 kmemleak_alloc(ptr
, size
, 0, 0);
1340 * memblock_virt_alloc_try_nid_nopanic - allocate boot memory block
1341 * @size: size of memory block to be allocated in bytes
1342 * @align: alignment of the region and block's size
1343 * @min_addr: the lower bound of the memory region from where the allocation
1344 * is preferred (phys address)
1345 * @max_addr: the upper bound of the memory region from where the allocation
1346 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1347 * allocate only from memory limited by memblock.current_limit value
1348 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1350 * Public version of _memblock_virt_alloc_try_nid_nopanic() which provides
1351 * additional debug information (including caller info), if enabled.
1354 * Virtual address of allocated memory block on success, NULL on failure.
1356 void * __init
memblock_virt_alloc_try_nid_nopanic(
1357 phys_addr_t size
, phys_addr_t align
,
1358 phys_addr_t min_addr
, phys_addr_t max_addr
,
1361 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1362 __func__
, (u64
)size
, (u64
)align
, nid
, (u64
)min_addr
,
1363 (u64
)max_addr
, (void *)_RET_IP_
);
1364 return memblock_virt_alloc_internal(size
, align
, min_addr
,
1369 * memblock_virt_alloc_try_nid - allocate boot memory block with panicking
1370 * @size: size of memory block to be allocated in bytes
1371 * @align: alignment of the region and block's size
1372 * @min_addr: the lower bound of the memory region from where the allocation
1373 * is preferred (phys address)
1374 * @max_addr: the upper bound of the memory region from where the allocation
1375 * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to
1376 * allocate only from memory limited by memblock.current_limit value
1377 * @nid: nid of the free area to find, %NUMA_NO_NODE for any node
1379 * Public panicking version of _memblock_virt_alloc_try_nid_nopanic()
1380 * which provides debug information (including caller info), if enabled,
1381 * and panics if the request can not be satisfied.
1384 * Virtual address of allocated memory block on success, NULL on failure.
1386 void * __init
memblock_virt_alloc_try_nid(
1387 phys_addr_t size
, phys_addr_t align
,
1388 phys_addr_t min_addr
, phys_addr_t max_addr
,
1393 memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF\n",
1394 __func__
, (u64
)size
, (u64
)align
, nid
, (u64
)min_addr
,
1395 (u64
)max_addr
, (void *)_RET_IP_
);
1396 ptr
= memblock_virt_alloc_internal(size
, align
,
1397 min_addr
, max_addr
, nid
);
1401 panic("%s: Failed to allocate %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx\n",
1402 __func__
, (u64
)size
, (u64
)align
, nid
, (u64
)min_addr
,
1408 * __memblock_free_early - free boot memory block
1409 * @base: phys starting address of the boot memory block
1410 * @size: size of the boot memory block in bytes
1412 * Free boot memory block previously allocated by memblock_virt_alloc_xx() API.
1413 * The freeing memory will not be released to the buddy allocator.
1415 void __init
__memblock_free_early(phys_addr_t base
, phys_addr_t size
)
1417 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1418 __func__
, (u64
)base
, (u64
)base
+ size
- 1,
1420 kmemleak_free_part(__va(base
), size
);
1421 memblock_remove_range(&memblock
.reserved
, base
, size
);
1425 * __memblock_free_late - free bootmem block pages directly to buddy allocator
1426 * @addr: phys starting address of the boot memory block
1427 * @size: size of the boot memory block in bytes
1429 * This is only useful when the bootmem allocator has already been torn
1430 * down, but we are still initializing the system. Pages are released directly
1431 * to the buddy allocator, no bootmem metadata is updated because it is gone.
1433 void __init
__memblock_free_late(phys_addr_t base
, phys_addr_t size
)
1437 memblock_dbg("%s: [%#016llx-%#016llx] %pF\n",
1438 __func__
, (u64
)base
, (u64
)base
+ size
- 1,
1440 kmemleak_free_part(__va(base
), size
);
1441 cursor
= PFN_UP(base
);
1442 end
= PFN_DOWN(base
+ size
);
1444 for (; cursor
< end
; cursor
++) {
1445 __free_pages_bootmem(pfn_to_page(cursor
), cursor
, 0);
1451 * Remaining API functions
1454 phys_addr_t __init
memblock_phys_mem_size(void)
1456 return memblock
.memory
.total_size
;
1459 phys_addr_t __init
memblock_mem_size(unsigned long limit_pfn
)
1461 unsigned long pages
= 0;
1462 struct memblock_region
*r
;
1463 unsigned long start_pfn
, end_pfn
;
1465 for_each_memblock(memory
, r
) {
1466 start_pfn
= memblock_region_memory_base_pfn(r
);
1467 end_pfn
= memblock_region_memory_end_pfn(r
);
1468 start_pfn
= min_t(unsigned long, start_pfn
, limit_pfn
);
1469 end_pfn
= min_t(unsigned long, end_pfn
, limit_pfn
);
1470 pages
+= end_pfn
- start_pfn
;
1473 return PFN_PHYS(pages
);
1476 /* lowest address */
1477 phys_addr_t __init_memblock
memblock_start_of_DRAM(void)
1479 return memblock
.memory
.regions
[0].base
;
1482 phys_addr_t __init_memblock
memblock_end_of_DRAM(void)
1484 int idx
= memblock
.memory
.cnt
- 1;
1486 return (memblock
.memory
.regions
[idx
].base
+ memblock
.memory
.regions
[idx
].size
);
1489 void __init
memblock_enforce_memory_limit(phys_addr_t limit
)
1491 phys_addr_t max_addr
= (phys_addr_t
)ULLONG_MAX
;
1492 struct memblock_region
*r
;
1497 /* find out max address */
1498 for_each_memblock(memory
, r
) {
1499 if (limit
<= r
->size
) {
1500 max_addr
= r
->base
+ limit
;
1506 /* truncate both memory and reserved regions */
1507 memblock_remove_range(&memblock
.memory
, max_addr
,
1508 (phys_addr_t
)ULLONG_MAX
);
1509 memblock_remove_range(&memblock
.reserved
, max_addr
,
1510 (phys_addr_t
)ULLONG_MAX
);
1513 static int __init_memblock
memblock_search(struct memblock_type
*type
, phys_addr_t addr
)
1515 unsigned int left
= 0, right
= type
->cnt
;
1518 unsigned int mid
= (right
+ left
) / 2;
1520 if (addr
< type
->regions
[mid
].base
)
1522 else if (addr
>= (type
->regions
[mid
].base
+
1523 type
->regions
[mid
].size
))
1527 } while (left
< right
);
1531 int __init
memblock_is_reserved(phys_addr_t addr
)
1533 return memblock_search(&memblock
.reserved
, addr
) != -1;
1536 int __init_memblock
memblock_is_memory(phys_addr_t addr
)
1538 return memblock_search(&memblock
.memory
, addr
) != -1;
1541 int __init_memblock
memblock_is_map_memory(phys_addr_t addr
)
1543 int i
= memblock_search(&memblock
.memory
, addr
);
1547 return !memblock_is_nomap(&memblock
.memory
.regions
[i
]);
1550 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1551 int __init_memblock
memblock_search_pfn_nid(unsigned long pfn
,
1552 unsigned long *start_pfn
, unsigned long *end_pfn
)
1554 struct memblock_type
*type
= &memblock
.memory
;
1555 int mid
= memblock_search(type
, PFN_PHYS(pfn
));
1560 *start_pfn
= PFN_DOWN(type
->regions
[mid
].base
);
1561 *end_pfn
= PFN_DOWN(type
->regions
[mid
].base
+ type
->regions
[mid
].size
);
1563 return type
->regions
[mid
].nid
;
1568 * memblock_is_region_memory - check if a region is a subset of memory
1569 * @base: base of region to check
1570 * @size: size of region to check
1572 * Check if the region [@base, @base+@size) is a subset of a memory block.
1575 * 0 if false, non-zero if true
1577 int __init_memblock
memblock_is_region_memory(phys_addr_t base
, phys_addr_t size
)
1579 int idx
= memblock_search(&memblock
.memory
, base
);
1580 phys_addr_t end
= base
+ memblock_cap_size(base
, &size
);
1584 return memblock
.memory
.regions
[idx
].base
<= base
&&
1585 (memblock
.memory
.regions
[idx
].base
+
1586 memblock
.memory
.regions
[idx
].size
) >= end
;
1590 * memblock_is_region_reserved - check if a region intersects reserved memory
1591 * @base: base of region to check
1592 * @size: size of region to check
1594 * Check if the region [@base, @base+@size) intersects a reserved memory block.
1597 * True if they intersect, false if not.
1599 bool __init_memblock
memblock_is_region_reserved(phys_addr_t base
, phys_addr_t size
)
1601 memblock_cap_size(base
, &size
);
1602 return memblock_overlaps_region(&memblock
.reserved
, base
, size
);
1605 void __init_memblock
memblock_trim_memory(phys_addr_t align
)
1607 phys_addr_t start
, end
, orig_start
, orig_end
;
1608 struct memblock_region
*r
;
1610 for_each_memblock(memory
, r
) {
1611 orig_start
= r
->base
;
1612 orig_end
= r
->base
+ r
->size
;
1613 start
= round_up(orig_start
, align
);
1614 end
= round_down(orig_end
, align
);
1616 if (start
== orig_start
&& end
== orig_end
)
1621 r
->size
= end
- start
;
1623 memblock_remove_region(&memblock
.memory
,
1624 r
- memblock
.memory
.regions
);
1630 void __init_memblock
memblock_set_current_limit(phys_addr_t limit
)
1632 memblock
.current_limit
= limit
;
1635 phys_addr_t __init_memblock
memblock_get_current_limit(void)
1637 return memblock
.current_limit
;
1640 static void __init_memblock
memblock_dump(struct memblock_type
*type
, char *name
)
1642 unsigned long long base
, size
;
1643 unsigned long flags
;
1646 pr_info(" %s.cnt = 0x%lx\n", name
, type
->cnt
);
1648 for (i
= 0; i
< type
->cnt
; i
++) {
1649 struct memblock_region
*rgn
= &type
->regions
[i
];
1650 char nid_buf
[32] = "";
1655 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1656 if (memblock_get_region_node(rgn
) != MAX_NUMNODES
)
1657 snprintf(nid_buf
, sizeof(nid_buf
), " on node %d",
1658 memblock_get_region_node(rgn
));
1660 pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s flags: %#lx\n",
1661 name
, i
, base
, base
+ size
- 1, size
, nid_buf
, flags
);
1665 void __init_memblock
__memblock_dump_all(void)
1667 pr_info("MEMBLOCK configuration:\n");
1668 pr_info(" memory size = %#llx reserved size = %#llx\n",
1669 (unsigned long long)memblock
.memory
.total_size
,
1670 (unsigned long long)memblock
.reserved
.total_size
);
1672 memblock_dump(&memblock
.memory
, "memory");
1673 memblock_dump(&memblock
.reserved
, "reserved");
1676 void __init
memblock_allow_resize(void)
1678 memblock_can_resize
= 1;
1681 static int __init
early_memblock(char *p
)
1683 if (p
&& strstr(p
, "debug"))
1687 early_param("memblock", early_memblock
);
1689 #if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
1691 static int memblock_debug_show(struct seq_file
*m
, void *private)
1693 struct memblock_type
*type
= m
->private;
1694 struct memblock_region
*reg
;
1697 for (i
= 0; i
< type
->cnt
; i
++) {
1698 reg
= &type
->regions
[i
];
1699 seq_printf(m
, "%4d: ", i
);
1700 if (sizeof(phys_addr_t
) == 4)
1701 seq_printf(m
, "0x%08lx..0x%08lx\n",
1702 (unsigned long)reg
->base
,
1703 (unsigned long)(reg
->base
+ reg
->size
- 1));
1705 seq_printf(m
, "0x%016llx..0x%016llx\n",
1706 (unsigned long long)reg
->base
,
1707 (unsigned long long)(reg
->base
+ reg
->size
- 1));
1713 static int memblock_debug_open(struct inode
*inode
, struct file
*file
)
1715 return single_open(file
, memblock_debug_show
, inode
->i_private
);
1718 static const struct file_operations memblock_debug_fops
= {
1719 .open
= memblock_debug_open
,
1721 .llseek
= seq_lseek
,
1722 .release
= single_release
,
1725 static int __init
memblock_init_debugfs(void)
1727 struct dentry
*root
= debugfs_create_dir("memblock", NULL
);
1730 debugfs_create_file("memory", S_IRUGO
, root
, &memblock
.memory
, &memblock_debug_fops
);
1731 debugfs_create_file("reserved", S_IRUGO
, root
, &memblock
.reserved
, &memblock_debug_fops
);
1732 #ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP
1733 debugfs_create_file("physmem", S_IRUGO
, root
, &memblock
.physmem
, &memblock_debug_fops
);
1738 __initcall(memblock_init_debugfs
);
1740 #endif /* CONFIG_DEBUG_FS */