函数逻辑报告 |
Source Code:kernel\bpf\bpf_lru_list.c |
Create Date:2022-07-27 14:28:53 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称: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).
函数原型:static void __bpf_lru_node_move(struct bpf_lru_list *l, struct bpf_lru_node *node, enum bpf_lru_list_type tgt_type)
返回类型:void
参数:
类型 | 参数 | 名称 |
---|---|---|
struct bpf_lru_list * | l | |
struct bpf_lru_node * | node | |
enum bpf_lru_list_type | tgt_type |
104 | 如果WARN_ON_ONCE(IS_LOCAL_LIST_TYPE(type))或WARN_ON_ONCE(IS_LOCAL_LIST_TYPE(tgt_type))则返回 |
113 | ref等于0 |
118 | 如果list恒等于 The next inacitve list rotation starts from here 则 The next inacitve list rotation starts from here 等于链表前项 |
121 | 链表项移动到头部 |
名称 | 描述 |
---|---|
__bpf_lru_list_rotate_active | Rotate the active list:* 1. Start from tail* 2. If the node has the ref bit set, it will be rotated* back to the head of active list with the ref bit cleared.* Give this node one more chance to survive in the active list.* 3 |
__bpf_lru_list_rotate_inactive | Rotate the inactive list. It starts from the next_inactive_rotation* 1. If the node has ref bit set, it will be moved to the head* of active list with the ref bit cleared.* 2. If the node does not have ref bit set, it will leave it |
__bpf_lru_list_shrink_inactive | Shrink the inactive list. It starts from the tail of the* inactive list and only move the nodes without the ref bit* set to the designated free list. |
bpf_lru_list_push_free | |
bpf_percpu_lru_pop_free | |
bpf_percpu_lru_push_free |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |