271 	struct xa_node *next, *node = xas->xa_alloc;  in xas_destroy()  local
275 		next = rcu_dereference_raw(node->parent);  in xas_destroy()
277 		xas->xa_alloc = node = next;  in xas_destroy()
783 	void *first, *next;  in xas_store()  local
801 	next = first;  in xas_store()
821 		if (xa_is_node(next) && (!node || node->shift))  in xas_store()
822 			xas_free_nodes(xas, xa_to_node(next));  in xas_store()
825 		count += !next - !entry;  in xas_store()
836 		next = xa_entry_locked(xas->xa, node, ++offset);  in xas_store()
837 		if (!xa_is_sibling(next)) {  in xas_store()
840 			first = next;  in xas_store()
1895 		struct xa_limit limit, u32 *next, gfp_t gfp)  in __xa_alloc_cyclic()  argument
1900 	limit.min = max(min, *next);  in __xa_alloc_cyclic()
1915 		*next = *id + 1;  in __xa_alloc_cyclic()
1916 		if (*next == 0)  in __xa_alloc_cyclic()
2276 		node->array, node->private_list.prev, node->private_list.next);  in xa_dump_node()