[linux-2.6-block.git] / tools / perf / util / srcline.c

// SPDX-License-Identifier: GPL-2.0
#include <inttypes.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#include <linux/kernel.h>

#include "util/dso.h"
#include "util/util.h"
#include "util/debug.h"
#include "util/callchain.h"
#include "srcline.h"
#include "string2.h"
#include "symbol.h"

bool srcline_full_filename;

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;
}

static int inline_list__append(struct symbol *symbol, char *srcline,
			       struct inline_node *node)
{
	struct inline_list *ilist;

	ilist = zalloc(sizeof(*ilist));
	if (ilist == NULL)
		return -1;

	ilist->symbol = symbol;
	ilist->srcline = srcline;

	if (callchain_param.order == ORDER_CALLEE)
		list_add_tail(&ilist->list, &node->val);
	else
		list_add(&ilist->list, &node->val);

	return 0;
}

/* 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;
}

static struct symbol *new_inline_sym(struct dso *dso,
				     struct symbol *base_sym,
				     const char *funcname)
{
	struct symbol *inline_sym;
	char *demangled = NULL;

	if (!funcname)
		funcname = "??";

	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,
					 base_sym ? base_sym->type : 0,
					 funcname);
		if (inline_sym)
			inline_sym->inlined = 1;
	}

	free(demangled);

	return inline_sym;
}

#ifdef HAVE_LIBBFD_SUPPORT

/*
 * Implement addr2line using libbfd.
 */
#define PACKAGE "perf"
#include <bfd.h>

struct a2l_data {
	const char 	*input;
	u64	 	addr;

	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);

	if (a2l->filename && !strlen(a2l->filename))
		a2l->filename = NULL;
}

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) {
		zfree((char **)&a2l->input);
		free(a2l);
	}
	bfd_close(abfd);
	return NULL;
}

static void addr2line_cleanup(struct a2l_data *a2l)
{
	if (a2l->abfd)
		bfd_close(a2l->abfd);
	zfree((char **)&a2l->input);
	zfree(&a2l->syms);
	free(a2l);
}

#define MAX_INLINE_NEST 1024

static int inline_list__append_dso_a2l(struct dso *dso,
				       struct inline_node *node,
				       struct symbol *sym)
{
	struct a2l_data *a2l = dso->a2l;
	struct symbol *inline_sym = new_inline_sym(dso, sym, a2l->funcname);
	char *srcline = NULL;

	if (a2l->filename)
		srcline = srcline_from_fileline(a2l->filename, a2l->line);

	return inline_list__append(inline_sym, srcline, node);
}

static int addr2line(const char *dso_name, u64 addr,
		     char **file, unsigned int *line, struct dso *dso,
		     bool unwind_inlines, struct inline_node *node,
		     struct symbol *sym)
{
	int ret = 0;
	struct a2l_data *a2l = dso->a2l;

	if (!a2l) {
		dso->a2l = addr2line_init(dso_name);
		a2l = dso->a2l;
	}

	if (a2l == NULL) {
		pr_warning("addr2line_init failed for %s\n", dso_name);
		return 0;
	}

	a2l->addr = addr;
	a2l->found = false;

	bfd_map_over_sections(a2l->abfd, find_address_in_section, a2l);

	if (!a2l->found)
		return 0;

	if (unwind_inlines) {
		int cnt = 0;

		if (node && inline_list__append_dso_a2l(dso, node, sym))
			return 0;

		while (bfd_find_inliner_info(a2l->abfd, &a2l->filename,
					     &a2l->funcname, &a2l->line) &&
		       cnt++ < MAX_INLINE_NEST) {

			if (a2l->filename && !strlen(a2l->filename))
				a2l->filename = NULL;

			if (node != NULL) {
				if (inline_list__append_dso_a2l(dso, node, sym))
					return 0;
				// found at least one inline frame
				ret = 1;
			}
		}
	}

	if (file) {
		*file = a2l->filename ? strdup(a2l->filename) : NULL;
		ret = *file ? 1 : 0;
	}

	if (line)
		*line = a2l->line;

	return ret;
}

void dso__free_a2l(struct dso *dso)
{
	struct a2l_data *a2l = dso->a2l;

	if (!a2l)
		return;

	addr2line_cleanup(a2l);

	dso->a2l = NULL;
}

static struct inline_node *addr2inlines(const char *dso_name, u64 addr,
					struct dso *dso, struct symbol *sym)
{
	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;

	addr2line(dso_name, addr, NULL, NULL, dso, true, node, sym);
	return node;
}

#else /* HAVE_LIBBFD_SUPPORT */

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;
}

static int addr2line(const char *dso_name, u64 addr,
		     char **file, unsigned int *line_nr,
		     struct dso *dso __maybe_unused,
		     bool unwind_inlines __maybe_unused,
		     struct inline_node *node __maybe_unused,
		     struct symbol *sym __maybe_unused)
{
	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;
	}

	ret = filename_split(filename, line_nr);
	if (ret != 1) {
		free(filename);
		goto out;
	}

	*file = filename;

out:
	pclose(fp);
	return ret;
}

void dso__free_a2l(struct dso *dso __maybe_unused)
{
}

static struct inline_node *addr2inlines(const char *dso_name, u64 addr,
					struct dso *dso __maybe_unused,
					struct symbol *sym)
{
	FILE *fp;
	char cmd[PATH_MAX];
	struct inline_node *node;
	char *filename = NULL;
	char *funcname = NULL;
	size_t filelen, funclen;
	unsigned int line_nr = 0;

	scnprintf(cmd, sizeof(cmd), "addr2line -e %s -i -f %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;

	/* addr2line -f generates two lines for each inlined functions */
	while (getline(&funcname, &funclen, fp) != -1) {
		char *srcline;
		struct symbol *inline_sym;

		rtrim(funcname);

		if (getline(&filename, &filelen, fp) == -1)
			goto out;

		if (filename_split(filename, &line_nr) != 1)
			goto out;

		srcline = srcline_from_fileline(filename, line_nr);
		inline_sym = new_inline_sym(dso, sym, funcname);

		if (inline_list__append(inline_sym, srcline, node) != 0) {
			free(srcline);
			if (inline_sym && inline_sym->inlined)
				symbol__delete(inline_sym);
			goto out;
		}
	}

out:
	pclose(fp);
	free(filename);
	free(funcname);

	return node;
}

#endif /* HAVE_LIBBFD_SUPPORT */

/*
 * Number of addr2line failures (without success) before disabling it for that
 * dso.
 */
#define A2L_FAIL_LIMIT 123

char *__get_srcline(struct dso *dso, u64 addr, struct symbol *sym,
		  bool show_sym, bool show_addr, bool unwind_inlines,
		  u64 ip)
{
	char *file = NULL;
	unsigned line = 0;
	char *srcline;
	const char *dso_name;

	if (!dso->has_srcline)
		goto out;

	dso_name = dso__name(dso);
	if (dso_name == NULL)
		goto out;

	if (!addr2line(dso_name, addr, &file, &line, dso,
		       unwind_inlines, NULL, sym))
		goto out;

	srcline = srcline_from_fileline(file, line);
	free(file);

	if (!srcline)
		goto out;

	dso->a2l_fails = 0;

	return srcline;

out:
	if (dso->a2l_fails && ++dso->a2l_fails > A2L_FAIL_LIMIT) {
		dso->has_srcline = 0;
		dso__free_a2l(dso);
	}

	if (!show_addr)
		return (show_sym && sym) ?
			    strndup(sym->name, sym->namelen) : NULL;

	if (sym) {
		if (asprintf(&srcline, "%s+%" PRIu64, show_sym ? sym->name : "",
					ip - sym->start) < 0)
			return SRCLINE_UNKNOWN;
	} else if (asprintf(&srcline, "%s[%" PRIx64 "]", dso->short_name, addr) < 0)
		return SRCLINE_UNKNOWN;
	return srcline;
}

void free_srcline(char *srcline)
{
	if (srcline && strcmp(srcline, SRCLINE_UNKNOWN) != 0)
		free(srcline);
}

char *get_srcline(struct dso *dso, u64 addr, struct symbol *sym,
		  bool show_sym, bool show_addr, u64 ip)
{
	return __get_srcline(dso, addr, sym, show_sym, show_addr, false, ip);
}

struct srcline_node {
	u64			addr;
	char			*srcline;
	struct rb_node		rb_node;
};

void srcline__tree_insert(struct rb_root *tree, u64 addr, char *srcline)
{
	struct rb_node **p = &tree->rb_node;
	struct rb_node *parent = NULL;
	struct srcline_node *i, *node;

	node = zalloc(sizeof(struct srcline_node));
	if (!node) {
		perror("not enough memory for the srcline node");
		return;
	}

	node->addr = addr;
	node->srcline = srcline;

	while (*p != NULL) {
		parent = *p;
		i = rb_entry(parent, struct srcline_node, rb_node);
		if (addr < i->addr)
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}
	rb_link_node(&node->rb_node, parent, p);
	rb_insert_color(&node->rb_node, tree);
}

char *srcline__tree_find(struct rb_root *tree, u64 addr)
{
	struct rb_node *n = tree->rb_node;

	while (n) {
		struct srcline_node *i = rb_entry(n, struct srcline_node,
						  rb_node);

		if (addr < i->addr)
			n = n->rb_left;
		else if (addr > i->addr)
			n = n->rb_right;
		else
			return i->srcline;
	}

	return NULL;
}

void srcline__tree_delete(struct rb_root *tree)
{
	struct srcline_node *pos;
	struct rb_node *next = rb_first(tree);

	while (next) {
		pos = rb_entry(next, struct srcline_node, rb_node);
		next = rb_next(&pos->rb_node);
		rb_erase(&pos->rb_node, tree);
		free_srcline(pos->srcline);
		zfree(&pos);
	}
}

struct inline_node *dso__parse_addr_inlines(struct dso *dso, u64 addr,
					    struct symbol *sym)
{
	const char *dso_name;

