Home
last modified time | relevance | path

Searched refs:radix_tree_is_internal_node (Results 1 – 6 of 6) sorted by relevance

/Linux-v4.19/lib/
Dradix-tree.c133 if (radix_tree_is_internal_node(entry)) { in radix_tree_descend()
300 } else if (!radix_tree_is_internal_node(entry)) { in dump_node()
319 if (!radix_tree_is_internal_node(root->rnode)) in radix_tree_dump()
331 if (radix_tree_is_internal_node(entry)) { in dump_ida_node()
423 BUG_ON(radix_tree_is_internal_node(ret)); in radix_tree_node_alloc()
607 if (likely(radix_tree_is_internal_node(node))) { in radix_tree_load_root()
657 if (radix_tree_is_internal_node(entry)) { in radix_tree_extend()
689 if (!radix_tree_is_internal_node(node)) in radix_tree_shrink()
703 if (!radix_tree_is_internal_node(child) && node->shift) in radix_tree_shrink()
706 if (radix_tree_is_internal_node(child)) in radix_tree_shrink()
[all …]
Didr.c42 if (WARN_ON_ONCE(radix_tree_is_internal_node(ptr))) in idr_alloc_u32()
298 if (WARN_ON_ONCE(radix_tree_is_internal_node(ptr))) in idr_replace()
/Linux-v4.19/include/linux/
Dradix-tree.h60 static inline bool radix_tree_is_internal_node(void *ptr) in radix_tree_is_internal_node() function
268 return unlikely(radix_tree_is_internal_node(arg)); in radix_tree_deref_retry()
566 if (unlikely(radix_tree_is_internal_node(rcu_dereference_raw(*slot)))) in radix_tree_next_slot()
/Linux-v4.19/tools/testing/radix-tree/
Dtest.c60 assert(!radix_tree_is_internal_node(item)); in item_sanity()
285 if (!radix_tree_is_internal_node(node)) in verify_tag_consistency()
321 if (!radix_tree_is_internal_node(node)) { in tree_verify_min_height()
Dmultiorder.c263 assert(!radix_tree_is_internal_node(item)); in multiorder_iteration()
315 assert(!radix_tree_is_internal_node(item)); in multiorder_tagged_iteration()
342 assert(!radix_tree_is_internal_node(item)); in multiorder_tagged_iteration()
/Linux-v4.19/drivers/infiniband/core/
Duverbs_ioctl.c276 if (likely(!radix_tree_is_internal_node(entry) && entry)) in uapi_get_attr_for_method()