1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
/*
* This file is part of ltrace.
* Copyright (C) 2003,2008,2009 Juan Cespedes
* Copyright (C) 2006 Ian Wienand
*
* 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 St, Fifth Floor, Boston, MA
* 02110-1301 USA
*/
#include "config.h"
#include <stdio.h>
#include <stdlib.h>
#include <sys/time.h>
#include "common.h"
static int num_entries = 0;
static struct entry_st {
char *name;
int count;
struct timeval tv;
} *entries = NULL;
static int tot_count = 0;
static unsigned long int tot_usecs = 0;
static void fill_struct(void *key, void *value, void *data)
{
struct opt_c_struct *st = (struct opt_c_struct *)value;
entries = realloc(entries, (num_entries + 1) * sizeof(struct entry_st));
if (!entries) {
perror("realloc()");
exit(1);
}
entries[num_entries].name = (char *)key;
entries[num_entries].count = st->count;
entries[num_entries].tv = st->tv;
tot_count += st->count;
tot_usecs += 1000000 * st->tv.tv_sec;
tot_usecs += st->tv.tv_usec;
num_entries++;
}
static int compar(const void *a, const void *b)
{
struct entry_st *en1, *en2;
en1 = (struct entry_st *)a;
en2 = (struct entry_st *)b;
if (en2->tv.tv_sec - en1->tv.tv_sec) {
return (en2->tv.tv_sec - en1->tv.tv_sec);
} else {
return (en2->tv.tv_usec - en1->tv.tv_usec);
}
}
void show_summary(void)
{
int i;
num_entries = 0;
entries = NULL;
dict_apply_to_all(dict_opt_c, fill_struct, NULL);
qsort(entries, num_entries, sizeof(*entries), compar);
fprintf(options.output, "%% time seconds usecs/call calls function\n");
fprintf(options.output, "------ ----------- ----------- --------- --------------------\n");
for (i = 0; i < num_entries; i++) {
unsigned long long int c;
unsigned long long int p;
c = 1000000 * (int)entries[i].tv.tv_sec +
(int)entries[i].tv.tv_usec;
p = 100000 * c / tot_usecs + 5;
fprintf(options.output, "%3lu.%02lu %4d.%06d %11lu %9d %s\n",
(unsigned long int)(p / 1000),
(unsigned long int)((p / 10) % 100),
(int)entries[i].tv.tv_sec, (int)entries[i].tv.tv_usec,
(unsigned long int)(c / entries[i].count),
entries[i].count,
#ifdef USE_DEMANGLE
options.demangle ? my_demangle(entries[i].name) :
#endif
entries[i].name);
}
fprintf(options.output, "------ ----------- ----------- --------- --------------------\n");
fprintf(options.output, "100.00 %4lu.%06lu %9d total\n", tot_usecs / 1000000,
tot_usecs % 1000000, tot_count);
}
|
