Blame view
mm/memblock.c
22.6 KB
95f72d1ed lmb: rename to me... |
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 memblock: Add arr... |
14 |
#include <linux/slab.h> |
95f72d1ed lmb: rename to me... |
15 16 |
#include <linux/init.h> #include <linux/bitops.h> |
449e8df39 memblock: Add deb... |
17 |
#include <linux/poison.h> |
c196f76fd memblock: NUMA al... |
18 |
#include <linux/pfn.h> |
6d03b885f memblock: Add deb... |
19 20 |
#include <linux/debugfs.h> #include <linux/seq_file.h> |
95f72d1ed lmb: rename to me... |
21 |
#include <linux/memblock.h> |
10d064398 memblock: Option ... |
22 |
struct memblock memblock __initdata_memblock; |
95f72d1ed lmb: rename to me... |
23 |
|
10d064398 memblock: Option ... |
24 25 26 27 |
int memblock_debug __initdata_memblock; int memblock_can_resize __initdata_memblock; static struct memblock_region memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS + 1] __initdata_memblock; static struct memblock_region memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS + 1] __initdata_memblock; |
95f72d1ed lmb: rename to me... |
28 |
|
142b45a72 memblock: Add arr... |
29 30 31 32 33 34 35 36 37 38 |
/* inline so we don't get a warning when pr_debug is compiled out */ static inline const char *memblock_type_name(struct memblock_type *type) { if (type == &memblock.memory) return "memory"; else if (type == &memblock.reserved) return "reserved"; else return "unknown"; } |
6ed311b28 memblock: Move fu... |
39 40 41 |
/* * Address comparison utilities */ |
95f72d1ed lmb: rename to me... |
42 |
|
10d064398 memblock: Option ... |
43 |
static phys_addr_t __init_memblock memblock_align_down(phys_addr_t addr, phys_addr_t size) |
95f72d1ed lmb: rename to me... |
44 |
{ |
6ed311b28 memblock: Move fu... |
45 |
return addr & ~(size - 1); |
95f72d1ed lmb: rename to me... |
46 |
} |
10d064398 memblock: Option ... |
47 |
static phys_addr_t __init_memblock memblock_align_up(phys_addr_t addr, phys_addr_t size) |
95f72d1ed lmb: rename to me... |
48 |
{ |
6ed311b28 memblock: Move fu... |
49 |
return (addr + (size - 1)) & ~(size - 1); |
95f72d1ed lmb: rename to me... |
50 |
} |
10d064398 memblock: Option ... |
51 |
static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1, |
2898cc4cd memblock: Change ... |
52 |
phys_addr_t base2, phys_addr_t size2) |
95f72d1ed lmb: rename to me... |
53 54 55 |
{ return ((base1 < (base2 + size2)) && (base2 < (base1 + size1))); } |
10d064398 memblock: Option ... |
56 |
long __init_memblock memblock_overlaps_region(struct memblock_type *type, phys_addr_t base, phys_addr_t size) |
6ed311b28 memblock: Move fu... |
57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 |
{ unsigned long i; for (i = 0; i < type->cnt; i++) { phys_addr_t rgnbase = type->regions[i].base; phys_addr_t rgnsize = type->regions[i].size; if (memblock_addrs_overlap(base, size, rgnbase, rgnsize)) break; } return (i < type->cnt) ? i : -1; } /* * Find, allocate, deallocate or reserve unreserved regions. All allocations * are top-down. */ |
cd79481d2 memblock: Annotat... |
74 |
static phys_addr_t __init_memblock memblock_find_region(phys_addr_t start, phys_addr_t end, |
6ed311b28 memblock: Move fu... |
75 76 77 78 |
phys_addr_t size, phys_addr_t align) { phys_addr_t base, res_base; long j; |
f1af98c76 memblock: Fix wra... |
79 80 81 82 83 |
/* In case, huge size is requested */ if (end < size) return MEMBLOCK_ERROR; base = memblock_align_down((end - size), align); |
25818f0f2 memblock: Make ME... |
84 85 86 87 88 |
/* Prevent allocations returning 0 as it's also used to * indicate an allocation failure */ if (start == 0) start = PAGE_SIZE; |
6ed311b28 memblock: Move fu... |
89 90 91 92 93 94 95 96 97 98 99 100 |
while (start <= base) { j = memblock_overlaps_region(&memblock.reserved, base, size); if (j < 0) return base; res_base = memblock.reserved.regions[j].base; if (res_base < size) break; base = memblock_align_down(res_base - size, align); } return MEMBLOCK_ERROR; } |
3661ca66a memblock: Fix sec... |
101 102 |
static phys_addr_t __init_memblock memblock_find_base(phys_addr_t size, phys_addr_t align, phys_addr_t start, phys_addr_t end) |
6ed311b28 memblock: Move fu... |
103 104 |
{ long i; |
6ed311b28 memblock: Move fu... |
105 106 |
BUG_ON(0 == size); |
6ed311b28 memblock: Move fu... |
107 |
/* Pump up max_addr */ |
fef501d49 memblock: Add "st... |
108 109 |
if (end == MEMBLOCK_ALLOC_ACCESSIBLE) end = memblock.current_limit; |
6ed311b28 memblock: Move fu... |
110 111 112 113 114 115 116 117 |
/* We do a top-down search, this tends to limit memory * fragmentation by keeping early boot allocs near the * top of memory */ for (i = memblock.memory.cnt - 1; i >= 0; i--) { phys_addr_t memblockbase = memblock.memory.regions[i].base; phys_addr_t memblocksize = memblock.memory.regions[i].size; |
fef501d49 memblock: Add "st... |
118 |
phys_addr_t bottom, top, found; |
6ed311b28 memblock: Move fu... |
119 120 121 |
if (memblocksize < size) continue; |
fef501d49 memblock: Add "st... |
122 123 124 125 126 127 128 129 130 |
if ((memblockbase + memblocksize) <= start) break; bottom = max(memblockbase, start); top = min(memblockbase + memblocksize, end); if (bottom >= top) continue; found = memblock_find_region(bottom, top, size, align); if (found != MEMBLOCK_ERROR) return found; |
6ed311b28 memblock: Move fu... |
131 132 133 |
} return MEMBLOCK_ERROR; } |
5303b68f5 memblock: Add mem... |
134 135 136 137 138 139 140 |
/* * Find a free area with specified alignment in a specific range. */ u64 __init_memblock memblock_find_in_range(u64 start, u64 end, u64 size, u64 align) { return memblock_find_base(size, align, start, end); } |
7950c407c memblock: Add mem... |
141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 |
/* * Free memblock.reserved.regions */ int __init_memblock memblock_free_reserved_regions(void) { if (memblock.reserved.regions == memblock_reserved_init_regions) return 0; return memblock_free(__pa(memblock.reserved.regions), sizeof(struct memblock_region) * memblock.reserved.max); } /* * Reserve memblock.reserved.regions */ int __init_memblock memblock_reserve_reserved_regions(void) { if (memblock.reserved.regions == memblock_reserved_init_regions) return 0; return memblock_reserve(__pa(memblock.reserved.regions), sizeof(struct memblock_region) * memblock.reserved.max); } |
10d064398 memblock: Option ... |
164 |
static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r) |
95f72d1ed lmb: rename to me... |
165 166 |
{ unsigned long i; |
e3239ff92 memblock: Rename ... |
167 168 169 |
for (i = r; i < type->cnt - 1; i++) { type->regions[i].base = type->regions[i + 1].base; type->regions[i].size = type->regions[i + 1].size; |
95f72d1ed lmb: rename to me... |
170 |
} |
e3239ff92 memblock: Rename ... |
171 |
type->cnt--; |
95f72d1ed lmb: rename to me... |
172 |
|
8f7a66051 mm/memblock: prop... |
173 174 175 176 177 178 |
/* Special case for empty arrays */ if (type->cnt == 0) { type->cnt = 1; type->regions[0].base = 0; type->regions[0].size = 0; } |
95f72d1ed lmb: rename to me... |
179 |
} |
142b45a72 memblock: Add arr... |
180 181 |
/* Defined below but needed now */ static long memblock_add_region(struct memblock_type *type, phys_addr_t base, phys_addr_t size); |
10d064398 memblock: Option ... |
182 |
static int __init_memblock memblock_double_array(struct memblock_type *type) |
142b45a72 memblock: Add arr... |
183 184 185 186 187 188 189 190 191 192 |
{ struct memblock_region *new_array, *old_array; phys_addr_t old_size, new_size, addr; int use_slab = slab_is_available(); /* 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 memblock: Add arr... |
193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 |
/* Calculate new doubled size */ old_size = type->max * sizeof(struct memblock_region); new_size = old_size << 1; /* Try to find some space for it. * * WARNING: We assume that either slab_is_available() and we use it or * 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) * * This should however not be an issue for now, as we currently only * call into MEMBLOCK while it's still active, or much later when slab is * active for memory hotplug operations */ if (use_slab) { new_array = kmalloc(new_size, GFP_KERNEL); addr = new_array == NULL ? MEMBLOCK_ERROR : __pa(new_array); } else |
fef501d49 memblock: Add "st... |
212 |
addr = memblock_find_base(new_size, sizeof(phys_addr_t), 0, MEMBLOCK_ALLOC_ACCESSIBLE); |
142b45a72 memblock: Add arr... |
213 214 215 216 217 218 219 |
if (addr == MEMBLOCK_ERROR) { pr_err("memblock: Failed to double %s array from %ld to %ld entries ! ", memblock_type_name(type), type->max, type->max * 2); return -1; } new_array = __va(addr); |
ea9e4376b memblock: Improve... |
220 221 |
memblock_dbg("memblock: %s array is doubled to %ld at [%#010llx-%#010llx]", memblock_type_name(type), type->max * 2, (u64)addr, (u64)addr + new_size - 1); |
142b45a72 memblock: Add arr... |
222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 |
/* 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. */ 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; /* If we use SLAB that's it, we are done */ if (use_slab) return 0; /* Add the new reserved region now. Should not fail ! */ |
8f7a66051 mm/memblock: prop... |
237 |
BUG_ON(memblock_add_region(&memblock.reserved, addr, new_size)); |
142b45a72 memblock: Add arr... |
238 239 240 241 242 243 244 245 246 247 248 249 |
/* If the array wasn't our static init one, then free it. We only do * that before SLAB is available as later on, we don't know whether * to use kfree or free_bootmem_pages(). Shouldn't be a big deal * anyways */ if (old_array != memblock_memory_init_regions && old_array != memblock_reserved_init_regions) memblock_free(__pa(old_array), old_size); return 0; } |
10d064398 memblock: Option ... |
250 |
extern int __init_memblock __weak memblock_memory_can_coalesce(phys_addr_t addr1, phys_addr_t size1, |
d2cd563ba memblock: Add arc... |
251 252 253 254 |
phys_addr_t addr2, phys_addr_t size2) { return 1; } |
8f7a66051 mm/memblock: prop... |
255 256 |
static long __init_memblock memblock_add_region(struct memblock_type *type, phys_addr_t base, phys_addr_t size) |
95f72d1ed lmb: rename to me... |
257 |
{ |
8f7a66051 mm/memblock: prop... |
258 259 |
phys_addr_t end = base + size; int i, slot = -1; |
95f72d1ed lmb: rename to me... |
260 |
|
8f7a66051 mm/memblock: prop... |
261 |
/* First try and coalesce this MEMBLOCK with others */ |
e3239ff92 memblock: Rename ... |
262 |
for (i = 0; i < type->cnt; i++) { |
8f7a66051 mm/memblock: prop... |
263 264 265 266 267 268 |
struct memblock_region *rgn = &type->regions[i]; phys_addr_t rend = rgn->base + rgn->size; /* Exit if there's no possible hits */ if (rgn->base > end || rgn->size == 0) break; |
95f72d1ed lmb: rename to me... |
269 |
|
8f7a66051 mm/memblock: prop... |
270 271 272 273 |
/* Check if we are fully enclosed within an existing * block */ if (rgn->base <= base && rend >= end) |
95f72d1ed lmb: rename to me... |
274 |
return 0; |
8f7a66051 mm/memblock: prop... |
275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 |
/* Check if we overlap or are adjacent with the bottom * of a block. */ if (base < rgn->base && end >= rgn->base) { /* If we can't coalesce, create a new block */ if (!memblock_memory_can_coalesce(base, size, rgn->base, rgn->size)) { /* Overlap & can't coalesce are mutually * exclusive, if you do that, be prepared * for trouble */ WARN_ON(end != rgn->base); goto new_block; } /* We extend the bottom of the block down to our * base */ rgn->base = base; rgn->size = rend - base; /* Return if we have nothing else to allocate * (fully coalesced) */ if (rend >= end) return 0; /* We continue processing from the end of the * coalesced block. */ base = rend; size = end - base; } /* Now check if we overlap or are adjacent with the * top of a block */ if (base <= rend && end >= rend) { /* If we can't coalesce, create a new block */ if (!memblock_memory_can_coalesce(rgn->base, rgn->size, base, size)) { /* Overlap & can't coalesce are mutually * exclusive, if you do that, be prepared * for trouble */ WARN_ON(rend != base); goto new_block; } /* We adjust our base down to enclose the * original block and destroy it. It will be * part of our new allocation. Since we've * freed an entry, we know we won't fail * to allocate one later, so we won't risk * losing the original block allocation. */ size += (base - rgn->base); base = rgn->base; memblock_remove_region(type, i--); |
95f72d1ed lmb: rename to me... |
334 335 |
} } |
8f7a66051 mm/memblock: prop... |
336 337 |
/* If the array is empty, special case, replace the fake * filler region and return |
d2cd563ba memblock: Add arc... |
338 |
*/ |
8f7a66051 mm/memblock: prop... |
339 340 341 342 |
if ((type->cnt == 1) && (type->regions[0].size == 0)) { type->regions[0].base = base; type->regions[0].size = size; return 0; |
95f72d1ed lmb: rename to me... |
343 |
} |
8f7a66051 mm/memblock: prop... |
344 |
new_block: |
142b45a72 memblock: Add arr... |
345 346 347 348 |
/* If we are out of space, we fail. It's too late to resize the array * but then this shouldn't have happened in the first place. */ if (WARN_ON(type->cnt >= type->max)) |
95f72d1ed lmb: rename to me... |
349 350 351 |
return -1; /* Couldn't coalesce the MEMBLOCK, so add it to the sorted table. */ |
e3239ff92 memblock: Rename ... |
352 353 354 355 |
for (i = type->cnt - 1; i >= 0; i--) { if (base < type->regions[i].base) { type->regions[i+1].base = type->regions[i].base; type->regions[i+1].size = type->regions[i].size; |
95f72d1ed lmb: rename to me... |
356 |
} else { |
e3239ff92 memblock: Rename ... |
357 358 |
type->regions[i+1].base = base; type->regions[i+1].size = size; |
8f7a66051 mm/memblock: prop... |
359 |
slot = i + 1; |
95f72d1ed lmb: rename to me... |
360 361 362 |
break; } } |
e3239ff92 memblock: Rename ... |
363 364 365 |
if (base < type->regions[0].base) { type->regions[0].base = base; type->regions[0].size = size; |
8f7a66051 mm/memblock: prop... |
366 |
slot = 0; |
95f72d1ed lmb: rename to me... |
367 |
} |
e3239ff92 memblock: Rename ... |
368 |
type->cnt++; |
95f72d1ed lmb: rename to me... |
369 |
|
142b45a72 memblock: Add arr... |
370 371 372 373 |
/* The array is full ? Try to resize it. If that fails, we undo * our allocation and return an error */ if (type->cnt == type->max && memblock_double_array(type)) { |
8f7a66051 mm/memblock: prop... |
374 375 |
BUG_ON(slot < 0); memblock_remove_region(type, slot); |
142b45a72 memblock: Add arr... |
376 377 |
return -1; } |
95f72d1ed lmb: rename to me... |
378 379 |
return 0; } |
10d064398 memblock: Option ... |
380 |
long __init_memblock memblock_add(phys_addr_t base, phys_addr_t size) |
95f72d1ed lmb: rename to me... |
381 |
{ |
e3239ff92 memblock: Rename ... |
382 |
return memblock_add_region(&memblock.memory, base, size); |
95f72d1ed lmb: rename to me... |
383 384 |
} |
8f7a66051 mm/memblock: prop... |
385 386 |
static long __init_memblock __memblock_remove(struct memblock_type *type, phys_addr_t base, phys_addr_t size) |
95f72d1ed lmb: rename to me... |
387 |
{ |
2898cc4cd memblock: Change ... |
388 |
phys_addr_t end = base + size; |
95f72d1ed lmb: rename to me... |
389 |
int i; |
8f7a66051 mm/memblock: prop... |
390 391 392 393 |
/* Walk through the array for collisions */ for (i = 0; i < type->cnt; i++) { struct memblock_region *rgn = &type->regions[i]; phys_addr_t rend = rgn->base + rgn->size; |
95f72d1ed lmb: rename to me... |
394 |
|
8f7a66051 mm/memblock: prop... |
395 396 |
/* Nothing more to do, exit */ if (rgn->base > end || rgn->size == 0) |
95f72d1ed lmb: rename to me... |
397 |
break; |
95f72d1ed lmb: rename to me... |
398 |
|
8f7a66051 mm/memblock: prop... |
399 400 401 402 403 |
/* If we fully enclose the block, drop it */ if (base <= rgn->base && end >= rend) { memblock_remove_region(type, i--); continue; } |
95f72d1ed lmb: rename to me... |
404 |
|
8f7a66051 mm/memblock: prop... |
405 406 407 408 409 410 411 412 413 414 415 416 417 418 |
/* If we are fully enclosed within a block * then we need to split it and we are done */ if (base > rgn->base && end < rend) { rgn->size = base - rgn->base; if (!memblock_add_region(type, end, rend - end)) return 0; /* Failure to split is bad, we at least * restore the block before erroring */ rgn->size = rend - rgn->base; WARN_ON(1); return -1; } |
95f72d1ed lmb: rename to me... |
419 |
|
8f7a66051 mm/memblock: prop... |
420 421 422 423 424 425 |
/* Check if we need to trim the bottom of a block */ if (rgn->base < end && rend > end) { rgn->size -= end - rgn->base; rgn->base = end; break; } |
95f72d1ed lmb: rename to me... |
426 |
|
8f7a66051 mm/memblock: prop... |
427 428 429 |
/* And check if we need to trim the top of a block */ if (base < rend) rgn->size -= rend - base; |
95f72d1ed lmb: rename to me... |
430 |
|
8f7a66051 mm/memblock: prop... |
431 432 |
} return 0; |
95f72d1ed lmb: rename to me... |
433 |
} |
10d064398 memblock: Option ... |
434 |
long __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size) |
95f72d1ed lmb: rename to me... |
435 436 437 |
{ return __memblock_remove(&memblock.memory, base, size); } |
3661ca66a memblock: Fix sec... |
438 |
long __init_memblock memblock_free(phys_addr_t base, phys_addr_t size) |
95f72d1ed lmb: rename to me... |
439 440 441 |
{ return __memblock_remove(&memblock.reserved, base, size); } |
3661ca66a memblock: Fix sec... |
442 |
long __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size) |
95f72d1ed lmb: rename to me... |
443 |
{ |
e3239ff92 memblock: Rename ... |
444 |
struct memblock_type *_rgn = &memblock.reserved; |
95f72d1ed lmb: rename to me... |
445 446 447 448 449 |
BUG_ON(0 == size); return memblock_add_region(_rgn, base, size); } |
6ed311b28 memblock: Move fu... |
450 |
phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) |
95f72d1ed lmb: rename to me... |
451 |
{ |
6ed311b28 memblock: Move fu... |
452 |
phys_addr_t found; |
95f72d1ed lmb: rename to me... |
453 |
|
6ed311b28 memblock: Move fu... |
454 455 456 457 |
/* We align the size to limit fragmentation. Without this, a lot of * small allocs quickly eat up the whole reserve array on sparc */ size = memblock_align_up(size, align); |
95f72d1ed lmb: rename to me... |
458 |
|
fef501d49 memblock: Add "st... |
459 |
found = memblock_find_base(size, align, 0, max_addr); |
6ed311b28 memblock: Move fu... |
460 |
if (found != MEMBLOCK_ERROR && |
8f7a66051 mm/memblock: prop... |
461 |
!memblock_add_region(&memblock.reserved, found, size)) |
6ed311b28 memblock: Move fu... |
462 |
return found; |
95f72d1ed lmb: rename to me... |
463 |
|
6ed311b28 memblock: Move fu... |
464 |
return 0; |
95f72d1ed lmb: rename to me... |
465 |
} |
6ed311b28 memblock: Move fu... |
466 |
phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) |
95f72d1ed lmb: rename to me... |
467 |
{ |
6ed311b28 memblock: Move fu... |
468 469 470 471 472 473 474 475 476 477 |
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 lmb: rename to me... |
478 |
} |
6ed311b28 memblock: Move fu... |
479 |
phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align) |
95f72d1ed lmb: rename to me... |
480 |
{ |
6ed311b28 memblock: Move fu... |
481 482 |
return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE); } |
95f72d1ed lmb: rename to me... |
483 |
|
95f72d1ed lmb: rename to me... |
484 |
|
6ed311b28 memblock: Move fu... |
485 486 487 |
/* * Additional node-local allocators. Search for node memory is bottom up * and walks memblock regions within that node bottom-up as well, but allocation |
c196f76fd memblock: NUMA al... |
488 489 490 491 492 |
* within an memblock region is top-down. XXX I plan to fix that at some stage * * WARNING: Only available after early_node_map[] has been populated, * on some architectures, that is after all the calls to add_active_range() * have been done to populate it. |
6ed311b28 memblock: Move fu... |
493 |
*/ |
95f72d1ed lmb: rename to me... |
494 |
|
2898cc4cd memblock: Change ... |
495 |
phys_addr_t __weak __init memblock_nid_range(phys_addr_t start, phys_addr_t end, int *nid) |
c3f72b570 memblock: Factor ... |
496 |
{ |
c196f76fd memblock: NUMA al... |
497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 |
#ifdef CONFIG_ARCH_POPULATES_NODE_MAP /* * This code originates from sparc which really wants use to walk by addresses * and returns the nid. This is not very convenient for early_pfn_map[] users * as the map isn't sorted yet, and it really wants to be walked by nid. * * For now, I implement the inefficient method below which walks the early * map multiple times. Eventually we may want to use an ARCH config option * to implement a completely different method for both case. */ unsigned long start_pfn, end_pfn; int i; for (i = 0; i < MAX_NUMNODES; i++) { get_pfn_range_for_nid(i, &start_pfn, &end_pfn); if (start < PFN_PHYS(start_pfn) || start >= PFN_PHYS(end_pfn)) continue; *nid = i; return min(end, PFN_PHYS(end_pfn)); } #endif |
c3f72b570 memblock: Factor ... |
518 519 520 521 |
*nid = 0; return end; } |
2898cc4cd memblock: Change ... |
522 523 524 |
static phys_addr_t __init memblock_alloc_nid_region(struct memblock_region *mp, phys_addr_t size, phys_addr_t align, int nid) |
95f72d1ed lmb: rename to me... |
525 |
{ |
2898cc4cd memblock: Change ... |
526 |
phys_addr_t start, end; |
95f72d1ed lmb: rename to me... |
527 528 529 530 531 532 |
start = mp->base; end = start + mp->size; start = memblock_align_up(start, align); while (start < end) { |
2898cc4cd memblock: Change ... |
533 |
phys_addr_t this_end; |
95f72d1ed lmb: rename to me... |
534 |
int this_nid; |
35a1f0bd0 memblock: Remove ... |
535 |
this_end = memblock_nid_range(start, end, &this_nid); |
95f72d1ed lmb: rename to me... |
536 |
if (this_nid == nid) { |
3a9c2c81e memblock: Make me... |
537 |
phys_addr_t ret = memblock_find_region(start, this_end, size, align); |
4d629f9a0 memblock: Define ... |
538 |
if (ret != MEMBLOCK_ERROR && |
8f7a66051 mm/memblock: prop... |
539 |
!memblock_add_region(&memblock.reserved, ret, size)) |
95f72d1ed lmb: rename to me... |
540 541 542 543 |
return ret; } start = this_end; } |
4d629f9a0 memblock: Define ... |
544 |
return MEMBLOCK_ERROR; |
95f72d1ed lmb: rename to me... |
545 |
} |
2898cc4cd memblock: Change ... |
546 |
phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid) |
95f72d1ed lmb: rename to me... |
547 |
{ |
e3239ff92 memblock: Rename ... |
548 |
struct memblock_type *mem = &memblock.memory; |
95f72d1ed lmb: rename to me... |
549 550 551 |
int i; BUG_ON(0 == size); |
7f219c736 memblock: split m... |
552 553 554 555 |
/* We align the size to limit fragmentation. Without this, a lot of * small allocs quickly eat up the whole reserve array on sparc */ size = memblock_align_up(size, align); |
c3f72b570 memblock: Factor ... |
556 557 558 559 |
/* We do a bottom-up search for a region with the right * nid since that's easier considering how memblock_nid_range() * works */ |
95f72d1ed lmb: rename to me... |
560 |
for (i = 0; i < mem->cnt; i++) { |
2898cc4cd memblock: Change ... |
561 |
phys_addr_t ret = memblock_alloc_nid_region(&mem->regions[i], |
95f72d1ed lmb: rename to me... |
562 |
size, align, nid); |
4d629f9a0 memblock: Define ... |
563 |
if (ret != MEMBLOCK_ERROR) |
95f72d1ed lmb: rename to me... |
564 565 |
return ret; } |
9d1e24928 memblock: Separat... |
566 567 568 569 570 571 572 573 574 |
return 0; } 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; |
918fe8d60 memblock: Make me... |
575 |
return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ANYWHERE); |
95f72d1ed lmb: rename to me... |
576 |
} |
9d1e24928 memblock: Separat... |
577 578 579 580 |
/* * Remaining API functions */ |
95f72d1ed lmb: rename to me... |
581 |
/* You must call memblock_analyze() before this. */ |
2898cc4cd memblock: Change ... |
582 |
phys_addr_t __init memblock_phys_mem_size(void) |
95f72d1ed lmb: rename to me... |
583 |
{ |
4734b594c memblock: Remove ... |
584 |
return memblock.memory_size; |
95f72d1ed lmb: rename to me... |
585 |
} |
10d064398 memblock: Option ... |
586 |
phys_addr_t __init_memblock memblock_end_of_DRAM(void) |
95f72d1ed lmb: rename to me... |
587 588 |
{ int idx = memblock.memory.cnt - 1; |
e3239ff92 memblock: Rename ... |
589 |
return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size); |
95f72d1ed lmb: rename to me... |
590 591 592 |
} /* You must call memblock_analyze() after this. */ |
2898cc4cd memblock: Change ... |
593 |
void __init memblock_enforce_memory_limit(phys_addr_t memory_limit) |
95f72d1ed lmb: rename to me... |
594 595 |
{ unsigned long i; |
2898cc4cd memblock: Change ... |
596 |
phys_addr_t limit; |
e3239ff92 memblock: Rename ... |
597 |
struct memblock_region *p; |
95f72d1ed lmb: rename to me... |
598 599 600 601 602 603 604 |
if (!memory_limit) return; /* Truncate the memblock regions to satisfy the memory limit. */ limit = memory_limit; for (i = 0; i < memblock.memory.cnt; i++) { |
e3239ff92 memblock: Rename ... |
605 606 |
if (limit > memblock.memory.regions[i].size) { limit -= memblock.memory.regions[i].size; |
95f72d1ed lmb: rename to me... |
607 608 |
continue; } |
e3239ff92 memblock: Rename ... |
609 |
memblock.memory.regions[i].size = limit; |
95f72d1ed lmb: rename to me... |
610 611 612 |
memblock.memory.cnt = i + 1; break; } |
95f72d1ed lmb: rename to me... |
613 614 615 616 |
memory_limit = memblock_end_of_DRAM(); /* And truncate any reserves above the limit also. */ for (i = 0; i < memblock.reserved.cnt; i++) { |
e3239ff92 memblock: Rename ... |
617 |
p = &memblock.reserved.regions[i]; |
95f72d1ed lmb: rename to me... |
618 619 620 621 622 623 624 625 626 627 628 629 |
if (p->base > memory_limit) p->size = 0; else if ((p->base + p->size) > memory_limit) p->size = memory_limit - p->base; if (p->size == 0) { memblock_remove_region(&memblock.reserved, i); i--; } } } |
cd79481d2 memblock: Annotat... |
630 |
static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr) |
72d4b0b4e memblock: Impleme... |
631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 |
{ 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; } |
2898cc4cd memblock: Change ... |
647 |
int __init memblock_is_reserved(phys_addr_t addr) |
95f72d1ed lmb: rename to me... |
648 |
{ |
72d4b0b4e memblock: Impleme... |
649 650 |
return memblock_search(&memblock.reserved, addr) != -1; } |
95f72d1ed lmb: rename to me... |
651 |
|
3661ca66a memblock: Fix sec... |
652 |
int __init_memblock memblock_is_memory(phys_addr_t addr) |
72d4b0b4e memblock: Impleme... |
653 654 655 |
{ return memblock_search(&memblock.memory, addr) != -1; } |
3661ca66a memblock: Fix sec... |
656 |
int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size) |
72d4b0b4e memblock: Impleme... |
657 |
{ |
abb65272a memblock: fix mem... |
658 |
int idx = memblock_search(&memblock.memory, base); |
72d4b0b4e memblock: Impleme... |
659 660 661 |
if (idx == -1) return 0; |
abb65272a memblock: fix mem... |
662 663 664 |
return memblock.memory.regions[idx].base <= base && (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size) >= (base + size); |
95f72d1ed lmb: rename to me... |
665 |
} |
10d064398 memblock: Option ... |
666 |
int __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size) |
95f72d1ed lmb: rename to me... |
667 |
{ |
f1c2c19c4 memblock: Fix mem... |
668 |
return memblock_overlaps_region(&memblock.reserved, base, size) >= 0; |
95f72d1ed lmb: rename to me... |
669 |
} |
e63075a3c memblock: Introdu... |
670 |
|
3661ca66a memblock: Fix sec... |
671 |
void __init_memblock memblock_set_current_limit(phys_addr_t limit) |
e63075a3c memblock: Introdu... |
672 673 674 |
{ memblock.current_limit = limit; } |
10d064398 memblock: Option ... |
675 |
static void __init_memblock memblock_dump(struct memblock_type *region, char *name) |
6ed311b28 memblock: Move fu... |
676 677 678 679 680 681 682 683 684 685 |
{ unsigned long long base, size; int i; pr_info(" %s.cnt = 0x%lx ", name, region->cnt); for (i = 0; i < region->cnt; i++) { base = region->regions[i].base; size = region->regions[i].size; |
ea9e4376b memblock: Improve... |
686 687 |
pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes ", |
6ed311b28 memblock: Move fu... |
688 689 690 |
name, i, base, base + size - 1, size); } } |
10d064398 memblock: Option ... |
691 |
void __init_memblock memblock_dump_all(void) |
6ed311b28 memblock: Move fu... |
692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 |
{ if (!memblock_debug) return; pr_info("MEMBLOCK configuration: "); pr_info(" memory size = 0x%llx ", (unsigned long long)memblock.memory_size); memblock_dump(&memblock.memory, "memory"); memblock_dump(&memblock.reserved, "reserved"); } void __init memblock_analyze(void) { int i; /* Check marker in the unused last array entry */ WARN_ON(memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS].base |
c9d8c3d08 mm/memblock.c: av... |
711 |
!= MEMBLOCK_INACTIVE); |
6ed311b28 memblock: Move fu... |
712 |
WARN_ON(memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS].base |
c9d8c3d08 mm/memblock.c: av... |
713 |
!= MEMBLOCK_INACTIVE); |
6ed311b28 memblock: Move fu... |
714 715 716 717 718 |
memblock.memory_size = 0; for (i = 0; i < memblock.memory.cnt; i++) memblock.memory_size += memblock.memory.regions[i].size; |
142b45a72 memblock: Add arr... |
719 720 721 |
/* We allow resizing from there */ memblock_can_resize = 1; |
6ed311b28 memblock: Move fu... |
722 |
} |
7590abe89 memblock: Move me... |
723 724 |
void __init memblock_init(void) { |
236260b90 memblock: Allow m... |
725 726 727 728 729 |
static int init_done __initdata = 0; if (init_done) return; init_done = 1; |
7590abe89 memblock: Move me... |
730 731 732 733 734 735 736 |
/* Hookup the initial arrays */ memblock.memory.regions = memblock_memory_init_regions; memblock.memory.max = INIT_MEMBLOCK_REGIONS; memblock.reserved.regions = memblock_reserved_init_regions; memblock.reserved.max = INIT_MEMBLOCK_REGIONS; /* Write a marker in the unused last array entry */ |
c9d8c3d08 mm/memblock.c: av... |
737 738 |
memblock.memory.regions[INIT_MEMBLOCK_REGIONS].base = MEMBLOCK_INACTIVE; memblock.reserved.regions[INIT_MEMBLOCK_REGIONS].base = MEMBLOCK_INACTIVE; |
7590abe89 memblock: Move me... |
739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 |
/* Create a dummy zero size MEMBLOCK which will get coalesced away later. * This simplifies the memblock_add() code below... */ memblock.memory.regions[0].base = 0; memblock.memory.regions[0].size = 0; memblock.memory.cnt = 1; /* Ditto. */ memblock.reserved.regions[0].base = 0; memblock.reserved.regions[0].size = 0; memblock.reserved.cnt = 1; memblock.current_limit = MEMBLOCK_ALLOC_ANYWHERE; } |
6ed311b28 memblock: Move fu... |
754 755 756 757 758 759 760 |
static int __init early_memblock(char *p) { if (p && strstr(p, "debug")) memblock_debug = 1; return 0; } early_param("memblock", early_memblock); |
10d064398 memblock: Option ... |
761 |
#if defined(CONFIG_DEBUG_FS) && !defined(ARCH_DISCARD_MEMBLOCK) |
6d03b885f memblock: Add deb... |
762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 |
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); return 0; } __initcall(memblock_init_debugfs); #endif /* CONFIG_DEBUG_FS */ |