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>
22 #include <linux/kallsyms.h>
23 #include <mach/mtk_memcfg.h>
25 static struct memblock_region memblock_memory_init_regions
[INIT_MEMBLOCK_REGIONS
] __initdata_memblock
;
26 static struct memblock_region memblock_reserved_init_regions
[INIT_MEMBLOCK_REGIONS
] __initdata_memblock
;
28 struct memblock memblock __initdata_memblock
= {
29 .memory
.regions
= memblock_memory_init_regions
,
30 .memory
.cnt
= 1, /* empty dummy entry */
31 .memory
.max
= INIT_MEMBLOCK_REGIONS
,
33 .reserved
.regions
= memblock_reserved_init_regions
,
34 .reserved
.cnt
= 1, /* empty dummy entry */
35 .reserved
.max
= INIT_MEMBLOCK_REGIONS
,
37 .current_limit
= MEMBLOCK_ALLOC_ANYWHERE
,
40 int memblock_debug __initdata_memblock
;
41 static int memblock_can_resize __initdata_memblock
;
42 static int memblock_memory_in_slab __initdata_memblock
= 0;
43 static int memblock_reserved_in_slab __initdata_memblock
= 0;
45 /* inline so we don't get a warning when pr_debug is compiled out */
46 static __init_memblock
const char *
47 memblock_type_name(struct memblock_type
*type
)
49 if (type
== &memblock
.memory
)
51 else if (type
== &memblock
.reserved
)
57 /* adjust *@size so that (@base + *@size) doesn't overflow, return new size */
58 static inline phys_addr_t
memblock_cap_size(phys_addr_t base
, phys_addr_t
*size
)
60 return *size
= min(*size
, (phys_addr_t
)ULLONG_MAX
- base
);
64 * Address comparison utilities
66 static unsigned long __init_memblock
memblock_addrs_overlap(phys_addr_t base1
, phys_addr_t size1
,
67 phys_addr_t base2
, phys_addr_t size2
)
69 return ((base1
< (base2
+ size2
)) && (base2
< (base1
+ size1
)));
72 static long __init_memblock
memblock_overlaps_region(struct memblock_type
*type
,
73 phys_addr_t base
, phys_addr_t size
)
77 for (i
= 0; i
< type
->cnt
; i
++) {
78 phys_addr_t rgnbase
= type
->regions
[i
].base
;
79 phys_addr_t rgnsize
= type
->regions
[i
].size
;
80 if (memblock_addrs_overlap(base
, size
, rgnbase
, rgnsize
))
84 return (i
< type
->cnt
) ? i
: -1;
88 * memblock_find_in_range_node - find free area in given range and node
89 * @start: start of candidate range
90 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
91 * @size: size of free area to find
92 * @align: alignment of free area to find
93 * @nid: nid of the free area to find, %MAX_NUMNODES for any node
95 * Find @size free area aligned to @align in the specified range and node.
98 * Found address on success, %0 on failure.
100 phys_addr_t __init_memblock
memblock_find_in_range_node(phys_addr_t start
,
101 phys_addr_t end
, phys_addr_t size
,
102 phys_addr_t align
, int nid
)
104 phys_addr_t this_start
, this_end
, cand
;
108 if (end
== MEMBLOCK_ALLOC_ACCESSIBLE
)
109 end
= memblock
.current_limit
;
111 /* avoid allocating the first page */
112 start
= max_t(phys_addr_t
, start
, PAGE_SIZE
);
113 end
= max(start
, end
);
115 for_each_free_mem_range_reverse(i
, nid
, &this_start
, &this_end
, NULL
) {
116 this_start
= clamp(this_start
, start
, end
);
117 this_end
= clamp(this_end
, start
, end
);
122 cand
= round_down(this_end
- size
, align
);
123 if (cand
>= this_start
)
130 * memblock_find_in_range - find free area in given range
131 * @start: start of candidate range
132 * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE}
133 * @size: size of free area to find
134 * @align: alignment of free area to find
136 * Find @size free area aligned to @align in the specified range.
139 * Found address on success, %0 on failure.
141 phys_addr_t __init_memblock
memblock_find_in_range(phys_addr_t start
,
142 phys_addr_t end
, phys_addr_t size
,
145 return memblock_find_in_range_node(start
, end
, size
, align
,
149 static void __init_memblock
memblock_remove_region(struct memblock_type
*type
, unsigned long r
)
151 type
->total_size
-= type
->regions
[r
].size
;
152 memmove(&type
->regions
[r
], &type
->regions
[r
+ 1],
153 (type
->cnt
- (r
+ 1)) * sizeof(type
->regions
[r
]));
156 /* Special case for empty arrays */
157 if (type
->cnt
== 0) {
158 WARN_ON(type
->total_size
!= 0);
160 type
->regions
[0].base
= 0;
161 type
->regions
[0].size
= 0;
162 memblock_set_region_node(&type
->regions
[0], MAX_NUMNODES
);
166 phys_addr_t __init_memblock
get_allocated_memblock_reserved_regions_info(
169 if (memblock
.reserved
.regions
== memblock_reserved_init_regions
)
172 *addr
= __pa(memblock
.reserved
.regions
);
174 return PAGE_ALIGN(sizeof(struct memblock_region
) *
175 memblock
.reserved
.max
);
179 * memblock_double_array - double the size of the memblock regions array
180 * @type: memblock type of the regions array being doubled
181 * @new_area_start: starting address of memory range to avoid overlap with
182 * @new_area_size: size of memory range to avoid overlap with
184 * Double the size of the @type regions array. If memblock is being used to
185 * allocate memory for a new reserved regions array and there is a previously
186 * allocated memory range [@new_area_start,@new_area_start+@new_area_size]
187 * waiting to be reserved, ensure the memory used by the new array does
191 * 0 on success, -1 on failure.
193 static int __init_memblock
memblock_double_array(struct memblock_type
*type
,
194 phys_addr_t new_area_start
,
195 phys_addr_t new_area_size
)
197 struct memblock_region
*new_array
, *old_array
;
198 phys_addr_t old_alloc_size
, new_alloc_size
;
199 phys_addr_t old_size
, new_size
, addr
;
200 int use_slab
= slab_is_available();
203 /* We don't allow resizing until we know about the reserved regions
204 * of memory that aren't suitable for allocation
206 if (!memblock_can_resize
)
209 /* Calculate new doubled size */
210 old_size
= type
->max
* sizeof(struct memblock_region
);
211 new_size
= old_size
<< 1;
213 * We need to allocated new one align to PAGE_SIZE,
214 * so we can free them completely later.
216 old_alloc_size
= PAGE_ALIGN(old_size
);
217 new_alloc_size
= PAGE_ALIGN(new_size
);
219 /* Retrieve the slab flag */
220 if (type
== &memblock
.memory
)
221 in_slab
= &memblock_memory_in_slab
;
223 in_slab
= &memblock_reserved_in_slab
;
225 /* Try to find some space for it.
227 * WARNING: We assume that either slab_is_available() and we use it or
228 * we use MEMBLOCK for allocations. That means that this is unsafe to
229 * use when bootmem is currently active (unless bootmem itself is
230 * implemented on top of MEMBLOCK which isn't the case yet)
232 * This should however not be an issue for now, as we currently only
233 * call into MEMBLOCK while it's still active, or much later when slab
234 * is active for memory hotplug operations
237 new_array
= kmalloc(new_size
, GFP_KERNEL
);
238 addr
= new_array
? __pa(new_array
) : 0;
240 /* only exclude range when trying to double reserved.regions */
241 if (type
!= &memblock
.reserved
)
242 new_area_start
= new_area_size
= 0;
244 addr
= memblock_find_in_range(new_area_start
+ new_area_size
,
245 memblock
.current_limit
,
246 new_alloc_size
, PAGE_SIZE
);
247 if (!addr
&& new_area_size
)
248 addr
= memblock_find_in_range(0,
249 min(new_area_start
, memblock
.current_limit
),
250 new_alloc_size
, PAGE_SIZE
);
252 new_array
= addr
? __va(addr
) : NULL
;
255 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
256 memblock_type_name(type
), type
->max
, type
->max
* 2);
260 memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]",
261 memblock_type_name(type
), type
->max
* 2, (u64
)addr
,
262 (u64
)addr
+ new_size
- 1);
265 * Found space, we now need to move the array over before we add the
266 * reserved region since it may be our reserved array itself that is
269 memcpy(new_array
, type
->regions
, old_size
);
270 memset(new_array
+ type
->max
, 0, old_size
);
271 old_array
= type
->regions
;
272 type
->regions
= new_array
;
275 /* Free old array. We needn't free it if the array is the static one */
278 else if (old_array
!= memblock_memory_init_regions
&&
279 old_array
!= memblock_reserved_init_regions
)
280 memblock_free(__pa(old_array
), old_alloc_size
);
283 * Reserve the new array if that comes from the memblock. Otherwise, we
287 BUG_ON(memblock_reserve(addr
, new_alloc_size
));
289 /* Update slab flag */
296 * memblock_merge_regions - merge neighboring compatible regions
297 * @type: memblock type to scan
299 * Scan @type and merge neighboring compatible regions.
301 static void __init_memblock
memblock_merge_regions(struct memblock_type
*type
)
305 /* cnt never goes below 1 */
306 while (i
< type
->cnt
- 1) {
307 struct memblock_region
*this = &type
->regions
[i
];
308 struct memblock_region
*next
= &type
->regions
[i
+ 1];
310 if (this->base
+ this->size
!= next
->base
||
311 memblock_get_region_node(this) !=
312 memblock_get_region_node(next
)) {
313 BUG_ON(this->base
+ this->size
> next
->base
);
318 this->size
+= next
->size
;
319 /* move forward from next + 1, index of which is i + 2 */
320 memmove(next
, next
+ 1, (type
->cnt
- (i
+ 2)) * sizeof(*next
));
326 * memblock_insert_region - insert new memblock region
327 * @type: memblock type to insert into
328 * @idx: index for the insertion point
329 * @base: base address of the new region
330 * @size: size of the new region
331 * @nid: node id of the new region
333 * Insert new memblock region [@base,@base+@size) into @type at @idx.
334 * @type must already have extra room to accomodate the new region.
336 static void __init_memblock
memblock_insert_region(struct memblock_type
*type
,
337 int idx
, phys_addr_t base
,
338 phys_addr_t size
, int nid
)
340 struct memblock_region
*rgn
= &type
->regions
[idx
];
342 BUG_ON(type
->cnt
>= type
->max
);
343 memmove(rgn
+ 1, rgn
, (type
->cnt
- idx
) * sizeof(*rgn
));
346 memblock_set_region_node(rgn
, nid
);
348 type
->total_size
+= size
;
352 * memblock_add_region - add new memblock region
353 * @type: memblock type to add new region into
354 * @base: base address of the new region
355 * @size: size of the new region
356 * @nid: nid of the new region
358 * Add new memblock region [@base,@base+@size) into @type. The new region
359 * is allowed to overlap with existing ones - overlaps don't affect already
360 * existing regions. @type is guaranteed to be minimal (all neighbouring
361 * compatible regions are merged) after the addition.
364 * 0 on success, -errno on failure.
366 static int __init_memblock
memblock_add_region(struct memblock_type
*type
,
367 phys_addr_t base
, phys_addr_t size
, int nid
)
370 phys_addr_t obase
= base
;
371 phys_addr_t end
= base
+ memblock_cap_size(base
, &size
);
377 /* special case for empty array */
378 if (type
->regions
[0].size
== 0) {
379 WARN_ON(type
->cnt
!= 1 || type
->total_size
);
380 type
->regions
[0].base
= base
;
381 type
->regions
[0].size
= size
;
382 memblock_set_region_node(&type
->regions
[0], nid
);
383 type
->total_size
= size
;
388 * The following is executed twice. Once with %false @insert and
389 * then with %true. The first counts the number of regions needed
390 * to accomodate the new area. The second actually inserts them.
395 for (i
= 0; i
< type
->cnt
; i
++) {
396 struct memblock_region
*rgn
= &type
->regions
[i
];
397 phys_addr_t rbase
= rgn
->base
;
398 phys_addr_t rend
= rbase
+ rgn
->size
;
405 * @rgn overlaps. If it separates the lower part of new
406 * area, insert that portion.
411 memblock_insert_region(type
, i
++, base
,
414 /* area below @rend is dealt with, forget about it */
415 base
= min(rend
, end
);
418 /* insert the remaining portion */
422 memblock_insert_region(type
, i
, base
, end
- base
, nid
);
426 * If this was the first round, resize array and repeat for actual
427 * insertions; otherwise, merge and return.
430 while (type
->cnt
+ nr_new
> type
->max
)
431 if (memblock_double_array(type
, obase
, size
) < 0)
436 memblock_merge_regions(type
);
441 int __init_memblock
memblock_add_node(phys_addr_t base
, phys_addr_t size
,
444 return memblock_add_region(&memblock
.memory
, base
, size
, nid
);
447 int __init_memblock
memblock_add(phys_addr_t base
, phys_addr_t size
)
449 return memblock_add_region(&memblock
.memory
, base
, size
, MAX_NUMNODES
);
453 * memblock_isolate_range - isolate given range into disjoint memblocks
454 * @type: memblock type to isolate range for
455 * @base: base of range to isolate
456 * @size: size of range to isolate
457 * @start_rgn: out parameter for the start of isolated region
458 * @end_rgn: out parameter for the end of isolated region
460 * Walk @type and ensure that regions don't cross the boundaries defined by
461 * [@base,@base+@size). Crossing regions are split at the boundaries,
462 * which may create at most two more regions. The index of the first
463 * region inside the range is returned in *@start_rgn and end in *@end_rgn.
466 * 0 on success, -errno on failure.
468 static int __init_memblock
memblock_isolate_range(struct memblock_type
*type
,
469 phys_addr_t base
, phys_addr_t size
,
470 int *start_rgn
, int *end_rgn
)
472 phys_addr_t end
= base
+ memblock_cap_size(base
, &size
);
475 *start_rgn
= *end_rgn
= 0;
480 /* we'll create at most two more regions */
481 while (type
->cnt
+ 2 > type
->max
)
482 if (memblock_double_array(type
, base
, size
) < 0)
485 for (i
= 0; i
< type
->cnt
; i
++) {
486 struct memblock_region
*rgn
= &type
->regions
[i
];
487 phys_addr_t rbase
= rgn
->base
;
488 phys_addr_t rend
= rbase
+ rgn
->size
;
497 * @rgn intersects from below. Split and continue
498 * to process the next region - the new top half.
501 rgn
->size
-= base
- rbase
;
502 type
->total_size
-= base
- rbase
;
503 memblock_insert_region(type
, i
, rbase
, base
- rbase
,
504 memblock_get_region_node(rgn
));
505 } else if (rend
> end
) {
507 * @rgn intersects from above. Split and redo the
508 * current region - the new bottom half.
511 rgn
->size
-= end
- rbase
;
512 type
->total_size
-= end
- rbase
;
513 memblock_insert_region(type
, i
--, rbase
, end
- rbase
,
514 memblock_get_region_node(rgn
));
516 /* @rgn is fully contained, record it */
526 static int __init_memblock
__memblock_remove(struct memblock_type
*type
,
527 phys_addr_t base
, phys_addr_t size
)
529 int start_rgn
, end_rgn
;
532 ret
= memblock_isolate_range(type
, base
, size
, &start_rgn
, &end_rgn
);
536 for (i
= end_rgn
- 1; i
>= start_rgn
; i
--)
537 memblock_remove_region(type
, i
);
541 int __init_memblock
memblock_remove(phys_addr_t base
, phys_addr_t size
)
543 return __memblock_remove(&memblock
.memory
, base
, size
);
546 int __init_memblock
memblock_free(phys_addr_t base
, phys_addr_t size
)
548 memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n",
549 (unsigned long long)base
,
550 (unsigned long long)base
+ size
,
553 return __memblock_remove(&memblock
.reserved
, base
, size
);
556 int __init_memblock
memblock_reserve(phys_addr_t base
, phys_addr_t size
)
558 struct memblock_type
*_rgn
= &memblock
.reserved
;
559 char symname
[KSYM_NAME_LEN
];
561 memblock_dbg("memblock_reserve: [%#016llx-%#016llx] %pF\n",
562 (unsigned long long)base
,
563 (unsigned long long)base
+ size
,
566 if (lookup_symbol_name(_RET_IP_
, symname
) >= 0) {
567 /* filter common case */
568 if ((!strcmp(symname
, "memblock_alloc_base_nid")) ||
569 (!strcmp(symname
, "arm_mm_memblock_reserve")) ||
570 (!strcmp(symname
, "arm64_memblock_init")) ||
571 (!strcmp(symname
, "__alloc_memory_core_early")) ||
572 (!strcmp(symname
, "arm_memblock_init"))) {
574 MTK_MEMCFG_LOG_AND_PRINTK(KERN_ALERT
"[memblock]%pf: "
575 "0x%08llx - 0x%08llx (0x%08llx)\n",
577 (unsigned long long)base
,
578 (unsigned long long)base
+ size
- 1,
579 (unsigned long long)size
);
583 if (memblock_is_region_reserved(base
, size
)) {
584 /* trap memory reserve conflict */
585 mtk_memcfg_late_warning(WARN_MEMBLOCK_CONFLICT
);
586 MTK_MEMCFG_LOG_AND_PRINTK("[rsv conflict]%pS: "
587 "0x%08llx - 0x%08llx (0x%08llx)\n",
588 __builtin_return_address(0),
589 (unsigned long long)base
,
590 (unsigned long long)base
+ size
,
591 (unsigned long long)size
);
594 return memblock_add_region(_rgn
, base
, size
, MAX_NUMNODES
);
598 * __next_free_mem_range - next function for for_each_free_mem_range()
599 * @idx: pointer to u64 loop variable
600 * @nid: nid: node selector, %MAX_NUMNODES for all nodes
601 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
602 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
603 * @out_nid: ptr to int for nid of the range, can be %NULL
605 * Find the first free area from *@idx which matches @nid, fill the out
606 * parameters, and update *@idx for the next iteration. The lower 32bit of
607 * *@idx contains index into memory region and the upper 32bit indexes the
608 * areas before each reserved region. For example, if reserved regions
609 * look like the following,
611 * 0:[0-16), 1:[32-48), 2:[128-130)
613 * The upper 32bit indexes the following regions.
615 * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX)
617 * As both region arrays are sorted, the function advances the two indices
618 * in lockstep and returns each intersection.
620 void __init_memblock
__next_free_mem_range(u64
*idx
, int nid
,
621 phys_addr_t
*out_start
,
622 phys_addr_t
*out_end
, int *out_nid
)
624 struct memblock_type
*mem
= &memblock
.memory
;
625 struct memblock_type
*rsv
= &memblock
.reserved
;
626 int mi
= *idx
& 0xffffffff;
629 for ( ; mi
< mem
->cnt
; mi
++) {
630 struct memblock_region
*m
= &mem
->regions
[mi
];
631 phys_addr_t m_start
= m
->base
;
632 phys_addr_t m_end
= m
->base
+ m
->size
;
634 /* only memory regions are associated with nodes, check it */
635 if (nid
!= MAX_NUMNODES
&& nid
!= memblock_get_region_node(m
))
638 /* scan areas before each reservation for intersection */
639 for ( ; ri
< rsv
->cnt
+ 1; ri
++) {
640 struct memblock_region
*r
= &rsv
->regions
[ri
];
641 phys_addr_t r_start
= ri
? r
[-1].base
+ r
[-1].size
: 0;
642 phys_addr_t r_end
= ri
< rsv
->cnt
? r
->base
: ULLONG_MAX
;
644 /* if ri advanced past mi, break out to advance mi */
645 if (r_start
>= m_end
)
647 /* if the two regions intersect, we're done */
648 if (m_start
< r_end
) {
650 *out_start
= max(m_start
, r_start
);
652 *out_end
= min(m_end
, r_end
);
654 *out_nid
= memblock_get_region_node(m
);
656 * The region which ends first is advanced
657 * for the next iteration.
663 *idx
= (u32
)mi
| (u64
)ri
<< 32;
669 /* signal end of iteration */
674 * __next_free_mem_range_rev - next function for for_each_free_mem_range_reverse()
675 * @idx: pointer to u64 loop variable
676 * @nid: nid: node selector, %MAX_NUMNODES for all nodes
677 * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL
678 * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL
679 * @out_nid: ptr to int for nid of the range, can be %NULL
681 * Reverse of __next_free_mem_range().
683 void __init_memblock
__next_free_mem_range_rev(u64
*idx
, int nid
,
684 phys_addr_t
*out_start
,
685 phys_addr_t
*out_end
, int *out_nid
)
687 struct memblock_type
*mem
= &memblock
.memory
;
688 struct memblock_type
*rsv
= &memblock
.reserved
;
689 int mi
= *idx
& 0xffffffff;
692 if (*idx
== (u64
)ULLONG_MAX
) {
697 for ( ; mi
>= 0; mi
--) {
698 struct memblock_region
*m
= &mem
->regions
[mi
];
699 phys_addr_t m_start
= m
->base
;
700 phys_addr_t m_end
= m
->base
+ m
->size
;
702 /* only memory regions are associated with nodes, check it */
703 if (nid
!= MAX_NUMNODES
&& nid
!= memblock_get_region_node(m
))
706 /* scan areas before each reservation for intersection */
707 for ( ; ri
>= 0; ri
--) {
708 struct memblock_region
*r
= &rsv
->regions
[ri
];
709 phys_addr_t r_start
= ri
? r
[-1].base
+ r
[-1].size
: 0;
710 phys_addr_t r_end
= ri
< rsv
->cnt
? r
->base
: ULLONG_MAX
;
712 /* if ri advanced past mi, break out to advance mi */
713 if (r_end
<= m_start
)
715 /* if the two regions intersect, we're done */
716 if (m_end
> r_start
) {
718 *out_start
= max(m_start
, r_start
);
720 *out_end
= min(m_end
, r_end
);
722 *out_nid
= memblock_get_region_node(m
);
724 if (m_start
>= r_start
)
728 *idx
= (u32
)mi
| (u64
)ri
<< 32;
737 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
739 * Common iterator interface used to define for_each_mem_range().
741 void __init_memblock
__next_mem_pfn_range(int *idx
, int nid
,
742 unsigned long *out_start_pfn
,
743 unsigned long *out_end_pfn
, int *out_nid
)
745 struct memblock_type
*type
= &memblock
.memory
;
746 struct memblock_region
*r
;
748 while (++*idx
< type
->cnt
) {
749 r
= &type
->regions
[*idx
];
751 if (PFN_UP(r
->base
) >= PFN_DOWN(r
->base
+ r
->size
))
753 if (nid
== MAX_NUMNODES
|| nid
== r
->nid
)
756 if (*idx
>= type
->cnt
) {
762 *out_start_pfn
= PFN_UP(r
->base
);
764 *out_end_pfn
= PFN_DOWN(r
->base
+ r
->size
);
770 * memblock_set_node - set node ID on memblock regions
771 * @base: base of area to set node ID for
772 * @size: size of area to set node ID for
773 * @nid: node ID to set
775 * Set the nid of memblock memory regions in [@base,@base+@size) to @nid.
776 * Regions which cross the area boundaries are split as necessary.
779 * 0 on success, -errno on failure.
781 int __init_memblock
memblock_set_node(phys_addr_t base
, phys_addr_t size
,
784 struct memblock_type
*type
= &memblock
.memory
;
785 int start_rgn
, end_rgn
;
788 ret
= memblock_isolate_range(type
, base
, size
, &start_rgn
, &end_rgn
);
792 for (i
= start_rgn
; i
< end_rgn
; i
++)
793 memblock_set_region_node(&type
->regions
[i
], nid
);
795 memblock_merge_regions(type
);
798 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
800 static phys_addr_t __init
memblock_alloc_base_nid(phys_addr_t size
,
801 phys_addr_t align
, phys_addr_t max_addr
,
807 align
= __alignof__(long long);
809 /* align @size to avoid excessive fragmentation on reserved array */
810 /* do not align size, we need every available memory */
811 //size = round_up(size, align);
813 found
= memblock_find_in_range_node(0, max_addr
, size
, align
, nid
);
814 if (found
&& !memblock_reserve(found
, size
))
820 phys_addr_t __init
memblock_alloc_nid(phys_addr_t size
, phys_addr_t align
, int nid
)
822 return memblock_alloc_base_nid(size
, align
, MEMBLOCK_ALLOC_ACCESSIBLE
, nid
);
825 phys_addr_t __init
__memblock_alloc_base(phys_addr_t size
, phys_addr_t align
, phys_addr_t max_addr
)
827 return memblock_alloc_base_nid(size
, align
, max_addr
, MAX_NUMNODES
);
830 phys_addr_t __init
memblock_alloc_base(phys_addr_t size
, phys_addr_t align
, phys_addr_t max_addr
)
834 alloc
= __memblock_alloc_base(size
, align
, max_addr
);
837 panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n",
838 (unsigned long long) size
, (unsigned long long) max_addr
);
843 phys_addr_t __init
memblock_alloc(phys_addr_t size
, phys_addr_t align
)
845 return memblock_alloc_base(size
, align
, MEMBLOCK_ALLOC_ACCESSIBLE
);
848 phys_addr_t __init
memblock_alloc_try_nid(phys_addr_t size
, phys_addr_t align
, int nid
)
850 phys_addr_t res
= memblock_alloc_nid(size
, align
, nid
);
854 return memblock_alloc_base(size
, align
, MEMBLOCK_ALLOC_ACCESSIBLE
);
859 * Remaining API functions
862 phys_addr_t __init
memblock_phys_mem_size(void)
864 return memblock
.memory
.total_size
;
867 phys_addr_t __init
memblock_mem_size(unsigned long limit_pfn
)
869 unsigned long pages
= 0;
870 struct memblock_region
*r
;
871 unsigned long start_pfn
, end_pfn
;
873 for_each_memblock(memory
, r
) {
874 start_pfn
= memblock_region_memory_base_pfn(r
);
875 end_pfn
= memblock_region_memory_end_pfn(r
);
876 start_pfn
= min_t(unsigned long, start_pfn
, limit_pfn
);
877 end_pfn
= min_t(unsigned long, end_pfn
, limit_pfn
);
878 pages
+= end_pfn
- start_pfn
;
881 return (phys_addr_t
)pages
<< PAGE_SHIFT
;
885 phys_addr_t __init_memblock
memblock_start_of_DRAM(void)
887 return memblock
.memory
.regions
[0].base
;
890 phys_addr_t __init_memblock
memblock_end_of_DRAM(void)
892 int idx
= memblock
.memory
.cnt
- 1;
894 return (memblock
.memory
.regions
[idx
].base
+ memblock
.memory
.regions
[idx
].size
);
897 void __init
memblock_enforce_memory_limit(phys_addr_t limit
)
900 phys_addr_t max_addr
= (phys_addr_t
)ULLONG_MAX
;
905 /* find out max address */
906 for (i
= 0; i
< memblock
.memory
.cnt
; i
++) {
907 struct memblock_region
*r
= &memblock
.memory
.regions
[i
];
909 if (limit
<= r
->size
) {
910 max_addr
= r
->base
+ limit
;
916 /* truncate both memory and reserved regions */
917 __memblock_remove(&memblock
.memory
, max_addr
, (phys_addr_t
)ULLONG_MAX
);
918 __memblock_remove(&memblock
.reserved
, max_addr
, (phys_addr_t
)ULLONG_MAX
);
921 static int __init_memblock
memblock_search(struct memblock_type
*type
, phys_addr_t addr
)
923 unsigned int left
= 0, right
= type
->cnt
;
926 unsigned int mid
= (right
+ left
) / 2;
928 if (addr
< type
->regions
[mid
].base
)
930 else if (addr
>= (type
->regions
[mid
].base
+
931 type
->regions
[mid
].size
))
935 } while (left
< right
);
939 int __init
memblock_is_reserved(phys_addr_t addr
)
941 return memblock_search(&memblock
.reserved
, addr
) != -1;
944 int __init_memblock
memblock_is_memory(phys_addr_t addr
)
946 return memblock_search(&memblock
.memory
, addr
) != -1;
950 * memblock_is_region_memory - check if a region is a subset of memory
951 * @base: base of region to check
952 * @size: size of region to check
954 * Check if the region [@base, @base+@size) is a subset of a memory block.
957 * 0 if false, non-zero if true
959 int __init_memblock
memblock_is_region_memory(phys_addr_t base
, phys_addr_t size
)
961 int idx
= memblock_search(&memblock
.memory
, base
);
962 phys_addr_t end
= base
+ memblock_cap_size(base
, &size
);
966 return memblock
.memory
.regions
[idx
].base
<= base
&&
967 (memblock
.memory
.regions
[idx
].base
+
968 memblock
.memory
.regions
[idx
].size
) >= end
;
972 * memblock_is_region_reserved - check if a region intersects reserved memory
973 * @base: base of region to check
974 * @size: size of region to check
976 * Check if the region [@base, @base+@size) intersects a reserved memory block.
979 * 0 if false, non-zero if true
981 int __init_memblock
memblock_is_region_reserved(phys_addr_t base
, phys_addr_t size
)
983 memblock_cap_size(base
, &size
);
984 return memblock_overlaps_region(&memblock
.reserved
, base
, size
) >= 0;
987 void __init_memblock
memblock_trim_memory(phys_addr_t align
)
990 phys_addr_t start
, end
, orig_start
, orig_end
;
991 struct memblock_type
*mem
= &memblock
.memory
;
993 for (i
= 0; i
< mem
->cnt
; i
++) {
994 orig_start
= mem
->regions
[i
].base
;
995 orig_end
= mem
->regions
[i
].base
+ mem
->regions
[i
].size
;
996 start
= round_up(orig_start
, align
);
997 end
= round_down(orig_end
, align
);
999 if (start
== orig_start
&& end
== orig_end
)
1003 mem
->regions
[i
].base
= start
;
1004 mem
->regions
[i
].size
= end
- start
;
1006 memblock_remove_region(mem
, i
);
1012 void __init_memblock
memblock_set_current_limit(phys_addr_t limit
)
1014 memblock
.current_limit
= limit
;
1017 static void __init_memblock
memblock_dump(struct memblock_type
*type
, char *name
)
1019 unsigned long long base
, size
;
1022 pr_info(" %s.cnt = 0x%lx\n", name
, type
->cnt
);
1024 for (i
= 0; i
< type
->cnt
; i
++) {
1025 struct memblock_region
*rgn
= &type
->regions
[i
];
1026 char nid_buf
[32] = "";
1030 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
1031 if (memblock_get_region_node(rgn
) != MAX_NUMNODES
)
1032 snprintf(nid_buf
, sizeof(nid_buf
), " on node %d",
1033 memblock_get_region_node(rgn
));
1035 pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s\n",
1036 name
, i
, base
, base
+ size
- 1, size
, nid_buf
);
1040 void __init_memblock
__memblock_dump_all(void)
1042 pr_info("MEMBLOCK configuration:\n");
1043 pr_info(" memory size = %#llx reserved size = %#llx\n",
1044 (unsigned long long)memblock
.memory
.total_size
,
1045 (unsigned long long)memblock
.reserved
.total_size
);
1047 memblock_dump(&memblock
.memory
, "memory");
1048 memblock_dump(&memblock
.reserved
, "reserved");
1051 void __init
memblock_allow_resize(void)
1053 memblock_can_resize
= 1;
1056 static int __init
early_memblock(char *p
)
1058 if (p
&& strstr(p
, "debug"))
1062 early_param("memblock", early_memblock
);
1064 #if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK)
1066 static int memblock_debug_show(struct seq_file
*m
, void *private)
1068 struct memblock_type
*type
= m
->private;
1069 struct memblock_region
*reg
;
1072 for (i
= 0; i
< type
->cnt
; i
++) {
1073 reg
= &type
->regions
[i
];
1074 seq_printf(m
, "%4d: ", i
);
1075 if (sizeof(phys_addr_t
) == 4)
1076 seq_printf(m
, "0x%08lx..0x%08lx\n",
1077 (unsigned long)reg
->base
,
1078 (unsigned long)(reg
->base
+ reg
->size
- 1));
1080 seq_printf(m
, "0x%016llx..0x%016llx\n",
1081 (unsigned long long)reg
->base
,
1082 (unsigned long long)(reg
->base
+ reg
->size
- 1));
1088 static int memblock_debug_open(struct inode
*inode
, struct file
*file
)
1090 return single_open(file
, memblock_debug_show
, inode
->i_private
);
1093 static const struct file_operations memblock_debug_fops
= {
1094 .open
= memblock_debug_open
,
1096 .llseek
= seq_lseek
,
1097 .release
= single_release
,
1100 static int __init
memblock_init_debugfs(void)
1102 struct dentry
*root
= debugfs_create_dir("memblock", NULL
);
1105 debugfs_create_file("memory", S_IRUGO
, root
, &memblock
.memory
, &memblock_debug_fops
);
1106 debugfs_create_file("reserved", S_IRUGO
, root
, &memblock
.reserved
, &memblock_debug_fops
);
1110 __initcall(memblock_init_debugfs
);
1112 #endif /* CONFIG_DEBUG_FS */