14 __param(int, nnodes, 100, "Number of nodes in the interval tree");
19 __param(bool, search_all, false, "Searches will iterate all nodes in the tree");
24 static struct interval_tree_node *nodes = NULL;  variable
49 		nodes[i].start = a;  in init()
50 		nodes[i].last = b;  in init()
68 	nodes = kmalloc_array(nnodes, sizeof(struct interval_tree_node),  in interval_tree_test_init()
70 	if (!nodes)  in interval_tree_test_init()
75 		kfree(nodes);  in interval_tree_test_init()
88 			interval_tree_insert(nodes + j, &root);  in interval_tree_test_init()
90 			interval_tree_remove(nodes + j, &root);  in interval_tree_test_init()
102 		interval_tree_insert(nodes + j, &root);  in interval_tree_test_init()
124 	kfree(nodes);  in interval_tree_test_init()