[mirror_ubuntu-bionic-kernel.git] / tools / perf / util / srcline.c

#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 "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(char *filename, char *funcname, int line_nr,
			       struct inline_node *node, struct dso *dso)
{
	struct inline_list *ilist;
	char *demangled;

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

	ilist->filename = filename;
	ilist->line_nr = line_nr;

	if (dso != NULL) {
		demangled = dso__demangle_sym(dso, 0, funcname);
		if (demangled == NULL) {
			ilist->funcname = funcname;
		} else {
			ilist->funcname = demangled;
			free(funcname);
		}
	}

	list_add_tail(&ilist->list, &node->val);

	return 0;
}

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

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 void inline_list__reverse(struct inline_node *node)
{
	struct inline_list *ilist, *n;

	list_for_each_entry_safe_reverse(ilist, n, &node->val, list)
		list_move_tail(&ilist->list, &node->val);
}

static int addr2line(const char *dso_name, u64 addr,
		     char **file, unsigned int *line, struct dso *dso,
		     bool unwind_inlines, struct inline_node *node)
{
	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 && unwind_inlines) {
		int cnt = 0;

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

			if (node != NULL) {
				if (inline_list__append(strdup(a2l->filename),
							strdup(a2l->funcname),
							a2l->line, node,
							dso) != 0)
					return 0;
			}
		}

		if ((node != NULL) &&
		    (callchain_param.order != ORDER_CALLEE)) {
			inline_list__reverse(node);
		}
	}

	if (a2l->found && a2l->filename) {
		*file = strdup(a2l->filename);
		*line = a2l->line;

		if (*file)
			ret = 1;
	}

	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)
{
	char *file = NULL;
	unsigned int line = 0;
	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;

	if (!addr2line(dso_name, addr, &file, &line, dso, TRUE, node))
		goto out_free_inline_node;

	if (list_empty(&node->val))
		goto out_free_inline_node;

	return node;

out_free_inline_node:
	inline_node__delete(node);
	return NULL;
}

#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)
{
	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)
{
	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) {
		if (filename_split(filename, &line_nr) != 1) {
			free(filename);
			goto out;
		}

		if (inline_list__append(filename, NULL, line_nr, node,
					NULL) != 0)
			goto out;

		filename = NULL;
	}

out:
	pclose(fp);

	if (list_empty(&node->val)) {
		inline_node__delete(node);
		return NULL;
	}

	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)
{
	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))
		goto out;

	if (asprintf(&srcline, "%s:%u",
				srcline_full_filename ? file : basename(file),
				line) < 0) {
		free(file);
		goto out;
	}

	dso->a2l_fails = 0;

	free(file);
	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 : "",
					addr - 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)
{
	return __get_srcline(dso, addr, sym, show_sym, show_addr, false);
}

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

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

	return addr2inlines(dso_name, addr, dso);
}

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);
		zfree(&ilist->filename);
		zfree(&ilist->funcname);
		free(ilist);
	}

	free(node);
}
Commit	Line	Data
f048d548 NK	1	#include <stdio.h>
	2	#include <stdlib.h>
	3	#include <string.h>
	4
	5	#include <linux/kernel.h>
	6
86c98cab	7	#include "util/dso.h"
f048d548 NK	8	#include "util/util.h"
f048d548 NK	9	#include "util/debug.h"
a64489c5	10	#include "util/callchain.h"
f048d548	11
85c116a6 AK	12	#include "symbol.h"
85c116a6 AK	13
a9710ba0 AK	14	bool srcline_full_filename;
a9710ba0 AK	15
5580338d JY	16	static const char dso__name(struct dso dso)
	17	{
	18	const char *dso_name;
	19
	20	if (dso->symsrc_filename)
	21	dso_name = dso->symsrc_filename;
	22	else
	23	dso_name = dso->long_name;
	24
	25	if (dso_name[0] == '[')
	26	return NULL;
	27
	28	if (!strncmp(dso_name, "/tmp/perf-", 10))
	29	return NULL;
	30
	31	return dso_name;
	32	}
	33