	dso_name = dso__name(dso);
	if (dso_name == NULL)
		return NULL;

	return addr2inlines(dso_name, addr, dso, sym);
}

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);
		free_srcline(ilist->srcline);
		/* only the inlined symbols are owned by the list */
		if (ilist->symbol && ilist->symbol->inlined)
			symbol__delete(ilist->symbol);
		free(ilist);
	}

	free(node);
}

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);
	}
}
Commit	Line	Data
b2441318	1	// SPDX-License-Identifier: GPL-2.0
fd20e811	2	#include <inttypes.h>
f048d548 NK	3	#include <stdio.h>
	4	#include <stdlib.h>
	5	#include <string.h>
	6
	7	#include <linux/kernel.h>
	8
86c98cab	9	#include "util/dso.h"
f048d548 NK	10	#include "util/util.h"
f048d548 NK	11	#include "util/debug.h"
a64489c5	12	#include "util/callchain.h"
632a5cab	13	#include "srcline.h"
7285cf33	14	#include "string2.h"
85c116a6 AK	15	#include "symbol.h"
85c116a6 AK	16
a9710ba0 AK	17	bool srcline_full_filename;
a9710ba0 AK	18
5580338d JY	19	static const char dso__name(struct dso dso)
	20	{
	21	const char *dso_name;
	22
	23	if (dso->symsrc_filename)
	24	dso_name = dso->symsrc_filename;
	25	else
	26	dso_name = dso->long_name;
	27
	28	if (dso_name[0] == '[')
	29	return NULL;
	30
	31	if (!strncmp(dso_name, "/tmp/perf-", 10))
	32	return NULL;
	33
	34	return dso_name;
	35	}
	36
2be8832f MW	37	static int inline_list__append(struct symbol symbol, char srcline,
2be8832f MW	38	struct inline_node *node)
a64489c5 JY	39	{
a64489c5 JY	40	struct inline_list *ilist;
a64489c5 JY	41
	42	ilist = zalloc(sizeof(*ilist));
	43	if (ilist == NULL)
	44	return -1;
	45
fea0cf84	46	ilist->symbol = symbol;
2be8832f	47	ilist->srcline = srcline;
a64489c5	48
28071f51 MW	49	if (callchain_param.order == ORDER_CALLEE)
	50	list_add_tail(&ilist->list, &node->val);
	51	else
	52	list_add(&ilist->list, &node->val);
a64489c5 JY	53
	54	return 0;
	55	}
	56
2be8832f MW	57	/* basename version that takes a const input string */
	58	static const char gnu_basename(const char path)
	59	{
	60	const char *base = strrchr(path, '/');
	61
	62	return base ? base + 1 : path;
	63	}
	64
	65	static char srcline_from_fileline(const char file, unsigned int line)
	66	{
	67	char *srcline;
	68
	69	if (!file)
	70	return NULL;
	71
	72	if (!srcline_full_filename)
	73	file = gnu_basename(file);
	74
	75	if (asprintf(&srcline, "%s:%u", file, line) < 0)
	76	return NULL;
	77
	78	return srcline;
	79	}
	80
