| /samples/bpf/ |
| D | test_maps.c | 23 long long key, next_key, value; in test_hashmap_sanity() local
26 map_fd = bpf_create_map(BPF_MAP_TYPE_HASH, sizeof(key), sizeof(value), 2); in test_hashmap_sanity()
32 key = 1; in test_hashmap_sanity()
35 assert(bpf_update_elem(map_fd, &key, &value, BPF_ANY) == 0); in test_hashmap_sanity()
39 assert(bpf_update_elem(map_fd, &key, &value, BPF_NOEXIST) == -1 && in test_hashmap_sanity()
43 assert(bpf_update_elem(map_fd, &key, &value, -1) == -1 && errno == EINVAL); in test_hashmap_sanity()
46 assert(bpf_lookup_elem(map_fd, &key, &value) == 0 && value == 1234); in test_hashmap_sanity()
48 key = 2; in test_hashmap_sanity()
50 assert(bpf_lookup_elem(map_fd, &key, &value) == -1 && errno == ENOENT); in test_hashmap_sanity()
53 assert(bpf_update_elem(map_fd, &key, &value, BPF_EXIST) == -1 && in test_hashmap_sanity()
[all …]
|
| D | tracex3_user.c | 23 __u32 key; in clear_stats() local
26 for (key = 0; key < SLOTS; key++) in clear_stats()
27 bpf_update_elem(fd, &key, &value, BPF_ANY); in clear_stats()
78 __u32 key; in print_hist() local
84 for (key = 0; key < SLOTS; key++) { in print_hist()
86 bpf_lookup_elem(fd, &key, &value); in print_hist()
87 cnt[key] = value; in print_hist()
93 for (key = full_range ? 0 : 29; key < SLOTS; key++) { in print_hist()
94 int c = num_colors * cnt[key] / (max_cnt + 1); in print_hist()
|
| D | sockex1_user.c | 32 int key; in main() local
34 key = IPPROTO_TCP; in main()
35 assert(bpf_lookup_elem(map_fd[0], &key, &tcp_cnt) == 0); in main()
37 key = IPPROTO_UDP; in main()
38 assert(bpf_lookup_elem(map_fd[0], &key, &udp_cnt) == 0); in main()
40 key = IPPROTO_ICMP; in main()
41 assert(bpf_lookup_elem(map_fd[0], &key, &icmp_cnt) == 0); in main()
|
| D | tracex2_user.c | 39 struct hist_key key = {}, next_key; in print_hist_for_pid() local
47 while (bpf_get_next_key(fd, &key, &next_key) == 0) { in print_hist_for_pid()
49 key = next_key; in print_hist_for_pid()
59 key = next_key; in print_hist_for_pid()
74 struct hist_key key = {}, next_key; in print_hist() local
79 while (bpf_get_next_key(fd, &key, &next_key) == 0) { in print_hist()
87 key = next_key; in print_hist()
109 long key, next_key, value; in main() local
131 key = 0; in main()
132 while (bpf_get_next_key(map_fd[0], &key, &next_key) == 0) { in main()
[all …]
|
| D | sock_example.c | 33 int sock = -1, map_fd, prog_fd, i, key; in test_sock() local
36 map_fd = bpf_create_map(BPF_MAP_TYPE_ARRAY, sizeof(key), sizeof(value), in test_sock()
74 key = IPPROTO_TCP; in test_sock()
75 assert(bpf_lookup_elem(map_fd, &key, &tcp_cnt) == 0); in test_sock()
77 key = IPPROTO_UDP; in test_sock()
78 assert(bpf_lookup_elem(map_fd, &key, &udp_cnt) == 0); in test_sock()
80 key = IPPROTO_ICMP; in test_sock()
81 assert(bpf_lookup_elem(map_fd, &key, &icmp_cnt) == 0); in test_sock()
|
| D | libbpf.c | 34 int bpf_update_elem(int fd, void *key, void *value, unsigned long long flags) in bpf_update_elem() argument
38 .key = ptr_to_u64(key), in bpf_update_elem()
46 int bpf_lookup_elem(int fd, void *key, void *value) in bpf_lookup_elem() argument
50 .key = ptr_to_u64(key), in bpf_lookup_elem()
57 int bpf_delete_elem(int fd, void *key) in bpf_delete_elem() argument
61 .key = ptr_to_u64(key), in bpf_delete_elem()
67 int bpf_get_next_key(int fd, void *key, void *next_key) in bpf_get_next_key() argument
71 .key = ptr_to_u64(key), in bpf_get_next_key()
|
| D | tracex2_kern.c | 85 struct hist_key key = {}; in bpf_prog3() local
87 key.index = log2l(write_size); in bpf_prog3()
88 key.pid_tgid = bpf_get_current_pid_tgid(); in bpf_prog3()
89 key.uid_gid = bpf_get_current_uid_gid(); in bpf_prog3()
90 bpf_get_current_comm(&key.comm, sizeof(key.comm)); in bpf_prog3()
92 value = bpf_map_lookup_elem(&my_hist_map, &key); in bpf_prog3()
96 bpf_map_update_elem(&my_hist_map, &key, &init_val, BPF_ANY); in bpf_prog3()
|
| D | tracex4_user.c | 34 __u64 key, next_key; in print_old_objects() local
37 key = write(1, "\e[1;1H\e[2J", 12); /* clear screen */ in print_old_objects()
39 key = -1; in print_old_objects()
40 while (bpf_get_next_key(map_fd[0], &key, &next_key) == 0) { in print_old_objects()
42 key = next_key; in print_old_objects()
|
| D | tracex6_kern.c | 17 u32 key = bpf_get_smp_processor_id(); in bpf_prog1() local
20 count = bpf_perf_event_read(&my_map, key); in bpf_prog1()
21 bpf_trace_printk(fmt, sizeof(fmt), key, count); in bpf_prog1()
|
| D | fds_example.c | 66 static int bpf_do_map(const char *file, uint32_t flags, uint32_t key, in bpf_do_map() argument
86 ret = bpf_update_elem(fd, &key, &value, 0); in bpf_do_map()
87 printf("bpf: fd:%d u->(%u:%u) ret:(%d,%s)\n", fd, key, value, in bpf_do_map()
91 ret = bpf_lookup_elem(fd, &key, &value); in bpf_do_map()
92 printf("bpf: fd:%d l->(%u):%u ret:(%d,%s)\n", fd, key, value, in bpf_do_map()
132 uint32_t key = 0, value = 0, flags = 0; in main() local
152 key = strtoul(optarg, NULL, 0); in main()
176 return bpf_do_map(file, flags, key, value); in main()
|
| D | sockex2_user.c | 36 int key = 0, next_key; in main() local
39 while (bpf_get_next_key(map_fd[0], &key, &next_key) == 0) { in main()
44 key = next_key; in main()
|
| D | sockex3_user.c | 49 struct flow_keys key = {}, next_key; in main() local
54 while (bpf_get_next_key(map_fd[2], &key, &next_key) == 0) { in main()
62 key = next_key; in main()
|
| D | lathist_kern.c | 75 int key, cpu; in bpf_prog2() local
89 key = cpu * MAX_ENTRIES + delta; in bpf_prog2()
90 val = bpf_map_lookup_elem(&my_lat, &key); in bpf_prog2()
|
| D | lathist_user.c | 67 long key, value; in get_data() local
75 key = c * MAX_ENTRIES + i; in get_data()
76 bpf_lookup_elem(fd, &key, &value); in get_data()
|
| D | bpf_helpers.h | 11 static void *(*bpf_map_lookup_elem)(void *map, void *key) =
13 static int (*bpf_map_update_elem)(void *map, void *key, void *value,
16 static int (*bpf_map_delete_elem)(void *map, void *key) =
|
| D | libbpf.h | 9 int bpf_update_elem(int fd, void *key, void *value, unsigned long long flags);
10 int bpf_lookup_elem(int fd, void *key, void *value);
11 int bpf_delete_elem(int fd, void *key);
12 int bpf_get_next_key(int fd, void *key, void *next_key);
|
| D | sockex3_kern.c | 104 u32 key = bpf_get_smp_processor_id(); in this_cpu_globals() local
106 return bpf_map_lookup_elem(&percpu_map, &key); in this_cpu_globals()
124 struct flow_keys key = g->flow; in update_stats() local
127 value = bpf_map_lookup_elem(&hash_map, &key); in update_stats()
134 bpf_map_update_elem(&hash_map, &key, &val, BPF_ANY); in update_stats()
|
| D | sockex2_kern.c | 203 u32 key; in bpf_prog2() local
208 key = flow.dst; in bpf_prog2()
209 value = bpf_map_lookup_elem(&hash_map, &key); in bpf_prog2()
216 bpf_map_update_elem(&hash_map, &key, &val, BPF_ANY); in bpf_prog2()
|
| D | trace_output_user.c | 160 int key = 0; in test_bpf_perf_event() local
165 assert(bpf_update_elem(map_fd[0], &key, &pmu_fd, BPF_ANY) == 0); in test_bpf_perf_event()
|