next_key 404 drivers/net/ethernet/netronome/nfp/bpf/cmsg.c void *next_key) next_key 407 drivers/net/ethernet/netronome/nfp/bpf/cmsg.c NULL, NULL, 0, next_key, NULL); next_key 411 drivers/net/ethernet/netronome/nfp/bpf/cmsg.c void *key, void *next_key) next_key 414 drivers/net/ethernet/netronome/nfp/bpf/cmsg.c key, NULL, 0, next_key, NULL); next_key 597 drivers/net/ethernet/netronome/nfp/bpf/main.h void *next_key); next_key 604 drivers/net/ethernet/netronome/nfp/bpf/main.h void *key, void *next_key); next_key 305 drivers/net/ethernet/netronome/nfp/bpf/offload.c void *key, void *next_key) next_key 308 drivers/net/ethernet/netronome/nfp/bpf/offload.c return nfp_bpf_ctrl_getfirst_entry(offmap, next_key); next_key 309 drivers/net/ethernet/netronome/nfp/bpf/offload.c return nfp_bpf_ctrl_getnext_entry(offmap, key, next_key); next_key 365 drivers/net/netdevsim/bpf.c void *key, void *next_key) next_key 381 drivers/net/netdevsim/bpf.c memcpy(next_key, nmap->entry[idx].key, next_key 784 drivers/staging/rtl8188eu/core/rtw_security.c static void next_key(u8 *key, int round); next_key 937 drivers/staging/rtl8188eu/core/rtw_security.c next_key(round_key, round); next_key 950 drivers/staging/rtl8188eu/core/rtw_security.c next_key(round_key, round); next_key 872 drivers/staging/rtl8712/rtl871x_security.c next_key(round_key, round); next_key 885 drivers/staging/rtl8712/rtl871x_security.c next_key(round_key, round); next_key 950 drivers/staging/rtl8723bs/core/rtw_security.c static void next_key(u8 *key, sint round); next_key 1115 drivers/staging/rtl8723bs/core/rtw_security.c next_key(round_key, round); next_key 1128 drivers/staging/rtl8723bs/core/rtw_security.c next_key(round_key, round); next_key 137 fs/btrfs/reada.c struct btrfs_key next_key; next_key 141 fs/btrfs/reada.c btrfs_node_key_to_cpu(eb, &next_key, i + 1); next_key 143 fs/btrfs/reada.c next_key = re->top; next_key 167 fs/btrfs/reada.c btrfs_comp_cpu_keys(&next_key, &rc->key_start) > 0) next_key 168 fs/btrfs/reada.c reada_add_block(rc, bytenr, &next_key, n_gen); next_key 1807 fs/btrfs/relocation.c struct btrfs_path *path, struct btrfs_key *next_key, next_key 1850 fs/btrfs/relocation.c if (next_key) { next_key 1851 fs/btrfs/relocation.c next_key->objectid = (u64)-1; next_key 1852 fs/btrfs/relocation.c next_key->type = (u8)-1; next_key 1853 fs/btrfs/relocation.c next_key->offset = (u64)-1; next_key 1869 fs/btrfs/relocation.c if (next_key && slot + 1 < btrfs_header_nritems(parent)) next_key 1870 fs/btrfs/relocation.c btrfs_node_key_to_cpu(parent, next_key, slot + 1); next_key 2269 fs/btrfs/relocation.c struct btrfs_key next_key; next_key 2308 fs/btrfs/relocation.c btrfs_node_key_to_cpu(path->nodes[level], &next_key, next_key 2310 fs/btrfs/relocation.c WARN_ON(memcmp(&key, &next_key, sizeof(key))); next_key 2316 fs/btrfs/relocation.c memset(&next_key, 0, sizeof(next_key)); next_key 2345 fs/btrfs/relocation.c btrfs_comp_cpu_keys(&next_key, &key) >= 0) { next_key 2349 fs/btrfs/relocation.c &next_key, level, max_level); next_key 2382 fs/btrfs/relocation.c invalidate_extent_cache(root, &key, &next_key); next_key 2407 fs/btrfs/relocation.c invalidate_extent_cache(root, &key, &next_key); next_key 1449 fs/btrfs/tree-checker.c struct btrfs_key key, next_key; next_key 1473 fs/btrfs/tree-checker.c btrfs_node_key_to_cpu(node, &next_key, slot + 1); next_key 1489 fs/btrfs/tree-checker.c if (btrfs_comp_cpu_keys(&key, &next_key) >= 0) { next_key 1493 fs/btrfs/tree-checker.c next_key.objectid, next_key.type, next_key 1494 fs/btrfs/tree-checker.c next_key.offset); next_key 5228 fs/btrfs/tree-log.c goto next_key; next_key 5285 fs/btrfs/tree-log.c next_key: next_key 37 include/linux/bpf.h int (*map_get_next_key)(struct bpf_map *map, void *key, void *next_key); next_key 143 include/linux/bpf.h void *key, void *next_key); next_key 902 include/linux/bpf.h void *key, void *next_key); next_key 394 include/uapi/linux/bpf.h __aligned_u64 next_key; next_key 253 kernel/bpf/arraymap.c static int array_map_get_next_key(struct bpf_map *map, void *key, void *next_key) next_key 257 kernel/bpf/arraymap.c u32 *next = (u32 *)next_key; next_key 575 kernel/bpf/cpumap.c static int cpu_map_get_next_key(struct bpf_map *map, void *key, void *next_key) next_key 579 kernel/bpf/cpumap.c u32 *next = next_key; next_key 273 kernel/bpf/devmap.c static int dev_map_get_next_key(struct bpf_map *map, void *key, void *next_key) next_key 277 kernel/bpf/devmap.c u32 *next = next_key; next_key 305 kernel/bpf/devmap.c void *next_key) next_key 308 kernel/bpf/devmap.c u32 idx, *next = next_key; next_key 597 kernel/bpf/hashtab.c static int htab_map_get_next_key(struct bpf_map *map, void *key, void *next_key) next_key 628 kernel/bpf/hashtab.c memcpy(next_key, next_l->key, key_size); next_key 646 kernel/bpf/hashtab.c memcpy(next_key, next_l->key, key_size); next_key 634 kernel/bpf/lpm_trie.c struct bpf_lpm_trie_key *key = _key, *next_key = _next_key; next_key 720 kernel/bpf/lpm_trie.c next_key->prefixlen = next_node->prefixlen; next_key 721 kernel/bpf/lpm_trie.c memcpy((void *)next_key + offsetof(struct bpf_lpm_trie_key, data), next_key 478 kernel/bpf/offload.c int bpf_map_offload_get_next_key(struct bpf_map *map, void *key, void *next_key) next_key 485 kernel/bpf/offload.c ret = offmap->dev_ops->map_get_next_key(offmap, key, next_key); next_key 260 kernel/bpf/queue_stack_maps.c void *next_key) next_key 335 kernel/bpf/reuseport_array.c void *next_key) next_key 339 kernel/bpf/reuseport_array.c u32 *next = (u32 *)next_key; next_key 544 kernel/bpf/stackmap.c void *next_key) next_key 568 kernel/bpf/stackmap.c *(u32 *)next_key = id; next_key 1035 kernel/bpf/syscall.c #define BPF_MAP_GET_NEXT_KEY_LAST_FIELD next_key next_key 1040 kernel/bpf/syscall.c void __user *unext_key = u64_to_user_ptr(attr->next_key); next_key 1043 kernel/bpf/syscall.c void *key, *next_key; next_key 1070 kernel/bpf/syscall.c next_key = kmalloc(map->key_size, GFP_USER); next_key 1071 kernel/bpf/syscall.c if (!next_key) next_key 1075 kernel/bpf/syscall.c err = bpf_map_offload_get_next_key(map, key, next_key); next_key 1080 kernel/bpf/syscall.c err = map->ops->map_get_next_key(map, key, next_key); next_key 1087 kernel/bpf/syscall.c if (copy_to_user(unext_key, next_key, map->key_size) != 0) next_key 1093 kernel/bpf/syscall.c kfree(next_key); next_key 146 kernel/bpf/xskmap.c static int xsk_map_get_next_key(struct bpf_map *map, void *key, void *next_key) next_key 150 kernel/bpf/xskmap.c u32 *next = next_key; next_key 679 net/core/bpf_sk_storage.c void *next_key) next_key 34 samples/bpf/lwt_len_hist_user.c uint64_t key = 0, next_key, max_key = 0; next_key 45 samples/bpf/lwt_len_hist_user.c while (bpf_map_get_next_key(map_fd, &key, &next_key) == 0) { next_key 46 samples/bpf/lwt_len_hist_user.c if (next_key >= MAX_INDEX) { next_key 47 samples/bpf/lwt_len_hist_user.c fprintf(stderr, "Key %lu out of bounds\n", next_key); next_key 51 samples/bpf/lwt_len_hist_user.c bpf_map_lookup_elem(map_fd, &next_key, values); next_key 57 samples/bpf/lwt_len_hist_user.c data[next_key] = sum; next_key 58 samples/bpf/lwt_len_hist_user.c if (sum && next_key > max_key) next_key 59 samples/bpf/lwt_len_hist_user.c max_key = next_key; next_key 64 samples/bpf/lwt_len_hist_user.c key = next_key; next_key 80 samples/bpf/offwaketime_user.c struct key_t key = {}, next_key; next_key 83 samples/bpf/offwaketime_user.c while (bpf_map_get_next_key(fd, &key, &next_key) == 0) { next_key 84 samples/bpf/offwaketime_user.c bpf_map_lookup_elem(fd, &next_key, &value); next_key 85 samples/bpf/offwaketime_user.c print_stack(&next_key, value); next_key 86 samples/bpf/offwaketime_user.c key = next_key; next_key 88 samples/bpf/sampleip_user.c __u64 key, next_key; next_key 96 samples/bpf/sampleip_user.c while (bpf_map_get_next_key(fd, &key, &next_key) == 0) { next_key 97 samples/bpf/sampleip_user.c bpf_map_lookup_elem(fd, &next_key, &value); next_key 98 samples/bpf/sampleip_user.c counts[i].ip = next_key; next_key 100 samples/bpf/sampleip_user.c key = next_key; next_key 44 samples/bpf/sockex2_user.c int key = 0, next_key; next_key 47 samples/bpf/sockex2_user.c while (bpf_map_get_next_key(map_fd, &key, &next_key) == 0) { next_key 48 samples/bpf/sockex2_user.c bpf_map_lookup_elem(map_fd, &next_key, &value); next_key 50 samples/bpf/sockex2_user.c inet_ntoa((struct in_addr){htonl(next_key)}), next_key 52 samples/bpf/sockex2_user.c key = next_key; next_key 67 samples/bpf/sockex3_user.c struct flow_key_record key = {}, next_key; next_key 72 samples/bpf/sockex3_user.c while (bpf_map_get_next_key(map_fd[2], &key, &next_key) == 0) { next_key 73 samples/bpf/sockex3_user.c bpf_map_lookup_elem(map_fd[2], &next_key, &value); next_key 75 samples/bpf/sockex3_user.c inet_ntoa((struct in_addr){htonl(next_key.src)}), next_key 76 samples/bpf/sockex3_user.c next_key.port16[0], next_key 77 samples/bpf/sockex3_user.c inet_ntoa((struct in_addr){htonl(next_key.dst)}), next_key 78 samples/bpf/sockex3_user.c next_key.port16[1], next_key 80 samples/bpf/sockex3_user.c key = next_key; next_key 15 samples/bpf/spintest_user.c long key, next_key, value; next_key 36 samples/bpf/spintest_user.c while (bpf_map_get_next_key(map_fd[0], &key, &next_key) == 0) { next_key 37 samples/bpf/spintest_user.c bpf_map_lookup_elem(map_fd[0], &next_key, &value); next_key 38 samples/bpf/spintest_user.c assert(next_key == value); next_key 40 samples/bpf/spintest_user.c key = next_key; next_key 51 samples/bpf/spintest_user.c while (bpf_map_get_next_key(map_fd[0], &key, &next_key) == 0) next_key 52 samples/bpf/spintest_user.c bpf_map_delete_elem(map_fd[0], &next_key); next_key 102 samples/bpf/trace_event_user.c struct key_t key = {}, next_key; next_key 108 samples/bpf/trace_event_user.c while (bpf_map_get_next_key(fd, &key, &next_key) == 0) { next_key 109 samples/bpf/trace_event_user.c bpf_map_lookup_elem(fd, &next_key, &value); next_key 110 samples/bpf/trace_event_user.c print_stack(&next_key, value); next_key 111 samples/bpf/trace_event_user.c bpf_map_delete_elem(fd, &next_key); next_key 112 samples/bpf/trace_event_user.c key = next_key; next_key 44 samples/bpf/tracex2_user.c struct hist_key key = {}, next_key; next_key 53 samples/bpf/tracex2_user.c while (bpf_map_get_next_key(fd, &key, &next_key) == 0) { next_key 54 samples/bpf/tracex2_user.c if (memcmp(&next_key, task, SIZE)) { next_key 55 samples/bpf/tracex2_user.c key = next_key; next_key 58 samples/bpf/tracex2_user.c bpf_map_lookup_elem(fd, &next_key, values); next_key 62 samples/bpf/tracex2_user.c ind = next_key.index; next_key 68 samples/bpf/tracex2_user.c key = next_key; next_key 83 samples/bpf/tracex2_user.c struct hist_key key = {}, next_key; next_key 88 samples/bpf/tracex2_user.c while (bpf_map_get_next_key(fd, &key, &next_key) == 0) { next_key 92 samples/bpf/tracex2_user.c if (memcmp(&tasks[i], &next_key, SIZE) == 0) next_key 95 samples/bpf/tracex2_user.c memcpy(&tasks[task_cnt++], &next_key, SIZE); next_key 96 samples/bpf/tracex2_user.c key = next_key; next_key 119 samples/bpf/tracex2_user.c long key, next_key, value; next_key 148 samples/bpf/tracex2_user.c while (bpf_map_get_next_key(map_fd[0], &key, &next_key) == 0) { next_key 149 samples/bpf/tracex2_user.c bpf_map_lookup_elem(map_fd[0], &next_key, &value); next_key 150 samples/bpf/tracex2_user.c printf("location 0x%lx count %ld\n", next_key, value); next_key 151 samples/bpf/tracex2_user.c key = next_key; next_key 33 samples/bpf/tracex4_user.c __u64 key, next_key; next_key 39 samples/bpf/tracex4_user.c while (bpf_map_get_next_key(map_fd[0], &key, &next_key) == 0) { next_key 40 samples/bpf/tracex4_user.c bpf_map_lookup_elem(map_fd[0], &next_key, &v); next_key 41 samples/bpf/tracex4_user.c key = next_key; next_key 46 samples/bpf/tracex4_user.c next_key, (val - v.val) / 1000000000ll, v.ip); next_key 394 tools/include/uapi/linux/bpf.h __aligned_u64 next_key; next_key 419 tools/lib/bpf/bpf.c int bpf_map_get_next_key(int fd, const void *key, void *next_key) next_key 426 tools/lib/bpf/bpf.c attr.next_key = ptr_to_u64(next_key); next_key 121 tools/lib/bpf/bpf.h LIBBPF_API int bpf_map_get_next_key(int fd, const void *key, void *next_key); next_key 135 tools/perf/ui/tui/util.c goto next_key; next_key 154 tools/perf/ui/tui/util.c next_key: next_key 4685 tools/testing/selftests/bpf/test_btf.c bool percpu_map, unsigned int next_key, next_key 4698 tools/testing/selftests/bpf/test_btf.c percpu_map ? cpu : next_key, next_key 4723 tools/testing/selftests/bpf/test_btf.c percpu_map ? cpu : next_key, next_key 4856 tools/testing/selftests/bpf/test_btf.c unsigned int next_key; next_key 4860 tools/testing/selftests/bpf/test_btf.c next_key = ordered_map ? nr_read_elems : atoi(line); next_key 4861 tools/testing/selftests/bpf/test_btf.c set_pprint_mapv(mapv_kind, mapv, next_key, num_cpus, rounded_value_size); next_key 4880 tools/testing/selftests/bpf/test_btf.c next_key); next_key 4896 tools/testing/selftests/bpf/test_btf.c percpu_map, next_key, next_key 106 tools/testing/selftests/bpf/test_lru_map.c unsigned long long next_key = 0; next_key 110 tools/testing/selftests/bpf/test_lru_map.c while (!bpf_map_get_next_key(map1, &next_key, &next_key)) { next_key 111 tools/testing/selftests/bpf/test_lru_map.c assert(!bpf_map_lookup_elem(map1, &next_key, value1)); next_key 112 tools/testing/selftests/bpf/test_lru_map.c ret = bpf_map_lookup_elem(map0, &next_key, value0); next_key 115 tools/testing/selftests/bpf/test_lru_map.c next_key, strerror(errno), errno); next_key 120 tools/testing/selftests/bpf/test_lru_map.c next_key, value0[0], value1[0]); next_key 39 tools/testing/selftests/bpf/test_maps.c long long key, next_key, first_key, value; next_key 102 tools/testing/selftests/bpf/test_maps.c assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 && next_key 103 tools/testing/selftests/bpf/test_maps.c (next_key == first_key)); next_key 104 tools/testing/selftests/bpf/test_maps.c assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 && next_key 105 tools/testing/selftests/bpf/test_maps.c (next_key == 1 || next_key == 2) && next_key 106 tools/testing/selftests/bpf/test_maps.c (next_key != first_key)); next_key 107 tools/testing/selftests/bpf/test_maps.c assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 && next_key 119 tools/testing/selftests/bpf/test_maps.c assert(bpf_map_get_next_key(fd, NULL, &next_key) == -1 && next_key 121 tools/testing/selftests/bpf/test_maps.c assert(bpf_map_get_next_key(fd, &key, &next_key) == -1 && next_key 151 tools/testing/selftests/bpf/test_maps.c long long key, next_key, first_key; next_key 214 tools/testing/selftests/bpf/test_maps.c while (!bpf_map_get_next_key(fd, &key, &next_key)) { next_key 216 tools/testing/selftests/bpf/test_maps.c assert(next_key == first_key); next_key 219 tools/testing/selftests/bpf/test_maps.c assert((expected_key_mask & next_key) == next_key); next_key 220 tools/testing/selftests/bpf/test_maps.c expected_key_mask &= ~next_key; next_key 222 tools/testing/selftests/bpf/test_maps.c assert(bpf_map_lookup_elem(fd, &next_key, value) == 0); next_key 227 tools/testing/selftests/bpf/test_maps.c key = next_key; next_key 244 tools/testing/selftests/bpf/test_maps.c assert(bpf_map_get_next_key(fd, NULL, &next_key) == -1 && next_key 246 tools/testing/selftests/bpf/test_maps.c assert(bpf_map_get_next_key(fd, &key, &next_key) == -1 && next_key 277 tools/testing/selftests/bpf/test_maps.c long long key, value, next_key; next_key 283 tools/testing/selftests/bpf/test_maps.c &next_key) == 0; i++) { next_key 284 tools/testing/selftests/bpf/test_maps.c key = next_key; next_key 292 tools/testing/selftests/bpf/test_maps.c next_key_valid = bpf_map_get_next_key(fd, &key, &next_key) == 0; next_key 296 tools/testing/selftests/bpf/test_maps.c key = next_key; next_key 302 tools/testing/selftests/bpf/test_maps.c &next_key) == 0; i++) { next_key 303 tools/testing/selftests/bpf/test_maps.c key = next_key; next_key 347 tools/testing/selftests/bpf/test_maps.c int key, next_key, fd; next_key 384 tools/testing/selftests/bpf/test_maps.c assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 && next_key 385 tools/testing/selftests/bpf/test_maps.c next_key == 0); next_key 386 tools/testing/selftests/bpf/test_maps.c assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 && next_key 387 tools/testing/selftests/bpf/test_maps.c next_key == 0); next_key 388 tools/testing/selftests/bpf/test_maps.c assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 && next_key 389 tools/testing/selftests/bpf/test_maps.c next_key == 1); next_key 390 tools/testing/selftests/bpf/test_maps.c assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 && next_key 404 tools/testing/selftests/bpf/test_maps.c int key, next_key, fd, i; next_key 443 tools/testing/selftests/bpf/test_maps.c assert(bpf_map_get_next_key(fd, NULL, &next_key) == 0 && next_key 444 tools/testing/selftests/bpf/test_maps.c next_key == 0); next_key 445 tools/testing/selftests/bpf/test_maps.c assert(bpf_map_get_next_key(fd, &key, &next_key) == 0 && next_key 446 tools/testing/selftests/bpf/test_maps.c next_key == 0); next_key 447 tools/testing/selftests/bpf/test_maps.c assert(bpf_map_get_next_key(fd, &next_key, &next_key) == 0 && next_key 448 tools/testing/selftests/bpf/test_maps.c next_key == 1); next_key 449 tools/testing/selftests/bpf/test_maps.c assert(bpf_map_get_next_key(fd, &next_key, &next_key) == -1 && next_key 217 tools/testing/selftests/bpf/test_progs.c __u32 key, next_key; next_key 229 tools/testing/selftests/bpf/test_progs.c while (bpf_map_get_next_key(map1_fd, &key, &next_key) == 0) { next_key 230 tools/testing/selftests/bpf/test_progs.c err = bpf_map_lookup_elem(map2_fd, &next_key, val_buf); next_key 234 tools/testing/selftests/bpf/test_progs.c key = next_key; next_key 244 tools/testing/selftests/bpf/test_progs.c __u32 key, next_key, *cur_key_p, *next_key_p; next_key 267 tools/testing/selftests/bpf/test_progs.c next_key_p = &next_key; next_key 795 tools/testing/selftests/bpf/test_sockmap.c int i, key, next_key, err, tx_prog_fd = -1, zero = 0; next_key 1078 tools/testing/selftests/bpf/test_sockmap.c key = next_key = 0; next_key 1080 tools/testing/selftests/bpf/test_sockmap.c while (bpf_map_get_next_key(map_fd[i], &key, &next_key) == 0) { next_key 1082 tools/testing/selftests/bpf/test_sockmap.c key = next_key;