Searched refs:next_key (Results 1 - 25 of 50) sorted by relevance

12

/linux-master/samples/bpf/
H A Dspintest_user.c14 long key, next_key, value; local
58 while (bpf_map_get_next_key(map_fd, &key, &next_key) == 0) {
59 bpf_map_lookup_elem(map_fd, &next_key, &value);
60 assert(next_key == value);
62 key = next_key;
73 while (bpf_map_get_next_key(map_fd, &key, &next_key) == 0)
74 bpf_map_delete_elem(map_fd, &next_key);
H A Dlwt_len_hist_user.c34 uint64_t key = 0, next_key, max_key = 0; local
45 while (bpf_map_get_next_key(map_fd, &key, &next_key) == 0) {
46 if (next_key >= MAX_INDEX) {
47 fprintf(stderr, "Key %lu out of bounds\n", next_key);
51 bpf_map_lookup_elem(map_fd, &next_key, values);
57 data[next_key] = sum;
58 if (sum && next_key > max_key)
59 max_key = next_key;
64 key = next_key;
H A Dtracex2_user.c45 struct hist_key key = {}, next_key; local
54 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) {
55 if (memcmp(&next_key, task, SIZE)) {
56 key = next_key;
59 bpf_map_lookup_elem(fd, &next_key, values);
63 ind = next_key.index;
69 key = next_key;
84 struct hist_key key = {}, next_key; local
89 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) {
93 if (memcmp(&tasks[i], &next_key, SIZ
118 long key, next_key, value; local
[all...]
H A Dsockex3_user.c80 struct flow_key_record key = {}, next_key; local
85 while (bpf_map_get_next_key(hash_map_fd, &key, &next_key) == 0) {
86 bpf_map_lookup_elem(hash_map_fd, &next_key, &value);
88 inet_ntoa((struct in_addr){htonl(next_key.src)}),
89 next_key.port16[0],
90 inet_ntoa((struct in_addr){htonl(next_key.dst)}),
91 next_key.port16[1],
93 key = next_key;
H A Dsockex2_user.c49 int key = 0, next_key; local
52 while (bpf_map_get_next_key(map_fd, &key, &next_key) == 0) {
53 bpf_map_lookup_elem(map_fd, &next_key, &value);
55 inet_ntoa((struct in_addr){htonl(next_key)}),
57 key = next_key;
H A Dtracex4_user.c31 __u64 key, next_key; local
37 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) {
38 bpf_map_lookup_elem(fd, &next_key, &v);
39 key = next_key;
44 next_key, (val - v.val) / 1000000000ll, v.ip);
H A Doffwaketime_user.c79 struct key_t key = {}, next_key; local
82 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) {
83 bpf_map_lookup_elem(fd, &next_key, &value);
84 print_stack(&next_key, value);
85 key = next_key;
H A Dsampleip_user.c92 __u64 key, next_key; local
100 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) {
101 bpf_map_lookup_elem(fd, &next_key, &value);
102 counts[i].ip = next_key;
104 key = next_key;
H A Dtrace_event_user.c102 struct key_t key = {}, next_key; local
108 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) {
109 bpf_map_lookup_elem(fd, &next_key, &value);
110 print_stack(&next_key, value);
111 bpf_map_delete_elem(fd, &next_key);
112 key = next_key;
/linux-master/tools/testing/selftests/bpf/
H A Dtest_maps.c39 long long key, next_key, first_key, value; local
108 assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 &&
109 (next_key == first_key));
110 assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 &&
111 (next_key == 1 || next_key == 2) &&
112 (next_key != first_key));
113 assert(bpf_map_get_next_key(fd, &next_key, &next_key) <
156 long long key, next_key, first_key; local
293 long long key, value[VALUE_SIZE], next_key; local
363 int key, next_key, fd; local
419 int key, next_key, fd, i; local
[all...]
H A Dtest_lru_map.c95 unsigned long long next_key = 0; local
99 while (!bpf_map_get_next_key(map1, &next_key, &next_key)) {
100 assert(!bpf_map_lookup_elem(map1, &next_key, value1));
101 ret = bpf_map_lookup_elem(map0, &next_key, value0);
104 next_key, strerror(errno), errno);
109 next_key, value0[0], value1[0]);
/linux-master/drivers/net/ethernet/netronome/nfp/bpf/
H A Dcmsg.c404 void *next_key)
407 NULL, NULL, 0, next_key, NULL);
411 void *key, void *next_key)
414 key, NULL, 0, next_key, NULL);
403 nfp_bpf_ctrl_getfirst_entry(struct bpf_offloaded_map *offmap, void *next_key) argument
410 nfp_bpf_ctrl_getnext_entry(struct bpf_offloaded_map *offmap, void *key, void *next_key) argument
H A Doffload.c309 void *key, void *next_key)
312 return nfp_bpf_ctrl_getfirst_entry(offmap, next_key);
313 return nfp_bpf_ctrl_getnext_entry(offmap, key, next_key);
308 nfp_bpf_map_get_next_key(struct bpf_offloaded_map *offmap, void *key, void *next_key) argument
H A Dmain.h599 void *next_key);
606 void *key, void *next_key);
/linux-master/kernel/bpf/
H A Dreuseport_array.c317 void *next_key)
321 u32 *next = (u32 *)next_key;
316 reuseport_array_get_next_key(struct bpf_map *map, void *key, void *next_key) argument
H A Dlpm_trie.c632 struct bpf_lpm_trie_key_u8 *key = _key, *next_key = _next_key; local
718 next_key->prefixlen = next_node->prefixlen;
719 memcpy((void *)next_key + offsetof(struct bpf_lpm_trie_key_u8, data),
H A Dbpf_inode_storage.c187 void *next_key)
186 notsupp_get_next_key(struct bpf_map *map, void *key, void *next_key) argument
H A Dqueue_stack_maps.c255 void *next_key)
254 queue_stack_map_get_next_key(struct bpf_map *map, void *key, void *next_key) argument
H A Dbpf_cgrp_storage.c145 static int notsupp_get_next_key(struct bpf_map *map, void *key, void *next_key) argument
H A Ddevmap.c243 static int dev_map_get_next_key(struct bpf_map *map, void *key, void *next_key) argument
247 u32 *next = next_key;
279 void *next_key)
282 u32 idx, *next = next_key;
278 dev_map_hash_get_next_key(struct bpf_map *map, void *key, void *next_key) argument
H A Dbloom_filter.c78 static int bloom_map_get_next_key(struct bpf_map *map, void *key, void *next_key) argument
/linux-master/tools/perf/ui/tui/
H A Dutil.c139 goto next_key;
158 next_key:
/linux-master/net/xdp/
H A Dxskmap.c104 static int xsk_map_get_next_key(struct bpf_map *map, void *key, void *next_key) argument
108 u32 *next = next_key;
/linux-master/drivers/char/
H A Drandom.c654 u8 seed[BLAKE2S_HASH_SIZE], next_key[BLAKE2S_HASH_SIZE]; local
680 /* next_key = HASHPRF(seed, RDSEED || 0) */
682 blake2s(next_key, (u8 *)&block, seed, sizeof(next_key), sizeof(block), sizeof(seed));
683 blake2s_init_key(&input_pool.hash, BLAKE2S_HASH_SIZE, next_key, sizeof(next_key));
686 memzero_explicit(next_key, sizeof(next_key));
/linux-master/fs/btrfs/
H A Drelocation.c1160 struct btrfs_path *path, struct btrfs_key *next_key,
1206 if (next_key) {
1207 next_key->objectid = (u64)-1;
1208 next_key->type = (u8)-1;
1209 next_key->offset = (u64)-1;
1223 if (next_key && slot + 1 < btrfs_header_nritems(parent))
1224 btrfs_node_key_to_cpu(parent, next_key, slot + 1);
1661 struct btrfs_key next_key; local
1700 btrfs_node_key_to_cpu(path->nodes[level], &next_key,
1702 WARN_ON(memcmp(&key, &next_key, sizeo
1158 replace_path(struct btrfs_trans_handle *trans, struct reloc_control *rc, struct btrfs_root *dest, struct btrfs_root *src, struct btrfs_path *path, struct btrfs_key *next_key, int lowest_level, int max_level) argument
[all...]

Completed in 279 milliseconds

12