13 #include <assert.h>
52 	assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);  in test_hashmap()
56 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&  in test_hashmap()
61 	assert(bpf_map_update_elem(fd, &key, &value, -1) < 0 &&  in test_hashmap()
65 	assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);  in test_hashmap()
70 	assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);  in test_hashmap()
73 	assert(bpf_map_lookup_and_delete_elem(fd, &key, &value) == 0 && value == 1234);  in test_hashmap()
76 	assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT);  in test_hashmap()
79 	assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) < 0 &&  in test_hashmap()
84 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);  in test_hashmap()
90 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&  in test_hashmap()
95 	assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0);  in test_hashmap()
97 	assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);  in test_hashmap()
99 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&  in test_hashmap()
104 	assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT);  in test_hashmap()
107 	assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 &&  in test_hashmap()
109 	assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&  in test_hashmap()
111 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&  in test_hashmap()
114 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 &&  in test_hashmap()
119 	assert(bpf_map_delete_elem(fd, &key) == 0);  in test_hashmap()
121 	assert(bpf_map_delete_elem(fd, &key) == 0);  in test_hashmap()
122 	assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT);  in test_hashmap()
126 	assert(bpf_map_get_next_key(fd, NULL, &next_key) < 0 &&  in test_hashmap()
128 	assert(bpf_map_get_next_key(fd, &key, &next_key) < 0 &&  in test_hashmap()
174 	assert(!(expected_key_mask & key));  in test_hashmap_percpu()
175 	assert(bpf_map_update_elem(fd, &key, value, BPF_ANY) == 0);  in test_hashmap_percpu()
178 	assert(bpf_map_lookup_and_delete_elem(fd, &key, value) == 0 &&  in test_hashmap_percpu()
185 	assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0);  in test_hashmap_percpu()
189 	assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) < 0 &&  in test_hashmap_percpu()
194 	assert(bpf_map_update_elem(fd, &key, value, -1) < 0 &&  in test_hashmap_percpu()
201 	assert(bpf_map_lookup_elem(fd, &key, value) == 0 &&  in test_hashmap_percpu()
206 	assert(bpf_map_lookup_elem(fd, &key, value) < 0 && errno == ENOENT);  in test_hashmap_percpu()
209 	assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) < 0 &&  in test_hashmap_percpu()
214 	assert(!(expected_key_mask & key));  in test_hashmap_percpu()
215 	assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0);  in test_hashmap_percpu()
222 	assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) < 0 &&  in test_hashmap_percpu()
226 	assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT);  in test_hashmap_percpu()
229 	assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 &&  in test_hashmap_percpu()
233 			assert(next_key == first_key);  in test_hashmap_percpu()
236 		assert((expected_key_mask & next_key) == next_key);  in test_hashmap_percpu()
239 		assert(bpf_map_lookup_elem(fd, &next_key, value) == 0);  in test_hashmap_percpu()
242 			assert(bpf_percpu(value, i) == i + 100);  in test_hashmap_percpu()
246 	assert(errno == ENOENT);  in test_hashmap_percpu()
250 	assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0);  in test_hashmap_percpu()
254 	assert(bpf_map_delete_elem(fd, &key) == 0);  in test_hashmap_percpu()
256 	assert(bpf_map_delete_elem(fd, &key) == 0);  in test_hashmap_percpu()
257 	assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT);  in test_hashmap_percpu()
261 	assert(bpf_map_get_next_key(fd, NULL, &next_key) < 0 &&  in test_hashmap_percpu()
263 	assert(bpf_map_get_next_key(fd, &key, &next_key) < 0 &&  in test_hashmap_percpu()
302 		assert(bpf_map_lookup_elem(fd, &key, &value) == 0);  in test_hashmap_walk()
305 	assert(i == max_entries);  in test_hashmap_walk()
307 	assert(bpf_map_get_next_key(fd, NULL, &key) == 0);  in test_hashmap_walk()
310 		assert(bpf_map_lookup_elem(fd, &key, &value) == 0);  in test_hashmap_walk()
312 		assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0);  in test_hashmap_walk()
316 	assert(i == max_entries);  in test_hashmap_walk()
321 		assert(bpf_map_lookup_elem(fd, &key, &value) == 0);  in test_hashmap_walk()
322 		assert(value - 1 == key);  in test_hashmap_walk()
325 	assert(i == max_entries);  in test_hashmap_walk()
377 	assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);  in test_arraymap()
380 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&  in test_arraymap()
384 	assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);  in test_arraymap()
388 	assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);  in test_arraymap()
394 	assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) < 0 &&  in test_arraymap()
398 	assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT);  in test_arraymap()
401 	assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&  in test_arraymap()
403 	assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&  in test_arraymap()
405 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&  in test_arraymap()
407 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 &&  in test_arraymap()
412 	assert(bpf_map_delete_elem(fd, &key) < 0 && errno == EINVAL);  in test_arraymap()
435 	assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);  in test_arraymap_percpu()
438 	assert(bpf_map_update_elem(fd, &key, values, BPF_NOEXIST) < 0 &&  in test_arraymap_percpu()
442 	assert(bpf_map_lookup_elem(fd, &key, values) == 0 &&  in test_arraymap_percpu()
447 	assert(bpf_map_lookup_elem(fd, &key, values) == 0 &&  in test_arraymap_percpu()
453 	assert(bpf_map_update_elem(fd, &key, values, BPF_EXIST) < 0 &&  in test_arraymap_percpu()
457 	assert(bpf_map_lookup_elem(fd, &key, values) < 0 && errno == ENOENT);  in test_arraymap_percpu()
460 	assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&  in test_arraymap_percpu()
462 	assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&  in test_arraymap_percpu()
464 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&  in test_arraymap_percpu()
466 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 &&  in test_arraymap_percpu()
471 	assert(bpf_map_delete_elem(fd, &key) < 0 && errno == EINVAL);  in test_arraymap_percpu()
498 		assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);  in test_arraymap_percpu_many_keys()
504 		assert(bpf_map_lookup_elem(fd, &key, values) == 0);  in test_arraymap_percpu_many_keys()
507 			assert(bpf_percpu(values, i) == i + 10);  in test_arraymap_percpu_many_keys()
556 	assert(fd < 0 && errno == EINVAL);  in test_queuemap()
562 		assert(fd < 0 && errno == EINVAL);  in test_queuemap()
572 		assert(bpf_map_update_elem(fd, NULL, &vals[i], 0) == 0);  in test_queuemap()
575 	assert(bpf_map_update_elem(fd, NULL, &val, 0) < 0 &&  in test_queuemap()
579 	assert(bpf_map_lookup_elem(fd, NULL, &val) == 0 && val == vals[0]);  in test_queuemap()
583 		assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0);  in test_queuemap()
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()
595 	assert(bpf_map_delete_elem(fd, NULL) < 0 && errno == EINVAL);  in test_queuemap()
596 	assert(bpf_map_get_next_key(fd, NULL, NULL) < 0 && errno == EINVAL);  in test_queuemap()
614 	assert(fd < 0 && errno == EINVAL);  in test_stackmap()
620 		assert(fd < 0 && errno == EINVAL);  in test_stackmap()
630 		assert(bpf_map_update_elem(fd, NULL, &vals[i], 0) == 0);  in test_stackmap()
633 	assert(bpf_map_update_elem(fd, NULL, &val, 0) < 0 &&  in test_stackmap()
637 	assert(bpf_map_lookup_elem(fd, NULL, &val) == 0 && val == vals[i - 1]);  in test_stackmap()
641 		assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0);  in test_stackmap()
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()
653 	assert(bpf_map_delete_elem(fd, NULL) < 0 && errno == EINVAL);  in test_stackmap()
654 	assert(bpf_map_get_next_key(fd, NULL, NULL) < 0 && errno == EINVAL);  in test_stackmap()
1106 		assert(waitpid(pid[i], &status, 0) == pid[i]);  in test_sockmap()
1107 		assert(status == 0);  in test_sockmap()
1328 		assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);  in test_map_large()
1332 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&  in test_map_large()
1336 	assert(bpf_map_get_next_key(fd, NULL, &key) == 0);  in test_map_large()
1339 		assert(bpf_map_get_next_key(fd, &key, &key) == 0);  in test_map_large()
1340 	assert(bpf_map_get_next_key(fd, &key, &key) < 0 && errno == ENOENT);  in test_map_large()
1343 	assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);  in test_map_large()
1345 	assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT);  in test_map_large()
1377 		assert(waitpid(pid[i], &status, 0) == pid[i]);  in __run_parallel()
1378 		assert(status == 0);  in __run_parallel()
1452 			assert(err == 0);  in test_update_delete()
1456 			assert(err == 0);  in test_update_delete()
1461 			assert(err == 0);  in test_update_delete()
1489 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&  in test_map_parallel()
1493 	assert(bpf_map_get_next_key(fd, NULL, &key) == 0);  in test_map_parallel()
1496 		assert(bpf_map_get_next_key(fd, &key, &key) == 0);  in test_map_parallel()
1497 	assert(bpf_map_get_next_key(fd, &key, &key) < 0 && errno == ENOENT);  in test_map_parallel()
1503 		assert(bpf_map_lookup_elem(fd, &key, &value) == 0 &&  in test_map_parallel()
1513 	assert(bpf_map_get_next_key(fd, NULL, &key) < 0 && errno == ENOENT);  in test_map_parallel()
1514 	assert(bpf_map_get_next_key(fd, &key, &key) < 0 && errno == ENOENT);  in test_map_parallel()
1532 	assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) < 0 &&  in test_map_rdonly()
1536 	assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT);  in test_map_rdonly()
1537 	assert(bpf_map_get_next_key(fd, &key, &value) < 0 && errno == ENOENT);  in test_map_rdonly()
1557 	assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);  in test_map_wronly_hash()
1560 	assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == EPERM);  in test_map_wronly_hash()
1561 	assert(bpf_map_get_next_key(fd, &key, &value) < 0 && errno == EPERM);  in test_map_wronly_hash()
1570 	assert(map_type == BPF_MAP_TYPE_QUEUE ||  in test_map_wronly_stack_or_queue()
1576 		assert(fd < 0 && errno == EINVAL);  in test_map_wronly_stack_or_queue()
1585 	assert(bpf_map_update_elem(fd, NULL, &value, BPF_ANY) == 0);  in test_map_wronly_stack_or_queue()
1588 	assert(bpf_map_lookup_elem(fd, NULL, &value) < 0 && errno == EPERM);  in test_map_wronly_stack_or_queue()
1591 	assert(bpf_map_lookup_and_delete_elem(fd, NULL, &value) < 0 &&  in test_map_wronly_stack_or_queue()
1640 			assert(map_elem_size == sizeof(__u32));  in prepare_reuseport_grp()