Searched refs:radix_tree_is_internal_node (Results 1 – 5 of 5) sorted by relevance
287 BUG_ON(radix_tree_is_internal_node(ret)); in radix_tree_node_alloc()404 if (likely(radix_tree_is_internal_node(node))) { in radix_tree_load_root()454 if (radix_tree_is_internal_node(entry)) { in radix_tree_extend()485 if (!radix_tree_is_internal_node(node)) in radix_tree_shrink()507 if (radix_tree_is_internal_node(child)) in radix_tree_shrink()540 if (!radix_tree_is_internal_node(child)) { in radix_tree_shrink()640 } else if (!radix_tree_is_internal_node(child)) in __radix_tree_create()719 BUG_ON(radix_tree_is_internal_node(item)); in radix_tree_insert()771 while (radix_tree_is_internal_node(node)) { in __radix_tree_lookup()984 while (radix_tree_is_internal_node(node)) { in radix_tree_tag_set()[all …]
49 assert(!radix_tree_is_internal_node(item)); in item_sanity()250 if (!radix_tree_is_internal_node(node)) in verify_tag_consistency()274 if (!radix_tree_is_internal_node(node)) { in tree_verify_min_height()
64 assert(!radix_tree_is_internal_node(item)); in multiorder_iteration()
43 static inline bool radix_tree_is_internal_node(void *ptr) in radix_tree_is_internal_node() function194 return unlikely(radix_tree_is_internal_node(arg)); in radix_tree_deref_retry()
376 if (likely(!radix_tree_is_internal_node(entry) && entry)) in uapi_get_attr_for_method()
