Home
last modified time | relevance | path

Searched refs:xa_entry (Results 1 – 2 of 2) sorted by relevance

/linux/include/linux/
H A Dxarray.h1222 static inline void *xa_entry(const struct xarray *xa, in xa_entry() function
1624 entry = xa_entry(xas->xa, node, offset); in xas_reload()
1631 return xa_entry(xas->xa, node, offset); in xas_reload()
1731 entry = xa_entry(xas->xa, node, xas->xa_offset + 1); in xas_next_entry()
1790 entry = xa_entry(xas->xa, node, offset); in xas_next_marked()
1883 return xa_entry(xas->xa, node, xas->xa_offset); in xas_prev()
1912 return xa_entry(xas->xa, node, xas->xa_offset); in xas_next()
/linux/lib/
H A Dxarray.c208 void *entry = xa_entry(xas->xa, node, offset); in xas_descend()
213 entry = xa_entry(xas->xa, node, offset); in xas_descend()
1286 if (!xa_is_sibling(xa_entry(xas->xa, node, offset))) in xas_pause()
1328 entry = xa_entry(xas->xa, xas->xa_node, xas->xa_offset); in __xas_prev()
1367 entry = xa_entry(xas->xa, xas->xa_node, xas->xa_offset); in __xas_next()
1423 entry = xa_entry(xas->xa, xas->xa_node, xas->xa_offset); in xas_find()
1503 entry = xa_entry(xas->xa, xas->xa_node, xas->xa_offset); in xas_find_marked()
1522 entry = xa_entry(xas->xa, xas->xa_node, xas->xa_offset); in xas_find_marked()
1924 XA_NODE_BUG_ON(xas->xa_node, xa_is_sibling(xa_entry(xas->xa, in xas_get_order()
1931 if (!xa_is_sibling(xa_entry(xas->xa, xas->xa_node, slot))) in xas_get_order()