函数逻辑报告 |
Source Code:lib\radix-tree.c |
Create Date:2022-07-27 07:10:24 |
Last Modify:2022-05-21 10:04:37 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:在radix树中找到下一个块的迭代
函数原型:void __rcu **radix_tree_next_chunk(const struct xarray *root, struct radix_tree_iter *iter, unsigned flags)
返回类型:void
参数:
类型 | 参数 | 名称 |
---|---|---|
const struct xarray * | root | |
struct radix_tree_iter * | iter | |
unsigned | flags |
1167 | tag等于flags按位与RADIX_TREE_ITER_TAG_MASK |
1171 | 如果flags按位与RADIX_TREE_ITER_TAGGED且非root_tag_get(root, tag)则返回:NULL |
1183 | index等于next_index |
1187 | restart : |
1188 | radix_tree_load_root(root, & child, & maxindex) |
1191 | 如果非child则返回:NULL |
1194 | 如果非radix_tree_is_internal_node(child)则 |
1203 | 循环 |
1204 | node等于entry_to_node(child) |
1205 | offset等于radix_tree_descend(node, & child, index) |
1210 | 如果flags按位与RADIX_TREE_ITER_CONTIG则返回:NULL |
1216 | 否则当offset先自加小于RADIX_TREE_MAP_SIZE循环 |
1223 | index与等于node_maxindex(node)的反 |
1226 | 如果非index则返回:NULL |
1228 | 如果offset恒等于RADIX_TREE_MAP_SIZE则转到:restart |
1230 | child等于Dependency order vs. p above. (slots[offset]) |
1235 | 如果child恒等于RADIX_TREE_RETRY则退出 |
1240 | index等于index按位与node_maxindex(node)的反按位或offset |
1241 | next_index等于index按位或node_maxindex(node)的值加1 |
名称 | 描述 |
---|---|
radix_tree_iter_lookup | adix_tree_iter_lookup - look up an index in the radix tree*@root: radix tree root*@iter: iterator state*@index: key to look up* If @index is present in the radix tree, this function returns the slot* containing it and updates @iter to describe the entry |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |