231 	node->slots[0] = NULL;  in radix_tree_node_rcu_free()
360 		node->slots[0] = slot;  in radix_tree_extend()
413 				rcu_assign_pointer(node->slots[offset], slot);  in __radix_tree_create()
423 		slot = node->slots[offset];  in __radix_tree_create()
431 		*slotp = node ? node->slots + offset : (void **)&root->rnode;  in __radix_tree_create()
517 		slot = node->slots + ((index >> shift) & RADIX_TREE_MAP_MASK);  in __radix_tree_lookup()
605 		slot = slot->slots[offset];  in radix_tree_tag_set()
655 		slot = slot->slots[offset];  in radix_tree_tag_clear()
732 		node = rcu_dereference_raw(node->slots[offset]);  in radix_tree_tag_get()
795 				!node->slots[offset]) {  in radix_tree_next_chunk()
807 					if (node->slots[offset])  in radix_tree_next_chunk()
823 		node = rcu_dereference_raw(node->slots[offset]);  in radix_tree_next_chunk()
852 	return node->slots + offset;  in radix_tree_next_chunk()
918 		if (!slot->slots[offset])  in radix_tree_range_tag_if_tagged()
926 			slot = slot->slots[offset];  in radix_tree_range_tag_if_tagged()
1168 			if (slot->slots[i] != NULL)  in __locate()
1180 		slot = rcu_dereference_raw(slot->slots[i]);  in __locate()
1187 		if (slot->slots[i] == item) {  in __locate()
1266 		if (!to_free->slots[0])  in radix_tree_shrink()
1276 		slot = to_free->slots[0];  in radix_tree_shrink()
1303 			*((unsigned long *)&to_free->slots[0]) |=  in radix_tree_shrink()
1343 			parent->slots[offset] = NULL;  in __radix_tree_delete_node()
1404 	node->slots[offset] = NULL;  in radix_tree_delete_item()