1 // SPDX-License-Identifier: GPL-2.0-only
3 * Testsuite for eBPF maps
5 * Copyright (c) 2014 PLUMgrid, http://plumgrid.com
6 * Copyright (c) 2016 Facebook
18 #include <sys/socket.h>
19 #include <netinet/in.h>
20 #include <linux/bpf.h>
23 #include <bpf/libbpf.h>
26 #include "bpf_rlimit.h"
27 #include "test_maps.h"
37 static void test_hashmap(unsigned int task, void *data)
39 long long key, next_key, first_key, value;
42 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
45 printf("Failed to create hashmap '%s'!\n", strerror(errno));
51 /* Insert key=1 element. */
52 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
55 /* BPF_NOEXIST means add new element if it doesn't exist. */
56 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
57 /* key=1 already exists. */
60 /* -1 is an invalid flag. */
61 assert(bpf_map_update_elem(fd, &key, &value, -1) == -1 &&
64 /* Check that key=1 can be found. */
65 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);
68 /* Check that key=2 is not found. */
69 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);
71 /* BPF_EXIST means update existing element. */
72 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == -1 &&
73 /* key=2 is not there. */
76 /* Insert key=2 element. */
77 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);
79 /* key=1 and key=2 were inserted, check that key=0 cannot be
80 * inserted due to max_entries limit.
83 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
86 /* Update existing element, though the map is full. */
88 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0);
90 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
92 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
95 /* Check that key = 0 doesn't exist. */
97 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
99 /* Iterate over two elements. */
100 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 &&
101 (first_key == 1 || first_key == 2));
102 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
103 (next_key == first_key));
104 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
105 (next_key == 1 || next_key == 2) &&
106 (next_key != first_key));
107 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 &&
110 /* Delete both elements. */
112 assert(bpf_map_delete_elem(fd, &key) == 0);
114 assert(bpf_map_delete_elem(fd, &key) == 0);
115 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
118 /* Check that map is empty. */
119 assert(bpf_map_get_next_key(fd, NULL, &next_key) == -1 &&
121 assert(bpf_map_get_next_key(fd, &key, &next_key) == -1 &&
127 static void test_hashmap_sizes(unsigned int task, void *data)
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,
138 printf("Failed to create hashmap key=%d value=%d '%s'\n",
139 i, j, strerror(errno));
143 usleep(10); /* give kernel time to destroy */
147 static void test_hashmap_percpu(unsigned int task, void *data)
149 unsigned int nr_cpus = bpf_num_possible_cpus();
150 BPF_DECLARE_PERCPU(long, value);
151 long long key, next_key, first_key;
152 int expected_key_mask = 0;
155 fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_HASH, sizeof(key),
156 sizeof(bpf_percpu(value, 0)), 2, map_flags);
158 printf("Failed to create hashmap '%s'!\n", strerror(errno));
162 for (i = 0; i < nr_cpus; i++)
163 bpf_percpu(value, i) = i + 100;
166 /* Insert key=1 element. */
167 assert(!(expected_key_mask & key));
168 assert(bpf_map_update_elem(fd, &key, value, BPF_ANY) == 0);
169 expected_key_mask |= key;
171 /* BPF_NOEXIST means add new element if it doesn't exist. */
172 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 &&
173 /* key=1 already exists. */
176 /* -1 is an invalid flag. */
177 assert(bpf_map_update_elem(fd, &key, value, -1) == -1 &&
180 /* Check that key=1 can be found. Value could be 0 if the lookup
181 * was run from a different CPU.
183 bpf_percpu(value, 0) = 1;
184 assert(bpf_map_lookup_elem(fd, &key, value) == 0 &&
185 bpf_percpu(value, 0) == 100);
188 /* Check that key=2 is not found. */
189 assert(bpf_map_lookup_elem(fd, &key, value) == -1 && errno == ENOENT);
191 /* BPF_EXIST means update existing element. */
192 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == -1 &&
193 /* key=2 is not there. */
196 /* Insert key=2 element. */
197 assert(!(expected_key_mask & key));
198 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0);
199 expected_key_mask |= key;
201 /* key=1 and key=2 were inserted, check that key=0 cannot be
202 * inserted due to max_entries limit.
205 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 &&
208 /* Check that key = 0 doesn't exist. */
209 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
211 /* Iterate over two elements. */
212 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 &&
213 ((expected_key_mask & first_key) == first_key));
214 while (!bpf_map_get_next_key(fd, &key, &next_key)) {
216 assert(next_key == first_key);
219 assert((expected_key_mask & next_key) == next_key);
220 expected_key_mask &= ~next_key;
222 assert(bpf_map_lookup_elem(fd, &next_key, value) == 0);
224 for (i = 0; i < nr_cpus; i++)
225 assert(bpf_percpu(value, i) == i + 100);
229 assert(errno == ENOENT);
231 /* Update with BPF_EXIST. */
233 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0);
235 /* Delete both elements. */
237 assert(bpf_map_delete_elem(fd, &key) == 0);
239 assert(bpf_map_delete_elem(fd, &key) == 0);
240 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
243 /* Check that map is empty. */
244 assert(bpf_map_get_next_key(fd, NULL, &next_key) == -1 &&
246 assert(bpf_map_get_next_key(fd, &key, &next_key) == -1 &&
252 static int helper_fill_hashmap(int max_entries)
255 long long key, value;
257 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
258 max_entries, map_flags);
260 "failed to create hashmap",
261 "err: %s, flags: 0x%x\n", strerror(errno), map_flags);
263 for (i = 0; i < max_entries; i++) {
264 key = i; value = key;
265 ret = bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST);
267 "can't update hashmap",
268 "err: %s\n", strerror(ret));
274 static void test_hashmap_walk(unsigned int task, void *data)
276 int fd, i, max_entries = 1000;
277 long long key, value, next_key;
278 bool next_key_valid = true;
280 fd = helper_fill_hashmap(max_entries);
282 for (i = 0; bpf_map_get_next_key(fd, !i ? NULL : &key,
283 &next_key) == 0; i++) {
285 assert(bpf_map_lookup_elem(fd, &key, &value) == 0);
288 assert(i == max_entries);
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);
295 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0);
299 assert(i == max_entries);
301 for (i = 0; bpf_map_get_next_key(fd, !i ? NULL : &key,
302 &next_key) == 0; i++) {
304 assert(bpf_map_lookup_elem(fd, &key, &value) == 0);
305 assert(value - 1 == key);
308 assert(i == max_entries);
312 static void test_hashmap_zero_seed(void)
314 int i, first, second, old_flags;
315 long long key, next_first, next_second;
317 old_flags = map_flags;
318 map_flags |= BPF_F_ZERO_SEED;
320 first = helper_fill_hashmap(3);
321 second = helper_fill_hashmap(3);
324 void *key_ptr = !i ? NULL : &key;
326 if (bpf_map_get_next_key(first, key_ptr, &next_first) != 0)
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,
334 "i: %d first: %lld second: %lld\n", i,
335 next_first, next_second);
340 map_flags = old_flags;
345 static void test_arraymap(unsigned int task, void *data)
347 int key, next_key, fd;
350 fd = bpf_create_map(BPF_MAP_TYPE_ARRAY, sizeof(key), sizeof(value),
353 printf("Failed to create arraymap '%s'!\n", strerror(errno));
359 /* Insert key=1 element. */
360 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
363 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
366 /* Check that key=1 can be found. */
367 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);
370 /* Check that key=0 is also found and zero initialized. */
371 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);
373 /* key=0 and key=1 were inserted, check that key=2 cannot be inserted
374 * due to max_entries limit.
377 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == -1 &&
380 /* Check that key = 2 doesn't exist. */
381 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);
383 /* Iterate over two elements. */
384 assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&
386 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
388 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
390 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 &&
393 /* Delete shouldn't succeed. */
395 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == EINVAL);
400 static void test_arraymap_percpu(unsigned int task, void *data)
402 unsigned int nr_cpus = bpf_num_possible_cpus();
403 BPF_DECLARE_PERCPU(long, values);
404 int key, next_key, fd, i;
406 fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_ARRAY, sizeof(key),
407 sizeof(bpf_percpu(values, 0)), 2, 0);
409 printf("Failed to create arraymap '%s'!\n", strerror(errno));
413 for (i = 0; i < nr_cpus; i++)
414 bpf_percpu(values, i) = i + 100;
417 /* Insert key=1 element. */
418 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);
420 bpf_percpu(values, 0) = 0;
421 assert(bpf_map_update_elem(fd, &key, values, BPF_NOEXIST) == -1 &&
424 /* Check that key=1 can be found. */
425 assert(bpf_map_lookup_elem(fd, &key, values) == 0 &&
426 bpf_percpu(values, 0) == 100);
429 /* Check that key=0 is also found and zero initialized. */
430 assert(bpf_map_lookup_elem(fd, &key, values) == 0 &&
431 bpf_percpu(values, 0) == 0 &&
432 bpf_percpu(values, nr_cpus - 1) == 0);
434 /* Check that key=2 cannot be inserted due to max_entries limit. */
436 assert(bpf_map_update_elem(fd, &key, values, BPF_EXIST) == -1 &&
439 /* Check that key = 2 doesn't exist. */
440 assert(bpf_map_lookup_elem(fd, &key, values) == -1 && errno == ENOENT);
442 /* Iterate over two elements. */
443 assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&
445 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
447 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
449 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 &&
452 /* Delete shouldn't succeed. */
454 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == EINVAL);
459 static void test_arraymap_percpu_many_keys(void)
461 unsigned int nr_cpus = bpf_num_possible_cpus();
462 BPF_DECLARE_PERCPU(long, values);
463 /* nr_keys is not too large otherwise the test stresses percpu
464 * allocator more than anything else
466 unsigned int nr_keys = 2000;
469 fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_ARRAY, sizeof(key),
470 sizeof(bpf_percpu(values, 0)), nr_keys, 0);
472 printf("Failed to create per-cpu arraymap '%s'!\n",
477 for (i = 0; i < nr_cpus; i++)
478 bpf_percpu(values, i) = i + 10;
480 for (key = 0; key < nr_keys; key++)
481 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);
483 for (key = 0; key < nr_keys; key++) {
484 for (i = 0; i < nr_cpus; i++)
485 bpf_percpu(values, i) = 0;
487 assert(bpf_map_lookup_elem(fd, &key, values) == 0);
489 for (i = 0; i < nr_cpus; i++)
490 assert(bpf_percpu(values, i) == i + 10);
496 static void test_devmap(unsigned int task, void *data)
501 fd = bpf_create_map(BPF_MAP_TYPE_DEVMAP, sizeof(key), sizeof(value),
504 printf("Failed to create devmap '%s'!\n", strerror(errno));
511 static void test_queuemap(unsigned int task, void *data)
513 const int MAP_SIZE = 32;
514 __u32 vals[MAP_SIZE + MAP_SIZE/2], val;
517 /* Fill test values to be used */
518 for (i = 0; i < MAP_SIZE + MAP_SIZE/2; i++)
521 /* Invalid key size */
522 fd = bpf_create_map(BPF_MAP_TYPE_QUEUE, 4, sizeof(val), MAP_SIZE,
524 assert(fd < 0 && errno == EINVAL);
526 fd = bpf_create_map(BPF_MAP_TYPE_QUEUE, 0, sizeof(val), MAP_SIZE,
528 /* Queue map does not support BPF_F_NO_PREALLOC */
529 if (map_flags & BPF_F_NO_PREALLOC) {
530 assert(fd < 0 && errno == EINVAL);
534 printf("Failed to create queuemap '%s'!\n", strerror(errno));
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);
542 /* Check that element cannot be pushed due to max_entries limit */
543 assert(bpf_map_update_elem(fd, NULL, &val, 0) == -1 &&
547 assert(bpf_map_lookup_elem(fd, NULL, &val) == 0 && val == vals[0]);
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);
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 &&
558 /* Check that there are not elements left */
559 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == -1 &&
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);
569 static void test_stackmap(unsigned int task, void *data)
571 const int MAP_SIZE = 32;
572 __u32 vals[MAP_SIZE + MAP_SIZE/2], val;
575 /* Fill test values to be used */
576 for (i = 0; i < MAP_SIZE + MAP_SIZE/2; i++)
579 /* Invalid key size */
580 fd = bpf_create_map(BPF_MAP_TYPE_STACK, 4, sizeof(val), MAP_SIZE,
582 assert(fd < 0 && errno == EINVAL);
584 fd = bpf_create_map(BPF_MAP_TYPE_STACK, 0, sizeof(val), MAP_SIZE,
586 /* Stack map does not support BPF_F_NO_PREALLOC */
587 if (map_flags & BPF_F_NO_PREALLOC) {
588 assert(fd < 0 && errno == EINVAL);
592 printf("Failed to create stackmap '%s'!\n", strerror(errno));
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);
600 /* Check that element cannot be pushed due to max_entries limit */
601 assert(bpf_map_update_elem(fd, NULL, &val, 0) == -1 &&
605 assert(bpf_map_lookup_elem(fd, NULL, &val) == 0 && val == vals[i - 1]);
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);
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 &&
616 /* Check that there are not elements left */
617 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == -1 &&
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);
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"
633 #define SOCKMAP_TCP_MSG_PROG "./sockmap_tcp_msg_prog.o"
634 static void test_sockmap(unsigned int tasks, void *data)
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;
638 int ports[] = {50200, 50201, 50202, 50204};
639 int err, i, fd, udp, sfd[6] = {0xdeadbeef};
640 u8 buf[20] = {0x0, 0x5, 0x3, 0x2, 0x1, 0x0};
641 int parse_prog, verdict_prog, msg_prog;
642 struct sockaddr_in addr;
643 int one = 1, s, sc, rc;
644 struct bpf_object *obj;
650 /* Create some sockets to use with sockmap */
651 for (i = 0; i < 2; i++) {
652 sfd[i] = socket(AF_INET, SOCK_STREAM, 0);
655 err = setsockopt(sfd[i], SOL_SOCKET, SO_REUSEADDR,
656 (char *)&one, sizeof(one));
658 printf("failed to setsockopt\n");
661 err = ioctl(sfd[i], FIONBIO, (char *)&one);
663 printf("failed to ioctl\n");
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));
672 printf("failed to bind: err %i: %i:%i\n",
676 err = listen(sfd[i], 32);
678 printf("failed to listen\n");
683 for (i = 2; i < 4; i++) {
684 sfd[i] = socket(AF_INET, SOCK_STREAM, 0);
687 err = setsockopt(sfd[i], SOL_SOCKET, SO_REUSEADDR,
688 (char *)&one, sizeof(one));
690 printf("set sock opt\n");
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));
699 printf("failed to connect\n");
705 for (i = 4; i < 6; i++) {
706 sfd[i] = accept(sfd[i - 4], NULL, NULL);
708 printf("accept failed\n");
713 /* Test sockmap with connected sockets */
714 fd = bpf_create_map(BPF_MAP_TYPE_SOCKMAP,
715 sizeof(key), sizeof(value),
718 if (!bpf_probe_map_type(BPF_MAP_TYPE_SOCKMAP, 0)) {
719 printf("%s SKIP (unsupported map type BPF_MAP_TYPE_SOCKMAP)\n",
722 for (i = 0; i < 6; i++)
727 printf("Failed to create sockmap %i\n", fd);
731 /* Test update with unsupported UDP socket */
732 udp = socket(AF_INET, SOCK_DGRAM, 0);
734 err = bpf_map_update_elem(fd, &i, &udp, BPF_ANY);
736 printf("Failed socket SOCK_DGRAM allowed '%i:%i'\n",
741 /* Test update without programs */
742 for (i = 0; i < 6; i++) {
743 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_ANY);
745 printf("Allowed update sockmap '%i:%i' not in ESTABLISHED\n",
748 } else if (i >= 2 && err) {
749 printf("Failed noprog update sockmap '%i:%i'\n",
755 /* Test attaching/detaching bad fds */
756 err = bpf_prog_attach(-1, fd, BPF_SK_SKB_STREAM_PARSER, 0);
758 printf("Failed invalid parser prog attach\n");
762 err = bpf_prog_attach(-1, fd, BPF_SK_SKB_STREAM_VERDICT, 0);
764 printf("Failed invalid verdict prog attach\n");
768 err = bpf_prog_attach(-1, fd, BPF_SK_MSG_VERDICT, 0);
770 printf("Failed invalid msg verdict prog attach\n");
774 err = bpf_prog_attach(-1, fd, __MAX_BPF_ATTACH_TYPE, 0);
776 printf("Failed unknown prog attach\n");
780 err = bpf_prog_detach(fd, BPF_SK_SKB_STREAM_PARSER);
782 printf("Failed empty parser prog detach\n");
786 err = bpf_prog_detach(fd, BPF_SK_SKB_STREAM_VERDICT);
788 printf("Failed empty verdict prog detach\n");
792 err = bpf_prog_detach(fd, BPF_SK_MSG_VERDICT);
794 printf("Failed empty msg verdict prog detach\n");
798 err = bpf_prog_detach(fd, __MAX_BPF_ATTACH_TYPE);
800 printf("Detach invalid prog successful\n");
804 /* Load SK_SKB program and Attach */
805 err = bpf_prog_load(SOCKMAP_PARSE_PROG,
806 BPF_PROG_TYPE_SK_SKB, &obj, &parse_prog);
808 printf("Failed to load SK_SKB parse prog\n");
812 err = bpf_prog_load(SOCKMAP_TCP_MSG_PROG,
813 BPF_PROG_TYPE_SK_MSG, &obj, &msg_prog);
815 printf("Failed to load SK_SKB msg prog\n");
819 err = bpf_prog_load(SOCKMAP_VERDICT_PROG,
820 BPF_PROG_TYPE_SK_SKB, &obj, &verdict_prog);
822 printf("Failed to load SK_SKB verdict prog\n");
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");
832 map_fd_rx = bpf_map__fd(bpf_map_rx);
834 printf("Failed to get map rx fd\n");
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");
844 map_fd_tx = bpf_map__fd(bpf_map_tx);
846 printf("Failed to get map tx fd\n");
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");
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");
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");
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");
874 err = bpf_prog_attach(parse_prog, map_fd_break,
875 BPF_SK_SKB_STREAM_PARSER, 0);
877 printf("Allowed attaching SK_SKB program to invalid map\n");
881 err = bpf_prog_attach(parse_prog, map_fd_rx,
882 BPF_SK_SKB_STREAM_PARSER, 0);
884 printf("Failed stream parser bpf prog attach\n");
888 err = bpf_prog_attach(verdict_prog, map_fd_rx,
889 BPF_SK_SKB_STREAM_VERDICT, 0);
891 printf("Failed stream verdict bpf prog attach\n");
895 err = bpf_prog_attach(msg_prog, map_fd_msg, BPF_SK_MSG_VERDICT, 0);
897 printf("Failed msg verdict bpf prog attach\n");
901 err = bpf_prog_attach(verdict_prog, map_fd_rx,
902 __MAX_BPF_ATTACH_TYPE, 0);
904 printf("Attached unknown bpf prog\n");
908 /* Test map update elem afterwards fd lives in fd and map_fd */
909 for (i = 2; i < 6; i++) {
910 err = bpf_map_update_elem(map_fd_rx, &i, &sfd[i], BPF_ANY);
912 printf("Failed map_fd_rx update sockmap %i '%i:%i'\n",
916 err = bpf_map_update_elem(map_fd_tx, &i, &sfd[i], BPF_ANY);
918 printf("Failed map_fd_tx update sockmap %i '%i:%i'\n",
924 /* Test map delete elem and remove send/recv sockets */
925 for (i = 2; i < 4; i++) {
926 err = bpf_map_delete_elem(map_fd_rx, &i);
928 printf("Failed delete sockmap rx %i '%i:%i'\n",
932 err = bpf_map_delete_elem(map_fd_tx, &i);
934 printf("Failed delete sockmap tx %i '%i:%i'\n",
940 /* Put sfd[2] (sending fd below) into msg map to test sendmsg bpf */
942 err = bpf_map_update_elem(map_fd_msg, &i, &sfd[2], BPF_ANY);
944 printf("Failed map_fd_msg update sockmap %i\n", err);
948 /* Test map send/recv */
949 for (i = 0; i < 2; i++) {
952 sc = send(sfd[2], buf, 20, 0);
954 printf("Failed sockmap send\n");
962 s = select(sfd[3] + 1, &w, NULL, NULL, &to);
964 perror("Failed sockmap select()");
967 printf("Failed sockmap unexpected timeout\n");
971 if (!FD_ISSET(sfd[3], &w)) {
972 printf("Failed sockmap select/recv\n");
976 rc = recv(sfd[3], buf, sizeof(buf), 0);
978 printf("Failed sockmap recv\n");
983 /* Negative null entry lookup from datapath should be dropped */
986 sc = send(sfd[2], buf, 20, 0);
988 printf("Failed sockmap send\n");
992 /* Push fd into same slot */
994 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_NOEXIST);
996 printf("Failed allowed sockmap dup slot BPF_NOEXIST\n");
1000 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_ANY);
1002 printf("Failed sockmap update new slot BPF_ANY\n");
1006 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_EXIST);
1008 printf("Failed sockmap update new slot BPF_EXIST\n");
1012 /* Delete the elems without programs */
1013 for (i = 2; i < 6; i++) {
1014 err = bpf_map_delete_elem(fd, &i);
1016 printf("Failed delete sockmap %i '%i:%i'\n",
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);
1025 printf("Failed fd bpf parse prog attach\n");
1028 err = bpf_prog_attach(verdict_prog, fd,
1029 BPF_SK_SKB_STREAM_VERDICT, 0);
1031 printf("Failed fd bpf verdict prog attach\n");
1035 for (i = 4; i < 6; i++) {
1036 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_ANY);
1038 printf("Failed allowed duplicate programs in update ANY sockmap %i '%i:%i'\n",
1042 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_NOEXIST);
1044 printf("Failed allowed duplicate program in update NOEXIST sockmap %i '%i:%i'\n",
1048 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_EXIST);
1050 printf("Failed allowed duplicate program in update EXIST sockmap %i '%i:%i'\n",
1056 /* Test tasks number of forked operations */
1057 for (i = 0; i < tasks; i++) {
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,
1065 bpf_map_update_elem(map_fd_rx, &i,
1069 } else if (pid[i] == -1) {
1070 printf("Couldn't spawn #%d process!\n", i);
1075 for (i = 0; i < tasks; i++) {
1078 assert(waitpid(pid[i], &status, 0) == pid[i]);
1079 assert(status == 0);
1082 err = bpf_prog_detach(map_fd_rx, __MAX_BPF_ATTACH_TYPE);
1084 printf("Detached an invalid prog type.\n");
1088 err = bpf_prog_detach(map_fd_rx, BPF_SK_SKB_STREAM_PARSER);
1090 printf("Failed parser prog detach\n");
1094 err = bpf_prog_detach(map_fd_rx, BPF_SK_SKB_STREAM_VERDICT);
1096 printf("Failed parser prog detach\n");
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);
1108 bpf_object__close(obj);
1111 for (i = 0; i < 6; i++)
1113 printf("Failed to create sockmap '%i:%s'!\n", i, strerror(errno));
1116 for (i = 0; i < 6; i++) {
1118 bpf_map_delete_elem(map_fd_tx, &i);
1120 bpf_map_delete_elem(map_fd_rx, &i);
1127 #define MAPINMAP_PROG "./test_map_in_map.o"
1128 static void test_map_in_map(void)
1130 struct bpf_program *prog;
1131 struct bpf_object *obj;
1132 struct bpf_map *map;
1133 int mim_fd, fd, err;
1136 obj = bpf_object__open(MAPINMAP_PROG);
1138 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(int), sizeof(int),
1141 printf("Failed to create hashmap '%s'!\n", strerror(errno));
1145 map = bpf_object__find_map_by_name(obj, "mim_array");
1147 printf("Failed to load array of maps from test prog\n");
1148 goto out_map_in_map;
1150 err = bpf_map__set_inner_map_fd(map, fd);
1152 printf("Failed to set inner_map_fd for array of maps\n");
1153 goto out_map_in_map;
1156 map = bpf_object__find_map_by_name(obj, "mim_hash");
1158 printf("Failed to load hash of maps from test prog\n");
1159 goto out_map_in_map;
1161 err = bpf_map__set_inner_map_fd(map, fd);
1163 printf("Failed to set inner_map_fd for hash of maps\n");
1164 goto out_map_in_map;
1167 bpf_object__for_each_program(prog, obj) {
1168 bpf_program__set_xdp(prog);
1170 bpf_object__load(obj);
1172 map = bpf_object__find_map_by_name(obj, "mim_array");
1174 printf("Failed to load array of maps from test prog\n");
1175 goto out_map_in_map;
1177 mim_fd = bpf_map__fd(map);
1179 printf("Failed to get descriptor for array of maps\n");
1180 goto out_map_in_map;
1183 err = bpf_map_update_elem(mim_fd, &pos, &fd, 0);
1185 printf("Failed to update array of maps\n");
1186 goto out_map_in_map;
1189 map = bpf_object__find_map_by_name(obj, "mim_hash");
1191 printf("Failed to load hash of maps from test prog\n");
1192 goto out_map_in_map;
1194 mim_fd = bpf_map__fd(map);
1196 printf("Failed to get descriptor for hash of maps\n");
1197 goto out_map_in_map;
1200 err = bpf_map_update_elem(mim_fd, &pos, &fd, 0);
1202 printf("Failed to update hash of maps\n");
1203 goto out_map_in_map;
1207 bpf_object__close(obj);
1215 #define MAP_SIZE (32 * 1024)
1217 static void test_map_large(void)
1226 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
1227 MAP_SIZE, map_flags);
1229 printf("Failed to create large map '%s'!\n", strerror(errno));
1233 for (i = 0; i < MAP_SIZE; i++) {
1234 key = (struct bigkey) { .c = i };
1237 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);
1241 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
1244 /* Iterate through all elements. */
1245 assert(bpf_map_get_next_key(fd, NULL, &key) == 0);
1247 for (i = 0; i < MAP_SIZE; i++)
1248 assert(bpf_map_get_next_key(fd, &key, &key) == 0);
1249 assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT);
1252 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);
1254 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);
1259 #define run_parallel(N, FN, DATA) \
1260 printf("Fork %u tasks to '" #FN "'\n", N); \
1261 __run_parallel(N, FN, DATA)
1263 static void __run_parallel(unsigned int tasks,
1264 void (*fn)(unsigned int task, void *data),
1270 for (i = 0; i < tasks; i++) {
1275 } else if (pid[i] == -1) {
1276 printf("Couldn't spawn #%d process!\n", i);
1281 for (i = 0; i < tasks; i++) {
1284 assert(waitpid(pid[i], &status, 0) == pid[i]);
1285 assert(status == 0);
1289 static void test_map_stress(void)
1291 run_parallel(100, test_hashmap, NULL);
1292 run_parallel(100, test_hashmap_percpu, NULL);
1293 run_parallel(100, test_hashmap_sizes, NULL);
1294 run_parallel(100, test_hashmap_walk, NULL);
1296 run_parallel(100, test_arraymap, NULL);
1297 run_parallel(100, test_arraymap_percpu, NULL);
1305 static void test_update_delete(unsigned int fn, void *data)
1307 int do_update = ((int *)data)[1];
1308 int fd = ((int *)data)[0];
1311 for (i = fn; i < MAP_SIZE; i += TASKS) {
1315 assert(bpf_map_update_elem(fd, &key, &value,
1317 assert(bpf_map_update_elem(fd, &key, &value,
1320 assert(bpf_map_delete_elem(fd, &key) == 0);
1325 static void test_map_parallel(void)
1327 int i, fd, key = 0, value = 0;
1330 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
1331 MAP_SIZE, map_flags);
1333 printf("Failed to create map for parallel test '%s'!\n",
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, ...
1344 data[1] = DO_UPDATE;
1345 run_parallel(TASKS, test_update_delete, data);
1347 /* Check that key=0 is already there. */
1348 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
1351 /* Check that all elements were inserted. */
1352 assert(bpf_map_get_next_key(fd, NULL, &key) == 0);
1354 for (i = 0; i < MAP_SIZE; i++)
1355 assert(bpf_map_get_next_key(fd, &key, &key) == 0);
1356 assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT);
1358 /* Another check for all elements */
1359 for (i = 0; i < MAP_SIZE; i++) {
1360 key = MAP_SIZE - i - 1;
1362 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 &&
1366 /* Now let's delete all elemenets in parallel. */
1367 data[1] = DO_DELETE;
1368 run_parallel(TASKS, test_update_delete, data);
1370 /* Nothing should be left. */
1372 assert(bpf_map_get_next_key(fd, NULL, &key) == -1 && errno == ENOENT);
1373 assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT);
1376 static void test_map_rdonly(void)
1378 int fd, key = 0, value = 0;
1380 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
1381 MAP_SIZE, map_flags | BPF_F_RDONLY);
1383 printf("Failed to create map for read only test '%s'!\n",
1390 /* Insert key=1 element. */
1391 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == -1 &&
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);
1399 static void test_map_wronly(void)
1401 int fd, key = 0, value = 0;
1403 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
1404 MAP_SIZE, map_flags | BPF_F_WRONLY);
1406 printf("Failed to create map for read only test '%s'!\n",
1413 /* Insert key=1 element. */
1414 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
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);
1421 static void prepare_reuseport_grp(int type, int map_fd, size_t map_elem_size,
1422 __s64 *fds64, __u64 *sk_cookies,
1425 socklen_t optlen, addrlen;
1426 struct sockaddr_in6 s6;
1427 const __u32 index0 = 0;
1428 const int optval = 1;
1436 s6.sin6_family = AF_INET6;
1437 s6.sin6_addr = in6addr_any;
1439 addrlen = sizeof(s6);
1440 optlen = sizeof(sk_cookie);
1442 for (i = 0; i < n; i++) {
1443 fd64 = socket(AF_INET6, type, 0);
1444 CHECK(fd64 == -1, "socket()",
1445 "sock_type:%d fd64:%lld errno:%d\n",
1448 err = setsockopt(fd64, SOL_SOCKET, SO_REUSEPORT,
1449 &optval, sizeof(optval));
1450 CHECK(err == -1, "setsockopt(SO_REUSEPORT)",
1451 "err:%d errno:%d\n", err, errno);
1453 /* reuseport_array does not allow unbound sk */
1454 if (map_elem_size == sizeof(__u64))
1457 assert(map_elem_size == sizeof(__u32));
1461 err = bpf_map_update_elem(map_fd, &index0, value, BPF_ANY);
1462 CHECK(err != -1 || errno != EINVAL,
1463 "reuseport array update unbound sk",
1464 "sock_type:%d err:%d errno:%d\n",
1467 err = bind(fd64, (struct sockaddr *)&s6, sizeof(s6));
1468 CHECK(err == -1, "bind()",
1469 "sock_type:%d err:%d errno:%d\n", type, err, errno);
1472 err = getsockname(fd64, (struct sockaddr *)&s6,
1474 CHECK(err == -1, "getsockname()",
1475 "sock_type:%d err:%d errno:%d\n",
1479 err = getsockopt(fd64, SOL_SOCKET, SO_COOKIE, &sk_cookie,
1481 CHECK(err == -1, "getsockopt(SO_COOKIE)",
1482 "sock_type:%d err:%d errno:%d\n", type, err, errno);
1484 if (type == SOCK_STREAM) {
1486 * reuseport_array does not allow
1487 * non-listening tcp sk.
1489 err = bpf_map_update_elem(map_fd, &index0, value,
1491 CHECK(err != -1 || errno != EINVAL,
1492 "reuseport array update non-listening sk",
1493 "sock_type:%d err:%d errno:%d\n",
1495 err = listen(fd64, 0);
1496 CHECK(err == -1, "listen()",
1497 "sock_type:%d, err:%d errno:%d\n",
1502 sk_cookies[i] = sk_cookie;
1506 static void test_reuseport_array(void)
1508 #define REUSEPORT_FD_IDX(err, last) ({ (err) ? last : !last; })
1510 const __u32 array_size = 4, index0 = 0, index3 = 3;
1511 int types[2] = { SOCK_STREAM, SOCK_DGRAM }, type;
1512 __u64 grpa_cookies[2], sk_cookie, map_cookie;
1513 __s64 grpa_fds64[2] = { -1, -1 }, fd64 = -1;
1514 const __u32 bad_index = array_size;
1515 int map_fd, err, t, f;
1519 map_fd = bpf_create_map(BPF_MAP_TYPE_REUSEPORT_SOCKARRAY,
1520 sizeof(__u32), sizeof(__u64), array_size, 0);
1521 CHECK(map_fd == -1, "reuseport array create",
1522 "map_fd:%d, errno:%d\n", map_fd, errno);
1524 /* Test lookup/update/delete with invalid index */
1525 err = bpf_map_delete_elem(map_fd, &bad_index);
1526 CHECK(err != -1 || errno != E2BIG, "reuseport array del >=max_entries",
1527 "err:%d errno:%d\n", err, errno);
1529 err = bpf_map_update_elem(map_fd, &bad_index, &fd64, BPF_ANY);
1530 CHECK(err != -1 || errno != E2BIG,
1531 "reuseport array update >=max_entries",
1532 "err:%d errno:%d\n", err, errno);
1534 err = bpf_map_lookup_elem(map_fd, &bad_index, &map_cookie);
1535 CHECK(err != -1 || errno != ENOENT,
1536 "reuseport array update >=max_entries",
1537 "err:%d errno:%d\n", err, errno);
1539 /* Test lookup/delete non existence elem */
1540 err = bpf_map_lookup_elem(map_fd, &index3, &map_cookie);
1541 CHECK(err != -1 || errno != ENOENT,
1542 "reuseport array lookup not-exist elem",
1543 "err:%d errno:%d\n", err, errno);
1544 err = bpf_map_delete_elem(map_fd, &index3);
1545 CHECK(err != -1 || errno != ENOENT,
1546 "reuseport array del not-exist elem",
1547 "err:%d errno:%d\n", err, errno);
1549 for (t = 0; t < ARRAY_SIZE(types); t++) {
1552 prepare_reuseport_grp(type, map_fd, sizeof(__u64), grpa_fds64,
1553 grpa_cookies, ARRAY_SIZE(grpa_fds64));
1555 /* Test BPF_* update flags */
1556 /* BPF_EXIST failure case */
1557 err = bpf_map_update_elem(map_fd, &index3, &grpa_fds64[fds_idx],
1559 CHECK(err != -1 || errno != ENOENT,
1560 "reuseport array update empty elem BPF_EXIST",
1561 "sock_type:%d err:%d errno:%d\n",
1563 fds_idx = REUSEPORT_FD_IDX(err, fds_idx);
1565 /* BPF_NOEXIST success case */
1566 err = bpf_map_update_elem(map_fd, &index3, &grpa_fds64[fds_idx],
1569 "reuseport array update empty elem BPF_NOEXIST",
1570 "sock_type:%d err:%d errno:%d\n",
1572 fds_idx = REUSEPORT_FD_IDX(err, fds_idx);
1574 /* BPF_EXIST success case. */
1575 err = bpf_map_update_elem(map_fd, &index3, &grpa_fds64[fds_idx],
1578 "reuseport array update same elem BPF_EXIST",
1579 "sock_type:%d err:%d errno:%d\n", type, err, errno);
1580 fds_idx = REUSEPORT_FD_IDX(err, fds_idx);
1582 /* BPF_NOEXIST failure case */
1583 err = bpf_map_update_elem(map_fd, &index3, &grpa_fds64[fds_idx],
1585 CHECK(err != -1 || errno != EEXIST,
1586 "reuseport array update non-empty elem BPF_NOEXIST",
1587 "sock_type:%d err:%d errno:%d\n",
1589 fds_idx = REUSEPORT_FD_IDX(err, fds_idx);
1591 /* BPF_ANY case (always succeed) */
1592 err = bpf_map_update_elem(map_fd, &index3, &grpa_fds64[fds_idx],
1595 "reuseport array update same sk with BPF_ANY",
1596 "sock_type:%d err:%d errno:%d\n", type, err, errno);
1598 fd64 = grpa_fds64[fds_idx];
1599 sk_cookie = grpa_cookies[fds_idx];
1601 /* The same sk cannot be added to reuseport_array twice */
1602 err = bpf_map_update_elem(map_fd, &index3, &fd64, BPF_ANY);
1603 CHECK(err != -1 || errno != EBUSY,
1604 "reuseport array update same sk with same index",
1605 "sock_type:%d err:%d errno:%d\n",
1608 err = bpf_map_update_elem(map_fd, &index0, &fd64, BPF_ANY);
1609 CHECK(err != -1 || errno != EBUSY,
1610 "reuseport array update same sk with different index",
1611 "sock_type:%d err:%d errno:%d\n",
1614 /* Test delete elem */
1615 err = bpf_map_delete_elem(map_fd, &index3);
1616 CHECK(err == -1, "reuseport array delete sk",
1617 "sock_type:%d err:%d errno:%d\n",
1620 /* Add it back with BPF_NOEXIST */
1621 err = bpf_map_update_elem(map_fd, &index3, &fd64, BPF_NOEXIST);
1623 "reuseport array re-add with BPF_NOEXIST after del",
1624 "sock_type:%d err:%d errno:%d\n", type, err, errno);
1627 err = bpf_map_lookup_elem(map_fd, &index3, &map_cookie);
1628 CHECK(err == -1 || sk_cookie != map_cookie,
1629 "reuseport array lookup re-added sk",
1630 "sock_type:%d err:%d errno:%d sk_cookie:0x%llx map_cookie:0x%llxn",
1631 type, err, errno, sk_cookie, map_cookie);
1633 /* Test elem removed by close() */
1634 for (f = 0; f < ARRAY_SIZE(grpa_fds64); f++)
1635 close(grpa_fds64[f]);
1636 err = bpf_map_lookup_elem(map_fd, &index3, &map_cookie);
1637 CHECK(err != -1 || errno != ENOENT,
1638 "reuseport array lookup after close()",
1639 "sock_type:%d err:%d errno:%d\n",
1644 fd64 = socket(AF_INET6, SOCK_RAW, IPPROTO_UDP);
1645 CHECK(fd64 == -1, "socket(SOCK_RAW)", "err:%d errno:%d\n",
1647 err = bpf_map_update_elem(map_fd, &index3, &fd64, BPF_NOEXIST);
1648 CHECK(err != -1 || errno != ENOTSUPP, "reuseport array update SOCK_RAW",
1649 "err:%d errno:%d\n", err, errno);
1652 /* Close the 64 bit value map */
1655 /* Test 32 bit fd */
1656 map_fd = bpf_create_map(BPF_MAP_TYPE_REUSEPORT_SOCKARRAY,
1657 sizeof(__u32), sizeof(__u32), array_size, 0);
1658 CHECK(map_fd == -1, "reuseport array create",
1659 "map_fd:%d, errno:%d\n", map_fd, errno);
1660 prepare_reuseport_grp(SOCK_STREAM, map_fd, sizeof(__u32), &fd64,
1663 err = bpf_map_update_elem(map_fd, &index3, &fd, BPF_NOEXIST);
1664 CHECK(err == -1, "reuseport array update 32 bit fd",
1665 "err:%d errno:%d\n", err, errno);
1666 err = bpf_map_lookup_elem(map_fd, &index3, &map_cookie);
1667 CHECK(err != -1 || errno != ENOSPC,
1668 "reuseport array lookup 32 bit fd",
1669 "err:%d errno:%d\n", err, errno);
1674 static void run_all_tests(void)
1676 test_hashmap(0, NULL);
1677 test_hashmap_percpu(0, NULL);
1678 test_hashmap_walk(0, NULL);
1679 test_hashmap_zero_seed();
1681 test_arraymap(0, NULL);
1682 test_arraymap_percpu(0, NULL);
1684 test_arraymap_percpu_many_keys();
1686 test_devmap(0, NULL);
1687 test_sockmap(0, NULL);
1690 test_map_parallel();
1696 test_reuseport_array();
1698 test_queuemap(0, NULL);
1699 test_stackmap(0, NULL);
1705 #include <map_tests/tests.h>
1715 map_flags = BPF_F_NO_PREALLOC;
1719 #include <map_tests/tests.h>
1722 printf("test_maps: OK, %d SKIPPED\n", skips);