Lines Matching defs:key
39 long long key, next_key, first_key, value;
42 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
49 key = 1;
51 /* Insert key=1 element. */
52 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
56 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
57 /* key=1 already exists. */
61 assert(bpf_map_update_elem(fd, &key, &value, -1) == -1 &&
64 /* Check that key=1 can be found. */
65 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);
67 key = 2;
68 /* Check that key=2 is not found. */
69 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);
72 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == -1 &&
73 /* key=2 is not there. */
76 /* Insert key=2 element. */
77 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);
79 /* key=1 and key=2 were inserted, check that key=0 cannot be
82 key = 0;
83 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
87 key = 1;
88 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0);
89 key = 2;
90 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
91 key = 3;
92 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
95 /* Check that key = 0 doesn't exist. */
96 key = 0;
97 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
102 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
111 key = 1;
112 assert(bpf_map_delete_elem(fd, &key) == 0);
113 key = 2;
114 assert(bpf_map_delete_elem(fd, &key) == 0);
115 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
117 key = 0;
121 assert(bpf_map_get_next_key(fd, &key, &next_key) == -1 &&
138 printf("Failed to create hashmap key=%d value=%d '%s'\n",
151 long long key, next_key, first_key;
155 fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_HASH, sizeof(key),
165 key = 1;
166 /* Insert key=1 element. */
167 assert(!(expected_key_mask & key));
168 assert(bpf_map_update_elem(fd, &key, value, BPF_ANY) == 0);
169 expected_key_mask |= key;
172 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 &&
173 /* key=1 already exists. */
177 assert(bpf_map_update_elem(fd, &key, value, -1) == -1 &&
180 /* Check that key=1 can be found. Value could be 0 if the lookup
184 assert(bpf_map_lookup_elem(fd, &key, value) == 0 &&
187 key = 2;
188 /* Check that key=2 is not found. */
189 assert(bpf_map_lookup_elem(fd, &key, value) == -1 && errno == ENOENT);
192 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == -1 &&
193 /* key=2 is not there. */
196 /* Insert key=2 element. */
197 assert(!(expected_key_mask & key));
198 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == 0);
199 expected_key_mask |= key;
201 /* key=1 and key=2 were inserted, check that key=0 cannot be
204 key = 0;
205 assert(bpf_map_update_elem(fd, &key, value, BPF_NOEXIST) == -1 &&
208 /* Check that key = 0 doesn't exist. */
209 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
214 while (!bpf_map_get_next_key(fd, &key, &next_key)) {
227 key = next_key;
232 key = 1;
233 assert(bpf_map_update_elem(fd, &key, value, BPF_EXIST) == 0);
236 key = 1;
237 assert(bpf_map_delete_elem(fd, &key) == 0);
238 key = 2;
239 assert(bpf_map_delete_elem(fd, &key) == 0);
240 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == ENOENT);
242 key = 0;
246 assert(bpf_map_get_next_key(fd, &key, &next_key) == -1 &&
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;
282 for (i = 0; bpf_map_get_next_key(fd, !i ? NULL : &key,
284 key = next_key;
285 assert(bpf_map_lookup_elem(fd, &key, &value) == 0);
290 assert(bpf_map_get_next_key(fd, NULL, &key) == 0);
292 next_key_valid = bpf_map_get_next_key(fd, &key, &next_key) == 0;
293 assert(bpf_map_lookup_elem(fd, &key, &value) == 0);
295 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == 0);
296 key = next_key;
301 for (i = 0; bpf_map_get_next_key(fd, !i ? NULL : &key,
303 key = next_key;
304 assert(bpf_map_lookup_elem(fd, &key, &value) == 0);
305 assert(value - 1 == key);
315 long long key, next_first, next_second;
324 void *key_ptr = !i ? NULL : &key;
337 key = next_first;
347 int key, next_key, fd;
350 fd = bpf_create_map(BPF_MAP_TYPE_ARRAY, sizeof(key), sizeof(value),
357 key = 1;
359 /* Insert key=1 element. */
360 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == 0);
363 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
366 /* Check that key=1 can be found. */
367 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 1234);
369 key = 0;
370 /* Check that key=0 is also found and zero initialized. */
371 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);
373 /* key=0 and key=1 were inserted, check that key=2 cannot be inserted
376 key = 2;
377 assert(bpf_map_update_elem(fd, &key, &value, BPF_EXIST) == -1 &&
380 /* Check that key = 2 doesn't exist. */
381 assert(bpf_map_lookup_elem(fd, &key, &value) == -1 && errno == ENOENT);
386 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
394 key = 1;
395 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == EINVAL);
404 int key, next_key, fd, i;
406 fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_ARRAY, sizeof(key),
416 key = 1;
417 /* Insert key=1 element. */
418 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);
421 assert(bpf_map_update_elem(fd, &key, values, BPF_NOEXIST) == -1 &&
424 /* Check that key=1 can be found. */
425 assert(bpf_map_lookup_elem(fd, &key, values) == 0 &&
428 key = 0;
429 /* Check that key=0 is also found and zero initialized. */
430 assert(bpf_map_lookup_elem(fd, &key, values) == 0 &&
434 /* Check that key=2 cannot be inserted due to max_entries limit. */
435 key = 2;
436 assert(bpf_map_update_elem(fd, &key, values, BPF_EXIST) == -1 &&
439 /* Check that key = 2 doesn't exist. */
440 assert(bpf_map_lookup_elem(fd, &key, values) == -1 && errno == ENOENT);
445 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
453 key = 1;
454 assert(bpf_map_delete_elem(fd, &key) == -1 && errno == EINVAL);
467 int key, fd, i;
469 fd = bpf_create_map(BPF_MAP_TYPE_PERCPU_ARRAY, sizeof(key),
480 for (key = 0; key < nr_keys; key++)
481 assert(bpf_map_update_elem(fd, &key, values, BPF_ANY) == 0);
483 for (key = 0; key < nr_keys; key++) {
487 assert(bpf_map_lookup_elem(fd, &key, values) == 0);
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),
536 /* Invalid key size */
594 /* Invalid key size */
661 __u32 key, value;
730 sizeof(key), sizeof(value),
1230 } key;
1233 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
1241 key = (struct bigkey) { .c = i };
1244 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == 0);
1247 key.c = -1;
1248 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
1252 assert(bpf_map_get_next_key(fd, NULL, &key) == 0);
1253 key.c = -1;
1255 assert(bpf_map_get_next_key(fd, &key, &key) == 0);
1256 assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT);
1258 key.c = 0;
1259 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 && value == 0);
1260 key.a = 1;
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,
1329 assert(bpf_map_delete_elem(fd, &key) == 0);
1336 int i, fd, key = 0, value = 0;
1339 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
1348 * child_0 adds key=0, key=1024, key=2048, ...
1349 * child_1 adds key=1, key=1025, key=2049, ...
1350 * child_1023 adds key=1023, ...
1356 /* Check that key=0 is already there. */
1357 assert(bpf_map_update_elem(fd, &key, &value, BPF_NOEXIST) == -1 &&
1361 assert(bpf_map_get_next_key(fd, NULL, &key) == 0);
1362 key = -1;
1364 assert(bpf_map_get_next_key(fd, &key, &key) == 0);
1365 assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT);
1369 key = MAP_SIZE - i - 1;
1371 assert(bpf_map_lookup_elem(fd, &key, &value) == 0 &&
1372 value == key);
1380 key = -1;
1381 assert(bpf_map_get_next_key(fd, NULL, &key) == -1 && errno == ENOENT);
1382 assert(bpf_map_get_next_key(fd, &key, &key) == -1 && errno == ENOENT);
1387 int fd, key = 0, value = 0;
1389 fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value),
1397 key = 1;
1399 /* Try to insert key=1 element. */
1400 assert(bpf_map_update_elem(fd, &key, &value, BPF_ANY) == -1 &&
1403 /* Check that key=1 is not found. */
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),
1422 key = 1;
1424 /* Insert key=1 element. */
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);