Blame view
lib/rbtree_test.c
5.55 KB
910a742d4 rbtree: performan... |
1 |
#include <linux/module.h> |
9c079add0 rbtree: move augm... |
2 |
#include <linux/rbtree_augmented.h> |
910a742d4 rbtree: performan... |
3 4 5 6 7 8 9 10 |
#include <linux/random.h> #include <asm/timex.h> #define NODES 100 #define PERF_LOOPS 100000 #define CHECK_LOOPS 100 struct test_node { |
910a742d4 rbtree: performan... |
11 |
u32 key; |
dbf128cbf rbtree/test: move... |
12 |
struct rb_node rb; |
dadf93534 rbtree: augmented... |
13 14 15 16 |
/* following fields used for testing augmented rbtree functionality */ u32 val; u32 augmented; |
910a742d4 rbtree: performan... |
17 18 19 20 21 22 23 24 25 26 |
}; static struct rb_root root = RB_ROOT; static struct test_node nodes[NODES]; static struct rnd_state rnd; static void insert(struct test_node *node, struct rb_root *root) { struct rb_node **new = &root->rb_node, *parent = NULL; |
dadf93534 rbtree: augmented... |
27 |
u32 key = node->key; |
910a742d4 rbtree: performan... |
28 29 30 |
while (*new) { parent = *new; |
dadf93534 rbtree: augmented... |
31 |
if (key < rb_entry(parent, struct test_node, rb)->key) |
910a742d4 rbtree: performan... |
32 33 34 35 36 37 38 39 40 41 42 43 44 |
new = &parent->rb_left; else new = &parent->rb_right; } rb_link_node(&node->rb, parent, new); rb_insert_color(&node->rb, root); } static inline void erase(struct test_node *node, struct rb_root *root) { rb_erase(&node->rb, root); } |
dadf93534 rbtree: augmented... |
45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 |
static inline u32 augment_recompute(struct test_node *node) { u32 max = node->val, child_augmented; if (node->rb.rb_left) { child_augmented = rb_entry(node->rb.rb_left, struct test_node, rb)->augmented; if (max < child_augmented) max = child_augmented; } if (node->rb.rb_right) { child_augmented = rb_entry(node->rb.rb_right, struct test_node, rb)->augmented; if (max < child_augmented) max = child_augmented; } return max; } |
3908836aa rbtree: add RB_DE... |
62 63 |
RB_DECLARE_CALLBACKS(static, augment_callbacks, struct test_node, rb, u32, augmented, augment_recompute) |
14b94af0b rbtree: faster au... |
64 |
|
dadf93534 rbtree: augmented... |
65 66 |
static void insert_augmented(struct test_node *node, struct rb_root *root) { |
14b94af0b rbtree: faster au... |
67 |
struct rb_node **new = &root->rb_node, *rb_parent = NULL; |
dadf93534 rbtree: augmented... |
68 |
u32 key = node->key; |
14b94af0b rbtree: faster au... |
69 70 |
u32 val = node->val; struct test_node *parent; |
dadf93534 rbtree: augmented... |
71 72 |
while (*new) { |
14b94af0b rbtree: faster au... |
73 74 75 76 77 78 |
rb_parent = *new; parent = rb_entry(rb_parent, struct test_node, rb); if (parent->augmented < val) parent->augmented = val; if (key < parent->key) new = &parent->rb.rb_left; |
dadf93534 rbtree: augmented... |
79 |
else |
14b94af0b rbtree: faster au... |
80 |
new = &parent->rb.rb_right; |
dadf93534 rbtree: augmented... |
81 |
} |
14b94af0b rbtree: faster au... |
82 83 84 |
node->augmented = val; rb_link_node(&node->rb, rb_parent, new); rb_insert_augmented(&node->rb, root, &augment_callbacks); |
dadf93534 rbtree: augmented... |
85 86 87 88 |
} static void erase_augmented(struct test_node *node, struct rb_root *root) { |
14b94af0b rbtree: faster au... |
89 |
rb_erase_augmented(&node->rb, root, &augment_callbacks); |
dadf93534 rbtree: augmented... |
90 |
} |
910a742d4 rbtree: performan... |
91 92 93 |
static void init(void) { int i; |
dadf93534 rbtree: augmented... |
94 |
for (i = 0; i < NODES; i++) { |
496f2f93b random32: rename ... |
95 96 |
nodes[i].key = prandom_u32_state(&rnd); nodes[i].val = prandom_u32_state(&rnd); |
dadf93534 rbtree: augmented... |
97 |
} |
910a742d4 rbtree: performan... |
98 99 100 101 102 103 104 105 106 107 108 109 110 111 |
} static bool is_red(struct rb_node *rb) { return !(rb->__rb_parent_color & 1); } static int black_path_count(struct rb_node *rb) { int count; for (count = 0; rb; rb = rb_parent(rb)) count += !is_red(rb); return count; } |
964fe94d7 rbtree/test: test... |
112 113 114 115 116 117 118 119 120 |
static void check_postorder_foreach(int nr_nodes) { struct test_node *cur, *n; int count = 0; rbtree_postorder_for_each_entry_safe(cur, n, &root, rb) count++; WARN_ON_ONCE(count != nr_nodes); } |
a791a62fd rbtree_test: add ... |
121 122 123 124 125 126 127 128 129 |
static void check_postorder(int nr_nodes) { struct rb_node *rb; int count = 0; for (rb = rb_first_postorder(&root); rb; rb = rb_next_postorder(rb)) count++; WARN_ON_ONCE(count != nr_nodes); } |
910a742d4 rbtree: performan... |
130 131 132 |
static void check(int nr_nodes) { struct rb_node *rb; |
4130f0efb rbtree_test: add ... |
133 |
int count = 0, blacks = 0; |
910a742d4 rbtree: performan... |
134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 |
u32 prev_key = 0; for (rb = rb_first(&root); rb; rb = rb_next(rb)) { struct test_node *node = rb_entry(rb, struct test_node, rb); WARN_ON_ONCE(node->key < prev_key); WARN_ON_ONCE(is_red(rb) && (!rb_parent(rb) || is_red(rb_parent(rb)))); if (!count) blacks = black_path_count(rb); else WARN_ON_ONCE((!rb->rb_left || !rb->rb_right) && blacks != black_path_count(rb)); prev_key = node->key; count++; } |
4130f0efb rbtree_test: add ... |
149 |
|
910a742d4 rbtree: performan... |
150 |
WARN_ON_ONCE(count != nr_nodes); |
4130f0efb rbtree_test: add ... |
151 |
WARN_ON_ONCE(count < (1 << black_path_count(rb_last(&root))) - 1); |
a791a62fd rbtree_test: add ... |
152 153 |
check_postorder(nr_nodes); |
964fe94d7 rbtree/test: test... |
154 |
check_postorder_foreach(nr_nodes); |
910a742d4 rbtree: performan... |
155 |
} |
dadf93534 rbtree: augmented... |
156 157 158 159 160 161 162 163 164 165 |
static void check_augmented(int nr_nodes) { struct rb_node *rb; check(nr_nodes); for (rb = rb_first(&root); rb; rb = rb_next(rb)) { struct test_node *node = rb_entry(rb, struct test_node, rb); WARN_ON_ONCE(node->augmented != augment_recompute(node)); } } |
c75aaa8ed rbtree_test: add ... |
166 |
static int __init rbtree_test_init(void) |
910a742d4 rbtree: performan... |
167 168 169 170 171 |
{ int i, j; cycles_t time1, time2, time; printk(KERN_ALERT "rbtree testing"); |
496f2f93b random32: rename ... |
172 |
prandom_seed_state(&rnd, 3141592653589793238ULL); |
910a742d4 rbtree: performan... |
173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 |
init(); time1 = get_cycles(); for (i = 0; i < PERF_LOOPS; i++) { for (j = 0; j < NODES; j++) insert(nodes + j, &root); for (j = 0; j < NODES; j++) erase(nodes + j, &root); } time2 = get_cycles(); time = time2 - time1; time = div_u64(time, PERF_LOOPS); printk(" -> %llu cycles ", (unsigned long long)time); for (i = 0; i < CHECK_LOOPS; i++) { init(); for (j = 0; j < NODES; j++) { check(j); insert(nodes + j, &root); } for (j = 0; j < NODES; j++) { check(NODES - j); erase(nodes + j, &root); } check(0); } |
dadf93534 rbtree: augmented... |
203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 |
printk(KERN_ALERT "augmented rbtree testing"); init(); time1 = get_cycles(); for (i = 0; i < PERF_LOOPS; i++) { for (j = 0; j < NODES; j++) insert_augmented(nodes + j, &root); for (j = 0; j < NODES; j++) erase_augmented(nodes + j, &root); } time2 = get_cycles(); time = time2 - time1; time = div_u64(time, PERF_LOOPS); printk(" -> %llu cycles ", (unsigned long long)time); for (i = 0; i < CHECK_LOOPS; i++) { init(); for (j = 0; j < NODES; j++) { check_augmented(j); insert_augmented(nodes + j, &root); } for (j = 0; j < NODES; j++) { check_augmented(NODES - j); erase_augmented(nodes + j, &root); } check_augmented(0); } |
910a742d4 rbtree: performan... |
235 236 |
return -EAGAIN; /* Fail will directly unload the module */ } |
c75aaa8ed rbtree_test: add ... |
237 |
static void __exit rbtree_test_exit(void) |
910a742d4 rbtree: performan... |
238 239 240 241 242 243 244 245 246 247 248 |
{ printk(KERN_ALERT "test exit "); } module_init(rbtree_test_init) module_exit(rbtree_test_exit) MODULE_LICENSE("GPL"); MODULE_AUTHOR("Michel Lespinasse"); MODULE_DESCRIPTION("Red Black Tree test"); |