2000-07-24 20:59:04 +00:00
|
|
|
|
/* hist.c - Histogram related operations.
|
|
|
|
|
|
2002-02-01 08:24:16 +00:00
|
|
|
|
Copyright 2000, 2001, 2002 Free Software Foundation, Inc.
|
2000-07-24 20:59:04 +00:00
|
|
|
|
|
|
|
|
|
This file is part of GNU Binutils.
|
|
|
|
|
|
|
|
|
|
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., 59 Temple Place - Suite 330, Boston, MA
|
|
|
|
|
02111-1307, USA. */
|
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
#include "libiberty.h"
|
|
|
|
|
#include "gprof.h"
|
2002-01-31 12:56:08 +00:00
|
|
|
|
#include "search_list.h"
|
|
|
|
|
#include "source.h"
|
|
|
|
|
#include "symtab.h"
|
1999-05-03 07:29:11 +00:00
|
|
|
|
#include "corefile.h"
|
|
|
|
|
#include "gmon_io.h"
|
|
|
|
|
#include "gmon_out.h"
|
|
|
|
|
#include "hist.h"
|
|
|
|
|
#include "sym_ids.h"
|
|
|
|
|
#include "utils.h"
|
|
|
|
|
|
|
|
|
|
#define UNITS_TO_CODE (offset_to_code / sizeof(UNIT))
|
|
|
|
|
|
|
|
|
|
static void scale_and_align_entries PARAMS ((void));
|
2002-02-01 08:24:16 +00:00
|
|
|
|
static void print_header PARAMS ((int));
|
|
|
|
|
static void print_line PARAMS ((Sym *, double));
|
|
|
|
|
static int cmp_time PARAMS ((const PTR, const PTR));
|
1999-05-03 07:29:11 +00:00
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
/* Declarations of automatically generated functions to output blurbs. */
|
1999-05-03 07:29:11 +00:00
|
|
|
|
extern void flat_blurb PARAMS ((FILE * fp));
|
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
bfd_vma s_lowpc; /* Lowest address in .text. */
|
|
|
|
|
bfd_vma s_highpc = 0; /* Highest address in .text. */
|
|
|
|
|
bfd_vma lowpc, highpc; /* Same, but expressed in UNITs. */
|
|
|
|
|
int hist_num_bins = 0; /* Number of histogram samples. */
|
|
|
|
|
int *hist_sample = 0; /* Histogram samples (shorts in the file!). */
|
1999-05-03 07:29:11 +00:00
|
|
|
|
double hist_scale;
|
2001-03-14 03:14:56 +00:00
|
|
|
|
char hist_dimension[16] = "seconds";
|
1999-05-03 07:29:11 +00:00
|
|
|
|
char hist_dimension_abbrev = 's';
|
|
|
|
|
|
2001-03-14 03:14:56 +00:00
|
|
|
|
static double accum_time; /* Accumulated time so far for print_line(). */
|
2000-07-24 20:59:04 +00:00
|
|
|
|
static double total_time; /* Total time for all routines. */
|
|
|
|
|
|
|
|
|
|
/* Table of SI prefixes for powers of 10 (used to automatically
|
|
|
|
|
scale some of the values in the flat profile). */
|
1999-05-03 07:29:11 +00:00
|
|
|
|
const struct
|
|
|
|
|
{
|
|
|
|
|
char prefix;
|
|
|
|
|
double scale;
|
|
|
|
|
}
|
|
|
|
|
SItab[] =
|
|
|
|
|
{
|
2001-03-14 03:14:56 +00:00
|
|
|
|
{ 'T', 1e-12 }, /* tera */
|
|
|
|
|
{ 'G', 1e-09 }, /* giga */
|
|
|
|
|
{ 'M', 1e-06 }, /* mega */
|
|
|
|
|
{ 'K', 1e-03 }, /* kilo */
|
|
|
|
|
{ ' ', 1e-00 },
|
|
|
|
|
{ 'm', 1e+03 }, /* milli */
|
|
|
|
|
{ 'u', 1e+06 }, /* micro */
|
|
|
|
|
{ 'n', 1e+09 }, /* nano */
|
|
|
|
|
{ 'p', 1e+12 }, /* pico */
|
|
|
|
|
{ 'f', 1e+15 }, /* femto */
|
|
|
|
|
{ 'a', 1e+18 } /* ato */
|
1999-05-03 07:29:11 +00:00
|
|
|
|
};
|
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
|
|
|
|
|
/* Read the histogram from file IFP. FILENAME is the name of IFP and
|
|
|
|
|
is provided for formatting error messages only. */
|
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
void
|
2002-02-01 08:24:16 +00:00
|
|
|
|
hist_read_rec (ifp, filename)
|
|
|
|
|
FILE * ifp;
|
|
|
|
|
const char *filename;
|
1999-05-03 07:29:11 +00:00
|
|
|
|
{
|
|
|
|
|
bfd_vma n_lowpc, n_highpc;
|
|
|
|
|
int i, ncnt, profrate;
|
|
|
|
|
UNIT count;
|
|
|
|
|
|
2001-03-14 03:14:56 +00:00
|
|
|
|
if (gmon_io_read_vma (ifp, &n_lowpc)
|
|
|
|
|
|| gmon_io_read_vma (ifp, &n_highpc)
|
|
|
|
|
|| gmon_io_read_32 (ifp, &ncnt)
|
|
|
|
|
|| gmon_io_read_32 (ifp, &profrate)
|
|
|
|
|
|| gmon_io_read (ifp, hist_dimension, 15)
|
|
|
|
|
|| gmon_io_read (ifp, &hist_dimension_abbrev, 1))
|
1999-05-03 07:29:11 +00:00
|
|
|
|
{
|
|
|
|
|
fprintf (stderr, _("%s: %s: unexpected end of file\n"),
|
|
|
|
|
whoami, filename);
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
done (1);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (!s_highpc)
|
|
|
|
|
{
|
2000-07-24 20:59:04 +00:00
|
|
|
|
/* This is the first histogram record. */
|
1999-05-03 07:29:11 +00:00
|
|
|
|
s_lowpc = n_lowpc;
|
|
|
|
|
s_highpc = n_highpc;
|
|
|
|
|
lowpc = (bfd_vma) n_lowpc / sizeof (UNIT);
|
|
|
|
|
highpc = (bfd_vma) n_highpc / sizeof (UNIT);
|
|
|
|
|
hist_num_bins = ncnt;
|
|
|
|
|
hz = profrate;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
DBG (SAMPLEDEBUG,
|
|
|
|
|
printf ("[hist_read_rec] n_lowpc 0x%lx n_highpc 0x%lx ncnt %d\n",
|
1999-06-30 22:38:30 +00:00
|
|
|
|
(unsigned long) n_lowpc, (unsigned long) n_highpc, ncnt);
|
1999-05-03 07:29:11 +00:00
|
|
|
|
printf ("[hist_read_rec] s_lowpc 0x%lx s_highpc 0x%lx nsamples %d\n",
|
1999-06-30 22:38:30 +00:00
|
|
|
|
(unsigned long) s_lowpc, (unsigned long) s_highpc,
|
|
|
|
|
hist_num_bins);
|
1999-05-03 07:29:11 +00:00
|
|
|
|
printf ("[hist_read_rec] lowpc 0x%lx highpc 0x%lx\n",
|
1999-06-30 22:38:30 +00:00
|
|
|
|
(unsigned long) lowpc, (unsigned long) highpc));
|
1999-05-03 07:29:11 +00:00
|
|
|
|
|
|
|
|
|
if (n_lowpc != s_lowpc || n_highpc != s_highpc
|
|
|
|
|
|| ncnt != hist_num_bins || hz != profrate)
|
|
|
|
|
{
|
|
|
|
|
fprintf (stderr, _("%s: `%s' is incompatible with first gmon file\n"),
|
|
|
|
|
whoami, filename);
|
|
|
|
|
done (1);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (!hist_sample)
|
|
|
|
|
{
|
|
|
|
|
hist_sample = (int *) xmalloc (hist_num_bins * sizeof (hist_sample[0]));
|
|
|
|
|
memset (hist_sample, 0, hist_num_bins * sizeof (hist_sample[0]));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < hist_num_bins; ++i)
|
|
|
|
|
{
|
|
|
|
|
if (fread (&count[0], sizeof (count), 1, ifp) != 1)
|
|
|
|
|
{
|
|
|
|
|
fprintf (stderr,
|
2001-03-14 03:14:56 +00:00
|
|
|
|
_("%s: %s: unexpected EOF after reading %d of %d samples\n"),
|
1999-05-03 07:29:11 +00:00
|
|
|
|
whoami, filename, i, hist_num_bins);
|
|
|
|
|
done (1);
|
|
|
|
|
}
|
|
|
|
|
hist_sample[i] += bfd_get_16 (core_bfd, (bfd_byte *) & count[0]);
|
2001-03-14 03:14:56 +00:00
|
|
|
|
DBG (SAMPLEDEBUG,
|
|
|
|
|
printf ("[hist_read_rec] 0x%lx: %u\n",
|
|
|
|
|
(unsigned long) (n_lowpc + i * (n_highpc - n_lowpc) / ncnt),
|
|
|
|
|
hist_sample[i]));
|
1999-05-03 07:29:11 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
/* Write execution histogram to file OFP. FILENAME is the name
|
|
|
|
|
of OFP and is provided for formatting error-messages only. */
|
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
void
|
2002-02-01 08:24:16 +00:00
|
|
|
|
hist_write_hist (ofp, filename)
|
|
|
|
|
FILE * ofp;
|
|
|
|
|
const char *filename;
|
1999-05-03 07:29:11 +00:00
|
|
|
|
{
|
|
|
|
|
UNIT count;
|
|
|
|
|
int i;
|
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
/* Write header. */
|
1999-05-03 07:29:11 +00:00
|
|
|
|
|
2001-03-14 03:14:56 +00:00
|
|
|
|
if (gmon_io_write_8 (ofp, GMON_TAG_TIME_HIST)
|
|
|
|
|
|| gmon_io_write_vma (ofp, s_lowpc)
|
|
|
|
|
|| gmon_io_write_vma (ofp, s_highpc)
|
|
|
|
|
|| gmon_io_write_32 (ofp, hist_num_bins)
|
|
|
|
|
|| gmon_io_write_32 (ofp, hz)
|
|
|
|
|
|| gmon_io_write (ofp, hist_dimension, 15)
|
|
|
|
|
|| gmon_io_write (ofp, &hist_dimension_abbrev, 1))
|
1999-05-03 07:29:11 +00:00
|
|
|
|
{
|
|
|
|
|
perror (filename);
|
|
|
|
|
done (1);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < hist_num_bins; ++i)
|
|
|
|
|
{
|
2002-02-01 08:24:16 +00:00
|
|
|
|
bfd_put_16 (core_bfd, (bfd_vma) hist_sample[i], (bfd_byte *) &count[0]);
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
if (fwrite (&count[0], sizeof (count), 1, ofp) != 1)
|
|
|
|
|
{
|
|
|
|
|
perror (filename);
|
|
|
|
|
done (1);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
/* Calculate scaled entry point addresses (to save time in
|
|
|
|
|
hist_assign_samples), and, on architectures that have procedure
|
|
|
|
|
entry masks at the start of a function, possibly push the scaled
|
|
|
|
|
entry points over the procedure entry mask, if it turns out that
|
|
|
|
|
the entry point is in one bin and the code for a routine is in the
|
|
|
|
|
next bin. */
|
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
static void
|
|
|
|
|
scale_and_align_entries ()
|
|
|
|
|
{
|
|
|
|
|
Sym *sym;
|
|
|
|
|
bfd_vma bin_of_entry;
|
|
|
|
|
bfd_vma bin_of_code;
|
|
|
|
|
|
|
|
|
|
for (sym = symtab.base; sym < symtab.limit; sym++)
|
|
|
|
|
{
|
|
|
|
|
sym->hist.scaled_addr = sym->addr / sizeof (UNIT);
|
|
|
|
|
bin_of_entry = (sym->hist.scaled_addr - lowpc) / hist_scale;
|
2001-03-14 03:14:56 +00:00
|
|
|
|
bin_of_code = ((sym->hist.scaled_addr + UNITS_TO_CODE - lowpc)
|
|
|
|
|
/ hist_scale);
|
1999-05-03 07:29:11 +00:00
|
|
|
|
if (bin_of_entry < bin_of_code)
|
|
|
|
|
{
|
|
|
|
|
DBG (SAMPLEDEBUG,
|
|
|
|
|
printf ("[scale_and_align_entries] pushing 0x%lx to 0x%lx\n",
|
1999-06-30 22:38:30 +00:00
|
|
|
|
(unsigned long) sym->hist.scaled_addr,
|
|
|
|
|
(unsigned long) (sym->hist.scaled_addr
|
|
|
|
|
+ UNITS_TO_CODE)));
|
1999-05-03 07:29:11 +00:00
|
|
|
|
sym->hist.scaled_addr += UNITS_TO_CODE;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
/* Assign samples to the symbol to which they belong.
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
Histogram bin I covers some address range [BIN_LOWPC,BIN_HIGH_PC)
|
|
|
|
|
which may overlap one more symbol address ranges. If a symbol
|
|
|
|
|
overlaps with the bin's address range by O percent, then O percent
|
|
|
|
|
of the bin's count is credited to that symbol.
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
There are three cases as to where BIN_LOW_PC and BIN_HIGH_PC can be
|
|
|
|
|
with respect to the symbol's address range [SYM_LOW_PC,
|
|
|
|
|
SYM_HIGH_PC) as shown in the following diagram. OVERLAP computes
|
|
|
|
|
the distance (in UNITs) between the arrows, the fraction of the
|
|
|
|
|
sample that is to be credited to the symbol which starts at
|
|
|
|
|
SYM_LOW_PC.
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
|
|
|
|
sym_low_pc sym_high_pc
|
|
|
|
|
| |
|
|
|
|
|
v v
|
|
|
|
|
|
|
|
|
|
+-----------------------------------------------+
|
|
|
|
|
| |
|
|
|
|
|
| ->| |<- ->| |<- ->| |<- |
|
|
|
|
|
| | | | | |
|
|
|
|
|
+---------+ +---------+ +---------+
|
|
|
|
|
|
|
|
|
|
^ ^ ^ ^ ^ ^
|
|
|
|
|
| | | | | |
|
2000-07-24 20:59:04 +00:00
|
|
|
|
bin_low_pc bin_high_pc bin_low_pc bin_high_pc bin_low_pc bin_high_pc
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
For the VAX we assert that samples will never fall in the first two
|
|
|
|
|
bytes of any routine, since that is the entry mask, thus we call
|
|
|
|
|
scale_and_align_entries() to adjust the entry points if the entry
|
|
|
|
|
mask falls in one bin but the code for the routine doesn't start
|
|
|
|
|
until the next bin. In conjunction with the alignment of routine
|
|
|
|
|
addresses, this should allow us to have only one sample for every
|
|
|
|
|
four bytes of text space and never have any overlap (the two end
|
|
|
|
|
cases, above). */
|
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
void
|
2002-02-01 08:24:16 +00:00
|
|
|
|
hist_assign_samples ()
|
1999-05-03 07:29:11 +00:00
|
|
|
|
{
|
|
|
|
|
bfd_vma bin_low_pc, bin_high_pc;
|
|
|
|
|
bfd_vma sym_low_pc, sym_high_pc;
|
|
|
|
|
bfd_vma overlap, addr;
|
|
|
|
|
int bin_count, i;
|
|
|
|
|
unsigned int j;
|
|
|
|
|
double time, credit;
|
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
/* Read samples and assign to symbols. */
|
1999-05-03 07:29:11 +00:00
|
|
|
|
hist_scale = highpc - lowpc;
|
|
|
|
|
hist_scale /= hist_num_bins;
|
|
|
|
|
scale_and_align_entries ();
|
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
/* Iterate over all sample bins. */
|
1999-05-03 07:29:11 +00:00
|
|
|
|
for (i = 0, j = 1; i < hist_num_bins; ++i)
|
|
|
|
|
{
|
|
|
|
|
bin_count = hist_sample[i];
|
2000-07-24 20:59:04 +00:00
|
|
|
|
if (! bin_count)
|
|
|
|
|
continue;
|
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
bin_low_pc = lowpc + (bfd_vma) (hist_scale * i);
|
|
|
|
|
bin_high_pc = lowpc + (bfd_vma) (hist_scale * (i + 1));
|
|
|
|
|
time = bin_count;
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
DBG (SAMPLEDEBUG,
|
|
|
|
|
printf (
|
|
|
|
|
"[assign_samples] bin_low_pc=0x%lx, bin_high_pc=0x%lx, bin_count=%d\n",
|
1999-06-30 22:38:30 +00:00
|
|
|
|
(unsigned long) (sizeof (UNIT) * bin_low_pc),
|
|
|
|
|
(unsigned long) (sizeof (UNIT) * bin_high_pc),
|
1999-05-03 07:29:11 +00:00
|
|
|
|
bin_count));
|
|
|
|
|
total_time += time;
|
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
/* Credit all symbols that are covered by bin I. */
|
1999-05-03 07:29:11 +00:00
|
|
|
|
for (j = j - 1; j < symtab.len; ++j)
|
|
|
|
|
{
|
|
|
|
|
sym_low_pc = symtab.base[j].hist.scaled_addr;
|
|
|
|
|
sym_high_pc = symtab.base[j + 1].hist.scaled_addr;
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
/* If high end of bin is below entry address,
|
|
|
|
|
go for next bin. */
|
1999-05-03 07:29:11 +00:00
|
|
|
|
if (bin_high_pc < sym_low_pc)
|
2000-07-24 20:59:04 +00:00
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
/* If low end of bin is above high end of symbol,
|
|
|
|
|
go for next symbol. */
|
1999-05-03 07:29:11 +00:00
|
|
|
|
if (bin_low_pc >= sym_high_pc)
|
2000-07-24 20:59:04 +00:00
|
|
|
|
continue;
|
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
overlap =
|
|
|
|
|
MIN (bin_high_pc, sym_high_pc) - MAX (bin_low_pc, sym_low_pc);
|
|
|
|
|
if (overlap > 0)
|
|
|
|
|
{
|
|
|
|
|
DBG (SAMPLEDEBUG,
|
|
|
|
|
printf (
|
2001-03-14 03:14:56 +00:00
|
|
|
|
"[assign_samples] [0x%lx,0x%lx) %s gets %f ticks %ld overlap\n",
|
|
|
|
|
(unsigned long) symtab.base[j].addr,
|
|
|
|
|
(unsigned long) (sizeof (UNIT) * sym_high_pc),
|
|
|
|
|
symtab.base[j].name, overlap * time / hist_scale,
|
|
|
|
|
(long) overlap));
|
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
addr = symtab.base[j].addr;
|
|
|
|
|
credit = overlap * time / hist_scale;
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
/* Credit symbol if it appears in INCL_FLAT or that
|
2001-03-14 03:14:56 +00:00
|
|
|
|
table is empty and it does not appear it in
|
|
|
|
|
EXCL_FLAT. */
|
1999-05-03 07:29:11 +00:00
|
|
|
|
if (sym_lookup (&syms[INCL_FLAT], addr)
|
|
|
|
|
|| (syms[INCL_FLAT].len == 0
|
|
|
|
|
&& !sym_lookup (&syms[EXCL_FLAT], addr)))
|
|
|
|
|
{
|
|
|
|
|
symtab.base[j].hist.time += credit;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
total_time -= credit;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
DBG (SAMPLEDEBUG, printf ("[assign_samples] total_time %f\n",
|
|
|
|
|
total_time));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
/* Print header for flag histogram profile. */
|
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
static void
|
2002-02-01 08:24:16 +00:00
|
|
|
|
print_header (prefix)
|
|
|
|
|
int prefix;
|
1999-05-03 07:29:11 +00:00
|
|
|
|
{
|
|
|
|
|
char unit[64];
|
|
|
|
|
|
|
|
|
|
sprintf (unit, _("%c%c/call"), prefix, hist_dimension_abbrev);
|
|
|
|
|
|
|
|
|
|
if (bsd_style_output)
|
|
|
|
|
{
|
|
|
|
|
printf (_("\ngranularity: each sample hit covers %ld byte(s)"),
|
|
|
|
|
(long) hist_scale * sizeof (UNIT));
|
|
|
|
|
if (total_time > 0.0)
|
|
|
|
|
{
|
|
|
|
|
printf (_(" for %.2f%% of %.2f %s\n\n"),
|
|
|
|
|
100.0 / total_time, total_time / hz, hist_dimension);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
printf (_("\nEach sample counts as %g %s.\n"), 1.0 / hz, hist_dimension);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (total_time <= 0.0)
|
|
|
|
|
{
|
|
|
|
|
printf (_(" no time accumulated\n\n"));
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
/* This doesn't hurt since all the numerators will be zero. */
|
1999-05-03 07:29:11 +00:00
|
|
|
|
total_time = 1.0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
printf ("%5.5s %10.10s %8.8s %8.8s %8.8s %8.8s %-8.8s\n",
|
2001-03-14 03:14:56 +00:00
|
|
|
|
"% ", _("cumulative"), _("self "), "", _("self "), _("total "),
|
|
|
|
|
"");
|
1999-05-03 07:29:11 +00:00
|
|
|
|
printf ("%5.5s %9.9s %8.8s %8.8s %8.8s %8.8s %-8.8s\n",
|
|
|
|
|
_("time"), hist_dimension, hist_dimension, _("calls"), unit, unit,
|
|
|
|
|
_("name"));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static void
|
2002-02-01 08:24:16 +00:00
|
|
|
|
print_line (sym, scale)
|
|
|
|
|
Sym *sym;
|
|
|
|
|
double scale;
|
1999-05-03 07:29:11 +00:00
|
|
|
|
{
|
|
|
|
|
if (ignore_zeros && sym->ncalls == 0 && sym->hist.time == 0)
|
2000-07-24 20:59:04 +00:00
|
|
|
|
return;
|
1999-05-03 07:29:11 +00:00
|
|
|
|
|
|
|
|
|
accum_time += sym->hist.time;
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
if (bsd_style_output)
|
2000-07-24 20:59:04 +00:00
|
|
|
|
printf ("%5.1f %10.2f %8.2f",
|
|
|
|
|
total_time > 0.0 ? 100 * sym->hist.time / total_time : 0.0,
|
|
|
|
|
accum_time / hz, sym->hist.time / hz);
|
1999-05-03 07:29:11 +00:00
|
|
|
|
else
|
2000-07-24 20:59:04 +00:00
|
|
|
|
printf ("%6.2f %9.2f %8.2f",
|
|
|
|
|
total_time > 0.0 ? 100 * sym->hist.time / total_time : 0.0,
|
|
|
|
|
accum_time / hz, sym->hist.time / hz);
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
if (sym->ncalls != 0)
|
2000-07-24 20:59:04 +00:00
|
|
|
|
printf (" %8lu %8.2f %8.2f ",
|
|
|
|
|
sym->ncalls, scale * sym->hist.time / hz / sym->ncalls,
|
|
|
|
|
scale * (sym->hist.time + sym->cg.child_time) / hz / sym->ncalls);
|
1999-05-03 07:29:11 +00:00
|
|
|
|
else
|
2000-07-24 20:59:04 +00:00
|
|
|
|
printf (" %8.8s %8.8s %8.8s ", "", "", "");
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
if (bsd_style_output)
|
2000-07-24 20:59:04 +00:00
|
|
|
|
print_name (sym);
|
1999-05-03 07:29:11 +00:00
|
|
|
|
else
|
2000-07-24 20:59:04 +00:00
|
|
|
|
print_name_only (sym);
|
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
printf ("\n");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
/* Compare LP and RP. The primary comparison key is execution time,
|
|
|
|
|
the secondary is number of invocation, and the tertiary is the
|
|
|
|
|
lexicographic order of the function names. */
|
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
static int
|
2002-02-01 08:24:16 +00:00
|
|
|
|
cmp_time (lp, rp)
|
|
|
|
|
const PTR lp;
|
|
|
|
|
const PTR rp;
|
1999-05-03 07:29:11 +00:00
|
|
|
|
{
|
|
|
|
|
const Sym *left = *(const Sym **) lp;
|
|
|
|
|
const Sym *right = *(const Sym **) rp;
|
|
|
|
|
double time_diff;
|
|
|
|
|
|
|
|
|
|
time_diff = right->hist.time - left->hist.time;
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
if (time_diff > 0.0)
|
2000-07-24 20:59:04 +00:00
|
|
|
|
return 1;
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
if (time_diff < 0.0)
|
2000-07-24 20:59:04 +00:00
|
|
|
|
return -1;
|
1999-05-03 07:29:11 +00:00
|
|
|
|
|
|
|
|
|
if (right->ncalls > left->ncalls)
|
2000-07-24 20:59:04 +00:00
|
|
|
|
return 1;
|
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
if (right->ncalls < left->ncalls)
|
2000-07-24 20:59:04 +00:00
|
|
|
|
return -1;
|
1999-05-03 07:29:11 +00:00
|
|
|
|
|
|
|
|
|
return strcmp (left->name, right->name);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
/* Print the flat histogram profile. */
|
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
void
|
2002-02-01 08:24:16 +00:00
|
|
|
|
hist_print ()
|
1999-05-03 07:29:11 +00:00
|
|
|
|
{
|
|
|
|
|
Sym **time_sorted_syms, *top_dog, *sym;
|
|
|
|
|
unsigned int index;
|
|
|
|
|
int log_scale;
|
|
|
|
|
double top_time, time;
|
|
|
|
|
bfd_vma addr;
|
|
|
|
|
|
|
|
|
|
if (first_output)
|
2002-02-01 01:18:06 +00:00
|
|
|
|
first_output = false;
|
1999-05-03 07:29:11 +00:00
|
|
|
|
else
|
2000-07-24 20:59:04 +00:00
|
|
|
|
printf ("\f\n");
|
1999-05-03 07:29:11 +00:00
|
|
|
|
|
|
|
|
|
accum_time = 0.0;
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
if (bsd_style_output)
|
|
|
|
|
{
|
|
|
|
|
if (print_descriptions)
|
|
|
|
|
{
|
|
|
|
|
printf (_("\n\n\nflat profile:\n"));
|
|
|
|
|
flat_blurb (stdout);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
printf (_("Flat profile:\n"));
|
|
|
|
|
}
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
/* Sort the symbol table by time (call-count and name as secondary
|
|
|
|
|
and tertiary keys). */
|
1999-05-03 07:29:11 +00:00
|
|
|
|
time_sorted_syms = (Sym **) xmalloc (symtab.len * sizeof (Sym *));
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
for (index = 0; index < symtab.len; ++index)
|
2000-07-24 20:59:04 +00:00
|
|
|
|
time_sorted_syms[index] = &symtab.base[index];
|
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
qsort (time_sorted_syms, symtab.len, sizeof (Sym *), cmp_time);
|
|
|
|
|
|
|
|
|
|
if (bsd_style_output)
|
|
|
|
|
{
|
2000-07-24 20:59:04 +00:00
|
|
|
|
log_scale = 5; /* Milli-seconds is BSD-default. */
|
1999-05-03 07:29:11 +00:00
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
2000-07-24 20:59:04 +00:00
|
|
|
|
/* Search for symbol with highest per-call
|
|
|
|
|
execution time and scale accordingly. */
|
1999-05-03 07:29:11 +00:00
|
|
|
|
log_scale = 0;
|
|
|
|
|
top_dog = 0;
|
|
|
|
|
top_time = 0.0;
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
for (index = 0; index < symtab.len; ++index)
|
|
|
|
|
{
|
|
|
|
|
sym = time_sorted_syms[index];
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
if (sym->ncalls != 0)
|
|
|
|
|
{
|
|
|
|
|
time = (sym->hist.time + sym->cg.child_time) / sym->ncalls;
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
if (time > top_time)
|
|
|
|
|
{
|
|
|
|
|
top_dog = sym;
|
|
|
|
|
top_time = time;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
if (top_dog && top_dog->ncalls != 0 && top_time > 0.0)
|
|
|
|
|
{
|
|
|
|
|
top_time /= hz;
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
while (SItab[log_scale].scale * top_time < 1000.0
|
|
|
|
|
&& ((size_t) log_scale
|
|
|
|
|
< sizeof (SItab) / sizeof (SItab[0]) - 1))
|
|
|
|
|
{
|
|
|
|
|
++log_scale;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
/* For now, the dimension is always seconds. In the future, we
|
|
|
|
|
may also want to support other (pseudo-)dimensions (such as
|
|
|
|
|
I-cache misses etc.). */
|
1999-05-03 07:29:11 +00:00
|
|
|
|
print_header (SItab[log_scale].prefix);
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
for (index = 0; index < symtab.len; ++index)
|
|
|
|
|
{
|
|
|
|
|
addr = time_sorted_syms[index]->addr;
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
2000-07-24 20:59:04 +00:00
|
|
|
|
/* Print symbol if its in INCL_FLAT table or that table
|
2001-03-14 03:14:56 +00:00
|
|
|
|
is empty and the symbol is not in EXCL_FLAT. */
|
1999-05-03 07:29:11 +00:00
|
|
|
|
if (sym_lookup (&syms[INCL_FLAT], addr)
|
|
|
|
|
|| (syms[INCL_FLAT].len == 0
|
|
|
|
|
&& !sym_lookup (&syms[EXCL_FLAT], addr)))
|
2000-07-24 20:59:04 +00:00
|
|
|
|
print_line (time_sorted_syms[index], SItab[log_scale].scale);
|
1999-05-03 07:29:11 +00:00
|
|
|
|
}
|
2001-03-14 03:14:56 +00:00
|
|
|
|
|
1999-05-03 07:29:11 +00:00
|
|
|
|
free (time_sorted_syms);
|
|
|
|
|
|
|
|
|
|
if (print_descriptions && !bsd_style_output)
|
2000-07-24 20:59:04 +00:00
|
|
|
|
flat_blurb (stdout);
|
1999-05-03 07:29:11 +00:00
|
|
|
|
}
|