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