56 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&  in test_hashmap()
77 	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) == -1 &&  in test_hashmap()
92 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&  in test_hashmap()
172 	assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 &&  in test_hashmap_percpu()
198 	assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0);  in test_hashmap_percpu()
205 	assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 &&  in test_hashmap_percpu()
265 		ret = bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST);  in helper_fill_hashmap()
363 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&  in test_arraymap()
421 	assert(bpf_map_update_elem(fd, &key, values, BPF_NOEXIST) == -1 &&  in test_arraymap_percpu()
1005 	err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_NOEXIST);  in test_sockmap()
1053 		err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_NOEXIST);  in test_sockmap()
1244 		assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);  in test_map_large()
1248 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&  in test_map_large()
1325 						   BPF_NOEXIST) == 0);  in test_update_delete()
1357 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&  in test_map_parallel()
1618 					  BPF_NOEXIST);  in test_reuseport_array()
1635 					  BPF_NOEXIST);  in test_reuseport_array()
1672 		err = bpf_map_update_elem(map_fd, &index3, &fd64, BPF_NOEXIST);  in test_reuseport_array()
1698 	err = bpf_map_update_elem(map_fd, &index3, &fd64, BPF_NOEXIST);  in test_reuseport_array()
1714 	err = bpf_map_update_elem(map_fd, &index3, &fd, BPF_NOEXIST);  in test_reuseport_array()