Searched refs:bpf_map_lookup_and_delete_elem (Results 1 – 8 of 8) sorted by relevance
| /tools/testing/selftests/bpf/prog_tests/ |
| D | lookup_and_delete.c | 115 err = bpf_map_lookup_and_delete_elem(map_fd, &key, &value); in test_lookup_and_delete_hash()
150 err = bpf_map_lookup_and_delete_elem(map_fd, &key, value); in test_lookup_and_delete_percpu_hash()
194 err = bpf_map_lookup_and_delete_elem(map_fd, &key, &value); in test_lookup_and_delete_lru_hash()
243 err = bpf_map_lookup_and_delete_elem(map_fd, &key, value); in test_lookup_and_delete_lru_percpu_hash()
|
| D | queue_stack_map.c | 83 err = bpf_map_lookup_and_delete_elem(map_out_fd, NULL, &val); in test_queue_stack_map_by_type()
|
| /tools/lib/bpf/ |
| D | libbpf.map | 32 bpf_map_lookup_and_delete_elem;
|
| D | bpf.h | 125 LIBBPF_API int bpf_map_lookup_and_delete_elem(int fd, const void *key,
|
| D | bpf.c | 466 int bpf_map_lookup_and_delete_elem(int fd, const void *key, void *value) in bpf_map_lookup_and_delete_elem() function
|
| /tools/testing/selftests/bpf/ |
| D | test_maps.c | 73 assert(bpf_map_lookup_and_delete_elem(fd, &key, &value) == 0 && value == 1234); in test_hashmap()
178 assert(bpf_map_lookup_and_delete_elem(fd, &key, value) == 0 && in test_hashmap_percpu()
587 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == 0 && in test_queuemap()
591 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) < 0 && in test_queuemap()
645 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == 0 && in test_stackmap()
649 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) < 0 && in test_stackmap()
1591 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &value) < 0 && in test_map_wronly_stack_or_queue()
|
| D | test_lru_map.c | 236 assert(!bpf_map_lookup_and_delete_elem(lru_map_fd, &key, &value)); in test_lru_sanity0()
|
| /tools/bpf/bpftool/ |
| D | map.c | 1376 err = bpf_map_lookup_and_delete_elem(fd, key, value); in do_pop_dequeue()
|