60 	assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);  in test_hashmap()
64 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&  in test_hashmap()
69 	assert(bpf_map_update_elem(fd, &key, &value, -1) == -1 &&  in test_hashmap()
73 	assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);  in test_hashmap()
77 	assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);  in test_hashmap()
80 	assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == -1 &&  in test_hashmap()
85 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);  in test_hashmap()
91 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&  in test_hashmap()
96 	assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0);  in test_hashmap()
98 	assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);  in test_hashmap()
100 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&  in test_hashmap()
105 	assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);  in test_hashmap()
108 	assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 &&  in test_hashmap()
110 	assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&  in test_hashmap()
112 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&  in test_hashmap()
115 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 &&  in test_hashmap()
120 	assert(bpf_map_delete_elem(fd, &key) == 0);  in test_hashmap()
122 	assert(bpf_map_delete_elem(fd, &key) == 0);  in test_hashmap()
123 	assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);  in test_hashmap()
127 	assert(bpf_map_get_next_key(fd, NULL, &next_key) == -1 &&  in test_hashmap()
129 	assert(bpf_map_get_next_key(fd, &key, &next_key) == -1 &&  in test_hashmap()
175 	assert(!(expected_key_mask & key));  in test_hashmap_percpu()
176 	assert(bpf_map_update_elem(fd, &key, value, BPF_ANY) == 0);  in test_hashmap_percpu()
180 	assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 &&  in test_hashmap_percpu()
185 	assert(bpf_map_update_elem(fd, &key, value, -1) == -1 &&  in test_hashmap_percpu()
192 	assert(bpf_map_lookup_elem(fd, &key, value) == 0 &&  in test_hashmap_percpu()
197 	assert(bpf_map_lookup_elem(fd, &key, value) == -1 && errno == ENOENT);  in test_hashmap_percpu()
200 	assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == -1 &&  in test_hashmap_percpu()
205 	assert(!(expected_key_mask & key));  in test_hashmap_percpu()
206 	assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0);  in test_hashmap_percpu()
213 	assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 &&  in test_hashmap_percpu()
217 	assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);  in test_hashmap_percpu()
220 	assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 &&  in test_hashmap_percpu()
224 			assert(next_key == first_key);  in test_hashmap_percpu()
227 		assert((expected_key_mask & next_key) == next_key);  in test_hashmap_percpu()
230 		assert(bpf_map_lookup_elem(fd, &next_key, value) == 0);  in test_hashmap_percpu()
233 			assert(bpf_percpu(value, i) == i + 100);  in test_hashmap_percpu()
237 	assert(errno == ENOENT);  in test_hashmap_percpu()
241 	assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0);  in test_hashmap_percpu()
245 	assert(bpf_map_delete_elem(fd, &key) == 0);  in test_hashmap_percpu()
247 	assert(bpf_map_delete_elem(fd, &key) == 0);  in test_hashmap_percpu()
248 	assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);  in test_hashmap_percpu()
252 	assert(bpf_map_get_next_key(fd, NULL, &next_key) == -1 &&  in test_hashmap_percpu()
254 	assert(bpf_map_get_next_key(fd, &key, &next_key) == -1 &&  in test_hashmap_percpu()
275 		assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);  in test_hashmap_walk()
281 		assert(bpf_map_lookup_elem(fd, &key, &value) == 0);  in test_hashmap_walk()
284 	assert(i == max_entries);  in test_hashmap_walk()
286 	assert(bpf_map_get_next_key(fd, NULL, &key) == 0);  in test_hashmap_walk()
289 		assert(bpf_map_lookup_elem(fd, &key, &value) == 0);  in test_hashmap_walk()
291 		assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0);  in test_hashmap_walk()
295 	assert(i == max_entries);  in test_hashmap_walk()
300 		assert(bpf_map_lookup_elem(fd, &key, &value) == 0);  in test_hashmap_walk()
301 		assert(value - 1 == key);  in test_hashmap_walk()
304 	assert(i == max_entries);  in test_hashmap_walk()
323 	assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);  in test_arraymap()
326 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&  in test_arraymap()
330 	assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);  in test_arraymap()
334 	assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);  in test_arraymap()
340 	assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == -1 &&  in test_arraymap()
344 	assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);  in test_arraymap()
347 	assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&  in test_arraymap()
349 	assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&  in test_arraymap()
351 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&  in test_arraymap()
353 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 &&  in test_arraymap()
358 	assert(bpf_map_delete_elem(fd, &key) == -1 && errno == EINVAL);  in test_arraymap()
381 	assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);  in test_arraymap_percpu()
384 	assert(bpf_map_update_elem(fd, &key, values, BPF_NOEXIST) == -1 &&  in test_arraymap_percpu()
388 	assert(bpf_map_lookup_elem(fd, &key, values) == 0 &&  in test_arraymap_percpu()
393 	assert(bpf_map_lookup_elem(fd, &key, values) == 0 &&  in test_arraymap_percpu()
399 	assert(bpf_map_update_elem(fd, &key, values, BPF_EXIST) == -1 &&  in test_arraymap_percpu()
403 	assert(bpf_map_lookup_elem(fd, &key, values) == -1 && errno == ENOENT);  in test_arraymap_percpu()
406 	assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 &&  in test_arraymap_percpu()
408 	assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&  in test_arraymap_percpu()
410 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&  in test_arraymap_percpu()
412 	assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 &&  in test_arraymap_percpu()
417 	assert(bpf_map_delete_elem(fd, &key) == -1 && errno == EINVAL);  in test_arraymap_percpu()
444 		assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);  in test_arraymap_percpu_many_keys()
450 		assert(bpf_map_lookup_elem(fd, &key, values) == 0);  in test_arraymap_percpu_many_keys()
453 			assert(bpf_percpu(values, i) == i + 10);  in test_arraymap_percpu_many_keys()
917 		assert(waitpid(pid[i], &status, 0) == pid[i]);  in test_sockmap()
918 		assert(status == 0);  in test_sockmap()
988 		assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);  in test_map_large()
992 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&  in test_map_large()
996 	assert(bpf_map_get_next_key(fd, NULL, &key) == 0);  in test_map_large()
999 		assert(bpf_map_get_next_key(fd, &key, &key) == 0);  in test_map_large()
1000 	assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT);  in test_map_large()
1003 	assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);  in test_map_large()
1005 	assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);  in test_map_large()
1034 		assert(waitpid(pid[i], &status, 0) == pid[i]);  in __run_parallel()
1035 		assert(status == 0);  in __run_parallel()
1065 			assert(bpf_map_update_elem(fd, &key, &value,  in test_update_delete()
1067 			assert(bpf_map_update_elem(fd, &key, &value,  in test_update_delete()
1070 			assert(bpf_map_delete_elem(fd, &key) == 0);  in test_update_delete()
1098 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&  in test_map_parallel()
1102 	assert(bpf_map_get_next_key(fd, NULL, &key) == 0);  in test_map_parallel()
1105 		assert(bpf_map_get_next_key(fd, &key, &key) == 0);  in test_map_parallel()
1106 	assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT);  in test_map_parallel()
1112 		assert(bpf_map_lookup_elem(fd, &key, &value) == 0 &&  in test_map_parallel()
1122 	assert(bpf_map_get_next_key(fd, NULL, &key) == -1 && errno == ENOENT);  in test_map_parallel()
1123 	assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT);  in test_map_parallel()
1141 	assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == -1 &&  in test_map_rdonly()
1145 	assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);  in test_map_rdonly()
1146 	assert(bpf_map_get_next_key(fd, &key, &value) == -1 && errno == ENOENT);  in test_map_rdonly()
1164 	assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);  in test_map_wronly()
1167 	assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == EPERM);  in test_map_wronly()
1168 	assert(bpf_map_get_next_key(fd, &key, &value) == -1 && errno == EPERM);  in test_map_wronly()