Home
last modified time | relevance | path

Searched refs:xas_store (Results 1 - 25 of 35) sorted by relevance

12

/kernel/linux/linux-5.10/lib/
H A Didr.c412 xas_store(&xas, xa_mk_value(tmp)); in ida_alloc_range()
422 xas_store(&xas, bitmap); in ida_alloc_range()
450 xas_store(&xas, bitmap); in ida_alloc_range()
509 xas_store(&xas, xa_mk_value(v)); in ida_free()
518 xas_store(&xas, NULL); in ida_free()
551 xas_store(&xas, NULL); in ida_destroy()
H A Dtest_xarray.c79 curr = xas_store(&xas, entry); in xa_store_order()
133 xas_store(&xas, XA_RETRY_ENTRY); in check_xas_retry()
135 xas_store(&xas, XA_RETRY_ENTRY); in check_xas_retry()
139 xas_store(&xas, xa_mk_index(xas.xa_index)); in check_xas_retry()
343 XA_BUG_ON(xa, xas_store(&xas, NULL) != xa_mk_value(1)); in check_xa_shrink()
503 xas_store(&xas, xa_mk_index(j)); in check_xas_erase()
511 xas_store(&xas, xa_mk_value(0)); in check_xas_erase()
516 xas_store(&xas, NULL); in check_xas_erase()
522 xas_store(&xas, NULL); in check_xas_erase()
545 XA_BUG_ON(xa, xas_store( in check_multi_store_1()
[all...]
H A Dxarray.c631 * by xas_store(). It is useful for doing conditional store operations
762 * xas_store() - Store this entry in the XArray.
774 void *xas_store(struct xa_state *xas, void *entry) in xas_store() function
846 EXPORT_SYMBOL_GPL(xas_store); variable
1231 * to be immediately passed to xas_store().
1297 * xas_store().
1493 return xas_result(&xas, xas_store(&xas, NULL)); in __xa_erase()
1547 curr = xas_store(&xas, entry); in __xa_store()
1613 xas_store(&xas, entry); in __xa_cmpxchg()
1652 xas_store( in __xa_insert()
[all...]
/kernel/linux/linux-6.6/lib/
H A Didr.c412 xas_store(&xas, xa_mk_value(tmp)); in ida_alloc_range()
422 xas_store(&xas, bitmap); in ida_alloc_range()
450 xas_store(&xas, bitmap); in ida_alloc_range()
509 xas_store(&xas, xa_mk_value(v)); in ida_free()
518 xas_store(&xas, NULL); in ida_free()
551 xas_store(&xas, NULL); in ida_destroy()
H A Dtest_xarray.c79 curr = xas_store(&xas, entry); in xa_store_order()
133 xas_store(&xas, XA_RETRY_ENTRY); in check_xas_retry()
135 xas_store(&xas, XA_RETRY_ENTRY); in check_xas_retry()
139 xas_store(&xas, xa_mk_index(xas.xa_index)); in check_xas_retry()
343 XA_BUG_ON(xa, xas_store(&xas, NULL) != xa_mk_value(1)); in check_xa_shrink()
503 xas_store(&xas, xa_mk_index(j)); in check_xas_erase()
511 xas_store(&xas, xa_mk_value(0)); in check_xas_erase()
516 xas_store(&xas, NULL); in check_xas_erase()
522 xas_store(&xas, NULL); in check_xas_erase()
545 XA_BUG_ON(xa, xas_store( in check_multi_store_1()
[all...]
H A Dxarray.c632 * by xas_store(). It is useful for doing conditional store operations
763 * xas_store() - Store this entry in the XArray.
775 void *xas_store(struct xa_state *xas, void *entry) in xas_store() function
847 EXPORT_SYMBOL_GPL(xas_store); variable
1233 * to be immediately passed to xas_store().
1299 * xas_store().
1495 return xas_result(&xas, xas_store(&xas, NULL)); in __xa_erase()
1549 curr = xas_store(&xas, entry); in __xa_store()
1615 xas_store(&xas, entry); in __xa_cmpxchg()
1654 xas_store( in __xa_insert()
[all...]
/kernel/linux/linux-5.10/tools/testing/radix-tree/
H A Diteration_check.c34 xas_store(&xas, item); in my_item_insert()
H A Dmultiorder.c23 xas_store(&xas, item); in item_insert_order()
H A Dtest.c264 xas_store(&xas, NULL); in item_kill_tree()
/kernel/linux/linux-6.6/tools/testing/radix-tree/
H A Diteration_check.c34 xas_store(&xas, item); in my_item_insert()
H A Dtest.c264 xas_store(&xas, NULL); in item_kill_tree()
H A Dmultiorder.c23 xas_store(&xas, item); in item_insert_order()
/kernel/linux/linux-6.6/mm/
H A Dswap_state.c117 xas_store(&xas, folio); in add_to_swap_cache()
155 void *entry = xas_store(&xas, shadow); in __delete_from_swap_cache()
263 xas_store(&xas, NULL); in clear_shadow_from_swap_cache()
H A Dlist_lru.c385 xas_store(&xas, NULL); in memcg_destroy_list_lru()
520 xas_store(&xas, mlru); in memcg_list_lru_alloc()
H A Dtruncate.c39 xas_store(&xas, NULL); in __clear_shadow_entry()
/kernel/linux/linux-5.10/fs/
H A Ddax.c297 old = xas_store(xas, entry); in dax_unlock_entry()
309 return xas_store(xas, xa_mk_value(v | DAX_LOCKED)); in dax_lock_entry()
538 xas_store(xas, NULL); /* undo the PMD join */ in grab_mapping_entry()
675 xas_store(&xas, NULL); in __dax_invalidate_entry()
951 xas_store(xas, entry); in dax_writeback_one()
/kernel/linux/linux-6.6/fs/cachefiles/
H A Dondemand.c28 xas_store(&xas, NULL); in cachefiles_ondemand_fd_release()
377 xas_store(&xas, req); in cachefiles_ondemand_send_req()
/kernel/linux/linux-5.10/mm/
H A Dswap_state.c160 xas_store(&xas, page); in add_to_swap_cache()
196 void *entry = xas_store(&xas, shadow); in __delete_from_swap_cache()
301 xas_store(&xas, NULL); in clear_shadow_from_swap_cache()
H A Dfilemap.c138 xas_store(&xas, shadow); in page_cache_delete()
337 xas_store(&xas, NULL); in page_cache_delete_batch()
809 xas_store(&xas, new); in replace_page_cache_page()
884 xas_store(&xas, page); in __add_to_page_cache_locked()
H A Dkhugepaged.c1754 xas_store(&xas, new_page); in collapse_file()
1896 xas_store(&xas, new_page); in collapse_file()
1982 xas_store(&xas, NULL); in collapse_file()
1991 xas_store(&xas, page); in collapse_file()
/kernel/linux/linux-6.6/drivers/infiniband/sw/rxe/
H A Drxe_mr.c116 xas_store(&xas, page); in rxe_mr_fill_pages_from_sgt()
170 xas_store(&xas, XA_ZERO_ENTRY); in rxe_mr_alloc()
/kernel/linux/linux-6.6/fs/
H A Ddax.c283 old = xas_store(xas, entry); in dax_unlock_entry()
295 return xas_store(xas, xa_mk_value(v | DAX_LOCKED)); in dax_lock_entry()
624 xas_store(xas, NULL); /* undo the PMD join */ in grab_mapping_entry()
761 xas_store(&xas, NULL); in __dax_invalidate_entry()
1008 xas_store(xas, entry); in dax_writeback_one()
/kernel/linux/linux-5.10/include/linux/
H A Dxarray.h1495 void *xas_store(struct xa_state *, void *entry);
1523 xas_store(xas, entry); in xas_split()
/kernel/linux/linux-6.6/include/linux/
H A Dxarray.h1533 void *xas_store(struct xa_state *, void *entry);
1562 xas_store(xas, entry); in xas_split()
/kernel/linux/linux-6.6/drivers/iommu/iommufd/
H A Dmain.c161 xas_store(&xas, NULL); in iommufd_object_remove()

Completed in 41 milliseconds

12