33 	return &loc_l->lists[LOCAL_FREE_LIST_IDX];  in local_free_list()
38 	return &loc_l->lists[LOCAL_PENDING_LIST_IDX];  in local_pending_list()
93 	list_move(&node->list, &l->lists[tgt_type]);  in __bpf_lru_node_move_in()
121 	list_move(&node->list, &l->lists[tgt_type]);  in __bpf_lru_node_move()
142 	struct list_head *active = &l->lists[BPF_LRU_LIST_T_ACTIVE];  in __bpf_lru_list_rotate_active()
169 	struct list_head *inactive = &l->lists[BPF_LRU_LIST_T_INACTIVE];  in __bpf_lru_list_rotate_inactive()
212 	struct list_head *inactive = &l->lists[BPF_LRU_LIST_T_INACTIVE];  in __bpf_lru_list_shrink_inactive()
272 	if (!list_empty(&l->lists[BPF_LRU_LIST_T_INACTIVE]))  in __bpf_lru_list_shrink()
273 		force_shrink_list = &l->lists[BPF_LRU_LIST_T_INACTIVE];  in __bpf_lru_list_shrink()
275 		force_shrink_list = &l->lists[BPF_LRU_LIST_T_ACTIVE];  in __bpf_lru_list_shrink()
331 	list_for_each_entry_safe(node, tmp_node, &l->lists[BPF_LRU_LIST_T_FREE],  in bpf_lru_list_pop_free_to_local()
414 	free_list = &l->lists[BPF_LRU_LIST_T_FREE];  in bpf_percpu_lru_pop_free()
571 		list_add(&node->list, &l->lists[BPF_LRU_LIST_T_FREE]);  in bpf_common_lru_populate()
597 		list_add(&node->list, &l->lists[BPF_LRU_LIST_T_FREE]);  in bpf_percpu_lru_populate()
623 		INIT_LIST_HEAD(&loc_l->lists[i]);  in bpf_lru_locallist_init()
635 		INIT_LIST_HEAD(&l->lists[i]);  in bpf_lru_list_init()
640 	l->next_inactive_rotation = &l->lists[BPF_LRU_LIST_T_INACTIVE];  in bpf_lru_list_init()