函数逻辑报告 |
Source Code:fs\quota\quota_tree.c |
Create Date:2022-07-29 11:09:50 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:find_next_id
函数原型:static int find_next_id(struct qtree_mem_dqinfo *info, qid_t *id, unsigned int blk, int depth)
返回类型:int
参数:
类型 | 参数 | 名称 |
---|---|---|
struct qtree_mem_dqinfo * | info | |
qid_t * | id | |
unsigned int | blk | |
int | depth |
685 | epb等于Space usable in block for quota data 右移2位 |
686 | level_inc等于1 |
692 | 以i小于Precomputed depth of quota tree 减1循环level_inc乘等于epb |
696 | 如果ret小于0则 |
697 | quota_error(Sb quota is on , "Can't read quota tree block %u", blk) |
699 | 转到:out_buf |
702 | 如果ref[i]恒等于cpu_to_le32(0)则 |
706 | 如果depth恒等于Precomputed depth of quota tree 减1则 |
710 | ret等于find_next_id(info, id, le32_to_cpu(ref[i]), depth + 1) |
718 | out_buf : |
719 | 释放内存 |
720 | 返回:ret |
名称 | 描述 |
---|---|
find_next_id | |
qtree_get_next_id |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |