Lines Matching full:nodes
16 __param(int, nnodes, 100, "Number of nodes in the interval tree");
21 __param(bool, search_all, false, "Searches will iterate all nodes in the tree");
27 static struct interval_tree_node *nodes = NULL; variable
52 nodes[i].start = a; in init()
53 nodes[i].last = b; in init()
78 interval_tree_insert(nodes + j, &root); in basic_check()
80 interval_tree_remove(nodes + j, &root); in basic_check()
103 interval_tree_insert(nodes + j, &root); in search_check()
125 interval_tree_remove(nodes + j, &root); in search_check()
157 interval_tree_insert(nodes + j, &root); in intersection_range_check()
170 /* Walk nodes to mark intersection nodes */ in intersection_range_check()
173 node = nodes + j; in intersection_range_check()
179 /* Iterate tree to clear intersection nodes */ in intersection_range_check()
183 bitmap_set(intxn2, node - nodes, 1); in intersection_range_check()
189 interval_tree_remove(nodes + j, &root); in intersection_range_check()
256 interval_tree_insert(nodes + j, &root); in span_iteration_check()
263 WARN_ON_ONCE(mtree_store_range(&tree, nodes[j].start, in span_iteration_check()
264 nodes[j].last, nodes + j, GFP_KERNEL)); in span_iteration_check()
304 interval_tree_remove(nodes + j, &root); in span_iteration_check()
314 nodes = kmalloc_array(nnodes, sizeof(struct interval_tree_node), in interval_tree_test_init()
316 if (!nodes) in interval_tree_test_init()
321 kfree(nodes); in interval_tree_test_init()
333 kfree(nodes); in interval_tree_test_init()