granicus.if.org Git - strace/blob - count.c

   1 /*
   2  * Copyright (c) 1991, 1992 Paul Kranenburg <pk@cs.few.eur.nl>
   3  * Copyright (c) 1993 Branko Lankester <branko@hacktic.nl>
   4  * Copyright (c) 1993, 1994, 1995, 1996 Rick Sladkey <jrs@world.std.com>
   5  * Copyright (c) 1996-1999 Wichert Akkerman <wichert@cistron.nl>
   6  * Copyright (c) 1999 IBM Deutschland Entwicklung GmbH, IBM Corporation
   7  *                     Linux for s390 port by D.J. Barrow
   8  *                    <barrow_dj@mail.yahoo.com,djbarrow@de.ibm.com>
   9  * Copyright (c) 2004 Roland McGrath <roland@redhat.com>
  10  * Copyright (c) 2006 Dmitry V. Levin <ldv@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  *      $Id$
  36  */
  37
  38 #include "defs.h"
  39
  40 struct call_counts {
  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 int
  51 count_syscall(struct tcb *tcp, struct timeval *tv)
  52 {
  53         if (tcp->scno < 0 || tcp->scno >= nsyscalls)
  54                 return 0;
  55
  56         if (!counts)
  57         {
  58                 counts = calloc(nsyscalls, sizeof(*counts));
  59                 if (!counts)
  60                 {
  61                         fprintf(stderr,
  62                                 "strace: out of memory for call counts\n");
  63                         exit(1);
  64                 }
  65         }
  66
  67         counts[tcp->scno].calls++;
  68         if (tcp->u_error)
  69                 counts[tcp->scno].errors++;
  70
  71         tv_sub(tv, tv, &tcp->etime);
  72 #ifdef LINUX
  73         if (tv_cmp(tv, &tcp->dtime) > 0)
  74         {
  75                 static struct timeval one_tick;
  76
  77                 if (one_tick.tv_usec == 0)
  78                 {
  79                         /* Initialize it.  */
  80                         struct itimerval it;
  81
  82                         memset(&it, 0, sizeof it);
  83                         it.it_interval.tv_usec = 1;
  84                         setitimer(ITIMER_REAL, &it, NULL);
  85                         getitimer(ITIMER_REAL, &it);
  86                         one_tick = it.it_interval;
  87                 }
  88
  89                 if (tv_nz(&tcp->dtime))
  90                         *tv = tcp->dtime;
  91                 else if (tv_cmp(tv, &one_tick) > 0)
  92                 {
  93                         if (tv_cmp(&shortest, &one_tick) < 0)
  94                                 *tv = shortest;
  95                         else
  96                                 *tv = one_tick;
  97                 }
  98         }
  99 #endif /* LINUX */
 100         if (tv_cmp(tv, &shortest) < 0)
 101                 shortest = *tv;
 102         tv_add(&counts[tcp->scno].time, &counts[tcp->scno].time, tv);
 103
 104         return 0;
 105 }
 106
 107 static int
 108 time_cmp(void *a, void *b)
 109 {
 110         return -tv_cmp(&counts[*((int *) a)].time,
 111                        &counts[*((int *) b)].time);
 112 }
 113
 114 static int
 115 syscall_cmp(void *a, void *b)
 116 {
 117         return strcmp(sysent[*((int *) a)].sys_name,
 118                       sysent[*((int *) b)].sys_name);
 119 }
 120
 121 static int
 122 count_cmp(void *a, void *b)
 123 {
 124         int     m = counts[*((int *) a)].calls;
 125         int     n = counts[*((int *) b)].calls;
 126
 127         return (m < n) ? 1 : (m > n) ? -1 : 0;
 128 }
 129
 130 static int (*sortfun)();
 131 static struct timeval overhead = { -1, -1 };
 132
 133 void
 134 set_sortby(const char *sortby)
 135 {
 136         if (strcmp(sortby, "time") == 0)
 137                 sortfun = time_cmp;
 138         else if (strcmp(sortby, "calls") == 0)
 139                 sortfun = count_cmp;
 140         else if (strcmp(sortby, "name") == 0)
 141                 sortfun = syscall_cmp;
 142         else if (strcmp(sortby, "nothing") == 0)
 143                 sortfun = NULL;
 144         else
 145         {
 146                 fprintf(stderr, "invalid sortby: `%s'\n", sortby);
 147                 exit(1);
 148         }
 149 }
 150
 151 void set_overhead(int n)
 152 {
 153         overhead.tv_sec = n / 1000000;
 154         overhead.tv_usec = n % 1000000;
 155 }
 156
 157 static void
 158 call_summary_pers(FILE *outf)
 159 {
 160         int     i, j;
 161         int     call_cum, error_cum;
 162         struct timeval tv_cum, dtv;
 163         double  percent;
 164         const char *dashes = "-------------------------";
 165         char    error_str[16];
 166         int    *sorted_count = calloc(sizeof(int), nsyscalls);
 167
 168         if (!sorted_count)
 169         {
 170                 fprintf(stderr, "strace: out of memory for call summary\n");
 171                 return;
 172         }
 173
 174         call_cum = error_cum = tv_cum.tv_sec = tv_cum.tv_usec = 0;
 175         if (overhead.tv_sec == -1)
 176         {
 177                 tv_mul(&overhead, &shortest, 8);
 178                 tv_div(&overhead, &overhead, 10);
 179         }
 180         for (i = 0; i < nsyscalls; i++)
 181         {
 182                 sorted_count[i] = i;
 183                 if (counts == NULL || counts[i].calls == 0)
 184                         continue;
 185                 tv_mul(&dtv, &overhead, counts[i].calls);
 186                 tv_sub(&counts[i].time, &counts[i].time, &dtv);
 187                 call_cum += counts[i].calls;
 188                 error_cum += counts[i].errors;
 189                 tv_add(&tv_cum, &tv_cum, &counts[i].time);
 190         }
 191         if (counts && sortfun)
 192                 qsort((void *) sorted_count, nsyscalls, sizeof(int), sortfun);
 193         fprintf(outf, "%6.6s %11.11s %11.11s %9.9s %9.9s %s\n",
 194                 "% time", "seconds", "usecs/call",
 195                 "calls", "errors", "syscall");
 196         fprintf(outf, "%6.6s %11.11s %11.11s %9.9s %9.9s %-16.16s\n",
 197                 dashes, dashes, dashes, dashes, dashes, dashes);
 198         if (counts)
 199         {
 200                 for (i = 0; i < nsyscalls; i++)
 201                 {
 202                         j = sorted_count[i];
 203                         if (counts[j].calls == 0)
 204                                 continue;
 205                         tv_div(&dtv, &counts[j].time, counts[j].calls);
 206                         if (counts[j].errors)
 207                                 sprintf(error_str, "%d", counts[j].errors);
 208                         else
 209                                 error_str[0] = '\0';
 210                         percent = (100.0 * tv_float(&counts[j].time)
 211                                    / tv_float(&tv_cum));
 212                         fprintf(outf, "%6.2f %11.6f %11ld %9d %9.9s %s\n",
 213                                 percent, tv_float(&counts[j].time),
 214                                 (long) 1000000 * dtv.tv_sec + dtv.tv_usec,
 215                                 counts[j].calls,
 216                                 error_str, sysent[j].sys_name);
 217                 }
 218         }
 219         free(sorted_count);
 220
 221         fprintf(outf, "%6.6s %11.11s %11.11s %9.9s %9.9s %-16.16s\n",
 222                 dashes, dashes, dashes, dashes, dashes, dashes);
 223         if (error_cum)
 224                 sprintf(error_str, "%d", error_cum);
 225         else
 226                 error_str[0] = '\0';
 227         fprintf(outf, "%6.6s %11.6f %11.11s %9d %9.9s %s\n",
 228                 "100.00", tv_float(&tv_cum), "",
 229                 call_cum, error_str, "total");
 230 }
 231
 232 void
 233 call_summary(FILE *outf)
 234 {
 235         int     i, old_pers = current_personality;
 236
 237         for (i = 0; i < SUPPORTED_PERSONALITIES; ++i)
 238         {
 239                 if (!countv[i])
 240                         continue;
 241
 242                 if (current_personality != i)
 243                         set_personality(i);
 244                 if (i)
 245                         fprintf(outf,
 246                                 "System call usage summary for %u bit mode:\n",
 247                                 personality_wordsize[current_personality] * 8);
 248                 call_summary_pers(outf);
 249         }
 250
 251         if (old_pers != current_personality)
 252                 set_personality(old_pers);
 253 }