Home
last modified time | relevance | path

Searched refs:xa_head (Results 1 – 7 of 7) sorted by relevance

/Linux-v5.4/lib/
Dradix-tree.c400 struct radix_tree_node *node = rcu_dereference_raw(root->xa_head); in radix_tree_load_root()
429 entry = rcu_dereference_raw(root->xa_head); in radix_tree_extend()
466 rcu_assign_pointer(root->xa_head, entry); in radix_tree_extend()
482 struct radix_tree_node *node = rcu_dereference_raw(root->xa_head); in radix_tree_shrink()
517 root->xa_head = (void __rcu *)child; in radix_tree_shrink()
562 rcu_dereference_raw(root->xa_head)) in delete_node()
578 root->xa_head = NULL; in delete_node()
612 void __rcu **slot = (void __rcu **)&root->xa_head; in __radix_tree_create()
626 child = rcu_dereference_raw(root->xa_head); in __radix_tree_create()
766 slot = (void __rcu **)&root->xa_head; in __radix_tree_lookup()
[all …]
Dxarray.c187 entry = xa_head(xas->xa); in xas_start()
452 RCU_INIT_POINTER(xa->xa_head, entry); in xas_shrink()
493 xas->xa->xa_head = NULL; in xas_delete_node()
611 rcu_assign_pointer(xa->xa_head, head); in xas_expand()
654 slot = &xa->xa_head; in xas_create()
666 slot = &xa->xa_head; in xas_create()
771 void __rcu **slot = &xas->xa->xa_head; in xas_store()
1159 entry = xa_head(xas->xa); in xas_find_marked()
1975 RCU_INIT_POINTER(xa->xa_head, NULL); in xa_destroy()
2054 void *entry = xa->xa_head; in xa_dump()
Didr.c242 if (slot != &idr->idr_rt.xa_head && !xa_is_retry(entry)) in idr_get_next_ul()
590 pr_debug("ida: %p node %p free %d\n", ida, xa->xa_head, in ida_dump()
592 ida_dump_entry(xa->xa_head, 0); in ida_dump()
Dtest_xarray.c333 node = xa_head(xa); in check_xa_shrink()
338 XA_BUG_ON(xa, xa_head(xa) == node); in check_xa_shrink()
342 XA_BUG_ON(xa, xa->xa_head != node); in check_xa_shrink()
580 XA_BUG_ON(xa, xa_to_node(xa_head(xa))->count != 2); in check_multi_store()
581 XA_BUG_ON(xa, xa_to_node(xa_head(xa))->nr_values != 2); in check_multi_store()
590 XA_BUG_ON(xa, xa_to_node(xa_head(xa))->count != 3); in check_multi_store()
591 XA_BUG_ON(xa, xa_to_node(xa_head(xa))->nr_values != 2); in check_multi_store()
602 XA_BUG_ON(xa, xa_to_node(xa_head(xa))->count != 4); in check_multi_store()
603 XA_BUG_ON(xa, xa_to_node(xa_head(xa))->nr_values != 4); in check_multi_store()
/Linux-v5.4/include/linux/
Dxarray.h296 void __rcu * xa_head; member
302 .xa_head = NULL, \
378 xa->xa_head = NULL; in xa_init_flags()
403 return xa->xa_head == NULL; in xa_empty()
1127 static inline void *xa_head(const struct xarray *xa) in xa_head() function
1129 return rcu_dereference_check(xa->xa_head, in xa_head()
1136 return rcu_dereference_protected(xa->xa_head, in xa_head_locked()
1493 return xa_head(xas->xa); in xas_reload()
Dradix-tree.h76 return root->xa_head == NULL; in radix_tree_empty()
/Linux-v5.4/tools/testing/radix-tree/
Dtest.c249 struct radix_tree_node *node = root->xa_head; in verify_tag_consistency()
273 struct radix_tree_node *node = root->xa_head; in tree_verify_min_height()