Commit 1022b67b authored by Rhys Rustad-Elliott's avatar Rhys Rustad-Elliott Committed by Martin KaFai Lau

selftests/bpf: Add access_inner_map selftest

Add a selftest that accesses a BPF_MAP_TYPE_ARRAY (at a nonzero index)
nested within a BPF_MAP_TYPE_HASH_OF_MAPS to flex a previously buggy
case.
Signed-off-by: default avatarRhys Rustad-Elliott <me@rhysre.net>
Link: https://lore.kernel.org/r/20230602190110.47068-3-me@rhysre.netSigned-off-by: default avatarMartin KaFai Lau <martin.lau@kernel.org>
parent cba41bb7
// SPDX-License-Identifier: GPL-2.0-only
#include <test_progs.h>
#include "inner_array_lookup.skel.h"
void test_inner_array_lookup(void)
{
int map1_fd, err;
int key = 3;
int val = 1;
struct inner_array_lookup *skel;
skel = inner_array_lookup__open_and_load();
if (!ASSERT_OK_PTR(skel, "open_load_skeleton"))
return;
err = inner_array_lookup__attach(skel);
if (!ASSERT_OK(err, "skeleton_attach"))
goto cleanup;
map1_fd = bpf_map__fd(skel->maps.inner_map1);
bpf_map_update_elem(map1_fd, &key, &val, 0);
/* Probe should have set the element at index 3 to 2 */
bpf_map_lookup_elem(map1_fd, &key, &val);
ASSERT_EQ(val, 2, "value_is_2");
cleanup:
inner_array_lookup__destroy(skel);
}
// SPDX-License-Identifier: GPL-2.0-only
#include <linux/bpf.h>
#include <bpf/bpf_helpers.h>
struct inner_map {
__uint(type, BPF_MAP_TYPE_ARRAY);
__uint(max_entries, 5);
__type(key, int);
__type(value, int);
} inner_map1 SEC(".maps");
struct outer_map {
__uint(type, BPF_MAP_TYPE_HASH_OF_MAPS);
__uint(max_entries, 3);
__type(key, int);
__array(values, struct inner_map);
} outer_map1 SEC(".maps") = {
.values = {
[2] = &inner_map1,
},
};
SEC("raw_tp/sys_enter")
int handle__sys_enter(void *ctx)
{
int outer_key = 2, inner_key = 3;
int *val;
void *map;
map = bpf_map_lookup_elem(&outer_map1, &outer_key);
if (!map)
return 1;
val = bpf_map_lookup_elem(map, &inner_key);
if (!val)
return 1;
if (*val == 1)
*val = 2;
return 0;
}
char _license[] SEC("license") = "GPL";
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment