Lines Matching refs:key
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()
49 key = 1; in test_hashmap()
52 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_hashmap()
56 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 && in test_hashmap()
61 assert(bpf_map_update_elem(fd, &key, &value, -1) < 0 && in test_hashmap()
65 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234); in test_hashmap()
67 key = 2; in test_hashmap()
70 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_hashmap()
73 assert(bpf_map_lookup_and_delete_elem(fd, &key, &value) == 0 && value == 1234); in test_hashmap()
76 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT); in test_hashmap()
79 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) < 0 && in test_hashmap()
84 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0); in test_hashmap()
89 key = 0; in test_hashmap()
90 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 && in test_hashmap()
94 key = 1; in test_hashmap()
95 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0); in test_hashmap()
96 key = 2; in test_hashmap()
97 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_hashmap()
98 key = 3; in test_hashmap()
99 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 && in test_hashmap()
103 key = 0; in test_hashmap()
104 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT); in test_hashmap()
109 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 && in test_hashmap()
118 key = 1; in test_hashmap()
119 assert(bpf_map_delete_elem(fd, &key) == 0); in test_hashmap()
120 key = 2; in test_hashmap()
121 assert(bpf_map_delete_elem(fd, &key) == 0); in test_hashmap()
122 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT); in test_hashmap()
124 key = 0; in test_hashmap()
128 assert(bpf_map_get_next_key(fd, &key, &next_key) < 0 && in test_hashmap()
158 long long key, next_key, first_key; in test_hashmap_percpu() local
162 fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_HASH, sizeof(key), in test_hashmap_percpu()
172 key = 1; in test_hashmap_percpu()
174 assert(!(expected_key_mask & key)); in test_hashmap_percpu()
175 assert(bpf_map_update_elem(fd, &key, value, BPF_ANY) == 0); in test_hashmap_percpu()
178 assert(bpf_map_lookup_and_delete_elem(fd, &key, value) == 0 && in test_hashmap_percpu()
185 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0); in test_hashmap_percpu()
186 expected_key_mask |= key; in test_hashmap_percpu()
189 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) < 0 && in test_hashmap_percpu()
194 assert(bpf_map_update_elem(fd, &key, value, -1) < 0 && in test_hashmap_percpu()
201 assert(bpf_map_lookup_elem(fd, &key, value) == 0 && in test_hashmap_percpu()
204 key = 2; in test_hashmap_percpu()
206 assert(bpf_map_lookup_elem(fd, &key, value) < 0 && errno == ENOENT); in test_hashmap_percpu()
209 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) < 0 && in test_hashmap_percpu()
214 assert(!(expected_key_mask & key)); in test_hashmap_percpu()
215 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0); in test_hashmap_percpu()
216 expected_key_mask |= key; in test_hashmap_percpu()
221 key = 0; in test_hashmap_percpu()
222 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) < 0 && in test_hashmap_percpu()
226 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT); in test_hashmap_percpu()
231 while (!bpf_map_get_next_key(fd, &key, &next_key)) { in test_hashmap_percpu()
244 key = next_key; in test_hashmap_percpu()
249 key = 1; in test_hashmap_percpu()
250 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0); in test_hashmap_percpu()
253 key = 1; in test_hashmap_percpu()
254 assert(bpf_map_delete_elem(fd, &key) == 0); in test_hashmap_percpu()
255 key = 2; in test_hashmap_percpu()
256 assert(bpf_map_delete_elem(fd, &key) == 0); in test_hashmap_percpu()
257 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == ENOENT); in test_hashmap_percpu()
259 key = 0; in test_hashmap_percpu()
263 assert(bpf_map_get_next_key(fd, &key, &next_key) < 0 && in test_hashmap_percpu()
272 long long key, value; in helper_fill_hashmap() local
274 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value), in helper_fill_hashmap()
281 key = i; value = key; in helper_fill_hashmap()
282 ret = bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST); in helper_fill_hashmap()
294 long long key, value, next_key; in test_hashmap_walk() local
299 for (i = 0; bpf_map_get_next_key(fd, !i ? NULL : &key, in test_hashmap_walk()
301 key = next_key; in test_hashmap_walk()
302 assert(bpf_map_lookup_elem(fd, &key, &value) == 0); in test_hashmap_walk()
307 assert(bpf_map_get_next_key(fd, NULL, &key) == 0); in test_hashmap_walk()
309 next_key_valid = bpf_map_get_next_key(fd, &key, &next_key) == 0; in test_hashmap_walk()
310 assert(bpf_map_lookup_elem(fd, &key, &value) == 0); in test_hashmap_walk()
312 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0); in test_hashmap_walk()
313 key = next_key; in test_hashmap_walk()
318 for (i = 0; bpf_map_get_next_key(fd, !i ? NULL : &key, in test_hashmap_walk()
320 key = next_key; in test_hashmap_walk()
321 assert(bpf_map_lookup_elem(fd, &key, &value) == 0); in test_hashmap_walk()
322 assert(value - 1 == key); in test_hashmap_walk()
332 long long key, next_first, next_second; in test_hashmap_zero_seed() local
341 void *key_ptr = !i ? NULL : &key; in test_hashmap_zero_seed()
354 key = next_first; in test_hashmap_zero_seed()
364 int key, next_key, fd; in test_arraymap() local
367 fd = bpf_create_map(BPF_MAP_TYPE_ARRAY, sizeof(key), sizeof(value), in test_arraymap()
374 key = 1; in test_arraymap()
377 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_arraymap()
380 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 && in test_arraymap()
384 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234); in test_arraymap()
386 key = 0; in test_arraymap()
388 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0); in test_arraymap()
393 key = 2; in test_arraymap()
394 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) < 0 && in test_arraymap()
398 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT); in test_arraymap()
403 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 && in test_arraymap()
411 key = 1; in test_arraymap()
412 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == EINVAL); in test_arraymap()
421 int key, next_key, fd, i; in test_arraymap_percpu() local
423 fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_ARRAY, sizeof(key), in test_arraymap_percpu()
433 key = 1; in test_arraymap_percpu()
435 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0); in test_arraymap_percpu()
438 assert(bpf_map_update_elem(fd, &key, values, BPF_NOEXIST) < 0 && in test_arraymap_percpu()
442 assert(bpf_map_lookup_elem(fd, &key, values) == 0 && in test_arraymap_percpu()
445 key = 0; in test_arraymap_percpu()
447 assert(bpf_map_lookup_elem(fd, &key, values) == 0 && in test_arraymap_percpu()
452 key = 2; in test_arraymap_percpu()
453 assert(bpf_map_update_elem(fd, &key, values, BPF_EXIST) < 0 && in test_arraymap_percpu()
457 assert(bpf_map_lookup_elem(fd, &key, values) < 0 && errno == ENOENT); in test_arraymap_percpu()
462 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 && in test_arraymap_percpu()
470 key = 1; in test_arraymap_percpu()
471 assert(bpf_map_delete_elem(fd, &key) < 0 && errno == EINVAL); in test_arraymap_percpu()
484 int key, fd, i; in test_arraymap_percpu_many_keys() local
486 fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_ARRAY, sizeof(key), in test_arraymap_percpu_many_keys()
497 for (key = 0; key < nr_keys; key++) in test_arraymap_percpu_many_keys()
498 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0); in test_arraymap_percpu_many_keys()
500 for (key = 0; key < nr_keys; key++) { in test_arraymap_percpu_many_keys()
504 assert(bpf_map_lookup_elem(fd, &key, values) == 0); in test_arraymap_percpu_many_keys()
516 __u32 key, value; in test_devmap() local
518 fd = bpf_create_map(BPF_MAP_TYPE_DEVMAP, sizeof(key), sizeof(value), in test_devmap()
531 __u32 key, value; in test_devmap_hash() local
533 fd = bpf_create_map(BPF_MAP_TYPE_DEVMAP_HASH, sizeof(key), sizeof(value), in test_devmap_hash()
678 __u32 key, value; in test_sockmap() local
747 sizeof(key), sizeof(value), in test_sockmap()
1314 } key; in test_map_large() local
1317 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value), in test_map_large()
1325 key = (struct bigkey) { .c = i }; in test_map_large()
1328 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0); in test_map_large()
1331 key.c = -1; in test_map_large()
1332 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 && in test_map_large()
1336 assert(bpf_map_get_next_key(fd, NULL, &key) == 0); in test_map_large()
1337 key.c = -1; in test_map_large()
1339 assert(bpf_map_get_next_key(fd, &key, &key) == 0); in test_map_large()
1340 assert(bpf_map_get_next_key(fd, &key, &key) < 0 && errno == ENOENT); in test_map_large()
1342 key.c = 0; in test_map_large()
1343 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0); in test_map_large()
1344 key.a = 1; in test_map_large()
1345 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT); in test_map_large()
1402 static int map_update_retriable(int map_fd, const void *key, const void *value, in map_update_retriable() argument
1407 while (bpf_map_update_elem(map_fd, key, value, flags)) { in map_update_retriable()
1421 static int map_delete_retriable(int map_fd, const void *key, int attempts) in map_delete_retriable() argument
1425 while (bpf_map_delete_elem(map_fd, key)) { in map_delete_retriable()
1443 int i, key, value, err; in test_update_delete() local
1446 key = value = i; in test_update_delete()
1449 err = map_update_retriable(fd, &key, &value, BPF_NOEXIST, MAP_RETRIES); in test_update_delete()
1453 err = map_update_retriable(fd, &key, &value, BPF_EXIST, MAP_RETRIES); in test_update_delete()
1458 err = map_delete_retriable(fd, &key, MAP_RETRIES); in test_update_delete()
1468 int i, fd, key = 0, value = 0; in test_map_parallel() local
1471 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value), in test_map_parallel()
1489 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 && in test_map_parallel()
1493 assert(bpf_map_get_next_key(fd, NULL, &key) == 0); in test_map_parallel()
1494 key = -1; in test_map_parallel()
1496 assert(bpf_map_get_next_key(fd, &key, &key) == 0); in test_map_parallel()
1497 assert(bpf_map_get_next_key(fd, &key, &key) < 0 && errno == ENOENT); in test_map_parallel()
1501 key = MAP_SIZE - i - 1; in test_map_parallel()
1503 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && in test_map_parallel()
1504 value == key); in test_map_parallel()
1512 key = -1; in test_map_parallel()
1513 assert(bpf_map_get_next_key(fd, NULL, &key) < 0 && errno == ENOENT); in test_map_parallel()
1514 assert(bpf_map_get_next_key(fd, &key, &key) < 0 && errno == ENOENT); in test_map_parallel()
1519 int fd, key = 0, value = 0; in test_map_rdonly() local
1521 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value), in test_map_rdonly()
1529 key = 1; in test_map_rdonly()
1532 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) < 0 && in test_map_rdonly()
1536 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT); in test_map_rdonly()
1537 assert(bpf_map_get_next_key(fd, &key, &value) < 0 && errno == ENOENT); in test_map_rdonly()
1544 int fd, key = 0, value = 0; in test_map_wronly_hash() local
1546 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value), in test_map_wronly_hash()
1554 key = 1; in test_map_wronly_hash()
1557 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0); in test_map_wronly_hash()
1560 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == EPERM); in test_map_wronly_hash()
1561 assert(bpf_map_get_next_key(fd, &key, &value) < 0 && errno == EPERM); in test_map_wronly_hash()