函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:lib\radix-tree.c Create Date:2022-07-27 07:10:25
Last Modify:2022-05-21 10:04:37 Copyright©Brick
首页 函数Tree
注解内核,赢得工具下载SCCTEnglish

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

函数原型：unsigned int radix_tree_gang_lookup(const struct xarray *root, void **results, unsigned long first_index, unsigned int max_items)

返回类型：unsigned int

参数：

类型参数名称
const struct xarray *root
void **results
unsigned longfirst_index
unsigned intmax_items
1276  __rcu乘slot
1277  ret等于0
1279  如果此条件成立可能性小(为编译器优化)(!max_items)则返回:0
1283  results[ret]等于Dependency order vs. p above. ( * slot)
1284  如果非results[ret]则继续下一循环
1286  如果radix_tree_is_internal_node(results[ret])则
1287  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
1288  继续下一循环
1290  如果ret先自加恒等于max_items则退出
1294  返回:ret
调用者
名称描述
debug_dma_assert_idledebug_dma_assert_idle() - assert that a page is not undergoing dma*@page: page to lookup in the dma_active_cacheline tree* Place a call to this routine in cases where the cpu touching the page* before the dma completes (page is dma_unmapped) will lead to