Lines Matching refs:xa_node
80 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()
135 unsigned long *marks = xas->xa_node->marks[mark]; in xas_squash_marks()
144 static unsigned int get_offset(unsigned long index, struct xa_node *node) in get_offset()
151 xas->xa_offset = get_offset(xas->xa_index, xas->xa_node); in xas_set_offset()
157 unsigned int shift = xas->xa_node->shift; in xas_move_index()
170 xas->xa_node = XAS_BOUNDS; in set_bounds()
199 xas->xa_node = NULL; in xas_start()
203 static void *xas_descend(struct xa_state *xas, struct xa_node *node) in xas_descend()
208 xas->xa_node = node; in xas_descend()
240 struct xa_node *node = xa_to_node(entry); in xas_load()
254 static void xa_node_free(struct xa_node *node) in xa_node_free()
270 struct xa_node *next, *node = xas->xa_alloc; in xas_destroy()
300 if (xas->xa_node != XA_ERROR(-ENOMEM)) { in xas_nomem()
311 xas->xa_node = XAS_RESTART; in xas_nomem()
330 if (xas->xa_node != XA_ERROR(-ENOMEM)) { in __xas_nomem()
347 xas->xa_node = XAS_RESTART; in __xas_nomem()
351 static void xas_update(struct xa_state *xas, struct xa_node *node) in xas_update()
361 struct xa_node *parent = xas->xa_node; in xas_alloc()
362 struct xa_node *node = xas->xa_alloc; in xas_alloc()
393 RCU_INIT_POINTER(node->parent, xas->xa_node); in xas_alloc()
440 struct xa_node *node = xas->xa_node; in xas_shrink()
455 xas->xa_node = XAS_BOUNDS; in xas_shrink()
483 struct xa_node *node = xas->xa_node; in xas_delete_node()
486 struct xa_node *parent; in xas_delete_node()
493 xas->xa_node = parent; in xas_delete_node()
499 xas->xa_node = XAS_BOUNDS; in xas_delete_node()
523 static void xas_free_nodes(struct xa_state *xas, struct xa_node *top) in xas_free_nodes()
526 struct xa_node *node = top; in xas_free_nodes()
540 struct xa_node *parent; in xas_free_nodes()
562 struct xa_node *node = NULL; in xas_expand()
576 xas->xa_node = NULL; in xas_expand()
622 xas->xa_node = node; in xas_expand()
644 struct xa_node *node = xas->xa_node; in xas_create()
650 xas->xa_node = NULL; in xas_create()
711 if (xas_is_node(xas) && xas->xa_node->shift == xas->xa_shift) in xas_create_range()
725 struct xa_node *node = xas->xa_node; in xas_create_range()
728 xas->xa_node = xa_parent_locked(xas->xa, node); in xas_create_range()
742 if (xas->xa_node) in xas_create_range()
747 static void update_node(struct xa_state *xas, struct xa_node *node, in update_node()
777 struct xa_node *node; in xas_store()
794 node = xas->xa_node; in xas_store()
861 if (!xas->xa_node) in xas_get_mark()
863 return node_get_mark(xas->xa_node, xas->xa_offset, mark); in xas_get_mark()
878 struct xa_node *node = xas->xa_node; in xas_set_mark()
907 struct xa_node *node = xas->xa_node; in xas_clear_mark()
956 static unsigned int node_get_marks(struct xa_node *node, unsigned int offset) in node_get_marks()
972 static void node_set_marks(struct xa_node *node, unsigned int offset, in node_set_marks()
973 struct xa_node *child, unsigned int marks) in node_set_marks()
1018 struct xa_node *node; in xas_split_alloc()
1058 struct xa_node *node; in xas_split()
1062 node = xas->xa_node; in xas_split()
1071 struct xa_node *child = xas->xa_alloc; in xas_split()
1122 struct xa_node *node = xas->xa_node; in xas_pause()
1127 xas->xa_node = XAS_RESTART; in xas_pause()
1136 xas->xa_node = XAS_BOUNDS; in xas_pause()
1154 if (!xas_frozen(xas->xa_node)) in __xas_prev()
1156 if (!xas->xa_node) in __xas_prev()
1158 if (xas_not_node(xas->xa_node)) in __xas_prev()
1161 if (xas->xa_offset != get_offset(xas->xa_index, xas->xa_node)) in __xas_prev()
1165 xas->xa_offset = xas->xa_node->offset - 1; in __xas_prev()
1166 xas->xa_node = xa_parent(xas->xa, xas->xa_node); in __xas_prev()
1167 if (!xas->xa_node) in __xas_prev()
1172 entry = xa_entry(xas->xa, xas->xa_node, xas->xa_offset); in __xas_prev()
1176 xas->xa_node = xa_to_node(entry); in __xas_prev()
1193 if (!xas_frozen(xas->xa_node)) in __xas_next()
1195 if (!xas->xa_node) in __xas_next()
1197 if (xas_not_node(xas->xa_node)) in __xas_next()
1200 if (xas->xa_offset != get_offset(xas->xa_index, xas->xa_node)) in __xas_next()
1204 xas->xa_offset = xas->xa_node->offset + 1; in __xas_next()
1205 xas->xa_node = xa_parent(xas->xa, xas->xa_node); in __xas_next()
1206 if (!xas->xa_node) in __xas_next()
1211 entry = xa_entry(xas->xa, xas->xa_node, xas->xa_offset); in __xas_next()
1215 xas->xa_node = xa_to_node(entry); in __xas_next()
1241 if (xas_error(xas) || xas->xa_node == XAS_BOUNDS) in xas_find()
1246 if (!xas->xa_node) { in xas_find()
1249 } else if (xas->xa_node == XAS_RESTART) { in xas_find()
1251 if (entry || xas_not_node(xas->xa_node)) in xas_find()
1253 } else if (!xas->xa_node->shift && in xas_find()
1260 while (xas->xa_node && (xas->xa_index <= max)) { in xas_find()
1262 xas->xa_offset = xas->xa_node->offset + 1; in xas_find()
1263 xas->xa_node = xa_parent(xas->xa, xas->xa_node); in xas_find()
1267 entry = xa_entry(xas->xa, xas->xa_node, xas->xa_offset); in xas_find()
1269 xas->xa_node = xa_to_node(entry); in xas_find()
1279 if (!xas->xa_node) in xas_find()
1280 xas->xa_node = XAS_BOUNDS; in xas_find()
1317 if (!xas->xa_node) { in xas_find_marked()
1320 } else if (xas_top(xas->xa_node)) { in xas_find_marked()
1323 xas->xa_node = NULL; in xas_find_marked()
1332 xas->xa_node = xa_to_node(entry); in xas_find_marked()
1333 xas->xa_offset = xas->xa_index >> xas->xa_node->shift; in xas_find_marked()
1338 xas->xa_offset = xas->xa_node->offset + 1; in xas_find_marked()
1339 xas->xa_node = xa_parent(xas->xa, xas->xa_node); in xas_find_marked()
1340 if (!xas->xa_node) in xas_find_marked()
1347 entry = xa_entry(xas->xa, xas->xa_node, xas->xa_offset); in xas_find_marked()
1366 entry = xa_entry(xas->xa, xas->xa_node, xas->xa_offset); in xas_find_marked()
1371 xas->xa_node = xa_to_node(entry); in xas_find_marked()
1380 xas->xa_node = XAS_RESTART; in xas_find_marked()
1401 if (!xas->xa_node) in xas_find_conflict()
1404 if (xas_top(xas->xa_node)) { in xas_find_conflict()
1409 struct xa_node *node = xa_to_node(curr); in xas_find_conflict()
1416 if (xas->xa_node->shift > xas->xa_shift) in xas_find_conflict()
1420 if (xas->xa_node->shift == xas->xa_shift) { in xas_find_conflict()
1424 xas->xa_offset = xas->xa_node->offset; in xas_find_conflict()
1425 xas->xa_node = xa_parent_locked(xas->xa, xas->xa_node); in xas_find_conflict()
1426 if (!xas->xa_node) in xas_find_conflict()
1430 curr = xa_entry_locked(xas->xa, xas->xa_node, ++xas->xa_offset); in xas_find_conflict()
1434 xas->xa_node = xa_to_node(curr); in xas_find_conflict()
1436 curr = xa_entry_locked(xas->xa, xas->xa_node, 0); in xas_find_conflict()
1476 curr = xas->xa_node; in xas_result()
1764 if (!xas->xa_node) in xas_get_order()
1772 if (!xa_is_sibling(xa_entry(xas->xa, xas->xa_node, slot))) in xas_get_order()
1777 order += xas->xa_node->shift; in xas_get_order()
1842 if (xas.xa_node == XAS_RESTART) in __xa_alloc()
2053 struct xa_node *node = xas->xa_node; in xas_sibling()
2198 void xa_delete_node(struct xa_node *node, xa_update_node_t update) in xa_delete_node()
2206 .xa_node = xa_parent_locked(node->array, node), in xa_delete_node()
2230 xas.xa_node = NULL; in xa_destroy()
2245 void xa_dump_node(const struct xa_node *node) in xa_dump_node()
2289 struct xa_node *node = xa_to_node(entry); in xa_dump_entry()