函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:include\linux\radix-tree.h Create Date:2022-07-27 06:43:53
Last Modify:2020-03-12 14:18:49 Copyright©Brick
首页 函数Tree
注解内核,赢得工具下载SCCTEnglish

函数名称: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

函数原型:static inline __must_check void __rcu **radix_tree_iter_retry(struct radix_tree_iter *iter)

返回类型:void

参数:

类型参数名称
struct radix_tree_iter *iter
330  next_index等于index
331  tags等于0
332  返回:NULL
调用者
名称描述
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