| /Linux-v6.1/samples/bpf/ |
| D | tracex2_user.c | 45 struct hist_key key = {}, next_key; in print_hist_for_pid() local
54 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) { in print_hist_for_pid()
55 if (memcmp(&next_key, task, SIZE)) { in print_hist_for_pid()
56 key = next_key; in print_hist_for_pid()
59 bpf_map_lookup_elem(fd, &next_key, values); in print_hist_for_pid()
63 ind = next_key.index; in print_hist_for_pid()
69 key = next_key; in print_hist_for_pid()
84 struct hist_key key = {}, next_key; in print_hist() local
89 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) { in print_hist()
93 if (memcmp(&tasks[i], &next_key, SIZE) == 0) in print_hist()
[all …]
|
| D | lwt_len_hist_user.c | 34 uint64_t key = 0, next_key, max_key = 0; in main() local
45 while (bpf_map_get_next_key(map_fd, &key, &next_key) == 0) { in main()
46 if (next_key >= MAX_INDEX) { in main()
47 fprintf(stderr, "Key %lu out of bounds\n", next_key); in main()
51 bpf_map_lookup_elem(map_fd, &next_key, values); in main()
57 data[next_key] = sum; in main()
58 if (sum && next_key > max_key) in main()
59 max_key = next_key; in main()
64 key = next_key; in main()
|
| D | sockex3_user.c | 83 struct flow_key_record key = {}, next_key; in main() local
88 while (bpf_map_get_next_key(hash_map_fd, &key, &next_key) == 0) { in main()
89 bpf_map_lookup_elem(hash_map_fd, &next_key, &value); in main()
91 inet_ntoa((struct in_addr){htonl(next_key.src)}), in main()
92 next_key.port16[0], in main()
93 inet_ntoa((struct in_addr){htonl(next_key.dst)}), in main()
94 next_key.port16[1], in main()
96 key = next_key; in main()
|
| D | spintest_user.c | 15 long key, next_key, value; in main() local
66 while (bpf_map_get_next_key(map_fd, &key, &next_key) == 0) { in main()
67 bpf_map_lookup_elem(map_fd, &next_key, &value); in main()
68 assert(next_key == value); in main()
70 key = next_key; in main()
81 while (bpf_map_get_next_key(map_fd, &key, &next_key) == 0) in main()
82 bpf_map_delete_elem(map_fd, &next_key); in main()
|
| D | sockex2_user.c | 49 int key = 0, next_key; in main() local
52 while (bpf_map_get_next_key(map_fd, &key, &next_key) == 0) { in main()
53 bpf_map_lookup_elem(map_fd, &next_key, &value); in main()
55 inet_ntoa((struct in_addr){htonl(next_key)}), in main()
57 key = next_key; in main()
|
| D | tracex4_user.c | 31 __u64 key, next_key; in print_old_objects() local
37 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) { in print_old_objects()
38 bpf_map_lookup_elem(fd, &next_key, &v); in print_old_objects()
39 key = next_key; in print_old_objects()
44 next_key, (val - v.val) / 1000000000ll, v.ip); in print_old_objects()
|
| D | offwaketime_user.c | 79 struct key_t key = {}, next_key; in print_stacks() local
82 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) { in print_stacks()
83 bpf_map_lookup_elem(fd, &next_key, &value); in print_stacks()
84 print_stack(&next_key, value); in print_stacks()
85 key = next_key; in print_stacks()
|
| D | sampleip_user.c | 92 __u64 key, next_key; in print_ip_map() local
100 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) { in print_ip_map()
101 bpf_map_lookup_elem(fd, &next_key, &value); in print_ip_map()
102 counts[i].ip = next_key; in print_ip_map()
104 key = next_key; in print_ip_map()
|
| D | trace_event_user.c | 102 struct key_t key = {}, next_key; in print_stacks() local
108 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) { in print_stacks()
109 bpf_map_lookup_elem(fd, &next_key, &value); in print_stacks()
110 print_stack(&next_key, value); in print_stacks()
111 bpf_map_delete_elem(fd, &next_key); in print_stacks()
112 key = next_key; in print_stacks()
|
| /Linux-v6.1/tools/testing/selftests/bpf/ |
| D | test_maps.c | 39 long long key, next_key, first_key, value; in test_hashmap() local
108 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 && in test_hashmap()
109 (next_key == first_key)); in test_hashmap()
110 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 && in test_hashmap()
111 (next_key == 1 || next_key == 2) && in test_hashmap()
112 (next_key != first_key)); in test_hashmap()
113 assert(bpf_map_get_next_key(fd, &next_key, &next_key) < 0 && in test_hashmap()
125 assert(bpf_map_get_next_key(fd, NULL, &next_key) < 0 && in test_hashmap()
127 assert(bpf_map_get_next_key(fd, &key, &next_key) < 0 && in test_hashmap()
156 long long key, next_key, first_key; in test_hashmap_percpu() local
[all …]
|
| D | test_lru_map.c | 95 unsigned long long next_key = 0; in map_subset() local
99 while (!bpf_map_get_next_key(map1, &next_key, &next_key)) { in map_subset()
100 assert(!bpf_map_lookup_elem(map1, &next_key, value1)); in map_subset()
101 ret = bpf_map_lookup_elem(map0, &next_key, value0); in map_subset()
104 next_key, strerror(errno), errno); in map_subset()
109 next_key, value0[0], value1[0]); in map_subset()
|
| D | test_progs.c | 525 __u32 key, next_key; in compare_map_keys() local
537 while (bpf_map_get_next_key(map1_fd, &key, &next_key) == 0) { in compare_map_keys()
538 err = bpf_map_lookup_elem(map2_fd, &next_key, val_buf); in compare_map_keys()
542 key = next_key; in compare_map_keys()
552 __u32 key, next_key, *cur_key_p, *next_key_p; in compare_stack_ips() local
575 next_key_p = &next_key; in compare_stack_ips()
|
| /Linux-v6.1/Documentation/bpf/ |
| D | map_hash.rst | 93 int bpf_map_get_next_key(int fd, const void *cur_key, void *next_key)
170 struct key next_key;
175 err = bpf_map_get_next_key(map_fd, cur_key, &next_key);
179 bpf_map_lookup_elem(map_fd, &next_key, &value);
183 cur_key = &next_key;
|
| /Linux-v6.1/drivers/net/ethernet/netronome/nfp/bpf/ |
| D | cmsg.c | 404 void *next_key) in nfp_bpf_ctrl_getfirst_entry() argument
407 NULL, NULL, 0, next_key, NULL); in nfp_bpf_ctrl_getfirst_entry()
411 void *key, void *next_key) in nfp_bpf_ctrl_getnext_entry() argument
414 key, NULL, 0, next_key, NULL); in nfp_bpf_ctrl_getnext_entry()
|
| D | main.h | 599 void *next_key);
606 void *key, void *next_key);
|
| D | offload.c | 309 void *key, void *next_key) in nfp_bpf_map_get_next_key() argument
312 return nfp_bpf_ctrl_getfirst_entry(offmap, next_key); in nfp_bpf_map_get_next_key()
313 return nfp_bpf_ctrl_getnext_entry(offmap, key, next_key); in nfp_bpf_map_get_next_key()
|
| /Linux-v6.1/tools/perf/ui/tui/ |
| D | util.c | 139 goto next_key; in ui_browser__input_window()
158 next_key: in ui_browser__input_window()
|
| /Linux-v6.1/drivers/char/ |
| D | random.c | 597 u8 seed[BLAKE2S_HASH_SIZE], next_key[BLAKE2S_HASH_SIZE]; in extract_entropy() local
625 blake2s(next_key, (u8 *)&block, seed, sizeof(next_key), sizeof(block), sizeof(seed)); in extract_entropy()
626 blake2s_init_key(&input_pool.hash, BLAKE2S_HASH_SIZE, next_key, sizeof(next_key)); in extract_entropy()
629 memzero_explicit(next_key, sizeof(next_key)); in extract_entropy()
|
| /Linux-v6.1/kernel/bpf/ |
| D | reuseport_array.c | 320 void *next_key) in reuseport_array_get_next_key() argument
324 u32 *next = (u32 *)next_key; in reuseport_array_get_next_key()
|
| D | lpm_trie.c | 619 struct bpf_lpm_trie_key *key = _key, *next_key = _next_key; in trie_get_next_key() local
705 next_key->prefixlen = next_node->prefixlen; in trie_get_next_key()
706 memcpy((void *)next_key + offsetof(struct bpf_lpm_trie_key, data), in trie_get_next_key()
|
| D | devmap.c | 246 static int dev_map_get_next_key(struct bpf_map *map, void *key, void *next_key) in dev_map_get_next_key() argument
250 u32 *next = next_key; in dev_map_get_next_key()
282 void *next_key) in dev_map_hash_get_next_key() argument
285 u32 idx, *next = next_key; in dev_map_hash_get_next_key()
|
| D | bloom_filter.c | 86 static int bloom_map_get_next_key(struct bpf_map *map, void *key, void *next_key) in bloom_map_get_next_key() argument
|
| /Linux-v6.1/net/xdp/ |
| D | xskmap.c | 96 static int xsk_map_get_next_key(struct bpf_map *map, void *key, void *next_key) in xsk_map_get_next_key() argument
100 u32 *next = next_key; in xsk_map_get_next_key()
|
| /Linux-v6.1/fs/btrfs/ |
| D | relocation.c | 1200 struct btrfs_path *path, struct btrfs_key *next_key, in replace_path() argument
1246 if (next_key) { in replace_path()
1247 next_key->objectid = (u64)-1; in replace_path()
1248 next_key->type = (u8)-1; in replace_path()
1249 next_key->offset = (u64)-1; in replace_path()
1263 if (next_key && slot + 1 < btrfs_header_nritems(parent)) in replace_path()
1264 btrfs_node_key_to_cpu(parent, next_key, slot + 1); in replace_path()
1683 struct btrfs_key next_key; in merge_reloc_root() local
1722 btrfs_node_key_to_cpu(path->nodes[level], &next_key, in merge_reloc_root()
1724 WARN_ON(memcmp(&key, &next_key, sizeof(key))); in merge_reloc_root()
[all …]
|
| D | tree-checker.c | 1825 struct btrfs_key key, next_key; in btrfs_check_node() local
1849 btrfs_node_key_to_cpu(node, &next_key, slot + 1); in btrfs_check_node()
1865 if (unlikely(btrfs_comp_cpu_keys(&key, &next_key) >= 0)) { in btrfs_check_node()
1869 next_key.objectid, next_key.type, in btrfs_check_node()
1870 next_key.offset); in btrfs_check_node()
|
