/* symtab.c
|
/* symtab.c
|
|
|
Copyright 1999, 2000, 2001, 2002, 2004, 2007 Free Software Foundation, Inc.
|
Copyright 1999, 2000, 2001, 2002, 2004, 2007 Free Software Foundation, Inc.
|
|
|
This file is part of GNU Binutils.
|
This file is part of GNU Binutils.
|
|
|
This program is free software; you can redistribute it and/or modify
|
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
|
it under the terms of the GNU General Public License as published by
|
the Free Software Foundation; either version 3 of the License, or
|
the Free Software Foundation; either version 3 of the License, or
|
(at your option) any later version.
|
(at your option) any later version.
|
|
|
This program is distributed in the hope that it will be useful,
|
This program is distributed in the hope that it will be useful,
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
GNU General Public License for more details.
|
GNU General Public License for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with this program; if not, write to the Free Software
|
along with this program; if not, write to the Free Software
|
Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA
|
Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA
|
02110-1301, USA. */
|
02110-1301, USA. */
|
|
|
#include "gprof.h"
|
#include "gprof.h"
|
#include "search_list.h"
|
#include "search_list.h"
|
#include "source.h"
|
#include "source.h"
|
#include "symtab.h"
|
#include "symtab.h"
|
#include "cg_arcs.h"
|
#include "cg_arcs.h"
|
#include "corefile.h"
|
#include "corefile.h"
|
|
|
static int cmp_addr (const PTR, const PTR);
|
static int cmp_addr (const PTR, const PTR);
|
|
|
Sym_Table symtab;
|
Sym_Table symtab;
|
|
|
|
|
/* Initialize a symbol (so it's empty). */
|
/* Initialize a symbol (so it's empty). */
|
|
|
void
|
void
|
sym_init (Sym *sym)
|
sym_init (Sym *sym)
|
{
|
{
|
memset (sym, 0, sizeof (*sym));
|
memset (sym, 0, sizeof (*sym));
|
|
|
/* It is not safe to assume that a binary zero corresponds
|
/* It is not safe to assume that a binary zero corresponds
|
to a floating-point 0.0, so initialize floats explicitly. */
|
to a floating-point 0.0, so initialize floats explicitly. */
|
sym->hist.time = 0.0;
|
sym->hist.time = 0.0;
|
sym->cg.child_time = 0.0;
|
sym->cg.child_time = 0.0;
|
sym->cg.prop.fract = 0.0;
|
sym->cg.prop.fract = 0.0;
|
sym->cg.prop.self = 0.0;
|
sym->cg.prop.self = 0.0;
|
sym->cg.prop.child = 0.0;
|
sym->cg.prop.child = 0.0;
|
}
|
}
|
|
|
|
|
/* Compare the function entry-point of two symbols and return <0, =0,
|
/* Compare the function entry-point of two symbols and return <0, =0,
|
or >0 depending on whether the left value is smaller than, equal
|
or >0 depending on whether the left value is smaller than, equal
|
to, or greater than the right value. If two symbols are equal
|
to, or greater than the right value. If two symbols are equal
|
but one has is_func set and the other doesn't, we make the
|
but one has is_func set and the other doesn't, we make the
|
non-function symbol one "bigger" so that the function symbol will
|
non-function symbol one "bigger" so that the function symbol will
|
survive duplicate removal. Finally, if both symbols have the
|
survive duplicate removal. Finally, if both symbols have the
|
same is_func value, we discriminate against is_static such that
|
same is_func value, we discriminate against is_static such that
|
the global symbol survives. */
|
the global symbol survives. */
|
|
|
static int
|
static int
|
cmp_addr (const PTR lp, const PTR rp)
|
cmp_addr (const PTR lp, const PTR rp)
|
{
|
{
|
const Sym *left = (const Sym *) lp;
|
const Sym *left = (const Sym *) lp;
|
const Sym *right = (const Sym *) rp;
|
const Sym *right = (const Sym *) rp;
|
|
|
if (left->addr > right->addr)
|
if (left->addr > right->addr)
|
return 1;
|
return 1;
|
else if (left->addr < right->addr)
|
else if (left->addr < right->addr)
|
return -1;
|
return -1;
|
|
|
if (left->is_func != right->is_func)
|
if (left->is_func != right->is_func)
|
return right->is_func - left->is_func;
|
return right->is_func - left->is_func;
|
|
|
return left->is_static - right->is_static;
|
return left->is_static - right->is_static;
|
}
|
}
|
|
|
|
|
void
|
void
|
symtab_finalize (Sym_Table *tab)
|
symtab_finalize (Sym_Table *tab)
|
{
|
{
|
Sym *src, *dst;
|
Sym *src, *dst;
|
bfd_vma prev_addr;
|
bfd_vma prev_addr;
|
|
|
if (!tab->len)
|
if (!tab->len)
|
return;
|
return;
|
|
|
/* Sort symbol table in order of increasing function addresses. */
|
/* Sort symbol table in order of increasing function addresses. */
|
qsort (tab->base, tab->len, sizeof (Sym), cmp_addr);
|
qsort (tab->base, tab->len, sizeof (Sym), cmp_addr);
|
|
|
/* Remove duplicate entries to speed-up later processing and
|
/* Remove duplicate entries to speed-up later processing and
|
set end_addr if its not set yet. */
|
set end_addr if its not set yet. */
|
prev_addr = tab->base[0].addr + 1;
|
prev_addr = tab->base[0].addr + 1;
|
|
|
for (src = dst = tab->base; src < tab->limit; ++src)
|
for (src = dst = tab->base; src < tab->limit; ++src)
|
{
|
{
|
if (src->addr == prev_addr)
|
if (src->addr == prev_addr)
|
{
|
{
|
/* If same address, favor global symbol over static one,
|
/* If same address, favor global symbol over static one,
|
then function over line number. If both symbols are
|
then function over line number. If both symbols are
|
either static or global and either function or line, check
|
either static or global and either function or line, check
|
whether one has name beginning with underscore while
|
whether one has name beginning with underscore while
|
the other doesn't. In such cases, keep sym without
|
the other doesn't. In such cases, keep sym without
|
underscore. This takes cares of compiler generated
|
underscore. This takes cares of compiler generated
|
symbols (such as __gnu_compiled, __c89_used, etc.). */
|
symbols (such as __gnu_compiled, __c89_used, etc.). */
|
if ((!src->is_static && dst[-1].is_static)
|
if ((!src->is_static && dst[-1].is_static)
|
|| ((src->is_static == dst[-1].is_static)
|
|| ((src->is_static == dst[-1].is_static)
|
&& ((src->is_func && !dst[-1].is_func)
|
&& ((src->is_func && !dst[-1].is_func)
|
|| ((src->is_func == dst[-1].is_func)
|
|| ((src->is_func == dst[-1].is_func)
|
&& ((src->name[0] != '_' && dst[-1].name[0] == '_')
|
&& ((src->name[0] != '_' && dst[-1].name[0] == '_')
|
|| (src->name[0]
|
|| (src->name[0]
|
&& src->name[1] != '_'
|
&& src->name[1] != '_'
|
&& dst[-1].name[1] == '_'))))))
|
&& dst[-1].name[1] == '_'))))))
|
{
|
{
|
DBG (AOUTDEBUG | IDDEBUG,
|
DBG (AOUTDEBUG | IDDEBUG,
|
printf ("[symtab_finalize] favor %s@%c%c over %s@%c%c",
|
printf ("[symtab_finalize] favor %s@%c%c over %s@%c%c",
|
src->name, src->is_static ? 't' : 'T',
|
src->name, src->is_static ? 't' : 'T',
|
src->is_func ? 'F' : 'f',
|
src->is_func ? 'F' : 'f',
|
dst[-1].name, dst[-1].is_static ? 't' : 'T',
|
dst[-1].name, dst[-1].is_static ? 't' : 'T',
|
dst[-1].is_func ? 'F' : 'f');
|
dst[-1].is_func ? 'F' : 'f');
|
printf (" (addr=%lx)\n", (unsigned long) src->addr));
|
printf (" (addr=%lx)\n", (unsigned long) src->addr));
|
|
|
dst[-1] = *src;
|
dst[-1] = *src;
|
}
|
}
|
else
|
else
|
{
|
{
|
DBG (AOUTDEBUG | IDDEBUG,
|
DBG (AOUTDEBUG | IDDEBUG,
|
printf ("[symtab_finalize] favor %s@%c%c over %s@%c%c",
|
printf ("[symtab_finalize] favor %s@%c%c over %s@%c%c",
|
dst[-1].name, dst[-1].is_static ? 't' : 'T',
|
dst[-1].name, dst[-1].is_static ? 't' : 'T',
|
dst[-1].is_func ? 'F' : 'f',
|
dst[-1].is_func ? 'F' : 'f',
|
src->name, src->is_static ? 't' : 'T',
|
src->name, src->is_static ? 't' : 'T',
|
src->is_func ? 'F' : 'f');
|
src->is_func ? 'F' : 'f');
|
printf (" (addr=%lx)\n", (unsigned long) src->addr));
|
printf (" (addr=%lx)\n", (unsigned long) src->addr));
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
if (dst > tab->base && dst[-1].end_addr == 0)
|
if (dst > tab->base && dst[-1].end_addr == 0)
|
dst[-1].end_addr = src->addr - 1;
|
dst[-1].end_addr = src->addr - 1;
|
|
|
/* Retain sym only if it has a non-empty address range. */
|
/* Retain sym only if it has a non-empty address range. */
|
if (!src->end_addr || src->addr <= src->end_addr)
|
if (!src->end_addr || src->addr <= src->end_addr)
|
{
|
{
|
*dst = *src;
|
*dst = *src;
|
dst++;
|
dst++;
|
prev_addr = src->addr;
|
prev_addr = src->addr;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
if (tab->len > 0 && dst[-1].end_addr == 0)
|
if (tab->len > 0 && dst[-1].end_addr == 0)
|
dst[-1].end_addr
|
dst[-1].end_addr
|
= core_text_sect->vma + bfd_get_section_size (core_text_sect) - 1;
|
= core_text_sect->vma + bfd_get_section_size (core_text_sect) - 1;
|
|
|
DBG (AOUTDEBUG | IDDEBUG,
|
DBG (AOUTDEBUG | IDDEBUG,
|
printf ("[symtab_finalize]: removed %d duplicate entries\n",
|
printf ("[symtab_finalize]: removed %d duplicate entries\n",
|
tab->len - (int) (dst - tab->base)));
|
tab->len - (int) (dst - tab->base)));
|
|
|
tab->limit = dst;
|
tab->limit = dst;
|
tab->len = tab->limit - tab->base;
|
tab->len = tab->limit - tab->base;
|
|
|
DBG (AOUTDEBUG | IDDEBUG,
|
DBG (AOUTDEBUG | IDDEBUG,
|
unsigned int j;
|
unsigned int j;
|
|
|
for (j = 0; j < tab->len; ++j)
|
for (j = 0; j < tab->len; ++j)
|
{
|
{
|
printf ("[symtab_finalize] 0x%lx-0x%lx\t%s\n",
|
printf ("[symtab_finalize] 0x%lx-0x%lx\t%s\n",
|
(long) tab->base[j].addr, (long) tab->base[j].end_addr,
|
(long) tab->base[j].addr, (long) tab->base[j].end_addr,
|
tab->base[j].name);
|
tab->base[j].name);
|
}
|
}
|
);
|
);
|
}
|
}
|
|
|
|
|
#ifdef DEBUG
|
#ifdef DEBUG
|
|
|
Sym *
|
Sym *
|
dbg_sym_lookup (Sym_Table *sym_tab, bfd_vma address)
|
dbg_sym_lookup (Sym_Table *sym_tab, bfd_vma address)
|
{
|
{
|
long low, mid, high;
|
long low, mid, high;
|
Sym *sym;
|
Sym *sym;
|
|
|
fprintf (stderr, "[dbg_sym_lookup] address 0x%lx\n",
|
fprintf (stderr, "[dbg_sym_lookup] address 0x%lx\n",
|
(unsigned long) address);
|
(unsigned long) address);
|
|
|
sym = sym_tab->base;
|
sym = sym_tab->base;
|
for (low = 0, high = sym_tab->len - 1; low != high;)
|
for (low = 0, high = sym_tab->len - 1; low != high;)
|
{
|
{
|
mid = (high + low) >> 1;
|
mid = (high + low) >> 1;
|
|
|
fprintf (stderr, "[dbg_sym_lookup] low=0x%lx, mid=0x%lx, high=0x%lx\n",
|
fprintf (stderr, "[dbg_sym_lookup] low=0x%lx, mid=0x%lx, high=0x%lx\n",
|
low, mid, high);
|
low, mid, high);
|
fprintf (stderr, "[dbg_sym_lookup] sym[m]=0x%lx sym[m + 1]=0x%lx\n",
|
fprintf (stderr, "[dbg_sym_lookup] sym[m]=0x%lx sym[m + 1]=0x%lx\n",
|
(unsigned long) sym[mid].addr,
|
(unsigned long) sym[mid].addr,
|
(unsigned long) sym[mid + 1].addr);
|
(unsigned long) sym[mid + 1].addr);
|
|
|
if (sym[mid].addr <= address && sym[mid + 1].addr > address)
|
if (sym[mid].addr <= address && sym[mid + 1].addr > address)
|
return &sym[mid];
|
return &sym[mid];
|
|
|
if (sym[mid].addr > address)
|
if (sym[mid].addr > address)
|
high = mid;
|
high = mid;
|
else
|
else
|
low = mid + 1;
|
low = mid + 1;
|
}
|
}
|
|
|
fprintf (stderr, "[dbg_sym_lookup] binary search fails???\n");
|
fprintf (stderr, "[dbg_sym_lookup] binary search fails???\n");
|
|
|
return 0;
|
return 0;
|
}
|
}
|
|
|
#endif /* DEBUG */
|
#endif /* DEBUG */
|
|
|
|
|
/* Look up an address in the symbol-table that is sorted by address.
|
/* Look up an address in the symbol-table that is sorted by address.
|
If address does not hit any symbol, 0 is returned. */
|
If address does not hit any symbol, 0 is returned. */
|
Sym *
|
Sym *
|
sym_lookup (Sym_Table *sym_tab, bfd_vma address)
|
sym_lookup (Sym_Table *sym_tab, bfd_vma address)
|
{
|
{
|
long low, high;
|
long low, high;
|
long mid = -1;
|
long mid = -1;
|
Sym *sym;
|
Sym *sym;
|
#ifdef DEBUG
|
#ifdef DEBUG
|
int probes = 0;
|
int probes = 0;
|
#endif /* DEBUG */
|
#endif /* DEBUG */
|
|
|
if (!sym_tab->len)
|
if (!sym_tab->len)
|
return 0;
|
return 0;
|
|
|
sym = sym_tab->base;
|
sym = sym_tab->base;
|
for (low = 0, high = sym_tab->len - 1; low != high;)
|
for (low = 0, high = sym_tab->len - 1; low != high;)
|
{
|
{
|
DBG (LOOKUPDEBUG, ++probes);
|
DBG (LOOKUPDEBUG, ++probes);
|
mid = (high + low) / 2;
|
mid = (high + low) / 2;
|
|
|
if (sym[mid].addr <= address && sym[mid + 1].addr > address)
|
if (sym[mid].addr <= address && sym[mid + 1].addr > address)
|
{
|
{
|
if (address > sym[mid].end_addr)
|
if (address > sym[mid].end_addr)
|
{
|
{
|
/* Address falls into gap between
|
/* Address falls into gap between
|
sym[mid] and sym[mid + 1]. */
|
sym[mid] and sym[mid + 1]. */
|
return 0;
|
return 0;
|
}
|
}
|
else
|
else
|
{
|
{
|
DBG (LOOKUPDEBUG,
|
DBG (LOOKUPDEBUG,
|
printf ("[sym_lookup] %d probes (symtab->len=%u)\n",
|
printf ("[sym_lookup] %d probes (symtab->len=%u)\n",
|
probes, sym_tab->len - 1));
|
probes, sym_tab->len - 1));
|
return &sym[mid];
|
return &sym[mid];
|
}
|
}
|
}
|
}
|
|
|
if (sym[mid].addr > address)
|
if (sym[mid].addr > address)
|
high = mid;
|
high = mid;
|
else
|
else
|
low = mid + 1;
|
low = mid + 1;
|
}
|
}
|
|
|
if (sym[mid + 1].addr <= address)
|
if (sym[mid + 1].addr <= address)
|
{
|
{
|
if (address > sym[mid + 1].end_addr)
|
if (address > sym[mid + 1].end_addr)
|
{
|
{
|
/* Address is beyond end of sym[mid + 1]. */
|
/* Address is beyond end of sym[mid + 1]. */
|
return 0;
|
return 0;
|
}
|
}
|
else
|
else
|
{
|
{
|
DBG (LOOKUPDEBUG, printf ("[sym_lookup] %d (%u) probes, fall off\n",
|
DBG (LOOKUPDEBUG, printf ("[sym_lookup] %d (%u) probes, fall off\n",
|
probes, sym_tab->len - 1));
|
probes, sym_tab->len - 1));
|
return &sym[mid + 1];
|
return &sym[mid + 1];
|
}
|
}
|
}
|
}
|
|
|
return 0;
|
return 0;
|
}
|
}
|
|
|
