Home
last modified time | relevance | path

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

/linux/include/linux/
H A Dxarray.h1297 #define XA_RETRY_ENTRY xa_mk_internal(256) macro
1307 return unlikely(entry == XA_RETRY_ENTRY); in xa_is_retry()
1318 return xa_is_internal(entry) && (entry <= XA_RETRY_ENTRY); in xa_is_advanced()
/linux/lib/
H A Dxarray.c215 entry = XA_RETRY_ENTRY; in xas_descend()
472 RCU_INIT_POINTER(node->slots[0], XA_RETRY_ENTRY); in xas_shrink()
545 RCU_INIT_POINTER(node->slots[offset], XA_RETRY_ENTRY); in xas_free_nodes()
2184 * %XA_RETRY_ENTRY; if you need to see retry entries, use xas_find().
2234 * %XA_RETRY_ENTRY; if you need to see retry entries, use xas_find().
H A Dtest_xarray.c133 xas_store(&xas, XA_RETRY_ENTRY); in check_xas_retry()
135 xas_store(&xas, XA_RETRY_ENTRY); in check_xas_retry()
346 XA_BUG_ON(xa, xa_entry_locked(xa, node, 0) != XA_RETRY_ENTRY); in check_xa_shrink()
H A Dradix-tree.c77 #define RADIX_TREE_RETRY XA_RETRY_ENTRY
/linux/fs/
H A Ddax.c121 return entry == XA_RETRY_ENTRY; in dax_is_conflict()
227 return XA_RETRY_ENTRY; in get_next_unlocked_entry()
/linux/mm/
H A Dkhugepaged.c2137 xas_store(&xas, XA_RETRY_ENTRY); in collapse_file()
2176 if (xas_next(&xas) == XA_RETRY_ENTRY) in collapse_file()