7285cf33 NK	81	static struct symbol new_inline_sym(struct dso dso,
	82	struct symbol *base_sym,
	83	const char *funcname)
	84	{
	85	struct symbol *inline_sym;
	86	char *demangled = NULL;
	87
d4046e8e MW	88	if (!funcname)
	89	funcname = "??";
	90
7285cf33 NK	91	if (dso) {
	92	demangled = dso__demangle_sym(dso, 0, funcname);
	93	if (demangled)
	94	funcname = demangled;
	95	}
	96
	97	if (base_sym && strcmp(funcname, base_sym->name) == 0) {
	98	/* reuse the real, existing symbol */
	99	inline_sym = base_sym;
	100	/* ensure that we don't alias an inlined symbol, which could
	101	* lead to double frees in inline_node__delete
	102	*/
	103	assert(!base_sym->inlined);
	104	} else {
	105	/* create a fake symbol for the inline frame */
	106	inline_sym = symbol__new(base_sym ? base_sym->start : 0,
	107	base_sym ? base_sym->end : 0,
	108	base_sym ? base_sym->binding : 0,
af30bffa	109	base_sym ? base_sym->type : 0,
7285cf33 NK	110	funcname);
	111	if (inline_sym)
	112	inline_sym->inlined = 1;
	113	}
	114
	115	free(demangled);
	116
	117	return inline_sym;
	118	}
	119
2f48fcd8 RV	120	#ifdef HAVE_LIBBFD_SUPPORT
	121
	122	/*
	123	* Implement addr2line using libbfd.
	124	*/
	125	#define PACKAGE "perf"
	126	#include <bfd.h>
	127
	128	struct a2l_data {
	129	const char *input;
ac931f87	130	u64 addr;
2f48fcd8 RV	131
	132	bool found;
	133	const char *filename;
	134	const char *funcname;
	135	unsigned line;
	136
	137	bfd *abfd;
	138	asymbol **syms;
	139	};
	140
	141	static int bfd_error(const char *string)
	142	{
	143	const char *errmsg;
	144
	145	errmsg = bfd_errmsg(bfd_get_error());
	146	fflush(stdout);
	147
	148	if (string)
	149	pr_debug("%s: %s\n", string, errmsg);
	150	else
	151	pr_debug("%s\n", errmsg);
	152
	153	return -1;
	154	}
	155
	156	static int slurp_symtab(bfd abfd, struct a2l_data a2l)
	157	{
	158	long storage;
	159	long symcount;
	160	asymbol **syms;
	161	bfd_boolean dynamic = FALSE;
	162
	163	if ((bfd_get_file_flags(abfd) & HAS_SYMS) == 0)
	164	return bfd_error(bfd_get_filename(abfd));
	165
	166	storage = bfd_get_symtab_upper_bound(abfd);
	167	if (storage == 0L) {
	168	storage = bfd_get_dynamic_symtab_upper_bound(abfd);
	169	dynamic = TRUE;
	170	}
	171	if (storage < 0L)
	172	return bfd_error(bfd_get_filename(abfd));
	173
	174	syms = malloc(storage);
	175	if (dynamic)
	176	symcount = bfd_canonicalize_dynamic_symtab(abfd, syms);
	177	else
	178	symcount = bfd_canonicalize_symtab(abfd, syms);
	179
	180	if (symcount < 0) {
	181	free(syms);
	182	return bfd_error(bfd_get_filename(abfd));
	183	}
	184
	185	a2l->syms = syms;
	186	return 0;
	187	}
	188
	189	static void find_address_in_section(bfd abfd, asection section, void *data)
	190	{
	191	bfd_vma pc, vma;
	192	bfd_size_type size;
	193	struct a2l_data *a2l = data;
	194
195	if (a2l->found)
196	return;
197
198	if ((bfd_get_section_flags(abfd, section) & SEC_ALLOC) == 0)
199	return;
200
201	pc = a2l->addr;
202	vma = bfd_get_section_vma(abfd, section);
203	size = bfd_get_section_size(section);
204
205	if (pc < vma \|\| pc >= vma + size)
206	return;
207
208	a2l->found = bfd_find_nearest_line(abfd, section, a2l->syms, pc - vma,
209	&a2l->filename, &a2l->funcname,
210	&a2l->line);
d964b1cd MW	211
	212	if (a2l->filename && !strlen(a2l->filename))
	213	a2l->filename = NULL;
2f48fcd8 RV	214	}
	215
	216	static struct a2l_data addr2line_init(const char path)
	217	{
	218	bfd *abfd;
	219	struct a2l_data *a2l = NULL;
	220
	221	abfd = bfd_openr(path, NULL);
	222	if (abfd == NULL)
	223	return NULL;
	224
	225	if (!bfd_check_format(abfd, bfd_object))
	226	goto out;
	227
	228	a2l = zalloc(sizeof(*a2l));
	229	if (a2l == NULL)
	230	goto out;
	231
	232	a2l->abfd = abfd;
	233	a2l->input = strdup(path);
	234	if (a2l->input == NULL)
	235	goto out;
	236
	237	if (slurp_symtab(abfd, a2l))
	238	goto out;
	239
	240	return a2l;
	241
	242	out:
	243	if (a2l) {
7d16c634	244	zfree((char **)&a2l->input);
2f48fcd8 RV	245	free(a2l);
	246	}
	247	bfd_close(abfd);
	248	return NULL;
	249	}
	250
	251	static void addr2line_cleanup(struct a2l_data *a2l)
	252	{
	253	if (a2l->abfd)
	254	bfd_close(a2l->abfd);
7d16c634	255	zfree((char **)&a2l->input);
74cf249d	256	zfree(&a2l->syms);
2f48fcd8 RV	257	free(a2l);
	258	}
	259
