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> 6d822a192SAlexei Starovoitov #include <linux/bpf.h> 7ffeedafbSAlexei Starovoitov #include <string.h> 855de1703SJesper Dangaard Brouer #include <sys/resource.h> 9e00c7b21SDaniel Borkmann 10d822a192SAlexei Starovoitov #include "libbpf.h" 11d822a192SAlexei Starovoitov #include "bpf_load.h" 12e00c7b21SDaniel Borkmann #include "bpf_util.h" 13d822a192SAlexei Starovoitov 14d822a192SAlexei Starovoitov #define MAX_INDEX 64 15d822a192SAlexei Starovoitov #define MAX_STARS 38 16d822a192SAlexei Starovoitov 17d822a192SAlexei Starovoitov static void stars(char *str, long val, long max, int width) 18d822a192SAlexei Starovoitov { 19d822a192SAlexei Starovoitov int i; 20d822a192SAlexei Starovoitov 21d822a192SAlexei Starovoitov for (i = 0; i < (width * val / max) - 1 && i < width - 1; i++) 22d822a192SAlexei Starovoitov str[i] = '*'; 23d822a192SAlexei Starovoitov if (val > max) 24d822a192SAlexei Starovoitov str[i - 1] = '+'; 25d822a192SAlexei Starovoitov str[i] = '\0'; 26d822a192SAlexei Starovoitov } 27d822a192SAlexei Starovoitov 28ffeedafbSAlexei Starovoitov struct task { 29ffeedafbSAlexei Starovoitov char comm[16]; 30ffeedafbSAlexei Starovoitov __u64 pid_tgid; 31ffeedafbSAlexei Starovoitov __u64 uid_gid; 32ffeedafbSAlexei Starovoitov }; 33ffeedafbSAlexei Starovoitov 34ffeedafbSAlexei Starovoitov struct hist_key { 35ffeedafbSAlexei Starovoitov struct task t; 36ffeedafbSAlexei Starovoitov __u32 index; 37ffeedafbSAlexei Starovoitov }; 38ffeedafbSAlexei Starovoitov 39ffeedafbSAlexei Starovoitov #define SIZE sizeof(struct task) 40ffeedafbSAlexei Starovoitov 41ffeedafbSAlexei Starovoitov static void print_hist_for_pid(int fd, void *task) 42d822a192SAlexei Starovoitov { 43e00c7b21SDaniel Borkmann unsigned int nr_cpus = bpf_num_possible_cpus(); 44ffeedafbSAlexei Starovoitov struct hist_key key = {}, next_key; 453059303fSAlexei Starovoitov long values[nr_cpus]; 46ffeedafbSAlexei Starovoitov char starstr[MAX_STARS]; 47d822a192SAlexei Starovoitov long value; 48d822a192SAlexei Starovoitov long data[MAX_INDEX] = {}; 49d822a192SAlexei Starovoitov int max_ind = -1; 50d822a192SAlexei Starovoitov long max_value = 0; 51ffeedafbSAlexei Starovoitov int i, ind; 52d822a192SAlexei Starovoitov 53d40fc181SJoe Stringer while (bpf_map_get_next_key(fd, &key, &next_key) == 0) { 54ffeedafbSAlexei Starovoitov if (memcmp(&next_key, task, SIZE)) { 55ffeedafbSAlexei Starovoitov key = next_key; 56ffeedafbSAlexei Starovoitov continue; 57ffeedafbSAlexei Starovoitov } 58d40fc181SJoe Stringer bpf_map_lookup_elem(fd, &next_key, values); 593059303fSAlexei Starovoitov value = 0; 603059303fSAlexei Starovoitov for (i = 0; i < nr_cpus; i++) 613059303fSAlexei Starovoitov value += values[i]; 62ffeedafbSAlexei Starovoitov ind = next_key.index; 63ffeedafbSAlexei Starovoitov data[ind] = value; 64ffeedafbSAlexei Starovoitov if (value && ind > max_ind) 65ffeedafbSAlexei Starovoitov max_ind = ind; 66d822a192SAlexei Starovoitov if (value > max_value) 67d822a192SAlexei Starovoitov max_value = value; 68ffeedafbSAlexei Starovoitov key = next_key; 69d822a192SAlexei Starovoitov } 70d822a192SAlexei Starovoitov 71d822a192SAlexei Starovoitov printf(" syscall write() stats\n"); 72d822a192SAlexei Starovoitov printf(" byte_size : count distribution\n"); 73d822a192SAlexei Starovoitov for (i = 1; i <= max_ind + 1; i++) { 74d822a192SAlexei Starovoitov stars(starstr, data[i - 1], max_value, MAX_STARS); 75d822a192SAlexei Starovoitov printf("%8ld -> %-8ld : %-8ld |%-*s|\n", 76d822a192SAlexei Starovoitov (1l << i) >> 1, (1l << i) - 1, data[i - 1], 77d822a192SAlexei Starovoitov MAX_STARS, starstr); 78d822a192SAlexei Starovoitov } 79d822a192SAlexei Starovoitov } 80ffeedafbSAlexei Starovoitov 81ffeedafbSAlexei Starovoitov static void print_hist(int fd) 82ffeedafbSAlexei Starovoitov { 83ffeedafbSAlexei Starovoitov struct hist_key key = {}, next_key; 84ffeedafbSAlexei Starovoitov static struct task tasks[1024]; 85ffeedafbSAlexei Starovoitov int task_cnt = 0; 86ffeedafbSAlexei Starovoitov int i; 87ffeedafbSAlexei Starovoitov 88d40fc181SJoe Stringer while (bpf_map_get_next_key(fd, &key, &next_key) == 0) { 89ffeedafbSAlexei Starovoitov int found = 0; 90ffeedafbSAlexei Starovoitov 91ffeedafbSAlexei Starovoitov for (i = 0; i < task_cnt; i++) 92ffeedafbSAlexei Starovoitov if (memcmp(&tasks[i], &next_key, SIZE) == 0) 93ffeedafbSAlexei Starovoitov found = 1; 94ffeedafbSAlexei Starovoitov if (!found) 95ffeedafbSAlexei Starovoitov memcpy(&tasks[task_cnt++], &next_key, SIZE); 96ffeedafbSAlexei Starovoitov key = next_key; 97ffeedafbSAlexei Starovoitov } 98ffeedafbSAlexei Starovoitov 99ffeedafbSAlexei Starovoitov for (i = 0; i < task_cnt; i++) { 100ffeedafbSAlexei Starovoitov printf("\npid %d cmd %s uid %d\n", 101ffeedafbSAlexei Starovoitov (__u32) tasks[i].pid_tgid, 102ffeedafbSAlexei Starovoitov tasks[i].comm, 103ffeedafbSAlexei Starovoitov (__u32) tasks[i].uid_gid); 104ffeedafbSAlexei Starovoitov print_hist_for_pid(fd, &tasks[i]); 105ffeedafbSAlexei Starovoitov } 106ffeedafbSAlexei Starovoitov 107ffeedafbSAlexei Starovoitov } 108ffeedafbSAlexei Starovoitov 109d822a192SAlexei Starovoitov static void int_exit(int sig) 110d822a192SAlexei Starovoitov { 111d822a192SAlexei Starovoitov print_hist(map_fd[1]); 112d822a192SAlexei Starovoitov exit(0); 113d822a192SAlexei Starovoitov } 114d822a192SAlexei Starovoitov 115d822a192SAlexei Starovoitov int main(int ac, char **argv) 116d822a192SAlexei Starovoitov { 11755de1703SJesper Dangaard Brouer struct rlimit r = {1024*1024, RLIM_INFINITY}; 118d822a192SAlexei Starovoitov char filename[256]; 119d822a192SAlexei Starovoitov long key, next_key, value; 120d822a192SAlexei Starovoitov FILE *f; 121d822a192SAlexei Starovoitov int i; 122d822a192SAlexei Starovoitov 123d822a192SAlexei Starovoitov snprintf(filename, sizeof(filename), "%s_kern.o", argv[0]); 124d822a192SAlexei Starovoitov 12555de1703SJesper Dangaard Brouer if (setrlimit(RLIMIT_MEMLOCK, &r)) { 12655de1703SJesper Dangaard Brouer perror("setrlimit(RLIMIT_MEMLOCK)"); 12755de1703SJesper Dangaard Brouer return 1; 12855de1703SJesper Dangaard Brouer } 12955de1703SJesper Dangaard Brouer 130d822a192SAlexei Starovoitov signal(SIGINT, int_exit); 131ad990dbeSAndy Gospodarek signal(SIGTERM, int_exit); 132d822a192SAlexei Starovoitov 133d822a192SAlexei Starovoitov /* start 'ping' in the background to have some kfree_skb events */ 134d822a192SAlexei Starovoitov f = popen("ping -c5 localhost", "r"); 135d822a192SAlexei Starovoitov (void) f; 136d822a192SAlexei Starovoitov 137d822a192SAlexei Starovoitov /* start 'dd' in the background to have plenty of 'write' syscalls */ 138d822a192SAlexei Starovoitov f = popen("dd if=/dev/zero of=/dev/null count=5000000", "r"); 139d822a192SAlexei Starovoitov (void) f; 140d822a192SAlexei Starovoitov 141d822a192SAlexei Starovoitov if (load_bpf_file(filename)) { 142d822a192SAlexei Starovoitov printf("%s", bpf_log_buf); 143d822a192SAlexei Starovoitov return 1; 144d822a192SAlexei Starovoitov } 145d822a192SAlexei Starovoitov 146d822a192SAlexei Starovoitov for (i = 0; i < 5; i++) { 147d822a192SAlexei Starovoitov key = 0; 148d40fc181SJoe Stringer while (bpf_map_get_next_key(map_fd[0], &key, &next_key) == 0) { 149d40fc181SJoe Stringer bpf_map_lookup_elem(map_fd[0], &next_key, &value); 150d822a192SAlexei Starovoitov printf("location 0x%lx count %ld\n", next_key, value); 151d822a192SAlexei Starovoitov key = next_key; 152d822a192SAlexei Starovoitov } 153d822a192SAlexei Starovoitov if (key) 154d822a192SAlexei Starovoitov printf("\n"); 155d822a192SAlexei Starovoitov sleep(1); 156d822a192SAlexei Starovoitov } 157d822a192SAlexei Starovoitov print_hist(map_fd[1]); 158d822a192SAlexei Starovoitov 159d822a192SAlexei Starovoitov return 0; 160d822a192SAlexei Starovoitov } 161