BPF_LRU_LIST_T_INACTIVE
return l->counts[BPF_LRU_LIST_T_INACTIVE] <
__bpf_lru_node_move(l, node, BPF_LRU_LIST_T_INACTIVE);
struct list_head *inactive = &l->lists[BPF_LRU_LIST_T_INACTIVE];
struct list_head *inactive = &l->lists[BPF_LRU_LIST_T_INACTIVE];
if (!list_empty(&l->lists[BPF_LRU_LIST_T_INACTIVE]))
force_shrink_list = &l->lists[BPF_LRU_LIST_T_INACTIVE];
BPF_LRU_LIST_T_INACTIVE);
__bpf_lru_node_move(l, node, BPF_LRU_LIST_T_INACTIVE);
l->next_inactive_rotation = &l->lists[BPF_LRU_LIST_T_INACTIVE];