691 		void __rcu **slot, void *item, bool replace)  in insert_entries()  argument
695 	rcu_assign_pointer(*slot, item);  in insert_entries()
698 		if (xa_is_value(item))  in insert_entries()
713 			void *item)  in radix_tree_insert()  argument
719 	BUG_ON(radix_tree_is_internal_node(item));  in radix_tree_insert()
725 	error = insert_entries(node, slot, item, false);  in radix_tree_insert()
832 static void replace_slot(void __rcu **slot, void *item,  in replace_slot()  argument
840 	rcu_assign_pointer(*slot, item);  in replace_slot()
861 				void *item, void *old)  in calculate_count()  argument
871 	return !!item - !!old;  in calculate_count()
886 			  void __rcu **slot, void *item)  in __radix_tree_replace()  argument
889 	int values = !!xa_is_value(item) - !!xa_is_value(old);  in __radix_tree_replace()
890 	int count = calculate_count(root, node, slot, item, old);  in __radix_tree_replace()
899 	replace_slot(slot, item, node, count, values);  in __radix_tree_replace()
924 			     void __rcu **slot, void *item)  in radix_tree_replace_slot()  argument
926 	__radix_tree_replace(root, NULL, slot, item);  in radix_tree_replace_slot()
941 				void __rcu **slot, void *item)  in radix_tree_iter_replace()  argument
943 	__radix_tree_replace(root, iter->node, slot, item);  in radix_tree_iter_replace()
1423 			     unsigned long index, void *item)  in radix_tree_delete_item()  argument
1436 	if (item && entry != item)  in radix_tree_delete_item()