radix_tree_iter

Name:adix_tree_iter_retry - retry this chunk of the iteration*@iter: iterator state* If we iterate over a tree protected only by the RCU lock, a race* against deletion or creation may result in seeing a slot for which* radix_tree_deref_retry() returns true

Proto:static inline __must_check void __rcu **radix_tree_iter_retry(struct radix_tree_iter *iter)

Type:void

Parameter:

Type	Parameter	Name
struct radix_tree_iter *	iter

**Caller**
Name	Describe
radix_tree_gang_lookup	adix_tree_gang_lookup - perform multiple lookup on a radix tree@root: radix tree root@results: where the results of the lookup are placed@first_index: start the lookup from this key@max_items: place up to this many items at *results
radix_tree_gang_lookup_tag	adix_tree_gang_lookup_tag - perform multiple lookup on a radix tree* based on a tag@root: radix tree root@results: where the results of the lookup are placed@first_index: start the lookup from this key@max_items: place up to this many items at
idr_get_next_ul	dr_get_next_ul() - Find next populated entry.@idr: IDR handle.@nextid: Pointer to an ID.* Returns the next populated entry in the tree with an ID greater than* or equal to the value pointed to by @nextid. On exit, @nextid is updated

Function report