Blame view
mm/memblock.c
48.5 KB
95f72d1ed
|
1 2 3 4 5 6 7 8 9 10 11 12 13 |
/* * Procedures for maintaining information about logical memory blocks. * * Peter Bergner, IBM Corp. June 2001. * Copyright (C) 2001 Peter Bergner. * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * as published by the Free Software Foundation; either version * 2 of the License, or (at your option) any later version. */ #include <linux/kernel.h> |
142b45a72
|
14 |
#include <linux/slab.h> |
95f72d1ed
|
15 16 |
#include <linux/init.h> #include <linux/bitops.h> |
449e8df39
|
17 |
#include <linux/poison.h> |
c196f76fd
|
18 |
#include <linux/pfn.h> |
6d03b885f
|
19 20 |
#include <linux/debugfs.h> #include <linux/seq_file.h> |
95f72d1ed
|
21 |
#include <linux/memblock.h> |
79442ed18
|
22 |
#include <asm-generic/sections.h> |
26f09e9b3
|
23 24 25 |
#include <linux/io.h> #include "internal.h" |
79442ed18
|
26 |
|
fe091c208
|
27 28 |
static struct memblock_region memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock; static struct memblock_region memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock; |
70210ed95
|
29 30 31 |
#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP static struct memblock_region memblock_physmem_init_regions[INIT_PHYSMEM_REGIONS] __initdata_memblock; #endif |
fe091c208
|
32 33 34 35 36 37 38 39 40 |
struct memblock memblock __initdata_memblock = { .memory.regions = memblock_memory_init_regions, .memory.cnt = 1, /* empty dummy entry */ .memory.max = INIT_MEMBLOCK_REGIONS, .reserved.regions = memblock_reserved_init_regions, .reserved.cnt = 1, /* empty dummy entry */ .reserved.max = INIT_MEMBLOCK_REGIONS, |
70210ed95
|
41 42 43 44 45 |
#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP .physmem.regions = memblock_physmem_init_regions, .physmem.cnt = 1, /* empty dummy entry */ .physmem.max = INIT_PHYSMEM_REGIONS, #endif |
79442ed18
|
46 |
.bottom_up = false, |
fe091c208
|
47 48 |
.current_limit = MEMBLOCK_ALLOC_ANYWHERE, }; |
95f72d1ed
|
49 |
|
10d064398
|
50 |
int memblock_debug __initdata_memblock; |
55ac590c2
|
51 52 53 |
#ifdef CONFIG_MOVABLE_NODE bool movable_node_enabled __initdata_memblock = false; #endif |
a3f5bafcc
|
54 |
static bool system_has_some_mirror __initdata_memblock = false; |
1aadc0560
|
55 |
static int memblock_can_resize __initdata_memblock; |
181eb3942
|
56 57 |
static int memblock_memory_in_slab __initdata_memblock = 0; static int memblock_reserved_in_slab __initdata_memblock = 0; |
95f72d1ed
|
58 |
|
a3f5bafcc
|
59 60 61 62 |
ulong __init_memblock choose_memblock_flags(void) { return system_has_some_mirror ? MEMBLOCK_MIRROR : MEMBLOCK_NONE; } |
142b45a72
|
63 |
/* inline so we don't get a warning when pr_debug is compiled out */ |
c22331166
|
64 65 |
static __init_memblock const char * memblock_type_name(struct memblock_type *type) |
142b45a72
|
66 67 68 69 70 71 72 73 |
{ if (type == &memblock.memory) return "memory"; else if (type == &memblock.reserved) return "reserved"; else return "unknown"; } |
eb18f1b5b
|
74 75 76 77 78 |
/* adjust *@size so that (@base + *@size) doesn't overflow, return new size */ static inline phys_addr_t memblock_cap_size(phys_addr_t base, phys_addr_t *size) { return *size = min(*size, (phys_addr_t)ULLONG_MAX - base); } |
6ed311b28
|
79 80 81 |
/* * Address comparison utilities */ |
10d064398
|
82 |
static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1, |
2898cc4cd
|
83 |
phys_addr_t base2, phys_addr_t size2) |
95f72d1ed
|
84 85 86 |
{ return ((base1 < (base2 + size2)) && (base2 < (base1 + size1))); } |
95cf82ecc
|
87 |
bool __init_memblock memblock_overlaps_region(struct memblock_type *type, |
2d7d3eb2b
|
88 |
phys_addr_t base, phys_addr_t size) |
6ed311b28
|
89 90 |
{ unsigned long i; |
f14516fbf
|
91 92 93 |
for (i = 0; i < type->cnt; i++) if (memblock_addrs_overlap(base, size, type->regions[i].base, type->regions[i].size)) |
6ed311b28
|
94 |
break; |
c5c5c9d10
|
95 |
return i < type->cnt; |
6ed311b28
|
96 |
} |
79442ed18
|
97 98 99 100 101 102 |
/* * __memblock_find_range_bottom_up - find free area utility in bottom-up * @start: start of candidate range * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE} * @size: size of free area to find * @align: alignment of free area to find |
b11542335
|
103 |
* @nid: nid of the free area to find, %NUMA_NO_NODE for any node |
fc6daaf93
|
104 |
* @flags: pick from blocks based on memory attributes |
79442ed18
|
105 106 107 108 109 110 111 112 |
* * Utility called from memblock_find_in_range_node(), find free area bottom-up. * * RETURNS: * Found address on success, 0 on failure. */ static phys_addr_t __init_memblock __memblock_find_range_bottom_up(phys_addr_t start, phys_addr_t end, |
fc6daaf93
|
113 114 |
phys_addr_t size, phys_addr_t align, int nid, ulong flags) |
79442ed18
|
115 116 117 |
{ phys_addr_t this_start, this_end, cand; u64 i; |
fc6daaf93
|
118 |
for_each_free_mem_range(i, nid, flags, &this_start, &this_end, NULL) { |
79442ed18
|
119 120 121 122 123 124 125 126 127 128 |
this_start = clamp(this_start, start, end); this_end = clamp(this_end, start, end); cand = round_up(this_start, align); if (cand < this_end && this_end - cand >= size) return cand; } return 0; } |
7bd0b0f0d
|
129 |
/** |
1402899e4
|
130 |
* __memblock_find_range_top_down - find free area utility, in top-down |
7bd0b0f0d
|
131 132 133 134 |
* @start: start of candidate range * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE} * @size: size of free area to find * @align: alignment of free area to find |
b11542335
|
135 |
* @nid: nid of the free area to find, %NUMA_NO_NODE for any node |
fc6daaf93
|
136 |
* @flags: pick from blocks based on memory attributes |
7bd0b0f0d
|
137 |
* |
1402899e4
|
138 |
* Utility called from memblock_find_in_range_node(), find free area top-down. |
7bd0b0f0d
|
139 140 |
* * RETURNS: |
79442ed18
|
141 |
* Found address on success, 0 on failure. |
6ed311b28
|
142 |
*/ |
1402899e4
|
143 144 |
static phys_addr_t __init_memblock __memblock_find_range_top_down(phys_addr_t start, phys_addr_t end, |
fc6daaf93
|
145 146 |
phys_addr_t size, phys_addr_t align, int nid, ulong flags) |
f7210e6c4
|
147 148 149 |
{ phys_addr_t this_start, this_end, cand; u64 i; |
fc6daaf93
|
150 151 |
for_each_free_mem_range_reverse(i, nid, flags, &this_start, &this_end, NULL) { |
f7210e6c4
|
152 153 154 155 156 157 158 159 160 161 |
this_start = clamp(this_start, start, end); this_end = clamp(this_end, start, end); if (this_end < size) continue; cand = round_down(this_end - size, align); if (cand >= this_start) return cand; } |
1402899e4
|
162 |
|
f7210e6c4
|
163 164 |
return 0; } |
6ed311b28
|
165 |
|
7bd0b0f0d
|
166 |
/** |
1402899e4
|
167 |
* memblock_find_in_range_node - find free area in given range and node |
1402899e4
|
168 169 |
* @size: size of free area to find * @align: alignment of free area to find |
87029ee93
|
170 171 |
* @start: start of candidate range * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE} |
b11542335
|
172 |
* @nid: nid of the free area to find, %NUMA_NO_NODE for any node |
fc6daaf93
|
173 |
* @flags: pick from blocks based on memory attributes |
1402899e4
|
174 175 176 |
* * Find @size free area aligned to @align in the specified range and node. * |
79442ed18
|
177 178 179 180 181 182 183 184 |
* When allocation direction is bottom-up, the @start should be greater * than the end of the kernel image. Otherwise, it will be trimmed. The * reason is that we want the bottom-up allocation just near the kernel * image so it is highly likely that the allocated memory and the kernel * will reside in the same node. * * If bottom-up allocation failed, will try to allocate memory top-down. * |
1402899e4
|
185 |
* RETURNS: |
79442ed18
|
186 |
* Found address on success, 0 on failure. |
1402899e4
|
187 |
*/ |
87029ee93
|
188 189 |
phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t size, phys_addr_t align, phys_addr_t start, |
fc6daaf93
|
190 |
phys_addr_t end, int nid, ulong flags) |
1402899e4
|
191 |
{ |
0cfb8f0c3
|
192 |
phys_addr_t kernel_end, ret; |
79442ed18
|
193 |
|
1402899e4
|
194 195 196 197 198 199 200 |
/* pump up @end */ if (end == MEMBLOCK_ALLOC_ACCESSIBLE) end = memblock.current_limit; /* avoid allocating the first page */ start = max_t(phys_addr_t, start, PAGE_SIZE); end = max(start, end); |
79442ed18
|
201 202 203 204 205 206 207 208 209 210 211 212 213 214 |
kernel_end = __pa_symbol(_end); /* * try bottom-up allocation only when bottom-up mode * is set and @end is above the kernel image. */ if (memblock_bottom_up() && end > kernel_end) { phys_addr_t bottom_up_start; /* make sure we will allocate above the kernel */ bottom_up_start = max(start, kernel_end); /* ok, try bottom-up allocation first */ ret = __memblock_find_range_bottom_up(bottom_up_start, end, |
fc6daaf93
|
215 |
size, align, nid, flags); |
79442ed18
|
216 217 218 219 220 221 222 223 224 225 226 227 228 |
if (ret) return ret; /* * we always limit bottom-up allocation above the kernel, * but top-down allocation doesn't have the limit, so * retrying top-down allocation may succeed when bottom-up * allocation failed. * * bottom-up allocation is expected to be fail very rarely, * so we use WARN_ONCE() here to see the stack trace if * fail happens. */ |
756a025f0
|
229 230 |
WARN_ONCE(1, "memblock: bottom-up allocation failed, memory hotunplug may be affected "); |
79442ed18
|
231 |
} |
1402899e4
|
232 |
|
fc6daaf93
|
233 234 |
return __memblock_find_range_top_down(start, end, size, align, nid, flags); |
1402899e4
|
235 236 237 |
} /** |
7bd0b0f0d
|
238 239 240 241 242 243 244 245 246 |
* memblock_find_in_range - find free area in given range * @start: start of candidate range * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE} * @size: size of free area to find * @align: alignment of free area to find * * Find @size free area aligned to @align in the specified range. * * RETURNS: |
79442ed18
|
247 |
* Found address on success, 0 on failure. |
fc769a8e7
|
248 |
*/ |
7bd0b0f0d
|
249 250 251 |
phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start, phys_addr_t end, phys_addr_t size, phys_addr_t align) |
6ed311b28
|
252 |
{ |
a3f5bafcc
|
253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 |
phys_addr_t ret; ulong flags = choose_memblock_flags(); again: ret = memblock_find_in_range_node(size, align, start, end, NUMA_NO_NODE, flags); if (!ret && (flags & MEMBLOCK_MIRROR)) { pr_warn("Could not allocate %pap bytes of mirrored memory ", &size); flags &= ~MEMBLOCK_MIRROR; goto again; } return ret; |
6ed311b28
|
269 |
} |
10d064398
|
270 |
static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r) |
95f72d1ed
|
271 |
{ |
1440c4e2c
|
272 |
type->total_size -= type->regions[r].size; |
7c0caeb86
|
273 274 |
memmove(&type->regions[r], &type->regions[r + 1], (type->cnt - (r + 1)) * sizeof(type->regions[r])); |
e3239ff92
|
275 |
type->cnt--; |
95f72d1ed
|
276 |
|
8f7a66051
|
277 278 |
/* Special case for empty arrays */ if (type->cnt == 0) { |
1440c4e2c
|
279 |
WARN_ON(type->total_size != 0); |
8f7a66051
|
280 281 282 |
type->cnt = 1; type->regions[0].base = 0; type->regions[0].size = 0; |
66a207572
|
283 |
type->regions[0].flags = 0; |
7c0caeb86
|
284 |
memblock_set_region_node(&type->regions[0], MAX_NUMNODES); |
8f7a66051
|
285 |
} |
95f72d1ed
|
286 |
} |
354f17e1e
|
287 |
#ifdef CONFIG_ARCH_DISCARD_MEMBLOCK |
29f673860
|
288 289 290 291 292 293 294 295 296 297 298 |
phys_addr_t __init_memblock get_allocated_memblock_reserved_regions_info( phys_addr_t *addr) { if (memblock.reserved.regions == memblock_reserved_init_regions) return 0; *addr = __pa(memblock.reserved.regions); return PAGE_ALIGN(sizeof(struct memblock_region) * memblock.reserved.max); } |
5e270e254
|
299 300 301 302 303 304 305 306 307 308 309 310 311 |
phys_addr_t __init_memblock get_allocated_memblock_memory_regions_info( phys_addr_t *addr) { if (memblock.memory.regions == memblock_memory_init_regions) return 0; *addr = __pa(memblock.memory.regions); return PAGE_ALIGN(sizeof(struct memblock_region) * memblock.memory.max); } #endif |
48c3b583b
|
312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 |
/** * memblock_double_array - double the size of the memblock regions array * @type: memblock type of the regions array being doubled * @new_area_start: starting address of memory range to avoid overlap with * @new_area_size: size of memory range to avoid overlap with * * Double the size of the @type regions array. If memblock is being used to * allocate memory for a new reserved regions array and there is a previously * allocated memory range [@new_area_start,@new_area_start+@new_area_size] * waiting to be reserved, ensure the memory used by the new array does * not overlap. * * RETURNS: * 0 on success, -1 on failure. */ static int __init_memblock memblock_double_array(struct memblock_type *type, phys_addr_t new_area_start, phys_addr_t new_area_size) |
142b45a72
|
330 331 |
{ struct memblock_region *new_array, *old_array; |
29f673860
|
332 |
phys_addr_t old_alloc_size, new_alloc_size; |
142b45a72
|
333 334 |
phys_addr_t old_size, new_size, addr; int use_slab = slab_is_available(); |
181eb3942
|
335 |
int *in_slab; |
142b45a72
|
336 337 338 339 340 341 |
/* We don't allow resizing until we know about the reserved regions * of memory that aren't suitable for allocation */ if (!memblock_can_resize) return -1; |
142b45a72
|
342 343 344 |
/* Calculate new doubled size */ old_size = type->max * sizeof(struct memblock_region); new_size = old_size << 1; |
29f673860
|
345 346 347 348 349 350 |
/* * We need to allocated new one align to PAGE_SIZE, * so we can free them completely later. */ old_alloc_size = PAGE_ALIGN(old_size); new_alloc_size = PAGE_ALIGN(new_size); |
142b45a72
|
351 |
|
181eb3942
|
352 353 354 355 356 |
/* Retrieve the slab flag */ if (type == &memblock.memory) in_slab = &memblock_memory_in_slab; else in_slab = &memblock_reserved_in_slab; |
142b45a72
|
357 358 359 |
/* Try to find some space for it. * * WARNING: We assume that either slab_is_available() and we use it or |
fd07383b6
|
360 361 362 |
* we use MEMBLOCK for allocations. That means that this is unsafe to * use when bootmem is currently active (unless bootmem itself is * implemented on top of MEMBLOCK which isn't the case yet) |
142b45a72
|
363 364 |
* * This should however not be an issue for now, as we currently only |
fd07383b6
|
365 366 |
* call into MEMBLOCK while it's still active, or much later when slab * is active for memory hotplug operations |
142b45a72
|
367 368 369 |
*/ if (use_slab) { new_array = kmalloc(new_size, GFP_KERNEL); |
1f5026a7e
|
370 |
addr = new_array ? __pa(new_array) : 0; |
4e2f07750
|
371 |
} else { |
48c3b583b
|
372 373 374 375 376 377 |
/* only exclude range when trying to double reserved.regions */ if (type != &memblock.reserved) new_area_start = new_area_size = 0; addr = memblock_find_in_range(new_area_start + new_area_size, memblock.current_limit, |
29f673860
|
378 |
new_alloc_size, PAGE_SIZE); |
48c3b583b
|
379 380 |
if (!addr && new_area_size) addr = memblock_find_in_range(0, |
fd07383b6
|
381 382 |
min(new_area_start, memblock.current_limit), new_alloc_size, PAGE_SIZE); |
48c3b583b
|
383 |
|
15674868d
|
384 |
new_array = addr ? __va(addr) : NULL; |
4e2f07750
|
385 |
} |
1f5026a7e
|
386 |
if (!addr) { |
142b45a72
|
387 388 389 390 391 |
pr_err("memblock: Failed to double %s array from %ld to %ld entries ! ", memblock_type_name(type), type->max, type->max * 2); return -1; } |
142b45a72
|
392 |
|
fd07383b6
|
393 394 395 |
memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]", memblock_type_name(type), type->max * 2, (u64)addr, (u64)addr + new_size - 1); |
ea9e4376b
|
396 |
|
fd07383b6
|
397 398 399 400 |
/* * Found space, we now need to move the array over before we add the * reserved region since it may be our reserved array itself that is * full. |
142b45a72
|
401 402 403 404 405 406 |
*/ memcpy(new_array, type->regions, old_size); memset(new_array + type->max, 0, old_size); old_array = type->regions; type->regions = new_array; type->max <<= 1; |
fd07383b6
|
407 |
/* Free old array. We needn't free it if the array is the static one */ |
181eb3942
|
408 409 410 411 |
if (*in_slab) kfree(old_array); else if (old_array != memblock_memory_init_regions && old_array != memblock_reserved_init_regions) |
29f673860
|
412 |
memblock_free(__pa(old_array), old_alloc_size); |
142b45a72
|
413 |
|
fd07383b6
|
414 415 416 |
/* * Reserve the new array if that comes from the memblock. Otherwise, we * needn't do it |
181eb3942
|
417 418 |
*/ if (!use_slab) |
29f673860
|
419 |
BUG_ON(memblock_reserve(addr, new_alloc_size)); |
181eb3942
|
420 421 422 |
/* Update slab flag */ *in_slab = use_slab; |
142b45a72
|
423 424 |
return 0; } |
784656f9c
|
425 426 427 428 429 430 431 |
/** * memblock_merge_regions - merge neighboring compatible regions * @type: memblock type to scan * * Scan @type and merge neighboring compatible regions. */ static void __init_memblock memblock_merge_regions(struct memblock_type *type) |
95f72d1ed
|
432 |
{ |
784656f9c
|
433 |
int i = 0; |
95f72d1ed
|
434 |
|
784656f9c
|
435 436 437 438 |
/* cnt never goes below 1 */ while (i < type->cnt - 1) { struct memblock_region *this = &type->regions[i]; struct memblock_region *next = &type->regions[i + 1]; |
95f72d1ed
|
439 |
|
7c0caeb86
|
440 441 |
if (this->base + this->size != next->base || memblock_get_region_node(this) != |
66a207572
|
442 443 |
memblock_get_region_node(next) || this->flags != next->flags) { |
784656f9c
|
444 445 446 |
BUG_ON(this->base + this->size > next->base); i++; continue; |
8f7a66051
|
447 |
} |
784656f9c
|
448 |
this->size += next->size; |
c0232ae86
|
449 450 |
/* move forward from next + 1, index of which is i + 2 */ memmove(next, next + 1, (type->cnt - (i + 2)) * sizeof(*next)); |
784656f9c
|
451 |
type->cnt--; |
95f72d1ed
|
452 |
} |
784656f9c
|
453 |
} |
95f72d1ed
|
454 |
|
784656f9c
|
455 456 |
/** * memblock_insert_region - insert new memblock region |
209ff86d6
|
457 458 459 460 461 |
* @type: memblock type to insert into * @idx: index for the insertion point * @base: base address of the new region * @size: size of the new region * @nid: node id of the new region |
66a207572
|
462 |
* @flags: flags of the new region |
784656f9c
|
463 464 465 466 467 468 |
* * Insert new memblock region [@base,@base+@size) into @type at @idx. * @type must already have extra room to accomodate the new region. */ static void __init_memblock memblock_insert_region(struct memblock_type *type, int idx, phys_addr_t base, |
66a207572
|
469 470 |
phys_addr_t size, int nid, unsigned long flags) |
784656f9c
|
471 472 473 474 475 476 477 |
{ struct memblock_region *rgn = &type->regions[idx]; BUG_ON(type->cnt >= type->max); memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn)); rgn->base = base; rgn->size = size; |
66a207572
|
478 |
rgn->flags = flags; |
7c0caeb86
|
479 |
memblock_set_region_node(rgn, nid); |
784656f9c
|
480 |
type->cnt++; |
1440c4e2c
|
481 |
type->total_size += size; |
784656f9c
|
482 483 484 |
} /** |
f1af9d3af
|
485 |
* memblock_add_range - add new memblock region |
784656f9c
|
486 487 488 |
* @type: memblock type to add new region into * @base: base address of the new region * @size: size of the new region |
7fb0bc3f0
|
489 |
* @nid: nid of the new region |
66a207572
|
490 |
* @flags: flags of the new region |
784656f9c
|
491 492 493 494 495 496 497 498 499 |
* * Add new memblock region [@base,@base+@size) into @type. The new region * is allowed to overlap with existing ones - overlaps don't affect already * existing regions. @type is guaranteed to be minimal (all neighbouring * compatible regions are merged) after the addition. * * RETURNS: * 0 on success, -errno on failure. */ |
f1af9d3af
|
500 |
int __init_memblock memblock_add_range(struct memblock_type *type, |
66a207572
|
501 502 |
phys_addr_t base, phys_addr_t size, int nid, unsigned long flags) |
784656f9c
|
503 504 |
{ bool insert = false; |
eb18f1b5b
|
505 506 |
phys_addr_t obase = base; phys_addr_t end = base + memblock_cap_size(base, &size); |
8c9c1701c
|
507 508 |
int idx, nr_new; struct memblock_region *rgn; |
784656f9c
|
509 |
|
b3dc627ca
|
510 511 |
if (!size) return 0; |
784656f9c
|
512 513 |
/* special case for empty array */ if (type->regions[0].size == 0) { |
1440c4e2c
|
514 |
WARN_ON(type->cnt != 1 || type->total_size); |
8f7a66051
|
515 516 |
type->regions[0].base = base; type->regions[0].size = size; |
66a207572
|
517 |
type->regions[0].flags = flags; |
7fb0bc3f0
|
518 |
memblock_set_region_node(&type->regions[0], nid); |
1440c4e2c
|
519 |
type->total_size = size; |
8f7a66051
|
520 |
return 0; |
95f72d1ed
|
521 |
} |
784656f9c
|
522 523 524 525 526 |
repeat: /* * The following is executed twice. Once with %false @insert and * then with %true. The first counts the number of regions needed * to accomodate the new area. The second actually inserts them. |
142b45a72
|
527 |
*/ |
784656f9c
|
528 529 |
base = obase; nr_new = 0; |
95f72d1ed
|
530 |
|
8c9c1701c
|
531 |
for_each_memblock_type(type, rgn) { |
784656f9c
|
532 533 534 535 |
phys_addr_t rbase = rgn->base; phys_addr_t rend = rbase + rgn->size; if (rbase >= end) |
95f72d1ed
|
536 |
break; |
784656f9c
|
537 538 539 540 541 542 543 |
if (rend <= base) continue; /* * @rgn overlaps. If it separates the lower part of new * area, insert that portion. */ if (rbase > base) { |
c0a294988
|
544 545 546 |
#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP WARN_ON(nid != memblock_get_region_node(rgn)); #endif |
4fcab5f43
|
547 |
WARN_ON(flags != rgn->flags); |
784656f9c
|
548 549 |
nr_new++; if (insert) |
8c9c1701c
|
550 |
memblock_insert_region(type, idx++, base, |
66a207572
|
551 552 |
rbase - base, nid, flags); |
95f72d1ed
|
553 |
} |
784656f9c
|
554 555 |
/* area below @rend is dealt with, forget about it */ base = min(rend, end); |
95f72d1ed
|
556 |
} |
784656f9c
|
557 558 559 560 561 |
/* insert the remaining portion */ if (base < end) { nr_new++; if (insert) |
8c9c1701c
|
562 |
memblock_insert_region(type, idx, base, end - base, |
66a207572
|
563 |
nid, flags); |
95f72d1ed
|
564 |
} |
95f72d1ed
|
565 |
|
784656f9c
|
566 567 568 |
/* * If this was the first round, resize array and repeat for actual * insertions; otherwise, merge and return. |
142b45a72
|
569 |
*/ |
784656f9c
|
570 571 |
if (!insert) { while (type->cnt + nr_new > type->max) |
48c3b583b
|
572 |
if (memblock_double_array(type, obase, size) < 0) |
784656f9c
|
573 574 575 576 577 578 |
return -ENOMEM; insert = true; goto repeat; } else { memblock_merge_regions(type); return 0; |
142b45a72
|
579 |
} |
95f72d1ed
|
580 |
} |
7fb0bc3f0
|
581 582 583 |
int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size, int nid) { |
f1af9d3af
|
584 |
return memblock_add_range(&memblock.memory, base, size, nid, 0); |
7fb0bc3f0
|
585 |
} |
6a4055bc7
|
586 587 588 589 590 |
static int __init_memblock memblock_add_region(phys_addr_t base, phys_addr_t size, int nid, unsigned long flags) { |
6a4055bc7
|
591 592 593 594 595 |
memblock_dbg("memblock_add: [%#016llx-%#016llx] flags %#02lx %pF ", (unsigned long long)base, (unsigned long long)base + size - 1, flags, (void *)_RET_IP_); |
5aa174801
|
596 |
return memblock_add_range(&memblock.memory, base, size, nid, flags); |
6a4055bc7
|
597 |
} |
581adcbe1
|
598 |
int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size) |
95f72d1ed
|
599 |
{ |
6a4055bc7
|
600 |
return memblock_add_region(base, size, MAX_NUMNODES, 0); |
95f72d1ed
|
601 |
} |
6a9ceb31c
|
602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 |
/** * memblock_isolate_range - isolate given range into disjoint memblocks * @type: memblock type to isolate range for * @base: base of range to isolate * @size: size of range to isolate * @start_rgn: out parameter for the start of isolated region * @end_rgn: out parameter for the end of isolated region * * Walk @type and ensure that regions don't cross the boundaries defined by * [@base,@base+@size). Crossing regions are split at the boundaries, * which may create at most two more regions. The index of the first * region inside the range is returned in *@start_rgn and end in *@end_rgn. * * RETURNS: * 0 on success, -errno on failure. */ static int __init_memblock memblock_isolate_range(struct memblock_type *type, phys_addr_t base, phys_addr_t size, int *start_rgn, int *end_rgn) { |
eb18f1b5b
|
622 |
phys_addr_t end = base + memblock_cap_size(base, &size); |
8c9c1701c
|
623 624 |
int idx; struct memblock_region *rgn; |
6a9ceb31c
|
625 626 |
*start_rgn = *end_rgn = 0; |
b3dc627ca
|
627 628 |
if (!size) return 0; |
6a9ceb31c
|
629 630 |
/* we'll create at most two more regions */ while (type->cnt + 2 > type->max) |
48c3b583b
|
631 |
if (memblock_double_array(type, base, size) < 0) |
6a9ceb31c
|
632 |
return -ENOMEM; |
8c9c1701c
|
633 |
for_each_memblock_type(type, rgn) { |
6a9ceb31c
|
634 635 636 637 638 639 640 641 642 643 644 645 646 647 |
phys_addr_t rbase = rgn->base; phys_addr_t rend = rbase + rgn->size; if (rbase >= end) break; if (rend <= base) continue; if (rbase < base) { /* * @rgn intersects from below. Split and continue * to process the next region - the new top half. */ rgn->base = base; |
1440c4e2c
|
648 649 |
rgn->size -= base - rbase; type->total_size -= base - rbase; |
8c9c1701c
|
650 |
memblock_insert_region(type, idx, rbase, base - rbase, |
66a207572
|
651 652 |
memblock_get_region_node(rgn), rgn->flags); |
6a9ceb31c
|
653 654 655 656 657 658 |
} else if (rend > end) { /* * @rgn intersects from above. Split and redo the * current region - the new bottom half. */ rgn->base = end; |
1440c4e2c
|
659 660 |
rgn->size -= end - rbase; type->total_size -= end - rbase; |
8c9c1701c
|
661 |
memblock_insert_region(type, idx--, rbase, end - rbase, |
66a207572
|
662 663 |
memblock_get_region_node(rgn), rgn->flags); |
6a9ceb31c
|
664 665 666 |
} else { /* @rgn is fully contained, record it */ if (!*end_rgn) |
8c9c1701c
|
667 668 |
*start_rgn = idx; *end_rgn = idx + 1; |
6a9ceb31c
|
669 670 671 672 673 |
} } return 0; } |
6a9ceb31c
|
674 |
|
35bd16a22
|
675 |
static int __init_memblock memblock_remove_range(struct memblock_type *type, |
f1af9d3af
|
676 |
phys_addr_t base, phys_addr_t size) |
95f72d1ed
|
677 |
{ |
719361809
|
678 679 |
int start_rgn, end_rgn; int i, ret; |
95f72d1ed
|
680 |
|
719361809
|
681 682 683 |
ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn); if (ret) return ret; |
95f72d1ed
|
684 |
|
719361809
|
685 686 |
for (i = end_rgn - 1; i >= start_rgn; i--) memblock_remove_region(type, i); |
8f7a66051
|
687 |
return 0; |
95f72d1ed
|
688 |
} |
581adcbe1
|
689 |
int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size) |
95f72d1ed
|
690 |
{ |
f1af9d3af
|
691 |
return memblock_remove_range(&memblock.memory, base, size); |
95f72d1ed
|
692 |
} |
f1af9d3af
|
693 |
|
581adcbe1
|
694 |
int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size) |
95f72d1ed
|
695 |
{ |
24aa07882
|
696 697 |
memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF ", |
a150439c4
|
698 |
(unsigned long long)base, |
931d13f53
|
699 |
(unsigned long long)base + size - 1, |
a150439c4
|
700 |
(void *)_RET_IP_); |
24aa07882
|
701 |
|
aedf95ea0
|
702 |
kmemleak_free_part(__va(base), size); |
f1af9d3af
|
703 |
return memblock_remove_range(&memblock.reserved, base, size); |
95f72d1ed
|
704 |
} |
66a207572
|
705 706 707 708 |
static int __init_memblock memblock_reserve_region(phys_addr_t base, phys_addr_t size, int nid, unsigned long flags) |
95f72d1ed
|
709 |
{ |
66a207572
|
710 711 |
memblock_dbg("memblock_reserve: [%#016llx-%#016llx] flags %#02lx %pF ", |
a150439c4
|
712 |
(unsigned long long)base, |
931d13f53
|
713 |
(unsigned long long)base + size - 1, |
66a207572
|
714 |
flags, (void *)_RET_IP_); |
5aa174801
|
715 |
return memblock_add_range(&memblock.reserved, base, size, nid, flags); |
66a207572
|
716 |
} |
95f72d1ed
|
717 |
|
66a207572
|
718 719 720 |
int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size) { return memblock_reserve_region(base, size, MAX_NUMNODES, 0); |
95f72d1ed
|
721 |
} |
35fd0808d
|
722 |
/** |
66b16edf9
|
723 |
* |
4308ce17f
|
724 |
* This function isolates region [@base, @base + @size), and sets/clears flag |
66b16edf9
|
725 |
* |
c11539315
|
726 |
* Return 0 on success, -errno on failure. |
66b16edf9
|
727 |
*/ |
4308ce17f
|
728 729 |
static int __init_memblock memblock_setclr_flag(phys_addr_t base, phys_addr_t size, int set, int flag) |
66b16edf9
|
730 731 732 733 734 735 736 737 738 |
{ struct memblock_type *type = &memblock.memory; int i, ret, start_rgn, end_rgn; ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn); if (ret) return ret; for (i = start_rgn; i < end_rgn; i++) |
4308ce17f
|
739 740 741 742 |
if (set) memblock_set_region_flags(&type->regions[i], flag); else memblock_clear_region_flags(&type->regions[i], flag); |
66b16edf9
|
743 744 745 746 747 748 |
memblock_merge_regions(type); return 0; } /** |
4308ce17f
|
749 |
* memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG. |
66b16edf9
|
750 751 752 |
* @base: the base phys addr of the region * @size: the size of the region * |
c11539315
|
753 |
* Return 0 on success, -errno on failure. |
4308ce17f
|
754 755 756 757 758 759 760 761 762 763 |
*/ int __init_memblock memblock_mark_hotplug(phys_addr_t base, phys_addr_t size) { return memblock_setclr_flag(base, size, 1, MEMBLOCK_HOTPLUG); } /** * memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region. * @base: the base phys addr of the region * @size: the size of the region |
66b16edf9
|
764 |
* |
c11539315
|
765 |
* Return 0 on success, -errno on failure. |
66b16edf9
|
766 767 768 |
*/ int __init_memblock memblock_clear_hotplug(phys_addr_t base, phys_addr_t size) { |
4308ce17f
|
769 |
return memblock_setclr_flag(base, size, 0, MEMBLOCK_HOTPLUG); |
66b16edf9
|
770 771 772 |
} /** |
a3f5bafcc
|
773 774 775 776 |
* memblock_mark_mirror - Mark mirrored memory with flag MEMBLOCK_MIRROR. * @base: the base phys addr of the region * @size: the size of the region * |
c11539315
|
777 |
* Return 0 on success, -errno on failure. |
a3f5bafcc
|
778 779 780 781 782 783 784 |
*/ int __init_memblock memblock_mark_mirror(phys_addr_t base, phys_addr_t size) { system_has_some_mirror = true; return memblock_setclr_flag(base, size, 1, MEMBLOCK_MIRROR); } |
bf3d3cc58
|
785 786 787 788 789 790 791 792 793 794 795 |
/** * memblock_mark_nomap - Mark a memory region with flag MEMBLOCK_NOMAP. * @base: the base phys addr of the region * @size: the size of the region * * Return 0 on success, -errno on failure. */ int __init_memblock memblock_mark_nomap(phys_addr_t base, phys_addr_t size) { return memblock_setclr_flag(base, size, 1, MEMBLOCK_NOMAP); } |
a3f5bafcc
|
796 797 |
/** |
8e7a7f861
|
798 799 800 801 802 803 804 805 806 807 808 |
* __next_reserved_mem_region - next function for for_each_reserved_region() * @idx: pointer to u64 loop variable * @out_start: ptr to phys_addr_t for start address of the region, can be %NULL * @out_end: ptr to phys_addr_t for end address of the region, can be %NULL * * Iterate over all reserved memory regions. */ void __init_memblock __next_reserved_mem_region(u64 *idx, phys_addr_t *out_start, phys_addr_t *out_end) { |
567d117b8
|
809 |
struct memblock_type *type = &memblock.reserved; |
8e7a7f861
|
810 |
|
567d117b8
|
811 812 |
if (*idx >= 0 && *idx < type->cnt) { struct memblock_region *r = &type->regions[*idx]; |
8e7a7f861
|
813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 |
phys_addr_t base = r->base; phys_addr_t size = r->size; if (out_start) *out_start = base; if (out_end) *out_end = base + size - 1; *idx += 1; return; } /* signal end of iteration */ *idx = ULLONG_MAX; } /** |
f1af9d3af
|
830 |
* __next__mem_range - next function for for_each_free_mem_range() etc. |
35fd0808d
|
831 |
* @idx: pointer to u64 loop variable |
b11542335
|
832 |
* @nid: node selector, %NUMA_NO_NODE for all nodes |
fc6daaf93
|
833 |
* @flags: pick from blocks based on memory attributes |
f1af9d3af
|
834 835 |
* @type_a: pointer to memblock_type from where the range is taken * @type_b: pointer to memblock_type which excludes memory from being taken |
dad7557eb
|
836 837 838 |
* @out_start: ptr to phys_addr_t for start address of the range, can be %NULL * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL * @out_nid: ptr to int for nid of the range, can be %NULL |
35fd0808d
|
839 |
* |
f1af9d3af
|
840 |
* Find the first area from *@idx which matches @nid, fill the out |
35fd0808d
|
841 |
* parameters, and update *@idx for the next iteration. The lower 32bit of |
f1af9d3af
|
842 843 |
* *@idx contains index into type_a and the upper 32bit indexes the * areas before each region in type_b. For example, if type_b regions |
35fd0808d
|
844 845 846 847 848 849 850 851 852 853 854 |
* look like the following, * * 0:[0-16), 1:[32-48), 2:[128-130) * * The upper 32bit indexes the following regions. * * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX) * * As both region arrays are sorted, the function advances the two indices * in lockstep and returns each intersection. */ |
fc6daaf93
|
855 |
void __init_memblock __next_mem_range(u64 *idx, int nid, ulong flags, |
f1af9d3af
|
856 857 858 859 |
struct memblock_type *type_a, struct memblock_type *type_b, phys_addr_t *out_start, phys_addr_t *out_end, int *out_nid) |
35fd0808d
|
860 |
{ |
f1af9d3af
|
861 862 |
int idx_a = *idx & 0xffffffff; int idx_b = *idx >> 32; |
b11542335
|
863 |
|
f1af9d3af
|
864 865 866 |
if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead ")) |
560dca27a
|
867 |
nid = NUMA_NO_NODE; |
35fd0808d
|
868 |
|
f1af9d3af
|
869 870 |
for (; idx_a < type_a->cnt; idx_a++) { struct memblock_region *m = &type_a->regions[idx_a]; |
35fd0808d
|
871 872 |
phys_addr_t m_start = m->base; phys_addr_t m_end = m->base + m->size; |
f1af9d3af
|
873 |
int m_nid = memblock_get_region_node(m); |
35fd0808d
|
874 875 |
/* only memory regions are associated with nodes, check it */ |
f1af9d3af
|
876 |
if (nid != NUMA_NO_NODE && nid != m_nid) |
35fd0808d
|
877 |
continue; |
0a313a998
|
878 879 880 |
/* skip hotpluggable memory regions if needed */ if (movable_node_is_enabled() && memblock_is_hotpluggable(m)) continue; |
a3f5bafcc
|
881 882 883 |
/* if we want mirror memory skip non-mirror memory regions */ if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m)) continue; |
bf3d3cc58
|
884 885 886 |
/* skip nomap memory unless we were asked for it explicitly */ if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m)) continue; |
f1af9d3af
|
887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 |
if (!type_b) { if (out_start) *out_start = m_start; if (out_end) *out_end = m_end; if (out_nid) *out_nid = m_nid; idx_a++; *idx = (u32)idx_a | (u64)idx_b << 32; return; } /* scan areas before each reservation */ for (; idx_b < type_b->cnt + 1; idx_b++) { struct memblock_region *r; phys_addr_t r_start; phys_addr_t r_end; r = &type_b->regions[idx_b]; r_start = idx_b ? r[-1].base + r[-1].size : 0; r_end = idx_b < type_b->cnt ? r->base : ULLONG_MAX; |
35fd0808d
|
909 |
|
f1af9d3af
|
910 911 912 913 |
/* * if idx_b advanced past idx_a, * break out to advance idx_a */ |
35fd0808d
|
914 915 916 917 918 |
if (r_start >= m_end) break; /* if the two regions intersect, we're done */ if (m_start < r_end) { if (out_start) |
f1af9d3af
|
919 920 |
*out_start = max(m_start, r_start); |
35fd0808d
|
921 922 923 |
if (out_end) *out_end = min(m_end, r_end); if (out_nid) |
f1af9d3af
|
924 |
*out_nid = m_nid; |
35fd0808d
|
925 |
/* |
f1af9d3af
|
926 927 |
* The region which ends first is * advanced for the next iteration. |
35fd0808d
|
928 929 |
*/ if (m_end <= r_end) |
f1af9d3af
|
930 |
idx_a++; |
35fd0808d
|
931 |
else |
f1af9d3af
|
932 933 |
idx_b++; *idx = (u32)idx_a | (u64)idx_b << 32; |
35fd0808d
|
934 935 936 937 938 939 940 941 |
return; } } } /* signal end of iteration */ *idx = ULLONG_MAX; } |
7bd0b0f0d
|
942 |
/** |
f1af9d3af
|
943 944 945 946 947 |
* __next_mem_range_rev - generic next function for for_each_*_range_rev() * * Finds the next range from type_a which is not marked as unsuitable * in type_b. * |
7bd0b0f0d
|
948 |
* @idx: pointer to u64 loop variable |
ad5ea8cd5
|
949 |
* @nid: node selector, %NUMA_NO_NODE for all nodes |
fc6daaf93
|
950 |
* @flags: pick from blocks based on memory attributes |
f1af9d3af
|
951 952 |
* @type_a: pointer to memblock_type from where the range is taken * @type_b: pointer to memblock_type which excludes memory from being taken |
dad7557eb
|
953 954 955 |
* @out_start: ptr to phys_addr_t for start address of the range, can be %NULL * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL * @out_nid: ptr to int for nid of the range, can be %NULL |
7bd0b0f0d
|
956 |
* |
f1af9d3af
|
957 |
* Reverse of __next_mem_range(). |
7bd0b0f0d
|
958 |
*/ |
fc6daaf93
|
959 |
void __init_memblock __next_mem_range_rev(u64 *idx, int nid, ulong flags, |
f1af9d3af
|
960 961 962 963 |
struct memblock_type *type_a, struct memblock_type *type_b, phys_addr_t *out_start, phys_addr_t *out_end, int *out_nid) |
7bd0b0f0d
|
964 |
{ |
f1af9d3af
|
965 966 |
int idx_a = *idx & 0xffffffff; int idx_b = *idx >> 32; |
b11542335
|
967 |
|
560dca27a
|
968 969 970 |
if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead ")) nid = NUMA_NO_NODE; |
7bd0b0f0d
|
971 972 |
if (*idx == (u64)ULLONG_MAX) { |
f1af9d3af
|
973 974 |
idx_a = type_a->cnt - 1; idx_b = type_b->cnt; |
7bd0b0f0d
|
975 |
} |
f1af9d3af
|
976 977 |
for (; idx_a >= 0; idx_a--) { struct memblock_region *m = &type_a->regions[idx_a]; |
7bd0b0f0d
|
978 979 |
phys_addr_t m_start = m->base; phys_addr_t m_end = m->base + m->size; |
f1af9d3af
|
980 |
int m_nid = memblock_get_region_node(m); |
7bd0b0f0d
|
981 982 |
/* only memory regions are associated with nodes, check it */ |
f1af9d3af
|
983 |
if (nid != NUMA_NO_NODE && nid != m_nid) |
7bd0b0f0d
|
984 |
continue; |
55ac590c2
|
985 986 987 |
/* skip hotpluggable memory regions if needed */ if (movable_node_is_enabled() && memblock_is_hotpluggable(m)) continue; |
a3f5bafcc
|
988 989 990 |
/* if we want mirror memory skip non-mirror memory regions */ if ((flags & MEMBLOCK_MIRROR) && !memblock_is_mirror(m)) continue; |
bf3d3cc58
|
991 992 993 |
/* skip nomap memory unless we were asked for it explicitly */ if (!(flags & MEMBLOCK_NOMAP) && memblock_is_nomap(m)) continue; |
f1af9d3af
|
994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 |
if (!type_b) { if (out_start) *out_start = m_start; if (out_end) *out_end = m_end; if (out_nid) *out_nid = m_nid; idx_a++; *idx = (u32)idx_a | (u64)idx_b << 32; return; } /* scan areas before each reservation */ for (; idx_b >= 0; idx_b--) { struct memblock_region *r; phys_addr_t r_start; phys_addr_t r_end; r = &type_b->regions[idx_b]; r_start = idx_b ? r[-1].base + r[-1].size : 0; r_end = idx_b < type_b->cnt ? r->base : ULLONG_MAX; /* * if idx_b advanced past idx_a, * break out to advance idx_a */ |
7bd0b0f0d
|
1020 |
|
7bd0b0f0d
|
1021 1022 1023 1024 1025 1026 1027 1028 1029 |
if (r_end <= m_start) break; /* if the two regions intersect, we're done */ if (m_end > r_start) { if (out_start) *out_start = max(m_start, r_start); if (out_end) *out_end = min(m_end, r_end); if (out_nid) |
f1af9d3af
|
1030 |
*out_nid = m_nid; |
7bd0b0f0d
|
1031 |
if (m_start >= r_start) |
f1af9d3af
|
1032 |
idx_a--; |
7bd0b0f0d
|
1033 |
else |
f1af9d3af
|
1034 1035 |
idx_b--; *idx = (u32)idx_a | (u64)idx_b << 32; |
7bd0b0f0d
|
1036 1037 1038 1039 |
return; } } } |
f1af9d3af
|
1040 |
/* signal end of iteration */ |
7bd0b0f0d
|
1041 1042 |
*idx = ULLONG_MAX; } |
7c0caeb86
|
1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 |
#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP /* * Common iterator interface used to define for_each_mem_range(). */ void __init_memblock __next_mem_pfn_range(int *idx, int nid, unsigned long *out_start_pfn, unsigned long *out_end_pfn, int *out_nid) { struct memblock_type *type = &memblock.memory; struct memblock_region *r; while (++*idx < type->cnt) { r = &type->regions[*idx]; if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size)) continue; if (nid == MAX_NUMNODES || nid == r->nid) break; } if (*idx >= type->cnt) { *idx = -1; return; } if (out_start_pfn) *out_start_pfn = PFN_UP(r->base); if (out_end_pfn) *out_end_pfn = PFN_DOWN(r->base + r->size); if (out_nid) *out_nid = r->nid; } /** * memblock_set_node - set node ID on memblock regions * @base: base of area to set node ID for * @size: size of area to set node ID for |
e7e8de591
|
1079 |
* @type: memblock type to set node ID for |
7c0caeb86
|
1080 1081 |
* @nid: node ID to set * |
e7e8de591
|
1082 |
* Set the nid of memblock @type regions in [@base,@base+@size) to @nid. |
7c0caeb86
|
1083 1084 1085 1086 1087 1088 |
* Regions which cross the area boundaries are split as necessary. * * RETURNS: * 0 on success, -errno on failure. */ int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size, |
e7e8de591
|
1089 |
struct memblock_type *type, int nid) |
7c0caeb86
|
1090 |
{ |
6a9ceb31c
|
1091 1092 |
int start_rgn, end_rgn; int i, ret; |
7c0caeb86
|
1093 |
|
6a9ceb31c
|
1094 1095 1096 |
ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn); if (ret) return ret; |
7c0caeb86
|
1097 |
|
6a9ceb31c
|
1098 |
for (i = start_rgn; i < end_rgn; i++) |
e9d24ad30
|
1099 |
memblock_set_region_node(&type->regions[i], nid); |
7c0caeb86
|
1100 1101 1102 1103 1104 |
memblock_merge_regions(type); return 0; } #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */ |
2bfc2862c
|
1105 1106 |
static phys_addr_t __init memblock_alloc_range_nid(phys_addr_t size, phys_addr_t align, phys_addr_t start, |
fc6daaf93
|
1107 |
phys_addr_t end, int nid, ulong flags) |
95f72d1ed
|
1108 |
{ |
6ed311b28
|
1109 |
phys_addr_t found; |
95f72d1ed
|
1110 |
|
79f40fab0
|
1111 1112 |
if (!align) align = SMP_CACHE_BYTES; |
94f3d3afb
|
1113 |
|
fc6daaf93
|
1114 1115 |
found = memblock_find_in_range_node(size, align, start, end, nid, flags); |
aedf95ea0
|
1116 1117 1118 1119 1120 1121 |
if (found && !memblock_reserve(found, size)) { /* * The min_count is set to 0 so that memblock allocations are * never reported as leaks. */ kmemleak_alloc(__va(found), size, 0, 0); |
6ed311b28
|
1122 |
return found; |
aedf95ea0
|
1123 |
} |
6ed311b28
|
1124 |
return 0; |
95f72d1ed
|
1125 |
} |
2bfc2862c
|
1126 |
phys_addr_t __init memblock_alloc_range(phys_addr_t size, phys_addr_t align, |
fc6daaf93
|
1127 1128 |
phys_addr_t start, phys_addr_t end, ulong flags) |
2bfc2862c
|
1129 |
{ |
fc6daaf93
|
1130 1131 |
return memblock_alloc_range_nid(size, align, start, end, NUMA_NO_NODE, flags); |
2bfc2862c
|
1132 1133 1134 1135 |
} static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr, |
fc6daaf93
|
1136 |
int nid, ulong flags) |
2bfc2862c
|
1137 |
{ |
fc6daaf93
|
1138 |
return memblock_alloc_range_nid(size, align, 0, max_addr, nid, flags); |
2bfc2862c
|
1139 |
} |
7bd0b0f0d
|
1140 1141 |
phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid) { |
a3f5bafcc
|
1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 |
ulong flags = choose_memblock_flags(); phys_addr_t ret; again: ret = memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE, nid, flags); if (!ret && (flags & MEMBLOCK_MIRROR)) { flags &= ~MEMBLOCK_MIRROR; goto again; } return ret; |
7bd0b0f0d
|
1154 1155 1156 1157 |
} phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) { |
fc6daaf93
|
1158 1159 |
return memblock_alloc_base_nid(size, align, max_addr, NUMA_NO_NODE, MEMBLOCK_NONE); |
7bd0b0f0d
|
1160 |
} |
6ed311b28
|
1161 |
phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) |
95f72d1ed
|
1162 |
{ |
6ed311b28
|
1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 |
phys_addr_t alloc; alloc = __memblock_alloc_base(size, align, max_addr); if (alloc == 0) panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx. ", (unsigned long long) size, (unsigned long long) max_addr); return alloc; |
95f72d1ed
|
1173 |
} |
6ed311b28
|
1174 |
phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align) |
95f72d1ed
|
1175 |
{ |
6ed311b28
|
1176 1177 |
return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE); } |
95f72d1ed
|
1178 |
|
9d1e24928
|
1179 1180 1181 1182 1183 1184 |
phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid) { phys_addr_t res = memblock_alloc_nid(size, align, nid); if (res) return res; |
15fb09722
|
1185 |
return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE); |
95f72d1ed
|
1186 |
} |
26f09e9b3
|
1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 |
/** * memblock_virt_alloc_internal - allocate boot memory block * @size: size of memory block to be allocated in bytes * @align: alignment of the region and block's size * @min_addr: the lower bound of the memory region to allocate (phys address) * @max_addr: the upper bound of the memory region to allocate (phys address) * @nid: nid of the free area to find, %NUMA_NO_NODE for any node * * The @min_addr limit is dropped if it can not be satisfied and the allocation * will fall back to memory below @min_addr. Also, allocation may fall back * to any node in the system if the specified node can not * hold the requested memory. * * The allocation is performed from memory region limited by * memblock.current_limit if @max_addr == %BOOTMEM_ALLOC_ACCESSIBLE. * * The memory block is aligned on SMP_CACHE_BYTES if @align == 0. * * The phys address of allocated boot memory block is converted to virtual and * allocated memory is reset to 0. * * In addition, function sets the min_count to 0 using kmemleak_alloc for * allocated boot memory block, so that it is never reported as leaks. * * RETURNS: * Virtual address of allocated memory block on success, NULL on failure. */ static void * __init memblock_virt_alloc_internal( phys_addr_t size, phys_addr_t align, phys_addr_t min_addr, phys_addr_t max_addr, int nid) { phys_addr_t alloc; void *ptr; |
a3f5bafcc
|
1221 |
ulong flags = choose_memblock_flags(); |
26f09e9b3
|
1222 |
|
560dca27a
|
1223 1224 1225 |
if (WARN_ONCE(nid == MAX_NUMNODES, "Usage of MAX_NUMNODES is deprecated. Use NUMA_NO_NODE instead ")) nid = NUMA_NO_NODE; |
26f09e9b3
|
1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 |
/* * Detect any accidental use of these APIs after slab is ready, as at * this moment memblock may be deinitialized already and its * internal data may be destroyed (after execution of free_all_bootmem) */ if (WARN_ON_ONCE(slab_is_available())) return kzalloc_node(size, GFP_NOWAIT, nid); if (!align) align = SMP_CACHE_BYTES; |
f544e14f3
|
1237 1238 |
if (max_addr > memblock.current_limit) max_addr = memblock.current_limit; |
26f09e9b3
|
1239 1240 |
again: alloc = memblock_find_in_range_node(size, align, min_addr, max_addr, |
a3f5bafcc
|
1241 |
nid, flags); |
26f09e9b3
|
1242 1243 1244 1245 1246 |
if (alloc) goto done; if (nid != NUMA_NO_NODE) { alloc = memblock_find_in_range_node(size, align, min_addr, |
fc6daaf93
|
1247 |
max_addr, NUMA_NO_NODE, |
a3f5bafcc
|
1248 |
flags); |
26f09e9b3
|
1249 1250 1251 1252 1253 1254 1255 |
if (alloc) goto done; } if (min_addr) { min_addr = 0; goto again; |
26f09e9b3
|
1256 |
} |
a3f5bafcc
|
1257 1258 1259 1260 1261 1262 1263 1264 1265 |
if (flags & MEMBLOCK_MIRROR) { flags &= ~MEMBLOCK_MIRROR; pr_warn("Could not allocate %pap bytes of mirrored memory ", &size); goto again; } return NULL; |
26f09e9b3
|
1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 |
done: memblock_reserve(alloc, size); ptr = phys_to_virt(alloc); memset(ptr, 0, size); /* * The min_count is set to 0 so that bootmem allocated blocks * are never reported as leaks. This is because many of these blocks * are only referred via the physical address which is not * looked up by kmemleak. */ kmemleak_alloc(ptr, size, 0, 0); return ptr; |
26f09e9b3
|
1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 |
} /** * memblock_virt_alloc_try_nid_nopanic - allocate boot memory block * @size: size of memory block to be allocated in bytes * @align: alignment of the region and block's size * @min_addr: the lower bound of the memory region from where the allocation * is preferred (phys address) * @max_addr: the upper bound of the memory region from where the allocation * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to * allocate only from memory limited by memblock.current_limit value * @nid: nid of the free area to find, %NUMA_NO_NODE for any node * * Public version of _memblock_virt_alloc_try_nid_nopanic() which provides * additional debug information (including caller info), if enabled. * * RETURNS: * Virtual address of allocated memory block on success, NULL on failure. */ void * __init memblock_virt_alloc_try_nid_nopanic( phys_addr_t size, phys_addr_t align, phys_addr_t min_addr, phys_addr_t max_addr, int nid) { memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF ", __func__, (u64)size, (u64)align, nid, (u64)min_addr, (u64)max_addr, (void *)_RET_IP_); return memblock_virt_alloc_internal(size, align, min_addr, max_addr, nid); } /** * memblock_virt_alloc_try_nid - allocate boot memory block with panicking * @size: size of memory block to be allocated in bytes * @align: alignment of the region and block's size * @min_addr: the lower bound of the memory region from where the allocation * is preferred (phys address) * @max_addr: the upper bound of the memory region from where the allocation * is preferred (phys address), or %BOOTMEM_ALLOC_ACCESSIBLE to * allocate only from memory limited by memblock.current_limit value * @nid: nid of the free area to find, %NUMA_NO_NODE for any node * * Public panicking version of _memblock_virt_alloc_try_nid_nopanic() * which provides debug information (including caller info), if enabled, * and panics if the request can not be satisfied. * * RETURNS: * Virtual address of allocated memory block on success, NULL on failure. */ void * __init memblock_virt_alloc_try_nid( phys_addr_t size, phys_addr_t align, phys_addr_t min_addr, phys_addr_t max_addr, int nid) { void *ptr; memblock_dbg("%s: %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx %pF ", __func__, (u64)size, (u64)align, nid, (u64)min_addr, (u64)max_addr, (void *)_RET_IP_); ptr = memblock_virt_alloc_internal(size, align, min_addr, max_addr, nid); if (ptr) return ptr; panic("%s: Failed to allocate %llu bytes align=0x%llx nid=%d from=0x%llx max_addr=0x%llx ", __func__, (u64)size, (u64)align, nid, (u64)min_addr, (u64)max_addr); return NULL; } /** * __memblock_free_early - free boot memory block * @base: phys starting address of the boot memory block * @size: size of the boot memory block in bytes * * Free boot memory block previously allocated by memblock_virt_alloc_xx() API. * The freeing memory will not be released to the buddy allocator. */ void __init __memblock_free_early(phys_addr_t base, phys_addr_t size) { memblock_dbg("%s: [%#016llx-%#016llx] %pF ", __func__, (u64)base, (u64)base + size - 1, (void *)_RET_IP_); kmemleak_free_part(__va(base), size); |
f1af9d3af
|
1368 |
memblock_remove_range(&memblock.reserved, base, size); |
26f09e9b3
|
1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 |
} /* * __memblock_free_late - free bootmem block pages directly to buddy allocator * @addr: phys starting address of the boot memory block * @size: size of the boot memory block in bytes * * This is only useful when the bootmem allocator has already been torn * down, but we are still initializing the system. Pages are released directly * to the buddy allocator, no bootmem metadata is updated because it is gone. */ void __init __memblock_free_late(phys_addr_t base, phys_addr_t size) { u64 cursor, end; memblock_dbg("%s: [%#016llx-%#016llx] %pF ", __func__, (u64)base, (u64)base + size - 1, (void *)_RET_IP_); kmemleak_free_part(__va(base), size); cursor = PFN_UP(base); end = PFN_DOWN(base + size); for (; cursor < end; cursor++) { |
d70ddd7a5
|
1393 |
__free_pages_bootmem(pfn_to_page(cursor), cursor, 0); |
26f09e9b3
|
1394 1395 1396 |
totalram_pages++; } } |
9d1e24928
|
1397 1398 1399 1400 |
/* * Remaining API functions */ |
1f1ffb8a1
|
1401 |
phys_addr_t __init_memblock memblock_phys_mem_size(void) |
95f72d1ed
|
1402 |
{ |
1440c4e2c
|
1403 |
return memblock.memory.total_size; |
95f72d1ed
|
1404 |
} |
595ad9af8
|
1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 |
phys_addr_t __init memblock_mem_size(unsigned long limit_pfn) { unsigned long pages = 0; struct memblock_region *r; unsigned long start_pfn, end_pfn; for_each_memblock(memory, r) { start_pfn = memblock_region_memory_base_pfn(r); end_pfn = memblock_region_memory_end_pfn(r); start_pfn = min_t(unsigned long, start_pfn, limit_pfn); end_pfn = min_t(unsigned long, end_pfn, limit_pfn); pages += end_pfn - start_pfn; } |
167632303
|
1418 |
return PFN_PHYS(pages); |
595ad9af8
|
1419 |
} |
0a93ebef6
|
1420 1421 1422 1423 1424 |
/* lowest address */ phys_addr_t __init_memblock memblock_start_of_DRAM(void) { return memblock.memory.regions[0].base; } |
10d064398
|
1425 |
phys_addr_t __init_memblock memblock_end_of_DRAM(void) |
95f72d1ed
|
1426 1427 |
{ int idx = memblock.memory.cnt - 1; |
e3239ff92
|
1428 |
return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size); |
95f72d1ed
|
1429 |
} |
c0ce8fef5
|
1430 |
void __init memblock_enforce_memory_limit(phys_addr_t limit) |
95f72d1ed
|
1431 |
{ |
c0ce8fef5
|
1432 |
phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX; |
136199f0a
|
1433 |
struct memblock_region *r; |
95f72d1ed
|
1434 |
|
c0ce8fef5
|
1435 |
if (!limit) |
95f72d1ed
|
1436 |
return; |
c0ce8fef5
|
1437 |
/* find out max address */ |
136199f0a
|
1438 |
for_each_memblock(memory, r) { |
c0ce8fef5
|
1439 1440 1441 |
if (limit <= r->size) { max_addr = r->base + limit; break; |
95f72d1ed
|
1442 |
} |
c0ce8fef5
|
1443 |
limit -= r->size; |
95f72d1ed
|
1444 |
} |
c0ce8fef5
|
1445 1446 |
/* truncate both memory and reserved regions */ |
f1af9d3af
|
1447 1448 1449 1450 |
memblock_remove_range(&memblock.memory, max_addr, (phys_addr_t)ULLONG_MAX); memblock_remove_range(&memblock.reserved, max_addr, (phys_addr_t)ULLONG_MAX); |
95f72d1ed
|
1451 |
} |
cd79481d2
|
1452 |
static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr) |
72d4b0b4e
|
1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 |
{ unsigned int left = 0, right = type->cnt; do { unsigned int mid = (right + left) / 2; if (addr < type->regions[mid].base) right = mid; else if (addr >= (type->regions[mid].base + type->regions[mid].size)) left = mid + 1; else return mid; } while (left < right); return -1; } |
b4ad0c7e0
|
1469 |
bool __init memblock_is_reserved(phys_addr_t addr) |
95f72d1ed
|
1470 |
{ |
72d4b0b4e
|
1471 1472 |
return memblock_search(&memblock.reserved, addr) != -1; } |
95f72d1ed
|
1473 |
|
b4ad0c7e0
|
1474 |
bool __init_memblock memblock_is_memory(phys_addr_t addr) |
72d4b0b4e
|
1475 1476 1477 |
{ return memblock_search(&memblock.memory, addr) != -1; } |
bf3d3cc58
|
1478 1479 1480 1481 1482 1483 1484 1485 |
int __init_memblock memblock_is_map_memory(phys_addr_t addr) { int i = memblock_search(&memblock.memory, addr); if (i == -1) return false; return !memblock_is_nomap(&memblock.memory.regions[i]); } |
e76b63f80
|
1486 1487 1488 1489 1490 |
#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP int __init_memblock memblock_search_pfn_nid(unsigned long pfn, unsigned long *start_pfn, unsigned long *end_pfn) { struct memblock_type *type = &memblock.memory; |
167632303
|
1491 |
int mid = memblock_search(type, PFN_PHYS(pfn)); |
e76b63f80
|
1492 1493 1494 |
if (mid == -1) return -1; |
f7e2f7e89
|
1495 1496 |
*start_pfn = PFN_DOWN(type->regions[mid].base); *end_pfn = PFN_DOWN(type->regions[mid].base + type->regions[mid].size); |
e76b63f80
|
1497 1498 1499 1500 |
return type->regions[mid].nid; } #endif |
eab309494
|
1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 |
/** * memblock_is_region_memory - check if a region is a subset of memory * @base: base of region to check * @size: size of region to check * * Check if the region [@base, @base+@size) is a subset of a memory block. * * RETURNS: * 0 if false, non-zero if true */ |
3661ca66a
|
1511 |
int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size) |
72d4b0b4e
|
1512 |
{ |
abb65272a
|
1513 |
int idx = memblock_search(&memblock.memory, base); |
eb18f1b5b
|
1514 |
phys_addr_t end = base + memblock_cap_size(base, &size); |
72d4b0b4e
|
1515 1516 1517 |
if (idx == -1) return 0; |
abb65272a
|
1518 1519 |
return memblock.memory.regions[idx].base <= base && (memblock.memory.regions[idx].base + |
eb18f1b5b
|
1520 |
memblock.memory.regions[idx].size) >= end; |
95f72d1ed
|
1521 |
} |
eab309494
|
1522 1523 1524 1525 1526 1527 1528 1529 |
/** * memblock_is_region_reserved - check if a region intersects reserved memory * @base: base of region to check * @size: size of region to check * * Check if the region [@base, @base+@size) intersects a reserved memory block. * * RETURNS: |
c5c5c9d10
|
1530 |
* True if they intersect, false if not. |
eab309494
|
1531 |
*/ |
c5c5c9d10
|
1532 |
bool __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size) |
95f72d1ed
|
1533 |
{ |
eb18f1b5b
|
1534 |
memblock_cap_size(base, &size); |
c5c5c9d10
|
1535 |
return memblock_overlaps_region(&memblock.reserved, base, size); |
95f72d1ed
|
1536 |
} |
6ede1fd3c
|
1537 1538 |
void __init_memblock memblock_trim_memory(phys_addr_t align) { |
6ede1fd3c
|
1539 |
phys_addr_t start, end, orig_start, orig_end; |
136199f0a
|
1540 |
struct memblock_region *r; |
6ede1fd3c
|
1541 |
|
136199f0a
|
1542 1543 1544 |
for_each_memblock(memory, r) { orig_start = r->base; orig_end = r->base + r->size; |
6ede1fd3c
|
1545 1546 1547 1548 1549 1550 1551 |
start = round_up(orig_start, align); end = round_down(orig_end, align); if (start == orig_start && end == orig_end) continue; if (start < end) { |
136199f0a
|
1552 1553 |
r->base = start; r->size = end - start; |
6ede1fd3c
|
1554 |
} else { |
136199f0a
|
1555 1556 1557 |
memblock_remove_region(&memblock.memory, r - memblock.memory.regions); r--; |
6ede1fd3c
|
1558 1559 1560 |
} } } |
e63075a3c
|
1561 |
|
3661ca66a
|
1562 |
void __init_memblock memblock_set_current_limit(phys_addr_t limit) |
e63075a3c
|
1563 1564 1565 |
{ memblock.current_limit = limit; } |
fec510141
|
1566 1567 1568 1569 |
phys_addr_t __init_memblock memblock_get_current_limit(void) { return memblock.current_limit; } |
7c0caeb86
|
1570 |
static void __init_memblock memblock_dump(struct memblock_type *type, char *name) |
6ed311b28
|
1571 1572 |
{ unsigned long long base, size; |
66a207572
|
1573 |
unsigned long flags; |
8c9c1701c
|
1574 1575 |
int idx; struct memblock_region *rgn; |
6ed311b28
|
1576 |
|
7c0caeb86
|
1577 1578 |
pr_info(" %s.cnt = 0x%lx ", name, type->cnt); |
6ed311b28
|
1579 |
|
8c9c1701c
|
1580 |
for_each_memblock_type(type, rgn) { |
7c0caeb86
|
1581 1582 1583 1584 |
char nid_buf[32] = ""; base = rgn->base; size = rgn->size; |
66a207572
|
1585 |
flags = rgn->flags; |
7c0caeb86
|
1586 1587 1588 1589 1590 |
#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP if (memblock_get_region_node(rgn) != MAX_NUMNODES) snprintf(nid_buf, sizeof(nid_buf), " on node %d", memblock_get_region_node(rgn)); #endif |
66a207572
|
1591 1592 |
pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s flags: %#lx ", |
8c9c1701c
|
1593 |
name, idx, base, base + size - 1, size, nid_buf, flags); |
6ed311b28
|
1594 1595 |
} } |
4ff7b82f1
|
1596 |
void __init_memblock __memblock_dump_all(void) |
6ed311b28
|
1597 |
{ |
6ed311b28
|
1598 1599 |
pr_info("MEMBLOCK configuration: "); |
1440c4e2c
|
1600 1601 1602 1603 |
pr_info(" memory size = %#llx reserved size = %#llx ", (unsigned long long)memblock.memory.total_size, (unsigned long long)memblock.reserved.total_size); |
6ed311b28
|
1604 1605 1606 1607 |
memblock_dump(&memblock.memory, "memory"); memblock_dump(&memblock.reserved, "reserved"); } |
1aadc0560
|
1608 |
void __init memblock_allow_resize(void) |
6ed311b28
|
1609 |
{ |
142b45a72
|
1610 |
memblock_can_resize = 1; |
6ed311b28
|
1611 |
} |
6ed311b28
|
1612 1613 1614 1615 1616 1617 1618 |
static int __init early_memblock(char *p) { if (p && strstr(p, "debug")) memblock_debug = 1; return 0; } early_param("memblock", early_memblock); |
c378ddd53
|
1619 |
#if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK) |
6d03b885f
|
1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 |
static int memblock_debug_show(struct seq_file *m, void *private) { struct memblock_type *type = m->private; struct memblock_region *reg; int i; for (i = 0; i < type->cnt; i++) { reg = &type->regions[i]; seq_printf(m, "%4d: ", i); if (sizeof(phys_addr_t) == 4) seq_printf(m, "0x%08lx..0x%08lx ", (unsigned long)reg->base, (unsigned long)(reg->base + reg->size - 1)); else seq_printf(m, "0x%016llx..0x%016llx ", (unsigned long long)reg->base, (unsigned long long)(reg->base + reg->size - 1)); } return 0; } static int memblock_debug_open(struct inode *inode, struct file *file) { return single_open(file, memblock_debug_show, inode->i_private); } static const struct file_operations memblock_debug_fops = { .open = memblock_debug_open, .read = seq_read, .llseek = seq_lseek, .release = single_release, }; static int __init memblock_init_debugfs(void) { struct dentry *root = debugfs_create_dir("memblock", NULL); if (!root) return -ENXIO; debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops); debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops); |
70210ed95
|
1664 1665 1666 |
#ifdef CONFIG_HAVE_MEMBLOCK_PHYS_MAP debugfs_create_file("physmem", S_IRUGO, root, &memblock.physmem, &memblock_debug_fops); #endif |
6d03b885f
|
1667 1668 1669 1670 1671 1672 |
return 0; } __initcall(memblock_init_debugfs); #endif /* CONFIG_DEBUG_FS */ |