Searched refs:radix_tree_is_internal_node (Results 1 – 5 of 5) sorted by relevance
276 BUG_ON(radix_tree_is_internal_node(ret)); in radix_tree_node_alloc()443 if (radix_tree_is_internal_node(entry)) { in radix_tree_extend()474 if (!radix_tree_is_internal_node(node)) in radix_tree_shrink()496 if (radix_tree_is_internal_node(child)) in radix_tree_shrink()529 if (!radix_tree_is_internal_node(child)) { in radix_tree_shrink()708 BUG_ON(radix_tree_is_internal_node(item)); in radix_tree_insert()760 while (radix_tree_is_internal_node(node)) { in __radix_tree_lookup()974 while (radix_tree_is_internal_node(node)) { in radix_tree_tag_set()1040 while (radix_tree_is_internal_node(node)) { in radix_tree_tag_clear()1183 if (!radix_tree_is_internal_node(child)) { in radix_tree_next_chunk()[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()
55 static inline bool radix_tree_is_internal_node(void *ptr) in radix_tree_is_internal_node() function206 return unlikely(radix_tree_is_internal_node(arg)); in radix_tree_deref_retry()
379 if (likely(!radix_tree_is_internal_node(entry) && entry)) in uapi_get_attr_for_method()
Completed in 10 milliseconds