Lines Matching refs:bpf_map_update_elem
47 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_hashmap()
51 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 && in test_hashmap()
56 assert(bpf_map_update_elem(fd, &key, &value, -1) < 0 && in test_hashmap()
65 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_hashmap()
74 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) < 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()
90 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0); in test_hashmap()
92 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_hashmap()
94 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 && in test_hashmap()
169 assert(bpf_map_update_elem(fd, &key, value, BPF_ANY) == 0); in test_hashmap_percpu()
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()
188 assert(bpf_map_update_elem(fd, &key, value, -1) < 0 && in test_hashmap_percpu()
203 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) < 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()
244 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0); in test_hashmap_percpu()
277 ret = bpf_map_update_elem(fd, &key, value, BPF_NOEXIST); in helper_fill_hashmap()
307 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0); in test_hashmap_walk()
371 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_arraymap()
374 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 && in test_arraymap()
388 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) < 0 && in test_arraymap()
429 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0); in test_arraymap_percpu()
432 assert(bpf_map_update_elem(fd, &key, values, BPF_NOEXIST) < 0 && in test_arraymap_percpu()
447 assert(bpf_map_update_elem(fd, &key, values, BPF_EXIST) < 0 && in test_arraymap_percpu()
492 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0); in test_arraymap_percpu_many_keys()
562 assert(bpf_map_update_elem(fd, NULL, &vals[i], 0) == 0); in test_queuemap()
565 assert(bpf_map_update_elem(fd, NULL, &val, 0) < 0 && in test_queuemap()
573 assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0); in test_queuemap()
618 assert(bpf_map_update_elem(fd, NULL, &vals[i], 0) == 0); in test_stackmap()
621 assert(bpf_map_update_elem(fd, NULL, &val, 0) < 0 && in test_stackmap()
629 assert(bpf_map_update_elem(fd, NULL, &vals[i], BPF_EXIST) == 0); in test_stackmap()
754 err = bpf_map_update_elem(fd, &i, &udp, BPF_ANY); in test_sockmap()
764 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_ANY); in test_sockmap()
927 err = bpf_map_update_elem(map_fd_rx, &i, &sfd[i], BPF_ANY); in test_sockmap()
933 err = bpf_map_update_elem(map_fd_tx, &i, &sfd[i], BPF_ANY); in test_sockmap()
959 err = bpf_map_update_elem(map_fd_msg, &i, &sfd[2], BPF_ANY); in test_sockmap()
1011 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_NOEXIST); in test_sockmap()
1017 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_ANY); in test_sockmap()
1023 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_EXIST); in test_sockmap()
1053 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_ANY); in test_sockmap()
1059 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_NOEXIST); in test_sockmap()
1065 err = bpf_map_update_elem(fd, &i, &sfd[i], BPF_EXIST); in test_sockmap()
1080 bpf_map_update_elem(map_fd_tx, &i, in test_sockmap()
1082 bpf_map_update_elem(map_fd_rx, &i, in test_sockmap()
1206 err = bpf_map_update_elem(mim_fd, &pos, &fd, 0); in test_map_in_map()
1223 err = bpf_map_update_elem(mim_fd, &pos, &fd, 0); in test_map_in_map()
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()
1410 while (bpf_map_update_elem(map_fd, key, value, flags)) { in map_update_retriable()
1497 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 && in test_map_parallel()
1550 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) < 0 && in test_map_rdonly()
1579 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_map_wronly_hash()
1611 assert(bpf_map_update_elem(fd, NULL, &value, BPF_ANY) == 0); in test_map_wronly_stack_or_queue()
1670 err = bpf_map_update_elem(map_fd, &index0, value, BPF_ANY); in prepare_reuseport_grp()
1698 err = bpf_map_update_elem(map_fd, &index0, value, in prepare_reuseport_grp()
1738 err = bpf_map_update_elem(map_fd, &bad_index, &fd64, BPF_ANY); in test_reuseport_array()
1766 err = bpf_map_update_elem(map_fd, &index3, &grpa_fds64[fds_idx], in test_reuseport_array()
1775 err = bpf_map_update_elem(map_fd, &index3, &grpa_fds64[fds_idx], in test_reuseport_array()
1784 err = bpf_map_update_elem(map_fd, &index3, &grpa_fds64[fds_idx], in test_reuseport_array()
1792 err = bpf_map_update_elem(map_fd, &index3, &grpa_fds64[fds_idx], in test_reuseport_array()
1801 err = bpf_map_update_elem(map_fd, &index3, &grpa_fds64[fds_idx], in test_reuseport_array()
1811 err = bpf_map_update_elem(map_fd, &index3, &fd64, BPF_ANY); in test_reuseport_array()
1817 err = bpf_map_update_elem(map_fd, &index0, &fd64, BPF_ANY); in test_reuseport_array()
1830 err = bpf_map_update_elem(map_fd, &index3, &fd64, BPF_NOEXIST); in test_reuseport_array()
1856 err = bpf_map_update_elem(map_fd, &index3, &fd64, BPF_NOEXIST); in test_reuseport_array()
1872 err = bpf_map_update_elem(map_fd, &index3, &fd, BPF_NOEXIST); in test_reuseport_array()