2f84b42b AK	260	#define MAX_INLINE_NEST 1024
2f84b42b AK	261
4d53b9d5	262	static int inline_list__append_dso_a2l(struct dso *dso,
fea0cf84 MW	263	struct inline_node *node,
fea0cf84 MW	264	struct symbol *sym)
4d53b9d5 MW	265	{
4d53b9d5 MW	266	struct a2l_data *a2l = dso->a2l;
fea0cf84	267	struct symbol *inline_sym = new_inline_sym(dso, sym, a2l->funcname);
2be8832f	268	char *srcline = NULL;
4d53b9d5	269
2be8832f MW	270	if (a2l->filename)
	271	srcline = srcline_from_fileline(a2l->filename, a2l->line);
	272
	273	return inline_list__append(inline_sym, srcline, node);
4d53b9d5 MW	274	}
4d53b9d5 MW	275
ac931f87	276	static int addr2line(const char *dso_name, u64 addr,
2f84b42b	277	char *file, unsigned int line, struct dso *dso,
fea0cf84 MW	278	bool unwind_inlines, struct inline_node *node,
fea0cf84 MW	279	struct symbol *sym)
2f48fcd8 RV	280	{
2f48fcd8 RV	281	int ret = 0;
454ff00f AH	282	struct a2l_data *a2l = dso->a2l;
	283
	284	if (!a2l) {
	285	dso->a2l = addr2line_init(dso_name);
	286	a2l = dso->a2l;
	287	}
2f48fcd8	288
2f48fcd8 RV	289	if (a2l == NULL) {
	290	pr_warning("addr2line_init failed for %s\n", dso_name);
	291	return 0;
	292	}
	293
	294	a2l->addr = addr;
454ff00f AH	295	a2l->found = false;
454ff00f AH	296
2f48fcd8 RV	297	bfd_map_over_sections(a2l->abfd, find_address_in_section, a2l);
2f48fcd8 RV	298
b21cc978 MW	299	if (!a2l->found)
	300	return 0;
	301
	302	if (unwind_inlines) {
2f84b42b AK	303	int cnt = 0;
2f84b42b AK	304
fea0cf84	305	if (node && inline_list__append_dso_a2l(dso, node, sym))
4d53b9d5 MW	306	return 0;
4d53b9d5 MW	307
2f84b42b AK	308	while (bfd_find_inliner_info(a2l->abfd, &a2l->filename,
2f84b42b AK	309	&a2l->funcname, &a2l->line) &&
a64489c5 JY	310	cnt++ < MAX_INLINE_NEST) {
a64489c5 JY	311
d964b1cd MW	312	if (a2l->filename && !strlen(a2l->filename))
	313	a2l->filename = NULL;
	314
a64489c5	315	if (node != NULL) {
fea0cf84	316	if (inline_list__append_dso_a2l(dso, node, sym))
a64489c5	317	return 0;
b21cc978 MW	318	// found at least one inline frame
b21cc978 MW	319	ret = 1;
a64489c5 JY	320	}
a64489c5 JY	321	}
2f84b42b AK	322	}
2f84b42b AK	323
b21cc978 MW	324	if (file) {
	325	*file = a2l->filename ? strdup(a2l->filename) : NULL;
	326	ret = *file ? 1 : 0;
2f48fcd8 RV	327	}
2f48fcd8 RV	328
b21cc978 MW	329	if (line)
	330	*line = a2l->line;
	331
2f48fcd8 RV	332	return ret;
	333	}
	334
