linux/lib/interval_tree_test_main.c
<<
>>
Prefs
   1#include <linux/module.h>
   2#include <linux/interval_tree.h>
   3#include <linux/random.h>
   4#include <asm/timex.h>
   5
   6#define NODES        100
   7#define PERF_LOOPS   100000
   8#define SEARCHES     100
   9#define SEARCH_LOOPS 10000
  10
  11static struct rb_root root = RB_ROOT;
  12static struct interval_tree_node nodes[NODES];
  13static u32 queries[SEARCHES];
  14
  15static struct rnd_state rnd;
  16
  17static inline unsigned long
  18search(unsigned long query, struct rb_root *root)
  19{
  20        struct interval_tree_node *node;
  21        unsigned long results = 0;
  22
  23        for (node = interval_tree_iter_first(root, query, query); node;
  24             node = interval_tree_iter_next(node, query, query))
  25                results++;
  26        return results;
  27}
  28
  29static void init(void)
  30{
  31        int i;
  32        for (i = 0; i < NODES; i++) {
  33                u32 a = prandom32(&rnd), b = prandom32(&rnd);
  34                if (a <= b) {
  35                        nodes[i].start = a;
  36                        nodes[i].last = b;
  37                } else {
  38                        nodes[i].start = b;
  39                        nodes[i].last = a;
  40                }
  41        }
  42        for (i = 0; i < SEARCHES; i++)
  43                queries[i] = prandom32(&rnd);
  44}
  45
  46static int interval_tree_test_init(void)
  47{
  48        int i, j;
  49        unsigned long results;
  50        cycles_t time1, time2, time;
  51
  52        printk(KERN_ALERT "interval tree insert/remove");
  53
  54        prandom32_seed(&rnd, 3141592653589793238ULL);
  55        init();
  56
  57        time1 = get_cycles();
  58
  59        for (i = 0; i < PERF_LOOPS; i++) {
  60                for (j = 0; j < NODES; j++)
  61                        interval_tree_insert(nodes + j, &root);
  62                for (j = 0; j < NODES; j++)
  63                        interval_tree_remove(nodes + j, &root);
  64        }
  65
  66        time2 = get_cycles();
  67        time = time2 - time1;
  68
  69        time = div_u64(time, PERF_LOOPS);
  70        printk(" -> %llu cycles\n", (unsigned long long)time);
  71
  72        printk(KERN_ALERT "interval tree search");
  73
  74        for (j = 0; j < NODES; j++)
  75                interval_tree_insert(nodes + j, &root);
  76
  77        time1 = get_cycles();
  78
  79        results = 0;
  80        for (i = 0; i < SEARCH_LOOPS; i++)
  81                for (j = 0; j < SEARCHES; j++)
  82                        results += search(queries[j], &root);
  83
  84        time2 = get_cycles();
  85        time = time2 - time1;
  86
  87        time = div_u64(time, SEARCH_LOOPS);
  88        results = div_u64(results, SEARCH_LOOPS);
  89        printk(" -> %llu cycles (%lu results)\n",
  90               (unsigned long long)time, results);
  91
  92        return -EAGAIN; /* Fail will directly unload the module */
  93}
  94
  95static void interval_tree_test_exit(void)
  96{
  97        printk(KERN_ALERT "test exit\n");
  98}
  99
 100module_init(interval_tree_test_init)
 101module_exit(interval_tree_test_exit)
 102
 103MODULE_LICENSE("GPL");
 104MODULE_AUTHOR("Michel Lespinasse");
 105MODULE_DESCRIPTION("Interval Tree test");
 106
lxr.linux.no kindly hosted by Redpill Linpro AS, provider of Linux consulting and operations services since 1995.