| H A D | test_maps.c | 36 int fd; in test_hashmap() local
38 fd = bpf_map_create(BPF_MAP_TYPE_HASH, NULL, sizeof(key), sizeof(value), 2, &map_opts); in test_hashmap()
39 if (fd < 0) { in test_hashmap()
47 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_hashmap()
51 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 && in test_hashmap()
56 assert(bpf_map_update_elem(fd, &key, &value, -1) < 0 && in test_hashmap()
60 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234); in test_hashmap()
65 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_hashmap()
68 assert(bpf_map_lookup_and_delete_elem(fd, &key, &value) == 0 && value == 1234); in test_hashmap()
71 assert(bpf_map_lookup_elem(fd, in test_hashmap()
131 int fd, i, j; test_hashmap_sizes() local
154 int fd, i; test_hashmap_percpu() local
266 int i, fd, ret; helper_fill_hashmap() local
288 int fd, i, max_entries = 10000; test_hashmap_walk() local
359 int key, next_key, fd; test_arraymap() local
415 int key, next_key, fd, i; test_arraymap_percpu() local
478 int key, fd, i; test_arraymap_percpu_many_keys() local
509 int fd; test_devmap() local
523 int fd; test_devmap_hash() local
539 int fd, i; test_queuemap() local
595 int fd, i; test_stackmap() local
660 int err, i, fd, udp, sfd[6] = {0xdeadbeef}; test_sockmap() local
1152 int mim_fd, fd, err; test_map_in_map() local
1312 int fd, i, value; test_map_large() local
1445 int fd = ((int *)data)[0]; test_update_delete() local
1475 int i, fd, key = 0, value = 0, j = 0; test_map_parallel() local
1533 int fd, key = 0, value = 0; test_map_rdonly() local
1562 int fd, key = 0, value = 0; test_map_wronly_hash() local
1590 int fd, value = 0; test_map_wronly_stack_or_queue() local
1726 int fd; test_reuseport_array() local
[all...] |