55 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&  in test_hashmap()
83 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);  in test_hashmap()
89 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&  in test_hashmap()
98 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&  in test_hashmap()
183 	assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0);  in test_hashmap_percpu()
187 	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) == 0);  in test_hashmap_percpu()
220 	assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) < 0 &&  in test_hashmap_percpu()
281 		ret = bpf_map_update_elem(fd, &key, value, BPF_NOEXIST);  in helper_fill_hashmap()
378 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&  in test_arraymap()
436 	assert(bpf_map_update_elem(fd, &key, values, BPF_NOEXIST) < 0 &&  in test_arraymap_percpu()
1015 	err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_NOEXIST);  in test_sockmap()
1063 		err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_NOEXIST);  in test_sockmap()
1329 		assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);  in test_map_large()
1333 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&  in test_map_large()
1452 			err = map_update_retriable(fd, &key, &value, BPF_NOEXIST, MAP_RETRIES);  in test_update_delete()
1493 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&  in test_map_parallel()
1772 					  BPF_NOEXIST);  in test_reuseport_array()
1789 					  BPF_NOEXIST);  in test_reuseport_array()
1826 		err = bpf_map_update_elem(map_fd, &index3, &fd64, BPF_NOEXIST);  in test_reuseport_array()
1852 	err = bpf_map_update_elem(map_fd, &index3, &fd64, BPF_NOEXIST);  in test_reuseport_array()
1868 	err = bpf_map_update_elem(map_fd, &index3, &fd, BPF_NOEXIST);  in test_reuseport_array()