/kernel/linux/linux-5.10/samples/bpf/ |
H A 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, SIZ in print_hist() 120 long key, next_key, value; main() local [all...] |
H A 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()
|
H A 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()
|
H A 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()
|
H A 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()
|
H A 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()
|
H A 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()
|
H A 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()
|
H A 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()
|
/kernel/linux/linux-6.6/samples/bpf/ |
H A 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, SIZ in print_hist() 118 long key, next_key, value; main() local [all...] |
H A 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()
|
H A D | sockex3_user.c | 80 struct flow_key_record key = {}, next_key; in main() local 85 while (bpf_map_get_next_key(hash_map_fd, &key, &next_key) == 0) { in main() 86 bpf_map_lookup_elem(hash_map_fd, &next_key, &value); in main() 88 inet_ntoa((struct in_addr){htonl(next_key.src)}), in main() 89 next_key.port16[0], in main() 90 inet_ntoa((struct in_addr){htonl(next_key.dst)}), in main() 91 next_key.port16[1], in main() 93 key = next_key; in main()
|
H A D | spintest_user.c | 14 long key, next_key, value; in main() local 58 while (bpf_map_get_next_key(map_fd, &key, &next_key) == 0) { in main() 59 bpf_map_lookup_elem(map_fd, &next_key, &value); in main() 60 assert(next_key == value); in main() 62 key = next_key; in main() 73 while (bpf_map_get_next_key(map_fd, &key, &next_key) == 0) in main() 74 bpf_map_delete_elem(map_fd, &next_key); in main()
|
H A 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()
|
H A 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()
|
H A 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()
|
H A 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()
|
H A 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()
|
/kernel/linux/linux-5.10/tools/testing/selftests/bpf/ |
H A 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) in test_hashmap() 151 long long key, next_key, first_key; test_hashmap_percpu() local 277 long long key, value, next_key; test_hashmap_walk() local 347 int key, next_key, fd; test_arraymap() local 404 int key, next_key, fd, i; test_arraymap_percpu() local [all...] |
H A 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()
|
/kernel/linux/linux-6.6/tools/testing/selftests/bpf/ |
H A 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) < in test_hashmap() 156 long long key, next_key, first_key; test_hashmap_percpu() local 293 long long key, value[VALUE_SIZE], next_key; test_hashmap_walk() local 363 int key, next_key, fd; test_arraymap() local 419 int key, next_key, fd, i; test_arraymap_percpu() local [all...] |
/third_party/libdrm/tests/ |
H A D | drmsl.c | 114 unsigned long next_key = 0; in print_neighbors() local 121 &next_key, &next_value); in print_neighbors() 123 key, retval, prev_key, next_key); in print_neighbors() 129 if (next_key != expected_next) { in print_neighbors() 131 next_key, expected_next); in print_neighbors()
|
/third_party/musl/src/thread/ |
H A D | pthread_key_create.c | 13 static pthread_key_t next_key; variable 45 pthread_key_t j = next_key; in __pthread_key_create() 48 keys[next_key = *k = j] = dtor; in __pthread_key_create() 52 } while ((j=(j+1)%PTHREAD_KEYS_MAX) != next_key); in __pthread_key_create()
|
/third_party/mesa3d/src/gallium/frontends/nine/ |
H A D | vertexshader9.h | 76 uint64_t next_key; member 121 vs->next_key = key; in NineVertexShader9_UpdateKey()
|
H A D | pixelshader9.h | 66 uint64_t next_key; member 133 ps->next_key = key; in NinePixelShader9_UpdateKey()
|