a64489c5 JY	34	static int inline_list__append(char filename, char funcname, int line_nr,
	35	struct inline_node node, struct dso dso)
	36	{
	37	struct inline_list *ilist;
	38	char *demangled;
	39
	40	ilist = zalloc(sizeof(*ilist));
	41	if (ilist == NULL)
	42	return -1;
	43
	44	ilist->filename = filename;
	45	ilist->line_nr = line_nr;
	46
	47	if (dso != NULL) {
	48	demangled = dso__demangle_sym(dso, 0, funcname);
	49	if (demangled == NULL) {
	50	ilist->funcname = funcname;
	51	} else {
	52	ilist->funcname = demangled;
	53	free(funcname);
	54	}
	55	}
	56
	57	list_add_tail(&ilist->list, &node->val);
	58
	59	return 0;
	60	}
	61
2f48fcd8 RV	62	#ifdef HAVE_LIBBFD_SUPPORT
	63
	64	/*
	65	* Implement addr2line using libbfd.
	66	*/
	67	#define PACKAGE "perf"
	68	#include <bfd.h>
	69
	70	struct a2l_data {
	71	const char *input;
ac931f87	72	u64 addr;
2f48fcd8 RV	73
	74	bool found;
	75	const char *filename;
	76	const char *funcname;
	77	unsigned line;
	78
	79	bfd *abfd;
	80	asymbol **syms;
	81	};
	82
	83	static int bfd_error(const char *string)
	84	{
	85	const char *errmsg;
	86
	87	errmsg = bfd_errmsg(bfd_get_error());
	88	fflush(stdout);
	89
	90	if (string)
	91	pr_debug("%s: %s\n", string, errmsg);
	92	else
	93	pr_debug("%s\n", errmsg);
	94
	95	return -1;
	96	}
	97
	98	static int slurp_symtab(bfd abfd, struct a2l_data a2l)
	99	{
	100	long storage;
	101	long symcount;
	102	asymbol **syms;
	103	bfd_boolean dynamic = FALSE;
	104
	105	if ((bfd_get_file_flags(abfd) & HAS_SYMS) == 0)
	106	return bfd_error(bfd_get_filename(abfd));
	107
	108	storage = bfd_get_symtab_upper_bound(abfd);
	109	if (storage == 0L) {
	110	storage = bfd_get_dynamic_symtab_upper_bound(abfd);
	111	dynamic = TRUE;
	112	}
	113	if (storage < 0L)
	114	return bfd_error(bfd_get_filename(abfd));
	115
	116	syms = malloc(storage);
	117	if (dynamic)
	118	symcount = bfd_canonicalize_dynamic_symtab(abfd, syms);
	119	else
	120	symcount = bfd_canonicalize_symtab(abfd, syms);
	121
	122	if (symcount < 0) {
	123	free(syms);
	124	return bfd_error(bfd_get_filename(abfd));
	125	}
	126
	127	a2l->syms = syms;
	128	return 0;
	129	}
	130
	131	static void find_address_in_section(bfd abfd, asection section, void *data)
	132	{
	133	bfd_vma pc, vma;
	134	bfd_size_type size;
	135	struct a2l_data *a2l = data;
	136
137	if (a2l->found)
138	return;
139
140	if ((bfd_get_section_flags(abfd, section) & SEC_ALLOC) == 0)
141	return;
142
143	pc = a2l->addr;
144	vma = bfd_get_section_vma(abfd, section);
145	size = bfd_get_section_size(section);
146
147	if (pc < vma \|\| pc >= vma + size)
148	return;
149
150	a2l->found = bfd_find_nearest_line(abfd, section, a2l->syms, pc - vma,
151	&a2l->filename, &a2l->funcname,
152	&a2l->line);
153	}
154
155	static struct a2l_data addr2line_init(const char path)
156	{
157	bfd *abfd;
158	struct a2l_data *a2l = NULL;
159
160	abfd = bfd_openr(path, NULL);
161	if (abfd == NULL)
162	return NULL;
163
164	if (!bfd_check_format(abfd, bfd_object))
165	goto out;
166
167	a2l = zalloc(sizeof(*a2l));
168	if (a2l == NULL)
169	goto out;
170
171	a2l->abfd = abfd;
172	a2l->input = strdup(path);
173	if (a2l->input == NULL)
174	goto out;
175
176	if (slurp_symtab(abfd, a2l))
177	goto out;
178
179	return a2l;
180
181	out:
182	if (a2l) {
7d16c634	183	zfree((char **)&a2l->input);
2f48fcd8 RV	184	free(a2l);
	185	}
	186	bfd_close(abfd);
	187	return NULL;
	188	}
	189
	190	static void addr2line_cleanup(struct a2l_data *a2l)
	191	{
	192	if (a2l->abfd)
	193	bfd_close(a2l->abfd);
7d16c634	194	zfree((char **)&a2l->input);
74cf249d	195	zfree(&a2l->syms);
2f48fcd8 RV	196	free(a2l);
	197	}
	198
