525 		 * also results in a stale slot). So tag the slot as indirect  in radix_tree_shrink()
1243  *	@results:	where the results of the lookup are placed
1245  *	@max_items:	place up to this many items at *results
1248  *	them at *@results and returns the number of items which were placed at
1249  *	*@results.
1254  *	rcu_read_lock. In this case, rather than the returned results being
1257  *	radix_tree_lookups have been issued in individual locks, and results
1258  *	stored in 'results'.
1261 radix_tree_gang_lookup(const struct radix_tree_root *root, void **results,  in radix_tree_gang_lookup()  argument
1272 		results[ret] = rcu_dereference_raw(*slot);  in radix_tree_gang_lookup()
1273 		if (!results[ret])  in radix_tree_gang_lookup()
1275 		if (radix_tree_is_internal_node(results[ret])) {  in radix_tree_gang_lookup()
1291  *	@results:	where the results of the lookup are placed
1293  *	@max_items:	place up to this many items at *results
1297  *	have the tag indexed by @tag set.  Places the items at *@results and
1298  *	returns the number of items which were placed at *@results.
1301 radix_tree_gang_lookup_tag(const struct radix_tree_root *root, void **results,  in radix_tree_gang_lookup_tag()  argument
1313 		results[ret] = rcu_dereference_raw(*slot);  in radix_tree_gang_lookup_tag()
1314 		if (!results[ret])  in radix_tree_gang_lookup_tag()
1316 		if (radix_tree_is_internal_node(results[ret])) {  in radix_tree_gang_lookup_tag()
1332  *	@results:	where the results of the lookup are placed
1334  *	@max_items:	place up to this many items at *results
1338  *	have the tag indexed by @tag set.  Places the slots at *@results and
1339  *	returns the number of slots which were placed at *@results.
1343 		void __rcu ***results, unsigned long first_index,  in radix_tree_gang_lookup_tag_slot()  argument
1354 		results[ret] = slot;  in radix_tree_gang_lookup_tag_slot()