Searched refs:entry_to_node (Results 1 – 4 of 4) sorted by relevance
67 static inline struct radix_tree_node *entry_to_node(void *ptr) in entry_to_node() function396 node = entry_to_node(node); in radix_tree_load_root()446 entry_to_node(entry)->parent = node; in radix_tree_extend()478 node = entry_to_node(node); in radix_tree_shrink()499 entry_to_node(child)->parent = NULL; in radix_tree_shrink()635 node = entry_to_node(child); in __radix_tree_create()659 struct radix_tree_node *child = entry_to_node(node); in radix_tree_free_nodes()664 child = entry_to_node(entry); in radix_tree_free_nodes()675 if (old == entry_to_node(node)) in radix_tree_free_nodes()765 parent = entry_to_node(node); in __radix_tree_lookup()[all …]
24 def entry_to_node(node): function49 node = entry_to_node(node)
206 slot = entry_to_node(slot); in verify_node()279 node = entry_to_node(node); in tree_verify_min_height()
53 struct radix_tree_node *entry_to_node(void *ptr);