From 48e8c73ae7789808d066ef509c82edb0d9a7050a Mon Sep 17 00:00:00 2001 From: "Liam R. Howlett" Date: Thu, 31 Jan 2019 10:53:33 -0500 Subject: [PATCH] test_maple_tree: Add seqential test for adding 1000 entries Signed-off-by: Liam R. Howlett --- lib/test_maple_tree.c | 13 ++++++++----- 1 file changed, 8 insertions(+), 5 deletions(-) diff --git a/lib/test_maple_tree.c b/lib/test_maple_tree.c index 807160e282b6..8ee3c56e3513 100644 --- a/lib/test_maple_tree.c +++ b/lib/test_maple_tree.c @@ -189,18 +189,20 @@ static noinline void check_new_node(struct maple_tree *mt) mtree_unlock(mt); mtree_destroy(mt); } -static noinline void check_seq(struct maple_tree *mt) +static noinline void check_seq(struct maple_tree *mt, unsigned long max) { - int i, j; + unsigned long i, j; MT_BUG_ON(mt, !mtree_empty(mt)); - for (i = 0; i < 16; i++) { + for (i = 0; i <= max; i++) { MT_BUG_ON(mt, mtree_insert_index(mt, i, GFP_KERNEL)); - for (j = 0; j <= i; j++) + for (j = 0; j <= i; j++) { check_index_load(mt, j); + } check_load(mt, i + 1, NULL); } + //mt_dump(mt); mtree_destroy(mt); } @@ -267,6 +269,7 @@ static int maple_tree_seed(void) pr_info("\nTEST STARTING\n\n"); mtree_init(&tree); + check_seq(&tree, 1000); check_new_node(&tree); check_lower_bound_split(&tree); check_upper_bound_split(&tree); @@ -388,7 +391,7 @@ static int maple_tree_seed(void) mtree_destroy(&tree); check_nomem(&tree); - check_seq(&tree); + check_seq(&tree, 16); printk("maple_tree: %u of %u tests passed\n", tests_passed, tests_run); return (tests_run == tests_passed) ? 0 : -EINVAL; -- 2.50.1