527 		 * also results in a stale slot). So tag the slot as indirect  in radix_tree_shrink()
1244  *	@results:	where the results of the lookup are placed
1246  *	@max_items:	place up to this many items at *results
1249  *	them at *@results and returns the number of items which were placed at
1250  *	*@results.
1255  *	rcu_read_lock. In this case, rather than the returned results being
1258  *	radix_tree_lookups have been issued in individual locks, and results
1259  *	stored in 'results'.
1262 radix_tree_gang_lookup(const struct radix_tree_root *root, void **results,  in radix_tree_gang_lookup()  argument
1273 		results[ret] = rcu_dereference_raw(*slot);  in radix_tree_gang_lookup()
1274 		if (!results[ret])  in radix_tree_gang_lookup()
1276 		if (radix_tree_is_internal_node(results[ret])) {  in radix_tree_gang_lookup()
1292  *	@results:	where the results of the lookup are placed
1294  *	@max_items:	place up to this many items at *results
1298  *	have the tag indexed by @tag set.  Places the items at *@results and
1299  *	returns the number of items which were placed at *@results.
1302 radix_tree_gang_lookup_tag(const struct radix_tree_root *root, void **results,  in radix_tree_gang_lookup_tag()  argument
1314 		results[ret] = rcu_dereference_raw(*slot);  in radix_tree_gang_lookup_tag()
1315 		if (!results[ret])  in radix_tree_gang_lookup_tag()
1317 		if (radix_tree_is_internal_node(results[ret])) {  in radix_tree_gang_lookup_tag()
1333  *	@results:	where the results of the lookup are placed
1335  *	@max_items:	place up to this many items at *results
1339  *	have the tag indexed by @tag set.  Places the slots at *@results and
1340  *	returns the number of slots which were placed at *@results.
1344 		void __rcu ***results, unsigned long first_index,  in radix_tree_gang_lookup_tag_slot()  argument
1355 		results[ret] = slot;  in radix_tree_gang_lookup_tag_slot()