Home
last modified time | relevance | path

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

/linux/lib/
A Dradix-tree.c396 node = entry_to_node(node); in radix_tree_load_root()
478 node = entry_to_node(node); in radix_tree_shrink()
635 node = entry_to_node(child); in __radix_tree_create()
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()
979 parent = entry_to_node(node); in radix_tree_tag_set()
1043 parent = entry_to_node(node); in radix_tree_tag_clear()
1097 parent = entry_to_node(node); in radix_tree_tag_get()
1194 node = entry_to_node(child); in radix_tree_next_chunk()
[all …]
/linux/scripts/gdb/linux/
A Dradixtree.py24 def entry_to_node(node): function
49 node = entry_to_node(node)
/linux/tools/testing/radix-tree/
A Dtest.c206 slot = entry_to_node(slot); in verify_node()
279 node = entry_to_node(node); in tree_verify_min_height()
A Dtest.h53 struct radix_tree_node *entry_to_node(void *ptr);

Completed in 11 milliseconds