projects / deliverable / linux.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
Merge remote-tracking branch 'ftrace/for-next'
[deliverable/linux.git] / tools / perf / util / annotate.c
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
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
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
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
57 static int call__parse(struct ins_operands *ops)
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 ops->target.addr = 0;
88 return 0;
89 }
90
91 tok = strchr(endptr, '*');
92 if (tok == NULL)
93 return -1;
94
95 ops->target.addr = strtoull(tok + 1, NULL, 16);
96 return 0;
97 }
98
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
116 bool ins__is_call(const struct ins *ins)
117 {
118 return ins->ops == &call_ops;
119 }
120
121 static int jump__parse(struct ins_operands *ops)
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
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
146 bool ins__is_jump(const struct ins *ins)
147 {
148 return ins->ops == &jump_ops;
149 }
150
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
176 static int lock__parse(struct ins_operands *ops)
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) < 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
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
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
240 static int mov__parse(struct ins_operands *ops)
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
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
307 static int dec__parse(struct ins_operands *ops)
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
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
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
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
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
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
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
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
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(&notes->src->source);
518 return 0;
519 }
520
521 /* The cycles histogram is lazily allocated. */
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
533 void symbol__annotate_zero_histograms(struct symbol *sym)
534 {
535 struct annotation *notes = symbol__annotation(sym);
536
537 pthread_mutex_lock(&notes->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(&notes->lock);
546 }
547
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
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 pr_debug("%s(%d): ERANGE! sym->name=%s, start=%#" PRIx64 ", addr=%#" PRIx64 ", end=%#" PRIx64 "\n",
598 __func__, __LINE__, sym->name, sym->start, addr, sym->end);
599 return -ERANGE;
600 }
601
602 offset = addr - sym->start;
603 h = annotation__histogram(notes, evidx);
604 h->sum++;
605 h->addr[offset]++;
606
607 pr_debug3("%#" PRIx64 " %s: period++ [addr: %#" PRIx64 ", %#" PRIx64
608 ", evidx=%d] => %" PRIu64 "\n", sym->start, sym->name,
609 addr, addr - sym->start, evidx, h->addr[offset]);
610 return 0;
611 }
612
613 static struct annotation *symbol__get_annotation(struct symbol *sym, bool cycles)
614 {
615 struct annotation *notes = symbol__annotation(sym);
616
617 if (notes->src == NULL) {
618 if (symbol__alloc_hist(sym) < 0)
619 return NULL;
620 }
621 if (!notes->src->cycles_hist && cycles) {
622 if (symbol__alloc_hist_cycles(sym) < 0)
623 return NULL;
624 }
625 return notes;
626 }
627
628 static int symbol__inc_addr_samples(struct symbol *sym, struct map *map,
629 int evidx, u64 addr)
630 {
631 struct annotation *notes;
632
633 if (sym == NULL)
634 return 0;
635 notes = symbol__get_annotation(sym, false);
636 if (notes == NULL)
637 return -ENOMEM;
638 return __symbol__inc_addr_samples(sym, map, notes, evidx, addr);
639 }
640
641 static int symbol__account_cycles(u64 addr, u64 start,
642 struct symbol *sym, unsigned cycles)
643 {
644 struct annotation *notes;
645 unsigned offset;
646
647 if (sym == NULL)
648 return 0;
649 notes = symbol__get_annotation(sym, true);
650 if (notes == NULL)
651 return -ENOMEM;
652 if (addr < sym->start || addr >= sym->end)
653 return -ERANGE;
654
655 if (start) {
656 if (start < sym->start || start >= sym->end)
657 return -ERANGE;
658 if (start >= addr)
659 start = 0;
660 }
661 offset = addr - sym->start;
662 return __symbol__account_cycles(notes,
663 start ? start - sym->start : 0,
664 offset, cycles,
665 !!start);
666 }
667
668 int addr_map_symbol__account_cycles(struct addr_map_symbol *ams,
669 struct addr_map_symbol *start,
670 unsigned cycles)
671 {
672 u64 saddr = 0;
673 int err;
674
675 if (!cycles)
676 return 0;
677
678 /*
679 * Only set start when IPC can be computed. We can only
680 * compute it when the basic block is completely in a single
681 * function.
682 * Special case the case when the jump is elsewhere, but
683 * it starts on the function start.
684 */
685 if (start &&
686 (start->sym == ams->sym ||
687 (ams->sym &&
688 start->addr == ams->sym->start + ams->map->start)))
689 saddr = start->al_addr;
690 if (saddr == 0)
691 pr_debug2("BB with bad start: addr %"PRIx64" start %"PRIx64" sym %"PRIx64" saddr %"PRIx64"\n",
692 ams->addr,
693 start ? start->addr : 0,
694 ams->sym ? ams->sym->start + ams->map->start : 0,
695 saddr);
696 err = symbol__account_cycles(ams->al_addr, saddr, ams->sym, cycles);
697 if (err)
698 pr_debug2("account_cycles failed %d\n", err);
699 return err;
700 }
701
702 int addr_map_symbol__inc_samples(struct addr_map_symbol *ams, int evidx)
703 {
704 return symbol__inc_addr_samples(ams->sym, ams->map, evidx, ams->al_addr);
705 }
706
707 int hist_entry__inc_addr_samples(struct hist_entry *he, int evidx, u64 ip)
708 {
709 return symbol__inc_addr_samples(he->ms.sym, he->ms.map, evidx, ip);
710 }
711
712 static void disasm_line__init_ins(struct disasm_line *dl)
713 {
714 dl->ins = ins__find(dl->name);
715
716 if (dl->ins == NULL)
717 return;
718
719 if (!dl->ins->ops)
720 return;
721
722 if (dl->ins->ops->parse && dl->ins->ops->parse(&dl->ops) < 0)
723 dl->ins = NULL;
724 }
725
726 static int disasm_line__parse(char *line, char **namep, char **rawp)
727 {
728 char *name = line, tmp;
729
730 while (isspace(name[0]))
731 ++name;
732
733 if (name[0] == '\0')
734 return -1;
735
736 *rawp = name + 1;
737
738 while ((*rawp)[0] != '\0' && !isspace((*rawp)[0]))
739 ++*rawp;
740
741 tmp = (*rawp)[0];
742 (*rawp)[0] = '\0';
743 *namep = strdup(name);
744
745 if (*namep == NULL)
746 goto out_free_name;
747
748 (*rawp)[0] = tmp;
749
750 if ((*rawp)[0] != '\0') {
751 (*rawp)++;
752 while (isspace((*rawp)[0]))
753 ++(*rawp);
754 }
755
756 return 0;
757
758 out_free_name:
759 zfree(namep);
760 return -1;
761 }
762
763 static struct disasm_line *disasm_line__new(s64 offset, char *line,
764 size_t privsize, int line_nr)
765 {
766 struct disasm_line *dl = zalloc(sizeof(*dl) + privsize);
767
768 if (dl != NULL) {
769 dl->offset = offset;
770 dl->line = strdup(line);
771 dl->line_nr = line_nr;
772 if (dl->line == NULL)
773 goto out_delete;
774
775 if (offset != -1) {
776 if (disasm_line__parse(dl->line, &dl->name, &dl->ops.raw) < 0)
777 goto out_free_line;
778
779 disasm_line__init_ins(dl);
780 }
781 }
782
783 return dl;
784
785 out_free_line:
786 zfree(&dl->line);
787 out_delete:
788 free(dl);
789 return NULL;
790 }
791
792 void disasm_line__free(struct disasm_line *dl)
793 {
794 zfree(&dl->line);
795 zfree(&dl->name);
796 if (dl->ins && dl->ins->ops->free)
797 dl->ins->ops->free(&dl->ops);
798 else
799 ins__delete(&dl->ops);
800 free(dl);
801 }
802
803 int disasm_line__scnprintf(struct disasm_line *dl, char *bf, size_t size, bool raw)
804 {
805 if (raw || !dl->ins)
806 return scnprintf(bf, size, "%-6.6s %s", dl->name, dl->ops.raw);
807
808 return ins__scnprintf(dl->ins, bf, size, &dl->ops);
809 }
810
811 static void disasm__add(struct list_head *head, struct disasm_line *line)
812 {
813 list_add_tail(&line->node, head);
814 }
815
816 struct disasm_line *disasm__get_next_ip_line(struct list_head *head, struct disasm_line *pos)
817 {
818 list_for_each_entry_continue(pos, head, node)
819 if (pos->offset >= 0)
820 return pos;
821
822 return NULL;
823 }
824
825 double disasm__calc_percent(struct annotation *notes, int evidx, s64 offset,
826 s64 end, const char **path, u64 *nr_samples)
827 {
828 struct source_line *src_line = notes->src->lines;
829 double percent = 0.0;
830 *nr_samples = 0;
831
832 if (src_line) {
833 size_t sizeof_src_line = sizeof(*src_line) +
834 sizeof(src_line->samples) * (src_line->nr_pcnt - 1);
835
836 while (offset < end) {
837 src_line = (void *)notes->src->lines +
838 (sizeof_src_line * offset);
839
840 if (*path == NULL)
841 *path = src_line->path;
842
843 percent += src_line->samples[evidx].percent;
844 *nr_samples += src_line->samples[evidx].nr;
845 offset++;
846 }
847 } else {
848 struct sym_hist *h = annotation__histogram(notes, evidx);
849 unsigned int hits = 0;
850
851 while (offset < end)
852 hits += h->addr[offset++];
853
854 if (h->sum) {
855 *nr_samples = hits;
856 percent = 100.0 * hits / h->sum;
857 }
858 }
859
860 return percent;
861 }
862
863 static const char *annotate__address_color(struct block_range *br)
864 {
865 double cov = block_range__coverage(br);
866
867 if (cov >= 0) {
868 /* mark red for >75% coverage */
869 if (cov > 0.75)
870 return PERF_COLOR_RED;
871
872 /* mark dull for <1% coverage */
873 if (cov < 0.01)
874 return PERF_COLOR_NORMAL;
875 }
876
877 return PERF_COLOR_MAGENTA;
878 }
879
880 static const char *annotate__asm_color(struct block_range *br)
881 {
882 double cov = block_range__coverage(br);
883
884 if (cov >= 0) {
885 /* mark dull for <1% coverage */
886 if (cov < 0.01)
887 return PERF_COLOR_NORMAL;
888 }
889
890 return PERF_COLOR_BLUE;
891 }
892
893 static void annotate__branch_printf(struct block_range *br, u64 addr)
894 {
895 bool emit_comment = true;
896
897 if (!br)
898 return;
899
900 #if 1
901 if (br->is_target && br->start == addr) {
902 struct block_range *branch = br;
903 double p;
904
905 /*
906 * Find matching branch to our target.
907 */
908 while (!branch->is_branch)
909 branch = block_range__next(branch);
910
911 p = 100 *(double)br->entry / branch->coverage;
912
913 if (p > 0.1) {
914 if (emit_comment) {
915 emit_comment = false;
916 printf("\t#");
917 }
918
919 /*
920 * The percentage of coverage joined at this target in relation
921 * to the next branch.
922 */
923 printf(" +%.2f%%", p);
924 }
925 }
926 #endif
927 if (br->is_branch && br->end == addr) {
928 double p = 100*(double)br->taken / br->coverage;
929
930 if (p > 0.1) {
931 if (emit_comment) {
932 emit_comment = false;
933 printf("\t#");
934 }
935
936 /*
937 * The percentage of coverage leaving at this branch, and
938 * its prediction ratio.
939 */
940 printf(" -%.2f%% (p:%.2f%%)", p, 100*(double)br->pred / br->taken);
941 }
942 }
943 }
944
945
946 static int disasm_line__print(struct disasm_line *dl, struct symbol *sym, u64 start,
947 struct perf_evsel *evsel, u64 len, int min_pcnt, int printed,
948 int max_lines, struct disasm_line *queue)
949 {
950 static const char *prev_line;
951 static const char *prev_color;
952
953 if (dl->offset != -1) {
954 const char *path = NULL;
955 u64 nr_samples;
956 double percent, max_percent = 0.0;
957 double *ppercents = &percent;
958 u64 *psamples = &nr_samples;
959 int i, nr_percent = 1;
960 const char *color;
961 struct annotation *notes = symbol__annotation(sym);
962 s64 offset = dl->offset;
963 const u64 addr = start + offset;
964 struct disasm_line *next;
965 struct block_range *br;
966
967 next = disasm__get_next_ip_line(&notes->src->source, dl);
968
969 if (perf_evsel__is_group_event(evsel)) {
970 nr_percent = evsel->nr_members;
971 ppercents = calloc(nr_percent, sizeof(double));
972 psamples = calloc(nr_percent, sizeof(u64));
973 if (ppercents == NULL || psamples == NULL) {
974 return -1;
975 }
976 }
977
978 for (i = 0; i < nr_percent; i++) {
979 percent = disasm__calc_percent(notes,
980 notes->src->lines ? i : evsel->idx + i,
981 offset,
982 next ? next->offset : (s64) len,
983 &path, &nr_samples);
984
985 ppercents[i] = percent;
986 psamples[i] = nr_samples;
987 if (percent > max_percent)
988 max_percent = percent;
989 }
990
991 if (max_percent < min_pcnt)
992 return -1;
993
994 if (max_lines && printed >= max_lines)
995 return 1;
996
997 if (queue != NULL) {
998 list_for_each_entry_from(queue, &notes->src->source, node) {
999 if (queue == dl)
1000 break;
1001 disasm_line__print(queue, sym, start, evsel, len,
1002 0, 0, 1, NULL);
1003 }
1004 }
1005
1006 color = get_percent_color(max_percent);
1007
1008 /*
1009 * Also color the filename and line if needed, with
1010 * the same color than the percentage. Don't print it
1011 * twice for close colored addr with the same filename:line
1012 */
1013 if (path) {
1014 if (!prev_line || strcmp(prev_line, path)
1015 || color != prev_color) {
1016 color_fprintf(stdout, color, " %s", path);
1017 prev_line = path;
1018 prev_color = color;
1019 }
1020 }
1021
1022 for (i = 0; i < nr_percent; i++) {
1023 percent = ppercents[i];
1024 nr_samples = psamples[i];
1025 color = get_percent_color(percent);
1026
1027 if (symbol_conf.show_total_period)
1028 color_fprintf(stdout, color, " %7" PRIu64,
1029 nr_samples);
1030 else
1031 color_fprintf(stdout, color, " %7.2f", percent);
1032 }
1033
1034 printf(" : ");
1035
1036 br = block_range__find(addr);
1037 color_fprintf(stdout, annotate__address_color(br), " %" PRIx64 ":", addr);
1038 color_fprintf(stdout, annotate__asm_color(br), "%s", dl->line);
1039 annotate__branch_printf(br, addr);
1040 printf("\n");
1041
1042 if (ppercents != &percent)
1043 free(ppercents);
1044
1045 if (psamples != &nr_samples)
1046 free(psamples);
1047
1048 } else if (max_lines && printed >= max_lines)
1049 return 1;
1050 else {
1051 int width = 8;
1052
1053 if (queue)
1054 return -1;
1055
1056 if (perf_evsel__is_group_event(evsel))
1057 width *= evsel->nr_members;
1058
1059 if (!*dl->line)
1060 printf(" %*s:\n", width, " ");
1061 else
1062 printf(" %*s: %s\n", width, " ", dl->line);
1063 }
1064
1065 return 0;
1066 }
1067
1068 /*
1069 * symbol__parse_objdump_line() parses objdump output (with -d --no-show-raw)
1070 * which looks like following
1071 *
1072 * 0000000000415500 <_init>:
1073 * 415500: sub $0x8,%rsp
1074 * 415504: mov 0x2f5ad5(%rip),%rax # 70afe0 <_DYNAMIC+0x2f8>
1075 * 41550b: test %rax,%rax
1076 * 41550e: je 415515 <_init+0x15>
1077 * 415510: callq 416e70 <__gmon_start__@plt>
1078 * 415515: add $0x8,%rsp
1079 * 415519: retq
1080 *
1081 * it will be parsed and saved into struct disasm_line as
1082 * <offset> <name> <ops.raw>
1083 *
1084 * The offset will be a relative offset from the start of the symbol and -1
1085 * means that it's not a disassembly line so should be treated differently.
1086 * The ops.raw part will be parsed further according to type of the instruction.
1087 */
1088 static int symbol__parse_objdump_line(struct symbol *sym, struct map *map,
1089 FILE *file, size_t privsize,
1090 int *line_nr)
1091 {
1092 struct annotation *notes = symbol__annotation(sym);
1093 struct disasm_line *dl;
1094 char *line = NULL, *parsed_line, *tmp, *tmp2, *c;
1095 size_t line_len;
1096 s64 line_ip, offset = -1;
1097 regmatch_t match[2];
1098
1099 if (getline(&line, &line_len, file) < 0)
1100 return -1;
1101
1102 if (!line)
1103 return -1;
1104
1105 while (line_len != 0 && isspace(line[line_len - 1]))
1106 line[--line_len] = '\0';
1107
1108 c = strchr(line, '\n');
1109 if (c)
1110 *c = 0;
1111
1112 line_ip = -1;
1113 parsed_line = line;
1114
1115 /* /filename:linenr ? Save line number and ignore. */
1116 if (regexec(&file_lineno, line, 2, match, 0) == 0) {
1117 *line_nr = atoi(line + match[1].rm_so);
1118 return 0;
1119 }
1120
1121 /*
1122 * Strip leading spaces:
1123 */
1124 tmp = line;
1125 while (*tmp) {
1126 if (*tmp != ' ')
1127 break;
1128 tmp++;
1129 }
1130
1131 if (*tmp) {
1132 /*
1133 * Parse hexa addresses followed by ':'
1134 */
1135 line_ip = strtoull(tmp, &tmp2, 16);
1136 if (*tmp2 != ':' || tmp == tmp2 || tmp2[1] == '\0')
1137 line_ip = -1;
1138 }
1139
1140 if (line_ip != -1) {
1141 u64 start = map__rip_2objdump(map, sym->start),
1142 end = map__rip_2objdump(map, sym->end);
1143
1144 offset = line_ip - start;
1145 if ((u64)line_ip < start || (u64)line_ip >= end)
1146 offset = -1;
1147 else
1148 parsed_line = tmp2 + 1;
1149 }
1150
1151 dl = disasm_line__new(offset, parsed_line, privsize, *line_nr);
1152 free(line);
1153 (*line_nr)++;
1154
1155 if (dl == NULL)
1156 return -1;
1157
1158 if (dl->ops.target.offset == UINT64_MAX)
1159 dl->ops.target.offset = dl->ops.target.addr -
1160 map__rip_2objdump(map, sym->start);
1161
1162 /* kcore has no symbols, so add the call target name */
1163 if (dl->ins && ins__is_call(dl->ins) && !dl->ops.target.name) {
1164 struct addr_map_symbol target = {
1165 .map = map,
1166 .addr = dl->ops.target.addr,
1167 };
1168
1169 if (!map_groups__find_ams(&target) &&
1170 target.sym->start == target.al_addr)
1171 dl->ops.target.name = strdup(target.sym->name);
1172 }
1173
1174 disasm__add(&notes->src->source, dl);
1175
1176 return 0;
1177 }
1178
1179 static __attribute__((constructor)) void symbol__init_regexpr(void)
1180 {
1181 regcomp(&file_lineno, "^/[^:]+:([0-9]+)", REG_EXTENDED);
1182 }
1183
1184 static void delete_last_nop(struct symbol *sym)
1185 {
1186 struct annotation *notes = symbol__annotation(sym);
1187 struct list_head *list = &notes->src->source;
1188 struct disasm_line *dl;
1189
1190 while (!list_empty(list)) {
1191 dl = list_entry(list->prev, struct disasm_line, node);
1192
1193 if (dl->ins && dl->ins->ops) {
1194 if (dl->ins->ops != &nop_ops)
1195 return;
1196 } else {
1197 if (!strstr(dl->line, " nop ") &&
1198 !strstr(dl->line, " nopl ") &&
1199 !strstr(dl->line, " nopw "))
1200 return;
1201 }
1202
1203 list_del(&dl->node);
1204 disasm_line__free(dl);
1205 }
1206 }
1207
1208 int symbol__strerror_disassemble(struct symbol *sym __maybe_unused, struct map *map,
1209 int errnum, char *buf, size_t buflen)
1210 {
1211 struct dso *dso = map->dso;
1212
1213 BUG_ON(buflen == 0);
1214
1215 if (errnum >= 0) {
1216 str_error_r(errnum, buf, buflen);
1217 return 0;
1218 }
1219
1220 switch (errnum) {
1221 case SYMBOL_ANNOTATE_ERRNO__NO_VMLINUX: {
1222 char bf[SBUILD_ID_SIZE + 15] = " with build id ";
1223 char *build_id_msg = NULL;
1224
1225 if (dso->has_build_id) {
1226 build_id__sprintf(dso->build_id,
1227 sizeof(dso->build_id), bf + 15);
1228 build_id_msg = bf;
1229 }
1230 scnprintf(buf, buflen,
1231 "No vmlinux file%s\nwas found in the path.\n\n"
1232 "Note that annotation using /proc/kcore requires CAP_SYS_RAWIO capability.\n\n"
1233 "Please use:\n\n"
1234 " perf buildid-cache -vu vmlinux\n\n"
1235 "or:\n\n"
1236 " --vmlinux vmlinux\n", build_id_msg ?: "");
1237 }
1238 break;
1239 default:
1240 scnprintf(buf, buflen, "Internal error: Invalid %d error code\n", errnum);
1241 break;
1242 }
1243
1244 return 0;
1245 }
1246
1247 static int dso__disassemble_filename(struct dso *dso, char *filename, size_t filename_size)
1248 {
1249 char linkname[PATH_MAX];
1250 char *build_id_filename;
1251
1252 if (dso->symtab_type == DSO_BINARY_TYPE__KALLSYMS &&
1253 !dso__is_kcore(dso))
1254 return SYMBOL_ANNOTATE_ERRNO__NO_VMLINUX;
1255
1256 build_id_filename = dso__build_id_filename(dso, NULL, 0);
1257 if (build_id_filename) {
1258 __symbol__join_symfs(filename, filename_size, build_id_filename);
1259 free(build_id_filename);
1260 } else {
1261 if (dso->has_build_id)
1262 return ENOMEM;
1263 goto fallback;
1264 }
1265
1266 if (dso__is_kcore(dso) ||
1267 readlink(filename, linkname, sizeof(linkname)) < 0 ||
1268 strstr(linkname, DSO__NAME_KALLSYMS) ||
1269 access(filename, R_OK)) {
1270 fallback:
1271 /*
1272 * If we don't have build-ids or the build-id file isn't in the
1273 * cache, or is just a kallsyms file, well, lets hope that this
1274 * DSO is the same as when 'perf record' ran.
1275 */
1276 __symbol__join_symfs(filename, filename_size, dso->long_name);
1277 }
1278
1279 return 0;
1280 }
1281
1282 int symbol__disassemble(struct symbol *sym, struct map *map, size_t privsize)
1283 {
1284 struct dso *dso = map->dso;
1285 char command[PATH_MAX * 2];
1286 FILE *file;
1287 char symfs_filename[PATH_MAX];
1288 struct kcore_extract kce;
1289 bool delete_extract = false;
1290 int stdout_fd[2];
1291 int lineno = 0;
1292 int nline;
1293 pid_t pid;
1294 int err = dso__disassemble_filename(dso, symfs_filename, sizeof(symfs_filename));
1295
1296 if (err)
1297 return err;
1298
1299 pr_debug("%s: filename=%s, sym=%s, start=%#" PRIx64 ", end=%#" PRIx64 "\n", __func__,
1300 symfs_filename, sym->name, map->unmap_ip(map, sym->start),
1301 map->unmap_ip(map, sym->end));
1302
1303 pr_debug("annotating [%p] %30s : [%p] %30s\n",
1304 dso, dso->long_name, sym, sym->name);
1305
1306 if (dso__is_kcore(dso)) {
1307 kce.kcore_filename = symfs_filename;
1308 kce.addr = map__rip_2objdump(map, sym->start);
1309 kce.offs = sym->start;
1310 kce.len = sym->end - sym->start;
1311 if (!kcore_extract__create(&kce)) {
1312 delete_extract = true;
1313 strlcpy(symfs_filename, kce.extract_filename,
1314 sizeof(symfs_filename));
1315 }
1316 } else if (dso__needs_decompress(dso)) {
1317 char tmp[PATH_MAX];
1318 struct kmod_path m;
1319 int fd;
1320 bool ret;
1321
1322 if (kmod_path__parse_ext(&m, symfs_filename))
1323 goto out;
1324
1325 snprintf(tmp, PATH_MAX, "/tmp/perf-kmod-XXXXXX");
1326
1327 fd = mkstemp(tmp);
1328 if (fd < 0) {
1329 free(m.ext);
1330 goto out;
1331 }
1332
1333 ret = decompress_to_file(m.ext, symfs_filename, fd);
1334
1335 if (ret)
1336 pr_err("Cannot decompress %s %s\n", m.ext, symfs_filename);
1337
1338 free(m.ext);
1339 close(fd);
1340
1341 if (!ret)
1342 goto out;
1343
1344 strcpy(symfs_filename, tmp);
1345 }
1346
1347 snprintf(command, sizeof(command),
1348 "%s %s%s --start-address=0x%016" PRIx64
1349 " --stop-address=0x%016" PRIx64
1350 " -l -d %s %s -C %s 2>/dev/null|grep -v %s|expand",
1351 objdump_path ? objdump_path : "objdump",
1352 disassembler_style ? "-M " : "",
1353 disassembler_style ? disassembler_style : "",
1354 map__rip_2objdump(map, sym->start),
1355 map__rip_2objdump(map, sym->end),
1356 symbol_conf.annotate_asm_raw ? "" : "--no-show-raw",
1357 symbol_conf.annotate_src ? "-S" : "",
1358 symfs_filename, symfs_filename);
1359
1360 pr_debug("Executing: %s\n", command);
1361
1362 err = -1;
1363 if (pipe(stdout_fd) < 0) {
1364 pr_err("Failure creating the pipe to run %s\n", command);
1365 goto out_remove_tmp;
1366 }
1367
1368 pid = fork();
1369 if (pid < 0) {
1370 pr_err("Failure forking to run %s\n", command);
1371 goto out_close_stdout;
1372 }
1373
1374 if (pid == 0) {
1375 close(stdout_fd[0]);
1376 dup2(stdout_fd[1], 1);
1377 close(stdout_fd[1]);
1378 execl("/bin/sh", "sh", "-c", command, NULL);
1379 perror(command);
1380 exit(-1);
1381 }
1382
1383 close(stdout_fd[1]);
1384
1385 file = fdopen(stdout_fd[0], "r");
1386 if (!file) {
1387 pr_err("Failure creating FILE stream for %s\n", command);
1388 /*
1389 * If we were using debug info should retry with
1390 * original binary.
1391 */
1392 goto out_remove_tmp;
1393 }
1394
1395 nline = 0;
1396 while (!feof(file)) {
1397 if (symbol__parse_objdump_line(sym, map, file, privsize,
1398 &lineno) < 0)
1399 break;
1400 nline++;
1401 }
1402
1403 if (nline == 0)
1404 pr_err("No output from %s\n", command);
1405
1406 /*
1407 * kallsyms does not have symbol sizes so there may a nop at the end.
1408 * Remove it.
1409 */
1410 if (dso__is_kcore(dso))
1411 delete_last_nop(sym);
1412
1413 fclose(file);
1414 err = 0;
1415 out_remove_tmp:
1416 close(stdout_fd[0]);
1417
1418 if (dso__needs_decompress(dso))
1419 unlink(symfs_filename);
1420
1421 if (delete_extract)
1422 kcore_extract__delete(&kce);
1423 out:
1424 return err;
1425
1426 out_close_stdout:
1427 close(stdout_fd[1]);
1428 goto out_remove_tmp;
1429 }
1430
1431 static void insert_source_line(struct rb_root *root, struct source_line *src_line)
1432 {
1433 struct source_line *iter;
1434 struct rb_node **p = &root->rb_node;
1435 struct rb_node *parent = NULL;
1436 int i, ret;
1437
1438 while (*p != NULL) {
1439 parent = *p;
1440 iter = rb_entry(parent, struct source_line, node);
1441
1442 ret = strcmp(iter->path, src_line->path);
1443 if (ret == 0) {
1444 for (i = 0; i < src_line->nr_pcnt; i++)
1445 iter->samples[i].percent_sum += src_line->samples[i].percent;
1446 return;
1447 }
1448
1449 if (ret < 0)
1450 p = &(*p)->rb_left;
1451 else
1452 p = &(*p)->rb_right;
1453 }
1454
1455 for (i = 0; i < src_line->nr_pcnt; i++)
1456 src_line->samples[i].percent_sum = src_line->samples[i].percent;
1457
1458 rb_link_node(&src_line->node, parent, p);
1459 rb_insert_color(&src_line->node, root);
1460 }
1461
1462 static int cmp_source_line(struct source_line *a, struct source_line *b)
1463 {
1464 int i;
1465
1466 for (i = 0; i < a->nr_pcnt; i++) {
1467 if (a->samples[i].percent_sum == b->samples[i].percent_sum)
1468 continue;
1469 return a->samples[i].percent_sum > b->samples[i].percent_sum;
1470 }
1471
1472 return 0;
1473 }
1474
1475 static void __resort_source_line(struct rb_root *root, struct source_line *src_line)
1476 {
1477 struct source_line *iter;
1478 struct rb_node **p = &root->rb_node;
1479 struct rb_node *parent = NULL;
1480
1481 while (*p != NULL) {
1482 parent = *p;
1483 iter = rb_entry(parent, struct source_line, node);
1484
1485 if (cmp_source_line(src_line, iter))
1486 p = &(*p)->rb_left;
1487 else
1488 p = &(*p)->rb_right;
1489 }
1490
1491 rb_link_node(&src_line->node, parent, p);
1492 rb_insert_color(&src_line->node, root);
1493 }
1494
1495 static void resort_source_line(struct rb_root *dest_root, struct rb_root *src_root)
1496 {
1497 struct source_line *src_line;
1498 struct rb_node *node;
1499
1500 node = rb_first(src_root);
1501 while (node) {
1502 struct rb_node *next;
1503
1504 src_line = rb_entry(node, struct source_line, node);
1505 next = rb_next(node);
1506 rb_erase(node, src_root);
1507
1508 __resort_source_line(dest_root, src_line);
1509 node = next;
1510 }
1511 }
1512
1513 static void symbol__free_source_line(struct symbol *sym, int len)
1514 {
1515 struct annotation *notes = symbol__annotation(sym);
1516 struct source_line *src_line = notes->src->lines;
1517 size_t sizeof_src_line;
1518 int i;
1519
1520 sizeof_src_line = sizeof(*src_line) +
1521 (sizeof(src_line->samples) * (src_line->nr_pcnt - 1));
1522
1523 for (i = 0; i < len; i++) {
1524 free_srcline(src_line->path);
1525 src_line = (void *)src_line + sizeof_src_line;
1526 }
1527
1528 zfree(&notes->src->lines);
1529 }
1530
1531 /* Get the filename:line for the colored entries */
1532 static int symbol__get_source_line(struct symbol *sym, struct map *map,
1533 struct perf_evsel *evsel,
1534 struct rb_root *root, int len)
1535 {
1536 u64 start;
1537 int i, k;
1538 int evidx = evsel->idx;
1539 struct source_line *src_line;
1540 struct annotation *notes = symbol__annotation(sym);
1541 struct sym_hist *h = annotation__histogram(notes, evidx);
1542 struct rb_root tmp_root = RB_ROOT;
1543 int nr_pcnt = 1;
1544 u64 h_sum = h->sum;
1545 size_t sizeof_src_line = sizeof(struct source_line);
1546
1547 if (perf_evsel__is_group_event(evsel)) {
1548 for (i = 1; i < evsel->nr_members; i++) {
1549 h = annotation__histogram(notes, evidx + i);
1550 h_sum += h->sum;
1551 }
1552 nr_pcnt = evsel->nr_members;
1553 sizeof_src_line += (nr_pcnt - 1) * sizeof(src_line->samples);
1554 }
1555
1556 if (!h_sum)
1557 return 0;
1558
1559 src_line = notes->src->lines = calloc(len, sizeof_src_line);
1560 if (!notes->src->lines)
1561 return -1;
1562
1563 start = map__rip_2objdump(map, sym->start);
1564
1565 for (i = 0; i < len; i++) {
1566 u64 offset;
1567 double percent_max = 0.0;
1568
1569 src_line->nr_pcnt = nr_pcnt;
1570
1571 for (k = 0; k < nr_pcnt; k++) {
1572 h = annotation__histogram(notes, evidx + k);
1573 src_line->samples[k].percent = 100.0 * h->addr[i] / h->sum;
1574
1575 if (src_line->samples[k].percent > percent_max)
1576 percent_max = src_line->samples[k].percent;
1577 }
1578
1579 if (percent_max <= 0.5)
1580 goto next;
1581
1582 offset = start + i;
1583 src_line->path = get_srcline(map->dso, offset, NULL, false);
1584 insert_source_line(&tmp_root, src_line);
1585
1586 next:
1587 src_line = (void *)src_line + sizeof_src_line;
1588 }
1589
1590 resort_source_line(root, &tmp_root);
1591 return 0;
1592 }
1593
1594 static void print_summary(struct rb_root *root, const char *filename)
1595 {
1596 struct source_line *src_line;
1597 struct rb_node *node;
1598
1599 printf("\nSorted summary for file %s\n", filename);
1600 printf("----------------------------------------------\n\n");
1601
1602 if (RB_EMPTY_ROOT(root)) {
1603 printf(" Nothing higher than %1.1f%%\n", MIN_GREEN);
1604 return;
1605 }
1606
1607 node = rb_first(root);
1608 while (node) {
1609 double percent, percent_max = 0.0;
1610 const char *color;
1611 char *path;
1612 int i;
1613
1614 src_line = rb_entry(node, struct source_line, node);
1615 for (i = 0; i < src_line->nr_pcnt; i++) {
1616 percent = src_line->samples[i].percent_sum;
1617 color = get_percent_color(percent);
1618 color_fprintf(stdout, color, " %7.2f", percent);
1619
1620 if (percent > percent_max)
1621 percent_max = percent;
1622 }
1623
1624 path = src_line->path;
1625 color = get_percent_color(percent_max);
1626 color_fprintf(stdout, color, " %s\n", path);
1627
1628 node = rb_next(node);
1629 }
1630 }
1631
1632 static void symbol__annotate_hits(struct symbol *sym, struct perf_evsel *evsel)
1633 {
1634 struct annotation *notes = symbol__annotation(sym);
1635 struct sym_hist *h = annotation__histogram(notes, evsel->idx);
1636 u64 len = symbol__size(sym), offset;
1637
1638 for (offset = 0; offset < len; ++offset)
1639 if (h->addr[offset] != 0)
1640 printf("%*" PRIx64 ": %" PRIu64 "\n", BITS_PER_LONG / 2,
1641 sym->start + offset, h->addr[offset]);
1642 printf("%*s: %" PRIu64 "\n", BITS_PER_LONG / 2, "h->sum", h->sum);
1643 }
1644
1645 int symbol__annotate_printf(struct symbol *sym, struct map *map,
1646 struct perf_evsel *evsel, bool full_paths,
1647 int min_pcnt, int max_lines, int context)
1648 {
1649 struct dso *dso = map->dso;
1650 char *filename;
1651 const char *d_filename;
1652 const char *evsel_name = perf_evsel__name(evsel);
1653 struct annotation *notes = symbol__annotation(sym);
1654 struct sym_hist *h = annotation__histogram(notes, evsel->idx);
1655 struct disasm_line *pos, *queue = NULL;
1656 u64 start = map__rip_2objdump(map, sym->start);
1657 int printed = 2, queue_len = 0;
1658 int more = 0;
1659 u64 len;
1660 int width = 8;
1661 int graph_dotted_len;
1662
1663 filename = strdup(dso->long_name);
1664 if (!filename)
1665 return -ENOMEM;
1666
1667 if (full_paths)
1668 d_filename = filename;
1669 else
1670 d_filename = basename(filename);
1671
1672 len = symbol__size(sym);
1673
1674 if (perf_evsel__is_group_event(evsel))
1675 width *= evsel->nr_members;
1676
1677 graph_dotted_len = printf(" %-*.*s| Source code & Disassembly of %s for %s (%" PRIu64 " samples)\n",
1678 width, width, "Percent", d_filename, evsel_name, h->sum);
1679
1680 printf("%-*.*s----\n",
1681 graph_dotted_len, graph_dotted_len, graph_dotted_line);
1682
1683 if (verbose)
1684 symbol__annotate_hits(sym, evsel);
1685
1686 list_for_each_entry(pos, &notes->src->source, node) {
1687 if (context && queue == NULL) {
1688 queue = pos;
1689 queue_len = 0;
1690 }
1691
1692 switch (disasm_line__print(pos, sym, start, evsel, len,
1693 min_pcnt, printed, max_lines,
1694 queue)) {
1695 case 0:
1696 ++printed;
1697 if (context) {
1698 printed += queue_len;
1699 queue = NULL;
1700 queue_len = 0;
1701 }
1702 break;
1703 case 1:
1704 /* filtered by max_lines */
1705 ++more;
1706 break;
1707 case -1:
1708 default:
1709 /*
1710 * Filtered by min_pcnt or non IP lines when
1711 * context != 0
1712 */
1713 if (!context)
1714 break;
1715 if (queue_len == context)
1716 queue = list_entry(queue->node.next, typeof(*queue), node);
1717 else
1718 ++queue_len;
1719 break;
1720 }
1721 }
1722
1723 free(filename);
1724
1725 return more;
1726 }
1727
1728 void symbol__annotate_zero_histogram(struct symbol *sym, int evidx)
1729 {
1730 struct annotation *notes = symbol__annotation(sym);
1731 struct sym_hist *h = annotation__histogram(notes, evidx);
1732
1733 memset(h, 0, notes->src->sizeof_sym_hist);
1734 }
1735
1736 void symbol__annotate_decay_histogram(struct symbol *sym, int evidx)
1737 {
1738 struct annotation *notes = symbol__annotation(sym);
1739 struct sym_hist *h = annotation__histogram(notes, evidx);
1740 int len = symbol__size(sym), offset;
1741
1742 h->sum = 0;
1743 for (offset = 0; offset < len; ++offset) {
1744 h->addr[offset] = h->addr[offset] * 7 / 8;
1745 h->sum += h->addr[offset];
1746 }
1747 }
1748
1749 void disasm__purge(struct list_head *head)
1750 {
1751 struct disasm_line *pos, *n;
1752
1753 list_for_each_entry_safe(pos, n, head, node) {
1754 list_del(&pos->node);
1755 disasm_line__free(pos);
1756 }
1757 }
1758
1759 static size_t disasm_line__fprintf(struct disasm_line *dl, FILE *fp)
1760 {
1761 size_t printed;
1762
1763 if (dl->offset == -1)
1764 return fprintf(fp, "%s\n", dl->line);
1765
1766 printed = fprintf(fp, "%#" PRIx64 " %s", dl->offset, dl->name);
1767
1768 if (dl->ops.raw[0] != '\0') {
1769 printed += fprintf(fp, "%.*s %s\n", 6 - (int)printed, " ",
1770 dl->ops.raw);
1771 }
1772
1773 return printed + fprintf(fp, "\n");
1774 }
1775
1776 size_t disasm__fprintf(struct list_head *head, FILE *fp)
1777 {
1778 struct disasm_line *pos;
1779 size_t printed = 0;
1780
1781 list_for_each_entry(pos, head, node)
1782 printed += disasm_line__fprintf(pos, fp);
1783
1784 return printed;
1785 }
1786
1787 int symbol__tty_annotate(struct symbol *sym, struct map *map,
1788 struct perf_evsel *evsel, bool print_lines,
1789 bool full_paths, int min_pcnt, int max_lines)
1790 {
1791 struct dso *dso = map->dso;
1792 struct rb_root source_line = RB_ROOT;
1793 u64 len;
1794
1795 if (symbol__disassemble(sym, map, 0) < 0)
1796 return -1;
1797
1798 len = symbol__size(sym);
1799
1800 if (print_lines) {
1801 srcline_full_filename = full_paths;
1802 symbol__get_source_line(sym, map, evsel, &source_line, len);
1803 print_summary(&source_line, dso->long_name);
1804 }
1805
1806 symbol__annotate_printf(sym, map, evsel, full_paths,
1807 min_pcnt, max_lines, 0);
1808 if (print_lines)
1809 symbol__free_source_line(sym, len);
1810
1811 disasm__purge(&symbol__annotation(sym)->src->source);
1812
1813 return 0;
1814 }
1815
1816 bool ui__has_annotation(void)
1817 {
1818 return use_browser == 1 && perf_hpp_list.sym;
1819 }
Linux kernel - Deliverables
This page took 0.115484 seconds and 5 git commands to generate.