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(skel->maps.hash_map,
116 &key, sizeof(key), &value, sizeof(value), 0);
117 if (!ASSERT_OK(err, "bpf_map_lookup_and_delete_elem"))
120 /* Fetched value should match the initially set value. */
121 if (CHECK(value != START_VALUE, "bpf_map_lookup_and_delete_elem",
122 "unexpected value=%lld\n", value))
125 /* Check that the entry is non existent. */
126 err = bpf_map_lookup_elem(map_fd, &key, &value);
127 if (!ASSERT_ERR(err, "bpf_map_lookup_elem"))
131 test_lookup_and_delete__destroy(skel);
134 static void test_lookup_and_delete_percpu_hash(void)
136 struct test_lookup_and_delete *skel;
137 __u64 key, val, value[nr_cpus];
140 /* Setup program and fill the map. */
141 skel = setup_prog(BPF_MAP_TYPE_PERCPU_HASH, &map_fd);
142 if (!ASSERT_OK_PTR(skel, "setup_prog"))
145 err = fill_values_percpu(map_fd);
146 if (!ASSERT_OK(err, "fill_values_percpu"))
149 /* Lookup and delete element. */
151 err = bpf_map__lookup_and_delete_elem(skel->maps.hash_map,
152 &key, sizeof(key), value, sizeof(value), 0);
153 if (!ASSERT_OK(err, "bpf_map_lookup_and_delete_elem"))
156 for (i = 0; i < nr_cpus; i++) {
159 /* Fetched value should match the initially set value. */
160 if (CHECK(val != START_VALUE, "map value",
161 "unexpected for cpu %d: %lld\n", i, val))
165 /* Check that the entry is non existent. */
166 err = bpf_map_lookup_elem(map_fd, &key, value);
167 if (!ASSERT_ERR(err, "bpf_map_lookup_elem"))
171 test_lookup_and_delete__destroy(skel);
174 static void test_lookup_and_delete_lru_hash(void)
176 struct test_lookup_and_delete *skel;
180 /* Setup program and fill the LRU map. */
181 skel = setup_prog(BPF_MAP_TYPE_LRU_HASH, &map_fd);
182 if (!ASSERT_OK_PTR(skel, "setup_prog"))
185 err = fill_values(map_fd);
186 if (!ASSERT_OK(err, "fill_values"))
189 /* Insert new element at key=3, should reuse LRU element. */
191 err = trigger_tp(skel, key, NEW_VALUE);
192 if (!ASSERT_OK(err, "trigger_tp"))
195 /* Lookup and delete element 3. */
196 err = bpf_map__lookup_and_delete_elem(skel->maps.hash_map,
197 &key, sizeof(key), &value, sizeof(value), 0);
198 if (!ASSERT_OK(err, "bpf_map_lookup_and_delete_elem"))
201 /* Value should match the new value. */
202 if (CHECK(value != NEW_VALUE, "bpf_map_lookup_and_delete_elem",
203 "unexpected value=%lld\n", value))
206 /* Check that entries 3 and 1 are non existent. */
207 err = bpf_map_lookup_elem(map_fd, &key, &value);
208 if (!ASSERT_ERR(err, "bpf_map_lookup_elem"))
212 err = bpf_map_lookup_elem(map_fd, &key, &value);
213 if (!ASSERT_ERR(err, "bpf_map_lookup_elem"))
217 test_lookup_and_delete__destroy(skel);
220 static void test_lookup_and_delete_lru_percpu_hash(void)
222 struct test_lookup_and_delete *skel;
223 __u64 key, val, value[nr_cpus];
224 int map_fd, err, i, cpucnt = 0;
226 /* Setup program and fill the LRU map. */
227 skel = setup_prog(BPF_MAP_TYPE_LRU_PERCPU_HASH, &map_fd);
228 if (!ASSERT_OK_PTR(skel, "setup_prog"))
231 err = fill_values_percpu(map_fd);
232 if (!ASSERT_OK(err, "fill_values_percpu"))
235 /* Insert new element at key=3, should reuse LRU element 1. */
237 err = trigger_tp(skel, key, NEW_VALUE);
238 if (!ASSERT_OK(err, "trigger_tp"))
242 for (i = 0; i < nr_cpus; i++)
245 /* Lookup and delete element 3. */
246 err = bpf_map__lookup_and_delete_elem(skel->maps.hash_map,
247 &key, sizeof(key), value, sizeof(value), 0);
248 if (!ASSERT_OK(err, "bpf_map_lookup_and_delete_elem"))
251 /* Check if only one CPU has set the value. */
252 for (i = 0; i < nr_cpus; i++) {
255 if (CHECK(val != NEW_VALUE, "map value",
256 "unexpected for cpu %d: %lld\n", i, val))
261 if (CHECK(cpucnt != 1, "map value", "set for %d CPUs instead of 1!\n",
265 /* Check that entries 3 and 1 are non existent. */
266 err = bpf_map_lookup_elem(map_fd, &key, &value);
267 if (!ASSERT_ERR(err, "bpf_map_lookup_elem"))
271 err = bpf_map_lookup_elem(map_fd, &key, &value);
272 if (!ASSERT_ERR(err, "bpf_map_lookup_elem"))
276 test_lookup_and_delete__destroy(skel);
279 void test_lookup_and_delete(void)
281 nr_cpus = bpf_num_possible_cpus();
283 if (test__start_subtest("lookup_and_delete"))
284 test_lookup_and_delete_hash();
285 if (test__start_subtest("lookup_and_delete_percpu"))
286 test_lookup_and_delete_percpu_hash();
287 if (test__start_subtest("lookup_and_delete_lru"))
288 test_lookup_and_delete_lru_hash();
289 if (test__start_subtest("lookup_and_delete_lru_percpu"))
290 test_lookup_and_delete_lru_percpu_hash();