函数逻辑报告 |
Source Code:kernel\bpf\bpf_lru_list.c |
Create Date:2022-07-27 14:28:50 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| 首页 | 函数Tree |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称：bpf_lru_list_count_dec
函数原型：static void bpf_lru_list_count_dec(struct bpf_lru_list *l, enum bpf_lru_list_type type)
返回类型：void
参数：
| 类型 | 参数 | 名称 |
|---|---|---|
| struct bpf_lru_list * | l | |
| enum bpf_lru_list_type | type |
| 57 | 如果type小于NR_BPF_LRU_LIST_COUNT则counts[type]自减 |
| 名称 | 描述 |
|---|---|
| __bpf_lru_node_move_to_free | |
| __bpf_lru_node_move | Move nodes between or within active and inactive list (like* active to inactive, inactive to active or tail of active back to* the head of active). |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持：c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现：逻辑报告 代码生成和批量转换代码 |