Home
last modified time | relevance | path

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

/lib/
Dinterval_tree_test.c23 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(nnodes * sizeof(struct interval_tree_node), GFP_KERNEL); in interval_tree_test_init()
68 if (!nodes) in interval_tree_test_init()
73 kfree(nodes); in interval_tree_test_init()
86 interval_tree_insert(nodes + j, &root); in interval_tree_test_init()
88 interval_tree_remove(nodes + j, &root); in interval_tree_test_init()
100 interval_tree_insert(nodes + j, &root); in interval_tree_test_init()
122 kfree(nodes); in interval_tree_test_init()
Drbtree_test.c27 static struct test_node *nodes = NULL; variable
106 nodes[i].key = prandom_u32_state(&rnd); in init()
107 nodes[i].val = prandom_u32_state(&rnd); in init()
187 nodes = kmalloc(nnodes * sizeof(*nodes), GFP_KERNEL); in rbtree_test_init()
188 if (!nodes) in rbtree_test_init()
200 insert(nodes + j, &root); in rbtree_test_init()
202 erase(nodes + j, &root); in rbtree_test_init()
215 insert(nodes + j, &root); in rbtree_test_init()
219 erase(nodes + j, &root); in rbtree_test_init()
232 insert_augmented(nodes + j, &root); in rbtree_test_init()
[all …]
Dradix-tree.c69 struct radix_tree_node *nodes; member
201 ret = rtp->nodes; in radix_tree_node_alloc()
202 rtp->nodes = ret->private_data; in radix_tree_node_alloc()
270 node->private_data = rtp->nodes; in __radix_tree_preload()
271 rtp->nodes = node; in __radix_tree_preload()
1485 node = rtp->nodes; in radix_tree_callback()
1486 rtp->nodes = node->private_data; in radix_tree_callback()
DKconfig356 overlapping nodes. The algorithm is implemented as an