BPF_LRU_LIST_T_FREE
__bpf_lru_node_move(l, node, BPF_LRU_LIST_T_FREE);
list_for_each_entry_safe(node, tmp_node, &l->lists[BPF_LRU_LIST_T_FREE],
free_list = &l->lists[BPF_LRU_LIST_T_FREE];
BPF_LRU_LIST_T_FREE);
if (WARN_ON_ONCE(node_type == BPF_LRU_LIST_T_FREE) ||
__bpf_lru_node_move(l, node, BPF_LRU_LIST_T_FREE);
node->type = BPF_LRU_LIST_T_FREE;
list_add(&node->list, &l->lists[BPF_LRU_LIST_T_FREE]);
node->type = BPF_LRU_LIST_T_FREE;
list_add(&node->list, &l->lists[BPF_LRU_LIST_T_FREE]);