333 	if (root->rnode == NULL) {  in radix_tree_extend()
355 		slot = root->rnode;  in radix_tree_extend()
362 		rcu_assign_pointer(root->rnode, node);  in radix_tree_extend()
399 	slot = indirect_to_ptr(root->rnode);  in __radix_tree_create()
417 				rcu_assign_pointer(root->rnode, ptr_to_indirect(slot));  in __radix_tree_create()
431 		*slotp = node ? node->slots + offset : (void **)&root->rnode;  in __radix_tree_create()
493 	node = rcu_dereference_raw(root->rnode);  in __radix_tree_lookup()
504 			*slotp = (void **)&root->rnode;  in __radix_tree_lookup()
596 	slot = indirect_to_ptr(root->rnode);  in radix_tree_tag_set()
646 	slot = indirect_to_ptr(root->rnode);  in radix_tree_tag_clear()
707 	node = rcu_dereference_raw(root->rnode);  in radix_tree_tag_get()
751 	struct radix_tree_node *rnode, *node;  in radix_tree_next_chunk()  local
770 	rnode = rcu_dereference_raw(root->rnode);  in radix_tree_next_chunk()
771 	if (radix_tree_is_indirect_ptr(rnode)) {  in radix_tree_next_chunk()
772 		rnode = indirect_to_ptr(rnode);  in radix_tree_next_chunk()
773 	} else if (rnode && !index) {  in radix_tree_next_chunk()
778 		return (void **)&root->rnode;  in radix_tree_next_chunk()
783 	height = rnode->path & RADIX_TREE_HEIGHT_MASK;  in radix_tree_next_chunk()
791 	node = rnode;  in radix_tree_next_chunk()
911 	slot = indirect_to_ptr(root->rnode);  in radix_tree_range_tag_if_tagged()
1216 		node = rcu_dereference_raw(root->rnode);  in radix_tree_locate_item()
1254 		struct radix_tree_node *to_free = root->rnode;  in radix_tree_shrink()
1281 		root->rnode = slot;  in radix_tree_shrink()
1330 			if (node == indirect_to_ptr(root->rnode)) {  in __radix_tree_delete_node()
1348 			root->rnode = NULL;  in __radix_tree_delete_node()
1389 		root->rnode = NULL;  in radix_tree_delete_item()