Commit 69412303 authored by Rasmus Villemoes's avatar Rasmus Villemoes Committed by Linus Torvalds

lib: list_sort_test(): simplify and harden cleanup

There is no reason to maintain the list structure while freeing the
debug elements.  Aside from the redundant pointer manipulations, it is
also inefficient from a locality-of-reference viewpoint, since they are
visited in a random order (wrt.  the order they were allocated).
Furthermore, if we jumped to exit: after detecting list corruption, it
is actually dangerous.

So just free the elements in the order they were allocated, using the
backing array elts.  Allocate that using kcalloc(), so that if
allocation of one of the debug element fails, we just end up calling
kfree(NULL) for the trailing elements.

Minor details: Use sizeof(*elts) instead of sizeof(void *), and return
err immediately when allocation of elts fails, to avoid introducing
another label just before the final return statement.
Signed-off-by: default avatarRasmus Villemoes <linux@rasmusvillemoes.dk>
Cc: Artem Bityutskiy <artem.bityutskiy@linux.intel.com>
Cc: Don Mullis <don.mullis@gmail.com>
Cc: Dave Chinner <david@fromorbit.com>
Signed-off-by: default avatarAndrew Morton <akpm@linux-foundation.org>
Signed-off-by: default avatarLinus Torvalds <torvalds@linux-foundation.org>
parent 9d418dcc
...@@ -209,16 +209,16 @@ static int __init list_sort_test(void) ...@@ -209,16 +209,16 @@ static int __init list_sort_test(void)
{ {
int i, count = 1, err = -ENOMEM; int i, count = 1, err = -ENOMEM;
struct debug_el *el; struct debug_el *el;
struct list_head *cur, *tmp; struct list_head *cur;
LIST_HEAD(head); LIST_HEAD(head);
printk(KERN_DEBUG "list_sort_test: start testing list_sort()\n"); printk(KERN_DEBUG "list_sort_test: start testing list_sort()\n");
elts = kmalloc(sizeof(void *) * TEST_LIST_LEN, GFP_KERNEL); elts = kcalloc(TEST_LIST_LEN, sizeof(*elts), GFP_KERNEL);
if (!elts) { if (!elts) {
printk(KERN_ERR "list_sort_test: error: cannot allocate " printk(KERN_ERR "list_sort_test: error: cannot allocate "
"memory\n"); "memory\n");
goto exit; return err;
} }
for (i = 0; i < TEST_LIST_LEN; i++) { for (i = 0; i < TEST_LIST_LEN; i++) {
...@@ -286,11 +286,9 @@ static int __init list_sort_test(void) ...@@ -286,11 +286,9 @@ static int __init list_sort_test(void)
err = 0; err = 0;
exit: exit:
for (i = 0; i < TEST_LIST_LEN; i++)
kfree(elts[i]);
kfree(elts); kfree(elts);
list_for_each_safe(cur, tmp, &head) {
list_del(cur);
kfree(container_of(cur, struct debug_el, list));
}
return err; return err;
} }
module_init(list_sort_test); module_init(list_sort_test);
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment