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

// SPDX-License-Identifier: GPL-2.0-only
#include <linux/module.h>
#include <linux/moduleparam.h>
#include <linux/interval_tree.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 interval tree");
__param(int, perf_loops, 1000, "Number of iterations modifying the tree");

__param(int, nsearches, 100, "Number of searches to the interval tree");
__param(int, search_loops, 1000, "Number of iterations searching the tree");
__param(bool, search_all, false, "Searches will iterate all nodes in the tree");

__param(uint, max_endpoint, ~0, "Largest value for the interval's endpoint");

static struct rb_root_cached root = RB_ROOT_CACHED;
static struct interval_tree_node *nodes = NULL;
static u32 *queries = NULL;

static struct rnd_state rnd;

static inline unsigned long
search(struct rb_root_cached *root, unsigned long start, unsigned long last)
{
	struct interval_tree_node *node;
	unsigned long results = 0;

	for (node = interval_tree_iter_first(root, start, last); node;
	     node = interval_tree_iter_next(node, start, last))
		results++;
	return results;
}

static void init(void)
{
	int i;

	for (i = 0; i < nnodes; i++) {
		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;
	}

	/*
	 * Limit the search scope to what the user defined.
	 * Otherwise we are merely measuring empty walks,
	 * which is pointless.
	 */
	for (i = 0; i < nsearches; i++)
		queries[i] = (prandom_u32_state(&rnd) >> 4) % max_endpoint;
}

static int interval_tree_test_init(void)
{
	int i, j;
	unsigned long results;
	cycles_t time1, time2, time;

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

	queries = kmalloc_array(nsearches, sizeof(int), GFP_KERNEL);
	if (!queries) {
		kfree(nodes);
		return -ENOMEM;
	}

	printk(KERN_ALERT "interval tree insert/remove");

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

	time1 = get_cycles();

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

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

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

	printk(KERN_ALERT "interval tree search");

	for (j = 0; j < nnodes; j++)
		interval_tree_insert(nodes + j, &root);

	time1 = get_cycles();

	results = 0;
	for (i = 0; i < search_loops; i++)
		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);
		}

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

	time = div_u64(time, search_loops);
	results = div_u64(results, search_loops);
	printk(" -> %llu cycles (%lu results)\n",
	       (unsigned long long)time, results);

	kfree(queries);
	kfree(nodes);

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

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

module_init(interval_tree_test_init)
module_exit(interval_tree_test_exit)

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