454ff00f AH	335	void dso__free_a2l(struct dso *dso)
	336	{
	337	struct a2l_data *a2l = dso->a2l;
	338
	339	if (!a2l)
	340	return;
	341
	342	addr2line_cleanup(a2l);
	343
	344	dso->a2l = NULL;
	345	}
	346
a64489c5	347	static struct inline_node addr2inlines(const char dso_name, u64 addr,
fea0cf84	348	struct dso dso, struct symbol sym)
a64489c5	349	{
a64489c5 JY	350	struct inline_node *node;
	351
	352	node = zalloc(sizeof(*node));
	353	if (node == NULL) {
	354	perror("not enough memory for the inline node");
	355	return NULL;
	356	}
	357
	358	INIT_LIST_HEAD(&node->val);
	359	node->addr = addr;
	360
b38775cf	361	addr2line(dso_name, addr, NULL, NULL, dso, true, node, sym);
a64489c5	362	return node;
a64489c5 JY	363	}
a64489c5 JY	364
2f48fcd8 RV	365	#else /* HAVE_LIBBFD_SUPPORT */
2f48fcd8 RV	366
5580338d JY	367	static int filename_split(char filename, unsigned int line_nr)
	368	{
	369	char *sep;
	370
	371	sep = strchr(filename, '\n');
	372	if (sep)
	373	*sep = '\0';
	374
	375	if (!strcmp(filename, "??:0"))
	376	return 0;
	377
	378	sep = strchr(filename, ':');
	379	if (sep) {
	380	*sep++ = '\0';
	381	*line_nr = strtoul(sep, NULL, 0);
	382	return 1;
	383	}
	384
	385	return 0;
	386	}
	387
ac931f87	388	static int addr2line(const char *dso_name, u64 addr,
454ff00f	389	char *file, unsigned int line_nr,
2f84b42b	390	struct dso *dso __maybe_unused,
a64489c5	391	bool unwind_inlines __maybe_unused,
fea0cf84 MW	392	struct inline_node *node __maybe_unused,
fea0cf84 MW	393	struct symbol *sym __maybe_unused)
f048d548 NK	394	{
	395	FILE *fp;
	396	char cmd[PATH_MAX];
	397	char *filename = NULL;
	398	size_t len;
f048d548 NK	399	int ret = 0;
	400
	401	scnprintf(cmd, sizeof(cmd), "addr2line -e %s %016"PRIx64,
	402	dso_name, addr);
	403
	404	fp = popen(cmd, "r");
	405	if (fp == NULL) {
	406	pr_warning("popen failed for %s\n", dso_name);
	407	return 0;
	408	}
	409
	410	if (getline(&filename, &len, fp) < 0 \|\| !len) {
	411	pr_warning("addr2line has no output for %s\n", dso_name);
	412	goto out;
	413	}
	414
5580338d JY	415	ret = filename_split(filename, line_nr);
5580338d JY	416	if (ret != 1) {
f048d548 NK	417	free(filename);
	418	goto out;
	419	}
	420
5580338d JY	421	*file = filename;
5580338d JY	422
f048d548 NK	423	out:
	424	pclose(fp);
	425	return ret;
	426	}
454ff00f AH	427
	428	void dso__free_a2l(struct dso *dso __maybe_unused)
	429	{
	430	}
	431
a64489c5	432	static struct inline_node addr2inlines(const char dso_name, u64 addr,
fea0cf84 MW	433	struct dso *dso __maybe_unused,
fea0cf84 MW	434	struct symbol *sym)
a64489c5 JY	435	{
	436	FILE *fp;
	437	char cmd[PATH_MAX];
	438	struct inline_node *node;
	439	char *filename = NULL;
7285cf33 NK	440	char *funcname = NULL;
7285cf33 NK	441	size_t filelen, funclen;
a64489c5 JY	442	unsigned int line_nr = 0;
a64489c5 JY	443
7285cf33	444	scnprintf(cmd, sizeof(cmd), "addr2line -e %s -i -f %016"PRIx64,
a64489c5 JY	445	dso_name, addr);
	446
	447	fp = popen(cmd, "r");
	448	if (fp == NULL) {
	449	pr_err("popen failed for %s\n", dso_name);
	450	return NULL;
	451	}
	452
	453	node = zalloc(sizeof(*node));
	454	if (node == NULL) {
	455	perror("not enough memory for the inline node");
	456	goto out;
	457	}
	458
	459	INIT_LIST_HEAD(&node->val);
	460	node->addr = addr;
	461
7285cf33 NK	462	/* addr2line -f generates two lines for each inlined functions */
7285cf33 NK	463	while (getline(&funcname, &funclen, fp) != -1) {
2be8832f	464	char *srcline;
7285cf33 NK	465	struct symbol *inline_sym;
	466
	467	rtrim(funcname);
	468
	469	if (getline(&filename, &filelen, fp) == -1)
	470	goto out;
fea0cf84	471
b7b75a60	472	if (filename_split(filename, &line_nr) != 1)
a64489c5	473	goto out;
a64489c5	474
2be8832f	475	srcline = srcline_from_fileline(filename, line_nr);
7285cf33 NK	476	inline_sym = new_inline_sym(dso, sym, funcname);
	477
	478	if (inline_list__append(inline_sym, srcline, node) != 0) {
	479	free(srcline);
	480	if (inline_sym && inline_sym->inlined)
	481	symbol__delete(inline_sym);
a64489c5	482	goto out;
7285cf33	483	}
a64489c5 JY	484	}
	485
	486	out:
	487	pclose(fp);
b7b75a60	488	free(filename);
7285cf33	489	free(funcname);
a64489c5	490
a64489c5 JY	491	return node;
	492	}
	493
