函数逻辑报告 |
Source Code:lib\lru_cache.c |
Create Date:2022-07-27 08:15:22 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:设置关联索引
函数原型:void lc_set(struct lru_cache *lc, unsigned int enr, int index)
返回类型:void
参数:
类型 | 参数 | 名称 |
---|---|---|
struct lru_cache * | lc | |
unsigned int | enr | |
int | index |
611 | 如果index小于0或index大于等于 number of elements (indices) 则返回 |
615 | BUG_ON( we want to track a larger set of objects,* it needs to become arch independend u64 != r pending changes ) |
618 | we want to track a larger set of objects,* it needs to become arch independend u64 等于r pending changes 等于enr |
619 | hlist_del_init( & colision) |
620 | 如果enr恒等于special label when on free list 则lh等于free |
622 | 否则 |
623 | hlist_add_head( & colision, lc_hash_slot(lc, enr)) |
626 | 链表项移动到头部 |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |