Home
last modified time | relevance | path

Searched refs:entry_to_node (Results 1 – 3 of 3) sorted by relevance

/linux-6.1.9/lib/
Dradix-tree.c65 static inline struct radix_tree_node *entry_to_node(void *ptr) in entry_to_node() function
394 node = entry_to_node(node); in radix_tree_load_root()
444 entry_to_node(entry)->parent = node; in radix_tree_extend()
476 node = entry_to_node(node); in radix_tree_shrink()
497 entry_to_node(child)->parent = NULL; in radix_tree_shrink()
633 node = entry_to_node(child); in __radix_tree_create()
657 struct radix_tree_node *child = entry_to_node(node); in radix_tree_free_nodes()
662 child = entry_to_node(entry); in radix_tree_free_nodes()
673 if (old == entry_to_node(node)) in radix_tree_free_nodes()
763 parent = entry_to_node(node); in __radix_tree_lookup()
[all …]
/linux-6.1.9/tools/testing/radix-tree/
Dtest.c206 slot = entry_to_node(slot); in verify_node()
279 node = entry_to_node(node); in tree_verify_min_height()
Dtest.h53 struct radix_tree_node *entry_to_node(void *ptr);