1 /* 2 * Copyright (c) 1991, 1992 Paul Kranenburg <pk (at) cs.few.eur.nl> 3 * Copyright (c) 1993 Branko Lankester <branko (at) hacktic.nl> 4 * Copyright (c) 1993, 1994, 1995, 1996 Rick Sladkey <jrs (at) world.std.com> 5 * Copyright (c) 1996-1999 Wichert Akkerman <wichert (at) cistron.nl> 6 * Copyright (c) 1999 IBM Deutschland Entwicklung GmbH, IBM Corporation 7 * Linux for s390 port by D.J. Barrow 8 * <barrow_dj (at) mail.yahoo.com,djbarrow (at) de.ibm.com> 9 * Copyright (c) 2004 Roland McGrath <roland (at) redhat.com> 10 * Copyright (c) 2006 Dmitry V. Levin <ldv (at) altlinux.org> 11 * All rights reserved. 12 * 13 * Redistribution and use in source and binary forms, with or without 14 * modification, are permitted provided that the following conditions 15 * are met: 16 * 1. Redistributions of source code must retain the above copyright 17 * notice, this list of conditions and the following disclaimer. 18 * 2. Redistributions in binary form must reproduce the above copyright 19 * notice, this list of conditions and the following disclaimer in the 20 * documentation and/or other materials provided with the distribution. 21 * 3. The name of the author may not be used to endorse or promote products 22 * derived from this software without specific prior written permission. 23 * 24 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 25 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 26 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 27 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 28 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 29 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 30 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 31 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 32 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 33 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 34 */ 35 36 #include "defs.h" 37 38 /* Per-syscall stats structure */ 39 struct call_counts { 40 /* time may be total latency or system time */ 41 struct timeval time; 42 int calls, errors; 43 }; 44 45 static struct call_counts *countv[SUPPORTED_PERSONALITIES]; 46 #define counts (countv[current_personality]) 47 48 static struct timeval shortest = { 1000000, 0 }; 49 50 void 51 count_syscall(struct tcb *tcp, const struct timeval *syscall_exiting_tv) 52 { 53 struct timeval wtv; 54 struct timeval *tv = &wtv; 55 struct call_counts *cc; 56 unsigned long scno = tcp->scno; 57 58 if (!SCNO_IN_RANGE(scno)) 59 return; 60 61 if (!counts) { 62 counts = calloc(nsyscalls, sizeof(*counts)); 63 if (!counts) 64 die_out_of_memory(); 65 } 66 cc = &counts[scno]; 67 68 cc->calls++; 69 if (tcp->u_error) 70 cc->errors++; 71 72 /* tv = wall clock time spent while in syscall */ 73 tv_sub(tv, syscall_exiting_tv, &tcp->etime); 74 75 /* Spent more wall clock time than spent system time? (usually yes) */ 76 if (tv_cmp(tv, &tcp->dtime) > 0) { 77 static struct timeval one_tick = { -1, 0 }; 78 79 if (one_tick.tv_sec == -1) { 80 /* Initialize it. */ 81 struct itimerval it; 82 83 memset(&it, 0, sizeof it); 84 it.it_interval.tv_usec = 1; 85 setitimer(ITIMER_REAL, &it, NULL); 86 getitimer(ITIMER_REAL, &it); 87 one_tick = it.it_interval; 88 //FIXME: this hack doesn't work (tested on linux-3.6.11): one_tick = 0.000000 89 //tprintf(" one_tick.tv_usec:%u\n", (unsigned)one_tick.tv_usec); 90 } 91 92 if (tv_nz(&tcp->dtime)) 93 /* tv = system time spent, if it isn't 0 */ 94 tv = &tcp->dtime; 95 else if (tv_cmp(tv, &one_tick) > 0) { 96 /* tv = smallest "sane" time interval */ 97 if (tv_cmp(&shortest, &one_tick) < 0) 98 tv = &shortest; 99 else 100 tv = &one_tick; 101 } 102 } 103 if (tv_cmp(tv, &shortest) < 0) 104 shortest = *tv; 105 tv_add(&cc->time, &cc->time, count_wallclock ? &wtv : tv); 106 } 107 108 static int 109 time_cmp(void *a, void *b) 110 { 111 return -tv_cmp(&counts[*((int *) a)].time, 112 &counts[*((int *) b)].time); 113 } 114 115 static int 116 syscall_cmp(void *a, void *b) 117 { 118 return strcmp(sysent[*((int *) a)].sys_name, 119 sysent[*((int *) b)].sys_name); 120 } 121 122 static int 123 count_cmp(void *a, void *b) 124 { 125 int m = counts[*((int *) a)].calls; 126 int n = counts[*((int *) b)].calls; 127 128 return (m < n) ? 1 : (m > n) ? -1 : 0; 129 } 130 131 static int (*sortfun)(); 132 static struct timeval overhead = { -1, -1 }; 133 134 void 135 set_sortby(const char *sortby) 136 { 137 if (strcmp(sortby, "time") == 0) 138 sortfun = time_cmp; 139 else if (strcmp(sortby, "calls") == 0) 140 sortfun = count_cmp; 141 else if (strcmp(sortby, "name") == 0) 142 sortfun = syscall_cmp; 143 else if (strcmp(sortby, "nothing") == 0) 144 sortfun = NULL; 145 else { 146 error_msg_and_die("invalid sortby: '%s'", sortby); 147 } 148 } 149 150 void set_overhead(int n) 151 { 152 overhead.tv_sec = n / 1000000; 153 overhead.tv_usec = n % 1000000; 154 } 155 156 static void 157 call_summary_pers(FILE *outf) 158 { 159 int i; 160 int call_cum, error_cum; 161 struct timeval tv_cum, dtv; 162 double float_tv_cum; 163 double percent; 164 const char *dashes = "----------------"; 165 char error_str[sizeof(int)*3]; 166 int *sorted_count; 167 168 fprintf(outf, "%6.6s %11.11s %11.11s %9.9s %9.9s %s\n", 169 "% time", "seconds", "usecs/call", 170 "calls", "errors", "syscall"); 171 fprintf(outf, "%6.6s %11.11s %11.11s %9.9s %9.9s %s\n", 172 dashes, dashes, dashes, dashes, dashes, dashes); 173 174 sorted_count = calloc(sizeof(int), nsyscalls); 175 if (!sorted_count) 176 die_out_of_memory(); 177 call_cum = error_cum = tv_cum.tv_sec = tv_cum.tv_usec = 0; 178 if (overhead.tv_sec == -1) { 179 tv_mul(&overhead, &shortest, 8); 180 tv_div(&overhead, &overhead, 10); 181 } 182 for (i = 0; i < nsyscalls; i++) { 183 sorted_count[i] = i; 184 if (counts == NULL || counts[i].calls == 0) 185 continue; 186 tv_mul(&dtv, &overhead, counts[i].calls); 187 tv_sub(&counts[i].time, &counts[i].time, &dtv); 188 call_cum += counts[i].calls; 189 error_cum += counts[i].errors; 190 tv_add(&tv_cum, &tv_cum, &counts[i].time); 191 } 192 float_tv_cum = tv_float(&tv_cum); 193 if (counts) { 194 if (sortfun) 195 qsort((void *) sorted_count, nsyscalls, sizeof(int), sortfun); 196 for (i = 0; i < nsyscalls; i++) { 197 double float_syscall_time; 198 int idx = sorted_count[i]; 199 struct call_counts *cc = &counts[idx]; 200 if (cc->calls == 0) 201 continue; 202 tv_div(&dtv, &cc->time, cc->calls); 203 error_str[0] = '\0'; 204 if (cc->errors) 205 sprintf(error_str, "%u", cc->errors); 206 float_syscall_time = tv_float(&cc->time); 207 percent = (100.0 * float_syscall_time); 208 if (percent != 0.0) 209 percent /= float_tv_cum; 210 /* else: float_tv_cum can be 0.0 too and we get 0/0 = NAN */ 211 fprintf(outf, "%6.2f %11.6f %11lu %9u %9.9s %s\n", 212 percent, float_syscall_time, 213 (long) (1000000 * dtv.tv_sec + dtv.tv_usec), 214 cc->calls, 215 error_str, sysent[idx].sys_name); 216 } 217 } 218 free(sorted_count); 219 220 fprintf(outf, "%6.6s %11.11s %11.11s %9.9s %9.9s %s\n", 221 dashes, dashes, dashes, dashes, dashes, dashes); 222 error_str[0] = '\0'; 223 if (error_cum) 224 sprintf(error_str, "%u", error_cum); 225 fprintf(outf, "%6.6s %11.6f %11.11s %9u %9.9s %s\n", 226 "100.00", float_tv_cum, "", 227 call_cum, error_str, "total"); 228 } 229 230 void 231 call_summary(FILE *outf) 232 { 233 int i, old_pers = current_personality; 234 235 for (i = 0; i < SUPPORTED_PERSONALITIES; ++i) { 236 if (!countv[i]) 237 continue; 238 239 if (current_personality != i) 240 set_personality(i); 241 if (i) 242 fprintf(outf, 243 "System call usage summary for %d bit mode:\n", 244 current_wordsize * 8); 245 call_summary_pers(outf); 246 } 247 248 if (old_pers != current_personality) 249 set_personality(old_pers); 250 } 251
