51 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 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()
94 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&  in test_hashmap()
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()
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()
277 		ret = bpf_map_update_elem(fd, &key, value, BPF_NOEXIST);  in helper_fill_hashmap()
374 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&  in test_arraymap()
432 	assert(bpf_map_update_elem(fd, &key, values, BPF_NOEXIST) < 0 &&  in test_arraymap_percpu()
1011 	err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_NOEXIST);  in test_sockmap()
1059 		err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_NOEXIST);  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()
1453 			err = map_update_retriable(fd, &key, &value, BPF_NOEXIST, MAP_RETRIES,  in test_update_delete()
1496 	assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&  in test_map_parallel()
1775 					  BPF_NOEXIST);  in test_reuseport_array()
1792 					  BPF_NOEXIST);  in test_reuseport_array()
1829 		err = bpf_map_update_elem(map_fd, &index3, &fd64, BPF_NOEXIST);  in test_reuseport_array()
1855 	err = bpf_map_update_elem(map_fd, &index3, &fd64, BPF_NOEXIST);  in test_reuseport_array()
1871 	err = bpf_map_update_elem(map_fd, &index3, &fd, BPF_NOEXIST);  in test_reuseport_array()