1 #include <linux/module.h>
2 #include <linux/moduleparam.h>
3 #include <linux/interval_tree.h>
4 #include <linux/random.h>
5 #include <linux/slab.h>
8 #define __param(type, name, init, msg) \
9 static type name = init; \
10 module_param(name, type, 0444); \
11 MODULE_PARM_DESC(name, msg);
13 __param(int, nnodes, 100, "Number of nodes in the interval tree");
14 __param(int, perf_loops, 100000, "Number of iterations modifying the tree");
16 __param(int, nsearches, 100, "Number of searches to the interval tree");
17 __param(int, search_loops, 10000, "Number of iterations searching the tree");
19 __param(uint, max_endpoint, ~0, "Largest value for the interval's endpoint");
21 static struct rb_root root = RB_ROOT;
22 static struct interval_tree_node *nodes = NULL;
23 static u32 *queries = NULL;
25 static struct rnd_state rnd;
27 static inline unsigned long
28 search(unsigned long query, struct rb_root *root)
30 struct interval_tree_node *node;
31 unsigned long results = 0;
33 for (node = interval_tree_iter_first(root, query, query); node;
34 node = interval_tree_iter_next(node, query, query))
39 static void init(void)
43 for (i = 0; i < nnodes; i++) {
44 u32 b = (prandom_u32_state(&rnd) >> 4) % max_endpoint;
45 u32 a = (prandom_u32_state(&rnd) >> 4) % b;
52 * Limit the search scope to what the user defined.
53 * Otherwise we are merely measuring empty walks,
56 for (i = 0; i < nsearches; i++)
57 queries[i] = (prandom_u32_state(&rnd) >> 4) % max_endpoint;
60 static int interval_tree_test_init(void)
63 unsigned long results;
64 cycles_t time1, time2, time;
66 nodes = kmalloc(nnodes * sizeof(struct interval_tree_node), GFP_KERNEL);
70 queries = kmalloc(nsearches * sizeof(int), GFP_KERNEL);
76 printk(KERN_ALERT "interval tree insert/remove");
78 prandom_seed_state(&rnd, 3141592653589793238ULL);
83 for (i = 0; i < perf_loops; i++) {
84 for (j = 0; j < nnodes; j++)
85 interval_tree_insert(nodes + j, &root);
86 for (j = 0; j < nnodes; j++)
87 interval_tree_remove(nodes + j, &root);
93 time = div_u64(time, perf_loops);
94 printk(" -> %llu cycles\n", (unsigned long long)time);
96 printk(KERN_ALERT "interval tree search");
98 for (j = 0; j < nnodes; j++)
99 interval_tree_insert(nodes + j, &root);
101 time1 = get_cycles();
104 for (i = 0; i < search_loops; i++)
105 for (j = 0; j < nsearches; j++)
106 results += search(queries[j], &root);
108 time2 = get_cycles();
109 time = time2 - time1;
111 time = div_u64(time, search_loops);
112 results = div_u64(results, search_loops);
113 printk(" -> %llu cycles (%lu results)\n",
114 (unsigned long long)time, results);
119 return -EAGAIN; /* Fail will directly unload the module */
122 static void interval_tree_test_exit(void)
124 printk(KERN_ALERT "test exit\n");
127 module_init(interval_tree_test_init)
128 module_exit(interval_tree_test_exit)
130 MODULE_LICENSE("GPL");
131 MODULE_AUTHOR("Michel Lespinasse");
132 MODULE_DESCRIPTION("Interval Tree test");