函数逻辑报告 |
Source Code:lib\radix-tree.c |
Create Date:2022-07-27 07:10:14 |
| Last Modify:2022-05-21 10:04:37 | Copyright©Brick |
| 首页 | 函数Tree |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称:adix_tree_find_next_bit - find the next set bit in a memory region*@addr: The address to base the search on*@size: The bitmap size in bits*@offset: The bitnumber to start searching at* Unrollable variant of find_next_bit() for constant size arrays.
函数原型:static __always_inline unsigned long radix_tree_find_next_bit(struct xa_node *node, unsigned int tag, unsigned long offset)
返回类型:unsigned long
参数:
| 类型 | 参数 | 名称 |
|---|---|---|
| struct xa_node * | node | |
| unsigned int | tag | |
| unsigned long | offset |
| 194 | 如果offset小于RADIX_TREE_MAP_SIZE则 |
| 197 | addr加等于offset除BITS_PER_LONG |
| 198 | tmp等于addr右移offset取模BITS_PER_LONG位 |
| 199 | 如果tmp则返回:在字中找到第一个指定位加offset |
| 201 | offset等于offset加BITS_PER_LONG按位与BITS_PER_LONG减1的差的反 |
| 202 | 当offset小于RADIX_TREE_MAP_SIZE循环 |
| 209 | 返回:RADIX_TREE_MAP_SIZE |
| 名称 | 描述 |
|---|---|
| radix_tree_next_chunk | 在radix树中找到下一个块的迭代 |
| idr_get_free |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |