Lines Matching refs:xas
1368 #define xas_marked(xas, mark) xa_marked((xas)->xa, (mark)) argument
1369 #define xas_trylock(xas) xa_trylock((xas)->xa) argument
1370 #define xas_lock(xas) xa_lock((xas)->xa) argument
1371 #define xas_unlock(xas) xa_unlock((xas)->xa) argument
1372 #define xas_lock_bh(xas) xa_lock_bh((xas)->xa) argument
1373 #define xas_unlock_bh(xas) xa_unlock_bh((xas)->xa) argument
1374 #define xas_lock_irq(xas) xa_lock_irq((xas)->xa) argument
1375 #define xas_unlock_irq(xas) xa_unlock_irq((xas)->xa) argument
1376 #define xas_lock_irqsave(xas, flags) \ argument
1377 xa_lock_irqsave((xas)->xa, flags)
1378 #define xas_unlock_irqrestore(xas, flags) \ argument
1379 xa_unlock_irqrestore((xas)->xa, flags)
1387 static inline int xas_error(const struct xa_state *xas) in xas_error() argument
1389 return xa_err(xas->xa_node); in xas_error()
1401 static inline void xas_set_err(struct xa_state *xas, long err) in xas_set_err() argument
1403 xas->xa_node = XA_ERROR(err); in xas_set_err()
1412 static inline bool xas_invalid(const struct xa_state *xas) in xas_invalid() argument
1414 return (unsigned long)xas->xa_node & 3; in xas_invalid()
1423 static inline bool xas_valid(const struct xa_state *xas) in xas_valid() argument
1425 return !xas_invalid(xas); in xas_valid()
1434 static inline bool xas_is_node(const struct xa_state *xas) in xas_is_node() argument
1436 return xas_valid(xas) && xas->xa_node; in xas_is_node()
1467 static inline void xas_reset(struct xa_state *xas) in xas_reset() argument
1469 xas->xa_node = XAS_RESTART; in xas_reset()
1484 static inline bool xas_retry(struct xa_state *xas, const void *entry) in xas_retry() argument
1490 xas_reset(xas); in xas_retry()
1520 static inline void xas_split(struct xa_state *xas, void *entry, in xas_split() argument
1523 xas_store(xas, entry); in xas_split()
1526 static inline void xas_split_alloc(struct xa_state *xas, void *entry, in xas_split_alloc() argument
1546 static inline void *xas_reload(struct xa_state *xas) in xas_reload() argument
1548 struct xa_node *node = xas->xa_node; in xas_reload()
1553 return xa_head(xas->xa); in xas_reload()
1555 offset = (xas->xa_index >> node->shift) & XA_CHUNK_MASK; in xas_reload()
1556 entry = xa_entry(xas->xa, node, offset); in xas_reload()
1561 offset = xas->xa_offset; in xas_reload()
1563 return xa_entry(xas->xa, node, offset); in xas_reload()
1575 static inline void xas_set(struct xa_state *xas, unsigned long index) in xas_set() argument
1577 xas->xa_index = index; in xas_set()
1578 xas->xa_node = XAS_RESTART; in xas_set()
1587 static inline void xas_set_order(struct xa_state *xas, unsigned long index, in xas_set_order() argument
1591 xas->xa_index = order < BITS_PER_LONG ? (index >> order) << order : 0; in xas_set_order()
1592 xas->xa_shift = order - (order % XA_CHUNK_SHIFT); in xas_set_order()
1593 xas->xa_sibs = (1 << (order % XA_CHUNK_SHIFT)) - 1; in xas_set_order()
1594 xas->xa_node = XAS_RESTART; in xas_set_order()
1597 xas_set(xas, index); in xas_set_order()
1609 static inline void xas_set_update(struct xa_state *xas, xa_update_node_t update) in xas_set_update() argument
1611 xas->xa_update = update; in xas_set_update()
1625 static inline void *xas_next_entry(struct xa_state *xas, unsigned long max) in xas_next_entry() argument
1627 struct xa_node *node = xas->xa_node; in xas_next_entry()
1631 xas->xa_offset != (xas->xa_index & XA_CHUNK_MASK))) in xas_next_entry()
1632 return xas_find(xas, max); in xas_next_entry()
1635 if (unlikely(xas->xa_index >= max)) in xas_next_entry()
1636 return xas_find(xas, max); in xas_next_entry()
1637 if (unlikely(xas->xa_offset == XA_CHUNK_MASK)) in xas_next_entry()
1638 return xas_find(xas, max); in xas_next_entry()
1639 entry = xa_entry(xas->xa, node, xas->xa_offset + 1); in xas_next_entry()
1641 return xas_find(xas, max); in xas_next_entry()
1642 xas->xa_offset++; in xas_next_entry()
1643 xas->xa_index++; in xas_next_entry()
1650 static inline unsigned int xas_find_chunk(struct xa_state *xas, bool advance, in xas_find_chunk() argument
1653 unsigned long *addr = xas->xa_node->marks[(__force unsigned)mark]; in xas_find_chunk()
1654 unsigned int offset = xas->xa_offset; in xas_find_chunk()
1682 static inline void *xas_next_marked(struct xa_state *xas, unsigned long max, in xas_next_marked() argument
1685 struct xa_node *node = xas->xa_node; in xas_next_marked()
1690 return xas_find_marked(xas, max, mark); in xas_next_marked()
1691 offset = xas_find_chunk(xas, true, mark); in xas_next_marked()
1692 xas->xa_offset = offset; in xas_next_marked()
1693 xas->xa_index = (xas->xa_index & ~XA_CHUNK_MASK) + offset; in xas_next_marked()
1694 if (xas->xa_index > max) in xas_next_marked()
1697 return xas_find_marked(xas, max, mark); in xas_next_marked()
1698 entry = xa_entry(xas->xa, node, offset); in xas_next_marked()
1700 return xas_find_marked(xas, max, mark); in xas_next_marked()
1725 #define xas_for_each(xas, entry, max) \ argument
1726 for (entry = xas_find(xas, max); entry; \
1727 entry = xas_next_entry(xas, max))
1743 #define xas_for_each_marked(xas, entry, max, mark) \ argument
1744 for (entry = xas_find_marked(xas, max, mark); entry; \
1745 entry = xas_next_marked(xas, max, mark))
1759 #define xas_for_each_conflict(xas, entry) \ argument
1760 while ((entry = xas_find_conflict(xas)))
1781 static inline void *xas_prev(struct xa_state *xas) in xas_prev() argument
1783 struct xa_node *node = xas->xa_node; in xas_prev()
1786 xas->xa_offset == 0)) in xas_prev()
1787 return __xas_prev(xas); in xas_prev()
1789 xas->xa_index--; in xas_prev()
1790 xas->xa_offset--; in xas_prev()
1791 return xa_entry(xas->xa, node, xas->xa_offset); in xas_prev()
1810 static inline void *xas_next(struct xa_state *xas) in xas_next() argument
1812 struct xa_node *node = xas->xa_node; in xas_next()
1815 xas->xa_offset == XA_CHUNK_MASK)) in xas_next()
1816 return __xas_next(xas); in xas_next()
1818 xas->xa_index++; in xas_next()
1819 xas->xa_offset++; in xas_next()
1820 return xa_entry(xas->xa, node, xas->xa_offset); in xas_next()