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