kexec: move segment verification code in a separate function

Previously do_kimage_alloc() will allocate a kimage structure, copy
segment list from user space and then do the segment list sanity
verification.

Break down this function in 3 parts.  do_kimage_alloc_init() to do actual
allocation and basic initialization of kimage structure.
copy_user_segment_list() to copy segment list from user space and
sanity_check_segment_list() to verify the sanity of segment list as passed
by user space.

In later patches, I need to only allocate kimage and not copy segment list
from user space.  So breaking down in smaller functions enables re-use of
code at other places.

Signed-off-by: Vivek Goyal <vgoyal@redhat.com>
Cc: Borislav Petkov <bp@suse.de>
Cc: Michael Kerrisk <mtk.manpages@gmail.com>
Cc: Yinghai Lu <yinghai@kernel.org>
Cc: Eric Biederman <ebiederm@xmission.com>
Cc: H. Peter Anvin <hpa@zytor.com>
Cc: Matthew Garrett <mjg59@srcf.ucam.org>
Cc: Greg Kroah-Hartman <greg@kroah.com>
Cc: Dave Young <dyoung@redhat.com>
Cc: WANG Chao <chaowang@redhat.com>
Cc: Baoquan He <bhe@redhat.com>
Cc: Andy Lutomirski <luto@amacapital.net>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
This commit is contained in:
Vivek Goyal 2014-08-08 14:25:45 -07:00 committed by Linus Torvalds
parent 7d3e2bca22
commit dabe78628d

View File