2f48fcd8	494	#endif /* HAVE_LIBBFD_SUPPORT */
f048d548	495
906049c8 AH	496	/*
	497	* Number of addr2line failures (without success) before disabling it for that
	498	* dso.
	499	*/
	500	#define A2L_FAIL_LIMIT 123
	501
2f84b42b	502	char __get_srcline(struct dso dso, u64 addr, struct symbol *sym,
935f5a9d JY	503	bool show_sym, bool show_addr, bool unwind_inlines,
935f5a9d JY	504	u64 ip)
f048d548	505	{
a949fffb DA	506	char *file = NULL;
a949fffb DA	507	unsigned line = 0;
2cc9d0ef	508	char *srcline;
bf4414ae	509	const char *dso_name;
f048d548	510
2cc9d0ef	511	if (!dso->has_srcline)
23f0981b	512	goto out;
2cc9d0ef	513
5580338d JY	514	dso_name = dso__name(dso);
5580338d JY	515	if (dso_name == NULL)
58d91a00 NK	516	goto out;
58d91a00 NK	517
fea0cf84 MW	518	if (!addr2line(dso_name, addr, &file, &line, dso,
fea0cf84 MW	519	unwind_inlines, NULL, sym))
58d91a00	520	goto out;
f048d548	521
2be8832f MW	522	srcline = srcline_from_fileline(file, line);
	523	free(file);
	524
	525	if (!srcline)
906049c8	526	goto out;
906049c8 AH	527
906049c8 AH	528	dso->a2l_fails = 0;
f048d548	529
f048d548	530	return srcline;
2cc9d0ef NK	531
2cc9d0ef NK	532	out:
906049c8 AH	533	if (dso->a2l_fails && ++dso->a2l_fails > A2L_FAIL_LIMIT) {
	534	dso->has_srcline = 0;
	535	dso__free_a2l(dso);
	536	}
5dfa210e MW	537
	538	if (!show_addr)
	539	return (show_sym && sym) ?
	540	strndup(sym->name, sym->namelen) : NULL;
	541
85c116a6	542	if (sym) {
ac931f87	543	if (asprintf(&srcline, "%s+%" PRIu64, show_sym ? sym->name : "",
935f5a9d	544	ip - sym->start) < 0)
85c116a6	545	return SRCLINE_UNKNOWN;
ac931f87	546	} else if (asprintf(&srcline, "%s[%" PRIx64 "]", dso->short_name, addr) < 0)
23f0981b AK	547	return SRCLINE_UNKNOWN;
23f0981b AK	548	return srcline;
f048d548 NK	549	}
	550
	551	void free_srcline(char *srcline)
	552	{
	553	if (srcline && strcmp(srcline, SRCLINE_UNKNOWN) != 0)
	554	free(srcline);
	555	}
