]>
Commit | Line | Data |
---|---|---|
25763b3c | 1 | // SPDX-License-Identifier: GPL-2.0-only |
5aa5bd14 DB |
2 | /* |
3 | * Testsuite for eBPF maps | |
4 | * | |
5 | * Copyright (c) 2014 PLUMgrid, http://plumgrid.com | |
6 | * Copyright (c) 2016 Facebook | |
5aa5bd14 DB |
7 | */ |
8 | ||
9 | #include <stdio.h> | |
10 | #include <unistd.h> | |
11 | #include <errno.h> | |
12 | #include <string.h> | |
13 | #include <assert.h> | |
14 | #include <stdlib.h> | |
43b987d2 | 15 | #include <time.h> |
5aa5bd14 DB |
16 | |
17 | #include <sys/wait.h> | |
6bc8529c MKL |
18 | #include <sys/socket.h> |
19 | #include <netinet/in.h> | |
5aa5bd14 DB |
20 | #include <linux/bpf.h> |
21 | ||
10ecc728 | 22 | #include <bpf/bpf.h> |
6f6d33f3 | 23 | #include <bpf/libbpf.h> |
fe8d662a | 24 | |
e00c7b21 | 25 | #include "bpf_util.h" |
fe8d662a | 26 | #include "bpf_rlimit.h" |
51a0e301 | 27 | #include "test_maps.h" |
5aa5bd14 | 28 | |
6bc8529c MKL |
29 | #ifndef ENOTSUPP |
30 | #define ENOTSUPP 524 | |
31 | #endif | |
32 | ||
e8ddbfb4 SF |
33 | static int skips; |
34 | ||
5aa5bd14 DB |
35 | static int map_flags; |
36 | ||
dd9cef43 | 37 | static void test_hashmap(unsigned int task, void *data) |
5aa5bd14 | 38 | { |
8fe45924 | 39 | long long key, next_key, first_key, value; |
5aa5bd14 DB |
40 | int fd; |
41 | ||
f4874d01 | 42 | fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value), |
5aa5bd14 DB |
43 | 2, map_flags); |
44 | if (fd < 0) { | |
45 | printf("Failed to create hashmap '%s'!\n", strerror(errno)); | |
46 | exit(1); | |
47 | } | |
48 | ||
49 | key = 1; | |
50 | value = 1234; | |
51 | /* Insert key=1 element. */ | |
10ecc728 | 52 | assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); |
5aa5bd14 DB |
53 | |
54 | value = 0; | |
55 | /* BPF_NOEXIST means add new element if it doesn't exist. */ | |
10ecc728 | 56 | assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 && |
5aa5bd14 DB |
57 | /* key=1 already exists. */ |
58 | errno == EEXIST); | |
59 | ||
60 | /* -1 is an invalid flag. */ | |
10ecc728 MS |
61 | assert(bpf_map_update_elem(fd, &key, &value, -1) == -1 && |
62 | errno == EINVAL); | |
5aa5bd14 DB |
63 | |
64 | /* Check that key=1 can be found. */ | |
e5ff7c40 | 65 | assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234); |
5aa5bd14 DB |
66 | |
67 | key = 2; | |
68 | /* Check that key=2 is not found. */ | |
e5ff7c40 | 69 | assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT); |
5aa5bd14 DB |
70 | |
71 | /* BPF_EXIST means update existing element. */ | |
10ecc728 | 72 | assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == -1 && |
5aa5bd14 DB |
73 | /* key=2 is not there. */ |
74 | errno == ENOENT); | |
75 | ||
76 | /* Insert key=2 element. */ | |
10ecc728 | 77 | assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0); |
5aa5bd14 DB |
78 | |
79 | /* key=1 and key=2 were inserted, check that key=0 cannot be | |
80 | * inserted due to max_entries limit. | |
81 | */ | |
82 | key = 0; | |
10ecc728 | 83 | assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 && |
5aa5bd14 DB |
84 | errno == E2BIG); |
85 | ||
86 | /* Update existing element, though the map is full. */ | |
87 | key = 1; | |
10ecc728 | 88 | assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0); |
5aa5bd14 | 89 | key = 2; |
10ecc728 | 90 | assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); |
8c290e60 AS |
91 | key = 3; |
92 | assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 && | |
93 | errno == E2BIG); | |
5aa5bd14 DB |
94 | |
95 | /* Check that key = 0 doesn't exist. */ | |
96 | key = 0; | |
e58383b8 | 97 | assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT); |
5aa5bd14 DB |
98 | |
99 | /* Iterate over two elements. */ | |
8fe45924 TQ |
100 | assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 && |
101 | (first_key == 1 || first_key == 2)); | |
5f155c25 | 102 | assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 && |
8fe45924 | 103 | (next_key == first_key)); |
5f155c25 | 104 | assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 && |
8fe45924 TQ |
105 | (next_key == 1 || next_key == 2) && |
106 | (next_key != first_key)); | |
5f155c25 | 107 | assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 && |
5aa5bd14 DB |
108 | errno == ENOENT); |
109 | ||
110 | /* Delete both elements. */ | |
111 | key = 1; | |
e58383b8 | 112 | assert(bpf_map_delete_elem(fd, &key) == 0); |
5aa5bd14 | 113 | key = 2; |
e58383b8 MS |
114 | assert(bpf_map_delete_elem(fd, &key) == 0); |
115 | assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT); | |
5aa5bd14 DB |
116 | |
117 | key = 0; | |
118 | /* Check that map is empty. */ | |
8fe45924 TQ |
119 | assert(bpf_map_get_next_key(fd, NULL, &next_key) == -1 && |
120 | errno == ENOENT); | |
5f155c25 | 121 | assert(bpf_map_get_next_key(fd, &key, &next_key) == -1 && |
5aa5bd14 DB |
122 | errno == ENOENT); |
123 | ||
124 | close(fd); | |
125 | } | |
126 | ||
dd9cef43 | 127 | static void test_hashmap_sizes(unsigned int task, void *data) |
8c290e60 AS |
128 | { |
129 | int fd, i, j; | |
130 | ||
131 | for (i = 1; i <= 512; i <<= 1) | |
132 | for (j = 1; j <= 1 << 18; j <<= 1) { | |
133 | fd = bpf_create_map(BPF_MAP_TYPE_HASH, i, j, | |
134 | 2, map_flags); | |
135 | if (fd < 0) { | |
80475c48 LZ |
136 | if (errno == ENOMEM) |
137 | return; | |
8c290e60 AS |
138 | printf("Failed to create hashmap key=%d value=%d '%s'\n", |
139 | i, j, strerror(errno)); | |
140 | exit(1); | |
141 | } | |
142 | close(fd); | |
143 | usleep(10); /* give kernel time to destroy */ | |
144 | } | |
145 | } | |
146 | ||
dd9cef43 | 147 | static void test_hashmap_percpu(unsigned int task, void *data) |
5aa5bd14 | 148 | { |
e00c7b21 | 149 | unsigned int nr_cpus = bpf_num_possible_cpus(); |
f3515b5d | 150 | BPF_DECLARE_PERCPU(long, value); |
8fe45924 | 151 | long long key, next_key, first_key; |
5aa5bd14 DB |
152 | int expected_key_mask = 0; |
153 | int fd, i; | |
154 | ||
f4874d01 | 155 | fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_HASH, sizeof(key), |
f3515b5d | 156 | sizeof(bpf_percpu(value, 0)), 2, map_flags); |
5aa5bd14 DB |
157 | if (fd < 0) { |
158 | printf("Failed to create hashmap '%s'!\n", strerror(errno)); | |
159 | exit(1); | |
160 | } | |
161 | ||
162 | for (i = 0; i < nr_cpus; i++) | |
f3515b5d | 163 | bpf_percpu(value, i) = i + 100; |
5aa5bd14 DB |
164 | |
165 | key = 1; | |
166 | /* Insert key=1 element. */ | |
167 | assert(!(expected_key_mask & key)); | |
10ecc728 | 168 | assert(bpf_map_update_elem(fd, &key, value, BPF_ANY) == 0); |
5aa5bd14 DB |
169 | expected_key_mask |= key; |
170 | ||
171 | /* BPF_NOEXIST means add new element if it doesn't exist. */ | |
10ecc728 | 172 | assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 && |
5aa5bd14 DB |
173 | /* key=1 already exists. */ |
174 | errno == EEXIST); | |
175 | ||
176 | /* -1 is an invalid flag. */ | |
10ecc728 MS |
177 | assert(bpf_map_update_elem(fd, &key, value, -1) == -1 && |
178 | errno == EINVAL); | |
5aa5bd14 DB |
179 | |
180 | /* Check that key=1 can be found. Value could be 0 if the lookup | |
181 | * was run from a different CPU. | |
182 | */ | |
f3515b5d DB |
183 | bpf_percpu(value, 0) = 1; |
184 | assert(bpf_map_lookup_elem(fd, &key, value) == 0 && | |
185 | bpf_percpu(value, 0) == 100); | |
5aa5bd14 DB |
186 | |
187 | key = 2; | |
188 | /* Check that key=2 is not found. */ | |
e5ff7c40 | 189 | assert(bpf_map_lookup_elem(fd, &key, value) == -1 && errno == ENOENT); |
5aa5bd14 DB |
190 | |
191 | /* BPF_EXIST means update existing element. */ | |
10ecc728 | 192 | assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == -1 && |
5aa5bd14 DB |
193 | /* key=2 is not there. */ |
194 | errno == ENOENT); | |
195 | ||
196 | /* Insert key=2 element. */ | |
197 | assert(!(expected_key_mask & key)); | |
10ecc728 | 198 | assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0); |
5aa5bd14 DB |
199 | expected_key_mask |= key; |
200 | ||
201 | /* key=1 and key=2 were inserted, check that key=0 cannot be | |
202 | * inserted due to max_entries limit. | |
203 | */ | |
204 | key = 0; | |
10ecc728 | 205 | assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 && |
5aa5bd14 DB |
206 | errno == E2BIG); |
207 | ||
208 | /* Check that key = 0 doesn't exist. */ | |
e58383b8 | 209 | assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT); |
5aa5bd14 DB |
210 | |
211 | /* Iterate over two elements. */ | |
8fe45924 TQ |
212 | assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 && |
213 | ((expected_key_mask & first_key) == first_key)); | |
5f155c25 | 214 | while (!bpf_map_get_next_key(fd, &key, &next_key)) { |
8fe45924 TQ |
215 | if (first_key) { |
216 | assert(next_key == first_key); | |
217 | first_key = 0; | |
218 | } | |
5aa5bd14 DB |
219 | assert((expected_key_mask & next_key) == next_key); |
220 | expected_key_mask &= ~next_key; | |
221 | ||
e5ff7c40 | 222 | assert(bpf_map_lookup_elem(fd, &next_key, value) == 0); |
5aa5bd14 DB |
223 | |
224 | for (i = 0; i < nr_cpus; i++) | |
f3515b5d | 225 | assert(bpf_percpu(value, i) == i + 100); |
5aa5bd14 DB |
226 | |
227 | key = next_key; | |
228 | } | |
229 | assert(errno == ENOENT); | |
230 | ||
231 | /* Update with BPF_EXIST. */ | |
232 | key = 1; | |
10ecc728 | 233 | assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0); |
5aa5bd14 DB |
234 | |
235 | /* Delete both elements. */ | |
236 | key = 1; | |
e58383b8 | 237 | assert(bpf_map_delete_elem(fd, &key) == 0); |
5aa5bd14 | 238 | key = 2; |
e58383b8 MS |
239 | assert(bpf_map_delete_elem(fd, &key) == 0); |
240 | assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT); | |
5aa5bd14 DB |
241 | |
242 | key = 0; | |
243 | /* Check that map is empty. */ | |
8fe45924 TQ |
244 | assert(bpf_map_get_next_key(fd, NULL, &next_key) == -1 && |
245 | errno == ENOENT); | |
5f155c25 | 246 | assert(bpf_map_get_next_key(fd, &key, &next_key) == -1 && |
5aa5bd14 DB |
247 | errno == ENOENT); |
248 | ||
249 | close(fd); | |
250 | } | |
251 | ||
bf5d68c7 | 252 | static int helper_fill_hashmap(int max_entries) |
5ecf51fd | 253 | { |
bf5d68c7 LB |
254 | int i, fd, ret; |
255 | long long key, value; | |
5ecf51fd DB |
256 | |
257 | fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value), | |
258 | max_entries, map_flags); | |
bf5d68c7 LB |
259 | CHECK(fd < 0, |
260 | "failed to create hashmap", | |
261 | "err: %s, flags: 0x%x\n", strerror(errno), map_flags); | |
5ecf51fd DB |
262 | |
263 | for (i = 0; i < max_entries; i++) { | |
264 | key = i; value = key; | |
bf5d68c7 LB |
265 | ret = bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST); |
266 | CHECK(ret != 0, | |
267 | "can't update hashmap", | |
268 | "err: %s\n", strerror(ret)); | |
5ecf51fd DB |
269 | } |
270 | ||
bf5d68c7 LB |
271 | return fd; |
272 | } | |
273 | ||
dd9cef43 | 274 | static void test_hashmap_walk(unsigned int task, void *data) |
bf5d68c7 LB |
275 | { |
276 | int fd, i, max_entries = 1000; | |
277 | long long key, value, next_key; | |
278 | bool next_key_valid = true; | |
279 | ||
280 | fd = helper_fill_hashmap(max_entries); | |
281 | ||
5ecf51fd DB |
282 | for (i = 0; bpf_map_get_next_key(fd, !i ? NULL : &key, |
283 | &next_key) == 0; i++) { | |
284 | key = next_key; | |
285 | assert(bpf_map_lookup_elem(fd, &key, &value) == 0); | |
286 | } | |
287 | ||
288 | assert(i == max_entries); | |
289 | ||
290 | assert(bpf_map_get_next_key(fd, NULL, &key) == 0); | |
291 | for (i = 0; next_key_valid; i++) { | |
292 | next_key_valid = bpf_map_get_next_key(fd, &key, &next_key) == 0; | |
293 | assert(bpf_map_lookup_elem(fd, &key, &value) == 0); | |
294 | value++; | |
295 | assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0); | |
296 | key = next_key; | |
297 | } | |
298 | ||
299 | assert(i == max_entries); | |
300 | ||
301 | for (i = 0; bpf_map_get_next_key(fd, !i ? NULL : &key, | |
302 | &next_key) == 0; i++) { | |
303 | key = next_key; | |
304 | assert(bpf_map_lookup_elem(fd, &key, &value) == 0); | |
305 | assert(value - 1 == key); | |
306 | } | |
307 | ||
308 | assert(i == max_entries); | |
309 | close(fd); | |
310 | } | |
311 | ||
bf5d68c7 LB |
312 | static void test_hashmap_zero_seed(void) |
313 | { | |
314 | int i, first, second, old_flags; | |
315 | long long key, next_first, next_second; | |
316 | ||
317 | old_flags = map_flags; | |
318 | map_flags |= BPF_F_ZERO_SEED; | |
319 | ||
320 | first = helper_fill_hashmap(3); | |
321 | second = helper_fill_hashmap(3); | |
322 | ||
323 | for (i = 0; ; i++) { | |
324 | void *key_ptr = !i ? NULL : &key; | |
325 | ||
326 | if (bpf_map_get_next_key(first, key_ptr, &next_first) != 0) | |
327 | break; | |
328 | ||
329 | CHECK(bpf_map_get_next_key(second, key_ptr, &next_second) != 0, | |
330 | "next_key for second map must succeed", | |
331 | "key_ptr: %p", key_ptr); | |
332 | CHECK(next_first != next_second, | |
333 | "keys must match", | |
334 | "i: %d first: %lld second: %lld\n", i, | |
335 | next_first, next_second); | |
336 | ||
337 | key = next_first; | |
338 | } | |
339 | ||
340 | map_flags = old_flags; | |
341 | close(first); | |
342 | close(second); | |
343 | } | |
344 | ||
dd9cef43 | 345 | static void test_arraymap(unsigned int task, void *data) |
5aa5bd14 DB |
346 | { |
347 | int key, next_key, fd; | |
348 | long long value; | |
349 | ||
f4874d01 | 350 | fd = bpf_create_map(BPF_MAP_TYPE_ARRAY, sizeof(key), sizeof(value), |
5aa5bd14 DB |
351 | 2, 0); |
352 | if (fd < 0) { | |
353 | printf("Failed to create arraymap '%s'!\n", strerror(errno)); | |
354 | exit(1); | |
355 | } | |
356 | ||
357 | key = 1; | |
358 | value = 1234; | |
359 | /* Insert key=1 element. */ | |
10ecc728 | 360 | assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); |
5aa5bd14 DB |
361 | |
362 | value = 0; | |
10ecc728 | 363 | assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 && |
5aa5bd14 DB |
364 | errno == EEXIST); |
365 | ||
366 | /* Check that key=1 can be found. */ | |
e5ff7c40 | 367 | assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234); |
5aa5bd14 DB |
368 | |
369 | key = 0; | |
370 | /* Check that key=0 is also found and zero initialized. */ | |
e5ff7c40 | 371 | assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0); |
5aa5bd14 DB |
372 | |
373 | /* key=0 and key=1 were inserted, check that key=2 cannot be inserted | |
374 | * due to max_entries limit. | |
375 | */ | |
376 | key = 2; | |
10ecc728 | 377 | assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == -1 && |
5aa5bd14 DB |
378 | errno == E2BIG); |
379 | ||
380 | /* Check that key = 2 doesn't exist. */ | |
e5ff7c40 | 381 | assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT); |
5aa5bd14 DB |
382 | |
383 | /* Iterate over two elements. */ | |
8fe45924 TQ |
384 | assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 && |
385 | next_key == 0); | |
5f155c25 | 386 | assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 && |
5aa5bd14 | 387 | next_key == 0); |
5f155c25 | 388 | assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 && |
5aa5bd14 | 389 | next_key == 1); |
5f155c25 | 390 | assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 && |
5aa5bd14 DB |
391 | errno == ENOENT); |
392 | ||
393 | /* Delete shouldn't succeed. */ | |
394 | key = 1; | |
e58383b8 | 395 | assert(bpf_map_delete_elem(fd, &key) == -1 && errno == EINVAL); |
5aa5bd14 DB |
396 | |
397 | close(fd); | |
398 | } | |
399 | ||
dd9cef43 | 400 | static void test_arraymap_percpu(unsigned int task, void *data) |
5aa5bd14 | 401 | { |
e00c7b21 | 402 | unsigned int nr_cpus = bpf_num_possible_cpus(); |
f3515b5d | 403 | BPF_DECLARE_PERCPU(long, values); |
5aa5bd14 | 404 | int key, next_key, fd, i; |
5aa5bd14 | 405 | |
f4874d01 | 406 | fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_ARRAY, sizeof(key), |
f3515b5d | 407 | sizeof(bpf_percpu(values, 0)), 2, 0); |
5aa5bd14 DB |
408 | if (fd < 0) { |
409 | printf("Failed to create arraymap '%s'!\n", strerror(errno)); | |
410 | exit(1); | |
411 | } | |
412 | ||
413 | for (i = 0; i < nr_cpus; i++) | |
f3515b5d | 414 | bpf_percpu(values, i) = i + 100; |
5aa5bd14 DB |
415 | |
416 | key = 1; | |
417 | /* Insert key=1 element. */ | |
10ecc728 | 418 | assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0); |
5aa5bd14 | 419 | |
f3515b5d | 420 | bpf_percpu(values, 0) = 0; |
10ecc728 | 421 | assert(bpf_map_update_elem(fd, &key, values, BPF_NOEXIST) == -1 && |
5aa5bd14 DB |
422 | errno == EEXIST); |
423 | ||
424 | /* Check that key=1 can be found. */ | |
f3515b5d DB |
425 | assert(bpf_map_lookup_elem(fd, &key, values) == 0 && |
426 | bpf_percpu(values, 0) == 100); | |
5aa5bd14 DB |
427 | |
428 | key = 0; | |
429 | /* Check that key=0 is also found and zero initialized. */ | |
e5ff7c40 | 430 | assert(bpf_map_lookup_elem(fd, &key, values) == 0 && |
f3515b5d DB |
431 | bpf_percpu(values, 0) == 0 && |
432 | bpf_percpu(values, nr_cpus - 1) == 0); | |
5aa5bd14 DB |
433 | |
434 | /* Check that key=2 cannot be inserted due to max_entries limit. */ | |
435 | key = 2; | |
10ecc728 | 436 | assert(bpf_map_update_elem(fd, &key, values, BPF_EXIST) == -1 && |
5aa5bd14 DB |
437 | errno == E2BIG); |
438 | ||
439 | /* Check that key = 2 doesn't exist. */ | |
e5ff7c40 | 440 | assert(bpf_map_lookup_elem(fd, &key, values) == -1 && errno == ENOENT); |
5aa5bd14 DB |
441 | |
442 | /* Iterate over two elements. */ | |
8fe45924 TQ |
443 | assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 && |
444 | next_key == 0); | |
5f155c25 | 445 | assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 && |
5aa5bd14 | 446 | next_key == 0); |
5f155c25 | 447 | assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 && |
5aa5bd14 | 448 | next_key == 1); |
5f155c25 | 449 | assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 && |
5aa5bd14 DB |
450 | errno == ENOENT); |
451 | ||
452 | /* Delete shouldn't succeed. */ | |
453 | key = 1; | |
e58383b8 | 454 | assert(bpf_map_delete_elem(fd, &key) == -1 && errno == EINVAL); |
5aa5bd14 DB |
455 | |
456 | close(fd); | |
457 | } | |
458 | ||
459 | static void test_arraymap_percpu_many_keys(void) | |
460 | { | |
e00c7b21 | 461 | unsigned int nr_cpus = bpf_num_possible_cpus(); |
f3515b5d | 462 | BPF_DECLARE_PERCPU(long, values); |
8c290e60 AS |
463 | /* nr_keys is not too large otherwise the test stresses percpu |
464 | * allocator more than anything else | |
465 | */ | |
466 | unsigned int nr_keys = 2000; | |
5aa5bd14 DB |
467 | int key, fd, i; |
468 | ||
f4874d01 | 469 | fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_ARRAY, sizeof(key), |
f3515b5d | 470 | sizeof(bpf_percpu(values, 0)), nr_keys, 0); |
5aa5bd14 DB |
471 | if (fd < 0) { |
472 | printf("Failed to create per-cpu arraymap '%s'!\n", | |
473 | strerror(errno)); | |
474 | exit(1); | |
475 | } | |
476 | ||
477 | for (i = 0; i < nr_cpus; i++) | |
f3515b5d | 478 | bpf_percpu(values, i) = i + 10; |
5aa5bd14 DB |
479 | |
480 | for (key = 0; key < nr_keys; key++) | |
10ecc728 | 481 | assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0); |
5aa5bd14 DB |
482 | |
483 | for (key = 0; key < nr_keys; key++) { | |
484 | for (i = 0; i < nr_cpus; i++) | |
f3515b5d | 485 | bpf_percpu(values, i) = 0; |
5aa5bd14 | 486 | |
e5ff7c40 | 487 | assert(bpf_map_lookup_elem(fd, &key, values) == 0); |
5aa5bd14 DB |
488 | |
489 | for (i = 0; i < nr_cpus; i++) | |
f3515b5d | 490 | assert(bpf_percpu(values, i) == i + 10); |
5aa5bd14 DB |
491 | } |
492 | ||
493 | close(fd); | |
494 | } | |
495 | ||
dd9cef43 | 496 | static void test_devmap(unsigned int task, void *data) |
546ac1ff | 497 | { |
81f6bf81 | 498 | int fd; |
546ac1ff JF |
499 | __u32 key, value; |
500 | ||
501 | fd = bpf_create_map(BPF_MAP_TYPE_DEVMAP, sizeof(key), sizeof(value), | |
502 | 2, 0); | |
503 | if (fd < 0) { | |
8b6b25cf | 504 | printf("Failed to create devmap '%s'!\n", strerror(errno)); |
546ac1ff JF |
505 | exit(1); |
506 | } | |
507 | ||
508 | close(fd); | |
509 | } | |
510 | ||
dd9cef43 | 511 | static void test_queuemap(unsigned int task, void *data) |
43b987d2 MV |
512 | { |
513 | const int MAP_SIZE = 32; | |
514 | __u32 vals[MAP_SIZE + MAP_SIZE/2], val; | |
515 | int fd, i; | |
516 | ||
517 | /* Fill test values to be used */ | |
518 | for (i = 0; i < MAP_SIZE + MAP_SIZE/2; i++) | |
519 | vals[i] = rand(); | |
520 | ||
521 | /* Invalid key size */ | |
522 | fd = bpf_create_map(BPF_MAP_TYPE_QUEUE, 4, sizeof(val), MAP_SIZE, | |
523 | map_flags); | |
524 | assert(fd < 0 && errno == EINVAL); | |
525 | ||
526 | fd = bpf_create_map(BPF_MAP_TYPE_QUEUE, 0, sizeof(val), MAP_SIZE, | |
527 | map_flags); | |
528 | /* Queue map does not support BPF_F_NO_PREALLOC */ | |
529 | if (map_flags & BPF_F_NO_PREALLOC) { | |
530 | assert(fd < 0 && errno == EINVAL); | |
531 | return; | |
532 | } | |
533 | if (fd < 0) { | |
534 | printf("Failed to create queuemap '%s'!\n", strerror(errno)); | |
535 | exit(1); | |
536 | } | |
537 | ||
538 | /* Push MAP_SIZE elements */ | |
539 | for (i = 0; i < MAP_SIZE; i++) | |
540 | assert(bpf_map_update_elem(fd, NULL, &vals[i], 0) == 0); | |
541 | ||
542 | /* Check that element cannot be pushed due to max_entries limit */ | |
543 | assert(bpf_map_update_elem(fd, NULL, &val, 0) == -1 && | |
544 | errno == E2BIG); | |
545 | ||
546 | /* Peek element */ | |
547 | assert(bpf_map_lookup_elem(fd, NULL, &val) == 0 && val == vals[0]); | |
548 | ||
549 | /* Replace half elements */ | |
550 | for (i = MAP_SIZE; i < MAP_SIZE + MAP_SIZE/2; i++) | |
551 | assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0); | |
552 | ||
553 | /* Pop all elements */ | |
554 | for (i = MAP_SIZE/2; i < MAP_SIZE + MAP_SIZE/2; i++) | |
555 | assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == 0 && | |
556 | val == vals[i]); | |
557 | ||
558 | /* Check that there are not elements left */ | |
559 | assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == -1 && | |
560 | errno == ENOENT); | |
561 | ||
562 | /* Check that non supported functions set errno to EINVAL */ | |
563 | assert(bpf_map_delete_elem(fd, NULL) == -1 && errno == EINVAL); | |
564 | assert(bpf_map_get_next_key(fd, NULL, NULL) == -1 && errno == EINVAL); | |
565 | ||
566 | close(fd); | |
567 | } | |
568 | ||
dd9cef43 | 569 | static void test_stackmap(unsigned int task, void *data) |
43b987d2 MV |
570 | { |
571 | const int MAP_SIZE = 32; | |
572 | __u32 vals[MAP_SIZE + MAP_SIZE/2], val; | |
573 | int fd, i; | |
574 | ||
575 | /* Fill test values to be used */ | |
576 | for (i = 0; i < MAP_SIZE + MAP_SIZE/2; i++) | |
577 | vals[i] = rand(); | |
578 | ||
579 | /* Invalid key size */ | |
580 | fd = bpf_create_map(BPF_MAP_TYPE_STACK, 4, sizeof(val), MAP_SIZE, | |
581 | map_flags); | |
582 | assert(fd < 0 && errno == EINVAL); | |
583 | ||
584 | fd = bpf_create_map(BPF_MAP_TYPE_STACK, 0, sizeof(val), MAP_SIZE, | |
585 | map_flags); | |
586 | /* Stack map does not support BPF_F_NO_PREALLOC */ | |
587 | if (map_flags & BPF_F_NO_PREALLOC) { | |
588 | assert(fd < 0 && errno == EINVAL); | |
589 | return; | |
590 | } | |
591 | if (fd < 0) { | |
592 | printf("Failed to create stackmap '%s'!\n", strerror(errno)); | |
593 | exit(1); | |
594 | } | |
595 | ||
596 | /* Push MAP_SIZE elements */ | |
597 | for (i = 0; i < MAP_SIZE; i++) | |
598 | assert(bpf_map_update_elem(fd, NULL, &vals[i], 0) == 0); | |
599 | ||
600 | /* Check that element cannot be pushed due to max_entries limit */ | |
601 | assert(bpf_map_update_elem(fd, NULL, &val, 0) == -1 && | |
602 | errno == E2BIG); | |
603 | ||
604 | /* Peek element */ | |
605 | assert(bpf_map_lookup_elem(fd, NULL, &val) == 0 && val == vals[i - 1]); | |
606 | ||
607 | /* Replace half elements */ | |
608 | for (i = MAP_SIZE; i < MAP_SIZE + MAP_SIZE/2; i++) | |
609 | assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0); | |
610 | ||
611 | /* Pop all elements */ | |
612 | for (i = MAP_SIZE + MAP_SIZE/2 - 1; i >= MAP_SIZE/2; i--) | |
613 | assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == 0 && | |
614 | val == vals[i]); | |
615 | ||
616 | /* Check that there are not elements left */ | |
617 | assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == -1 && | |
618 | errno == ENOENT); | |
619 | ||
620 | /* Check that non supported functions set errno to EINVAL */ | |
621 | assert(bpf_map_delete_elem(fd, NULL) == -1 && errno == EINVAL); | |
622 | assert(bpf_map_get_next_key(fd, NULL, NULL) == -1 && errno == EINVAL); | |
623 | ||
624 | close(fd); | |
625 | } | |
626 | ||
6f6d33f3 JF |
627 | #include <sys/ioctl.h> |
628 | #include <arpa/inet.h> | |
629 | #include <sys/select.h> | |
630 | #include <linux/err.h> | |
631 | #define SOCKMAP_PARSE_PROG "./sockmap_parse_prog.o" | |
632 | #define SOCKMAP_VERDICT_PROG "./sockmap_verdict_prog.o" | |
82a86168 | 633 | #define SOCKMAP_TCP_MSG_PROG "./sockmap_tcp_msg_prog.o" |
dd9cef43 | 634 | static void test_sockmap(unsigned int tasks, void *data) |
6f6d33f3 | 635 | { |
82a86168 JF |
636 | struct bpf_map *bpf_map_rx, *bpf_map_tx, *bpf_map_msg, *bpf_map_break; |
637 | int map_fd_msg = 0, map_fd_rx = 0, map_fd_tx = 0, map_fd_break; | |
6f6d33f3 | 638 | int ports[] = {50200, 50201, 50202, 50204}; |
435bf0d3 | 639 | int err, i, fd, udp, sfd[6] = {0xdeadbeef}; |
6fd28865 | 640 | u8 buf[20] = {0x0, 0x5, 0x3, 0x2, 0x1, 0x0}; |
82a86168 | 641 | int parse_prog, verdict_prog, msg_prog; |
6f6d33f3 | 642 | struct sockaddr_in addr; |
82a86168 | 643 | int one = 1, s, sc, rc; |
6f6d33f3 JF |
644 | struct bpf_object *obj; |
645 | struct timeval to; | |
646 | __u32 key, value; | |
3f0d6a16 | 647 | pid_t pid[tasks]; |
6f6d33f3 JF |
648 | fd_set w; |
649 | ||
650 | /* Create some sockets to use with sockmap */ | |
651 | for (i = 0; i < 2; i++) { | |
652 | sfd[i] = socket(AF_INET, SOCK_STREAM, 0); | |
653 | if (sfd[i] < 0) | |
654 | goto out; | |
655 | err = setsockopt(sfd[i], SOL_SOCKET, SO_REUSEADDR, | |
656 | (char *)&one, sizeof(one)); | |
657 | if (err) { | |
658 | printf("failed to setsockopt\n"); | |
659 | goto out; | |
660 | } | |
661 | err = ioctl(sfd[i], FIONBIO, (char *)&one); | |
662 | if (err < 0) { | |
663 | printf("failed to ioctl\n"); | |
664 | goto out; | |
665 | } | |
666 | memset(&addr, 0, sizeof(struct sockaddr_in)); | |
667 | addr.sin_family = AF_INET; | |
668 | addr.sin_addr.s_addr = inet_addr("127.0.0.1"); | |
669 | addr.sin_port = htons(ports[i]); | |
670 | err = bind(sfd[i], (struct sockaddr *)&addr, sizeof(addr)); | |
671 | if (err < 0) { | |
672 | printf("failed to bind: err %i: %i:%i\n", | |
673 | err, i, sfd[i]); | |
674 | goto out; | |
675 | } | |
676 | err = listen(sfd[i], 32); | |
677 | if (err < 0) { | |
90774a93 | 678 | printf("failed to listen\n"); |
6f6d33f3 JF |
679 | goto out; |
680 | } | |
681 | } | |
682 | ||
683 | for (i = 2; i < 4; i++) { | |
684 | sfd[i] = socket(AF_INET, SOCK_STREAM, 0); | |
685 | if (sfd[i] < 0) | |
686 | goto out; | |
687 | err = setsockopt(sfd[i], SOL_SOCKET, SO_REUSEADDR, | |
688 | (char *)&one, sizeof(one)); | |
689 | if (err) { | |
690 | printf("set sock opt\n"); | |
691 | goto out; | |
692 | } | |
693 | memset(&addr, 0, sizeof(struct sockaddr_in)); | |
694 | addr.sin_family = AF_INET; | |
695 | addr.sin_addr.s_addr = inet_addr("127.0.0.1"); | |
696 | addr.sin_port = htons(ports[i - 2]); | |
697 | err = connect(sfd[i], (struct sockaddr *)&addr, sizeof(addr)); | |
698 | if (err) { | |
90774a93 | 699 | printf("failed to connect\n"); |
6f6d33f3 JF |
700 | goto out; |
701 | } | |
702 | } | |
703 | ||
704 | ||
705 | for (i = 4; i < 6; i++) { | |
706 | sfd[i] = accept(sfd[i - 4], NULL, NULL); | |
707 | if (sfd[i] < 0) { | |
708 | printf("accept failed\n"); | |
709 | goto out; | |
710 | } | |
711 | } | |
712 | ||
713 | /* Test sockmap with connected sockets */ | |
714 | fd = bpf_create_map(BPF_MAP_TYPE_SOCKMAP, | |
715 | sizeof(key), sizeof(value), | |
716 | 6, 0); | |
717 | if (fd < 0) { | |
e8ddbfb4 SF |
718 | if (!bpf_probe_map_type(BPF_MAP_TYPE_SOCKMAP, 0)) { |
719 | printf("%s SKIP (unsupported map type BPF_MAP_TYPE_SOCKMAP)\n", | |
720 | __func__); | |
721 | skips++; | |
722 | for (i = 0; i < 6; i++) | |
723 | close(sfd[i]); | |
724 | return; | |
725 | } | |
726 | ||
6f6d33f3 JF |
727 | printf("Failed to create sockmap %i\n", fd); |
728 | goto out_sockmap; | |
729 | } | |
730 | ||
435bf0d3 JF |
731 | /* Test update with unsupported UDP socket */ |
732 | udp = socket(AF_INET, SOCK_DGRAM, 0); | |
733 | i = 0; | |
734 | err = bpf_map_update_elem(fd, &i, &udp, BPF_ANY); | |
735 | if (!err) { | |
736 | printf("Failed socket SOCK_DGRAM allowed '%i:%i'\n", | |
737 | i, udp); | |
738 | goto out_sockmap; | |
6f6d33f3 JF |
739 | } |
740 | ||
464bc0fd | 741 | /* Test update without programs */ |
6f6d33f3 JF |
742 | for (i = 0; i < 6; i++) { |
743 | err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_ANY); | |
50280278 JF |
744 | if (i < 2 && !err) { |
745 | printf("Allowed update sockmap '%i:%i' not in ESTABLISHED\n", | |
746 | i, sfd[i]); | |
747 | goto out_sockmap; | |
748 | } else if (i >= 2 && err) { | |
464bc0fd | 749 | printf("Failed noprog update sockmap '%i:%i'\n", |
6f6d33f3 JF |
750 | i, sfd[i]); |
751 | goto out_sockmap; | |
752 | } | |
753 | } | |
754 | ||
5a67da2a | 755 | /* Test attaching/detaching bad fds */ |
464bc0fd | 756 | err = bpf_prog_attach(-1, fd, BPF_SK_SKB_STREAM_PARSER, 0); |
6f6d33f3 | 757 | if (!err) { |
464bc0fd JF |
758 | printf("Failed invalid parser prog attach\n"); |
759 | goto out_sockmap; | |
760 | } | |
761 | ||
762 | err = bpf_prog_attach(-1, fd, BPF_SK_SKB_STREAM_VERDICT, 0); | |
763 | if (!err) { | |
764 | printf("Failed invalid verdict prog attach\n"); | |
6f6d33f3 JF |
765 | goto out_sockmap; |
766 | } | |
767 | ||
82a86168 JF |
768 | err = bpf_prog_attach(-1, fd, BPF_SK_MSG_VERDICT, 0); |
769 | if (!err) { | |
770 | printf("Failed invalid msg verdict prog attach\n"); | |
771 | goto out_sockmap; | |
772 | } | |
773 | ||
5a67da2a JF |
774 | err = bpf_prog_attach(-1, fd, __MAX_BPF_ATTACH_TYPE, 0); |
775 | if (!err) { | |
776 | printf("Failed unknown prog attach\n"); | |
777 | goto out_sockmap; | |
778 | } | |
779 | ||
780 | err = bpf_prog_detach(fd, BPF_SK_SKB_STREAM_PARSER); | |
781 | if (err) { | |
782 | printf("Failed empty parser prog detach\n"); | |
783 | goto out_sockmap; | |
784 | } | |
785 | ||
786 | err = bpf_prog_detach(fd, BPF_SK_SKB_STREAM_VERDICT); | |
787 | if (err) { | |
788 | printf("Failed empty verdict prog detach\n"); | |
789 | goto out_sockmap; | |
790 | } | |
791 | ||
82a86168 JF |
792 | err = bpf_prog_detach(fd, BPF_SK_MSG_VERDICT); |
793 | if (err) { | |
794 | printf("Failed empty msg verdict prog detach\n"); | |
795 | goto out_sockmap; | |
796 | } | |
797 | ||
5a67da2a JF |
798 | err = bpf_prog_detach(fd, __MAX_BPF_ATTACH_TYPE); |
799 | if (!err) { | |
800 | printf("Detach invalid prog successful\n"); | |
801 | goto out_sockmap; | |
802 | } | |
803 | ||
6f6d33f3 JF |
804 | /* Load SK_SKB program and Attach */ |
805 | err = bpf_prog_load(SOCKMAP_PARSE_PROG, | |
806 | BPF_PROG_TYPE_SK_SKB, &obj, &parse_prog); | |
807 | if (err) { | |
808 | printf("Failed to load SK_SKB parse prog\n"); | |
809 | goto out_sockmap; | |
810 | } | |
811 | ||
82a86168 JF |
812 | err = bpf_prog_load(SOCKMAP_TCP_MSG_PROG, |
813 | BPF_PROG_TYPE_SK_MSG, &obj, &msg_prog); | |
814 | if (err) { | |
815 | printf("Failed to load SK_SKB msg prog\n"); | |
816 | goto out_sockmap; | |
817 | } | |
818 | ||
6f6d33f3 JF |
819 | err = bpf_prog_load(SOCKMAP_VERDICT_PROG, |
820 | BPF_PROG_TYPE_SK_SKB, &obj, &verdict_prog); | |
821 | if (err) { | |
822 | printf("Failed to load SK_SKB verdict prog\n"); | |
823 | goto out_sockmap; | |
824 | } | |
825 | ||
6fd28865 JF |
826 | bpf_map_rx = bpf_object__find_map_by_name(obj, "sock_map_rx"); |
827 | if (IS_ERR(bpf_map_rx)) { | |
828 | printf("Failed to load map rx from verdict prog\n"); | |
6f6d33f3 JF |
829 | goto out_sockmap; |
830 | } | |
831 | ||
6fd28865 JF |
832 | map_fd_rx = bpf_map__fd(bpf_map_rx); |
833 | if (map_fd_rx < 0) { | |
82a86168 | 834 | printf("Failed to get map rx fd\n"); |
6f6d33f3 JF |
835 | goto out_sockmap; |
836 | } | |
837 | ||
6fd28865 JF |
838 | bpf_map_tx = bpf_object__find_map_by_name(obj, "sock_map_tx"); |
839 | if (IS_ERR(bpf_map_tx)) { | |
840 | printf("Failed to load map tx from verdict prog\n"); | |
841 | goto out_sockmap; | |
842 | } | |
843 | ||
844 | map_fd_tx = bpf_map__fd(bpf_map_tx); | |
845 | if (map_fd_tx < 0) { | |
846 | printf("Failed to get map tx fd\n"); | |
847 | goto out_sockmap; | |
848 | } | |
849 | ||
82a86168 JF |
850 | bpf_map_msg = bpf_object__find_map_by_name(obj, "sock_map_msg"); |
851 | if (IS_ERR(bpf_map_msg)) { | |
852 | printf("Failed to load map msg from msg_verdict prog\n"); | |
853 | goto out_sockmap; | |
854 | } | |
855 | ||
856 | map_fd_msg = bpf_map__fd(bpf_map_msg); | |
857 | if (map_fd_msg < 0) { | |
858 | printf("Failed to get map msg fd\n"); | |
859 | goto out_sockmap; | |
860 | } | |
861 | ||
81374aaa JF |
862 | bpf_map_break = bpf_object__find_map_by_name(obj, "sock_map_break"); |
863 | if (IS_ERR(bpf_map_break)) { | |
864 | printf("Failed to load map tx from verdict prog\n"); | |
865 | goto out_sockmap; | |
866 | } | |
867 | ||
868 | map_fd_break = bpf_map__fd(bpf_map_break); | |
869 | if (map_fd_break < 0) { | |
870 | printf("Failed to get map tx fd\n"); | |
871 | goto out_sockmap; | |
872 | } | |
873 | ||
874 | err = bpf_prog_attach(parse_prog, map_fd_break, | |
875 | BPF_SK_SKB_STREAM_PARSER, 0); | |
876 | if (!err) { | |
877 | printf("Allowed attaching SK_SKB program to invalid map\n"); | |
878 | goto out_sockmap; | |
879 | } | |
880 | ||
6fd28865 | 881 | err = bpf_prog_attach(parse_prog, map_fd_rx, |
464bc0fd JF |
882 | BPF_SK_SKB_STREAM_PARSER, 0); |
883 | if (err) { | |
81374aaa | 884 | printf("Failed stream parser bpf prog attach\n"); |
464bc0fd JF |
885 | goto out_sockmap; |
886 | } | |
887 | ||
6fd28865 | 888 | err = bpf_prog_attach(verdict_prog, map_fd_rx, |
464bc0fd | 889 | BPF_SK_SKB_STREAM_VERDICT, 0); |
6f6d33f3 | 890 | if (err) { |
81374aaa | 891 | printf("Failed stream verdict bpf prog attach\n"); |
6f6d33f3 JF |
892 | goto out_sockmap; |
893 | } | |
894 | ||
82a86168 JF |
895 | err = bpf_prog_attach(msg_prog, map_fd_msg, BPF_SK_MSG_VERDICT, 0); |
896 | if (err) { | |
897 | printf("Failed msg verdict bpf prog attach\n"); | |
898 | goto out_sockmap; | |
899 | } | |
900 | ||
5a67da2a JF |
901 | err = bpf_prog_attach(verdict_prog, map_fd_rx, |
902 | __MAX_BPF_ATTACH_TYPE, 0); | |
903 | if (!err) { | |
904 | printf("Attached unknown bpf prog\n"); | |
905 | goto out_sockmap; | |
906 | } | |
907 | ||
464bc0fd | 908 | /* Test map update elem afterwards fd lives in fd and map_fd */ |
50280278 | 909 | for (i = 2; i < 6; i++) { |
6fd28865 JF |
910 | err = bpf_map_update_elem(map_fd_rx, &i, &sfd[i], BPF_ANY); |
911 | if (err) { | |
912 | printf("Failed map_fd_rx update sockmap %i '%i:%i'\n", | |
913 | err, i, sfd[i]); | |
914 | goto out_sockmap; | |
915 | } | |
916 | err = bpf_map_update_elem(map_fd_tx, &i, &sfd[i], BPF_ANY); | |
6f6d33f3 | 917 | if (err) { |
6fd28865 | 918 | printf("Failed map_fd_tx update sockmap %i '%i:%i'\n", |
6f6d33f3 JF |
919 | err, i, sfd[i]); |
920 | goto out_sockmap; | |
921 | } | |
922 | } | |
923 | ||
924 | /* Test map delete elem and remove send/recv sockets */ | |
925 | for (i = 2; i < 4; i++) { | |
6fd28865 JF |
926 | err = bpf_map_delete_elem(map_fd_rx, &i); |
927 | if (err) { | |
928 | printf("Failed delete sockmap rx %i '%i:%i'\n", | |
929 | err, i, sfd[i]); | |
930 | goto out_sockmap; | |
931 | } | |
932 | err = bpf_map_delete_elem(map_fd_tx, &i); | |
6f6d33f3 | 933 | if (err) { |
6fd28865 | 934 | printf("Failed delete sockmap tx %i '%i:%i'\n", |
6f6d33f3 JF |
935 | err, i, sfd[i]); |
936 | goto out_sockmap; | |
937 | } | |
938 | } | |
939 | ||
82a86168 JF |
940 | /* Put sfd[2] (sending fd below) into msg map to test sendmsg bpf */ |
941 | i = 0; | |
942 | err = bpf_map_update_elem(map_fd_msg, &i, &sfd[2], BPF_ANY); | |
943 | if (err) { | |
944 | printf("Failed map_fd_msg update sockmap %i\n", err); | |
945 | goto out_sockmap; | |
946 | } | |
947 | ||
6f6d33f3 | 948 | /* Test map send/recv */ |
6fd28865 JF |
949 | for (i = 0; i < 2; i++) { |
950 | buf[0] = i; | |
951 | buf[1] = 0x5; | |
952 | sc = send(sfd[2], buf, 20, 0); | |
953 | if (sc < 0) { | |
954 | printf("Failed sockmap send\n"); | |
955 | goto out_sockmap; | |
956 | } | |
6f6d33f3 | 957 | |
6fd28865 JF |
958 | FD_ZERO(&w); |
959 | FD_SET(sfd[3], &w); | |
960 | to.tv_sec = 1; | |
961 | to.tv_usec = 0; | |
962 | s = select(sfd[3] + 1, &w, NULL, NULL, &to); | |
963 | if (s == -1) { | |
964 | perror("Failed sockmap select()"); | |
965 | goto out_sockmap; | |
966 | } else if (!s) { | |
967 | printf("Failed sockmap unexpected timeout\n"); | |
968 | goto out_sockmap; | |
969 | } | |
6f6d33f3 | 970 | |
6fd28865 JF |
971 | if (!FD_ISSET(sfd[3], &w)) { |
972 | printf("Failed sockmap select/recv\n"); | |
973 | goto out_sockmap; | |
974 | } | |
975 | ||
976 | rc = recv(sfd[3], buf, sizeof(buf), 0); | |
977 | if (rc < 0) { | |
978 | printf("Failed sockmap recv\n"); | |
979 | goto out_sockmap; | |
980 | } | |
6f6d33f3 JF |
981 | } |
982 | ||
6fd28865 JF |
983 | /* Negative null entry lookup from datapath should be dropped */ |
984 | buf[0] = 1; | |
985 | buf[1] = 12; | |
986 | sc = send(sfd[2], buf, 20, 0); | |
987 | if (sc < 0) { | |
988 | printf("Failed sockmap send\n"); | |
6f6d33f3 JF |
989 | goto out_sockmap; |
990 | } | |
991 | ||
464bc0fd JF |
992 | /* Push fd into same slot */ |
993 | i = 2; | |
6f6d33f3 JF |
994 | err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_NOEXIST); |
995 | if (!err) { | |
464bc0fd | 996 | printf("Failed allowed sockmap dup slot BPF_NOEXIST\n"); |
6f6d33f3 JF |
997 | goto out_sockmap; |
998 | } | |
999 | ||
1000 | err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_ANY); | |
1001 | if (err) { | |
464bc0fd | 1002 | printf("Failed sockmap update new slot BPF_ANY\n"); |
6f6d33f3 JF |
1003 | goto out_sockmap; |
1004 | } | |
1005 | ||
1006 | err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_EXIST); | |
1007 | if (err) { | |
464bc0fd | 1008 | printf("Failed sockmap update new slot BPF_EXIST\n"); |
6f6d33f3 JF |
1009 | goto out_sockmap; |
1010 | } | |
1011 | ||
464bc0fd | 1012 | /* Delete the elems without programs */ |
50280278 | 1013 | for (i = 2; i < 6; i++) { |
464bc0fd JF |
1014 | err = bpf_map_delete_elem(fd, &i); |
1015 | if (err) { | |
1016 | printf("Failed delete sockmap %i '%i:%i'\n", | |
1017 | err, i, sfd[i]); | |
1018 | } | |
6f6d33f3 JF |
1019 | } |
1020 | ||
464bc0fd JF |
1021 | /* Test having multiple maps open and set with programs on same fds */ |
1022 | err = bpf_prog_attach(parse_prog, fd, | |
1023 | BPF_SK_SKB_STREAM_PARSER, 0); | |
6f6d33f3 | 1024 | if (err) { |
464bc0fd | 1025 | printf("Failed fd bpf parse prog attach\n"); |
6f6d33f3 JF |
1026 | goto out_sockmap; |
1027 | } | |
464bc0fd JF |
1028 | err = bpf_prog_attach(verdict_prog, fd, |
1029 | BPF_SK_SKB_STREAM_VERDICT, 0); | |
6f6d33f3 | 1030 | if (err) { |
464bc0fd | 1031 | printf("Failed fd bpf verdict prog attach\n"); |
6f6d33f3 JF |
1032 | goto out_sockmap; |
1033 | } | |
1034 | ||
464bc0fd JF |
1035 | for (i = 4; i < 6; i++) { |
1036 | err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_ANY); | |
1037 | if (!err) { | |
1038 | printf("Failed allowed duplicate programs in update ANY sockmap %i '%i:%i'\n", | |
1039 | err, i, sfd[i]); | |
1040 | goto out_sockmap; | |
1041 | } | |
1042 | err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_NOEXIST); | |
1043 | if (!err) { | |
1044 | printf("Failed allowed duplicate program in update NOEXIST sockmap %i '%i:%i'\n", | |
1045 | err, i, sfd[i]); | |
1046 | goto out_sockmap; | |
1047 | } | |
1048 | err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_EXIST); | |
1049 | if (!err) { | |
1050 | printf("Failed allowed duplicate program in update EXIST sockmap %i '%i:%i'\n", | |
1051 | err, i, sfd[i]); | |
1052 | goto out_sockmap; | |
1053 | } | |
6f6d33f3 JF |
1054 | } |
1055 | ||
3f0d6a16 JF |
1056 | /* Test tasks number of forked operations */ |
1057 | for (i = 0; i < tasks; i++) { | |
1058 | pid[i] = fork(); | |
1059 | if (pid[i] == 0) { | |
1060 | for (i = 0; i < 6; i++) { | |
1061 | bpf_map_delete_elem(map_fd_tx, &i); | |
1062 | bpf_map_delete_elem(map_fd_rx, &i); | |
1063 | bpf_map_update_elem(map_fd_tx, &i, | |
1064 | &sfd[i], BPF_ANY); | |
1065 | bpf_map_update_elem(map_fd_rx, &i, | |
1066 | &sfd[i], BPF_ANY); | |
1067 | } | |
1068 | exit(0); | |
1069 | } else if (pid[i] == -1) { | |
1070 | printf("Couldn't spawn #%d process!\n", i); | |
1071 | exit(1); | |
1072 | } | |
1073 | } | |
1074 | ||
1075 | for (i = 0; i < tasks; i++) { | |
1076 | int status; | |
1077 | ||
1078 | assert(waitpid(pid[i], &status, 0) == pid[i]); | |
1079 | assert(status == 0); | |
1080 | } | |
1081 | ||
5a67da2a JF |
1082 | err = bpf_prog_detach(map_fd_rx, __MAX_BPF_ATTACH_TYPE); |
1083 | if (!err) { | |
1084 | printf("Detached an invalid prog type.\n"); | |
1085 | goto out_sockmap; | |
1086 | } | |
1087 | ||
1088 | err = bpf_prog_detach(map_fd_rx, BPF_SK_SKB_STREAM_PARSER); | |
1089 | if (err) { | |
1090 | printf("Failed parser prog detach\n"); | |
1091 | goto out_sockmap; | |
1092 | } | |
1093 | ||
1094 | err = bpf_prog_detach(map_fd_rx, BPF_SK_SKB_STREAM_VERDICT); | |
1095 | if (err) { | |
1096 | printf("Failed parser prog detach\n"); | |
1097 | goto out_sockmap; | |
1098 | } | |
1099 | ||
78368781 PB |
1100 | /* Test map close sockets and empty maps */ |
1101 | for (i = 0; i < 6; i++) { | |
1102 | bpf_map_delete_elem(map_fd_tx, &i); | |
1103 | bpf_map_delete_elem(map_fd_rx, &i); | |
6f6d33f3 | 1104 | close(sfd[i]); |
78368781 | 1105 | } |
6f6d33f3 | 1106 | close(fd); |
6fd28865 | 1107 | close(map_fd_rx); |
6f6d33f3 JF |
1108 | bpf_object__close(obj); |
1109 | return; | |
1110 | out: | |
1111 | for (i = 0; i < 6; i++) | |
1112 | close(sfd[i]); | |
1113 | printf("Failed to create sockmap '%i:%s'!\n", i, strerror(errno)); | |
1114 | exit(1); | |
1115 | out_sockmap: | |
78368781 PB |
1116 | for (i = 0; i < 6; i++) { |
1117 | if (map_fd_tx) | |
1118 | bpf_map_delete_elem(map_fd_tx, &i); | |
1119 | if (map_fd_rx) | |
1120 | bpf_map_delete_elem(map_fd_rx, &i); | |
6f6d33f3 | 1121 | close(sfd[i]); |
78368781 | 1122 | } |
6f6d33f3 JF |
1123 | close(fd); |
1124 | exit(1); | |
1125 | } | |
1126 | ||
b1957c92 NS |
1127 | #define MAPINMAP_PROG "./test_map_in_map.o" |
1128 | static void test_map_in_map(void) | |
1129 | { | |
1130 | struct bpf_program *prog; | |
1131 | struct bpf_object *obj; | |
1132 | struct bpf_map *map; | |
1133 | int mim_fd, fd, err; | |
1134 | int pos = 0; | |
1135 | ||
1136 | obj = bpf_object__open(MAPINMAP_PROG); | |
1137 | ||
1138 | fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(int), sizeof(int), | |
1139 | 2, 0); | |
1140 | if (fd < 0) { | |
1141 | printf("Failed to create hashmap '%s'!\n", strerror(errno)); | |
1142 | exit(1); | |
1143 | } | |
1144 | ||
1145 | map = bpf_object__find_map_by_name(obj, "mim_array"); | |
1146 | if (IS_ERR(map)) { | |
1147 | printf("Failed to load array of maps from test prog\n"); | |
1148 | goto out_map_in_map; | |
1149 | } | |
1150 | err = bpf_map__set_inner_map_fd(map, fd); | |
1151 | if (err) { | |
1152 | printf("Failed to set inner_map_fd for array of maps\n"); | |
1153 | goto out_map_in_map; | |
1154 | } | |
1155 | ||
1156 | map = bpf_object__find_map_by_name(obj, "mim_hash"); | |
1157 | if (IS_ERR(map)) { | |
1158 | printf("Failed to load hash of maps from test prog\n"); | |
1159 | goto out_map_in_map; | |
1160 | } | |
1161 | err = bpf_map__set_inner_map_fd(map, fd); | |
1162 | if (err) { | |
1163 | printf("Failed to set inner_map_fd for hash of maps\n"); | |
1164 | goto out_map_in_map; | |
1165 | } | |
1166 | ||
1167 | bpf_object__for_each_program(prog, obj) { | |
1168 | bpf_program__set_xdp(prog); | |
1169 | } | |
1170 | bpf_object__load(obj); | |
1171 | ||
1172 | map = bpf_object__find_map_by_name(obj, "mim_array"); | |
1173 | if (IS_ERR(map)) { | |
1174 | printf("Failed to load array of maps from test prog\n"); | |
1175 | goto out_map_in_map; | |
1176 | } | |
1177 | mim_fd = bpf_map__fd(map); | |
1178 | if (mim_fd < 0) { | |
1179 | printf("Failed to get descriptor for array of maps\n"); | |
1180 | goto out_map_in_map; | |
1181 | } | |
1182 | ||
1183 | err = bpf_map_update_elem(mim_fd, &pos, &fd, 0); | |
1184 | if (err) { | |
1185 | printf("Failed to update array of maps\n"); | |
1186 | goto out_map_in_map; | |
1187 | } | |
1188 | ||
1189 | map = bpf_object__find_map_by_name(obj, "mim_hash"); | |
1190 | if (IS_ERR(map)) { | |
1191 | printf("Failed to load hash of maps from test prog\n"); | |
1192 | goto out_map_in_map; | |
1193 | } | |
1194 | mim_fd = bpf_map__fd(map); | |
1195 | if (mim_fd < 0) { | |
1196 | printf("Failed to get descriptor for hash of maps\n"); | |
1197 | goto out_map_in_map; | |
1198 | } | |
1199 | ||
1200 | err = bpf_map_update_elem(mim_fd, &pos, &fd, 0); | |
1201 | if (err) { | |
1202 | printf("Failed to update hash of maps\n"); | |
1203 | goto out_map_in_map; | |
1204 | } | |
1205 | ||
1206 | close(fd); | |
1207 | bpf_object__close(obj); | |
1208 | return; | |
1209 | ||
1210 | out_map_in_map: | |
1211 | close(fd); | |
1212 | exit(1); | |
1213 | } | |
1214 | ||
5aa5bd14 DB |
1215 | #define MAP_SIZE (32 * 1024) |
1216 | ||
1217 | static void test_map_large(void) | |
1218 | { | |
1219 | struct bigkey { | |
1220 | int a; | |
1221 | char b[116]; | |
1222 | long long c; | |
1223 | } key; | |
1224 | int fd, i, value; | |
1225 | ||
f4874d01 | 1226 | fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value), |
5aa5bd14 DB |
1227 | MAP_SIZE, map_flags); |
1228 | if (fd < 0) { | |
1229 | printf("Failed to create large map '%s'!\n", strerror(errno)); | |
1230 | exit(1); | |
1231 | } | |
1232 | ||
1233 | for (i = 0; i < MAP_SIZE; i++) { | |
1234 | key = (struct bigkey) { .c = i }; | |
1235 | value = i; | |
1236 | ||
10ecc728 | 1237 | assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0); |
5aa5bd14 DB |
1238 | } |
1239 | ||
1240 | key.c = -1; | |
10ecc728 | 1241 | assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 && |
5aa5bd14 DB |
1242 | errno == E2BIG); |
1243 | ||
1244 | /* Iterate through all elements. */ | |
8fe45924 TQ |
1245 | assert(bpf_map_get_next_key(fd, NULL, &key) == 0); |
1246 | key.c = -1; | |
5aa5bd14 | 1247 | for (i = 0; i < MAP_SIZE; i++) |
5f155c25 MS |
1248 | assert(bpf_map_get_next_key(fd, &key, &key) == 0); |
1249 | assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT); | |
5aa5bd14 DB |
1250 | |
1251 | key.c = 0; | |
e5ff7c40 | 1252 | assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0); |
5aa5bd14 | 1253 | key.a = 1; |
e5ff7c40 | 1254 | assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT); |
5aa5bd14 DB |
1255 | |
1256 | close(fd); | |
1257 | } | |
1258 | ||
1a97cf1f | 1259 | #define run_parallel(N, FN, DATA) \ |
dd9cef43 | 1260 | printf("Fork %u tasks to '" #FN "'\n", N); \ |
1a97cf1f AS |
1261 | __run_parallel(N, FN, DATA) |
1262 | ||
dd9cef43 BL |
1263 | static void __run_parallel(unsigned int tasks, |
1264 | void (*fn)(unsigned int task, void *data), | |
1a97cf1f | 1265 | void *data) |
5aa5bd14 DB |
1266 | { |
1267 | pid_t pid[tasks]; | |
1268 | int i; | |
1269 | ||
1270 | for (i = 0; i < tasks; i++) { | |
1271 | pid[i] = fork(); | |
1272 | if (pid[i] == 0) { | |
1273 | fn(i, data); | |
1274 | exit(0); | |
1275 | } else if (pid[i] == -1) { | |
1276 | printf("Couldn't spawn #%d process!\n", i); | |
1277 | exit(1); | |
1278 | } | |
1279 | } | |
1280 | ||
1281 | for (i = 0; i < tasks; i++) { | |
1282 | int status; | |
1283 | ||
1284 | assert(waitpid(pid[i], &status, 0) == pid[i]); | |
1285 | assert(status == 0); | |
1286 | } | |
1287 | } | |
1288 | ||
1289 | static void test_map_stress(void) | |
1290 | { | |
1291 | run_parallel(100, test_hashmap, NULL); | |
1292 | run_parallel(100, test_hashmap_percpu, NULL); | |
8c290e60 | 1293 | run_parallel(100, test_hashmap_sizes, NULL); |
5ecf51fd | 1294 | run_parallel(100, test_hashmap_walk, NULL); |
5aa5bd14 DB |
1295 | |
1296 | run_parallel(100, test_arraymap, NULL); | |
1297 | run_parallel(100, test_arraymap_percpu, NULL); | |
1298 | } | |
1299 | ||
1300 | #define TASKS 1024 | |
1301 | ||
1302 | #define DO_UPDATE 1 | |
1303 | #define DO_DELETE 0 | |
1304 | ||
dd9cef43 | 1305 | static void test_update_delete(unsigned int fn, void *data) |
5aa5bd14 DB |
1306 | { |
1307 | int do_update = ((int *)data)[1]; | |
1308 | int fd = ((int *)data)[0]; | |
1309 | int i, key, value; | |
1310 | ||
1311 | for (i = fn; i < MAP_SIZE; i += TASKS) { | |
1312 | key = value = i; | |
1313 | ||
1314 | if (do_update) { | |
10ecc728 MS |
1315 | assert(bpf_map_update_elem(fd, &key, &value, |
1316 | BPF_NOEXIST) == 0); | |
1317 | assert(bpf_map_update_elem(fd, &key, &value, | |
1318 | BPF_EXIST) == 0); | |
5aa5bd14 | 1319 | } else { |
e58383b8 | 1320 | assert(bpf_map_delete_elem(fd, &key) == 0); |
5aa5bd14 DB |
1321 | } |
1322 | } | |
1323 | } | |
1324 | ||
1325 | static void test_map_parallel(void) | |
1326 | { | |
1327 | int i, fd, key = 0, value = 0; | |
1328 | int data[2]; | |
1329 | ||
f4874d01 | 1330 | fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value), |
5aa5bd14 DB |
1331 | MAP_SIZE, map_flags); |
1332 | if (fd < 0) { | |
1333 | printf("Failed to create map for parallel test '%s'!\n", | |
1334 | strerror(errno)); | |
1335 | exit(1); | |
1336 | } | |
1337 | ||
1338 | /* Use the same fd in children to add elements to this map: | |
1339 | * child_0 adds key=0, key=1024, key=2048, ... | |
1340 | * child_1 adds key=1, key=1025, key=2049, ... | |
1341 | * child_1023 adds key=1023, ... | |
1342 | */ | |
1343 | data[0] = fd; | |
1344 | data[1] = DO_UPDATE; | |
1a97cf1f | 1345 | run_parallel(TASKS, test_update_delete, data); |
5aa5bd14 DB |
1346 | |
1347 | /* Check that key=0 is already there. */ | |
10ecc728 | 1348 | assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 && |
5aa5bd14 DB |
1349 | errno == EEXIST); |
1350 | ||
1351 | /* Check that all elements were inserted. */ | |
8fe45924 | 1352 | assert(bpf_map_get_next_key(fd, NULL, &key) == 0); |
5aa5bd14 DB |
1353 | key = -1; |
1354 | for (i = 0; i < MAP_SIZE; i++) | |
5f155c25 MS |
1355 | assert(bpf_map_get_next_key(fd, &key, &key) == 0); |
1356 | assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT); | |
5aa5bd14 DB |
1357 | |
1358 | /* Another check for all elements */ | |
1359 | for (i = 0; i < MAP_SIZE; i++) { | |
1360 | key = MAP_SIZE - i - 1; | |
1361 | ||
e5ff7c40 | 1362 | assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && |
5aa5bd14 DB |
1363 | value == key); |
1364 | } | |
1365 | ||
1366 | /* Now let's delete all elemenets in parallel. */ | |
1367 | data[1] = DO_DELETE; | |
1a97cf1f | 1368 | run_parallel(TASKS, test_update_delete, data); |
5aa5bd14 DB |
1369 | |
1370 | /* Nothing should be left. */ | |
1371 | key = -1; | |
8fe45924 | 1372 | assert(bpf_map_get_next_key(fd, NULL, &key) == -1 && errno == ENOENT); |
5f155c25 | 1373 | assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT); |
5aa5bd14 DB |
1374 | } |
1375 | ||
e043325b CF |
1376 | static void test_map_rdonly(void) |
1377 | { | |
e27afb84 | 1378 | int fd, key = 0, value = 0; |
e043325b CF |
1379 | |
1380 | fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value), | |
1381 | MAP_SIZE, map_flags | BPF_F_RDONLY); | |
1382 | if (fd < 0) { | |
1383 | printf("Failed to create map for read only test '%s'!\n", | |
1384 | strerror(errno)); | |
1385 | exit(1); | |
1386 | } | |
1387 | ||
1388 | key = 1; | |
1389 | value = 1234; | |
1390 | /* Insert key=1 element. */ | |
1391 | assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == -1 && | |
1392 | errno == EPERM); | |
1393 | ||
1394 | /* Check that key=2 is not found. */ | |
1395 | assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT); | |
1396 | assert(bpf_map_get_next_key(fd, &key, &value) == -1 && errno == ENOENT); | |
1397 | } | |
1398 | ||
1399 | static void test_map_wronly(void) | |
1400 | { | |
e27afb84 | 1401 | int fd, key = 0, value = 0; |
e043325b CF |
1402 | |
1403 | fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value), | |
1404 | MAP_SIZE, map_flags | BPF_F_WRONLY); | |
1405 | if (fd < 0) { | |
1406 | printf("Failed to create map for read only test '%s'!\n", | |
1407 | strerror(errno)); | |
1408 | exit(1); | |
1409 | } | |
1410 | ||
1411 | key = 1; | |
1412 | value = 1234; | |
1413 | /* Insert key=1 element. */ | |
e27afb84 | 1414 | assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); |
e043325b CF |
1415 | |
1416 | /* Check that key=2 is not found. */ | |
1417 | assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == EPERM); | |
1418 | assert(bpf_map_get_next_key(fd, &key, &value) == -1 && errno == EPERM); | |
1419 | } | |
1420 | ||
6bc8529c MKL |
1421 | static void prepare_reuseport_grp(int type, int map_fd, |
1422 | __s64 *fds64, __u64 *sk_cookies, | |
1423 | unsigned int n) | |
1424 | { | |
1425 | socklen_t optlen, addrlen; | |
1426 | struct sockaddr_in6 s6; | |
1427 | const __u32 index0 = 0; | |
1428 | const int optval = 1; | |
1429 | unsigned int i; | |
1430 | u64 sk_cookie; | |
1431 | __s64 fd64; | |
1432 | int err; | |
1433 | ||
1434 | s6.sin6_family = AF_INET6; | |
1435 | s6.sin6_addr = in6addr_any; | |
1436 | s6.sin6_port = 0; | |
1437 | addrlen = sizeof(s6); | |
1438 | optlen = sizeof(sk_cookie); | |
1439 | ||
1440 | for (i = 0; i < n; i++) { | |
1441 | fd64 = socket(AF_INET6, type, 0); | |
1442 | CHECK(fd64 == -1, "socket()", | |
1443 | "sock_type:%d fd64:%lld errno:%d\n", | |
1444 | type, fd64, errno); | |
1445 | ||
1446 | err = setsockopt(fd64, SOL_SOCKET, SO_REUSEPORT, | |
1447 | &optval, sizeof(optval)); | |
26a1ccc6 | 1448 | CHECK(err == -1, "setsockopt(SO_REUSEPORT)", |
6bc8529c MKL |
1449 | "err:%d errno:%d\n", err, errno); |
1450 | ||
1451 | /* reuseport_array does not allow unbound sk */ | |
1452 | err = bpf_map_update_elem(map_fd, &index0, &fd64, | |
1453 | BPF_ANY); | |
1454 | CHECK(err != -1 || errno != EINVAL, | |
1455 | "reuseport array update unbound sk", | |
1456 | "sock_type:%d err:%d errno:%d\n", | |
1457 | type, err, errno); | |
1458 | ||
1459 | err = bind(fd64, (struct sockaddr *)&s6, sizeof(s6)); | |
1460 | CHECK(err == -1, "bind()", | |
1461 | "sock_type:%d err:%d errno:%d\n", type, err, errno); | |
1462 | ||
1463 | if (i == 0) { | |
1464 | err = getsockname(fd64, (struct sockaddr *)&s6, | |
1465 | &addrlen); | |
1466 | CHECK(err == -1, "getsockname()", | |
1467 | "sock_type:%d err:%d errno:%d\n", | |
1468 | type, err, errno); | |
1469 | } | |
1470 | ||
1471 | err = getsockopt(fd64, SOL_SOCKET, SO_COOKIE, &sk_cookie, | |
1472 | &optlen); | |
1473 | CHECK(err == -1, "getsockopt(SO_COOKIE)", | |
1474 | "sock_type:%d err:%d errno:%d\n", type, err, errno); | |
1475 | ||
1476 | if (type == SOCK_STREAM) { | |
1477 | /* | |
1478 | * reuseport_array does not allow | |
1479 | * non-listening tcp sk. | |
1480 | */ | |
1481 | err = bpf_map_update_elem(map_fd, &index0, &fd64, | |
1482 | BPF_ANY); | |
1483 | CHECK(err != -1 || errno != EINVAL, | |
1484 | "reuseport array update non-listening sk", | |
1485 | "sock_type:%d err:%d errno:%d\n", | |
1486 | type, err, errno); | |
1487 | err = listen(fd64, 0); | |
1488 | CHECK(err == -1, "listen()", | |
1489 | "sock_type:%d, err:%d errno:%d\n", | |
1490 | type, err, errno); | |
1491 | } | |
1492 | ||
1493 | fds64[i] = fd64; | |
1494 | sk_cookies[i] = sk_cookie; | |
1495 | } | |
1496 | } | |
1497 | ||
1498 | static void test_reuseport_array(void) | |
1499 | { | |
1500 | #define REUSEPORT_FD_IDX(err, last) ({ (err) ? last : !last; }) | |
1501 | ||
1502 | const __u32 array_size = 4, index0 = 0, index3 = 3; | |
1503 | int types[2] = { SOCK_STREAM, SOCK_DGRAM }, type; | |
1504 | __u64 grpa_cookies[2], sk_cookie, map_cookie; | |
1505 | __s64 grpa_fds64[2] = { -1, -1 }, fd64 = -1; | |
1506 | const __u32 bad_index = array_size; | |
1507 | int map_fd, err, t, f; | |
1508 | __u32 fds_idx = 0; | |
1509 | int fd; | |
1510 | ||
1511 | map_fd = bpf_create_map(BPF_MAP_TYPE_REUSEPORT_SOCKARRAY, | |
1512 | sizeof(__u32), sizeof(__u64), array_size, 0); | |
1513 | CHECK(map_fd == -1, "reuseport array create", | |
1514 | "map_fd:%d, errno:%d\n", map_fd, errno); | |
1515 | ||
1516 | /* Test lookup/update/delete with invalid index */ | |
1517 | err = bpf_map_delete_elem(map_fd, &bad_index); | |
1518 | CHECK(err != -1 || errno != E2BIG, "reuseport array del >=max_entries", | |
1519 | "err:%d errno:%d\n", err, errno); | |
1520 | ||
1521 | err = bpf_map_update_elem(map_fd, &bad_index, &fd64, BPF_ANY); | |
1522 | CHECK(err != -1 || errno != E2BIG, | |
1523 | "reuseport array update >=max_entries", | |
1524 | "err:%d errno:%d\n", err, errno); | |
1525 | ||
1526 | err = bpf_map_lookup_elem(map_fd, &bad_index, &map_cookie); | |
1527 | CHECK(err != -1 || errno != ENOENT, | |
1528 | "reuseport array update >=max_entries", | |
1529 | "err:%d errno:%d\n", err, errno); | |
1530 | ||
1531 | /* Test lookup/delete non existence elem */ | |
1532 | err = bpf_map_lookup_elem(map_fd, &index3, &map_cookie); | |
1533 | CHECK(err != -1 || errno != ENOENT, | |
1534 | "reuseport array lookup not-exist elem", | |
1535 | "err:%d errno:%d\n", err, errno); | |
1536 | err = bpf_map_delete_elem(map_fd, &index3); | |
1537 | CHECK(err != -1 || errno != ENOENT, | |
1538 | "reuseport array del not-exist elem", | |
1539 | "err:%d errno:%d\n", err, errno); | |
1540 | ||
1541 | for (t = 0; t < ARRAY_SIZE(types); t++) { | |
1542 | type = types[t]; | |
1543 | ||
1544 | prepare_reuseport_grp(type, map_fd, grpa_fds64, | |
1545 | grpa_cookies, ARRAY_SIZE(grpa_fds64)); | |
1546 | ||
1547 | /* Test BPF_* update flags */ | |
1548 | /* BPF_EXIST failure case */ | |
1549 | err = bpf_map_update_elem(map_fd, &index3, &grpa_fds64[fds_idx], | |
1550 | BPF_EXIST); | |
1551 | CHECK(err != -1 || errno != ENOENT, | |
1552 | "reuseport array update empty elem BPF_EXIST", | |
1553 | "sock_type:%d err:%d errno:%d\n", | |
1554 | type, err, errno); | |
1555 | fds_idx = REUSEPORT_FD_IDX(err, fds_idx); | |
1556 | ||
1557 | /* BPF_NOEXIST success case */ | |
1558 | err = bpf_map_update_elem(map_fd, &index3, &grpa_fds64[fds_idx], | |
1559 | BPF_NOEXIST); | |
1560 | CHECK(err == -1, | |
1561 | "reuseport array update empty elem BPF_NOEXIST", | |
1562 | "sock_type:%d err:%d errno:%d\n", | |
1563 | type, err, errno); | |
1564 | fds_idx = REUSEPORT_FD_IDX(err, fds_idx); | |
1565 | ||
1566 | /* BPF_EXIST success case. */ | |
1567 | err = bpf_map_update_elem(map_fd, &index3, &grpa_fds64[fds_idx], | |
1568 | BPF_EXIST); | |
1569 | CHECK(err == -1, | |
1570 | "reuseport array update same elem BPF_EXIST", | |
1571 | "sock_type:%d err:%d errno:%d\n", type, err, errno); | |
1572 | fds_idx = REUSEPORT_FD_IDX(err, fds_idx); | |
1573 | ||
1574 | /* BPF_NOEXIST failure case */ | |
1575 | err = bpf_map_update_elem(map_fd, &index3, &grpa_fds64[fds_idx], | |
1576 | BPF_NOEXIST); | |
1577 | CHECK(err != -1 || errno != EEXIST, | |
1578 | "reuseport array update non-empty elem BPF_NOEXIST", | |
1579 | "sock_type:%d err:%d errno:%d\n", | |
1580 | type, err, errno); | |
1581 | fds_idx = REUSEPORT_FD_IDX(err, fds_idx); | |
1582 | ||
1583 | /* BPF_ANY case (always succeed) */ | |
1584 | err = bpf_map_update_elem(map_fd, &index3, &grpa_fds64[fds_idx], | |
1585 | BPF_ANY); | |
1586 | CHECK(err == -1, | |
1587 | "reuseport array update same sk with BPF_ANY", | |
1588 | "sock_type:%d err:%d errno:%d\n", type, err, errno); | |
1589 | ||
1590 | fd64 = grpa_fds64[fds_idx]; | |
1591 | sk_cookie = grpa_cookies[fds_idx]; | |
1592 | ||
1593 | /* The same sk cannot be added to reuseport_array twice */ | |
1594 | err = bpf_map_update_elem(map_fd, &index3, &fd64, BPF_ANY); | |
1595 | CHECK(err != -1 || errno != EBUSY, | |
1596 | "reuseport array update same sk with same index", | |
1597 | "sock_type:%d err:%d errno:%d\n", | |
1598 | type, err, errno); | |
1599 | ||
1600 | err = bpf_map_update_elem(map_fd, &index0, &fd64, BPF_ANY); | |
1601 | CHECK(err != -1 || errno != EBUSY, | |
1602 | "reuseport array update same sk with different index", | |
1603 | "sock_type:%d err:%d errno:%d\n", | |
1604 | type, err, errno); | |
1605 | ||
1606 | /* Test delete elem */ | |
1607 | err = bpf_map_delete_elem(map_fd, &index3); | |
1608 | CHECK(err == -1, "reuseport array delete sk", | |
1609 | "sock_type:%d err:%d errno:%d\n", | |
1610 | type, err, errno); | |
1611 | ||
1612 | /* Add it back with BPF_NOEXIST */ | |
1613 | err = bpf_map_update_elem(map_fd, &index3, &fd64, BPF_NOEXIST); | |
1614 | CHECK(err == -1, | |
1615 | "reuseport array re-add with BPF_NOEXIST after del", | |
1616 | "sock_type:%d err:%d errno:%d\n", type, err, errno); | |
1617 | ||
1618 | /* Test cookie */ | |
1619 | err = bpf_map_lookup_elem(map_fd, &index3, &map_cookie); | |
1620 | CHECK(err == -1 || sk_cookie != map_cookie, | |
1621 | "reuseport array lookup re-added sk", | |
1622 | "sock_type:%d err:%d errno:%d sk_cookie:0x%llx map_cookie:0x%llxn", | |
1623 | type, err, errno, sk_cookie, map_cookie); | |
1624 | ||
1625 | /* Test elem removed by close() */ | |
1626 | for (f = 0; f < ARRAY_SIZE(grpa_fds64); f++) | |
1627 | close(grpa_fds64[f]); | |
1628 | err = bpf_map_lookup_elem(map_fd, &index3, &map_cookie); | |
1629 | CHECK(err != -1 || errno != ENOENT, | |
1630 | "reuseport array lookup after close()", | |
1631 | "sock_type:%d err:%d errno:%d\n", | |
1632 | type, err, errno); | |
1633 | } | |
1634 | ||
1635 | /* Test SOCK_RAW */ | |
1636 | fd64 = socket(AF_INET6, SOCK_RAW, IPPROTO_UDP); | |
1637 | CHECK(fd64 == -1, "socket(SOCK_RAW)", "err:%d errno:%d\n", | |
1638 | err, errno); | |
1639 | err = bpf_map_update_elem(map_fd, &index3, &fd64, BPF_NOEXIST); | |
1640 | CHECK(err != -1 || errno != ENOTSUPP, "reuseport array update SOCK_RAW", | |
1641 | "err:%d errno:%d\n", err, errno); | |
1642 | close(fd64); | |
1643 | ||
1644 | /* Close the 64 bit value map */ | |
1645 | close(map_fd); | |
1646 | ||
1647 | /* Test 32 bit fd */ | |
1648 | map_fd = bpf_create_map(BPF_MAP_TYPE_REUSEPORT_SOCKARRAY, | |
1649 | sizeof(__u32), sizeof(__u32), array_size, 0); | |
1650 | CHECK(map_fd == -1, "reuseport array create", | |
1651 | "map_fd:%d, errno:%d\n", map_fd, errno); | |
1652 | prepare_reuseport_grp(SOCK_STREAM, map_fd, &fd64, &sk_cookie, 1); | |
1653 | fd = fd64; | |
1654 | err = bpf_map_update_elem(map_fd, &index3, &fd, BPF_NOEXIST); | |
1655 | CHECK(err == -1, "reuseport array update 32 bit fd", | |
1656 | "err:%d errno:%d\n", err, errno); | |
1657 | err = bpf_map_lookup_elem(map_fd, &index3, &map_cookie); | |
1658 | CHECK(err != -1 || errno != ENOSPC, | |
1659 | "reuseport array lookup 32 bit fd", | |
1660 | "err:%d errno:%d\n", err, errno); | |
1661 | close(fd); | |
1662 | close(map_fd); | |
1663 | } | |
1664 | ||
5aa5bd14 DB |
1665 | static void run_all_tests(void) |
1666 | { | |
1667 | test_hashmap(0, NULL); | |
1668 | test_hashmap_percpu(0, NULL); | |
5ecf51fd | 1669 | test_hashmap_walk(0, NULL); |
bf5d68c7 | 1670 | test_hashmap_zero_seed(); |
5aa5bd14 DB |
1671 | |
1672 | test_arraymap(0, NULL); | |
1673 | test_arraymap_percpu(0, NULL); | |
1674 | ||
1675 | test_arraymap_percpu_many_keys(); | |
1676 | ||
81f6bf81 | 1677 | test_devmap(0, NULL); |
6f6d33f3 | 1678 | test_sockmap(0, NULL); |
81f6bf81 | 1679 | |
5aa5bd14 DB |
1680 | test_map_large(); |
1681 | test_map_parallel(); | |
1682 | test_map_stress(); | |
e043325b CF |
1683 | |
1684 | test_map_rdonly(); | |
1685 | test_map_wronly(); | |
6bc8529c MKL |
1686 | |
1687 | test_reuseport_array(); | |
43b987d2 MV |
1688 | |
1689 | test_queuemap(0, NULL); | |
1690 | test_stackmap(0, NULL); | |
b1957c92 NS |
1691 | |
1692 | test_map_in_map(); | |
5aa5bd14 DB |
1693 | } |
1694 | ||
51a0e301 MKL |
1695 | #define DECLARE |
1696 | #include <map_tests/tests.h> | |
1697 | #undef DECLARE | |
1698 | ||
5aa5bd14 DB |
1699 | int main(void) |
1700 | { | |
43b987d2 MV |
1701 | srand(time(NULL)); |
1702 | ||
5aa5bd14 DB |
1703 | map_flags = 0; |
1704 | run_all_tests(); | |
1705 | ||
1706 | map_flags = BPF_F_NO_PREALLOC; | |
1707 | run_all_tests(); | |
1708 | ||
51a0e301 MKL |
1709 | #define CALL |
1710 | #include <map_tests/tests.h> | |
1711 | #undef CALL | |
1712 | ||
e8ddbfb4 | 1713 | printf("test_maps: OK, %d SKIPPED\n", skips); |
5aa5bd14 DB |
1714 | return 0; |
1715 | } |