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 <regex.h>
22 #include <pthread.h>
23 #include <linux/bitops.h>
24
25 const char *disassembler_style;
26 const char *objdump_path;
27 static regex_t file_lineno;
28
29 static struct ins *ins__find(const char *name);
30 static int disasm_line__parse(char *line, char **namep, char **rawp);
31
ins__delete(struct ins_operands * ops)32 static void ins__delete(struct ins_operands *ops)
33 {
34 if (ops == NULL)
35 return;
36 zfree(&ops->source.raw);
37 zfree(&ops->source.name);
38 zfree(&ops->target.raw);
39 zfree(&ops->target.name);
40 }
41
ins__raw_scnprintf(struct ins * ins,char * bf,size_t size,struct ins_operands * ops)42 static int ins__raw_scnprintf(struct ins *ins, char *bf, size_t size,
43 struct ins_operands *ops)
44 {
45 return scnprintf(bf, size, "%-6.6s %s", ins->name, ops->raw);
46 }
47
ins__scnprintf(struct ins * ins,char * bf,size_t size,struct ins_operands * ops)48 int ins__scnprintf(struct ins *ins, char *bf, size_t size,
49 struct ins_operands *ops)
50 {
51 if (ins->ops->scnprintf)
52 return ins->ops->scnprintf(ins, bf, size, ops);
53
54 return ins__raw_scnprintf(ins, bf, size, ops);
55 }
56
call__parse(struct ins_operands * ops,struct map * map)57 static int call__parse(struct ins_operands *ops, struct map *map)
58 {
59 char *endptr, *tok, *name;
60
61 ops->target.addr = strtoull(ops->raw, &endptr, 16);
62
63 name = strchr(endptr, '<');
64 if (name == NULL)
65 goto indirect_call;
66
67 name++;
68
69 #ifdef __arm__
70 if (strchr(name, '+'))
71 return -1;
72 #endif
73
74 tok = strchr(name, '>');
75 if (tok == NULL)
76 return -1;
77
78 *tok = '\0';
79 ops->target.name = strdup(name);
80 *tok = '>';
81
82 return ops->target.name == NULL ? -1 : 0;
83
84 indirect_call:
85 tok = strchr(endptr, '*');
86 if (tok == NULL) {
87 struct symbol *sym = map__find_symbol(map, map->map_ip(map, ops->target.addr));
88 if (sym != NULL)
89 ops->target.name = strdup(sym->name);
90 else
91 ops->target.addr = 0;
92 return 0;
93 }
94
95 ops->target.addr = strtoull(tok + 1, NULL, 16);
96 return 0;
97 }
98
call__scnprintf(struct ins * ins,char * bf,size_t size,struct ins_operands * ops)99 static int call__scnprintf(struct ins *ins, char *bf, size_t size,
100 struct ins_operands *ops)
101 {
102 if (ops->target.name)
103 return scnprintf(bf, size, "%-6.6s %s", ins->name, ops->target.name);
104
105 if (ops->target.addr == 0)
106 return ins__raw_scnprintf(ins, bf, size, ops);
107
108 return scnprintf(bf, size, "%-6.6s *%" PRIx64, ins->name, ops->target.addr);
109 }
110
111 static struct ins_ops call_ops = {
112 .parse = call__parse,
113 .scnprintf = call__scnprintf,
114 };
115
ins__is_call(const struct ins * ins)116 bool ins__is_call(const struct ins *ins)
117 {
118 return ins->ops == &call_ops;
119 }
120
jump__parse(struct ins_operands * ops,struct map * map __maybe_unused)121 static int jump__parse(struct ins_operands *ops, struct map *map __maybe_unused)
122 {
123 const char *s = strchr(ops->raw, '+');
124
125 ops->target.addr = strtoull(ops->raw, NULL, 16);
126
127 if (s++ != NULL)
128 ops->target.offset = strtoull(s, NULL, 16);
129 else
130 ops->target.offset = UINT64_MAX;
131
132 return 0;
133 }
134
jump__scnprintf(struct ins * ins,char * bf,size_t size,struct ins_operands * ops)135 static int jump__scnprintf(struct ins *ins, char *bf, size_t size,
136 struct ins_operands *ops)
137 {
138 return scnprintf(bf, size, "%-6.6s %" PRIx64, ins->name, ops->target.offset);
139 }
140
141 static struct ins_ops jump_ops = {
142 .parse = jump__parse,
143 .scnprintf = jump__scnprintf,
144 };
145
ins__is_jump(const struct ins * ins)146 bool ins__is_jump(const struct ins *ins)
147 {
148 return ins->ops == &jump_ops;
149 }
150
comment__symbol(char * raw,char * comment,u64 * addrp,char ** namep)151 static int comment__symbol(char *raw, char *comment, u64 *addrp, char **namep)
152 {
153 char *endptr, *name, *t;
154
155 if (strstr(raw, "(%rip)") == NULL)
156 return 0;
157
158 *addrp = strtoull(comment, &endptr, 16);
159 name = strchr(endptr, '<');
160 if (name == NULL)
161 return -1;
162
163 name++;
164
165 t = strchr(name, '>');
166 if (t == NULL)
167 return 0;
168
169 *t = '\0';
170 *namep = strdup(name);
171 *t = '>';
172
173 return 0;
174 }
175
lock__parse(struct ins_operands * ops,struct map * map)176 static int lock__parse(struct ins_operands *ops, struct map *map)
177 {
178 char *name;
179
180 ops->locked.ops = zalloc(sizeof(*ops->locked.ops));
181 if (ops->locked.ops == NULL)
182 return 0;
183
184 if (disasm_line__parse(ops->raw, &name, &ops->locked.ops->raw) < 0)
185 goto out_free_ops;
186
187 ops->locked.ins = ins__find(name);
188 free(name);
189
190 if (ops->locked.ins == NULL)
191 goto out_free_ops;
192
193 if (!ops->locked.ins->ops)
194 return 0;
195
196 if (ops->locked.ins->ops->parse &&
197 ops->locked.ins->ops->parse(ops->locked.ops, map) < 0)
198 goto out_free_ops;
199
200 return 0;
201
202 out_free_ops:
203 zfree(&ops->locked.ops);
204 return 0;
205 }
206
lock__scnprintf(struct ins * ins,char * bf,size_t size,struct ins_operands * ops)207 static int lock__scnprintf(struct ins *ins, char *bf, size_t size,
208 struct ins_operands *ops)
209 {
210 int printed;
211
212 if (ops->locked.ins == NULL)
213 return ins__raw_scnprintf(ins, bf, size, ops);
214
215 printed = scnprintf(bf, size, "%-6.6s ", ins->name);
216 return printed + ins__scnprintf(ops->locked.ins, bf + printed,
217 size - printed, ops->locked.ops);
218 }
219
lock__delete(struct ins_operands * ops)220 static void lock__delete(struct ins_operands *ops)
221 {
222 struct ins *ins = ops->locked.ins;
223
224 if (ins && ins->ops->free)
225 ins->ops->free(ops->locked.ops);
226 else
227 ins__delete(ops->locked.ops);
228
229 zfree(&ops->locked.ops);
230 zfree(&ops->target.raw);
231 zfree(&ops->target.name);
232 }
233
234 static struct ins_ops lock_ops = {
235 .free = lock__delete,
236 .parse = lock__parse,
237 .scnprintf = lock__scnprintf,
238 };
239
mov__parse(struct ins_operands * ops,struct map * map __maybe_unused)240 static int mov__parse(struct ins_operands *ops, struct map *map __maybe_unused)
241 {
242 char *s = strchr(ops->raw, ','), *target, *comment, prev;
243
244 if (s == NULL)
245 return -1;
246
247 *s = '\0';
248 ops->source.raw = strdup(ops->raw);
249 *s = ',';
250
251 if (ops->source.raw == NULL)
252 return -1;
253
254 target = ++s;
255 #ifdef __arm__
256 comment = strchr(s, ';');
257 #else
258 comment = strchr(s, '#');
259 #endif
260
261 if (comment != NULL)
262 s = comment - 1;
263 else
264 s = strchr(s, '\0') - 1;
265
266 while (s > target && isspace(s[0]))
267 --s;
268 s++;
269 prev = *s;
270 *s = '\0';
271
272 ops->target.raw = strdup(target);
273 *s = prev;
274
275 if (ops->target.raw == NULL)
276 goto out_free_source;
277
278 if (comment == NULL)
279 return 0;
280
281 while (comment[0] != '\0' && isspace(comment[0]))
282 ++comment;
283
284 comment__symbol(ops->source.raw, comment, &ops->source.addr, &ops->source.name);
285 comment__symbol(ops->target.raw, comment, &ops->target.addr, &ops->target.name);
286
287 return 0;
288
289 out_free_source:
290 zfree(&ops->source.raw);
291 return -1;
292 }
293
mov__scnprintf(struct ins * ins,char * bf,size_t size,struct ins_operands * ops)294 static int mov__scnprintf(struct ins *ins, char *bf, size_t size,
295 struct ins_operands *ops)
296 {
297 return scnprintf(bf, size, "%-6.6s %s,%s", ins->name,
298 ops->source.name ?: ops->source.raw,
299 ops->target.name ?: ops->target.raw);
300 }
301
302 static struct ins_ops mov_ops = {
303 .parse = mov__parse,
304 .scnprintf = mov__scnprintf,
305 };
306
dec__parse(struct ins_operands * ops,struct map * map __maybe_unused)307 static int dec__parse(struct ins_operands *ops, struct map *map __maybe_unused)
308 {
309 char *target, *comment, *s, prev;
310
311 target = s = ops->raw;
312
313 while (s[0] != '\0' && !isspace(s[0]))
314 ++s;
315 prev = *s;
316 *s = '\0';
317
318 ops->target.raw = strdup(target);
319 *s = prev;
320
321 if (ops->target.raw == NULL)
322 return -1;
323
324 comment = strchr(s, '#');
325 if (comment == NULL)
326 return 0;
327
328 while (comment[0] != '\0' && isspace(comment[0]))
329 ++comment;
330
331 comment__symbol(ops->target.raw, comment, &ops->target.addr, &ops->target.name);
332
333 return 0;
334 }
335
dec__scnprintf(struct ins * ins,char * bf,size_t size,struct ins_operands * ops)336 static int dec__scnprintf(struct ins *ins, char *bf, size_t size,
337 struct ins_operands *ops)
338 {
339 return scnprintf(bf, size, "%-6.6s %s", ins->name,
340 ops->target.name ?: ops->target.raw);
341 }
342
343 static struct ins_ops dec_ops = {
344 .parse = dec__parse,
345 .scnprintf = dec__scnprintf,
346 };
347
nop__scnprintf(struct ins * ins __maybe_unused,char * bf,size_t size,struct ins_operands * ops __maybe_unused)348 static int nop__scnprintf(struct ins *ins __maybe_unused, char *bf, size_t size,
349 struct ins_operands *ops __maybe_unused)
350 {
351 return scnprintf(bf, size, "%-6.6s", "nop");
352 }
353
354 static struct ins_ops nop_ops = {
355 .scnprintf = nop__scnprintf,
356 };
357
358 static struct ins_ops ret_ops = {
359 .scnprintf = ins__raw_scnprintf,
360 };
361
ins__is_ret(const struct ins * ins)362 bool ins__is_ret(const struct ins *ins)
363 {
364 return ins->ops == &ret_ops;
365 }
366
367 static struct ins instructions[] = {
368 { .name = "add", .ops = &mov_ops, },
369 { .name = "addl", .ops = &mov_ops, },
370 { .name = "addq", .ops = &mov_ops, },
371 { .name = "addw", .ops = &mov_ops, },
372 { .name = "and", .ops = &mov_ops, },
373 #ifdef __arm__
374 { .name = "b", .ops = &jump_ops, }, // might also be a call
375 { .name = "bcc", .ops = &jump_ops, },
376 { .name = "bcs", .ops = &jump_ops, },
377 { .name = "beq", .ops = &jump_ops, },
378 { .name = "bge", .ops = &jump_ops, },
379 { .name = "bgt", .ops = &jump_ops, },
380 { .name = "bhi", .ops = &jump_ops, },
381 { .name = "bl", .ops = &call_ops, },
382 { .name = "bls", .ops = &jump_ops, },
383 { .name = "blt", .ops = &jump_ops, },
384 { .name = "blx", .ops = &call_ops, },
385 { .name = "bne", .ops = &jump_ops, },
386 #endif
387 { .name = "bts", .ops = &mov_ops, },
388 { .name = "call", .ops = &call_ops, },
389 { .name = "callq", .ops = &call_ops, },
390 { .name = "cmp", .ops = &mov_ops, },
391 { .name = "cmpb", .ops = &mov_ops, },
392 { .name = "cmpl", .ops = &mov_ops, },
393 { .name = "cmpq", .ops = &mov_ops, },
394 { .name = "cmpw", .ops = &mov_ops, },
395 { .name = "cmpxch", .ops = &mov_ops, },
396 { .name = "dec", .ops = &dec_ops, },
397 { .name = "decl", .ops = &dec_ops, },
398 { .name = "imul", .ops = &mov_ops, },
399 { .name = "inc", .ops = &dec_ops, },
400 { .name = "incl", .ops = &dec_ops, },
401 { .name = "ja", .ops = &jump_ops, },
402 { .name = "jae", .ops = &jump_ops, },
403 { .name = "jb", .ops = &jump_ops, },
404 { .name = "jbe", .ops = &jump_ops, },
405 { .name = "jc", .ops = &jump_ops, },
406 { .name = "jcxz", .ops = &jump_ops, },
407 { .name = "je", .ops = &jump_ops, },
408 { .name = "jecxz", .ops = &jump_ops, },
409 { .name = "jg", .ops = &jump_ops, },
410 { .name = "jge", .ops = &jump_ops, },
411 { .name = "jl", .ops = &jump_ops, },
412 { .name = "jle", .ops = &jump_ops, },
413 { .name = "jmp", .ops = &jump_ops, },
414 { .name = "jmpq", .ops = &jump_ops, },
415 { .name = "jna", .ops = &jump_ops, },
416 { .name = "jnae", .ops = &jump_ops, },
417 { .name = "jnb", .ops = &jump_ops, },
418 { .name = "jnbe", .ops = &jump_ops, },
419 { .name = "jnc", .ops = &jump_ops, },
420 { .name = "jne", .ops = &jump_ops, },
421 { .name = "jng", .ops = &jump_ops, },
422 { .name = "jnge", .ops = &jump_ops, },
423 { .name = "jnl", .ops = &jump_ops, },
424 { .name = "jnle", .ops = &jump_ops, },
425 { .name = "jno", .ops = &jump_ops, },
426 { .name = "jnp", .ops = &jump_ops, },
427 { .name = "jns", .ops = &jump_ops, },
428 { .name = "jnz", .ops = &jump_ops, },
429 { .name = "jo", .ops = &jump_ops, },
430 { .name = "jp", .ops = &jump_ops, },
431 { .name = "jpe", .ops = &jump_ops, },
432 { .name = "jpo", .ops = &jump_ops, },
433 { .name = "jrcxz", .ops = &jump_ops, },
434 { .name = "js", .ops = &jump_ops, },
435 { .name = "jz", .ops = &jump_ops, },
436 { .name = "lea", .ops = &mov_ops, },
437 { .name = "lock", .ops = &lock_ops, },
438 { .name = "mov", .ops = &mov_ops, },
439 { .name = "movb", .ops = &mov_ops, },
440 { .name = "movdqa",.ops = &mov_ops, },
441 { .name = "movl", .ops = &mov_ops, },
442 { .name = "movq", .ops = &mov_ops, },
443 { .name = "movslq", .ops = &mov_ops, },
444 { .name = "movzbl", .ops = &mov_ops, },
445 { .name = "movzwl", .ops = &mov_ops, },
446 { .name = "nop", .ops = &nop_ops, },
447 { .name = "nopl", .ops = &nop_ops, },
448 { .name = "nopw", .ops = &nop_ops, },
449 { .name = "or", .ops = &mov_ops, },
450 { .name = "orl", .ops = &mov_ops, },
451 { .name = "test", .ops = &mov_ops, },
452 { .name = "testb", .ops = &mov_ops, },
453 { .name = "testl", .ops = &mov_ops, },
454 { .name = "xadd", .ops = &mov_ops, },
455 { .name = "xbeginl", .ops = &jump_ops, },
456 { .name = "xbeginq", .ops = &jump_ops, },
457 { .name = "retq", .ops = &ret_ops, },
458 };
459
ins__key_cmp(const void * name,const void * insp)460 static int ins__key_cmp(const void *name, const void *insp)
461 {
462 const struct ins *ins = insp;
463
464 return strcmp(name, ins->name);
465 }
466
ins__cmp(const void * a,const void * b)467 static int ins__cmp(const void *a, const void *b)
468 {
469 const struct ins *ia = a;
470 const struct ins *ib = b;
471
472 return strcmp(ia->name, ib->name);
473 }
474
ins__sort(void)475 static void ins__sort(void)
476 {
477 const int nmemb = ARRAY_SIZE(instructions);
478
479 qsort(instructions, nmemb, sizeof(struct ins), ins__cmp);
480 }
481
ins__find(const char * name)482 static struct ins *ins__find(const char *name)
483 {
484 const int nmemb = ARRAY_SIZE(instructions);
485 static bool sorted;
486
487 if (!sorted) {
488 ins__sort();
489 sorted = true;
490 }
491
492 return bsearch(name, instructions, nmemb, sizeof(struct ins), ins__key_cmp);
493 }
494
symbol__alloc_hist(struct symbol * sym)495 int symbol__alloc_hist(struct symbol *sym)
496 {
497 struct annotation *notes = symbol__annotation(sym);
498 const size_t size = symbol__size(sym);
499 size_t sizeof_sym_hist;
500
501 /* Check for overflow when calculating sizeof_sym_hist */
502 if (size > (SIZE_MAX - sizeof(struct sym_hist)) / sizeof(u64))
503 return -1;
504
505 sizeof_sym_hist = (sizeof(struct sym_hist) + size * sizeof(u64));
506
507 /* Check for overflow in zalloc argument */
508 if (sizeof_sym_hist > (SIZE_MAX - sizeof(*notes->src))
509 / symbol_conf.nr_events)
510 return -1;
511
512 notes->src = zalloc(sizeof(*notes->src) + symbol_conf.nr_events * sizeof_sym_hist);
513 if (notes->src == NULL)
514 return -1;
515 notes->src->sizeof_sym_hist = sizeof_sym_hist;
516 notes->src->nr_histograms = symbol_conf.nr_events;
517 INIT_LIST_HEAD(¬es->src->source);
518 return 0;
519 }
520
521 /* The cycles histogram is lazily allocated. */
symbol__alloc_hist_cycles(struct symbol * sym)522 static int symbol__alloc_hist_cycles(struct symbol *sym)
523 {
524 struct annotation *notes = symbol__annotation(sym);
525 const size_t size = symbol__size(sym);
526
527 notes->src->cycles_hist = calloc(size, sizeof(struct cyc_hist));
528 if (notes->src->cycles_hist == NULL)
529 return -1;
530 return 0;
531 }
532
symbol__annotate_zero_histograms(struct symbol * sym)533 void symbol__annotate_zero_histograms(struct symbol *sym)
534 {
535 struct annotation *notes = symbol__annotation(sym);
536
537 pthread_mutex_lock(¬es->lock);
538 if (notes->src != NULL) {
539 memset(notes->src->histograms, 0,
540 notes->src->nr_histograms * notes->src->sizeof_sym_hist);
541 if (notes->src->cycles_hist)
542 memset(notes->src->cycles_hist, 0,
543 symbol__size(sym) * sizeof(struct cyc_hist));
544 }
545 pthread_mutex_unlock(¬es->lock);
546 }
547
__symbol__account_cycles(struct annotation * notes,u64 start,unsigned offset,unsigned cycles,unsigned have_start)548 static int __symbol__account_cycles(struct annotation *notes,
549 u64 start,
550 unsigned offset, unsigned cycles,
551 unsigned have_start)
552 {
553 struct cyc_hist *ch;
554
555 ch = notes->src->cycles_hist;
556 /*
557 * For now we can only account one basic block per
558 * final jump. But multiple could be overlapping.
559 * Always account the longest one. So when
560 * a shorter one has been already seen throw it away.
561 *
562 * We separately always account the full cycles.
563 */
564 ch[offset].num_aggr++;
565 ch[offset].cycles_aggr += cycles;
566
567 if (!have_start && ch[offset].have_start)
568 return 0;
569 if (ch[offset].num) {
570 if (have_start && (!ch[offset].have_start ||
571 ch[offset].start > start)) {
572 ch[offset].have_start = 0;
573 ch[offset].cycles = 0;
574 ch[offset].num = 0;
575 if (ch[offset].reset < 0xffff)
576 ch[offset].reset++;
577 } else if (have_start &&
578 ch[offset].start < start)
579 return 0;
580 }
581 ch[offset].have_start = have_start;
582 ch[offset].start = start;
583 ch[offset].cycles += cycles;
584 ch[offset].num++;
585 return 0;
586 }
587
__symbol__inc_addr_samples(struct symbol * sym,struct map * map,struct annotation * notes,int evidx,u64 addr)588 static int __symbol__inc_addr_samples(struct symbol *sym, struct map *map,
589 struct annotation *notes, int evidx, u64 addr)
590 {
591 unsigned offset;
592 struct sym_hist *h;
593
594 pr_debug3("%s: addr=%#" PRIx64 "\n", __func__, map->unmap_ip(map, addr));
595
596 if ((addr < sym->start || addr >= sym->end) &&
597 (addr != sym->end || sym->start != sym->end)) {
598 pr_debug("%s(%d): ERANGE! sym->name=%s, start=%#" PRIx64 ", addr=%#" PRIx64 ", end=%#" PRIx64 "\n",
599 __func__, __LINE__, sym->name, sym->start, addr, sym->end);
600 return -ERANGE;
601 }
602
603 offset = addr - sym->start;
604 h = annotation__histogram(notes, evidx);
605 h->sum++;
606 h->addr[offset]++;
607
608 pr_debug3("%#" PRIx64 " %s: period++ [addr: %#" PRIx64 ", %#" PRIx64
609 ", evidx=%d] => %" PRIu64 "\n", sym->start, sym->name,
610 addr, addr - sym->start, evidx, h->addr[offset]);
611 return 0;
612 }
613
symbol__get_annotation(struct symbol * sym,bool cycles)614 static struct annotation *symbol__get_annotation(struct symbol *sym, bool cycles)
615 {
616 struct annotation *notes = symbol__annotation(sym);
617
618 if (notes->src == NULL) {
619 if (symbol__alloc_hist(sym) < 0)
620 return NULL;
621 }
622 if (!notes->src->cycles_hist && cycles) {
623 if (symbol__alloc_hist_cycles(sym) < 0)
624 return NULL;
625 }
626 return notes;
627 }
628
symbol__inc_addr_samples(struct symbol * sym,struct map * map,int evidx,u64 addr)629 static int symbol__inc_addr_samples(struct symbol *sym, struct map *map,
630 int evidx, u64 addr)
631 {
632 struct annotation *notes;
633
634 if (sym == NULL)
635 return 0;
636 notes = symbol__get_annotation(sym, false);
637 if (notes == NULL)
638 return -ENOMEM;
639 return __symbol__inc_addr_samples(sym, map, notes, evidx, addr);
640 }
641
symbol__account_cycles(u64 addr,u64 start,struct symbol * sym,unsigned cycles)642 static int symbol__account_cycles(u64 addr, u64 start,
643 struct symbol *sym, unsigned cycles)
644 {
645 struct annotation *notes;
646 unsigned offset;
647
648 if (sym == NULL)
649 return 0;
650 notes = symbol__get_annotation(sym, true);
651 if (notes == NULL)
652 return -ENOMEM;
653 if (addr < sym->start || addr >= sym->end)
654 return -ERANGE;
655
656 if (start) {
657 if (start < sym->start || start >= sym->end)
658 return -ERANGE;
659 if (start >= addr)
660 start = 0;
661 }
662 offset = addr - sym->start;
663 return __symbol__account_cycles(notes,
664 start ? start - sym->start : 0,
665 offset, cycles,
666 !!start);
667 }
668
addr_map_symbol__account_cycles(struct addr_map_symbol * ams,struct addr_map_symbol * start,unsigned cycles)669 int addr_map_symbol__account_cycles(struct addr_map_symbol *ams,
670 struct addr_map_symbol *start,
671 unsigned cycles)
672 {
673 u64 saddr = 0;
674 int err;
675
676 if (!cycles)
677 return 0;
678
679 /*
680 * Only set start when IPC can be computed. We can only
681 * compute it when the basic block is completely in a single
682 * function.
683 * Special case the case when the jump is elsewhere, but
684 * it starts on the function start.
685 */
686 if (start &&
687 (start->sym == ams->sym ||
688 (ams->sym &&
689 start->addr == ams->sym->start + ams->map->start)))
690 saddr = start->al_addr;
691 if (saddr == 0)
692 pr_debug2("BB with bad start: addr %"PRIx64" start %"PRIx64" sym %"PRIx64" saddr %"PRIx64"\n",
693 ams->addr,
694 start ? start->addr : 0,
695 ams->sym ? ams->sym->start + ams->map->start : 0,
696 saddr);
697 err = symbol__account_cycles(ams->al_addr, saddr, ams->sym, cycles);
698 if (err)
699 pr_debug2("account_cycles failed %d\n", err);
700 return err;
701 }
702
addr_map_symbol__inc_samples(struct addr_map_symbol * ams,int evidx)703 int addr_map_symbol__inc_samples(struct addr_map_symbol *ams, int evidx)
704 {
705 return symbol__inc_addr_samples(ams->sym, ams->map, evidx, ams->al_addr);
706 }
707
hist_entry__inc_addr_samples(struct hist_entry * he,int evidx,u64 ip)708 int hist_entry__inc_addr_samples(struct hist_entry *he, int evidx, u64 ip)
709 {
710 return symbol__inc_addr_samples(he->ms.sym, he->ms.map, evidx, ip);
711 }
712
disasm_line__init_ins(struct disasm_line * dl,struct map * map)713 static void disasm_line__init_ins(struct disasm_line *dl, struct map *map)
714 {
715 dl->ins = ins__find(dl->name);
716
717 if (dl->ins == NULL)
718 return;
719
720 if (!dl->ins->ops)
721 return;
722
723 if (dl->ins->ops->parse && dl->ins->ops->parse(&dl->ops, map) < 0)
724 dl->ins = NULL;
725 }
726
disasm_line__parse(char * line,char ** namep,char ** rawp)727 static int disasm_line__parse(char *line, char **namep, char **rawp)
728 {
729 char *name = line, tmp;
730
731 while (isspace(name[0]))
732 ++name;
733
734 if (name[0] == '\0')
735 return -1;
736
737 *rawp = name + 1;
738
739 while ((*rawp)[0] != '\0' && !isspace((*rawp)[0]))
740 ++*rawp;
741
742 tmp = (*rawp)[0];
743 (*rawp)[0] = '\0';
744 *namep = strdup(name);
745
746 if (*namep == NULL)
747 goto out_free_name;
748
749 (*rawp)[0] = tmp;
750
751 if ((*rawp)[0] != '\0') {
752 (*rawp)++;
753 while (isspace((*rawp)[0]))
754 ++(*rawp);
755 }
756
757 return 0;
758
759 out_free_name:
760 zfree(namep);
761 return -1;
762 }
763
disasm_line__new(s64 offset,char * line,size_t privsize,int line_nr,struct map * map)764 static struct disasm_line *disasm_line__new(s64 offset, char *line,
765 size_t privsize, int line_nr,
766 struct map *map)
767 {
768 struct disasm_line *dl = zalloc(sizeof(*dl) + privsize);
769
770 if (dl != NULL) {
771 dl->offset = offset;
772 dl->line = strdup(line);
773 dl->line_nr = line_nr;
774 if (dl->line == NULL)
775 goto out_delete;
776
777 if (offset != -1) {
778 if (disasm_line__parse(dl->line, &dl->name, &dl->ops.raw) < 0)
779 goto out_free_line;
780
781 disasm_line__init_ins(dl, map);
782 }
783 }
784
785 return dl;
786
787 out_free_line:
788 zfree(&dl->line);
789 out_delete:
790 free(dl);
791 return NULL;
792 }
793
disasm_line__free(struct disasm_line * dl)794 void disasm_line__free(struct disasm_line *dl)
795 {
796 zfree(&dl->line);
797 zfree(&dl->name);
798 if (dl->ins && dl->ins->ops->free)
799 dl->ins->ops->free(&dl->ops);
800 else
801 ins__delete(&dl->ops);
802 free(dl);
803 }
804
disasm_line__scnprintf(struct disasm_line * dl,char * bf,size_t size,bool raw)805 int disasm_line__scnprintf(struct disasm_line *dl, char *bf, size_t size, bool raw)
806 {
807 if (raw || !dl->ins)
808 return scnprintf(bf, size, "%-6.6s %s", dl->name, dl->ops.raw);
809
810 return ins__scnprintf(dl->ins, bf, size, &dl->ops);
811 }
812
disasm__add(struct list_head * head,struct disasm_line * line)813 static void disasm__add(struct list_head *head, struct disasm_line *line)
814 {
815 list_add_tail(&line->node, head);
816 }
817
disasm__get_next_ip_line(struct list_head * head,struct disasm_line * pos)818 struct disasm_line *disasm__get_next_ip_line(struct list_head *head, struct disasm_line *pos)
819 {
820 list_for_each_entry_continue(pos, head, node)
821 if (pos->offset >= 0)
822 return pos;
823
824 return NULL;
825 }
826
disasm__calc_percent(struct annotation * notes,int evidx,s64 offset,s64 end,const char ** path,u64 * nr_samples)827 double disasm__calc_percent(struct annotation *notes, int evidx, s64 offset,
828 s64 end, const char **path, u64 *nr_samples)
829 {
830 struct source_line *src_line = notes->src->lines;
831 double percent = 0.0;
832 *nr_samples = 0;
833
834 if (src_line) {
835 size_t sizeof_src_line = sizeof(*src_line) +
836 sizeof(src_line->samples) * (src_line->nr_pcnt - 1);
837
838 while (offset < end) {
839 src_line = (void *)notes->src->lines +
840 (sizeof_src_line * offset);
841
842 if (*path == NULL)
843 *path = src_line->path;
844
845 percent += src_line->samples[evidx].percent;
846 *nr_samples += src_line->samples[evidx].nr;
847 offset++;
848 }
849 } else {
850 struct sym_hist *h = annotation__histogram(notes, evidx);
851 unsigned int hits = 0;
852
853 while (offset < end)
854 hits += h->addr[offset++];
855
856 if (h->sum) {
857 *nr_samples = hits;
858 percent = 100.0 * hits / h->sum;
859 }
860 }
861
862 return percent;
863 }
864
annotate__address_color(struct block_range * br)865 static const char *annotate__address_color(struct block_range *br)
866 {
867 double cov = block_range__coverage(br);
868
869 if (cov >= 0) {
870 /* mark red for >75% coverage */
871 if (cov > 0.75)
872 return PERF_COLOR_RED;
873
874 /* mark dull for <1% coverage */
875 if (cov < 0.01)
876 return PERF_COLOR_NORMAL;
877 }
878
879 return PERF_COLOR_MAGENTA;
880 }
881
annotate__asm_color(struct block_range * br)882 static const char *annotate__asm_color(struct block_range *br)
883 {
884 double cov = block_range__coverage(br);
885
886 if (cov >= 0) {
887 /* mark dull for <1% coverage */
888 if (cov < 0.01)
889 return PERF_COLOR_NORMAL;
890 }
891
892 return PERF_COLOR_BLUE;
893 }
894
annotate__branch_printf(struct block_range * br,u64 addr)895 static void annotate__branch_printf(struct block_range *br, u64 addr)
896 {
897 bool emit_comment = true;
898
899 if (!br)
900 return;
901
902 #if 1
903 if (br->is_target && br->start == addr) {
904 struct block_range *branch = br;
905 double p;
906
907 /*
908 * Find matching branch to our target.
909 */
910 while (!branch->is_branch)
911 branch = block_range__next(branch);
912
913 p = 100 *(double)br->entry / branch->coverage;
914
915 if (p > 0.1) {
916 if (emit_comment) {
917 emit_comment = false;
918 printf("\t#");
919 }
920
921 /*
922 * The percentage of coverage joined at this target in relation
923 * to the next branch.
924 */
925 printf(" +%.2f%%", p);
926 }
927 }
928 #endif
929 if (br->is_branch && br->end == addr) {
930 double p = 100*(double)br->taken / br->coverage;
931
932 if (p > 0.1) {
933 if (emit_comment) {
934 emit_comment = false;
935 printf("\t#");
936 }
937
938 /*
939 * The percentage of coverage leaving at this branch, and
940 * its prediction ratio.
941 */
942 printf(" -%.2f%% (p:%.2f%%)", p, 100*(double)br->pred / br->taken);
943 }
944 }
945 }
946
947
disasm_line__print(struct disasm_line * dl,struct symbol * sym,u64 start,struct perf_evsel * evsel,u64 len,int min_pcnt,int printed,int max_lines,struct disasm_line * queue)948 static int disasm_line__print(struct disasm_line *dl, struct symbol *sym, u64 start,
949 struct perf_evsel *evsel, u64 len, int min_pcnt, int printed,
950 int max_lines, struct disasm_line *queue)
951 {
952 static const char *prev_line;
953 static const char *prev_color;
954
955 if (dl->offset != -1) {
956 const char *path = NULL;
957 u64 nr_samples;
958 double percent, max_percent = 0.0;
959 double *ppercents = &percent;
960 u64 *psamples = &nr_samples;
961 int i, nr_percent = 1;
962 const char *color;
963 struct annotation *notes = symbol__annotation(sym);
964 s64 offset = dl->offset;
965 const u64 addr = start + offset;
966 struct disasm_line *next;
967 struct block_range *br;
968
969 next = disasm__get_next_ip_line(¬es->src->source, dl);
970
971 if (perf_evsel__is_group_event(evsel)) {
972 nr_percent = evsel->nr_members;
973 ppercents = calloc(nr_percent, sizeof(double));
974 psamples = calloc(nr_percent, sizeof(u64));
975 if (ppercents == NULL || psamples == NULL) {
976 return -1;
977 }
978 }
979
980 for (i = 0; i < nr_percent; i++) {
981 percent = disasm__calc_percent(notes,
982 notes->src->lines ? i : evsel->idx + i,
983 offset,
984 next ? next->offset : (s64) len,
985 &path, &nr_samples);
986
987 ppercents[i] = percent;
988 psamples[i] = nr_samples;
989 if (percent > max_percent)
990 max_percent = percent;
991 }
992
993 if (max_percent < min_pcnt)
994 return -1;
995
996 if (max_lines && printed >= max_lines)
997 return 1;
998
999 if (queue != NULL) {
1000 list_for_each_entry_from(queue, ¬es->src->source, node) {
1001 if (queue == dl)
1002 break;
1003 disasm_line__print(queue, sym, start, evsel, len,
1004 0, 0, 1, NULL);
1005 }
1006 }
1007
1008 color = get_percent_color(max_percent);
1009
1010 /*
1011 * Also color the filename and line if needed, with
1012 * the same color than the percentage. Don't print it
1013 * twice for close colored addr with the same filename:line
1014 */
1015 if (path) {
1016 if (!prev_line || strcmp(prev_line, path)
1017 || color != prev_color) {
1018 color_fprintf(stdout, color, " %s", path);
1019 prev_line = path;
1020 prev_color = color;
1021 }
1022 }
1023
1024 for (i = 0; i < nr_percent; i++) {
1025 percent = ppercents[i];
1026 nr_samples = psamples[i];
1027 color = get_percent_color(percent);
1028
1029 if (symbol_conf.show_total_period)
1030 color_fprintf(stdout, color, " %7" PRIu64,
1031 nr_samples);
1032 else
1033 color_fprintf(stdout, color, " %7.2f", percent);
1034 }
1035
1036 printf(" : ");
1037
1038 br = block_range__find(addr);
1039 color_fprintf(stdout, annotate__address_color(br), " %" PRIx64 ":", addr);
1040 color_fprintf(stdout, annotate__asm_color(br), "%s", dl->line);
1041 annotate__branch_printf(br, addr);
1042 printf("\n");
1043
1044 if (ppercents != &percent)
1045 free(ppercents);
1046
1047 if (psamples != &nr_samples)
1048 free(psamples);
1049
1050 } else if (max_lines && printed >= max_lines)
1051 return 1;
1052 else {
1053 int width = 8;
1054
1055 if (queue)
1056 return -1;
1057
1058 if (perf_evsel__is_group_event(evsel))
1059 width *= evsel->nr_members;
1060
1061 if (!*dl->line)
1062 printf(" %*s:\n", width, " ");
1063 else
1064 printf(" %*s: %s\n", width, " ", dl->line);
1065 }
1066
1067 return 0;
1068 }
1069
1070 /*
1071 * symbol__parse_objdump_line() parses objdump output (with -d --no-show-raw)
1072 * which looks like following
1073 *
1074 * 0000000000415500 <_init>:
1075 * 415500: sub $0x8,%rsp
1076 * 415504: mov 0x2f5ad5(%rip),%rax # 70afe0 <_DYNAMIC+0x2f8>
1077 * 41550b: test %rax,%rax
1078 * 41550e: je 415515 <_init+0x15>
1079 * 415510: callq 416e70 <__gmon_start__@plt>
1080 * 415515: add $0x8,%rsp
1081 * 415519: retq
1082 *
1083 * it will be parsed and saved into struct disasm_line as
1084 * <offset> <name> <ops.raw>
1085 *
1086 * The offset will be a relative offset from the start of the symbol and -1
1087 * means that it's not a disassembly line so should be treated differently.
1088 * The ops.raw part will be parsed further according to type of the instruction.
1089 */
symbol__parse_objdump_line(struct symbol * sym,struct map * map,FILE * file,size_t privsize,int * line_nr)1090 static int symbol__parse_objdump_line(struct symbol *sym, struct map *map,
1091 FILE *file, size_t privsize,
1092 int *line_nr)
1093 {
1094 struct annotation *notes = symbol__annotation(sym);
1095 struct disasm_line *dl;
1096 char *line = NULL, *parsed_line, *tmp, *tmp2, *c;
1097 size_t line_len;
1098 s64 line_ip, offset = -1;
1099 regmatch_t match[2];
1100
1101 if (getline(&line, &line_len, file) < 0)
1102 return -1;
1103
1104 if (!line)
1105 return -1;
1106
1107 while (line_len != 0 && isspace(line[line_len - 1]))
1108 line[--line_len] = '\0';
1109
1110 c = strchr(line, '\n');
1111 if (c)
1112 *c = 0;
1113
1114 line_ip = -1;
1115 parsed_line = line;
1116
1117 /* /filename:linenr ? Save line number and ignore. */
1118 if (regexec(&file_lineno, line, 2, match, 0) == 0) {
1119 *line_nr = atoi(line + match[1].rm_so);
1120 return 0;
1121 }
1122
1123 /*
1124 * Strip leading spaces:
1125 */
1126 tmp = line;
1127 while (*tmp) {
1128 if (*tmp != ' ')
1129 break;
1130 tmp++;
1131 }
1132
1133 if (*tmp) {
1134 /*
1135 * Parse hexa addresses followed by ':'
1136 */
1137 line_ip = strtoull(tmp, &tmp2, 16);
1138 if (*tmp2 != ':' || tmp == tmp2 || tmp2[1] == '\0')
1139 line_ip = -1;
1140 }
1141
1142 if (line_ip != -1) {
1143 u64 start = map__rip_2objdump(map, sym->start),
1144 end = map__rip_2objdump(map, sym->end);
1145
1146 offset = line_ip - start;
1147 if ((u64)line_ip < start || (u64)line_ip >= end)
1148 offset = -1;
1149 else
1150 parsed_line = tmp2 + 1;
1151 }
1152
1153 dl = disasm_line__new(offset, parsed_line, privsize, *line_nr, map);
1154 free(line);
1155 (*line_nr)++;
1156
1157 if (dl == NULL)
1158 return -1;
1159
1160 if (dl->ops.target.offset == UINT64_MAX)
1161 dl->ops.target.offset = dl->ops.target.addr -
1162 map__rip_2objdump(map, sym->start);
1163
1164 /* kcore has no symbols, so add the call target name */
1165 if (dl->ins && ins__is_call(dl->ins) && !dl->ops.target.name) {
1166 struct addr_map_symbol target = {
1167 .map = map,
1168 .addr = dl->ops.target.addr,
1169 };
1170
1171 if (!map_groups__find_ams(&target) &&
1172 target.sym->start == target.al_addr)
1173 dl->ops.target.name = strdup(target.sym->name);
1174 }
1175
1176 disasm__add(¬es->src->source, dl);
1177
1178 return 0;
1179 }
1180
symbol__init_regexpr(void)1181 static __attribute__((constructor)) void symbol__init_regexpr(void)
1182 {
1183 regcomp(&file_lineno, "^/[^:]+:([0-9]+)", REG_EXTENDED);
1184 }
1185
delete_last_nop(struct symbol * sym)1186 static void delete_last_nop(struct symbol *sym)
1187 {
1188 struct annotation *notes = symbol__annotation(sym);
1189 struct list_head *list = ¬es->src->source;
1190 struct disasm_line *dl;
1191
1192 while (!list_empty(list)) {
1193 dl = list_entry(list->prev, struct disasm_line, node);
1194
1195 if (dl->ins && dl->ins->ops) {
1196 if (dl->ins->ops != &nop_ops)
1197 return;
1198 } else {
1199 if (!strstr(dl->line, " nop ") &&
1200 !strstr(dl->line, " nopl ") &&
1201 !strstr(dl->line, " nopw "))
1202 return;
1203 }
1204
1205 list_del(&dl->node);
1206 disasm_line__free(dl);
1207 }
1208 }
1209
symbol__strerror_disassemble(struct symbol * sym __maybe_unused,struct map * map,int errnum,char * buf,size_t buflen)1210 int symbol__strerror_disassemble(struct symbol *sym __maybe_unused, struct map *map,
1211 int errnum, char *buf, size_t buflen)
1212 {
1213 struct dso *dso = map->dso;
1214
1215 BUG_ON(buflen == 0);
1216
1217 if (errnum >= 0) {
1218 str_error_r(errnum, buf, buflen);
1219 return 0;
1220 }
1221
1222 switch (errnum) {
1223 case SYMBOL_ANNOTATE_ERRNO__NO_VMLINUX: {
1224 char bf[SBUILD_ID_SIZE + 15] = " with build id ";
1225 char *build_id_msg = NULL;
1226
1227 if (dso->has_build_id) {
1228 build_id__sprintf(dso->build_id,
1229 sizeof(dso->build_id), bf + 15);
1230 build_id_msg = bf;
1231 }
1232 scnprintf(buf, buflen,
1233 "No vmlinux file%s\nwas found in the path.\n\n"
1234 "Note that annotation using /proc/kcore requires CAP_SYS_RAWIO capability.\n\n"
1235 "Please use:\n\n"
1236 " perf buildid-cache -vu vmlinux\n\n"
1237 "or:\n\n"
1238 " --vmlinux vmlinux\n", build_id_msg ?: "");
1239 }
1240 break;
1241 default:
1242 scnprintf(buf, buflen, "Internal error: Invalid %d error code\n", errnum);
1243 break;
1244 }
1245
1246 return 0;
1247 }
1248
dso__disassemble_filename(struct dso * dso,char * filename,size_t filename_size)1249 static int dso__disassemble_filename(struct dso *dso, char *filename, size_t filename_size)
1250 {
1251 char linkname[PATH_MAX];
1252 char *build_id_filename;
1253 char *build_id_path = NULL;
1254
1255 if (dso->symtab_type == DSO_BINARY_TYPE__KALLSYMS &&
1256 !dso__is_kcore(dso))
1257 return SYMBOL_ANNOTATE_ERRNO__NO_VMLINUX;
1258
1259 build_id_filename = dso__build_id_filename(dso, NULL, 0);
1260 if (build_id_filename) {
1261 __symbol__join_symfs(filename, filename_size, build_id_filename);
1262 free(build_id_filename);
1263 } else {
1264 if (dso->has_build_id)
1265 return ENOMEM;
1266 goto fallback;
1267 }
1268
1269 build_id_path = strdup(filename);
1270 if (!build_id_path)
1271 return -1;
1272
1273 dirname(build_id_path);
1274
1275 if (dso__is_kcore(dso) ||
1276 readlink(build_id_path, linkname, sizeof(linkname)) < 0 ||
1277 strstr(linkname, DSO__NAME_KALLSYMS) ||
1278 access(filename, R_OK)) {
1279 fallback:
1280 /*
1281 * If we don't have build-ids or the build-id file isn't in the
1282 * cache, or is just a kallsyms file, well, lets hope that this
1283 * DSO is the same as when 'perf record' ran.
1284 */
1285 __symbol__join_symfs(filename, filename_size, dso->long_name);
1286 }
1287
1288 free(build_id_path);
1289 return 0;
1290 }
1291
symbol__disassemble(struct symbol * sym,struct map * map,size_t privsize)1292 int symbol__disassemble(struct symbol *sym, struct map *map, size_t privsize)
1293 {
1294 struct dso *dso = map->dso;
1295 char command[PATH_MAX * 2];
1296 FILE *file;
1297 char symfs_filename[PATH_MAX];
1298 struct kcore_extract kce;
1299 bool delete_extract = false;
1300 int stdout_fd[2];
1301 int lineno = 0;
1302 int nline;
1303 pid_t pid;
1304 int err = dso__disassemble_filename(dso, symfs_filename, sizeof(symfs_filename));
1305
1306 if (err)
1307 return err;
1308
1309 pr_debug("%s: filename=%s, sym=%s, start=%#" PRIx64 ", end=%#" PRIx64 "\n", __func__,
1310 symfs_filename, sym->name, map->unmap_ip(map, sym->start),
1311 map->unmap_ip(map, sym->end));
1312
1313 pr_debug("annotating [%p] %30s : [%p] %30s\n",
1314 dso, dso->long_name, sym, sym->name);
1315
1316 if (dso__is_kcore(dso)) {
1317 kce.kcore_filename = symfs_filename;
1318 kce.addr = map__rip_2objdump(map, sym->start);
1319 kce.offs = sym->start;
1320 kce.len = sym->end - sym->start;
1321 if (!kcore_extract__create(&kce)) {
1322 delete_extract = true;
1323 strlcpy(symfs_filename, kce.extract_filename,
1324 sizeof(symfs_filename));
1325 }
1326 } else if (dso__needs_decompress(dso)) {
1327 char tmp[PATH_MAX];
1328 struct kmod_path m;
1329 int fd;
1330 bool ret;
1331
1332 if (kmod_path__parse_ext(&m, symfs_filename))
1333 goto out;
1334
1335 snprintf(tmp, PATH_MAX, "/tmp/perf-kmod-XXXXXX");
1336
1337 fd = mkstemp(tmp);
1338 if (fd < 0) {
1339 free(m.ext);
1340 goto out;
1341 }
1342
1343 ret = decompress_to_file(m.ext, symfs_filename, fd);
1344
1345 if (ret)
1346 pr_err("Cannot decompress %s %s\n", m.ext, symfs_filename);
1347
1348 free(m.ext);
1349 close(fd);
1350
1351 if (!ret)
1352 goto out;
1353
1354 strcpy(symfs_filename, tmp);
1355 }
1356
1357 snprintf(command, sizeof(command),
1358 "%s %s%s --start-address=0x%016" PRIx64
1359 " --stop-address=0x%016" PRIx64
1360 " -l -d %s %s -C %s 2>/dev/null|grep -v %s|expand",
1361 objdump_path ? objdump_path : "objdump",
1362 disassembler_style ? "-M " : "",
1363 disassembler_style ? disassembler_style : "",
1364 map__rip_2objdump(map, sym->start),
1365 map__rip_2objdump(map, sym->end),
1366 symbol_conf.annotate_asm_raw ? "" : "--no-show-raw",
1367 symbol_conf.annotate_src ? "-S" : "",
1368 symfs_filename, symfs_filename);
1369
1370 pr_debug("Executing: %s\n", command);
1371
1372 err = -1;
1373 if (pipe(stdout_fd) < 0) {
1374 pr_err("Failure creating the pipe to run %s\n", command);
1375 goto out_remove_tmp;
1376 }
1377
1378 pid = fork();
1379 if (pid < 0) {
1380 pr_err("Failure forking to run %s\n", command);
1381 goto out_close_stdout;
1382 }
1383
1384 if (pid == 0) {
1385 close(stdout_fd[0]);
1386 dup2(stdout_fd[1], 1);
1387 close(stdout_fd[1]);
1388 execl("/bin/sh", "sh", "-c", command, NULL);
1389 perror(command);
1390 exit(-1);
1391 }
1392
1393 close(stdout_fd[1]);
1394
1395 file = fdopen(stdout_fd[0], "r");
1396 if (!file) {
1397 pr_err("Failure creating FILE stream for %s\n", command);
1398 /*
1399 * If we were using debug info should retry with
1400 * original binary.
1401 */
1402 goto out_remove_tmp;
1403 }
1404
1405 nline = 0;
1406 while (!feof(file)) {
1407 if (symbol__parse_objdump_line(sym, map, file, privsize,
1408 &lineno) < 0)
1409 break;
1410 nline++;
1411 }
1412
1413 if (nline == 0)
1414 pr_err("No output from %s\n", command);
1415
1416 /*
1417 * kallsyms does not have symbol sizes so there may a nop at the end.
1418 * Remove it.
1419 */
1420 if (dso__is_kcore(dso))
1421 delete_last_nop(sym);
1422
1423 fclose(file);
1424 err = 0;
1425 out_remove_tmp:
1426 close(stdout_fd[0]);
1427
1428 if (dso__needs_decompress(dso))
1429 unlink(symfs_filename);
1430
1431 if (delete_extract)
1432 kcore_extract__delete(&kce);
1433 out:
1434 return err;
1435
1436 out_close_stdout:
1437 close(stdout_fd[1]);
1438 goto out_remove_tmp;
1439 }
1440
insert_source_line(struct rb_root * root,struct source_line * src_line)1441 static void insert_source_line(struct rb_root *root, struct source_line *src_line)
1442 {
1443 struct source_line *iter;
1444 struct rb_node **p = &root->rb_node;
1445 struct rb_node *parent = NULL;
1446 int i, ret;
1447
1448 while (*p != NULL) {
1449 parent = *p;
1450 iter = rb_entry(parent, struct source_line, node);
1451
1452 ret = strcmp(iter->path, src_line->path);
1453 if (ret == 0) {
1454 for (i = 0; i < src_line->nr_pcnt; i++)
1455 iter->samples[i].percent_sum += src_line->samples[i].percent;
1456 return;
1457 }
1458
1459 if (ret < 0)
1460 p = &(*p)->rb_left;
1461 else
1462 p = &(*p)->rb_right;
1463 }
1464
1465 for (i = 0; i < src_line->nr_pcnt; i++)
1466 src_line->samples[i].percent_sum = src_line->samples[i].percent;
1467
1468 rb_link_node(&src_line->node, parent, p);
1469 rb_insert_color(&src_line->node, root);
1470 }
1471
cmp_source_line(struct source_line * a,struct source_line * b)1472 static int cmp_source_line(struct source_line *a, struct source_line *b)
1473 {
1474 int i;
1475
1476 for (i = 0; i < a->nr_pcnt; i++) {
1477 if (a->samples[i].percent_sum == b->samples[i].percent_sum)
1478 continue;
1479 return a->samples[i].percent_sum > b->samples[i].percent_sum;
1480 }
1481
1482 return 0;
1483 }
1484
__resort_source_line(struct rb_root * root,struct source_line * src_line)1485 static void __resort_source_line(struct rb_root *root, struct source_line *src_line)
1486 {
1487 struct source_line *iter;
1488 struct rb_node **p = &root->rb_node;
1489 struct rb_node *parent = NULL;
1490
1491 while (*p != NULL) {
1492 parent = *p;
1493 iter = rb_entry(parent, struct source_line, node);
1494
1495 if (cmp_source_line(src_line, iter))
1496 p = &(*p)->rb_left;
1497 else
1498 p = &(*p)->rb_right;
1499 }
1500
1501 rb_link_node(&src_line->node, parent, p);
1502 rb_insert_color(&src_line->node, root);
1503 }
1504
resort_source_line(struct rb_root * dest_root,struct rb_root * src_root)1505 static void resort_source_line(struct rb_root *dest_root, struct rb_root *src_root)
1506 {
1507 struct source_line *src_line;
1508 struct rb_node *node;
1509
1510 node = rb_first(src_root);
1511 while (node) {
1512 struct rb_node *next;
1513
1514 src_line = rb_entry(node, struct source_line, node);
1515 next = rb_next(node);
1516 rb_erase(node, src_root);
1517
1518 __resort_source_line(dest_root, src_line);
1519 node = next;
1520 }
1521 }
1522
symbol__free_source_line(struct symbol * sym,int len)1523 static void symbol__free_source_line(struct symbol *sym, int len)
1524 {
1525 struct annotation *notes = symbol__annotation(sym);
1526 struct source_line *src_line = notes->src->lines;
1527 size_t sizeof_src_line;
1528 int i;
1529
1530 sizeof_src_line = sizeof(*src_line) +
1531 (sizeof(src_line->samples) * (src_line->nr_pcnt - 1));
1532
1533 for (i = 0; i < len; i++) {
1534 free_srcline(src_line->path);
1535 src_line = (void *)src_line + sizeof_src_line;
1536 }
1537
1538 zfree(¬es->src->lines);
1539 }
1540
1541 /* Get the filename:line for the colored entries */
symbol__get_source_line(struct symbol * sym,struct map * map,struct perf_evsel * evsel,struct rb_root * root,int len)1542 static int symbol__get_source_line(struct symbol *sym, struct map *map,
1543 struct perf_evsel *evsel,
1544 struct rb_root *root, int len)
1545 {
1546 u64 start;
1547 int i, k;
1548 int evidx = evsel->idx;
1549 struct source_line *src_line;
1550 struct annotation *notes = symbol__annotation(sym);
1551 struct sym_hist *h = annotation__histogram(notes, evidx);
1552 struct rb_root tmp_root = RB_ROOT;
1553 int nr_pcnt = 1;
1554 u64 h_sum = h->sum;
1555 size_t sizeof_src_line = sizeof(struct source_line);
1556
1557 if (perf_evsel__is_group_event(evsel)) {
1558 for (i = 1; i < evsel->nr_members; i++) {
1559 h = annotation__histogram(notes, evidx + i);
1560 h_sum += h->sum;
1561 }
1562 nr_pcnt = evsel->nr_members;
1563 sizeof_src_line += (nr_pcnt - 1) * sizeof(src_line->samples);
1564 }
1565
1566 if (!h_sum)
1567 return 0;
1568
1569 src_line = notes->src->lines = calloc(len, sizeof_src_line);
1570 if (!notes->src->lines)
1571 return -1;
1572
1573 start = map__rip_2objdump(map, sym->start);
1574
1575 for (i = 0; i < len; i++) {
1576 u64 offset;
1577 double percent_max = 0.0;
1578
1579 src_line->nr_pcnt = nr_pcnt;
1580
1581 for (k = 0; k < nr_pcnt; k++) {
1582 h = annotation__histogram(notes, evidx + k);
1583 src_line->samples[k].percent = 100.0 * h->addr[i] / h->sum;
1584
1585 if (src_line->samples[k].percent > percent_max)
1586 percent_max = src_line->samples[k].percent;
1587 }
1588
1589 if (percent_max <= 0.5)
1590 goto next;
1591
1592 offset = start + i;
1593 src_line->path = get_srcline(map->dso, offset, NULL, false);
1594 insert_source_line(&tmp_root, src_line);
1595
1596 next:
1597 src_line = (void *)src_line + sizeof_src_line;
1598 }
1599
1600 resort_source_line(root, &tmp_root);
1601 return 0;
1602 }
1603
print_summary(struct rb_root * root,const char * filename)1604 static void print_summary(struct rb_root *root, const char *filename)
1605 {
1606 struct source_line *src_line;
1607 struct rb_node *node;
1608
1609 printf("\nSorted summary for file %s\n", filename);
1610 printf("----------------------------------------------\n\n");
1611
1612 if (RB_EMPTY_ROOT(root)) {
1613 printf(" Nothing higher than %1.1f%%\n", MIN_GREEN);
1614 return;
1615 }
1616
1617 node = rb_first(root);
1618 while (node) {
1619 double percent, percent_max = 0.0;
1620 const char *color;
1621 char *path;
1622 int i;
1623
1624 src_line = rb_entry(node, struct source_line, node);
1625 for (i = 0; i < src_line->nr_pcnt; i++) {
1626 percent = src_line->samples[i].percent_sum;
1627 color = get_percent_color(percent);
1628 color_fprintf(stdout, color, " %7.2f", percent);
1629
1630 if (percent > percent_max)
1631 percent_max = percent;
1632 }
1633
1634 path = src_line->path;
1635 color = get_percent_color(percent_max);
1636 color_fprintf(stdout, color, " %s\n", path);
1637
1638 node = rb_next(node);
1639 }
1640 }
1641
symbol__annotate_hits(struct symbol * sym,struct perf_evsel * evsel)1642 static void symbol__annotate_hits(struct symbol *sym, struct perf_evsel *evsel)
1643 {
1644 struct annotation *notes = symbol__annotation(sym);
1645 struct sym_hist *h = annotation__histogram(notes, evsel->idx);
1646 u64 len = symbol__size(sym), offset;
1647
1648 for (offset = 0; offset < len; ++offset)
1649 if (h->addr[offset] != 0)
1650 printf("%*" PRIx64 ": %" PRIu64 "\n", BITS_PER_LONG / 2,
1651 sym->start + offset, h->addr[offset]);
1652 printf("%*s: %" PRIu64 "\n", BITS_PER_LONG / 2, "h->sum", h->sum);
1653 }
1654
symbol__annotate_printf(struct symbol * sym,struct map * map,struct perf_evsel * evsel,bool full_paths,int min_pcnt,int max_lines,int context)1655 int symbol__annotate_printf(struct symbol *sym, struct map *map,
1656 struct perf_evsel *evsel, bool full_paths,
1657 int min_pcnt, int max_lines, int context)
1658 {
1659 struct dso *dso = map->dso;
1660 char *filename;
1661 const char *d_filename;
1662 const char *evsel_name = perf_evsel__name(evsel);
1663 struct annotation *notes = symbol__annotation(sym);
1664 struct sym_hist *h = annotation__histogram(notes, evsel->idx);
1665 struct disasm_line *pos, *queue = NULL;
1666 u64 start = map__rip_2objdump(map, sym->start);
1667 int printed = 2, queue_len = 0;
1668 int more = 0;
1669 u64 len;
1670 int width = 8;
1671 int graph_dotted_len;
1672
1673 filename = strdup(dso->long_name);
1674 if (!filename)
1675 return -ENOMEM;
1676
1677 if (full_paths)
1678 d_filename = filename;
1679 else
1680 d_filename = basename(filename);
1681
1682 len = symbol__size(sym);
1683
1684 if (perf_evsel__is_group_event(evsel))
1685 width *= evsel->nr_members;
1686
1687 graph_dotted_len = printf(" %-*.*s| Source code & Disassembly of %s for %s (%" PRIu64 " samples)\n",
1688 width, width, "Percent", d_filename, evsel_name, h->sum);
1689
1690 printf("%-*.*s----\n",
1691 graph_dotted_len, graph_dotted_len, graph_dotted_line);
1692
1693 if (verbose)
1694 symbol__annotate_hits(sym, evsel);
1695
1696 list_for_each_entry(pos, ¬es->src->source, node) {
1697 if (context && queue == NULL) {
1698 queue = pos;
1699 queue_len = 0;
1700 }
1701
1702 switch (disasm_line__print(pos, sym, start, evsel, len,
1703 min_pcnt, printed, max_lines,
1704 queue)) {
1705 case 0:
1706 ++printed;
1707 if (context) {
1708 printed += queue_len;
1709 queue = NULL;
1710 queue_len = 0;
1711 }
1712 break;
1713 case 1:
1714 /* filtered by max_lines */
1715 ++more;
1716 break;
1717 case -1:
1718 default:
1719 /*
1720 * Filtered by min_pcnt or non IP lines when
1721 * context != 0
1722 */
1723 if (!context)
1724 break;
1725 if (queue_len == context)
1726 queue = list_entry(queue->node.next, typeof(*queue), node);
1727 else
1728 ++queue_len;
1729 break;
1730 }
1731 }
1732
1733 free(filename);
1734
1735 return more;
1736 }
1737
symbol__annotate_zero_histogram(struct symbol * sym,int evidx)1738 void symbol__annotate_zero_histogram(struct symbol *sym, int evidx)
1739 {
1740 struct annotation *notes = symbol__annotation(sym);
1741 struct sym_hist *h = annotation__histogram(notes, evidx);
1742
1743 memset(h, 0, notes->src->sizeof_sym_hist);
1744 }
1745
symbol__annotate_decay_histogram(struct symbol * sym,int evidx)1746 void symbol__annotate_decay_histogram(struct symbol *sym, int evidx)
1747 {
1748 struct annotation *notes = symbol__annotation(sym);
1749 struct sym_hist *h = annotation__histogram(notes, evidx);
1750 int len = symbol__size(sym), offset;
1751
1752 h->sum = 0;
1753 for (offset = 0; offset < len; ++offset) {
1754 h->addr[offset] = h->addr[offset] * 7 / 8;
1755 h->sum += h->addr[offset];
1756 }
1757 }
1758
disasm__purge(struct list_head * head)1759 void disasm__purge(struct list_head *head)
1760 {
1761 struct disasm_line *pos, *n;
1762
1763 list_for_each_entry_safe(pos, n, head, node) {
1764 list_del(&pos->node);
1765 disasm_line__free(pos);
1766 }
1767 }
1768
disasm_line__fprintf(struct disasm_line * dl,FILE * fp)1769 static size_t disasm_line__fprintf(struct disasm_line *dl, FILE *fp)
1770 {
1771 size_t printed;
1772
1773 if (dl->offset == -1)
1774 return fprintf(fp, "%s\n", dl->line);
1775
1776 printed = fprintf(fp, "%#" PRIx64 " %s", dl->offset, dl->name);
1777
1778 if (dl->ops.raw[0] != '\0') {
1779 printed += fprintf(fp, "%.*s %s\n", 6 - (int)printed, " ",
1780 dl->ops.raw);
1781 }
1782
1783 return printed + fprintf(fp, "\n");
1784 }
1785
disasm__fprintf(struct list_head * head,FILE * fp)1786 size_t disasm__fprintf(struct list_head *head, FILE *fp)
1787 {
1788 struct disasm_line *pos;
1789 size_t printed = 0;
1790
1791 list_for_each_entry(pos, head, node)
1792 printed += disasm_line__fprintf(pos, fp);
1793
1794 return printed;
1795 }
1796
symbol__tty_annotate(struct symbol * sym,struct map * map,struct perf_evsel * evsel,bool print_lines,bool full_paths,int min_pcnt,int max_lines)1797 int symbol__tty_annotate(struct symbol *sym, struct map *map,
1798 struct perf_evsel *evsel, bool print_lines,
1799 bool full_paths, int min_pcnt, int max_lines)
1800 {
1801 struct dso *dso = map->dso;
1802 struct rb_root source_line = RB_ROOT;
1803 u64 len;
1804
1805 if (symbol__disassemble(sym, map, 0) < 0)
1806 return -1;
1807
1808 len = symbol__size(sym);
1809
1810 if (print_lines) {
1811 srcline_full_filename = full_paths;
1812 symbol__get_source_line(sym, map, evsel, &source_line, len);
1813 print_summary(&source_line, dso->long_name);
1814 }
1815
1816 symbol__annotate_printf(sym, map, evsel, full_paths,
1817 min_pcnt, max_lines, 0);
1818 if (print_lines)
1819 symbol__free_source_line(sym, len);
1820
1821 disasm__purge(&symbol__annotation(sym)->src->source);
1822
1823 return 0;
1824 }
1825
ui__has_annotation(void)1826 bool ui__has_annotation(void)
1827 {
1828 return use_browser == 1 && perf_hpp_list.sym;
1829 }
1830