1058 	void *curr = xas_load(xas);  in xas_split()  local
1082 			if (xa_is_value(curr))  in xas_split()
1093 			values += (xa_is_value(entry) - xa_is_value(curr)) *  in xas_split()
1395 	void *curr;  in xas_find_conflict()  local
1404 		curr = xas_start(xas);  in xas_find_conflict()
1405 		if (!curr)  in xas_find_conflict()
1407 		while (xa_is_node(curr)) {  in xas_find_conflict()
1408 			struct xa_node *node = xa_to_node(curr);  in xas_find_conflict()
1409 			curr = xas_descend(xas, node);  in xas_find_conflict()
1411 		if (curr)  in xas_find_conflict()
1412 			return curr;  in xas_find_conflict()
1429 		curr = xa_entry_locked(xas->xa, xas->xa_node, ++xas->xa_offset);  in xas_find_conflict()
1430 		if (xa_is_sibling(curr))  in xas_find_conflict()
1432 		while (xa_is_node(curr)) {  in xas_find_conflict()
1433 			xas->xa_node = xa_to_node(curr);  in xas_find_conflict()
1435 			curr = xa_entry_locked(xas->xa, xas->xa_node, 0);  in xas_find_conflict()
1437 		if (curr)  in xas_find_conflict()
1438 			return curr;  in xas_find_conflict()
1470 static void *xas_result(struct xa_state *xas, void *curr)  in xas_result()  argument
1472 	if (xa_is_zero(curr))  in xas_result()
1475 		curr = xas->xa_node;  in xas_result()
1476 	return curr;  in xas_result()
1540 	void *curr;  in __xa_store()  local
1548 		curr = xas_store(&xas, entry);  in __xa_store()
1553 	return xas_result(&xas, curr);  in __xa_store()
1576 	void *curr;  in xa_store()  local
1579 	curr = __xa_store(xa, index, entry, gfp);  in xa_store()
1582 	return curr;  in xa_store()
1606 	void *curr;  in __xa_cmpxchg()  local
1612 		curr = xas_load(&xas);  in __xa_cmpxchg()
1613 		if (curr == old) {  in __xa_cmpxchg()
1615 			if (xa_track_free(xa) && entry && !curr)  in __xa_cmpxchg()
1620 	return xas_result(&xas, curr);  in __xa_cmpxchg()
1643 	void *curr;  in __xa_insert()  local
1651 		curr = xas_load(&xas);  in __xa_insert()
1652 		if (!curr) {  in __xa_insert()