inner_map - Linux

kernel/bpf/arraymap.c

1405

struct bpf_map **inner_map = array_map_lookup_elem(map, key);

kernel/bpf/arraymap.c

1407

if (!inner_map)

kernel/bpf/arraymap.c

1410

return READ_ONCE(*inner_map);

kernel/bpf/hashtab.c

1916

struct bpf_map **inner_map = value;

kernel/bpf/hashtab.c

1919

map_id = map->ops->map_fd_sys_lookup_elem(*inner_map);

kernel/bpf/hashtab.c

2690

struct bpf_map **inner_map = htab_map_lookup_elem(map, key);

kernel/bpf/hashtab.c

2692

if (!inner_map)

kernel/bpf/hashtab.c

2695

return READ_ONCE(*inner_map);

kernel/bpf/map_in_map.c

101

inner_map = __bpf_map_get(f);

kernel/bpf/map_in_map.c

102

if (IS_ERR(inner_map))

kernel/bpf/map_in_map.c

103

return inner_map;

kernel/bpf/map_in_map.c

106

if (inner_map_meta->ops->map_meta_equal(inner_map_meta, inner_map))

kernel/bpf/map_in_map.c

107

bpf_map_inc(inner_map);

kernel/bpf/map_in_map.c

109

inner_map = ERR_PTR(-EINVAL);

kernel/bpf/map_in_map.c

111

return inner_map;

kernel/bpf/map_in_map.c

116

struct bpf_map *inner_map = ptr;

kernel/bpf/map_in_map.c

12

struct bpf_map *inner_map, *inner_map_meta;

kernel/bpf/map_in_map.c

124

WRITE_ONCE(inner_map->free_after_mult_rcu_gp, true);

kernel/bpf/map_in_map.c

126

WRITE_ONCE(inner_map->free_after_rcu_gp, true);

kernel/bpf/map_in_map.c

128

bpf_map_put(inner_map);

kernel/bpf/map_in_map.c

16

inner_map = __bpf_map_get(f);

kernel/bpf/map_in_map.c

17

if (IS_ERR(inner_map))

kernel/bpf/map_in_map.c

18

return inner_map;

kernel/bpf/map_in_map.c

21

if (inner_map->inner_map_meta)

kernel/bpf/map_in_map.c

24

if (!inner_map->ops->map_meta_equal)

kernel/bpf/map_in_map.c

29

if (inner_map->ops == &array_map_ops || inner_map->ops == &percpu_array_map_ops)

kernel/bpf/map_in_map.c

36

inner_map_meta->map_type = inner_map->map_type;

kernel/bpf/map_in_map.c

37

inner_map_meta->key_size = inner_map->key_size;

kernel/bpf/map_in_map.c

38

inner_map_meta->value_size = inner_map->value_size;

kernel/bpf/map_in_map.c

39

inner_map_meta->map_flags = inner_map->map_flags;

kernel/bpf/map_in_map.c

40

inner_map_meta->max_entries = inner_map->max_entries;

kernel/bpf/map_in_map.c

42

inner_map_meta->record = btf_record_dup(inner_map->record);

kernel/bpf/map_in_map.c

57

