1236 	void *curr;  in xas_find_conflict()  local
1245 		curr = xas_start(xas);  in xas_find_conflict()
1246 		if (!curr)  in xas_find_conflict()
1248 		while (xa_is_node(curr)) {  in xas_find_conflict()
1249 			struct xa_node *node = xa_to_node(curr);  in xas_find_conflict()
1250 			curr = xas_descend(xas, node);  in xas_find_conflict()
1252 		if (curr)  in xas_find_conflict()
1253 			return curr;  in xas_find_conflict()
1270 		curr = xa_entry_locked(xas->xa, xas->xa_node, ++xas->xa_offset);  in xas_find_conflict()
1271 		if (xa_is_sibling(curr))  in xas_find_conflict()
1273 		while (xa_is_node(curr)) {  in xas_find_conflict()
1274 			xas->xa_node = xa_to_node(curr);  in xas_find_conflict()
1276 			curr = xa_entry_locked(xas->xa, xas->xa_node, 0);  in xas_find_conflict()
1278 		if (curr)  in xas_find_conflict()
1279 			return curr;  in xas_find_conflict()
1311 static void *xas_result(struct xa_state *xas, void *curr)  in xas_result()  argument
1313 	if (xa_is_zero(curr))  in xas_result()
1316 		curr = xas->xa_node;  in xas_result()
1317 	return curr;  in xas_result()
1381 	void *curr;  in __xa_store()  local
1389 		curr = xas_store(&xas, entry);  in __xa_store()
1394 	return xas_result(&xas, curr);  in __xa_store()
1417 	void *curr;  in xa_store()  local
1420 	curr = __xa_store(xa, index, entry, gfp);  in xa_store()
1423 	return curr;  in xa_store()
1447 	void *curr;  in __xa_cmpxchg()  local
1453 		curr = xas_load(&xas);  in __xa_cmpxchg()
1454 		if (curr == old) {  in __xa_cmpxchg()
1456 			if (xa_track_free(xa) && entry && !curr)  in __xa_cmpxchg()
1461 	return xas_result(&xas, curr);  in __xa_cmpxchg()
1484 	void *curr;  in __xa_insert()  local
1492 		curr = xas_load(&xas);  in __xa_insert()
1493 		if (!curr) {  in __xa_insert()