Blame view
kernel/early_res.c
13.9 KB
a678c2be7 x86: Separate ear... |
1 2 3 4 5 6 7 8 |
/* * early_res, could be used to replace bootmem */ #include <linux/kernel.h> #include <linux/types.h> #include <linux/init.h> #include <linux/bootmem.h> #include <linux/mm.h> |
580e0ad21 core: Move early_... |
9 |
#include <linux/early_res.h> |
9078370c0 kmemleak: Add sup... |
10 11 |
#include <linux/slab.h> #include <linux/kmemleak.h> |
a678c2be7 x86: Separate ear... |
12 13 14 15 16 17 |
/* * Early reserved memory areas. */ /* * need to make sure this one is bigger enough before |
dd645cee7 x86: Add find_fw_... |
18 |
* find_fw_memmap_area could be used |
a678c2be7 x86: Separate ear... |
19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 |
*/ #define MAX_EARLY_RES_X 32 struct early_res { u64 start, end; char name[15]; char overlap_ok; }; static struct early_res early_res_x[MAX_EARLY_RES_X] __initdata; static int max_early_res __initdata = MAX_EARLY_RES_X; static struct early_res *early_res __initdata = &early_res_x[0]; static int early_res_count __initdata; static int __init find_overlapped_early(u64 start, u64 end) { int i; struct early_res *r; for (i = 0; i < max_early_res && early_res[i].end; i++) { r = &early_res[i]; if (end > r->start && start < r->end) break; } return i; } /* * Drop the i-th range from the early reservation map, * by copying any higher ranges down one over it, and * clearing what had been the last slot. */ static void __init drop_range(int i) { int j; for (j = i + 1; j < max_early_res && early_res[j].end; j++) ; memmove(&early_res[i], &early_res[i + 1], (j - 1 - i) * sizeof(struct early_res)); early_res[j - 1].end = 0; early_res_count--; } |
fb90ef93d early_res: Add fr... |
65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 |
static void __init drop_range_partial(int i, u64 start, u64 end) { u64 common_start, common_end; u64 old_start, old_end; old_start = early_res[i].start; old_end = early_res[i].end; common_start = max(old_start, start); common_end = min(old_end, end); /* no overlap ? */ if (common_start >= common_end) return; if (old_start < common_start) { /* make head segment */ early_res[i].end = common_start; if (old_end > common_end) { |
dce46a04d early_res: Need t... |
83 84 85 86 87 88 89 90 91 92 93 |
char name[15]; /* * Save a local copy of the name, since the * early_res array could get resized inside * reserve_early_without_check() -> * __check_and_double_early_res(), which would * make the current name pointer invalid. */ strncpy(name, early_res[i].name, sizeof(early_res[i].name) - 1); |
fb90ef93d early_res: Add fr... |
94 |
/* add another for left over on tail */ |
dce46a04d early_res: Need t... |
95 |
reserve_early_without_check(common_end, old_end, name); |
fb90ef93d early_res: Add fr... |
96 97 98 99 100 101 102 103 104 105 106 107 |
} return; } else { if (old_end > common_end) { /* reuse the entry for tail left */ early_res[i].start = common_end; return; } /* all covered */ drop_range(i); } } |
a678c2be7 x86: Separate ear... |
108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 |
/* * Split any existing ranges that: * 1) are marked 'overlap_ok', and * 2) overlap with the stated range [start, end) * into whatever portion (if any) of the existing range is entirely * below or entirely above the stated range. Drop the portion * of the existing range that overlaps with the stated range, * which will allow the caller of this routine to then add that * stated range without conflicting with any existing range. */ static void __init drop_overlaps_that_are_ok(u64 start, u64 end) { int i; struct early_res *r; u64 lower_start, lower_end; u64 upper_start, upper_end; char name[15]; for (i = 0; i < max_early_res && early_res[i].end; i++) { r = &early_res[i]; /* Continue past non-overlapping ranges */ if (end <= r->start || start >= r->end) continue; /* * Leave non-ok overlaps as is; let caller * panic "Overlapping early reservations" * when it hits this overlap. */ if (!r->overlap_ok) return; /* * We have an ok overlap. We will drop it from the early * reservation map, and add back in any non-overlapping * portions (lower or upper) as separate, overlap_ok, * non-overlapping ranges. */ /* 1. Note any non-overlapping (lower or upper) ranges. */ strncpy(name, r->name, sizeof(name) - 1); lower_start = lower_end = 0; upper_start = upper_end = 0; if (r->start < start) { lower_start = r->start; lower_end = start; } if (r->end > end) { upper_start = end; upper_end = r->end; } /* 2. Drop the original ok overlapping range */ drop_range(i); i--; /* resume for-loop on copied down entry */ /* 3. Add back in any non-overlapping ranges. */ if (lower_end) reserve_early_overlap_ok(lower_start, lower_end, name); if (upper_end) reserve_early_overlap_ok(upper_start, upper_end, name); } } static void __init __reserve_early(u64 start, u64 end, char *name, int overlap_ok) { int i; struct early_res *r; i = find_overlapped_early(start, end); if (i >= max_early_res) panic("Too many early reservations"); r = &early_res[i]; if (r->end) panic("Overlapping early reservations " "%llx-%llx %s to %llx-%llx %s ", start, end - 1, name ? name : "", r->start, r->end - 1, r->name); r->start = start; r->end = end; r->overlap_ok = overlap_ok; if (name) strncpy(r->name, name, sizeof(r->name) - 1); early_res_count++; } /* * A few early reservtations come here. * * The 'overlap_ok' in the name of this routine does -not- mean it * is ok for these reservations to overlap an earlier reservation. * Rather it means that it is ok for subsequent reservations to * overlap this one. * * Use this entry point to reserve early ranges when you are doing * so out of "Paranoia", reserving perhaps more memory than you need, * just in case, and don't mind a subsequent overlapping reservation * that is known to be needed. * * The drop_overlaps_that_are_ok() call here isn't really needed. * It would be needed if we had two colliding 'overlap_ok' * reservations, so that the second such would not panic on the * overlap with the first. We don't have any such as of this * writing, but might as well tolerate such if it happens in * the future. */ void __init reserve_early_overlap_ok(u64 start, u64 end, char *name) { drop_overlaps_that_are_ok(start, end); __reserve_early(start, end, name, 1); } |
53db62a25 early_res: Enhanc... |
224 |
static void __init __check_and_double_early_res(u64 ex_start, u64 ex_end) |
a678c2be7 x86: Separate ear... |
225 |
{ |
53db62a25 early_res: Enhanc... |
226 |
u64 start, end, size, mem; |
a678c2be7 x86: Separate ear... |
227 228 229 230 231 232 233 |
struct early_res *new; /* do we have enough slots left ? */ if ((max_early_res - early_res_count) > max(max_early_res/8, 2)) return; /* double it */ |
53db62a25 early_res: Enhanc... |
234 |
mem = -1ULL; |
a678c2be7 x86: Separate ear... |
235 |
size = sizeof(struct early_res) * max_early_res * 2; |
53db62a25 early_res: Enhanc... |
236 237 238 239 240 241 |
if (early_res == early_res_x) start = 0; else start = early_res[0].end; end = ex_start; if (start + size < end) |
dd645cee7 x86: Add find_fw_... |
242 |
mem = find_fw_memmap_area(start, end, size, |
53db62a25 early_res: Enhanc... |
243 244 245 |
sizeof(struct early_res)); if (mem == -1ULL) { start = ex_end; |
580e0ad21 core: Move early_... |
246 |
end = get_max_mapped(); |
53db62a25 early_res: Enhanc... |
247 |
if (start + size < end) |
dd645cee7 x86: Add find_fw_... |
248 |
mem = find_fw_memmap_area(start, end, size, |
53db62a25 early_res: Enhanc... |
249 250 |
sizeof(struct early_res)); } |
a678c2be7 x86: Separate ear... |
251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 |
if (mem == -1ULL) panic("can not find more space for early_res array"); new = __va(mem); /* save the first one for own */ new[0].start = mem; new[0].end = mem + size; new[0].overlap_ok = 0; /* copy old to new */ if (early_res == early_res_x) { memcpy(&new[1], &early_res[0], sizeof(struct early_res) * max_early_res); memset(&new[max_early_res+1], 0, sizeof(struct early_res) * (max_early_res - 1)); early_res_count++; } else { memcpy(&new[1], &early_res[1], sizeof(struct early_res) * (max_early_res - 1)); memset(&new[max_early_res], 0, sizeof(struct early_res) * max_early_res); } memset(&early_res[0], 0, sizeof(struct early_res) * max_early_res); early_res = new; max_early_res *= 2; printk(KERN_DEBUG "early_res array is doubled to %d at [%llx - %llx] ", max_early_res, mem, mem + size - 1); } /* * Most early reservations come here. * * We first have drop_overlaps_that_are_ok() drop any pre-existing * 'overlap_ok' ranges, so that we can then reserve this memory * range without risk of panic'ing on an overlapping overlap_ok * early reservation. */ void __init reserve_early(u64 start, u64 end, char *name) { if (start >= end) return; |
53db62a25 early_res: Enhanc... |
292 |
__check_and_double_early_res(start, end); |
a678c2be7 x86: Separate ear... |
293 294 295 296 297 298 299 300 301 302 303 |
drop_overlaps_that_are_ok(start, end); __reserve_early(start, end, name, 0); } void __init reserve_early_without_check(u64 start, u64 end, char *name) { struct early_res *r; if (start >= end) return; |
53db62a25 early_res: Enhanc... |
304 |
__check_and_double_early_res(start, end); |
a678c2be7 x86: Separate ear... |
305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 |
r = &early_res[early_res_count]; r->start = start; r->end = end; r->overlap_ok = 0; if (name) strncpy(r->name, name, sizeof(r->name) - 1); early_res_count++; } void __init free_early(u64 start, u64 end) { struct early_res *r; int i; |
9078370c0 kmemleak: Add sup... |
320 |
kmemleak_free_part(__va(start), end - start); |
a678c2be7 x86: Separate ear... |
321 322 323 324 325 326 327 328 |
i = find_overlapped_early(start, end); r = &early_res[i]; if (i >= max_early_res || r->end != end || r->start != start) panic("free_early on not reserved area: %llx-%llx!", start, end - 1); drop_range(i); } |
fb90ef93d early_res: Add fr... |
329 330 331 332 |
void __init free_early_partial(u64 start, u64 end) { struct early_res *r; int i; |
9078370c0 kmemleak: Add sup... |
333 |
kmemleak_free_part(__va(start), end - start); |
eed63519e x86: Do not free ... |
334 335 336 337 338 339 |
if (start == end) return; if (WARN_ONCE(start > end, " wrong range [%#llx, %#llx] ", start, end)) return; |
fb90ef93d early_res: Add fr... |
340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 |
try_next: i = find_overlapped_early(start, end); if (i >= max_early_res) return; r = &early_res[i]; /* hole ? */ if (r->end >= end && r->start <= start) { drop_range_partial(i, start, end); return; } drop_range_partial(i, start, end); goto try_next; } |
a678c2be7 x86: Separate ear... |
355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 |
#ifdef CONFIG_NO_BOOTMEM static void __init subtract_early_res(struct range *range, int az) { int i, count; u64 final_start, final_end; int idx = 0; count = 0; for (i = 0; i < max_early_res && early_res[i].end; i++) count++; /* need to skip first one ?*/ if (early_res != early_res_x) idx = 1; #define DEBUG_PRINT_EARLY_RES 1 #if DEBUG_PRINT_EARLY_RES printk(KERN_INFO "Subtract (%d early reservations) ", count); #endif for (i = idx; i < count; i++) { struct early_res *r = &early_res[i]; #if DEBUG_PRINT_EARLY_RES printk(KERN_INFO " #%d [%010llx - %010llx] %15s ", i, r->start, r->end, r->name); #endif final_start = PFN_DOWN(r->start); final_end = PFN_UP(r->end); if (final_start >= final_end) continue; subtract_range(range, az, final_start, final_end); } } int __init get_free_all_memory_range(struct range **rangep, int nodeid) { int i, count; u64 start = 0, end; u64 size; u64 mem; struct range *range; int nr_range; count = 0; for (i = 0; i < max_early_res && early_res[i].end; i++) count++; count *= 2; size = sizeof(struct range) * count; |
580e0ad21 core: Move early_... |
408 |
end = get_max_mapped(); |
a678c2be7 x86: Separate ear... |
409 |
#ifdef MAX_DMA32_PFN |
580e0ad21 core: Move early_... |
410 |
if (end > (MAX_DMA32_PFN << PAGE_SHIFT)) |
a678c2be7 x86: Separate ear... |
411 412 |
start = MAX_DMA32_PFN << PAGE_SHIFT; #endif |
dd645cee7 x86: Add find_fw_... |
413 |
mem = find_fw_memmap_area(start, end, size, sizeof(struct range)); |
a678c2be7 x86: Separate ear... |
414 415 416 417 418 419 420 421 422 423 |
if (mem == -1ULL) panic("can not find more space for range free"); range = __va(mem); /* use early_node_map[] and early_res to get range array at first */ memset(range, 0, size); nr_range = 0; /* need to go over early_node_map to find out good range for node */ nr_range = add_from_early_node_map(range, count, nr_range, nodeid); |
59be5a8e8 x86: Make 32bit s... |
424 425 426 |
#ifdef CONFIG_X86_32 subtract_range(range, count, max_low_pfn, -1ULL); #endif |
a678c2be7 x86: Separate ear... |
427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 |
subtract_early_res(range, count); nr_range = clean_sort_range(range, count); /* need to clear it ? */ if (nodeid == MAX_NUMNODES) { memset(&early_res[0], 0, sizeof(struct early_res) * max_early_res); early_res = NULL; max_early_res = 0; } *rangep = range; return nr_range; } #else void __init early_res_to_bootmem(u64 start, u64 end) { int i, count; u64 final_start, final_end; int idx = 0; count = 0; for (i = 0; i < max_early_res && early_res[i].end; i++) count++; /* need to skip first one ?*/ if (early_res != early_res_x) idx = 1; printk(KERN_INFO "(%d/%d early reservations) ==> bootmem [%010llx - %010llx] ", count - idx, max_early_res, start, end); for (i = idx; i < count; i++) { struct early_res *r = &early_res[i]; printk(KERN_INFO " #%d [%010llx - %010llx] %16s", i, r->start, r->end, r->name); final_start = max(start, r->start); final_end = min(end, r->end); if (final_start >= final_end) { printk(KERN_CONT " "); continue; } printk(KERN_CONT " ==> [%010llx - %010llx] ", final_start, final_end); reserve_bootmem_generic(final_start, final_end - final_start, BOOTMEM_DEFAULT); } /* clear them */ memset(&early_res[0], 0, sizeof(struct early_res) * max_early_res); early_res = NULL; max_early_res = 0; early_res_count = 0; } #endif /* Check for already reserved areas */ static inline int __init bad_addr(u64 *addrp, u64 size, u64 align) { int i; u64 addr = *addrp; int changed = 0; struct early_res *r; again: i = find_overlapped_early(addr, addr + size); r = &early_res[i]; if (i < max_early_res && r->end) { *addrp = addr = round_up(r->end, align); changed = 1; goto again; } return changed; } /* Check for already reserved areas */ static inline int __init bad_addr_size(u64 *addrp, u64 *sizep, u64 align) { int i; u64 addr = *addrp, last; u64 size = *sizep; int changed = 0; again: last = addr + size; for (i = 0; i < max_early_res && early_res[i].end; i++) { struct early_res *r = &early_res[i]; if (last > r->start && addr < r->start) { size = r->start - addr; changed = 1; goto again; } if (last > r->end && addr < r->end) { addr = round_up(r->end, align); size = last - addr; changed = 1; goto again; } if (last <= r->end && addr >= r->start) { (*sizep)++; return 0; } } if (changed) { *addrp = addr; *sizep = size; } return changed; } /* * Find a free area with specified alignment in a specific range. * only with the area.between start to end is active range from early_node_map * so they are good as RAM */ u64 __init find_early_area(u64 ei_start, u64 ei_last, u64 start, u64 end, u64 size, u64 align) { u64 addr, last; addr = round_up(ei_start, align); if (addr < start) addr = round_up(start, align); if (addr >= ei_last) goto out; while (bad_addr(&addr, size, align) && addr+size <= ei_last) ; last = addr + size; if (last > ei_last) goto out; if (last > end) goto out; return addr; out: return -1ULL; } |
7da657d1f x86: Add find_ear... |
564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 |
u64 __init find_early_area_size(u64 ei_start, u64 ei_last, u64 start, u64 *sizep, u64 align) { u64 addr, last; addr = round_up(ei_start, align); if (addr < start) addr = round_up(start, align); if (addr >= ei_last) goto out; *sizep = ei_last - addr; while (bad_addr_size(&addr, sizep, align) && addr + *sizep <= ei_last) ; last = addr + *sizep; if (last > ei_last) goto out; return addr; out: return -1ULL; } |