XA_RETRY_ENTRY
return entry == XA_RETRY_ENTRY;
return XA_RETRY_ENTRY;
return unlikely(entry == XA_RETRY_ENTRY);
return xa_is_internal(entry) && (entry <= XA_RETRY_ENTRY);
#define RADIX_TREE_RETRY XA_RETRY_ENTRY
xas_store(&xas, XA_RETRY_ENTRY);
xas_store(&xas, XA_RETRY_ENTRY);
XA_BUG_ON(xa, xa_entry_locked(xa, node, 0) != XA_RETRY_ENTRY);
entry = XA_RETRY_ENTRY;
RCU_INIT_POINTER(node->slots[0], XA_RETRY_ENTRY);
RCU_INIT_POINTER(node->slots[offset], XA_RETRY_ENTRY);
xas_store(&xas, XA_RETRY_ENTRY);
if (xas_next(&xas) == XA_RETRY_ENTRY)