]>
Commit | Line | Data |
---|---|---|
2874c5fd | 1 | // SPDX-License-Identifier: GPL-2.0-or-later |
95f72d1e YL |
2 | /* |
3 | * Procedures for maintaining information about logical memory blocks. | |
4 | * | |
5 | * Peter Bergner, IBM Corp. June 2001. | |
6 | * Copyright (C) 2001 Peter Bergner. | |
95f72d1e YL |
7 | */ |
8 | ||
9 | #include <linux/kernel.h> | |
142b45a7 | 10 | #include <linux/slab.h> |
95f72d1e YL |
11 | #include <linux/init.h> |
12 | #include <linux/bitops.h> | |
449e8df3 | 13 | #include <linux/poison.h> |
c196f76f | 14 | #include <linux/pfn.h> |
6d03b885 | 15 | #include <linux/debugfs.h> |
514c6032 | 16 | #include <linux/kmemleak.h> |
6d03b885 | 17 | #include <linux/seq_file.h> |
95f72d1e YL |
18 | #include <linux/memblock.h> |
19 | ||
c4c5ad6b | 20 | #include <asm/sections.h> |
26f09e9b SS |
21 | #include <linux/io.h> |
22 | ||
23 | #include "internal.h" | |
79442ed1 | 24 | |
8a5b403d AB |
25 | #define INIT_MEMBLOCK_REGIONS 128 |
26 | #define INIT_PHYSMEM_REGIONS 4 | |
27 | ||
28 | #ifndef INIT_MEMBLOCK_RESERVED_REGIONS | |
29 | # define INIT_MEMBLOCK_RESERVED_REGIONS INIT_MEMBLOCK_REGIONS | |
30 | #endif | |
31 | ||
450d0e74 ZG |
32 | #ifndef INIT_MEMBLOCK_MEMORY_REGIONS |
33 | #define INIT_MEMBLOCK_MEMORY_REGIONS INIT_MEMBLOCK_REGIONS | |
34 | #endif | |
35 | ||
3e039c5c MR |
36 | /** |
37 | * DOC: memblock overview | |
38 | * | |
39 | * Memblock is a method of managing memory regions during the early | |
40 | * boot period when the usual kernel memory allocators are not up and | |
41 | * running. | |
42 | * | |
43 | * Memblock views the system memory as collections of contiguous | |
44 | * regions. There are several types of these collections: | |
45 | * | |
46 | * * ``memory`` - describes the physical memory available to the | |
47 | * kernel; this may differ from the actual physical memory installed | |
48 | * in the system, for instance when the memory is restricted with | |
49 | * ``mem=`` command line parameter | |
50 | * * ``reserved`` - describes the regions that were allocated | |
77649905 DH |
51 | * * ``physmem`` - describes the actual physical memory available during |
52 | * boot regardless of the possible restrictions and memory hot(un)plug; | |
53 | * the ``physmem`` type is only available on some architectures. | |
3e039c5c | 54 | * |
9303c9d5 | 55 | * Each region is represented by struct memblock_region that |
3e039c5c | 56 | * defines the region extents, its attributes and NUMA node id on NUMA |
1bf162e4 MCC |
57 | * systems. Every memory type is described by the struct memblock_type |
58 | * which contains an array of memory regions along with | |
77649905 | 59 | * the allocator metadata. The "memory" and "reserved" types are nicely |
9303c9d5 | 60 | * wrapped with struct memblock. This structure is statically |
77649905 | 61 | * initialized at build time. The region arrays are initially sized to |
450d0e74 ZG |
62 | * %INIT_MEMBLOCK_MEMORY_REGIONS for "memory" and |
63 | * %INIT_MEMBLOCK_RESERVED_REGIONS for "reserved". The region array | |
64 | * for "physmem" is initially sized to %INIT_PHYSMEM_REGIONS. | |
6e5af9a8 C |
65 | * The memblock_allow_resize() enables automatic resizing of the region |
66 | * arrays during addition of new regions. This feature should be used | |
67 | * with care so that memory allocated for the region array will not | |
68 | * overlap with areas that should be reserved, for example initrd. | |
3e039c5c MR |
69 | * |
70 | * The early architecture setup should tell memblock what the physical | |
6e5af9a8 C |
71 | * memory layout is by using memblock_add() or memblock_add_node() |
72 | * functions. The first function does not assign the region to a NUMA | |
73 | * node and it is appropriate for UMA systems. Yet, it is possible to | |
74 | * use it on NUMA systems as well and assign the region to a NUMA node | |
75 | * later in the setup process using memblock_set_node(). The | |
76 | * memblock_add_node() performs such an assignment directly. | |
3e039c5c | 77 | * |
a2974133 MR |
78 | * Once memblock is setup the memory can be allocated using one of the |
79 | * API variants: | |
80 | * | |
6e5af9a8 C |
81 | * * memblock_phys_alloc*() - these functions return the **physical** |
82 | * address of the allocated memory | |
83 | * * memblock_alloc*() - these functions return the **virtual** address | |
84 | * of the allocated memory. | |
a2974133 | 85 | * |
df1758d9 | 86 | * Note, that both API variants use implicit assumptions about allowed |
a2974133 | 87 | * memory ranges and the fallback methods. Consult the documentation |
6e5af9a8 C |
88 | * of memblock_alloc_internal() and memblock_alloc_range_nid() |
89 | * functions for more elaborate description. | |
3e039c5c | 90 | * |
6e5af9a8 C |
91 | * As the system boot progresses, the architecture specific mem_init() |
92 | * function frees all the memory to the buddy page allocator. | |
3e039c5c | 93 | * |
6e5af9a8 | 94 | * Unless an architecture enables %CONFIG_ARCH_KEEP_MEMBLOCK, the |
77649905 DH |
95 | * memblock data structures (except "physmem") will be discarded after the |
96 | * system initialization completes. | |
3e039c5c MR |
97 | */ |
98 | ||
a9ee6cf5 | 99 | #ifndef CONFIG_NUMA |
bda49a81 MR |
100 | struct pglist_data __refdata contig_page_data; |
101 | EXPORT_SYMBOL(contig_page_data); | |
102 | #endif | |
103 | ||
104 | unsigned long max_low_pfn; | |
105 | unsigned long min_low_pfn; | |
106 | unsigned long max_pfn; | |
107 | unsigned long long max_possible_pfn; | |
108 | ||
450d0e74 | 109 | static struct memblock_region memblock_memory_init_regions[INIT_MEMBLOCK_MEMORY_REGIONS] __initdata_memblock; |
8a5b403d | 110 | static struct memblock_region memblock_reserved_init_regions[INIT_MEMBLOCK_RESERVED_REGIONS] __initdata_memblock; |
70210ed9 | 111 | #ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP |
77649905 | 112 | static struct memblock_region memblock_physmem_init_regions[INIT_PHYSMEM_REGIONS]; |
70210ed9 | 113 | #endif |
fe091c20 TH |
114 | |
115 | struct memblock memblock __initdata_memblock = { | |
116 | .memory.regions = memblock_memory_init_regions, | |
117 | .memory.cnt = 1, /* empty dummy entry */ | |
450d0e74 | 118 | .memory.max = INIT_MEMBLOCK_MEMORY_REGIONS, |
0262d9c8 | 119 | .memory.name = "memory", |
fe091c20 TH |
120 | |
121 | .reserved.regions = memblock_reserved_init_regions, | |
122 | .reserved.cnt = 1, /* empty dummy entry */ | |
8a5b403d | 123 | .reserved.max = INIT_MEMBLOCK_RESERVED_REGIONS, |
0262d9c8 | 124 | .reserved.name = "reserved", |
fe091c20 | 125 | |
79442ed1 | 126 | .bottom_up = false, |
fe091c20 TH |
127 | .current_limit = MEMBLOCK_ALLOC_ANYWHERE, |
128 | }; | |
95f72d1e | 129 | |
77649905 DH |
130 | #ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP |
131 | struct memblock_type physmem = { | |
132 | .regions = memblock_physmem_init_regions, | |
133 | .cnt = 1, /* empty dummy entry */ | |
134 | .max = INIT_PHYSMEM_REGIONS, | |
135 | .name = "physmem", | |
136 | }; | |
137 | #endif | |
138 | ||
9f3d5eaa MR |
139 | /* |
140 | * keep a pointer to &memblock.memory in the text section to use it in | |
141 | * __next_mem_range() and its helpers. | |
142 | * For architectures that do not keep memblock data after init, this | |
143 | * pointer will be reset to NULL at memblock_discard() | |
144 | */ | |
145 | static __refdata struct memblock_type *memblock_memory = &memblock.memory; | |
146 | ||
cd991db8 MR |
147 | #define for_each_memblock_type(i, memblock_type, rgn) \ |
148 | for (i = 0, rgn = &memblock_type->regions[0]; \ | |
149 | i < memblock_type->cnt; \ | |
150 | i++, rgn = &memblock_type->regions[i]) | |
151 | ||
87c55870 MR |
152 | #define memblock_dbg(fmt, ...) \ |
153 | do { \ | |
154 | if (memblock_debug) \ | |
155 | pr_info(fmt, ##__VA_ARGS__); \ | |
156 | } while (0) | |
157 | ||
158 | static int memblock_debug __initdata_memblock; | |
a3f5bafc | 159 | static bool system_has_some_mirror __initdata_memblock = false; |
1aadc056 | 160 | static int memblock_can_resize __initdata_memblock; |
181eb394 GS |
161 | static int memblock_memory_in_slab __initdata_memblock = 0; |
162 | static int memblock_reserved_in_slab __initdata_memblock = 0; | |
95f72d1e | 163 | |
c366ea89 | 164 | static enum memblock_flags __init_memblock choose_memblock_flags(void) |
a3f5bafc TL |
165 | { |
166 | return system_has_some_mirror ? MEMBLOCK_MIRROR : MEMBLOCK_NONE; | |
167 | } | |
168 | ||
eb18f1b5 TH |
169 | /* adjust *@size so that (@base + *@size) doesn't overflow, return new size */ |
170 | static inline phys_addr_t memblock_cap_size(phys_addr_t base, phys_addr_t *size) | |
171 | { | |
1c4bc43d | 172 | return *size = min(*size, PHYS_ADDR_MAX - base); |
eb18f1b5 TH |
173 | } |
174 | ||
6ed311b2 BH |
175 | /* |
176 | * Address comparison utilities | |
177 | */ | |
10d06439 | 178 | static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1, |
2898cc4c | 179 | phys_addr_t base2, phys_addr_t size2) |
95f72d1e YL |
180 | { |
181 | return ((base1 < (base2 + size2)) && (base2 < (base1 + size1))); | |
182 | } | |
183 | ||
95cf82ec | 184 | bool __init_memblock memblock_overlaps_region(struct memblock_type *type, |
2d7d3eb2 | 185 | phys_addr_t base, phys_addr_t size) |
6ed311b2 BH |
186 | { |
187 | unsigned long i; | |
188 | ||
023accf5 MR |
189 | memblock_cap_size(base, &size); |
190 | ||
f14516fb AK |
191 | for (i = 0; i < type->cnt; i++) |
192 | if (memblock_addrs_overlap(base, size, type->regions[i].base, | |
193 | type->regions[i].size)) | |
6ed311b2 | 194 | break; |
c5c5c9d1 | 195 | return i < type->cnt; |
6ed311b2 BH |
196 | } |
197 | ||
47cec443 | 198 | /** |
79442ed1 TC |
199 | * __memblock_find_range_bottom_up - find free area utility in bottom-up |
200 | * @start: start of candidate range | |
47cec443 MR |
201 | * @end: end of candidate range, can be %MEMBLOCK_ALLOC_ANYWHERE or |
202 | * %MEMBLOCK_ALLOC_ACCESSIBLE | |
79442ed1 TC |
203 | * @size: size of free area to find |
204 | * @align: alignment of free area to find | |
b1154233 | 205 | * @nid: nid of the free area to find, %NUMA_NO_NODE for any node |
fc6daaf9 | 206 | * @flags: pick from blocks based on memory attributes |
79442ed1 TC |
207 | * |
208 | * Utility called from memblock_find_in_range_node(), find free area bottom-up. | |
209 | * | |
47cec443 | 210 | * Return: |
79442ed1 TC |
211 | * Found address on success, 0 on failure. |
212 | */ | |
213 | static phys_addr_t __init_memblock | |
214 | __memblock_find_range_bottom_up(phys_addr_t start, phys_addr_t end, | |
fc6daaf9 | 215 | phys_addr_t size, phys_addr_t align, int nid, |
e1720fee | 216 | enum memblock_flags flags) |
79442ed1 TC |
217 | { |
218 | phys_addr_t this_start, this_end, cand; | |
219 | u64 i; | |
220 | ||
fc6daaf9 | 221 | for_each_free_mem_range(i, nid, flags, &this_start, &this_end, NULL) { |
79442ed1 TC |
222 | this_start = clamp(this_start, start, end); |
223 | this_end = clamp(this_end, start, end); | |
224 | ||
225 | cand = round_up(this_start, align); | |
226 | if (cand < this_end && this_end - cand >= size) | |
227 | return cand; | |
228 | } | |
229 | ||
230 | return 0; | |
231 | } | |
232 | ||
7bd0b0f0 | 233 | /** |
1402899e | 234 | * __memblock_find_range_top_down - find free area utility, in top-down |
7bd0b0f0 | 235 | * @start: start of candidate range |
47cec443 MR |
236 | * @end: end of candidate range, can be %MEMBLOCK_ALLOC_ANYWHERE or |
237 | * %MEMBLOCK_ALLOC_ACCESSIBLE | |
7bd0b0f0 TH |
238 | * @size: size of free area to find |
239 | * @align: alignment of free area to find | |
b1154233 | 240 | * @nid: nid of the free area to find, %NUMA_NO_NODE for any node |
fc6daaf9 | 241 | * @flags: pick from blocks based on memory attributes |
7bd0b0f0 | 242 | * |
1402899e | 243 | * Utility called from memblock_find_in_range_node(), find free area top-down. |
7bd0b0f0 | 244 | * |
47cec443 | 245 | * Return: |
79442ed1 | 246 | * Found address on success, 0 on failure. |
6ed311b2 | 247 | */ |
1402899e TC |
248 | static phys_addr_t __init_memblock |
249 | __memblock_find_range_top_down(phys_addr_t start, phys_addr_t end, | |
fc6daaf9 | 250 | phys_addr_t size, phys_addr_t align, int nid, |
e1720fee | 251 | enum memblock_flags flags) |
f7210e6c TC |
252 | { |
253 | phys_addr_t this_start, this_end, cand; | |
254 | u64 i; | |
255 | ||
fc6daaf9 TL |
256 | for_each_free_mem_range_reverse(i, nid, flags, &this_start, &this_end, |
257 | NULL) { | |
f7210e6c TC |
258 | this_start = clamp(this_start, start, end); |
259 | this_end = clamp(this_end, start, end); | |
260 | ||
261 | if (this_end < size) | |
262 | continue; | |
263 | ||
264 | cand = round_down(this_end - size, align); | |
265 | if (cand >= this_start) | |
266 | return cand; | |
267 | } | |
1402899e | 268 | |
f7210e6c TC |
269 | return 0; |
270 | } | |
6ed311b2 | 271 | |
1402899e TC |
272 | /** |
273 | * memblock_find_in_range_node - find free area in given range and node | |
1402899e TC |
274 | * @size: size of free area to find |
275 | * @align: alignment of free area to find | |
87029ee9 | 276 | * @start: start of candidate range |
47cec443 MR |
277 | * @end: end of candidate range, can be %MEMBLOCK_ALLOC_ANYWHERE or |
278 | * %MEMBLOCK_ALLOC_ACCESSIBLE | |
b1154233 | 279 | * @nid: nid of the free area to find, %NUMA_NO_NODE for any node |
fc6daaf9 | 280 | * @flags: pick from blocks based on memory attributes |
1402899e TC |
281 | * |
282 | * Find @size free area aligned to @align in the specified range and node. | |
283 | * | |
47cec443 | 284 | * Return: |
79442ed1 | 285 | * Found address on success, 0 on failure. |
1402899e | 286 | */ |
c366ea89 | 287 | static phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t size, |
87029ee9 | 288 | phys_addr_t align, phys_addr_t start, |
e1720fee MR |
289 | phys_addr_t end, int nid, |
290 | enum memblock_flags flags) | |
1402899e TC |
291 | { |
292 | /* pump up @end */ | |
fed84c78 | 293 | if (end == MEMBLOCK_ALLOC_ACCESSIBLE || |
c6975d7c | 294 | end == MEMBLOCK_ALLOC_NOLEAKTRACE) |
1402899e TC |
295 | end = memblock.current_limit; |
296 | ||
297 | /* avoid allocating the first page */ | |
298 | start = max_t(phys_addr_t, start, PAGE_SIZE); | |
299 | end = max(start, end); | |
300 | ||
2dcb3964 RG |
301 | if (memblock_bottom_up()) |
302 | return __memblock_find_range_bottom_up(start, end, size, align, | |
303 | nid, flags); | |
304 | else | |
305 | return __memblock_find_range_top_down(start, end, size, align, | |
306 | nid, flags); | |
1402899e TC |
307 | } |
308 | ||
7bd0b0f0 TH |
309 | /** |
310 | * memblock_find_in_range - find free area in given range | |
311 | * @start: start of candidate range | |
47cec443 MR |
312 | * @end: end of candidate range, can be %MEMBLOCK_ALLOC_ANYWHERE or |
313 | * %MEMBLOCK_ALLOC_ACCESSIBLE | |
7bd0b0f0 TH |
314 | * @size: size of free area to find |
315 | * @align: alignment of free area to find | |
316 | * | |
317 | * Find @size free area aligned to @align in the specified range. | |
318 | * | |
47cec443 | 319 | * Return: |
79442ed1 | 320 | * Found address on success, 0 on failure. |
fc769a8e | 321 | */ |
a7259df7 | 322 | static phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start, |
7bd0b0f0 TH |
323 | phys_addr_t end, phys_addr_t size, |
324 | phys_addr_t align) | |
6ed311b2 | 325 | { |
a3f5bafc | 326 | phys_addr_t ret; |
e1720fee | 327 | enum memblock_flags flags = choose_memblock_flags(); |
a3f5bafc TL |
328 | |
329 | again: | |
330 | ret = memblock_find_in_range_node(size, align, start, end, | |
331 | NUMA_NO_NODE, flags); | |
332 | ||
333 | if (!ret && (flags & MEMBLOCK_MIRROR)) { | |
14d9a675 | 334 | pr_warn_ratelimited("Could not allocate %pap bytes of mirrored memory\n", |
a3f5bafc TL |
335 | &size); |
336 | flags &= ~MEMBLOCK_MIRROR; | |
337 | goto again; | |
338 | } | |
339 | ||
340 | return ret; | |
6ed311b2 BH |
341 | } |
342 | ||
10d06439 | 343 | static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r) |
95f72d1e | 344 | { |
1440c4e2 | 345 | type->total_size -= type->regions[r].size; |
7c0caeb8 TH |
346 | memmove(&type->regions[r], &type->regions[r + 1], |
347 | (type->cnt - (r + 1)) * sizeof(type->regions[r])); | |
e3239ff9 | 348 | type->cnt--; |
95f72d1e | 349 | |
8f7a6605 BH |
350 | /* Special case for empty arrays */ |
351 | if (type->cnt == 0) { | |
1440c4e2 | 352 | WARN_ON(type->total_size != 0); |
8f7a6605 BH |
353 | type->cnt = 1; |
354 | type->regions[0].base = 0; | |
355 | type->regions[0].size = 0; | |
66a20757 | 356 | type->regions[0].flags = 0; |
7c0caeb8 | 357 | memblock_set_region_node(&type->regions[0], MAX_NUMNODES); |
8f7a6605 | 358 | } |
95f72d1e YL |
359 | } |
360 | ||
350e88ba | 361 | #ifndef CONFIG_ARCH_KEEP_MEMBLOCK |
3010f876 | 362 | /** |
47cec443 | 363 | * memblock_discard - discard memory and reserved arrays if they were allocated |
3010f876 PT |
364 | */ |
365 | void __init memblock_discard(void) | |
5e270e25 | 366 | { |
3010f876 | 367 | phys_addr_t addr, size; |
5e270e25 | 368 | |
3010f876 PT |
369 | if (memblock.reserved.regions != memblock_reserved_init_regions) { |
370 | addr = __pa(memblock.reserved.regions); | |
371 | size = PAGE_ALIGN(sizeof(struct memblock_region) * | |
372 | memblock.reserved.max); | |
c94afc46 ML |
373 | if (memblock_reserved_in_slab) |
374 | kfree(memblock.reserved.regions); | |
375 | else | |
376 | memblock_free_late(addr, size); | |
3010f876 | 377 | } |
5e270e25 | 378 | |
91b540f9 | 379 | if (memblock.memory.regions != memblock_memory_init_regions) { |
3010f876 PT |
380 | addr = __pa(memblock.memory.regions); |
381 | size = PAGE_ALIGN(sizeof(struct memblock_region) * | |
382 | memblock.memory.max); | |
c94afc46 ML |
383 | if (memblock_memory_in_slab) |
384 | kfree(memblock.memory.regions); | |
385 | else | |
386 | memblock_free_late(addr, size); | |
3010f876 | 387 | } |
9f3d5eaa MR |
388 | |
389 | memblock_memory = NULL; | |
5e270e25 | 390 | } |
5e270e25 PH |
391 | #endif |
392 | ||
48c3b583 GP |
393 | /** |
394 | * memblock_double_array - double the size of the memblock regions array | |
395 | * @type: memblock type of the regions array being doubled | |
396 | * @new_area_start: starting address of memory range to avoid overlap with | |
397 | * @new_area_size: size of memory range to avoid overlap with | |
398 | * | |
399 | * Double the size of the @type regions array. If memblock is being used to | |
400 | * allocate memory for a new reserved regions array and there is a previously | |
47cec443 | 401 | * allocated memory range [@new_area_start, @new_area_start + @new_area_size] |
48c3b583 GP |
402 | * waiting to be reserved, ensure the memory used by the new array does |
403 | * not overlap. | |
404 | * | |
47cec443 | 405 | * Return: |
48c3b583 GP |
406 | * 0 on success, -1 on failure. |
407 | */ | |
408 | static int __init_memblock memblock_double_array(struct memblock_type *type, | |
409 | phys_addr_t new_area_start, | |
410 | phys_addr_t new_area_size) | |
142b45a7 BH |
411 | { |
412 | struct memblock_region *new_array, *old_array; | |
29f67386 | 413 | phys_addr_t old_alloc_size, new_alloc_size; |
a36aab89 | 414 | phys_addr_t old_size, new_size, addr, new_end; |
142b45a7 | 415 | int use_slab = slab_is_available(); |
181eb394 | 416 | int *in_slab; |
142b45a7 BH |
417 | |
418 | /* We don't allow resizing until we know about the reserved regions | |
419 | * of memory that aren't suitable for allocation | |
420 | */ | |
421 | if (!memblock_can_resize) | |
422 | return -1; | |
423 | ||
142b45a7 BH |
424 | /* Calculate new doubled size */ |
425 | old_size = type->max * sizeof(struct memblock_region); | |
426 | new_size = old_size << 1; | |
29f67386 YL |
427 | /* |
428 | * We need to allocated new one align to PAGE_SIZE, | |
429 | * so we can free them completely later. | |
430 | */ | |
431 | old_alloc_size = PAGE_ALIGN(old_size); | |
432 | new_alloc_size = PAGE_ALIGN(new_size); | |
142b45a7 | 433 | |
181eb394 GS |
434 | /* Retrieve the slab flag */ |
435 | if (type == &memblock.memory) | |
436 | in_slab = &memblock_memory_in_slab; | |
437 | else | |
438 | in_slab = &memblock_reserved_in_slab; | |
439 | ||
a2974133 | 440 | /* Try to find some space for it */ |
142b45a7 BH |
441 | if (use_slab) { |
442 | new_array = kmalloc(new_size, GFP_KERNEL); | |
1f5026a7 | 443 | addr = new_array ? __pa(new_array) : 0; |
4e2f0775 | 444 | } else { |
48c3b583 GP |
445 | /* only exclude range when trying to double reserved.regions */ |
446 | if (type != &memblock.reserved) | |
447 | new_area_start = new_area_size = 0; | |
448 | ||
449 | addr = memblock_find_in_range(new_area_start + new_area_size, | |
450 | memblock.current_limit, | |
29f67386 | 451 | new_alloc_size, PAGE_SIZE); |
48c3b583 GP |
452 | if (!addr && new_area_size) |
453 | addr = memblock_find_in_range(0, | |
fd07383b AM |
454 | min(new_area_start, memblock.current_limit), |
455 | new_alloc_size, PAGE_SIZE); | |
48c3b583 | 456 | |
15674868 | 457 | new_array = addr ? __va(addr) : NULL; |
4e2f0775 | 458 | } |
1f5026a7 | 459 | if (!addr) { |
142b45a7 | 460 | pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n", |
0262d9c8 | 461 | type->name, type->max, type->max * 2); |
142b45a7 BH |
462 | return -1; |
463 | } | |
142b45a7 | 464 | |
a36aab89 MR |
465 | new_end = addr + new_size - 1; |
466 | memblock_dbg("memblock: %s is doubled to %ld at [%pa-%pa]", | |
467 | type->name, type->max * 2, &addr, &new_end); | |
ea9e4376 | 468 | |
fd07383b AM |
469 | /* |
470 | * Found space, we now need to move the array over before we add the | |
471 | * reserved region since it may be our reserved array itself that is | |
472 | * full. | |
142b45a7 BH |
473 | */ |
474 | memcpy(new_array, type->regions, old_size); | |
475 | memset(new_array + type->max, 0, old_size); | |
476 | old_array = type->regions; | |
477 | type->regions = new_array; | |
478 | type->max <<= 1; | |
479 | ||
fd07383b | 480 | /* Free old array. We needn't free it if the array is the static one */ |
181eb394 GS |
481 | if (*in_slab) |
482 | kfree(old_array); | |
483 | else if (old_array != memblock_memory_init_regions && | |
484 | old_array != memblock_reserved_init_regions) | |
4421cca0 | 485 | memblock_free(old_array, old_alloc_size); |
142b45a7 | 486 | |
fd07383b AM |
487 | /* |
488 | * Reserve the new array if that comes from the memblock. Otherwise, we | |
489 | * needn't do it | |
181eb394 GS |
490 | */ |
491 | if (!use_slab) | |
29f67386 | 492 | BUG_ON(memblock_reserve(addr, new_alloc_size)); |
181eb394 GS |
493 | |
494 | /* Update slab flag */ | |
495 | *in_slab = use_slab; | |
496 | ||
142b45a7 BH |
497 | return 0; |
498 | } | |
499 | ||
784656f9 TH |
500 | /** |
501 | * memblock_merge_regions - merge neighboring compatible regions | |
502 | * @type: memblock type to scan | |
503 | * | |
504 | * Scan @type and merge neighboring compatible regions. | |
505 | */ | |
506 | static void __init_memblock memblock_merge_regions(struct memblock_type *type) | |
95f72d1e | 507 | { |
784656f9 | 508 | int i = 0; |
95f72d1e | 509 | |
784656f9 TH |
510 | /* cnt never goes below 1 */ |
511 | while (i < type->cnt - 1) { | |
512 | struct memblock_region *this = &type->regions[i]; | |
513 | struct memblock_region *next = &type->regions[i + 1]; | |
95f72d1e | 514 | |
7c0caeb8 TH |
515 | if (this->base + this->size != next->base || |
516 | memblock_get_region_node(this) != | |
66a20757 TC |
517 | memblock_get_region_node(next) || |
518 | this->flags != next->flags) { | |
784656f9 TH |
519 | BUG_ON(this->base + this->size > next->base); |
520 | i++; | |
521 | continue; | |
8f7a6605 BH |
522 | } |
523 | ||
784656f9 | 524 | this->size += next->size; |
c0232ae8 LF |
525 | /* move forward from next + 1, index of which is i + 2 */ |
526 | memmove(next, next + 1, (type->cnt - (i + 2)) * sizeof(*next)); | |
784656f9 | 527 | type->cnt--; |
95f72d1e | 528 | } |
784656f9 | 529 | } |
95f72d1e | 530 | |
784656f9 TH |
531 | /** |
532 | * memblock_insert_region - insert new memblock region | |
209ff86d TC |
533 | * @type: memblock type to insert into |
534 | * @idx: index for the insertion point | |
535 | * @base: base address of the new region | |
536 | * @size: size of the new region | |
537 | * @nid: node id of the new region | |
66a20757 | 538 | * @flags: flags of the new region |
784656f9 | 539 | * |
47cec443 | 540 | * Insert new memblock region [@base, @base + @size) into @type at @idx. |
412d0008 | 541 | * @type must already have extra room to accommodate the new region. |
784656f9 TH |
542 | */ |
543 | static void __init_memblock memblock_insert_region(struct memblock_type *type, | |
544 | int idx, phys_addr_t base, | |
66a20757 | 545 | phys_addr_t size, |
e1720fee MR |
546 | int nid, |
547 | enum memblock_flags flags) | |
784656f9 TH |
548 | { |
549 | struct memblock_region *rgn = &type->regions[idx]; | |
550 | ||
551 | BUG_ON(type->cnt >= type->max); | |
552 | memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn)); | |
553 | rgn->base = base; | |
554 | rgn->size = size; | |
66a20757 | 555 | rgn->flags = flags; |
7c0caeb8 | 556 | memblock_set_region_node(rgn, nid); |
784656f9 | 557 | type->cnt++; |
1440c4e2 | 558 | type->total_size += size; |
784656f9 TH |
559 | } |
560 | ||
561 | /** | |
f1af9d3a | 562 | * memblock_add_range - add new memblock region |
784656f9 TH |
563 | * @type: memblock type to add new region into |
564 | * @base: base address of the new region | |
565 | * @size: size of the new region | |
7fb0bc3f | 566 | * @nid: nid of the new region |
66a20757 | 567 | * @flags: flags of the new region |
784656f9 | 568 | * |
47cec443 | 569 | * Add new memblock region [@base, @base + @size) into @type. The new region |
784656f9 TH |
570 | * is allowed to overlap with existing ones - overlaps don't affect already |
571 | * existing regions. @type is guaranteed to be minimal (all neighbouring | |
572 | * compatible regions are merged) after the addition. | |
573 | * | |
47cec443 | 574 | * Return: |
784656f9 TH |
575 | * 0 on success, -errno on failure. |
576 | */ | |
02634a44 | 577 | static int __init_memblock memblock_add_range(struct memblock_type *type, |
66a20757 | 578 | phys_addr_t base, phys_addr_t size, |
e1720fee | 579 | int nid, enum memblock_flags flags) |
784656f9 TH |
580 | { |
581 | bool insert = false; | |
eb18f1b5 TH |
582 | phys_addr_t obase = base; |
583 | phys_addr_t end = base + memblock_cap_size(base, &size); | |
8c9c1701 AK |
584 | int idx, nr_new; |
585 | struct memblock_region *rgn; | |
784656f9 | 586 | |
b3dc627c TH |
587 | if (!size) |
588 | return 0; | |
589 | ||
784656f9 TH |
590 | /* special case for empty array */ |
591 | if (type->regions[0].size == 0) { | |
1440c4e2 | 592 | WARN_ON(type->cnt != 1 || type->total_size); |
8f7a6605 BH |
593 | type->regions[0].base = base; |
594 | type->regions[0].size = size; | |
66a20757 | 595 | type->regions[0].flags = flags; |
7fb0bc3f | 596 | memblock_set_region_node(&type->regions[0], nid); |
1440c4e2 | 597 | type->total_size = size; |
8f7a6605 | 598 | return 0; |
95f72d1e | 599 | } |
28e1a8f4 JT |
600 | |
601 | /* | |
602 | * The worst case is when new range overlaps all existing regions, | |
603 | * then we'll need type->cnt + 1 empty regions in @type. So if | |
604 | * type->cnt * 2 + 1 is less than type->max, we know | |
605 | * that there is enough empty regions in @type, and we can insert | |
606 | * regions directly. | |
607 | */ | |
608 | if (type->cnt * 2 + 1 < type->max) | |
609 | insert = true; | |
610 | ||
784656f9 TH |
611 | repeat: |
612 | /* | |
613 | * The following is executed twice. Once with %false @insert and | |
614 | * then with %true. The first counts the number of regions needed | |
412d0008 | 615 | * to accommodate the new area. The second actually inserts them. |
142b45a7 | 616 | */ |
784656f9 TH |
617 | base = obase; |
618 | nr_new = 0; | |
95f72d1e | 619 | |
66e8b438 | 620 | for_each_memblock_type(idx, type, rgn) { |
784656f9 TH |
621 | phys_addr_t rbase = rgn->base; |
622 | phys_addr_t rend = rbase + rgn->size; | |
623 | ||
624 | if (rbase >= end) | |
95f72d1e | 625 | break; |
784656f9 TH |
626 | if (rend <= base) |
627 | continue; | |
628 | /* | |
629 | * @rgn overlaps. If it separates the lower part of new | |
630 | * area, insert that portion. | |
631 | */ | |
632 | if (rbase > base) { | |
a9ee6cf5 | 633 | #ifdef CONFIG_NUMA |
c0a29498 WY |
634 | WARN_ON(nid != memblock_get_region_node(rgn)); |
635 | #endif | |
4fcab5f4 | 636 | WARN_ON(flags != rgn->flags); |
784656f9 TH |
637 | nr_new++; |
638 | if (insert) | |
8c9c1701 | 639 | memblock_insert_region(type, idx++, base, |
66a20757 TC |
640 | rbase - base, nid, |
641 | flags); | |
95f72d1e | 642 | } |
784656f9 TH |
643 | /* area below @rend is dealt with, forget about it */ |
644 | base = min(rend, end); | |
95f72d1e | 645 | } |
784656f9 TH |
646 | |
647 | /* insert the remaining portion */ | |
648 | if (base < end) { | |
649 | nr_new++; | |
650 | if (insert) | |
8c9c1701 | 651 | memblock_insert_region(type, idx, base, end - base, |
66a20757 | 652 | nid, flags); |
95f72d1e | 653 | } |
95f72d1e | 654 | |
ef3cc4db | 655 | if (!nr_new) |
656 | return 0; | |
657 | ||
784656f9 TH |
658 | /* |
659 | * If this was the first round, resize array and repeat for actual | |
660 | * insertions; otherwise, merge and return. | |
142b45a7 | 661 | */ |
784656f9 TH |
662 | if (!insert) { |
663 | while (type->cnt + nr_new > type->max) | |
48c3b583 | 664 | if (memblock_double_array(type, obase, size) < 0) |
784656f9 TH |
665 | return -ENOMEM; |
666 | insert = true; | |
667 | goto repeat; | |
668 | } else { | |
669 | memblock_merge_regions(type); | |
670 | return 0; | |
142b45a7 | 671 | } |
95f72d1e YL |
672 | } |
673 | ||
48a833cc MR |
674 | /** |
675 | * memblock_add_node - add new memblock region within a NUMA node | |
676 | * @base: base address of the new region | |
677 | * @size: size of the new region | |
678 | * @nid: nid of the new region | |
952eea9b | 679 | * @flags: flags of the new region |
48a833cc MR |
680 | * |
681 | * Add new memblock region [@base, @base + @size) to the "memory" | |
682 | * type. See memblock_add_range() description for mode details | |
683 | * | |
684 | * Return: | |
685 | * 0 on success, -errno on failure. | |
686 | */ | |
7fb0bc3f | 687 | int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size, |
952eea9b | 688 | int nid, enum memblock_flags flags) |
7fb0bc3f | 689 | { |
00974b9a GU |
690 | phys_addr_t end = base + size - 1; |
691 | ||
952eea9b DH |
692 | memblock_dbg("%s: [%pa-%pa] nid=%d flags=%x %pS\n", __func__, |
693 | &base, &end, nid, flags, (void *)_RET_IP_); | |
00974b9a | 694 | |
952eea9b | 695 | return memblock_add_range(&memblock.memory, base, size, nid, flags); |
7fb0bc3f TH |
696 | } |
697 | ||
48a833cc MR |
698 | /** |
699 | * memblock_add - add new memblock region | |
700 | * @base: base address of the new region | |
701 | * @size: size of the new region | |
702 | * | |
703 | * Add new memblock region [@base, @base + @size) to the "memory" | |
704 | * type. See memblock_add_range() description for mode details | |
705 | * | |
706 | * Return: | |
707 | * 0 on success, -errno on failure. | |
708 | */ | |
f705ac4b | 709 | int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size) |
6a4055bc | 710 | { |
5d63f81c MC |
711 | phys_addr_t end = base + size - 1; |
712 | ||
a090d711 | 713 | memblock_dbg("%s: [%pa-%pa] %pS\n", __func__, |
5d63f81c | 714 | &base, &end, (void *)_RET_IP_); |
6a4055bc | 715 | |
f705ac4b | 716 | return memblock_add_range(&memblock.memory, base, size, MAX_NUMNODES, 0); |
95f72d1e YL |
717 | } |
718 | ||
6a9ceb31 TH |
719 | /** |
720 | * memblock_isolate_range - isolate given range into disjoint memblocks | |
721 | * @type: memblock type to isolate range for | |
722 | * @base: base of range to isolate | |
723 | * @size: size of range to isolate | |
724 | * @start_rgn: out parameter for the start of isolated region | |
725 | * @end_rgn: out parameter for the end of isolated region | |
726 | * | |
727 | * Walk @type and ensure that regions don't cross the boundaries defined by | |
47cec443 | 728 | * [@base, @base + @size). Crossing regions are split at the boundaries, |
6a9ceb31 TH |
729 | * which may create at most two more regions. The index of the first |
730 | * region inside the range is returned in *@start_rgn and end in *@end_rgn. | |
731 | * | |
47cec443 | 732 | * Return: |
6a9ceb31 TH |
733 | * 0 on success, -errno on failure. |
734 | */ | |
735 | static int __init_memblock memblock_isolate_range(struct memblock_type *type, | |
736 | phys_addr_t base, phys_addr_t size, | |
737 | int *start_rgn, int *end_rgn) | |
738 | { | |
eb18f1b5 | 739 | phys_addr_t end = base + memblock_cap_size(base, &size); |
8c9c1701 AK |
740 | int idx; |
741 | struct memblock_region *rgn; | |
6a9ceb31 TH |
742 | |
743 | *start_rgn = *end_rgn = 0; | |
744 | ||
b3dc627c TH |
745 | if (!size) |
746 | return 0; | |
747 | ||
6a9ceb31 TH |
748 | /* we'll create at most two more regions */ |
749 | while (type->cnt + 2 > type->max) | |
48c3b583 | 750 | if (memblock_double_array(type, base, size) < 0) |
6a9ceb31 TH |
751 | return -ENOMEM; |
752 | ||
66e8b438 | 753 | for_each_memblock_type(idx, type, rgn) { |
6a9ceb31 TH |
754 | phys_addr_t rbase = rgn->base; |
755 | phys_addr_t rend = rbase + rgn->size; | |
756 | ||
757 | if (rbase >= end) | |
758 | break; | |
759 | if (rend <= base) | |
760 | continue; | |
761 | ||
762 | if (rbase < base) { | |
763 | /* | |
764 | * @rgn intersects from below. Split and continue | |
765 | * to process the next region - the new top half. | |
766 | */ | |
767 | rgn->base = base; | |
1440c4e2 TH |
768 | rgn->size -= base - rbase; |
769 | type->total_size -= base - rbase; | |
8c9c1701 | 770 | memblock_insert_region(type, idx, rbase, base - rbase, |
66a20757 TC |
771 | memblock_get_region_node(rgn), |
772 | rgn->flags); | |
6a9ceb31 TH |
773 | } else if (rend > end) { |
774 | /* | |
775 | * @rgn intersects from above. Split and redo the | |
776 | * current region - the new bottom half. | |
777 | */ | |
778 | rgn->base = end; | |
1440c4e2 TH |
779 | rgn->size -= end - rbase; |
780 | type->total_size -= end - rbase; | |
8c9c1701 | 781 | memblock_insert_region(type, idx--, rbase, end - rbase, |
66a20757 TC |
782 | memblock_get_region_node(rgn), |
783 | rgn->flags); | |
6a9ceb31 TH |
784 | } else { |
785 | /* @rgn is fully contained, record it */ | |
786 | if (!*end_rgn) | |
8c9c1701 AK |
787 | *start_rgn = idx; |
788 | *end_rgn = idx + 1; | |
6a9ceb31 TH |
789 | } |
790 | } | |
791 | ||
792 | return 0; | |
793 | } | |
6a9ceb31 | 794 | |
35bd16a2 | 795 | static int __init_memblock memblock_remove_range(struct memblock_type *type, |
f1af9d3a | 796 | phys_addr_t base, phys_addr_t size) |
95f72d1e | 797 | { |
71936180 TH |
798 | int start_rgn, end_rgn; |
799 | int i, ret; | |
95f72d1e | 800 | |
71936180 TH |
801 | ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn); |
802 | if (ret) | |
803 | return ret; | |
95f72d1e | 804 | |
71936180 TH |
805 | for (i = end_rgn - 1; i >= start_rgn; i--) |
806 | memblock_remove_region(type, i); | |
8f7a6605 | 807 | return 0; |
95f72d1e YL |
808 | } |
809 | ||
581adcbe | 810 | int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size) |
95f72d1e | 811 | { |
25cf23d7 MK |
812 | phys_addr_t end = base + size - 1; |
813 | ||
a090d711 | 814 | memblock_dbg("%s: [%pa-%pa] %pS\n", __func__, |
25cf23d7 MK |
815 | &base, &end, (void *)_RET_IP_); |
816 | ||
f1af9d3a | 817 | return memblock_remove_range(&memblock.memory, base, size); |
95f72d1e YL |
818 | } |
819 | ||
77e02cf5 | 820 | /** |
4421cca0 | 821 | * memblock_free - free boot memory allocation |
77e02cf5 LT |
822 | * @ptr: starting address of the boot memory allocation |
823 | * @size: size of the boot memory block in bytes | |
824 | * | |
825 | * Free boot memory block previously allocated by memblock_alloc_xx() API. | |
826 | * The freeing memory will not be released to the buddy allocator. | |
827 | */ | |
4421cca0 | 828 | void __init_memblock memblock_free(void *ptr, size_t size) |
77e02cf5 LT |
829 | { |
830 | if (ptr) | |
3ecc6834 | 831 | memblock_phys_free(__pa(ptr), size); |
77e02cf5 LT |
832 | } |
833 | ||
4d72868c | 834 | /** |
3ecc6834 | 835 | * memblock_phys_free - free boot memory block |
4d72868c MR |
836 | * @base: phys starting address of the boot memory block |
837 | * @size: size of the boot memory block in bytes | |
838 | * | |
839 | * Free boot memory block previously allocated by memblock_alloc_xx() API. | |
840 | * The freeing memory will not be released to the buddy allocator. | |
841 | */ | |
3ecc6834 | 842 | int __init_memblock memblock_phys_free(phys_addr_t base, phys_addr_t size) |
95f72d1e | 843 | { |
5d63f81c MC |
844 | phys_addr_t end = base + size - 1; |
845 | ||
a090d711 | 846 | memblock_dbg("%s: [%pa-%pa] %pS\n", __func__, |
5d63f81c | 847 | &base, &end, (void *)_RET_IP_); |
24aa0788 | 848 | |
9099daed | 849 | kmemleak_free_part_phys(base, size); |
f1af9d3a | 850 | return memblock_remove_range(&memblock.reserved, base, size); |
95f72d1e YL |
851 | } |
852 | ||
f705ac4b | 853 | int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size) |
95f72d1e | 854 | { |
5d63f81c MC |
855 | phys_addr_t end = base + size - 1; |
856 | ||
a090d711 | 857 | memblock_dbg("%s: [%pa-%pa] %pS\n", __func__, |
5d63f81c | 858 | &base, &end, (void *)_RET_IP_); |
95f72d1e | 859 | |
f705ac4b | 860 | return memblock_add_range(&memblock.reserved, base, size, MAX_NUMNODES, 0); |
95f72d1e YL |
861 | } |
862 | ||
02634a44 AK |
863 | #ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP |
864 | int __init_memblock memblock_physmem_add(phys_addr_t base, phys_addr_t size) | |
865 | { | |
866 | phys_addr_t end = base + size - 1; | |
867 | ||
868 | memblock_dbg("%s: [%pa-%pa] %pS\n", __func__, | |
869 | &base, &end, (void *)_RET_IP_); | |
870 | ||
77649905 | 871 | return memblock_add_range(&physmem, base, size, MAX_NUMNODES, 0); |
02634a44 AK |
872 | } |
873 | #endif | |
874 | ||
66b16edf | 875 | /** |
47cec443 MR |
876 | * memblock_setclr_flag - set or clear flag for a memory region |
877 | * @base: base address of the region | |
878 | * @size: size of the region | |
879 | * @set: set or clear the flag | |
8958b249 | 880 | * @flag: the flag to update |
66b16edf | 881 | * |
4308ce17 | 882 | * This function isolates region [@base, @base + @size), and sets/clears flag |
66b16edf | 883 | * |
47cec443 | 884 | * Return: 0 on success, -errno on failure. |
66b16edf | 885 | */ |
4308ce17 TL |
886 | static int __init_memblock memblock_setclr_flag(phys_addr_t base, |
887 | phys_addr_t size, int set, int flag) | |
66b16edf TC |
888 | { |
889 | struct memblock_type *type = &memblock.memory; | |
890 | int i, ret, start_rgn, end_rgn; | |
891 | ||
892 | ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn); | |
893 | if (ret) | |
894 | return ret; | |
895 | ||
fe145124 MR |
896 | for (i = start_rgn; i < end_rgn; i++) { |
897 | struct memblock_region *r = &type->regions[i]; | |
898 | ||
4308ce17 | 899 | if (set) |
fe145124 | 900 | r->flags |= flag; |
4308ce17 | 901 | else |
fe145124 MR |
902 | r->flags &= ~flag; |
903 | } | |
66b16edf TC |
904 | |
905 | memblock_merge_regions(type); | |
906 | return 0; | |
907 | } | |
908 | ||
909 | /** | |
4308ce17 | 910 | * memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG. |
66b16edf TC |
911 | * @base: the base phys addr of the region |
912 | * @size: the size of the region | |
913 | * | |
47cec443 | 914 | * Return: 0 on success, -errno on failure. |
4308ce17 TL |
915 | */ |
916 | int __init_memblock memblock_mark_hotplug(phys_addr_t base, phys_addr_t size) | |
917 | { | |
918 | return memblock_setclr_flag(base, size, 1, MEMBLOCK_HOTPLUG); | |
919 | } | |
920 | ||
921 | /** | |
922 | * memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region. | |
923 | * @base: the base phys addr of the region | |
924 | * @size: the size of the region | |
66b16edf | 925 | * |
47cec443 | 926 | * Return: 0 on success, -errno on failure. |
66b16edf TC |
927 | */ |
928 | int __init_memblock memblock_clear_hotplug(phys_addr_t base, phys_addr_t size) | |
929 | { | |
4308ce17 | 930 | return memblock_setclr_flag(base, size, 0, MEMBLOCK_HOTPLUG); |
66b16edf TC |
931 | } |
932 | ||
a3f5bafc TL |
933 | /** |
934 | * memblock_mark_mirror - Mark mirrored memory with flag MEMBLOCK_MIRROR. | |
935 | * @base: the base phys addr of the region | |
936 | * @size: the size of the region | |
937 | * | |
47cec443 | 938 | * Return: 0 on success, -errno on failure. |
a3f5bafc TL |
939 | */ |
940 | int __init_memblock memblock_mark_mirror(phys_addr_t base, phys_addr_t size) | |
941 | { | |
902c2d91 MW |
942 | if (!mirrored_kernelcore) |
943 | return 0; | |
944 | ||
a3f5bafc TL |
945 | system_has_some_mirror = true; |
946 | ||
947 | return memblock_setclr_flag(base, size, 1, MEMBLOCK_MIRROR); | |
948 | } | |
949 | ||
bf3d3cc5 AB |
950 | /** |
951 | * memblock_mark_nomap - Mark a memory region with flag MEMBLOCK_NOMAP. | |
952 | * @base: the base phys addr of the region | |
953 | * @size: the size of the region | |
954 | * | |
9092d4f7 MR |
955 | * The memory regions marked with %MEMBLOCK_NOMAP will not be added to the |
956 | * direct mapping of the physical memory. These regions will still be | |
957 | * covered by the memory map. The struct page representing NOMAP memory | |
958 | * frames in the memory map will be PageReserved() | |
959 | * | |
658aafc8 MR |
960 | * Note: if the memory being marked %MEMBLOCK_NOMAP was allocated from |
961 | * memblock, the caller must inform kmemleak to ignore that memory | |
962 | * | |
47cec443 | 963 | * Return: 0 on success, -errno on failure. |
bf3d3cc5 AB |
964 | */ |
965 | int __init_memblock memblock_mark_nomap(phys_addr_t base, phys_addr_t size) | |
966 | { | |
6c9a5455 | 967 | return memblock_setclr_flag(base, size, 1, MEMBLOCK_NOMAP); |
bf3d3cc5 | 968 | } |
a3f5bafc | 969 | |
4c546b8a AT |
970 | /** |
971 | * memblock_clear_nomap - Clear flag MEMBLOCK_NOMAP for a specified region. | |
972 | * @base: the base phys addr of the region | |
973 | * @size: the size of the region | |
974 | * | |
47cec443 | 975 | * Return: 0 on success, -errno on failure. |
4c546b8a AT |
976 | */ |
977 | int __init_memblock memblock_clear_nomap(phys_addr_t base, phys_addr_t size) | |
978 | { | |
979 | return memblock_setclr_flag(base, size, 0, MEMBLOCK_NOMAP); | |
980 | } | |
981 | ||
9f3d5eaa MR |
982 | static bool should_skip_region(struct memblock_type *type, |
983 | struct memblock_region *m, | |
984 | int nid, int flags) | |
c9a688a3 MR |
985 | { |
986 | int m_nid = memblock_get_region_node(m); | |
987 | ||
9f3d5eaa MR |
988 | /* we never skip regions when iterating memblock.reserved or physmem */ |
989 | if (type != memblock_memory) | |
990 | return false; | |
991 | ||
c9a688a3 MR |
992 | /* only memory regions are associated with nodes, check it */ |
993 | if (nid != NUMA_NO_NODE && nid != m_nid) | |
994 | return true; | |
995 | ||
996 | /* skip hotpluggable memory regions if needed */ | |
79e482e9 MR |
997 | if (movable_node_is_enabled() && memblock_is_hotpluggable(m) && |
998 | !(flags & MEMBLOCK_HOTPLUG)) | |
c9a688a3 MR |
999 | return true; |
1000 | ||
1001 | /* if we want mirror memory skip non-mirror memory regions */ | |
1002 | if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m)) | |
1003 | return true; | |
1004 | ||
1005 | /* skip nomap memory unless we were asked for it explicitly */ | |
1006 | if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m)) | |
1007 | return true; | |
1008 | ||
f7892d8e DH |
1009 | /* skip driver-managed memory unless we were asked for it explicitly */ |
1010 | if (!(flags & MEMBLOCK_DRIVER_MANAGED) && memblock_is_driver_managed(m)) | |
1011 | return true; | |
1012 | ||
c9a688a3 MR |
1013 | return false; |
1014 | } | |
1015 | ||
35fd0808 | 1016 | /** |
a2974133 | 1017 | * __next_mem_range - next function for for_each_free_mem_range() etc. |
35fd0808 | 1018 | * @idx: pointer to u64 loop variable |
b1154233 | 1019 | * @nid: node selector, %NUMA_NO_NODE for all nodes |
fc6daaf9 | 1020 | * @flags: pick from blocks based on memory attributes |
f1af9d3a PH |
1021 | * @type_a: pointer to memblock_type from where the range is taken |
1022 | * @type_b: pointer to memblock_type which excludes memory from being taken | |
dad7557e WL |
1023 | * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL |
1024 | * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL | |
1025 | * @out_nid: ptr to int for nid of the range, can be %NULL | |
35fd0808 | 1026 | * |
f1af9d3a | 1027 | * Find the first area from *@idx which matches @nid, fill the out |
35fd0808 | 1028 | * parameters, and update *@idx for the next iteration. The lower 32bit of |
f1af9d3a PH |
1029 | * *@idx contains index into type_a and the upper 32bit indexes the |
1030 | * areas before each region in type_b. For example, if type_b regions | |
35fd0808 TH |
1031 | * look like the following, |
1032 | * | |
1033 | * 0:[0-16), 1:[32-48), 2:[128-130) | |
1034 | * | |
1035 | * The upper 32bit indexes the following regions. | |
1036 | * | |
1037 | * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX) | |
1038 | * | |
1039 | * As both region arrays are sorted, the function advances the two indices | |
1040 | * in lockstep and returns each intersection. | |
1041 | */ | |
77649905 DH |
1042 | void __next_mem_range(u64 *idx, int nid, enum memblock_flags flags, |
1043 | struct memblock_type *type_a, | |
1044 | struct memblock_type *type_b, phys_addr_t *out_start, | |
1045 | phys_addr_t *out_end, int *out_nid) | |
35fd0808 | 1046 | { |
f1af9d3a PH |
1047 | int idx_a = *idx & 0xffffffff; |
1048 | int idx_b = *idx >> 32; | |
b1154233 | 1049 | |
f1af9d3a PH |
1050 | if (WARN_ONCE(nid == MAX_NUMNODES, |
1051 | "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n")) | |
560dca27 | 1052 | nid = NUMA_NO_NODE; |
35fd0808 | 1053 | |
f1af9d3a PH |
1054 | for (; idx_a < type_a->cnt; idx_a++) { |
1055 | struct memblock_region *m = &type_a->regions[idx_a]; | |
1056 | ||
35fd0808 TH |
1057 | phys_addr_t m_start = m->base; |
1058 | phys_addr_t m_end = m->base + m->size; | |
f1af9d3a | 1059 | int m_nid = memblock_get_region_node(m); |
35fd0808 | 1060 | |
9f3d5eaa | 1061 | if (should_skip_region(type_a, m, nid, flags)) |
bf3d3cc5 AB |
1062 | continue; |
1063 | ||
f1af9d3a PH |
1064 | if (!type_b) { |
1065 | if (out_start) | |
1066 | *out_start = m_start; | |
1067 | if (out_end) | |
1068 | *out_end = m_end; | |
1069 | if (out_nid) | |
1070 | *out_nid = m_nid; | |
1071 | idx_a++; | |
1072 | *idx = (u32)idx_a | (u64)idx_b << 32; | |
1073 | return; | |
1074 | } | |
1075 | ||
1076 | /* scan areas before each reservation */ | |
1077 | for (; idx_b < type_b->cnt + 1; idx_b++) { | |
1078 | struct memblock_region *r; | |
1079 | phys_addr_t r_start; | |
1080 | phys_addr_t r_end; | |
1081 | ||
1082 | r = &type_b->regions[idx_b]; | |
1083 | r_start = idx_b ? r[-1].base + r[-1].size : 0; | |
1084 | r_end = idx_b < type_b->cnt ? | |
1c4bc43d | 1085 | r->base : PHYS_ADDR_MAX; |
35fd0808 | 1086 | |
f1af9d3a PH |
1087 | /* |
1088 | * if idx_b advanced past idx_a, | |
1089 | * break out to advance idx_a | |
1090 | */ | |
35fd0808 TH |
1091 | if (r_start >= m_end) |
1092 | break; | |
1093 | /* if the two regions intersect, we're done */ | |
1094 | if (m_start < r_end) { | |
1095 | if (out_start) | |
f1af9d3a PH |
1096 | *out_start = |
1097 | max(m_start, r_start); | |
35fd0808 TH |
1098 | if (out_end) |
1099 | *out_end = min(m_end, r_end); | |
1100 | if (out_nid) | |
f1af9d3a | 1101 | *out_nid = m_nid; |
35fd0808 | 1102 | /* |
f1af9d3a PH |
1103 | * The region which ends first is |
1104 | * advanced for the next iteration. | |
35fd0808 TH |
1105 | */ |
1106 | if (m_end <= r_end) | |
f1af9d3a | 1107 | idx_a++; |
35fd0808 | 1108 | else |
f1af9d3a PH |
1109 | idx_b++; |
1110 | *idx = (u32)idx_a | (u64)idx_b << 32; | |
35fd0808 TH |
1111 | return; |
1112 | } | |
1113 | } | |
1114 | } | |
1115 | ||
1116 | /* signal end of iteration */ | |
1117 | *idx = ULLONG_MAX; | |
1118 | } | |
1119 | ||
7bd0b0f0 | 1120 | /** |
f1af9d3a PH |
1121 | * __next_mem_range_rev - generic next function for for_each_*_range_rev() |
1122 | * | |
7bd0b0f0 | 1123 | * @idx: pointer to u64 loop variable |
ad5ea8cd | 1124 | * @nid: node selector, %NUMA_NO_NODE for all nodes |
fc6daaf9 | 1125 | * @flags: pick from blocks based on memory attributes |
f1af9d3a PH |
1126 | * @type_a: pointer to memblock_type from where the range is taken |
1127 | * @type_b: pointer to memblock_type which excludes memory from being taken | |
dad7557e WL |
1128 | * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL |
1129 | * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL | |
1130 | * @out_nid: ptr to int for nid of the range, can be %NULL | |
7bd0b0f0 | 1131 | * |
47cec443 MR |
1132 | * Finds the next range from type_a which is not marked as unsuitable |
1133 | * in type_b. | |
1134 | * | |
f1af9d3a | 1135 | * Reverse of __next_mem_range(). |
7bd0b0f0 | 1136 | */ |
e1720fee MR |
1137 | void __init_memblock __next_mem_range_rev(u64 *idx, int nid, |
1138 | enum memblock_flags flags, | |
f1af9d3a PH |
1139 | struct memblock_type *type_a, |
1140 | struct memblock_type *type_b, | |
1141 | phys_addr_t *out_start, | |
1142 | phys_addr_t *out_end, int *out_nid) | |
7bd0b0f0 | 1143 | { |
f1af9d3a PH |
1144 | int idx_a = *idx & 0xffffffff; |
1145 | int idx_b = *idx >> 32; | |
b1154233 | 1146 | |
560dca27 GS |
1147 | if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n")) |
1148 | nid = NUMA_NO_NODE; | |
7bd0b0f0 TH |
1149 | |
1150 | if (*idx == (u64)ULLONG_MAX) { | |
f1af9d3a | 1151 | idx_a = type_a->cnt - 1; |
e47608ab | 1152 | if (type_b != NULL) |
1153 | idx_b = type_b->cnt; | |
1154 | else | |
1155 | idx_b = 0; | |
7bd0b0f0 TH |
1156 | } |
1157 | ||
f1af9d3a PH |
1158 | for (; idx_a >= 0; idx_a--) { |
1159 | struct memblock_region *m = &type_a->regions[idx_a]; | |
1160 | ||
7bd0b0f0 TH |
1161 | phys_addr_t m_start = m->base; |
1162 | phys_addr_t m_end = m->base + m->size; | |
f1af9d3a | 1163 | int m_nid = memblock_get_region_node(m); |
7bd0b0f0 | 1164 | |
9f3d5eaa | 1165 | if (should_skip_region(type_a, m, nid, flags)) |
bf3d3cc5 AB |
1166 | continue; |
1167 | ||
f1af9d3a PH |
1168 | if (!type_b) { |
1169 | if (out_start) | |
1170 | *out_start = m_start; | |
1171 | if (out_end) | |
1172 | *out_end = m_end; | |
1173 | if (out_nid) | |
1174 | *out_nid = m_nid; | |
fb399b48 | 1175 | idx_a--; |
f1af9d3a PH |
1176 | *idx = (u32)idx_a | (u64)idx_b << 32; |
1177 | return; | |
1178 | } | |
1179 | ||
1180 | /* scan areas before each reservation */ | |
1181 | for (; idx_b >= 0; idx_b--) { | |
1182 | struct memblock_region *r; | |
1183 | phys_addr_t r_start; | |
1184 | phys_addr_t r_end; | |
1185 | ||
1186 | r = &type_b->regions[idx_b]; | |
1187 | r_start = idx_b ? r[-1].base + r[-1].size : 0; | |
1188 | r_end = idx_b < type_b->cnt ? | |
1c4bc43d | 1189 | r->base : PHYS_ADDR_MAX; |
f1af9d3a PH |
1190 | /* |
1191 | * if idx_b advanced past idx_a, | |
1192 | * break out to advance idx_a | |
1193 | */ | |
7bd0b0f0 | 1194 | |
7bd0b0f0 TH |
1195 | if (r_end <= m_start) |
1196 | break; | |
1197 | /* if the two regions intersect, we're done */ | |
1198 | if (m_end > r_start) { | |
1199 | if (out_start) | |
1200 | *out_start = max(m_start, r_start); | |
1201 | if (out_end) | |
1202 | *out_end = min(m_end, r_end); | |
1203 | if (out_nid) | |
f1af9d3a | 1204 | *out_nid = m_nid; |
7bd0b0f0 | 1205 | if (m_start >= r_start) |
f1af9d3a | 1206 | idx_a--; |
7bd0b0f0 | 1207 | else |
f1af9d3a PH |
1208 | idx_b--; |
1209 | *idx = (u32)idx_a | (u64)idx_b << 32; | |
7bd0b0f0 TH |
1210 | return; |
1211 | } | |
1212 | } | |
1213 | } | |
f1af9d3a | 1214 | /* signal end of iteration */ |
7bd0b0f0 TH |
1215 | *idx = ULLONG_MAX; |
1216 | } | |
1217 | ||
7c0caeb8 | 1218 | /* |
45e79815 | 1219 | * Common iterator interface used to define for_each_mem_pfn_range(). |
7c0caeb8 TH |
1220 | */ |
1221 | void __init_memblock __next_mem_pfn_range(int *idx, int nid, | |
1222 | unsigned long *out_start_pfn, | |
1223 | unsigned long *out_end_pfn, int *out_nid) | |
1224 | { | |
1225 | struct memblock_type *type = &memblock.memory; | |
1226 | struct memblock_region *r; | |
d622abf7 | 1227 | int r_nid; |
7c0caeb8 TH |
1228 | |
1229 | while (++*idx < type->cnt) { | |
1230 | r = &type->regions[*idx]; | |
d622abf7 | 1231 | r_nid = memblock_get_region_node(r); |
7c0caeb8 TH |
1232 | |
1233 | if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size)) | |
1234 | continue; | |
d622abf7 | 1235 | if (nid == MAX_NUMNODES || nid == r_nid) |
7c0caeb8 TH |
1236 | break; |
1237 | } | |
1238 | if (*idx >= type->cnt) { | |
1239 | *idx = -1; | |
1240 | return; | |
1241 | } | |
1242 | ||
1243 | if (out_start_pfn) | |
1244 | *out_start_pfn = PFN_UP(r->base); | |
1245 | if (out_end_pfn) | |
1246 | *out_end_pfn = PFN_DOWN(r->base + r->size); | |
1247 | if (out_nid) | |
d622abf7 | 1248 | *out_nid = r_nid; |
7c0caeb8 TH |
1249 | } |
1250 | ||
1251 | /** | |
1252 | * memblock_set_node - set node ID on memblock regions | |
1253 | * @base: base of area to set node ID for | |
1254 | * @size: size of area to set node ID for | |
e7e8de59 | 1255 | * @type: memblock type to set node ID for |
7c0caeb8 TH |
1256 | * @nid: node ID to set |
1257 | * | |
47cec443 | 1258 | * Set the nid of memblock @type regions in [@base, @base + @size) to @nid. |
7c0caeb8 TH |
1259 | * Regions which cross the area boundaries are split as necessary. |
1260 | * | |
47cec443 | 1261 | * Return: |
7c0caeb8 TH |
1262 | * 0 on success, -errno on failure. |
1263 | */ | |
1264 | int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size, | |
e7e8de59 | 1265 | struct memblock_type *type, int nid) |
7c0caeb8 | 1266 | { |
a9ee6cf5 | 1267 | #ifdef CONFIG_NUMA |
6a9ceb31 TH |
1268 | int start_rgn, end_rgn; |
1269 | int i, ret; | |
7c0caeb8 | 1270 | |
6a9ceb31 TH |
1271 | ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn); |
1272 | if (ret) | |
1273 | return ret; | |
7c0caeb8 | 1274 | |
6a9ceb31 | 1275 | for (i = start_rgn; i < end_rgn; i++) |
e9d24ad3 | 1276 | memblock_set_region_node(&type->regions[i], nid); |
7c0caeb8 TH |
1277 | |
1278 | memblock_merge_regions(type); | |
3f08a302 | 1279 | #endif |
7c0caeb8 TH |
1280 | return 0; |
1281 | } | |
3f08a302 | 1282 | |
837566e7 AD |
1283 | #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT |
1284 | /** | |
1285 | * __next_mem_pfn_range_in_zone - iterator for for_each_*_range_in_zone() | |
1286 | * | |
1287 | * @idx: pointer to u64 loop variable | |
1288 | * @zone: zone in which all of the memory blocks reside | |
1289 | * @out_spfn: ptr to ulong for start pfn of the range, can be %NULL | |
1290 | * @out_epfn: ptr to ulong for end pfn of the range, can be %NULL | |
1291 | * | |
1292 | * This function is meant to be a zone/pfn specific wrapper for the | |
1293 | * for_each_mem_range type iterators. Specifically they are used in the | |
1294 | * deferred memory init routines and as such we were duplicating much of | |
1295 | * this logic throughout the code. So instead of having it in multiple | |
1296 | * locations it seemed like it would make more sense to centralize this to | |
1297 | * one new iterator that does everything they need. | |
1298 | */ | |
1299 | void __init_memblock | |
1300 | __next_mem_pfn_range_in_zone(u64 *idx, struct zone *zone, | |
1301 | unsigned long *out_spfn, unsigned long *out_epfn) | |
1302 | { | |
1303 | int zone_nid = zone_to_nid(zone); | |
1304 | phys_addr_t spa, epa; | |
837566e7 AD |
1305 | |
1306 | __next_mem_range(idx, zone_nid, MEMBLOCK_NONE, | |
1307 | &memblock.memory, &memblock.reserved, | |
f30b002c | 1308 | &spa, &epa, NULL); |
837566e7 AD |
1309 | |
1310 | while (*idx != U64_MAX) { | |
1311 | unsigned long epfn = PFN_DOWN(epa); | |
1312 | unsigned long spfn = PFN_UP(spa); | |
1313 | ||
1314 | /* | |
1315 | * Verify the end is at least past the start of the zone and | |
1316 | * that we have at least one PFN to initialize. | |
1317 | */ | |
1318 | if (zone->zone_start_pfn < epfn && spfn < epfn) { | |
1319 | /* if we went too far just stop searching */ | |
1320 | if (zone_end_pfn(zone) <= spfn) { | |
1321 | *idx = U64_MAX; | |
1322 | break; | |
1323 | } | |
1324 | ||
1325 | if (out_spfn) | |
1326 | *out_spfn = max(zone->zone_start_pfn, spfn); | |
1327 | if (out_epfn) | |
1328 | *out_epfn = min(zone_end_pfn(zone), epfn); | |
1329 | ||
1330 | return; | |
1331 | } | |
1332 | ||
1333 | __next_mem_range(idx, zone_nid, MEMBLOCK_NONE, | |
1334 | &memblock.memory, &memblock.reserved, | |
f30b002c | 1335 | &spa, &epa, NULL); |
837566e7 AD |
1336 | } |
1337 | ||
1338 | /* signal end of iteration */ | |
1339 | if (out_spfn) | |
1340 | *out_spfn = ULONG_MAX; | |
1341 | if (out_epfn) | |
1342 | *out_epfn = 0; | |
1343 | } | |
1344 | ||
1345 | #endif /* CONFIG_DEFERRED_STRUCT_PAGE_INIT */ | |
7c0caeb8 | 1346 | |
92d12f95 MR |
1347 | /** |
1348 | * memblock_alloc_range_nid - allocate boot memory block | |
1349 | * @size: size of memory block to be allocated in bytes | |
1350 | * @align: alignment of the region and block's size | |
1351 | * @start: the lower bound of the memory region to allocate (phys address) | |
1352 | * @end: the upper bound of the memory region to allocate (phys address) | |
1353 | * @nid: nid of the free area to find, %NUMA_NO_NODE for any node | |
0ac398b1 | 1354 | * @exact_nid: control the allocation fall back to other nodes |
92d12f95 MR |
1355 | * |
1356 | * The allocation is performed from memory region limited by | |
95830666 | 1357 | * memblock.current_limit if @end == %MEMBLOCK_ALLOC_ACCESSIBLE. |
92d12f95 | 1358 | * |
0ac398b1 YY |
1359 | * If the specified node can not hold the requested memory and @exact_nid |
1360 | * is false, the allocation falls back to any node in the system. | |
92d12f95 MR |
1361 | * |
1362 | * For systems with memory mirroring, the allocation is attempted first | |
1363 | * from the regions with mirroring enabled and then retried from any | |
1364 | * memory region. | |
1365 | * | |
c200d900 PW |
1366 | * In addition, function using kmemleak_alloc_phys for allocated boot |
1367 | * memory block, it is never reported as leaks. | |
92d12f95 MR |
1368 | * |
1369 | * Return: | |
1370 | * Physical address of allocated memory block on success, %0 on failure. | |
1371 | */ | |
8676af1f | 1372 | phys_addr_t __init memblock_alloc_range_nid(phys_addr_t size, |
2bfc2862 | 1373 | phys_addr_t align, phys_addr_t start, |
0ac398b1 YY |
1374 | phys_addr_t end, int nid, |
1375 | bool exact_nid) | |
95f72d1e | 1376 | { |
92d12f95 | 1377 | enum memblock_flags flags = choose_memblock_flags(); |
6ed311b2 | 1378 | phys_addr_t found; |
95f72d1e | 1379 | |
92d12f95 MR |
1380 | if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead\n")) |
1381 | nid = NUMA_NO_NODE; | |
1382 | ||
2f770806 MR |
1383 | if (!align) { |
1384 | /* Can't use WARNs this early in boot on powerpc */ | |
1385 | dump_stack(); | |
1386 | align = SMP_CACHE_BYTES; | |
1387 | } | |
1388 | ||
92d12f95 | 1389 | again: |
fc6daaf9 TL |
1390 | found = memblock_find_in_range_node(size, align, start, end, nid, |
1391 | flags); | |
92d12f95 MR |
1392 | if (found && !memblock_reserve(found, size)) |
1393 | goto done; | |
1394 | ||
0ac398b1 | 1395 | if (nid != NUMA_NO_NODE && !exact_nid) { |
92d12f95 MR |
1396 | found = memblock_find_in_range_node(size, align, start, |
1397 | end, NUMA_NO_NODE, | |
1398 | flags); | |
1399 | if (found && !memblock_reserve(found, size)) | |
1400 | goto done; | |
1401 | } | |
1402 | ||
1403 | if (flags & MEMBLOCK_MIRROR) { | |
1404 | flags &= ~MEMBLOCK_MIRROR; | |
14d9a675 | 1405 | pr_warn_ratelimited("Could not allocate %pap bytes of mirrored memory\n", |
92d12f95 MR |
1406 | &size); |
1407 | goto again; | |
1408 | } | |
1409 | ||
1410 | return 0; | |
1411 | ||
1412 | done: | |
c6975d7c QC |
1413 | /* |
1414 | * Skip kmemleak for those places like kasan_init() and | |
1415 | * early_pgtable_alloc() due to high volume. | |
1416 | */ | |
1417 | if (end != MEMBLOCK_ALLOC_NOLEAKTRACE) | |
aedf95ea | 1418 | /* |
c200d900 PW |
1419 | * Memblock allocated blocks are never reported as |
1420 | * leaks. This is because many of these blocks are | |
1421 | * only referred via the physical address which is | |
1422 | * not looked up by kmemleak. | |
aedf95ea | 1423 | */ |
c200d900 | 1424 | kmemleak_alloc_phys(found, size, 0); |
92d12f95 MR |
1425 | |
1426 | return found; | |
95f72d1e YL |
1427 | } |
1428 | ||
a2974133 MR |
1429 | /** |
1430 | * memblock_phys_alloc_range - allocate a memory block inside specified range | |
1431 | * @size: size of memory block to be allocated in bytes | |
1432 | * @align: alignment of the region and block's size | |
1433 | * @start: the lower bound of the memory region to allocate (physical address) | |
1434 | * @end: the upper bound of the memory region to allocate (physical address) | |
1435 | * | |
1436 | * Allocate @size bytes in the between @start and @end. | |
1437 | * | |
1438 | * Return: physical address of the allocated memory block on success, | |
1439 | * %0 on failure. | |
1440 | */ | |
8a770c2a MR |
1441 | phys_addr_t __init memblock_phys_alloc_range(phys_addr_t size, |
1442 | phys_addr_t align, | |
1443 | phys_addr_t start, | |
1444 | phys_addr_t end) | |
2bfc2862 | 1445 | { |
b5cf2d6c FM |
1446 | memblock_dbg("%s: %llu bytes align=0x%llx from=%pa max_addr=%pa %pS\n", |
1447 | __func__, (u64)size, (u64)align, &start, &end, | |
1448 | (void *)_RET_IP_); | |
0ac398b1 YY |
1449 | return memblock_alloc_range_nid(size, align, start, end, NUMA_NO_NODE, |
1450 | false); | |
7bd0b0f0 TH |
1451 | } |
1452 | ||
a2974133 | 1453 | /** |
17cbe038 | 1454 | * memblock_phys_alloc_try_nid - allocate a memory block from specified NUMA node |
a2974133 MR |
1455 | * @size: size of memory block to be allocated in bytes |
1456 | * @align: alignment of the region and block's size | |
1457 | * @nid: nid of the free area to find, %NUMA_NO_NODE for any node | |
1458 | * | |
1459 | * Allocates memory block from the specified NUMA node. If the node | |
1460 | * has no available memory, attempts to allocated from any node in the | |
1461 | * system. | |
1462 | * | |
1463 | * Return: physical address of the allocated memory block on success, | |
1464 | * %0 on failure. | |
1465 | */ | |
9a8dd708 | 1466 | phys_addr_t __init memblock_phys_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid) |
9d1e2492 | 1467 | { |
33755574 | 1468 | return memblock_alloc_range_nid(size, align, 0, |
0ac398b1 | 1469 | MEMBLOCK_ALLOC_ACCESSIBLE, nid, false); |
95f72d1e YL |
1470 | } |
1471 | ||
26f09e9b | 1472 | /** |
eb31d559 | 1473 | * memblock_alloc_internal - allocate boot memory block |
26f09e9b SS |
1474 | * @size: size of memory block to be allocated in bytes |
1475 | * @align: alignment of the region and block's size | |
1476 | * @min_addr: the lower bound of the memory region to allocate (phys address) | |
1477 | * @max_addr: the upper bound of the memory region to allocate (phys address) | |
1478 | * @nid: nid of the free area to find, %NUMA_NO_NODE for any node | |
0ac398b1 | 1479 | * @exact_nid: control the allocation fall back to other nodes |
26f09e9b | 1480 | * |
92d12f95 MR |
1481 | * Allocates memory block using memblock_alloc_range_nid() and |
1482 | * converts the returned physical address to virtual. | |
26f09e9b | 1483 | * |
92d12f95 MR |
1484 | * The @min_addr limit is dropped if it can not be satisfied and the allocation |
1485 | * will fall back to memory below @min_addr. Other constraints, such | |
1486 | * as node and mirrored memory will be handled again in | |
1487 | * memblock_alloc_range_nid(). | |
26f09e9b | 1488 | * |
47cec443 | 1489 | * Return: |
26f09e9b SS |
1490 | * Virtual address of allocated memory block on success, NULL on failure. |
1491 | */ | |
eb31d559 | 1492 | static void * __init memblock_alloc_internal( |
26f09e9b SS |
1493 | phys_addr_t size, phys_addr_t align, |
1494 | phys_addr_t min_addr, phys_addr_t max_addr, | |
0ac398b1 | 1495 | int nid, bool exact_nid) |
26f09e9b SS |
1496 | { |
1497 | phys_addr_t alloc; | |
26f09e9b SS |
1498 | |
1499 | /* | |
1500 | * Detect any accidental use of these APIs after slab is ready, as at | |
1501 | * this moment memblock may be deinitialized already and its | |
c6ffc5ca | 1502 | * internal data may be destroyed (after execution of memblock_free_all) |
26f09e9b SS |
1503 | */ |
1504 | if (WARN_ON_ONCE(slab_is_available())) | |
1505 | return kzalloc_node(size, GFP_NOWAIT, nid); | |
1506 | ||
f3057ad7 MR |
1507 | if (max_addr > memblock.current_limit) |
1508 | max_addr = memblock.current_limit; | |
1509 | ||
0ac398b1 YY |
1510 | alloc = memblock_alloc_range_nid(size, align, min_addr, max_addr, nid, |
1511 | exact_nid); | |
26f09e9b | 1512 | |
92d12f95 MR |
1513 | /* retry allocation without lower limit */ |
1514 | if (!alloc && min_addr) | |
0ac398b1 YY |
1515 | alloc = memblock_alloc_range_nid(size, align, 0, max_addr, nid, |
1516 | exact_nid); | |
26f09e9b | 1517 | |
92d12f95 MR |
1518 | if (!alloc) |
1519 | return NULL; | |
26f09e9b | 1520 | |
92d12f95 | 1521 | return phys_to_virt(alloc); |
26f09e9b SS |
1522 | } |
1523 | ||
0ac398b1 YY |
1524 | /** |
1525 | * memblock_alloc_exact_nid_raw - allocate boot memory block on the exact node | |
1526 | * without zeroing memory | |
1527 | * @size: size of memory block to be allocated in bytes | |
1528 | * @align: alignment of the region and block's size | |
1529 | * @min_addr: the lower bound of the memory region from where the allocation | |
1530 | * is preferred (phys address) | |
1531 | * @max_addr: the upper bound of the memory region from where the allocation | |
1532 | * is preferred (phys address), or %MEMBLOCK_ALLOC_ACCESSIBLE to | |
1533 | * allocate only from memory limited by memblock.current_limit value | |
1534 | * @nid: nid of the free area to find, %NUMA_NO_NODE for any node | |
1535 | * | |
1536 | * Public function, provides additional debug information (including caller | |
1537 | * info), if enabled. Does not zero allocated memory. | |
1538 | * | |
1539 | * Return: | |
1540 | * Virtual address of allocated memory block on success, NULL on failure. | |
1541 | */ | |
1542 | void * __init memblock_alloc_exact_nid_raw( | |
1543 | phys_addr_t size, phys_addr_t align, | |
1544 | phys_addr_t min_addr, phys_addr_t max_addr, | |
1545 | int nid) | |
1546 | { | |
0ac398b1 YY |
1547 | memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=%pa max_addr=%pa %pS\n", |
1548 | __func__, (u64)size, (u64)align, nid, &min_addr, | |
1549 | &max_addr, (void *)_RET_IP_); | |
1550 | ||
08678804 MR |
1551 | return memblock_alloc_internal(size, align, min_addr, max_addr, nid, |
1552 | true); | |
0ac398b1 YY |
1553 | } |
1554 | ||
ea1f5f37 | 1555 | /** |
eb31d559 | 1556 | * memblock_alloc_try_nid_raw - allocate boot memory block without zeroing |
ea1f5f37 PT |
1557 | * memory and without panicking |
1558 | * @size: size of memory block to be allocated in bytes | |
1559 | * @align: alignment of the region and block's size | |
1560 | * @min_addr: the lower bound of the memory region from where the allocation | |
1561 | * is preferred (phys address) | |
1562 | * @max_addr: the upper bound of the memory region from where the allocation | |
97ad1087 | 1563 | * is preferred (phys address), or %MEMBLOCK_ALLOC_ACCESSIBLE to |
ea1f5f37 PT |
1564 | * allocate only from memory limited by memblock.current_limit value |
1565 | * @nid: nid of the free area to find, %NUMA_NO_NODE for any node | |
1566 | * | |
1567 | * Public function, provides additional debug information (including caller | |
1568 | * info), if enabled. Does not zero allocated memory, does not panic if request | |
1569 | * cannot be satisfied. | |
1570 | * | |
47cec443 | 1571 | * Return: |
ea1f5f37 PT |
1572 | * Virtual address of allocated memory block on success, NULL on failure. |
1573 | */ | |
eb31d559 | 1574 | void * __init memblock_alloc_try_nid_raw( |
ea1f5f37 PT |
1575 | phys_addr_t size, phys_addr_t align, |
1576 | phys_addr_t min_addr, phys_addr_t max_addr, | |
1577 | int nid) | |
1578 | { | |
d75f773c | 1579 | memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=%pa max_addr=%pa %pS\n", |
a36aab89 MR |
1580 | __func__, (u64)size, (u64)align, nid, &min_addr, |
1581 | &max_addr, (void *)_RET_IP_); | |
ea1f5f37 | 1582 | |
08678804 MR |
1583 | return memblock_alloc_internal(size, align, min_addr, max_addr, nid, |
1584 | false); | |
ea1f5f37 PT |
1585 | } |
1586 | ||
26f09e9b | 1587 | /** |
c0dbe825 | 1588 | * memblock_alloc_try_nid - allocate boot memory block |
26f09e9b SS |
1589 | * @size: size of memory block to be allocated in bytes |
1590 | * @align: alignment of the region and block's size | |
1591 | * @min_addr: the lower bound of the memory region from where the allocation | |
1592 | * is preferred (phys address) | |
1593 | * @max_addr: the upper bound of the memory region from where the allocation | |
97ad1087 | 1594 | * is preferred (phys address), or %MEMBLOCK_ALLOC_ACCESSIBLE to |
26f09e9b SS |
1595 | * allocate only from memory limited by memblock.current_limit value |
1596 | * @nid: nid of the free area to find, %NUMA_NO_NODE for any node | |
1597 | * | |
c0dbe825 MR |
1598 | * Public function, provides additional debug information (including caller |
1599 | * info), if enabled. This function zeroes the allocated memory. | |
26f09e9b | 1600 | * |
47cec443 | 1601 | * Return: |
26f09e9b SS |
1602 | * Virtual address of allocated memory block on success, NULL on failure. |
1603 | */ | |
eb31d559 | 1604 | void * __init memblock_alloc_try_nid( |
26f09e9b SS |
1605 | phys_addr_t size, phys_addr_t align, |
1606 | phys_addr_t min_addr, phys_addr_t max_addr, | |
1607 | int nid) | |
1608 | { | |
1609 | void *ptr; | |
1610 | ||
d75f773c | 1611 | memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=%pa max_addr=%pa %pS\n", |
a36aab89 MR |
1612 | __func__, (u64)size, (u64)align, nid, &min_addr, |
1613 | &max_addr, (void *)_RET_IP_); | |
eb31d559 | 1614 | ptr = memblock_alloc_internal(size, align, |
0ac398b1 | 1615 | min_addr, max_addr, nid, false); |
c0dbe825 | 1616 | if (ptr) |
ea1f5f37 | 1617 | memset(ptr, 0, size); |
26f09e9b | 1618 | |
c0dbe825 | 1619 | return ptr; |
26f09e9b SS |
1620 | } |
1621 | ||
48a833cc | 1622 | /** |
621d9739 | 1623 | * memblock_free_late - free pages directly to buddy allocator |
48a833cc | 1624 | * @base: phys starting address of the boot memory block |
26f09e9b SS |
1625 | * @size: size of the boot memory block in bytes |
1626 | * | |
a2974133 | 1627 | * This is only useful when the memblock allocator has already been torn |
26f09e9b | 1628 | * down, but we are still initializing the system. Pages are released directly |
a2974133 | 1629 | * to the buddy allocator. |
26f09e9b | 1630 | */ |
621d9739 | 1631 | void __init memblock_free_late(phys_addr_t base, phys_addr_t size) |
26f09e9b | 1632 | { |
a36aab89 | 1633 | phys_addr_t cursor, end; |
26f09e9b | 1634 | |
a36aab89 | 1635 | end = base + size - 1; |
d75f773c | 1636 | memblock_dbg("%s: [%pa-%pa] %pS\n", |
a36aab89 | 1637 | __func__, &base, &end, (void *)_RET_IP_); |
9099daed | 1638 | kmemleak_free_part_phys(base, size); |
26f09e9b SS |
1639 | cursor = PFN_UP(base); |
1640 | end = PFN_DOWN(base + size); | |
1641 | ||
1642 | for (; cursor < end; cursor++) { | |
7c2ee349 | 1643 | memblock_free_pages(pfn_to_page(cursor), cursor, 0); |
ca79b0c2 | 1644 | totalram_pages_inc(); |
26f09e9b SS |
1645 | } |
1646 | } | |
9d1e2492 BH |
1647 | |
1648 | /* | |
1649 | * Remaining API functions | |
1650 | */ | |
1651 | ||
1f1ffb8a | 1652 | phys_addr_t __init_memblock memblock_phys_mem_size(void) |
95f72d1e | 1653 | { |
1440c4e2 | 1654 | return memblock.memory.total_size; |
95f72d1e YL |
1655 | } |
1656 | ||
8907de5d SD |
1657 | phys_addr_t __init_memblock memblock_reserved_size(void) |
1658 | { | |
1659 | return memblock.reserved.total_size; | |
1660 | } | |
1661 | ||
0a93ebef SR |
1662 | /* lowest address */ |
1663 | phys_addr_t __init_memblock memblock_start_of_DRAM(void) | |
1664 | { | |
1665 | return memblock.memory.regions[0].base; | |
1666 | } | |
1667 | ||
10d06439 | 1668 | phys_addr_t __init_memblock memblock_end_of_DRAM(void) |
95f72d1e YL |
1669 | { |
1670 | int idx = memblock.memory.cnt - 1; | |
1671 | ||
e3239ff9 | 1672 | return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size); |
95f72d1e YL |
1673 | } |
1674 | ||
a571d4eb | 1675 | static phys_addr_t __init_memblock __find_max_addr(phys_addr_t limit) |
95f72d1e | 1676 | { |
1c4bc43d | 1677 | phys_addr_t max_addr = PHYS_ADDR_MAX; |
136199f0 | 1678 | struct memblock_region *r; |
95f72d1e | 1679 | |
a571d4eb DC |
1680 | /* |
1681 | * translate the memory @limit size into the max address within one of | |
1682 | * the memory memblock regions, if the @limit exceeds the total size | |
1c4bc43d | 1683 | * of those regions, max_addr will keep original value PHYS_ADDR_MAX |
a571d4eb | 1684 | */ |
cc6de168 | 1685 | for_each_mem_region(r) { |
c0ce8fef TH |
1686 | if (limit <= r->size) { |
1687 | max_addr = r->base + limit; | |
1688 | break; | |
95f72d1e | 1689 | } |
c0ce8fef | 1690 | limit -= r->size; |
95f72d1e | 1691 | } |
c0ce8fef | 1692 | |
a571d4eb DC |
1693 | return max_addr; |
1694 | } | |
1695 | ||
1696 | void __init memblock_enforce_memory_limit(phys_addr_t limit) | |
1697 | { | |
49aef717 | 1698 | phys_addr_t max_addr; |
a571d4eb DC |
1699 | |
1700 | if (!limit) | |
1701 | return; | |
1702 | ||
1703 | max_addr = __find_max_addr(limit); | |
1704 | ||
1705 | /* @limit exceeds the total size of the memory, do nothing */ | |
1c4bc43d | 1706 | if (max_addr == PHYS_ADDR_MAX) |
a571d4eb DC |
1707 | return; |
1708 | ||
c0ce8fef | 1709 | /* truncate both memory and reserved regions */ |
f1af9d3a | 1710 | memblock_remove_range(&memblock.memory, max_addr, |
1c4bc43d | 1711 | PHYS_ADDR_MAX); |
f1af9d3a | 1712 | memblock_remove_range(&memblock.reserved, max_addr, |
1c4bc43d | 1713 | PHYS_ADDR_MAX); |
95f72d1e YL |
1714 | } |
1715 | ||
c9ca9b4e AT |
1716 | void __init memblock_cap_memory_range(phys_addr_t base, phys_addr_t size) |
1717 | { | |
1718 | int start_rgn, end_rgn; | |
1719 | int i, ret; | |
1720 | ||
1721 | if (!size) | |
1722 | return; | |
1723 | ||
5173ed72 | 1724 | if (!memblock_memory->total_size) { |
e888fa7b GU |
1725 | pr_warn("%s: No memory registered yet\n", __func__); |
1726 | return; | |
1727 | } | |
1728 | ||
c9ca9b4e AT |
1729 | ret = memblock_isolate_range(&memblock.memory, base, size, |
1730 | &start_rgn, &end_rgn); | |
1731 | if (ret) | |
1732 | return; | |
1733 | ||
1734 | /* remove all the MAP regions */ | |
1735 | for (i = memblock.memory.cnt - 1; i >= end_rgn; i--) | |
1736 | if (!memblock_is_nomap(&memblock.memory.regions[i])) | |
1737 | memblock_remove_region(&memblock.memory, i); | |
1738 | ||
1739 | for (i = start_rgn - 1; i >= 0; i--) | |
1740 | if (!memblock_is_nomap(&memblock.memory.regions[i])) | |
1741 | memblock_remove_region(&memblock.memory, i); | |
1742 | ||
1743 | /* truncate the reserved regions */ | |
1744 | memblock_remove_range(&memblock.reserved, 0, base); | |
1745 | memblock_remove_range(&memblock.reserved, | |
1c4bc43d | 1746 | base + size, PHYS_ADDR_MAX); |
c9ca9b4e AT |
1747 | } |
1748 | ||
a571d4eb DC |
1749 | void __init memblock_mem_limit_remove_map(phys_addr_t limit) |
1750 | { | |
a571d4eb | 1751 | phys_addr_t max_addr; |
a571d4eb DC |
1752 | |
1753 | if (!limit) | |
1754 | return; | |
1755 | ||
1756 | max_addr = __find_max_addr(limit); | |
1757 | ||
1758 | /* @limit exceeds the total size of the memory, do nothing */ | |
1c4bc43d | 1759 | if (max_addr == PHYS_ADDR_MAX) |
a571d4eb DC |
1760 | return; |
1761 | ||
c9ca9b4e | 1762 | memblock_cap_memory_range(0, max_addr); |
a571d4eb DC |
1763 | } |
1764 | ||
cd79481d | 1765 | static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr) |
72d4b0b4 BH |
1766 | { |
1767 | unsigned int left = 0, right = type->cnt; | |
1768 | ||
1769 | do { | |
1770 | unsigned int mid = (right + left) / 2; | |
1771 | ||
1772 | if (addr < type->regions[mid].base) | |
1773 | right = mid; | |
1774 | else if (addr >= (type->regions[mid].base + | |
1775 | type->regions[mid].size)) | |
1776 | left = mid + 1; | |
1777 | else | |
1778 | return mid; | |
1779 | } while (left < right); | |
1780 | return -1; | |
1781 | } | |
1782 | ||
f5a222dc | 1783 | bool __init_memblock memblock_is_reserved(phys_addr_t addr) |
95f72d1e | 1784 | { |
72d4b0b4 BH |
1785 | return memblock_search(&memblock.reserved, addr) != -1; |
1786 | } | |
95f72d1e | 1787 | |
b4ad0c7e | 1788 | bool __init_memblock memblock_is_memory(phys_addr_t addr) |
72d4b0b4 BH |
1789 | { |
1790 | return memblock_search(&memblock.memory, addr) != -1; | |
1791 | } | |
1792 | ||
937f0c26 | 1793 | bool __init_memblock memblock_is_map_memory(phys_addr_t addr) |
bf3d3cc5 AB |
1794 | { |
1795 | int i = memblock_search(&memblock.memory, addr); | |
1796 | ||
1797 | if (i == -1) | |
1798 | return false; | |
1799 | return !memblock_is_nomap(&memblock.memory.regions[i]); | |
1800 | } | |
1801 | ||
e76b63f8 YL |
1802 | int __init_memblock memblock_search_pfn_nid(unsigned long pfn, |
1803 | unsigned long *start_pfn, unsigned long *end_pfn) | |
1804 | { | |
1805 | struct memblock_type *type = &memblock.memory; | |
16763230 | 1806 | int mid = memblock_search(type, PFN_PHYS(pfn)); |
e76b63f8 YL |
1807 | |
1808 | if (mid == -1) | |
1809 | return -1; | |
1810 | ||
f7e2f7e8 FF |
1811 | *start_pfn = PFN_DOWN(type->regions[mid].base); |
1812 | *end_pfn = PFN_DOWN(type->regions[mid].base + type->regions[mid].size); | |
e76b63f8 | 1813 | |
d622abf7 | 1814 | return memblock_get_region_node(&type->regions[mid]); |
e76b63f8 | 1815 | } |
e76b63f8 | 1816 | |
eab30949 SB |
1817 | /** |
1818 | * memblock_is_region_memory - check if a region is a subset of memory | |
1819 | * @base: base of region to check | |
1820 | * @size: size of region to check | |
1821 | * | |
47cec443 | 1822 | * Check if the region [@base, @base + @size) is a subset of a memory block. |
eab30949 | 1823 | * |
47cec443 | 1824 | * Return: |
eab30949 SB |
1825 | * 0 if false, non-zero if true |
1826 | */ | |
937f0c26 | 1827 | bool __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size) |
72d4b0b4 | 1828 | { |
abb65272 | 1829 | int idx = memblock_search(&memblock.memory, base); |
eb18f1b5 | 1830 | phys_addr_t end = base + memblock_cap_size(base, &size); |
72d4b0b4 BH |
1831 | |
1832 | if (idx == -1) | |
937f0c26 | 1833 | return false; |
ef415ef4 | 1834 | return (memblock.memory.regions[idx].base + |
eb18f1b5 | 1835 | memblock.memory.regions[idx].size) >= end; |
95f72d1e YL |
1836 | } |
1837 | ||
eab30949 SB |
1838 | /** |
1839 | * memblock_is_region_reserved - check if a region intersects reserved memory | |
1840 | * @base: base of region to check | |
1841 | * @size: size of region to check | |
1842 | * | |
47cec443 MR |
1843 | * Check if the region [@base, @base + @size) intersects a reserved |
1844 | * memory block. | |
eab30949 | 1845 | * |
47cec443 | 1846 | * Return: |
c5c5c9d1 | 1847 | * True if they intersect, false if not. |
eab30949 | 1848 | */ |
c5c5c9d1 | 1849 | bool __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size) |
95f72d1e | 1850 | { |
c5c5c9d1 | 1851 | return memblock_overlaps_region(&memblock.reserved, base, size); |
95f72d1e YL |
1852 | } |
1853 | ||
6ede1fd3 YL |
1854 | void __init_memblock memblock_trim_memory(phys_addr_t align) |
1855 | { | |
6ede1fd3 | 1856 | phys_addr_t start, end, orig_start, orig_end; |
136199f0 | 1857 | struct memblock_region *r; |
6ede1fd3 | 1858 | |
cc6de168 | 1859 | for_each_mem_region(r) { |
136199f0 EM |
1860 | orig_start = r->base; |
1861 | orig_end = r->base + r->size; | |
6ede1fd3 YL |
1862 | start = round_up(orig_start, align); |
1863 | end = round_down(orig_end, align); | |
1864 | ||
1865 | if (start == orig_start && end == orig_end) | |
1866 | continue; | |
1867 | ||
1868 | if (start < end) { | |
136199f0 EM |
1869 | r->base = start; |
1870 | r->size = end - start; | |
6ede1fd3 | 1871 | } else { |
136199f0 EM |
1872 | memblock_remove_region(&memblock.memory, |
1873 | r - memblock.memory.regions); | |
1874 | r--; | |
6ede1fd3 YL |
1875 | } |
1876 | } | |
1877 | } | |
e63075a3 | 1878 | |
3661ca66 | 1879 | void __init_memblock memblock_set_current_limit(phys_addr_t limit) |
e63075a3 BH |
1880 | { |
1881 | memblock.current_limit = limit; | |
1882 | } | |
1883 | ||
fec51014 LA |
1884 | phys_addr_t __init_memblock memblock_get_current_limit(void) |
1885 | { | |
1886 | return memblock.current_limit; | |
1887 | } | |
1888 | ||
0262d9c8 | 1889 | static void __init_memblock memblock_dump(struct memblock_type *type) |
6ed311b2 | 1890 | { |
5d63f81c | 1891 | phys_addr_t base, end, size; |
e1720fee | 1892 | enum memblock_flags flags; |
8c9c1701 AK |
1893 | int idx; |
1894 | struct memblock_region *rgn; | |
6ed311b2 | 1895 | |
0262d9c8 | 1896 | pr_info(" %s.cnt = 0x%lx\n", type->name, type->cnt); |
6ed311b2 | 1897 | |
66e8b438 | 1898 | for_each_memblock_type(idx, type, rgn) { |
7c0caeb8 TH |
1899 | char nid_buf[32] = ""; |
1900 | ||
1901 | base = rgn->base; | |
1902 | size = rgn->size; | |
5d63f81c | 1903 | end = base + size - 1; |
66a20757 | 1904 | flags = rgn->flags; |
a9ee6cf5 | 1905 | #ifdef CONFIG_NUMA |
7c0caeb8 TH |
1906 | if (memblock_get_region_node(rgn) != MAX_NUMNODES) |
1907 | snprintf(nid_buf, sizeof(nid_buf), " on node %d", | |
1908 | memblock_get_region_node(rgn)); | |
1909 | #endif | |
e1720fee | 1910 | pr_info(" %s[%#x]\t[%pa-%pa], %pa bytes%s flags: %#x\n", |
0262d9c8 | 1911 | type->name, idx, &base, &end, &size, nid_buf, flags); |
6ed311b2 BH |
1912 | } |
1913 | } | |
1914 | ||
87c55870 | 1915 | static void __init_memblock __memblock_dump_all(void) |
6ed311b2 | 1916 | { |
6ed311b2 | 1917 | pr_info("MEMBLOCK configuration:\n"); |
5d63f81c MC |
1918 | pr_info(" memory size = %pa reserved size = %pa\n", |
1919 | &memblock.memory.total_size, | |
1920 | &memblock.reserved.total_size); | |
6ed311b2 | 1921 | |
0262d9c8 HC |
1922 | memblock_dump(&memblock.memory); |
1923 | memblock_dump(&memblock.reserved); | |
409efd4c | 1924 | #ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP |
77649905 | 1925 | memblock_dump(&physmem); |
409efd4c | 1926 | #endif |
6ed311b2 BH |
1927 | } |
1928 | ||
87c55870 MR |
1929 | void __init_memblock memblock_dump_all(void) |
1930 | { | |
1931 | if (memblock_debug) | |
1932 | __memblock_dump_all(); | |
1933 | } | |
1934 | ||
1aadc056 | 1935 | void __init memblock_allow_resize(void) |
6ed311b2 | 1936 | { |
142b45a7 | 1937 | memblock_can_resize = 1; |
6ed311b2 BH |
1938 | } |
1939 | ||
6ed311b2 BH |
1940 | static int __init early_memblock(char *p) |
1941 | { | |
1942 | if (p && strstr(p, "debug")) | |
1943 | memblock_debug = 1; | |
1944 | return 0; | |
1945 | } | |
1946 | early_param("memblock", early_memblock); | |
1947 | ||
4f5b0c17 MR |
1948 | static void __init free_memmap(unsigned long start_pfn, unsigned long end_pfn) |
1949 | { | |
1950 | struct page *start_pg, *end_pg; | |
1951 | phys_addr_t pg, pgend; | |
1952 | ||
1953 | /* | |
1954 | * Convert start_pfn/end_pfn to a struct page pointer. | |
1955 | */ | |
1956 | start_pg = pfn_to_page(start_pfn - 1) + 1; | |
1957 | end_pg = pfn_to_page(end_pfn - 1) + 1; | |
1958 | ||
1959 | /* | |
1960 | * Convert to physical addresses, and round start upwards and end | |
1961 | * downwards. | |
1962 | */ | |
1963 | pg = PAGE_ALIGN(__pa(start_pg)); | |
1964 | pgend = __pa(end_pg) & PAGE_MASK; | |
1965 | ||
1966 | /* | |
1967 | * If there are free pages between these, free the section of the | |
1968 | * memmap array. | |
1969 | */ | |
1970 | if (pg < pgend) | |
3ecc6834 | 1971 | memblock_phys_free(pg, pgend - pg); |
4f5b0c17 MR |
1972 | } |
1973 | ||
1974 | /* | |
1975 | * The mem_map array can get very big. Free the unused area of the memory map. | |
1976 | */ | |
1977 | static void __init free_unused_memmap(void) | |
1978 | { | |
1979 | unsigned long start, end, prev_end = 0; | |
1980 | int i; | |
1981 | ||
1982 | if (!IS_ENABLED(CONFIG_HAVE_ARCH_PFN_VALID) || | |
1983 | IS_ENABLED(CONFIG_SPARSEMEM_VMEMMAP)) | |
1984 | return; | |
1985 | ||
1986 | /* | |
1987 | * This relies on each bank being in address order. | |
1988 | * The banks are sorted previously in bootmem_init(). | |
1989 | */ | |
1990 | for_each_mem_pfn_range(i, MAX_NUMNODES, &start, &end, NULL) { | |
1991 | #ifdef CONFIG_SPARSEMEM | |
1992 | /* | |
1993 | * Take care not to free memmap entries that don't exist | |
1994 | * due to SPARSEMEM sections which aren't present. | |
1995 | */ | |
1996 | start = min(start, ALIGN(prev_end, PAGES_PER_SECTION)); | |
f921f53e | 1997 | #endif |
4f5b0c17 | 1998 | /* |
e2a86800 MR |
1999 | * Align down here since many operations in VM subsystem |
2000 | * presume that there are no holes in the memory map inside | |
2001 | * a pageblock | |
4f5b0c17 | 2002 | */ |
e2a86800 | 2003 | start = round_down(start, pageblock_nr_pages); |
4f5b0c17 MR |
2004 | |
2005 | /* | |
2006 | * If we had a previous bank, and there is a space | |
2007 | * between the current bank and the previous, free it. | |
2008 | */ | |
2009 | if (prev_end && prev_end < start) | |
2010 | free_memmap(prev_end, start); | |
2011 | ||
2012 | /* | |
e2a86800 MR |
2013 | * Align up here since many operations in VM subsystem |
2014 | * presume that there are no holes in the memory map inside | |
2015 | * a pageblock | |
4f5b0c17 | 2016 | */ |
e2a86800 | 2017 | prev_end = ALIGN(end, pageblock_nr_pages); |
4f5b0c17 MR |
2018 | } |
2019 | ||
2020 | #ifdef CONFIG_SPARSEMEM | |
f921f53e MR |
2021 | if (!IS_ALIGNED(prev_end, PAGES_PER_SECTION)) { |
2022 | prev_end = ALIGN(end, pageblock_nr_pages); | |
4f5b0c17 | 2023 | free_memmap(prev_end, ALIGN(prev_end, PAGES_PER_SECTION)); |
f921f53e | 2024 | } |
4f5b0c17 MR |
2025 | #endif |
2026 | } | |
2027 | ||
bda49a81 MR |
2028 | static void __init __free_pages_memory(unsigned long start, unsigned long end) |
2029 | { | |
2030 | int order; | |
2031 | ||
2032 | while (start < end) { | |
2033 | order = min(MAX_ORDER - 1UL, __ffs(start)); | |
2034 | ||
2035 | while (start + (1UL << order) > end) | |
2036 | order--; | |
2037 | ||
2038 | memblock_free_pages(pfn_to_page(start), start, order); | |
2039 | ||
2040 | start += (1UL << order); | |
2041 | } | |
2042 | } | |
2043 | ||
2044 | static unsigned long __init __free_memory_core(phys_addr_t start, | |
2045 | phys_addr_t end) | |
2046 | { | |
2047 | unsigned long start_pfn = PFN_UP(start); | |
2048 | unsigned long end_pfn = min_t(unsigned long, | |
2049 | PFN_DOWN(end), max_low_pfn); | |
2050 | ||
2051 | if (start_pfn >= end_pfn) | |
2052 | return 0; | |
2053 | ||
2054 | __free_pages_memory(start_pfn, end_pfn); | |
2055 | ||
2056 | return end_pfn - start_pfn; | |
2057 | } | |
2058 | ||
9092d4f7 MR |
2059 | static void __init memmap_init_reserved_pages(void) |
2060 | { | |
2061 | struct memblock_region *region; | |
2062 | phys_addr_t start, end; | |
2063 | u64 i; | |
2064 | ||
2065 | /* initialize struct pages for the reserved regions */ | |
2066 | for_each_reserved_mem_range(i, &start, &end) | |
2067 | reserve_bootmem_region(start, end); | |
2068 | ||
2069 | /* and also treat struct pages for the NOMAP regions as PageReserved */ | |
2070 | for_each_mem_region(region) { | |
2071 | if (memblock_is_nomap(region)) { | |
2072 | start = region->base; | |
2073 | end = start + region->size; | |
2074 | reserve_bootmem_region(start, end); | |
2075 | } | |
2076 | } | |
2077 | } | |
2078 | ||
bda49a81 MR |
2079 | static unsigned long __init free_low_memory_core_early(void) |
2080 | { | |
2081 | unsigned long count = 0; | |
2082 | phys_addr_t start, end; | |
2083 | u64 i; | |
2084 | ||
2085 | memblock_clear_hotplug(0, -1); | |
2086 | ||
9092d4f7 | 2087 | memmap_init_reserved_pages(); |
bda49a81 MR |
2088 | |
2089 | /* | |
2090 | * We need to use NUMA_NO_NODE instead of NODE_DATA(0)->node_id | |
2091 | * because in some case like Node0 doesn't have RAM installed | |
2092 | * low ram will be on Node1 | |
2093 | */ | |
2094 | for_each_free_mem_range(i, NUMA_NO_NODE, MEMBLOCK_NONE, &start, &end, | |
2095 | NULL) | |
2096 | count += __free_memory_core(start, end); | |
2097 | ||
2098 | return count; | |
2099 | } | |
2100 | ||
2101 | static int reset_managed_pages_done __initdata; | |
2102 | ||
2103 | void reset_node_managed_pages(pg_data_t *pgdat) | |
2104 | { | |
2105 | struct zone *z; | |
2106 | ||
2107 | for (z = pgdat->node_zones; z < pgdat->node_zones + MAX_NR_ZONES; z++) | |
9705bea5 | 2108 | atomic_long_set(&z->managed_pages, 0); |
bda49a81 MR |
2109 | } |
2110 | ||
2111 | void __init reset_all_zones_managed_pages(void) | |
2112 | { | |
2113 | struct pglist_data *pgdat; | |
2114 | ||
2115 | if (reset_managed_pages_done) | |
2116 | return; | |
2117 | ||
2118 | for_each_online_pgdat(pgdat) | |
2119 | reset_node_managed_pages(pgdat); | |
2120 | ||
2121 | reset_managed_pages_done = 1; | |
2122 | } | |
2123 | ||
2124 | /** | |
2125 | * memblock_free_all - release free pages to the buddy allocator | |
bda49a81 | 2126 | */ |
097d43d8 | 2127 | void __init memblock_free_all(void) |
bda49a81 MR |
2128 | { |
2129 | unsigned long pages; | |
2130 | ||
4f5b0c17 | 2131 | free_unused_memmap(); |
bda49a81 MR |
2132 | reset_all_zones_managed_pages(); |
2133 | ||
2134 | pages = free_low_memory_core_early(); | |
ca79b0c2 | 2135 | totalram_pages_add(pages); |
bda49a81 MR |
2136 | } |
2137 | ||
350e88ba | 2138 | #if defined(CONFIG_DEBUG_FS) && defined(CONFIG_ARCH_KEEP_MEMBLOCK) |
6d03b885 BH |
2139 | |
2140 | static int memblock_debug_show(struct seq_file *m, void *private) | |
2141 | { | |
2142 | struct memblock_type *type = m->private; | |
2143 | struct memblock_region *reg; | |
2144 | int i; | |
5d63f81c | 2145 | phys_addr_t end; |
6d03b885 BH |
2146 | |
2147 | for (i = 0; i < type->cnt; i++) { | |
2148 | reg = &type->regions[i]; | |
5d63f81c | 2149 | end = reg->base + reg->size - 1; |
6d03b885 | 2150 | |
5d63f81c MC |
2151 | seq_printf(m, "%4d: ", i); |
2152 | seq_printf(m, "%pa..%pa\n", ®->base, &end); | |
6d03b885 BH |
2153 | } |
2154 | return 0; | |
2155 | } | |
5ad35093 | 2156 | DEFINE_SHOW_ATTRIBUTE(memblock_debug); |
6d03b885 BH |
2157 | |
2158 | static int __init memblock_init_debugfs(void) | |
2159 | { | |
2160 | struct dentry *root = debugfs_create_dir("memblock", NULL); | |
d9f7979c | 2161 | |
0825a6f9 JP |
2162 | debugfs_create_file("memory", 0444, root, |
2163 | &memblock.memory, &memblock_debug_fops); | |
2164 | debugfs_create_file("reserved", 0444, root, | |
2165 | &memblock.reserved, &memblock_debug_fops); | |
70210ed9 | 2166 | #ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP |
77649905 DH |
2167 | debugfs_create_file("physmem", 0444, root, &physmem, |
2168 | &memblock_debug_fops); | |
70210ed9 | 2169 | #endif |
6d03b885 BH |
2170 | |
2171 | return 0; | |
2172 | } | |
2173 | __initcall(memblock_init_debugfs); | |
2174 | ||
2175 | #endif /* CONFIG_DEBUG_FS */ |