kernel/bpf/bpf_lru_list.c

101 /* Move nodes between or within active and inactive list (like
102  * active to inactive, inactive to active or tail of active back to
141  *    inactive list.
163 /* Rotate the inactive list.  It starts from the next_inactive_rotation
174 	struct list_head *inactive = &l->lists[BPF_LRU_LIST_T_INACTIVE];  in __bpf_lru_list_rotate_inactive()  local
175 	struct list_head *cur, *last, *next = inactive;  in __bpf_lru_list_rotate_inactive()
179 	if (list_empty(inactive))  in __bpf_lru_list_rotate_inactive()
183 	if (last == inactive)  in __bpf_lru_list_rotate_inactive()
188 		if (cur == inactive) {  in __bpf_lru_list_rotate_inactive()
206 /* Shrink the inactive list.  It starts from the tail of the
207  * inactive list and only move the nodes without the ref bit
217 	struct list_head *inactive = &l->lists[BPF_LRU_LIST_T_INACTIVE];  in __bpf_lru_list_shrink_inactive()  local
222 	list_for_each_entry_safe_reverse(node, tmp_node, inactive, list) {  in __bpf_lru_list_shrink_inactive()
240  * 2. Always rotate the inactive list
256  * one node from either inactive or active list without
257  * honoring the ref-bit.  It prefers inactive list to active