2f84b42b AK	199	#define MAX_INLINE_NEST 1024
2f84b42b AK	200
a64489c5 JY	201	static void inline_list__reverse(struct inline_node *node)
	202	{
	203	struct inline_list ilist, n;
	204
	205	list_for_each_entry_safe_reverse(ilist, n, &node->val, list)
	206	list_move_tail(&ilist->list, &node->val);
	207	}
	208
ac931f87	209	static int addr2line(const char *dso_name, u64 addr,
2f84b42b	210	char *file, unsigned int line, struct dso *dso,
a64489c5	211	bool unwind_inlines, struct inline_node *node)
2f48fcd8 RV	212	{
2f48fcd8 RV	213	int ret = 0;
454ff00f AH	214	struct a2l_data *a2l = dso->a2l;
	215
	216	if (!a2l) {
	217	dso->a2l = addr2line_init(dso_name);
	218	a2l = dso->a2l;
	219	}
2f48fcd8	220
2f48fcd8 RV	221	if (a2l == NULL) {
	222	pr_warning("addr2line_init failed for %s\n", dso_name);
	223	return 0;
	224	}
	225
	226	a2l->addr = addr;
454ff00f AH	227	a2l->found = false;
454ff00f AH	228
2f48fcd8 RV	229	bfd_map_over_sections(a2l->abfd, find_address_in_section, a2l);
2f48fcd8 RV	230
2f84b42b AK	231	if (a2l->found && unwind_inlines) {
	232	int cnt = 0;
	233
	234	while (bfd_find_inliner_info(a2l->abfd, &a2l->filename,
	235	&a2l->funcname, &a2l->line) &&
a64489c5 JY	236	cnt++ < MAX_INLINE_NEST) {
	237
	238	if (node != NULL) {
	239	if (inline_list__append(strdup(a2l->filename),
	240	strdup(a2l->funcname),
	241	a2l->line, node,
	242	dso) != 0)
	243	return 0;
	244	}
	245	}
	246
	247	if ((node != NULL) &&
	248	(callchain_param.order != ORDER_CALLEE)) {
	249	inline_list__reverse(node);
	250	}
2f84b42b AK	251	}
2f84b42b AK	252
2f48fcd8 RV	253	if (a2l->found && a2l->filename) {
	254	*file = strdup(a2l->filename);
	255	*line = a2l->line;
	256
	257	if (*file)
	258	ret = 1;
	259	}
	260
2f48fcd8 RV	261	return ret;
	262	}
	263
454ff00f AH	264	void dso__free_a2l(struct dso *dso)
	265	{
	266	struct a2l_data *a2l = dso->a2l;
	267
	268	if (!a2l)
	269	return;
	270
	271	addr2line_cleanup(a2l);
	272
	273	dso->a2l = NULL;
	274	}
	275
