Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:include\linux\radix-tree.h Create Date:2022-07-28 05:42:21
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

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:

TypeParameterName
struct radix_tree_iter *iter
330  next_index = index
331  tags = 0
332  Return NULL
Caller
NameDescribe
radix_tree_gang_lookupadix_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_tagadix_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_uldr_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