09c434b8a0047 (Thomas Gleixner 2019-05-19 13:08:20 +0100 1) // SPDX-License-Identifier: GPL-2.0-only
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 2) #include <linux/module.h>
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 3) #include <linux/moduleparam.h>
9c079add0d0f4 (Michel Lespinasse 2012-10-08 16:31:33 -0700 4) #include <linux/rbtree_augmented.h>
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 5) #include <linux/random.h>
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 6) #include <linux/slab.h>
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 7) #include <asm/timex.h>
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 8)
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 9) #define __param(type, name, init, msg) \
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 10) static type name = init; \
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 11) module_param(name, type, 0444); \
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 12) MODULE_PARM_DESC(name, msg);
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 13)
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 14) __param(int, nnodes, 100, "Number of nodes in the rb-tree");
0b548e33e6cb2 (Davidlohr Bueso 2017-11-17 15:28:27 -0800 15) __param(int, perf_loops, 1000, "Number of iterations modifying the rb-tree");
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 16) __param(int, check_loops, 100, "Number of iterations modifying and verifying the rb-tree");
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 17)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 18) struct test_node {
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 19) u32 key;
dbf128cbf9b90 (Cody P Schafer 2014-01-23 15:56:05 -0800 20) struct rb_node rb;
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 21)
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 22) /* following fields used for testing augmented rbtree functionality */
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 23) u32 val;
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 24) u32 augmented;
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 25) };
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 26)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 27) static struct rb_root_cached root = RB_ROOT_CACHED;
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 28) static struct test_node *nodes = NULL;
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 29)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 30) static struct rnd_state rnd;
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 31)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 32) static void insert(struct test_node *node, struct rb_root_cached *root)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 33) {
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 34) struct rb_node **new = &root->rb_root.rb_node, *parent = NULL;
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 35) u32 key = node->key;
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 36)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 37) while (*new) {
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 38) parent = *new;
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 39) if (key < rb_entry(parent, struct test_node, rb)->key)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 40) new = &parent->rb_left;
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 41) else
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 42) new = &parent->rb_right;
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 43) }
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 44)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 45) rb_link_node(&node->rb, parent, new);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 46) rb_insert_color(&node->rb, &root->rb_root);
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 47) }
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 48)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 49) static void insert_cached(struct test_node *node, struct rb_root_cached *root)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 50) {
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 51) struct rb_node **new = &root->rb_root.rb_node, *parent = NULL;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 52) u32 key = node->key;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 53) bool leftmost = true;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 54)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 55) while (*new) {
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 56) parent = *new;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 57) if (key < rb_entry(parent, struct test_node, rb)->key)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 58) new = &parent->rb_left;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 59) else {
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 60) new = &parent->rb_right;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 61) leftmost = false;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 62) }
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 63) }
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 64)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 65) rb_link_node(&node->rb, parent, new);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 66) rb_insert_color_cached(&node->rb, root, leftmost);
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 67) }
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 68)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 69) static inline void erase(struct test_node *node, struct rb_root_cached *root)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 70) {
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 71) rb_erase(&node->rb, &root->rb_root);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 72) }
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 73)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 74) static inline void erase_cached(struct test_node *node, struct rb_root_cached *root)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 75) {
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 76) rb_erase_cached(&node->rb, root);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 77) }
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 78)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 79)
315cc066b8ae8 (Michel Lespinasse 2019-09-25 16:46:07 -0700 80) #define NODE_VAL(node) ((node)->val)
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 81)
315cc066b8ae8 (Michel Lespinasse 2019-09-25 16:46:07 -0700 82) RB_DECLARE_CALLBACKS_MAX(static, augment_callbacks,
315cc066b8ae8 (Michel Lespinasse 2019-09-25 16:46:07 -0700 83) struct test_node, rb, u32, augmented, NODE_VAL)
14b94af0b251a (Michel Lespinasse 2012-10-08 16:31:17 -0700 84)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 85) static void insert_augmented(struct test_node *node,
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 86) struct rb_root_cached *root)
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 87) {
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 88) struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL;
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 89) u32 key = node->key;
14b94af0b251a (Michel Lespinasse 2012-10-08 16:31:17 -0700 90) u32 val = node->val;
14b94af0b251a (Michel Lespinasse 2012-10-08 16:31:17 -0700 91) struct test_node *parent;
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 92)
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 93) while (*new) {
14b94af0b251a (Michel Lespinasse 2012-10-08 16:31:17 -0700 94) rb_parent = *new;
14b94af0b251a (Michel Lespinasse 2012-10-08 16:31:17 -0700 95) parent = rb_entry(rb_parent, struct test_node, rb);
14b94af0b251a (Michel Lespinasse 2012-10-08 16:31:17 -0700 96) if (parent->augmented < val)
14b94af0b251a (Michel Lespinasse 2012-10-08 16:31:17 -0700 97) parent->augmented = val;
14b94af0b251a (Michel Lespinasse 2012-10-08 16:31:17 -0700 98) if (key < parent->key)
14b94af0b251a (Michel Lespinasse 2012-10-08 16:31:17 -0700 99) new = &parent->rb.rb_left;
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 100) else
14b94af0b251a (Michel Lespinasse 2012-10-08 16:31:17 -0700 101) new = &parent->rb.rb_right;
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 102) }
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 103)
14b94af0b251a (Michel Lespinasse 2012-10-08 16:31:17 -0700 104) node->augmented = val;
14b94af0b251a (Michel Lespinasse 2012-10-08 16:31:17 -0700 105) rb_link_node(&node->rb, rb_parent, new);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 106) rb_insert_augmented(&node->rb, &root->rb_root, &augment_callbacks);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 107) }
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 108)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 109) static void insert_augmented_cached(struct test_node *node,
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 110) struct rb_root_cached *root)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 111) {
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 112) struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 113) u32 key = node->key;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 114) u32 val = node->val;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 115) struct test_node *parent;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 116) bool leftmost = true;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 117)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 118) while (*new) {
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 119) rb_parent = *new;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 120) parent = rb_entry(rb_parent, struct test_node, rb);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 121) if (parent->augmented < val)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 122) parent->augmented = val;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 123) if (key < parent->key)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 124) new = &parent->rb.rb_left;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 125) else {
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 126) new = &parent->rb.rb_right;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 127) leftmost = false;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 128) }
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 129) }
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 130)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 131) node->augmented = val;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 132) rb_link_node(&node->rb, rb_parent, new);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 133) rb_insert_augmented_cached(&node->rb, root,
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 134) leftmost, &augment_callbacks);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 135) }
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 136)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 137)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 138) static void erase_augmented(struct test_node *node, struct rb_root_cached *root)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 139) {
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 140) rb_erase_augmented(&node->rb, &root->rb_root, &augment_callbacks);
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 141) }
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 142)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 143) static void erase_augmented_cached(struct test_node *node,
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 144) struct rb_root_cached *root)
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 145) {
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 146) rb_erase_augmented_cached(&node->rb, root, &augment_callbacks);
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 147) }
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 148)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 149) static void init(void)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 150) {
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 151) int i;
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 152) for (i = 0; i < nnodes; i++) {
496f2f93b1cc2 (Akinobu Mita 2012-12-17 16:04:23 -0800 153) nodes[i].key = prandom_u32_state(&rnd);
496f2f93b1cc2 (Akinobu Mita 2012-12-17 16:04:23 -0800 154) nodes[i].val = prandom_u32_state(&rnd);
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 155) }
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 156) }
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 157)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 158) static bool is_red(struct rb_node *rb)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 159) {
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 160) return !(rb->__rb_parent_color & 1);
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 161) }
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 162)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 163) static int black_path_count(struct rb_node *rb)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 164) {
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 165) int count;
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 166) for (count = 0; rb; rb = rb_parent(rb))
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 167) count += !is_red(rb);
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 168) return count;
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 169) }
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 170)
964fe94d71b77 (Cody P Schafer 2014-01-23 15:56:06 -0800 171) static void check_postorder_foreach(int nr_nodes)
964fe94d71b77 (Cody P Schafer 2014-01-23 15:56:06 -0800 172) {
964fe94d71b77 (Cody P Schafer 2014-01-23 15:56:06 -0800 173) struct test_node *cur, *n;
964fe94d71b77 (Cody P Schafer 2014-01-23 15:56:06 -0800 174) int count = 0;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 175) rbtree_postorder_for_each_entry_safe(cur, n, &root.rb_root, rb)
964fe94d71b77 (Cody P Schafer 2014-01-23 15:56:06 -0800 176) count++;
964fe94d71b77 (Cody P Schafer 2014-01-23 15:56:06 -0800 177)
964fe94d71b77 (Cody P Schafer 2014-01-23 15:56:06 -0800 178) WARN_ON_ONCE(count != nr_nodes);
964fe94d71b77 (Cody P Schafer 2014-01-23 15:56:06 -0800 179) }
964fe94d71b77 (Cody P Schafer 2014-01-23 15:56:06 -0800 180)
a791a62fdf288 (Cody P Schafer 2013-09-11 14:25:17 -0700 181) static void check_postorder(int nr_nodes)
a791a62fdf288 (Cody P Schafer 2013-09-11 14:25:17 -0700 182) {
a791a62fdf288 (Cody P Schafer 2013-09-11 14:25:17 -0700 183) struct rb_node *rb;
a791a62fdf288 (Cody P Schafer 2013-09-11 14:25:17 -0700 184) int count = 0;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 185) for (rb = rb_first_postorder(&root.rb_root); rb; rb = rb_next_postorder(rb))
a791a62fdf288 (Cody P Schafer 2013-09-11 14:25:17 -0700 186) count++;
a791a62fdf288 (Cody P Schafer 2013-09-11 14:25:17 -0700 187)
a791a62fdf288 (Cody P Schafer 2013-09-11 14:25:17 -0700 188) WARN_ON_ONCE(count != nr_nodes);
a791a62fdf288 (Cody P Schafer 2013-09-11 14:25:17 -0700 189) }
a791a62fdf288 (Cody P Schafer 2013-09-11 14:25:17 -0700 190)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 191) static void check(int nr_nodes)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 192) {
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 193) struct rb_node *rb;
4130f0efbfe5a (Davidlohr Bueso 2013-04-30 15:28:24 -0700 194) int count = 0, blacks = 0;
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 195) u32 prev_key = 0;
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 196)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 197) for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) {
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 198) struct test_node *node = rb_entry(rb, struct test_node, rb);
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 199) WARN_ON_ONCE(node->key < prev_key);
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 200) WARN_ON_ONCE(is_red(rb) &&
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 201) (!rb_parent(rb) || is_red(rb_parent(rb))));
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 202) if (!count)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 203) blacks = black_path_count(rb);
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 204) else
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 205) WARN_ON_ONCE((!rb->rb_left || !rb->rb_right) &&
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 206) blacks != black_path_count(rb));
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 207) prev_key = node->key;
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 208) count++;
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 209) }
4130f0efbfe5a (Davidlohr Bueso 2013-04-30 15:28:24 -0700 210)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 211) WARN_ON_ONCE(count != nr_nodes);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 212) WARN_ON_ONCE(count < (1 << black_path_count(rb_last(&root.rb_root))) - 1);
a791a62fdf288 (Cody P Schafer 2013-09-11 14:25:17 -0700 213)
a791a62fdf288 (Cody P Schafer 2013-09-11 14:25:17 -0700 214) check_postorder(nr_nodes);
964fe94d71b77 (Cody P Schafer 2014-01-23 15:56:06 -0800 215) check_postorder_foreach(nr_nodes);
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 216) }
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 217)
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 218) static void check_augmented(int nr_nodes)
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 219) {
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 220) struct rb_node *rb;
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 221)
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 222) check(nr_nodes);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 223) for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) {
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 224) struct test_node *node = rb_entry(rb, struct test_node, rb);
315cc066b8ae8 (Michel Lespinasse 2019-09-25 16:46:07 -0700 225) u32 subtree, max = node->val;
315cc066b8ae8 (Michel Lespinasse 2019-09-25 16:46:07 -0700 226) if (node->rb.rb_left) {
315cc066b8ae8 (Michel Lespinasse 2019-09-25 16:46:07 -0700 227) subtree = rb_entry(node->rb.rb_left, struct test_node,
315cc066b8ae8 (Michel Lespinasse 2019-09-25 16:46:07 -0700 228) rb)->augmented;
315cc066b8ae8 (Michel Lespinasse 2019-09-25 16:46:07 -0700 229) if (max < subtree)
315cc066b8ae8 (Michel Lespinasse 2019-09-25 16:46:07 -0700 230) max = subtree;
315cc066b8ae8 (Michel Lespinasse 2019-09-25 16:46:07 -0700 231) }
315cc066b8ae8 (Michel Lespinasse 2019-09-25 16:46:07 -0700 232) if (node->rb.rb_right) {
315cc066b8ae8 (Michel Lespinasse 2019-09-25 16:46:07 -0700 233) subtree = rb_entry(node->rb.rb_right, struct test_node,
315cc066b8ae8 (Michel Lespinasse 2019-09-25 16:46:07 -0700 234) rb)->augmented;
315cc066b8ae8 (Michel Lespinasse 2019-09-25 16:46:07 -0700 235) if (max < subtree)
315cc066b8ae8 (Michel Lespinasse 2019-09-25 16:46:07 -0700 236) max = subtree;
315cc066b8ae8 (Michel Lespinasse 2019-09-25 16:46:07 -0700 237) }
315cc066b8ae8 (Michel Lespinasse 2019-09-25 16:46:07 -0700 238) WARN_ON_ONCE(node->augmented != max);
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 239) }
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 240) }
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 241)
c75aaa8ed03eb (Davidlohr Bueso 2013-04-30 15:28:25 -0700 242) static int __init rbtree_test_init(void)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 243) {
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 244) int i, j;
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 245) cycles_t time1, time2, time;
977bd8d5e1e61 (Davidlohr Bueso 2017-09-08 16:14:49 -0700 246) struct rb_node *node;
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 247)
6da2ec56059c3 (Kees Cook 2018-06-12 13:55:00 -0700 248) nodes = kmalloc_array(nnodes, sizeof(*nodes), GFP_KERNEL);
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 249) if (!nodes)
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 250) return -ENOMEM;
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 251)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 252) printk(KERN_ALERT "rbtree testing");
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 253)
496f2f93b1cc2 (Akinobu Mita 2012-12-17 16:04:23 -0800 254) prandom_seed_state(&rnd, 3141592653589793238ULL);
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 255) init();
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 256)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 257) time1 = get_cycles();
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 258)
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 259) for (i = 0; i < perf_loops; i++) {
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 260) for (j = 0; j < nnodes; j++)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 261) insert(nodes + j, &root);
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 262) for (j = 0; j < nnodes; j++)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 263) erase(nodes + j, &root);
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 264) }
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 265)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 266) time2 = get_cycles();
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 267) time = time2 - time1;
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 268)
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 269) time = div_u64(time, perf_loops);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 270) printk(" -> test 1 (latency of nnodes insert+delete): %llu cycles\n",
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 271) (unsigned long long)time);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 272)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 273) time1 = get_cycles();
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 274)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 275) for (i = 0; i < perf_loops; i++) {
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 276) for (j = 0; j < nnodes; j++)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 277) insert_cached(nodes + j, &root);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 278) for (j = 0; j < nnodes; j++)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 279) erase_cached(nodes + j, &root);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 280) }
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 281)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 282) time2 = get_cycles();
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 283) time = time2 - time1;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 284)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 285) time = div_u64(time, perf_loops);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 286) printk(" -> test 2 (latency of nnodes cached insert+delete): %llu cycles\n",
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 287) (unsigned long long)time);
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 288)
977bd8d5e1e61 (Davidlohr Bueso 2017-09-08 16:14:49 -0700 289) for (i = 0; i < nnodes; i++)
977bd8d5e1e61 (Davidlohr Bueso 2017-09-08 16:14:49 -0700 290) insert(nodes + i, &root);
977bd8d5e1e61 (Davidlohr Bueso 2017-09-08 16:14:49 -0700 291)
977bd8d5e1e61 (Davidlohr Bueso 2017-09-08 16:14:49 -0700 292) time1 = get_cycles();
977bd8d5e1e61 (Davidlohr Bueso 2017-09-08 16:14:49 -0700 293)
977bd8d5e1e61 (Davidlohr Bueso 2017-09-08 16:14:49 -0700 294) for (i = 0; i < perf_loops; i++) {
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 295) for (node = rb_first(&root.rb_root); node; node = rb_next(node))
977bd8d5e1e61 (Davidlohr Bueso 2017-09-08 16:14:49 -0700 296) ;
977bd8d5e1e61 (Davidlohr Bueso 2017-09-08 16:14:49 -0700 297) }
977bd8d5e1e61 (Davidlohr Bueso 2017-09-08 16:14:49 -0700 298)
977bd8d5e1e61 (Davidlohr Bueso 2017-09-08 16:14:49 -0700 299) time2 = get_cycles();
977bd8d5e1e61 (Davidlohr Bueso 2017-09-08 16:14:49 -0700 300) time = time2 - time1;
977bd8d5e1e61 (Davidlohr Bueso 2017-09-08 16:14:49 -0700 301)
977bd8d5e1e61 (Davidlohr Bueso 2017-09-08 16:14:49 -0700 302) time = div_u64(time, perf_loops);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 303) printk(" -> test 3 (latency of inorder traversal): %llu cycles\n",
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 304) (unsigned long long)time);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 305)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 306) time1 = get_cycles();
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 307)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 308) for (i = 0; i < perf_loops; i++)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 309) node = rb_first(&root.rb_root);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 310)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 311) time2 = get_cycles();
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 312) time = time2 - time1;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 313)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 314) time = div_u64(time, perf_loops);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 315) printk(" -> test 4 (latency to fetch first node)\n");
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 316) printk(" non-cached: %llu cycles\n", (unsigned long long)time);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 317)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 318) time1 = get_cycles();
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 319)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 320) for (i = 0; i < perf_loops; i++)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 321) node = rb_first_cached(&root);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 322)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 323) time2 = get_cycles();
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 324) time = time2 - time1;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 325)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 326) time = div_u64(time, perf_loops);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 327) printk(" cached: %llu cycles\n", (unsigned long long)time);
977bd8d5e1e61 (Davidlohr Bueso 2017-09-08 16:14:49 -0700 328)
977bd8d5e1e61 (Davidlohr Bueso 2017-09-08 16:14:49 -0700 329) for (i = 0; i < nnodes; i++)
977bd8d5e1e61 (Davidlohr Bueso 2017-09-08 16:14:49 -0700 330) erase(nodes + i, &root);
977bd8d5e1e61 (Davidlohr Bueso 2017-09-08 16:14:49 -0700 331)
977bd8d5e1e61 (Davidlohr Bueso 2017-09-08 16:14:49 -0700 332) /* run checks */
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 333) for (i = 0; i < check_loops; i++) {
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 334) init();
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 335) for (j = 0; j < nnodes; j++) {
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 336) check(j);
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 337) insert(nodes + j, &root);
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 338) }
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 339) for (j = 0; j < nnodes; j++) {
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 340) check(nnodes - j);
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 341) erase(nodes + j, &root);
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 342) }
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 343) check(0);
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 344) }
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 345)
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 346) printk(KERN_ALERT "augmented rbtree testing");
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 347)
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 348) init();
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 349)
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 350) time1 = get_cycles();
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 351)
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 352) for (i = 0; i < perf_loops; i++) {
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 353) for (j = 0; j < nnodes; j++)
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 354) insert_augmented(nodes + j, &root);
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 355) for (j = 0; j < nnodes; j++)
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 356) erase_augmented(nodes + j, &root);
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 357) }
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 358)
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 359) time2 = get_cycles();
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 360) time = time2 - time1;
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 361)
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 362) time = div_u64(time, perf_loops);
977bd8d5e1e61 (Davidlohr Bueso 2017-09-08 16:14:49 -0700 363) printk(" -> test 1 (latency of nnodes insert+delete): %llu cycles\n", (unsigned long long)time);
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 364)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 365) time1 = get_cycles();
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 366)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 367) for (i = 0; i < perf_loops; i++) {
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 368) for (j = 0; j < nnodes; j++)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 369) insert_augmented_cached(nodes + j, &root);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 370) for (j = 0; j < nnodes; j++)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 371) erase_augmented_cached(nodes + j, &root);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 372) }
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 373)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 374) time2 = get_cycles();
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 375) time = time2 - time1;
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 376)
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 377) time = div_u64(time, perf_loops);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 378) printk(" -> test 2 (latency of nnodes cached insert+delete): %llu cycles\n", (unsigned long long)time);
b10d43f9898e0 (Davidlohr Bueso 2017-09-08 16:14:52 -0700 379)
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 380) for (i = 0; i < check_loops; i++) {
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 381) init();
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 382) for (j = 0; j < nnodes; j++) {
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 383) check_augmented(j);
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 384) insert_augmented(nodes + j, &root);
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 385) }
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 386) for (j = 0; j < nnodes; j++) {
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 387) check_augmented(nnodes - j);
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 388) erase_augmented(nodes + j, &root);
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 389) }
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 390) check_augmented(0);
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 391) }
dadf93534f125 (Michel Lespinasse 2012-10-08 16:31:15 -0700 392)
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 393) kfree(nodes);
223f8911eace6 (Davidlohr Bueso 2017-09-08 16:14:46 -0700 394)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 395) return -EAGAIN; /* Fail will directly unload the module */
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 396) }
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 397)
c75aaa8ed03eb (Davidlohr Bueso 2013-04-30 15:28:25 -0700 398) static void __exit rbtree_test_exit(void)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 399) {
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 400) printk(KERN_ALERT "test exit\n");
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 401) }
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 402)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 403) module_init(rbtree_test_init)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 404) module_exit(rbtree_test_exit)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 405)
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 406) MODULE_LICENSE("GPL");
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 407) MODULE_AUTHOR("Michel Lespinasse");
910a742d4ba86 (Michel Lespinasse 2012-10-08 16:30:39 -0700 408) MODULE_DESCRIPTION("Red Black Tree test");
VisionFive2 Linux kernel
StarFive Tech Linux Kernel for VisionFive (JH7110) boards (mirror)
More than 9999 Commits
32 Branches
54 Tags