1 // SPDX-License-Identifier: GPL-2.0-only
3 #include <test_progs.h>
4 #include "test_lookup_and_delete.skel.h"
6 #define START_VALUE 1234
13 static int fill_values(int map_fd)
15 __u64 key, value = START_VALUE;
18 for (key = 1; key < MAX_ENTRIES + 1; key++) {
19 err = bpf_map_update_elem(map_fd, &key, &value, BPF_NOEXIST);
20 if (!ASSERT_OK(err, "bpf_map_update_elem"))
27 static int fill_values_percpu(int map_fd)
29 __u64 key, value[nr_cpus];
32 for (i = 0; i < nr_cpus; i++)
33 value[i] = START_VALUE;
35 for (key = 1; key < MAX_ENTRIES + 1; key++) {
36 err = bpf_map_update_elem(map_fd, &key, value, BPF_NOEXIST);
37 if (!ASSERT_OK(err, "bpf_map_update_elem"))
44 static struct test_lookup_and_delete *setup_prog(enum bpf_map_type map_type,
47 struct test_lookup_and_delete *skel;
50 skel = test_lookup_and_delete__open();
51 if (!ASSERT_OK_PTR(skel, "test_lookup_and_delete__open"))
54 err = bpf_map__set_type(skel->maps.hash_map, map_type);
55 if (!ASSERT_OK(err, "bpf_map__set_type"))
58 err = bpf_map__set_max_entries(skel->maps.hash_map, MAX_ENTRIES);
59 if (!ASSERT_OK(err, "bpf_map__set_max_entries"))
62 err = test_lookup_and_delete__load(skel);
63 if (!ASSERT_OK(err, "test_lookup_and_delete__load"))
66 *map_fd = bpf_map__fd(skel->maps.hash_map);
67 if (!ASSERT_GE(*map_fd, 0, "bpf_map__fd"))
73 test_lookup_and_delete__destroy(skel);
77 /* Triggers BPF program that updates map with given key and value */
78 static int trigger_tp(struct test_lookup_and_delete *skel, __u64 key,
83 skel->bss->set_pid = getpid();
84 skel->bss->set_key = key;
85 skel->bss->set_value = value;
87 err = test_lookup_and_delete__attach(skel);
88 if (!ASSERT_OK(err, "test_lookup_and_delete__attach"))
91 syscall(__NR_getpgid);
93 test_lookup_and_delete__detach(skel);
98 static void test_lookup_and_delete_hash(void)
100 struct test_lookup_and_delete *skel;
104 /* Setup program and fill the map. */
105 skel = setup_prog(BPF_MAP_TYPE_HASH, &map_fd);
106 if (!ASSERT_OK_PTR(skel, "setup_prog"))
109 err = fill_values(map_fd);
110 if (!ASSERT_OK(err, "fill_values"))
113 /* Lookup and delete element. */
115 err = bpf_map_lookup_and_delete_elem(map_fd, &key, &value);
116 if (!ASSERT_OK(err, "bpf_map_lookup_and_delete_elem"))
119 /* Fetched value should match the initially set value. */
120 if (CHECK(value != START_VALUE, "bpf_map_lookup_and_delete_elem",
121 "unexpected value=%lld\n", value))
124 /* Check that the entry is non existent. */
125 err = bpf_map_lookup_elem(map_fd, &key, &value);
126 if (!ASSERT_ERR(err, "bpf_map_lookup_elem"))
130 test_lookup_and_delete__destroy(skel);
133 static void test_lookup_and_delete_percpu_hash(void)
135 struct test_lookup_and_delete *skel;
136 __u64 key, val, value[nr_cpus];
139 /* Setup program and fill the map. */
140 skel = setup_prog(BPF_MAP_TYPE_PERCPU_HASH, &map_fd);
141 if (!ASSERT_OK_PTR(skel, "setup_prog"))
144 err = fill_values_percpu(map_fd);
145 if (!ASSERT_OK(err, "fill_values_percpu"))
148 /* Lookup and delete element. */
150 err = bpf_map_lookup_and_delete_elem(map_fd, &key, value);
151 if (!ASSERT_OK(err, "bpf_map_lookup_and_delete_elem"))
154 for (i = 0; i < nr_cpus; i++) {
157 /* Fetched value should match the initially set value. */
158 if (CHECK(val != START_VALUE, "map value",
159 "unexpected for cpu %d: %lld\n", i, val))
163 /* Check that the entry is non existent. */
164 err = bpf_map_lookup_elem(map_fd, &key, value);
165 if (!ASSERT_ERR(err, "bpf_map_lookup_elem"))
169 test_lookup_and_delete__destroy(skel);
172 static void test_lookup_and_delete_lru_hash(void)
174 struct test_lookup_and_delete *skel;
178 /* Setup program and fill the LRU map. */
179 skel = setup_prog(BPF_MAP_TYPE_LRU_HASH, &map_fd);
180 if (!ASSERT_OK_PTR(skel, "setup_prog"))
183 err = fill_values(map_fd);
184 if (!ASSERT_OK(err, "fill_values"))
187 /* Insert new element at key=3, should reuse LRU element. */
189 err = trigger_tp(skel, key, NEW_VALUE);
190 if (!ASSERT_OK(err, "trigger_tp"))
193 /* Lookup and delete element 3. */
194 err = bpf_map_lookup_and_delete_elem(map_fd, &key, &value);
195 if (!ASSERT_OK(err, "bpf_map_lookup_and_delete_elem"))
198 /* Value should match the new value. */
199 if (CHECK(value != NEW_VALUE, "bpf_map_lookup_and_delete_elem",
200 "unexpected value=%lld\n", value))
203 /* Check that entries 3 and 1 are non existent. */
204 err = bpf_map_lookup_elem(map_fd, &key, &value);
205 if (!ASSERT_ERR(err, "bpf_map_lookup_elem"))
209 err = bpf_map_lookup_elem(map_fd, &key, &value);
210 if (!ASSERT_ERR(err, "bpf_map_lookup_elem"))
214 test_lookup_and_delete__destroy(skel);
217 static void test_lookup_and_delete_lru_percpu_hash(void)
219 struct test_lookup_and_delete *skel;
220 __u64 key, val, value[nr_cpus];
221 int map_fd, err, i, cpucnt = 0;
223 /* Setup program and fill the LRU map. */
224 skel = setup_prog(BPF_MAP_TYPE_LRU_PERCPU_HASH, &map_fd);
225 if (!ASSERT_OK_PTR(skel, "setup_prog"))
228 err = fill_values_percpu(map_fd);
229 if (!ASSERT_OK(err, "fill_values_percpu"))
232 /* Insert new element at key=3, should reuse LRU element 1. */
234 err = trigger_tp(skel, key, NEW_VALUE);
235 if (!ASSERT_OK(err, "trigger_tp"))
239 for (i = 0; i < nr_cpus; i++)
242 /* Lookup and delete element 3. */
243 err = bpf_map_lookup_and_delete_elem(map_fd, &key, value);
244 if (!ASSERT_OK(err, "bpf_map_lookup_and_delete_elem")) {
248 /* Check if only one CPU has set the value. */
249 for (i = 0; i < nr_cpus; i++) {
252 if (CHECK(val != NEW_VALUE, "map value",
253 "unexpected for cpu %d: %lld\n", i, val))
258 if (CHECK(cpucnt != 1, "map value", "set for %d CPUs instead of 1!\n",
262 /* Check that entries 3 and 1 are non existent. */
263 err = bpf_map_lookup_elem(map_fd, &key, &value);
264 if (!ASSERT_ERR(err, "bpf_map_lookup_elem"))
268 err = bpf_map_lookup_elem(map_fd, &key, &value);
269 if (!ASSERT_ERR(err, "bpf_map_lookup_elem"))
273 test_lookup_and_delete__destroy(skel);
276 void test_lookup_and_delete(void)
278 nr_cpus = bpf_num_possible_cpus();
280 if (test__start_subtest("lookup_and_delete"))
281 test_lookup_and_delete_hash();
282 if (test__start_subtest("lookup_and_delete_percpu"))
283 test_lookup_and_delete_percpu_hash();
284 if (test__start_subtest("lookup_and_delete_lru"))
285 test_lookup_and_delete_lru_hash();
286 if (test__start_subtest("lookup_and_delete_lru_percpu"))
287 test_lookup_and_delete_lru_percpu_hash();