radix tree: Remove radix_tree_clear_tags

[linux-2.6-microblaze.git] / tools / testing / radix-tree / benchmark.c

diff --git a/tools/testing/radix-tree/benchmark.c b/tools/testing/radix-tree/benchmark.c
index 99c40f3..35741b9 100644 (file)
--- a/tools/testing/radix-tree/benchmark.c
+++ b/tools/testing/radix-tree/benchmark.c
@@ -146,90 +146,6 @@ static void benchmark_size(unsigned long size, unsigned long step, int order)
        rcu_barrier();
 }
 
-static long long  __benchmark_split(unsigned long index,
-                                   int old_order, int new_order)
-{
-       struct timespec start, finish;
-       long long nsec;
-       RADIX_TREE(tree, GFP_ATOMIC);
-
-       item_insert_order(&tree, index, old_order);
-
-       clock_gettime(CLOCK_MONOTONIC, &start);
-       radix_tree_split(&tree, index, new_order);
-       clock_gettime(CLOCK_MONOTONIC, &finish);
-       nsec = (finish.tv_sec - start.tv_sec) * NSEC_PER_SEC +
-              (finish.tv_nsec - start.tv_nsec);
-
-       item_kill_tree(&tree);
-
-       return nsec;
-
-}
-
-static void benchmark_split(unsigned long size, unsigned long step)
-{
-       int i, j, idx;
-       long long nsec = 0;
-
-
-       for (idx = 0; idx < size; idx += step) {
-               for (i = 3; i < 11; i++) {
-                       for (j = 0; j < i; j++) {
-                               nsec += __benchmark_split(idx, i, j);
-                       }
-               }
-       }
-
-       printv(2, "Size %8ld, step %8ld, split time %10lld ns\n",
-                       size, step, nsec);
-
-}
-
-static long long  __benchmark_join(unsigned long index,
-                            unsigned order1, unsigned order2)
-{
-       unsigned long loc;
-       struct timespec start, finish;
-       long long nsec;
-       void *item, *item2 = item_create(index + 1, order1);
-       RADIX_TREE(tree, GFP_KERNEL);
-
-       item_insert_order(&tree, index, order2);
-       item = radix_tree_lookup(&tree, index);
-
-       clock_gettime(CLOCK_MONOTONIC, &start);
-       radix_tree_join(&tree, index + 1, order1, item2);
-       clock_gettime(CLOCK_MONOTONIC, &finish);
-       nsec = (finish.tv_sec - start.tv_sec) * NSEC_PER_SEC +
-               (finish.tv_nsec - start.tv_nsec);
-
-       loc = find_item(&tree, item);
-       if (loc == -1)
-               free(item);
-
-       item_kill_tree(&tree);
-
-       return nsec;
-}
-
-static void benchmark_join(unsigned long step)
-{
-       int i, j, idx;
-       long long nsec = 0;
-
-       for (idx = 0; idx < 1 << 10; idx += step) {
-               for (i = 1; i < 15; i++) {
-                       for (j = 0; j < i; j++) {
-                               nsec += __benchmark_join(idx, i, j);
-                       }
-               }
-       }
-
-       printv(2, "Size %8d, step %8ld, join time %10lld ns\n",
-                       1 << 10, step, nsec);
-}
-
 void benchmark(void)
 {
        unsigned long size[] = {1 << 10, 1 << 20, 0};
@@ -247,11 +163,4 @@ void benchmark(void)
        for (c = 0; size[c]; c++)
                for (s = 0; step[s]; s++)
                        benchmark_size(size[c], step[s] << 9, 9);
-
-       for (c = 0; size[c]; c++)
-               for (s = 0; step[s]; s++)
-                       benchmark_split(size[c], step[s]);
-
-       for (s = 0; step[s]; s++)
-               benchmark_join(step[s]);
 }