13 #include <assert.h>
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, &key, &value) < 0 && errno == ENOENT);  in test_hashmap()
74 	assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) < 0 &&  in test_hashmap()
79 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);  in test_hashmap()
85 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&  in test_hashmap()
90 	assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0);  in test_hashmap()
92 	assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);  in test_hashmap()
94 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&  in test_hashmap()
99 	assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT);  in test_hashmap()
102 	assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 &&  in test_hashmap()
104 	assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&  in test_hashmap()
106 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&  in test_hashmap()
109 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 &&  in test_hashmap()
114 	assert(bpf_map_delete_elem(fd, &key) == 0);  in test_hashmap()
116 	assert(bpf_map_delete_elem(fd, &key) == 0);  in test_hashmap()
117 	assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT);  in test_hashmap()
121 	assert(bpf_map_get_next_key(fd, NULL, &next_key) < 0 &&  in test_hashmap()
123 	assert(bpf_map_get_next_key(fd, &key, &next_key) < 0 &&  in test_hashmap()
168 	assert(!(expected_key_mask & key));  in test_hashmap_percpu()
169 	assert(bpf_map_update_elem(fd, &key, value, BPF_ANY) == 0);  in test_hashmap_percpu()
172 	assert(bpf_map_lookup_and_delete_elem(fd, &key, value) == 0 &&  in test_hashmap_percpu()
179 	assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0);  in test_hashmap_percpu()
183 	assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) < 0 &&  in test_hashmap_percpu()
188 	assert(bpf_map_update_elem(fd, &key, value, -1) < 0 &&  in test_hashmap_percpu()
195 	assert(bpf_map_lookup_elem(fd, &key, value) == 0 &&  in test_hashmap_percpu()
200 	assert(bpf_map_lookup_elem(fd, &key, value) < 0 && errno == ENOENT);  in test_hashmap_percpu()
203 	assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) < 0 &&  in test_hashmap_percpu()
208 	assert(!(expected_key_mask & key));  in test_hashmap_percpu()
209 	assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0);  in test_hashmap_percpu()
216 	assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) < 0 &&  in test_hashmap_percpu()
220 	assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT);  in test_hashmap_percpu()
223 	assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 &&  in test_hashmap_percpu()
227 			assert(next_key == first_key);  in test_hashmap_percpu()
230 		assert((expected_key_mask & next_key) == next_key);  in test_hashmap_percpu()
233 		assert(bpf_map_lookup_elem(fd, &next_key, value) == 0);  in test_hashmap_percpu()
236 			assert(bpf_percpu(value, i) == i + 100);  in test_hashmap_percpu()
240 	assert(errno == ENOENT);  in test_hashmap_percpu()
244 	assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0);  in test_hashmap_percpu()
248 	assert(bpf_map_delete_elem(fd, &key) == 0);  in test_hashmap_percpu()
250 	assert(bpf_map_delete_elem(fd, &key) == 0);  in test_hashmap_percpu()
251 	assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT);  in test_hashmap_percpu()
255 	assert(bpf_map_get_next_key(fd, NULL, &next_key) < 0 &&  in test_hashmap_percpu()
257 	assert(bpf_map_get_next_key(fd, &key, &next_key) < 0 &&  in test_hashmap_percpu()
297 		assert(bpf_map_lookup_elem(fd, &key, value) == 0);  in test_hashmap_walk()
300 	assert(i == max_entries);  in test_hashmap_walk()
302 	assert(bpf_map_get_next_key(fd, NULL, &key) == 0);  in test_hashmap_walk()
305 		assert(bpf_map_lookup_elem(fd, &key, value) == 0);  in test_hashmap_walk()
307 		assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0);  in test_hashmap_walk()
311 	assert(i == max_entries);  in test_hashmap_walk()
316 		assert(bpf_map_lookup_elem(fd, &key, value) == 0);  in test_hashmap_walk()
317 		assert(value[0] - 1 == key);  in test_hashmap_walk()
320 	assert(i == max_entries);  in test_hashmap_walk()
371 	assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);  in test_arraymap()
374 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&  in test_arraymap()
378 	assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);  in test_arraymap()
382 	assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);  in test_arraymap()
388 	assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) < 0 &&  in test_arraymap()
392 	assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT);  in test_arraymap()
395 	assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&  in test_arraymap()
397 	assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&  in test_arraymap()
399 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&  in test_arraymap()
401 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 &&  in test_arraymap()
406 	assert(bpf_map_delete_elem(fd, &key) < 0 && errno == EINVAL);  in test_arraymap()
429 	assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);  in test_arraymap_percpu()
432 	assert(bpf_map_update_elem(fd, &key, values, BPF_NOEXIST) < 0 &&  in test_arraymap_percpu()
436 	assert(bpf_map_lookup_elem(fd, &key, values) == 0 &&  in test_arraymap_percpu()
441 	assert(bpf_map_lookup_elem(fd, &key, values) == 0 &&  in test_arraymap_percpu()
447 	assert(bpf_map_update_elem(fd, &key, values, BPF_EXIST) < 0 &&  in test_arraymap_percpu()
451 	assert(bpf_map_lookup_elem(fd, &key, values) < 0 && errno == ENOENT);  in test_arraymap_percpu()
454 	assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&  in test_arraymap_percpu()
456 	assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&  in test_arraymap_percpu()
458 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&  in test_arraymap_percpu()
460 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 &&  in test_arraymap_percpu()
465 	assert(bpf_map_delete_elem(fd, &key) < 0 && errno == EINVAL);  in test_arraymap_percpu()
492 		assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);  in test_arraymap_percpu_many_keys()
498 		assert(bpf_map_lookup_elem(fd, &key, values) == 0);  in test_arraymap_percpu_many_keys()
501 			assert(bpf_percpu(values, i) == i + 10);  in test_arraymap_percpu_many_keys()
547 	assert(fd < 0 && errno == EINVAL);  in test_queuemap()
552 		assert(fd < 0 && errno == EINVAL);  in test_queuemap()
562 		assert(bpf_map_update_elem(fd, NULL, &vals[i], 0) == 0);  in test_queuemap()
565 	assert(bpf_map_update_elem(fd, NULL, &val, 0) < 0 &&  in test_queuemap()
569 	assert(bpf_map_lookup_elem(fd, NULL, &val) == 0 && val == vals[0]);  in test_queuemap()
573 		assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0);  in test_queuemap()
577 		assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == 0 &&  in test_queuemap()
581 	assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) < 0 &&  in test_queuemap()
585 	assert(bpf_map_delete_elem(fd, NULL) < 0 && errno == EINVAL);  in test_queuemap()
586 	assert(bpf_map_get_next_key(fd, NULL, NULL) < 0 && errno == EINVAL);  in test_queuemap()
603 	assert(fd < 0 && errno == EINVAL);  in test_stackmap()
608 		assert(fd < 0 && errno == EINVAL);  in test_stackmap()
618 		assert(bpf_map_update_elem(fd, NULL, &vals[i], 0) == 0);  in test_stackmap()
621 	assert(bpf_map_update_elem(fd, NULL, &val, 0) < 0 &&  in test_stackmap()
625 	assert(bpf_map_lookup_elem(fd, NULL, &val) == 0 && val == vals[i - 1]);  in test_stackmap()
629 		assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0);  in test_stackmap()
633 		assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) == 0 &&  in test_stackmap()
637 	assert(bpf_map_lookup_and_delete_elem(fd, NULL, &val) < 0 &&  in test_stackmap()
641 	assert(bpf_map_delete_elem(fd, NULL) < 0 && errno == EINVAL);  in test_stackmap()
642 	assert(bpf_map_get_next_key(fd, NULL, NULL) < 0 && errno == EINVAL);  in test_stackmap()
1095 		assert(waitpid(pid[i], &status, 0) == pid[i]);  in test_sockmap()
1096 		assert(status == 0);  in test_sockmap()
1325 		assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);  in test_map_large()
1329 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&  in test_map_large()
1333 	assert(bpf_map_get_next_key(fd, NULL, &key) == 0);  in test_map_large()
1336 		assert(bpf_map_get_next_key(fd, &key, &key) == 0);  in test_map_large()
1337 	assert(bpf_map_get_next_key(fd, &key, &key) < 0 && errno == ENOENT);  in test_map_large()
1340 	assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);  in test_map_large()
1342 	assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT);  in test_map_large()
1374 		assert(waitpid(pid[i], &status, 0) == pid[i]);  in __run_parallel()
1375 		assert(status == 0);  in __run_parallel()
1457 			assert(err == 0);  in test_update_delete()
1462 			assert(err == 0);  in test_update_delete()
1467 			assert(err == 0);  in test_update_delete()
1496 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&  in test_map_parallel()
1500 	assert(bpf_map_get_next_key(fd, NULL, &key) == 0);  in test_map_parallel()
1503 		assert(bpf_map_get_next_key(fd, &key, &key) == 0);  in test_map_parallel()
1504 	assert(bpf_map_get_next_key(fd, &key, &key) < 0 && errno == ENOENT);  in test_map_parallel()
1510 		assert(bpf_map_lookup_elem(fd, &key, &value) == 0 &&  in test_map_parallel()
1520 	assert(bpf_map_get_next_key(fd, NULL, &key) < 0 && errno == ENOENT);  in test_map_parallel()
1521 	assert(bpf_map_get_next_key(fd, &key, &key) < 0 && errno == ENOENT);  in test_map_parallel()
1549 	assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) < 0 &&  in test_map_rdonly()
1553 	assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT);  in test_map_rdonly()
1554 	assert(bpf_map_get_next_key(fd, &key, &value) < 0 && errno == ENOENT);  in test_map_rdonly()
1578 	assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);  in test_map_wronly_hash()
1581 	assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == EPERM);  in test_map_wronly_hash()
1582 	assert(bpf_map_get_next_key(fd, &key, &value) < 0 && errno == EPERM);  in test_map_wronly_hash()
1593 	assert(map_type == BPF_MAP_TYPE_QUEUE ||  in test_map_wronly_stack_or_queue()
1601 		assert(fd < 0 && errno == EINVAL);  in test_map_wronly_stack_or_queue()
1610 	assert(bpf_map_update_elem(fd, NULL, &value, BPF_ANY) == 0);  in test_map_wronly_stack_or_queue()
1613 	assert(bpf_map_lookup_elem(fd, NULL, &value) < 0 && errno == EPERM);  in test_map_wronly_stack_or_queue()
1616 	assert(bpf_map_lookup_and_delete_elem(fd, NULL, &value) < 0 &&  in test_map_wronly_stack_or_queue()
1665 			assert(map_elem_size == sizeof(__u32));  in prepare_reuseport_grp()