108 	void __rcu **ptr = node;  in is_sibling_entry()
121 get_slot_offset(const struct radix_tree_node *parent, void __rcu **slot)  in get_slot_offset()
130 	void __rcu **entry = rcu_dereference_raw(parent->slots[offset]);  in radix_tree_descend()
135 			void __rcu **sibentry;  in radix_tree_descend()
136 			sibentry = (void __rcu **) entry_to_node(entry);  in radix_tree_descend()
667 		node->slots[0] = (void __rcu *)entry;  in radix_tree_extend()
716 		root->rnode = (void __rcu *)child;  in radix_tree_shrink()
740 			node->slots[0] = (void __rcu *)RADIX_TREE_RETRY;  in radix_tree_shrink()
813 			void __rcu ***slotp)  in __radix_tree_create()
816 	void __rcu **slot = (void __rcu **)&root->rnode;  in __radix_tree_create()
899 		void __rcu **slot, void *item, unsigned order, bool replace)  in insert_entries()
962 		void __rcu **slot, void *item, unsigned order, bool replace)  in insert_entries()
989 	void __rcu **slot;  in __radix_tree_insert()
1031 			  void __rcu ***slotp)  in __radix_tree_lookup()
1035 	void __rcu **slot;  in __radix_tree_lookup()
1039 	slot = (void __rcu **)&root->rnode;  in __radix_tree_lookup()
1074 void __rcu **radix_tree_lookup_slot(const struct radix_tree_root *root,  in radix_tree_lookup_slot()
1077 	void __rcu **slot;  in radix_tree_lookup_slot()
1104 				void __rcu **slot, int count, int exceptional)  in replace_sibling_entries()
1123 static void replace_slot(void __rcu **slot, void *item,  in replace_slot()
1155 				struct radix_tree_node *node, void __rcu **slot,  in calculate_count()
1182 			  void __rcu **slot, void *item,  in __radix_tree_replace()
1195 	WARN_ON_ONCE(!node && (slot != (void __rcu **)&root->rnode) &&  in __radix_tree_replace()
1225 			     void __rcu **slot, void *item)  in radix_tree_replace_slot()
1242 				void __rcu **slot, void *item)  in radix_tree_iter_replace()
1266 	void __rcu **slot;  in radix_tree_join()
1301 	void __rcu **slot;  in radix_tree_split()
1612 static void __rcu **skip_siblings(struct radix_tree_node **nodep,  in skip_siblings()
1613 			void __rcu **slot, struct radix_tree_iter *iter)  in skip_siblings()
1628 void __rcu **__radix_tree_next_slot(void __rcu **slot,  in __radix_tree_next_slot()
1682 static void __rcu **skip_siblings(struct radix_tree_node **nodep,  in skip_siblings()
1683 			void __rcu **slot, struct radix_tree_iter *iter)  in skip_siblings()
1689 void __rcu **radix_tree_iter_resume(void __rcu **slot,  in radix_tree_iter_resume()
1711 void __rcu **radix_tree_next_chunk(const struct radix_tree_root *root,  in radix_tree_next_chunk()
1748 		return (void __rcu **)&root->rnode;  in radix_tree_next_chunk()
1827 	void __rcu **slot;  in radix_tree_gang_lookup()
1869 			void __rcu ***results, unsigned long *indices,  in radix_tree_gang_lookup_slot()
1873 	void __rcu **slot;  in radix_tree_gang_lookup_slot()
1910 	void __rcu **slot;  in radix_tree_gang_lookup_tag()
1947 		void __rcu ***results, unsigned long first_index,  in radix_tree_gang_lookup_tag_slot()
1951 	void __rcu **slot;  in radix_tree_gang_lookup_tag_slot()
1985 				struct radix_tree_node *node, void __rcu **slot)  in __radix_tree_delete()
2015 				struct radix_tree_iter *iter, void __rcu **slot)  in radix_tree_iter_delete()
2037 	void __rcu **slot = NULL;  in radix_tree_delete_item()
2073 			   void __rcu **slot)  in radix_tree_clear_tags()
2130 void __rcu **idr_get_free(struct radix_tree_root *root,  in idr_get_free()
2135 	void __rcu **slot = (void __rcu **)&root->rnode;  in idr_get_free()