函数逻辑报告 |
Source Code:lib\lru_cache.c |
Create Date:2022-07-27 08:15:13 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:lc_create - prepares to track objects in an active set*@name: descriptive name only used in lc_seq_printf_stats and lc_seq_dump_details*@max_pending_changes: maximum changes to accumulate until a transaction is required*@e_count: number of elements
函数原型:struct lru_cache *lc_create(const char *name, struct kmem_cache *cache, unsigned max_pending_changes, unsigned e_count, size_t e_size, size_t e_off)
返回类型:struct lru_cache
参数:
类型 | 参数 | 名称 |
---|---|---|
const char * | name | |
struct kmem_cache * | cache | |
unsigned | max_pending_changes | |
unsigned | e_count | |
size_t | e_size | |
size_t | e_off |
91 | struct hlist_head * slot = NULL |
92 | struct lc_element * * element = NULL |
98 | WARN_ON(cache_obj_size < e_size) |
99 | 如果cache_obj_size小于e_size则返回:NULL |
118 | 初始化链表头 |
119 | 初始化链表头 |
120 | 初始化链表头 |
121 | 初始化链表头 |
127 | allow to accumulate a few (index:label) changes, * but no more than max_pending_changes 等于max_pending_changes |
129 | lc_element等于element |
130 | nr_elements there 等于slot |
134 | p等于kmem_cache_alloc(cache, GFP_KERNEL) |
140 | we want to track a larger set of objects,* it needs to become arch independend u64 等于special label when on free list |
142 | 添加链表项 |
154 | out_fail : |
157 | 返回:NULL |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |