[thirdparty/linux.git] / lib / rbtree_test.c

// SPDX-License-Identifier: GPL-2.0-only
#include <linux/module.h>
#include <linux/moduleparam.h>
#include <linux/rbtree_augmented.h>
#include <linux/random.h>
#include <linux/slab.h>
#include <asm/timex.h>

#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 rb-tree");
__param(int, perf_loops, 1000, "Number of iterations modifying the rb-tree");
__param(int, check_loops, 100, "Number of iterations modifying and verifying the rb-tree");

struct test_node {
	u32 key;
	struct rb_node rb;

	/* following fields used for testing augmented rbtree functionality */
	u32 val;
	u32 augmented;
};

static struct rb_root_cached root = RB_ROOT_CACHED;
static struct test_node *nodes = NULL;

static struct rnd_state rnd;

static void insert(struct test_node *node, struct rb_root_cached *root)
{
	struct rb_node **new = &root->rb_root.rb_node, *parent = NULL;
	u32 key = node->key;

	while (*new) {
		parent = *new;
		if (key < rb_entry(parent, struct test_node, rb)->key)
			new = &parent->rb_left;
		else
			new = &parent->rb_right;
	}

	rb_link_node(&node->rb, parent, new);
	rb_insert_color(&node->rb, &root->rb_root);
}

static void insert_cached(struct test_node *node, struct rb_root_cached *root)
{
	struct rb_node **new = &root->rb_root.rb_node, *parent = NULL;
	u32 key = node->key;
	bool leftmost = true;

	while (*new) {
		parent = *new;
		if (key < rb_entry(parent, struct test_node, rb)->key)
			new = &parent->rb_left;
		else {
			new = &parent->rb_right;
			leftmost = false;
		}
	}

	rb_link_node(&node->rb, parent, new);
	rb_insert_color_cached(&node->rb, root, leftmost);
}

static inline void erase(struct test_node *node, struct rb_root_cached *root)
{
	rb_erase(&node->rb, &root->rb_root);
}

static inline void erase_cached(struct test_node *node, struct rb_root_cached *root)
{
	rb_erase_cached(&node->rb, root);
}


#define NODE_VAL(node) ((node)->val)

RB_DECLARE_CALLBACKS_MAX(static, augment_callbacks,
			 struct test_node, rb, u32, augmented, NODE_VAL)

static void insert_augmented(struct test_node *node,
			     struct rb_root_cached *root)
{
	struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL;
	u32 key = node->key;
	u32 val = node->val;
	struct test_node *parent;

	while (*new) {
		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;
		else
			new = &parent->rb.rb_right;
	}

	node->augmented = val;
	rb_link_node(&node->rb, rb_parent, new);
	rb_insert_augmented(&node->rb, &root->rb_root, &augment_callbacks);
}

static void insert_augmented_cached(struct test_node *node,
				    struct rb_root_cached *root)
{
	struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL;
	u32 key = node->key;
	u32 val = node->val;
	struct test_node *parent;
	bool leftmost = true;

	while (*new) {
		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;
		else {
			new = &parent->rb.rb_right;
			leftmost = false;
		}
	}

	node->augmented = val;
	rb_link_node(&node->rb, rb_parent, new);
	rb_insert_augmented_cached(&node->rb, root,
				   leftmost, &augment_callbacks);
}


static void erase_augmented(struct test_node *node, struct rb_root_cached *root)
{
	rb_erase_augmented(&node->rb, &root->rb_root, &augment_callbacks);
}

static void erase_augmented_cached(struct test_node *node,
				   struct rb_root_cached *root)
{
	rb_erase_augmented_cached(&node->rb, root, &augment_callbacks);
}

static void init(void)
{
	int i;
	for (i = 0; i < nnodes; i++) {
		nodes[i].key = prandom_u32_state(&rnd);
		nodes[i].val = prandom_u32_state(&rnd);
	}
}

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;
}

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_root, rb)
		count++;

	WARN_ON_ONCE(count != nr_nodes);
}

static void check_postorder(int nr_nodes)
{
	struct rb_node *rb;
	int count = 0;
	for (rb = rb_first_postorder(&root.rb_root); rb; rb = rb_next_postorder(rb))
		count++;

	WARN_ON_ONCE(count != nr_nodes);
}

static void check(int nr_nodes)
{
	struct rb_node *rb;
	int count = 0, blacks = 0;
	u32 prev_key = 0;

	for (rb = rb_first(&root.rb_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++;
	}

	WARN_ON_ONCE(count != nr_nodes);
	WARN_ON_ONCE(count < (1 << black_path_count(rb_last(&root.rb_root))) - 1);

	check_postorder(nr_nodes);
	check_postorder_foreach(nr_nodes);
}

static void check_augmented(int nr_nodes)
{
	struct rb_node *rb;

	check(nr_nodes);
	for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) {
		struct test_node *node = rb_entry(rb, struct test_node, rb);
		u32 subtree, max = node->val;
		if (node->rb.rb_left) {
			subtree = rb_entry(node->rb.rb_left, struct test_node,
					   rb)->augmented;
			if (max < subtree)
				max = subtree;
		}
		if (node->rb.rb_right) {
			subtree = rb_entry(node->rb.rb_right, struct test_node,
					   rb)->augmented;
			if (max < subtree)
				max = subtree;
		}
		WARN_ON_ONCE(node->augmented != max);
	}
}

