Lines Matching defs:value
39 long long key, next_key, first_key, value;
42 fd = bpf_map_create(BPF_MAP_TYPE_HASH, NULL, sizeof(key), sizeof(value), 2, &map_opts);
49 value = 1234;
51 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
53 value = 0;
55 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&
60 assert(bpf_map_update_elem(fd, &key, &value, -1) < 0 &&
64 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);
67 value = 1234;
69 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
71 /* Check that key=2 matches the value and delete it */
72 assert(bpf_map_lookup_and_delete_elem(fd, &key, &value) == 0 && value == 1234);
75 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT);
78 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) < 0 &&
83 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);
89 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&
94 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0);
96 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
98 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&
143 printf("Failed to create hashmap key=%d value=%d '%s'\n",
155 BPF_DECLARE_PERCPU(long, value);
161 sizeof(bpf_percpu(value, 0)), 2, &map_opts);
168 bpf_percpu(value, i) = i + 100;
173 assert(bpf_map_update_elem(fd, &key, value, BPF_ANY) == 0);
175 /* Lookup and delete elem key=1 and check value. */
176 assert(bpf_map_lookup_and_delete_elem(fd, &key, value) == 0 &&
177 bpf_percpu(value,0) == 100);
180 bpf_percpu(value,i) = i + 100;
183 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0);
187 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) < 0 &&
192 assert(bpf_map_update_elem(fd, &key, value, -1) < 0 &&
198 bpf_percpu(value, 0) = 1;
199 assert(bpf_map_lookup_elem(fd, &key, value) == 0 &&
200 bpf_percpu(value, 0) == 100);
204 assert(bpf_map_lookup_elem(fd, &key, value) < 0 && errno == ENOENT);
207 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) < 0 &&
213 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0);
220 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) < 0 &&
237 assert(bpf_map_lookup_elem(fd, &next_key, value) == 0);
240 assert(bpf_percpu(value, i) == i + 100);
248 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0);
271 long long key, value[VALUE_SIZE] = {};
273 fd = bpf_map_create(BPF_MAP_TYPE_HASH, NULL, sizeof(key), sizeof(value),
280 key = i; value[0] = key;
281 ret = bpf_map_update_elem(fd, &key, value, BPF_NOEXIST);
293 long long key, value[VALUE_SIZE], next_key;
301 assert(bpf_map_lookup_elem(fd, &key, value) == 0);
309 assert(bpf_map_lookup_elem(fd, &key, value) == 0);
310 value[0]++;
311 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0);
320 assert(bpf_map_lookup_elem(fd, &key, value) == 0);
321 assert(value[0] - 1 == key);
364 long long value;
366 fd = bpf_map_create(BPF_MAP_TYPE_ARRAY, NULL, sizeof(key), sizeof(value), 2, NULL);
373 value = 1234;
375 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
377 value = 0;
378 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&
382 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);
386 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);
392 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) < 0 &&
396 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT);
514 __u32 key, value;
516 fd = bpf_map_create(BPF_MAP_TYPE_DEVMAP, NULL, sizeof(key), sizeof(value), 2, NULL);
528 __u32 key, value;
530 fd = bpf_map_create(BPF_MAP_TYPE_DEVMAP_HASH, NULL, sizeof(key), sizeof(value), 2, NULL);
670 __u32 key, value;
739 sizeof(key), sizeof(value),
1316 int fd, i, value;
1318 fd = bpf_map_create(BPF_MAP_TYPE_HASH, NULL, sizeof(key), sizeof(value),
1327 value = i;
1329 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);
1333 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&
1344 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);
1346 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT);
1403 static int map_update_retriable(int map_fd, const void *key, const void *value,
1408 while (bpf_map_update_elem(map_fd, key, value, flags)) {
1444 int i, key, value, err;
1449 key = value = i;
1452 err = map_update_retriable(fd, &key, &value, BPF_NOEXIST, MAP_RETRIES);
1456 err = map_update_retriable(fd, &key, &value, BPF_EXIST, MAP_RETRIES);
1471 int i, fd, key = 0, value = 0, j = 0;
1474 fd = bpf_map_create(BPF_MAP_TYPE_HASH, NULL, sizeof(key), sizeof(value),
1493 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) < 0 &&
1507 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 &&
1508 value == key);
1529 int fd, key = 0, value = 0;
1534 fd = bpf_map_create(BPF_MAP_TYPE_HASH, NULL, sizeof(key), sizeof(value),
1544 value = 1234;
1546 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) < 0 &&
1550 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == ENOENT);
1551 assert(bpf_map_get_next_key(fd, &key, &value) < 0 && errno == ENOENT);
1558 int fd, key = 0, value = 0;
1563 fd = bpf_map_create(BPF_MAP_TYPE_HASH, NULL, sizeof(key), sizeof(value),
1573 value = 1234;
1575 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
1578 assert(bpf_map_lookup_elem(fd, &key, &value) < 0 && errno == EPERM);
1579 assert(bpf_map_get_next_key(fd, &key, &value) < 0 && errno == EPERM);
1586 int fd, value = 0;
1594 fd = bpf_map_create(map_type, NULL, 0, sizeof(value), MAP_SIZE, &map_opts);
1606 value = 1234;
1607 assert(bpf_map_update_elem(fd, NULL, &value, BPF_ANY) == 0);
1610 assert(bpf_map_lookup_elem(fd, NULL, &value) < 0 && errno == EPERM);
1613 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &value) < 0 &&
1636 void *value;
1660 value = &fd64;
1664 value = &fd32;
1666 err = bpf_map_update_elem(map_fd, &index0, value, BPF_ANY);
1694 err = bpf_map_update_elem(map_fd, &index0, value,
1857 /* Close the 64 bit value map */