]> www.infradead.org Git - users/jedix/linux-maple.git/commitdiff
test_maple_tree: Quiet down output
authorLiam R. Howlett <Liam.Howlett@Oracle.com>
Fri, 2 Aug 2019 17:40:14 +0000 (13:40 -0400)
committerLiam R. Howlett <Liam.Howlett@Oracle.com>
Fri, 30 Oct 2020 18:56:13 +0000 (14:56 -0400)
Signed-off-by: Liam R. Howlett <Liam.Howlett@Oracle.com>
lib/test_maple_tree.c

index 61c02271052ae945580fbe4b0df8e6a99b6a562a..4c5c4520c7527295496a16f67378f5db02c9337e 100644 (file)
@@ -111,7 +111,6 @@ static noinline void check_store_range(struct maple_tree *mt,
        unsigned long i;
 
        ret = mtree_test_store_range(mt, start, end, ptr);
-       printk("ret %d expected %d\n", ret, expected);
        MT_BUG_ON(mt, ret != expected);
 
        if (ret)
@@ -559,19 +558,7 @@ static noinline void check_alloc_rev_range(struct maple_tree *mt)
                                xa_mk_value(range[i] >> 12), 0);
        }
 
-       printk("Starting reverse range allocation tests.\n");
        for (i = 0; i < req_range_cnt; i += 5) {
-               mt_dump(mt);
-               printk("%s %d: alloc %ld in range %ld - %ld\n",
-                               __func__, i,
-                               req_range[i+2] >> 12,
-                               req_range[i] >> 12,
-                               req_range[i+1] >> 12);
-               if (req_range[i+4])
-                       printk("\t Should fail\n");
-               else
-                       printk ("\tShould be starting at %ld\n",
-                                       req_range[i+3] >> 12);
                check_mtree_alloc_rrange(mt,
                                req_range[i]   >> 12, // start
                                req_range[i+1] >> 12, // end
@@ -579,8 +566,6 @@ static noinline void check_alloc_rev_range(struct maple_tree *mt)
                                req_range[i+3] >> 12, // expected address
                                req_range[i+4],       // expected return
                                xa_mk_value(req_range[i] >> 12)); // pointer
-               mt_dump(mt);
-               printk("Done\n\n");
        }
 
        mtree_destroy(mt);
@@ -682,24 +667,11 @@ static noinline void check_alloc_range(struct maple_tree *mt)
        MT_BUG_ON(mt, !mtree_empty(mt));
 
        for (i = 0; i < range_cnt; i += 2) {
-               mt_dump(mt);
-               printk("Starting check insert %d\n", i);
                check_insert_range(mt, range[i] >> 12, (range[i + 1] >> 12) - 1,
                                xa_mk_value(range[i] >> 12), 0);
        }
 
        for (i = 0; i < req_range_cnt; i += 5) {
-               mt_dump(mt);
-               printk("%s %d: alloc %ld in range %ld - %ld\n",
-                               __func__, i,
-                               req_range[i+2] >> 12,
-                               req_range[i] >> 12,
-                               req_range[i+1] >> 12);
-               if (req_range[i+4])
-                       printk("\t Should fail\n");
-               else
-                       printk ("\tShould be starting at %ld\n",
-                                       req_range[i+3] >> 12);
                check_mtree_alloc_range(mt,
                                req_range[i]   >> 12, // start
                                req_range[i+1] >> 12, // end
@@ -707,8 +679,6 @@ static noinline void check_alloc_range(struct maple_tree *mt)
                                req_range[i+3] >> 12, // expected address
                                req_range[i+4],       // expected return
                                xa_mk_value(req_range[i] >> 12)); // pointer
-               mt_dump(mt);
-               printk("Done\n\n");
        }
 
        mtree_destroy(mt);
@@ -724,7 +694,6 @@ static noinline void check_ranges(struct maple_tree *mt)
                45, 168,
                        };
 
-       printk("Check ranges\n");
        MT_BUG_ON(mt, !mtree_empty(mt));
        check_insert_range(mt, r[0], r[1], xa_mk_value(r[0]), 0);
        check_insert_range(mt, r[2], r[3], xa_mk_value(r[2]), 0);
@@ -777,7 +746,6 @@ static noinline void check_next_entry(struct maple_tree *mt)
        MT_BUG_ON(mt, !mtree_empty(mt));
 
        check_seq(mt, 30, false);
-       mt_dump(mt);
        mtree_destroy(mt);
 
 }