1 // SPDX-License-Identifier: GPL-2.0 2 #include <errno.h> 3 #include <inttypes.h> 4 #include <regex.h> 5 #include <stdlib.h> 6 #include <linux/mman.h> 7 #include <linux/time64.h> 8 #include "debug.h" 9 #include "dso.h" 10 #include "sort.h" 11 #include "hist.h" 12 #include "cacheline.h" 13 #include "comm.h" 14 #include "map.h" 15 #include "maps.h" 16 #include "symbol.h" 17 #include "map_symbol.h" 18 #include "branch.h" 19 #include "thread.h" 20 #include "evsel.h" 21 #include "evlist.h" 22 #include "srcline.h" 23 #include "strlist.h" 24 #include "strbuf.h" 25 #include <traceevent/event-parse.h> 26 #include "mem-events.h" 27 #include "annotate.h" 28 #include "time-utils.h" 29 #include "cgroup.h" 30 #include "machine.h" 31 #include <linux/kernel.h> 32 #include <linux/string.h> 33 34 regex_t parent_regex; 35 const char default_parent_pattern[] = "^sys_|^do_page_fault"; 36 const char *parent_pattern = default_parent_pattern; 37 const char *default_sort_order = "comm,dso,symbol"; 38 const char default_branch_sort_order[] = "comm,dso_from,symbol_from,symbol_to,cycles"; 39 const char default_mem_sort_order[] = "local_weight,mem,sym,dso,symbol_daddr,dso_daddr,snoop,tlb,locked"; 40 const char default_top_sort_order[] = "dso,symbol"; 41 const char default_diff_sort_order[] = "dso,symbol"; 42 const char default_tracepoint_sort_order[] = "trace"; 43 const char *sort_order; 44 const char *field_order; 45 regex_t ignore_callees_regex; 46 int have_ignore_callees = 0; 47 enum sort_mode sort__mode = SORT_MODE__NORMAL; 48 49 /* 50 * Replaces all occurrences of a char used with the: 51 * 52 * -t, --field-separator 53 * 54 * option, that uses a special separator character and don't pad with spaces, 55 * replacing all occurrences of this separator in symbol names (and other 56 * output) with a '.' character, that thus it's the only non valid separator. 57 */ 58 static int repsep_snprintf(char *bf, size_t size, const char *fmt, ...) 59 { 60 int n; 61 va_list ap; 62 63 va_start(ap, fmt); 64 n = vsnprintf(bf, size, fmt, ap); 65 if (symbol_conf.field_sep && n > 0) { 66 char *sep = bf; 67 68 while (1) { 69 sep = strchr(sep, *symbol_conf.field_sep); 70 if (sep == NULL) 71 break; 72 *sep = '.'; 73 } 74 } 75 va_end(ap); 76 77 if (n >= (int)size) 78 return size - 1; 79 return n; 80 } 81 82 static int64_t cmp_null(const void *l, const void *r) 83 { 84 if (!l && !r) 85 return 0; 86 else if (!l) 87 return -1; 88 else 89 return 1; 90 } 91 92 /* --sort pid */ 93 94 static int64_t 95 sort__thread_cmp(struct hist_entry *left, struct hist_entry *right) 96 { 97 return right->thread->tid - left->thread->tid; 98 } 99 100 static int hist_entry__thread_snprintf(struct hist_entry *he, char *bf, 101 size_t size, unsigned int width) 102 { 103 const char *comm = thread__comm_str(he->thread); 104 105 width = max(7U, width) - 8; 106 return repsep_snprintf(bf, size, "%7d:%-*.*s", he->thread->tid, 107 width, width, comm ?: ""); 108 } 109 110 static int hist_entry__thread_filter(struct hist_entry *he, int type, const void *arg) 111 { 112 const struct thread *th = arg; 113 114 if (type != HIST_FILTER__THREAD) 115 return -1; 116 117 return th && he->thread != th; 118 } 119 120 struct sort_entry sort_thread = { 121 .se_header = " Pid:Command", 122 .se_cmp = sort__thread_cmp, 123 .se_snprintf = hist_entry__thread_snprintf, 124 .se_filter = hist_entry__thread_filter, 125 .se_width_idx = HISTC_THREAD, 126 }; 127 128 /* --sort comm */ 129 130 /* 131 * We can't use pointer comparison in functions below, 132 * because it gives different results based on pointer 133 * values, which could break some sorting assumptions. 134 */ 135 static int64_t 136 sort__comm_cmp(struct hist_entry *left, struct hist_entry *right) 137 { 138 return strcmp(comm__str(right->comm), comm__str(left->comm)); 139 } 140 141 static int64_t 142 sort__comm_collapse(struct hist_entry *left, struct hist_entry *right) 143 { 144 return strcmp(comm__str(right->comm), comm__str(left->comm)); 145 } 146 147 static int64_t 148 sort__comm_sort(struct hist_entry *left, struct hist_entry *right) 149 { 150 return strcmp(comm__str(right->comm), comm__str(left->comm)); 151 } 152 153 static int hist_entry__comm_snprintf(struct hist_entry *he, char *bf, 154 size_t size, unsigned int width) 155 { 156 return repsep_snprintf(bf, size, "%-*.*s", width, width, comm__str(he->comm)); 157 } 158 159 struct sort_entry sort_comm = { 160 .se_header = "Command", 161 .se_cmp = sort__comm_cmp, 162 .se_collapse = sort__comm_collapse, 163 .se_sort = sort__comm_sort, 164 .se_snprintf = hist_entry__comm_snprintf, 165 .se_filter = hist_entry__thread_filter, 166 .se_width_idx = HISTC_COMM, 167 }; 168 169 /* --sort dso */ 170 171 static int64_t _sort__dso_cmp(struct map *map_l, struct map *map_r) 172 { 173 struct dso *dso_l = map_l ? map_l->dso : NULL; 174 struct dso *dso_r = map_r ? map_r->dso : NULL; 175 const char *dso_name_l, *dso_name_r; 176 177 if (!dso_l || !dso_r) 178 return cmp_null(dso_r, dso_l); 179 180 if (verbose > 0) { 181 dso_name_l = dso_l->long_name; 182 dso_name_r = dso_r->long_name; 183 } else { 184 dso_name_l = dso_l->short_name; 185 dso_name_r = dso_r->short_name; 186 } 187 188 return strcmp(dso_name_l, dso_name_r); 189 } 190 191 static int64_t 192 sort__dso_cmp(struct hist_entry *left, struct hist_entry *right) 193 { 194 return _sort__dso_cmp(right->ms.map, left->ms.map); 195 } 196 197 static int _hist_entry__dso_snprintf(struct map *map, char *bf, 198 size_t size, unsigned int width) 199 { 200 if (map && map->dso) { 201 const char *dso_name = verbose > 0 ? map->dso->long_name : 202 map->dso->short_name; 203 return repsep_snprintf(bf, size, "%-*.*s", width, width, dso_name); 204 } 205 206 return repsep_snprintf(bf, size, "%-*.*s", width, width, "[unknown]"); 207 } 208 209 static int hist_entry__dso_snprintf(struct hist_entry *he, char *bf, 210 size_t size, unsigned int width) 211 { 212 return _hist_entry__dso_snprintf(he->ms.map, bf, size, width); 213 } 214 215 static int hist_entry__dso_filter(struct hist_entry *he, int type, const void *arg) 216 { 217 const struct dso *dso = arg; 218 219 if (type != HIST_FILTER__DSO) 220 return -1; 221 222 return dso && (!he->ms.map || he->ms.map->dso != dso); 223 } 224 225 struct sort_entry sort_dso = { 226 .se_header = "Shared Object", 227 .se_cmp = sort__dso_cmp, 228 .se_snprintf = hist_entry__dso_snprintf, 229 .se_filter = hist_entry__dso_filter, 230 .se_width_idx = HISTC_DSO, 231 }; 232 233 /* --sort symbol */ 234 235 static int64_t _sort__addr_cmp(u64 left_ip, u64 right_ip) 236 { 237 return (int64_t)(right_ip - left_ip); 238 } 239 240 int64_t _sort__sym_cmp(struct symbol *sym_l, struct symbol *sym_r) 241 { 242 if (!sym_l || !sym_r) 243 return cmp_null(sym_l, sym_r); 244 245 if (sym_l == sym_r) 246 return 0; 247 248 if (sym_l->inlined || sym_r->inlined) { 249 int ret = strcmp(sym_l->name, sym_r->name); 250 251 if (ret) 252 return ret; 253 if ((sym_l->start <= sym_r->end) && (sym_l->end >= sym_r->start)) 254 return 0; 255 } 256 257 if (sym_l->start != sym_r->start) 258 return (int64_t)(sym_r->start - sym_l->start); 259 260 return (int64_t)(sym_r->end - sym_l->end); 261 } 262 263 static int64_t 264 sort__sym_cmp(struct hist_entry *left, struct hist_entry *right) 265 { 266 int64_t ret; 267 268 if (!left->ms.sym && !right->ms.sym) 269 return _sort__addr_cmp(left->ip, right->ip); 270 271 /* 272 * comparing symbol address alone is not enough since it's a 273 * relative address within a dso. 274 */ 275 if (!hists__has(left->hists, dso) || hists__has(right->hists, dso)) { 276 ret = sort__dso_cmp(left, right); 277 if (ret != 0) 278 return ret; 279 } 280 281 return _sort__sym_cmp(left->ms.sym, right->ms.sym); 282 } 283 284 static int64_t 285 sort__sym_sort(struct hist_entry *left, struct hist_entry *right) 286 { 287 if (!left->ms.sym || !right->ms.sym) 288 return cmp_null(left->ms.sym, right->ms.sym); 289 290 return strcmp(right->ms.sym->name, left->ms.sym->name); 291 } 292 293 static int _hist_entry__sym_snprintf(struct map_symbol *ms, 294 u64 ip, char level, char *bf, size_t size, 295 unsigned int width) 296 { 297 struct symbol *sym = ms->sym; 298 struct map *map = ms->map; 299 size_t ret = 0; 300 301 if (verbose > 0) { 302 char o = map ? dso__symtab_origin(map->dso) : '!'; 303 u64 rip = ip; 304 305 if (map && map->dso && map->dso->kernel 306 && map->dso->adjust_symbols) 307 rip = map->unmap_ip(map, ip); 308 309 ret += repsep_snprintf(bf, size, "%-#*llx %c ", 310 BITS_PER_LONG / 4 + 2, rip, o); 311 } 312 313 ret += repsep_snprintf(bf + ret, size - ret, "[%c] ", level); 314 if (sym && map) { 315 if (sym->type == STT_OBJECT) { 316 ret += repsep_snprintf(bf + ret, size - ret, "%s", sym->name); 317 ret += repsep_snprintf(bf + ret, size - ret, "+0x%llx", 318 ip - map->unmap_ip(map, sym->start)); 319 } else { 320 ret += repsep_snprintf(bf + ret, size - ret, "%.*s", 321 width - ret, 322 sym->name); 323 if (sym->inlined) 324 ret += repsep_snprintf(bf + ret, size - ret, 325 " (inlined)"); 326 } 327 } else { 328 size_t len = BITS_PER_LONG / 4; 329 ret += repsep_snprintf(bf + ret, size - ret, "%-#.*llx", 330 len, ip); 331 } 332 333 return ret; 334 } 335 336 int hist_entry__sym_snprintf(struct hist_entry *he, char *bf, size_t size, unsigned int width) 337 { 338 return _hist_entry__sym_snprintf(&he->ms, he->ip, 339 he->level, bf, size, width); 340 } 341 342 static int hist_entry__sym_filter(struct hist_entry *he, int type, const void *arg) 343 { 344 const char *sym = arg; 345 346 if (type != HIST_FILTER__SYMBOL) 347 return -1; 348 349 return sym && (!he->ms.sym || !strstr(he->ms.sym->name, sym)); 350 } 351 352 struct sort_entry sort_sym = { 353 .se_header = "Symbol", 354 .se_cmp = sort__sym_cmp, 355 .se_sort = sort__sym_sort, 356 .se_snprintf = hist_entry__sym_snprintf, 357 .se_filter = hist_entry__sym_filter, 358 .se_width_idx = HISTC_SYMBOL, 359 }; 360 361 /* --sort srcline */ 362 363 char *hist_entry__srcline(struct hist_entry *he) 364 { 365 return map__srcline(he->ms.map, he->ip, he->ms.sym); 366 } 367 368 static int64_t 369 sort__srcline_cmp(struct hist_entry *left, struct hist_entry *right) 370 { 371 if (!left->srcline) 372 left->srcline = hist_entry__srcline(left); 373 if (!right->srcline) 374 right->srcline = hist_entry__srcline(right); 375 376 return strcmp(right->srcline, left->srcline); 377 } 378 379 static int hist_entry__srcline_snprintf(struct hist_entry *he, char *bf, 380 size_t size, unsigned int width) 381 { 382 if (!he->srcline) 383 he->srcline = hist_entry__srcline(he); 384 385 return repsep_snprintf(bf, size, "%-.*s", width, he->srcline); 386 } 387 388 struct sort_entry sort_srcline = { 389 .se_header = "Source:Line", 390 .se_cmp = sort__srcline_cmp, 391 .se_snprintf = hist_entry__srcline_snprintf, 392 .se_width_idx = HISTC_SRCLINE, 393 }; 394 395 /* --sort srcline_from */ 396 397 static char *addr_map_symbol__srcline(struct addr_map_symbol *ams) 398 { 399 return map__srcline(ams->ms.map, ams->al_addr, ams->ms.sym); 400 } 401 402 static int64_t 403 sort__srcline_from_cmp(struct hist_entry *left, struct hist_entry *right) 404 { 405 if (!left->branch_info->srcline_from) 406 left->branch_info->srcline_from = addr_map_symbol__srcline(&left->branch_info->from); 407 408 if (!right->branch_info->srcline_from) 409 right->branch_info->srcline_from = addr_map_symbol__srcline(&right->branch_info->from); 410 411 return strcmp(right->branch_info->srcline_from, left->branch_info->srcline_from); 412 } 413 414 static int hist_entry__srcline_from_snprintf(struct hist_entry *he, char *bf, 415 size_t size, unsigned int width) 416 { 417 return repsep_snprintf(bf, size, "%-*.*s", width, width, he->branch_info->srcline_from); 418 } 419 420 struct sort_entry sort_srcline_from = { 421 .se_header = "From Source:Line", 422 .se_cmp = sort__srcline_from_cmp, 423 .se_snprintf = hist_entry__srcline_from_snprintf, 424 .se_width_idx = HISTC_SRCLINE_FROM, 425 }; 426 427 /* --sort srcline_to */ 428 429 static int64_t 430 sort__srcline_to_cmp(struct hist_entry *left, struct hist_entry *right) 431 { 432 if (!left->branch_info->srcline_to) 433 left->branch_info->srcline_to = addr_map_symbol__srcline(&left->branch_info->to); 434 435 if (!right->branch_info->srcline_to) 436 right->branch_info->srcline_to = addr_map_symbol__srcline(&right->branch_info->to); 437 438 return strcmp(right->branch_info->srcline_to, left->branch_info->srcline_to); 439 } 440 441 static int hist_entry__srcline_to_snprintf(struct hist_entry *he, char *bf, 442 size_t size, unsigned int width) 443 { 444 return repsep_snprintf(bf, size, "%-*.*s", width, width, he->branch_info->srcline_to); 445 } 446 447 struct sort_entry sort_srcline_to = { 448 .se_header = "To Source:Line", 449 .se_cmp = sort__srcline_to_cmp, 450 .se_snprintf = hist_entry__srcline_to_snprintf, 451 .se_width_idx = HISTC_SRCLINE_TO, 452 }; 453 454 static int hist_entry__sym_ipc_snprintf(struct hist_entry *he, char *bf, 455 size_t size, unsigned int width) 456 { 457 458 struct symbol *sym = he->ms.sym; 459 struct annotation *notes; 460 double ipc = 0.0, coverage = 0.0; 461 char tmp[64]; 462 463 if (!sym) 464 return repsep_snprintf(bf, size, "%-*s", width, "-"); 465 466 notes = symbol__annotation(sym); 467 468 if (notes->hit_cycles) 469 ipc = notes->hit_insn / ((double)notes->hit_cycles); 470 471 if (notes->total_insn) { 472 coverage = notes->cover_insn * 100.0 / 473 ((double)notes->total_insn); 474 } 475 476 snprintf(tmp, sizeof(tmp), "%-5.2f [%5.1f%%]", ipc, coverage); 477 return repsep_snprintf(bf, size, "%-*s", width, tmp); 478 } 479 480 struct sort_entry sort_sym_ipc = { 481 .se_header = "IPC [IPC Coverage]", 482 .se_cmp = sort__sym_cmp, 483 .se_snprintf = hist_entry__sym_ipc_snprintf, 484 .se_width_idx = HISTC_SYMBOL_IPC, 485 }; 486 487 static int hist_entry__sym_ipc_null_snprintf(struct hist_entry *he 488 __maybe_unused, 489 char *bf, size_t size, 490 unsigned int width) 491 { 492 char tmp[64]; 493 494 snprintf(tmp, sizeof(tmp), "%-5s %2s", "-", "-"); 495 return repsep_snprintf(bf, size, "%-*s", width, tmp); 496 } 497 498 struct sort_entry sort_sym_ipc_null = { 499 .se_header = "IPC [IPC Coverage]", 500 .se_cmp = sort__sym_cmp, 501 .se_snprintf = hist_entry__sym_ipc_null_snprintf, 502 .se_width_idx = HISTC_SYMBOL_IPC, 503 }; 504 505 /* --sort srcfile */ 506 507 static char no_srcfile[1]; 508 509 static char *hist_entry__get_srcfile(struct hist_entry *e) 510 { 511 char *sf, *p; 512 struct map *map = e->ms.map; 513 514 if (!map) 515 return no_srcfile; 516 517 sf = __get_srcline(map->dso, map__rip_2objdump(map, e->ip), 518 e->ms.sym, false, true, true, e->ip); 519 if (!strcmp(sf, SRCLINE_UNKNOWN)) 520 return no_srcfile; 521 p = strchr(sf, ':'); 522 if (p && *sf) { 523 *p = 0; 524 return sf; 525 } 526 free(sf); 527 return no_srcfile; 528 } 529 530 static int64_t 531 sort__srcfile_cmp(struct hist_entry *left, struct hist_entry *right) 532 { 533 if (!left->srcfile) 534 left->srcfile = hist_entry__get_srcfile(left); 535 if (!right->srcfile) 536 right->srcfile = hist_entry__get_srcfile(right); 537 538 return strcmp(right->srcfile, left->srcfile); 539 } 540 541 static int hist_entry__srcfile_snprintf(struct hist_entry *he, char *bf, 542 size_t size, unsigned int width) 543 { 544 if (!he->srcfile) 545 he->srcfile = hist_entry__get_srcfile(he); 546 547 return repsep_snprintf(bf, size, "%-.*s", width, he->srcfile); 548 } 549 550 struct sort_entry sort_srcfile = { 551 .se_header = "Source File", 552 .se_cmp = sort__srcfile_cmp, 553 .se_snprintf = hist_entry__srcfile_snprintf, 554 .se_width_idx = HISTC_SRCFILE, 555 }; 556 557 /* --sort parent */ 558 559 static int64_t 560 sort__parent_cmp(struct hist_entry *left, struct hist_entry *right) 561 { 562 struct symbol *sym_l = left->parent; 563 struct symbol *sym_r = right->parent; 564 565 if (!sym_l || !sym_r) 566 return cmp_null(sym_l, sym_r); 567 568 return strcmp(sym_r->name, sym_l->name); 569 } 570 571 static int hist_entry__parent_snprintf(struct hist_entry *he, char *bf, 572 size_t size, unsigned int width) 573 { 574 return repsep_snprintf(bf, size, "%-*.*s", width, width, 575 he->parent ? he->parent->name : "[other]"); 576 } 577 578 struct sort_entry sort_parent = { 579 .se_header = "Parent symbol", 580 .se_cmp = sort__parent_cmp, 581 .se_snprintf = hist_entry__parent_snprintf, 582 .se_width_idx = HISTC_PARENT, 583 }; 584 585 /* --sort cpu */ 586 587 static int64_t 588 sort__cpu_cmp(struct hist_entry *left, struct hist_entry *right) 589 { 590 return right->cpu - left->cpu; 591 } 592 593 static int hist_entry__cpu_snprintf(struct hist_entry *he, char *bf, 594 size_t size, unsigned int width) 595 { 596 return repsep_snprintf(bf, size, "%*.*d", width, width, he->cpu); 597 } 598 599 struct sort_entry sort_cpu = { 600 .se_header = "CPU", 601 .se_cmp = sort__cpu_cmp, 602 .se_snprintf = hist_entry__cpu_snprintf, 603 .se_width_idx = HISTC_CPU, 604 }; 605 606 /* --sort cgroup_id */ 607 608 static int64_t _sort__cgroup_dev_cmp(u64 left_dev, u64 right_dev) 609 { 610 return (int64_t)(right_dev - left_dev); 611 } 612 613 static int64_t _sort__cgroup_inode_cmp(u64 left_ino, u64 right_ino) 614 { 615 return (int64_t)(right_ino - left_ino); 616 } 617 618 static int64_t 619 sort__cgroup_id_cmp(struct hist_entry *left, struct hist_entry *right) 620 { 621 int64_t ret; 622 623 ret = _sort__cgroup_dev_cmp(right->cgroup_id.dev, left->cgroup_id.dev); 624 if (ret != 0) 625 return ret; 626 627 return _sort__cgroup_inode_cmp(right->cgroup_id.ino, 628 left->cgroup_id.ino); 629 } 630 631 static int hist_entry__cgroup_id_snprintf(struct hist_entry *he, 632 char *bf, size_t size, 633 unsigned int width __maybe_unused) 634 { 635 return repsep_snprintf(bf, size, "%lu/0x%lx", he->cgroup_id.dev, 636 he->cgroup_id.ino); 637 } 638 639 struct sort_entry sort_cgroup_id = { 640 .se_header = "cgroup id (dev/inode)", 641 .se_cmp = sort__cgroup_id_cmp, 642 .se_snprintf = hist_entry__cgroup_id_snprintf, 643 .se_width_idx = HISTC_CGROUP_ID, 644 }; 645 646 /* --sort cgroup */ 647 648 static int64_t 649 sort__cgroup_cmp(struct hist_entry *left, struct hist_entry *right) 650 { 651 return right->cgroup - left->cgroup; 652 } 653 654 static int hist_entry__cgroup_snprintf(struct hist_entry *he, 655 char *bf, size_t size, 656 unsigned int width __maybe_unused) 657 { 658 const char *cgrp_name = "N/A"; 659 660 if (he->cgroup) { 661 struct cgroup *cgrp = cgroup__find(he->ms.maps->machine->env, 662 he->cgroup); 663 if (cgrp != NULL) 664 cgrp_name = cgrp->name; 665 else 666 cgrp_name = "unknown"; 667 } 668 669 return repsep_snprintf(bf, size, "%s", cgrp_name); 670 } 671 672 struct sort_entry sort_cgroup = { 673 .se_header = "Cgroup", 674 .se_cmp = sort__cgroup_cmp, 675 .se_snprintf = hist_entry__cgroup_snprintf, 676 .se_width_idx = HISTC_CGROUP, 677 }; 678 679 /* --sort socket */ 680 681 static int64_t 682 sort__socket_cmp(struct hist_entry *left, struct hist_entry *right) 683 { 684 return right->socket - left->socket; 685 } 686 687 static int hist_entry__socket_snprintf(struct hist_entry *he, char *bf, 688 size_t size, unsigned int width) 689 { 690 return repsep_snprintf(bf, size, "%*.*d", width, width-3, he->socket); 691 } 692 693 static int hist_entry__socket_filter(struct hist_entry *he, int type, const void *arg) 694 { 695 int sk = *(const int *)arg; 696 697 if (type != HIST_FILTER__SOCKET) 698 return -1; 699 700 return sk >= 0 && he->socket != sk; 701 } 702 703 struct sort_entry sort_socket = { 704 .se_header = "Socket", 705 .se_cmp = sort__socket_cmp, 706 .se_snprintf = hist_entry__socket_snprintf, 707 .se_filter = hist_entry__socket_filter, 708 .se_width_idx = HISTC_SOCKET, 709 }; 710 711 /* --sort time */ 712 713 static int64_t 714 sort__time_cmp(struct hist_entry *left, struct hist_entry *right) 715 { 716 return right->time - left->time; 717 } 718 719 static int hist_entry__time_snprintf(struct hist_entry *he, char *bf, 720 size_t size, unsigned int width) 721 { 722 char he_time[32]; 723 724 if (symbol_conf.nanosecs) 725 timestamp__scnprintf_nsec(he->time, he_time, 726 sizeof(he_time)); 727 else 728 timestamp__scnprintf_usec(he->time, he_time, 729 sizeof(he_time)); 730 731 return repsep_snprintf(bf, size, "%-.*s", width, he_time); 732 } 733 734 struct sort_entry sort_time = { 735 .se_header = "Time", 736 .se_cmp = sort__time_cmp, 737 .se_snprintf = hist_entry__time_snprintf, 738 .se_width_idx = HISTC_TIME, 739 }; 740 741 /* --sort trace */ 742 743 static char *get_trace_output(struct hist_entry *he) 744 { 745 struct trace_seq seq; 746 struct evsel *evsel; 747 struct tep_record rec = { 748 .data = he->raw_data, 749 .size = he->raw_size, 750 }; 751 752 evsel = hists_to_evsel(he->hists); 753 754 trace_seq_init(&seq); 755 if (symbol_conf.raw_trace) { 756 tep_print_fields(&seq, he->raw_data, he->raw_size, 757 evsel->tp_format); 758 } else { 759 tep_print_event(evsel->tp_format->tep, 760 &seq, &rec, "%s", TEP_PRINT_INFO); 761 } 762 /* 763 * Trim the buffer, it starts at 4KB and we're not going to 764 * add anything more to this buffer. 765 */ 766 return realloc(seq.buffer, seq.len + 1); 767 } 768 769 static int64_t 770 sort__trace_cmp(struct hist_entry *left, struct hist_entry *right) 771 { 772 struct evsel *evsel; 773 774 evsel = hists_to_evsel(left->hists); 775 if (evsel->core.attr.type != PERF_TYPE_TRACEPOINT) 776 return 0; 777 778 if (left->trace_output == NULL) 779 left->trace_output = get_trace_output(left); 780 if (right->trace_output == NULL) 781 right->trace_output = get_trace_output(right); 782 783 return strcmp(right->trace_output, left->trace_output); 784 } 785 786 static int hist_entry__trace_snprintf(struct hist_entry *he, char *bf, 787 size_t size, unsigned int width) 788 { 789 struct evsel *evsel; 790 791 evsel = hists_to_evsel(he->hists); 792 if (evsel->core.attr.type != PERF_TYPE_TRACEPOINT) 793 return scnprintf(bf, size, "%-.*s", width, "N/A"); 794 795 if (he->trace_output == NULL) 796 he->trace_output = get_trace_output(he); 797 return repsep_snprintf(bf, size, "%-.*s", width, he->trace_output); 798 } 799 800 struct sort_entry sort_trace = { 801 .se_header = "Trace output", 802 .se_cmp = sort__trace_cmp, 803 .se_snprintf = hist_entry__trace_snprintf, 804 .se_width_idx = HISTC_TRACE, 805 }; 806 807 /* sort keys for branch stacks */ 808 809 static int64_t 810 sort__dso_from_cmp(struct hist_entry *left, struct hist_entry *right) 811 { 812 if (!left->branch_info || !right->branch_info) 813 return cmp_null(left->branch_info, right->branch_info); 814 815 return _sort__dso_cmp(left->branch_info->from.ms.map, 816 right->branch_info->from.ms.map); 817 } 818 819 static int hist_entry__dso_from_snprintf(struct hist_entry *he, char *bf, 820 size_t size, unsigned int width) 821 { 822 if (he->branch_info) 823 return _hist_entry__dso_snprintf(he->branch_info->from.ms.map, 824 bf, size, width); 825 else 826 return repsep_snprintf(bf, size, "%-*.*s", width, width, "N/A"); 827 } 828 829 static int hist_entry__dso_from_filter(struct hist_entry *he, int type, 830 const void *arg) 831 { 832 const struct dso *dso = arg; 833 834 if (type != HIST_FILTER__DSO) 835 return -1; 836 837 return dso && (!he->branch_info || !he->branch_info->from.ms.map || 838 he->branch_info->from.ms.map->dso != dso); 839 } 840 841 static int64_t 842 sort__dso_to_cmp(struct hist_entry *left, struct hist_entry *right) 843 { 844 if (!left->branch_info || !right->branch_info) 845 return cmp_null(left->branch_info, right->branch_info); 846 847 return _sort__dso_cmp(left->branch_info->to.ms.map, 848 right->branch_info->to.ms.map); 849 } 850 851 static int hist_entry__dso_to_snprintf(struct hist_entry *he, char *bf, 852 size_t size, unsigned int width) 853 { 854 if (he->branch_info) 855 return _hist_entry__dso_snprintf(he->branch_info->to.ms.map, 856 bf, size, width); 857 else 858 return repsep_snprintf(bf, size, "%-*.*s", width, width, "N/A"); 859 } 860 861 static int hist_entry__dso_to_filter(struct hist_entry *he, int type, 862 const void *arg) 863 { 864 const struct dso *dso = arg; 865 866 if (type != HIST_FILTER__DSO) 867 return -1; 868 869 return dso && (!he->branch_info || !he->branch_info->to.ms.map || 870 he->branch_info->to.ms.map->dso != dso); 871 } 872 873 static int64_t 874 sort__sym_from_cmp(struct hist_entry *left, struct hist_entry *right) 875 { 876 struct addr_map_symbol *from_l = &left->branch_info->from; 877 struct addr_map_symbol *from_r = &right->branch_info->from; 878 879 if (!left->branch_info || !right->branch_info) 880 return cmp_null(left->branch_info, right->branch_info); 881 882 from_l = &left->branch_info->from; 883 from_r = &right->branch_info->from; 884 885 if (!from_l->ms.sym && !from_r->ms.sym) 886 return _sort__addr_cmp(from_l->addr, from_r->addr); 887 888 return _sort__sym_cmp(from_l->ms.sym, from_r->ms.sym); 889 } 890 891 static int64_t 892 sort__sym_to_cmp(struct hist_entry *left, struct hist_entry *right) 893 { 894 struct addr_map_symbol *to_l, *to_r; 895 896 if (!left->branch_info || !right->branch_info) 897 return cmp_null(left->branch_info, right->branch_info); 898 899 to_l = &left->branch_info->to; 900 to_r = &right->branch_info->to; 901 902 if (!to_l->ms.sym && !to_r->ms.sym) 903 return _sort__addr_cmp(to_l->addr, to_r->addr); 904 905 return _sort__sym_cmp(to_l->ms.sym, to_r->ms.sym); 906 } 907 908 static int hist_entry__sym_from_snprintf(struct hist_entry *he, char *bf, 909 size_t size, unsigned int width) 910 { 911 if (he->branch_info) { 912 struct addr_map_symbol *from = &he->branch_info->from; 913 914 return _hist_entry__sym_snprintf(&from->ms, from->al_addr, 915 he->level, bf, size, width); 916 } 917 918 return repsep_snprintf(bf, size, "%-*.*s", width, width, "N/A"); 919 } 920 921 static int hist_entry__sym_to_snprintf(struct hist_entry *he, char *bf, 922 size_t size, unsigned int width) 923 { 924 if (he->branch_info) { 925 struct addr_map_symbol *to = &he->branch_info->to; 926 927 return _hist_entry__sym_snprintf(&to->ms, to->al_addr, 928 he->level, bf, size, width); 929 } 930 931 return repsep_snprintf(bf, size, "%-*.*s", width, width, "N/A"); 932 } 933 934 static int hist_entry__sym_from_filter(struct hist_entry *he, int type, 935 const void *arg) 936 { 937 const char *sym = arg; 938 939 if (type != HIST_FILTER__SYMBOL) 940 return -1; 941 942 return sym && !(he->branch_info && he->branch_info->from.ms.sym && 943 strstr(he->branch_info->from.ms.sym->name, sym)); 944 } 945 946 static int hist_entry__sym_to_filter(struct hist_entry *he, int type, 947 const void *arg) 948 { 949 const char *sym = arg; 950 951 if (type != HIST_FILTER__SYMBOL) 952 return -1; 953 954 return sym && !(he->branch_info && he->branch_info->to.ms.sym && 955 strstr(he->branch_info->to.ms.sym->name, sym)); 956 } 957 958 struct sort_entry sort_dso_from = { 959 .se_header = "Source Shared Object", 960 .se_cmp = sort__dso_from_cmp, 961 .se_snprintf = hist_entry__dso_from_snprintf, 962 .se_filter = hist_entry__dso_from_filter, 963 .se_width_idx = HISTC_DSO_FROM, 964 }; 965 966 struct sort_entry sort_dso_to = { 967 .se_header = "Target Shared Object", 968 .se_cmp = sort__dso_to_cmp, 969 .se_snprintf = hist_entry__dso_to_snprintf, 970 .se_filter = hist_entry__dso_to_filter, 971 .se_width_idx = HISTC_DSO_TO, 972 }; 973 974 struct sort_entry sort_sym_from = { 975 .se_header = "Source Symbol", 976 .se_cmp = sort__sym_from_cmp, 977 .se_snprintf = hist_entry__sym_from_snprintf, 978 .se_filter = hist_entry__sym_from_filter, 979 .se_width_idx = HISTC_SYMBOL_FROM, 980 }; 981 982 struct sort_entry sort_sym_to = { 983 .se_header = "Target Symbol", 984 .se_cmp = sort__sym_to_cmp, 985 .se_snprintf = hist_entry__sym_to_snprintf, 986 .se_filter = hist_entry__sym_to_filter, 987 .se_width_idx = HISTC_SYMBOL_TO, 988 }; 989 990 static int64_t 991 sort__mispredict_cmp(struct hist_entry *left, struct hist_entry *right) 992 { 993 unsigned char mp, p; 994 995 if (!left->branch_info || !right->branch_info) 996 return cmp_null(left->branch_info, right->branch_info); 997 998 mp = left->branch_info->flags.mispred != right->branch_info->flags.mispred; 999 p = left->branch_info->flags.predicted != right->branch_info->flags.predicted; 1000 return mp || p; 1001 } 1002 1003 static int hist_entry__mispredict_snprintf(struct hist_entry *he, char *bf, 1004 size_t size, unsigned int width){ 1005 static const char *out = "N/A"; 1006 1007 if (he->branch_info) { 1008 if (he->branch_info->flags.predicted) 1009 out = "N"; 1010 else if (he->branch_info->flags.mispred) 1011 out = "Y"; 1012 } 1013 1014 return repsep_snprintf(bf, size, "%-*.*s", width, width, out); 1015 } 1016 1017 static int64_t 1018 sort__cycles_cmp(struct hist_entry *left, struct hist_entry *right) 1019 { 1020 if (!left->branch_info || !right->branch_info) 1021 return cmp_null(left->branch_info, right->branch_info); 1022 1023 return left->branch_info->flags.cycles - 1024 right->branch_info->flags.cycles; 1025 } 1026 1027 static int hist_entry__cycles_snprintf(struct hist_entry *he, char *bf, 1028 size_t size, unsigned int width) 1029 { 1030 if (!he->branch_info) 1031 return scnprintf(bf, size, "%-.*s", width, "N/A"); 1032 if (he->branch_info->flags.cycles == 0) 1033 return repsep_snprintf(bf, size, "%-*s", width, "-"); 1034 return repsep_snprintf(bf, size, "%-*hd", width, 1035 he->branch_info->flags.cycles); 1036 } 1037 1038 struct sort_entry sort_cycles = { 1039 .se_header = "Basic Block Cycles", 1040 .se_cmp = sort__cycles_cmp, 1041 .se_snprintf = hist_entry__cycles_snprintf, 1042 .se_width_idx = HISTC_CYCLES, 1043 }; 1044 1045 /* --sort daddr_sym */ 1046 int64_t 1047 sort__daddr_cmp(struct hist_entry *left, struct hist_entry *right) 1048 { 1049 uint64_t l = 0, r = 0; 1050 1051 if (left->mem_info) 1052 l = left->mem_info->daddr.addr; 1053 if (right->mem_info) 1054 r = right->mem_info->daddr.addr; 1055 1056 return (int64_t)(r - l); 1057 } 1058 1059 static int hist_entry__daddr_snprintf(struct hist_entry *he, char *bf, 1060 size_t size, unsigned int width) 1061 { 1062 uint64_t addr = 0; 1063 struct map_symbol *ms = NULL; 1064 1065 if (he->mem_info) { 1066 addr = he->mem_info->daddr.addr; 1067 ms = &he->mem_info->daddr.ms; 1068 } 1069 return _hist_entry__sym_snprintf(ms, addr, he->level, bf, size, width); 1070 } 1071 1072 int64_t 1073 sort__iaddr_cmp(struct hist_entry *left, struct hist_entry *right) 1074 { 1075 uint64_t l = 0, r = 0; 1076 1077 if (left->mem_info) 1078 l = left->mem_info->iaddr.addr; 1079 if (right->mem_info) 1080 r = right->mem_info->iaddr.addr; 1081 1082 return (int64_t)(r - l); 1083 } 1084 1085 static int hist_entry__iaddr_snprintf(struct hist_entry *he, char *bf, 1086 size_t size, unsigned int width) 1087 { 1088 uint64_t addr = 0; 1089 struct map_symbol *ms = NULL; 1090 1091 if (he->mem_info) { 1092 addr = he->mem_info->iaddr.addr; 1093 ms = &he->mem_info->iaddr.ms; 1094 } 1095 return _hist_entry__sym_snprintf(ms, addr, he->level, bf, size, width); 1096 } 1097 1098 static int64_t 1099 sort__dso_daddr_cmp(struct hist_entry *left, struct hist_entry *right) 1100 { 1101 struct map *map_l = NULL; 1102 struct map *map_r = NULL; 1103 1104 if (left->mem_info) 1105 map_l = left->mem_info->daddr.ms.map; 1106 if (right->mem_info) 1107 map_r = right->mem_info->daddr.ms.map; 1108 1109 return _sort__dso_cmp(map_l, map_r); 1110 } 1111 1112 static int hist_entry__dso_daddr_snprintf(struct hist_entry *he, char *bf, 1113 size_t size, unsigned int width) 1114 { 1115 struct map *map = NULL; 1116 1117 if (he->mem_info) 1118 map = he->mem_info->daddr.ms.map; 1119 1120 return _hist_entry__dso_snprintf(map, bf, size, width); 1121 } 1122 1123 static int64_t 1124 sort__locked_cmp(struct hist_entry *left, struct hist_entry *right) 1125 { 1126 union perf_mem_data_src data_src_l; 1127 union perf_mem_data_src data_src_r; 1128 1129 if (left->mem_info) 1130 data_src_l = left->mem_info->data_src; 1131 else 1132 data_src_l.mem_lock = PERF_MEM_LOCK_NA; 1133 1134 if (right->mem_info) 1135 data_src_r = right->mem_info->data_src; 1136 else 1137 data_src_r.mem_lock = PERF_MEM_LOCK_NA; 1138 1139 return (int64_t)(data_src_r.mem_lock - data_src_l.mem_lock); 1140 } 1141 1142 static int hist_entry__locked_snprintf(struct hist_entry *he, char *bf, 1143 size_t size, unsigned int width) 1144 { 1145 char out[10]; 1146 1147 perf_mem__lck_scnprintf(out, sizeof(out), he->mem_info); 1148 return repsep_snprintf(bf, size, "%.*s", width, out); 1149 } 1150 1151 static int64_t 1152 sort__tlb_cmp(struct hist_entry *left, struct hist_entry *right) 1153 { 1154 union perf_mem_data_src data_src_l; 1155 union perf_mem_data_src data_src_r; 1156 1157 if (left->mem_info) 1158 data_src_l = left->mem_info->data_src; 1159 else 1160 data_src_l.mem_dtlb = PERF_MEM_TLB_NA; 1161 1162 if (right->mem_info) 1163 data_src_r = right->mem_info->data_src; 1164 else 1165 data_src_r.mem_dtlb = PERF_MEM_TLB_NA; 1166 1167 return (int64_t)(data_src_r.mem_dtlb - data_src_l.mem_dtlb); 1168 } 1169 1170 static int hist_entry__tlb_snprintf(struct hist_entry *he, char *bf, 1171 size_t size, unsigned int width) 1172 { 1173 char out[64]; 1174 1175 perf_mem__tlb_scnprintf(out, sizeof(out), he->mem_info); 1176 return repsep_snprintf(bf, size, "%-*s", width, out); 1177 } 1178 1179 static int64_t 1180 sort__lvl_cmp(struct hist_entry *left, struct hist_entry *right) 1181 { 1182 union perf_mem_data_src data_src_l; 1183 union perf_mem_data_src data_src_r; 1184 1185 if (left->mem_info) 1186 data_src_l = left->mem_info->data_src; 1187 else 1188 data_src_l.mem_lvl = PERF_MEM_LVL_NA; 1189 1190 if (right->mem_info) 1191 data_src_r = right->mem_info->data_src; 1192 else 1193 data_src_r.mem_lvl = PERF_MEM_LVL_NA; 1194 1195 return (int64_t)(data_src_r.mem_lvl - data_src_l.mem_lvl); 1196 } 1197 1198 static int hist_entry__lvl_snprintf(struct hist_entry *he, char *bf, 1199 size_t size, unsigned int width) 1200 { 1201 char out[64]; 1202 1203 perf_mem__lvl_scnprintf(out, sizeof(out), he->mem_info); 1204 return repsep_snprintf(bf, size, "%-*s", width, out); 1205 } 1206 1207 static int64_t 1208 sort__snoop_cmp(struct hist_entry *left, struct hist_entry *right) 1209 { 1210 union perf_mem_data_src data_src_l; 1211 union perf_mem_data_src data_src_r; 1212 1213 if (left->mem_info) 1214 data_src_l = left->mem_info->data_src; 1215 else 1216 data_src_l.mem_snoop = PERF_MEM_SNOOP_NA; 1217 1218 if (right->mem_info) 1219 data_src_r = right->mem_info->data_src; 1220 else 1221 data_src_r.mem_snoop = PERF_MEM_SNOOP_NA; 1222 1223 return (int64_t)(data_src_r.mem_snoop - data_src_l.mem_snoop); 1224 } 1225 1226 static int hist_entry__snoop_snprintf(struct hist_entry *he, char *bf, 1227 size_t size, unsigned int width) 1228 { 1229 char out[64]; 1230 1231 perf_mem__snp_scnprintf(out, sizeof(out), he->mem_info); 1232 return repsep_snprintf(bf, size, "%-*s", width, out); 1233 } 1234 1235 int64_t 1236 sort__dcacheline_cmp(struct hist_entry *left, struct hist_entry *right) 1237 { 1238 u64 l, r; 1239 struct map *l_map, *r_map; 1240 int rc; 1241 1242 if (!left->mem_info) return -1; 1243 if (!right->mem_info) return 1; 1244 1245 /* group event types together */ 1246 if (left->cpumode > right->cpumode) return -1; 1247 if (left->cpumode < right->cpumode) return 1; 1248 1249 l_map = left->mem_info->daddr.ms.map; 1250 r_map = right->mem_info->daddr.ms.map; 1251 1252 /* if both are NULL, jump to sort on al_addr instead */ 1253 if (!l_map && !r_map) 1254 goto addr; 1255 1256 if (!l_map) return -1; 1257 if (!r_map) return 1; 1258 1259 rc = dso__cmp_id(l_map->dso, r_map->dso); 1260 if (rc) 1261 return rc; 1262 /* 1263 * Addresses with no major/minor numbers are assumed to be 1264 * anonymous in userspace. Sort those on pid then address. 1265 * 1266 * The kernel and non-zero major/minor mapped areas are 1267 * assumed to be unity mapped. Sort those on address. 1268 */ 1269 1270 if ((left->cpumode != PERF_RECORD_MISC_KERNEL) && 1271 (!(l_map->flags & MAP_SHARED)) && 1272 !l_map->dso->id.maj && !l_map->dso->id.min && 1273 !l_map->dso->id.ino && !l_map->dso->id.ino_generation) { 1274 /* userspace anonymous */ 1275 1276 if (left->thread->pid_ > right->thread->pid_) return -1; 1277 if (left->thread->pid_ < right->thread->pid_) return 1; 1278 } 1279 1280 addr: 1281 /* al_addr does all the right addr - start + offset calculations */ 1282 l = cl_address(left->mem_info->daddr.al_addr); 1283 r = cl_address(right->mem_info->daddr.al_addr); 1284 1285 if (l > r) return -1; 1286 if (l < r) return 1; 1287 1288 return 0; 1289 } 1290 1291 static int hist_entry__dcacheline_snprintf(struct hist_entry *he, char *bf, 1292 size_t size, unsigned int width) 1293 { 1294 1295 uint64_t addr = 0; 1296 struct map_symbol *ms = NULL; 1297 char level = he->level; 1298 1299 if (he->mem_info) { 1300 struct map *map = he->mem_info->daddr.ms.map; 1301 1302 addr = cl_address(he->mem_info->daddr.al_addr); 1303 ms = &he->mem_info->daddr.ms; 1304 1305 /* print [s] for shared data mmaps */ 1306 if ((he->cpumode != PERF_RECORD_MISC_KERNEL) && 1307 map && !(map->prot & PROT_EXEC) && 1308 (map->flags & MAP_SHARED) && 1309 (map->dso->id.maj || map->dso->id.min || 1310 map->dso->id.ino || map->dso->id.ino_generation)) 1311 level = 's'; 1312 else if (!map) 1313 level = 'X'; 1314 } 1315 return _hist_entry__sym_snprintf(ms, addr, level, bf, size, width); 1316 } 1317 1318 struct sort_entry sort_mispredict = { 1319 .se_header = "Branch Mispredicted", 1320 .se_cmp = sort__mispredict_cmp, 1321 .se_snprintf = hist_entry__mispredict_snprintf, 1322 .se_width_idx = HISTC_MISPREDICT, 1323 }; 1324 1325 static u64 he_weight(struct hist_entry *he) 1326 { 1327 return he->stat.nr_events ? he->stat.weight / he->stat.nr_events : 0; 1328 } 1329 1330 static int64_t 1331 sort__local_weight_cmp(struct hist_entry *left, struct hist_entry *right) 1332 { 1333 return he_weight(left) - he_weight(right); 1334 } 1335 1336 static int hist_entry__local_weight_snprintf(struct hist_entry *he, char *bf, 1337 size_t size, unsigned int width) 1338 { 1339 return repsep_snprintf(bf, size, "%-*llu", width, he_weight(he)); 1340 } 1341 1342 struct sort_entry sort_local_weight = { 1343 .se_header = "Local Weight", 1344 .se_cmp = sort__local_weight_cmp, 1345 .se_snprintf = hist_entry__local_weight_snprintf, 1346 .se_width_idx = HISTC_LOCAL_WEIGHT, 1347 }; 1348 1349 static int64_t 1350 sort__global_weight_cmp(struct hist_entry *left, struct hist_entry *right) 1351 { 1352 return left->stat.weight - right->stat.weight; 1353 } 1354 1355 static int hist_entry__global_weight_snprintf(struct hist_entry *he, char *bf, 1356 size_t size, unsigned int width) 1357 { 1358 return repsep_snprintf(bf, size, "%-*llu", width, he->stat.weight); 1359 } 1360 1361 struct sort_entry sort_global_weight = { 1362 .se_header = "Weight", 1363 .se_cmp = sort__global_weight_cmp, 1364 .se_snprintf = hist_entry__global_weight_snprintf, 1365 .se_width_idx = HISTC_GLOBAL_WEIGHT, 1366 }; 1367 1368 struct sort_entry sort_mem_daddr_sym = { 1369 .se_header = "Data Symbol", 1370 .se_cmp = sort__daddr_cmp, 1371 .se_snprintf = hist_entry__daddr_snprintf, 1372 .se_width_idx = HISTC_MEM_DADDR_SYMBOL, 1373 }; 1374 1375 struct sort_entry sort_mem_iaddr_sym = { 1376 .se_header = "Code Symbol", 1377 .se_cmp = sort__iaddr_cmp, 1378 .se_snprintf = hist_entry__iaddr_snprintf, 1379 .se_width_idx = HISTC_MEM_IADDR_SYMBOL, 1380 }; 1381 1382 struct sort_entry sort_mem_daddr_dso = { 1383 .se_header = "Data Object", 1384 .se_cmp = sort__dso_daddr_cmp, 1385 .se_snprintf = hist_entry__dso_daddr_snprintf, 1386 .se_width_idx = HISTC_MEM_DADDR_DSO, 1387 }; 1388 1389 struct sort_entry sort_mem_locked = { 1390 .se_header = "Locked", 1391 .se_cmp = sort__locked_cmp, 1392 .se_snprintf = hist_entry__locked_snprintf, 1393 .se_width_idx = HISTC_MEM_LOCKED, 1394 }; 1395 1396 struct sort_entry sort_mem_tlb = { 1397 .se_header = "TLB access", 1398 .se_cmp = sort__tlb_cmp, 1399 .se_snprintf = hist_entry__tlb_snprintf, 1400 .se_width_idx = HISTC_MEM_TLB, 1401 }; 1402 1403 struct sort_entry sort_mem_lvl = { 1404 .se_header = "Memory access", 1405 .se_cmp = sort__lvl_cmp, 1406 .se_snprintf = hist_entry__lvl_snprintf, 1407 .se_width_idx = HISTC_MEM_LVL, 1408 }; 1409 1410 struct sort_entry sort_mem_snoop = { 1411 .se_header = "Snoop", 1412 .se_cmp = sort__snoop_cmp, 1413 .se_snprintf = hist_entry__snoop_snprintf, 1414 .se_width_idx = HISTC_MEM_SNOOP, 1415 }; 1416 1417 struct sort_entry sort_mem_dcacheline = { 1418 .se_header = "Data Cacheline", 1419 .se_cmp = sort__dcacheline_cmp, 1420 .se_snprintf = hist_entry__dcacheline_snprintf, 1421 .se_width_idx = HISTC_MEM_DCACHELINE, 1422 }; 1423 1424 static int64_t 1425 sort__phys_daddr_cmp(struct hist_entry *left, struct hist_entry *right) 1426 { 1427 uint64_t l = 0, r = 0; 1428 1429 if (left->mem_info) 1430 l = left->mem_info->daddr.phys_addr; 1431 if (right->mem_info) 1432 r = right->mem_info->daddr.phys_addr; 1433 1434 return (int64_t)(r - l); 1435 } 1436 1437 static int hist_entry__phys_daddr_snprintf(struct hist_entry *he, char *bf, 1438 size_t size, unsigned int width) 1439 { 1440 uint64_t addr = 0; 1441 size_t ret = 0; 1442 size_t len = BITS_PER_LONG / 4; 1443 1444 addr = he->mem_info->daddr.phys_addr; 1445 1446 ret += repsep_snprintf(bf + ret, size - ret, "[%c] ", he->level); 1447 1448 ret += repsep_snprintf(bf + ret, size - ret, "%-#.*llx", len, addr); 1449 1450 ret += repsep_snprintf(bf + ret, size - ret, "%-*s", width - ret, ""); 1451 1452 if (ret > width) 1453 bf[width] = '\0'; 1454 1455 return width; 1456 } 1457 1458 struct sort_entry sort_mem_phys_daddr = { 1459 .se_header = "Data Physical Address", 1460 .se_cmp = sort__phys_daddr_cmp, 1461 .se_snprintf = hist_entry__phys_daddr_snprintf, 1462 .se_width_idx = HISTC_MEM_PHYS_DADDR, 1463 }; 1464 1465 static int64_t 1466 sort__data_page_size_cmp(struct hist_entry *left, struct hist_entry *right) 1467 { 1468 uint64_t l = 0, r = 0; 1469 1470 if (left->mem_info) 1471 l = left->mem_info->daddr.data_page_size; 1472 if (right->mem_info) 1473 r = right->mem_info->daddr.data_page_size; 1474 1475 return (int64_t)(r - l); 1476 } 1477 1478 static int hist_entry__data_page_size_snprintf(struct hist_entry *he, char *bf, 1479 size_t size, unsigned int width) 1480 { 1481 char str[PAGE_SIZE_NAME_LEN]; 1482 1483 return repsep_snprintf(bf, size, "%-*s", width, 1484 get_page_size_name(he->mem_info->daddr.data_page_size, str)); 1485 } 1486 1487 struct sort_entry sort_mem_data_page_size = { 1488 .se_header = "Data Page Size", 1489 .se_cmp = sort__data_page_size_cmp, 1490 .se_snprintf = hist_entry__data_page_size_snprintf, 1491 .se_width_idx = HISTC_MEM_DATA_PAGE_SIZE, 1492 }; 1493 1494 static int64_t 1495 sort__abort_cmp(struct hist_entry *left, struct hist_entry *right) 1496 { 1497 if (!left->branch_info || !right->branch_info) 1498 return cmp_null(left->branch_info, right->branch_info); 1499 1500 return left->branch_info->flags.abort != 1501 right->branch_info->flags.abort; 1502 } 1503 1504 static int hist_entry__abort_snprintf(struct hist_entry *he, char *bf, 1505 size_t size, unsigned int width) 1506 { 1507 static const char *out = "N/A"; 1508 1509 if (he->branch_info) { 1510 if (he->branch_info->flags.abort) 1511 out = "A"; 1512 else 1513 out = "."; 1514 } 1515 1516 return repsep_snprintf(bf, size, "%-*s", width, out); 1517 } 1518 1519 struct sort_entry sort_abort = { 1520 .se_header = "Transaction abort", 1521 .se_cmp = sort__abort_cmp, 1522 .se_snprintf = hist_entry__abort_snprintf, 1523 .se_width_idx = HISTC_ABORT, 1524 }; 1525 1526 static int64_t 1527 sort__in_tx_cmp(struct hist_entry *left, struct hist_entry *right) 1528 { 1529 if (!left->branch_info || !right->branch_info) 1530 return cmp_null(left->branch_info, right->branch_info); 1531 1532 return left->branch_info->flags.in_tx != 1533 right->branch_info->flags.in_tx; 1534 } 1535 1536 static int hist_entry__in_tx_snprintf(struct hist_entry *he, char *bf, 1537 size_t size, unsigned int width) 1538 { 1539 static const char *out = "N/A"; 1540 1541 if (he->branch_info) { 1542 if (he->branch_info->flags.in_tx) 1543 out = "T"; 1544 else 1545 out = "."; 1546 } 1547 1548 return repsep_snprintf(bf, size, "%-*s", width, out); 1549 } 1550 1551 struct sort_entry sort_in_tx = { 1552 .se_header = "Branch in transaction", 1553 .se_cmp = sort__in_tx_cmp, 1554 .se_snprintf = hist_entry__in_tx_snprintf, 1555 .se_width_idx = HISTC_IN_TX, 1556 }; 1557 1558 static int64_t 1559 sort__transaction_cmp(struct hist_entry *left, struct hist_entry *right) 1560 { 1561 return left->transaction - right->transaction; 1562 } 1563 1564 static inline char *add_str(char *p, const char *str) 1565 { 1566 strcpy(p, str); 1567 return p + strlen(str); 1568 } 1569 1570 static struct txbit { 1571 unsigned flag; 1572 const char *name; 1573 int skip_for_len; 1574 } txbits[] = { 1575 { PERF_TXN_ELISION, "EL ", 0 }, 1576 { PERF_TXN_TRANSACTION, "TX ", 1 }, 1577 { PERF_TXN_SYNC, "SYNC ", 1 }, 1578 { PERF_TXN_ASYNC, "ASYNC ", 0 }, 1579 { PERF_TXN_RETRY, "RETRY ", 0 }, 1580 { PERF_TXN_CONFLICT, "CON ", 0 }, 1581 { PERF_TXN_CAPACITY_WRITE, "CAP-WRITE ", 1 }, 1582 { PERF_TXN_CAPACITY_READ, "CAP-READ ", 0 }, 1583 { 0, NULL, 0 } 1584 }; 1585 1586 int hist_entry__transaction_len(void) 1587 { 1588 int i; 1589 int len = 0; 1590 1591 for (i = 0; txbits[i].name; i++) { 1592 if (!txbits[i].skip_for_len) 1593 len += strlen(txbits[i].name); 1594 } 1595 len += 4; /* :XX<space> */ 1596 return len; 1597 } 1598 1599 static int hist_entry__transaction_snprintf(struct hist_entry *he, char *bf, 1600 size_t size, unsigned int width) 1601 { 1602 u64 t = he->transaction; 1603 char buf[128]; 1604 char *p = buf; 1605 int i; 1606 1607 buf[0] = 0; 1608 for (i = 0; txbits[i].name; i++) 1609 if (txbits[i].flag & t) 1610 p = add_str(p, txbits[i].name); 1611 if (t && !(t & (PERF_TXN_SYNC|PERF_TXN_ASYNC))) 1612 p = add_str(p, "NEITHER "); 1613 if (t & PERF_TXN_ABORT_MASK) { 1614 sprintf(p, ":%" PRIx64, 1615 (t & PERF_TXN_ABORT_MASK) >> 1616 PERF_TXN_ABORT_SHIFT); 1617 p += strlen(p); 1618 } 1619 1620 return repsep_snprintf(bf, size, "%-*s", width, buf); 1621 } 1622 1623 struct sort_entry sort_transaction = { 1624 .se_header = "Transaction ", 1625 .se_cmp = sort__transaction_cmp, 1626 .se_snprintf = hist_entry__transaction_snprintf, 1627 .se_width_idx = HISTC_TRANSACTION, 1628 }; 1629 1630 /* --sort symbol_size */ 1631 1632 static int64_t _sort__sym_size_cmp(struct symbol *sym_l, struct symbol *sym_r) 1633 { 1634 int64_t size_l = sym_l != NULL ? symbol__size(sym_l) : 0; 1635 int64_t size_r = sym_r != NULL ? symbol__size(sym_r) : 0; 1636 1637 return size_l < size_r ? -1 : 1638 size_l == size_r ? 0 : 1; 1639 } 1640 1641 static int64_t 1642 sort__sym_size_cmp(struct hist_entry *left, struct hist_entry *right) 1643 { 1644 return _sort__sym_size_cmp(right->ms.sym, left->ms.sym); 1645 } 1646 1647 static int _hist_entry__sym_size_snprintf(struct symbol *sym, char *bf, 1648 size_t bf_size, unsigned int width) 1649 { 1650 if (sym) 1651 return repsep_snprintf(bf, bf_size, "%*d", width, symbol__size(sym)); 1652 1653 return repsep_snprintf(bf, bf_size, "%*s", width, "unknown"); 1654 } 1655 1656 static int hist_entry__sym_size_snprintf(struct hist_entry *he, char *bf, 1657 size_t size, unsigned int width) 1658 { 1659 return _hist_entry__sym_size_snprintf(he->ms.sym, bf, size, width); 1660 } 1661 1662 struct sort_entry sort_sym_size = { 1663 .se_header = "Symbol size", 1664 .se_cmp = sort__sym_size_cmp, 1665 .se_snprintf = hist_entry__sym_size_snprintf, 1666 .se_width_idx = HISTC_SYM_SIZE, 1667 }; 1668 1669 /* --sort dso_size */ 1670 1671 static int64_t _sort__dso_size_cmp(struct map *map_l, struct map *map_r) 1672 { 1673 int64_t size_l = map_l != NULL ? map__size(map_l) : 0; 1674 int64_t size_r = map_r != NULL ? map__size(map_r) : 0; 1675 1676 return size_l < size_r ? -1 : 1677 size_l == size_r ? 0 : 1; 1678 } 1679 1680 static int64_t 1681 sort__dso_size_cmp(struct hist_entry *left, struct hist_entry *right) 1682 { 1683 return _sort__dso_size_cmp(right->ms.map, left->ms.map); 1684 } 1685 1686 static int _hist_entry__dso_size_snprintf(struct map *map, char *bf, 1687 size_t bf_size, unsigned int width) 1688 { 1689 if (map && map->dso) 1690 return repsep_snprintf(bf, bf_size, "%*d", width, 1691 map__size(map)); 1692 1693 return repsep_snprintf(bf, bf_size, "%*s", width, "unknown"); 1694 } 1695 1696 static int hist_entry__dso_size_snprintf(struct hist_entry *he, char *bf, 1697 size_t size, unsigned int width) 1698 { 1699 return _hist_entry__dso_size_snprintf(he->ms.map, bf, size, width); 1700 } 1701 1702 struct sort_entry sort_dso_size = { 1703 .se_header = "DSO size", 1704 .se_cmp = sort__dso_size_cmp, 1705 .se_snprintf = hist_entry__dso_size_snprintf, 1706 .se_width_idx = HISTC_DSO_SIZE, 1707 }; 1708 1709 1710 struct sort_dimension { 1711 const char *name; 1712 struct sort_entry *entry; 1713 int taken; 1714 }; 1715 1716 #define DIM(d, n, func) [d] = { .name = n, .entry = &(func) } 1717 1718 static struct sort_dimension common_sort_dimensions[] = { 1719 DIM(SORT_PID, "pid", sort_thread), 1720 DIM(SORT_COMM, "comm", sort_comm), 1721 DIM(SORT_DSO, "dso", sort_dso), 1722 DIM(SORT_SYM, "symbol", sort_sym), 1723 DIM(SORT_PARENT, "parent", sort_parent), 1724 DIM(SORT_CPU, "cpu", sort_cpu), 1725 DIM(SORT_SOCKET, "socket", sort_socket), 1726 DIM(SORT_SRCLINE, "srcline", sort_srcline), 1727 DIM(SORT_SRCFILE, "srcfile", sort_srcfile), 1728 DIM(SORT_LOCAL_WEIGHT, "local_weight", sort_local_weight), 1729 DIM(SORT_GLOBAL_WEIGHT, "weight", sort_global_weight), 1730 DIM(SORT_TRANSACTION, "transaction", sort_transaction), 1731 DIM(SORT_TRACE, "trace", sort_trace), 1732 DIM(SORT_SYM_SIZE, "symbol_size", sort_sym_size), 1733 DIM(SORT_DSO_SIZE, "dso_size", sort_dso_size), 1734 DIM(SORT_CGROUP, "cgroup", sort_cgroup), 1735 DIM(SORT_CGROUP_ID, "cgroup_id", sort_cgroup_id), 1736 DIM(SORT_SYM_IPC_NULL, "ipc_null", sort_sym_ipc_null), 1737 DIM(SORT_TIME, "time", sort_time), 1738 }; 1739 1740 #undef DIM 1741 1742 #define DIM(d, n, func) [d - __SORT_BRANCH_STACK] = { .name = n, .entry = &(func) } 1743 1744 static struct sort_dimension bstack_sort_dimensions[] = { 1745 DIM(SORT_DSO_FROM, "dso_from", sort_dso_from), 1746 DIM(SORT_DSO_TO, "dso_to", sort_dso_to), 1747 DIM(SORT_SYM_FROM, "symbol_from", sort_sym_from), 1748 DIM(SORT_SYM_TO, "symbol_to", sort_sym_to), 1749 DIM(SORT_MISPREDICT, "mispredict", sort_mispredict), 1750 DIM(SORT_IN_TX, "in_tx", sort_in_tx), 1751 DIM(SORT_ABORT, "abort", sort_abort), 1752 DIM(SORT_CYCLES, "cycles", sort_cycles), 1753 DIM(SORT_SRCLINE_FROM, "srcline_from", sort_srcline_from), 1754 DIM(SORT_SRCLINE_TO, "srcline_to", sort_srcline_to), 1755 DIM(SORT_SYM_IPC, "ipc_lbr", sort_sym_ipc), 1756 }; 1757 1758 #undef DIM 1759 1760 #define DIM(d, n, func) [d - __SORT_MEMORY_MODE] = { .name = n, .entry = &(func) } 1761 1762 static struct sort_dimension memory_sort_dimensions[] = { 1763 DIM(SORT_MEM_DADDR_SYMBOL, "symbol_daddr", sort_mem_daddr_sym), 1764 DIM(SORT_MEM_IADDR_SYMBOL, "symbol_iaddr", sort_mem_iaddr_sym), 1765 DIM(SORT_MEM_DADDR_DSO, "dso_daddr", sort_mem_daddr_dso), 1766 DIM(SORT_MEM_LOCKED, "locked", sort_mem_locked), 1767 DIM(SORT_MEM_TLB, "tlb", sort_mem_tlb), 1768 DIM(SORT_MEM_LVL, "mem", sort_mem_lvl), 1769 DIM(SORT_MEM_SNOOP, "snoop", sort_mem_snoop), 1770 DIM(SORT_MEM_DCACHELINE, "dcacheline", sort_mem_dcacheline), 1771 DIM(SORT_MEM_PHYS_DADDR, "phys_daddr", sort_mem_phys_daddr), 1772 DIM(SORT_MEM_DATA_PAGE_SIZE, "data_page_size", sort_mem_data_page_size), 1773 }; 1774 1775 #undef DIM 1776 1777 struct hpp_dimension { 1778 const char *name; 1779 struct perf_hpp_fmt *fmt; 1780 int taken; 1781 }; 1782 1783 #define DIM(d, n) { .name = n, .fmt = &perf_hpp__format[d], } 1784 1785 static struct hpp_dimension hpp_sort_dimensions[] = { 1786 DIM(PERF_HPP__OVERHEAD, "overhead"), 1787 DIM(PERF_HPP__OVERHEAD_SYS, "overhead_sys"), 1788 DIM(PERF_HPP__OVERHEAD_US, "overhead_us"), 1789 DIM(PERF_HPP__OVERHEAD_GUEST_SYS, "overhead_guest_sys"), 1790 DIM(PERF_HPP__OVERHEAD_GUEST_US, "overhead_guest_us"), 1791 DIM(PERF_HPP__OVERHEAD_ACC, "overhead_children"), 1792 DIM(PERF_HPP__SAMPLES, "sample"), 1793 DIM(PERF_HPP__PERIOD, "period"), 1794 }; 1795 1796 #undef DIM 1797 1798 struct hpp_sort_entry { 1799 struct perf_hpp_fmt hpp; 1800 struct sort_entry *se; 1801 }; 1802 1803 void perf_hpp__reset_sort_width(struct perf_hpp_fmt *fmt, struct hists *hists) 1804 { 1805 struct hpp_sort_entry *hse; 1806 1807 if (!perf_hpp__is_sort_entry(fmt)) 1808 return; 1809 1810 hse = container_of(fmt, struct hpp_sort_entry, hpp); 1811 hists__new_col_len(hists, hse->se->se_width_idx, strlen(fmt->name)); 1812 } 1813 1814 static int __sort__hpp_header(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp, 1815 struct hists *hists, int line __maybe_unused, 1816 int *span __maybe_unused) 1817 { 1818 struct hpp_sort_entry *hse; 1819 size_t len = fmt->user_len; 1820 1821 hse = container_of(fmt, struct hpp_sort_entry, hpp); 1822 1823 if (!len) 1824 len = hists__col_len(hists, hse->se->se_width_idx); 1825 1826 return scnprintf(hpp->buf, hpp->size, "%-*.*s", len, len, fmt->name); 1827 } 1828 1829 static int __sort__hpp_width(struct perf_hpp_fmt *fmt, 1830 struct perf_hpp *hpp __maybe_unused, 1831 struct hists *hists) 1832 { 1833 struct hpp_sort_entry *hse; 1834 size_t len = fmt->user_len; 1835 1836 hse = container_of(fmt, struct hpp_sort_entry, hpp); 1837 1838 if (!len) 1839 len = hists__col_len(hists, hse->se->se_width_idx); 1840 1841 return len; 1842 } 1843 1844 static int __sort__hpp_entry(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp, 1845 struct hist_entry *he) 1846 { 1847 struct hpp_sort_entry *hse; 1848 size_t len = fmt->user_len; 1849 1850 hse = container_of(fmt, struct hpp_sort_entry, hpp); 1851 1852 if (!len) 1853 len = hists__col_len(he->hists, hse->se->se_width_idx); 1854 1855 return hse->se->se_snprintf(he, hpp->buf, hpp->size, len); 1856 } 1857 1858 static int64_t __sort__hpp_cmp(struct perf_hpp_fmt *fmt, 1859 struct hist_entry *a, struct hist_entry *b) 1860 { 1861 struct hpp_sort_entry *hse; 1862 1863 hse = container_of(fmt, struct hpp_sort_entry, hpp); 1864 return hse->se->se_cmp(a, b); 1865 } 1866 1867 static int64_t __sort__hpp_collapse(struct perf_hpp_fmt *fmt, 1868 struct hist_entry *a, struct hist_entry *b) 1869 { 1870 struct hpp_sort_entry *hse; 1871 int64_t (*collapse_fn)(struct hist_entry *, struct hist_entry *); 1872 1873 hse = container_of(fmt, struct hpp_sort_entry, hpp); 1874 collapse_fn = hse->se->se_collapse ?: hse->se->se_cmp; 1875 return collapse_fn(a, b); 1876 } 1877 1878 static int64_t __sort__hpp_sort(struct perf_hpp_fmt *fmt, 1879 struct hist_entry *a, struct hist_entry *b) 1880 { 1881 struct hpp_sort_entry *hse; 1882 int64_t (*sort_fn)(struct hist_entry *, struct hist_entry *); 1883 1884 hse = container_of(fmt, struct hpp_sort_entry, hpp); 1885 sort_fn = hse->se->se_sort ?: hse->se->se_cmp; 1886 return sort_fn(a, b); 1887 } 1888 1889 bool perf_hpp__is_sort_entry(struct perf_hpp_fmt *format) 1890 { 1891 return format->header == __sort__hpp_header; 1892 } 1893 1894 #define MK_SORT_ENTRY_CHK(key) \ 1895 bool perf_hpp__is_ ## key ## _entry(struct perf_hpp_fmt *fmt) \ 1896 { \ 1897 struct hpp_sort_entry *hse; \ 1898 \ 1899 if (!perf_hpp__is_sort_entry(fmt)) \ 1900 return false; \ 1901 \ 1902 hse = container_of(fmt, struct hpp_sort_entry, hpp); \ 1903 return hse->se == &sort_ ## key ; \ 1904 } 1905 1906 MK_SORT_ENTRY_CHK(trace) 1907 MK_SORT_ENTRY_CHK(srcline) 1908 MK_SORT_ENTRY_CHK(srcfile) 1909 MK_SORT_ENTRY_CHK(thread) 1910 MK_SORT_ENTRY_CHK(comm) 1911 MK_SORT_ENTRY_CHK(dso) 1912 MK_SORT_ENTRY_CHK(sym) 1913 1914 1915 static bool __sort__hpp_equal(struct perf_hpp_fmt *a, struct perf_hpp_fmt *b) 1916 { 1917 struct hpp_sort_entry *hse_a; 1918 struct hpp_sort_entry *hse_b; 1919 1920 if (!perf_hpp__is_sort_entry(a) || !perf_hpp__is_sort_entry(b)) 1921 return false; 1922 1923 hse_a = container_of(a, struct hpp_sort_entry, hpp); 1924 hse_b = container_of(b, struct hpp_sort_entry, hpp); 1925 1926 return hse_a->se == hse_b->se; 1927 } 1928 1929 static void hse_free(struct perf_hpp_fmt *fmt) 1930 { 1931 struct hpp_sort_entry *hse; 1932 1933 hse = container_of(fmt, struct hpp_sort_entry, hpp); 1934 free(hse); 1935 } 1936 1937 static struct hpp_sort_entry * 1938 __sort_dimension__alloc_hpp(struct sort_dimension *sd, int level) 1939 { 1940 struct hpp_sort_entry *hse; 1941 1942 hse = malloc(sizeof(*hse)); 1943 if (hse == NULL) { 1944 pr_err("Memory allocation failed\n"); 1945 return NULL; 1946 } 1947 1948 hse->se = sd->entry; 1949 hse->hpp.name = sd->entry->se_header; 1950 hse->hpp.header = __sort__hpp_header; 1951 hse->hpp.width = __sort__hpp_width; 1952 hse->hpp.entry = __sort__hpp_entry; 1953 hse->hpp.color = NULL; 1954 1955 hse->hpp.cmp = __sort__hpp_cmp; 1956 hse->hpp.collapse = __sort__hpp_collapse; 1957 hse->hpp.sort = __sort__hpp_sort; 1958 hse->hpp.equal = __sort__hpp_equal; 1959 hse->hpp.free = hse_free; 1960 1961 INIT_LIST_HEAD(&hse->hpp.list); 1962 INIT_LIST_HEAD(&hse->hpp.sort_list); 1963 hse->hpp.elide = false; 1964 hse->hpp.len = 0; 1965 hse->hpp.user_len = 0; 1966 hse->hpp.level = level; 1967 1968 return hse; 1969 } 1970 1971 static void hpp_free(struct perf_hpp_fmt *fmt) 1972 { 1973 free(fmt); 1974 } 1975 1976 static struct perf_hpp_fmt *__hpp_dimension__alloc_hpp(struct hpp_dimension *hd, 1977 int level) 1978 { 1979 struct perf_hpp_fmt *fmt; 1980 1981 fmt = memdup(hd->fmt, sizeof(*fmt)); 1982 if (fmt) { 1983 INIT_LIST_HEAD(&fmt->list); 1984 INIT_LIST_HEAD(&fmt->sort_list); 1985 fmt->free = hpp_free; 1986 fmt->level = level; 1987 } 1988 1989 return fmt; 1990 } 1991 1992 int hist_entry__filter(struct hist_entry *he, int type, const void *arg) 1993 { 1994 struct perf_hpp_fmt *fmt; 1995 struct hpp_sort_entry *hse; 1996 int ret = -1; 1997 int r; 1998 1999 perf_hpp_list__for_each_format(he->hpp_list, fmt) { 2000 if (!perf_hpp__is_sort_entry(fmt)) 2001 continue; 2002 2003 hse = container_of(fmt, struct hpp_sort_entry, hpp); 2004 if (hse->se->se_filter == NULL) 2005 continue; 2006 2007 /* 2008 * hist entry is filtered if any of sort key in the hpp list 2009 * is applied. But it should skip non-matched filter types. 2010 */ 2011 r = hse->se->se_filter(he, type, arg); 2012 if (r >= 0) { 2013 if (ret < 0) 2014 ret = 0; 2015 ret |= r; 2016 } 2017 } 2018 2019 return ret; 2020 } 2021 2022 static int __sort_dimension__add_hpp_sort(struct sort_dimension *sd, 2023 struct perf_hpp_list *list, 2024 int level) 2025 { 2026 struct hpp_sort_entry *hse = __sort_dimension__alloc_hpp(sd, level); 2027 2028 if (hse == NULL) 2029 return -1; 2030 2031 perf_hpp_list__register_sort_field(list, &hse->hpp); 2032 return 0; 2033 } 2034 2035 static int __sort_dimension__add_hpp_output(struct sort_dimension *sd, 2036 struct perf_hpp_list *list) 2037 { 2038 struct hpp_sort_entry *hse = __sort_dimension__alloc_hpp(sd, 0); 2039 2040 if (hse == NULL) 2041 return -1; 2042 2043 perf_hpp_list__column_register(list, &hse->hpp); 2044 return 0; 2045 } 2046 2047 struct hpp_dynamic_entry { 2048 struct perf_hpp_fmt hpp; 2049 struct evsel *evsel; 2050 struct tep_format_field *field; 2051 unsigned dynamic_len; 2052 bool raw_trace; 2053 }; 2054 2055 static int hde_width(struct hpp_dynamic_entry *hde) 2056 { 2057 if (!hde->hpp.len) { 2058 int len = hde->dynamic_len; 2059 int namelen = strlen(hde->field->name); 2060 int fieldlen = hde->field->size; 2061 2062 if (namelen > len) 2063 len = namelen; 2064 2065 if (!(hde->field->flags & TEP_FIELD_IS_STRING)) { 2066 /* length for print hex numbers */ 2067 fieldlen = hde->field->size * 2 + 2; 2068 } 2069 if (fieldlen > len) 2070 len = fieldlen; 2071 2072 hde->hpp.len = len; 2073 } 2074 return hde->hpp.len; 2075 } 2076 2077 static void update_dynamic_len(struct hpp_dynamic_entry *hde, 2078 struct hist_entry *he) 2079 { 2080 char *str, *pos; 2081 struct tep_format_field *field = hde->field; 2082 size_t namelen; 2083 bool last = false; 2084 2085 if (hde->raw_trace) 2086 return; 2087 2088 /* parse pretty print result and update max length */ 2089 if (!he->trace_output) 2090 he->trace_output = get_trace_output(he); 2091 2092 namelen = strlen(field->name); 2093 str = he->trace_output; 2094 2095 while (str) { 2096 pos = strchr(str, ' '); 2097 if (pos == NULL) { 2098 last = true; 2099 pos = str + strlen(str); 2100 } 2101 2102 if (!strncmp(str, field->name, namelen)) { 2103 size_t len; 2104 2105 str += namelen + 1; 2106 len = pos - str; 2107 2108 if (len > hde->dynamic_len) 2109 hde->dynamic_len = len; 2110 break; 2111 } 2112 2113 if (last) 2114 str = NULL; 2115 else 2116 str = pos + 1; 2117 } 2118 } 2119 2120 static int __sort__hde_header(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp, 2121 struct hists *hists __maybe_unused, 2122 int line __maybe_unused, 2123 int *span __maybe_unused) 2124 { 2125 struct hpp_dynamic_entry *hde; 2126 size_t len = fmt->user_len; 2127 2128 hde = container_of(fmt, struct hpp_dynamic_entry, hpp); 2129 2130 if (!len) 2131 len = hde_width(hde); 2132 2133 return scnprintf(hpp->buf, hpp->size, "%*.*s", len, len, hde->field->name); 2134 } 2135 2136 static int __sort__hde_width(struct perf_hpp_fmt *fmt, 2137 struct perf_hpp *hpp __maybe_unused, 2138 struct hists *hists __maybe_unused) 2139 { 2140 struct hpp_dynamic_entry *hde; 2141 size_t len = fmt->user_len; 2142 2143 hde = container_of(fmt, struct hpp_dynamic_entry, hpp); 2144 2145 if (!len) 2146 len = hde_width(hde); 2147 2148 return len; 2149 } 2150 2151 bool perf_hpp__defined_dynamic_entry(struct perf_hpp_fmt *fmt, struct hists *hists) 2152 { 2153 struct hpp_dynamic_entry *hde; 2154 2155 hde = container_of(fmt, struct hpp_dynamic_entry, hpp); 2156 2157 return hists_to_evsel(hists) == hde->evsel; 2158 } 2159 2160 static int __sort__hde_entry(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp, 2161 struct hist_entry *he) 2162 { 2163 struct hpp_dynamic_entry *hde; 2164 size_t len = fmt->user_len; 2165 char *str, *pos; 2166 struct tep_format_field *field; 2167 size_t namelen; 2168 bool last = false; 2169 int ret; 2170 2171 hde = container_of(fmt, struct hpp_dynamic_entry, hpp); 2172 2173 if (!len) 2174 len = hde_width(hde); 2175 2176 if (hde->raw_trace) 2177 goto raw_field; 2178 2179 if (!he->trace_output) 2180 he->trace_output = get_trace_output(he); 2181 2182 field = hde->field; 2183 namelen = strlen(field->name); 2184 str = he->trace_output; 2185 2186 while (str) { 2187 pos = strchr(str, ' '); 2188 if (pos == NULL) { 2189 last = true; 2190 pos = str + strlen(str); 2191 } 2192 2193 if (!strncmp(str, field->name, namelen)) { 2194 str += namelen + 1; 2195 str = strndup(str, pos - str); 2196 2197 if (str == NULL) 2198 return scnprintf(hpp->buf, hpp->size, 2199 "%*.*s", len, len, "ERROR"); 2200 break; 2201 } 2202 2203 if (last) 2204 str = NULL; 2205 else 2206 str = pos + 1; 2207 } 2208 2209 if (str == NULL) { 2210 struct trace_seq seq; 2211 raw_field: 2212 trace_seq_init(&seq); 2213 tep_print_field(&seq, he->raw_data, hde->field); 2214 str = seq.buffer; 2215 } 2216 2217 ret = scnprintf(hpp->buf, hpp->size, "%*.*s", len, len, str); 2218 free(str); 2219 return ret; 2220 } 2221 2222 static int64_t __sort__hde_cmp(struct perf_hpp_fmt *fmt, 2223 struct hist_entry *a, struct hist_entry *b) 2224 { 2225 struct hpp_dynamic_entry *hde; 2226 struct tep_format_field *field; 2227 unsigned offset, size; 2228 2229 hde = container_of(fmt, struct hpp_dynamic_entry, hpp); 2230 2231 if (b == NULL) { 2232 update_dynamic_len(hde, a); 2233 return 0; 2234 } 2235 2236 field = hde->field; 2237 if (field->flags & TEP_FIELD_IS_DYNAMIC) { 2238 unsigned long long dyn; 2239 2240 tep_read_number_field(field, a->raw_data, &dyn); 2241 offset = dyn & 0xffff; 2242 size = (dyn >> 16) & 0xffff; 2243 2244 /* record max width for output */ 2245 if (size > hde->dynamic_len) 2246 hde->dynamic_len = size; 2247 } else { 2248 offset = field->offset; 2249 size = field->size; 2250 } 2251 2252 return memcmp(a->raw_data + offset, b->raw_data + offset, size); 2253 } 2254 2255 bool perf_hpp__is_dynamic_entry(struct perf_hpp_fmt *fmt) 2256 { 2257 return fmt->cmp == __sort__hde_cmp; 2258 } 2259 2260 static bool __sort__hde_equal(struct perf_hpp_fmt *a, struct perf_hpp_fmt *b) 2261 { 2262 struct hpp_dynamic_entry *hde_a; 2263 struct hpp_dynamic_entry *hde_b; 2264 2265 if (!perf_hpp__is_dynamic_entry(a) || !perf_hpp__is_dynamic_entry(b)) 2266 return false; 2267 2268 hde_a = container_of(a, struct hpp_dynamic_entry, hpp); 2269 hde_b = container_of(b, struct hpp_dynamic_entry, hpp); 2270 2271 return hde_a->field == hde_b->field; 2272 } 2273 2274 static void hde_free(struct perf_hpp_fmt *fmt) 2275 { 2276 struct hpp_dynamic_entry *hde; 2277 2278 hde = container_of(fmt, struct hpp_dynamic_entry, hpp); 2279 free(hde); 2280 } 2281 2282 static struct hpp_dynamic_entry * 2283 __alloc_dynamic_entry(struct evsel *evsel, struct tep_format_field *field, 2284 int level) 2285 { 2286 struct hpp_dynamic_entry *hde; 2287 2288 hde = malloc(sizeof(*hde)); 2289 if (hde == NULL) { 2290 pr_debug("Memory allocation failed\n"); 2291 return NULL; 2292 } 2293 2294 hde->evsel = evsel; 2295 hde->field = field; 2296 hde->dynamic_len = 0; 2297 2298 hde->hpp.name = field->name; 2299 hde->hpp.header = __sort__hde_header; 2300 hde->hpp.width = __sort__hde_width; 2301 hde->hpp.entry = __sort__hde_entry; 2302 hde->hpp.color = NULL; 2303 2304 hde->hpp.cmp = __sort__hde_cmp; 2305 hde->hpp.collapse = __sort__hde_cmp; 2306 hde->hpp.sort = __sort__hde_cmp; 2307 hde->hpp.equal = __sort__hde_equal; 2308 hde->hpp.free = hde_free; 2309 2310 INIT_LIST_HEAD(&hde->hpp.list); 2311 INIT_LIST_HEAD(&hde->hpp.sort_list); 2312 hde->hpp.elide = false; 2313 hde->hpp.len = 0; 2314 hde->hpp.user_len = 0; 2315 hde->hpp.level = level; 2316 2317 return hde; 2318 } 2319 2320 struct perf_hpp_fmt *perf_hpp_fmt__dup(struct perf_hpp_fmt *fmt) 2321 { 2322 struct perf_hpp_fmt *new_fmt = NULL; 2323 2324 if (perf_hpp__is_sort_entry(fmt)) { 2325 struct hpp_sort_entry *hse, *new_hse; 2326 2327 hse = container_of(fmt, struct hpp_sort_entry, hpp); 2328 new_hse = memdup(hse, sizeof(*hse)); 2329 if (new_hse) 2330 new_fmt = &new_hse->hpp; 2331 } else if (perf_hpp__is_dynamic_entry(fmt)) { 2332 struct hpp_dynamic_entry *hde, *new_hde; 2333 2334 hde = container_of(fmt, struct hpp_dynamic_entry, hpp); 2335 new_hde = memdup(hde, sizeof(*hde)); 2336 if (new_hde) 2337 new_fmt = &new_hde->hpp; 2338 } else { 2339 new_fmt = memdup(fmt, sizeof(*fmt)); 2340 } 2341 2342 INIT_LIST_HEAD(&new_fmt->list); 2343 INIT_LIST_HEAD(&new_fmt->sort_list); 2344 2345 return new_fmt; 2346 } 2347 2348 static int parse_field_name(char *str, char **event, char **field, char **opt) 2349 { 2350 char *event_name, *field_name, *opt_name; 2351 2352 event_name = str; 2353 field_name = strchr(str, '.'); 2354 2355 if (field_name) { 2356 *field_name++ = '\0'; 2357 } else { 2358 event_name = NULL; 2359 field_name = str; 2360 } 2361 2362 opt_name = strchr(field_name, '/'); 2363 if (opt_name) 2364 *opt_name++ = '\0'; 2365 2366 *event = event_name; 2367 *field = field_name; 2368 *opt = opt_name; 2369 2370 return 0; 2371 } 2372 2373 /* find match evsel using a given event name. The event name can be: 2374 * 1. '%' + event index (e.g. '%1' for first event) 2375 * 2. full event name (e.g. sched:sched_switch) 2376 * 3. partial event name (should not contain ':') 2377 */ 2378 static struct evsel *find_evsel(struct evlist *evlist, char *event_name) 2379 { 2380 struct evsel *evsel = NULL; 2381 struct evsel *pos; 2382 bool full_name; 2383 2384 /* case 1 */ 2385 if (event_name[0] == '%') { 2386 int nr = strtol(event_name+1, NULL, 0); 2387 2388 if (nr > evlist->core.nr_entries) 2389 return NULL; 2390 2391 evsel = evlist__first(evlist); 2392 while (--nr > 0) 2393 evsel = evsel__next(evsel); 2394 2395 return evsel; 2396 } 2397 2398 full_name = !!strchr(event_name, ':'); 2399 evlist__for_each_entry(evlist, pos) { 2400 /* case 2 */ 2401 if (full_name && !strcmp(pos->name, event_name)) 2402 return pos; 2403 /* case 3 */ 2404 if (!full_name && strstr(pos->name, event_name)) { 2405 if (evsel) { 2406 pr_debug("'%s' event is ambiguous: it can be %s or %s\n", 2407 event_name, evsel->name, pos->name); 2408 return NULL; 2409 } 2410 evsel = pos; 2411 } 2412 } 2413 2414 return evsel; 2415 } 2416 2417 static int __dynamic_dimension__add(struct evsel *evsel, 2418 struct tep_format_field *field, 2419 bool raw_trace, int level) 2420 { 2421 struct hpp_dynamic_entry *hde; 2422 2423 hde = __alloc_dynamic_entry(evsel, field, level); 2424 if (hde == NULL) 2425 return -ENOMEM; 2426 2427 hde->raw_trace = raw_trace; 2428 2429 perf_hpp__register_sort_field(&hde->hpp); 2430 return 0; 2431 } 2432 2433 static int add_evsel_fields(struct evsel *evsel, bool raw_trace, int level) 2434 { 2435 int ret; 2436 struct tep_format_field *field; 2437 2438 field = evsel->tp_format->format.fields; 2439 while (field) { 2440 ret = __dynamic_dimension__add(evsel, field, raw_trace, level); 2441 if (ret < 0) 2442 return ret; 2443 2444 field = field->next; 2445 } 2446 return 0; 2447 } 2448 2449 static int add_all_dynamic_fields(struct evlist *evlist, bool raw_trace, 2450 int level) 2451 { 2452 int ret; 2453 struct evsel *evsel; 2454 2455 evlist__for_each_entry(evlist, evsel) { 2456 if (evsel->core.attr.type != PERF_TYPE_TRACEPOINT) 2457 continue; 2458 2459 ret = add_evsel_fields(evsel, raw_trace, level); 2460 if (ret < 0) 2461 return ret; 2462 } 2463 return 0; 2464 } 2465 2466 static int add_all_matching_fields(struct evlist *evlist, 2467 char *field_name, bool raw_trace, int level) 2468 { 2469 int ret = -ESRCH; 2470 struct evsel *evsel; 2471 struct tep_format_field *field; 2472 2473 evlist__for_each_entry(evlist, evsel) { 2474 if (evsel->core.attr.type != PERF_TYPE_TRACEPOINT) 2475 continue; 2476 2477 field = tep_find_any_field(evsel->tp_format, field_name); 2478 if (field == NULL) 2479 continue; 2480 2481 ret = __dynamic_dimension__add(evsel, field, raw_trace, level); 2482 if (ret < 0) 2483 break; 2484 } 2485 return ret; 2486 } 2487 2488 static int add_dynamic_entry(struct evlist *evlist, const char *tok, 2489 int level) 2490 { 2491 char *str, *event_name, *field_name, *opt_name; 2492 struct evsel *evsel; 2493 struct tep_format_field *field; 2494 bool raw_trace = symbol_conf.raw_trace; 2495 int ret = 0; 2496 2497 if (evlist == NULL) 2498 return -ENOENT; 2499 2500 str = strdup(tok); 2501 if (str == NULL) 2502 return -ENOMEM; 2503 2504 if (parse_field_name(str, &event_name, &field_name, &opt_name) < 0) { 2505 ret = -EINVAL; 2506 goto out; 2507 } 2508 2509 if (opt_name) { 2510 if (strcmp(opt_name, "raw")) { 2511 pr_debug("unsupported field option %s\n", opt_name); 2512 ret = -EINVAL; 2513 goto out; 2514 } 2515 raw_trace = true; 2516 } 2517 2518 if (!strcmp(field_name, "trace_fields")) { 2519 ret = add_all_dynamic_fields(evlist, raw_trace, level); 2520 goto out; 2521 } 2522 2523 if (event_name == NULL) { 2524 ret = add_all_matching_fields(evlist, field_name, raw_trace, level); 2525 goto out; 2526 } 2527 2528 evsel = find_evsel(evlist, event_name); 2529 if (evsel == NULL) { 2530 pr_debug("Cannot find event: %s\n", event_name); 2531 ret = -ENOENT; 2532 goto out; 2533 } 2534 2535 if (evsel->core.attr.type != PERF_TYPE_TRACEPOINT) { 2536 pr_debug("%s is not a tracepoint event\n", event_name); 2537 ret = -EINVAL; 2538 goto out; 2539 } 2540 2541 if (!strcmp(field_name, "*")) { 2542 ret = add_evsel_fields(evsel, raw_trace, level); 2543 } else { 2544 field = tep_find_any_field(evsel->tp_format, field_name); 2545 if (field == NULL) { 2546 pr_debug("Cannot find event field for %s.%s\n", 2547 event_name, field_name); 2548 return -ENOENT; 2549 } 2550 2551 ret = __dynamic_dimension__add(evsel, field, raw_trace, level); 2552 } 2553 2554 out: 2555 free(str); 2556 return ret; 2557 } 2558 2559 static int __sort_dimension__add(struct sort_dimension *sd, 2560 struct perf_hpp_list *list, 2561 int level) 2562 { 2563 if (sd->taken) 2564 return 0; 2565 2566 if (__sort_dimension__add_hpp_sort(sd, list, level) < 0) 2567 return -1; 2568 2569 if (sd->entry->se_collapse) 2570 list->need_collapse = 1; 2571 2572 sd->taken = 1; 2573 2574 return 0; 2575 } 2576 2577 static int __hpp_dimension__add(struct hpp_dimension *hd, 2578 struct perf_hpp_list *list, 2579 int level) 2580 { 2581 struct perf_hpp_fmt *fmt; 2582 2583 if (hd->taken) 2584 return 0; 2585 2586 fmt = __hpp_dimension__alloc_hpp(hd, level); 2587 if (!fmt) 2588 return -1; 2589 2590 hd->taken = 1; 2591 perf_hpp_list__register_sort_field(list, fmt); 2592 return 0; 2593 } 2594 2595 static int __sort_dimension__add_output(struct perf_hpp_list *list, 2596 struct sort_dimension *sd) 2597 { 2598 if (sd->taken) 2599 return 0; 2600 2601 if (__sort_dimension__add_hpp_output(sd, list) < 0) 2602 return -1; 2603 2604 sd->taken = 1; 2605 return 0; 2606 } 2607 2608 static int __hpp_dimension__add_output(struct perf_hpp_list *list, 2609 struct hpp_dimension *hd) 2610 { 2611 struct perf_hpp_fmt *fmt; 2612 2613 if (hd->taken) 2614 return 0; 2615 2616 fmt = __hpp_dimension__alloc_hpp(hd, 0); 2617 if (!fmt) 2618 return -1; 2619 2620 hd->taken = 1; 2621 perf_hpp_list__column_register(list, fmt); 2622 return 0; 2623 } 2624 2625 int hpp_dimension__add_output(unsigned col) 2626 { 2627 BUG_ON(col >= PERF_HPP__MAX_INDEX); 2628 return __hpp_dimension__add_output(&perf_hpp_list, &hpp_sort_dimensions[col]); 2629 } 2630 2631 int sort_dimension__add(struct perf_hpp_list *list, const char *tok, 2632 struct evlist *evlist, 2633 int level) 2634 { 2635 unsigned int i; 2636 2637 for (i = 0; i < ARRAY_SIZE(common_sort_dimensions); i++) { 2638 struct sort_dimension *sd = &common_sort_dimensions[i]; 2639 2640 if (strncasecmp(tok, sd->name, strlen(tok))) 2641 continue; 2642 2643 if (sd->entry == &sort_parent) { 2644 int ret = regcomp(&parent_regex, parent_pattern, REG_EXTENDED); 2645 if (ret) { 2646 char err[BUFSIZ]; 2647 2648 regerror(ret, &parent_regex, err, sizeof(err)); 2649 pr_err("Invalid regex: %s\n%s", parent_pattern, err); 2650 return -EINVAL; 2651 } 2652 list->parent = 1; 2653 } else if (sd->entry == &sort_sym) { 2654 list->sym = 1; 2655 /* 2656 * perf diff displays the performance difference amongst 2657 * two or more perf.data files. Those files could come 2658 * from different binaries. So we should not compare 2659 * their ips, but the name of symbol. 2660 */ 2661 if (sort__mode == SORT_MODE__DIFF) 2662 sd->entry->se_collapse = sort__sym_sort; 2663 2664 } else if (sd->entry == &sort_dso) { 2665 list->dso = 1; 2666 } else if (sd->entry == &sort_socket) { 2667 list->socket = 1; 2668 } else if (sd->entry == &sort_thread) { 2669 list->thread = 1; 2670 } else if (sd->entry == &sort_comm) { 2671 list->comm = 1; 2672 } 2673 2674 return __sort_dimension__add(sd, list, level); 2675 } 2676 2677 for (i = 0; i < ARRAY_SIZE(hpp_sort_dimensions); i++) { 2678 struct hpp_dimension *hd = &hpp_sort_dimensions[i]; 2679 2680 if (strncasecmp(tok, hd->name, strlen(tok))) 2681 continue; 2682 2683 return __hpp_dimension__add(hd, list, level); 2684 } 2685 2686 for (i = 0; i < ARRAY_SIZE(bstack_sort_dimensions); i++) { 2687 struct sort_dimension *sd = &bstack_sort_dimensions[i]; 2688 2689 if (strncasecmp(tok, sd->name, strlen(tok))) 2690 continue; 2691 2692 if (sort__mode != SORT_MODE__BRANCH) 2693 return -EINVAL; 2694 2695 if (sd->entry == &sort_sym_from || sd->entry == &sort_sym_to) 2696 list->sym = 1; 2697 2698 __sort_dimension__add(sd, list, level); 2699 return 0; 2700 } 2701 2702 for (i = 0; i < ARRAY_SIZE(memory_sort_dimensions); i++) { 2703 struct sort_dimension *sd = &memory_sort_dimensions[i]; 2704 2705 if (strncasecmp(tok, sd->name, strlen(tok))) 2706 continue; 2707 2708 if (sort__mode != SORT_MODE__MEMORY) 2709 return -EINVAL; 2710 2711 if (sd->entry == &sort_mem_dcacheline && cacheline_size() == 0) 2712 return -EINVAL; 2713 2714 if (sd->entry == &sort_mem_daddr_sym) 2715 list->sym = 1; 2716 2717 __sort_dimension__add(sd, list, level); 2718 return 0; 2719 } 2720 2721 if (!add_dynamic_entry(evlist, tok, level)) 2722 return 0; 2723 2724 return -ESRCH; 2725 } 2726 2727 static int setup_sort_list(struct perf_hpp_list *list, char *str, 2728 struct evlist *evlist) 2729 { 2730 char *tmp, *tok; 2731 int ret = 0; 2732 int level = 0; 2733 int next_level = 1; 2734 bool in_group = false; 2735 2736 do { 2737 tok = str; 2738 tmp = strpbrk(str, "{}, "); 2739 if (tmp) { 2740 if (in_group) 2741 next_level = level; 2742 else 2743 next_level = level + 1; 2744 2745 if (*tmp == '{') 2746 in_group = true; 2747 else if (*tmp == '}') 2748 in_group = false; 2749 2750 *tmp = '\0'; 2751 str = tmp + 1; 2752 } 2753 2754 if (*tok) { 2755 ret = sort_dimension__add(list, tok, evlist, level); 2756 if (ret == -EINVAL) { 2757 if (!cacheline_size() && !strncasecmp(tok, "dcacheline", strlen(tok))) 2758 ui__error("The \"dcacheline\" --sort key needs to know the cacheline size and it couldn't be determined on this system"); 2759 else 2760 ui__error("Invalid --sort key: `%s'", tok); 2761 break; 2762 } else if (ret == -ESRCH) { 2763 ui__error("Unknown --sort key: `%s'", tok); 2764 break; 2765 } 2766 } 2767 2768 level = next_level; 2769 } while (tmp); 2770 2771 return ret; 2772 } 2773 2774 static const char *get_default_sort_order(struct evlist *evlist) 2775 { 2776 const char *default_sort_orders[] = { 2777 default_sort_order, 2778 default_branch_sort_order, 2779 default_mem_sort_order, 2780 default_top_sort_order, 2781 default_diff_sort_order, 2782 default_tracepoint_sort_order, 2783 }; 2784 bool use_trace = true; 2785 struct evsel *evsel; 2786 2787 BUG_ON(sort__mode >= ARRAY_SIZE(default_sort_orders)); 2788 2789 if (evlist == NULL || evlist__empty(evlist)) 2790 goto out_no_evlist; 2791 2792 evlist__for_each_entry(evlist, evsel) { 2793 if (evsel->core.attr.type != PERF_TYPE_TRACEPOINT) { 2794 use_trace = false; 2795 break; 2796 } 2797 } 2798 2799 if (use_trace) { 2800 sort__mode = SORT_MODE__TRACEPOINT; 2801 if (symbol_conf.raw_trace) 2802 return "trace_fields"; 2803 } 2804 out_no_evlist: 2805 return default_sort_orders[sort__mode]; 2806 } 2807 2808 static int setup_sort_order(struct evlist *evlist) 2809 { 2810 char *new_sort_order; 2811 2812 /* 2813 * Append '+'-prefixed sort order to the default sort 2814 * order string. 2815 */ 2816 if (!sort_order || is_strict_order(sort_order)) 2817 return 0; 2818 2819 if (sort_order[1] == '\0') { 2820 ui__error("Invalid --sort key: `+'"); 2821 return -EINVAL; 2822 } 2823 2824 /* 2825 * We allocate new sort_order string, but we never free it, 2826 * because it's checked over the rest of the code. 2827 */ 2828 if (asprintf(&new_sort_order, "%s,%s", 2829 get_default_sort_order(evlist), sort_order + 1) < 0) { 2830 pr_err("Not enough memory to set up --sort"); 2831 return -ENOMEM; 2832 } 2833 2834 sort_order = new_sort_order; 2835 return 0; 2836 } 2837 2838 /* 2839 * Adds 'pre,' prefix into 'str' is 'pre' is 2840 * not already part of 'str'. 2841 */ 2842 static char *prefix_if_not_in(const char *pre, char *str) 2843 { 2844 char *n; 2845 2846 if (!str || strstr(str, pre)) 2847 return str; 2848 2849 if (asprintf(&n, "%s,%s", pre, str) < 0) 2850 n = NULL; 2851 2852 free(str); 2853 return n; 2854 } 2855 2856 static char *setup_overhead(char *keys) 2857 { 2858 if (sort__mode == SORT_MODE__DIFF) 2859 return keys; 2860 2861 keys = prefix_if_not_in("overhead", keys); 2862 2863 if (symbol_conf.cumulate_callchain) 2864 keys = prefix_if_not_in("overhead_children", keys); 2865 2866 return keys; 2867 } 2868 2869 static int __setup_sorting(struct evlist *evlist) 2870 { 2871 char *str; 2872 const char *sort_keys; 2873 int ret = 0; 2874 2875 ret = setup_sort_order(evlist); 2876 if (ret) 2877 return ret; 2878 2879 sort_keys = sort_order; 2880 if (sort_keys == NULL) { 2881 if (is_strict_order(field_order)) { 2882 /* 2883 * If user specified field order but no sort order, 2884 * we'll honor it and not add default sort orders. 2885 */ 2886 return 0; 2887 } 2888 2889 sort_keys = get_default_sort_order(evlist); 2890 } 2891 2892 str = strdup(sort_keys); 2893 if (str == NULL) { 2894 pr_err("Not enough memory to setup sort keys"); 2895 return -ENOMEM; 2896 } 2897 2898 /* 2899 * Prepend overhead fields for backward compatibility. 2900 */ 2901 if (!is_strict_order(field_order)) { 2902 str = setup_overhead(str); 2903 if (str == NULL) { 2904 pr_err("Not enough memory to setup overhead keys"); 2905 return -ENOMEM; 2906 } 2907 } 2908 2909 ret = setup_sort_list(&perf_hpp_list, str, evlist); 2910 2911 free(str); 2912 return ret; 2913 } 2914 2915 void perf_hpp__set_elide(int idx, bool elide) 2916 { 2917 struct perf_hpp_fmt *fmt; 2918 struct hpp_sort_entry *hse; 2919 2920 perf_hpp_list__for_each_format(&perf_hpp_list, fmt) { 2921 if (!perf_hpp__is_sort_entry(fmt)) 2922 continue; 2923 2924 hse = container_of(fmt, struct hpp_sort_entry, hpp); 2925 if (hse->se->se_width_idx == idx) { 2926 fmt->elide = elide; 2927 break; 2928 } 2929 } 2930 } 2931 2932 static bool __get_elide(struct strlist *list, const char *list_name, FILE *fp) 2933 { 2934 if (list && strlist__nr_entries(list) == 1) { 2935 if (fp != NULL) 2936 fprintf(fp, "# %s: %s\n", list_name, 2937 strlist__entry(list, 0)->s); 2938 return true; 2939 } 2940 return false; 2941 } 2942 2943 static bool get_elide(int idx, FILE *output) 2944 { 2945 switch (idx) { 2946 case HISTC_SYMBOL: 2947 return __get_elide(symbol_conf.sym_list, "symbol", output); 2948 case HISTC_DSO: 2949 return __get_elide(symbol_conf.dso_list, "dso", output); 2950 case HISTC_COMM: 2951 return __get_elide(symbol_conf.comm_list, "comm", output); 2952 default: 2953 break; 2954 } 2955 2956 if (sort__mode != SORT_MODE__BRANCH) 2957 return false; 2958 2959 switch (idx) { 2960 case HISTC_SYMBOL_FROM: 2961 return __get_elide(symbol_conf.sym_from_list, "sym_from", output); 2962 case HISTC_SYMBOL_TO: 2963 return __get_elide(symbol_conf.sym_to_list, "sym_to", output); 2964 case HISTC_DSO_FROM: 2965 return __get_elide(symbol_conf.dso_from_list, "dso_from", output); 2966 case HISTC_DSO_TO: 2967 return __get_elide(symbol_conf.dso_to_list, "dso_to", output); 2968 default: 2969 break; 2970 } 2971 2972 return false; 2973 } 2974 2975 void sort__setup_elide(FILE *output) 2976 { 2977 struct perf_hpp_fmt *fmt; 2978 struct hpp_sort_entry *hse; 2979 2980 perf_hpp_list__for_each_format(&perf_hpp_list, fmt) { 2981 if (!perf_hpp__is_sort_entry(fmt)) 2982 continue; 2983 2984 hse = container_of(fmt, struct hpp_sort_entry, hpp); 2985 fmt->elide = get_elide(hse->se->se_width_idx, output); 2986 } 2987 2988 /* 2989 * It makes no sense to elide all of sort entries. 2990 * Just revert them to show up again. 2991 */ 2992 perf_hpp_list__for_each_format(&perf_hpp_list, fmt) { 2993 if (!perf_hpp__is_sort_entry(fmt)) 2994 continue; 2995 2996 if (!fmt->elide) 2997 return; 2998 } 2999 3000 perf_hpp_list__for_each_format(&perf_hpp_list, fmt) { 3001 if (!perf_hpp__is_sort_entry(fmt)) 3002 continue; 3003 3004 fmt->elide = false; 3005 } 3006 } 3007 3008 int output_field_add(struct perf_hpp_list *list, char *tok) 3009 { 3010 unsigned int i; 3011 3012 for (i = 0; i < ARRAY_SIZE(common_sort_dimensions); i++) { 3013 struct sort_dimension *sd = &common_sort_dimensions[i]; 3014 3015 if (strncasecmp(tok, sd->name, strlen(tok))) 3016 continue; 3017 3018 return __sort_dimension__add_output(list, sd); 3019 } 3020 3021 for (i = 0; i < ARRAY_SIZE(hpp_sort_dimensions); i++) { 3022 struct hpp_dimension *hd = &hpp_sort_dimensions[i]; 3023 3024 if (strncasecmp(tok, hd->name, strlen(tok))) 3025 continue; 3026 3027 return __hpp_dimension__add_output(list, hd); 3028 } 3029 3030 for (i = 0; i < ARRAY_SIZE(bstack_sort_dimensions); i++) { 3031 struct sort_dimension *sd = &bstack_sort_dimensions[i]; 3032 3033 if (strncasecmp(tok, sd->name, strlen(tok))) 3034 continue; 3035 3036 if (sort__mode != SORT_MODE__MEMORY) 3037 return -EINVAL; 3038 3039 return __sort_dimension__add_output(list, sd); 3040 } 3041 3042 for (i = 0; i < ARRAY_SIZE(memory_sort_dimensions); i++) { 3043 struct sort_dimension *sd = &memory_sort_dimensions[i]; 3044 3045 if (strncasecmp(tok, sd->name, strlen(tok))) 3046 continue; 3047 3048 if (sort__mode != SORT_MODE__BRANCH) 3049 return -EINVAL; 3050 3051 return __sort_dimension__add_output(list, sd); 3052 } 3053 3054 return -ESRCH; 3055 } 3056 3057 static int setup_output_list(struct perf_hpp_list *list, char *str) 3058 { 3059 char *tmp, *tok; 3060 int ret = 0; 3061 3062 for (tok = strtok_r(str, ", ", &tmp); 3063 tok; tok = strtok_r(NULL, ", ", &tmp)) { 3064 ret = output_field_add(list, tok); 3065 if (ret == -EINVAL) { 3066 ui__error("Invalid --fields key: `%s'", tok); 3067 break; 3068 } else if (ret == -ESRCH) { 3069 ui__error("Unknown --fields key: `%s'", tok); 3070 break; 3071 } 3072 } 3073 3074 return ret; 3075 } 3076 3077 void reset_dimensions(void) 3078 { 3079 unsigned int i; 3080 3081 for (i = 0; i < ARRAY_SIZE(common_sort_dimensions); i++) 3082 common_sort_dimensions[i].taken = 0; 3083 3084 for (i = 0; i < ARRAY_SIZE(hpp_sort_dimensions); i++) 3085 hpp_sort_dimensions[i].taken = 0; 3086 3087 for (i = 0; i < ARRAY_SIZE(bstack_sort_dimensions); i++) 3088 bstack_sort_dimensions[i].taken = 0; 3089 3090 for (i = 0; i < ARRAY_SIZE(memory_sort_dimensions); i++) 3091 memory_sort_dimensions[i].taken = 0; 3092 } 3093 3094 bool is_strict_order(const char *order) 3095 { 3096 return order && (*order != '+'); 3097 } 3098 3099 static int __setup_output_field(void) 3100 { 3101 char *str, *strp; 3102 int ret = -EINVAL; 3103 3104 if (field_order == NULL) 3105 return 0; 3106 3107 strp = str = strdup(field_order); 3108 if (str == NULL) { 3109 pr_err("Not enough memory to setup output fields"); 3110 return -ENOMEM; 3111 } 3112 3113 if (!is_strict_order(field_order)) 3114 strp++; 3115 3116 if (!strlen(strp)) { 3117 ui__error("Invalid --fields key: `+'"); 3118 goto out; 3119 } 3120 3121 ret = setup_output_list(&perf_hpp_list, strp); 3122 3123 out: 3124 free(str); 3125 return ret; 3126 } 3127 3128 int setup_sorting(struct evlist *evlist) 3129 { 3130 int err; 3131 3132 err = __setup_sorting(evlist); 3133 if (err < 0) 3134 return err; 3135 3136 if (parent_pattern != default_parent_pattern) { 3137 err = sort_dimension__add(&perf_hpp_list, "parent", evlist, -1); 3138 if (err < 0) 3139 return err; 3140 } 3141 3142 reset_dimensions(); 3143 3144 /* 3145 * perf diff doesn't use default hpp output fields. 3146 */ 3147 if (sort__mode != SORT_MODE__DIFF) 3148 perf_hpp__init(); 3149 3150 err = __setup_output_field(); 3151 if (err < 0) 3152 return err; 3153 3154 /* copy sort keys to output fields */ 3155 perf_hpp__setup_output_field(&perf_hpp_list); 3156 /* and then copy output fields to sort keys */ 3157 perf_hpp__append_sort_keys(&perf_hpp_list); 3158 3159 /* setup hists-specific output fields */ 3160 if (perf_hpp__setup_hists_formats(&perf_hpp_list, evlist) < 0) 3161 return -1; 3162 3163 return 0; 3164 } 3165 3166 void reset_output_field(void) 3167 { 3168 perf_hpp_list.need_collapse = 0; 3169 perf_hpp_list.parent = 0; 3170 perf_hpp_list.sym = 0; 3171 perf_hpp_list.dso = 0; 3172 3173 field_order = NULL; 3174 sort_order = NULL; 3175 3176 reset_dimensions(); 3177 perf_hpp__reset_output_field(&perf_hpp_list); 3178 } 3179 3180 #define INDENT (3*8 + 1) 3181 3182 static void add_key(struct strbuf *sb, const char *str, int *llen) 3183 { 3184 if (*llen >= 75) { 3185 strbuf_addstr(sb, "\n\t\t\t "); 3186 *llen = INDENT; 3187 } 3188 strbuf_addf(sb, " %s", str); 3189 *llen += strlen(str) + 1; 3190 } 3191 3192 static void add_sort_string(struct strbuf *sb, struct sort_dimension *s, int n, 3193 int *llen) 3194 { 3195 int i; 3196 3197 for (i = 0; i < n; i++) 3198 add_key(sb, s[i].name, llen); 3199 } 3200 3201 static void add_hpp_sort_string(struct strbuf *sb, struct hpp_dimension *s, int n, 3202 int *llen) 3203 { 3204 int i; 3205 3206 for (i = 0; i < n; i++) 3207 add_key(sb, s[i].name, llen); 3208 } 3209 3210 const char *sort_help(const char *prefix) 3211 { 3212 struct strbuf sb; 3213 char *s; 3214 int len = strlen(prefix) + INDENT; 3215 3216 strbuf_init(&sb, 300); 3217 strbuf_addstr(&sb, prefix); 3218 add_hpp_sort_string(&sb, hpp_sort_dimensions, 3219 ARRAY_SIZE(hpp_sort_dimensions), &len); 3220 add_sort_string(&sb, common_sort_dimensions, 3221 ARRAY_SIZE(common_sort_dimensions), &len); 3222 add_sort_string(&sb, bstack_sort_dimensions, 3223 ARRAY_SIZE(bstack_sort_dimensions), &len); 3224 add_sort_string(&sb, memory_sort_dimensions, 3225 ARRAY_SIZE(memory_sort_dimensions), &len); 3226 s = strbuf_detach(&sb, NULL); 3227 strbuf_release(&sb); 3228 return s; 3229 } 3230