Lines Matching refs:value
39 long long key, next_key, first_key, value; in test_hashmap() local
42 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value), in test_hashmap()
50 value = 1234; in test_hashmap()
52 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_hashmap()
54 value = 0; in test_hashmap()
56 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 && in test_hashmap()
61 assert(bpf_map_update_elem(fd, &key, &value, -1) == -1 && in test_hashmap()
65 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234); in test_hashmap()
69 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT); in test_hashmap()
72 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == -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()
88 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0); in test_hashmap()
90 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_hashmap()
92 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 && in test_hashmap()
150 BPF_DECLARE_PERCPU(long, value); in test_hashmap_percpu()
156 sizeof(bpf_percpu(value, 0)), 2, map_flags); in test_hashmap_percpu()
163 bpf_percpu(value, i) = i + 100; in test_hashmap_percpu()
168 assert(bpf_map_update_elem(fd, &key, value, BPF_ANY) == 0); in test_hashmap_percpu()
172 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 && in test_hashmap_percpu()
177 assert(bpf_map_update_elem(fd, &key, value, -1) == -1 && in test_hashmap_percpu()
183 bpf_percpu(value, 0) = 1; in test_hashmap_percpu()
184 assert(bpf_map_lookup_elem(fd, &key, value) == 0 && in test_hashmap_percpu()
185 bpf_percpu(value, 0) == 100); in test_hashmap_percpu()
189 assert(bpf_map_lookup_elem(fd, &key, value) == -1 && errno == ENOENT); in test_hashmap_percpu()
192 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == -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()
222 assert(bpf_map_lookup_elem(fd, &next_key, value) == 0); in test_hashmap_percpu()
225 assert(bpf_percpu(value, i) == i + 100); in test_hashmap_percpu()
233 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0); in test_hashmap_percpu()
255 long long key, value; in helper_fill_hashmap() local
257 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value), in helper_fill_hashmap()
264 key = i; value = key; in helper_fill_hashmap()
265 ret = bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST); in helper_fill_hashmap()
277 long long key, value, next_key; in test_hashmap_walk() local
285 assert(bpf_map_lookup_elem(fd, &key, &value) == 0); in test_hashmap_walk()
293 assert(bpf_map_lookup_elem(fd, &key, &value) == 0); in test_hashmap_walk()
294 value++; in test_hashmap_walk()
295 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0); in test_hashmap_walk()
304 assert(bpf_map_lookup_elem(fd, &key, &value) == 0); in test_hashmap_walk()
305 assert(value - 1 == key); in test_hashmap_walk()
348 long long value; in test_arraymap() local
350 fd = bpf_create_map(BPF_MAP_TYPE_ARRAY, sizeof(key), sizeof(value), in test_arraymap()
358 value = 1234; in test_arraymap()
360 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_arraymap()
362 value = 0; in test_arraymap()
363 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 && in test_arraymap()
367 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234); in test_arraymap()
371 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0); in test_arraymap()
377 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == -1 && in test_arraymap()
381 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT); in test_arraymap()
499 __u32 key, value; in test_devmap() local
501 fd = bpf_create_map(BPF_MAP_TYPE_DEVMAP, sizeof(key), sizeof(value), in test_devmap()
514 __u32 key, value; in test_devmap_hash() local
516 fd = bpf_create_map(BPF_MAP_TYPE_DEVMAP_HASH, sizeof(key), sizeof(value), in test_devmap_hash()
661 __u32 key, value; in test_sockmap() local
730 sizeof(key), sizeof(value), in test_sockmap()
1239 int fd, i, value; in test_map_large() local
1241 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value), in test_map_large()
1250 value = i; in test_map_large()
1252 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0); in test_map_large()
1256 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 && in test_map_large()
1267 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0); in test_map_large()
1269 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT); in test_map_large()
1326 int i, key, value; in test_update_delete() local
1329 key = value = i; in test_update_delete()
1332 assert(bpf_map_update_elem(fd, &key, &value, in test_update_delete()
1334 assert(bpf_map_update_elem(fd, &key, &value, in test_update_delete()
1344 int i, fd, key = 0, value = 0; in test_map_parallel() local
1347 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value), in test_map_parallel()
1365 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 && in test_map_parallel()
1379 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && in test_map_parallel()
1380 value == key); in test_map_parallel()
1395 int fd, key = 0, value = 0; in test_map_rdonly() local
1397 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value), in test_map_rdonly()
1406 value = 1234; in test_map_rdonly()
1408 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == -1 && in test_map_rdonly()
1412 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT); in test_map_rdonly()
1413 assert(bpf_map_get_next_key(fd, &key, &value) == -1 && errno == ENOENT); in test_map_rdonly()
1418 int fd, key = 0, value = 0; in test_map_wronly() local
1420 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value), in test_map_wronly()
1429 value = 1234; in test_map_wronly()
1431 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_map_wronly()
1434 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == EPERM); in test_map_wronly()
1435 assert(bpf_map_get_next_key(fd, &key, &value) == -1 && errno == EPERM); in test_map_wronly()
1448 void *value; in prepare_reuseport_grp() local
1472 value = &fd64; in prepare_reuseport_grp()
1476 value = &fd32; in prepare_reuseport_grp()
1478 err = bpf_map_update_elem(map_fd, &index0, value, BPF_ANY); in prepare_reuseport_grp()
1506 err = bpf_map_update_elem(map_fd, &index0, value, in prepare_reuseport_grp()