| /kernel/linux/linux-5.10/samples/bpf/ |
| D | tracex2_user.c | 46 struct hist_key key = {}, next_key; in print_hist_for_pid() local
55 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) { in print_hist_for_pid()
56 if (memcmp(&next_key, task, SIZE)) { in print_hist_for_pid()
57 key = next_key; in print_hist_for_pid()
60 bpf_map_lookup_elem(fd, &next_key, values); in print_hist_for_pid()
64 ind = next_key.index; in print_hist_for_pid()
70 key = next_key; in print_hist_for_pid()
85 struct hist_key key = {}, next_key; in print_hist() local
90 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) { in print_hist()
94 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 | 86 struct flow_key_record key = {}, next_key; in main() local
91 while (bpf_map_get_next_key(hash_map_fd, &key, &next_key) == 0) { in main()
92 bpf_map_lookup_elem(hash_map_fd, &next_key, &value); in main()
94 inet_ntoa((struct in_addr){htonl(next_key.src)}), in main()
95 next_key.port16[0], in main()
96 inet_ntoa((struct in_addr){htonl(next_key.dst)}), in main()
97 next_key.port16[1], in main()
99 key = next_key; in main()
|
| D | spintest_user.c | 17 long key, next_key, value; in main() local
73 while (bpf_map_get_next_key(map_fd, &key, &next_key) == 0) { in main()
74 bpf_map_lookup_elem(map_fd, &next_key, &value); in main()
75 assert(next_key == value); in main()
77 key = next_key; in main()
88 while (bpf_map_get_next_key(map_fd, &key, &next_key) == 0) in main()
89 bpf_map_delete_elem(map_fd, &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 | 32 __u64 key, next_key; in print_old_objects() local
38 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) { in print_old_objects()
39 bpf_map_lookup_elem(fd, &next_key, &v); in print_old_objects()
40 key = next_key; in print_old_objects()
45 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 | 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()
|
| /kernel/linux/linux-5.10/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 | 277 __u32 key, next_key; in compare_map_keys() local
289 while (bpf_map_get_next_key(map1_fd, &key, &next_key) == 0) { in compare_map_keys()
290 err = bpf_map_lookup_elem(map2_fd, &next_key, val_buf); in compare_map_keys()
294 key = next_key; in compare_map_keys()
304 __u32 key, next_key, *cur_key_p, *next_key_p; in compare_stack_ips() local
327 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()
|
| /kernel/linux/linux-5.10/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()
|
| /kernel/linux/linux-5.10/drivers/char/ |
| D | random.c | 665 u8 seed[BLAKE2S_HASH_SIZE], next_key[BLAKE2S_HASH_SIZE]; in extract_entropy() local
685 blake2s(next_key, (u8 *)&block, seed, sizeof(next_key), sizeof(block), sizeof(seed)); in extract_entropy()
686 blake2s_init_key(&input_pool.hash, BLAKE2S_HASH_SIZE, next_key, sizeof(next_key)); in extract_entropy()
689 memzero_explicit(next_key, sizeof(next_key)); in extract_entropy()
|
| /kernel/linux/linux-5.10/tools/perf/ui/tui/ |
| D | util.c | 139 goto next_key; in ui_browser__input_window()
158 next_key: in ui_browser__input_window()
|
| /kernel/linux/linux-5.10/net/xdp/ |
| D | xskmap.c | 118 static int xsk_map_get_next_key(struct bpf_map *map, void *key, void *next_key) in xsk_map_get_next_key() argument
122 u32 *next = next_key; in xsk_map_get_next_key()
|
| /kernel/linux/linux-5.10/kernel/bpf/ |
| D | reuseport_array.c | 334 void *next_key) in reuseport_array_get_next_key() argument
338 u32 *next = (u32 *)next_key; in reuseport_array_get_next_key()
|
| D | lpm_trie.c | 629 struct bpf_lpm_trie_key *key = _key, *next_key = _next_key; in trie_get_next_key() local
715 next_key->prefixlen = next_node->prefixlen; in trie_get_next_key()
716 memcpy((void *)next_key + offsetof(struct bpf_lpm_trie_key, data), in trie_get_next_key()
|
| D | devmap.c | 258 static int dev_map_get_next_key(struct bpf_map *map, void *key, void *next_key) in dev_map_get_next_key() argument
262 u32 *next = next_key; in dev_map_get_next_key()
290 void *next_key) in dev_map_hash_get_next_key() argument
293 u32 idx, *next = next_key; in dev_map_hash_get_next_key()
|
| D | bpf_inode_storage.c | 217 void *next_key) in notsupp_get_next_key() argument
|
| /kernel/linux/linux-5.10/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 | relocation.c | 1189 struct btrfs_path *path, struct btrfs_key *next_key, in replace_path() argument
1233 if (next_key) { in replace_path()
1234 next_key->objectid = (u64)-1; in replace_path()
1235 next_key->type = (u8)-1; in replace_path()
1236 next_key->offset = (u64)-1; in replace_path()
1252 if (next_key && slot + 1 < btrfs_header_nritems(parent)) in replace_path()
1253 btrfs_node_key_to_cpu(parent, next_key, slot + 1); in replace_path()
1663 struct btrfs_key next_key; in merge_reloc_root() local
1703 btrfs_node_key_to_cpu(path->nodes[level], &next_key, in merge_reloc_root()
1705 WARN_ON(memcmp(&key, &next_key, sizeof(key))); in merge_reloc_root()
[all …]
|
| D | tree-checker.c | 1739 struct btrfs_key key, next_key; in btrfs_check_node() local
1763 btrfs_node_key_to_cpu(node, &next_key, slot + 1); in btrfs_check_node()
1779 if (btrfs_comp_cpu_keys(&key, &next_key) >= 0) { in btrfs_check_node()
1783 next_key.objectid, next_key.type, in btrfs_check_node()
1784 next_key.offset); in btrfs_check_node()
|