Home
last modified time | relevance | path

Searched refs:xa_node (Results 1 – 9 of 9) sorted by relevance

/linux/lib/
H A Dxarray.c80 static inline unsigned long *node_marks(struct xa_node *node, xa_mark_t mark) in node_marks()
85 static inline bool node_get_mark(struct xa_node *node, in node_get_mark()
92 static inline bool node_set_mark(struct xa_node *node, unsigned int offset, in node_set_mark()
99 static inline bool node_clear_mark(struct xa_node *node, unsigned int offset, in node_clear_mark()
105 static inline bool node_any_mark(struct xa_node *node, xa_mark_t mark) in node_any_mark()
110 static inline void node_mark_all(struct xa_node *node, xa_mark_t mark) in node_mark_all()
132 unsigned long *marks = node_marks(xas->xa_node, mark); in xas_squash_marks()
145 static unsigned int get_offset(unsigned long index, struct xa_node *node) in get_offset()
152 xas->xa_offset = get_offset(xas->xa_index, xas->xa_node); in xas_set_offset()
158 unsigned int shift = xas->xa_node->shift; in xas_move_index()
[all …]
H A Dtest_xarray.c117 XA_BUG_ON(xa, xas.xa_node != XAS_RESTART); in check_xas_retry()
119 XA_BUG_ON(xa, xas.xa_node != NULL); in check_xas_retry()
126 xas.xa_node = XAS_RESTART; in check_xas_retry()
327 struct xa_node *node; in check_xa_shrink()
341 node = xas.xa_node; in check_xa_shrink()
345 XA_BUG_ON(xa, xas.xa_node != XAS_BOUNDS); in check_xa_shrink()
1334 xas.xa_node != XAS_RESTART); in check_find_3()
1557 XA_BUG_ON(xa, xas.xa_node == XAS_RESTART); in check_move_small()
1571 XA_BUG_ON(xa, xas.xa_node == XAS_RESTART); in check_move_small()
1998 static void test_update_node(struct xa_node *node) in test_update_node()
[all …]
/linux/include/linux/
H A Dxarray.h1168 struct xa_node { struct
1173 struct xa_node __rcu *parent; /* NULL at top of tree */ argument
1187 void xa_dump_node(const struct xa_node *); argument
1223 const struct xa_node *node, unsigned int offset) in xa_entry()
1232 const struct xa_node *node, unsigned int offset) in xa_entry_locked()
1240 static inline struct xa_node *xa_parent(const struct xarray *xa, in xa_parent()
1241 const struct xa_node *node) in xa_parent()
1248 static inline struct xa_node *xa_parent_locked(const struct xarray *xa, in xa_parent_locked()
1249 const struct xa_node *node) in xa_parent_locked()
1256 static inline void *xa_mk_node(const struct xa_node *node) in xa_mk_node()
[all …]
H A Dradix-tree.h26 #define radix_tree_node xa_node
/linux/drivers/infiniband/core/
H A Dib_core_uverbs.c295 if (xas.xa_node == XAS_RESTART) in rdma_user_mmap_entry_insert_range()
309 if (xas.xa_node == XAS_BOUNDS || xas.xa_index >= xa_last) in rdma_user_mmap_entry_insert_range()
/linux/mm/
H A Dworkingset.c613 void workingset_update_node(struct xa_node *node) in workingset_update_node()
702 struct xa_node *node = container_of(item, struct xa_node, private_list); in shadow_lru_isolate()
H A Dinternal.h1637 void workingset_update_node(struct xa_node *node);
/linux/fs/cachefiles/
H A Dondemand.c561 if (xas.xa_node == XAS_RESTART) { in cachefiles_ondemand_send_req()
565 if (xas.xa_node == XAS_RESTART) in cachefiles_ondemand_send_req()
/linux/fs/
H A Ddax.c726 if (xas->xa_node == XA_ERROR(-ENOMEM)) in grab_mapping_entry()