2f84b42b AK	556
2f84b42b AK	557	char get_srcline(struct dso dso, u64 addr, struct symbol *sym,
935f5a9d	558	bool show_sym, bool show_addr, u64 ip)
2f84b42b	559	{
935f5a9d	560	return __get_srcline(dso, addr, sym, show_sym, show_addr, false, ip);
2f84b42b	561	}
a64489c5	562
21ac9d54 MW	563	struct srcline_node {
	564	u64 addr;
	565	char *srcline;
	566	struct rb_node rb_node;
	567	};
	568
	569	void srcline__tree_insert(struct rb_root tree, u64 addr, char srcline)
	570	{
	571	struct rb_node **p = &tree->rb_node;
	572	struct rb_node *parent = NULL;
	573	struct srcline_node i, node;
	574
	575	node = zalloc(sizeof(struct srcline_node));
	576	if (!node) {
	577	perror("not enough memory for the srcline node");
	578	return;
	579	}
	580
	581	node->addr = addr;
	582	node->srcline = srcline;
	583
	584	while (*p != NULL) {
	585	parent = *p;
	586	i = rb_entry(parent, struct srcline_node, rb_node);
	587	if (addr < i->addr)
	588	p = &(*p)->rb_left;
	589	else
	590	p = &(*p)->rb_right;
	591	}
	592	rb_link_node(&node->rb_node, parent, p);
	593	rb_insert_color(&node->rb_node, tree);
	594	}
	595
	596	char srcline__tree_find(struct rb_root tree, u64 addr)
	597	{
	598	struct rb_node *n = tree->rb_node;
	599
	600	while (n) {
	601	struct srcline_node *i = rb_entry(n, struct srcline_node,
	602	rb_node);
	603
	604	if (addr < i->addr)
	605	n = n->rb_left;
	606	else if (addr > i->addr)
	607	n = n->rb_right;
	608	else
	609	return i->srcline;
	610	}
	611
	612	return NULL;
	613	}
	614
	615	void srcline__tree_delete(struct rb_root *tree)
	616	{
	617	struct srcline_node *pos;
	618	struct rb_node *next = rb_first(tree);
	619
	620	while (next) {
	621	pos = rb_entry(next, struct srcline_node, rb_node);
	622	next = rb_next(&pos->rb_node);
	623	rb_erase(&pos->rb_node, tree);
	624	free_srcline(pos->srcline);
	625	zfree(&pos);
	626	}
627	}
628
fea0cf84 MW	629	struct inline_node dso__parse_addr_inlines(struct dso dso, u64 addr,
fea0cf84 MW	630	struct symbol *sym)
a64489c5 JY	631	{
	632	const char *dso_name;
	633
	634	dso_name = dso__name(dso);
	635	if (dso_name == NULL)
	636	return NULL;
	637
fea0cf84	638	return addr2inlines(dso_name, addr, dso, sym);
a64489c5 JY	639	}
	640
	641	void inline_node__delete(struct inline_node *node)
	642	{
	643	struct inline_list ilist, tmp;
	644
	645	list_for_each_entry_safe(ilist, tmp, &node->val, list) {
	646	list_del_init(&ilist->list);
2be8832f	647	free_srcline(ilist->srcline);
fea0cf84 MW	648	/* only the inlined symbols are owned by the list */
	649	if (ilist->symbol && ilist->symbol->inlined)
	650	symbol__delete(ilist->symbol);
a64489c5 JY	651	free(ilist);
	652	}
	653
	654	free(node);
	655	}
11ea2515 MW	656
	657	void inlines__tree_insert(struct rb_root tree, struct inline_node inlines)
	658	{
	659	struct rb_node **p = &tree->rb_node;
	660	struct rb_node *parent = NULL;
	661	const u64 addr = inlines->addr;
	662	struct inline_node *i;
	663
	664	while (*p != NULL) {
	665	parent = *p;
	666	i = rb_entry(parent, struct inline_node, rb_node);
	667	if (addr < i->addr)
	668	p = &(*p)->rb_left;
	669	else
	670	p = &(*p)->rb_right;
	671	}
	672	rb_link_node(&inlines->rb_node, parent, p);
	673	rb_insert_color(&inlines->rb_node, tree);
	674	}
	675
	676	struct inline_node inlines__tree_find(struct rb_root tree, u64 addr)
	677	{
	678	struct rb_node *n = tree->rb_node;
	679
	680	while (n) {
	681	struct inline_node *i = rb_entry(n, struct inline_node,
	682	rb_node);
	683
	684	if (addr < i->addr)
	685	n = n->rb_left;
	686	else if (addr > i->addr)
	687	n = n->rb_right;
	688	else
	689	return i;
	690	}
	691
	692	return NULL;
	693	}
	694
	695	void inlines__tree_delete(struct rb_root *tree)
	696	{
	697	struct inline_node *pos;
	698	struct rb_node *next = rb_first(tree);
	699
	700	while (next) {
	701	pos = rb_entry(next, struct inline_node, rb_node);
	702	next = rb_next(&pos->rb_node);
	703	rb_erase(&pos->rb_node, tree);
	704	inline_node__delete(pos);
	705	}
	706	}