Blame view
kernel/kexec.c
27.5 KB
dc009d924 [PATCH] kexec: ad... |
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 [PATCH] move capa... |
8 |
#include <linux/capability.h> |
dc009d924 [PATCH] kexec: ad... |
9 10 11 12 13 14 15 16 17 18 19 20 |
#include <linux/mm.h> #include <linux/file.h> #include <linux/slab.h> #include <linux/fs.h> #include <linux/kexec.h> #include <linux/spinlock.h> #include <linux/list.h> #include <linux/highmem.h> #include <linux/syscalls.h> #include <linux/reboot.h> #include <linux/syscalls.h> #include <linux/ioport.h> |
6e274d144 [PATCH] kdump: Us... |
21 |
#include <linux/hardirq.h> |
dc009d924 [PATCH] kexec: ad... |
22 23 24 25 26 |
#include <asm/page.h> #include <asm/uaccess.h> #include <asm/io.h> #include <asm/system.h> #include <asm/semaphore.h> |
cc5716587 [PATCH] kdump: dy... |
27 28 |
/* Per cpu memory for storing cpu states in case of system crash. */ note_buf_t* crash_notes; |
dc009d924 [PATCH] kexec: ad... |
29 30 31 32 33 34 35 |
/* 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 [PATCH] kdump: Us... |
36 37 38 39 40 41 |
int kexec_should_crash(struct task_struct *p) { if (in_interrupt() || !p->pid || p->pid == 1 || panic_on_oops) return 1; return 0; } |
dc009d924 [PATCH] kexec: ad... |
42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 |
/* * 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 * is given by KEXEC_CONTROL_CODE_SIZE. In the best case only a single * 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 [PATCH] kexec cod... |
87 88 89 |
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 [PATCH] gfp_t: ke... |
90 |
gfp_t gfp_mask, |
72414d3f1 [PATCH] kexec cod... |
91 |
unsigned long dest); |
dc009d924 [PATCH] kexec: ad... |
92 93 |
static int do_kimage_alloc(struct kimage **rimage, unsigned long entry, |
72414d3f1 [PATCH] kexec cod... |
94 95 |
unsigned long nr_segments, struct kexec_segment __user *segments) |
dc009d924 [PATCH] kexec: ad... |
96 97 98 99 100 101 102 103 104 |
{ size_t segment_bytes; struct kimage *image; unsigned long i; int result; /* Allocate a controlling structure */ result = -ENOMEM; image = kmalloc(sizeof(*image), GFP_KERNEL); |
72414d3f1 [PATCH] kexec cod... |
105 |
if (!image) |
dc009d924 [PATCH] kexec: ad... |
106 |
goto out; |
72414d3f1 [PATCH] kexec cod... |
107 |
|
dc009d924 [PATCH] kexec: ad... |
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 |
memset(image, 0, sizeof(*image)); 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); if (result) goto out; /* * 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 * the destination addreses are page aligned. Too many * 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 [PATCH] kexec cod... |
148 |
|
dc009d924 [PATCH] kexec: ad... |
149 150 151 152 153 154 155 156 157 158 159 160 161 162 |
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 [PATCH] kexec cod... |
163 |
for (i = 0; i < nr_segments; i++) { |
dc009d924 [PATCH] kexec: ad... |
164 165 |
unsigned long mstart, mend; unsigned long j; |
72414d3f1 [PATCH] kexec cod... |
166 |
|
dc009d924 [PATCH] kexec: ad... |
167 168 |
mstart = image->segment[i].mem; mend = mstart + image->segment[i].memsz; |
72414d3f1 [PATCH] kexec cod... |
169 |
for (j = 0; j < i; j++) { |
dc009d924 [PATCH] kexec: ad... |
170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 |
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 [PATCH] kexec cod... |
185 |
for (i = 0; i < nr_segments; i++) { |
dc009d924 [PATCH] kexec: ad... |
186 187 188 |
if (image->segment[i].bufsz > image->segment[i].memsz) goto out; } |
dc009d924 [PATCH] kexec: ad... |
189 |
result = 0; |
72414d3f1 [PATCH] kexec cod... |
190 191 |
out: if (result == 0) |
dc009d924 [PATCH] kexec: ad... |
192 |
*rimage = image; |
72414d3f1 [PATCH] kexec cod... |
193 |
else |
dc009d924 [PATCH] kexec: ad... |
194 |
kfree(image); |
72414d3f1 [PATCH] kexec cod... |
195 |
|
dc009d924 [PATCH] kexec: ad... |
196 197 198 199 200 |
return result; } static int kimage_normal_alloc(struct kimage **rimage, unsigned long entry, |
72414d3f1 [PATCH] kexec cod... |
201 202 |
unsigned long nr_segments, struct kexec_segment __user *segments) |
dc009d924 [PATCH] kexec: ad... |
203 204 205 206 207 208 209 |
{ int result; struct kimage *image; /* Allocate and initialize a controlling structure */ image = NULL; result = do_kimage_alloc(&image, entry, nr_segments, segments); |
72414d3f1 [PATCH] kexec cod... |
210 |
if (result) |
dc009d924 [PATCH] kexec: ad... |
211 |
goto out; |
72414d3f1 [PATCH] kexec cod... |
212 |
|
dc009d924 [PATCH] kexec: ad... |
213 214 215 216 217 218 219 220 221 |
*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, |
72414d3f1 [PATCH] kexec cod... |
222 |
get_order(KEXEC_CONTROL_CODE_SIZE)); |
dc009d924 [PATCH] kexec: ad... |
223 224 225 226 227 228 229 230 |
if (!image->control_code_page) { printk(KERN_ERR "Could not allocate control_code_buffer "); goto out; } result = 0; out: |
72414d3f1 [PATCH] kexec cod... |
231 |
if (result == 0) |
dc009d924 [PATCH] kexec: ad... |
232 |
*rimage = image; |
72414d3f1 [PATCH] kexec cod... |
233 |
else |
dc009d924 [PATCH] kexec: ad... |
234 |
kfree(image); |
72414d3f1 [PATCH] kexec cod... |
235 |
|
dc009d924 [PATCH] kexec: ad... |
236 237 238 239 |
return result; } static int kimage_crash_alloc(struct kimage **rimage, unsigned long entry, |
72414d3f1 [PATCH] kexec cod... |
240 |
unsigned long nr_segments, |
314b6a4d8 [PATCH] kexec: fi... |
241 |
struct kexec_segment __user *segments) |
dc009d924 [PATCH] kexec: ad... |
242 243 244 245 246 247 248 249 250 251 252 253 254 255 |
{ 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 [PATCH] kexec cod... |
256 |
if (result) |
dc009d924 [PATCH] kexec: ad... |
257 |
goto out; |
dc009d924 [PATCH] kexec: ad... |
258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 |
/* 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 [PATCH] kexec cod... |
277 |
|
dc009d924 [PATCH] kexec: ad... |
278 |
mstart = image->segment[i].mem; |
50cccc699 [PATCH] Kexec on ... |
279 |
mend = mstart + image->segment[i].memsz - 1; |
dc009d924 [PATCH] kexec: ad... |
280 281 282 283 |
/* Ensure we are within the crash kernel limits */ if ((mstart < crashk_res.start) || (mend > crashk_res.end)) goto out; } |
dc009d924 [PATCH] kexec: ad... |
284 285 286 287 288 289 290 |
/* * 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, |
72414d3f1 [PATCH] kexec cod... |
291 |
get_order(KEXEC_CONTROL_CODE_SIZE)); |
dc009d924 [PATCH] kexec: ad... |
292 293 294 295 296 297 298 |
if (!image->control_code_page) { printk(KERN_ERR "Could not allocate control_code_buffer "); goto out; } result = 0; |
72414d3f1 [PATCH] kexec cod... |
299 300 |
out: if (result == 0) |
dc009d924 [PATCH] kexec: ad... |
301 |
*rimage = image; |
72414d3f1 [PATCH] kexec cod... |
302 |
else |
dc009d924 [PATCH] kexec: ad... |
303 |
kfree(image); |
72414d3f1 [PATCH] kexec cod... |
304 |
|
dc009d924 [PATCH] kexec: ad... |
305 306 |
return result; } |
72414d3f1 [PATCH] kexec cod... |
307 308 309 |
static int kimage_is_destination_range(struct kimage *image, unsigned long start, unsigned long end) |
dc009d924 [PATCH] kexec: ad... |
310 311 312 313 314 |
{ unsigned long i; for (i = 0; i < image->nr_segments; i++) { unsigned long mstart, mend; |
72414d3f1 [PATCH] kexec cod... |
315 |
|
dc009d924 [PATCH] kexec: ad... |
316 |
mstart = image->segment[i].mem; |
72414d3f1 [PATCH] kexec cod... |
317 318 |
mend = mstart + image->segment[i].memsz; if ((end > mstart) && (start < mend)) |
dc009d924 [PATCH] kexec: ad... |
319 |
return 1; |
dc009d924 [PATCH] kexec: ad... |
320 |
} |
72414d3f1 [PATCH] kexec cod... |
321 |
|
dc009d924 [PATCH] kexec: ad... |
322 323 |
return 0; } |
9796fdd82 [PATCH] gfp_t: ke... |
324 |
static struct page *kimage_alloc_pages(gfp_t gfp_mask, unsigned int order) |
dc009d924 [PATCH] kexec: ad... |
325 326 |
{ struct page *pages; |
72414d3f1 [PATCH] kexec cod... |
327 |
|
dc009d924 [PATCH] kexec: ad... |
328 329 330 331 |
pages = alloc_pages(gfp_mask, order); if (pages) { unsigned int count, i; pages->mapping = NULL; |
4c21e2f24 [PATCH] mm: split... |
332 |
set_page_private(pages, order); |
dc009d924 [PATCH] kexec: ad... |
333 |
count = 1 << order; |
72414d3f1 [PATCH] kexec cod... |
334 |
for (i = 0; i < count; i++) |
dc009d924 [PATCH] kexec: ad... |
335 |
SetPageReserved(pages + i); |
dc009d924 [PATCH] kexec: ad... |
336 |
} |
72414d3f1 [PATCH] kexec cod... |
337 |
|
dc009d924 [PATCH] kexec: ad... |
338 339 340 341 342 343 |
return pages; } static void kimage_free_pages(struct page *page) { unsigned int order, count, i; |
72414d3f1 [PATCH] kexec cod... |
344 |
|
4c21e2f24 [PATCH] mm: split... |
345 |
order = page_private(page); |
dc009d924 [PATCH] kexec: ad... |
346 |
count = 1 << order; |
72414d3f1 [PATCH] kexec cod... |
347 |
for (i = 0; i < count; i++) |
dc009d924 [PATCH] kexec: ad... |
348 |
ClearPageReserved(page + i); |
dc009d924 [PATCH] kexec: ad... |
349 350 351 352 353 354 |
__free_pages(page, order); } static void kimage_free_page_list(struct list_head *list) { struct list_head *pos, *next; |
72414d3f1 [PATCH] kexec cod... |
355 |
|
dc009d924 [PATCH] kexec: ad... |
356 357 358 359 360 |
list_for_each_safe(pos, next, list) { struct page *page; page = list_entry(pos, struct page, lru); list_del(&page->lru); |
dc009d924 [PATCH] kexec: ad... |
361 362 363 |
kimage_free_pages(page); } } |
72414d3f1 [PATCH] kexec cod... |
364 365 |
static struct page *kimage_alloc_normal_control_pages(struct kimage *image, unsigned int order) |
dc009d924 [PATCH] kexec: ad... |
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 |
{ /* 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 [PATCH] kexec cod... |
392 |
|
dc009d924 [PATCH] kexec: ad... |
393 394 395 396 397 398 399 400 |
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 [PATCH] kexec cod... |
401 |
kimage_is_destination_range(image, addr, eaddr)) { |
dc009d924 [PATCH] kexec: ad... |
402 403 404 |
list_add(&pages->lru, &extra_pages); pages = NULL; } |
72414d3f1 [PATCH] kexec cod... |
405 |
} while (!pages); |
dc009d924 [PATCH] kexec: ad... |
406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 |
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 [PATCH] kexec: ad... |
425 |
|
72414d3f1 [PATCH] kexec cod... |
426 |
return pages; |
dc009d924 [PATCH] kexec: ad... |
427 |
} |
72414d3f1 [PATCH] kexec cod... |
428 429 |
static struct page *kimage_alloc_crash_control_pages(struct kimage *image, unsigned int order) |
dc009d924 [PATCH] kexec: ad... |
430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 |
{ /* 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 [PATCH] kexec cod... |
454 |
|
dc009d924 [PATCH] kexec: ad... |
455 456 457 458 |
pages = NULL; size = (1 << order) << PAGE_SHIFT; hole_start = (image->control_page + (size - 1)) & ~(size - 1); hole_end = hole_start + size - 1; |
72414d3f1 [PATCH] kexec cod... |
459 |
while (hole_end <= crashk_res.end) { |
dc009d924 [PATCH] kexec: ad... |
460 |
unsigned long i; |
72414d3f1 [PATCH] kexec cod... |
461 462 |
if (hole_end > KEXEC_CONTROL_MEMORY_LIMIT) |
dc009d924 [PATCH] kexec: ad... |
463 |
break; |
72414d3f1 [PATCH] kexec cod... |
464 |
if (hole_end > crashk_res.end) |
dc009d924 [PATCH] kexec: ad... |
465 |
break; |
dc009d924 [PATCH] kexec: ad... |
466 |
/* See if I overlap any of the segments */ |
72414d3f1 [PATCH] kexec cod... |
467 |
for (i = 0; i < image->nr_segments; i++) { |
dc009d924 [PATCH] kexec: ad... |
468 |
unsigned long mstart, mend; |
72414d3f1 [PATCH] kexec cod... |
469 |
|
dc009d924 [PATCH] kexec: ad... |
470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 |
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 [PATCH] kexec cod... |
485 |
if (pages) |
dc009d924 [PATCH] kexec: ad... |
486 |
image->control_page = hole_end; |
72414d3f1 [PATCH] kexec cod... |
487 |
|
dc009d924 [PATCH] kexec: ad... |
488 489 |
return pages; } |
72414d3f1 [PATCH] kexec cod... |
490 491 |
struct page *kimage_alloc_control_pages(struct kimage *image, unsigned int order) |
dc009d924 [PATCH] kexec: ad... |
492 493 |
{ struct page *pages = NULL; |
72414d3f1 [PATCH] kexec cod... |
494 495 |
switch (image->type) { |
dc009d924 [PATCH] kexec: ad... |
496 497 498 499 500 501 502 |
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 [PATCH] kexec cod... |
503 |
|
dc009d924 [PATCH] kexec: ad... |
504 505 506 507 508 |
return pages; } static int kimage_add_entry(struct kimage *image, kimage_entry_t entry) { |
72414d3f1 [PATCH] kexec cod... |
509 |
if (*image->entry != 0) |
dc009d924 [PATCH] kexec: ad... |
510 |
image->entry++; |
72414d3f1 [PATCH] kexec cod... |
511 |
|
dc009d924 [PATCH] kexec: ad... |
512 513 514 |
if (image->entry == image->last_entry) { kimage_entry_t *ind_page; struct page *page; |
72414d3f1 [PATCH] kexec cod... |
515 |
|
dc009d924 [PATCH] kexec: ad... |
516 |
page = kimage_alloc_page(image, GFP_KERNEL, KIMAGE_NO_DEST); |
72414d3f1 [PATCH] kexec cod... |
517 |
if (!page) |
dc009d924 [PATCH] kexec: ad... |
518 |
return -ENOMEM; |
72414d3f1 [PATCH] kexec cod... |
519 |
|
dc009d924 [PATCH] kexec: ad... |
520 521 522 |
ind_page = page_address(page); *image->entry = virt_to_phys(ind_page) | IND_INDIRECTION; image->entry = ind_page; |
72414d3f1 [PATCH] kexec cod... |
523 524 |
image->last_entry = ind_page + ((PAGE_SIZE/sizeof(kimage_entry_t)) - 1); |
dc009d924 [PATCH] kexec: ad... |
525 526 527 528 |
} *image->entry = entry; image->entry++; *image->entry = 0; |
72414d3f1 [PATCH] kexec cod... |
529 |
|
dc009d924 [PATCH] kexec: ad... |
530 531 |
return 0; } |
72414d3f1 [PATCH] kexec cod... |
532 533 |
static int kimage_set_destination(struct kimage *image, unsigned long destination) |
dc009d924 [PATCH] kexec: ad... |
534 535 536 537 538 |
{ int result; destination &= PAGE_MASK; result = kimage_add_entry(image, destination | IND_DESTINATION); |
72414d3f1 [PATCH] kexec cod... |
539 |
if (result == 0) |
dc009d924 [PATCH] kexec: ad... |
540 |
image->destination = destination; |
72414d3f1 [PATCH] kexec cod... |
541 |
|
dc009d924 [PATCH] kexec: ad... |
542 543 544 545 546 547 548 549 550 551 |
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 [PATCH] kexec cod... |
552 |
if (result == 0) |
dc009d924 [PATCH] kexec: ad... |
553 |
image->destination += PAGE_SIZE; |
72414d3f1 [PATCH] kexec cod... |
554 |
|
dc009d924 [PATCH] kexec: ad... |
555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 |
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); } static int kimage_terminate(struct kimage *image) { |
72414d3f1 [PATCH] kexec cod... |
570 |
if (*image->entry != 0) |
dc009d924 [PATCH] kexec: ad... |
571 |
image->entry++; |
72414d3f1 [PATCH] kexec cod... |
572 |
|
dc009d924 [PATCH] kexec: ad... |
573 |
*image->entry = IND_DONE; |
72414d3f1 [PATCH] kexec cod... |
574 |
|
dc009d924 [PATCH] kexec: ad... |
575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 |
return 0; } #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 [PATCH] kexec cod... |
598 |
|
dc009d924 [PATCH] kexec: ad... |
599 600 601 602 |
kimage_free_extra_pages(image); for_each_kimage_entry(image, ptr, entry) { if (entry & IND_INDIRECTION) { /* Free the previous indirection page */ |
72414d3f1 [PATCH] kexec cod... |
603 |
if (ind & IND_INDIRECTION) |
dc009d924 [PATCH] kexec: ad... |
604 |
kimage_free_entry(ind); |
dc009d924 [PATCH] kexec: ad... |
605 606 607 608 609 |
/* Save this indirection page until we are * done with it. */ ind = entry; } |
72414d3f1 [PATCH] kexec cod... |
610 |
else if (entry & IND_SOURCE) |
dc009d924 [PATCH] kexec: ad... |
611 |
kimage_free_entry(entry); |
dc009d924 [PATCH] kexec: ad... |
612 613 |
} /* Free the final indirection page */ |
72414d3f1 [PATCH] kexec cod... |
614 |
if (ind & IND_INDIRECTION) |
dc009d924 [PATCH] kexec: ad... |
615 |
kimage_free_entry(ind); |
dc009d924 [PATCH] kexec: ad... |
616 617 618 619 620 621 622 623 |
/* Handle any machine specific cleanup */ machine_kexec_cleanup(image); /* Free the kexec control pages... */ kimage_free_page_list(&image->control_pages); kfree(image); } |
72414d3f1 [PATCH] kexec cod... |
624 625 |
static kimage_entry_t *kimage_dst_used(struct kimage *image, unsigned long page) |
dc009d924 [PATCH] kexec: ad... |
626 627 628 629 630 |
{ kimage_entry_t *ptr, entry; unsigned long destination = 0; for_each_kimage_entry(image, ptr, entry) { |
72414d3f1 [PATCH] kexec cod... |
631 |
if (entry & IND_DESTINATION) |
dc009d924 [PATCH] kexec: ad... |
632 |
destination = entry & PAGE_MASK; |
dc009d924 [PATCH] kexec: ad... |
633 |
else if (entry & IND_SOURCE) { |
72414d3f1 [PATCH] kexec cod... |
634 |
if (page == destination) |
dc009d924 [PATCH] kexec: ad... |
635 |
return ptr; |
dc009d924 [PATCH] kexec: ad... |
636 637 638 |
destination += PAGE_SIZE; } } |
72414d3f1 [PATCH] kexec cod... |
639 |
|
314b6a4d8 [PATCH] kexec: fi... |
640 |
return NULL; |
dc009d924 [PATCH] kexec: ad... |
641 |
} |
72414d3f1 [PATCH] kexec cod... |
642 |
static struct page *kimage_alloc_page(struct kimage *image, |
9796fdd82 [PATCH] gfp_t: ke... |
643 |
gfp_t gfp_mask, |
72414d3f1 [PATCH] kexec cod... |
644 |
unsigned long destination) |
dc009d924 [PATCH] kexec: ad... |
645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 |
{ /* * 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 [PATCH] kexec cod... |
684 |
if (!page) |
314b6a4d8 [PATCH] kexec: fi... |
685 |
return NULL; |
dc009d924 [PATCH] kexec: ad... |
686 |
/* If the page cannot be used file it away */ |
72414d3f1 [PATCH] kexec cod... |
687 688 |
if (page_to_pfn(page) > (KEXEC_SOURCE_MEMORY_LIMIT >> PAGE_SHIFT)) { |
dc009d924 [PATCH] kexec: ad... |
689 690 691 692 693 694 695 696 697 698 |
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 [PATCH] kexec cod... |
699 700 |
if (!kimage_is_destination_range(image, addr, addr + PAGE_SIZE)) |
dc009d924 [PATCH] kexec: ad... |
701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 |
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 * destination page, so return it. */ 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 [PATCH] kexec cod... |
733 |
|
dc009d924 [PATCH] kexec: ad... |
734 735 736 737 |
return page; } static int kimage_load_normal_segment(struct kimage *image, |
72414d3f1 [PATCH] kexec cod... |
738 |
struct kexec_segment *segment) |
dc009d924 [PATCH] kexec: ad... |
739 740 741 742 |
{ unsigned long maddr; unsigned long ubytes, mbytes; int result; |
314b6a4d8 [PATCH] kexec: fi... |
743 |
unsigned char __user *buf; |
dc009d924 [PATCH] kexec: ad... |
744 745 746 747 748 749 750 751 |
result = 0; buf = segment->buf; ubytes = segment->bufsz; mbytes = segment->memsz; maddr = segment->mem; result = kimage_set_destination(image, maddr); |
72414d3f1 [PATCH] kexec cod... |
752 |
if (result < 0) |
dc009d924 [PATCH] kexec: ad... |
753 |
goto out; |
72414d3f1 [PATCH] kexec cod... |
754 755 |
while (mbytes) { |
dc009d924 [PATCH] kexec: ad... |
756 757 758 |
struct page *page; char *ptr; size_t uchunk, mchunk; |
72414d3f1 [PATCH] kexec cod... |
759 |
|
dc009d924 [PATCH] kexec: ad... |
760 761 762 763 764 |
page = kimage_alloc_page(image, GFP_HIGHUSER, maddr); if (page == 0) { result = -ENOMEM; goto out; } |
72414d3f1 [PATCH] kexec cod... |
765 766 767 |
result = kimage_add_page(image, page_to_pfn(page) << PAGE_SHIFT); if (result < 0) |
dc009d924 [PATCH] kexec: ad... |
768 |
goto out; |
72414d3f1 [PATCH] kexec cod... |
769 |
|
dc009d924 [PATCH] kexec: ad... |
770 771 772 773 774 |
ptr = kmap(page); /* Start with a clear page */ memset(ptr, 0, PAGE_SIZE); ptr += maddr & ~PAGE_MASK; mchunk = PAGE_SIZE - (maddr & ~PAGE_MASK); |
72414d3f1 [PATCH] kexec cod... |
775 |
if (mchunk > mbytes) |
dc009d924 [PATCH] kexec: ad... |
776 |
mchunk = mbytes; |
72414d3f1 [PATCH] kexec cod... |
777 |
|
dc009d924 [PATCH] kexec: ad... |
778 |
uchunk = mchunk; |
72414d3f1 [PATCH] kexec cod... |
779 |
if (uchunk > ubytes) |
dc009d924 [PATCH] kexec: ad... |
780 |
uchunk = ubytes; |
72414d3f1 [PATCH] kexec cod... |
781 |
|
dc009d924 [PATCH] kexec: ad... |
782 783 784 785 786 787 788 789 790 791 792 |
result = copy_from_user(ptr, buf, uchunk); kunmap(page); if (result) { result = (result < 0) ? result : -EIO; goto out; } ubytes -= uchunk; maddr += mchunk; buf += mchunk; mbytes -= mchunk; } |
72414d3f1 [PATCH] kexec cod... |
793 |
out: |
dc009d924 [PATCH] kexec: ad... |
794 795 796 797 |
return result; } static int kimage_load_crash_segment(struct kimage *image, |
72414d3f1 [PATCH] kexec cod... |
798 |
struct kexec_segment *segment) |
dc009d924 [PATCH] kexec: ad... |
799 800 801 802 803 804 805 806 |
{ /* 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 [PATCH] kexec: fi... |
807 |
unsigned char __user *buf; |
dc009d924 [PATCH] kexec: ad... |
808 809 810 811 812 813 |
result = 0; buf = segment->buf; ubytes = segment->bufsz; mbytes = segment->memsz; maddr = segment->mem; |
72414d3f1 [PATCH] kexec cod... |
814 |
while (mbytes) { |
dc009d924 [PATCH] kexec: ad... |
815 816 817 |
struct page *page; char *ptr; size_t uchunk, mchunk; |
72414d3f1 [PATCH] kexec cod... |
818 |
|
dc009d924 [PATCH] kexec: ad... |
819 820 821 822 823 824 825 826 |
page = pfn_to_page(maddr >> PAGE_SHIFT); if (page == 0) { result = -ENOMEM; goto out; } ptr = kmap(page); ptr += maddr & ~PAGE_MASK; mchunk = PAGE_SIZE - (maddr & ~PAGE_MASK); |
72414d3f1 [PATCH] kexec cod... |
827 |
if (mchunk > mbytes) |
dc009d924 [PATCH] kexec: ad... |
828 |
mchunk = mbytes; |
72414d3f1 [PATCH] kexec cod... |
829 |
|
dc009d924 [PATCH] kexec: ad... |
830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 |
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); kunmap(page); if (result) { result = (result < 0) ? result : -EIO; goto out; } ubytes -= uchunk; maddr += mchunk; buf += mchunk; mbytes -= mchunk; } |
72414d3f1 [PATCH] kexec cod... |
847 |
out: |
dc009d924 [PATCH] kexec: ad... |
848 849 850 851 |
return result; } static int kimage_load_segment(struct kimage *image, |
72414d3f1 [PATCH] kexec cod... |
852 |
struct kexec_segment *segment) |
dc009d924 [PATCH] kexec: ad... |
853 854 |
{ int result = -ENOMEM; |
72414d3f1 [PATCH] kexec cod... |
855 856 |
switch (image->type) { |
dc009d924 [PATCH] kexec: ad... |
857 858 859 860 861 862 863 |
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 [PATCH] kexec cod... |
864 |
|
dc009d924 [PATCH] kexec: ad... |
865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 |
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 [PATCH] Add a sys... |
888 889 |
struct kimage *kexec_image; struct kimage *kexec_crash_image; |
dc009d924 [PATCH] kexec: ad... |
890 891 892 893 894 |
/* * A home grown binary mutex. * Nothing can wait so this mutex is safe to use * in interrupt context :) */ |
c330dda90 [PATCH] Add a sys... |
895 |
static int kexec_lock; |
dc009d924 [PATCH] kexec: ad... |
896 |
|
72414d3f1 [PATCH] kexec cod... |
897 898 899 |
asmlinkage long sys_kexec_load(unsigned long entry, unsigned long nr_segments, struct kexec_segment __user *segments, unsigned long flags) |
dc009d924 [PATCH] kexec: ad... |
900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 |
{ struct kimage **dest_image, *image; int locked; 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 [PATCH] kexec: ad... |
919 |
return -EINVAL; |
dc009d924 [PATCH] kexec: ad... |
920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 |
/* 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. */ locked = xchg(&kexec_lock, 1); |
72414d3f1 [PATCH] kexec cod... |
939 |
if (locked) |
dc009d924 [PATCH] kexec: ad... |
940 |
return -EBUSY; |
72414d3f1 [PATCH] kexec cod... |
941 |
|
dc009d924 [PATCH] kexec: ad... |
942 |
dest_image = &kexec_image; |
72414d3f1 [PATCH] kexec cod... |
943 |
if (flags & KEXEC_ON_CRASH) |
dc009d924 [PATCH] kexec: ad... |
944 |
dest_image = &kexec_crash_image; |
dc009d924 [PATCH] kexec: ad... |
945 946 |
if (nr_segments > 0) { unsigned long i; |
72414d3f1 [PATCH] kexec cod... |
947 |
|
dc009d924 [PATCH] kexec: ad... |
948 |
/* Loading another kernel to reboot into */ |
72414d3f1 [PATCH] kexec cod... |
949 950 951 |
if ((flags & KEXEC_ON_CRASH) == 0) result = kimage_normal_alloc(&image, entry, nr_segments, segments); |
dc009d924 [PATCH] kexec: ad... |
952 953 954 955 956 957 |
/* 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 [PATCH] kexec cod... |
958 959 |
result = kimage_crash_alloc(&image, entry, nr_segments, segments); |
dc009d924 [PATCH] kexec: ad... |
960 |
} |
72414d3f1 [PATCH] kexec cod... |
961 |
if (result) |
dc009d924 [PATCH] kexec: ad... |
962 |
goto out; |
72414d3f1 [PATCH] kexec cod... |
963 |
|
dc009d924 [PATCH] kexec: ad... |
964 |
result = machine_kexec_prepare(image); |
72414d3f1 [PATCH] kexec cod... |
965 |
if (result) |
dc009d924 [PATCH] kexec: ad... |
966 |
goto out; |
72414d3f1 [PATCH] kexec cod... |
967 968 |
for (i = 0; i < nr_segments; i++) { |
dc009d924 [PATCH] kexec: ad... |
969 |
result = kimage_load_segment(image, &image->segment[i]); |
72414d3f1 [PATCH] kexec cod... |
970 |
if (result) |
dc009d924 [PATCH] kexec: ad... |
971 |
goto out; |
dc009d924 [PATCH] kexec: ad... |
972 973 |
} result = kimage_terminate(image); |
72414d3f1 [PATCH] kexec cod... |
974 |
if (result) |
dc009d924 [PATCH] kexec: ad... |
975 |
goto out; |
dc009d924 [PATCH] kexec: ad... |
976 977 978 |
} /* Install the new kernel, and Uninstall the old */ image = xchg(dest_image, image); |
72414d3f1 [PATCH] kexec cod... |
979 |
out: |
dc009d924 [PATCH] kexec: ad... |
980 981 |
xchg(&kexec_lock, 0); /* Release the mutex */ kimage_free(image); |
72414d3f1 [PATCH] kexec cod... |
982 |
|
dc009d924 [PATCH] kexec: ad... |
983 984 985 986 987 |
return result; } #ifdef CONFIG_COMPAT asmlinkage long compat_sys_kexec_load(unsigned long entry, |
72414d3f1 [PATCH] kexec cod... |
988 989 990 |
unsigned long nr_segments, struct compat_kexec_segment __user *segments, unsigned long flags) |
dc009d924 [PATCH] kexec: ad... |
991 992 993 994 995 996 997 998 |
{ 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 [PATCH] kexec cod... |
999 |
if ((flags & KEXEC_ARCH_MASK) == KEXEC_ARCH_DEFAULT) |
dc009d924 [PATCH] kexec: ad... |
1000 |
return -EINVAL; |
dc009d924 [PATCH] kexec: ad... |
1001 |
|
72414d3f1 [PATCH] kexec cod... |
1002 |
if (nr_segments > KEXEC_SEGMENT_MAX) |
dc009d924 [PATCH] kexec: ad... |
1003 |
return -EINVAL; |
dc009d924 [PATCH] kexec: ad... |
1004 1005 1006 1007 |
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 [PATCH] kexec cod... |
1008 |
if (result) |
dc009d924 [PATCH] kexec: ad... |
1009 |
return -EFAULT; |
dc009d924 [PATCH] kexec: ad... |
1010 1011 1012 1013 1014 1015 1016 |
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 [PATCH] kexec cod... |
1017 |
if (result) |
dc009d924 [PATCH] kexec: ad... |
1018 |
return -EFAULT; |
dc009d924 [PATCH] kexec: ad... |
1019 1020 1021 1022 1023 |
} return sys_kexec_load(entry, nr_segments, ksegments, flags); } #endif |
6e274d144 [PATCH] kdump: Us... |
1024 |
void crash_kexec(struct pt_regs *regs) |
dc009d924 [PATCH] kexec: ad... |
1025 |
{ |
dc009d924 [PATCH] kexec: ad... |
1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 |
int locked; /* Take the kexec_lock here to prevent sys_kexec_load * 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... */ locked = xchg(&kexec_lock, 1); if (!locked) { |
c0ce7d088 [POWERPC] Add the... |
1039 |
if (kexec_crash_image) { |
e996e5813 [PATCH] kdump: sa... |
1040 1041 1042 |
struct pt_regs fixed_regs; crash_setup_regs(&fixed_regs, regs); machine_crash_shutdown(&fixed_regs); |
c0ce7d088 [POWERPC] Add the... |
1043 |
machine_kexec(kexec_crash_image); |
dc009d924 [PATCH] kexec: ad... |
1044 1045 1046 1047 |
} xchg(&kexec_lock, 0); } } |
cc5716587 [PATCH] kdump: dy... |
1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 |
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) |