Home
last modified time | relevance | path

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

/linux/lib/
H A Dradix-tree.c391 struct radix_tree_node *node = rcu_dereference_raw(root->xa_head); in radix_tree_load_root()
420 entry = rcu_dereference_raw(root->xa_head); in radix_tree_extend()
457 rcu_assign_pointer(root->xa_head, entry); in radix_tree_extend()
473 struct radix_tree_node *node = rcu_dereference_raw(root->xa_head); in radix_tree_shrink()
508 root->xa_head = (void __rcu *)child; in radix_tree_shrink()
553 rcu_dereference_raw(root->xa_head)) in delete_node()
569 root->xa_head = NULL; in delete_node()
603 void __rcu **slot = (void __rcu **)&root->xa_head; in __radix_tree_create()
617 child = rcu_dereference_raw(root->xa_head); in __radix_tree_create()
757 slot = (void __rcu **)&root->xa_head; in __radix_tree_lookup()
[all …]
H A Didr.c244 if (slot != &idr->idr_rt.xa_head && !xa_is_retry(entry)) in idr_get_next_ul()
664 pr_debug("ida: %p node %p free %d\n", ida, xa->xa_head, in ida_dump()
666 ida_dump_entry(xa->xa_head, 0); in ida_dump()
H A Dxarray.c191 entry = xa_head(xas->xa); in xas_start()
465 RCU_INIT_POINTER(xa->xa_head, entry); in xas_shrink()
506 xas->xa->xa_head = NULL; in xas_delete_node()
624 rcu_assign_pointer(xa->xa_head, head); in xas_expand()
667 slot = &xa->xa_head; in xas_create()
679 slot = &xa->xa_head; in xas_create()
786 void __rcu **slot = &xas->xa->xa_head; in xas_store()
1478 entry = xa_head(xas->xa); in xas_find_marked()
2392 RCU_INIT_POINTER(xa->xa_head, NULL); in xa_destroy()
2471 void *entry = xa->xa_head; in xa_dump()
H A Dtest_xarray.c359 node = xa_head(xa); in check_xa_shrink()
364 XA_BUG_ON(xa, xa_head(xa) == node); in check_xa_shrink()
368 XA_BUG_ON(xa, xa->xa_head != node); in check_xa_shrink()
662 XA_BUG_ON(xa, xa_to_node(xa_head(xa))->count != 2); in check_multi_store()
663 XA_BUG_ON(xa, xa_to_node(xa_head(xa))->nr_values != 2); in check_multi_store()
672 XA_BUG_ON(xa, xa_to_node(xa_head(xa))->count != 3); in check_multi_store()
673 XA_BUG_ON(xa, xa_to_node(xa_head(xa))->nr_values != 2); in check_multi_store()
684 XA_BUG_ON(xa, xa_to_node(xa_head(xa))->count != 4); in check_multi_store()
685 XA_BUG_ON(xa, xa_to_node(xa_head(xa))->nr_values != 4); in check_multi_store()
/linux/include/linux/
H A Dxarray.h304 void __rcu * xa_head; member
310 .xa_head = NULL, \
386 xa->xa_head = NULL; in xa_init_flags()
411 return xa->xa_head == NULL; in xa_empty()
1208 static inline void *xa_head(const struct xarray *xa) in xa_head() function
1210 return rcu_dereference_check(xa->xa_head, in xa_head()
1217 return rcu_dereference_protected(xa->xa_head, in xa_head_locked()
1621 return xa_head(xas->xa); in xas_reload()
H A Dradix-tree.h88 return root->xa_head == NULL; in radix_tree_empty()
H A Dpagemap.h179 head = rcu_access_pointer(mapping->i_pages.xa_head); in mapping_shrinkable()
/linux/tools/testing/radix-tree/
H A 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()