__bpf_lru_list_rotate

函数名称：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

函数原型：static void __bpf_lru_list_rotate_active(struct bpf_lru *lru, struct bpf_lru_list *l)

返回类型：void

参数：

类型	参数	名称
struct bpf_lru *	lru
struct bpf_lru_list *	l

142

active等于lists[BPF_LRU_LIST_T_ACTIVE]

144

i等于0

146

first_node等于list_first_entry - get the first element from a list*@ptr: the list head to take the element from.*@type: the type of the struct this is embedded in.*@member: the name of the list_head within the struct.* Note, that list is expected to be not empty.(active, structbpf_lru_node, list)

148

如果pf_lru_node helpers 则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).

150

否则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).

153

如果i先自加恒等于nr_scans或node恒等于first_node则退出

**调用者**
名称	描述
__bpf_lru_list_rotate	1. Rotate the active list (if needed)* 2. Always rotate the inactive list

源代码转换工具开放的插件接口	X
支持：c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现：逻辑报告代码生成和批量转换代码

函数逻辑报告