| /Linux-v5.4/samples/bpf/ |
| D | tracex2_user.c | 44 struct hist_key key = {}, next_key; in print_hist_for_pid() local
53 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) { in print_hist_for_pid()
54 if (memcmp(&next_key, task, SIZE)) { in print_hist_for_pid()
55 key = next_key; in print_hist_for_pid()
58 bpf_map_lookup_elem(fd, &next_key, values); in print_hist_for_pid()
62 ind = next_key.index; in print_hist_for_pid()
68 key = next_key; in print_hist_for_pid()
83 struct hist_key key = {}, next_key; in print_hist() local
88 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) { in print_hist()
92 if (memcmp(&tasks[i], &next_key, SIZE) == 0) in print_hist()
[all …]
|
| D | lwt_len_hist_user.c | 36 uint64_t key = 0, next_key, max_key = 0; in main() local
47 while (bpf_map_get_next_key(map_fd, &key, &next_key) == 0) { in main()
48 if (next_key >= MAX_INDEX) { in main()
49 fprintf(stderr, "Key %lu out of bounds\n", next_key); in main()
53 bpf_map_lookup_elem(map_fd, &next_key, values); in main()
59 data[next_key] = sum; in main()
60 if (sum && next_key > max_key) in main()
61 max_key = next_key; in main()
66 key = next_key; in main()
|
| D | spintest_user.c | 15 long key, next_key, value; in main() local
36 while (bpf_map_get_next_key(map_fd[0], &key, &next_key) == 0) { in main()
37 bpf_map_lookup_elem(map_fd[0], &next_key, &value); in main()
38 assert(next_key == value); in main()
40 key = next_key; in main()
51 while (bpf_map_get_next_key(map_fd[0], &key, &next_key) == 0) in main()
52 bpf_map_delete_elem(map_fd[0], &next_key); in main()
|
| D | sockex3_user.c | 67 struct flow_key_record key = {}, next_key; in main() local
72 while (bpf_map_get_next_key(map_fd[2], &key, &next_key) == 0) { in main()
73 bpf_map_lookup_elem(map_fd[2], &next_key, &value); in main()
75 inet_ntoa((struct in_addr){htonl(next_key.src)}), in main()
76 next_key.port16[0], in main()
77 inet_ntoa((struct in_addr){htonl(next_key.dst)}), in main()
78 next_key.port16[1], in main()
80 key = next_key; in main()
|
| D | sockex2_user.c | 44 int key = 0, next_key; in main() local
47 while (bpf_map_get_next_key(map_fd, &key, &next_key) == 0) { in main()
48 bpf_map_lookup_elem(map_fd, &next_key, &value); in main()
50 inet_ntoa((struct in_addr){htonl(next_key)}), in main()
52 key = next_key; in main()
|
| D | tracex4_user.c | 33 __u64 key, next_key; in print_old_objects() local
39 while (bpf_map_get_next_key(map_fd[0], &key, &next_key) == 0) { in print_old_objects()
40 bpf_map_lookup_elem(map_fd[0], &next_key, &v); in print_old_objects()
41 key = next_key; in print_old_objects()
46 next_key, (val - v.val) / 1000000000ll, v.ip); in print_old_objects()
|
| D | offwaketime_user.c | 80 struct key_t key = {}, next_key; in print_stacks() local
83 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) { in print_stacks()
84 bpf_map_lookup_elem(fd, &next_key, &value); in print_stacks()
85 print_stack(&next_key, value); in print_stacks()
86 key = next_key; in print_stacks()
|
| D | sampleip_user.c | 88 __u64 key, next_key; in print_ip_map() local
96 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) { in print_ip_map()
97 bpf_map_lookup_elem(fd, &next_key, &value); in print_ip_map()
98 counts[i].ip = next_key; in print_ip_map()
100 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-v5.4/tools/testing/selftests/bpf/ |
| D | test_maps.c | 39 long long key, next_key, first_key, value; in test_hashmap() local
102 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 && in test_hashmap()
103 (next_key == first_key)); in test_hashmap()
104 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 && in test_hashmap()
105 (next_key == 1 || next_key == 2) && in test_hashmap()
106 (next_key != first_key)); in test_hashmap()
107 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 && in test_hashmap()
119 assert(bpf_map_get_next_key(fd, NULL, &next_key) == -1 && in test_hashmap()
121 assert(bpf_map_get_next_key(fd, &key, &next_key) == -1 && in test_hashmap()
151 long long key, next_key, first_key; in test_hashmap_percpu() local
[all …]
|
| D | test_progs.c | 210 __u32 key, next_key; in compare_map_keys() local
222 while (bpf_map_get_next_key(map1_fd, &key, &next_key) == 0) { in compare_map_keys()
223 err = bpf_map_lookup_elem(map2_fd, &next_key, val_buf); in compare_map_keys()
227 key = next_key; in compare_map_keys()
237 __u32 key, next_key, *cur_key_p, *next_key_p; in compare_stack_ips() local
260 next_key_p = &next_key; in compare_stack_ips()
|
| D | test_lru_map.c | 106 unsigned long long next_key = 0; in map_subset() local
110 while (!bpf_map_get_next_key(map1, &next_key, &next_key)) { in map_subset()
111 assert(!bpf_map_lookup_elem(map1, &next_key, value1)); in map_subset()
112 ret = bpf_map_lookup_elem(map0, &next_key, value0); in map_subset()
115 next_key, strerror(errno), errno); in map_subset()
120 next_key, value0[0], value1[0]); in map_subset()
|
| /Linux-v5.4/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 | offload.c | 305 void *key, void *next_key) in nfp_bpf_map_get_next_key() argument
308 return nfp_bpf_ctrl_getfirst_entry(offmap, next_key); in nfp_bpf_map_get_next_key()
309 return nfp_bpf_ctrl_getnext_entry(offmap, key, next_key); in nfp_bpf_map_get_next_key()
|
| D | main.h | 597 void *next_key);
604 void *key, void *next_key);
|
| /Linux-v5.4/tools/perf/ui/tui/ |
| D | util.c | 135 goto next_key; in ui_browser__input_window()
154 next_key: in ui_browser__input_window()
|
| /Linux-v5.4/kernel/bpf/ |
| D | reuseport_array.c | 335 void *next_key) in reuseport_array_get_next_key() argument
339 u32 *next = (u32 *)next_key; in reuseport_array_get_next_key()
|
| D | devmap.c | 249 static int dev_map_get_next_key(struct bpf_map *map, void *key, void *next_key) in dev_map_get_next_key() argument
253 u32 *next = next_key; in dev_map_get_next_key()
286 void *next_key) in dev_map_hash_get_next_key() argument
289 u32 idx, *next = next_key; in dev_map_hash_get_next_key()
|
| D | xskmap.c | 146 static int xsk_map_get_next_key(struct bpf_map *map, void *key, void *next_key) in xsk_map_get_next_key() argument
150 u32 *next = next_key; in xsk_map_get_next_key()
|
| D | lpm_trie.c | 634 struct bpf_lpm_trie_key *key = _key, *next_key = _next_key; in trie_get_next_key() local
720 next_key->prefixlen = next_node->prefixlen; in trie_get_next_key()
721 memcpy((void *)next_key + offsetof(struct bpf_lpm_trie_key, data), in trie_get_next_key()
|
| /Linux-v5.4/fs/btrfs/ |
| D | reada.c | 137 struct btrfs_key next_key; in __readahead_hook() local
141 btrfs_node_key_to_cpu(eb, &next_key, i + 1); in __readahead_hook()
143 next_key = re->top; in __readahead_hook()
167 btrfs_comp_cpu_keys(&next_key, &rc->key_start) > 0) in __readahead_hook()
168 reada_add_block(rc, bytenr, &next_key, n_gen); in __readahead_hook()
|
| D | tree-checker.c | 1435 struct btrfs_key key, next_key; in btrfs_check_node() local
1459 btrfs_node_key_to_cpu(node, &next_key, slot + 1); in btrfs_check_node()
1475 if (btrfs_comp_cpu_keys(&key, &next_key) >= 0) { in btrfs_check_node()
1479 next_key.objectid, next_key.type, in btrfs_check_node()
1480 next_key.offset); in btrfs_check_node()
|
| D | relocation.c | 1769 struct btrfs_path *path, struct btrfs_key *next_key, in replace_path() argument
1812 if (next_key) { in replace_path()
1813 next_key->objectid = (u64)-1; in replace_path()
1814 next_key->type = (u8)-1; in replace_path()
1815 next_key->offset = (u64)-1; in replace_path()
1831 if (next_key && slot + 1 < btrfs_header_nritems(parent)) in replace_path()
1832 btrfs_node_key_to_cpu(parent, next_key, slot + 1); in replace_path()
2226 struct btrfs_key next_key; in merge_reloc_root() local
2265 btrfs_node_key_to_cpu(path->nodes[level], &next_key, in merge_reloc_root()
2267 WARN_ON(memcmp(&key, &next_key, sizeof(key))); in merge_reloc_root()
[all …]
|
| /Linux-v5.4/tools/lib/bpf/ |
| D | bpf.c | 419 int bpf_map_get_next_key(int fd, const void *key, void *next_key) in bpf_map_get_next_key() argument
426 attr.next_key = ptr_to_u64(next_key); in bpf_map_get_next_key()
|
| D | bpf.h | 121 LIBBPF_API int bpf_map_get_next_key(int fd, const void *key, void *next_key);
|
