13 __param(int, nnodes, 100, "Number of nodes in the interval tree");
18 __param(bool, search_all, false, "Searches will iterate all nodes in the tree");
23 static struct interval_tree_node *nodes = NULL;  variable
48 		nodes[i].start = a;  in init()
49 		nodes[i].last = b;  in init()
67 	nodes = kmalloc_array(nnodes, sizeof(struct interval_tree_node),  in interval_tree_test_init()
69 	if (!nodes)  in interval_tree_test_init()
74 		kfree(nodes);  in interval_tree_test_init()
87 			interval_tree_insert(nodes + j, &root);  in interval_tree_test_init()
89 			interval_tree_remove(nodes + j, &root);  in interval_tree_test_init()
101 		interval_tree_insert(nodes + j, &root);  in interval_tree_test_init()
123 	kfree(nodes);  in interval_tree_test_init()