Home
last modified time | relevance | path

Searched refs:nodes (Results 1 – 4 of 4) sorted by relevance

/lib/
Dinterval_tree_test.c12 static struct interval_tree_node nodes[NODES]; variable
36 nodes[i].start = a; in init()
37 nodes[i].last = b; in init()
39 nodes[i].start = b; in init()
40 nodes[i].last = a; in init()
62 interval_tree_insert(nodes + j, &root); in interval_tree_test_init()
64 interval_tree_remove(nodes + j, &root); in interval_tree_test_init()
76 interval_tree_insert(nodes + j, &root); in interval_tree_test_init()
Drbtree_test.c20 static struct test_node nodes[NODES]; variable
99 nodes[i].key = prandom_u32_state(&rnd); in init()
100 nodes[i].val = prandom_u32_state(&rnd); in init()
189 insert(nodes + j, &root); in rbtree_test_init()
191 erase(nodes + j, &root); in rbtree_test_init()
204 insert(nodes + j, &root); in rbtree_test_init()
208 erase(nodes + j, &root); in rbtree_test_init()
221 insert_augmented(nodes + j, &root); in rbtree_test_init()
223 erase_augmented(nodes + j, &root); in rbtree_test_init()
236 insert_augmented(nodes + j, &root); in rbtree_test_init()
[all …]
Dradix-tree.c68 struct radix_tree_node *nodes[RADIX_TREE_PRELOAD_SIZE]; member
200 ret = rtp->nodes[rtp->nr - 1]; in radix_tree_node_alloc()
201 rtp->nodes[rtp->nr - 1] = NULL; in radix_tree_node_alloc()
260 while (rtp->nr < ARRAY_SIZE(rtp->nodes)) { in __radix_tree_preload()
267 if (rtp->nr < ARRAY_SIZE(rtp->nodes)) in __radix_tree_preload()
268 rtp->nodes[rtp->nr++] = node; in __radix_tree_preload()
1480 rtp->nodes[rtp->nr-1]); in radix_tree_callback()
1481 rtp->nodes[rtp->nr-1] = NULL; in radix_tree_callback()
DKconfig342 overlapping nodes. The algorithm is implemented as an