Home
last modified time | relevance | path

Searched refs:xa_node (Results 1 – 12 of 12) sorted by relevance

/linux-6.15/lib/
H A Dxarray.c364 struct xa_node *parent = xas->xa_node; in xas_alloc()
448 struct xa_node *node = xas->xa_node; in xas_shrink()
491 struct xa_node *node = xas->xa_node; in xas_delete_node()
652 struct xa_node *node = xas->xa_node; in xas_create()
733 struct xa_node *node = xas->xa_node; in xas_create_range()
886 struct xa_node *node = xas->xa_node; in xas_set_mark()
915 struct xa_node *node = xas->xa_node; in xas_clear_mark()
1277 struct xa_node *node = xas->xa_node; in xas_pause()
1322 xas->xa_node = xa_parent(xas->xa, xas->xa_node); in __xas_prev()
1361 xas->xa_node = xa_parent(xas->xa, xas->xa_node); in __xas_next()
[all …]
H A Dtest_xarray.c117 XA_BUG_ON(xa, xas.xa_node != XAS_RESTART); in check_xas_retry()
119 XA_BUG_ON(xa, xas.xa_node != NULL); in check_xas_retry()
126 xas.xa_node = XAS_RESTART; in check_xas_retry()
327 struct xa_node *node; in check_xa_shrink()
341 node = xas.xa_node; in check_xa_shrink()
345 XA_BUG_ON(xa, xas.xa_node != XAS_BOUNDS); in check_xa_shrink()
1321 xas.xa_node != XAS_RESTART); in check_find_3()
1998 struct xa_node *node; in shadow_remove()
2002 struct xa_node, private_list))) { in shadow_remove()
2054 XA_BUG_ON(xa, xas.xa_node->count == 0); in check_account()
[all …]
H A Didr.c636 struct xa_node *node = xa_to_node(entry); in ida_dump_entry()
/linux-6.15/include/linux/
H A Dxarray.h1162 struct xa_node { struct
1355 struct xa_node *xa_node; member
1356 struct xa_node *xa_alloc;
1511 xas->xa_node = XAS_RESTART; in xas_reset()
1610 struct xa_node *node = xas->xa_node; in xas_reload()
1640 xas->xa_node = XAS_RESTART; in xas_set()
1674 xas->xa_node = XAS_RESTART; in xas_set_order()
1713 struct xa_node *node = xas->xa_node; in xas_next_entry()
1771 struct xa_node *node = xas->xa_node; in xas_next_marked()
1869 struct xa_node *node = xas->xa_node; in xas_prev()
[all …]
H A Dradix-tree.h26 #define radix_tree_node xa_node
/linux-6.15/drivers/infiniband/core/
H A Dib_core_uverbs.c295 if (xas.xa_node == XAS_RESTART) in rdma_user_mmap_entry_insert_range()
309 if (xas.xa_node == XAS_BOUNDS || xas.xa_index >= xa_last) in rdma_user_mmap_entry_insert_range()
/linux-6.15/mm/
H A Dworkingset.c613 void workingset_update_node(struct xa_node *node) in workingset_update_node()
704 struct xa_node *node = container_of(item, struct xa_node, private_list); in shadow_lru_isolate()
H A Dinternal.h1579 void workingset_update_node(struct xa_node *node);
/linux-6.15/fs/cachefiles/
H A Dondemand.c563 if (xas.xa_node == XAS_RESTART) { in cachefiles_ondemand_send_req()
567 if (xas.xa_node == XAS_RESTART) in cachefiles_ondemand_send_req()
/linux-6.15/tools/testing/radix-tree/
H A Dmultiorder.c63 assert(xas.xa_node->shift == shift); in multiorder_iteration()
/linux-6.15/Documentation/core-api/
H A Dxarray.rst499 8 xa_node. xas_try_split() splits the order-9 entry into
502 When splitting the order-6 entry and a new xa_node is needed, xas_try_split()
504 need 1 xa_node instead of 8.
/linux-6.15/fs/
H A Ddax.c733 if (xas->xa_node == XA_ERROR(-ENOMEM)) in grab_mapping_entry()