Lines Matching full:inactive

96 /* Move nodes between or within active and inactive list (like
97  * active to inactive, inactive to active or tail of active back to
136  *    inactive list.
158 /* Rotate the inactive list.  It starts from the next_inactive_rotation
169 	struct list_head *inactive = &l->lists[BPF_LRU_LIST_T_INACTIVE];  in __bpf_lru_list_rotate_inactive()  local
170 	struct list_head *cur, *last, *next = inactive;  in __bpf_lru_list_rotate_inactive()
174 	if (list_empty(inactive))  in __bpf_lru_list_rotate_inactive()
178 	if (last == inactive)  in __bpf_lru_list_rotate_inactive()
183 		if (cur == inactive) {  in __bpf_lru_list_rotate_inactive()
201 /* Shrink the inactive list.  It starts from the tail of the
202  * inactive list and only move the nodes without the ref bit
212 	struct list_head *inactive = &l->lists[BPF_LRU_LIST_T_INACTIVE];  in __bpf_lru_list_shrink_inactive()  local
217 	list_for_each_entry_safe_reverse(node, tmp_node, inactive, list) {  in __bpf_lru_list_shrink_inactive()
235  * 2. Always rotate the inactive list
251  * one node from either inactive or active list without
252  * honoring the ref-bit.  It prefers inactive list to active