Blame view
kernel/kexec.c
38.8 KB
dc009d924
|
1 2 3 4 5 6 7 |
/* * kexec.c - kexec system call * Copyright (C) 2002-2004 Eric Biederman <ebiederm@xmission.com> * * This source code is licensed under the GNU General Public License, * Version 2. See the file COPYING for more details. */ |
c59ede7b7
|
8 |
#include <linux/capability.h> |
dc009d924
|
9 10 11 12 13 |
#include <linux/mm.h> #include <linux/file.h> #include <linux/slab.h> #include <linux/fs.h> #include <linux/kexec.h> |
8c5a1cf0a
|
14 |
#include <linux/mutex.h> |
dc009d924
|
15 16 17 18 |
#include <linux/list.h> #include <linux/highmem.h> #include <linux/syscalls.h> #include <linux/reboot.h> |
dc009d924
|
19 |
#include <linux/ioport.h> |
6e274d144
|
20 |
#include <linux/hardirq.h> |
85916f816
|
21 22 |
#include <linux/elf.h> #include <linux/elfcore.h> |
273b281fa
|
23 |
#include <generated/utsrelease.h> |
fd59d231f
|
24 25 |
#include <linux/utsname.h> #include <linux/numa.h> |
3ab835213
|
26 27 |
#include <linux/suspend.h> #include <linux/device.h> |
89081d17f
|
28 29 30 31 |
#include <linux/freezer.h> #include <linux/pm.h> #include <linux/cpu.h> #include <linux/console.h> |
5f41b8cdc
|
32 |
#include <linux/vmalloc.h> |
06a7f7112
|
33 |
#include <linux/swap.h> |
0f4bd46ec
|
34 |
#include <linux/kmsg_dump.h> |
6e274d144
|
35 |
|
dc009d924
|
36 37 38 39 |
#include <asm/page.h> #include <asm/uaccess.h> #include <asm/io.h> #include <asm/system.h> |
fd59d231f
|
40 |
#include <asm/sections.h> |
dc009d924
|
41 |
|
cc5716587
|
42 |
/* Per cpu memory for storing cpu states in case of system crash. */ |
43cf38eb5
|
43 |
note_buf_t __percpu *crash_notes; |
cc5716587
|
44 |
|
fd59d231f
|
45 |
/* vmcoreinfo stuff */ |
edb79a213
|
46 |
static unsigned char vmcoreinfo_data[VMCOREINFO_BYTES]; |
fd59d231f
|
47 |
u32 vmcoreinfo_note[VMCOREINFO_NOTE_SIZE/4]; |
d768281e9
|
48 49 |
size_t vmcoreinfo_size; size_t vmcoreinfo_max_size = sizeof(vmcoreinfo_data); |
fd59d231f
|
50 |
|
dc009d924
|
51 52 53 54 55 56 57 |
/* Location of the reserved area for the crash kernel */ struct resource crashk_res = { .name = "Crash kernel", .start = 0, .end = 0, .flags = IORESOURCE_BUSY | IORESOURCE_MEM }; |
6e274d144
|
58 59 |
int kexec_should_crash(struct task_struct *p) { |
b460cbc58
|
60 |
if (in_interrupt() || !p->pid || is_global_init(p) || panic_on_oops) |
6e274d144
|
61 62 63 |
return 1; return 0; } |
dc009d924
|
64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 |
/* * When kexec transitions to the new kernel there is a one-to-one * mapping between physical and virtual addresses. On processors * where you can disable the MMU this is trivial, and easy. For * others it is still a simple predictable page table to setup. * * In that environment kexec copies the new kernel to its final * resting place. This means I can only support memory whose * physical address can fit in an unsigned long. In particular * addresses where (pfn << PAGE_SHIFT) > ULONG_MAX cannot be handled. * If the assembly stub has more restrictive requirements * KEXEC_SOURCE_MEMORY_LIMIT and KEXEC_DEST_MEMORY_LIMIT can be * defined more restrictively in <asm/kexec.h>. * * The code for the transition from the current kernel to the * the new kernel is placed in the control_code_buffer, whose size |
163f6876f
|
80 |
* is given by KEXEC_CONTROL_PAGE_SIZE. In the best case only a single |
dc009d924
|
81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 |
* page of memory is necessary, but some architectures require more. * Because this memory must be identity mapped in the transition from * virtual to physical addresses it must live in the range * 0 - TASK_SIZE, as only the user space mappings are arbitrarily * modifiable. * * The assembly stub in the control code buffer is passed a linked list * of descriptor pages detailing the source pages of the new kernel, * and the destination addresses of those source pages. As this data * structure is not used in the context of the current OS, it must * be self-contained. * * The code has been made to work with highmem pages and will use a * destination page in its final resting place (if it happens * to allocate it). The end product of this is that most of the * physical address space, and most of RAM can be used. * * Future directions include: * - allocating a page table with the control code buffer identity * mapped, to simplify machine_kexec and make kexec_on_panic more * reliable. */ /* * KIMAGE_NO_DEST is an impossible destination address..., for * allocating pages whose destination address we do not care about. */ #define KIMAGE_NO_DEST (-1UL) |
72414d3f1
|
109 110 111 |
static int kimage_is_destination_range(struct kimage *image, unsigned long start, unsigned long end); static struct page *kimage_alloc_page(struct kimage *image, |
9796fdd82
|
112 |
gfp_t gfp_mask, |
72414d3f1
|
113 |
unsigned long dest); |
dc009d924
|
114 115 |
static int do_kimage_alloc(struct kimage **rimage, unsigned long entry, |
72414d3f1
|
116 117 |
unsigned long nr_segments, struct kexec_segment __user *segments) |
dc009d924
|
118 119 120 121 122 123 124 125 |
{ size_t segment_bytes; struct kimage *image; unsigned long i; int result; /* Allocate a controlling structure */ result = -ENOMEM; |
4668edc33
|
126 |
image = kzalloc(sizeof(*image), GFP_KERNEL); |
72414d3f1
|
127 |
if (!image) |
dc009d924
|
128 |
goto out; |
72414d3f1
|
129 |
|
dc009d924
|
130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 |
image->head = 0; image->entry = &image->head; image->last_entry = &image->head; image->control_page = ~0; /* By default this does not apply */ image->start = entry; image->type = KEXEC_TYPE_DEFAULT; /* Initialize the list of control pages */ INIT_LIST_HEAD(&image->control_pages); /* Initialize the list of destination pages */ INIT_LIST_HEAD(&image->dest_pages); /* Initialize the list of unuseable pages */ INIT_LIST_HEAD(&image->unuseable_pages); /* Read in the segments */ image->nr_segments = nr_segments; segment_bytes = nr_segments * sizeof(*segments); result = copy_from_user(image->segment, segments, segment_bytes); |
f65a03f6a
|
150 151 |
if (result) { result = -EFAULT; |
dc009d924
|
152 |
goto out; |
f65a03f6a
|
153 |
} |
dc009d924
|
154 155 156 157 158 159 160 161 |
/* * Verify we have good destination addresses. The caller is * responsible for making certain we don't attempt to load * the new image into invalid or reserved areas of RAM. This * just verifies it is an address we can use. * * Since the kernel does everything in page size chunks ensure |
b595076a1
|
162 |
* the destination addresses are page aligned. Too many |
dc009d924
|
163 164 165 166 167 168 169 170 |
* special cases crop of when we don't do this. The most * insidious is getting overlapping destination addresses * simply because addresses are changed to page size * granularity. */ result = -EADDRNOTAVAIL; for (i = 0; i < nr_segments; i++) { unsigned long mstart, mend; |
72414d3f1
|
171 |
|
dc009d924
|
172 173 174 175 176 177 178 179 180 181 182 183 184 185 |
mstart = image->segment[i].mem; mend = mstart + image->segment[i].memsz; if ((mstart & ~PAGE_MASK) || (mend & ~PAGE_MASK)) goto out; if (mend >= KEXEC_DESTINATION_MEMORY_LIMIT) goto out; } /* Verify our destination addresses do not overlap. * If we alloed overlapping destination addresses * through very weird things can happen with no * easy explanation as one segment stops on another. */ result = -EINVAL; |
72414d3f1
|
186 |
for (i = 0; i < nr_segments; i++) { |
dc009d924
|
187 188 |
unsigned long mstart, mend; unsigned long j; |
72414d3f1
|
189 |
|
dc009d924
|
190 191 |
mstart = image->segment[i].mem; mend = mstart + image->segment[i].memsz; |
72414d3f1
|
192 |
for (j = 0; j < i; j++) { |
dc009d924
|
193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 |
unsigned long pstart, pend; pstart = image->segment[j].mem; pend = pstart + image->segment[j].memsz; /* Do the segments overlap ? */ if ((mend > pstart) && (mstart < pend)) goto out; } } /* Ensure our buffer sizes are strictly less than * our memory sizes. This should always be the case, * and it is easier to check up front than to be surprised * later on. */ result = -EINVAL; |
72414d3f1
|
208 |
for (i = 0; i < nr_segments; i++) { |
dc009d924
|
209 210 211 |
if (image->segment[i].bufsz > image->segment[i].memsz) goto out; } |
dc009d924
|
212 |
result = 0; |
72414d3f1
|
213 214 |
out: if (result == 0) |
dc009d924
|
215 |
*rimage = image; |
72414d3f1
|
216 |
else |
dc009d924
|
217 |
kfree(image); |
72414d3f1
|
218 |
|
dc009d924
|
219 220 221 222 223 |
return result; } static int kimage_normal_alloc(struct kimage **rimage, unsigned long entry, |
72414d3f1
|
224 225 |
unsigned long nr_segments, struct kexec_segment __user *segments) |
dc009d924
|
226 227 228 229 230 231 232 |
{ int result; struct kimage *image; /* Allocate and initialize a controlling structure */ image = NULL; result = do_kimage_alloc(&image, entry, nr_segments, segments); |
72414d3f1
|
233 |
if (result) |
dc009d924
|
234 |
goto out; |
72414d3f1
|
235 |
|
dc009d924
|
236 237 238 239 240 241 242 243 244 |
*rimage = image; /* * Find a location for the control code buffer, and add it * the vector of segments so that it's pages will also be * counted as destination pages. */ result = -ENOMEM; image->control_code_page = kimage_alloc_control_pages(image, |
163f6876f
|
245 |
get_order(KEXEC_CONTROL_PAGE_SIZE)); |
dc009d924
|
246 247 248 249 250 |
if (!image->control_code_page) { printk(KERN_ERR "Could not allocate control_code_buffer "); goto out; } |
3ab835213
|
251 252 253 254 255 256 |
image->swap_page = kimage_alloc_control_pages(image, 0); if (!image->swap_page) { printk(KERN_ERR "Could not allocate swap buffer "); goto out; } |
dc009d924
|
257 258 |
result = 0; out: |
72414d3f1
|
259 |
if (result == 0) |
dc009d924
|
260 |
*rimage = image; |
72414d3f1
|
261 |
else |
dc009d924
|
262 |
kfree(image); |
72414d3f1
|
263 |
|
dc009d924
|
264 265 266 267 |
return result; } static int kimage_crash_alloc(struct kimage **rimage, unsigned long entry, |
72414d3f1
|
268 |
unsigned long nr_segments, |
314b6a4d8
|
269 |
struct kexec_segment __user *segments) |
dc009d924
|
270 271 272 273 274 275 276 277 278 279 280 281 282 283 |
{ int result; struct kimage *image; unsigned long i; image = NULL; /* Verify we have a valid entry point */ if ((entry < crashk_res.start) || (entry > crashk_res.end)) { result = -EADDRNOTAVAIL; goto out; } /* Allocate and initialize a controlling structure */ result = do_kimage_alloc(&image, entry, nr_segments, segments); |
72414d3f1
|
284 |
if (result) |
dc009d924
|
285 |
goto out; |
dc009d924
|
286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 |
/* Enable the special crash kernel control page * allocation policy. */ image->control_page = crashk_res.start; image->type = KEXEC_TYPE_CRASH; /* * Verify we have good destination addresses. Normally * the caller is responsible for making certain we don't * attempt to load the new image into invalid or reserved * areas of RAM. But crash kernels are preloaded into a * reserved area of ram. We must ensure the addresses * are in the reserved area otherwise preloading the * kernel could corrupt things. */ result = -EADDRNOTAVAIL; for (i = 0; i < nr_segments; i++) { unsigned long mstart, mend; |
72414d3f1
|
305 |
|
dc009d924
|
306 |
mstart = image->segment[i].mem; |
50cccc699
|
307 |
mend = mstart + image->segment[i].memsz - 1; |
dc009d924
|
308 309 310 311 |
/* Ensure we are within the crash kernel limits */ if ((mstart < crashk_res.start) || (mend > crashk_res.end)) goto out; } |
dc009d924
|
312 313 314 315 316 317 318 |
/* * Find a location for the control code buffer, and add * the vector of segments so that it's pages will also be * counted as destination pages. */ result = -ENOMEM; image->control_code_page = kimage_alloc_control_pages(image, |
163f6876f
|
319 |
get_order(KEXEC_CONTROL_PAGE_SIZE)); |
dc009d924
|
320 321 322 323 324 325 326 |
if (!image->control_code_page) { printk(KERN_ERR "Could not allocate control_code_buffer "); goto out; } result = 0; |
72414d3f1
|
327 328 |
out: if (result == 0) |
dc009d924
|
329 |
*rimage = image; |
72414d3f1
|
330 |
else |
dc009d924
|
331 |
kfree(image); |
72414d3f1
|
332 |
|
dc009d924
|
333 334 |
return result; } |
72414d3f1
|
335 336 337 |
static int kimage_is_destination_range(struct kimage *image, unsigned long start, unsigned long end) |
dc009d924
|
338 339 340 341 342 |
{ unsigned long i; for (i = 0; i < image->nr_segments; i++) { unsigned long mstart, mend; |
72414d3f1
|
343 |
|
dc009d924
|
344 |
mstart = image->segment[i].mem; |
72414d3f1
|
345 346 |
mend = mstart + image->segment[i].memsz; if ((end > mstart) && (start < mend)) |
dc009d924
|
347 |
return 1; |
dc009d924
|
348 |
} |
72414d3f1
|
349 |
|
dc009d924
|
350 351 |
return 0; } |
9796fdd82
|
352 |
static struct page *kimage_alloc_pages(gfp_t gfp_mask, unsigned int order) |
dc009d924
|
353 354 |
{ struct page *pages; |
72414d3f1
|
355 |
|
dc009d924
|
356 357 358 359 |
pages = alloc_pages(gfp_mask, order); if (pages) { unsigned int count, i; pages->mapping = NULL; |
4c21e2f24
|
360 |
set_page_private(pages, order); |
dc009d924
|
361 |
count = 1 << order; |
72414d3f1
|
362 |
for (i = 0; i < count; i++) |
dc009d924
|
363 |
SetPageReserved(pages + i); |
dc009d924
|
364 |
} |
72414d3f1
|
365 |
|
dc009d924
|
366 367 368 369 370 371 |
return pages; } static void kimage_free_pages(struct page *page) { unsigned int order, count, i; |
72414d3f1
|
372 |
|
4c21e2f24
|
373 |
order = page_private(page); |
dc009d924
|
374 |
count = 1 << order; |
72414d3f1
|
375 |
for (i = 0; i < count; i++) |
dc009d924
|
376 |
ClearPageReserved(page + i); |
dc009d924
|
377 378 379 380 381 382 |
__free_pages(page, order); } static void kimage_free_page_list(struct list_head *list) { struct list_head *pos, *next; |
72414d3f1
|
383 |
|
dc009d924
|
384 385 386 387 388 |
list_for_each_safe(pos, next, list) { struct page *page; page = list_entry(pos, struct page, lru); list_del(&page->lru); |
dc009d924
|
389 390 391 |
kimage_free_pages(page); } } |
72414d3f1
|
392 393 |
static struct page *kimage_alloc_normal_control_pages(struct kimage *image, unsigned int order) |
dc009d924
|
394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 |
{ /* Control pages are special, they are the intermediaries * that are needed while we copy the rest of the pages * to their final resting place. As such they must * not conflict with either the destination addresses * or memory the kernel is already using. * * The only case where we really need more than one of * these are for architectures where we cannot disable * the MMU and must instead generate an identity mapped * page table for all of the memory. * * At worst this runs in O(N) of the image size. */ struct list_head extra_pages; struct page *pages; unsigned int count; count = 1 << order; INIT_LIST_HEAD(&extra_pages); /* Loop while I can allocate a page and the page allocated * is a destination page. */ do { unsigned long pfn, epfn, addr, eaddr; |
72414d3f1
|
420 |
|
dc009d924
|
421 422 423 424 425 426 427 428 |
pages = kimage_alloc_pages(GFP_KERNEL, order); if (!pages) break; pfn = page_to_pfn(pages); epfn = pfn + count; addr = pfn << PAGE_SHIFT; eaddr = epfn << PAGE_SHIFT; if ((epfn >= (KEXEC_CONTROL_MEMORY_LIMIT >> PAGE_SHIFT)) || |
72414d3f1
|
429 |
kimage_is_destination_range(image, addr, eaddr)) { |
dc009d924
|
430 431 432 |
list_add(&pages->lru, &extra_pages); pages = NULL; } |
72414d3f1
|
433 |
} while (!pages); |
dc009d924
|
434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 |
if (pages) { /* Remember the allocated page... */ list_add(&pages->lru, &image->control_pages); /* Because the page is already in it's destination * location we will never allocate another page at * that address. Therefore kimage_alloc_pages * will not return it (again) and we don't need * to give it an entry in image->segment[]. */ } /* Deal with the destination pages I have inadvertently allocated. * * Ideally I would convert multi-page allocations into single * page allocations, and add everyting to image->dest_pages. * * For now it is simpler to just free the pages. */ kimage_free_page_list(&extra_pages); |
dc009d924
|
453 |
|
72414d3f1
|
454 |
return pages; |
dc009d924
|
455 |
} |
72414d3f1
|
456 457 |
static struct page *kimage_alloc_crash_control_pages(struct kimage *image, unsigned int order) |
dc009d924
|
458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 |
{ /* Control pages are special, they are the intermediaries * that are needed while we copy the rest of the pages * to their final resting place. As such they must * not conflict with either the destination addresses * or memory the kernel is already using. * * Control pages are also the only pags we must allocate * when loading a crash kernel. All of the other pages * are specified by the segments and we just memcpy * into them directly. * * The only case where we really need more than one of * these are for architectures where we cannot disable * the MMU and must instead generate an identity mapped * page table for all of the memory. * * Given the low demand this implements a very simple * allocator that finds the first hole of the appropriate * size in the reserved memory region, and allocates all * of the memory up to and including the hole. */ unsigned long hole_start, hole_end, size; struct page *pages; |
72414d3f1
|
482 |
|
dc009d924
|
483 484 485 486 |
pages = NULL; size = (1 << order) << PAGE_SHIFT; hole_start = (image->control_page + (size - 1)) & ~(size - 1); hole_end = hole_start + size - 1; |
72414d3f1
|
487 |
while (hole_end <= crashk_res.end) { |
dc009d924
|
488 |
unsigned long i; |
72414d3f1
|
489 490 |
if (hole_end > KEXEC_CONTROL_MEMORY_LIMIT) |
dc009d924
|
491 |
break; |
72414d3f1
|
492 |
if (hole_end > crashk_res.end) |
dc009d924
|
493 |
break; |
dc009d924
|
494 |
/* See if I overlap any of the segments */ |
72414d3f1
|
495 |
for (i = 0; i < image->nr_segments; i++) { |
dc009d924
|
496 |
unsigned long mstart, mend; |
72414d3f1
|
497 |
|
dc009d924
|
498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 |
mstart = image->segment[i].mem; mend = mstart + image->segment[i].memsz - 1; if ((hole_end >= mstart) && (hole_start <= mend)) { /* Advance the hole to the end of the segment */ hole_start = (mend + (size - 1)) & ~(size - 1); hole_end = hole_start + size - 1; break; } } /* If I don't overlap any segments I have found my hole! */ if (i == image->nr_segments) { pages = pfn_to_page(hole_start >> PAGE_SHIFT); break; } } |
72414d3f1
|
513 |
if (pages) |
dc009d924
|
514 |
image->control_page = hole_end; |
72414d3f1
|
515 |
|
dc009d924
|
516 517 |
return pages; } |
72414d3f1
|
518 519 |
struct page *kimage_alloc_control_pages(struct kimage *image, unsigned int order) |
dc009d924
|
520 521 |
{ struct page *pages = NULL; |
72414d3f1
|
522 523 |
switch (image->type) { |
dc009d924
|
524 525 526 527 528 529 530 |
case KEXEC_TYPE_DEFAULT: pages = kimage_alloc_normal_control_pages(image, order); break; case KEXEC_TYPE_CRASH: pages = kimage_alloc_crash_control_pages(image, order); break; } |
72414d3f1
|
531 |
|
dc009d924
|
532 533 534 535 536 |
return pages; } static int kimage_add_entry(struct kimage *image, kimage_entry_t entry) { |
72414d3f1
|
537 |
if (*image->entry != 0) |
dc009d924
|
538 |
image->entry++; |
72414d3f1
|
539 |
|
dc009d924
|
540 541 542 |
if (image->entry == image->last_entry) { kimage_entry_t *ind_page; struct page *page; |
72414d3f1
|
543 |
|
dc009d924
|
544 |
page = kimage_alloc_page(image, GFP_KERNEL, KIMAGE_NO_DEST); |
72414d3f1
|
545 |
if (!page) |
dc009d924
|
546 |
return -ENOMEM; |
72414d3f1
|
547 |
|
dc009d924
|
548 549 550 |
ind_page = page_address(page); *image->entry = virt_to_phys(ind_page) | IND_INDIRECTION; image->entry = ind_page; |
72414d3f1
|
551 552 |
image->last_entry = ind_page + ((PAGE_SIZE/sizeof(kimage_entry_t)) - 1); |
dc009d924
|
553 554 555 556 |
} *image->entry = entry; image->entry++; *image->entry = 0; |
72414d3f1
|
557 |
|
dc009d924
|
558 559 |
return 0; } |
72414d3f1
|
560 561 |
static int kimage_set_destination(struct kimage *image, unsigned long destination) |
dc009d924
|
562 563 564 565 566 |
{ int result; destination &= PAGE_MASK; result = kimage_add_entry(image, destination | IND_DESTINATION); |
72414d3f1
|
567 |
if (result == 0) |
dc009d924
|
568 |
image->destination = destination; |
72414d3f1
|
569 |
|
dc009d924
|
570 571 572 573 574 575 576 577 578 579 |
return result; } static int kimage_add_page(struct kimage *image, unsigned long page) { int result; page &= PAGE_MASK; result = kimage_add_entry(image, page | IND_SOURCE); |
72414d3f1
|
580 |
if (result == 0) |
dc009d924
|
581 |
image->destination += PAGE_SIZE; |
72414d3f1
|
582 |
|
dc009d924
|
583 584 585 586 587 588 589 590 591 592 593 594 595 |
return result; } static void kimage_free_extra_pages(struct kimage *image) { /* Walk through and free any extra destination pages I may have */ kimage_free_page_list(&image->dest_pages); /* Walk through and free any unuseable pages I have cached */ kimage_free_page_list(&image->unuseable_pages); } |
7fccf0326
|
596 |
static void kimage_terminate(struct kimage *image) |
dc009d924
|
597 |
{ |
72414d3f1
|
598 |
if (*image->entry != 0) |
dc009d924
|
599 |
image->entry++; |
72414d3f1
|
600 |
|
dc009d924
|
601 |
*image->entry = IND_DONE; |
dc009d924
|
602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 |
} #define for_each_kimage_entry(image, ptr, entry) \ for (ptr = &image->head; (entry = *ptr) && !(entry & IND_DONE); \ ptr = (entry & IND_INDIRECTION)? \ phys_to_virt((entry & PAGE_MASK)): ptr +1) static void kimage_free_entry(kimage_entry_t entry) { struct page *page; page = pfn_to_page(entry >> PAGE_SHIFT); kimage_free_pages(page); } static void kimage_free(struct kimage *image) { kimage_entry_t *ptr, entry; kimage_entry_t ind = 0; if (!image) return; |
72414d3f1
|
624 |
|
dc009d924
|
625 626 627 628 |
kimage_free_extra_pages(image); for_each_kimage_entry(image, ptr, entry) { if (entry & IND_INDIRECTION) { /* Free the previous indirection page */ |
72414d3f1
|
629 |
if (ind & IND_INDIRECTION) |
dc009d924
|
630 |
kimage_free_entry(ind); |
dc009d924
|
631 632 633 634 635 |
/* Save this indirection page until we are * done with it. */ ind = entry; } |
72414d3f1
|
636 |
else if (entry & IND_SOURCE) |
dc009d924
|
637 |
kimage_free_entry(entry); |
dc009d924
|
638 639 |
} /* Free the final indirection page */ |
72414d3f1
|
640 |
if (ind & IND_INDIRECTION) |
dc009d924
|
641 |
kimage_free_entry(ind); |
dc009d924
|
642 643 644 645 646 647 648 649 |
/* Handle any machine specific cleanup */ machine_kexec_cleanup(image); /* Free the kexec control pages... */ kimage_free_page_list(&image->control_pages); kfree(image); } |
72414d3f1
|
650 651 |
static kimage_entry_t *kimage_dst_used(struct kimage *image, unsigned long page) |
dc009d924
|
652 653 654 655 656 |
{ kimage_entry_t *ptr, entry; unsigned long destination = 0; for_each_kimage_entry(image, ptr, entry) { |
72414d3f1
|
657 |
if (entry & IND_DESTINATION) |
dc009d924
|
658 |
destination = entry & PAGE_MASK; |
dc009d924
|
659 |
else if (entry & IND_SOURCE) { |
72414d3f1
|
660 |
if (page == destination) |
dc009d924
|
661 |
return ptr; |
dc009d924
|
662 663 664 |
destination += PAGE_SIZE; } } |
72414d3f1
|
665 |
|
314b6a4d8
|
666 |
return NULL; |
dc009d924
|
667 |
} |
72414d3f1
|
668 |
static struct page *kimage_alloc_page(struct kimage *image, |
9796fdd82
|
669 |
gfp_t gfp_mask, |
72414d3f1
|
670 |
unsigned long destination) |
dc009d924
|
671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 |
{ /* * Here we implement safeguards to ensure that a source page * is not copied to its destination page before the data on * the destination page is no longer useful. * * To do this we maintain the invariant that a source page is * either its own destination page, or it is not a * destination page at all. * * That is slightly stronger than required, but the proof * that no problems will not occur is trivial, and the * implementation is simply to verify. * * When allocating all pages normally this algorithm will run * in O(N) time, but in the worst case it will run in O(N^2) * time. If the runtime is a problem the data structures can * be fixed. */ struct page *page; unsigned long addr; /* * Walk through the list of destination pages, and see if I * have a match. */ list_for_each_entry(page, &image->dest_pages, lru) { addr = page_to_pfn(page) << PAGE_SHIFT; if (addr == destination) { list_del(&page->lru); return page; } } page = NULL; while (1) { kimage_entry_t *old; /* Allocate a page, if we run out of memory give up */ page = kimage_alloc_pages(gfp_mask, 0); |
72414d3f1
|
710 |
if (!page) |
314b6a4d8
|
711 |
return NULL; |
dc009d924
|
712 |
/* If the page cannot be used file it away */ |
72414d3f1
|
713 714 |
if (page_to_pfn(page) > (KEXEC_SOURCE_MEMORY_LIMIT >> PAGE_SHIFT)) { |
dc009d924
|
715 716 717 718 719 720 721 722 723 724 |
list_add(&page->lru, &image->unuseable_pages); continue; } addr = page_to_pfn(page) << PAGE_SHIFT; /* If it is the destination page we want use it */ if (addr == destination) break; /* If the page is not a destination page use it */ |
72414d3f1
|
725 726 |
if (!kimage_is_destination_range(image, addr, addr + PAGE_SIZE)) |
dc009d924
|
727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 |
break; /* * I know that the page is someones destination page. * See if there is already a source page for this * destination page. And if so swap the source pages. */ old = kimage_dst_used(image, addr); if (old) { /* If so move it */ unsigned long old_addr; struct page *old_page; old_addr = *old & PAGE_MASK; old_page = pfn_to_page(old_addr >> PAGE_SHIFT); copy_highpage(page, old_page); *old = addr | (*old & ~PAGE_MASK); /* The old page I have found cannot be a |
f9092f358
|
746 747 |
* destination page, so return it if it's * gfp_flags honor the ones passed in. |
dc009d924
|
748 |
*/ |
f9092f358
|
749 750 751 752 753 |
if (!(gfp_mask & __GFP_HIGHMEM) && PageHighMem(old_page)) { kimage_free_pages(old_page); continue; } |
dc009d924
|
754 755 756 757 758 759 760 761 762 763 764 |
addr = old_addr; page = old_page; break; } else { /* Place the page on the destination list I * will use it later. */ list_add(&page->lru, &image->dest_pages); } } |
72414d3f1
|
765 |
|
dc009d924
|
766 767 768 769 |
return page; } static int kimage_load_normal_segment(struct kimage *image, |
72414d3f1
|
770 |
struct kexec_segment *segment) |
dc009d924
|
771 772 773 774 |
{ unsigned long maddr; unsigned long ubytes, mbytes; int result; |
314b6a4d8
|
775 |
unsigned char __user *buf; |
dc009d924
|
776 777 778 779 780 781 782 783 |
result = 0; buf = segment->buf; ubytes = segment->bufsz; mbytes = segment->memsz; maddr = segment->mem; result = kimage_set_destination(image, maddr); |
72414d3f1
|
784 |
if (result < 0) |
dc009d924
|
785 |
goto out; |
72414d3f1
|
786 787 |
while (mbytes) { |
dc009d924
|
788 789 790 |
struct page *page; char *ptr; size_t uchunk, mchunk; |
72414d3f1
|
791 |
|
dc009d924
|
792 |
page = kimage_alloc_page(image, GFP_HIGHUSER, maddr); |
c80544dc0
|
793 |
if (!page) { |
dc009d924
|
794 795 796 |
result = -ENOMEM; goto out; } |
72414d3f1
|
797 798 799 |
result = kimage_add_page(image, page_to_pfn(page) << PAGE_SHIFT); if (result < 0) |
dc009d924
|
800 |
goto out; |
72414d3f1
|
801 |
|
dc009d924
|
802 803 |
ptr = kmap(page); /* Start with a clear page */ |
3ecb01df3
|
804 |
clear_page(ptr); |
dc009d924
|
805 806 |
ptr += maddr & ~PAGE_MASK; mchunk = PAGE_SIZE - (maddr & ~PAGE_MASK); |
72414d3f1
|
807 |
if (mchunk > mbytes) |
dc009d924
|
808 |
mchunk = mbytes; |
72414d3f1
|
809 |
|
dc009d924
|
810 |
uchunk = mchunk; |
72414d3f1
|
811 |
if (uchunk > ubytes) |
dc009d924
|
812 |
uchunk = ubytes; |
72414d3f1
|
813 |
|
dc009d924
|
814 815 816 |
result = copy_from_user(ptr, buf, uchunk); kunmap(page); if (result) { |
f65a03f6a
|
817 |
result = -EFAULT; |
dc009d924
|
818 819 820 821 822 823 824 |
goto out; } ubytes -= uchunk; maddr += mchunk; buf += mchunk; mbytes -= mchunk; } |
72414d3f1
|
825 |
out: |
dc009d924
|
826 827 828 829 |
return result; } static int kimage_load_crash_segment(struct kimage *image, |
72414d3f1
|
830 |
struct kexec_segment *segment) |
dc009d924
|
831 832 833 834 835 836 837 838 |
{ /* For crash dumps kernels we simply copy the data from * user space to it's destination. * We do things a page at a time for the sake of kmap. */ unsigned long maddr; unsigned long ubytes, mbytes; int result; |
314b6a4d8
|
839 |
unsigned char __user *buf; |
dc009d924
|
840 841 842 843 844 845 |
result = 0; buf = segment->buf; ubytes = segment->bufsz; mbytes = segment->memsz; maddr = segment->mem; |
72414d3f1
|
846 |
while (mbytes) { |
dc009d924
|
847 848 849 |
struct page *page; char *ptr; size_t uchunk, mchunk; |
72414d3f1
|
850 |
|
dc009d924
|
851 |
page = pfn_to_page(maddr >> PAGE_SHIFT); |
c80544dc0
|
852 |
if (!page) { |
dc009d924
|
853 854 855 856 857 858 |
result = -ENOMEM; goto out; } ptr = kmap(page); ptr += maddr & ~PAGE_MASK; mchunk = PAGE_SIZE - (maddr & ~PAGE_MASK); |
72414d3f1
|
859 |
if (mchunk > mbytes) |
dc009d924
|
860 |
mchunk = mbytes; |
72414d3f1
|
861 |
|
dc009d924
|
862 863 864 865 866 867 868 |
uchunk = mchunk; if (uchunk > ubytes) { uchunk = ubytes; /* Zero the trailing part of the page */ memset(ptr + uchunk, 0, mchunk - uchunk); } result = copy_from_user(ptr, buf, uchunk); |
a79561134
|
869 |
kexec_flush_icache_page(page); |
dc009d924
|
870 871 |
kunmap(page); if (result) { |
f65a03f6a
|
872 |
result = -EFAULT; |
dc009d924
|
873 874 875 876 877 878 879 |
goto out; } ubytes -= uchunk; maddr += mchunk; buf += mchunk; mbytes -= mchunk; } |
72414d3f1
|
880 |
out: |
dc009d924
|
881 882 883 884 |
return result; } static int kimage_load_segment(struct kimage *image, |
72414d3f1
|
885 |
struct kexec_segment *segment) |
dc009d924
|
886 887 |
{ int result = -ENOMEM; |
72414d3f1
|
888 889 |
switch (image->type) { |
dc009d924
|
890 891 892 893 894 895 896 |
case KEXEC_TYPE_DEFAULT: result = kimage_load_normal_segment(image, segment); break; case KEXEC_TYPE_CRASH: result = kimage_load_crash_segment(image, segment); break; } |
72414d3f1
|
897 |
|
dc009d924
|
898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 |
return result; } /* * Exec Kernel system call: for obvious reasons only root may call it. * * This call breaks up into three pieces. * - A generic part which loads the new kernel from the current * address space, and very carefully places the data in the * allocated pages. * * - A generic part that interacts with the kernel and tells all of * the devices to shut down. Preventing on-going dmas, and placing * the devices in a consistent state so a later kernel can * reinitialize them. * * - A machine specific part that includes the syscall number * and the copies the image to it's final destination. And * jumps into the image at entry. * * kexec does not sync, or unmount filesystems so if you need * that to happen you need to do that yourself. */ |
c330dda90
|
921 922 |
struct kimage *kexec_image; struct kimage *kexec_crash_image; |
8c5a1cf0a
|
923 924 |
static DEFINE_MUTEX(kexec_mutex); |
dc009d924
|
925 |
|
754fe8d29
|
926 927 |
SYSCALL_DEFINE4(kexec_load, unsigned long, entry, unsigned long, nr_segments, struct kexec_segment __user *, segments, unsigned long, flags) |
dc009d924
|
928 929 |
{ struct kimage **dest_image, *image; |
dc009d924
|
930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 |
int result; /* We only trust the superuser with rebooting the system. */ if (!capable(CAP_SYS_BOOT)) return -EPERM; /* * Verify we have a legal set of flags * This leaves us room for future extensions. */ if ((flags & KEXEC_FLAGS) != (flags & ~KEXEC_ARCH_MASK)) return -EINVAL; /* Verify we are on the appropriate architecture */ if (((flags & KEXEC_ARCH_MASK) != KEXEC_ARCH) && ((flags & KEXEC_ARCH_MASK) != KEXEC_ARCH_DEFAULT)) |
dc009d924
|
946 |
return -EINVAL; |
dc009d924
|
947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 |
/* Put an artificial cap on the number * of segments passed to kexec_load. */ if (nr_segments > KEXEC_SEGMENT_MAX) return -EINVAL; image = NULL; result = 0; /* Because we write directly to the reserved memory * region when loading crash kernels we need a mutex here to * prevent multiple crash kernels from attempting to load * simultaneously, and to prevent a crash kernel from loading * over the top of a in use crash kernel. * * KISS: always take the mutex. */ |
8c5a1cf0a
|
965 |
if (!mutex_trylock(&kexec_mutex)) |
dc009d924
|
966 |
return -EBUSY; |
72414d3f1
|
967 |
|
dc009d924
|
968 |
dest_image = &kexec_image; |
72414d3f1
|
969 |
if (flags & KEXEC_ON_CRASH) |
dc009d924
|
970 |
dest_image = &kexec_crash_image; |
dc009d924
|
971 972 |
if (nr_segments > 0) { unsigned long i; |
72414d3f1
|
973 |
|
dc009d924
|
974 |
/* Loading another kernel to reboot into */ |
72414d3f1
|
975 976 977 |
if ((flags & KEXEC_ON_CRASH) == 0) result = kimage_normal_alloc(&image, entry, nr_segments, segments); |
dc009d924
|
978 979 980 981 982 983 |
/* Loading another kernel to switch to if this one crashes */ else if (flags & KEXEC_ON_CRASH) { /* Free any current crash dump kernel before * we corrupt it. */ kimage_free(xchg(&kexec_crash_image, NULL)); |
72414d3f1
|
984 985 |
result = kimage_crash_alloc(&image, entry, nr_segments, segments); |
dc009d924
|
986 |
} |
72414d3f1
|
987 |
if (result) |
dc009d924
|
988 |
goto out; |
72414d3f1
|
989 |
|
3ab835213
|
990 991 |
if (flags & KEXEC_PRESERVE_CONTEXT) image->preserve_context = 1; |
dc009d924
|
992 |
result = machine_kexec_prepare(image); |
72414d3f1
|
993 |
if (result) |
dc009d924
|
994 |
goto out; |
72414d3f1
|
995 996 |
for (i = 0; i < nr_segments; i++) { |
dc009d924
|
997 |
result = kimage_load_segment(image, &image->segment[i]); |
72414d3f1
|
998 |
if (result) |
dc009d924
|
999 |
goto out; |
dc009d924
|
1000 |
} |
7fccf0326
|
1001 |
kimage_terminate(image); |
dc009d924
|
1002 1003 1004 |
} /* Install the new kernel, and Uninstall the old */ image = xchg(dest_image, image); |
72414d3f1
|
1005 |
out: |
8c5a1cf0a
|
1006 |
mutex_unlock(&kexec_mutex); |
dc009d924
|
1007 |
kimage_free(image); |
72414d3f1
|
1008 |
|
dc009d924
|
1009 1010 1011 1012 1013 |
return result; } #ifdef CONFIG_COMPAT asmlinkage long compat_sys_kexec_load(unsigned long entry, |
72414d3f1
|
1014 1015 1016 |
unsigned long nr_segments, struct compat_kexec_segment __user *segments, unsigned long flags) |
dc009d924
|
1017 1018 1019 1020 1021 1022 1023 1024 |
{ struct compat_kexec_segment in; struct kexec_segment out, __user *ksegments; unsigned long i, result; /* Don't allow clients that don't understand the native * architecture to do anything. */ |
72414d3f1
|
1025 |
if ((flags & KEXEC_ARCH_MASK) == KEXEC_ARCH_DEFAULT) |
dc009d924
|
1026 |
return -EINVAL; |
dc009d924
|
1027 |
|
72414d3f1
|
1028 |
if (nr_segments > KEXEC_SEGMENT_MAX) |
dc009d924
|
1029 |
return -EINVAL; |
dc009d924
|
1030 1031 1032 1033 |
ksegments = compat_alloc_user_space(nr_segments * sizeof(out)); for (i=0; i < nr_segments; i++) { result = copy_from_user(&in, &segments[i], sizeof(in)); |
72414d3f1
|
1034 |
if (result) |
dc009d924
|
1035 |
return -EFAULT; |
dc009d924
|
1036 1037 1038 1039 1040 1041 1042 |
out.buf = compat_ptr(in.buf); out.bufsz = in.bufsz; out.mem = in.mem; out.memsz = in.memsz; result = copy_to_user(&ksegments[i], &out, sizeof(out)); |
72414d3f1
|
1043 |
if (result) |
dc009d924
|
1044 |
return -EFAULT; |
dc009d924
|
1045 1046 1047 1048 1049 |
} return sys_kexec_load(entry, nr_segments, ksegments, flags); } #endif |
6e274d144
|
1050 |
void crash_kexec(struct pt_regs *regs) |
dc009d924
|
1051 |
{ |
8c5a1cf0a
|
1052 |
/* Take the kexec_mutex here to prevent sys_kexec_load |
dc009d924
|
1053 1054 1055 1056 1057 1058 1059 |
* running on one cpu from replacing the crash kernel * we are using after a panic on a different cpu. * * If the crash kernel was not located in a fixed area * of memory the xchg(&kexec_crash_image) would be * sufficient. But since I reuse the memory... */ |
8c5a1cf0a
|
1060 |
if (mutex_trylock(&kexec_mutex)) { |
c0ce7d088
|
1061 |
if (kexec_crash_image) { |
e996e5813
|
1062 |
struct pt_regs fixed_regs; |
0f4bd46ec
|
1063 1064 |
kmsg_dump(KMSG_DUMP_KEXEC); |
e996e5813
|
1065 |
crash_setup_regs(&fixed_regs, regs); |
fd59d231f
|
1066 |
crash_save_vmcoreinfo(); |
e996e5813
|
1067 |
machine_crash_shutdown(&fixed_regs); |
c0ce7d088
|
1068 |
machine_kexec(kexec_crash_image); |
dc009d924
|
1069 |
} |
8c5a1cf0a
|
1070 |
mutex_unlock(&kexec_mutex); |
dc009d924
|
1071 1072 |
} } |
cc5716587
|
1073 |
|
06a7f7112
|
1074 1075 |
size_t crash_get_memory_size(void) { |
e05bd3367
|
1076 |
size_t size = 0; |
06a7f7112
|
1077 |
mutex_lock(&kexec_mutex); |
e05bd3367
|
1078 1079 |
if (crashk_res.end != crashk_res.start) size = crashk_res.end - crashk_res.start + 1; |
06a7f7112
|
1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 |
mutex_unlock(&kexec_mutex); return size; } static void free_reserved_phys_range(unsigned long begin, unsigned long end) { unsigned long addr; for (addr = begin; addr < end; addr += PAGE_SIZE) { ClearPageReserved(pfn_to_page(addr >> PAGE_SHIFT)); init_page_count(pfn_to_page(addr >> PAGE_SHIFT)); free_page((unsigned long)__va(addr)); totalram_pages++; } } int crash_shrink_memory(unsigned long new_size) { int ret = 0; unsigned long start, end; mutex_lock(&kexec_mutex); if (kexec_crash_image) { ret = -ENOENT; goto unlock; } start = crashk_res.start; end = crashk_res.end; if (new_size >= end - start + 1) { ret = -EINVAL; if (new_size == end - start + 1) ret = 0; goto unlock; } start = roundup(start, PAGE_SIZE); end = roundup(start + new_size, PAGE_SIZE); free_reserved_phys_range(end, crashk_res.end); |
e05bd3367
|
1121 |
if ((start == end) && (crashk_res.parent != NULL)) |
06a7f7112
|
1122 |
release_resource(&crashk_res); |
475f9aa6a
|
1123 |
crashk_res.end = end - 1; |
06a7f7112
|
1124 1125 1126 1127 1128 |
unlock: mutex_unlock(&kexec_mutex); return ret; } |
85916f816
|
1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 |
static u32 *append_elf_note(u32 *buf, char *name, unsigned type, void *data, size_t data_len) { struct elf_note note; note.n_namesz = strlen(name) + 1; note.n_descsz = data_len; note.n_type = type; memcpy(buf, ¬e, sizeof(note)); buf += (sizeof(note) + 3)/4; memcpy(buf, name, note.n_namesz); buf += (note.n_namesz + 3)/4; memcpy(buf, data, note.n_descsz); buf += (note.n_descsz + 3)/4; return buf; } static void final_note(u32 *buf) { struct elf_note note; note.n_namesz = 0; note.n_descsz = 0; note.n_type = 0; memcpy(buf, ¬e, sizeof(note)); } void crash_save_cpu(struct pt_regs *regs, int cpu) { struct elf_prstatus prstatus; u32 *buf; |
4f4b6c1a9
|
1161 |
if ((cpu < 0) || (cpu >= nr_cpu_ids)) |
85916f816
|
1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 |
return; /* Using ELF notes here is opportunistic. * I need a well defined structure format * for the data I pass, and I need tags * on the data to indicate what information I have * squirrelled away. ELF notes happen to provide * all of that, so there is no need to invent something new. */ buf = (u32*)per_cpu_ptr(crash_notes, cpu); if (!buf) return; memset(&prstatus, 0, sizeof(prstatus)); prstatus.pr_pid = current->pid; |
6cd61c0ba
|
1176 |
elf_core_copy_kernel_regs(&prstatus.pr_reg, regs); |
6672f76a5
|
1177 1178 |
buf = append_elf_note(buf, KEXEC_CORE_NOTE_NAME, NT_PRSTATUS, &prstatus, sizeof(prstatus)); |
85916f816
|
1179 1180 |
final_note(buf); } |
cc5716587
|
1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 |
static int __init crash_notes_memory_init(void) { /* Allocate memory for saving cpu registers. */ crash_notes = alloc_percpu(note_buf_t); if (!crash_notes) { printk("Kexec: Memory allocation for saving cpu register" " states failed "); return -ENOMEM; } return 0; } module_init(crash_notes_memory_init) |
fd59d231f
|
1194 |
|
cba63c308
|
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 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 |
/* * parsing the "crashkernel" commandline * * this code is intended to be called from architecture specific code */ /* * This function parses command lines in the format * * crashkernel=ramsize-range:size[,...][@offset] * * The function returns 0 on success and -EINVAL on failure. */ static int __init parse_crashkernel_mem(char *cmdline, unsigned long long system_ram, unsigned long long *crash_size, unsigned long long *crash_base) { char *cur = cmdline, *tmp; /* for each entry of the comma-separated list */ do { unsigned long long start, end = ULLONG_MAX, size; /* get the start of the range */ start = memparse(cur, &tmp); if (cur == tmp) { pr_warning("crashkernel: Memory value expected "); return -EINVAL; } cur = tmp; if (*cur != '-') { pr_warning("crashkernel: '-' expected "); return -EINVAL; } cur++; /* if no ':' is here, than we read the end */ if (*cur != ':') { end = memparse(cur, &tmp); if (cur == tmp) { pr_warning("crashkernel: Memory " "value expected "); return -EINVAL; } cur = tmp; if (end <= start) { pr_warning("crashkernel: end <= start "); return -EINVAL; } } if (*cur != ':') { pr_warning("crashkernel: ':' expected "); return -EINVAL; } cur++; size = memparse(cur, &tmp); if (cur == tmp) { pr_warning("Memory value expected "); return -EINVAL; } cur = tmp; if (size >= system_ram) { pr_warning("crashkernel: invalid size "); return -EINVAL; } /* match ? */ |
be089d79c
|
1274 |
if (system_ram >= start && system_ram < end) { |
cba63c308
|
1275 1276 1277 1278 1279 1280 |
*crash_size = size; break; } } while (*cur++ == ','); if (*crash_size > 0) { |
11c7da4b0
|
1281 |
while (*cur && *cur != ' ' && *cur != '@') |
cba63c308
|
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 |
cur++; if (*cur == '@') { cur++; *crash_base = memparse(cur, &tmp); if (cur == tmp) { pr_warning("Memory value expected " "after '@' "); return -EINVAL; } } } return 0; } /* * That function parses "simple" (old) crashkernel command lines like * * crashkernel=size[@offset] * * It returns 0 on success and -EINVAL on failure. */ static int __init parse_crashkernel_simple(char *cmdline, unsigned long long *crash_size, unsigned long long *crash_base) { char *cur = cmdline; *crash_size = memparse(cmdline, &cur); if (cmdline == cur) { pr_warning("crashkernel: memory value expected "); return -EINVAL; } if (*cur == '@') *crash_base = memparse(cur+1, &cur); return 0; } /* * That function is the entry point for command line parsing and should be * called from the arch-specific code. */ int __init parse_crashkernel(char *cmdline, unsigned long long system_ram, unsigned long long *crash_size, unsigned long long *crash_base) { char *p = cmdline, *ck_cmdline = NULL; char *first_colon, *first_space; BUG_ON(!crash_size || !crash_base); *crash_size = 0; *crash_base = 0; /* find crashkernel and use the last one if there are more */ p = strstr(p, "crashkernel="); while (p) { ck_cmdline = p; p = strstr(p+1, "crashkernel="); } if (!ck_cmdline) return -EINVAL; ck_cmdline += 12; /* strlen("crashkernel=") */ /* * if the commandline contains a ':', then that's the extended * syntax -- if not, it must be the classic syntax */ first_colon = strchr(ck_cmdline, ':'); first_space = strchr(ck_cmdline, ' '); if (first_colon && (!first_space || first_colon < first_space)) return parse_crashkernel_mem(ck_cmdline, system_ram, crash_size, crash_base); else return parse_crashkernel_simple(ck_cmdline, crash_size, crash_base); return 0; } |
fd59d231f
|
1367 1368 1369 1370 1371 1372 |
void crash_save_vmcoreinfo(void) { u32 *buf; if (!vmcoreinfo_size) return; |
d768281e9
|
1373 |
vmcoreinfo_append_str("CRASHTIME=%ld", get_seconds()); |
fd59d231f
|
1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 |
buf = (u32 *)vmcoreinfo_note; buf = append_elf_note(buf, VMCOREINFO_NOTE_NAME, 0, vmcoreinfo_data, vmcoreinfo_size); final_note(buf); } void vmcoreinfo_append_str(const char *fmt, ...) { va_list args; char buf[0x50]; int r; va_start(args, fmt); r = vsnprintf(buf, sizeof(buf), fmt, args); va_end(args); if (r + vmcoreinfo_size > vmcoreinfo_max_size) r = vmcoreinfo_max_size - vmcoreinfo_size; memcpy(&vmcoreinfo_data[vmcoreinfo_size], buf, r); vmcoreinfo_size += r; } /* * provide an empty default implementation here -- architecture * code may override this */ void __attribute__ ((weak)) arch_crash_save_vmcoreinfo(void) {} unsigned long __attribute__ ((weak)) paddr_vmcoreinfo_note(void) { return __pa((unsigned long)(char *)&vmcoreinfo_note); } static int __init crash_save_vmcoreinfo_init(void) { |
bba1f603b
|
1415 1416 |
VMCOREINFO_OSRELEASE(init_uts_ns.name.release); VMCOREINFO_PAGESIZE(PAGE_SIZE); |
fd59d231f
|
1417 |
|
bcbba6c10
|
1418 1419 1420 1421 |
VMCOREINFO_SYMBOL(init_uts_ns); VMCOREINFO_SYMBOL(node_online_map); VMCOREINFO_SYMBOL(swapper_pg_dir); VMCOREINFO_SYMBOL(_stext); |
acd99dbf5
|
1422 |
VMCOREINFO_SYMBOL(vmlist); |
fd59d231f
|
1423 1424 |
#ifndef CONFIG_NEED_MULTIPLE_NODES |
bcbba6c10
|
1425 1426 |
VMCOREINFO_SYMBOL(mem_map); VMCOREINFO_SYMBOL(contig_page_data); |
fd59d231f
|
1427 1428 |
#endif #ifdef CONFIG_SPARSEMEM |
bcbba6c10
|
1429 1430 |
VMCOREINFO_SYMBOL(mem_section); VMCOREINFO_LENGTH(mem_section, NR_SECTION_ROOTS); |
c76f860c4
|
1431 |
VMCOREINFO_STRUCT_SIZE(mem_section); |
bcbba6c10
|
1432 |
VMCOREINFO_OFFSET(mem_section, section_mem_map); |
fd59d231f
|
1433 |
#endif |
c76f860c4
|
1434 1435 1436 1437 1438 1439 |
VMCOREINFO_STRUCT_SIZE(page); VMCOREINFO_STRUCT_SIZE(pglist_data); VMCOREINFO_STRUCT_SIZE(zone); VMCOREINFO_STRUCT_SIZE(free_area); VMCOREINFO_STRUCT_SIZE(list_head); VMCOREINFO_SIZE(nodemask_t); |
bcbba6c10
|
1440 1441 1442 1443 1444 1445 |
VMCOREINFO_OFFSET(page, flags); VMCOREINFO_OFFSET(page, _count); VMCOREINFO_OFFSET(page, mapping); VMCOREINFO_OFFSET(page, lru); VMCOREINFO_OFFSET(pglist_data, node_zones); VMCOREINFO_OFFSET(pglist_data, nr_zones); |
fd59d231f
|
1446 |
#ifdef CONFIG_FLAT_NODE_MEM_MAP |
bcbba6c10
|
1447 |
VMCOREINFO_OFFSET(pglist_data, node_mem_map); |
fd59d231f
|
1448 |
#endif |
bcbba6c10
|
1449 1450 1451 1452 1453 1454 1455 1456 1457 |
VMCOREINFO_OFFSET(pglist_data, node_start_pfn); VMCOREINFO_OFFSET(pglist_data, node_spanned_pages); VMCOREINFO_OFFSET(pglist_data, node_id); VMCOREINFO_OFFSET(zone, free_area); VMCOREINFO_OFFSET(zone, vm_stat); VMCOREINFO_OFFSET(zone, spanned_pages); VMCOREINFO_OFFSET(free_area, free_list); VMCOREINFO_OFFSET(list_head, next); VMCOREINFO_OFFSET(list_head, prev); |
acd99dbf5
|
1458 |
VMCOREINFO_OFFSET(vm_struct, addr); |
bcbba6c10
|
1459 |
VMCOREINFO_LENGTH(zone.free_area, MAX_ORDER); |
04d491ab2
|
1460 |
log_buf_kexec_setup(); |
83a08e7c6
|
1461 |
VMCOREINFO_LENGTH(free_area.free_list, MIGRATE_TYPES); |
bcbba6c10
|
1462 |
VMCOREINFO_NUMBER(NR_FREE_PAGES); |
122c7a590
|
1463 1464 1465 |
VMCOREINFO_NUMBER(PG_lru); VMCOREINFO_NUMBER(PG_private); VMCOREINFO_NUMBER(PG_swapcache); |
fd59d231f
|
1466 1467 1468 1469 1470 1471 1472 |
arch_crash_save_vmcoreinfo(); return 0; } module_init(crash_save_vmcoreinfo_init) |
3ab835213
|
1473 |
|
7ade3fcc1
|
1474 1475 1476 |
/* * Move into place and start executing a preloaded standalone * executable. If nothing was preloaded return an error. |
3ab835213
|
1477 1478 1479 1480 |
*/ int kernel_kexec(void) { int error = 0; |
8c5a1cf0a
|
1481 |
if (!mutex_trylock(&kexec_mutex)) |
3ab835213
|
1482 1483 1484 1485 1486 |
return -EBUSY; if (!kexec_image) { error = -EINVAL; goto Unlock; } |
3ab835213
|
1487 |
#ifdef CONFIG_KEXEC_JUMP |
7ade3fcc1
|
1488 |
if (kexec_image->preserve_context) { |
89081d17f
|
1489 1490 1491 1492 1493 1494 1495 1496 |
mutex_lock(&pm_mutex); pm_prepare_console(); error = freeze_processes(); if (error) { error = -EBUSY; goto Restore_console; } suspend_console(); |
d16163029
|
1497 |
error = dpm_suspend_start(PMSG_FREEZE); |
89081d17f
|
1498 1499 |
if (error) goto Resume_console; |
d16163029
|
1500 1501 1502 |
/* At this point, dpm_suspend_start() has been called, * but *not* dpm_suspend_noirq(). We *must* call * dpm_suspend_noirq() now. Otherwise, drivers for |
89081d17f
|
1503 1504 1505 1506 |
* some devices (e.g. interrupt controllers) become * desynchronized with the actual state of the * hardware at resume time, and evil weirdness ensues. */ |
d16163029
|
1507 |
error = dpm_suspend_noirq(PMSG_FREEZE); |
89081d17f
|
1508 |
if (error) |
749b0afc3
|
1509 1510 1511 1512 |
goto Resume_devices; error = disable_nonboot_cpus(); if (error) goto Enable_cpus; |
2ed8d2b3a
|
1513 |
local_irq_disable(); |
770824bdc
|
1514 1515 1516 |
/* Suspend system devices */ error = sysdev_suspend(PMSG_FREEZE); if (error) |
749b0afc3
|
1517 |
goto Enable_irqs; |
7ade3fcc1
|
1518 |
} else |
3ab835213
|
1519 |
#endif |
7ade3fcc1
|
1520 |
{ |
ca195b7f6
|
1521 |
kernel_restart_prepare(NULL); |
3ab835213
|
1522 1523 1524 1525 1526 1527 |
printk(KERN_EMERG "Starting new kernel "); machine_shutdown(); } machine_kexec(kexec_image); |
3ab835213
|
1528 |
#ifdef CONFIG_KEXEC_JUMP |
7ade3fcc1
|
1529 |
if (kexec_image->preserve_context) { |
770824bdc
|
1530 |
sysdev_resume(); |
749b0afc3
|
1531 |
Enable_irqs: |
3ab835213
|
1532 |
local_irq_enable(); |
749b0afc3
|
1533 |
Enable_cpus: |
89081d17f
|
1534 |
enable_nonboot_cpus(); |
d16163029
|
1535 |
dpm_resume_noirq(PMSG_RESTORE); |
89081d17f
|
1536 |
Resume_devices: |
d16163029
|
1537 |
dpm_resume_end(PMSG_RESTORE); |
89081d17f
|
1538 1539 1540 1541 1542 1543 |
Resume_console: resume_console(); thaw_processes(); Restore_console: pm_restore_console(); mutex_unlock(&pm_mutex); |
3ab835213
|
1544 |
} |
7ade3fcc1
|
1545 |
#endif |
3ab835213
|
1546 1547 |
Unlock: |
8c5a1cf0a
|
1548 |
mutex_unlock(&kexec_mutex); |
3ab835213
|
1549 1550 |
return error; } |