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