blob: 1626d51dfffd785027c114ac79fec72ea02b5f56 [file] [log] [blame]
Greg Kroah-Hartmanb2441312017-11-01 15:07:57 +01001// SPDX-License-Identifier: GPL-2.0
Alexei Starovoitovd822a192015-03-25 12:49:24 -07002#include <stdio.h>
3#include <unistd.h>
4#include <stdlib.h>
5#include <signal.h>
Alexei Starovoitovffeedaf2015-06-12 19:39:12 -07006#include <string.h>
Jesper Dangaard Brouer55de1702017-05-02 14:31:50 +02007#include <sys/resource.h>
Daniel Borkmanne00c7b22016-11-26 01:28:09 +01008
Jakub Kicinski2bf3e2e2018-05-14 22:35:02 -07009#include <bpf/bpf.h>
Daniel T. Lee63841bc2020-05-16 13:06:05 +090010#include <bpf/libbpf.h>
Daniel Borkmanne00c7b22016-11-26 01:28:09 +010011#include "bpf_util.h"
Alexei Starovoitovd822a192015-03-25 12:49:24 -070012
13#define MAX_INDEX 64
14#define MAX_STARS 38
15
Daniel T. Lee63841bc2020-05-16 13:06:05 +090016/* my_map, my_hist_map */
17static int map_fd[2];
18
Alexei Starovoitovd822a192015-03-25 12:49:24 -070019static void stars(char *str, long val, long max, int width)
20{
21 int i;
22
23 for (i = 0; i < (width * val / max) - 1 && i < width - 1; i++)
24 str[i] = '*';
25 if (val > max)
26 str[i - 1] = '+';
27 str[i] = '\0';
28}
29
Alexei Starovoitovffeedaf2015-06-12 19:39:12 -070030struct task {
31 char comm[16];
32 __u64 pid_tgid;
33 __u64 uid_gid;
34};
35
36struct hist_key {
37 struct task t;
38 __u32 index;
39};
40
41#define SIZE sizeof(struct task)
42
43static void print_hist_for_pid(int fd, void *task)
Alexei Starovoitovd822a192015-03-25 12:49:24 -070044{
Daniel Borkmanne00c7b22016-11-26 01:28:09 +010045 unsigned int nr_cpus = bpf_num_possible_cpus();
Alexei Starovoitovffeedaf2015-06-12 19:39:12 -070046 struct hist_key key = {}, next_key;
Alexei Starovoitov30593032016-02-01 22:39:58 -080047 long values[nr_cpus];
Alexei Starovoitovffeedaf2015-06-12 19:39:12 -070048 char starstr[MAX_STARS];
Alexei Starovoitovd822a192015-03-25 12:49:24 -070049 long value;
50 long data[MAX_INDEX] = {};
Alexei Starovoitovd822a192015-03-25 12:49:24 -070051 int max_ind = -1;
52 long max_value = 0;
Alexei Starovoitovffeedaf2015-06-12 19:39:12 -070053 int i, ind;
Alexei Starovoitovd822a192015-03-25 12:49:24 -070054
Joe Stringerd40fc182016-12-14 14:43:38 -080055 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) {
Alexei Starovoitovffeedaf2015-06-12 19:39:12 -070056 if (memcmp(&next_key, task, SIZE)) {
57 key = next_key;
58 continue;
59 }
Joe Stringerd40fc182016-12-14 14:43:38 -080060 bpf_map_lookup_elem(fd, &next_key, values);
Alexei Starovoitov30593032016-02-01 22:39:58 -080061 value = 0;
62 for (i = 0; i < nr_cpus; i++)
63 value += values[i];
Alexei Starovoitovffeedaf2015-06-12 19:39:12 -070064 ind = next_key.index;
65 data[ind] = value;
66 if (value && ind > max_ind)
67 max_ind = ind;
Alexei Starovoitovd822a192015-03-25 12:49:24 -070068 if (value > max_value)
69 max_value = value;
Alexei Starovoitovffeedaf2015-06-12 19:39:12 -070070 key = next_key;
Alexei Starovoitovd822a192015-03-25 12:49:24 -070071 }
72
73 printf(" syscall write() stats\n");
74 printf(" byte_size : count distribution\n");
75 for (i = 1; i <= max_ind + 1; i++) {
76 stars(starstr, data[i - 1], max_value, MAX_STARS);
77 printf("%8ld -> %-8ld : %-8ld |%-*s|\n",
78 (1l << i) >> 1, (1l << i) - 1, data[i - 1],
79 MAX_STARS, starstr);
80 }
81}
Alexei Starovoitovffeedaf2015-06-12 19:39:12 -070082
83static void print_hist(int fd)
84{
85 struct hist_key key = {}, next_key;
86 static struct task tasks[1024];
87 int task_cnt = 0;
88 int i;
89
Joe Stringerd40fc182016-12-14 14:43:38 -080090 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) {
Alexei Starovoitovffeedaf2015-06-12 19:39:12 -070091 int found = 0;
92
93 for (i = 0; i < task_cnt; i++)
94 if (memcmp(&tasks[i], &next_key, SIZE) == 0)
95 found = 1;
96 if (!found)
97 memcpy(&tasks[task_cnt++], &next_key, SIZE);
98 key = next_key;
99 }
100
101 for (i = 0; i < task_cnt; i++) {
102 printf("\npid %d cmd %s uid %d\n",
103 (__u32) tasks[i].pid_tgid,
104 tasks[i].comm,
105 (__u32) tasks[i].uid_gid);
106 print_hist_for_pid(fd, &tasks[i]);
107 }
108
109}
110
Alexei Starovoitovd822a192015-03-25 12:49:24 -0700111static void int_exit(int sig)
112{
113 print_hist(map_fd[1]);
114 exit(0);
115}
116
117int main(int ac, char **argv)
118{
Alexei Starovoitovd822a192015-03-25 12:49:24 -0700119 long key, next_key, value;
Daniel T. Lee63841bc2020-05-16 13:06:05 +0900120 struct bpf_link *links[2];
121 struct bpf_program *prog;
122 struct bpf_object *obj;
123 char filename[256];
124 int i, j = 0;
Alexei Starovoitovd822a192015-03-25 12:49:24 -0700125 FILE *f;
Alexei Starovoitovd822a192015-03-25 12:49:24 -0700126
Daniel T. Lee63841bc2020-05-16 13:06:05 +0900127 snprintf(filename, sizeof(filename), "%s_kern.o", argv[0]);
128 obj = bpf_object__open_file(filename, NULL);
129 if (libbpf_get_error(obj)) {
130 fprintf(stderr, "ERROR: opening BPF object file failed\n");
131 return 0;
132 }
133
134 /* load BPF program */
135 if (bpf_object__load(obj)) {
136 fprintf(stderr, "ERROR: loading BPF object file failed\n");
137 goto cleanup;
138 }
139
140 map_fd[0] = bpf_object__find_map_fd_by_name(obj, "my_map");
141 map_fd[1] = bpf_object__find_map_fd_by_name(obj, "my_hist_map");
142 if (map_fd[0] < 0 || map_fd[1] < 0) {
143 fprintf(stderr, "ERROR: finding a map in obj file failed\n");
144 goto cleanup;
145 }
146
Alexei Starovoitovd822a192015-03-25 12:49:24 -0700147 signal(SIGINT, int_exit);
Andy Gospodarekad990db2017-05-11 15:52:30 -0400148 signal(SIGTERM, int_exit);
Alexei Starovoitovd822a192015-03-25 12:49:24 -0700149
150 /* start 'ping' in the background to have some kfree_skb events */
Jakub Kicinski5c3cf872019-02-27 19:04:10 -0800151 f = popen("ping -4 -c5 localhost", "r");
Alexei Starovoitovd822a192015-03-25 12:49:24 -0700152 (void) f;
153
154 /* start 'dd' in the background to have plenty of 'write' syscalls */
155 f = popen("dd if=/dev/zero of=/dev/null count=5000000", "r");
156 (void) f;
157
Daniel T. Lee63841bc2020-05-16 13:06:05 +0900158 bpf_object__for_each_program(prog, obj) {
159 links[j] = bpf_program__attach(prog);
160 if (libbpf_get_error(links[j])) {
161 fprintf(stderr, "ERROR: bpf_program__attach failed\n");
162 links[j] = NULL;
163 goto cleanup;
164 }
165 j++;
Alexei Starovoitovd822a192015-03-25 12:49:24 -0700166 }
167
168 for (i = 0; i < 5; i++) {
169 key = 0;
Joe Stringerd40fc182016-12-14 14:43:38 -0800170 while (bpf_map_get_next_key(map_fd[0], &key, &next_key) == 0) {
171 bpf_map_lookup_elem(map_fd[0], &next_key, &value);
Alexei Starovoitovd822a192015-03-25 12:49:24 -0700172 printf("location 0x%lx count %ld\n", next_key, value);
173 key = next_key;
174 }
175 if (key)
176 printf("\n");
177 sleep(1);
178 }
179 print_hist(map_fd[1]);
180
Daniel T. Lee63841bc2020-05-16 13:06:05 +0900181cleanup:
182 for (j--; j >= 0; j--)
183 bpf_link__destroy(links[j]);
184
185 bpf_object__close(obj);
Alexei Starovoitovd822a192015-03-25 12:49:24 -0700186 return 0;
187}