233 	node->slots[0] = NULL;  in radix_tree_node_rcu_free()
365 		node->slots[0] = slot;  in radix_tree_extend()
418 				rcu_assign_pointer(node->slots[offset], slot);  in __radix_tree_create()
428 		slot = node->slots[offset];  in __radix_tree_create()
436 		*slotp = node ? node->slots + offset : (void **)&root->rnode;  in __radix_tree_create()
522 		slot = node->slots + ((index >> shift) & RADIX_TREE_MAP_MASK);  in __radix_tree_lookup()
610 		slot = slot->slots[offset];  in radix_tree_tag_set()
660 		slot = slot->slots[offset];  in radix_tree_tag_clear()
737 		node = rcu_dereference_raw(node->slots[offset]);  in radix_tree_tag_get()
800 				!node->slots[offset]) {  in radix_tree_next_chunk()
812 					if (node->slots[offset])  in radix_tree_next_chunk()
828 		node = rcu_dereference_raw(node->slots[offset]);  in radix_tree_next_chunk()
857 	return node->slots + offset;  in radix_tree_next_chunk()
923 		if (!slot->slots[offset])  in radix_tree_range_tag_if_tagged()
931 			slot = slot->slots[offset];  in radix_tree_range_tag_if_tagged()
1173 			if (slot->slots[i] != NULL)  in __locate()
1185 		slot = rcu_dereference_raw(slot->slots[i]);  in __locate()
1192 		if (slot->slots[i] == item) {  in __locate()
1271 		if (!to_free->slots[0])  in radix_tree_shrink()
1281 		slot = to_free->slots[0];  in radix_tree_shrink()
1308 			*((unsigned long *)&to_free->slots[0]) |=  in radix_tree_shrink()
1348 			parent->slots[offset] = NULL;  in __radix_tree_delete_node()
1409 	node->slots[offset] = NULL;  in radix_tree_delete_item()