a64489c5 JY	276	static struct inline_node addr2inlines(const char dso_name, u64 addr,
	277	struct dso *dso)
	278	{
	279	char *file = NULL;
	280	unsigned int line = 0;
	281	struct inline_node *node;
	282
	283	node = zalloc(sizeof(*node));
	284	if (node == NULL) {
	285	perror("not enough memory for the inline node");
	286	return NULL;
	287	}
	288
	289	INIT_LIST_HEAD(&node->val);
	290	node->addr = addr;
	291
	292	if (!addr2line(dso_name, addr, &file, &line, dso, TRUE, node))
	293	goto out_free_inline_node;
	294
	295	if (list_empty(&node->val))
	296	goto out_free_inline_node;
	297
	298	return node;
	299
	300	out_free_inline_node:
	301	inline_node__delete(node);
	302	return NULL;
	303	}
	304
2f48fcd8 RV	305	#else /* HAVE_LIBBFD_SUPPORT */
2f48fcd8 RV	306
5580338d JY	307	static int filename_split(char filename, unsigned int line_nr)
	308	{
	309	char *sep;
	310
	311	sep = strchr(filename, '\n');
	312	if (sep)
	313	*sep = '\0';
	314
	315	if (!strcmp(filename, "??:0"))
	316	return 0;
	317
	318	sep = strchr(filename, ':');
	319	if (sep) {
	320	*sep++ = '\0';
	321	*line_nr = strtoul(sep, NULL, 0);
	322	return 1;
	323	}
	324
	325	return 0;
	326	}
	327
ac931f87	328	static int addr2line(const char *dso_name, u64 addr,
454ff00f	329	char *file, unsigned int line_nr,
2f84b42b	330	struct dso *dso __maybe_unused,
a64489c5 JY	331	bool unwind_inlines __maybe_unused,
a64489c5 JY	332	struct inline_node *node __maybe_unused)
f048d548 NK	333	{
	334	FILE *fp;
	335	char cmd[PATH_MAX];
	336	char *filename = NULL;
	337	size_t len;
f048d548 NK	338	int ret = 0;
	339
	340	scnprintf(cmd, sizeof(cmd), "addr2line -e %s %016"PRIx64,
	341	dso_name, addr);
	342
	343	fp = popen(cmd, "r");
	344	if (fp == NULL) {
	345	pr_warning("popen failed for %s\n", dso_name);
	346	return 0;
	347	}
	348
	349	if (getline(&filename, &len, fp) < 0 \|\| !len) {
	350	pr_warning("addr2line has no output for %s\n", dso_name);
	351	goto out;
	352	}
	353
5580338d JY	354	ret = filename_split(filename, line_nr);
5580338d JY	355	if (ret != 1) {
f048d548 NK	356	free(filename);
	357	goto out;
	358	}
	359
5580338d JY	360	*file = filename;
5580338d JY	361
f048d548 NK	362	out:
	363	pclose(fp);
	364	return ret;
	365	}
454ff00f AH	366
	367	void dso__free_a2l(struct dso *dso __maybe_unused)
	368	{
	369	}
	370
a64489c5 JY	371	static struct inline_node addr2inlines(const char dso_name, u64 addr,
	372	struct dso *dso __maybe_unused)
	373	{
	374	FILE *fp;
	375	char cmd[PATH_MAX];
	376	struct inline_node *node;
	377	char *filename = NULL;
	378	size_t len;
	379	unsigned int line_nr = 0;
	380
	381	scnprintf(cmd, sizeof(cmd), "addr2line -e %s -i %016"PRIx64,
	382	dso_name, addr);
	383
	384	fp = popen(cmd, "r");
	385	if (fp == NULL) {
	386	pr_err("popen failed for %s\n", dso_name);
	387	return NULL;
	388	}
	389
	390	node = zalloc(sizeof(*node));
	391	if (node == NULL) {
	392	perror("not enough memory for the inline node");
	393	goto out;
	394	}
	395
	396	INIT_LIST_HEAD(&node->val);
	397	node->addr = addr;
	398
	399	while (getline(&filename, &len, fp) != -1) {
	400	if (filename_split(filename, &line_nr) != 1) {
	401	free(filename);
	402	goto out;
	403	}
	404
	405	if (inline_list__append(filename, NULL, line_nr, node,
	406	NULL) != 0)
	407	goto out;
	408
	409	filename = NULL;
	410	}
	411
	412	out:
	413	pclose(fp);
	414
	415	if (list_empty(&node->val)) {
	416	inline_node__delete(node);
	417	return NULL;
	418	}
	419
	420	return node;
	421	}
	422
