__bpf_lru_node

Name: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).

Proto:static void __bpf_lru_node_move(struct bpf_lru_list *l, struct bpf_lru_node *node, enum bpf_lru_list_type tgt_type)

Type:void

Parameter:

Type	Parameter	Name
struct bpf_lru_list *	l
struct bpf_lru_node *	node
enum bpf_lru_list_type	tgt_type

**Caller**
Name	Describe
__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

Function report