Lines Matching refs:map
32 struct bpf_map map; member
227 static void *trie_lookup_elem(struct bpf_map *map, void *_key) in trie_lookup_elem() argument
229 struct lpm_trie *trie = container_of(map, struct lpm_trie, map); in trie_lookup_elem()
283 size += trie->map.value_size; in lpm_trie_node_alloc()
286 trie->map.numa_node); in lpm_trie_node_alloc()
294 trie->map.value_size); in lpm_trie_node_alloc()
300 static int trie_update_elem(struct bpf_map *map, in trie_update_elem() argument
303 struct lpm_trie *trie = container_of(map, struct lpm_trie, map); in trie_update_elem()
322 if (trie->n_entries == trie->map.max_entries) { in trie_update_elem()
431 static int trie_delete_elem(struct bpf_map *map, void *_key) in trie_delete_elem() argument
433 struct lpm_trie *trie = container_of(map, struct lpm_trie, map); in trie_delete_elem()
565 bpf_map_init_from_attr(&trie->map, attr); in trie_alloc()
574 ret = bpf_map_charge_init(&trie->map.memory, cost); in trie_alloc()
580 return &trie->map; in trie_alloc()
586 static void trie_free(struct bpf_map *map) in trie_free() argument
588 struct lpm_trie *trie = container_of(map, struct lpm_trie, map); in trie_free()
630 static int trie_get_next_key(struct bpf_map *map, void *_key, void *_next_key) in trie_get_next_key() argument
633 struct lpm_trie *trie = container_of(map, struct lpm_trie, map); in trie_get_next_key()
728 static int trie_check_btf(const struct bpf_map *map, in trie_check_btf() argument