Lines Matching refs:value
39 long long key, next_key, first_key, value;
42 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
50 value = 1234;
52 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
54 value = 0;
56 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
61 assert(bpf_map_update_elem(fd, &key, &value, -1) == -1 &&
65 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);
69 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);
72 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == -1 &&
77 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);
83 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
88 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0);
90 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
92 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
138 printf("Failed to create hashmap key=%d value=%d '%s'\n",
150 BPF_DECLARE_PERCPU(long, value);
156 sizeof(bpf_percpu(value, 0)), 2, map_flags);
163 bpf_percpu(value, i) = i + 100;
168 assert(bpf_map_update_elem(fd, &key, value, BPF_ANY) == 0);
172 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 &&
177 assert(bpf_map_update_elem(fd, &key, value, -1) == -1 &&
183 bpf_percpu(value, 0) = 1;
184 assert(bpf_map_lookup_elem(fd, &key, value) == 0 &&
185 bpf_percpu(value, 0) == 100);
189 assert(bpf_map_lookup_elem(fd, &key, value) == -1 && errno == ENOENT);
192 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == -1 &&
198 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0);
205 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 &&
222 assert(bpf_map_lookup_elem(fd, &next_key, value) == 0);
225 assert(bpf_percpu(value, i) == i + 100);
233 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0);
255 long long key, value;
257 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
264 key = i; value = key;
265 ret = bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST);
277 long long key, value, next_key;
285 assert(bpf_map_lookup_elem(fd, &key, &value) == 0);
293 assert(bpf_map_lookup_elem(fd, &key, &value) == 0);
294 value++;
295 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0);
304 assert(bpf_map_lookup_elem(fd, &key, &value) == 0);
305 assert(value - 1 == key);
348 long long value;
350 fd = bpf_create_map(BPF_MAP_TYPE_ARRAY, sizeof(key), sizeof(value),
358 value = 1234;
360 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
362 value = 0;
363 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
367 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);
371 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);
377 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == -1 &&
381 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);
499 __u32 key, value;
501 fd = bpf_create_map(BPF_MAP_TYPE_DEVMAP, sizeof(key), sizeof(value),
514 __u32 key, value;
516 fd = bpf_create_map(BPF_MAP_TYPE_DEVMAP_HASH, sizeof(key), sizeof(value),
661 __u32 key, value;
730 sizeof(key), sizeof(value),
1231 int fd, i, value;
1233 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
1242 value = i;
1244 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);
1248 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
1259 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);
1261 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);
1318 int i, key, value;
1321 key = value = i;
1324 assert(bpf_map_update_elem(fd, &key, &value,
1326 assert(bpf_map_update_elem(fd, &key, &value,
1336 int i, fd, key = 0, value = 0;
1339 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
1357 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
1371 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 &&
1372 value == key);
1387 int fd, key = 0, value = 0;
1389 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
1398 value = 1234;
1400 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == -1 &&
1404 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);
1405 assert(bpf_map_get_next_key(fd, &key, &value) == -1 && errno == ENOENT);
1412 int fd, key = 0, value = 0;
1414 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
1423 value = 1234;
1425 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
1428 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == EPERM);
1429 assert(bpf_map_get_next_key(fd, &key, &value) == -1 && errno == EPERM);
1436 int fd, value = 0;
1440 fd = bpf_create_map(map_type, 0, sizeof(value), MAP_SIZE,
1452 value = 1234;
1453 assert(bpf_map_update_elem(fd, NULL, &value, BPF_ANY) == 0);
1456 assert(bpf_map_lookup_elem(fd, NULL, &value) == -1 && errno == EPERM);
1459 assert(bpf_map_lookup_and_delete_elem(fd, NULL, &value) == -1 &&
1482 void *value;
1506 value = &fd64;
1510 value = &fd32;
1512 err = bpf_map_update_elem(map_fd, &index0, value, BPF_ANY);
1540 err = bpf_map_update_elem(map_fd, &index0, value,
1703 /* Close the 64 bit value map */