2 * Testsuite for eBPF maps
4 * Copyright (c) 2014 PLUMgrid, http://plumgrid.com
5 * Copyright (c) 2016 Facebook
7 * This program is free software; you can redistribute it and/or
8 * modify it under the terms of version 2 of the GNU General Public
9 * License as published by the Free Software Foundation.
21 #include <sys/socket.h>
22 #include <netinet/in.h>
23 #include <linux/bpf.h>
26 #include <bpf/libbpf.h>
29 #include "bpf_rlimit.h"
37 #define CHECK(condition, tag, format...) ({ \
38 int __ret = !!(condition); \
40 printf("%s(%d):FAIL:%s ", __func__, __LINE__, tag); \
46 static void test_hashmap(int task, void *data)
48 long long key, next_key, first_key, value;
51 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
54 printf("Failed to create hashmap '%s'!\n", strerror(errno));
60 /* Insert key=1 element. */
61 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
64 /* BPF_NOEXIST means add new element if it doesn't exist. */
65 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
66 /* key=1 already exists. */
69 /* -1 is an invalid flag. */
70 assert(bpf_map_update_elem(fd, &key, &value, -1) == -1 &&
73 /* Check that key=1 can be found. */
74 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);
77 /* Check that key=2 is not found. */
78 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);
80 /* BPF_EXIST means update existing element. */
81 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == -1 &&
82 /* key=2 is not there. */
85 /* Insert key=2 element. */
86 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);
88 /* key=1 and key=2 were inserted, check that key=0 cannot be
89 * inserted due to max_entries limit.
92 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
95 /* Update existing element, though the map is full. */
97 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0);
99 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
101 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
104 /* Check that key = 0 doesn't exist. */
106 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
108 /* Iterate over two elements. */
109 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 &&
110 (first_key == 1 || first_key == 2));
111 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
112 (next_key == first_key));
113 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
114 (next_key == 1 || next_key == 2) &&
115 (next_key != first_key));
116 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 &&
119 /* Delete both elements. */
121 assert(bpf_map_delete_elem(fd, &key) == 0);
123 assert(bpf_map_delete_elem(fd, &key) == 0);
124 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
127 /* Check that map is empty. */
128 assert(bpf_map_get_next_key(fd, NULL, &next_key) == -1 &&
130 assert(bpf_map_get_next_key(fd, &key, &next_key) == -1 &&
136 static void test_hashmap_sizes(int task, void *data)
140 for (i = 1; i <= 512; i <<= 1)
141 for (j = 1; j <= 1 << 18; j <<= 1) {
142 fd = bpf_create_map(BPF_MAP_TYPE_HASH, i, j,
147 printf("Failed to create hashmap key=%d value=%d '%s'\n",
148 i, j, strerror(errno));
152 usleep(10); /* give kernel time to destroy */
156 static void test_hashmap_percpu(int task, void *data)
158 unsigned int nr_cpus = bpf_num_possible_cpus();
159 BPF_DECLARE_PERCPU(long, value);
160 long long key, next_key, first_key;
161 int expected_key_mask = 0;
164 fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_HASH, sizeof(key),
165 sizeof(bpf_percpu(value, 0)), 2, map_flags);
167 printf("Failed to create hashmap '%s'!\n", strerror(errno));
171 for (i = 0; i < nr_cpus; i++)
172 bpf_percpu(value, i) = i + 100;
175 /* Insert key=1 element. */
176 assert(!(expected_key_mask & key));
177 assert(bpf_map_update_elem(fd, &key, value, BPF_ANY) == 0);
178 expected_key_mask |= key;
180 /* BPF_NOEXIST means add new element if it doesn't exist. */
181 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 &&
182 /* key=1 already exists. */
185 /* -1 is an invalid flag. */
186 assert(bpf_map_update_elem(fd, &key, value, -1) == -1 &&
189 /* Check that key=1 can be found. Value could be 0 if the lookup
190 * was run from a different CPU.
192 bpf_percpu(value, 0) = 1;
193 assert(bpf_map_lookup_elem(fd, &key, value) == 0 &&
194 bpf_percpu(value, 0) == 100);
197 /* Check that key=2 is not found. */
198 assert(bpf_map_lookup_elem(fd, &key, value) == -1 && errno == ENOENT);
200 /* BPF_EXIST means update existing element. */
201 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == -1 &&
202 /* key=2 is not there. */
205 /* Insert key=2 element. */
206 assert(!(expected_key_mask & key));
207 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0);
208 expected_key_mask |= key;
210 /* key=1 and key=2 were inserted, check that key=0 cannot be
211 * inserted due to max_entries limit.
214 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 &&
217 /* Check that key = 0 doesn't exist. */
218 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
220 /* Iterate over two elements. */
221 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 &&
222 ((expected_key_mask & first_key) == first_key));
223 while (!bpf_map_get_next_key(fd, &key, &next_key)) {
225 assert(next_key == first_key);
228 assert((expected_key_mask & next_key) == next_key);
229 expected_key_mask &= ~next_key;
231 assert(bpf_map_lookup_elem(fd, &next_key, value) == 0);
233 for (i = 0; i < nr_cpus; i++)
234 assert(bpf_percpu(value, i) == i + 100);
238 assert(errno == ENOENT);
240 /* Update with BPF_EXIST. */
242 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0);
244 /* Delete both elements. */
246 assert(bpf_map_delete_elem(fd, &key) == 0);
248 assert(bpf_map_delete_elem(fd, &key) == 0);
249 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
252 /* Check that map is empty. */
253 assert(bpf_map_get_next_key(fd, NULL, &next_key) == -1 &&
255 assert(bpf_map_get_next_key(fd, &key, &next_key) == -1 &&
261 static int helper_fill_hashmap(int max_entries)
264 long long key, value;
266 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
267 max_entries, map_flags);
269 "failed to create hashmap",
270 "err: %s, flags: 0x%x\n", strerror(errno), map_flags);
272 for (i = 0; i < max_entries; i++) {
273 key = i; value = key;
274 ret = bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST);
276 "can't update hashmap",
277 "err: %s\n", strerror(ret));
283 static void test_hashmap_walk(int task, void *data)
285 int fd, i, max_entries = 1000;
286 long long key, value, next_key;
287 bool next_key_valid = true;
289 fd = helper_fill_hashmap(max_entries);
291 for (i = 0; bpf_map_get_next_key(fd, !i ? NULL : &key,
292 &next_key) == 0; i++) {
294 assert(bpf_map_lookup_elem(fd, &key, &value) == 0);
297 assert(i == max_entries);
299 assert(bpf_map_get_next_key(fd, NULL, &key) == 0);
300 for (i = 0; next_key_valid; i++) {
301 next_key_valid = bpf_map_get_next_key(fd, &key, &next_key) == 0;
302 assert(bpf_map_lookup_elem(fd, &key, &value) == 0);
304 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0);
308 assert(i == max_entries);
310 for (i = 0; bpf_map_get_next_key(fd, !i ? NULL : &key,
311 &next_key) == 0; i++) {
313 assert(bpf_map_lookup_elem(fd, &key, &value) == 0);
314 assert(value - 1 == key);
317 assert(i == max_entries);
321 static void test_hashmap_zero_seed(void)
323 int i, first, second, old_flags;
324 long long key, next_first, next_second;
326 old_flags = map_flags;
327 map_flags |= BPF_F_ZERO_SEED;
329 first = helper_fill_hashmap(3);
330 second = helper_fill_hashmap(3);
333 void *key_ptr = !i ? NULL : &key;
335 if (bpf_map_get_next_key(first, key_ptr, &next_first) != 0)
338 CHECK(bpf_map_get_next_key(second, key_ptr, &next_second) != 0,
339 "next_key for second map must succeed",
340 "key_ptr: %p", key_ptr);
341 CHECK(next_first != next_second,
343 "i: %d first: %lld second: %lld\n", i,
344 next_first, next_second);
349 map_flags = old_flags;
354 static void test_arraymap(int task, void *data)
356 int key, next_key, fd;
359 fd = bpf_create_map(BPF_MAP_TYPE_ARRAY, sizeof(key), sizeof(value),
362 printf("Failed to create arraymap '%s'!\n", strerror(errno));
368 /* Insert key=1 element. */
369 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
372 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
375 /* Check that key=1 can be found. */
376 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);
379 /* Check that key=0 is also found and zero initialized. */
380 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);
382 /* key=0 and key=1 were inserted, check that key=2 cannot be inserted
383 * due to max_entries limit.
386 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == -1 &&
389 /* Check that key = 2 doesn't exist. */
390 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);
392 /* Iterate over two elements. */
393 assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&
395 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
397 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
399 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 &&
402 /* Delete shouldn't succeed. */
404 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == EINVAL);
409 static void test_arraymap_percpu(int task, void *data)
411 unsigned int nr_cpus = bpf_num_possible_cpus();
412 BPF_DECLARE_PERCPU(long, values);
413 int key, next_key, fd, i;
415 fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_ARRAY, sizeof(key),
416 sizeof(bpf_percpu(values, 0)), 2, 0);
418 printf("Failed to create arraymap '%s'!\n", strerror(errno));
422 for (i = 0; i < nr_cpus; i++)
423 bpf_percpu(values, i) = i + 100;
426 /* Insert key=1 element. */
427 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);
429 bpf_percpu(values, 0) = 0;
430 assert(bpf_map_update_elem(fd, &key, values, BPF_NOEXIST) == -1 &&
433 /* Check that key=1 can be found. */
434 assert(bpf_map_lookup_elem(fd, &key, values) == 0 &&
435 bpf_percpu(values, 0) == 100);
438 /* Check that key=0 is also found and zero initialized. */
439 assert(bpf_map_lookup_elem(fd, &key, values) == 0 &&
440 bpf_percpu(values, 0) == 0 &&
441 bpf_percpu(values, nr_cpus - 1) == 0);
443 /* Check that key=2 cannot be inserted due to max_entries limit. */
445 assert(bpf_map_update_elem(fd, &key, values, BPF_EXIST) == -1 &&
448 /* Check that key = 2 doesn't exist. */
449 assert(bpf_map_lookup_elem(fd, &key, values) == -1 && errno == ENOENT);
451 /* Iterate over two elements. */
452 assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&
454 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
456 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
458 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 &&
461 /* Delete shouldn't succeed. */
463 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == EINVAL);
468 static void test_arraymap_percpu_many_keys(void)
470 unsigned int nr_cpus = bpf_num_possible_cpus();
471 BPF_DECLARE_PERCPU(long, values);
472 /* nr_keys is not too large otherwise the test stresses percpu
473 * allocator more than anything else
475 unsigned int nr_keys = 2000;
478 fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_ARRAY, sizeof(key),
479 sizeof(bpf_percpu(values, 0)), nr_keys, 0);
481 printf("Failed to create per-cpu arraymap '%s'!\n",
486 for (i = 0; i < nr_cpus; i++)
487 bpf_percpu(values, i) = i + 10;
489 for (key = 0; key < nr_keys; key++)
490 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);
492 for (key = 0; key < nr_keys; key++) {
493 for (i = 0; i < nr_cpus; i++)
494 bpf_percpu(values, i) = 0;
496 assert(bpf_map_lookup_elem(fd, &key, values) == 0);
498 for (i = 0; i < nr_cpus; i++)
499 assert(bpf_percpu(values, i) == i + 10);
505 static void test_devmap(int task, void *data)
510 fd = bpf_create_map(BPF_MAP_TYPE_DEVMAP, sizeof(key), sizeof(value),
513 printf("Failed to create devmap '%s'!\n", strerror(errno));
520 static void test_queuemap(int task, void *data)
522 const int MAP_SIZE = 32;
523 __u32 vals[MAP_SIZE + MAP_SIZE/2], val;
526 /* Fill test values to be used */
527 for (i = 0; i < MAP_SIZE + MAP_SIZE/2; i++)
530 /* Invalid key size */
531 fd = bpf_create_map(BPF_MAP_TYPE_QUEUE, 4, sizeof(val), MAP_SIZE,
533 assert(fd < 0 && errno == EINVAL);
535 fd = bpf_create_map(BPF_MAP_TYPE_QUEUE, 0, sizeof(val), MAP_SIZE,
537 /* Queue map does not support BPF_F_NO_PREALLOC */
538 if (map_flags & BPF_F_NO_PREALLOC) {
539 assert(fd < 0 && errno == EINVAL);
543 printf("Failed to create queuemap '%s'!\n", strerror(errno));
547 /* Push MAP_SIZE elements */
548 for (i = 0; i < MAP_SIZE; i++)
549 assert(bpf_map_update_elem(fd, NULL, &vals[i], 0) == 0);
551 /* Check that element cannot be pushed due to max_entries limit */
552 assert(bpf_map_update_elem(fd, NULL, &val, 0) == -1 &&
556 assert(bpf_map_lookup_elem(fd, NULL, &val) == 0 && val == vals[0]);
558 /* Replace half elements */
559 for (i = MAP_SIZE; i < MAP_SIZE + MAP_SIZE/2; i++)
560 assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0);
562 /* Pop all elements */
563 for (i = MAP_SIZE/2; i < MAP_SIZE + MAP_SIZE/2; i++)
564 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == 0 &&
567 /* Check that there are not elements left */
568 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == -1 &&
571 /* Check that non supported functions set errno to EINVAL */
572 assert(bpf_map_delete_elem(fd, NULL) == -1 && errno == EINVAL);
573 assert(bpf_map_get_next_key(fd, NULL, NULL) == -1 && errno == EINVAL);
578 static void test_stackmap(int task, void *data)
580 const int MAP_SIZE = 32;
581 __u32 vals[MAP_SIZE + MAP_SIZE/2], val;
584 /* Fill test values to be used */
585 for (i = 0; i < MAP_SIZE + MAP_SIZE/2; i++)
588 /* Invalid key size */
589 fd = bpf_create_map(BPF_MAP_TYPE_STACK, 4, sizeof(val), MAP_SIZE,
591 assert(fd < 0 && errno == EINVAL);
593 fd = bpf_create_map(BPF_MAP_TYPE_STACK, 0, sizeof(val), MAP_SIZE,
595 /* Stack map does not support BPF_F_NO_PREALLOC */
596 if (map_flags & BPF_F_NO_PREALLOC) {
597 assert(fd < 0 && errno == EINVAL);
601 printf("Failed to create stackmap '%s'!\n", strerror(errno));
605 /* Push MAP_SIZE elements */
606 for (i = 0; i < MAP_SIZE; i++)
607 assert(bpf_map_update_elem(fd, NULL, &vals[i], 0) == 0);
609 /* Check that element cannot be pushed due to max_entries limit */
610 assert(bpf_map_update_elem(fd, NULL, &val, 0) == -1 &&
614 assert(bpf_map_lookup_elem(fd, NULL, &val) == 0 && val == vals[i - 1]);
616 /* Replace half elements */
617 for (i = MAP_SIZE; i < MAP_SIZE + MAP_SIZE/2; i++)
618 assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0);
620 /* Pop all elements */
621 for (i = MAP_SIZE + MAP_SIZE/2 - 1; i >= MAP_SIZE/2; i--)
622 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == 0 &&
625 /* Check that there are not elements left */
626 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == -1 &&
629 /* Check that non supported functions set errno to EINVAL */
630 assert(bpf_map_delete_elem(fd, NULL) == -1 && errno == EINVAL);
631 assert(bpf_map_get_next_key(fd, NULL, NULL) == -1 && errno == EINVAL);
636 #include <sys/ioctl.h>
637 #include <arpa/inet.h>
638 #include <sys/select.h>
639 #include <linux/err.h>
640 #define SOCKMAP_PARSE_PROG "./sockmap_parse_prog.o"
641 #define SOCKMAP_VERDICT_PROG "./sockmap_verdict_prog.o"
642 #define SOCKMAP_TCP_MSG_PROG "./sockmap_tcp_msg_prog.o"
643 static void test_sockmap(int tasks, void *data)
645 struct bpf_map *bpf_map_rx, *bpf_map_tx, *bpf_map_msg, *bpf_map_break;
646 int map_fd_msg = 0, map_fd_rx = 0, map_fd_tx = 0, map_fd_break;
647 int ports[] = {50200, 50201, 50202, 50204};
648 int err, i, fd, udp, sfd[6] = {0xdeadbeef};
649 u8 buf[20] = {0x0, 0x5, 0x3, 0x2, 0x1, 0x0};
650 int parse_prog, verdict_prog, msg_prog;
651 struct sockaddr_in addr;
652 int one = 1, s, sc, rc;
653 struct bpf_object *obj;
659 /* Create some sockets to use with sockmap */
660 for (i = 0; i < 2; i++) {
661 sfd[i] = socket(AF_INET, SOCK_STREAM, 0);
664 err = setsockopt(sfd[i], SOL_SOCKET, SO_REUSEADDR,
665 (char *)&one, sizeof(one));
667 printf("failed to setsockopt\n");
670 err = ioctl(sfd[i], FIONBIO, (char *)&one);
672 printf("failed to ioctl\n");
675 memset(&addr, 0, sizeof(struct sockaddr_in));
676 addr.sin_family = AF_INET;
677 addr.sin_addr.s_addr = inet_addr("127.0.0.1");
678 addr.sin_port = htons(ports[i]);
679 err = bind(sfd[i], (struct sockaddr *)&addr, sizeof(addr));
681 printf("failed to bind: err %i: %i:%i\n",
685 err = listen(sfd[i], 32);
687 printf("failed to listen\n");
692 for (i = 2; i < 4; i++) {
693 sfd[i] = socket(AF_INET, SOCK_STREAM, 0);
696 err = setsockopt(sfd[i], SOL_SOCKET, SO_REUSEADDR,
697 (char *)&one, sizeof(one));
699 printf("set sock opt\n");
702 memset(&addr, 0, sizeof(struct sockaddr_in));
703 addr.sin_family = AF_INET;
704 addr.sin_addr.s_addr = inet_addr("127.0.0.1");
705 addr.sin_port = htons(ports[i - 2]);
706 err = connect(sfd[i], (struct sockaddr *)&addr, sizeof(addr));
708 printf("failed to connect\n");
714 for (i = 4; i < 6; i++) {
715 sfd[i] = accept(sfd[i - 4], NULL, NULL);
717 printf("accept failed\n");
722 /* Test sockmap with connected sockets */
723 fd = bpf_create_map(BPF_MAP_TYPE_SOCKMAP,
724 sizeof(key), sizeof(value),
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 %d tasks to '" #FN "'\n", N); \
1261 __run_parallel(N, FN, DATA)
1263 static void __run_parallel(int tasks, void (*fn)(int task, void *data),
1269 for (i = 0; i < tasks; i++) {
1274 } else if (pid[i] == -1) {
1275 printf("Couldn't spawn #%d process!\n", i);
1280 for (i = 0; i < tasks; i++) {
1283 assert(waitpid(pid[i], &status, 0) == pid[i]);
1284 assert(status == 0);
1288 static void test_map_stress(void)
1290 run_parallel(100, test_hashmap, NULL);
1291 run_parallel(100, test_hashmap_percpu, NULL);
1292 run_parallel(100, test_hashmap_sizes, NULL);
1293 run_parallel(100, test_hashmap_walk, NULL);
1295 run_parallel(100, test_arraymap, NULL);
1296 run_parallel(100, test_arraymap_percpu, NULL);
1304 static void test_update_delete(int fn, void *data)
1306 int do_update = ((int *)data)[1];
1307 int fd = ((int *)data)[0];
1310 for (i = fn; i < MAP_SIZE; i += TASKS) {
1314 assert(bpf_map_update_elem(fd, &key, &value,
1316 assert(bpf_map_update_elem(fd, &key, &value,
1319 assert(bpf_map_delete_elem(fd, &key) == 0);
1324 static void test_map_parallel(void)
1326 int i, fd, key = 0, value = 0;
1329 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
1330 MAP_SIZE, map_flags);
1332 printf("Failed to create map for parallel test '%s'!\n",
1337 /* Use the same fd in children to add elements to this map:
1338 * child_0 adds key=0, key=1024, key=2048, ...
1339 * child_1 adds key=1, key=1025, key=2049, ...
1340 * child_1023 adds key=1023, ...
1343 data[1] = DO_UPDATE;
1344 run_parallel(TASKS, test_update_delete, data);
1346 /* Check that key=0 is already there. */
1347 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
1350 /* Check that all elements were inserted. */
1351 assert(bpf_map_get_next_key(fd, NULL, &key) == 0);
1353 for (i = 0; i < MAP_SIZE; i++)
1354 assert(bpf_map_get_next_key(fd, &key, &key) == 0);
1355 assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT);
1357 /* Another check for all elements */
1358 for (i = 0; i < MAP_SIZE; i++) {
1359 key = MAP_SIZE - i - 1;
1361 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 &&
1365 /* Now let's delete all elemenets in parallel. */
1366 data[1] = DO_DELETE;
1367 run_parallel(TASKS, test_update_delete, data);
1369 /* Nothing should be left. */
1371 assert(bpf_map_get_next_key(fd, NULL, &key) == -1 && errno == ENOENT);
1372 assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT);
1375 static void test_map_rdonly(void)
1377 int fd, key = 0, value = 0;
1379 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
1380 MAP_SIZE, map_flags | BPF_F_RDONLY);
1382 printf("Failed to create map for read only test '%s'!\n",
1389 /* Insert key=1 element. */
1390 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == -1 &&
1393 /* Check that key=2 is not found. */
1394 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);
1395 assert(bpf_map_get_next_key(fd, &key, &value) == -1 && errno == ENOENT);
1398 static void test_map_wronly(void)
1400 int fd, key = 0, value = 0;
1402 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
1403 MAP_SIZE, map_flags | BPF_F_WRONLY);
1405 printf("Failed to create map for read only test '%s'!\n",
1412 /* Insert key=1 element. */
1413 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
1415 /* Check that key=2 is not found. */
1416 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == EPERM);
1417 assert(bpf_map_get_next_key(fd, &key, &value) == -1 && errno == EPERM);
1420 static void prepare_reuseport_grp(int type, int map_fd,
1421 __s64 *fds64, __u64 *sk_cookies,
1424 socklen_t optlen, addrlen;
1425 struct sockaddr_in6 s6;
1426 const __u32 index0 = 0;
1427 const int optval = 1;
1433 s6.sin6_family = AF_INET6;
1434 s6.sin6_addr = in6addr_any;
1436 addrlen = sizeof(s6);
1437 optlen = sizeof(sk_cookie);
1439 for (i = 0; i < n; i++) {
1440 fd64 = socket(AF_INET6, type, 0);
1441 CHECK(fd64 == -1, "socket()",
1442 "sock_type:%d fd64:%lld errno:%d\n",
1445 err = setsockopt(fd64, SOL_SOCKET, SO_REUSEPORT,
1446 &optval, sizeof(optval));
1447 CHECK(err == -1, "setsockopt(SO_REUSEPORT)",
1448 "err:%d errno:%d\n", err, errno);
1450 /* reuseport_array does not allow unbound sk */
1451 err = bpf_map_update_elem(map_fd, &index0, &fd64,
1453 CHECK(err != -1 || errno != EINVAL,
1454 "reuseport array update unbound sk",
1455 "sock_type:%d err:%d errno:%d\n",
1458 err = bind(fd64, (struct sockaddr *)&s6, sizeof(s6));
1459 CHECK(err == -1, "bind()",
1460 "sock_type:%d err:%d errno:%d\n", type, err, errno);
1463 err = getsockname(fd64, (struct sockaddr *)&s6,
1465 CHECK(err == -1, "getsockname()",
1466 "sock_type:%d err:%d errno:%d\n",
1470 err = getsockopt(fd64, SOL_SOCKET, SO_COOKIE, &sk_cookie,
1472 CHECK(err == -1, "getsockopt(SO_COOKIE)",
1473 "sock_type:%d err:%d errno:%d\n", type, err, errno);
1475 if (type == SOCK_STREAM) {
1477 * reuseport_array does not allow
1478 * non-listening tcp sk.
1480 err = bpf_map_update_elem(map_fd, &index0, &fd64,
1482 CHECK(err != -1 || errno != EINVAL,
1483 "reuseport array update non-listening sk",
1484 "sock_type:%d err:%d errno:%d\n",
1486 err = listen(fd64, 0);
1487 CHECK(err == -1, "listen()",
1488 "sock_type:%d, err:%d errno:%d\n",
1493 sk_cookies[i] = sk_cookie;
1497 static void test_reuseport_array(void)
1499 #define REUSEPORT_FD_IDX(err, last) ({ (err) ? last : !last; })
1501 const __u32 array_size = 4, index0 = 0, index3 = 3;
1502 int types[2] = { SOCK_STREAM, SOCK_DGRAM }, type;
1503 __u64 grpa_cookies[2], sk_cookie, map_cookie;
1504 __s64 grpa_fds64[2] = { -1, -1 }, fd64 = -1;
1505 const __u32 bad_index = array_size;
1506 int map_fd, err, t, f;
1510 map_fd = bpf_create_map(BPF_MAP_TYPE_REUSEPORT_SOCKARRAY,
1511 sizeof(__u32), sizeof(__u64), array_size, 0);
1512 CHECK(map_fd == -1, "reuseport array create",
1513 "map_fd:%d, errno:%d\n", map_fd, errno);
1515 /* Test lookup/update/delete with invalid index */
1516 err = bpf_map_delete_elem(map_fd, &bad_index);
1517 CHECK(err != -1 || errno != E2BIG, "reuseport array del >=max_entries",
1518 "err:%d errno:%d\n", err, errno);
1520 err = bpf_map_update_elem(map_fd, &bad_index, &fd64, BPF_ANY);
1521 CHECK(err != -1 || errno != E2BIG,
1522 "reuseport array update >=max_entries",
1523 "err:%d errno:%d\n", err, errno);
1525 err = bpf_map_lookup_elem(map_fd, &bad_index, &map_cookie);
1526 CHECK(err != -1 || errno != ENOENT,
1527 "reuseport array update >=max_entries",
1528 "err:%d errno:%d\n", err, errno);
1530 /* Test lookup/delete non existence elem */
1531 err = bpf_map_lookup_elem(map_fd, &index3, &map_cookie);
1532 CHECK(err != -1 || errno != ENOENT,
1533 "reuseport array lookup not-exist elem",
1534 "err:%d errno:%d\n", err, errno);
1535 err = bpf_map_delete_elem(map_fd, &index3);
1536 CHECK(err != -1 || errno != ENOENT,
1537 "reuseport array del not-exist elem",
1538 "err:%d errno:%d\n", err, errno);
1540 for (t = 0; t < ARRAY_SIZE(types); t++) {
1543 prepare_reuseport_grp(type, map_fd, grpa_fds64,
1544 grpa_cookies, ARRAY_SIZE(grpa_fds64));
1546 /* Test BPF_* update flags */
1547 /* BPF_EXIST failure case */
1548 err = bpf_map_update_elem(map_fd, &index3, &grpa_fds64[fds_idx],
1550 CHECK(err != -1 || errno != ENOENT,
1551 "reuseport array update empty elem BPF_EXIST",
1552 "sock_type:%d err:%d errno:%d\n",
1554 fds_idx = REUSEPORT_FD_IDX(err, fds_idx);
1556 /* BPF_NOEXIST success case */
1557 err = bpf_map_update_elem(map_fd, &index3, &grpa_fds64[fds_idx],
1560 "reuseport array update empty elem BPF_NOEXIST",
1561 "sock_type:%d err:%d errno:%d\n",
1563 fds_idx = REUSEPORT_FD_IDX(err, fds_idx);
1565 /* BPF_EXIST success case. */
1566 err = bpf_map_update_elem(map_fd, &index3, &grpa_fds64[fds_idx],
1569 "reuseport array update same elem BPF_EXIST",
1570 "sock_type:%d err:%d errno:%d\n", type, err, errno);
1571 fds_idx = REUSEPORT_FD_IDX(err, fds_idx);
1573 /* BPF_NOEXIST failure case */
1574 err = bpf_map_update_elem(map_fd, &index3, &grpa_fds64[fds_idx],
1576 CHECK(err != -1 || errno != EEXIST,
1577 "reuseport array update non-empty elem BPF_NOEXIST",
1578 "sock_type:%d err:%d errno:%d\n",
1580 fds_idx = REUSEPORT_FD_IDX(err, fds_idx);
1582 /* BPF_ANY case (always succeed) */
1583 err = bpf_map_update_elem(map_fd, &index3, &grpa_fds64[fds_idx],
1586 "reuseport array update same sk with BPF_ANY",
1587 "sock_type:%d err:%d errno:%d\n", type, err, errno);
1589 fd64 = grpa_fds64[fds_idx];
1590 sk_cookie = grpa_cookies[fds_idx];
1592 /* The same sk cannot be added to reuseport_array twice */
1593 err = bpf_map_update_elem(map_fd, &index3, &fd64, BPF_ANY);
1594 CHECK(err != -1 || errno != EBUSY,
1595 "reuseport array update same sk with same index",
1596 "sock_type:%d err:%d errno:%d\n",
1599 err = bpf_map_update_elem(map_fd, &index0, &fd64, BPF_ANY);
1600 CHECK(err != -1 || errno != EBUSY,
1601 "reuseport array update same sk with different index",
1602 "sock_type:%d err:%d errno:%d\n",
1605 /* Test delete elem */
1606 err = bpf_map_delete_elem(map_fd, &index3);
1607 CHECK(err == -1, "reuseport array delete sk",
1608 "sock_type:%d err:%d errno:%d\n",
1611 /* Add it back with BPF_NOEXIST */
1612 err = bpf_map_update_elem(map_fd, &index3, &fd64, BPF_NOEXIST);
1614 "reuseport array re-add with BPF_NOEXIST after del",
1615 "sock_type:%d err:%d errno:%d\n", type, err, errno);
1618 err = bpf_map_lookup_elem(map_fd, &index3, &map_cookie);
1619 CHECK(err == -1 || sk_cookie != map_cookie,
1620 "reuseport array lookup re-added sk",
1621 "sock_type:%d err:%d errno:%d sk_cookie:0x%llx map_cookie:0x%llxn",
1622 type, err, errno, sk_cookie, map_cookie);
1624 /* Test elem removed by close() */
1625 for (f = 0; f < ARRAY_SIZE(grpa_fds64); f++)
1626 close(grpa_fds64[f]);
1627 err = bpf_map_lookup_elem(map_fd, &index3, &map_cookie);
1628 CHECK(err != -1 || errno != ENOENT,
1629 "reuseport array lookup after close()",
1630 "sock_type:%d err:%d errno:%d\n",
1635 fd64 = socket(AF_INET6, SOCK_RAW, IPPROTO_UDP);
1636 CHECK(fd64 == -1, "socket(SOCK_RAW)", "err:%d errno:%d\n",
1638 err = bpf_map_update_elem(map_fd, &index3, &fd64, BPF_NOEXIST);
1639 CHECK(err != -1 || errno != ENOTSUPP, "reuseport array update SOCK_RAW",
1640 "err:%d errno:%d\n", err, errno);
1643 /* Close the 64 bit value map */
1646 /* Test 32 bit fd */
1647 map_fd = bpf_create_map(BPF_MAP_TYPE_REUSEPORT_SOCKARRAY,
1648 sizeof(__u32), sizeof(__u32), array_size, 0);
1649 CHECK(map_fd == -1, "reuseport array create",
1650 "map_fd:%d, errno:%d\n", map_fd, errno);
1651 prepare_reuseport_grp(SOCK_STREAM, map_fd, &fd64, &sk_cookie, 1);
1653 err = bpf_map_update_elem(map_fd, &index3, &fd, BPF_NOEXIST);
1654 CHECK(err == -1, "reuseport array update 32 bit fd",
1655 "err:%d errno:%d\n", err, errno);
1656 err = bpf_map_lookup_elem(map_fd, &index3, &map_cookie);
1657 CHECK(err != -1 || errno != ENOSPC,
1658 "reuseport array lookup 32 bit fd",
1659 "err:%d errno:%d\n", err, errno);
1664 static void run_all_tests(void)
1666 test_hashmap(0, NULL);
1667 test_hashmap_percpu(0, NULL);
1668 test_hashmap_walk(0, NULL);
1669 test_hashmap_zero_seed();
1671 test_arraymap(0, NULL);
1672 test_arraymap_percpu(0, NULL);
1674 test_arraymap_percpu_many_keys();
1676 test_devmap(0, NULL);
1677 test_sockmap(0, NULL);
1680 test_map_parallel();
1686 test_reuseport_array();
1688 test_queuemap(0, NULL);
1689 test_stackmap(0, NULL);
1701 map_flags = BPF_F_NO_PREALLOC;
1704 printf("test_maps: OK\n");