Blame view
lib/interval_tree_test.c
3.42 KB
09c434b8a
|
1 |
// SPDX-License-Identifier: GPL-2.0-only |
fff3fd8a1
|
2 |
#include <linux/module.h> |
a54dae033
|
3 |
#include <linux/moduleparam.h> |
fff3fd8a1
|
4 5 |
#include <linux/interval_tree.h> #include <linux/random.h> |
a54dae033
|
6 |
#include <linux/slab.h> |
fff3fd8a1
|
7 |
#include <asm/timex.h> |
a54dae033
|
8 9 10 11 12 13 |
#define __param(type, name, init, msg) \ static type name = init; \ module_param(name, type, 0444); \ MODULE_PARM_DESC(name, msg); __param(int, nnodes, 100, "Number of nodes in the interval tree"); |
0b548e33e
|
14 |
__param(int, perf_loops, 1000, "Number of iterations modifying the tree"); |
a54dae033
|
15 16 |
__param(int, nsearches, 100, "Number of searches to the interval tree"); |
0b548e33e
|
17 |
__param(int, search_loops, 1000, "Number of iterations searching the tree"); |
c46ecce43
|
18 |
__param(bool, search_all, false, "Searches will iterate all nodes in the tree"); |
a54dae033
|
19 |
|
a8ec14d4f
|
20 |
__param(uint, max_endpoint, ~0, "Largest value for the interval's endpoint"); |
fff3fd8a1
|
21 |
|
f808c13fd
|
22 |
static struct rb_root_cached root = RB_ROOT_CACHED; |
a54dae033
|
23 24 |
static struct interval_tree_node *nodes = NULL; static u32 *queries = NULL; |
fff3fd8a1
|
25 26 27 28 |
static struct rnd_state rnd; static inline unsigned long |
f808c13fd
|
29 |
search(struct rb_root_cached *root, unsigned long start, unsigned long last) |
fff3fd8a1
|
30 31 32 |
{ struct interval_tree_node *node; unsigned long results = 0; |
c46ecce43
|
33 34 |
for (node = interval_tree_iter_first(root, start, last); node; node = interval_tree_iter_next(node, start, last)) |
fff3fd8a1
|
35 36 37 38 39 40 41 |
results++; return results; } static void init(void) { int i; |
a54dae033
|
42 43 |
for (i = 0; i < nnodes; i++) { |
a8ec14d4f
|
44 45 46 47 48 |
u32 b = (prandom_u32_state(&rnd) >> 4) % max_endpoint; u32 a = (prandom_u32_state(&rnd) >> 4) % b; nodes[i].start = a; nodes[i].last = b; |
fff3fd8a1
|
49 |
} |
a8ec14d4f
|
50 51 52 53 54 55 |
/* * Limit the search scope to what the user defined. * Otherwise we are merely measuring empty walks, * which is pointless. */ |
a54dae033
|
56 |
for (i = 0; i < nsearches; i++) |
a8ec14d4f
|
57 |
queries[i] = (prandom_u32_state(&rnd) >> 4) % max_endpoint; |
fff3fd8a1
|
58 59 60 61 62 63 64 |
} static int interval_tree_test_init(void) { int i, j; unsigned long results; cycles_t time1, time2, time; |
6da2ec560
|
65 66 |
nodes = kmalloc_array(nnodes, sizeof(struct interval_tree_node), GFP_KERNEL); |
a54dae033
|
67 68 |
if (!nodes) return -ENOMEM; |
6da2ec560
|
69 |
queries = kmalloc_array(nsearches, sizeof(int), GFP_KERNEL); |
a54dae033
|
70 71 72 73 |
if (!queries) { kfree(nodes); return -ENOMEM; } |
fff3fd8a1
|
74 |
printk(KERN_ALERT "interval tree insert/remove"); |
496f2f93b
|
75 |
prandom_seed_state(&rnd, 3141592653589793238ULL); |
fff3fd8a1
|
76 77 78 |
init(); time1 = get_cycles(); |
a54dae033
|
79 80 |
for (i = 0; i < perf_loops; i++) { for (j = 0; j < nnodes; j++) |
fff3fd8a1
|
81 |
interval_tree_insert(nodes + j, &root); |
a54dae033
|
82 |
for (j = 0; j < nnodes; j++) |
fff3fd8a1
|
83 84 85 86 87 |
interval_tree_remove(nodes + j, &root); } time2 = get_cycles(); time = time2 - time1; |
a54dae033
|
88 |
time = div_u64(time, perf_loops); |
fff3fd8a1
|
89 90 91 92 |
printk(" -> %llu cycles ", (unsigned long long)time); printk(KERN_ALERT "interval tree search"); |
a54dae033
|
93 |
for (j = 0; j < nnodes; j++) |
fff3fd8a1
|
94 95 96 97 98 |
interval_tree_insert(nodes + j, &root); time1 = get_cycles(); results = 0; |
a54dae033
|
99 |
for (i = 0; i < search_loops; i++) |
c46ecce43
|
100 101 102 103 104 105 |
for (j = 0; j < nsearches; j++) { unsigned long start = search_all ? 0 : queries[j]; unsigned long last = search_all ? max_endpoint : queries[j]; results += search(&root, start, last); } |
fff3fd8a1
|
106 107 108 |
time2 = get_cycles(); time = time2 - time1; |
a54dae033
|
109 110 |
time = div_u64(time, search_loops); results = div_u64(results, search_loops); |
fff3fd8a1
|
111 112 113 |
printk(" -> %llu cycles (%lu results) ", (unsigned long long)time, results); |
a54dae033
|
114 115 |
kfree(queries); kfree(nodes); |
fff3fd8a1
|
116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 |
return -EAGAIN; /* Fail will directly unload the module */ } static void interval_tree_test_exit(void) { printk(KERN_ALERT "test exit "); } module_init(interval_tree_test_init) module_exit(interval_tree_test_exit) MODULE_LICENSE("GPL"); MODULE_AUTHOR("Michel Lespinasse"); MODULE_DESCRIPTION("Interval Tree test"); |