if (inner_map->btf) {

kernel/bpf/map_in_map.c

58

btf_get(inner_map->btf);

kernel/bpf/map_in_map.c

59

inner_map_meta->btf = inner_map->btf;

kernel/bpf/map_in_map.c

63

inner_map_meta->ops = inner_map->ops;

kernel/bpf/map_in_map.c

64

if (inner_map->ops == &array_map_ops || inner_map->ops == &percpu_array_map_ops) {

kernel/bpf/map_in_map.c

67

struct bpf_array *inner_array = container_of(inner_map, struct bpf_array, map);

kernel/bpf/map_in_map.c

71

inner_map_meta->bypass_spec_v1 = inner_map->bypass_spec_v1;

kernel/bpf/map_in_map.c

98

struct bpf_map *inner_map, *inner_map_meta;

samples/bpf/test_map_in_map.bpf.c

112

void *outer_map, *inner_map;

samples/bpf/test_map_in_map.bpf.c

150

inner_map = bpf_map_lookup_elem(outer_map, &port_key);

samples/bpf/test_map_in_map.bpf.c

151

if (!inner_map) {

samples/bpf/test_map_in_map.bpf.c

157

ret = do_reg_lookup(inner_map, port_key);

samples/bpf/test_map_in_map.bpf.c

160

inline_ret = do_inline_array_lookup(inner_map, port_key);

samples/bpf/test_map_in_map.bpf.c

162

inline_ret = do_inline_hash_lookup(inner_map, port_key);

samples/bpf/test_map_in_map.bpf.c

76

static __always_inline int do_reg_lookup(void *inner_map, u32 port)

samples/bpf/test_map_in_map.bpf.c

80

result = bpf_map_lookup_elem(inner_map, &port);

samples/bpf/test_map_in_map.bpf.c

84

static __always_inline int do_inline_array_lookup(void *inner_map, u32 port)

samples/bpf/test_map_in_map.bpf.c

88

if (inner_map != &port_a)

samples/bpf/test_map_in_map.bpf.c

95

static __always_inline int do_inline_hash_lookup(void *inner_map, u32 port)

samples/bpf/test_map_in_map.bpf.c

99

if (inner_map != &port_h)

tools/lib/bpf/libbpf.c

10826

if (map->inner_map) {

tools/lib/bpf/libbpf.c

10827

bpf_map__destroy(map->inner_map);

tools/lib/bpf/libbpf.c

10828

zfree(&map->inner_map);

tools/lib/bpf/libbpf.c

2969

map->inner_map = calloc(1, sizeof(*map->inner_map));

tools/lib/bpf/libbpf.c

2970

if (!map->inner_map)

tools/lib/bpf/libbpf.c

2972

map->inner_map->fd = create_placeholder_fd();

tools/lib/bpf/libbpf.c

2973

if (map->inner_map->fd < 0)

tools/lib/bpf/libbpf.c

2974

return map->inner_map->fd;

tools/lib/bpf/libbpf.c

2975

map->inner_map->sec_idx = sec_idx;

tools/lib/bpf/libbpf.c

2976

map->inner_map->name = malloc(strlen(map_name) + sizeof(".inner") + 1);

tools/lib/bpf/libbpf.c

2977

if (!map->inner_map->name)

tools/lib/bpf/libbpf.c

2979

sprintf(map->inner_map->name, "%s.inner", map_name);

tools/lib/bpf/libbpf.c

2981

fill_map_from_def(map->inner_map, &inner_def);

tools/lib/bpf/libbpf.c

5047

return map->inner_map;

tools/lib/bpf/libbpf.c

5347

if (map->inner_map) {

tools/lib/bpf/libbpf.c

5348

err = map_set_def_max_entries(map->inner_map);

tools/lib/bpf/libbpf.c

5351

err = bpf_object__create_map(obj, map->inner_map, true);

tools/lib/bpf/libbpf.c

5357

map->inner_map_fd = map->inner_map->fd;

tools/lib/bpf/libbpf.c

5421

if (bpf_map_type__is_map_in_map(def->type) && map->inner_map) {

tools/lib/bpf/libbpf.c

5423

map->inner_map->fd = -1;

tools/lib/bpf/libbpf.c

5424

bpf_map__destroy(map->inner_map);

tools/lib/bpf/libbpf.c

5425

zfree(&map->inner_map);

tools/lib/bpf/libbpf.c

587

struct bpf_map *inner_map;

tools/lib/bpf/libbpf.c

9405

if (map->inner_map) {

tools/lib/bpf/libbpf.c

9406

bpf_map__destroy(map->inner_map);

tools/lib/bpf/libbpf.c

9407

zfree(&map->inner_map);

tools/testing/selftests/bpf/benchs/bench_local_storage.c

117

struct bpf_map *inner_map;

tools/testing/selftests/bpf/benchs/bench_local_storage.c

127

inner_map = bpf_map__inner_map(ctx.array_of_maps);

tools/testing/selftests/bpf/benchs/bench_local_storage.c

128

create_opts.btf_key_type_id = bpf_map__btf_key_type_id(inner_map);

tools/testing/selftests/bpf/benchs/bench_local_storage.c

129

create_opts.btf_value_type_id = bpf_map__btf_value_type_id(inner_map);

tools/testing/selftests/bpf/prog_tests/bloom_filter_map.c

134

link = bpf_program__attach(skel->progs.inner_map);

tools/testing/selftests/bpf/prog_tests/linked_list.c

179

clear_fields(skel->maps.inner_map);

tools/testing/selftests/bpf/prog_tests/linked_list.c

213

clear_fields(skel->maps.inner_map);

tools/testing/selftests/bpf/prog_tests/linked_list.c

235

clear_fields(skel->maps.inner_map);

tools/testing/selftests/bpf/prog_tests/linked_list.c

30

TEST(inner_map, 0)

tools/testing/selftests/bpf/prog_tests/linked_list.c

57

TEST(inner_map, push_front)

tools/testing/selftests/bpf/prog_tests/linked_list.c

58

TEST(inner_map, push_back)

tools/testing/selftests/bpf/prog_tests/linked_list.c

59

TEST(inner_map, pop_front)

tools/testing/selftests/bpf/prog_tests/linked_list.c

60

TEST(inner_map, pop_back)