@ -125,46 +125,28 @@ static struct page *kimage_alloc_page(struct kimage *image,
gfp_t gfp_mask, gfp_t gfp_mask,
unsigned long dest); unsigned long dest);
static int do_kimage_alloc(struct kimage **rimage, unsigned long entry, static int copy_user_segment_list(struct kimage *image,
unsigned long nr_segments, unsigned long nr_segments,
struct kexec_segment __user *segments) struct kexec_segment __user *segments)
{ {
int ret;
size_t segment_bytes; size_t segment_bytes;
struct kimage *image;
unsigned long i;
int result;
/* Allocate a controlling structure */
result = -ENOMEM;
image = kzalloc(sizeof(*image), GFP_KERNEL);
if (!image)
goto out;
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 unusable pages */
INIT_LIST_HEAD(&image->unusable_pages);
/* Read in the segments */ /* Read in the segments */
image->nr_segments = nr_segments; image->nr_segments = nr_segments;
segment_bytes = nr_segments * sizeof(*segments); segment_bytes = nr_segments * sizeof(*segments);
result = copy_from_user(image->segment, segments, segment_bytes); ret = copy_from_user(image->segment, segments, segment_bytes);
if (result) { if (ret)
result = -EFAULT; ret = -EFAULT;
goto out;
return ret;
} }
static int sanity_check_segment_list(struct kimage *image)
{
int result, i;
unsigned long nr_segments = image->nr_segments;
/* /*
* Verify we have good destination addresses. The caller is * Verify we have good destination addresses. The caller is
* responsible for making certain we don't attempt to load * responsible for making certain we don't attempt to load
@ -185,9 +167,9 @@ static int do_kimage_alloc(struct kimage **rimage, unsigned long entry,
mstart = image->segment[i].mem; mstart = image->segment[i].mem;
mend = mstart + image->segment[i].memsz; mend = mstart + image->segment[i].memsz;
if ((mstart & ~PAGE_MASK) || (mend & ~PAGE_MASK)) if ((mstart & ~PAGE_MASK) || (mend & ~PAGE_MASK))
goto out; return result;
if (mend >= KEXEC_DESTINATION_MEMORY_LIMIT) if (mend >= KEXEC_DESTINATION_MEMORY_LIMIT)
goto out; return result;
} }
/* Verify our destination addresses do not overlap. /* Verify our destination addresses do not overlap.
@ -208,7 +190,7 @@ static int do_kimage_alloc(struct kimage **rimage, unsigned long entry,
pend = pstart + image->segment[j].memsz; pend = pstart + image->segment[j].memsz;
/* Do the segments overlap ? */ /* Do the segments overlap ? */
if ((mend > pstart) && (mstart < pend)) if ((mend > pstart) && (mstart < pend))
goto out; return result;
} }
} }
@ -220,18 +202,61 @@ static int do_kimage_alloc(struct kimage **rimage, unsigned long entry,
result = -EINVAL; result = -EINVAL;
for (i = 0; i < nr_segments; i++) { for (i = 0; i < nr_segments; i++) {
if (image->segment[i].bufsz > image->segment[i].memsz) if (image->segment[i].bufsz > image->segment[i].memsz)
goto out; return result;
} }
result = 0; /*
out: * Verify we have good destination addresses. Normally
if (result == 0) * the caller is responsible for making certain we don't
*rimage = image; * attempt to load the new image into invalid or reserved
else * areas of RAM. But crash kernels are preloaded into a
kfree(image); * reserved area of ram. We must ensure the addresses
* are in the reserved area otherwise preloading the
* kernel could corrupt things.
*/
if (image->type == KEXEC_TYPE_CRASH) {
result = -EADDRNOTAVAIL;
for (i = 0; i < nr_segments; i++) {
unsigned long mstart, mend;
mstart = image->segment[i].mem;
mend = mstart + image->segment[i].memsz - 1;
/* Ensure we are within the crash kernel limits */
if ((mstart < crashk_res.start) ||
(mend > crashk_res.end))
return result; return result;
}
}
return 0;
}
static struct kimage *do_kimage_alloc_init(void)
{
struct kimage *image;
/* Allocate a controlling structure */
image = kzalloc(sizeof(*image), GFP_KERNEL);
if (!image)
return NULL;
image->head = 0;
image->entry = &image->head;
image->last_entry = &image->head;
image->control_page = ~0; /* By default this does not apply */
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 unusable pages */
INIT_LIST_HEAD(&image->unusable_pages);
return image;
} }
static void kimage_free_page_list(struct list_head *list); static void kimage_free_page_list(struct list_head *list);
@ -244,10 +269,19 @@ static int kimage_normal_alloc(struct kimage **rimage, unsigned long entry,
struct kimage *image; struct kimage *image;
/* Allocate and initialize a controlling structure */ /* Allocate and initialize a controlling structure */
image = NULL; image = do_kimage_alloc_init();
result = do_kimage_alloc(&image, entry, nr_segments, segments); if (!image)
return -ENOMEM;
image->start = entry;
result = copy_user_segment_list(image, nr_segments, segments);
if (result) if (result)
goto out; goto out_free_image;
result = sanity_check_segment_list(image);
if (result)
goto out_free_image;
/* /*
* Find a location for the control code buffer, and add it * Find a location for the control code buffer, and add it
@ -259,22 +293,21 @@ static int kimage_normal_alloc(struct kimage **rimage, unsigned long entry,
get_order(KEXEC_CONTROL_PAGE_SIZE)); get_order(KEXEC_CONTROL_PAGE_SIZE));
if (!image->control_code_page) { if (!image->control_code_page) {
pr_err("Could not allocate control_code_buffer\n"); pr_err("Could not allocate control_code_buffer\n");
goto out_free; goto out_free_image;
} }
image->swap_page = kimage_alloc_control_pages(image, 0); image->swap_page = kimage_alloc_control_pages(image, 0);
if (!image->swap_page) { if (!image->swap_page) {
pr_err("Could not allocate swap buffer\n"); pr_err("Could not allocate swap buffer\n");
goto out_free; goto out_free_control_pages;
} }
*rimage = image; *rimage = image;
return 0; return 0;
out_free_control_pages:
out_free:
kimage_free_page_list(&image->control_pages); kimage_free_page_list(&image->control_pages);
out_free_image:
kfree(image); kfree(image);
out:
return result; return result;
} }
@ -284,19 +317,17 @@ static int kimage_crash_alloc(struct kimage **rimage, unsigned long entry,
{ {
int result; int result;
struct kimage *image; struct kimage *image;
unsigned long i;
image = NULL;
/* Verify we have a valid entry point */ /* Verify we have a valid entry point */
if ((entry < crashk_res.start) || (entry > crashk_res.end)) { if ((entry < crashk_res.start) || (entry > crashk_res.end))
result = -EADDRNOTAVAIL; return -EADDRNOTAVAIL;
goto out;
}
/* Allocate and initialize a controlling structure */ /* Allocate and initialize a controlling structure */
result = do_kimage_alloc(&image, entry, nr_segments, segments); image = do_kimage_alloc_init();
if (result) if (!image)
goto out; return -ENOMEM;
image->start = entry;
/* Enable the special crash kernel control page /* Enable the special crash kernel control page
* allocation policy. * allocation policy.
@ -304,25 +335,13 @@ static int kimage_crash_alloc(struct kimage **rimage, unsigned long entry,
image->control_page = crashk_res.start; image->control_page = crashk_res.start;
image->type = KEXEC_TYPE_CRASH; image->type = KEXEC_TYPE_CRASH;
/* result = copy_user_segment_list(image, nr_segments, segments);
* Verify we have good destination addresses. Normally if (result)
* the caller is responsible for making certain we don't goto out_free_image;
* 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;
mstart = image->segment[i].mem; result = sanity_check_segment_list(image);
mend = mstart + image->segment[i].memsz - 1; if (result)
/* Ensure we are within the crash kernel limits */ goto out_free_image;
if ((mstart < crashk_res.start) || (mend > crashk_res.end))
goto out_free;
}
/* /*
* Find a location for the control code buffer, and add * Find a location for the control code buffer, and add
@ -334,15 +353,14 @@ static int kimage_crash_alloc(struct kimage **rimage, unsigned long entry,
get_order(KEXEC_CONTROL_PAGE_SIZE)); get_order(KEXEC_CONTROL_PAGE_SIZE));
if (!image->control_code_page) { if (!image->control_code_page) {
pr_err("Could not allocate control_code_buffer\n"); pr_err("Could not allocate control_code_buffer\n");
goto out_free; goto out_free_image;
} }
*rimage = image; *rimage = image;
return 0; return 0;
out_free: out_free_image:
kfree(image); kfree(image);
out:
return result; return result;
} }