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.
20 #include <sys/resource.h>
22 #include <linux/bpf.h>
25 #include <bpf/libbpf.h>
30 static void test_hashmap(int task, void *data)
32 long long key, next_key, first_key, value;
35 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
38 printf("Failed to create hashmap '%s'!\n", strerror(errno));
44 /* Insert key=1 element. */
45 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
48 /* BPF_NOEXIST means add new element if it doesn't exist. */
49 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
50 /* key=1 already exists. */
53 /* -1 is an invalid flag. */
54 assert(bpf_map_update_elem(fd, &key, &value, -1) == -1 &&
57 /* Check that key=1 can be found. */
58 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);
61 /* Check that key=2 is not found. */
62 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);
64 /* BPF_EXIST means update existing element. */
65 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == -1 &&
66 /* key=2 is not there. */
69 /* Insert key=2 element. */
70 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);
72 /* key=1 and key=2 were inserted, check that key=0 cannot be
73 * inserted due to max_entries limit.
76 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
79 /* Update existing element, though the map is full. */
81 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0);
83 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
85 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
88 /* Check that key = 0 doesn't exist. */
90 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
92 /* Iterate over two elements. */
93 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 &&
94 (first_key == 1 || first_key == 2));
95 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
96 (next_key == first_key));
97 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
98 (next_key == 1 || next_key == 2) &&
99 (next_key != first_key));
100 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 &&
103 /* Delete both elements. */
105 assert(bpf_map_delete_elem(fd, &key) == 0);
107 assert(bpf_map_delete_elem(fd, &key) == 0);
108 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
111 /* Check that map is empty. */
112 assert(bpf_map_get_next_key(fd, NULL, &next_key) == -1 &&
114 assert(bpf_map_get_next_key(fd, &key, &next_key) == -1 &&
120 static void test_hashmap_sizes(int task, void *data)
124 for (i = 1; i <= 512; i <<= 1)
125 for (j = 1; j <= 1 << 18; j <<= 1) {
126 fd = bpf_create_map(BPF_MAP_TYPE_HASH, i, j,
131 printf("Failed to create hashmap key=%d value=%d '%s'\n",
132 i, j, strerror(errno));
136 usleep(10); /* give kernel time to destroy */
140 static void test_hashmap_percpu(int task, void *data)
142 unsigned int nr_cpus = bpf_num_possible_cpus();
143 BPF_DECLARE_PERCPU(long, value);
144 long long key, next_key, first_key;
145 int expected_key_mask = 0;
148 fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_HASH, sizeof(key),
149 sizeof(bpf_percpu(value, 0)), 2, map_flags);
151 printf("Failed to create hashmap '%s'!\n", strerror(errno));
155 for (i = 0; i < nr_cpus; i++)
156 bpf_percpu(value, i) = i + 100;
159 /* Insert key=1 element. */
160 assert(!(expected_key_mask & key));
161 assert(bpf_map_update_elem(fd, &key, value, BPF_ANY) == 0);
162 expected_key_mask |= key;
164 /* BPF_NOEXIST means add new element if it doesn't exist. */
165 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 &&
166 /* key=1 already exists. */
169 /* -1 is an invalid flag. */
170 assert(bpf_map_update_elem(fd, &key, value, -1) == -1 &&
173 /* Check that key=1 can be found. Value could be 0 if the lookup
174 * was run from a different CPU.
176 bpf_percpu(value, 0) = 1;
177 assert(bpf_map_lookup_elem(fd, &key, value) == 0 &&
178 bpf_percpu(value, 0) == 100);
181 /* Check that key=2 is not found. */
182 assert(bpf_map_lookup_elem(fd, &key, value) == -1 && errno == ENOENT);
184 /* BPF_EXIST means update existing element. */
185 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == -1 &&
186 /* key=2 is not there. */
189 /* Insert key=2 element. */
190 assert(!(expected_key_mask & key));
191 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0);
192 expected_key_mask |= key;
194 /* key=1 and key=2 were inserted, check that key=0 cannot be
195 * inserted due to max_entries limit.
198 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 &&
201 /* Check that key = 0 doesn't exist. */
202 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
204 /* Iterate over two elements. */
205 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 &&
206 ((expected_key_mask & first_key) == first_key));
207 while (!bpf_map_get_next_key(fd, &key, &next_key)) {
209 assert(next_key == first_key);
212 assert((expected_key_mask & next_key) == next_key);
213 expected_key_mask &= ~next_key;
215 assert(bpf_map_lookup_elem(fd, &next_key, value) == 0);
217 for (i = 0; i < nr_cpus; i++)
218 assert(bpf_percpu(value, i) == i + 100);
222 assert(errno == ENOENT);
224 /* Update with BPF_EXIST. */
226 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0);
228 /* Delete both elements. */
230 assert(bpf_map_delete_elem(fd, &key) == 0);
232 assert(bpf_map_delete_elem(fd, &key) == 0);
233 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
236 /* Check that map is empty. */
237 assert(bpf_map_get_next_key(fd, NULL, &next_key) == -1 &&
239 assert(bpf_map_get_next_key(fd, &key, &next_key) == -1 &&
245 static void test_hashmap_walk(int task, void *data)
247 int fd, i, max_entries = 100000;
248 long long key, value, next_key;
249 bool next_key_valid = true;
251 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
252 max_entries, map_flags);
254 printf("Failed to create hashmap '%s'!\n", strerror(errno));
258 for (i = 0; i < max_entries; i++) {
259 key = i; value = key;
260 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);
263 for (i = 0; bpf_map_get_next_key(fd, !i ? NULL : &key,
264 &next_key) == 0; i++) {
266 assert(bpf_map_lookup_elem(fd, &key, &value) == 0);
269 assert(i == max_entries);
271 assert(bpf_map_get_next_key(fd, NULL, &key) == 0);
272 for (i = 0; next_key_valid; i++) {
273 next_key_valid = bpf_map_get_next_key(fd, &key, &next_key) == 0;
274 assert(bpf_map_lookup_elem(fd, &key, &value) == 0);
276 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0);
280 assert(i == 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);
286 assert(value - 1 == key);
289 assert(i == max_entries);
293 static void test_arraymap(int task, void *data)
295 int key, next_key, fd;
298 fd = bpf_create_map(BPF_MAP_TYPE_ARRAY, sizeof(key), sizeof(value),
301 printf("Failed to create arraymap '%s'!\n", strerror(errno));
307 /* Insert key=1 element. */
308 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
311 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
314 /* Check that key=1 can be found. */
315 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);
318 /* Check that key=0 is also found and zero initialized. */
319 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);
321 /* key=0 and key=1 were inserted, check that key=2 cannot be inserted
322 * due to max_entries limit.
325 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == -1 &&
328 /* Check that key = 2 doesn't exist. */
329 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);
331 /* Iterate over two elements. */
332 assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&
334 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
336 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
338 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 &&
341 /* Delete shouldn't succeed. */
343 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == EINVAL);
348 static void test_arraymap_percpu(int task, void *data)
350 unsigned int nr_cpus = bpf_num_possible_cpus();
351 BPF_DECLARE_PERCPU(long, values);
352 int key, next_key, fd, i;
354 fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_ARRAY, sizeof(key),
355 sizeof(bpf_percpu(values, 0)), 2, 0);
357 printf("Failed to create arraymap '%s'!\n", strerror(errno));
361 for (i = 0; i < nr_cpus; i++)
362 bpf_percpu(values, i) = i + 100;
365 /* Insert key=1 element. */
366 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);
368 bpf_percpu(values, 0) = 0;
369 assert(bpf_map_update_elem(fd, &key, values, BPF_NOEXIST) == -1 &&
372 /* Check that key=1 can be found. */
373 assert(bpf_map_lookup_elem(fd, &key, values) == 0 &&
374 bpf_percpu(values, 0) == 100);
377 /* Check that key=0 is also found and zero initialized. */
378 assert(bpf_map_lookup_elem(fd, &key, values) == 0 &&
379 bpf_percpu(values, 0) == 0 &&
380 bpf_percpu(values, nr_cpus - 1) == 0);
382 /* Check that key=2 cannot be inserted due to max_entries limit. */
384 assert(bpf_map_update_elem(fd, &key, values, BPF_EXIST) == -1 &&
387 /* Check that key = 2 doesn't exist. */
388 assert(bpf_map_lookup_elem(fd, &key, values) == -1 && errno == ENOENT);
390 /* Iterate over two elements. */
391 assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&
393 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
395 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
397 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 &&
400 /* Delete shouldn't succeed. */
402 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == EINVAL);
407 static void test_arraymap_percpu_many_keys(void)
409 unsigned int nr_cpus = bpf_num_possible_cpus();
410 BPF_DECLARE_PERCPU(long, values);
411 /* nr_keys is not too large otherwise the test stresses percpu
412 * allocator more than anything else
414 unsigned int nr_keys = 2000;
417 fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_ARRAY, sizeof(key),
418 sizeof(bpf_percpu(values, 0)), nr_keys, 0);
420 printf("Failed to create per-cpu arraymap '%s'!\n",
425 for (i = 0; i < nr_cpus; i++)
426 bpf_percpu(values, i) = i + 10;
428 for (key = 0; key < nr_keys; key++)
429 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);
431 for (key = 0; key < nr_keys; key++) {
432 for (i = 0; i < nr_cpus; i++)
433 bpf_percpu(values, i) = 0;
435 assert(bpf_map_lookup_elem(fd, &key, values) == 0);
437 for (i = 0; i < nr_cpus; i++)
438 assert(bpf_percpu(values, i) == i + 10);
444 static void test_devmap(int task, void *data)
449 fd = bpf_create_map(BPF_MAP_TYPE_DEVMAP, sizeof(key), sizeof(value),
452 printf("Failed to create arraymap '%s'!\n", strerror(errno));
459 #include <sys/socket.h>
460 #include <sys/ioctl.h>
461 #include <arpa/inet.h>
462 #include <sys/select.h>
463 #include <linux/err.h>
464 #define SOCKMAP_PARSE_PROG "./sockmap_parse_prog.o"
465 #define SOCKMAP_VERDICT_PROG "./sockmap_verdict_prog.o"
466 static void test_sockmap(int tasks, void *data)
468 int one = 1, map_fd_rx = 0, map_fd_tx = 0, map_fd_break, s, sc, rc;
469 struct bpf_map *bpf_map_rx, *bpf_map_tx, *bpf_map_break;
470 int ports[] = {50200, 50201, 50202, 50204};
471 int err, i, fd, udp, sfd[6] = {0xdeadbeef};
472 u8 buf[20] = {0x0, 0x5, 0x3, 0x2, 0x1, 0x0};
473 int parse_prog, verdict_prog;
474 struct sockaddr_in addr;
475 struct bpf_object *obj;
481 /* Create some sockets to use with sockmap */
482 for (i = 0; i < 2; i++) {
483 sfd[i] = socket(AF_INET, SOCK_STREAM, 0);
486 err = setsockopt(sfd[i], SOL_SOCKET, SO_REUSEADDR,
487 (char *)&one, sizeof(one));
489 printf("failed to setsockopt\n");
492 err = ioctl(sfd[i], FIONBIO, (char *)&one);
494 printf("failed to ioctl\n");
497 memset(&addr, 0, sizeof(struct sockaddr_in));
498 addr.sin_family = AF_INET;
499 addr.sin_addr.s_addr = inet_addr("127.0.0.1");
500 addr.sin_port = htons(ports[i]);
501 err = bind(sfd[i], (struct sockaddr *)&addr, sizeof(addr));
503 printf("failed to bind: err %i: %i:%i\n",
507 err = listen(sfd[i], 32);
509 printf("failed to listen\n");
514 for (i = 2; i < 4; i++) {
515 sfd[i] = socket(AF_INET, SOCK_STREAM, 0);
518 err = setsockopt(sfd[i], SOL_SOCKET, SO_REUSEADDR,
519 (char *)&one, sizeof(one));
521 printf("set sock opt\n");
524 memset(&addr, 0, sizeof(struct sockaddr_in));
525 addr.sin_family = AF_INET;
526 addr.sin_addr.s_addr = inet_addr("127.0.0.1");
527 addr.sin_port = htons(ports[i - 2]);
528 err = connect(sfd[i], (struct sockaddr *)&addr, sizeof(addr));
530 printf("failed to connect\n");
536 for (i = 4; i < 6; i++) {
537 sfd[i] = accept(sfd[i - 4], NULL, NULL);
539 printf("accept failed\n");
544 /* Test sockmap with connected sockets */
545 fd = bpf_create_map(BPF_MAP_TYPE_SOCKMAP,
546 sizeof(key), sizeof(value),
549 printf("Failed to create sockmap %i\n", fd);
553 /* Test update with unsupported UDP socket */
554 udp = socket(AF_INET, SOCK_DGRAM, 0);
556 err = bpf_map_update_elem(fd, &i, &udp, BPF_ANY);
558 printf("Failed socket SOCK_DGRAM allowed '%i:%i'\n",
563 /* Test update without programs */
564 for (i = 0; i < 6; i++) {
565 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_ANY);
567 printf("Failed noprog update sockmap '%i:%i'\n",
573 /* Test attaching/detaching bad fds */
574 err = bpf_prog_attach(-1, fd, BPF_SK_SKB_STREAM_PARSER, 0);
576 printf("Failed invalid parser prog attach\n");
580 err = bpf_prog_attach(-1, fd, BPF_SK_SKB_STREAM_VERDICT, 0);
582 printf("Failed invalid verdict prog attach\n");
586 err = bpf_prog_attach(-1, fd, __MAX_BPF_ATTACH_TYPE, 0);
588 printf("Failed unknown prog attach\n");
592 err = bpf_prog_detach(fd, BPF_SK_SKB_STREAM_PARSER);
594 printf("Failed empty parser prog detach\n");
598 err = bpf_prog_detach(fd, BPF_SK_SKB_STREAM_VERDICT);
600 printf("Failed empty verdict prog detach\n");
604 err = bpf_prog_detach(fd, __MAX_BPF_ATTACH_TYPE);
606 printf("Detach invalid prog successful\n");
610 /* Load SK_SKB program and Attach */
611 err = bpf_prog_load(SOCKMAP_PARSE_PROG,
612 BPF_PROG_TYPE_SK_SKB, &obj, &parse_prog);
614 printf("Failed to load SK_SKB parse prog\n");
618 err = bpf_prog_load(SOCKMAP_VERDICT_PROG,
619 BPF_PROG_TYPE_SK_SKB, &obj, &verdict_prog);
621 printf("Failed to load SK_SKB verdict prog\n");
625 bpf_map_rx = bpf_object__find_map_by_name(obj, "sock_map_rx");
626 if (IS_ERR(bpf_map_rx)) {
627 printf("Failed to load map rx from verdict prog\n");
631 map_fd_rx = bpf_map__fd(bpf_map_rx);
633 printf("Failed to get map fd\n");
637 bpf_map_tx = bpf_object__find_map_by_name(obj, "sock_map_tx");
638 if (IS_ERR(bpf_map_tx)) {
639 printf("Failed to load map tx from verdict prog\n");
643 map_fd_tx = bpf_map__fd(bpf_map_tx);
645 printf("Failed to get map tx fd\n");
649 bpf_map_break = bpf_object__find_map_by_name(obj, "sock_map_break");
650 if (IS_ERR(bpf_map_break)) {
651 printf("Failed to load map tx from verdict prog\n");
655 map_fd_break = bpf_map__fd(bpf_map_break);
656 if (map_fd_break < 0) {
657 printf("Failed to get map tx fd\n");
661 err = bpf_prog_attach(parse_prog, map_fd_break,
662 BPF_SK_SKB_STREAM_PARSER, 0);
664 printf("Allowed attaching SK_SKB program to invalid map\n");
668 err = bpf_prog_attach(parse_prog, map_fd_rx,
669 BPF_SK_SKB_STREAM_PARSER, 0);
671 printf("Failed stream parser bpf prog attach\n");
675 err = bpf_prog_attach(verdict_prog, map_fd_rx,
676 BPF_SK_SKB_STREAM_VERDICT, 0);
678 printf("Failed stream verdict bpf prog attach\n");
682 err = bpf_prog_attach(verdict_prog, map_fd_rx,
683 __MAX_BPF_ATTACH_TYPE, 0);
685 printf("Attached unknown bpf prog\n");
689 /* Test map update elem afterwards fd lives in fd and map_fd */
690 for (i = 0; i < 6; i++) {
691 err = bpf_map_update_elem(map_fd_rx, &i, &sfd[i], BPF_ANY);
693 printf("Failed map_fd_rx update sockmap %i '%i:%i'\n",
697 err = bpf_map_update_elem(map_fd_tx, &i, &sfd[i], BPF_ANY);
699 printf("Failed map_fd_tx update sockmap %i '%i:%i'\n",
705 /* Test map delete elem and remove send/recv sockets */
706 for (i = 2; i < 4; i++) {
707 err = bpf_map_delete_elem(map_fd_rx, &i);
709 printf("Failed delete sockmap rx %i '%i:%i'\n",
713 err = bpf_map_delete_elem(map_fd_tx, &i);
715 printf("Failed delete sockmap tx %i '%i:%i'\n",
721 /* Test map send/recv */
722 for (i = 0; i < 2; i++) {
725 sc = send(sfd[2], buf, 20, 0);
727 printf("Failed sockmap send\n");
735 s = select(sfd[3] + 1, &w, NULL, NULL, &to);
737 perror("Failed sockmap select()");
740 printf("Failed sockmap unexpected timeout\n");
744 if (!FD_ISSET(sfd[3], &w)) {
745 printf("Failed sockmap select/recv\n");
749 rc = recv(sfd[3], buf, sizeof(buf), 0);
751 printf("Failed sockmap recv\n");
756 /* Negative null entry lookup from datapath should be dropped */
759 sc = send(sfd[2], buf, 20, 0);
761 printf("Failed sockmap send\n");
765 /* Push fd into same slot */
767 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_NOEXIST);
769 printf("Failed allowed sockmap dup slot BPF_NOEXIST\n");
773 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_ANY);
775 printf("Failed sockmap update new slot BPF_ANY\n");
779 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_EXIST);
781 printf("Failed sockmap update new slot BPF_EXIST\n");
785 /* Delete the elems without programs */
786 for (i = 0; i < 6; i++) {
787 err = bpf_map_delete_elem(fd, &i);
789 printf("Failed delete sockmap %i '%i:%i'\n",
794 /* Test having multiple maps open and set with programs on same fds */
795 err = bpf_prog_attach(parse_prog, fd,
796 BPF_SK_SKB_STREAM_PARSER, 0);
798 printf("Failed fd bpf parse prog attach\n");
801 err = bpf_prog_attach(verdict_prog, fd,
802 BPF_SK_SKB_STREAM_VERDICT, 0);
804 printf("Failed fd bpf verdict prog attach\n");
808 for (i = 4; i < 6; i++) {
809 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_ANY);
811 printf("Failed allowed duplicate programs in update ANY sockmap %i '%i:%i'\n",
815 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_NOEXIST);
817 printf("Failed allowed duplicate program in update NOEXIST sockmap %i '%i:%i'\n",
821 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_EXIST);
823 printf("Failed allowed duplicate program in update EXIST sockmap %i '%i:%i'\n",
829 /* Test tasks number of forked operations */
830 for (i = 0; i < tasks; i++) {
833 for (i = 0; i < 6; i++) {
834 bpf_map_delete_elem(map_fd_tx, &i);
835 bpf_map_delete_elem(map_fd_rx, &i);
836 bpf_map_update_elem(map_fd_tx, &i,
838 bpf_map_update_elem(map_fd_rx, &i,
842 } else if (pid[i] == -1) {
843 printf("Couldn't spawn #%d process!\n", i);
848 for (i = 0; i < tasks; i++) {
851 assert(waitpid(pid[i], &status, 0) == pid[i]);
855 err = bpf_prog_detach(map_fd_rx, __MAX_BPF_ATTACH_TYPE);
857 printf("Detached an invalid prog type.\n");
861 err = bpf_prog_detach(map_fd_rx, BPF_SK_SKB_STREAM_PARSER);
863 printf("Failed parser prog detach\n");
867 err = bpf_prog_detach(map_fd_rx, BPF_SK_SKB_STREAM_VERDICT);
869 printf("Failed parser prog detach\n");
873 /* Test map close sockets and empty maps */
874 for (i = 0; i < 6; i++) {
875 bpf_map_delete_elem(map_fd_tx, &i);
876 bpf_map_delete_elem(map_fd_rx, &i);
881 bpf_object__close(obj);
884 for (i = 0; i < 6; i++)
886 printf("Failed to create sockmap '%i:%s'!\n", i, strerror(errno));
889 for (i = 0; i < 6; i++) {
891 bpf_map_delete_elem(map_fd_tx, &i);
893 bpf_map_delete_elem(map_fd_rx, &i);
900 #define MAP_SIZE (32 * 1024)
902 static void test_map_large(void)
911 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
912 MAP_SIZE, map_flags);
914 printf("Failed to create large map '%s'!\n", strerror(errno));
918 for (i = 0; i < MAP_SIZE; i++) {
919 key = (struct bigkey) { .c = i };
922 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);
926 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
929 /* Iterate through all elements. */
930 assert(bpf_map_get_next_key(fd, NULL, &key) == 0);
932 for (i = 0; i < MAP_SIZE; i++)
933 assert(bpf_map_get_next_key(fd, &key, &key) == 0);
934 assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT);
937 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);
939 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);
944 static void run_parallel(int tasks, void (*fn)(int task, void *data),
950 for (i = 0; i < tasks; i++) {
955 } else if (pid[i] == -1) {
956 printf("Couldn't spawn #%d process!\n", i);
961 for (i = 0; i < tasks; i++) {
964 assert(waitpid(pid[i], &status, 0) == pid[i]);
969 static void test_map_stress(void)
971 run_parallel(100, test_hashmap, NULL);
972 run_parallel(100, test_hashmap_percpu, NULL);
973 run_parallel(100, test_hashmap_sizes, NULL);
974 run_parallel(100, test_hashmap_walk, NULL);
976 run_parallel(100, test_arraymap, NULL);
977 run_parallel(100, test_arraymap_percpu, NULL);
985 static void do_work(int fn, void *data)
987 int do_update = ((int *)data)[1];
988 int fd = ((int *)data)[0];
991 for (i = fn; i < MAP_SIZE; i += TASKS) {
995 assert(bpf_map_update_elem(fd, &key, &value,
997 assert(bpf_map_update_elem(fd, &key, &value,
1000 assert(bpf_map_delete_elem(fd, &key) == 0);
1005 static void test_map_parallel(void)
1007 int i, fd, key = 0, value = 0;
1010 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
1011 MAP_SIZE, map_flags);
1013 printf("Failed to create map for parallel test '%s'!\n",
1018 /* Use the same fd in children to add elements to this map:
1019 * child_0 adds key=0, key=1024, key=2048, ...
1020 * child_1 adds key=1, key=1025, key=2049, ...
1021 * child_1023 adds key=1023, ...
1024 data[1] = DO_UPDATE;
1025 run_parallel(TASKS, do_work, data);
1027 /* Check that key=0 is already there. */
1028 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
1031 /* Check that all elements were inserted. */
1032 assert(bpf_map_get_next_key(fd, NULL, &key) == 0);
1034 for (i = 0; i < MAP_SIZE; i++)
1035 assert(bpf_map_get_next_key(fd, &key, &key) == 0);
1036 assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT);
1038 /* Another check for all elements */
1039 for (i = 0; i < MAP_SIZE; i++) {
1040 key = MAP_SIZE - i - 1;
1042 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 &&
1046 /* Now let's delete all elemenets in parallel. */
1047 data[1] = DO_DELETE;
1048 run_parallel(TASKS, do_work, data);
1050 /* Nothing should be left. */
1052 assert(bpf_map_get_next_key(fd, NULL, &key) == -1 && errno == ENOENT);
1053 assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT);
1056 static void run_all_tests(void)
1058 test_hashmap(0, NULL);
1059 test_hashmap_percpu(0, NULL);
1060 test_hashmap_walk(0, NULL);
1062 test_arraymap(0, NULL);
1063 test_arraymap_percpu(0, NULL);
1065 test_arraymap_percpu_many_keys();
1067 test_devmap(0, NULL);
1068 test_sockmap(0, NULL);
1071 test_map_parallel();
1077 struct rlimit rinf = { RLIM_INFINITY, RLIM_INFINITY };
1079 setrlimit(RLIMIT_MEMLOCK, &rinf);
1084 map_flags = BPF_F_NO_PREALLOC;
1087 printf("test_maps: OK\n");