Loading...
1/*
2 * Copyright (C) 2011, Red Hat Inc, Arnaldo Carvalho de Melo <acme@redhat.com>
3 *
4 * Parts came from builtin-annotate.c, see those files for further
5 * copyright notes.
6 *
7 * Released under the GPL v2. (and only v2, not any later version)
8 */
9
10#include "util.h"
11#include "ui/ui.h"
12#include "sort.h"
13#include "build-id.h"
14#include "color.h"
15#include "cache.h"
16#include "symbol.h"
17#include "debug.h"
18#include "annotate.h"
19#include "evsel.h"
20#include "block-range.h"
21#include "arch/common.h"
22#include <regex.h>
23#include <pthread.h>
24#include <linux/bitops.h>
25#include <sys/utsname.h>
26
27const char *disassembler_style;
28const char *objdump_path;
29static regex_t file_lineno;
30
31static struct ins_ops *ins__find(struct arch *arch, const char *name);
32static void ins__sort(struct arch *arch);
33static int disasm_line__parse(char *line, const char **namep, char **rawp);
34
35struct arch {
36 const char *name;
37 struct ins *instructions;
38 size_t nr_instructions;
39 size_t nr_instructions_allocated;
40 struct ins_ops *(*associate_instruction_ops)(struct arch *arch, const char *name);
41 bool sorted_instructions;
42 bool initialized;
43 void *priv;
44 int (*init)(struct arch *arch);
45 struct {
46 char comment_char;
47 char skip_functions_char;
48 } objdump;
49};
50
51static struct ins_ops call_ops;
52static struct ins_ops dec_ops;
53static struct ins_ops jump_ops;
54static struct ins_ops mov_ops;
55static struct ins_ops nop_ops;
56static struct ins_ops lock_ops;
57static struct ins_ops ret_ops;
58
59static int arch__grow_instructions(struct arch *arch)
60{
61 struct ins *new_instructions;
62 size_t new_nr_allocated;
63
64 if (arch->nr_instructions_allocated == 0 && arch->instructions)
65 goto grow_from_non_allocated_table;
66
67 new_nr_allocated = arch->nr_instructions_allocated + 128;
68 new_instructions = realloc(arch->instructions, new_nr_allocated * sizeof(struct ins));
69 if (new_instructions == NULL)
70 return -1;
71
72out_update_instructions:
73 arch->instructions = new_instructions;
74 arch->nr_instructions_allocated = new_nr_allocated;
75 return 0;
76
77grow_from_non_allocated_table:
78 new_nr_allocated = arch->nr_instructions + 128;
79 new_instructions = calloc(new_nr_allocated, sizeof(struct ins));
80 if (new_instructions == NULL)
81 return -1;
82
83 memcpy(new_instructions, arch->instructions, arch->nr_instructions);
84 goto out_update_instructions;
85}
86
87static int arch__associate_ins_ops(struct arch* arch, const char *name, struct ins_ops *ops)
88{
89 struct ins *ins;
90
91 if (arch->nr_instructions == arch->nr_instructions_allocated &&
92 arch__grow_instructions(arch))
93 return -1;
94
95 ins = &arch->instructions[arch->nr_instructions];
96 ins->name = strdup(name);
97 if (!ins->name)
98 return -1;
99
100 ins->ops = ops;
101 arch->nr_instructions++;
102
103 ins__sort(arch);
104 return 0;
105}
106
107#include "arch/arm/annotate/instructions.c"
108#include "arch/arm64/annotate/instructions.c"
109#include "arch/x86/annotate/instructions.c"
110#include "arch/powerpc/annotate/instructions.c"
111
112static struct arch architectures[] = {
113 {
114 .name = "arm",
115 .init = arm__annotate_init,
116 },
117 {
118 .name = "arm64",
119 .init = arm64__annotate_init,
120 },
121 {
122 .name = "x86",
123 .instructions = x86__instructions,
124 .nr_instructions = ARRAY_SIZE(x86__instructions),
125 .objdump = {
126 .comment_char = '#',
127 },
128 },
129 {
130 .name = "powerpc",
131 .init = powerpc__annotate_init,
132 },
133};
134
135static void ins__delete(struct ins_operands *ops)
136{
137 if (ops == NULL)
138 return;
139 zfree(&ops->source.raw);
140 zfree(&ops->source.name);
141 zfree(&ops->target.raw);
142 zfree(&ops->target.name);
143}
144
145static int ins__raw_scnprintf(struct ins *ins, char *bf, size_t size,
146 struct ins_operands *ops)
147{
148 return scnprintf(bf, size, "%-6.6s %s", ins->name, ops->raw);
149}
150
151int ins__scnprintf(struct ins *ins, char *bf, size_t size,
152 struct ins_operands *ops)
153{
154 if (ins->ops->scnprintf)
155 return ins->ops->scnprintf(ins, bf, size, ops);
156
157 return ins__raw_scnprintf(ins, bf, size, ops);
158}
159
160static int call__parse(struct arch *arch, struct ins_operands *ops, struct map *map)
161{
162 char *endptr, *tok, *name;
163
164 ops->target.addr = strtoull(ops->raw, &endptr, 16);
165
166 name = strchr(endptr, '<');
167 if (name == NULL)
168 goto indirect_call;
169
170 name++;
171
172 if (arch->objdump.skip_functions_char &&
173 strchr(name, arch->objdump.skip_functions_char))
174 return -1;
175
176 tok = strchr(name, '>');
177 if (tok == NULL)
178 return -1;
179
180 *tok = '\0';
181 ops->target.name = strdup(name);
182 *tok = '>';
183
184 return ops->target.name == NULL ? -1 : 0;
185
186indirect_call:
187 tok = strchr(endptr, '*');
188 if (tok == NULL) {
189 struct symbol *sym = map__find_symbol(map, map->map_ip(map, ops->target.addr));
190 if (sym != NULL)
191 ops->target.name = strdup(sym->name);
192 else
193 ops->target.addr = 0;
194 return 0;
195 }
196
197 ops->target.addr = strtoull(tok + 1, NULL, 16);
198 return 0;
199}
200
201static int call__scnprintf(struct ins *ins, char *bf, size_t size,
202 struct ins_operands *ops)
203{
204 if (ops->target.name)
205 return scnprintf(bf, size, "%-6.6s %s", ins->name, ops->target.name);
206
207 if (ops->target.addr == 0)
208 return ins__raw_scnprintf(ins, bf, size, ops);
209
210 return scnprintf(bf, size, "%-6.6s *%" PRIx64, ins->name, ops->target.addr);
211}
212
213static struct ins_ops call_ops = {
214 .parse = call__parse,
215 .scnprintf = call__scnprintf,
216};
217
218bool ins__is_call(const struct ins *ins)
219{
220 return ins->ops == &call_ops;
221}
222
223static int jump__parse(struct arch *arch __maybe_unused, struct ins_operands *ops, struct map *map __maybe_unused)
224{
225 const char *s = strchr(ops->raw, '+');
226 const char *c = strchr(ops->raw, ',');
227
228 if (c++ != NULL)
229 ops->target.addr = strtoull(c, NULL, 16);
230 else
231 ops->target.addr = strtoull(ops->raw, NULL, 16);
232
233 if (s++ != NULL) {
234 ops->target.offset = strtoull(s, NULL, 16);
235 ops->target.offset_avail = true;
236 } else {
237 ops->target.offset_avail = false;
238 }
239
240 return 0;
241}
242
243static int jump__scnprintf(struct ins *ins, char *bf, size_t size,
244 struct ins_operands *ops)
245{
246 if (!ops->target.addr || ops->target.offset < 0)
247 return ins__raw_scnprintf(ins, bf, size, ops);
248
249 return scnprintf(bf, size, "%-6.6s %" PRIx64, ins->name, ops->target.offset);
250}
251
252static struct ins_ops jump_ops = {
253 .parse = jump__parse,
254 .scnprintf = jump__scnprintf,
255};
256
257bool ins__is_jump(const struct ins *ins)
258{
259 return ins->ops == &jump_ops;
260}
261
262static int comment__symbol(char *raw, char *comment, u64 *addrp, char **namep)
263{
264 char *endptr, *name, *t;
265
266 if (strstr(raw, "(%rip)") == NULL)
267 return 0;
268
269 *addrp = strtoull(comment, &endptr, 16);
270 name = strchr(endptr, '<');
271 if (name == NULL)
272 return -1;
273
274 name++;
275
276 t = strchr(name, '>');
277 if (t == NULL)
278 return 0;
279
280 *t = '\0';
281 *namep = strdup(name);
282 *t = '>';
283
284 return 0;
285}
286
287static int lock__parse(struct arch *arch, struct ins_operands *ops, struct map *map)
288{
289 ops->locked.ops = zalloc(sizeof(*ops->locked.ops));
290 if (ops->locked.ops == NULL)
291 return 0;
292
293 if (disasm_line__parse(ops->raw, &ops->locked.ins.name, &ops->locked.ops->raw) < 0)
294 goto out_free_ops;
295
296 ops->locked.ins.ops = ins__find(arch, ops->locked.ins.name);
297
298 if (ops->locked.ins.ops == NULL)
299 goto out_free_ops;
300
301 if (ops->locked.ins.ops->parse &&
302 ops->locked.ins.ops->parse(arch, ops->locked.ops, map) < 0)
303 goto out_free_ops;
304
305 return 0;
306
307out_free_ops:
308 zfree(&ops->locked.ops);
309 return 0;
310}
311
312static int lock__scnprintf(struct ins *ins, char *bf, size_t size,
313 struct ins_operands *ops)
314{
315 int printed;
316
317 if (ops->locked.ins.ops == NULL)
318 return ins__raw_scnprintf(ins, bf, size, ops);
319
320 printed = scnprintf(bf, size, "%-6.6s ", ins->name);
321 return printed + ins__scnprintf(&ops->locked.ins, bf + printed,
322 size - printed, ops->locked.ops);
323}
324
325static void lock__delete(struct ins_operands *ops)
326{
327 struct ins *ins = &ops->locked.ins;
328
329 if (ins->ops && ins->ops->free)
330 ins->ops->free(ops->locked.ops);
331 else
332 ins__delete(ops->locked.ops);
333
334 zfree(&ops->locked.ops);
335 zfree(&ops->target.raw);
336 zfree(&ops->target.name);
337}
338
339static struct ins_ops lock_ops = {
340 .free = lock__delete,
341 .parse = lock__parse,
342 .scnprintf = lock__scnprintf,
343};
344
345static int mov__parse(struct arch *arch, struct ins_operands *ops, struct map *map __maybe_unused)
346{
347 char *s = strchr(ops->raw, ','), *target, *comment, prev;
348
349 if (s == NULL)
350 return -1;
351
352 *s = '\0';
353 ops->source.raw = strdup(ops->raw);
354 *s = ',';
355
356 if (ops->source.raw == NULL)
357 return -1;
358
359 target = ++s;
360 comment = strchr(s, arch->objdump.comment_char);
361
362 if (comment != NULL)
363 s = comment - 1;
364 else
365 s = strchr(s, '\0') - 1;
366
367 while (s > target && isspace(s[0]))
368 --s;
369 s++;
370 prev = *s;
371 *s = '\0';
372
373 ops->target.raw = strdup(target);
374 *s = prev;
375
376 if (ops->target.raw == NULL)
377 goto out_free_source;
378
379 if (comment == NULL)
380 return 0;
381
382 while (comment[0] != '\0' && isspace(comment[0]))
383 ++comment;
384
385 comment__symbol(ops->source.raw, comment, &ops->source.addr, &ops->source.name);
386 comment__symbol(ops->target.raw, comment, &ops->target.addr, &ops->target.name);
387
388 return 0;
389
390out_free_source:
391 zfree(&ops->source.raw);
392 return -1;
393}
394
395static int mov__scnprintf(struct ins *ins, char *bf, size_t size,
396 struct ins_operands *ops)
397{
398 return scnprintf(bf, size, "%-6.6s %s,%s", ins->name,
399 ops->source.name ?: ops->source.raw,
400 ops->target.name ?: ops->target.raw);
401}
402
403static struct ins_ops mov_ops = {
404 .parse = mov__parse,
405 .scnprintf = mov__scnprintf,
406};
407
408static int dec__parse(struct arch *arch __maybe_unused, struct ins_operands *ops, struct map *map __maybe_unused)
409{
410 char *target, *comment, *s, prev;
411
412 target = s = ops->raw;
413
414 while (s[0] != '\0' && !isspace(s[0]))
415 ++s;
416 prev = *s;
417 *s = '\0';
418
419 ops->target.raw = strdup(target);
420 *s = prev;
421
422 if (ops->target.raw == NULL)
423 return -1;
424
425 comment = strchr(s, arch->objdump.comment_char);
426 if (comment == NULL)
427 return 0;
428
429 while (comment[0] != '\0' && isspace(comment[0]))
430 ++comment;
431
432 comment__symbol(ops->target.raw, comment, &ops->target.addr, &ops->target.name);
433
434 return 0;
435}
436
437static int dec__scnprintf(struct ins *ins, char *bf, size_t size,
438 struct ins_operands *ops)
439{
440 return scnprintf(bf, size, "%-6.6s %s", ins->name,
441 ops->target.name ?: ops->target.raw);
442}
443
444static struct ins_ops dec_ops = {
445 .parse = dec__parse,
446 .scnprintf = dec__scnprintf,
447};
448
449static int nop__scnprintf(struct ins *ins __maybe_unused, char *bf, size_t size,
450 struct ins_operands *ops __maybe_unused)
451{
452 return scnprintf(bf, size, "%-6.6s", "nop");
453}
454
455static struct ins_ops nop_ops = {
456 .scnprintf = nop__scnprintf,
457};
458
459static struct ins_ops ret_ops = {
460 .scnprintf = ins__raw_scnprintf,
461};
462
463bool ins__is_ret(const struct ins *ins)
464{
465 return ins->ops == &ret_ops;
466}
467
468static int ins__key_cmp(const void *name, const void *insp)
469{
470 const struct ins *ins = insp;
471
472 return strcmp(name, ins->name);
473}
474
475static int ins__cmp(const void *a, const void *b)
476{
477 const struct ins *ia = a;
478 const struct ins *ib = b;
479
480 return strcmp(ia->name, ib->name);
481}
482
483static void ins__sort(struct arch *arch)
484{
485 const int nmemb = arch->nr_instructions;
486
487 qsort(arch->instructions, nmemb, sizeof(struct ins), ins__cmp);
488}
489
490static struct ins_ops *__ins__find(struct arch *arch, const char *name)
491{
492 struct ins *ins;
493 const int nmemb = arch->nr_instructions;
494
495 if (!arch->sorted_instructions) {
496 ins__sort(arch);
497 arch->sorted_instructions = true;
498 }
499
500 ins = bsearch(name, arch->instructions, nmemb, sizeof(struct ins), ins__key_cmp);
501 return ins ? ins->ops : NULL;
502}
503
504static struct ins_ops *ins__find(struct arch *arch, const char *name)
505{
506 struct ins_ops *ops = __ins__find(arch, name);
507
508 if (!ops && arch->associate_instruction_ops)
509 ops = arch->associate_instruction_ops(arch, name);
510
511 return ops;
512}
513
514static int arch__key_cmp(const void *name, const void *archp)
515{
516 const struct arch *arch = archp;
517
518 return strcmp(name, arch->name);
519}
520
521static int arch__cmp(const void *a, const void *b)
522{
523 const struct arch *aa = a;
524 const struct arch *ab = b;
525
526 return strcmp(aa->name, ab->name);
527}
528
529static void arch__sort(void)
530{
531 const int nmemb = ARRAY_SIZE(architectures);
532
533 qsort(architectures, nmemb, sizeof(struct arch), arch__cmp);
534}
535
536static struct arch *arch__find(const char *name)
537{
538 const int nmemb = ARRAY_SIZE(architectures);
539 static bool sorted;
540
541 if (!sorted) {
542 arch__sort();
543 sorted = true;
544 }
545
546 return bsearch(name, architectures, nmemb, sizeof(struct arch), arch__key_cmp);
547}
548
549int symbol__alloc_hist(struct symbol *sym)
550{
551 struct annotation *notes = symbol__annotation(sym);
552 const size_t size = symbol__size(sym);
553 size_t sizeof_sym_hist;
554
555 /* Check for overflow when calculating sizeof_sym_hist */
556 if (size > (SIZE_MAX - sizeof(struct sym_hist)) / sizeof(u64))
557 return -1;
558
559 sizeof_sym_hist = (sizeof(struct sym_hist) + size * sizeof(u64));
560
561 /* Check for overflow in zalloc argument */
562 if (sizeof_sym_hist > (SIZE_MAX - sizeof(*notes->src))
563 / symbol_conf.nr_events)
564 return -1;
565
566 notes->src = zalloc(sizeof(*notes->src) + symbol_conf.nr_events * sizeof_sym_hist);
567 if (notes->src == NULL)
568 return -1;
569 notes->src->sizeof_sym_hist = sizeof_sym_hist;
570 notes->src->nr_histograms = symbol_conf.nr_events;
571 INIT_LIST_HEAD(¬es->src->source);
572 return 0;
573}
574
575/* The cycles histogram is lazily allocated. */
576static int symbol__alloc_hist_cycles(struct symbol *sym)
577{
578 struct annotation *notes = symbol__annotation(sym);
579 const size_t size = symbol__size(sym);
580
581 notes->src->cycles_hist = calloc(size, sizeof(struct cyc_hist));
582 if (notes->src->cycles_hist == NULL)
583 return -1;
584 return 0;
585}
586
587void symbol__annotate_zero_histograms(struct symbol *sym)
588{
589 struct annotation *notes = symbol__annotation(sym);
590
591 pthread_mutex_lock(¬es->lock);
592 if (notes->src != NULL) {
593 memset(notes->src->histograms, 0,
594 notes->src->nr_histograms * notes->src->sizeof_sym_hist);
595 if (notes->src->cycles_hist)
596 memset(notes->src->cycles_hist, 0,
597 symbol__size(sym) * sizeof(struct cyc_hist));
598 }
599 pthread_mutex_unlock(¬es->lock);
600}
601
602static int __symbol__account_cycles(struct annotation *notes,
603 u64 start,
604 unsigned offset, unsigned cycles,
605 unsigned have_start)
606{
607 struct cyc_hist *ch;
608
609 ch = notes->src->cycles_hist;
610 /*
611 * For now we can only account one basic block per
612 * final jump. But multiple could be overlapping.
613 * Always account the longest one. So when
614 * a shorter one has been already seen throw it away.
615 *
616 * We separately always account the full cycles.
617 */
618 ch[offset].num_aggr++;
619 ch[offset].cycles_aggr += cycles;
620
621 if (!have_start && ch[offset].have_start)
622 return 0;
623 if (ch[offset].num) {
624 if (have_start && (!ch[offset].have_start ||
625 ch[offset].start > start)) {
626 ch[offset].have_start = 0;
627 ch[offset].cycles = 0;
628 ch[offset].num = 0;
629 if (ch[offset].reset < 0xffff)
630 ch[offset].reset++;
631 } else if (have_start &&
632 ch[offset].start < start)
633 return 0;
634 }
635 ch[offset].have_start = have_start;
636 ch[offset].start = start;
637 ch[offset].cycles += cycles;
638 ch[offset].num++;
639 return 0;
640}
641
642static int __symbol__inc_addr_samples(struct symbol *sym, struct map *map,
643 struct annotation *notes, int evidx, u64 addr)
644{
645 unsigned offset;
646 struct sym_hist *h;
647
648 pr_debug3("%s: addr=%#" PRIx64 "\n", __func__, map->unmap_ip(map, addr));
649
650 if ((addr < sym->start || addr >= sym->end) &&
651 (addr != sym->end || sym->start != sym->end)) {
652 pr_debug("%s(%d): ERANGE! sym->name=%s, start=%#" PRIx64 ", addr=%#" PRIx64 ", end=%#" PRIx64 "\n",
653 __func__, __LINE__, sym->name, sym->start, addr, sym->end);
654 return -ERANGE;
655 }
656
657 offset = addr - sym->start;
658 h = annotation__histogram(notes, evidx);
659 h->sum++;
660 h->addr[offset]++;
661
662 pr_debug3("%#" PRIx64 " %s: period++ [addr: %#" PRIx64 ", %#" PRIx64
663 ", evidx=%d] => %" PRIu64 "\n", sym->start, sym->name,
664 addr, addr - sym->start, evidx, h->addr[offset]);
665 return 0;
666}
667
668static struct annotation *symbol__get_annotation(struct symbol *sym, bool cycles)
669{
670 struct annotation *notes = symbol__annotation(sym);
671
672 if (notes->src == NULL) {
673 if (symbol__alloc_hist(sym) < 0)
674 return NULL;
675 }
676 if (!notes->src->cycles_hist && cycles) {
677 if (symbol__alloc_hist_cycles(sym) < 0)
678 return NULL;
679 }
680 return notes;
681}
682
683static int symbol__inc_addr_samples(struct symbol *sym, struct map *map,
684 int evidx, u64 addr)
685{
686 struct annotation *notes;
687
688 if (sym == NULL)
689 return 0;
690 notes = symbol__get_annotation(sym, false);
691 if (notes == NULL)
692 return -ENOMEM;
693 return __symbol__inc_addr_samples(sym, map, notes, evidx, addr);
694}
695
696static int symbol__account_cycles(u64 addr, u64 start,
697 struct symbol *sym, unsigned cycles)
698{
699 struct annotation *notes;
700 unsigned offset;
701
702 if (sym == NULL)
703 return 0;
704 notes = symbol__get_annotation(sym, true);
705 if (notes == NULL)
706 return -ENOMEM;
707 if (addr < sym->start || addr >= sym->end)
708 return -ERANGE;
709
710 if (start) {
711 if (start < sym->start || start >= sym->end)
712 return -ERANGE;
713 if (start >= addr)
714 start = 0;
715 }
716 offset = addr - sym->start;
717 return __symbol__account_cycles(notes,
718 start ? start - sym->start : 0,
719 offset, cycles,
720 !!start);
721}
722
723int addr_map_symbol__account_cycles(struct addr_map_symbol *ams,
724 struct addr_map_symbol *start,
725 unsigned cycles)
726{
727 u64 saddr = 0;
728 int err;
729
730 if (!cycles)
731 return 0;
732
733 /*
734 * Only set start when IPC can be computed. We can only
735 * compute it when the basic block is completely in a single
736 * function.
737 * Special case the case when the jump is elsewhere, but
738 * it starts on the function start.
739 */
740 if (start &&
741 (start->sym == ams->sym ||
742 (ams->sym &&
743 start->addr == ams->sym->start + ams->map->start)))
744 saddr = start->al_addr;
745 if (saddr == 0)
746 pr_debug2("BB with bad start: addr %"PRIx64" start %"PRIx64" sym %"PRIx64" saddr %"PRIx64"\n",
747 ams->addr,
748 start ? start->addr : 0,
749 ams->sym ? ams->sym->start + ams->map->start : 0,
750 saddr);
751 err = symbol__account_cycles(ams->al_addr, saddr, ams->sym, cycles);
752 if (err)
753 pr_debug2("account_cycles failed %d\n", err);
754 return err;
755}
756
757int addr_map_symbol__inc_samples(struct addr_map_symbol *ams, int evidx)
758{
759 return symbol__inc_addr_samples(ams->sym, ams->map, evidx, ams->al_addr);
760}
761
762int hist_entry__inc_addr_samples(struct hist_entry *he, int evidx, u64 ip)
763{
764 return symbol__inc_addr_samples(he->ms.sym, he->ms.map, evidx, ip);
765}
766
767static void disasm_line__init_ins(struct disasm_line *dl, struct arch *arch, struct map *map)
768{
769 dl->ins.ops = ins__find(arch, dl->ins.name);
770
771 if (!dl->ins.ops)
772 return;
773
774 if (dl->ins.ops->parse && dl->ins.ops->parse(arch, &dl->ops, map) < 0)
775 dl->ins.ops = NULL;
776}
777
778static int disasm_line__parse(char *line, const char **namep, char **rawp)
779{
780 char *name = line, tmp;
781
782 while (isspace(name[0]))
783 ++name;
784
785 if (name[0] == '\0')
786 return -1;
787
788 *rawp = name + 1;
789
790 while ((*rawp)[0] != '\0' && !isspace((*rawp)[0]))
791 ++*rawp;
792
793 tmp = (*rawp)[0];
794 (*rawp)[0] = '\0';
795 *namep = strdup(name);
796
797 if (*namep == NULL)
798 goto out_free_name;
799
800 (*rawp)[0] = tmp;
801
802 if ((*rawp)[0] != '\0') {
803 (*rawp)++;
804 while (isspace((*rawp)[0]))
805 ++(*rawp);
806 }
807
808 return 0;
809
810out_free_name:
811 free((void *)namep);
812 *namep = NULL;
813 return -1;
814}
815
816static struct disasm_line *disasm_line__new(s64 offset, char *line,
817 size_t privsize, int line_nr,
818 struct arch *arch,
819 struct map *map)
820{
821 struct disasm_line *dl = zalloc(sizeof(*dl) + privsize);
822
823 if (dl != NULL) {
824 dl->offset = offset;
825 dl->line = strdup(line);
826 dl->line_nr = line_nr;
827 if (dl->line == NULL)
828 goto out_delete;
829
830 if (offset != -1) {
831 if (disasm_line__parse(dl->line, &dl->ins.name, &dl->ops.raw) < 0)
832 goto out_free_line;
833
834 disasm_line__init_ins(dl, arch, map);
835 }
836 }
837
838 return dl;
839
840out_free_line:
841 zfree(&dl->line);
842out_delete:
843 free(dl);
844 return NULL;
845}
846
847void disasm_line__free(struct disasm_line *dl)
848{
849 zfree(&dl->line);
850 if (dl->ins.ops && dl->ins.ops->free)
851 dl->ins.ops->free(&dl->ops);
852 else
853 ins__delete(&dl->ops);
854 free((void *)dl->ins.name);
855 dl->ins.name = NULL;
856 free(dl);
857}
858
859int disasm_line__scnprintf(struct disasm_line *dl, char *bf, size_t size, bool raw)
860{
861 if (raw || !dl->ins.ops)
862 return scnprintf(bf, size, "%-6.6s %s", dl->ins.name, dl->ops.raw);
863
864 return ins__scnprintf(&dl->ins, bf, size, &dl->ops);
865}
866
867static void disasm__add(struct list_head *head, struct disasm_line *line)
868{
869 list_add_tail(&line->node, head);
870}
871
872struct disasm_line *disasm__get_next_ip_line(struct list_head *head, struct disasm_line *pos)
873{
874 list_for_each_entry_continue(pos, head, node)
875 if (pos->offset >= 0)
876 return pos;
877
878 return NULL;
879}
880
881double disasm__calc_percent(struct annotation *notes, int evidx, s64 offset,
882 s64 end, const char **path, u64 *nr_samples)
883{
884 struct source_line *src_line = notes->src->lines;
885 double percent = 0.0;
886 *nr_samples = 0;
887
888 if (src_line) {
889 size_t sizeof_src_line = sizeof(*src_line) +
890 sizeof(src_line->samples) * (src_line->nr_pcnt - 1);
891
892 while (offset < end) {
893 src_line = (void *)notes->src->lines +
894 (sizeof_src_line * offset);
895
896 if (*path == NULL)
897 *path = src_line->path;
898
899 percent += src_line->samples[evidx].percent;
900 *nr_samples += src_line->samples[evidx].nr;
901 offset++;
902 }
903 } else {
904 struct sym_hist *h = annotation__histogram(notes, evidx);
905 unsigned int hits = 0;
906
907 while (offset < end)
908 hits += h->addr[offset++];
909
910 if (h->sum) {
911 *nr_samples = hits;
912 percent = 100.0 * hits / h->sum;
913 }
914 }
915
916 return percent;
917}
918
919static const char *annotate__address_color(struct block_range *br)
920{
921 double cov = block_range__coverage(br);
922
923 if (cov >= 0) {
924 /* mark red for >75% coverage */
925 if (cov > 0.75)
926 return PERF_COLOR_RED;
927
928 /* mark dull for <1% coverage */
929 if (cov < 0.01)
930 return PERF_COLOR_NORMAL;
931 }
932
933 return PERF_COLOR_MAGENTA;
934}
935
936static const char *annotate__asm_color(struct block_range *br)
937{
938 double cov = block_range__coverage(br);
939
940 if (cov >= 0) {
941 /* mark dull for <1% coverage */
942 if (cov < 0.01)
943 return PERF_COLOR_NORMAL;
944 }
945
946 return PERF_COLOR_BLUE;
947}
948
949static void annotate__branch_printf(struct block_range *br, u64 addr)
950{
951 bool emit_comment = true;
952
953 if (!br)
954 return;
955
956#if 1
957 if (br->is_target && br->start == addr) {
958 struct block_range *branch = br;
959 double p;
960
961 /*
962 * Find matching branch to our target.
963 */
964 while (!branch->is_branch)
965 branch = block_range__next(branch);
966
967 p = 100 *(double)br->entry / branch->coverage;
968
969 if (p > 0.1) {
970 if (emit_comment) {
971 emit_comment = false;
972 printf("\t#");
973 }
974
975 /*
976 * The percentage of coverage joined at this target in relation
977 * to the next branch.
978 */
979 printf(" +%.2f%%", p);
980 }
981 }
982#endif
983 if (br->is_branch && br->end == addr) {
984 double p = 100*(double)br->taken / br->coverage;
985
986 if (p > 0.1) {
987 if (emit_comment) {
988 emit_comment = false;
989 printf("\t#");
990 }
991
992 /*
993 * The percentage of coverage leaving at this branch, and
994 * its prediction ratio.
995 */
996 printf(" -%.2f%% (p:%.2f%%)", p, 100*(double)br->pred / br->taken);
997 }
998 }
999}
1000
1001
1002static int disasm_line__print(struct disasm_line *dl, struct symbol *sym, u64 start,
1003 struct perf_evsel *evsel, u64 len, int min_pcnt, int printed,
1004 int max_lines, struct disasm_line *queue)
1005{
1006 static const char *prev_line;
1007 static const char *prev_color;
1008
1009 if (dl->offset != -1) {
1010 const char *path = NULL;
1011 u64 nr_samples;
1012 double percent, max_percent = 0.0;
1013 double *ppercents = &percent;
1014 u64 *psamples = &nr_samples;
1015 int i, nr_percent = 1;
1016 const char *color;
1017 struct annotation *notes = symbol__annotation(sym);
1018 s64 offset = dl->offset;
1019 const u64 addr = start + offset;
1020 struct disasm_line *next;
1021 struct block_range *br;
1022
1023 next = disasm__get_next_ip_line(¬es->src->source, dl);
1024
1025 if (perf_evsel__is_group_event(evsel)) {
1026 nr_percent = evsel->nr_members;
1027 ppercents = calloc(nr_percent, sizeof(double));
1028 psamples = calloc(nr_percent, sizeof(u64));
1029 if (ppercents == NULL || psamples == NULL) {
1030 return -1;
1031 }
1032 }
1033
1034 for (i = 0; i < nr_percent; i++) {
1035 percent = disasm__calc_percent(notes,
1036 notes->src->lines ? i : evsel->idx + i,
1037 offset,
1038 next ? next->offset : (s64) len,
1039 &path, &nr_samples);
1040
1041 ppercents[i] = percent;
1042 psamples[i] = nr_samples;
1043 if (percent > max_percent)
1044 max_percent = percent;
1045 }
1046
1047 if (max_percent < min_pcnt)
1048 return -1;
1049
1050 if (max_lines && printed >= max_lines)
1051 return 1;
1052
1053 if (queue != NULL) {
1054 list_for_each_entry_from(queue, ¬es->src->source, node) {
1055 if (queue == dl)
1056 break;
1057 disasm_line__print(queue, sym, start, evsel, len,
1058 0, 0, 1, NULL);
1059 }
1060 }
1061
1062 color = get_percent_color(max_percent);
1063
1064 /*
1065 * Also color the filename and line if needed, with
1066 * the same color than the percentage. Don't print it
1067 * twice for close colored addr with the same filename:line
1068 */
1069 if (path) {
1070 if (!prev_line || strcmp(prev_line, path)
1071 || color != prev_color) {
1072 color_fprintf(stdout, color, " %s", path);
1073 prev_line = path;
1074 prev_color = color;
1075 }
1076 }
1077
1078 for (i = 0; i < nr_percent; i++) {
1079 percent = ppercents[i];
1080 nr_samples = psamples[i];
1081 color = get_percent_color(percent);
1082
1083 if (symbol_conf.show_total_period)
1084 color_fprintf(stdout, color, " %7" PRIu64,
1085 nr_samples);
1086 else
1087 color_fprintf(stdout, color, " %7.2f", percent);
1088 }
1089
1090 printf(" : ");
1091
1092 br = block_range__find(addr);
1093 color_fprintf(stdout, annotate__address_color(br), " %" PRIx64 ":", addr);
1094 color_fprintf(stdout, annotate__asm_color(br), "%s", dl->line);
1095 annotate__branch_printf(br, addr);
1096 printf("\n");
1097
1098 if (ppercents != &percent)
1099 free(ppercents);
1100
1101 if (psamples != &nr_samples)
1102 free(psamples);
1103
1104 } else if (max_lines && printed >= max_lines)
1105 return 1;
1106 else {
1107 int width = 8;
1108
1109 if (queue)
1110 return -1;
1111
1112 if (perf_evsel__is_group_event(evsel))
1113 width *= evsel->nr_members;
1114
1115 if (!*dl->line)
1116 printf(" %*s:\n", width, " ");
1117 else
1118 printf(" %*s: %s\n", width, " ", dl->line);
1119 }
1120
1121 return 0;
1122}
1123
1124/*
1125 * symbol__parse_objdump_line() parses objdump output (with -d --no-show-raw)
1126 * which looks like following
1127 *
1128 * 0000000000415500 <_init>:
1129 * 415500: sub $0x8,%rsp
1130 * 415504: mov 0x2f5ad5(%rip),%rax # 70afe0 <_DYNAMIC+0x2f8>
1131 * 41550b: test %rax,%rax
1132 * 41550e: je 415515 <_init+0x15>
1133 * 415510: callq 416e70 <__gmon_start__@plt>
1134 * 415515: add $0x8,%rsp
1135 * 415519: retq
1136 *
1137 * it will be parsed and saved into struct disasm_line as
1138 * <offset> <name> <ops.raw>
1139 *
1140 * The offset will be a relative offset from the start of the symbol and -1
1141 * means that it's not a disassembly line so should be treated differently.
1142 * The ops.raw part will be parsed further according to type of the instruction.
1143 */
1144static int symbol__parse_objdump_line(struct symbol *sym, struct map *map,
1145 struct arch *arch,
1146 FILE *file, size_t privsize,
1147 int *line_nr)
1148{
1149 struct annotation *notes = symbol__annotation(sym);
1150 struct disasm_line *dl;
1151 char *line = NULL, *parsed_line, *tmp, *tmp2, *c;
1152 size_t line_len;
1153 s64 line_ip, offset = -1;
1154 regmatch_t match[2];
1155
1156 if (getline(&line, &line_len, file) < 0)
1157 return -1;
1158
1159 if (!line)
1160 return -1;
1161
1162 while (line_len != 0 && isspace(line[line_len - 1]))
1163 line[--line_len] = '\0';
1164
1165 c = strchr(line, '\n');
1166 if (c)
1167 *c = 0;
1168
1169 line_ip = -1;
1170 parsed_line = line;
1171
1172 /* /filename:linenr ? Save line number and ignore. */
1173 if (regexec(&file_lineno, line, 2, match, 0) == 0) {
1174 *line_nr = atoi(line + match[1].rm_so);
1175 return 0;
1176 }
1177
1178 /*
1179 * Strip leading spaces:
1180 */
1181 tmp = line;
1182 while (*tmp) {
1183 if (*tmp != ' ')
1184 break;
1185 tmp++;
1186 }
1187
1188 if (*tmp) {
1189 /*
1190 * Parse hexa addresses followed by ':'
1191 */
1192 line_ip = strtoull(tmp, &tmp2, 16);
1193 if (*tmp2 != ':' || tmp == tmp2 || tmp2[1] == '\0')
1194 line_ip = -1;
1195 }
1196
1197 if (line_ip != -1) {
1198 u64 start = map__rip_2objdump(map, sym->start),
1199 end = map__rip_2objdump(map, sym->end);
1200
1201 offset = line_ip - start;
1202 if ((u64)line_ip < start || (u64)line_ip >= end)
1203 offset = -1;
1204 else
1205 parsed_line = tmp2 + 1;
1206 }
1207
1208 dl = disasm_line__new(offset, parsed_line, privsize, *line_nr, arch, map);
1209 free(line);
1210 (*line_nr)++;
1211
1212 if (dl == NULL)
1213 return -1;
1214
1215 if (!disasm_line__has_offset(dl)) {
1216 dl->ops.target.offset = dl->ops.target.addr -
1217 map__rip_2objdump(map, sym->start);
1218 dl->ops.target.offset_avail = true;
1219 }
1220
1221 /* kcore has no symbols, so add the call target name */
1222 if (dl->ins.ops && ins__is_call(&dl->ins) && !dl->ops.target.name) {
1223 struct addr_map_symbol target = {
1224 .map = map,
1225 .addr = dl->ops.target.addr,
1226 };
1227
1228 if (!map_groups__find_ams(&target) &&
1229 target.sym->start == target.al_addr)
1230 dl->ops.target.name = strdup(target.sym->name);
1231 }
1232
1233 disasm__add(¬es->src->source, dl);
1234
1235 return 0;
1236}
1237
1238static __attribute__((constructor)) void symbol__init_regexpr(void)
1239{
1240 regcomp(&file_lineno, "^/[^:]+:([0-9]+)", REG_EXTENDED);
1241}
1242
1243static void delete_last_nop(struct symbol *sym)
1244{
1245 struct annotation *notes = symbol__annotation(sym);
1246 struct list_head *list = ¬es->src->source;
1247 struct disasm_line *dl;
1248
1249 while (!list_empty(list)) {
1250 dl = list_entry(list->prev, struct disasm_line, node);
1251
1252 if (dl->ins.ops) {
1253 if (dl->ins.ops != &nop_ops)
1254 return;
1255 } else {
1256 if (!strstr(dl->line, " nop ") &&
1257 !strstr(dl->line, " nopl ") &&
1258 !strstr(dl->line, " nopw "))
1259 return;
1260 }
1261
1262 list_del(&dl->node);
1263 disasm_line__free(dl);
1264 }
1265}
1266
1267int symbol__strerror_disassemble(struct symbol *sym __maybe_unused, struct map *map,
1268 int errnum, char *buf, size_t buflen)
1269{
1270 struct dso *dso = map->dso;
1271
1272 BUG_ON(buflen == 0);
1273
1274 if (errnum >= 0) {
1275 str_error_r(errnum, buf, buflen);
1276 return 0;
1277 }
1278
1279 switch (errnum) {
1280 case SYMBOL_ANNOTATE_ERRNO__NO_VMLINUX: {
1281 char bf[SBUILD_ID_SIZE + 15] = " with build id ";
1282 char *build_id_msg = NULL;
1283
1284 if (dso->has_build_id) {
1285 build_id__sprintf(dso->build_id,
1286 sizeof(dso->build_id), bf + 15);
1287 build_id_msg = bf;
1288 }
1289 scnprintf(buf, buflen,
1290 "No vmlinux file%s\nwas found in the path.\n\n"
1291 "Note that annotation using /proc/kcore requires CAP_SYS_RAWIO capability.\n\n"
1292 "Please use:\n\n"
1293 " perf buildid-cache -vu vmlinux\n\n"
1294 "or:\n\n"
1295 " --vmlinux vmlinux\n", build_id_msg ?: "");
1296 }
1297 break;
1298 default:
1299 scnprintf(buf, buflen, "Internal error: Invalid %d error code\n", errnum);
1300 break;
1301 }
1302
1303 return 0;
1304}
1305
1306static int dso__disassemble_filename(struct dso *dso, char *filename, size_t filename_size)
1307{
1308 char linkname[PATH_MAX];
1309 char *build_id_filename;
1310
1311 if (dso->symtab_type == DSO_BINARY_TYPE__KALLSYMS &&
1312 !dso__is_kcore(dso))
1313 return SYMBOL_ANNOTATE_ERRNO__NO_VMLINUX;
1314
1315 build_id_filename = dso__build_id_filename(dso, NULL, 0);
1316 if (build_id_filename) {
1317 __symbol__join_symfs(filename, filename_size, build_id_filename);
1318 free(build_id_filename);
1319 } else {
1320 if (dso->has_build_id)
1321 return ENOMEM;
1322 goto fallback;
1323 }
1324
1325 if (dso__is_kcore(dso) ||
1326 readlink(filename, linkname, sizeof(linkname)) < 0 ||
1327 strstr(linkname, DSO__NAME_KALLSYMS) ||
1328 access(filename, R_OK)) {
1329fallback:
1330 /*
1331 * If we don't have build-ids or the build-id file isn't in the
1332 * cache, or is just a kallsyms file, well, lets hope that this
1333 * DSO is the same as when 'perf record' ran.
1334 */
1335 __symbol__join_symfs(filename, filename_size, dso->long_name);
1336 }
1337
1338 return 0;
1339}
1340
1341static const char *annotate__norm_arch(const char *arch_name)
1342{
1343 struct utsname uts;
1344
1345 if (!arch_name) { /* Assume we are annotating locally. */
1346 if (uname(&uts) < 0)
1347 return NULL;
1348 arch_name = uts.machine;
1349 }
1350 return normalize_arch((char *)arch_name);
1351}
1352
1353int symbol__disassemble(struct symbol *sym, struct map *map, const char *arch_name, size_t privsize)
1354{
1355 struct dso *dso = map->dso;
1356 char command[PATH_MAX * 2];
1357 struct arch *arch = NULL;
1358 FILE *file;
1359 char symfs_filename[PATH_MAX];
1360 struct kcore_extract kce;
1361 bool delete_extract = false;
1362 int stdout_fd[2];
1363 int lineno = 0;
1364 int nline;
1365 pid_t pid;
1366 int err = dso__disassemble_filename(dso, symfs_filename, sizeof(symfs_filename));
1367
1368 if (err)
1369 return err;
1370
1371 arch_name = annotate__norm_arch(arch_name);
1372 if (!arch_name)
1373 return -1;
1374
1375 arch = arch__find(arch_name);
1376 if (arch == NULL)
1377 return -ENOTSUP;
1378
1379 if (arch->init) {
1380 err = arch->init(arch);
1381 if (err) {
1382 pr_err("%s: failed to initialize %s arch priv area\n", __func__, arch->name);
1383 return err;
1384 }
1385 }
1386
1387 pr_debug("%s: filename=%s, sym=%s, start=%#" PRIx64 ", end=%#" PRIx64 "\n", __func__,
1388 symfs_filename, sym->name, map->unmap_ip(map, sym->start),
1389 map->unmap_ip(map, sym->end));
1390
1391 pr_debug("annotating [%p] %30s : [%p] %30s\n",
1392 dso, dso->long_name, sym, sym->name);
1393
1394 if (dso__is_kcore(dso)) {
1395 kce.kcore_filename = symfs_filename;
1396 kce.addr = map__rip_2objdump(map, sym->start);
1397 kce.offs = sym->start;
1398 kce.len = sym->end - sym->start;
1399 if (!kcore_extract__create(&kce)) {
1400 delete_extract = true;
1401 strlcpy(symfs_filename, kce.extract_filename,
1402 sizeof(symfs_filename));
1403 }
1404 } else if (dso__needs_decompress(dso)) {
1405 char tmp[PATH_MAX];
1406 struct kmod_path m;
1407 int fd;
1408 bool ret;
1409
1410 if (kmod_path__parse_ext(&m, symfs_filename))
1411 goto out;
1412
1413 snprintf(tmp, PATH_MAX, "/tmp/perf-kmod-XXXXXX");
1414
1415 fd = mkstemp(tmp);
1416 if (fd < 0) {
1417 free(m.ext);
1418 goto out;
1419 }
1420
1421 ret = decompress_to_file(m.ext, symfs_filename, fd);
1422
1423 if (ret)
1424 pr_err("Cannot decompress %s %s\n", m.ext, symfs_filename);
1425
1426 free(m.ext);
1427 close(fd);
1428
1429 if (!ret)
1430 goto out;
1431
1432 strcpy(symfs_filename, tmp);
1433 }
1434
1435 snprintf(command, sizeof(command),
1436 "%s %s%s --start-address=0x%016" PRIx64
1437 " --stop-address=0x%016" PRIx64
1438 " -l -d %s %s -C %s 2>/dev/null|grep -v %s|expand",
1439 objdump_path ? objdump_path : "objdump",
1440 disassembler_style ? "-M " : "",
1441 disassembler_style ? disassembler_style : "",
1442 map__rip_2objdump(map, sym->start),
1443 map__rip_2objdump(map, sym->end),
1444 symbol_conf.annotate_asm_raw ? "" : "--no-show-raw",
1445 symbol_conf.annotate_src ? "-S" : "",
1446 symfs_filename, symfs_filename);
1447
1448 pr_debug("Executing: %s\n", command);
1449
1450 err = -1;
1451 if (pipe(stdout_fd) < 0) {
1452 pr_err("Failure creating the pipe to run %s\n", command);
1453 goto out_remove_tmp;
1454 }
1455
1456 pid = fork();
1457 if (pid < 0) {
1458 pr_err("Failure forking to run %s\n", command);
1459 goto out_close_stdout;
1460 }
1461
1462 if (pid == 0) {
1463 close(stdout_fd[0]);
1464 dup2(stdout_fd[1], 1);
1465 close(stdout_fd[1]);
1466 execl("/bin/sh", "sh", "-c", command, NULL);
1467 perror(command);
1468 exit(-1);
1469 }
1470
1471 close(stdout_fd[1]);
1472
1473 file = fdopen(stdout_fd[0], "r");
1474 if (!file) {
1475 pr_err("Failure creating FILE stream for %s\n", command);
1476 /*
1477 * If we were using debug info should retry with
1478 * original binary.
1479 */
1480 goto out_remove_tmp;
1481 }
1482
1483 nline = 0;
1484 while (!feof(file)) {
1485 if (symbol__parse_objdump_line(sym, map, arch, file, privsize,
1486 &lineno) < 0)
1487 break;
1488 nline++;
1489 }
1490
1491 if (nline == 0)
1492 pr_err("No output from %s\n", command);
1493
1494 /*
1495 * kallsyms does not have symbol sizes so there may a nop at the end.
1496 * Remove it.
1497 */
1498 if (dso__is_kcore(dso))
1499 delete_last_nop(sym);
1500
1501 fclose(file);
1502 err = 0;
1503out_remove_tmp:
1504 close(stdout_fd[0]);
1505
1506 if (dso__needs_decompress(dso))
1507 unlink(symfs_filename);
1508
1509 if (delete_extract)
1510 kcore_extract__delete(&kce);
1511out:
1512 return err;
1513
1514out_close_stdout:
1515 close(stdout_fd[1]);
1516 goto out_remove_tmp;
1517}
1518
1519static void insert_source_line(struct rb_root *root, struct source_line *src_line)
1520{
1521 struct source_line *iter;
1522 struct rb_node **p = &root->rb_node;
1523 struct rb_node *parent = NULL;
1524 int i, ret;
1525
1526 while (*p != NULL) {
1527 parent = *p;
1528 iter = rb_entry(parent, struct source_line, node);
1529
1530 ret = strcmp(iter->path, src_line->path);
1531 if (ret == 0) {
1532 for (i = 0; i < src_line->nr_pcnt; i++)
1533 iter->samples[i].percent_sum += src_line->samples[i].percent;
1534 return;
1535 }
1536
1537 if (ret < 0)
1538 p = &(*p)->rb_left;
1539 else
1540 p = &(*p)->rb_right;
1541 }
1542
1543 for (i = 0; i < src_line->nr_pcnt; i++)
1544 src_line->samples[i].percent_sum = src_line->samples[i].percent;
1545
1546 rb_link_node(&src_line->node, parent, p);
1547 rb_insert_color(&src_line->node, root);
1548}
1549
1550static int cmp_source_line(struct source_line *a, struct source_line *b)
1551{
1552 int i;
1553
1554 for (i = 0; i < a->nr_pcnt; i++) {
1555 if (a->samples[i].percent_sum == b->samples[i].percent_sum)
1556 continue;
1557 return a->samples[i].percent_sum > b->samples[i].percent_sum;
1558 }
1559
1560 return 0;
1561}
1562
1563static void __resort_source_line(struct rb_root *root, struct source_line *src_line)
1564{
1565 struct source_line *iter;
1566 struct rb_node **p = &root->rb_node;
1567 struct rb_node *parent = NULL;
1568
1569 while (*p != NULL) {
1570 parent = *p;
1571 iter = rb_entry(parent, struct source_line, node);
1572
1573 if (cmp_source_line(src_line, iter))
1574 p = &(*p)->rb_left;
1575 else
1576 p = &(*p)->rb_right;
1577 }
1578
1579 rb_link_node(&src_line->node, parent, p);
1580 rb_insert_color(&src_line->node, root);
1581}
1582
1583static void resort_source_line(struct rb_root *dest_root, struct rb_root *src_root)
1584{
1585 struct source_line *src_line;
1586 struct rb_node *node;
1587
1588 node = rb_first(src_root);
1589 while (node) {
1590 struct rb_node *next;
1591
1592 src_line = rb_entry(node, struct source_line, node);
1593 next = rb_next(node);
1594 rb_erase(node, src_root);
1595
1596 __resort_source_line(dest_root, src_line);
1597 node = next;
1598 }
1599}
1600
1601static void symbol__free_source_line(struct symbol *sym, int len)
1602{
1603 struct annotation *notes = symbol__annotation(sym);
1604 struct source_line *src_line = notes->src->lines;
1605 size_t sizeof_src_line;
1606 int i;
1607
1608 sizeof_src_line = sizeof(*src_line) +
1609 (sizeof(src_line->samples) * (src_line->nr_pcnt - 1));
1610
1611 for (i = 0; i < len; i++) {
1612 free_srcline(src_line->path);
1613 src_line = (void *)src_line + sizeof_src_line;
1614 }
1615
1616 zfree(¬es->src->lines);
1617}
1618
1619/* Get the filename:line for the colored entries */
1620static int symbol__get_source_line(struct symbol *sym, struct map *map,
1621 struct perf_evsel *evsel,
1622 struct rb_root *root, int len)
1623{
1624 u64 start;
1625 int i, k;
1626 int evidx = evsel->idx;
1627 struct source_line *src_line;
1628 struct annotation *notes = symbol__annotation(sym);
1629 struct sym_hist *h = annotation__histogram(notes, evidx);
1630 struct rb_root tmp_root = RB_ROOT;
1631 int nr_pcnt = 1;
1632 u64 h_sum = h->sum;
1633 size_t sizeof_src_line = sizeof(struct source_line);
1634
1635 if (perf_evsel__is_group_event(evsel)) {
1636 for (i = 1; i < evsel->nr_members; i++) {
1637 h = annotation__histogram(notes, evidx + i);
1638 h_sum += h->sum;
1639 }
1640 nr_pcnt = evsel->nr_members;
1641 sizeof_src_line += (nr_pcnt - 1) * sizeof(src_line->samples);
1642 }
1643
1644 if (!h_sum)
1645 return 0;
1646
1647 src_line = notes->src->lines = calloc(len, sizeof_src_line);
1648 if (!notes->src->lines)
1649 return -1;
1650
1651 start = map__rip_2objdump(map, sym->start);
1652
1653 for (i = 0; i < len; i++) {
1654 u64 offset;
1655 double percent_max = 0.0;
1656
1657 src_line->nr_pcnt = nr_pcnt;
1658
1659 for (k = 0; k < nr_pcnt; k++) {
1660 h = annotation__histogram(notes, evidx + k);
1661 src_line->samples[k].percent = 100.0 * h->addr[i] / h->sum;
1662
1663 if (src_line->samples[k].percent > percent_max)
1664 percent_max = src_line->samples[k].percent;
1665 }
1666
1667 if (percent_max <= 0.5)
1668 goto next;
1669
1670 offset = start + i;
1671 src_line->path = get_srcline(map->dso, offset, NULL, false);
1672 insert_source_line(&tmp_root, src_line);
1673
1674 next:
1675 src_line = (void *)src_line + sizeof_src_line;
1676 }
1677
1678 resort_source_line(root, &tmp_root);
1679 return 0;
1680}
1681
1682static void print_summary(struct rb_root *root, const char *filename)
1683{
1684 struct source_line *src_line;
1685 struct rb_node *node;
1686
1687 printf("\nSorted summary for file %s\n", filename);
1688 printf("----------------------------------------------\n\n");
1689
1690 if (RB_EMPTY_ROOT(root)) {
1691 printf(" Nothing higher than %1.1f%%\n", MIN_GREEN);
1692 return;
1693 }
1694
1695 node = rb_first(root);
1696 while (node) {
1697 double percent, percent_max = 0.0;
1698 const char *color;
1699 char *path;
1700 int i;
1701
1702 src_line = rb_entry(node, struct source_line, node);
1703 for (i = 0; i < src_line->nr_pcnt; i++) {
1704 percent = src_line->samples[i].percent_sum;
1705 color = get_percent_color(percent);
1706 color_fprintf(stdout, color, " %7.2f", percent);
1707
1708 if (percent > percent_max)
1709 percent_max = percent;
1710 }
1711
1712 path = src_line->path;
1713 color = get_percent_color(percent_max);
1714 color_fprintf(stdout, color, " %s\n", path);
1715
1716 node = rb_next(node);
1717 }
1718}
1719
1720static void symbol__annotate_hits(struct symbol *sym, struct perf_evsel *evsel)
1721{
1722 struct annotation *notes = symbol__annotation(sym);
1723 struct sym_hist *h = annotation__histogram(notes, evsel->idx);
1724 u64 len = symbol__size(sym), offset;
1725
1726 for (offset = 0; offset < len; ++offset)
1727 if (h->addr[offset] != 0)
1728 printf("%*" PRIx64 ": %" PRIu64 "\n", BITS_PER_LONG / 2,
1729 sym->start + offset, h->addr[offset]);
1730 printf("%*s: %" PRIu64 "\n", BITS_PER_LONG / 2, "h->sum", h->sum);
1731}
1732
1733int symbol__annotate_printf(struct symbol *sym, struct map *map,
1734 struct perf_evsel *evsel, bool full_paths,
1735 int min_pcnt, int max_lines, int context)
1736{
1737 struct dso *dso = map->dso;
1738 char *filename;
1739 const char *d_filename;
1740 const char *evsel_name = perf_evsel__name(evsel);
1741 struct annotation *notes = symbol__annotation(sym);
1742 struct sym_hist *h = annotation__histogram(notes, evsel->idx);
1743 struct disasm_line *pos, *queue = NULL;
1744 u64 start = map__rip_2objdump(map, sym->start);
1745 int printed = 2, queue_len = 0;
1746 int more = 0;
1747 u64 len;
1748 int width = 8;
1749 int graph_dotted_len;
1750
1751 filename = strdup(dso->long_name);
1752 if (!filename)
1753 return -ENOMEM;
1754
1755 if (full_paths)
1756 d_filename = filename;
1757 else
1758 d_filename = basename(filename);
1759
1760 len = symbol__size(sym);
1761
1762 if (perf_evsel__is_group_event(evsel))
1763 width *= evsel->nr_members;
1764
1765 graph_dotted_len = printf(" %-*.*s| Source code & Disassembly of %s for %s (%" PRIu64 " samples)\n",
1766 width, width, "Percent", d_filename, evsel_name, h->sum);
1767
1768 printf("%-*.*s----\n",
1769 graph_dotted_len, graph_dotted_len, graph_dotted_line);
1770
1771 if (verbose)
1772 symbol__annotate_hits(sym, evsel);
1773
1774 list_for_each_entry(pos, ¬es->src->source, node) {
1775 if (context && queue == NULL) {
1776 queue = pos;
1777 queue_len = 0;
1778 }
1779
1780 switch (disasm_line__print(pos, sym, start, evsel, len,
1781 min_pcnt, printed, max_lines,
1782 queue)) {
1783 case 0:
1784 ++printed;
1785 if (context) {
1786 printed += queue_len;
1787 queue = NULL;
1788 queue_len = 0;
1789 }
1790 break;
1791 case 1:
1792 /* filtered by max_lines */
1793 ++more;
1794 break;
1795 case -1:
1796 default:
1797 /*
1798 * Filtered by min_pcnt or non IP lines when
1799 * context != 0
1800 */
1801 if (!context)
1802 break;
1803 if (queue_len == context)
1804 queue = list_entry(queue->node.next, typeof(*queue), node);
1805 else
1806 ++queue_len;
1807 break;
1808 }
1809 }
1810
1811 free(filename);
1812
1813 return more;
1814}
1815
1816void symbol__annotate_zero_histogram(struct symbol *sym, int evidx)
1817{
1818 struct annotation *notes = symbol__annotation(sym);
1819 struct sym_hist *h = annotation__histogram(notes, evidx);
1820
1821 memset(h, 0, notes->src->sizeof_sym_hist);
1822}
1823
1824void symbol__annotate_decay_histogram(struct symbol *sym, int evidx)
1825{
1826 struct annotation *notes = symbol__annotation(sym);
1827 struct sym_hist *h = annotation__histogram(notes, evidx);
1828 int len = symbol__size(sym), offset;
1829
1830 h->sum = 0;
1831 for (offset = 0; offset < len; ++offset) {
1832 h->addr[offset] = h->addr[offset] * 7 / 8;
1833 h->sum += h->addr[offset];
1834 }
1835}
1836
1837void disasm__purge(struct list_head *head)
1838{
1839 struct disasm_line *pos, *n;
1840
1841 list_for_each_entry_safe(pos, n, head, node) {
1842 list_del(&pos->node);
1843 disasm_line__free(pos);
1844 }
1845}
1846
1847static size_t disasm_line__fprintf(struct disasm_line *dl, FILE *fp)
1848{
1849 size_t printed;
1850
1851 if (dl->offset == -1)
1852 return fprintf(fp, "%s\n", dl->line);
1853
1854 printed = fprintf(fp, "%#" PRIx64 " %s", dl->offset, dl->ins.name);
1855
1856 if (dl->ops.raw[0] != '\0') {
1857 printed += fprintf(fp, "%.*s %s\n", 6 - (int)printed, " ",
1858 dl->ops.raw);
1859 }
1860
1861 return printed + fprintf(fp, "\n");
1862}
1863
1864size_t disasm__fprintf(struct list_head *head, FILE *fp)
1865{
1866 struct disasm_line *pos;
1867 size_t printed = 0;
1868
1869 list_for_each_entry(pos, head, node)
1870 printed += disasm_line__fprintf(pos, fp);
1871
1872 return printed;
1873}
1874
1875int symbol__tty_annotate(struct symbol *sym, struct map *map,
1876 struct perf_evsel *evsel, bool print_lines,
1877 bool full_paths, int min_pcnt, int max_lines)
1878{
1879 struct dso *dso = map->dso;
1880 struct rb_root source_line = RB_ROOT;
1881 u64 len;
1882
1883 if (symbol__disassemble(sym, map, perf_evsel__env_arch(evsel), 0) < 0)
1884 return -1;
1885
1886 len = symbol__size(sym);
1887
1888 if (print_lines) {
1889 srcline_full_filename = full_paths;
1890 symbol__get_source_line(sym, map, evsel, &source_line, len);
1891 print_summary(&source_line, dso->long_name);
1892 }
1893
1894 symbol__annotate_printf(sym, map, evsel, full_paths,
1895 min_pcnt, max_lines, 0);
1896 if (print_lines)
1897 symbol__free_source_line(sym, len);
1898
1899 disasm__purge(&symbol__annotation(sym)->src->source);
1900
1901 return 0;
1902}
1903
1904bool ui__has_annotation(void)
1905{
1906 return use_browser == 1 && perf_hpp_list.sym;
1907}
1// SPDX-License-Identifier: GPL-2.0-only
2/*
3 * Copyright (C) 2011, Red Hat Inc, Arnaldo Carvalho de Melo <acme@redhat.com>
4 *
5 * Parts came from builtin-annotate.c, see those files for further
6 * copyright notes.
7 */
8
9#include <errno.h>
10#include <inttypes.h>
11#include <libgen.h>
12#include <stdlib.h>
13#include "util.h" // hex_width()
14#include "ui/ui.h"
15#include "sort.h"
16#include "build-id.h"
17#include "color.h"
18#include "config.h"
19#include "disasm.h"
20#include "dso.h"
21#include "env.h"
22#include "map.h"
23#include "maps.h"
24#include "symbol.h"
25#include "srcline.h"
26#include "units.h"
27#include "debug.h"
28#include "debuginfo.h"
29#include "annotate.h"
30#include "annotate-data.h"
31#include "evsel.h"
32#include "evlist.h"
33#include "bpf-event.h"
34#include "bpf-utils.h"
35#include "block-range.h"
36#include "string2.h"
37#include "dwarf-regs.h"
38#include "util/event.h"
39#include "util/sharded_mutex.h"
40#include "arch/common.h"
41#include "namespaces.h"
42#include "thread.h"
43#include "hashmap.h"
44#include "strbuf.h"
45#include <regex.h>
46#include <linux/bitops.h>
47#include <linux/kernel.h>
48#include <linux/string.h>
49#include <linux/zalloc.h>
50#include <subcmd/parse-options.h>
51#include <subcmd/run-command.h>
52#include <math.h>
53
54/* FIXME: For the HE_COLORSET */
55#include "ui/browser.h"
56
57/*
58 * FIXME: Using the same values as slang.h,
59 * but that header may not be available everywhere
60 */
61#define LARROW_CHAR ((unsigned char)',')
62#define RARROW_CHAR ((unsigned char)'+')
63#define DARROW_CHAR ((unsigned char)'.')
64#define UARROW_CHAR ((unsigned char)'-')
65
66#include <linux/ctype.h>
67
68/* global annotation options */
69struct annotation_options annotate_opts;
70
71/* Data type collection debug statistics */
72struct annotated_data_stat ann_data_stat;
73LIST_HEAD(ann_insn_stat);
74
75/* Pseudo data types */
76struct annotated_data_type stackop_type = {
77 .self = {
78 .type_name = (char *)"(stack operation)",
79 .children = LIST_HEAD_INIT(stackop_type.self.children),
80 },
81};
82
83struct annotated_data_type canary_type = {
84 .self = {
85 .type_name = (char *)"(stack canary)",
86 .children = LIST_HEAD_INIT(canary_type.self.children),
87 },
88};
89
90/* symbol histogram: key = offset << 16 | evsel->core.idx */
91static size_t sym_hist_hash(long key, void *ctx __maybe_unused)
92{
93 return (key >> 16) + (key & 0xffff);
94}
95
96static bool sym_hist_equal(long key1, long key2, void *ctx __maybe_unused)
97{
98 return key1 == key2;
99}
100
101static struct annotated_source *annotated_source__new(void)
102{
103 struct annotated_source *src = zalloc(sizeof(*src));
104
105 if (src != NULL)
106 INIT_LIST_HEAD(&src->source);
107
108 return src;
109}
110
111static __maybe_unused void annotated_source__delete(struct annotated_source *src)
112{
113 struct hashmap_entry *cur;
114 size_t bkt;
115
116 if (src == NULL)
117 return;
118
119 if (src->samples) {
120 hashmap__for_each_entry(src->samples, cur, bkt)
121 zfree(&cur->pvalue);
122 hashmap__free(src->samples);
123 }
124 zfree(&src->histograms);
125 free(src);
126}
127
128static int annotated_source__alloc_histograms(struct annotated_source *src,
129 int nr_hists)
130{
131 src->nr_histograms = nr_hists;
132 src->histograms = calloc(nr_hists, sizeof(*src->histograms));
133
134 if (src->histograms == NULL)
135 return -1;
136
137 src->samples = hashmap__new(sym_hist_hash, sym_hist_equal, NULL);
138 if (src->samples == NULL)
139 zfree(&src->histograms);
140
141 return src->histograms ? 0 : -1;
142}
143
144void symbol__annotate_zero_histograms(struct symbol *sym)
145{
146 struct annotation *notes = symbol__annotation(sym);
147
148 annotation__lock(notes);
149 if (notes->src != NULL) {
150 memset(notes->src->histograms, 0,
151 notes->src->nr_histograms * sizeof(*notes->src->histograms));
152 hashmap__clear(notes->src->samples);
153 }
154 if (notes->branch && notes->branch->cycles_hist) {
155 memset(notes->branch->cycles_hist, 0,
156 symbol__size(sym) * sizeof(struct cyc_hist));
157 }
158 annotation__unlock(notes);
159}
160
161static int __symbol__account_cycles(struct cyc_hist *ch,
162 u64 start,
163 unsigned offset, unsigned cycles,
164 unsigned have_start)
165{
166 /*
167 * For now we can only account one basic block per
168 * final jump. But multiple could be overlapping.
169 * Always account the longest one. So when
170 * a shorter one has been already seen throw it away.
171 *
172 * We separately always account the full cycles.
173 */
174 ch[offset].num_aggr++;
175 ch[offset].cycles_aggr += cycles;
176
177 if (cycles > ch[offset].cycles_max)
178 ch[offset].cycles_max = cycles;
179
180 if (ch[offset].cycles_min) {
181 if (cycles && cycles < ch[offset].cycles_min)
182 ch[offset].cycles_min = cycles;
183 } else
184 ch[offset].cycles_min = cycles;
185
186 if (!have_start && ch[offset].have_start)
187 return 0;
188 if (ch[offset].num) {
189 if (have_start && (!ch[offset].have_start ||
190 ch[offset].start > start)) {
191 ch[offset].have_start = 0;
192 ch[offset].cycles = 0;
193 ch[offset].num = 0;
194 if (ch[offset].reset < 0xffff)
195 ch[offset].reset++;
196 } else if (have_start &&
197 ch[offset].start < start)
198 return 0;
199 }
200
201 if (ch[offset].num < NUM_SPARKS)
202 ch[offset].cycles_spark[ch[offset].num] = cycles;
203
204 ch[offset].have_start = have_start;
205 ch[offset].start = start;
206 ch[offset].cycles += cycles;
207 ch[offset].num++;
208 return 0;
209}
210
211static int __symbol__inc_addr_samples(struct map_symbol *ms,
212 struct annotated_source *src, int evidx, u64 addr,
213 struct perf_sample *sample)
214{
215 struct symbol *sym = ms->sym;
216 long hash_key;
217 u64 offset;
218 struct sym_hist *h;
219 struct sym_hist_entry *entry;
220
221 pr_debug3("%s: addr=%#" PRIx64 "\n", __func__, map__unmap_ip(ms->map, addr));
222
223 if ((addr < sym->start || addr >= sym->end) &&
224 (addr != sym->end || sym->start != sym->end)) {
225 pr_debug("%s(%d): ERANGE! sym->name=%s, start=%#" PRIx64 ", addr=%#" PRIx64 ", end=%#" PRIx64 "\n",
226 __func__, __LINE__, sym->name, sym->start, addr, sym->end);
227 return -ERANGE;
228 }
229
230 offset = addr - sym->start;
231 h = annotated_source__histogram(src, evidx);
232 if (h == NULL) {
233 pr_debug("%s(%d): ENOMEM! sym->name=%s, start=%#" PRIx64 ", addr=%#" PRIx64 ", end=%#" PRIx64 ", func: %d\n",
234 __func__, __LINE__, sym->name, sym->start, addr, sym->end, sym->type == STT_FUNC);
235 return -ENOMEM;
236 }
237
238 hash_key = offset << 16 | evidx;
239 if (!hashmap__find(src->samples, hash_key, &entry)) {
240 entry = zalloc(sizeof(*entry));
241 if (entry == NULL)
242 return -ENOMEM;
243
244 if (hashmap__add(src->samples, hash_key, entry) < 0)
245 return -ENOMEM;
246 }
247
248 h->nr_samples++;
249 h->period += sample->period;
250 entry->nr_samples++;
251 entry->period += sample->period;
252
253 pr_debug3("%#" PRIx64 " %s: period++ [addr: %#" PRIx64 ", %#" PRIx64
254 ", evidx=%d] => nr_samples: %" PRIu64 ", period: %" PRIu64 "\n",
255 sym->start, sym->name, addr, addr - sym->start, evidx,
256 entry->nr_samples, entry->period);
257 return 0;
258}
259
260struct annotated_branch *annotation__get_branch(struct annotation *notes)
261{
262 if (notes == NULL)
263 return NULL;
264
265 if (notes->branch == NULL)
266 notes->branch = zalloc(sizeof(*notes->branch));
267
268 return notes->branch;
269}
270
271static struct annotated_branch *symbol__find_branch_hist(struct symbol *sym,
272 unsigned int br_cntr_nr)
273{
274 struct annotation *notes = symbol__annotation(sym);
275 struct annotated_branch *branch;
276 const size_t size = symbol__size(sym);
277
278 branch = annotation__get_branch(notes);
279 if (branch == NULL)
280 return NULL;
281
282 if (branch->cycles_hist == NULL) {
283 branch->cycles_hist = calloc(size, sizeof(struct cyc_hist));
284 if (!branch->cycles_hist)
285 return NULL;
286 }
287
288 if (br_cntr_nr && branch->br_cntr == NULL) {
289 branch->br_cntr = calloc(br_cntr_nr * size, sizeof(u64));
290 if (!branch->br_cntr)
291 return NULL;
292 }
293
294 return branch;
295}
296
297struct annotated_source *symbol__hists(struct symbol *sym, int nr_hists)
298{
299 struct annotation *notes = symbol__annotation(sym);
300
301 if (notes->src == NULL) {
302 notes->src = annotated_source__new();
303 if (notes->src == NULL)
304 return NULL;
305 goto alloc_histograms;
306 }
307
308 if (notes->src->histograms == NULL) {
309alloc_histograms:
310 annotated_source__alloc_histograms(notes->src, nr_hists);
311 }
312
313 return notes->src;
314}
315
316static int symbol__inc_addr_samples(struct map_symbol *ms,
317 struct evsel *evsel, u64 addr,
318 struct perf_sample *sample)
319{
320 struct symbol *sym = ms->sym;
321 struct annotated_source *src;
322
323 if (sym == NULL)
324 return 0;
325 src = symbol__hists(sym, evsel->evlist->core.nr_entries);
326 return src ? __symbol__inc_addr_samples(ms, src, evsel->core.idx, addr, sample) : 0;
327}
328
329static int symbol__account_br_cntr(struct annotated_branch *branch,
330 struct evsel *evsel,
331 unsigned offset,
332 u64 br_cntr)
333{
334 unsigned int br_cntr_nr = evsel__leader(evsel)->br_cntr_nr;
335 unsigned int base = evsel__leader(evsel)->br_cntr_idx;
336 unsigned int off = offset * evsel->evlist->nr_br_cntr;
337 u64 *branch_br_cntr = branch->br_cntr;
338 unsigned int i, mask, width;
339
340 if (!br_cntr || !branch_br_cntr)
341 return 0;
342
343 perf_env__find_br_cntr_info(evsel__env(evsel), NULL, &width);
344 mask = (1L << width) - 1;
345 for (i = 0; i < br_cntr_nr; i++) {
346 u64 cntr = (br_cntr >> i * width) & mask;
347
348 branch_br_cntr[off + i + base] += cntr;
349 if (cntr == mask)
350 branch_br_cntr[off + i + base] |= ANNOTATION__BR_CNTR_SATURATED_FLAG;
351 }
352
353 return 0;
354}
355
356static int symbol__account_cycles(u64 addr, u64 start, struct symbol *sym,
357 unsigned cycles, struct evsel *evsel,
358 u64 br_cntr)
359{
360 struct annotated_branch *branch;
361 unsigned offset;
362 int ret;
363
364 if (sym == NULL)
365 return 0;
366 branch = symbol__find_branch_hist(sym, evsel->evlist->nr_br_cntr);
367 if (!branch)
368 return -ENOMEM;
369 if (addr < sym->start || addr >= sym->end)
370 return -ERANGE;
371
372 if (start) {
373 if (start < sym->start || start >= sym->end)
374 return -ERANGE;
375 if (start >= addr)
376 start = 0;
377 }
378 offset = addr - sym->start;
379 ret = __symbol__account_cycles(branch->cycles_hist,
380 start ? start - sym->start : 0,
381 offset, cycles,
382 !!start);
383
384 if (ret)
385 return ret;
386
387 return symbol__account_br_cntr(branch, evsel, offset, br_cntr);
388}
389
390int addr_map_symbol__account_cycles(struct addr_map_symbol *ams,
391 struct addr_map_symbol *start,
392 unsigned cycles,
393 struct evsel *evsel,
394 u64 br_cntr)
395{
396 u64 saddr = 0;
397 int err;
398
399 if (!cycles)
400 return 0;
401
402 /*
403 * Only set start when IPC can be computed. We can only
404 * compute it when the basic block is completely in a single
405 * function.
406 * Special case the case when the jump is elsewhere, but
407 * it starts on the function start.
408 */
409 if (start &&
410 (start->ms.sym == ams->ms.sym ||
411 (ams->ms.sym &&
412 start->addr == ams->ms.sym->start + map__start(ams->ms.map))))
413 saddr = start->al_addr;
414 if (saddr == 0)
415 pr_debug2("BB with bad start: addr %"PRIx64" start %"PRIx64" sym %"PRIx64" saddr %"PRIx64"\n",
416 ams->addr,
417 start ? start->addr : 0,
418 ams->ms.sym ? ams->ms.sym->start + map__start(ams->ms.map) : 0,
419 saddr);
420 err = symbol__account_cycles(ams->al_addr, saddr, ams->ms.sym, cycles, evsel, br_cntr);
421 if (err)
422 pr_debug2("account_cycles failed %d\n", err);
423 return err;
424}
425
426struct annotation_line *annotated_source__get_line(struct annotated_source *src,
427 s64 offset)
428{
429 struct annotation_line *al;
430
431 list_for_each_entry(al, &src->source, node) {
432 if (al->offset == offset)
433 return al;
434 }
435 return NULL;
436}
437
438static unsigned annotation__count_insn(struct annotation *notes, u64 start, u64 end)
439{
440 struct annotation_line *al;
441 unsigned n_insn = 0;
442
443 al = annotated_source__get_line(notes->src, start);
444 if (al == NULL)
445 return 0;
446
447 list_for_each_entry_from(al, ¬es->src->source, node) {
448 if (al->offset == -1)
449 continue;
450 if ((u64)al->offset > end)
451 break;
452 n_insn++;
453 }
454 return n_insn;
455}
456
457static void annotated_branch__delete(struct annotated_branch *branch)
458{
459 if (branch) {
460 zfree(&branch->cycles_hist);
461 free(branch->br_cntr);
462 free(branch);
463 }
464}
465
466static void annotation__count_and_fill(struct annotation *notes, u64 start, u64 end, struct cyc_hist *ch)
467{
468 unsigned n_insn;
469 unsigned int cover_insn = 0;
470
471 n_insn = annotation__count_insn(notes, start, end);
472 if (n_insn && ch->num && ch->cycles) {
473 struct annotation_line *al;
474 struct annotated_branch *branch;
475 float ipc = n_insn / ((double)ch->cycles / (double)ch->num);
476
477 /* Hide data when there are too many overlaps. */
478 if (ch->reset >= 0x7fff)
479 return;
480
481 al = annotated_source__get_line(notes->src, start);
482 if (al == NULL)
483 return;
484
485 list_for_each_entry_from(al, ¬es->src->source, node) {
486 if (al->offset == -1)
487 continue;
488 if ((u64)al->offset > end)
489 break;
490 if (al->cycles && al->cycles->ipc == 0.0) {
491 al->cycles->ipc = ipc;
492 cover_insn++;
493 }
494 }
495
496 branch = annotation__get_branch(notes);
497 if (cover_insn && branch) {
498 branch->hit_cycles += ch->cycles;
499 branch->hit_insn += n_insn * ch->num;
500 branch->cover_insn += cover_insn;
501 }
502 }
503}
504
505static int annotation__compute_ipc(struct annotation *notes, size_t size,
506 struct evsel *evsel)
507{
508 unsigned int br_cntr_nr = evsel->evlist->nr_br_cntr;
509 int err = 0;
510 s64 offset;
511
512 if (!notes->branch || !notes->branch->cycles_hist)
513 return 0;
514
515 notes->branch->total_insn = annotation__count_insn(notes, 0, size - 1);
516 notes->branch->hit_cycles = 0;
517 notes->branch->hit_insn = 0;
518 notes->branch->cover_insn = 0;
519
520 annotation__lock(notes);
521 for (offset = size - 1; offset >= 0; --offset) {
522 struct cyc_hist *ch;
523
524 ch = ¬es->branch->cycles_hist[offset];
525 if (ch && ch->cycles) {
526 struct annotation_line *al;
527
528 al = annotated_source__get_line(notes->src, offset);
529 if (al && al->cycles == NULL) {
530 al->cycles = zalloc(sizeof(*al->cycles));
531 if (al->cycles == NULL) {
532 err = ENOMEM;
533 break;
534 }
535 }
536 if (ch->have_start)
537 annotation__count_and_fill(notes, ch->start, offset, ch);
538 if (al && ch->num_aggr) {
539 al->cycles->avg = ch->cycles_aggr / ch->num_aggr;
540 al->cycles->max = ch->cycles_max;
541 al->cycles->min = ch->cycles_min;
542 }
543 if (al && notes->branch->br_cntr) {
544 if (!al->br_cntr) {
545 al->br_cntr = calloc(br_cntr_nr, sizeof(u64));
546 if (!al->br_cntr) {
547 err = ENOMEM;
548 break;
549 }
550 }
551 al->num_aggr = ch->num_aggr;
552 al->br_cntr_nr = br_cntr_nr;
553 al->evsel = evsel;
554 memcpy(al->br_cntr, ¬es->branch->br_cntr[offset * br_cntr_nr],
555 br_cntr_nr * sizeof(u64));
556 }
557 }
558 }
559
560 if (err) {
561 while (++offset < (s64)size) {
562 struct cyc_hist *ch = ¬es->branch->cycles_hist[offset];
563
564 if (ch && ch->cycles) {
565 struct annotation_line *al;
566
567 al = annotated_source__get_line(notes->src, offset);
568 if (al) {
569 zfree(&al->cycles);
570 zfree(&al->br_cntr);
571 }
572 }
573 }
574 }
575
576 annotation__unlock(notes);
577 return 0;
578}
579
580int addr_map_symbol__inc_samples(struct addr_map_symbol *ams, struct perf_sample *sample,
581 struct evsel *evsel)
582{
583 return symbol__inc_addr_samples(&ams->ms, evsel, ams->al_addr, sample);
584}
585
586int hist_entry__inc_addr_samples(struct hist_entry *he, struct perf_sample *sample,
587 struct evsel *evsel, u64 ip)
588{
589 return symbol__inc_addr_samples(&he->ms, evsel, ip, sample);
590}
591
592
593void annotation__exit(struct annotation *notes)
594{
595 annotated_source__delete(notes->src);
596 annotated_branch__delete(notes->branch);
597}
598
599static struct sharded_mutex *sharded_mutex;
600
601static void annotation__init_sharded_mutex(void)
602{
603 /* As many mutexes as there are CPUs. */
604 sharded_mutex = sharded_mutex__new(cpu__max_present_cpu().cpu);
605}
606
607static size_t annotation__hash(const struct annotation *notes)
608{
609 return (size_t)notes;
610}
611
612static struct mutex *annotation__get_mutex(const struct annotation *notes)
613{
614 static pthread_once_t once = PTHREAD_ONCE_INIT;
615
616 pthread_once(&once, annotation__init_sharded_mutex);
617 if (!sharded_mutex)
618 return NULL;
619
620 return sharded_mutex__get_mutex(sharded_mutex, annotation__hash(notes));
621}
622
623void annotation__lock(struct annotation *notes)
624 NO_THREAD_SAFETY_ANALYSIS
625{
626 struct mutex *mutex = annotation__get_mutex(notes);
627
628 if (mutex)
629 mutex_lock(mutex);
630}
631
632void annotation__unlock(struct annotation *notes)
633 NO_THREAD_SAFETY_ANALYSIS
634{
635 struct mutex *mutex = annotation__get_mutex(notes);
636
637 if (mutex)
638 mutex_unlock(mutex);
639}
640
641bool annotation__trylock(struct annotation *notes)
642{
643 struct mutex *mutex = annotation__get_mutex(notes);
644
645 if (!mutex)
646 return false;
647
648 return mutex_trylock(mutex);
649}
650
651void annotation_line__add(struct annotation_line *al, struct list_head *head)
652{
653 list_add_tail(&al->node, head);
654}
655
656struct annotation_line *
657annotation_line__next(struct annotation_line *pos, struct list_head *head)
658{
659 list_for_each_entry_continue(pos, head, node)
660 if (pos->offset >= 0)
661 return pos;
662
663 return NULL;
664}
665
666static const char *annotate__address_color(struct block_range *br)
667{
668 double cov = block_range__coverage(br);
669
670 if (cov >= 0) {
671 /* mark red for >75% coverage */
672 if (cov > 0.75)
673 return PERF_COLOR_RED;
674
675 /* mark dull for <1% coverage */
676 if (cov < 0.01)
677 return PERF_COLOR_NORMAL;
678 }
679
680 return PERF_COLOR_MAGENTA;
681}
682
683static const char *annotate__asm_color(struct block_range *br)
684{
685 double cov = block_range__coverage(br);
686
687 if (cov >= 0) {
688 /* mark dull for <1% coverage */
689 if (cov < 0.01)
690 return PERF_COLOR_NORMAL;
691 }
692
693 return PERF_COLOR_BLUE;
694}
695
696static void annotate__branch_printf(struct block_range *br, u64 addr)
697{
698 bool emit_comment = true;
699
700 if (!br)
701 return;
702
703#if 1
704 if (br->is_target && br->start == addr) {
705 struct block_range *branch = br;
706 double p;
707
708 /*
709 * Find matching branch to our target.
710 */
711 while (!branch->is_branch)
712 branch = block_range__next(branch);
713
714 p = 100 *(double)br->entry / branch->coverage;
715
716 if (p > 0.1) {
717 if (emit_comment) {
718 emit_comment = false;
719 printf("\t#");
720 }
721
722 /*
723 * The percentage of coverage joined at this target in relation
724 * to the next branch.
725 */
726 printf(" +%.2f%%", p);
727 }
728 }
729#endif
730 if (br->is_branch && br->end == addr) {
731 double p = 100*(double)br->taken / br->coverage;
732
733 if (p > 0.1) {
734 if (emit_comment) {
735 emit_comment = false;
736 printf("\t#");
737 }
738
739 /*
740 * The percentage of coverage leaving at this branch, and
741 * its prediction ratio.
742 */
743 printf(" -%.2f%% (p:%.2f%%)", p, 100*(double)br->pred / br->taken);
744 }
745 }
746}
747
748static int disasm_line__print(struct disasm_line *dl, u64 start, int addr_fmt_width)
749{
750 s64 offset = dl->al.offset;
751 const u64 addr = start + offset;
752 struct block_range *br;
753
754 br = block_range__find(addr);
755 color_fprintf(stdout, annotate__address_color(br), " %*" PRIx64 ":", addr_fmt_width, addr);
756 color_fprintf(stdout, annotate__asm_color(br), "%s", dl->al.line);
757 annotate__branch_printf(br, addr);
758 return 0;
759}
760
761static int
762annotation_line__print(struct annotation_line *al, struct symbol *sym, u64 start,
763 struct evsel *evsel, u64 len, int min_pcnt, int printed,
764 int max_lines, struct annotation_line *queue, int addr_fmt_width,
765 int percent_type)
766{
767 struct disasm_line *dl = container_of(al, struct disasm_line, al);
768 struct annotation *notes = symbol__annotation(sym);
769 static const char *prev_line;
770
771 if (al->offset != -1) {
772 double max_percent = 0.0;
773 int i, nr_percent = 1;
774 const char *color;
775
776 for (i = 0; i < al->data_nr; i++) {
777 double percent;
778
779 percent = annotation_data__percent(&al->data[i],
780 percent_type);
781
782 if (percent > max_percent)
783 max_percent = percent;
784 }
785
786 if (al->data_nr > nr_percent)
787 nr_percent = al->data_nr;
788
789 if (max_percent < min_pcnt)
790 return -1;
791
792 if (max_lines && printed >= max_lines)
793 return 1;
794
795 if (queue != NULL) {
796 list_for_each_entry_from(queue, ¬es->src->source, node) {
797 if (queue == al)
798 break;
799 annotation_line__print(queue, sym, start, evsel, len,
800 0, 0, 1, NULL, addr_fmt_width,
801 percent_type);
802 }
803 }
804
805 color = get_percent_color(max_percent);
806
807 for (i = 0; i < nr_percent; i++) {
808 struct annotation_data *data = &al->data[i];
809 double percent;
810
811 percent = annotation_data__percent(data, percent_type);
812 color = get_percent_color(percent);
813
814 if (symbol_conf.show_total_period)
815 color_fprintf(stdout, color, " %11" PRIu64,
816 data->he.period);
817 else if (symbol_conf.show_nr_samples)
818 color_fprintf(stdout, color, " %7" PRIu64,
819 data->he.nr_samples);
820 else
821 color_fprintf(stdout, color, " %7.2f", percent);
822 }
823
824 printf(" : ");
825
826 disasm_line__print(dl, start, addr_fmt_width);
827
828 /*
829 * Also color the filename and line if needed, with
830 * the same color than the percentage. Don't print it
831 * twice for close colored addr with the same filename:line
832 */
833 if (al->path) {
834 if (!prev_line || strcmp(prev_line, al->path)) {
835 color_fprintf(stdout, color, " // %s", al->path);
836 prev_line = al->path;
837 }
838 }
839
840 printf("\n");
841 } else if (max_lines && printed >= max_lines)
842 return 1;
843 else {
844 int width = annotation__pcnt_width(notes);
845
846 if (queue)
847 return -1;
848
849 if (!*al->line)
850 printf(" %*s:\n", width, " ");
851 else
852 printf(" %*s: %-*d %s\n", width, " ", addr_fmt_width, al->line_nr, al->line);
853 }
854
855 return 0;
856}
857
858static void calc_percent(struct annotation *notes,
859 struct evsel *evsel,
860 struct annotation_data *data,
861 s64 offset, s64 end)
862{
863 struct hists *hists = evsel__hists(evsel);
864 int evidx = evsel->core.idx;
865 struct sym_hist *sym_hist = annotation__histogram(notes, evidx);
866 unsigned int hits = 0;
867 u64 period = 0;
868
869 while (offset < end) {
870 struct sym_hist_entry *entry;
871
872 entry = annotated_source__hist_entry(notes->src, evidx, offset);
873 if (entry) {
874 hits += entry->nr_samples;
875 period += entry->period;
876 }
877 ++offset;
878 }
879
880 if (sym_hist->nr_samples) {
881 data->he.period = period;
882 data->he.nr_samples = hits;
883 data->percent[PERCENT_HITS_LOCAL] = 100.0 * hits / sym_hist->nr_samples;
884 }
885
886 if (hists->stats.nr_non_filtered_samples)
887 data->percent[PERCENT_HITS_GLOBAL] = 100.0 * hits / hists->stats.nr_non_filtered_samples;
888
889 if (sym_hist->period)
890 data->percent[PERCENT_PERIOD_LOCAL] = 100.0 * period / sym_hist->period;
891
892 if (hists->stats.total_period)
893 data->percent[PERCENT_PERIOD_GLOBAL] = 100.0 * period / hists->stats.total_period;
894}
895
896static void annotation__calc_percent(struct annotation *notes,
897 struct evsel *leader, s64 len)
898{
899 struct annotation_line *al, *next;
900 struct evsel *evsel;
901
902 list_for_each_entry(al, ¬es->src->source, node) {
903 s64 end;
904 int i = 0;
905
906 if (al->offset == -1)
907 continue;
908
909 next = annotation_line__next(al, ¬es->src->source);
910 end = next ? next->offset : len;
911
912 for_each_group_evsel(evsel, leader) {
913 struct annotation_data *data;
914
915 BUG_ON(i >= al->data_nr);
916
917 if (symbol_conf.skip_empty &&
918 evsel__hists(evsel)->stats.nr_samples == 0)
919 continue;
920
921 data = &al->data[i++];
922
923 calc_percent(notes, evsel, data, al->offset, end);
924 }
925 }
926}
927
928void symbol__calc_percent(struct symbol *sym, struct evsel *evsel)
929{
930 struct annotation *notes = symbol__annotation(sym);
931
932 annotation__calc_percent(notes, evsel, symbol__size(sym));
933}
934
935static int evsel__get_arch(struct evsel *evsel, struct arch **parch)
936{
937 struct perf_env *env = evsel__env(evsel);
938 const char *arch_name = perf_env__arch(env);
939 struct arch *arch;
940 int err;
941
942 if (!arch_name) {
943 *parch = NULL;
944 return errno;
945 }
946
947 *parch = arch = arch__find(arch_name);
948 if (arch == NULL) {
949 pr_err("%s: unsupported arch %s\n", __func__, arch_name);
950 return ENOTSUP;
951 }
952
953 if (arch->init) {
954 err = arch->init(arch, env ? env->cpuid : NULL);
955 if (err) {
956 pr_err("%s: failed to initialize %s arch priv area\n",
957 __func__, arch->name);
958 return err;
959 }
960 }
961 return 0;
962}
963
964int symbol__annotate(struct map_symbol *ms, struct evsel *evsel,
965 struct arch **parch)
966{
967 struct symbol *sym = ms->sym;
968 struct annotation *notes = symbol__annotation(sym);
969 struct annotate_args args = {
970 .evsel = evsel,
971 .options = &annotate_opts,
972 };
973 struct arch *arch = NULL;
974 int err, nr;
975
976 err = evsel__get_arch(evsel, &arch);
977 if (err < 0)
978 return err;
979
980 if (parch)
981 *parch = arch;
982
983 if (notes->src && !list_empty(¬es->src->source))
984 return 0;
985
986 args.arch = arch;
987 args.ms = *ms;
988
989 if (notes->src == NULL) {
990 notes->src = annotated_source__new();
991 if (notes->src == NULL)
992 return -1;
993 }
994
995 nr = 0;
996 if (evsel__is_group_event(evsel)) {
997 struct evsel *pos;
998
999 for_each_group_evsel(pos, evsel) {
1000 if (symbol_conf.skip_empty &&
1001 evsel__hists(pos)->stats.nr_samples == 0)
1002 continue;
1003 nr++;
1004 }
1005 }
1006 notes->src->nr_events = nr ? nr : 1;
1007
1008 if (annotate_opts.full_addr)
1009 notes->src->start = map__objdump_2mem(ms->map, ms->sym->start);
1010 else
1011 notes->src->start = map__rip_2objdump(ms->map, ms->sym->start);
1012
1013 return symbol__disassemble(sym, &args);
1014}
1015
1016static void insert_source_line(struct rb_root *root, struct annotation_line *al)
1017{
1018 struct annotation_line *iter;
1019 struct rb_node **p = &root->rb_node;
1020 struct rb_node *parent = NULL;
1021 unsigned int percent_type = annotate_opts.percent_type;
1022 int i, ret;
1023
1024 while (*p != NULL) {
1025 parent = *p;
1026 iter = rb_entry(parent, struct annotation_line, rb_node);
1027
1028 ret = strcmp(iter->path, al->path);
1029 if (ret == 0) {
1030 for (i = 0; i < al->data_nr; i++) {
1031 iter->data[i].percent_sum += annotation_data__percent(&al->data[i],
1032 percent_type);
1033 }
1034 return;
1035 }
1036
1037 if (ret < 0)
1038 p = &(*p)->rb_left;
1039 else
1040 p = &(*p)->rb_right;
1041 }
1042
1043 for (i = 0; i < al->data_nr; i++) {
1044 al->data[i].percent_sum = annotation_data__percent(&al->data[i],
1045 percent_type);
1046 }
1047
1048 rb_link_node(&al->rb_node, parent, p);
1049 rb_insert_color(&al->rb_node, root);
1050}
1051
1052static int cmp_source_line(struct annotation_line *a, struct annotation_line *b)
1053{
1054 int i;
1055
1056 for (i = 0; i < a->data_nr; i++) {
1057 if (a->data[i].percent_sum == b->data[i].percent_sum)
1058 continue;
1059 return a->data[i].percent_sum > b->data[i].percent_sum;
1060 }
1061
1062 return 0;
1063}
1064
1065static void __resort_source_line(struct rb_root *root, struct annotation_line *al)
1066{
1067 struct annotation_line *iter;
1068 struct rb_node **p = &root->rb_node;
1069 struct rb_node *parent = NULL;
1070
1071 while (*p != NULL) {
1072 parent = *p;
1073 iter = rb_entry(parent, struct annotation_line, rb_node);
1074
1075 if (cmp_source_line(al, iter))
1076 p = &(*p)->rb_left;
1077 else
1078 p = &(*p)->rb_right;
1079 }
1080
1081 rb_link_node(&al->rb_node, parent, p);
1082 rb_insert_color(&al->rb_node, root);
1083}
1084
1085static void resort_source_line(struct rb_root *dest_root, struct rb_root *src_root)
1086{
1087 struct annotation_line *al;
1088 struct rb_node *node;
1089
1090 node = rb_first(src_root);
1091 while (node) {
1092 struct rb_node *next;
1093
1094 al = rb_entry(node, struct annotation_line, rb_node);
1095 next = rb_next(node);
1096 rb_erase(node, src_root);
1097
1098 __resort_source_line(dest_root, al);
1099 node = next;
1100 }
1101}
1102
1103static void print_summary(struct rb_root *root, const char *filename)
1104{
1105 struct annotation_line *al;
1106 struct rb_node *node;
1107
1108 printf("\nSorted summary for file %s\n", filename);
1109 printf("----------------------------------------------\n\n");
1110
1111 if (RB_EMPTY_ROOT(root)) {
1112 printf(" Nothing higher than %1.1f%%\n", MIN_GREEN);
1113 return;
1114 }
1115
1116 node = rb_first(root);
1117 while (node) {
1118 double percent, percent_max = 0.0;
1119 const char *color;
1120 char *path;
1121 int i;
1122
1123 al = rb_entry(node, struct annotation_line, rb_node);
1124 for (i = 0; i < al->data_nr; i++) {
1125 percent = al->data[i].percent_sum;
1126 color = get_percent_color(percent);
1127 color_fprintf(stdout, color, " %7.2f", percent);
1128
1129 if (percent > percent_max)
1130 percent_max = percent;
1131 }
1132
1133 path = al->path;
1134 color = get_percent_color(percent_max);
1135 color_fprintf(stdout, color, " %s\n", path);
1136
1137 node = rb_next(node);
1138 }
1139}
1140
1141static void symbol__annotate_hits(struct symbol *sym, struct evsel *evsel)
1142{
1143 int evidx = evsel->core.idx;
1144 struct annotation *notes = symbol__annotation(sym);
1145 struct sym_hist *h = annotation__histogram(notes, evidx);
1146 u64 len = symbol__size(sym), offset;
1147
1148 for (offset = 0; offset < len; ++offset) {
1149 struct sym_hist_entry *entry;
1150
1151 entry = annotated_source__hist_entry(notes->src, evidx, offset);
1152 if (entry && entry->nr_samples != 0)
1153 printf("%*" PRIx64 ": %" PRIu64 "\n", BITS_PER_LONG / 2,
1154 sym->start + offset, entry->nr_samples);
1155 }
1156 printf("%*s: %" PRIu64 "\n", BITS_PER_LONG / 2, "h->nr_samples", h->nr_samples);
1157}
1158
1159static int annotated_source__addr_fmt_width(struct list_head *lines, u64 start)
1160{
1161 char bf[32];
1162 struct annotation_line *line;
1163
1164 list_for_each_entry_reverse(line, lines, node) {
1165 if (line->offset != -1)
1166 return scnprintf(bf, sizeof(bf), "%" PRIx64, start + line->offset);
1167 }
1168
1169 return 0;
1170}
1171
1172int symbol__annotate_printf(struct map_symbol *ms, struct evsel *evsel)
1173{
1174 struct map *map = ms->map;
1175 struct symbol *sym = ms->sym;
1176 struct dso *dso = map__dso(map);
1177 char *filename;
1178 const char *d_filename;
1179 const char *evsel_name = evsel__name(evsel);
1180 struct annotation *notes = symbol__annotation(sym);
1181 struct sym_hist *h = annotation__histogram(notes, evsel->core.idx);
1182 struct annotation_line *pos, *queue = NULL;
1183 struct annotation_options *opts = &annotate_opts;
1184 u64 start = map__rip_2objdump(map, sym->start);
1185 int printed = 2, queue_len = 0, addr_fmt_width;
1186 int more = 0;
1187 bool context = opts->context;
1188 u64 len;
1189 int width = annotation__pcnt_width(notes);
1190 int graph_dotted_len;
1191 char buf[512];
1192
1193 filename = strdup(dso__long_name(dso));
1194 if (!filename)
1195 return -ENOMEM;
1196
1197 if (opts->full_path)
1198 d_filename = filename;
1199 else
1200 d_filename = basename(filename);
1201
1202 len = symbol__size(sym);
1203
1204 if (evsel__is_group_event(evsel)) {
1205 evsel__group_desc(evsel, buf, sizeof(buf));
1206 evsel_name = buf;
1207 }
1208
1209 graph_dotted_len = printf(" %-*.*s| Source code & Disassembly of %s for %s (%" PRIu64 " samples, "
1210 "percent: %s)\n",
1211 width, width, symbol_conf.show_total_period ? "Period" :
1212 symbol_conf.show_nr_samples ? "Samples" : "Percent",
1213 d_filename, evsel_name, h->nr_samples,
1214 percent_type_str(opts->percent_type));
1215
1216 printf("%-*.*s----\n",
1217 graph_dotted_len, graph_dotted_len, graph_dotted_line);
1218
1219 if (verbose > 0)
1220 symbol__annotate_hits(sym, evsel);
1221
1222 addr_fmt_width = annotated_source__addr_fmt_width(¬es->src->source, start);
1223
1224 list_for_each_entry(pos, ¬es->src->source, node) {
1225 int err;
1226
1227 if (context && queue == NULL) {
1228 queue = pos;
1229 queue_len = 0;
1230 }
1231
1232 err = annotation_line__print(pos, sym, start, evsel, len,
1233 opts->min_pcnt, printed, opts->max_lines,
1234 queue, addr_fmt_width, opts->percent_type);
1235
1236 switch (err) {
1237 case 0:
1238 ++printed;
1239 if (context) {
1240 printed += queue_len;
1241 queue = NULL;
1242 queue_len = 0;
1243 }
1244 break;
1245 case 1:
1246 /* filtered by max_lines */
1247 ++more;
1248 break;
1249 case -1:
1250 default:
1251 /*
1252 * Filtered by min_pcnt or non IP lines when
1253 * context != 0
1254 */
1255 if (!context)
1256 break;
1257 if (queue_len == context)
1258 queue = list_entry(queue->node.next, typeof(*queue), node);
1259 else
1260 ++queue_len;
1261 break;
1262 }
1263 }
1264
1265 free(filename);
1266
1267 return more;
1268}
1269
1270static void FILE__set_percent_color(void *fp __maybe_unused,
1271 double percent __maybe_unused,
1272 bool current __maybe_unused)
1273{
1274}
1275
1276static int FILE__set_jumps_percent_color(void *fp __maybe_unused,
1277 int nr __maybe_unused, bool current __maybe_unused)
1278{
1279 return 0;
1280}
1281
1282static int FILE__set_color(void *fp __maybe_unused, int color __maybe_unused)
1283{
1284 return 0;
1285}
1286
1287static void FILE__printf(void *fp, const char *fmt, ...)
1288{
1289 va_list args;
1290
1291 va_start(args, fmt);
1292 vfprintf(fp, fmt, args);
1293 va_end(args);
1294}
1295
1296static void FILE__write_graph(void *fp, int graph)
1297{
1298 const char *s;
1299 switch (graph) {
1300
1301 case DARROW_CHAR: s = "↓"; break;
1302 case UARROW_CHAR: s = "↑"; break;
1303 case LARROW_CHAR: s = "←"; break;
1304 case RARROW_CHAR: s = "→"; break;
1305 default: s = "?"; break;
1306 }
1307
1308 fputs(s, fp);
1309}
1310
1311static int symbol__annotate_fprintf2(struct symbol *sym, FILE *fp)
1312{
1313 struct annotation *notes = symbol__annotation(sym);
1314 struct annotation_write_ops wops = {
1315 .first_line = true,
1316 .obj = fp,
1317 .set_color = FILE__set_color,
1318 .set_percent_color = FILE__set_percent_color,
1319 .set_jumps_percent_color = FILE__set_jumps_percent_color,
1320 .printf = FILE__printf,
1321 .write_graph = FILE__write_graph,
1322 };
1323 struct annotation_line *al;
1324
1325 list_for_each_entry(al, ¬es->src->source, node) {
1326 if (annotation_line__filter(al))
1327 continue;
1328 annotation_line__write(al, notes, &wops);
1329 fputc('\n', fp);
1330 wops.first_line = false;
1331 }
1332
1333 return 0;
1334}
1335
1336int map_symbol__annotation_dump(struct map_symbol *ms, struct evsel *evsel)
1337{
1338 const char *ev_name = evsel__name(evsel);
1339 char buf[1024];
1340 char *filename;
1341 int err = -1;
1342 FILE *fp;
1343
1344 if (asprintf(&filename, "%s.annotation", ms->sym->name) < 0)
1345 return -1;
1346
1347 fp = fopen(filename, "w");
1348 if (fp == NULL)
1349 goto out_free_filename;
1350
1351 if (evsel__is_group_event(evsel)) {
1352 evsel__group_desc(evsel, buf, sizeof(buf));
1353 ev_name = buf;
1354 }
1355
1356 fprintf(fp, "%s() %s\nEvent: %s\n\n",
1357 ms->sym->name, dso__long_name(map__dso(ms->map)), ev_name);
1358 symbol__annotate_fprintf2(ms->sym, fp);
1359
1360 fclose(fp);
1361 err = 0;
1362out_free_filename:
1363 free(filename);
1364 return err;
1365}
1366
1367void symbol__annotate_zero_histogram(struct symbol *sym, int evidx)
1368{
1369 struct annotation *notes = symbol__annotation(sym);
1370 struct sym_hist *h = annotation__histogram(notes, evidx);
1371
1372 memset(h, 0, sizeof(*notes->src->histograms) * notes->src->nr_histograms);
1373}
1374
1375void symbol__annotate_decay_histogram(struct symbol *sym, int evidx)
1376{
1377 struct annotation *notes = symbol__annotation(sym);
1378 struct sym_hist *h = annotation__histogram(notes, evidx);
1379 struct annotation_line *al;
1380
1381 h->nr_samples = 0;
1382 list_for_each_entry(al, ¬es->src->source, node) {
1383 struct sym_hist_entry *entry;
1384
1385 if (al->offset == -1)
1386 continue;
1387
1388 entry = annotated_source__hist_entry(notes->src, evidx, al->offset);
1389 if (entry == NULL)
1390 continue;
1391
1392 entry->nr_samples = entry->nr_samples * 7 / 8;
1393 h->nr_samples += entry->nr_samples;
1394 }
1395}
1396
1397void annotated_source__purge(struct annotated_source *as)
1398{
1399 struct annotation_line *al, *n;
1400
1401 list_for_each_entry_safe(al, n, &as->source, node) {
1402 list_del_init(&al->node);
1403 disasm_line__free(disasm_line(al));
1404 }
1405}
1406
1407static size_t disasm_line__fprintf(struct disasm_line *dl, FILE *fp)
1408{
1409 size_t printed;
1410
1411 if (dl->al.offset == -1)
1412 return fprintf(fp, "%s\n", dl->al.line);
1413
1414 printed = fprintf(fp, "%#" PRIx64 " %s", dl->al.offset, dl->ins.name);
1415
1416 if (dl->ops.raw[0] != '\0') {
1417 printed += fprintf(fp, "%.*s %s\n", 6 - (int)printed, " ",
1418 dl->ops.raw);
1419 }
1420
1421 return printed + fprintf(fp, "\n");
1422}
1423
1424size_t disasm__fprintf(struct list_head *head, FILE *fp)
1425{
1426 struct disasm_line *pos;
1427 size_t printed = 0;
1428
1429 list_for_each_entry(pos, head, al.node)
1430 printed += disasm_line__fprintf(pos, fp);
1431
1432 return printed;
1433}
1434
1435bool disasm_line__is_valid_local_jump(struct disasm_line *dl, struct symbol *sym)
1436{
1437 if (!dl || !dl->ins.ops || !ins__is_jump(&dl->ins) ||
1438 !disasm_line__has_local_offset(dl) || dl->ops.target.offset < 0 ||
1439 dl->ops.target.offset >= (s64)symbol__size(sym))
1440 return false;
1441
1442 return true;
1443}
1444
1445static void
1446annotation__mark_jump_targets(struct annotation *notes, struct symbol *sym)
1447{
1448 struct annotation_line *al;
1449
1450 /* PLT symbols contain external offsets */
1451 if (strstr(sym->name, "@plt"))
1452 return;
1453
1454 list_for_each_entry(al, ¬es->src->source, node) {
1455 struct disasm_line *dl;
1456 struct annotation_line *target;
1457
1458 dl = disasm_line(al);
1459
1460 if (!disasm_line__is_valid_local_jump(dl, sym))
1461 continue;
1462
1463 target = annotated_source__get_line(notes->src,
1464 dl->ops.target.offset);
1465 /*
1466 * FIXME: Oops, no jump target? Buggy disassembler? Or do we
1467 * have to adjust to the previous offset?
1468 */
1469 if (target == NULL)
1470 continue;
1471
1472 if (++target->jump_sources > notes->src->max_jump_sources)
1473 notes->src->max_jump_sources = target->jump_sources;
1474 }
1475}
1476
1477static void annotation__set_index(struct annotation *notes)
1478{
1479 struct annotation_line *al;
1480 struct annotated_source *src = notes->src;
1481
1482 src->widths.max_line_len = 0;
1483 src->nr_entries = 0;
1484 src->nr_asm_entries = 0;
1485
1486 list_for_each_entry(al, &src->source, node) {
1487 size_t line_len = strlen(al->line);
1488
1489 if (src->widths.max_line_len < line_len)
1490 src->widths.max_line_len = line_len;
1491 al->idx = src->nr_entries++;
1492 if (al->offset != -1)
1493 al->idx_asm = src->nr_asm_entries++;
1494 else
1495 al->idx_asm = -1;
1496 }
1497}
1498
1499static inline int width_jumps(int n)
1500{
1501 if (n >= 100)
1502 return 5;
1503 if (n / 10)
1504 return 2;
1505 return 1;
1506}
1507
1508static int annotation__max_ins_name(struct annotation *notes)
1509{
1510 int max_name = 0, len;
1511 struct annotation_line *al;
1512
1513 list_for_each_entry(al, ¬es->src->source, node) {
1514 if (al->offset == -1)
1515 continue;
1516
1517 len = strlen(disasm_line(al)->ins.name);
1518 if (max_name < len)
1519 max_name = len;
1520 }
1521
1522 return max_name;
1523}
1524
1525static void
1526annotation__init_column_widths(struct annotation *notes, struct symbol *sym)
1527{
1528 notes->src->widths.addr = notes->src->widths.target =
1529 notes->src->widths.min_addr = hex_width(symbol__size(sym));
1530 notes->src->widths.max_addr = hex_width(sym->end);
1531 notes->src->widths.jumps = width_jumps(notes->src->max_jump_sources);
1532 notes->src->widths.max_ins_name = annotation__max_ins_name(notes);
1533}
1534
1535void annotation__update_column_widths(struct annotation *notes)
1536{
1537 if (annotate_opts.use_offset)
1538 notes->src->widths.target = notes->src->widths.min_addr;
1539 else if (annotate_opts.full_addr)
1540 notes->src->widths.target = BITS_PER_LONG / 4;
1541 else
1542 notes->src->widths.target = notes->src->widths.max_addr;
1543
1544 notes->src->widths.addr = notes->src->widths.target;
1545
1546 if (annotate_opts.show_nr_jumps)
1547 notes->src->widths.addr += notes->src->widths.jumps + 1;
1548}
1549
1550void annotation__toggle_full_addr(struct annotation *notes, struct map_symbol *ms)
1551{
1552 annotate_opts.full_addr = !annotate_opts.full_addr;
1553
1554 if (annotate_opts.full_addr)
1555 notes->src->start = map__objdump_2mem(ms->map, ms->sym->start);
1556 else
1557 notes->src->start = map__rip_2objdump(ms->map, ms->sym->start);
1558
1559 annotation__update_column_widths(notes);
1560}
1561
1562static void annotation__calc_lines(struct annotation *notes, struct map_symbol *ms,
1563 struct rb_root *root)
1564{
1565 struct annotation_line *al;
1566 struct rb_root tmp_root = RB_ROOT;
1567
1568 list_for_each_entry(al, ¬es->src->source, node) {
1569 double percent_max = 0.0;
1570 u64 addr;
1571 int i;
1572
1573 for (i = 0; i < al->data_nr; i++) {
1574 double percent;
1575
1576 percent = annotation_data__percent(&al->data[i],
1577 annotate_opts.percent_type);
1578
1579 if (percent > percent_max)
1580 percent_max = percent;
1581 }
1582
1583 if (percent_max <= 0.5)
1584 continue;
1585
1586 addr = map__rip_2objdump(ms->map, ms->sym->start);
1587 al->path = get_srcline(map__dso(ms->map), addr + al->offset, NULL,
1588 false, true, ms->sym->start + al->offset);
1589 insert_source_line(&tmp_root, al);
1590 }
1591
1592 resort_source_line(root, &tmp_root);
1593}
1594
1595static void symbol__calc_lines(struct map_symbol *ms, struct rb_root *root)
1596{
1597 struct annotation *notes = symbol__annotation(ms->sym);
1598
1599 annotation__calc_lines(notes, ms, root);
1600}
1601
1602int symbol__tty_annotate2(struct map_symbol *ms, struct evsel *evsel)
1603{
1604 struct dso *dso = map__dso(ms->map);
1605 struct symbol *sym = ms->sym;
1606 struct rb_root source_line = RB_ROOT;
1607 struct hists *hists = evsel__hists(evsel);
1608 char buf[1024];
1609 int err;
1610
1611 err = symbol__annotate2(ms, evsel, NULL);
1612 if (err) {
1613 char msg[BUFSIZ];
1614
1615 dso__set_annotate_warned(dso);
1616 symbol__strerror_disassemble(ms, err, msg, sizeof(msg));
1617 ui__error("Couldn't annotate %s:\n%s", sym->name, msg);
1618 return -1;
1619 }
1620
1621 if (annotate_opts.print_lines) {
1622 srcline_full_filename = annotate_opts.full_path;
1623 symbol__calc_lines(ms, &source_line);
1624 print_summary(&source_line, dso__long_name(dso));
1625 }
1626
1627 hists__scnprintf_title(hists, buf, sizeof(buf));
1628 fprintf(stdout, "%s, [percent: %s]\n%s() %s\n",
1629 buf, percent_type_str(annotate_opts.percent_type), sym->name, dso__long_name(dso));
1630 symbol__annotate_fprintf2(sym, stdout);
1631
1632 annotated_source__purge(symbol__annotation(sym)->src);
1633
1634 return 0;
1635}
1636
1637int symbol__tty_annotate(struct map_symbol *ms, struct evsel *evsel)
1638{
1639 struct dso *dso = map__dso(ms->map);
1640 struct symbol *sym = ms->sym;
1641 struct rb_root source_line = RB_ROOT;
1642 int err;
1643
1644 err = symbol__annotate(ms, evsel, NULL);
1645 if (err) {
1646 char msg[BUFSIZ];
1647
1648 dso__set_annotate_warned(dso);
1649 symbol__strerror_disassemble(ms, err, msg, sizeof(msg));
1650 ui__error("Couldn't annotate %s:\n%s", sym->name, msg);
1651 return -1;
1652 }
1653
1654 symbol__calc_percent(sym, evsel);
1655
1656 if (annotate_opts.print_lines) {
1657 srcline_full_filename = annotate_opts.full_path;
1658 symbol__calc_lines(ms, &source_line);
1659 print_summary(&source_line, dso__long_name(dso));
1660 }
1661
1662 symbol__annotate_printf(ms, evsel);
1663
1664 annotated_source__purge(symbol__annotation(sym)->src);
1665
1666 return 0;
1667}
1668
1669bool ui__has_annotation(void)
1670{
1671 return use_browser == 1 && perf_hpp_list.sym;
1672}
1673
1674
1675static double annotation_line__max_percent(struct annotation_line *al,
1676 unsigned int percent_type)
1677{
1678 double percent_max = 0.0;
1679 int i;
1680
1681 for (i = 0; i < al->data_nr; i++) {
1682 double percent;
1683
1684 percent = annotation_data__percent(&al->data[i],
1685 percent_type);
1686
1687 if (percent > percent_max)
1688 percent_max = percent;
1689 }
1690
1691 return percent_max;
1692}
1693
1694static void disasm_line__write(struct disasm_line *dl, struct annotation *notes,
1695 void *obj, char *bf, size_t size,
1696 void (*obj__printf)(void *obj, const char *fmt, ...),
1697 void (*obj__write_graph)(void *obj, int graph))
1698{
1699 if (dl->ins.ops && dl->ins.ops->scnprintf) {
1700 if (ins__is_jump(&dl->ins)) {
1701 bool fwd;
1702
1703 if (dl->ops.target.outside)
1704 goto call_like;
1705 fwd = dl->ops.target.offset > dl->al.offset;
1706 obj__write_graph(obj, fwd ? DARROW_CHAR : UARROW_CHAR);
1707 obj__printf(obj, " ");
1708 } else if (ins__is_call(&dl->ins)) {
1709call_like:
1710 obj__write_graph(obj, RARROW_CHAR);
1711 obj__printf(obj, " ");
1712 } else if (ins__is_ret(&dl->ins)) {
1713 obj__write_graph(obj, LARROW_CHAR);
1714 obj__printf(obj, " ");
1715 } else {
1716 obj__printf(obj, " ");
1717 }
1718 } else {
1719 obj__printf(obj, " ");
1720 }
1721
1722 disasm_line__scnprintf(dl, bf, size, !annotate_opts.use_offset,
1723 notes->src->widths.max_ins_name);
1724}
1725
1726static void ipc_coverage_string(char *bf, int size, struct annotation *notes)
1727{
1728 double ipc = 0.0, coverage = 0.0;
1729 struct annotated_branch *branch = annotation__get_branch(notes);
1730
1731 if (branch && branch->hit_cycles)
1732 ipc = branch->hit_insn / ((double)branch->hit_cycles);
1733
1734 if (branch && branch->total_insn) {
1735 coverage = branch->cover_insn * 100.0 /
1736 ((double)branch->total_insn);
1737 }
1738
1739 scnprintf(bf, size, "(Average IPC: %.2f, IPC Coverage: %.1f%%)",
1740 ipc, coverage);
1741}
1742
1743int annotation_br_cntr_abbr_list(char **str, struct evsel *evsel, bool header)
1744{
1745 struct evsel *pos;
1746 struct strbuf sb;
1747
1748 if (evsel->evlist->nr_br_cntr <= 0)
1749 return -ENOTSUP;
1750
1751 strbuf_init(&sb, /*hint=*/ 0);
1752
1753 if (header && strbuf_addf(&sb, "# Branch counter abbr list:\n"))
1754 goto err;
1755
1756 evlist__for_each_entry(evsel->evlist, pos) {
1757 if (!(pos->core.attr.branch_sample_type & PERF_SAMPLE_BRANCH_COUNTERS))
1758 continue;
1759 if (header && strbuf_addf(&sb, "#"))
1760 goto err;
1761
1762 if (strbuf_addf(&sb, " %s = %s\n", pos->name, pos->abbr_name))
1763 goto err;
1764 }
1765
1766 if (header && strbuf_addf(&sb, "#"))
1767 goto err;
1768 if (strbuf_addf(&sb, " '-' No event occurs\n"))
1769 goto err;
1770
1771 if (header && strbuf_addf(&sb, "#"))
1772 goto err;
1773 if (strbuf_addf(&sb, " '+' Event occurrences may be lost due to branch counter saturated\n"))
1774 goto err;
1775
1776 *str = strbuf_detach(&sb, NULL);
1777
1778 return 0;
1779err:
1780 strbuf_release(&sb);
1781 return -ENOMEM;
1782}
1783
1784/* Assume the branch counter saturated at 3 */
1785#define ANNOTATION_BR_CNTR_SATURATION 3
1786
1787int annotation_br_cntr_entry(char **str, int br_cntr_nr,
1788 u64 *br_cntr, int num_aggr,
1789 struct evsel *evsel)
1790{
1791 struct evsel *pos = evsel ? evlist__first(evsel->evlist) : NULL;
1792 bool saturated = false;
1793 int i, j, avg, used;
1794 struct strbuf sb;
1795
1796 strbuf_init(&sb, /*hint=*/ 0);
1797 for (i = 0; i < br_cntr_nr; i++) {
1798 used = 0;
1799 avg = ceil((double)(br_cntr[i] & ~ANNOTATION__BR_CNTR_SATURATED_FLAG) /
1800 (double)num_aggr);
1801
1802 /*
1803 * A histogram with the abbr name is displayed by default.
1804 * With -v, the exact number of branch counter is displayed.
1805 */
1806 if (verbose) {
1807 evlist__for_each_entry_from(evsel->evlist, pos) {
1808 if ((pos->core.attr.branch_sample_type & PERF_SAMPLE_BRANCH_COUNTERS) &&
1809 (pos->br_cntr_idx == i))
1810 break;
1811 }
1812 if (strbuf_addstr(&sb, pos->abbr_name))
1813 goto err;
1814
1815 if (!br_cntr[i]) {
1816 if (strbuf_addstr(&sb, "=-"))
1817 goto err;
1818 } else {
1819 if (strbuf_addf(&sb, "=%d", avg))
1820 goto err;
1821 }
1822 if (br_cntr[i] & ANNOTATION__BR_CNTR_SATURATED_FLAG) {
1823 if (strbuf_addch(&sb, '+'))
1824 goto err;
1825 } else {
1826 if (strbuf_addch(&sb, ' '))
1827 goto err;
1828 }
1829
1830 if ((i < br_cntr_nr - 1) && strbuf_addch(&sb, ','))
1831 goto err;
1832 continue;
1833 }
1834
1835 if (strbuf_addch(&sb, '|'))
1836 goto err;
1837
1838 if (!br_cntr[i]) {
1839 if (strbuf_addch(&sb, '-'))
1840 goto err;
1841 used++;
1842 } else {
1843 evlist__for_each_entry_from(evsel->evlist, pos) {
1844 if ((pos->core.attr.branch_sample_type & PERF_SAMPLE_BRANCH_COUNTERS) &&
1845 (pos->br_cntr_idx == i))
1846 break;
1847 }
1848 if (br_cntr[i] & ANNOTATION__BR_CNTR_SATURATED_FLAG)
1849 saturated = true;
1850
1851 for (j = 0; j < avg; j++, used++) {
1852 /* Print + if the number of logged events > 3 */
1853 if (j >= ANNOTATION_BR_CNTR_SATURATION) {
1854 saturated = true;
1855 break;
1856 }
1857 if (strbuf_addstr(&sb, pos->abbr_name))
1858 goto err;
1859 }
1860
1861 if (saturated) {
1862 if (strbuf_addch(&sb, '+'))
1863 goto err;
1864 used++;
1865 }
1866 pos = list_next_entry(pos, core.node);
1867 }
1868
1869 for (j = used; j < ANNOTATION_BR_CNTR_SATURATION + 1; j++) {
1870 if (strbuf_addch(&sb, ' '))
1871 goto err;
1872 }
1873 }
1874
1875 if (!verbose && strbuf_addch(&sb, br_cntr_nr ? '|' : ' '))
1876 goto err;
1877
1878 *str = strbuf_detach(&sb, NULL);
1879
1880 return 0;
1881err:
1882 strbuf_release(&sb);
1883 return -ENOMEM;
1884}
1885
1886static void __annotation_line__write(struct annotation_line *al, struct annotation *notes,
1887 bool first_line, bool current_entry, bool change_color, int width,
1888 void *obj, unsigned int percent_type,
1889 int (*obj__set_color)(void *obj, int color),
1890 void (*obj__set_percent_color)(void *obj, double percent, bool current),
1891 int (*obj__set_jumps_percent_color)(void *obj, int nr, bool current),
1892 void (*obj__printf)(void *obj, const char *fmt, ...),
1893 void (*obj__write_graph)(void *obj, int graph))
1894
1895{
1896 double percent_max = annotation_line__max_percent(al, percent_type);
1897 int pcnt_width = annotation__pcnt_width(notes),
1898 cycles_width = annotation__cycles_width(notes);
1899 bool show_title = false;
1900 char bf[256];
1901 int printed;
1902
1903 if (first_line && (al->offset == -1 || percent_max == 0.0)) {
1904 if (notes->branch && al->cycles) {
1905 if (al->cycles->ipc == 0.0 && al->cycles->avg == 0)
1906 show_title = true;
1907 } else
1908 show_title = true;
1909 }
1910
1911 if (al->offset != -1 && percent_max != 0.0) {
1912 int i;
1913
1914 for (i = 0; i < al->data_nr; i++) {
1915 double percent;
1916
1917 percent = annotation_data__percent(&al->data[i], percent_type);
1918
1919 obj__set_percent_color(obj, percent, current_entry);
1920 if (symbol_conf.show_total_period) {
1921 obj__printf(obj, "%11" PRIu64 " ", al->data[i].he.period);
1922 } else if (symbol_conf.show_nr_samples) {
1923 obj__printf(obj, "%7" PRIu64 " ",
1924 al->data[i].he.nr_samples);
1925 } else {
1926 obj__printf(obj, "%7.2f ", percent);
1927 }
1928 }
1929 } else {
1930 obj__set_percent_color(obj, 0, current_entry);
1931
1932 if (!show_title)
1933 obj__printf(obj, "%-*s", pcnt_width, " ");
1934 else {
1935 obj__printf(obj, "%-*s", pcnt_width,
1936 symbol_conf.show_total_period ? "Period" :
1937 symbol_conf.show_nr_samples ? "Samples" : "Percent");
1938 }
1939 }
1940
1941 if (notes->branch) {
1942 if (al->cycles && al->cycles->ipc)
1943 obj__printf(obj, "%*.2f ", ANNOTATION__IPC_WIDTH - 1, al->cycles->ipc);
1944 else if (!show_title)
1945 obj__printf(obj, "%*s", ANNOTATION__IPC_WIDTH, " ");
1946 else
1947 obj__printf(obj, "%*s ", ANNOTATION__IPC_WIDTH - 1, "IPC");
1948
1949 if (!annotate_opts.show_minmax_cycle) {
1950 if (al->cycles && al->cycles->avg)
1951 obj__printf(obj, "%*" PRIu64 " ",
1952 ANNOTATION__CYCLES_WIDTH - 1, al->cycles->avg);
1953 else if (!show_title)
1954 obj__printf(obj, "%*s",
1955 ANNOTATION__CYCLES_WIDTH, " ");
1956 else
1957 obj__printf(obj, "%*s ",
1958 ANNOTATION__CYCLES_WIDTH - 1,
1959 "Cycle");
1960 } else {
1961 if (al->cycles) {
1962 char str[32];
1963
1964 scnprintf(str, sizeof(str),
1965 "%" PRIu64 "(%" PRIu64 "/%" PRIu64 ")",
1966 al->cycles->avg, al->cycles->min,
1967 al->cycles->max);
1968
1969 obj__printf(obj, "%*s ",
1970 ANNOTATION__MINMAX_CYCLES_WIDTH - 1,
1971 str);
1972 } else if (!show_title)
1973 obj__printf(obj, "%*s",
1974 ANNOTATION__MINMAX_CYCLES_WIDTH,
1975 " ");
1976 else
1977 obj__printf(obj, "%*s ",
1978 ANNOTATION__MINMAX_CYCLES_WIDTH - 1,
1979 "Cycle(min/max)");
1980 }
1981
1982 if (annotate_opts.show_br_cntr) {
1983 if (show_title) {
1984 obj__printf(obj, "%*s ",
1985 ANNOTATION__BR_CNTR_WIDTH,
1986 "Branch Counter");
1987 } else {
1988 char *buf;
1989
1990 if (!annotation_br_cntr_entry(&buf, al->br_cntr_nr, al->br_cntr,
1991 al->num_aggr, al->evsel)) {
1992 obj__printf(obj, "%*s ", ANNOTATION__BR_CNTR_WIDTH, buf);
1993 free(buf);
1994 }
1995 }
1996 }
1997
1998 if (show_title && !*al->line) {
1999 ipc_coverage_string(bf, sizeof(bf), notes);
2000 obj__printf(obj, "%*s", ANNOTATION__AVG_IPC_WIDTH, bf);
2001 }
2002 }
2003
2004 obj__printf(obj, " ");
2005
2006 if (!*al->line)
2007 obj__printf(obj, "%-*s", width - pcnt_width - cycles_width, " ");
2008 else if (al->offset == -1) {
2009 if (al->line_nr && annotate_opts.show_linenr)
2010 printed = scnprintf(bf, sizeof(bf), "%-*d ",
2011 notes->src->widths.addr + 1, al->line_nr);
2012 else
2013 printed = scnprintf(bf, sizeof(bf), "%-*s ",
2014 notes->src->widths.addr, " ");
2015 obj__printf(obj, bf);
2016 obj__printf(obj, "%-*s", width - printed - pcnt_width - cycles_width + 1, al->line);
2017 } else {
2018 u64 addr = al->offset;
2019 int color = -1;
2020
2021 if (!annotate_opts.use_offset)
2022 addr += notes->src->start;
2023
2024 if (!annotate_opts.use_offset) {
2025 printed = scnprintf(bf, sizeof(bf), "%" PRIx64 ": ", addr);
2026 } else {
2027 if (al->jump_sources &&
2028 annotate_opts.offset_level >= ANNOTATION__OFFSET_JUMP_TARGETS) {
2029 if (annotate_opts.show_nr_jumps) {
2030 int prev;
2031 printed = scnprintf(bf, sizeof(bf), "%*d ",
2032 notes->src->widths.jumps,
2033 al->jump_sources);
2034 prev = obj__set_jumps_percent_color(obj, al->jump_sources,
2035 current_entry);
2036 obj__printf(obj, bf);
2037 obj__set_color(obj, prev);
2038 }
2039print_addr:
2040 printed = scnprintf(bf, sizeof(bf), "%*" PRIx64 ": ",
2041 notes->src->widths.target, addr);
2042 } else if (ins__is_call(&disasm_line(al)->ins) &&
2043 annotate_opts.offset_level >= ANNOTATION__OFFSET_CALL) {
2044 goto print_addr;
2045 } else if (annotate_opts.offset_level == ANNOTATION__MAX_OFFSET_LEVEL) {
2046 goto print_addr;
2047 } else {
2048 printed = scnprintf(bf, sizeof(bf), "%-*s ",
2049 notes->src->widths.addr, " ");
2050 }
2051 }
2052
2053 if (change_color)
2054 color = obj__set_color(obj, HE_COLORSET_ADDR);
2055 obj__printf(obj, bf);
2056 if (change_color)
2057 obj__set_color(obj, color);
2058
2059 disasm_line__write(disasm_line(al), notes, obj, bf, sizeof(bf), obj__printf, obj__write_graph);
2060
2061 obj__printf(obj, "%-*s", width - pcnt_width - cycles_width - 3 - printed, bf);
2062 }
2063
2064}
2065
2066void annotation_line__write(struct annotation_line *al, struct annotation *notes,
2067 struct annotation_write_ops *wops)
2068{
2069 __annotation_line__write(al, notes, wops->first_line, wops->current_entry,
2070 wops->change_color, wops->width, wops->obj,
2071 annotate_opts.percent_type,
2072 wops->set_color, wops->set_percent_color,
2073 wops->set_jumps_percent_color, wops->printf,
2074 wops->write_graph);
2075}
2076
2077int symbol__annotate2(struct map_symbol *ms, struct evsel *evsel,
2078 struct arch **parch)
2079{
2080 struct symbol *sym = ms->sym;
2081 struct annotation *notes = symbol__annotation(sym);
2082 size_t size = symbol__size(sym);
2083 int err;
2084
2085 err = symbol__annotate(ms, evsel, parch);
2086 if (err)
2087 return err;
2088
2089 symbol__calc_percent(sym, evsel);
2090
2091 annotation__set_index(notes);
2092 annotation__mark_jump_targets(notes, sym);
2093
2094 err = annotation__compute_ipc(notes, size, evsel);
2095 if (err)
2096 return err;
2097
2098 annotation__init_column_widths(notes, sym);
2099 annotation__update_column_widths(notes);
2100 sym->annotate2 = 1;
2101
2102 return 0;
2103}
2104
2105const char * const perf_disassembler__strs[] = {
2106 [PERF_DISASM_UNKNOWN] = "unknown",
2107 [PERF_DISASM_LLVM] = "llvm",
2108 [PERF_DISASM_CAPSTONE] = "capstone",
2109 [PERF_DISASM_OBJDUMP] = "objdump",
2110};
2111
2112
2113static void annotation_options__add_disassembler(struct annotation_options *options,
2114 enum perf_disassembler dis)
2115{
2116 for (u8 i = 0; i < ARRAY_SIZE(options->disassemblers); i++) {
2117 if (options->disassemblers[i] == dis) {
2118 /* Disassembler is already present then don't add again. */
2119 return;
2120 }
2121 if (options->disassemblers[i] == PERF_DISASM_UNKNOWN) {
2122 /* Found a free slot. */
2123 options->disassemblers[i] = dis;
2124 return;
2125 }
2126 }
2127 pr_err("Failed to add disassembler %d\n", dis);
2128}
2129
2130static int annotation_options__add_disassemblers_str(struct annotation_options *options,
2131 const char *str)
2132{
2133 while (str && *str != '\0') {
2134 const char *comma = strchr(str, ',');
2135 int len = comma ? comma - str : (int)strlen(str);
2136 bool match = false;
2137
2138 for (u8 i = 0; i < ARRAY_SIZE(perf_disassembler__strs); i++) {
2139 const char *dis_str = perf_disassembler__strs[i];
2140
2141 if (len == (int)strlen(dis_str) && !strncmp(str, dis_str, len)) {
2142 annotation_options__add_disassembler(options, i);
2143 match = true;
2144 break;
2145 }
2146 }
2147 if (!match) {
2148 pr_err("Invalid disassembler '%.*s'\n", len, str);
2149 return -1;
2150 }
2151 str = comma ? comma + 1 : NULL;
2152 }
2153 return 0;
2154}
2155
2156static int annotation__config(const char *var, const char *value, void *data)
2157{
2158 struct annotation_options *opt = data;
2159
2160 if (!strstarts(var, "annotate."))
2161 return 0;
2162
2163 if (!strcmp(var, "annotate.offset_level")) {
2164 perf_config_u8(&opt->offset_level, "offset_level", value);
2165
2166 if (opt->offset_level > ANNOTATION__MAX_OFFSET_LEVEL)
2167 opt->offset_level = ANNOTATION__MAX_OFFSET_LEVEL;
2168 else if (opt->offset_level < ANNOTATION__MIN_OFFSET_LEVEL)
2169 opt->offset_level = ANNOTATION__MIN_OFFSET_LEVEL;
2170 } else if (!strcmp(var, "annotate.disassemblers")) {
2171 int err = annotation_options__add_disassemblers_str(opt, value);
2172
2173 if (err)
2174 return err;
2175 } else if (!strcmp(var, "annotate.hide_src_code")) {
2176 opt->hide_src_code = perf_config_bool("hide_src_code", value);
2177 } else if (!strcmp(var, "annotate.jump_arrows")) {
2178 opt->jump_arrows = perf_config_bool("jump_arrows", value);
2179 } else if (!strcmp(var, "annotate.show_linenr")) {
2180 opt->show_linenr = perf_config_bool("show_linenr", value);
2181 } else if (!strcmp(var, "annotate.show_nr_jumps")) {
2182 opt->show_nr_jumps = perf_config_bool("show_nr_jumps", value);
2183 } else if (!strcmp(var, "annotate.show_nr_samples")) {
2184 symbol_conf.show_nr_samples = perf_config_bool("show_nr_samples",
2185 value);
2186 } else if (!strcmp(var, "annotate.show_total_period")) {
2187 symbol_conf.show_total_period = perf_config_bool("show_total_period",
2188 value);
2189 } else if (!strcmp(var, "annotate.use_offset")) {
2190 opt->use_offset = perf_config_bool("use_offset", value);
2191 } else if (!strcmp(var, "annotate.disassembler_style")) {
2192 opt->disassembler_style = strdup(value);
2193 if (!opt->disassembler_style) {
2194 pr_err("Not enough memory for annotate.disassembler_style\n");
2195 return -1;
2196 }
2197 } else if (!strcmp(var, "annotate.objdump")) {
2198 opt->objdump_path = strdup(value);
2199 if (!opt->objdump_path) {
2200 pr_err("Not enough memory for annotate.objdump\n");
2201 return -1;
2202 }
2203 } else if (!strcmp(var, "annotate.addr2line")) {
2204 symbol_conf.addr2line_path = strdup(value);
2205 if (!symbol_conf.addr2line_path) {
2206 pr_err("Not enough memory for annotate.addr2line\n");
2207 return -1;
2208 }
2209 } else if (!strcmp(var, "annotate.demangle")) {
2210 symbol_conf.demangle = perf_config_bool("demangle", value);
2211 } else if (!strcmp(var, "annotate.demangle_kernel")) {
2212 symbol_conf.demangle_kernel = perf_config_bool("demangle_kernel", value);
2213 } else {
2214 pr_debug("%s variable unknown, ignoring...", var);
2215 }
2216
2217 return 0;
2218}
2219
2220void annotation_options__init(void)
2221{
2222 struct annotation_options *opt = &annotate_opts;
2223
2224 memset(opt, 0, sizeof(*opt));
2225
2226 /* Default values. */
2227 opt->use_offset = true;
2228 opt->jump_arrows = true;
2229 opt->annotate_src = true;
2230 opt->offset_level = ANNOTATION__OFFSET_JUMP_TARGETS;
2231 opt->percent_type = PERCENT_PERIOD_LOCAL;
2232}
2233
2234void annotation_options__exit(void)
2235{
2236 zfree(&annotate_opts.disassembler_style);
2237 zfree(&annotate_opts.objdump_path);
2238}
2239
2240static void annotation_options__default_init_disassemblers(struct annotation_options *options)
2241{
2242 if (options->disassemblers[0] != PERF_DISASM_UNKNOWN) {
2243 /* Already initialized. */
2244 return;
2245 }
2246#ifdef HAVE_LIBLLVM_SUPPORT
2247 annotation_options__add_disassembler(options, PERF_DISASM_LLVM);
2248#endif
2249#ifdef HAVE_LIBCAPSTONE_SUPPORT
2250 annotation_options__add_disassembler(options, PERF_DISASM_CAPSTONE);
2251#endif
2252 annotation_options__add_disassembler(options, PERF_DISASM_OBJDUMP);
2253}
2254
2255void annotation_config__init(void)
2256{
2257 perf_config(annotation__config, &annotate_opts);
2258 annotation_options__default_init_disassemblers(&annotate_opts);
2259}
2260
2261static unsigned int parse_percent_type(char *str1, char *str2)
2262{
2263 unsigned int type = (unsigned int) -1;
2264
2265 if (!strcmp("period", str1)) {
2266 if (!strcmp("local", str2))
2267 type = PERCENT_PERIOD_LOCAL;
2268 else if (!strcmp("global", str2))
2269 type = PERCENT_PERIOD_GLOBAL;
2270 }
2271
2272 if (!strcmp("hits", str1)) {
2273 if (!strcmp("local", str2))
2274 type = PERCENT_HITS_LOCAL;
2275 else if (!strcmp("global", str2))
2276 type = PERCENT_HITS_GLOBAL;
2277 }
2278
2279 return type;
2280}
2281
2282int annotate_parse_percent_type(const struct option *opt __maybe_unused, const char *_str,
2283 int unset __maybe_unused)
2284{
2285 unsigned int type;
2286 char *str1, *str2;
2287 int err = -1;
2288
2289 str1 = strdup(_str);
2290 if (!str1)
2291 return -ENOMEM;
2292
2293 str2 = strchr(str1, '-');
2294 if (!str2)
2295 goto out;
2296
2297 *str2++ = 0;
2298
2299 type = parse_percent_type(str1, str2);
2300 if (type == (unsigned int) -1)
2301 type = parse_percent_type(str2, str1);
2302 if (type != (unsigned int) -1) {
2303 annotate_opts.percent_type = type;
2304 err = 0;
2305 }
2306
2307out:
2308 free(str1);
2309 return err;
2310}
2311
2312int annotate_check_args(void)
2313{
2314 struct annotation_options *args = &annotate_opts;
2315
2316 if (args->prefix_strip && !args->prefix) {
2317 pr_err("--prefix-strip requires --prefix\n");
2318 return -1;
2319 }
2320 return 0;
2321}
2322
2323/*
2324 * Get register number and access offset from the given instruction.
2325 * It assumes AT&T x86 asm format like OFFSET(REG). Maybe it needs
2326 * to revisit the format when it handles different architecture.
2327 * Fills @reg and @offset when return 0.
2328 */
2329static int extract_reg_offset(struct arch *arch, const char *str,
2330 struct annotated_op_loc *op_loc)
2331{
2332 char *p;
2333 char *regname;
2334
2335 if (arch->objdump.register_char == 0)
2336 return -1;
2337
2338 /*
2339 * It should start from offset, but it's possible to skip 0
2340 * in the asm. So 0(%rax) should be same as (%rax).
2341 *
2342 * However, it also start with a segment select register like
2343 * %gs:0x18(%rbx). In that case it should skip the part.
2344 */
2345 if (*str == arch->objdump.register_char) {
2346 if (arch__is(arch, "x86")) {
2347 /* FIXME: Handle other segment registers */
2348 if (!strncmp(str, "%gs:", 4))
2349 op_loc->segment = INSN_SEG_X86_GS;
2350 }
2351
2352 while (*str && !isdigit(*str) &&
2353 *str != arch->objdump.memory_ref_char)
2354 str++;
2355 }
2356
2357 op_loc->offset = strtol(str, &p, 0);
2358
2359 p = strchr(p, arch->objdump.register_char);
2360 if (p == NULL)
2361 return -1;
2362
2363 regname = strdup(p);
2364 if (regname == NULL)
2365 return -1;
2366
2367 op_loc->reg1 = get_dwarf_regnum(regname, arch->e_machine, arch->e_flags);
2368 free(regname);
2369
2370 /* Get the second register */
2371 if (op_loc->multi_regs) {
2372 p = strchr(p + 1, arch->objdump.register_char);
2373 if (p == NULL)
2374 return -1;
2375
2376 regname = strdup(p);
2377 if (regname == NULL)
2378 return -1;
2379
2380 op_loc->reg2 = get_dwarf_regnum(regname, arch->e_machine, arch->e_flags);
2381 free(regname);
2382 }
2383 return 0;
2384}
2385
2386/**
2387 * annotate_get_insn_location - Get location of instruction
2388 * @arch: the architecture info
2389 * @dl: the target instruction
2390 * @loc: a buffer to save the data
2391 *
2392 * Get detailed location info (register and offset) in the instruction.
2393 * It needs both source and target operand and whether it accesses a
2394 * memory location. The offset field is meaningful only when the
2395 * corresponding mem flag is set. The reg2 field is meaningful only
2396 * when multi_regs flag is set.
2397 *
2398 * Some examples on x86:
2399 *
2400 * mov (%rax), %rcx # src_reg1 = rax, src_mem = 1, src_offset = 0
2401 * # dst_reg1 = rcx, dst_mem = 0
2402 *
2403 * mov 0x18, %r8 # src_reg1 = -1, src_mem = 0
2404 * # dst_reg1 = r8, dst_mem = 0
2405 *
2406 * mov %rsi, 8(%rbx,%rcx,4) # src_reg1 = rsi, src_mem = 0, src_multi_regs = 0
2407 * # dst_reg1 = rbx, dst_reg2 = rcx, dst_mem = 1
2408 * # dst_multi_regs = 1, dst_offset = 8
2409 */
2410int annotate_get_insn_location(struct arch *arch, struct disasm_line *dl,
2411 struct annotated_insn_loc *loc)
2412{
2413 struct ins_operands *ops;
2414 struct annotated_op_loc *op_loc;
2415 int i;
2416
2417 if (ins__is_lock(&dl->ins))
2418 ops = dl->ops.locked.ops;
2419 else
2420 ops = &dl->ops;
2421
2422 if (ops == NULL)
2423 return -1;
2424
2425 memset(loc, 0, sizeof(*loc));
2426
2427 for_each_insn_op_loc(loc, i, op_loc) {
2428 const char *insn_str = ops->source.raw;
2429 bool multi_regs = ops->source.multi_regs;
2430 bool mem_ref = ops->source.mem_ref;
2431
2432 if (i == INSN_OP_TARGET) {
2433 insn_str = ops->target.raw;
2434 multi_regs = ops->target.multi_regs;
2435 mem_ref = ops->target.mem_ref;
2436 }
2437
2438 /* Invalidate the register by default */
2439 op_loc->reg1 = -1;
2440 op_loc->reg2 = -1;
2441
2442 if (insn_str == NULL) {
2443 if (!arch__is(arch, "powerpc"))
2444 continue;
2445 }
2446
2447 /*
2448 * For powerpc, call get_powerpc_regs function which extracts the
2449 * required fields for op_loc, ie reg1, reg2, offset from the
2450 * raw instruction.
2451 */
2452 if (arch__is(arch, "powerpc")) {
2453 op_loc->mem_ref = mem_ref;
2454 op_loc->multi_regs = multi_regs;
2455 get_powerpc_regs(dl->raw.raw_insn, !i, op_loc);
2456 } else if (strchr(insn_str, arch->objdump.memory_ref_char)) {
2457 op_loc->mem_ref = true;
2458 op_loc->multi_regs = multi_regs;
2459 extract_reg_offset(arch, insn_str, op_loc);
2460 } else {
2461 char *s, *p = NULL;
2462
2463 if (arch__is(arch, "x86")) {
2464 /* FIXME: Handle other segment registers */
2465 if (!strncmp(insn_str, "%gs:", 4)) {
2466 op_loc->segment = INSN_SEG_X86_GS;
2467 op_loc->offset = strtol(insn_str + 4,
2468 &p, 0);
2469 if (p && p != insn_str + 4)
2470 op_loc->imm = true;
2471 continue;
2472 }
2473 }
2474
2475 s = strdup(insn_str);
2476 if (s == NULL)
2477 return -1;
2478
2479 if (*s == arch->objdump.register_char)
2480 op_loc->reg1 = get_dwarf_regnum(s, arch->e_machine, arch->e_flags);
2481 else if (*s == arch->objdump.imm_char) {
2482 op_loc->offset = strtol(s + 1, &p, 0);
2483 if (p && p != s + 1)
2484 op_loc->imm = true;
2485 }
2486 free(s);
2487 }
2488 }
2489
2490 return 0;
2491}
2492
2493static struct disasm_line *find_disasm_line(struct symbol *sym, u64 ip,
2494 bool allow_update)
2495{
2496 struct disasm_line *dl;
2497 struct annotation *notes;
2498
2499 notes = symbol__annotation(sym);
2500
2501 list_for_each_entry(dl, ¬es->src->source, al.node) {
2502 if (dl->al.offset == -1)
2503 continue;
2504
2505 if (sym->start + dl->al.offset == ip) {
2506 /*
2507 * llvm-objdump places "lock" in a separate line and
2508 * in that case, we want to get the next line.
2509 */
2510 if (ins__is_lock(&dl->ins) &&
2511 *dl->ops.raw == '\0' && allow_update) {
2512 ip++;
2513 continue;
2514 }
2515 return dl;
2516 }
2517 }
2518 return NULL;
2519}
2520
2521static struct annotated_item_stat *annotate_data_stat(struct list_head *head,
2522 const char *name)
2523{
2524 struct annotated_item_stat *istat;
2525
2526 list_for_each_entry(istat, head, list) {
2527 if (!strcmp(istat->name, name))
2528 return istat;
2529 }
2530
2531 istat = zalloc(sizeof(*istat));
2532 if (istat == NULL)
2533 return NULL;
2534
2535 istat->name = strdup(name);
2536 if ((istat->name == NULL) || (!strlen(istat->name))) {
2537 free(istat);
2538 return NULL;
2539 }
2540
2541 list_add_tail(&istat->list, head);
2542 return istat;
2543}
2544
2545static bool is_stack_operation(struct arch *arch, struct disasm_line *dl)
2546{
2547 if (arch__is(arch, "x86")) {
2548 if (!strncmp(dl->ins.name, "push", 4) ||
2549 !strncmp(dl->ins.name, "pop", 3) ||
2550 !strncmp(dl->ins.name, "call", 4) ||
2551 !strncmp(dl->ins.name, "ret", 3))
2552 return true;
2553 }
2554
2555 return false;
2556}
2557
2558static bool is_stack_canary(struct arch *arch, struct annotated_op_loc *loc)
2559{
2560 /* On x86_64, %gs:40 is used for stack canary */
2561 if (arch__is(arch, "x86")) {
2562 if (loc->segment == INSN_SEG_X86_GS && loc->imm &&
2563 loc->offset == 40)
2564 return true;
2565 }
2566
2567 return false;
2568}
2569
2570static struct disasm_line *
2571annotation__prev_asm_line(struct annotation *notes, struct disasm_line *curr)
2572{
2573 struct list_head *sources = ¬es->src->source;
2574 struct disasm_line *prev;
2575
2576 if (curr == list_first_entry(sources, struct disasm_line, al.node))
2577 return NULL;
2578
2579 prev = list_prev_entry(curr, al.node);
2580 while (prev->al.offset == -1 &&
2581 prev != list_first_entry(sources, struct disasm_line, al.node))
2582 prev = list_prev_entry(prev, al.node);
2583
2584 if (prev->al.offset == -1)
2585 return NULL;
2586
2587 return prev;
2588}
2589
2590static struct disasm_line *
2591annotation__next_asm_line(struct annotation *notes, struct disasm_line *curr)
2592{
2593 struct list_head *sources = ¬es->src->source;
2594 struct disasm_line *next;
2595
2596 if (curr == list_last_entry(sources, struct disasm_line, al.node))
2597 return NULL;
2598
2599 next = list_next_entry(curr, al.node);
2600 while (next->al.offset == -1 &&
2601 next != list_last_entry(sources, struct disasm_line, al.node))
2602 next = list_next_entry(next, al.node);
2603
2604 if (next->al.offset == -1)
2605 return NULL;
2606
2607 return next;
2608}
2609
2610u64 annotate_calc_pcrel(struct map_symbol *ms, u64 ip, int offset,
2611 struct disasm_line *dl)
2612{
2613 struct annotation *notes;
2614 struct disasm_line *next;
2615 u64 addr;
2616
2617 notes = symbol__annotation(ms->sym);
2618 /*
2619 * PC-relative addressing starts from the next instruction address
2620 * But the IP is for the current instruction. Since disasm_line
2621 * doesn't have the instruction size, calculate it using the next
2622 * disasm_line. If it's the last one, we can use symbol's end
2623 * address directly.
2624 */
2625 next = annotation__next_asm_line(notes, dl);
2626 if (next == NULL)
2627 addr = ms->sym->end + offset;
2628 else
2629 addr = ip + (next->al.offset - dl->al.offset) + offset;
2630
2631 return map__rip_2objdump(ms->map, addr);
2632}
2633
2634static struct debuginfo_cache {
2635 struct dso *dso;
2636 struct debuginfo *dbg;
2637} di_cache;
2638
2639void debuginfo_cache__delete(void)
2640{
2641 dso__put(di_cache.dso);
2642 di_cache.dso = NULL;
2643
2644 debuginfo__delete(di_cache.dbg);
2645 di_cache.dbg = NULL;
2646}
2647
2648/**
2649 * hist_entry__get_data_type - find data type for given hist entry
2650 * @he: hist entry
2651 *
2652 * This function first annotates the instruction at @he->ip and extracts
2653 * register and offset info from it. Then it searches the DWARF debug
2654 * info to get a variable and type information using the address, register,
2655 * and offset.
2656 */
2657struct annotated_data_type *hist_entry__get_data_type(struct hist_entry *he)
2658{
2659 struct map_symbol *ms = &he->ms;
2660 struct evsel *evsel = hists_to_evsel(he->hists);
2661 struct arch *arch;
2662 struct disasm_line *dl;
2663 struct annotated_insn_loc loc;
2664 struct annotated_op_loc *op_loc;
2665 struct annotated_data_type *mem_type;
2666 struct annotated_item_stat *istat;
2667 u64 ip = he->ip;
2668 int i;
2669
2670 ann_data_stat.total++;
2671
2672 if (ms->map == NULL || ms->sym == NULL) {
2673 ann_data_stat.no_sym++;
2674 return NULL;
2675 }
2676
2677 if (!symbol_conf.init_annotation) {
2678 ann_data_stat.no_sym++;
2679 return NULL;
2680 }
2681
2682 /*
2683 * di_cache holds a pair of values, but code below assumes
2684 * di_cache.dso can be compared/updated and di_cache.dbg can be
2685 * read/updated independently from each other. That assumption only
2686 * holds in single threaded code.
2687 */
2688 assert(perf_singlethreaded);
2689
2690 if (map__dso(ms->map) != di_cache.dso) {
2691 dso__put(di_cache.dso);
2692 di_cache.dso = dso__get(map__dso(ms->map));
2693
2694 debuginfo__delete(di_cache.dbg);
2695 di_cache.dbg = debuginfo__new(dso__long_name(di_cache.dso));
2696 }
2697
2698 if (di_cache.dbg == NULL) {
2699 ann_data_stat.no_dbginfo++;
2700 return NULL;
2701 }
2702
2703 /* Make sure it has the disasm of the function */
2704 if (symbol__annotate(ms, evsel, &arch) < 0) {
2705 ann_data_stat.no_insn++;
2706 return NULL;
2707 }
2708
2709 /*
2710 * Get a disasm to extract the location from the insn.
2711 * This is too slow...
2712 */
2713 dl = find_disasm_line(ms->sym, ip, /*allow_update=*/true);
2714 if (dl == NULL) {
2715 ann_data_stat.no_insn++;
2716 return NULL;
2717 }
2718
2719retry:
2720 istat = annotate_data_stat(&ann_insn_stat, dl->ins.name);
2721 if (istat == NULL) {
2722 ann_data_stat.no_insn++;
2723 return NULL;
2724 }
2725
2726 if (annotate_get_insn_location(arch, dl, &loc) < 0) {
2727 ann_data_stat.no_insn_ops++;
2728 istat->bad++;
2729 return NULL;
2730 }
2731
2732 if (is_stack_operation(arch, dl)) {
2733 istat->good++;
2734 he->mem_type_off = 0;
2735 return &stackop_type;
2736 }
2737
2738 for_each_insn_op_loc(&loc, i, op_loc) {
2739 struct data_loc_info dloc = {
2740 .arch = arch,
2741 .thread = he->thread,
2742 .ms = ms,
2743 /* Recalculate IP for LOCK prefix or insn fusion */
2744 .ip = ms->sym->start + dl->al.offset,
2745 .cpumode = he->cpumode,
2746 .op = op_loc,
2747 .di = di_cache.dbg,
2748 };
2749
2750 if (!op_loc->mem_ref && op_loc->segment == INSN_SEG_NONE)
2751 continue;
2752
2753 /* Recalculate IP because of LOCK prefix or insn fusion */
2754 ip = ms->sym->start + dl->al.offset;
2755
2756 /* PC-relative addressing */
2757 if (op_loc->reg1 == DWARF_REG_PC) {
2758 dloc.var_addr = annotate_calc_pcrel(ms, dloc.ip,
2759 op_loc->offset, dl);
2760 }
2761
2762 /* This CPU access in kernel - pretend PC-relative addressing */
2763 if (dso__kernel(map__dso(ms->map)) && arch__is(arch, "x86") &&
2764 op_loc->segment == INSN_SEG_X86_GS && op_loc->imm) {
2765 dloc.var_addr = op_loc->offset;
2766 op_loc->reg1 = DWARF_REG_PC;
2767 }
2768
2769 mem_type = find_data_type(&dloc);
2770
2771 if (mem_type == NULL && is_stack_canary(arch, op_loc)) {
2772 istat->good++;
2773 he->mem_type_off = 0;
2774 return &canary_type;
2775 }
2776
2777 if (mem_type)
2778 istat->good++;
2779 else
2780 istat->bad++;
2781
2782 if (symbol_conf.annotate_data_sample) {
2783 annotated_data_type__update_samples(mem_type, evsel,
2784 dloc.type_offset,
2785 he->stat.nr_events,
2786 he->stat.period);
2787 }
2788 he->mem_type_off = dloc.type_offset;
2789 return mem_type;
2790 }
2791
2792 /*
2793 * Some instructions can be fused and the actual memory access came
2794 * from the previous instruction.
2795 */
2796 if (dl->al.offset > 0) {
2797 struct annotation *notes;
2798 struct disasm_line *prev_dl;
2799
2800 notes = symbol__annotation(ms->sym);
2801 prev_dl = annotation__prev_asm_line(notes, dl);
2802
2803 if (prev_dl && ins__is_fused(arch, prev_dl->ins.name, dl->ins.name)) {
2804 dl = prev_dl;
2805 goto retry;
2806 }
2807 }
2808
2809 ann_data_stat.no_mem_ops++;
2810 istat->bad++;
2811 return NULL;
2812}
2813
2814/* Basic block traversal (BFS) data structure */
2815struct basic_block_data {
2816 struct list_head queue;
2817 struct list_head visited;
2818};
2819
2820/*
2821 * During the traversal, it needs to know the parent block where the current
2822 * block block started from. Note that single basic block can be parent of
2823 * two child basic blocks (in case of condition jump).
2824 */
2825struct basic_block_link {
2826 struct list_head node;
2827 struct basic_block_link *parent;
2828 struct annotated_basic_block *bb;
2829};
2830
2831/* Check any of basic block in the list already has the offset */
2832static bool basic_block_has_offset(struct list_head *head, s64 offset)
2833{
2834 struct basic_block_link *link;
2835
2836 list_for_each_entry(link, head, node) {
2837 s64 begin_offset = link->bb->begin->al.offset;
2838 s64 end_offset = link->bb->end->al.offset;
2839
2840 if (begin_offset <= offset && offset <= end_offset)
2841 return true;
2842 }
2843 return false;
2844}
2845
2846static bool is_new_basic_block(struct basic_block_data *bb_data,
2847 struct disasm_line *dl)
2848{
2849 s64 offset = dl->al.offset;
2850
2851 if (basic_block_has_offset(&bb_data->visited, offset))
2852 return false;
2853 if (basic_block_has_offset(&bb_data->queue, offset))
2854 return false;
2855 return true;
2856}
2857
2858/* Add a basic block starting from dl and link it to the parent */
2859static int add_basic_block(struct basic_block_data *bb_data,
2860 struct basic_block_link *parent,
2861 struct disasm_line *dl)
2862{
2863 struct annotated_basic_block *bb;
2864 struct basic_block_link *link;
2865
2866 if (dl == NULL)
2867 return -1;
2868
2869 if (!is_new_basic_block(bb_data, dl))
2870 return 0;
2871
2872 bb = zalloc(sizeof(*bb));
2873 if (bb == NULL)
2874 return -1;
2875
2876 bb->begin = dl;
2877 bb->end = dl;
2878 INIT_LIST_HEAD(&bb->list);
2879
2880 link = malloc(sizeof(*link));
2881 if (link == NULL) {
2882 free(bb);
2883 return -1;
2884 }
2885
2886 link->bb = bb;
2887 link->parent = parent;
2888 list_add_tail(&link->node, &bb_data->queue);
2889 return 0;
2890}
2891
2892/* Returns true when it finds the target in the current basic block */
2893static bool process_basic_block(struct basic_block_data *bb_data,
2894 struct basic_block_link *link,
2895 struct symbol *sym, u64 target)
2896{
2897 struct disasm_line *dl, *next_dl, *last_dl;
2898 struct annotation *notes = symbol__annotation(sym);
2899 bool found = false;
2900
2901 dl = link->bb->begin;
2902 /* Check if it's already visited */
2903 if (basic_block_has_offset(&bb_data->visited, dl->al.offset))
2904 return false;
2905
2906 last_dl = list_last_entry(¬es->src->source,
2907 struct disasm_line, al.node);
2908 if (last_dl->al.offset == -1)
2909 last_dl = annotation__prev_asm_line(notes, last_dl);
2910
2911 if (last_dl == NULL)
2912 return false;
2913
2914 list_for_each_entry_from(dl, ¬es->src->source, al.node) {
2915 /* Skip comment or debug info line */
2916 if (dl->al.offset == -1)
2917 continue;
2918 /* Found the target instruction */
2919 if (sym->start + dl->al.offset == target) {
2920 found = true;
2921 break;
2922 }
2923 /* End of the function, finish the block */
2924 if (dl == last_dl)
2925 break;
2926 /* 'return' instruction finishes the block */
2927 if (ins__is_ret(&dl->ins))
2928 break;
2929 /* normal instructions are part of the basic block */
2930 if (!ins__is_jump(&dl->ins))
2931 continue;
2932 /* jump to a different function, tail call or return */
2933 if (dl->ops.target.outside)
2934 break;
2935 /* jump instruction creates new basic block(s) */
2936 next_dl = find_disasm_line(sym, sym->start + dl->ops.target.offset,
2937 /*allow_update=*/false);
2938 if (next_dl)
2939 add_basic_block(bb_data, link, next_dl);
2940
2941 /*
2942 * FIXME: determine conditional jumps properly.
2943 * Conditional jumps create another basic block with the
2944 * next disasm line.
2945 */
2946 if (!strstr(dl->ins.name, "jmp")) {
2947 next_dl = annotation__next_asm_line(notes, dl);
2948 if (next_dl)
2949 add_basic_block(bb_data, link, next_dl);
2950 }
2951 break;
2952
2953 }
2954 link->bb->end = dl;
2955 return found;
2956}
2957
2958/*
2959 * It founds a target basic block, build a proper linked list of basic blocks
2960 * by following the link recursively.
2961 */
2962static void link_found_basic_blocks(struct basic_block_link *link,
2963 struct list_head *head)
2964{
2965 while (link) {
2966 struct basic_block_link *parent = link->parent;
2967
2968 list_move(&link->bb->list, head);
2969 list_del(&link->node);
2970 free(link);
2971
2972 link = parent;
2973 }
2974}
2975
2976static void delete_basic_blocks(struct basic_block_data *bb_data)
2977{
2978 struct basic_block_link *link, *tmp;
2979
2980 list_for_each_entry_safe(link, tmp, &bb_data->queue, node) {
2981 list_del(&link->node);
2982 zfree(&link->bb);
2983 free(link);
2984 }
2985
2986 list_for_each_entry_safe(link, tmp, &bb_data->visited, node) {
2987 list_del(&link->node);
2988 zfree(&link->bb);
2989 free(link);
2990 }
2991}
2992
2993/**
2994 * annotate_get_basic_blocks - Get basic blocks for given address range
2995 * @sym: symbol to annotate
2996 * @src: source address
2997 * @dst: destination address
2998 * @head: list head to save basic blocks
2999 *
3000 * This function traverses disasm_lines from @src to @dst and save them in a
3001 * list of annotated_basic_block to @head. It uses BFS to find the shortest
3002 * path between two. The basic_block_link is to maintain parent links so
3003 * that it can build a list of blocks from the start.
3004 */
3005int annotate_get_basic_blocks(struct symbol *sym, s64 src, s64 dst,
3006 struct list_head *head)
3007{
3008 struct basic_block_data bb_data = {
3009 .queue = LIST_HEAD_INIT(bb_data.queue),
3010 .visited = LIST_HEAD_INIT(bb_data.visited),
3011 };
3012 struct basic_block_link *link;
3013 struct disasm_line *dl;
3014 int ret = -1;
3015
3016 dl = find_disasm_line(sym, src, /*allow_update=*/false);
3017 if (dl == NULL)
3018 return -1;
3019
3020 if (add_basic_block(&bb_data, /*parent=*/NULL, dl) < 0)
3021 return -1;
3022
3023 /* Find shortest path from src to dst using BFS */
3024 while (!list_empty(&bb_data.queue)) {
3025 link = list_first_entry(&bb_data.queue, struct basic_block_link, node);
3026
3027 if (process_basic_block(&bb_data, link, sym, dst)) {
3028 link_found_basic_blocks(link, head);
3029 ret = 0;
3030 break;
3031 }
3032 list_move(&link->node, &bb_data.visited);
3033 }
3034 delete_basic_blocks(&bb_data);
3035 return ret;
3036}