|
| 1 | +// SPDX-License-Identifier: GPL-2.0 |
| 2 | +/* Copyright (c) 2021 Facebook */ |
| 3 | +#include <test_progs.h> |
| 4 | +#include <network_helpers.h> |
| 5 | +#include "for_each_hash_map_elem.skel.h" |
| 6 | + |
| 7 | +static unsigned int duration; |
| 8 | + |
| 9 | +static void test_hash_map(void) |
| 10 | +{ |
| 11 | + int i, err, hashmap_fd, max_entries, percpu_map_fd; |
| 12 | + struct for_each_hash_map_elem *skel; |
| 13 | + __u64 *percpu_valbuf = NULL; |
| 14 | + __u32 key, num_cpus, retval; |
| 15 | + __u64 val; |
| 16 | + |
| 17 | + skel = for_each_hash_map_elem__open_and_load(); |
| 18 | + if (CHECK(!skel, "for_each_hash_map_elem__open_and_load", |
| 19 | + "skeleton open_and_load failed\n")) |
| 20 | + return; |
| 21 | + |
| 22 | + hashmap_fd = bpf_map__fd(skel->maps.hashmap); |
| 23 | + max_entries = bpf_map__max_entries(skel->maps.hashmap); |
| 24 | + for (i = 0; i < max_entries; i++) { |
| 25 | + key = i; |
| 26 | + val = i + 1; |
| 27 | + err = bpf_map_update_elem(hashmap_fd, &key, &val, BPF_ANY); |
| 28 | + if (CHECK(err, "map_update", "map_update failed\n")) |
| 29 | + goto out; |
| 30 | + } |
| 31 | + |
| 32 | + num_cpus = bpf_num_possible_cpus(); |
| 33 | + percpu_map_fd = bpf_map__fd(skel->maps.percpu_map); |
| 34 | + percpu_valbuf = malloc(sizeof(__u64) * num_cpus); |
| 35 | + if (!ASSERT_OK_PTR(percpu_valbuf, "percpu_valbuf")) |
| 36 | + goto out; |
| 37 | + |
| 38 | + key = 1; |
| 39 | + for (i = 0; i < num_cpus; i++) |
| 40 | + percpu_valbuf[i] = i + 1; |
| 41 | + err = bpf_map_update_elem(percpu_map_fd, &key, percpu_valbuf, BPF_ANY); |
| 42 | + if (CHECK(err, "percpu_map_update", "map_update failed\n")) |
| 43 | + goto out; |
| 44 | + |
| 45 | + err = bpf_prog_test_run(bpf_program__fd(skel->progs.test_pkt_access), |
| 46 | + 1, &pkt_v4, sizeof(pkt_v4), NULL, NULL, |
| 47 | + &retval, &duration); |
| 48 | + if (CHECK(err || retval, "ipv4", "err %d errno %d retval %d\n", |
| 49 | + err, errno, retval)) |
| 50 | + goto out; |
| 51 | + |
| 52 | + ASSERT_EQ(skel->bss->hashmap_output, 4, "hashmap_output"); |
| 53 | + ASSERT_EQ(skel->bss->hashmap_elems, max_entries, "hashmap_elems"); |
| 54 | + |
| 55 | + key = 1; |
| 56 | + err = bpf_map_lookup_elem(hashmap_fd, &key, &val); |
| 57 | + ASSERT_ERR(err, "hashmap_lookup"); |
| 58 | + |
| 59 | + ASSERT_EQ(skel->bss->percpu_called, 1, "percpu_called"); |
| 60 | + ASSERT_EQ(skel->bss->cpu < num_cpus, 1, "num_cpus"); |
| 61 | + ASSERT_EQ(skel->bss->percpu_map_elems, 1, "percpu_map_elems"); |
| 62 | + ASSERT_EQ(skel->bss->percpu_key, 1, "percpu_key"); |
| 63 | + ASSERT_EQ(skel->bss->percpu_val, skel->bss->cpu + 1, "percpu_val"); |
| 64 | + ASSERT_EQ(skel->bss->percpu_output, 100, "percpu_output"); |
| 65 | +out: |
| 66 | + free(percpu_valbuf); |
| 67 | + for_each_hash_map_elem__destroy(skel); |
| 68 | +} |
| 69 | + |
| 70 | +void test_for_each(void) |
| 71 | +{ |
| 72 | + if (test__start_subtest("hash_map")) |
| 73 | + test_hash_map(); |
| 74 | +} |
0 commit comments