776 	void *first, *next;  in xas_store()  local
794 	next = first;  in xas_store()
814 		if (xa_is_node(next) && (!node || node->shift))  in xas_store()
815 			xas_free_nodes(xas, xa_to_node(next));  in xas_store()
818 		count += !next - !entry;  in xas_store()
829 		next = xa_entry_locked(xas->xa, node, ++offset);  in xas_store()
830 		if (!xa_is_sibling(next)) {  in xas_store()
833 			first = next;  in xas_store()
1660 		struct xa_limit limit, u32 *next, gfp_t gfp)  in __xa_alloc_cyclic()  argument
1665 	limit.min = max(min, *next);  in __xa_alloc_cyclic()
1680 		*next = *id + 1;  in __xa_alloc_cyclic()
1681 		if (*next == 0)  in __xa_alloc_cyclic()
2017 		node->array, node->private_list.prev, node->private_list.next);  in xa_dump_node()