1b2441318SGreg Kroah-Hartman // SPDX-License-Identifier: GPL-2.0
2d822a192SAlexei Starovoitov #include <stdio.h>
3d822a192SAlexei Starovoitov #include <unistd.h>
4d822a192SAlexei Starovoitov #include <stdlib.h>
5d822a192SAlexei Starovoitov #include <signal.h>
6ffeedafbSAlexei Starovoitov #include <string.h>
7e00c7b21SDaniel Borkmann
82bf3e2efSJakub Kicinski #include <bpf/bpf.h>
963841bc0SDaniel T. Lee #include <bpf/libbpf.h>
10e00c7b21SDaniel Borkmann #include "bpf_util.h"
11d822a192SAlexei Starovoitov
12d822a192SAlexei Starovoitov #define MAX_INDEX 64
13d822a192SAlexei Starovoitov #define MAX_STARS 38
14d822a192SAlexei Starovoitov
1563841bc0SDaniel T. Lee /* my_map, my_hist_map */
1663841bc0SDaniel T. Lee static int map_fd[2];
1763841bc0SDaniel T. Lee
stars(char * str,long val,long max,int width)18d822a192SAlexei Starovoitov static void stars(char *str, long val, long max, int width)
19d822a192SAlexei Starovoitov {
20d822a192SAlexei Starovoitov int i;
21d822a192SAlexei Starovoitov
22d822a192SAlexei Starovoitov for (i = 0; i < (width * val / max) - 1 && i < width - 1; i++)
23d822a192SAlexei Starovoitov str[i] = '*';
24d822a192SAlexei Starovoitov if (val > max)
25d822a192SAlexei Starovoitov str[i - 1] = '+';
26d822a192SAlexei Starovoitov str[i] = '\0';
27d822a192SAlexei Starovoitov }
28d822a192SAlexei Starovoitov
29ffeedafbSAlexei Starovoitov struct task {
30ffeedafbSAlexei Starovoitov char comm[16];
31ffeedafbSAlexei Starovoitov __u64 pid_tgid;
32ffeedafbSAlexei Starovoitov __u64 uid_gid;
33ffeedafbSAlexei Starovoitov };
34ffeedafbSAlexei Starovoitov
35ffeedafbSAlexei Starovoitov struct hist_key {
36ffeedafbSAlexei Starovoitov struct task t;
37ffeedafbSAlexei Starovoitov __u32 index;
38ffeedafbSAlexei Starovoitov };
39ffeedafbSAlexei Starovoitov
40ffeedafbSAlexei Starovoitov #define SIZE sizeof(struct task)
41ffeedafbSAlexei Starovoitov
print_hist_for_pid(int fd,void * task)42ffeedafbSAlexei Starovoitov static void print_hist_for_pid(int fd, void *task)
43d822a192SAlexei Starovoitov {
44e00c7b21SDaniel Borkmann unsigned int nr_cpus = bpf_num_possible_cpus();
45ffeedafbSAlexei Starovoitov struct hist_key key = {}, next_key;
463059303fSAlexei Starovoitov long values[nr_cpus];
47ffeedafbSAlexei Starovoitov char starstr[MAX_STARS];
48d822a192SAlexei Starovoitov long value;
49d822a192SAlexei Starovoitov long data[MAX_INDEX] = {};
50d822a192SAlexei Starovoitov int max_ind = -1;
51d822a192SAlexei Starovoitov long max_value = 0;
52ffeedafbSAlexei Starovoitov int i, ind;
53d822a192SAlexei Starovoitov
54d40fc181SJoe Stringer while (bpf_map_get_next_key(fd, &key, &next_key) == 0) {
55ffeedafbSAlexei Starovoitov if (memcmp(&next_key, task, SIZE)) {
56ffeedafbSAlexei Starovoitov key = next_key;
57ffeedafbSAlexei Starovoitov continue;
58ffeedafbSAlexei Starovoitov }
59d40fc181SJoe Stringer bpf_map_lookup_elem(fd, &next_key, values);
603059303fSAlexei Starovoitov value = 0;
613059303fSAlexei Starovoitov for (i = 0; i < nr_cpus; i++)
623059303fSAlexei Starovoitov value += values[i];
63ffeedafbSAlexei Starovoitov ind = next_key.index;
64ffeedafbSAlexei Starovoitov data[ind] = value;
65ffeedafbSAlexei Starovoitov if (value && ind > max_ind)
66ffeedafbSAlexei Starovoitov max_ind = ind;
67d822a192SAlexei Starovoitov if (value > max_value)
68d822a192SAlexei Starovoitov max_value = value;
69ffeedafbSAlexei Starovoitov key = next_key;
70d822a192SAlexei Starovoitov }
71d822a192SAlexei Starovoitov
72d822a192SAlexei Starovoitov printf(" syscall write() stats\n");
73d822a192SAlexei Starovoitov printf(" byte_size : count distribution\n");
74d822a192SAlexei Starovoitov for (i = 1; i <= max_ind + 1; i++) {
75d822a192SAlexei Starovoitov stars(starstr, data[i - 1], max_value, MAX_STARS);
76d822a192SAlexei Starovoitov printf("%8ld -> %-8ld : %-8ld |%-*s|\n",
77d822a192SAlexei Starovoitov (1l << i) >> 1, (1l << i) - 1, data[i - 1],
78d822a192SAlexei Starovoitov MAX_STARS, starstr);
79d822a192SAlexei Starovoitov }
80d822a192SAlexei Starovoitov }
81ffeedafbSAlexei Starovoitov
print_hist(int fd)82ffeedafbSAlexei Starovoitov static void print_hist(int fd)
83ffeedafbSAlexei Starovoitov {
84ffeedafbSAlexei Starovoitov struct hist_key key = {}, next_key;
85ffeedafbSAlexei Starovoitov static struct task tasks[1024];
86ffeedafbSAlexei Starovoitov int task_cnt = 0;
87ffeedafbSAlexei Starovoitov int i;
88ffeedafbSAlexei Starovoitov
89d40fc181SJoe Stringer while (bpf_map_get_next_key(fd, &key, &next_key) == 0) {
90ffeedafbSAlexei Starovoitov int found = 0;
91ffeedafbSAlexei Starovoitov
92ffeedafbSAlexei Starovoitov for (i = 0; i < task_cnt; i++)
93ffeedafbSAlexei Starovoitov if (memcmp(&tasks[i], &next_key, SIZE) == 0)
94ffeedafbSAlexei Starovoitov found = 1;
95ffeedafbSAlexei Starovoitov if (!found)
96ffeedafbSAlexei Starovoitov memcpy(&tasks[task_cnt++], &next_key, SIZE);
97ffeedafbSAlexei Starovoitov key = next_key;
98ffeedafbSAlexei Starovoitov }
99ffeedafbSAlexei Starovoitov
100ffeedafbSAlexei Starovoitov for (i = 0; i < task_cnt; i++) {
101ffeedafbSAlexei Starovoitov printf("\npid %d cmd %s uid %d\n",
102ffeedafbSAlexei Starovoitov (__u32) tasks[i].pid_tgid,
103ffeedafbSAlexei Starovoitov tasks[i].comm,
104ffeedafbSAlexei Starovoitov (__u32) tasks[i].uid_gid);
105ffeedafbSAlexei Starovoitov print_hist_for_pid(fd, &tasks[i]);
106ffeedafbSAlexei Starovoitov }
107ffeedafbSAlexei Starovoitov
108ffeedafbSAlexei Starovoitov }
109ffeedafbSAlexei Starovoitov
int_exit(int sig)110d822a192SAlexei Starovoitov static void int_exit(int sig)
111d822a192SAlexei Starovoitov {
112d822a192SAlexei Starovoitov print_hist(map_fd[1]);
113d822a192SAlexei Starovoitov exit(0);
114d822a192SAlexei Starovoitov }
115d822a192SAlexei Starovoitov
main(int ac,char ** argv)116d822a192SAlexei Starovoitov int main(int ac, char **argv)
117d822a192SAlexei Starovoitov {
118d822a192SAlexei Starovoitov long key, next_key, value;
11963841bc0SDaniel T. Lee struct bpf_link *links[2];
12063841bc0SDaniel T. Lee struct bpf_program *prog;
12163841bc0SDaniel T. Lee struct bpf_object *obj;
12263841bc0SDaniel T. Lee char filename[256];
12363841bc0SDaniel T. Lee int i, j = 0;
124d822a192SAlexei Starovoitov FILE *f;
125d822a192SAlexei Starovoitov
126*d4fffba4SDaniel T. Lee snprintf(filename, sizeof(filename), "%s.bpf.o", argv[0]);
12763841bc0SDaniel T. Lee obj = bpf_object__open_file(filename, NULL);
12863841bc0SDaniel T. Lee if (libbpf_get_error(obj)) {
12963841bc0SDaniel T. Lee fprintf(stderr, "ERROR: opening BPF object file failed\n");
13063841bc0SDaniel T. Lee return 0;
13163841bc0SDaniel T. Lee }
13263841bc0SDaniel T. Lee
13363841bc0SDaniel T. Lee /* load BPF program */
13463841bc0SDaniel T. Lee if (bpf_object__load(obj)) {
13563841bc0SDaniel T. Lee fprintf(stderr, "ERROR: loading BPF object file failed\n");
13663841bc0SDaniel T. Lee goto cleanup;
13763841bc0SDaniel T. Lee }
13863841bc0SDaniel T. Lee
13963841bc0SDaniel T. Lee map_fd[0] = bpf_object__find_map_fd_by_name(obj, "my_map");
14063841bc0SDaniel T. Lee map_fd[1] = bpf_object__find_map_fd_by_name(obj, "my_hist_map");
14163841bc0SDaniel T. Lee if (map_fd[0] < 0 || map_fd[1] < 0) {
14263841bc0SDaniel T. Lee fprintf(stderr, "ERROR: finding a map in obj file failed\n");
14363841bc0SDaniel T. Lee goto cleanup;
14463841bc0SDaniel T. Lee }
14563841bc0SDaniel T. Lee
146d822a192SAlexei Starovoitov signal(SIGINT, int_exit);
147ad990dbeSAndy Gospodarek signal(SIGTERM, int_exit);
148d822a192SAlexei Starovoitov
1491baa7e38SRong Tao /* start 'ping' in the background to have some kfree_skb_reason
1501baa7e38SRong Tao * events */
1515c3cf87dSJakub Kicinski f = popen("ping -4 -c5 localhost", "r");
152d822a192SAlexei Starovoitov (void) f;
153d822a192SAlexei Starovoitov
154d822a192SAlexei Starovoitov /* start 'dd' in the background to have plenty of 'write' syscalls */
155d822a192SAlexei Starovoitov f = popen("dd if=/dev/zero of=/dev/null count=5000000", "r");
156d822a192SAlexei Starovoitov (void) f;
157d822a192SAlexei Starovoitov
15863841bc0SDaniel T. Lee bpf_object__for_each_program(prog, obj) {
15963841bc0SDaniel T. Lee links[j] = bpf_program__attach(prog);
16063841bc0SDaniel T. Lee if (libbpf_get_error(links[j])) {
16163841bc0SDaniel T. Lee fprintf(stderr, "ERROR: bpf_program__attach failed\n");
16263841bc0SDaniel T. Lee links[j] = NULL;
16363841bc0SDaniel T. Lee goto cleanup;
16463841bc0SDaniel T. Lee }
16563841bc0SDaniel T. Lee j++;
166d822a192SAlexei Starovoitov }
167d822a192SAlexei Starovoitov
168d822a192SAlexei Starovoitov for (i = 0; i < 5; i++) {
169d822a192SAlexei Starovoitov key = 0;
170d40fc181SJoe Stringer while (bpf_map_get_next_key(map_fd[0], &key, &next_key) == 0) {
171d40fc181SJoe Stringer bpf_map_lookup_elem(map_fd[0], &next_key, &value);
172d822a192SAlexei Starovoitov printf("location 0x%lx count %ld\n", next_key, value);
173d822a192SAlexei Starovoitov key = next_key;
174d822a192SAlexei Starovoitov }
175d822a192SAlexei Starovoitov if (key)
176d822a192SAlexei Starovoitov printf("\n");
177d822a192SAlexei Starovoitov sleep(1);
178d822a192SAlexei Starovoitov }
179d822a192SAlexei Starovoitov print_hist(map_fd[1]);
180d822a192SAlexei Starovoitov
18163841bc0SDaniel T. Lee cleanup:
18263841bc0SDaniel T. Lee for (j--; j >= 0; j--)
18363841bc0SDaniel T. Lee bpf_link__destroy(links[j]);
18463841bc0SDaniel T. Lee
18563841bc0SDaniel T. Lee bpf_object__close(obj);
186d822a192SAlexei Starovoitov return 0;
187d822a192SAlexei Starovoitov }
188