bpf_lru_node
struct bpf_lru_node *node, *tmp_node, *first_node;
first_node = list_first_entry(active, struct bpf_lru_node, list);
struct bpf_lru_node *node;
node = list_entry(cur, struct bpf_lru_node, list);
struct bpf_lru_node *node, *tmp_node;
struct bpf_lru_node *node, *tmp_node;
struct bpf_lru_node *node, *tmp_node;
struct bpf_lru_node *node)
struct bpf_lru_node *node, *tmp_node;
static bool bpf_lru_node_is_ref(const struct bpf_lru_node *node)
struct bpf_lru_node *node,
static struct bpf_lru_node *
struct bpf_lru_node *node;
struct bpf_lru_node,
static struct bpf_lru_node *
struct bpf_lru_node *node;
static void bpf_lru_node_clear_ref(struct bpf_lru_node *node)
static struct bpf_lru_node *bpf_percpu_lru_pop_free(struct bpf_lru *lru,
struct bpf_lru_node *node = NULL;
node = list_first_entry(free_list, struct bpf_lru_node, list);
static struct bpf_lru_node *bpf_common_lru_pop_free(struct bpf_lru *lru,
struct bpf_lru_node *node;
struct bpf_lru_node *bpf_lru_pop_free(struct bpf_lru *lru, u32 hash)
struct bpf_lru_node *node)
struct bpf_lru_node *node)
void bpf_lru_push_free(struct bpf_lru *lru, struct bpf_lru_node *node)
struct bpf_lru_node *node;
node = (struct bpf_lru_node *)(buf + node_offset);
struct bpf_lru_node *node,
struct bpf_lru_node *node;
node = (struct bpf_lru_node *)(buf + node_offset);
struct bpf_lru_node *node,
struct bpf_lru_node *node,
typedef bool (*del_from_htab_func)(void *arg, struct bpf_lru_node *node);
static inline void bpf_lru_node_set_ref(struct bpf_lru_node *node)
struct bpf_lru_node *bpf_lru_pop_free(struct bpf_lru *lru, u32 hash);
void bpf_lru_push_free(struct bpf_lru *lru, struct bpf_lru_node *node);
struct bpf_lru_node lru_node;
static bool htab_lru_map_delete_node(void *arg, struct bpf_lru_node *node);
struct bpf_lru_node *node = bpf_lru_pop_free(&htab->lru, hash);
offsetof(struct bpf_lru_node, ref));
offsetof(struct bpf_lru_node, ref),
static bool htab_lru_map_delete_node(void *arg, struct bpf_lru_node *node)