2f48fcd8	423	#endif /* HAVE_LIBBFD_SUPPORT */
f048d548	424
906049c8 AH	425	/*
	426	* Number of addr2line failures (without success) before disabling it for that
	427	* dso.
	428	*/
	429	#define A2L_FAIL_LIMIT 123
	430
2f84b42b	431	char __get_srcline(struct dso dso, u64 addr, struct symbol *sym,
5dfa210e	432	bool show_sym, bool show_addr, bool unwind_inlines)
f048d548	433	{
a949fffb DA	434	char *file = NULL;
a949fffb DA	435	unsigned line = 0;
2cc9d0ef	436	char *srcline;
bf4414ae	437	const char *dso_name;
f048d548	438
2cc9d0ef	439	if (!dso->has_srcline)
23f0981b	440	goto out;
2cc9d0ef	441
5580338d JY	442	dso_name = dso__name(dso);
5580338d JY	443	if (dso_name == NULL)
58d91a00 NK	444	goto out;
58d91a00 NK	445
a64489c5	446	if (!addr2line(dso_name, addr, &file, &line, dso, unwind_inlines, NULL))
58d91a00	447	goto out;
f048d548	448
a9710ba0 AK	449	if (asprintf(&srcline, "%s:%u",
	450	srcline_full_filename ? file : basename(file),
	451	line) < 0) {
906049c8 AH	452	free(file);
	453	goto out;
	454	}
	455
	456	dso->a2l_fails = 0;
f048d548 NK	457
	458	free(file);
	459	return srcline;
2cc9d0ef NK	460
2cc9d0ef NK	461	out:
906049c8 AH	462	if (dso->a2l_fails && ++dso->a2l_fails > A2L_FAIL_LIMIT) {
	463	dso->has_srcline = 0;
	464	dso__free_a2l(dso);
	465	}
5dfa210e MW	466
	467	if (!show_addr)
	468	return (show_sym && sym) ?
	469	strndup(sym->name, sym->namelen) : NULL;
	470
85c116a6	471	if (sym) {
ac931f87	472	if (asprintf(&srcline, "%s+%" PRIu64, show_sym ? sym->name : "",
85c116a6 AK	473	addr - sym->start) < 0)
85c116a6 AK	474	return SRCLINE_UNKNOWN;
ac931f87	475	} else if (asprintf(&srcline, "%s[%" PRIx64 "]", dso->short_name, addr) < 0)
23f0981b AK	476	return SRCLINE_UNKNOWN;
23f0981b AK	477	return srcline;
f048d548 NK	478	}
	479
	480	void free_srcline(char *srcline)
	481	{
	482	if (srcline && strcmp(srcline, SRCLINE_UNKNOWN) != 0)
	483	free(srcline);
	484	}
2f84b42b AK	485
2f84b42b AK	486	char get_srcline(struct dso dso, u64 addr, struct symbol *sym,
5dfa210e	487	bool show_sym, bool show_addr)
2f84b42b	488	{
5dfa210e	489	return __get_srcline(dso, addr, sym, show_sym, show_addr, false);
2f84b42b	490	}
a64489c5 JY	491
	492	struct inline_node dso__parse_addr_inlines(struct dso dso, u64 addr)
	493	{
	494	const char *dso_name;
	495
	496	dso_name = dso__name(dso);
	497	if (dso_name == NULL)
	498	return NULL;
	499
	500	return addr2inlines(dso_name, addr, dso);
	501	}
	502
	503	void inline_node__delete(struct inline_node *node)
	504	{
	505	struct inline_list ilist, tmp;
	506
	507	list_for_each_entry_safe(ilist, tmp, &node->val, list) {
	508	list_del_init(&ilist->list);
	509	zfree(&ilist->filename);
	510	zfree(&ilist->funcname);
	511	free(ilist);
	512	}
	513
	514	free(node);
	515	}