Home
last modified time | relevance | path

Searched refs:radix_tree_node (Results 1 – 7 of 7) sorted by relevance

/linux/lib/
A Dradix-tree.c230 static struct radix_tree_node *
236 struct radix_tree_node *ret = NULL; in radix_tree_node_alloc()
290 struct radix_tree_node *node = in radix_tree_node_rcu_free()
323 struct radix_tree_node *node; in __radix_tree_preload()
472 struct radix_tree_node *child; in radix_tree_shrink()
542 struct radix_tree_node *node) in delete_node()
547 struct radix_tree_node *parent; in delete_node()
704 struct radix_tree_node *node; in radix_tree_insert()
937 struct radix_tree_node *node, in node_tag_set()
994 struct radix_tree_node *node, in node_tag_clear()
[all …]
A Didr.c292 struct radix_tree_node *node; in idr_replace()
/linux/include/linux/
A Dradix-tree.h26 #define radix_tree_node xa_node macro
32 struct radix_tree_node *nodes;
110 struct radix_tree_node *node;
222 struct radix_tree_node **nodep, void __rcu ***slotp);
226 void __radix_tree_replace(struct radix_tree_root *, struct radix_tree_node *,
/linux/tools/testing/radix-tree/
A Dtest.h53 struct radix_tree_node *entry_to_node(void *ptr);
56 unsigned long node_maxindex(struct radix_tree_node *);
A Dlinux.c38 struct radix_tree_node *node = cachep->objs; in kmem_cache_alloc()
73 struct radix_tree_node *node = objp; in kmem_cache_free()
A Dtest.c199 static int verify_node(struct radix_tree_node *slot, unsigned int tag, in verify_node()
249 struct radix_tree_node *node = root->xa_head; in verify_tag_consistency()
273 struct radix_tree_node *node = root->xa_head; in tree_verify_min_height()
/linux/tools/testing/radix-tree/linux/
A Dradix-tree.h15 offsetof(struct radix_tree_node, rcu_head)); in trace_call_rcu()

Completed in 24 milliseconds