tools/perf/util/sort.c

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