static int __init rbtree_test_init(void)
{
	int i, j;
	cycles_t time1, time2, time;
	struct rb_node *node;

	nodes = kmalloc_array(nnodes, sizeof(*nodes), GFP_KERNEL);
	if (!nodes)
		return -ENOMEM;

	printk(KERN_ALERT "rbtree testing");

	prandom_seed_state(&rnd, 3141592653589793238ULL);
	init();

	time1 = get_cycles();

	for (i = 0; i < perf_loops; i++) {
		for (j = 0; j < nnodes; j++)
			insert(nodes + j, &root);
		for (j = 0; j < nnodes; j++)
			erase(nodes + j, &root);
	}

	time2 = get_cycles();
	time = time2 - time1;

	time = div_u64(time, perf_loops);
	printk(" -> test 1 (latency of nnodes insert+delete): %llu cycles\n",
	       (unsigned long long)time);

	time1 = get_cycles();

	for (i = 0; i < perf_loops; i++) {
		for (j = 0; j < nnodes; j++)
			insert_cached(nodes + j, &root);
		for (j = 0; j < nnodes; j++)
			erase_cached(nodes + j, &root);
	}

	time2 = get_cycles();
	time = time2 - time1;

	time = div_u64(time, perf_loops);
	printk(" -> test 2 (latency of nnodes cached insert+delete): %llu cycles\n",
	       (unsigned long long)time);

	for (i = 0; i < nnodes; i++)
		insert(nodes + i, &root);

	time1 = get_cycles();

	for (i = 0; i < perf_loops; i++) {
		for (node = rb_first(&root.rb_root); node; node = rb_next(node))
			;
	}

	time2 = get_cycles();
	time = time2 - time1;

	time = div_u64(time, perf_loops);
	printk(" -> test 3 (latency of inorder traversal): %llu cycles\n",
	       (unsigned long long)time);

	time1 = get_cycles();

	for (i = 0; i < perf_loops; i++)
		node = rb_first(&root.rb_root);

	time2 = get_cycles();
	time = time2 - time1;

	time = div_u64(time, perf_loops);
	printk(" -> test 4 (latency to fetch first node)\n");
	printk("        non-cached: %llu cycles\n", (unsigned long long)time);

	time1 = get_cycles();

	for (i = 0; i < perf_loops; i++)
		node = rb_first_cached(&root);

	time2 = get_cycles();
	time = time2 - time1;

	time = div_u64(time, perf_loops);
	printk("        cached: %llu cycles\n", (unsigned long long)time);

	for (i = 0; i < nnodes; i++)
		erase(nodes + i, &root);

	/* run checks */
	for (i = 0; i < check_loops; i++) {
		init();
		for (j = 0; j < nnodes; j++) {
			check(j);
			insert(nodes + j, &root);
		}
		for (j = 0; j < nnodes; j++) {
			check(nnodes - j);
			erase(nodes + j, &root);
		}
		check(0);
	}

	printk(KERN_ALERT "augmented rbtree testing");

	init();

	time1 = get_cycles();

	for (i = 0; i < perf_loops; i++) {
		for (j = 0; j < nnodes; j++)
			insert_augmented(nodes + j, &root);
		for (j = 0; j < nnodes; j++)
			erase_augmented(nodes + j, &root);
	}

	time2 = get_cycles();
	time = time2 - time1;

	time = div_u64(time, perf_loops);
	printk(" -> test 1 (latency of nnodes insert+delete): %llu cycles\n", (unsigned long long)time);

	time1 = get_cycles();

	for (i = 0; i < perf_loops; i++) {
		for (j = 0; j < nnodes; j++)
			insert_augmented_cached(nodes + j, &root);
		for (j = 0; j < nnodes; j++)
			erase_augmented_cached(nodes + j, &root);
	}

	time2 = get_cycles();
	time = time2 - time1;

	time = div_u64(time, perf_loops);
	printk(" -> test 2 (latency of nnodes cached insert+delete): %llu cycles\n", (unsigned long long)time);

	for (i = 0; i < check_loops; i++) {
		init();
		for (j = 0; j < nnodes; j++) {
			check_augmented(j);
			insert_augmented(nodes + j, &root);
		}
		for (j = 0; j < nnodes; j++) {
			check_augmented(nnodes - j);
			erase_augmented(nodes + j, &root);
		}
		check_augmented(0);
	}

	kfree(nodes);

	return -EAGAIN; /* Fail will directly unload the module */
}

static void __exit rbtree_test_exit(void)
{
	printk(KERN_ALERT "test exit\n");
}

module_init(rbtree_test_init)
module_exit(rbtree_test_exit)

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