Lines Matching refs:xa
31 static inline unsigned int xa_lock_type(const struct xarray *xa) in xa_lock_type() argument
33 return (__force unsigned int)xa->xa_flags & 3; in xa_lock_type()
56 static inline bool xa_track_free(const struct xarray *xa) in xa_track_free() argument
58 return xa->xa_flags & XA_FLAGS_TRACK_FREE; in xa_track_free()
61 static inline bool xa_zero_busy(const struct xarray *xa) in xa_zero_busy() argument
63 return xa->xa_flags & XA_FLAGS_ZERO_BUSY; in xa_zero_busy()
66 static inline void xa_mark_set(struct xarray *xa, xa_mark_t mark) in xa_mark_set() argument
68 if (!(xa->xa_flags & XA_FLAGS_MARK(mark))) in xa_mark_set()
69 xa->xa_flags |= XA_FLAGS_MARK(mark); in xa_mark_set()
72 static inline void xa_mark_clear(struct xarray *xa, xa_mark_t mark) in xa_mark_clear() argument
74 if (xa->xa_flags & XA_FLAGS_MARK(mark)) in xa_mark_clear()
75 xa->xa_flags &= ~(XA_FLAGS_MARK(mark)); in xa_mark_clear()
188 entry = xa_head(xas->xa); in xas_start()
204 void *entry = xa_entry(xas->xa, node, offset); in xas_descend()
209 entry = xa_entry(xas->xa, node, offset); in xas_descend()
303 if (xas->xa->xa_flags & XA_FLAGS_ACCOUNT) in xas_nomem()
325 __must_hold(xas->xa->xa_lock) in __xas_nomem()
327 unsigned int lock_type = xa_lock_type(xas->xa); in __xas_nomem()
333 if (xas->xa->xa_flags & XA_FLAGS_ACCOUNT) in __xas_nomem()
371 if (xas->xa->xa_flags & XA_FLAGS_ACCOUNT) in xas_alloc()
393 node->array = xas->xa; in xas_alloc()
438 struct xarray *xa = xas->xa; in xas_shrink() local
447 entry = xa_entry_locked(xa, node, 0); in xas_shrink()
452 if (xa_is_zero(entry) && xa_zero_busy(xa)) in xas_shrink()
456 RCU_INIT_POINTER(xa->xa_head, entry); in xas_shrink()
457 if (xa_track_free(xa) && !node_get_mark(node, 0, XA_FREE_MARK)) in xas_shrink()
458 xa_mark_clear(xa, XA_FREE_MARK); in xas_shrink()
491 parent = xa_parent_locked(xas->xa, node); in xas_delete_node()
497 xas->xa->xa_head = NULL; in xas_delete_node()
528 void *entry = xa_entry_locked(xas->xa, node, offset); in xas_free_nodes()
541 parent = xa_parent_locked(xas->xa, node); in xas_free_nodes()
560 struct xarray *xa = xas->xa; in xas_expand() local
592 if (xa_track_free(xa) && mark == XA_FREE_MARK) { in xas_expand()
594 if (!xa_marked(xa, XA_FREE_MARK)) { in xas_expand()
596 xa_mark_set(xa, XA_FREE_MARK); in xas_expand()
598 } else if (xa_marked(xa, mark)) { in xas_expand()
615 rcu_assign_pointer(xa->xa_head, head); in xas_expand()
640 struct xarray *xa = xas->xa; in xas_create() local
648 entry = xa_head_locked(xa); in xas_create()
650 if (!entry && xa_zero_busy(xa)) in xas_create()
657 entry = xa_head_locked(xa); in xas_create()
658 slot = &xa->xa_head; in xas_create()
665 entry = xa_entry_locked(xa, node, offset); in xas_create()
669 entry = xa_head_locked(xa); in xas_create()
670 slot = &xa->xa_head; in xas_create()
679 if (xa_track_free(xa)) in xas_create()
727 xas->xa_node = xa_parent_locked(xas->xa, node); in xas_create_range()
777 void __rcu **slot = &xas->xa->xa_head; in xas_store()
834 next = xa_entry_locked(xas->xa, node, ++offset); in xas_store()
861 return xa_marked(xas->xa, mark); in xas_get_mark()
887 node = xa_parent_locked(xas->xa, node); in xas_set_mark()
890 if (!xa_marked(xas->xa, mark)) in xas_set_mark()
891 xa_mark_set(xas->xa, mark); in xas_set_mark()
919 node = xa_parent_locked(xas->xa, node); in xas_clear_mark()
922 if (xa_marked(xas->xa, mark)) in xas_clear_mark()
923 xa_mark_clear(xas->xa, mark); in xas_clear_mark()
943 if (xa_track_free(xas->xa) && mark == XA_FREE_MARK) in xas_init_marks()
1022 node->array = xas->xa; in xas_split_alloc()
1129 if (!xa_is_sibling(xa_entry(xas->xa, node, offset))) in xas_pause()
1164 xas->xa_node = xa_parent(xas->xa, xas->xa_node); in __xas_prev()
1170 entry = xa_entry(xas->xa, xas->xa_node, xas->xa_offset); in __xas_prev()
1203 xas->xa_node = xa_parent(xas->xa, xas->xa_node); in __xas_next()
1209 entry = xa_entry(xas->xa, xas->xa_node, xas->xa_offset); in __xas_next()
1261 xas->xa_node = xa_parent(xas->xa, xas->xa_node); in xas_find()
1265 entry = xa_entry(xas->xa, xas->xa_node, xas->xa_offset); in xas_find()
1320 entry = xa_head(xas->xa); in xas_find_marked()
1325 if (xa_marked(xas->xa, mark)) in xas_find_marked()
1337 xas->xa_node = xa_parent(xas->xa, xas->xa_node); in xas_find_marked()
1345 entry = xa_entry(xas->xa, xas->xa_node, xas->xa_offset); in xas_find_marked()
1364 entry = xa_entry(xas->xa, xas->xa_node, xas->xa_offset); in xas_find_marked()
1365 if (!entry && !(xa_track_free(xas->xa) && mark == XA_FREE_MARK)) in xas_find_marked()
1423 xas->xa_node = xa_parent_locked(xas->xa, xas->xa_node); in xas_find_conflict()
1428 curr = xa_entry_locked(xas->xa, xas->xa_node, ++xas->xa_offset); in xas_find_conflict()
1434 curr = xa_entry_locked(xas->xa, xas->xa_node, 0); in xas_find_conflict()
1452 void *xa_load(struct xarray *xa, unsigned long index) in xa_load() argument
1454 XA_STATE(xas, xa, index); in xa_load()
1490 void *__xa_erase(struct xarray *xa, unsigned long index) in __xa_erase() argument
1492 XA_STATE(xas, xa, index); in __xa_erase()
1509 void *xa_erase(struct xarray *xa, unsigned long index) in xa_erase() argument
1513 xa_lock(xa); in xa_erase()
1514 entry = __xa_erase(xa, index); in xa_erase()
1515 xa_unlock(xa); in xa_erase()
1536 void *__xa_store(struct xarray *xa, unsigned long index, void *entry, gfp_t gfp) in __xa_store() argument
1538 XA_STATE(xas, xa, index); in __xa_store()
1543 if (xa_track_free(xa) && !entry) in __xa_store()
1548 if (xa_track_free(xa)) in __xa_store()
1573 void *xa_store(struct xarray *xa, unsigned long index, void *entry, gfp_t gfp) in xa_store() argument
1577 xa_lock(xa); in xa_store()
1578 curr = __xa_store(xa, index, entry, gfp); in xa_store()
1579 xa_unlock(xa); in xa_store()
1601 void *__xa_cmpxchg(struct xarray *xa, unsigned long index, in __xa_cmpxchg() argument
1604 XA_STATE(xas, xa, index); in __xa_cmpxchg()
1614 if (xa_track_free(xa) && entry && !curr) in __xa_cmpxchg()
1639 int __xa_insert(struct xarray *xa, unsigned long index, void *entry, gfp_t gfp) in __xa_insert() argument
1641 XA_STATE(xas, xa, index); in __xa_insert()
1653 if (xa_track_free(xa)) in __xa_insert()
1714 void *xa_store_range(struct xarray *xa, unsigned long first, in xa_store_range() argument
1717 XA_STATE(xas, xa, 0); in xa_store_range()
1757 int xa_get_order(struct xarray *xa, unsigned long index) in xa_get_order() argument
1759 XA_STATE(xas, xa, index); in xa_get_order()
1808 int __xa_alloc(struct xarray *xa, u32 *id, void *entry, in __xa_alloc() argument
1811 XA_STATE(xas, xa, 0); in __xa_alloc()
1815 if (WARN_ON_ONCE(!xa_track_free(xa))) in __xa_alloc()
1857 int __xa_alloc_cyclic(struct xarray *xa, u32 *id, void *entry, in __xa_alloc_cyclic() argument
1864 ret = __xa_alloc(xa, id, entry, limit, gfp); in __xa_alloc_cyclic()
1865 if ((xa->xa_flags & XA_FLAGS_ALLOC_WRAPPED) && ret == 0) { in __xa_alloc_cyclic()
1866 xa->xa_flags &= ~XA_FLAGS_ALLOC_WRAPPED; in __xa_alloc_cyclic()
1872 ret = __xa_alloc(xa, id, entry, limit, gfp); in __xa_alloc_cyclic()
1880 xa->xa_flags |= XA_FLAGS_ALLOC_WRAPPED; in __xa_alloc_cyclic()
1896 void __xa_set_mark(struct xarray *xa, unsigned long index, xa_mark_t mark) in __xa_set_mark() argument
1898 XA_STATE(xas, xa, index); in __xa_set_mark()
1914 void __xa_clear_mark(struct xarray *xa, unsigned long index, xa_mark_t mark) in __xa_clear_mark() argument
1916 XA_STATE(xas, xa, index); in __xa_clear_mark()
1936 bool xa_get_mark(struct xarray *xa, unsigned long index, xa_mark_t mark) in xa_get_mark() argument
1938 XA_STATE(xas, xa, index); in xa_get_mark()
1966 void xa_set_mark(struct xarray *xa, unsigned long index, xa_mark_t mark) in xa_set_mark() argument
1968 xa_lock(xa); in xa_set_mark()
1969 __xa_set_mark(xa, index, mark); in xa_set_mark()
1970 xa_unlock(xa); in xa_set_mark()
1984 void xa_clear_mark(struct xarray *xa, unsigned long index, xa_mark_t mark) in xa_clear_mark() argument
1986 xa_lock(xa); in xa_clear_mark()
1987 __xa_clear_mark(xa, index, mark); in xa_clear_mark()
1988 xa_unlock(xa); in xa_clear_mark()
2009 void *xa_find(struct xarray *xa, unsigned long *indexp, in xa_find() argument
2012 XA_STATE(xas, xa, *indexp); in xa_find()
2059 void *xa_find_after(struct xarray *xa, unsigned long *indexp, in xa_find_after() argument
2062 XA_STATE(xas, xa, *indexp + 1); in xa_find_after()
2156 unsigned int xa_extract(struct xarray *xa, void **dst, unsigned long start, in xa_extract() argument
2159 XA_STATE(xas, xa, start); in xa_extract()
2180 .xa = node->array, in xa_delete_node()
2203 void xa_destroy(struct xarray *xa) in xa_destroy() argument
2205 XA_STATE(xas, xa, 0); in xa_destroy()
2211 entry = xa_head_locked(xa); in xa_destroy()
2212 RCU_INIT_POINTER(xa->xa_head, NULL); in xa_destroy()
2214 if (xa_zero_busy(xa)) in xa_destroy()
2215 xa_mark_clear(xa, XA_FREE_MARK); in xa_destroy()
2289 void xa_dump(const struct xarray *xa) in xa_dump() argument
2291 void *entry = xa->xa_head; in xa_dump()
2294 pr_info("xarray: %px head %px flags %x marks %d %d %d\n", xa, entry, in xa_dump()
2295 xa->xa_flags, xa_marked(xa, XA_MARK_0), in xa_dump()
2296 xa_marked(xa, XA_MARK_1), xa_marked(xa, XA_MARK_2)); in xa_dump()