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