BPF_EXIST
if (idx < 0 && flags == BPF_EXIST) {
if (unlikely((map_flags & ~BPF_F_LOCK) > BPF_EXIST))
if (!old_sdata && (map_flags & ~BPF_F_LOCK) == BPF_EXIST)
if (unlikely((map_flags & ~BPF_F_LOCK) > BPF_EXIST) ||
if (unlikely(map_flags > BPF_EXIST))
if (unlikely(map_flags > BPF_EXIST || !val.ifindex))
if (unlikely(map_flags > BPF_EXIST))
if (!l_old && (map_flags & ~BPF_F_LOCK) == BPF_EXIST)
if (unlikely((map_flags & ~BPF_F_LOCK) > BPF_EXIST))
if (unlikely(map_flags > BPF_EXIST))
if (unlikely(!onallcpus && map_flags > BPF_EXIST))
if (map_flags != BPF_EXIST) {
if (unlikely((map_flags & ~BPF_F_LOCK) > BPF_EXIST))
if (map_flags & BPF_EXIST)
if (unlikely(flags & ~(BPF_F_LOCK | BPF_EXIST)))
if ((u32)map_flags & ~(BPF_ANY | BPF_EXIST | BPF_F_CPU | BPF_F_ALL_CPUS))
if (flags == BPF_EXIST)
if (unlikely(flags > BPF_EXIST))
if (unlikely(flags > BPF_EXIST))
bool replace = (flags & BPF_EXIST);
if (flags & BPF_NOEXIST || flags > BPF_EXIST)
if (!osk && map_flags == BPF_EXIST)
if (map_flags > BPF_EXIST)
if (unlikely(flags > BPF_EXIST))
} else if (!elem && flags == BPF_EXIST) {
if (unlikely(flags > BPF_EXIST))
} else if (!osk && flags == BPF_EXIST) {
if (unlikely(map_flags > BPF_EXIST))
} else if (!old_xs && map_flags == BPF_EXIST) {
bpf_map_update_elem(lru->map_fd, &node->key, &null_node, BPF_EXIST);
assert(!bpf_map_update_elem(lru->map_fd, &key, &node, BPF_EXIST));
*flags = BPF_EXIST;
bpf_map_update_elem(map_fd, &stat_key, &stat_data, BPF_EXIST);
flags = i % 2 ? 0 : BPF_EXIST;
err = bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST | BPF_EXIST);
err = bpf_map_update_elem(fd, &key, &value, BPF_EXIST);
err = bpf_map_update_elem(fd, &key, &value, BPF_EXIST);
err = bpf_map_update_elem(fd, &key, &value, BPF_EXIST);
err = bpf_map_update_elem(fd, &key, &value, BPF_EXIST);
err = bpf_map_update_elem(fd, &key, &value, BPF_EXIST);
BPF_EXIST | BPF_F_LOCK);
err = bpf_map_update_elem(map_fd, &sk_fd, &value, BPF_EXIST);
err = bpf_map_update_elem(fd, NULL, &value, BPF_EXIST);
err = bpf_map_update_elem(ctx->fd, &key, &inner_fd, BPF_EXIST);
BPF_F_LOCK | BPF_EXIST);
err = bpf_map_update_elem(outer_fd, &key, &inner_fd, BPF_EXIST);
err = xbpf_map_update_elem(sock_map, &key, &value, BPF_EXIST);
xbpf_map_update_elem(mapfd, &key, &value, BPF_EXIST);
err = bpf_map_update_elem(map_fd, &parent_task_fd, &value, BPF_EXIST);
err = bpf_map_update_elem(map_fd, &parent_task_fd, &value, BPF_EXIST);
err = bpf_map_update_elem(map_fd, &parent_task_fd, &value, BPF_EXIST);
err = bpf_map_update_elem(map_fd, &task_fd, &value, BPF_EXIST);
bpf_map_update_elem(&testbuf_hash, name, &t, BPF_EXIST);
err = bpf_map_update_elem(&trie_map, &key, &val, BPF_EXIST);
ret = bpf_map_update_elem(&array_map, &key, &init, BPF_EXIST);
ret = bpf_map_update_elem(&map, &key, &init, BPF_EXIST); \
ret = bpf_map_update_elem(&rhmap, &key, &val1, BPF_EXIST);
ret = bpf_map_update_elem(&rhmap, &key, &val2, BPF_EXIST);
if (bpf_map_update_elem(&flow_map, &key, &next_tstamp, BPF_EXIST))
assert(bpf_map_update_elem(lru_map_fd, &key, value, BPF_EXIST) == -ENOENT);
BPF_EXIST));
assert(bpf_map_update_elem(lru_map_fd, &key, value, BPF_EXIST) == -ENOENT);
assert(bpf_map_update_elem(lru_map_fd, &key, value, BPF_EXIST) == -ENOENT);
err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_EXIST);
err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_EXIST);
err = map_update_retriable(fd, &key, &value, BPF_EXIST, MAP_RETRIES,
BPF_EXIST);
BPF_EXIST);
assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) < 0 &&
assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0);
assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0);
assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) < 0 &&
assert(bpf_map_update_elem(fd, &key, values, BPF_EXIST) < 0 &&
assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0);
assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0);
assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) < 0 &&
assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0);