98 	void __rcu **entry = rcu_dereference_raw(parent->slots[offset]);  in radix_tree_descend()  local
100 	*nodep = (void *)entry;  in radix_tree_descend()
420 	void *entry;  in radix_tree_extend()  local
429 	entry = rcu_dereference_raw(root->xa_head);  in radix_tree_extend()
430 	if (!entry && (!is_idr(root) || root_tag_get(root, IDR_FREE)))  in radix_tree_extend()
454 		if (radix_tree_is_internal_node(entry)) {  in radix_tree_extend()
455 			entry_to_node(entry)->parent = node;  in radix_tree_extend()
456 		} else if (xa_is_value(entry)) {  in radix_tree_extend()
464 		node->slots[0] = (void __rcu *)entry;  in radix_tree_extend()
465 		entry = node_to_entry(node);  in radix_tree_extend()
466 		rcu_assign_pointer(root->xa_head, entry);  in radix_tree_extend()
671 		void *entry = rcu_dereference_raw(child->slots[offset]);  in radix_tree_free_nodes()  local
672 		if (xa_is_node(entry) && child->shift) {  in radix_tree_free_nodes()
673 			child = entry_to_node(entry);  in radix_tree_free_nodes()
1427 	void *entry;  in radix_tree_delete_item()  local
1429 	entry = __radix_tree_lookup(root, index, &node, &slot);  in radix_tree_delete_item()
1432 	if (!entry && (!is_idr(root) || node_tag_get(root, node, IDR_FREE,  in radix_tree_delete_item()
1436 	if (item && entry != item)  in radix_tree_delete_item()
1441 	return entry;  in radix_tree_delete_item()