函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:lib\idr.c Create Date:2022-07-27 07:11:03
Last Modify:2020-03-12 14:18:49 Copyright©Brick
首页 函数Tree
注解内核,赢得工具下载SCCTEnglish

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

函数原型：void *idr_get_next_ul(struct idr *idr, unsigned long *nextid)

返回类型：void

参数：

类型参数名称
struct idr *idr
unsigned long *nextid
230  __rcu乘slot
231  void * entry = NULL
232  base等于idr_base
233  id等于nextid
235  id等于如果id小于base则0否则id减base
237  entry等于Dependency order vs. p above. ( * slot)
238  如果非entry则继续下一循环
240  如果非xa_is_internal() - Is the entry an internal entry?*@entry: XArray entry.* Context: Any context.* Return: %true if the entry is an internal entry.则退出
242  如果slot不等于xa_head且非xa_is_retry() - Is the entry a retry entry?*@entry: Entry retrieved from the XArray* Return: %true if the entry is a retry entry.则退出
244  slot等于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
246  如果非slot则返回:NULL
249  nextid等于index加base
250  返回:entry
调用者
名称描述
idr_get_nextdr_get_next() - 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