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 void
  51 count_syscall(struct tcb *tcp, struct timeval *tv)
  52 {
  53         if (!SCNO_IN_RANGE(tcp->scno))
  54                 return;
  55
  56         if (!counts) {
  57                 counts = calloc(nsyscalls, sizeof(*counts));
  58                 if (!counts)
  59                         die_out_of_memory();
  60         }
  61
  62         counts[tcp->scno].calls++;
  63         if (tcp->u_error)
  64                 counts[tcp->scno].errors++;
  65
  66         tv_sub(tv, tv, &tcp->etime);
  67         if (tv_cmp(tv, &tcp->dtime) > 0) {
  68                 static struct timeval one_tick;
  69
  70                 if (one_tick.tv_usec == 0) {
  71                         /* Initialize it.  */
  72                         struct itimerval it;
  73
  74                         memset(&it, 0, sizeof it);
  75                         it.it_interval.tv_usec = 1;
  76                         setitimer(ITIMER_REAL, &it, NULL);
  77                         getitimer(ITIMER_REAL, &it);
  78                         one_tick = it.it_interval;
  79                 }
  80
  81                 if (tv_nz(&tcp->dtime))
  82                         *tv = tcp->dtime;
  83                 else if (tv_cmp(tv, &one_tick) > 0) {
  84                         if (tv_cmp(&shortest, &one_tick) < 0)
  85                                 *tv = shortest;
  86                         else
  87                                 *tv = one_tick;
  88                 }
  89         }
  90         if (tv_cmp(tv, &shortest) < 0)
  91                 shortest = *tv;
  92         tv_add(&counts[tcp->scno].time, &counts[tcp->scno].time, tv);
  93 }
  94
  95 static int
  96 time_cmp(void *a, void *b)
  97 {
  98         return -tv_cmp(&counts[*((int *) a)].time,
  99                        &counts[*((int *) b)].time);
 100 }
 101
 102 static int
 103 syscall_cmp(void *a, void *b)
 104 {
 105         return strcmp(sysent[*((int *) a)].sys_name,
 106                       sysent[*((int *) b)].sys_name);
 107 }
 108
 109 static int
 110 count_cmp(void *a, void *b)
 111 {
 112         int     m = counts[*((int *) a)].calls;
 113         int     n = counts[*((int *) b)].calls;
 114
 115         return (m < n) ? 1 : (m > n) ? -1 : 0;
 116 }
 117
 118 static int (*sortfun)();
 119 static struct timeval overhead = { -1, -1 };
 120
 121 void
 122 set_sortby(const char *sortby)
 123 {
 124         if (strcmp(sortby, "time") == 0)
 125                 sortfun = time_cmp;
 126         else if (strcmp(sortby, "calls") == 0)
 127                 sortfun = count_cmp;
 128         else if (strcmp(sortby, "name") == 0)
 129                 sortfun = syscall_cmp;
 130         else if (strcmp(sortby, "nothing") == 0)
 131                 sortfun = NULL;
 132         else {
 133                 error_msg_and_die("invalid sortby: '%s'", sortby);
 134         }
 135 }
 136
 137 void set_overhead(int n)
 138 {
 139         overhead.tv_sec = n / 1000000;
 140         overhead.tv_usec = n % 1000000;
 141 }
 142
 143 static void
 144 call_summary_pers(FILE *outf)
 145 {
 146         int     i, j;
 147         int     call_cum, error_cum;
 148         struct timeval tv_cum, dtv;
 149         double  percent;
 150         const char *dashes = "-------------------------";
 151         char    error_str[16];
 152         int    *sorted_count = calloc(sizeof(int), nsyscalls);
 153
 154         if (!sorted_count)
 155                 die_out_of_memory();
 156
 157         call_cum = error_cum = tv_cum.tv_sec = tv_cum.tv_usec = 0;
 158         if (overhead.tv_sec == -1) {
 159                 tv_mul(&overhead, &shortest, 8);
 160                 tv_div(&overhead, &overhead, 10);
 161         }
 162         for (i = 0; i < nsyscalls; i++) {
 163                 sorted_count[i] = i;
 164                 if (counts == NULL || counts[i].calls == 0)
 165                         continue;
 166                 tv_mul(&dtv, &overhead, counts[i].calls);
 167                 tv_sub(&counts[i].time, &counts[i].time, &dtv);
 168                 call_cum += counts[i].calls;
 169                 error_cum += counts[i].errors;
 170                 tv_add(&tv_cum, &tv_cum, &counts[i].time);
 171         }
 172         if (counts && sortfun)
 173                 qsort((void *) sorted_count, nsyscalls, sizeof(int), sortfun);
 174         fprintf(outf, "%6.6s %11.11s %11.11s %9.9s %9.9s %s\n",
 175                 "% time", "seconds", "usecs/call",
 176                 "calls", "errors", "syscall");
 177         fprintf(outf, "%6.6s %11.11s %11.11s %9.9s %9.9s %-16.16s\n",
 178                 dashes, dashes, dashes, dashes, dashes, dashes);
 179         if (counts) {
 180                 for (i = 0; i < nsyscalls; i++) {
 181                         j = sorted_count[i];
 182                         if (counts[j].calls == 0)
 183                                 continue;
 184                         tv_div(&dtv, &counts[j].time, counts[j].calls);
 185                         if (counts[j].errors)
 186                                 sprintf(error_str, "%d", counts[j].errors);
 187                         else
 188                                 error_str[0] = '\0';
 189                         percent = (100.0 * tv_float(&counts[j].time)
 190                                    / tv_float(&tv_cum));
 191                         fprintf(outf, "%6.2f %11.6f %11ld %9d %9.9s %s\n",
 192                                 percent, tv_float(&counts[j].time),
 193                                 (long) (1000000 * dtv.tv_sec + dtv.tv_usec),
 194                                 counts[j].calls,
 195                                 error_str, sysent[j].sys_name);
 196                 }
 197         }
 198         free(sorted_count);
 199
 200         fprintf(outf, "%6.6s %11.11s %11.11s %9.9s %9.9s %-16.16s\n",
 201                 dashes, dashes, dashes, dashes, dashes, dashes);
 202         if (error_cum)
 203                 sprintf(error_str, "%d", error_cum);
 204         else
 205                 error_str[0] = '\0';
 206         fprintf(outf, "%6.6s %11.6f %11.11s %9d %9.9s %s\n",
 207                 "100.00", tv_float(&tv_cum), "",
 208                 call_cum, error_str, "total");
 209 }
 210
 211 void
 212 call_summary(FILE *outf)
 213 {
 214         int i, old_pers = current_personality;
 215
 216         for (i = 0; i < SUPPORTED_PERSONALITIES; ++i) {
 217                 if (!countv[i])
 218                         continue;
 219
 220                 if (current_personality != i)
 221                         set_personality(i);
 222                 if (i)
 223                         fprintf(outf,
 224                                 "System call usage summary for %u bit mode:\n",
 225                                 personality_wordsize[current_personality] * 8);
 226                 call_summary_pers(outf);
 227         }
 228
 229         if (old_pers != current_personality)
 230                 set_personality(old_pers);
 231 }