2017-04-18 01:23:08 +07:00
|
|
|
#include <inttypes.h>
|
2013-09-11 12:09:28 +07:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
|
2013-09-11 12:09:30 +07:00
|
|
|
#include "util/dso.h"
|
2013-09-11 12:09:28 +07:00
|
|
|
#include "util/util.h"
|
|
|
|
#include "util/debug.h"
|
2017-03-26 03:34:26 +07:00
|
|
|
#include "util/callchain.h"
|
2017-04-18 02:30:49 +07:00
|
|
|
#include "srcline.h"
|
2013-09-11 12:09:28 +07:00
|
|
|
|
2014-11-13 09:05:27 +07:00
|
|
|
#include "symbol.h"
|
|
|
|
|
2015-08-08 05:24:05 +07:00
|
|
|
bool srcline_full_filename;
|
|
|
|
|
2017-03-26 03:34:25 +07:00
|
|
|
static const char *dso__name(struct dso *dso)
|
|
|
|
{
|
|
|
|
const char *dso_name;
|
|
|
|
|
|
|
|
if (dso->symsrc_filename)
|
|
|
|
dso_name = dso->symsrc_filename;
|
|
|
|
else
|
|
|
|
dso_name = dso->long_name;
|
|
|
|
|
|
|
|
if (dso_name[0] == '[')
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
if (!strncmp(dso_name, "/tmp/perf-", 10))
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
return dso_name;
|
|
|
|
}
|
|
|
|
|
2017-10-10 03:32:58 +07:00
|
|
|
static int inline_list__append(struct symbol *symbol, char *srcline,
|
|
|
|
struct inline_node *node)
|
2017-03-26 03:34:26 +07:00
|
|
|
{
|
|
|
|
struct inline_list *ilist;
|
|
|
|
|
|
|
|
ilist = zalloc(sizeof(*ilist));
|
|
|
|
if (ilist == NULL)
|
|
|
|
return -1;
|
|
|
|
|
2017-10-10 03:32:57 +07:00
|
|
|
ilist->symbol = symbol;
|
2017-10-10 03:32:58 +07:00
|
|
|
ilist->srcline = srcline;
|
2017-03-26 03:34:26 +07:00
|
|
|
|
2017-05-24 13:21:27 +07:00
|
|
|
if (callchain_param.order == ORDER_CALLEE)
|
|
|
|
list_add_tail(&ilist->list, &node->val);
|
|
|
|
else
|
|
|
|
list_add(&ilist->list, &node->val);
|
2017-03-26 03:34:26 +07:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-10-10 03:32:58 +07:00
|
|
|
/* basename version that takes a const input string */
|
|
|
|
static const char *gnu_basename(const char *path)
|
|
|
|
{
|
|
|
|
const char *base = strrchr(path, '/');
|
|
|
|
|
|
|
|
return base ? base + 1 : path;
|
|
|
|
}
|
|
|
|
|
|
|
|
static char *srcline_from_fileline(const char *file, unsigned int line)
|
|
|
|
{
|
|
|
|
char *srcline;
|
|
|
|
|
|
|
|
if (!file)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
if (!srcline_full_filename)
|
|
|
|
file = gnu_basename(file);
|
|
|
|
|
|
|
|
if (asprintf(&srcline, "%s:%u", file, line) < 0)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
return srcline;
|
|
|
|
}
|
|
|
|
|
2013-09-11 12:09:32 +07:00
|
|
|
#ifdef HAVE_LIBBFD_SUPPORT
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Implement addr2line using libbfd.
|
|
|
|
*/
|
|
|
|
#define PACKAGE "perf"
|
|
|
|
#include <bfd.h>
|
|
|
|
|
|
|
|
struct a2l_data {
|
|
|
|
const char *input;
|
2014-12-16 13:19:06 +07:00
|
|
|
u64 addr;
|
2013-09-11 12:09:32 +07:00
|
|
|
|
|
|
|
bool found;
|
|
|
|
const char *filename;
|
|
|
|
const char *funcname;
|
|
|
|
unsigned line;
|
|
|
|
|
|
|
|
bfd *abfd;
|
|
|
|
asymbol **syms;
|
|
|
|
};
|
|
|
|
|
|
|
|
static int bfd_error(const char *string)
|
|
|
|
{
|
|
|
|
const char *errmsg;
|
|
|
|
|
|
|
|
errmsg = bfd_errmsg(bfd_get_error());
|
|
|
|
fflush(stdout);
|
|
|
|
|
|
|
|
if (string)
|
|
|
|
pr_debug("%s: %s\n", string, errmsg);
|
|
|
|
else
|
|
|
|
pr_debug("%s\n", errmsg);
|
|
|
|
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int slurp_symtab(bfd *abfd, struct a2l_data *a2l)
|
|
|
|
{
|
|
|
|
long storage;
|
|
|
|
long symcount;
|
|
|
|
asymbol **syms;
|
|
|
|
bfd_boolean dynamic = FALSE;
|
|
|
|
|
|
|
|
if ((bfd_get_file_flags(abfd) & HAS_SYMS) == 0)
|
|
|
|
return bfd_error(bfd_get_filename(abfd));
|
|
|
|
|
|
|
|
storage = bfd_get_symtab_upper_bound(abfd);
|
|
|
|
if (storage == 0L) {
|
|
|
|
storage = bfd_get_dynamic_symtab_upper_bound(abfd);
|
|
|
|
dynamic = TRUE;
|
|
|
|
}
|
|
|
|
if (storage < 0L)
|
|
|
|
return bfd_error(bfd_get_filename(abfd));
|
|
|
|
|
|
|
|
syms = malloc(storage);
|
|
|
|
if (dynamic)
|
|
|
|
symcount = bfd_canonicalize_dynamic_symtab(abfd, syms);
|
|
|
|
else
|
|
|
|
symcount = bfd_canonicalize_symtab(abfd, syms);
|
|
|
|
|
|
|
|
if (symcount < 0) {
|
|
|
|
free(syms);
|
|
|
|
return bfd_error(bfd_get_filename(abfd));
|
|
|
|
}
|
|
|
|
|
|
|
|
a2l->syms = syms;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void find_address_in_section(bfd *abfd, asection *section, void *data)
|
|
|
|
{
|
|
|
|
bfd_vma pc, vma;
|
|
|
|
bfd_size_type size;
|
|
|
|
struct a2l_data *a2l = data;
|
|
|
|
|
|
|
|
if (a2l->found)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if ((bfd_get_section_flags(abfd, section) & SEC_ALLOC) == 0)
|
|
|
|
return;
|
|
|
|
|
|
|
|
pc = a2l->addr;
|
|
|
|
vma = bfd_get_section_vma(abfd, section);
|
|
|
|
size = bfd_get_section_size(section);
|
|
|
|
|
|
|
|
if (pc < vma || pc >= vma + size)
|
|
|
|
return;
|
|
|
|
|
|
|
|
a2l->found = bfd_find_nearest_line(abfd, section, a2l->syms, pc - vma,
|
|
|
|
&a2l->filename, &a2l->funcname,
|
|
|
|
&a2l->line);
|
2017-08-07 04:24:45 +07:00
|
|
|
|
|
|
|
if (a2l->filename && !strlen(a2l->filename))
|
|
|
|
a2l->filename = NULL;
|
2013-09-11 12:09:32 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
static struct a2l_data *addr2line_init(const char *path)
|
|
|
|
{
|
|
|
|
bfd *abfd;
|
|
|
|
struct a2l_data *a2l = NULL;
|
|
|
|
|
|
|
|
abfd = bfd_openr(path, NULL);
|
|
|
|
if (abfd == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
if (!bfd_check_format(abfd, bfd_object))
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
a2l = zalloc(sizeof(*a2l));
|
|
|
|
if (a2l == NULL)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
a2l->abfd = abfd;
|
|
|
|
a2l->input = strdup(path);
|
|
|
|
if (a2l->input == NULL)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
if (slurp_symtab(abfd, a2l))
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
return a2l;
|
|
|
|
|
|
|
|
out:
|
|
|
|
if (a2l) {
|
2014-01-09 21:07:59 +07:00
|
|
|
zfree((char **)&a2l->input);
|
2013-09-11 12:09:32 +07:00
|
|
|
free(a2l);
|
|
|
|
}
|
|
|
|
bfd_close(abfd);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void addr2line_cleanup(struct a2l_data *a2l)
|
|
|
|
{
|
|
|
|
if (a2l->abfd)
|
|
|
|
bfd_close(a2l->abfd);
|
2014-01-09 21:07:59 +07:00
|
|
|
zfree((char **)&a2l->input);
|
2013-12-28 02:55:14 +07:00
|
|
|
zfree(&a2l->syms);
|
2013-09-11 12:09:32 +07:00
|
|
|
free(a2l);
|
|
|
|
}
|
|
|
|
|
2015-09-02 01:47:19 +07:00
|
|
|
#define MAX_INLINE_NEST 1024
|
|
|
|
|
2017-10-10 03:32:57 +07:00
|
|
|
static struct symbol *new_inline_sym(struct dso *dso,
|
|
|
|
struct symbol *base_sym,
|
|
|
|
const char *funcname)
|
|
|
|
{
|
|
|
|
struct symbol *inline_sym;
|
|
|
|
char *demangled = NULL;
|
|
|
|
|
|
|
|
if (dso) {
|
|
|
|
demangled = dso__demangle_sym(dso, 0, funcname);
|
|
|
|
if (demangled)
|
|
|
|
funcname = demangled;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (base_sym && strcmp(funcname, base_sym->name) == 0) {
|
|
|
|
/* reuse the real, existing symbol */
|
|
|
|
inline_sym = base_sym;
|
|
|
|
/* ensure that we don't alias an inlined symbol, which could
|
|
|
|
* lead to double frees in inline_node__delete
|
|
|
|
*/
|
|
|
|
assert(!base_sym->inlined);
|
|
|
|
} else {
|
|
|
|
/* create a fake symbol for the inline frame */
|
|
|
|
inline_sym = symbol__new(base_sym ? base_sym->start : 0,
|
|
|
|
base_sym ? base_sym->end : 0,
|
|
|
|
base_sym ? base_sym->binding : 0,
|
|
|
|
funcname);
|
|
|
|
if (inline_sym)
|
|
|
|
inline_sym->inlined = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
free(demangled);
|
|
|
|
|
|
|
|
return inline_sym;
|
|
|
|
}
|
|
|
|
|
2017-05-24 13:21:28 +07:00
|
|
|
static int inline_list__append_dso_a2l(struct dso *dso,
|
2017-10-10 03:32:57 +07:00
|
|
|
struct inline_node *node,
|
|
|
|
struct symbol *sym)
|
2017-05-24 13:21:28 +07:00
|
|
|
{
|
|
|
|
struct a2l_data *a2l = dso->a2l;
|
2017-10-10 03:32:57 +07:00
|
|
|
struct symbol *inline_sym = new_inline_sym(dso, sym, a2l->funcname);
|
2017-10-10 03:32:58 +07:00
|
|
|
char *srcline = NULL;
|
2017-05-24 13:21:28 +07:00
|
|
|
|
2017-10-10 03:32:58 +07:00
|
|
|
if (a2l->filename)
|
|
|
|
srcline = srcline_from_fileline(a2l->filename, a2l->line);
|
|
|
|
|
|
|
|
return inline_list__append(inline_sym, srcline, node);
|
2017-05-24 13:21:28 +07:00
|
|
|
}
|
|
|
|
|
2014-12-16 13:19:06 +07:00
|
|
|
static int addr2line(const char *dso_name, u64 addr,
|
2015-09-02 01:47:19 +07:00
|
|
|
char **file, unsigned int *line, struct dso *dso,
|
2017-10-10 03:32:57 +07:00
|
|
|
bool unwind_inlines, struct inline_node *node,
|
|
|
|
struct symbol *sym)
|
2013-09-11 12:09:32 +07:00
|
|
|
{
|
|
|
|
int ret = 0;
|
2013-12-03 14:23:07 +07:00
|
|
|
struct a2l_data *a2l = dso->a2l;
|
|
|
|
|
|
|
|
if (!a2l) {
|
|
|
|
dso->a2l = addr2line_init(dso_name);
|
|
|
|
a2l = dso->a2l;
|
|
|
|
}
|
2013-09-11 12:09:32 +07:00
|
|
|
|
|
|
|
if (a2l == NULL) {
|
|
|
|
pr_warning("addr2line_init failed for %s\n", dso_name);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
a2l->addr = addr;
|
2013-12-03 14:23:07 +07:00
|
|
|
a2l->found = false;
|
|
|
|
|
2013-09-11 12:09:32 +07:00
|
|
|
bfd_map_over_sections(a2l->abfd, find_address_in_section, a2l);
|
|
|
|
|
2017-05-24 13:21:24 +07:00
|
|
|
if (!a2l->found)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (unwind_inlines) {
|
2015-09-02 01:47:19 +07:00
|
|
|
int cnt = 0;
|
|
|
|
|
2017-10-10 03:32:57 +07:00
|
|
|
if (node && inline_list__append_dso_a2l(dso, node, sym))
|
2017-05-24 13:21:28 +07:00
|
|
|
return 0;
|
|
|
|
|
2015-09-02 01:47:19 +07:00
|
|
|
while (bfd_find_inliner_info(a2l->abfd, &a2l->filename,
|
|
|
|
&a2l->funcname, &a2l->line) &&
|
2017-03-26 03:34:26 +07:00
|
|
|
cnt++ < MAX_INLINE_NEST) {
|
|
|
|
|
2017-08-07 04:24:45 +07:00
|
|
|
if (a2l->filename && !strlen(a2l->filename))
|
|
|
|
a2l->filename = NULL;
|
|
|
|
|
2017-03-26 03:34:26 +07:00
|
|
|
if (node != NULL) {
|
2017-10-10 03:32:57 +07:00
|
|
|
if (inline_list__append_dso_a2l(dso, node, sym))
|
2017-03-26 03:34:26 +07:00
|
|
|
return 0;
|
2017-05-24 13:21:24 +07:00
|
|
|
// found at least one inline frame
|
|
|
|
ret = 1;
|
2017-03-26 03:34:26 +07:00
|
|
|
}
|
|
|
|
}
|
2015-09-02 01:47:19 +07:00
|
|
|
}
|
|
|
|
|
2017-05-24 13:21:24 +07:00
|
|
|
if (file) {
|
|
|
|
*file = a2l->filename ? strdup(a2l->filename) : NULL;
|
|
|
|
ret = *file ? 1 : 0;
|
2013-09-11 12:09:32 +07:00
|
|
|
}
|
|
|
|
|
2017-05-24 13:21:24 +07:00
|
|
|
if (line)
|
|
|
|
*line = a2l->line;
|
|
|
|
|
2013-09-11 12:09:32 +07:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2013-12-03 14:23:07 +07:00
|
|
|
void dso__free_a2l(struct dso *dso)
|
|
|
|
{
|
|
|
|
struct a2l_data *a2l = dso->a2l;
|
|
|
|
|
|
|
|
if (!a2l)
|
|
|
|
return;
|
|
|
|
|
|
|
|
addr2line_cleanup(a2l);
|
|
|
|
|
|
|
|
dso->a2l = NULL;
|
|
|
|
}
|
|
|
|
|
2017-03-26 03:34:26 +07:00
|
|
|
static struct inline_node *addr2inlines(const char *dso_name, u64 addr,
|
2017-10-10 03:32:57 +07:00
|
|
|
struct dso *dso, struct symbol *sym)
|
2017-03-26 03:34:26 +07:00
|
|
|
{
|
|
|
|
struct inline_node *node;
|
|
|
|
|
|
|
|
node = zalloc(sizeof(*node));
|
|
|
|
if (node == NULL) {
|
|
|
|
perror("not enough memory for the inline node");
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
INIT_LIST_HEAD(&node->val);
|
|
|
|
node->addr = addr;
|
|
|
|
|
perf report: Cache failed lookups of inlined frames
When no inlined frames could be found for a given address, we did not
store this information anywhere. That means we potentially do the costly
inliner lookup repeatedly for cases where we know it can never succeed.
This patch makes dso__parse_addr_inlines always return a valid
inline_node. It will be empty when no inliners are found. This enables
us to cache the empty list in the DSO, thereby improving the performance
when many addresses fail to find the inliners.
For my trivial example, the performance impact is already quite
significant:
Before:
~~~~~
Performance counter stats for 'perf report --stdio --inline -g srcline -s srcline' (5 runs):
594.804032 task-clock (msec) # 0.998 CPUs utilized ( +- 0.07% )
53 context-switches # 0.089 K/sec ( +- 4.09% )
0 cpu-migrations # 0.000 K/sec ( +-100.00% )
5,687 page-faults # 0.010 M/sec ( +- 0.02% )
2,300,918,213 cycles # 3.868 GHz ( +- 0.09% )
4,395,839,080 instructions # 1.91 insn per cycle ( +- 0.00% )
939,177,205 branches # 1578.969 M/sec ( +- 0.00% )
11,824,633 branch-misses # 1.26% of all branches ( +- 0.10% )
0.596246531 seconds time elapsed ( +- 0.07% )
~~~~~
After:
~~~~~
Performance counter stats for 'perf report --stdio --inline -g srcline -s srcline' (5 runs):
113.111405 task-clock (msec) # 0.990 CPUs utilized ( +- 0.89% )
29 context-switches # 0.255 K/sec ( +- 54.25% )
0 cpu-migrations # 0.000 K/sec
5,380 page-faults # 0.048 M/sec ( +- 0.01% )
432,378,779 cycles # 3.823 GHz ( +- 0.75% )
670,057,633 instructions # 1.55 insn per cycle ( +- 0.01% )
141,001,247 branches # 1246.570 M/sec ( +- 0.01% )
2,346,845 branch-misses # 1.66% of all branches ( +- 0.19% )
0.114222393 seconds time elapsed ( +- 1.19% )
~~~~~
Signed-off-by: Milian Wolff <milian.wolff@kdab.com>
Reviewed-by: Andi Kleen <ak@linux.intel.com>
Cc: David Ahern <dsahern@gmail.com>
Cc: Jin Yao <yao.jin@linux.intel.com>
Cc: Jiri Olsa <jolsa@kernel.org>
Cc: Namhyung Kim <namhyung@kernel.org>
Cc: Peter Zijlstra <peterz@infradead.org>
Link: http://lkml.kernel.org/r/20171019113836.5548-3-milian.wolff@kdab.com
Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>
2017-10-19 18:38:33 +07:00
|
|
|
addr2line(dso_name, addr, NULL, NULL, dso, true, node, sym);
|
2017-03-26 03:34:26 +07:00
|
|
|
return node;
|
|
|
|
}
|
|
|
|
|
2013-09-11 12:09:32 +07:00
|
|
|
#else /* HAVE_LIBBFD_SUPPORT */
|
|
|
|
|
2017-03-26 03:34:25 +07:00
|
|
|
static int filename_split(char *filename, unsigned int *line_nr)
|
|
|
|
{
|
|
|
|
char *sep;
|
|
|
|
|
|
|
|
sep = strchr(filename, '\n');
|
|
|
|
if (sep)
|
|
|
|
*sep = '\0';
|
|
|
|
|
|
|
|
if (!strcmp(filename, "??:0"))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
sep = strchr(filename, ':');
|
|
|
|
if (sep) {
|
|
|
|
*sep++ = '\0';
|
|
|
|
*line_nr = strtoul(sep, NULL, 0);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-12-16 13:19:06 +07:00
|
|
|
static int addr2line(const char *dso_name, u64 addr,
|
2013-12-03 14:23:07 +07:00
|
|
|
char **file, unsigned int *line_nr,
|
2015-09-02 01:47:19 +07:00
|
|
|
struct dso *dso __maybe_unused,
|
2017-03-26 03:34:26 +07:00
|
|
|
bool unwind_inlines __maybe_unused,
|
2017-10-10 03:32:57 +07:00
|
|
|
struct inline_node *node __maybe_unused,
|
|
|
|
struct symbol *sym __maybe_unused)
|
2013-09-11 12:09:28 +07:00
|
|
|
{
|
|
|
|
FILE *fp;
|
|
|
|
char cmd[PATH_MAX];
|
|
|
|
char *filename = NULL;
|
|
|
|
size_t len;
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
scnprintf(cmd, sizeof(cmd), "addr2line -e %s %016"PRIx64,
|
|
|
|
dso_name, addr);
|
|
|
|
|
|
|
|
fp = popen(cmd, "r");
|
|
|
|
if (fp == NULL) {
|
|
|
|
pr_warning("popen failed for %s\n", dso_name);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (getline(&filename, &len, fp) < 0 || !len) {
|
|
|
|
pr_warning("addr2line has no output for %s\n", dso_name);
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
2017-03-26 03:34:25 +07:00
|
|
|
ret = filename_split(filename, line_nr);
|
|
|
|
if (ret != 1) {
|
2013-09-11 12:09:28 +07:00
|
|
|
free(filename);
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
2017-03-26 03:34:25 +07:00
|
|
|
*file = filename;
|
|
|
|
|
2013-09-11 12:09:28 +07:00
|
|
|
out:
|
|
|
|
pclose(fp);
|
|
|
|
return ret;
|
|
|
|
}
|
2013-12-03 14:23:07 +07:00
|
|
|
|
|
|
|
void dso__free_a2l(struct dso *dso __maybe_unused)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2017-03-26 03:34:26 +07:00
|
|
|
static struct inline_node *addr2inlines(const char *dso_name, u64 addr,
|
2017-10-10 03:32:57 +07:00
|
|
|
struct dso *dso __maybe_unused,
|
|
|
|
struct symbol *sym)
|
2017-03-26 03:34:26 +07:00
|
|
|
{
|
|
|
|
FILE *fp;
|
|
|
|
char cmd[PATH_MAX];
|
|
|
|
struct inline_node *node;
|
|
|
|
char *filename = NULL;
|
|
|
|
size_t len;
|
|
|
|
unsigned int line_nr = 0;
|
|
|
|
|
|
|
|
scnprintf(cmd, sizeof(cmd), "addr2line -e %s -i %016"PRIx64,
|
|
|
|
dso_name, addr);
|
|
|
|
|
|
|
|
fp = popen(cmd, "r");
|
|
|
|
if (fp == NULL) {
|
|
|
|
pr_err("popen failed for %s\n", dso_name);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
node = zalloc(sizeof(*node));
|
|
|
|
if (node == NULL) {
|
|
|
|
perror("not enough memory for the inline node");
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
INIT_LIST_HEAD(&node->val);
|
|
|
|
node->addr = addr;
|
|
|
|
|
|
|
|
while (getline(&filename, &len, fp) != -1) {
|
2017-10-10 03:32:58 +07:00
|
|
|
char *srcline;
|
2017-10-10 03:32:57 +07:00
|
|
|
|
2017-03-26 03:34:26 +07:00
|
|
|
if (filename_split(filename, &line_nr) != 1) {
|
|
|
|
free(filename);
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
2017-10-10 03:32:58 +07:00
|
|
|
srcline = srcline_from_fileline(filename, line_nr);
|
|
|
|
if (inline_list__append(sym, srcline, node) != 0)
|
2017-03-26 03:34:26 +07:00
|
|
|
goto out;
|
|
|
|
|
|
|
|
filename = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
out:
|
|
|
|
pclose(fp);
|
|
|
|
|
|
|
|
return node;
|
|
|
|
}
|
|
|
|
|
2013-09-11 12:09:32 +07:00
|
|
|
#endif /* HAVE_LIBBFD_SUPPORT */
|
2013-09-11 12:09:28 +07:00
|
|
|
|
2013-12-03 14:23:10 +07:00
|
|
|
/*
|
|
|
|
* Number of addr2line failures (without success) before disabling it for that
|
|
|
|
* dso.
|
|
|
|
*/
|
|
|
|
#define A2L_FAIL_LIMIT 123
|
|
|
|
|
2015-09-02 01:47:19 +07:00
|
|
|
char *__get_srcline(struct dso *dso, u64 addr, struct symbol *sym,
|
2017-03-19 04:49:28 +07:00
|
|
|
bool show_sym, bool show_addr, bool unwind_inlines)
|
2013-09-11 12:09:28 +07:00
|
|
|
{
|
2013-10-10 10:51:31 +07:00
|
|
|
char *file = NULL;
|
|
|
|
unsigned line = 0;
|
2013-09-11 12:09:31 +07:00
|
|
|
char *srcline;
|
2013-12-11 01:19:23 +07:00
|
|
|
const char *dso_name;
|
2013-09-11 12:09:28 +07:00
|
|
|
|
2013-09-11 12:09:31 +07:00
|
|
|
if (!dso->has_srcline)
|
2014-11-13 09:05:24 +07:00
|
|
|
goto out;
|
2013-09-11 12:09:31 +07:00
|
|
|
|
2017-03-26 03:34:25 +07:00
|
|
|
dso_name = dso__name(dso);
|
|
|
|
if (dso_name == NULL)
|
2013-09-11 12:09:29 +07:00
|
|
|
goto out;
|
|
|
|
|
2017-10-10 03:32:57 +07:00
|
|
|
if (!addr2line(dso_name, addr, &file, &line, dso,
|
|
|
|
unwind_inlines, NULL, sym))
|
2013-09-11 12:09:29 +07:00
|
|
|
goto out;
|
2013-09-11 12:09:28 +07:00
|
|
|
|
2017-10-10 03:32:58 +07:00
|
|
|
srcline = srcline_from_fileline(file, line);
|
|
|
|
free(file);
|
|
|
|
|
|
|
|
if (!srcline)
|
2013-12-03 14:23:10 +07:00
|
|
|
goto out;
|
|
|
|
|
|
|
|
dso->a2l_fails = 0;
|
2013-09-11 12:09:28 +07:00
|
|
|
|
|
|
|
return srcline;
|
2013-09-11 12:09:31 +07:00
|
|
|
|
|
|
|
out:
|
2013-12-03 14:23:10 +07:00
|
|
|
if (dso->a2l_fails && ++dso->a2l_fails > A2L_FAIL_LIMIT) {
|
|
|
|
dso->has_srcline = 0;
|
|
|
|
dso__free_a2l(dso);
|
|
|
|
}
|
2017-03-19 04:49:28 +07:00
|
|
|
|
|
|
|
if (!show_addr)
|
|
|
|
return (show_sym && sym) ?
|
|
|
|
strndup(sym->name, sym->namelen) : NULL;
|
|
|
|
|
2014-11-13 09:05:27 +07:00
|
|
|
if (sym) {
|
2014-12-16 13:19:06 +07:00
|
|
|
if (asprintf(&srcline, "%s+%" PRIu64, show_sym ? sym->name : "",
|
2014-11-13 09:05:27 +07:00
|
|
|
addr - sym->start) < 0)
|
|
|
|
return SRCLINE_UNKNOWN;
|
2014-12-16 13:19:06 +07:00
|
|
|
} else if (asprintf(&srcline, "%s[%" PRIx64 "]", dso->short_name, addr) < 0)
|
2014-11-13 09:05:24 +07:00
|
|
|
return SRCLINE_UNKNOWN;
|
|
|
|
return srcline;
|
2013-09-11 12:09:28 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
void free_srcline(char *srcline)
|
|
|
|
{
|
|
|
|
if (srcline && strcmp(srcline, SRCLINE_UNKNOWN) != 0)
|
|
|
|
free(srcline);
|
|
|
|
}
|
2015-09-02 01:47:19 +07:00
|
|
|
|
|
|
|
char *get_srcline(struct dso *dso, u64 addr, struct symbol *sym,
|
2017-03-19 04:49:28 +07:00
|
|
|
bool show_sym, bool show_addr)
|
2015-09-02 01:47:19 +07:00
|
|
|
{
|
2017-03-19 04:49:28 +07:00
|
|
|
return __get_srcline(dso, addr, sym, show_sym, show_addr, false);
|
2015-09-02 01:47:19 +07:00
|
|
|
}
|
2017-03-26 03:34:26 +07:00
|
|
|
|
2017-10-10 03:32:57 +07:00
|
|
|
struct inline_node *dso__parse_addr_inlines(struct dso *dso, u64 addr,
|
|
|
|
struct symbol *sym)
|
2017-03-26 03:34:26 +07:00
|
|
|
{
|
|
|
|
const char *dso_name;
|
|
|
|
|
|
|
|
dso_name = dso__name(dso);
|
|
|
|
if (dso_name == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
2017-10-10 03:32:57 +07:00
|
|
|
return addr2inlines(dso_name, addr, dso, sym);
|
2017-03-26 03:34:26 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
void inline_node__delete(struct inline_node *node)
|
|
|
|
{
|
|
|
|
struct inline_list *ilist, *tmp;
|
|
|
|
|
|
|
|
list_for_each_entry_safe(ilist, tmp, &node->val, list) {
|
|
|
|
list_del_init(&ilist->list);
|
2017-10-10 03:32:58 +07:00
|
|
|
free_srcline(ilist->srcline);
|
2017-10-10 03:32:57 +07:00
|
|
|
/* only the inlined symbols are owned by the list */
|
|
|
|
if (ilist->symbol && ilist->symbol->inlined)
|
|
|
|
symbol__delete(ilist->symbol);
|
2017-03-26 03:34:26 +07:00
|
|
|
free(ilist);
|
|
|
|
}
|
|
|
|
|
|
|
|
free(node);
|
|
|
|
}
|
2017-10-10 03:32:59 +07:00
|
|
|
|
|
|
|
void inlines__tree_insert(struct rb_root *tree, struct inline_node *inlines)
|
|
|
|
{
|
|
|
|
struct rb_node **p = &tree->rb_node;
|
|
|
|
struct rb_node *parent = NULL;
|
|
|
|
const u64 addr = inlines->addr;
|
|
|
|
struct inline_node *i;
|
|
|
|
|
|
|
|
while (*p != NULL) {
|
|
|
|
parent = *p;
|
|
|
|
i = rb_entry(parent, struct inline_node, rb_node);
|
|
|
|
if (addr < i->addr)
|
|
|
|
p = &(*p)->rb_left;
|
|
|
|
else
|
|
|
|
p = &(*p)->rb_right;
|
|
|
|
}
|
|
|
|
rb_link_node(&inlines->rb_node, parent, p);
|
|
|
|
rb_insert_color(&inlines->rb_node, tree);
|
|
|
|
}
|
|
|
|
|
|
|
|
struct inline_node *inlines__tree_find(struct rb_root *tree, u64 addr)
|
|
|
|
{
|
|
|
|
struct rb_node *n = tree->rb_node;
|
|
|
|
|
|
|
|
while (n) {
|
|
|
|
struct inline_node *i = rb_entry(n, struct inline_node,
|
|
|
|
rb_node);
|
|
|
|
|
|
|
|
if (addr < i->addr)
|
|
|
|
n = n->rb_left;
|
|
|
|
else if (addr > i->addr)
|
|
|
|
n = n->rb_right;
|
|
|
|
else
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
void inlines__tree_delete(struct rb_root *tree)
|
|
|
|
{
|
|
|
|
struct inline_node *pos;
|
|
|
|
struct rb_node *next = rb_first(tree);
|
|
|
|
|
|
|
|
while (next) {
|
|
|
|
pos = rb_entry(next, struct inline_node, rb_node);
|
|
|
|
next = rb_next(&pos->rb_node);
|
|
|
|
rb_erase(&pos->rb_node, tree);
|
|
|
|
inline_node__delete(pos);
|
|
|
|
}
|
|
|
|
}
|