338 	if (root->rnode == NULL) {  in radix_tree_extend()
360 		slot = root->rnode;  in radix_tree_extend()
367 		rcu_assign_pointer(root->rnode, node);  in radix_tree_extend()
404 	slot = indirect_to_ptr(root->rnode);  in __radix_tree_create()
422 				rcu_assign_pointer(root->rnode, ptr_to_indirect(slot));  in __radix_tree_create()
436 		*slotp = node ? node->slots + offset : (void **)&root->rnode;  in __radix_tree_create()
498 	node = rcu_dereference_raw(root->rnode);  in __radix_tree_lookup()
509 			*slotp = (void **)&root->rnode;  in __radix_tree_lookup()
601 	slot = indirect_to_ptr(root->rnode);  in radix_tree_tag_set()
651 	slot = indirect_to_ptr(root->rnode);  in radix_tree_tag_clear()
712 	node = rcu_dereference_raw(root->rnode);  in radix_tree_tag_get()
756 	struct radix_tree_node *rnode, *node;  in radix_tree_next_chunk()  local
775 	rnode = rcu_dereference_raw(root->rnode);  in radix_tree_next_chunk()
776 	if (radix_tree_is_indirect_ptr(rnode)) {  in radix_tree_next_chunk()
777 		rnode = indirect_to_ptr(rnode);  in radix_tree_next_chunk()
778 	} else if (rnode && !index) {  in radix_tree_next_chunk()
783 		return (void **)&root->rnode;  in radix_tree_next_chunk()
788 	height = rnode->path & RADIX_TREE_HEIGHT_MASK;  in radix_tree_next_chunk()
796 	node = rnode;  in radix_tree_next_chunk()
916 	slot = indirect_to_ptr(root->rnode);  in radix_tree_range_tag_if_tagged()
1221 		node = rcu_dereference_raw(root->rnode);  in radix_tree_locate_item()
1259 		struct radix_tree_node *to_free = root->rnode;  in radix_tree_shrink()
1286 		root->rnode = slot;  in radix_tree_shrink()
1335 			if (node == indirect_to_ptr(root->rnode)) {  in __radix_tree_delete_node()
1353 			root->rnode = NULL;  in __radix_tree_delete_node()
1394 		root->rnode = NULL;  in radix_tree_delete_item()