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