eventstat-0.03.04/0000755000175000017500000000000013074166457012352 5ustar kingkingeventstat-0.03.04/Makefile0000644000175000017500000000334613074166452014013 0ustar kingking# # Copyright (C) 2011-2017 Canonical, Ltd. # # This program is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # as published by the Free Software Foundation; either version 2 # of the License, or (at your option) any later version. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. # VERSION=0.03.04 CFLAGS += -Wall -Wextra -DVERSION='"$(VERSION)"' -O2 # # Pedantic flags # ifeq ($(PEDANTIC),1) CFLAGS += -Wabi -Wcast-qual -Wfloat-equal -Wmissing-declarations \ -Wmissing-format-attribute -Wno-long-long -Wpacked \ -Wredundant-decls -Wshadow -Wno-missing-field-initializers \ -Wno-missing-braces -Wno-sign-compare -Wno-multichar endif BINDIR=/usr/bin MANDIR=/usr/share/man/man8 eventstat: eventstat.o $(CC) $(CFLAGS) $< -lm -lncurses -o $@ $(LDFLAGS) eventstat.8.gz: eventstat.8 gzip -c $< > $@ dist: rm -rf eventstat-$(VERSION) mkdir eventstat-$(VERSION) cp -rp Makefile eventstat.c eventstat.8 COPYING snapcraft \ eventstat-$(VERSION) tar -zcf eventstat-$(VERSION).tar.gz eventstat-$(VERSION) rm -rf eventstat-$(VERSION) clean: rm -f eventstat eventstat.o eventstat.8.gz rm -f eventstat-$(VERSION).tar.gz install: eventstat eventstat.8.gz mkdir -p ${DESTDIR}${BINDIR} cp eventstat ${DESTDIR}${BINDIR} mkdir -p ${DESTDIR}${MANDIR} cp eventstat.8.gz ${DESTDIR}${MANDIR} eventstat-0.03.04/eventstat.80000644000175000017500000001033113074166452014451 0ustar kingking.\" Hey, EMACS: -*- nroff -*- .\" First parameter, NAME, should be all caps .\" Second parameter, SECTION, should be 1-8, maybe w/ subsection .\" other parameters are allowed: see man(7), man(1) .TH EVENTSTAT 8 "February 11, 2016" .\" Please adjust this date whenever revising the manpage. .\" .\" Some roff macros, for reference: .\" .nh disable hyphenation .\" .hy enable hyphenation .\" .ad l left justify .\" .ad b justify to both left and right margins .\" .nf disable filling .\" .fi enable filling .\" .br insert line break .\" .sp insert n+1 empty lines .\" for manpage-specific macros, see man(7) .SH NAME eventstat \- a tool to measure system events. .br .SH SYNOPSIS .B eventstat .RI [options] " [delay " [count]] .br .SH DESCRIPTION eventstat is a program that dumps the current active system events. .SH OPTIONS eventstat options are as follow: .TP .B \-b just report events, PID and process name. By default the short task name from the kernel comm field will be displayed, however the \-s and \-l options will report more process name information. .TP .B \-c report cumulative events rather than events per sample period. .TP .B \-C report the sample event count in the CSV output rather than the default events per second rate. .TP .B \-d strip full directory path off the process name in the CSV output. .TP .B \-h show help .TP .B \-k report just kernel threads. .TP .B \-l report long process name from /proc/pid/cmdline. This reports the process name and all the command line arguments. .TP .B \-n event_count only display the first event_count number of top events. .TP .B \-q run quietly, only really makes sense with \-r option. .TP .B \-r csv_file output gathered data in a comma separated values file. This can be then imported and graphed using your favourite open source spread sheet. .TP .B \-s report short process name from /proc/pid/cmdline. This reports just the process name. .TP .B \-S report the minimum, maximum, average and population standard deviation at the end of the CSV output. .TP .B \-t threshold ignore samples where the event delta per second less than the given threshold. .TP .B \-T enable 'top' mode, refresh display on each update. .TP .B \-u report just user space processes. .TP .B \-w add timestamp (the "whence" info) to the output. .SH EXAMPLES .LP Dump events every second until stopped. .RS 8 sudo eventstat .RE .LP Dump the top 20 events every 60 seconds until stopped. .RS 8 sudo eventstat \-n 20 60 .RE .LP Dump events every 10 seconds just 5 times. .RS 8 sudo eventstat 10 5 .RE .LP Quietly dump events every 10 seconds just 5 times into a CSV file with short process name. .RS 8 sudo eventstat 10 5 \-q \-s \-r results.csv .RE .SH CSV OUTPUT .LP The \-r option generates a comma separated file report that can be imported into spreadsheets or parsed using text processing tools. Column 1 of the data is the label for each row, columns 2 onwards contain the data for each task that generated a wakeup event. .LP The first row lists the task name of the thread or process. Task names in [ ] brackets are kernel threads, other tasks are the names of user space processes. By default these names are derived from the task names from /proc/timer_stats but the \-s \-l options fetch more complete task names from /proc/pid/cmdline instead. .LP The second and third rows list the names of the internal Linux kernel timer init and callback functions, respectively. .LP The fourth row lists the total number of wakeup events for each task during the entire run of eventstat. .LP The subsequent rows list the average number of wakeups per second measured during the sample interval for each task in column two onwards. The first column indicates the sample time (in seconds) since the start of the measuring. .SH SEE ALSO .BR powertop (8), .BR top (1) .SH AUTHOR eventstat was written by Colin King .PP This manual page was written by Colin King , for the Ubuntu project (but may be used by others). .SH COPYRIGHT Copyright \(co 2011-2016 Canonical Ltd. .br This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. eventstat-0.03.04/eventstat.c0000644000175000017500000012202013074166452014523 0ustar kingking/* * Copyright (C) 2011-2017 Canonical * Hugely modified parts from powertop-1.13, Copyright 2007, Intel Corporation * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * as published by the Free Software Foundation; either version 2 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. * * eventstat by Colin Ian King */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define TABLE_SIZE (1009) /* Should be a prime */ #define OPT_QUIET (0x00000001) #define OPT_CUMULATIVE (0x00000002) #define OPT_CMD_SHORT (0x00000004) #define OPT_CMD_LONG (0x00000008) #define OPT_DIRNAME_STRIP (0x00000010) #define OPT_SAMPLE_COUNT (0x00000020) #define OPT_RESULT_STATS (0x00000040) #define OPT_BRIEF (0x00000080) #define OPT_KERNEL (0x00000100) #define OPT_USER (0x00000200) #define OPT_SHOW_WHENCE (0x00000400) #define OPT_TOP (0x00000800) #define OPT_CMD (OPT_CMD_SHORT | OPT_CMD_LONG) #define EVENT_BUF_SIZE (8192) #define TIMER_REAP_AGE (600) /* Age of timer before it is reaped */ #define TIMER_REAP_THRESHOLD (30) #define TASK_WIDTH (15) #define FUNC_WIDTH (25) #define _VER_(major, minor, patchlevel) \ ((major * 10000) + (minor * 100) + patchlevel) #if defined(__GNUC__) && defined(__GNUC_MINOR__) #if defined(__GNUC_PATCHLEVEL__) #define NEED_GNUC(major, minor, patchlevel) \ _VER_(major, minor, patchlevel) <= \ _VER_(__GNUC__, __GNUC_MINOR__, __GNUC_PATCHLEVEL__) #else #define NEED_GNUC(major, minor, patchlevel) \ _VER_(major, minor, patchlevel) <= _VER_(__GNUC__, __GNUC_MINOR__, 0) #endif #else #define NEED_GNUC(major, minor, patchlevel) (0) #endif #if defined(__GNUC__) && NEED_GNUC(4,6,0) #define HOT __attribute__ ((hot)) #else #define HOT #endif #if defined(__GNUC__) && !defined(__clang__) && NEED_GNUC(4,6,0) #define OPTIMIZE3 __attribute__((optimize("-O3"))) #else #define OPTIMIZE3 #endif #define FLOAT_TINY (0.0000001) #define FLOAT_CMP(a, b) (fabs(a - b) < FLOAT_TINY) typedef struct timer_info { struct timer_info *next; /* Next in list */ struct timer_info *hash_next; /* Next in hash list */ pid_t pid; char *task; /* Name of process/kernel task */ char *task_mangled; /* Modified name of process/kernel */ char *cmdline; /* From /proc/$pid/cmdline */ char *func; /* Kernel waiting func */ char *callback; /* Kernel timer callback func */ char *ident; /* Unique identity */ bool kernel_thread; /* True if task is a kernel thread */ uint32_t ref_count; /* timer stat reference count */ uint64_t total; /* Total number of events */ double time_total; /* Total time */ double last_used; /* Last referenced */ } timer_info_t; typedef struct timer_stat { struct timer_stat *next; /* Next timer stat in hash table */ struct timer_stat *sorted_freq_next; /* Next timer stat in event frequency sorted list */ uint64_t count; /* Number of events */ int64_t delta; /* Change in events since last time */ double time; /* Time of sample */ double time_delta; /* Change in time since last time */ timer_info_t *info; /* Timer info */ } timer_stat_t; /* sample delta item as an element of the sample_delta_list_t */ typedef struct sample_delta_item { struct sample_delta_item *next; /* next in list */ int64_t delta; /* difference in timer events between old and new */ double time_delta; /* difference in time between old and new */ timer_info_t *info; /* timer this refers to */ } sample_delta_item_t; /* list of sample_delta_items */ typedef struct sample_delta_list { struct sample_delta_list *next; /* next in list */ struct sample_delta_item *list; /* list of sample delta items */ double whence; /* when the sample was taken */ } sample_delta_list_t; typedef struct { char *task; /* Name of kernel task */ size_t len; /* Length */ } kernel_task_info; #define KERN_TASK_INFO(str) { str, sizeof(str) - 1 } static const char *app_name = "eventstat"; static const char *proc_timer_stats = "/proc/timer_stats"; static void es_printf(const char *fmt, ...) __attribute__((format(printf, 1, 2))); static timer_stat_t *timer_stat_free_list; /* free list of timer stats */ static timer_info_t *timer_info_list; /* cache list of timer_info */ static timer_info_t *timer_info_hash[TABLE_SIZE]; /* hash of timer_info */ static sample_delta_list_t *sample_delta_list; /* list of samples, sorted in sample time order */ static char *csv_results; /* results in comma separated values */ static char *get_events_buf; /* buffer to glob events into */ static double opt_threshold; /* ignore samples with event delta less than this */ static uint32_t timer_info_list_length; /* length of timer_info_list */ static uint32_t opt_flags; /* option flags */ static volatile bool stop_eventstat = false; /* set by sighandler */ static bool sane_procs; /* false if we are in a container */ static bool resized; /* window resized */ static bool curses_init; /* curses initialised */ static int rows = 25; /* tty size, rows */ static int cols = 80; /* tty size, columns */ /* * Attempt to catch a range of signals so * we can clean */ static const int signals[] = { /* POSIX.1-1990 */ #ifdef SIGHUP SIGHUP, #endif #ifdef SIGINT SIGINT, #endif #ifdef SIGQUIT SIGQUIT, #endif #ifdef SIGFPE SIGFPE, #endif #ifdef SIGTERM SIGTERM, #endif #ifdef SIGUSR1 SIGUSR1, #endif #ifdef SIGUSR2 SIGUSR2, /* POSIX.1-2001 */ #endif #ifdef SIGXCPU SIGXCPU, #endif #ifdef SIGXFSZ SIGXFSZ, #endif /* Linux various */ #ifdef SIGIOT SIGIOT, #endif #ifdef SIGSTKFLT SIGSTKFLT, #endif #ifdef SIGPWR SIGPWR, #endif #ifdef SIGINFO SIGINFO, #endif #ifdef SIGVTALRM SIGVTALRM, #endif -1, }; /* * pid_max_digits() * determine (or guess) maximum digits of pids */ static int pid_max_digits(void) { static int max_digits; ssize_t n; int fd; const int default_digits = 6; const int min_digits = 5; char buf[32]; if (max_digits) goto ret; max_digits = default_digits; fd = open("/proc/sys/kernel/pid_max", O_RDONLY); if (fd < 0) goto ret; n = read(fd, buf, sizeof(buf) - 1); (void)close(fd); if (n < 0) goto ret; buf[n] = '\0'; max_digits = 0; while (buf[max_digits] >= '0' && buf[max_digits] <= '9') max_digits++; if (max_digits < min_digits) max_digits = min_digits; ret: return max_digits; } /* * hash_djb2a() * Hash a string, from Dan Bernstein comp.lang.c (xor version) */ static HOT OPTIMIZE3 uint32_t hash_djb2a(const char *str) { register uint32_t hash = 5381; register int c; while ((c = *str++)) { /* (hash * 33) ^ c */ hash = ((hash << 5) + hash) ^ c; hash = (hash * 33) ^ c; } return hash % TABLE_SIZE; } /* * eventstat_winsize() * get tty size */ static void eventstat_winsize(void) { struct winsize ws; if (ioctl(fileno(stdin), TIOCGWINSZ, &ws) != -1) { rows = ws.ws_row; cols = ws.ws_col; } } /* * eventstat_clear() * clear screen if in top mode */ static inline void eventstat_clear(void) { if (curses_init) clear(); } /* * eventstat_refresh() * refresh screen if in top mode */ static inline void eventstat_refresh(void) { if (curses_init) refresh(); } /* * eventstat_move() * move cursor if in top mode */ static inline void eventstat_move( const int y, const int x) { if (curses_init) move(y, x); } /* * eventstat_endwin() * call endwin if in top mode */ static void eventstat_endwin(void) { if (curses_init) { clear(); endwin(); } } /* * err_abort() * print an error and exit */ static void __attribute__ ((noreturn)) __attribute__((format(printf, 1, 2))) err_abort(const char *fmt, ...) { va_list ap; va_start(ap, fmt); eventstat_endwin(); vfprintf(stderr,fmt, ap); va_end(ap); exit(EXIT_FAILURE); } /* * set_timer_stat() * enable/disable timer stat */ static void set_timer_stat(const char *str, const bool carp) { int fd; const ssize_t len = (ssize_t)strlen(str); if ((fd = open(proc_timer_stats, O_WRONLY, S_IRUSR | S_IWUSR)) < 0) { if (carp) { err_abort("Cannot open %s, errno=%d (%s)\n", proc_timer_stats, errno, strerror(errno)); } return; } if (write(fd, str, len) != len) { close(fd); if (carp) { err_abort("Cannot write to %s, errno=%d (%s)\n", proc_timer_stats, errno, strerror(errno)); } return; } (void)close(fd); } /* * eventstat_exit() * exit and set timer stat to 0 */ static void __attribute__ ((noreturn)) eventstat_exit(const int status) { set_timer_stat("0\n", false); exit(status); } /* * timeval_to_double * timeval to a double (in seconds) */ static inline double timeval_to_double(const struct timeval *const tv) { return (double)tv->tv_sec + ((double)tv->tv_usec / 1000000.0); } /* * double_to_timeval * seconds in double to timeval */ static inline struct timeval double_to_timeval(const double val) { struct timeval tv; tv.tv_sec = val; tv.tv_usec = (val - (time_t)val) * 1000000.0; return tv; } /* * gettime_to_double() * get time as a double */ static double gettime_to_double(void) { struct timeval tv; if (gettimeofday(&tv, NULL) < 0) err_abort("gettimeofday failed: errno=%d (%s)\n", errno, strerror(errno)); return timeval_to_double(&tv); } /* * sane_proc_pid_info() * detect if proc info mapping from /proc/timer_stats * maps to proc pids OK. If we are in a container or * we can't tell, return false. */ static bool sane_proc_pid_info(void) { FILE *fp; static const char pattern[] = "container="; const char *ptr = pattern; bool ret = true; fp = fopen("/proc/1/environ", "r"); if (!fp) return false; while (!feof(fp)) { int ch = getc(fp); if (*ptr == ch) { ptr++; /* Match? So we're inside a container */ if (*ptr == '\0') { ret = false; break; } } else { /* No match, skip to end of var and restart scan */ do { ch = getc(fp); } while ((ch != EOF) && (ch != '\0')); ptr = pattern; } } (void)fclose(fp); return ret; } /* * handle_sig() * catch signal, flag a stop and restore timer stat */ static void handle_sig(int dummy) { (void)dummy; /* Stop unused parameter warning with -Wextra */ stop_eventstat = true; set_timer_stat("0\n", false); } /* * samples_free() * free collected samples */ static inline void samples_free(void) { sample_delta_list_t *sdl = sample_delta_list; while (sdl) { sample_delta_list_t *sdl_next = sdl->next; sample_delta_item_t *sdi = sdl->list; while (sdi) { sample_delta_item_t *sdi_next = sdi->next; free(sdi); sdi = sdi_next; } free(sdl); sdl = sdl_next; } } /* * sample_add() * add a timer_stat's delta and info field to a * list at time position whence */ static void sample_add( timer_stat_t *timer_stat, const double whence) { bool found = false; sample_delta_list_t *sdl; sample_delta_item_t *sdi; if (csv_results == NULL) /* No need if not request */ return; for (sdl = sample_delta_list; sdl; sdl = sdl->next) { if (FLOAT_CMP(sdl->whence, whence)) { found = true; break; } } /* * New time period, need new sdl, we assume it goes at the end of the * list since time is assumed to be increasing */ if (!found) { if ((sdl = calloc(1, sizeof(sample_delta_list_t))) == NULL) err_abort("Cannot allocate sample delta list\n"); sdl->whence = whence; sdl->next = sample_delta_list; sample_delta_list = sdl; } /* Now append the sdi onto the list */ if ((sdi = calloc(1, sizeof(sample_delta_item_t))) == NULL) err_abort("Cannot allocate sample delta item\n"); sdi->delta = timer_stat->delta; sdi->time_delta = timer_stat->time_delta; sdi->info = timer_stat->info; sdi->next = sdl->list; sdl->list = sdi; } /* * sample_find() * scan through a sample_delta_list for timer info, * return NULL if not found */ inline HOT static sample_delta_item_t *sample_find( sample_delta_list_t *sdl, const timer_info_t *info) { sample_delta_item_t *sdi; for (sdi = sdl->list; sdi; sdi = sdi->next) { if (sdi->info == info) return sdi; } return NULL; } /* * info_compare_total() * used by qsort to sort array in sample event total order */ static int info_compare_total(const void *item1, const void *item2) { timer_info_t *const *info1 = (timer_info_t *const *)item1; timer_info_t *const *info2 = (timer_info_t *const *)item2; if ((*info2)->total == (*info1)->total) return 0; return ((*info2)->total > (*info1)->total) ? 1 : -1; } static bool pid_a_kernel_thread_guess(const char *task) { /* * This is not exactly accurate, but if we can't look up * a process then try and infer something from the comm field. * Until we have better kernel support to map /proc/timer_stats * pids to containerised pids this is the best we can do. */ static const kernel_task_info kernel_tasks[] = { KERN_TASK_INFO("swapper/"), KERN_TASK_INFO("kworker/"), KERN_TASK_INFO("ksoftirqd/"), KERN_TASK_INFO("watchdog/"), KERN_TASK_INFO("migration/"), KERN_TASK_INFO("irq/"), KERN_TASK_INFO("mmcqd/"), KERN_TASK_INFO("jbd2/"), KERN_TASK_INFO("kthreadd"), KERN_TASK_INFO("kthrotld"), KERN_TASK_INFO("kswapd"), KERN_TASK_INFO("ecryptfs-kthrea"), KERN_TASK_INFO("kauditd"), KERN_TASK_INFO("kblockd"), KERN_TASK_INFO("kcryptd"), KERN_TASK_INFO("kdevtmpfs"), KERN_TASK_INFO("khelper"), KERN_TASK_INFO("khubd"), KERN_TASK_INFO("khugepaged"), KERN_TASK_INFO("khungtaskd"), KERN_TASK_INFO("flush-"), KERN_TASK_INFO("bdi-default-"), { NULL, 0 } }; size_t i; for (i = 0; kernel_tasks[i].task != NULL; i++) { if (!strncmp(task, kernel_tasks[i].task, kernel_tasks[i].len)) return true; } return false; } /* * pid_a_kernel_thread * */ static bool pid_a_kernel_thread( const char *cmdline, const char *task, const pid_t id) { pid_t pgid; if (sane_procs && (cmdline != NULL)) return (*cmdline == '\0'); /* We are either in a container, or with a task with a NULL cmdline */ pgid = getpgid(id); if (pgid >= 0) return (pgid == 0); /* Can't get pgid on that pid, so make a guess */ return pid_a_kernel_thread_guess(task); } /* * get_pid_cmdline * get process's /proc/pid/cmdline */ static char *get_pid_cmdline(const pid_t id) { char buffer[4096]; char *ptr; int fd; ssize_t ret; snprintf(buffer, sizeof(buffer), "/proc/%d/cmdline", id); if ((fd = open(buffer, O_RDONLY)) < 0) return NULL; ret = read(fd, buffer, sizeof(buffer)); (void)close(fd); if (ret < 0) return NULL; if (ret == 0) return strdup(""); buffer[sizeof(buffer)-1] = '\0'; /* * OPT_CMD_LONG option we get the full cmdline args */ if (opt_flags & OPT_CMD_LONG) { for (ptr = buffer; ptr < buffer + ret - 1; ptr++) { if (*ptr == '\0') *ptr = ' '; } *ptr = '\0'; } /* * OPT_CMD_SHORT option we discard anything after a space */ if (opt_flags & OPT_CMD_SHORT) { for (ptr = buffer; *ptr && (ptr < buffer + ret); ptr++) { if (*ptr == ' ') *ptr = '\0'; } } if (opt_flags & OPT_DIRNAME_STRIP) return strdup(basename(buffer)); return strdup(buffer); } static inline double duration_round(const double duration) { return floor((duration * 100.0) + 0.5) / 100.0; } /* * samples_dump() * dump out collected sample information */ static void samples_dump(const char *filename) { timer_info_t **sorted_timer_infos; size_t i = 0; size_t n; FILE *fp; uint64_t count = 0; double first_time = -1.0; timer_info_t *info; sample_delta_list_t *sdl; if (filename == NULL) return; if ((fp = fopen(filename, "w")) == NULL) { fprintf(stderr, "Cannot write to file %s\n", filename); return; } if ((sorted_timer_infos = calloc(timer_info_list_length, sizeof(timer_info_t*))) == NULL) err_abort("Cannot allocate buffer for sorting timer_infos\n"); /* Just want the timers with some non-zero total */ for (n = 0, info = timer_info_list; info; info = info->next) { if (info->total > 0) sorted_timer_infos[n++] = info; } qsort(sorted_timer_infos, n, sizeof(timer_info_t *), info_compare_total); fprintf(fp, "Time:,Task:"); for (i = 0; i < n; i++) { char *task; if (opt_flags & OPT_CMD) task = sorted_timer_infos[i]->cmdline; else task = sorted_timer_infos[i]->task_mangled; fprintf(fp, ",%s", task); } fprintf(fp, "\n"); fprintf(fp, ",Init Function:"); for (i = 0; i < n; i++) fprintf(fp, ",%s", sorted_timer_infos[i]->func); fprintf(fp, "\n"); fprintf(fp, ",Callback:"); for (i = 0; i < n; i++) fprintf(fp, ",%s", sorted_timer_infos[i]->callback); fprintf(fp, "\n"); fprintf(fp, ",Total:"); for (i = 0; i < n; i++) fprintf(fp, ",%" PRIu64, sorted_timer_infos[i]->total); fprintf(fp, "\n"); for (sdl = sample_delta_list; sdl; sdl= sdl->next) { time_t t = (time_t)sdl->whence; struct tm *tm; count++; tm = localtime(&t); fprintf(fp, "%2.2d:%2.2d:%2.2d", tm->tm_hour, tm->tm_min, tm->tm_sec); if (first_time < 0) first_time = sdl->whence; fprintf(fp, ",%f", duration_round(sdl->whence - first_time)); /* Scan in timer info order to be consistent for all sdl rows */ for (i = 0; i < n; i++) { sample_delta_item_t *sdi = sample_find(sdl, sorted_timer_infos[i]); /* * duration - if -C option is used then don't scale * by the per sample duration time, instead give the * raw sample count by scaling by 1.0 (i.e. no scaling) */ if (sdi) { double duration = duration_round((opt_flags & OPT_SAMPLE_COUNT) ? 1.0 : sdi->time_delta); fprintf(fp, ",%f", FLOAT_CMP(duration, 0.0) ? 0.0 : (double)sdi->delta / duration); } else fprintf(fp, ",%f", 0.0); } fprintf(fp, "\n"); } /* * -S option - some statistics, min, max, average, std.dev. */ if (opt_flags & OPT_RESULT_STATS) { fprintf(fp, ",Min:"); for (i = 0; i < n; i++) { double min = DBL_MAX; for (sdl = sample_delta_list; sdl; sdl = sdl->next) { sample_delta_item_t *sdi = sample_find(sdl, sorted_timer_infos[i]); if (sdi) { double duration = duration_round((opt_flags & OPT_SAMPLE_COUNT) ? 1.0 : sdi->time_delta); double val = FLOAT_CMP(duration, 0.0) ? 0.0 : sdi->delta / duration; if (min > val) min = val; } } fprintf(fp, ",%f", min); } fprintf(fp, "\n"); fprintf(fp, ",Max:"); for (i = 0; i < n; i++) { double max = DBL_MIN; for (sdl = sample_delta_list; sdl; sdl= sdl->next) { sample_delta_item_t *sdi = sample_find(sdl, sorted_timer_infos[i]); if (sdi) { double duration = duration_round((opt_flags & OPT_SAMPLE_COUNT) ? 1.0 : sdi->time_delta); double val = FLOAT_CMP(duration, 0.0) ? 0.0 : sdi->delta / duration; if (max < val) max = val; } } fprintf(fp, ",%f", max); } fprintf(fp, "\n"); fprintf(fp, ",Average:"); for (i = 0; i < n; i++) fprintf(fp, ",%f", count == 0 ? 0.0 : (double)sorted_timer_infos[i]->total / count); fprintf(fp, "\n"); /* * population standard deviation */ fprintf(fp, ",Std.Dev.:"); for (i = 0; i < n; i++) { double average = (double) sorted_timer_infos[i]->total / (double)count; double sum = 0.0; for (sdl = sample_delta_list; sdl; sdl = sdl->next) { sample_delta_item_t *sdi = sample_find(sdl, sorted_timer_infos[i]); if (sdi) { double duration = duration_round((opt_flags & OPT_SAMPLE_COUNT) ? 1.0 : sdi->time_delta); double diff = FLOAT_CMP(duration, 0.0) ? 0.0 : ((double)sdi->delta - average) / duration; diff = diff * diff; sum += diff; } } sum = sum / (double)count; fprintf(fp, ",%f", sqrt(sum)); } fprintf(fp, "\n"); } free(sorted_timer_infos); (void)fclose(fp); } /* * timer_info_find() * try to find existing timer info in cache, and to the cache * if it is new. */ static HOT timer_info_t *timer_info_find( const timer_info_t *new_info, const char *ident, const double time_now) { timer_info_t *info; const uint32_t h = hash_djb2a(ident); for (info = timer_info_hash[h]; info; info = info->hash_next) { if (strcmp(ident, info->ident) == 0) { info->last_used = time_now; return info; } } if ((info = calloc(1, sizeof(timer_info_t))) == NULL) err_abort("Cannot allocate timer info\n"); info->pid = new_info->pid; info->task = strdup(new_info->task); info->task_mangled = strdup(new_info->task_mangled); info->cmdline = strdup(new_info->cmdline); info->func = strdup(new_info->func); info->callback = strdup(new_info->callback); info->ident = strdup(ident); info->kernel_thread = new_info->kernel_thread; info->total = new_info->total; info->time_total = new_info->time_total; info->last_used = time_now; info->ref_count = 0; if (info->task == NULL || info->task_mangled == NULL || info->cmdline == NULL || info->func == NULL || info->callback == NULL || info->ident == NULL) { err_abort("Out of memory allocating a timer stat fields\n"); } /* Does not exist in list, append it */ info->next = timer_info_list; timer_info_list = info; timer_info_list_length++; info->hash_next = timer_info_hash[h]; timer_info_hash[h] = info; return info; } /* * timer_info_free() * free up timer_info */ static void timer_info_free(void *data) { timer_info_t *info = (timer_info_t*)data; free(info->task); if (info->cmdline != info->task_mangled) free(info->cmdline); free(info->task_mangled); free(info->func); free(info->callback); free(info->ident); free(info); } /* * timer_info_purge_old_from_timer_list() * remove old timer info from the timer list */ static void timer_info_purge_old_from_timer_list( timer_info_t **list, const double time_now) { timer_info_t *prev = NULL, *info = *list; while (info) { timer_info_t *next = info->next; /* * Only remove from list once all timer * stats no longer reference it */ if ((info->ref_count == 0) && (info->last_used + TIMER_REAP_AGE < time_now)) { if (prev == NULL) *list = next; else prev->next = next; timer_info_list_length--; } else { prev = info; } info = next; } } /* * timer_info_purge_old_from_hash_list() * remove old timer info from a hash list */ static void timer_info_purge_old_from_hash_list( timer_info_t **list, const double time_now) { timer_info_t *prev = NULL, *info = *list; while (info) { timer_info_t *next = info->hash_next; /* * Only remove and free once all timer stats no * longer reference it */ if ((info->ref_count == 0) && (info->last_used + TIMER_REAP_AGE < time_now)) { if (prev == NULL) *list = next; else prev->hash_next = next; timer_info_free(info); } else { prev = info; } info = next; } } /* * timer_info_purge_old() * clean out old timer infos */ static inline void timer_info_purge_old(const double time_now) { static uint16_t count = 0; count++; if (count > TIMER_REAP_THRESHOLD) { size_t i; count = 0; timer_info_purge_old_from_timer_list(&timer_info_list, time_now); for (i = 0; i < TABLE_SIZE; i++) timer_info_purge_old_from_hash_list(&timer_info_hash[i], time_now); } } /* * timer_info_list_free() * free up all unique timer infos */ static inline void timer_info_list_free(void) { timer_info_t *info = timer_info_list; /* Free list and timers on list */ while (info) { timer_info_t *next = info->next; timer_info_free(info); info = next; } } /* * make_hash_ident() */ static char *make_hash_ident(const timer_info_t *info) { static char ident[1024]; snprintf(ident, sizeof(ident), "%x%s%8.8s%8.8s%s", info->pid, info->task, info->func, info->callback, info->cmdline); return ident; } /* * timer_stat_free_list_free() * free up the timer stat free list */ static void timer_stat_free_list_free(void) { timer_stat_t *ts = timer_stat_free_list; while (ts) { timer_stat_t *next = ts->next; free(ts); ts = next; } timer_stat_free_list = NULL; } /* * timer_stat_free_contents() * Free timers from a hash table */ static void timer_stat_free_contents( timer_stat_t *timer_stats[]) /* timer stat hash table */ { int i; for (i = 0; i < TABLE_SIZE; i++) { timer_stat_t *ts = timer_stats[i]; while (ts) { timer_stat_t *next = ts->next; /* Decrement info ref count */ ts->info->ref_count--; /* Add it onto the timer stat free list */ ts->next = timer_stat_free_list; timer_stat_free_list = ts; ts = next; } timer_stats[i] = NULL; } } /* * timer_stat_add() * add timer stats to a hash table if it is new, otherwise just * accumulate the event count. */ static void timer_stat_add( timer_stat_t *timer_stats[], /* timer stat hash table */ const double time_now, /* time sample was taken */ timer_info_t *info) /* timer info to be added */ { const char *ident = make_hash_ident(info); const uint32_t h = hash_djb2a(ident); timer_stat_t *ts, *ts_new; for (ts = timer_stats[h]; ts; ts = ts->next) { if (strcmp(ts->info->ident, ident) == 0) { ts->count += info->total; return; } } /* Not found, it is new */ if (timer_stat_free_list) { /* Get new one from free list */ ts_new = timer_stat_free_list; timer_stat_free_list = timer_stat_free_list->next; } else { /* Get one from heap */ if ((ts_new = malloc(sizeof(timer_stat_t))) == NULL) err_abort("Out of memory allocating a timer stat\n"); } ts_new->count = info->total; ts_new->info = timer_info_find(info, ident, time_now); ts_new->info->ref_count++; ts_new->next = timer_stats[h]; ts_new->time = time_now; ts_new->sorted_freq_next = NULL; timer_stats[h] = ts_new; } /* * timer_stat_find() * find a timer stat (needle) in a timer stat hash table (haystack) */ static OPTIMIZE3 timer_stat_t *timer_stat_find( timer_stat_t *haystack[], /* timer stat hash table */ timer_stat_t *needle) /* timer stat to find */ { timer_stat_t *ts; const char *ident = make_hash_ident(needle->info); for (ts = haystack[hash_djb2a(ident)]; ts; ts = ts->next) { if (strcmp(ts->info->ident, ident) == 0) return ts; } return NULL; /* no success */ } /* * timer_stat_sort_freq_add() * add a timer stat to a sorted list of timer stats */ static void timer_stat_sort_freq_add( timer_stat_t **sorted, /* timer stat sorted list */ timer_stat_t *new) /* timer stat to add */ { while (*sorted) { if (opt_flags & OPT_CUMULATIVE) { if ((*sorted)->count < new->count) { new->sorted_freq_next = *(sorted); break; } } else { if ((*sorted)->delta < new->delta) { new->sorted_freq_next = *(sorted); break; } } sorted = &(*sorted)->sorted_freq_next; } *sorted = new; } /* * es_printf() * eventstat printf - print to stdout or ncurses * print depending on the mode */ static void es_printf(const char *fmt, ...) { va_list ap; va_start(ap, fmt); if (curses_init) { char buf[256]; vsnprintf(buf, sizeof(buf), fmt, ap); printw("%s", buf); } else { vprintf(fmt, ap); } va_end(ap); } /* * timer_stat_diff() * find difference in event count between to hash table samples of timer * stats. We are interested in just current and new timers, not ones that * silently die */ static OPTIMIZE3 void timer_stat_diff( const double duration, /* time between each sample */ const double time_delta, /* how long been running sofar */ const int32_t n_lines, /* number of lines to output */ const double whence, /* nth sample */ timer_stat_t *timer_stats_old[],/* old timer stats samples */ timer_stat_t *timer_stats_new[])/* new timer stats samples */ { int i; timer_stat_t *sorted = NULL; for (i = 0; i < TABLE_SIZE; i++) { timer_stat_t *ts; for (ts = timer_stats_new[i]; ts; ts = ts->next) { ts->info->last_used = whence; timer_stat_t *found = timer_stat_find(timer_stats_old, ts); if (found) { found->info->last_used = whence; ts->delta = ts->count - found->count; ts->time_delta = ts->time - found->time; if (ts->delta >= opt_threshold) { timer_stat_sort_freq_add(&sorted, ts); sample_add(ts, whence); found->info->total += ts->delta; found->info->time_total += ts->time_delta; } } else { ts->delta = ts->count; ts->time_delta = duration; if (ts->delta >= opt_threshold) { timer_stat_sort_freq_add(&sorted, ts); sample_add(ts, whence); } } } } if (!(opt_flags & OPT_QUIET)) { uint64_t total = 0UL, kt_total = 0UL; int32_t j = 0; const int pid_size = pid_max_digits(); int sz, ta_size, if_size, cb_size; eventstat_winsize(); if (resized && curses_init) { resizeterm(rows, cols); refresh(); resized = false; } sz = (cols - 80) / 6; if (sz < 0) sz = 0; ta_size = TASK_WIDTH + sz; if_size = FUNC_WIDTH + (3 * sz); cb_size = cols - (8 + 1 + pid_size + 1 + ta_size + 1 + if_size + 2); if (cb_size < 0) cb_size = 20; es_printf("%8s %-*.*s %-*.*s", (opt_flags & OPT_CUMULATIVE) ? "Events" : "Event/s", pid_size, pid_size, "PID", ta_size, ta_size, "Task"); if (!(opt_flags & OPT_BRIEF)) es_printf(" %-*.*s %-*.*s\n", if_size, if_size, "Init Function", cb_size, cb_size, "Callback"); else es_printf("\n"); while (sorted) { if (((n_lines == -1) || (j < n_lines)) && (sorted->delta != 0)) { char *task = (opt_flags & OPT_CMD) ? sorted->info->cmdline : sorted->info->task_mangled; if (!*task) task = sorted->info->task_mangled; j++; if (opt_flags & OPT_CUMULATIVE) es_printf("%8" PRIu64 " ", sorted->count); else es_printf("%8.2f ", (double)sorted->delta / duration); if (opt_flags & OPT_BRIEF) { es_printf("%*d %s\n", pid_size, sorted->info->pid, task); } else { es_printf("%*d %-*.*s %-*.*s %-*.*s\n", pid_size, sorted->info->pid, ta_size, ta_size, task, if_size, if_size, sorted->info->func, cb_size, cb_size, sorted->info->callback); } } total += sorted->delta; if (sorted->info->kernel_thread) kt_total += sorted->delta; sorted = sorted->sorted_freq_next; } eventstat_move(LINES - 1, 0); es_printf("%" PRIu64 " Total events, %5.2f events/sec " "(kernel: %5.2f, userspace: %5.2f)\n", total, (double)total / duration, (double)kt_total / duration, (double)(total - kt_total) / duration); if ((opt_flags & OPT_SHOW_WHENCE) && !curses_init) { time_t t = (time_t)whence; char *timestr = ctime(&t); char *pos = strchr(timestr, '\n'); if (*pos) *pos = '\0'; es_printf("Timestamp: %s, Total Run Duration: " "%.1f secs\n", timestr, time_delta); } if (!sane_procs) es_printf("Note: this was run inside a container, " "kernel tasks were guessed.\n"); es_printf("\n"); } } /* * read_events() * read in events data into a global read buffer. * the buffer is auto-expanded where necessary and * only free'd at exit time. This way we can parse * the data a little faster. */ static char *read_events(void) { int fd; static size_t get_events_size; size_t size; if (get_events_buf == NULL) { if ((get_events_buf = malloc(EVENT_BUF_SIZE << 1)) == NULL) err_abort("Cannot read %s, out of memory\n", proc_timer_stats); get_events_size = (EVENT_BUF_SIZE << 1); } if ((fd = open(proc_timer_stats, O_RDONLY)) < 0) err_abort("Cannot open %s\n", proc_timer_stats); size = 0; for (;;) { ssize_t ret; char buffer[EVENT_BUF_SIZE]; ret = read(fd, buffer, sizeof(buffer)); if (ret == 0) break; if (ret < 0) { if ((errno == EINTR) || (errno != EAGAIN)) { continue; } break; } /* Do we need to expand the global buffer? */ if (size + ret >= get_events_size) { char *tmpptr; get_events_size += (EVENT_BUF_SIZE << 1); tmpptr = realloc(get_events_buf, get_events_size + 1); if (!tmpptr) { (void)close(fd); err_abort("Cannot read %s, out of memory\n", proc_timer_stats); } get_events_buf = tmpptr; } memcpy(get_events_buf + size, buffer, ret); size += ret; *(get_events_buf + size) = '\0'; } (void)close(fd); return get_events_buf; } /* * get_events() * scan /proc/timer_stats and populate a timer stat hash table with * unique events */ static void get_events( timer_stat_t *timer_stats[], const double time_now) { char *tmpptr; const size_t app_name_len = strlen(app_name); if ((tmpptr = read_events()) == NULL) return; while (*tmpptr) { char *ptr = tmpptr, *eol = tmpptr; char task[64]; char task_mangled[64]; char func[64]; char callback[64]; char *cmdline; int mask; timer_info_t info; /* Find the end of a line */ while (*eol) { if (*eol == '\n') { *eol = '\0'; eol++; break; } eol++; } /* Is this the last line we want to parse? */ if (strstr(tmpptr, "total events") != NULL) break; /* Looking for a format: "count[D], pid, task, func (timer)" */ while (*ptr && *ptr != ',') ptr++; if (*ptr != ',') goto next; if (ptr > tmpptr && *(ptr - 1) == 'D') goto next; /* Deferred event, skip */ /* Now we're ready to fetch info fields */ memset(&info, 0, sizeof(info)); ptr++; if (sscanf(tmpptr, "%21" SCNu64, &info.total) != 1) goto next; memset(task, 0, sizeof(task)); memset(func, 0, sizeof(func)); memset(callback, 0, sizeof(callback)); info.pid = -1; if (sscanf(ptr, "%10d %63s %63s (%63[^)])", &info.pid, task, func, callback) != 4) goto next; /* Processes without a command line are kernel threads */ cmdline = get_pid_cmdline(info.pid); info.kernel_thread = pid_a_kernel_thread(cmdline, task, info.pid); /* Swapper is special, like all corner cases */ if (strncmp(task, "swapper", 6) == 0) info.kernel_thread = true; mask = info.kernel_thread ? OPT_KERNEL : OPT_USER; if (!(opt_flags & mask)) goto free_next; if (info.kernel_thread) { char tmp[sizeof(task)]; strcpy(tmp, task); tmp[13] = '\0'; snprintf(task_mangled, sizeof(task_mangled), "[%s]", tmp); } else { strcpy(task_mangled, task); } if (strcmp(task, "insmod") == 0) strncpy(task, "[kern mod]", 13); if (strcmp(task, "modprobe") == 0) strncpy(task, "[kern mod]", 13); if (strncmp(func, "tick_nohz_", 10) && strncmp(func, "tick_setup_sched_timer", 20) && strncmp(task, app_name, app_name_len)) { info.task = task; info.cmdline = cmdline ? cmdline : task_mangled; info.task_mangled = task_mangled; info.func = func; info.callback = callback; info.ident = tmpptr; info.time_total = 0.0; timer_stat_add(timer_stats, time_now, &info); } free_next: free(cmdline); next: tmpptr = eol; } } /* * show_usage() * show how to use */ static void show_usage(void) { printf("%s, version %s\n\n", app_name, VERSION); printf("Usage: %s [options] [duration] [count]\n", app_name); printf("Options are:\n" " -c\t\treport cumulative events rather than events per second.\n" " -C\t\treport event count rather than event per second in CSV output.\n" " -d\t\tremove pathname from long process name in CSV output.\n" " -h\t\tprint this help.\n" " -l\t\tuse long cmdline text from /proc/pid/cmdline for process name.\n" " -n events\tspecifies number of events to display.\n" " -q\t\trun quietly, useful with option -r.\n" " -r filename\tspecifies a comma separated values (CSV) output file\n" "\t\tto dump samples into.\n" " -s\t\tuse short process name from /proc/pid/cmdline for process name.\n" " -S\t\tcalculate min, max, average and standard deviation in CSV\n" "\t\toutput.\n" " -t threshold\tsamples less than the specified threshold are ignored.\n" " -T\t\tenable \'top\' mode rather than a scrolling output.\n" " -w\t\tadd time stamp (when events occurred) to output.\n"); } /* * handle_sigwinch() * flag window resize on SIGWINCH */ static void handle_sigwinch(int sig) { (void)sig; eventstat_winsize(); resized = true; } int main(int argc, char **argv) { timer_stat_t **timer_stats_old, **timer_stats_new, **tmp; double duration_secs = 1.0, time_start, time_now; int64_t count = 1, t = 1; int32_t n_lines = -1; bool forever = true; bool redo = false; struct sigaction new_action; int i; for (;;) { int c = getopt(argc, argv, "bcCdksSlhn:qr:t:Tuw"); if (c == -1) break; switch (c) { case 'b': opt_flags |= OPT_BRIEF; break; case 'c': opt_flags |= OPT_CUMULATIVE; break; case 'C': opt_flags |= OPT_SAMPLE_COUNT; break; case 'd': opt_flags |= OPT_DIRNAME_STRIP; break; case 'h': show_usage(); eventstat_exit(EXIT_SUCCESS); case 'n': errno = 0; n_lines = (int32_t)strtol(optarg, NULL, 10); if (errno) err_abort("Invalid value for number " "of events to display\n"); if (n_lines < 1) err_abort("-n option must be greater than 0\n"); break; case 't': opt_threshold = strtoull(optarg, NULL, 10); if (opt_threshold < 1) err_abort("-t threshold must be 1 or more.\n"); break; case 'T': opt_flags |= OPT_TOP; break; case 'q': opt_flags |= OPT_QUIET; break; case 'r': csv_results = optarg; break; case 's': opt_flags |= OPT_CMD_SHORT; break; case 'S': opt_flags |= OPT_RESULT_STATS; break; case 'l': opt_flags |= OPT_CMD_LONG; break; case 'k': opt_flags |= OPT_KERNEL; break; case 'u': opt_flags |= OPT_USER; break; case 'w': opt_flags |= OPT_SHOW_WHENCE; break; default: show_usage(); eventstat_exit(EXIT_FAILURE); } } if (!(opt_flags & (OPT_KERNEL | OPT_USER))) opt_flags |= (OPT_KERNEL | OPT_USER); if (optind < argc) { duration_secs = atof(argv[optind++]); if (duration_secs < 0.5) err_abort("Duration must 0.5 or more.\n"); } if (optind < argc) { forever = false; errno = 0; count = (int64_t)strtoll(argv[optind++], NULL, 10); if (errno) err_abort("Invalid count value\n"); if (count < 1) err_abort("Count must be > 0\n"); } opt_threshold *= duration_secs; if (geteuid() != 0) err_abort("%s requires root privileges to write to %s\n", app_name, proc_timer_stats); sane_procs = sane_proc_pid_info(); if (!sane_procs) opt_flags &= ~(OPT_CMD_SHORT | OPT_CMD_LONG); memset(&new_action, 0, sizeof(new_action)); for (i = 0; signals[i] != -1; i++) { new_action.sa_handler = handle_sig; sigemptyset(&new_action.sa_mask); new_action.sa_flags = 0; if (sigaction(signals[i], &new_action, NULL) < 0) err_abort("sigaction failed: errno=%d (%s)\n", errno, strerror(errno)); } if ((timer_stats_old = calloc(TABLE_SIZE, sizeof(timer_stat_t*))) == NULL) err_abort("Cannot allocate old timer stats table\n"); if ((timer_stats_new = calloc(TABLE_SIZE, sizeof(timer_stat_t*))) == NULL) err_abort("Cannot allocate old timer stats table\n"); /* Should really catch signals and set back to zero before we die */ set_timer_stat("1\n", true); time_now = time_start = gettime_to_double(); get_events(timer_stats_old, time_now); if (opt_flags & OPT_TOP) { struct sigaction sa; memset(&sa, 0, sizeof(sa)); sa.sa_handler = handle_sigwinch; if (sigaction(SIGWINCH, &sa, NULL) < 0) err_abort("sigaction failed: errno=%d (%s)\n", errno, strerror(errno)); initscr(); cbreak(); noecho(); nodelay(stdscr, 1); keypad(stdscr, 1); curs_set(0); curses_init = true; } while (!stop_eventstat && (forever || count--)) { struct timeval tv; double secs, duration, time_delta; int ret; /* Timeout to wait for in the future for this sample */ secs = time_start + ((double)t * duration_secs) - time_now; /* Play catch-up, probably been asleep */ if (secs < 0.0) { t = ceil((time_now - time_start) / duration_secs); secs = time_start + ((double)t * duration_secs) - time_now; /* Really, it's impossible, but just in case.. */ if (secs < 0.0) secs = 0.0; } else { if (!redo) t++; } redo = false; tv = double_to_timeval(secs); if (curses_init) { fd_set rfds; int ch; FD_ZERO(&rfds); FD_SET(fileno(stdin), &rfds); ret = select(fileno(stdin) + 1, &rfds, NULL, NULL, &tv); ch = getch(); if ((ch == 27) || (ch == 'q')) break; if (ret > 0) redo = true; } else { ret = select(0, NULL, NULL, NULL, &tv); } if (ret < 0) { if (errno != EINTR) { eventstat_endwin(); fprintf(stderr, "select() failed: " "errno=%d (%s)\n", errno, strerror(errno)); goto abort; } redo = true; } duration = gettime_to_double() - time_now; duration = floor((duration * 1000.0) + 0.5) / 1000.0; time_now = gettime_to_double(); time_delta = time_now - time_start; get_events(timer_stats_new, time_now); eventstat_clear(); timer_stat_diff(duration, time_delta, n_lines, time_now, timer_stats_old, timer_stats_new); eventstat_refresh(); timer_stat_free_contents(timer_stats_old); tmp = timer_stats_old; timer_stats_old = timer_stats_new; timer_stats_new = tmp; timer_info_purge_old(time_now); } eventstat_endwin(); abort: samples_dump(csv_results); timer_stat_free_contents(timer_stats_old); timer_stat_free_contents(timer_stats_new); free(timer_stats_old); free(timer_stats_new); samples_free(); timer_info_list_free(); timer_stat_free_list_free(); free(get_events_buf); eventstat_exit(EXIT_SUCCESS); } eventstat-0.03.04/snapcraft/0000755000175000017500000000000013074166452014326 5ustar kingkingeventstat-0.03.04/snapcraft/snapcraft.yaml0000644000175000017500000000115713074166452017177 0ustar kingkingname: eventstat version: 0.03.3-20161115-254-9585650 summary: kernel event states monitoring tool description: Eventstat periodically dumps out the current kernel event state. It keeps track of current events and outputs the change in events on each output update. The tool requires sudo to run since it needs to write to /proc/timer_stats to start and stop the event monitoring. confinement: strict parts: eventstat: plugin: make source: git://kernel.ubuntu.com/cking/eventstat build-packages: - gcc - make apps: eventstat: command: usr/bin/eventstat eventstat-0.03.04/snapcraft/Makefile0000644000175000017500000000101513074166452015763 0ustar kingkingVERSION=$(shell git tag | tail -1 | cut -c2-) COMMITS=$(shell git log --oneline | wc -l) SHA=$(shell git log -1 --oneline | cut -d' ' -f1) DATE=$(shell date +'%Y%m%d') V=$(VERSION)-$(DATE)-$(COMMITS)-$(SHA) all: set_version snapcraft set_version: cat snapcraft.yaml | sed 's/version: .*/version: $(V)/' > snapcraft-tmp.yaml mv snapcraft-tmp.yaml snapcraft.yaml clean: rm -rf setup *.snap snapcraft clean cat snapcraft.yaml | sed 's/version: .*/version: 0/' > snapcraft-tmp.yaml mv snapcraft-tmp.yaml snapcraft.yaml eventstat-0.03.04/COPYING0000644000175000017500000004325413074166452013410 0ustar kingking GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Lesser General Public License instead.) You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) year name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice This General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License.