Home
last modified time | relevance | path

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

/lib/
Dinterval_tree_test.c24 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()
Drbtree_test.c28 static struct test_node *nodes = NULL; variable
153 nodes[i].key = prandom_u32_state(&rnd); in init()
154 nodes[i].val = prandom_u32_state(&rnd); in init()
248 nodes = kmalloc_array(nnodes, sizeof(*nodes), GFP_KERNEL); in rbtree_test_init()
249 if (!nodes) in rbtree_test_init()
261 insert(nodes + j, &root); in rbtree_test_init()
263 erase(nodes + j, &root); in rbtree_test_init()
277 insert_cached(nodes + j, &root); in rbtree_test_init()
279 erase_cached(nodes + j, &root); in rbtree_test_init()
290 insert(nodes + i, &root); in rbtree_test_init()
[all …]
Dobjagg.c705 struct objagg_tmp_node *nodes; member
737 struct objagg_tmp_node *node = &graph->nodes[index]; in objagg_tmp_graph_node_weight()
748 node = &graph->nodes[j]; in objagg_tmp_graph_node_weight()
765 node = &graph->nodes[i]; in objagg_tmp_graph_node_max_weight()
791 graph->nodes = kcalloc(nodes_count, sizeof(*graph->nodes), GFP_KERNEL); in objagg_tmp_graph_create()
792 if (!graph->nodes) in objagg_tmp_graph_create()
804 node = &graph->nodes[i++]; in objagg_tmp_graph_create()
815 pnode = &graph->nodes[i]; in objagg_tmp_graph_create()
816 node = &graph->nodes[j]; in objagg_tmp_graph_create()
828 kfree(graph->nodes); in objagg_tmp_graph_create()
[all …]
Dradix-tree.c72 struct radix_tree_node *nodes; member
274 ret = rtp->nodes; in radix_tree_node_alloc()
275 rtp->nodes = ret->parent; in radix_tree_node_alloc()
353 node->parent = rtp->nodes; in __radix_tree_preload()
354 rtp->nodes = node; in __radix_tree_preload()
1595 node = rtp->nodes; in radix_tree_cpu_dead()
1596 rtp->nodes = node->parent; in radix_tree_cpu_dead()
DKconfig418 overlapping nodes. The algorithm is implemented as an