函数逻辑报告 |
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 |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称：adix_tree_chunk_size - get current chunk size*@iter: pointer to radix tree iterator* Returns: current chunk size
函数原型：static __always_inline long radix_tree_chunk_size(struct radix_tree_iter *iter)
返回类型：long
参数：
| 类型 | 参数 | 名称 |
|---|---|---|
| struct radix_tree_iter * | iter |
| 363 | 返回:next_index减index |
| 名称 | 描述 |
|---|---|
| radix_tree_next_slot | adix_tree_next_slot - find next slot in chunk*@slot: pointer to current slot*@iter: pointer to interator state*@flags: RADIX_TREE_ITER_*, should be constant* Returns: pointer to next slot, or NULL if there no more left |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持：c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现：逻辑报告 代码生成和批量转换代码 |