64 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -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()
100 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&  in test_hashmap()
180 	assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 &&  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()
275 		assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);  in test_hashmap_walk()
326 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&  in test_arraymap()
384 	assert(bpf_map_update_elem(fd, &key, values, BPF_NOEXIST) == -1 &&  in test_arraymap_percpu()
833 	err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_NOEXIST);  in test_sockmap()
881 		err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_NOEXIST);  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()
1066 						   BPF_NOEXIST) == 0);  in test_update_delete()
1098 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&  in test_map_parallel()
1309 					  BPF_NOEXIST);  in test_reuseport_array()
1326 					  BPF_NOEXIST);  in test_reuseport_array()
1363 		err = bpf_map_update_elem(map_fd, &index3, &fd64, BPF_NOEXIST);  in test_reuseport_array()
1389 	err = bpf_map_update_elem(map_fd, &index3, &fd64, BPF_NOEXIST);  in test_reuseport_array()
1404 	err = bpf_map_update_elem(map_fd, &index3, &fd, BPF_NOEXIST);  in test_reuseport_array()