SAFE public projects git trees. - safe/jmp/linux-2.6/blob - tools/perf/builtin-report.c

   1 /*
   2  * builtin-report.c
   3  *
   4  * Builtin report command: Analyze the perf.data input file,
   5  * look up and read DSOs and symbol information and display
   6  * a histogram of results, along various sorting keys.
   7  */
   8 #include "builtin.h"
   9
  10 #include "util/util.h"
  11
  12 #include "util/color.h"
  13 #include <linux/list.h>
  14 #include "util/cache.h"
  15 #include <linux/rbtree.h>
  16 #include "util/symbol.h"
  17 #include "util/string.h"
  18 #include "util/callchain.h"
  19 #include "util/strlist.h"
  20 #include "util/values.h"
  21
  22 #include "perf.h"
  23 #include "util/debug.h"
  24 #include "util/header.h"
  25
  26 #include "util/parse-options.h"
  27 #include "util/parse-events.h"
  28
  29 #include "util/thread.h"
  30
  31 static char             const *input_name = "perf.data";
  32
  33 static char             default_sort_order[] = "comm,dso,symbol";
  34 static char             *sort_order = default_sort_order;
  35 static char             *dso_list_str, *comm_list_str, *sym_list_str,
  36                         *col_width_list_str;
  37 static struct strlist   *dso_list, *comm_list, *sym_list;
  38 static char             *field_sep;
  39
  40 static int              force;
  41 static int              input;
  42 static int              show_mask = SHOW_KERNEL | SHOW_USER | SHOW_HV;
  43
  44 static int              full_paths;
  45 static int              show_nr_samples;
  46
  47 static int              show_threads;
  48 static struct perf_read_values  show_threads_values;
  49
  50 static char             default_pretty_printing_style[] = "normal";
  51 static char             *pretty_printing_style = default_pretty_printing_style;
  52
  53 static unsigned long    page_size;
  54 static unsigned long    mmap_window = 32;
  55
  56 static char             default_parent_pattern[] = "^sys_|^do_page_fault";
  57 static char             *parent_pattern = default_parent_pattern;
  58 static regex_t          parent_regex;
  59
  60 static int              exclude_other = 1;
  61
  62 static char             callchain_default_opt[] = "fractal,0.5";
  63
  64 static int              callchain;
  65
  66 static char             __cwd[PATH_MAX];
  67 static char             *cwd = __cwd;
  68 static int              cwdlen;
  69
  70 static struct rb_root   threads;
  71 static struct thread    *last_match;
  72
  73 static struct perf_header *header;
  74
  75 static
  76 struct callchain_param  callchain_param = {
  77         .mode   = CHAIN_GRAPH_REL,
  78         .min_percent = 0.5
  79 };
  80
  81 static u64              sample_type;
  82
  83 static int repsep_fprintf(FILE *fp, const char *fmt, ...)
  84 {
  85         int n;
  86         va_list ap;
  87
  88         va_start(ap, fmt);
  89         if (!field_sep)
  90                 n = vfprintf(fp, fmt, ap);
  91         else {
  92                 char *bf = NULL;
  93                 n = vasprintf(&bf, fmt, ap);
  94                 if (n > 0) {
  95                         char *sep = bf;
  96
  97                         while (1) {
  98                                 sep = strchr(sep, *field_sep);
  99                                 if (sep == NULL)
 100                                         break;
 101                                 *sep = '.';
 102                         }
 103                 }
 104                 fputs(bf, fp);
 105                 free(bf);
 106         }
 107         va_end(ap);
 108         return n;
 109 }
 110
 111 static unsigned int dsos__col_width,
 112                     comms__col_width,
 113                     threads__col_width;
 114
 115 /*
 116  * histogram, sorted on item, collects counts
 117  */
 118
 119 static struct rb_root hist;
 120
 121 struct hist_entry {
 122         struct rb_node          rb_node;
 123
 124         struct thread           *thread;
 125         struct map              *map;
 126         struct dso              *dso;
 127         struct symbol           *sym;
 128         struct symbol           *parent;
 129         u64                     ip;
 130         char                    level;
 131         struct callchain_node   callchain;
 132         struct rb_root          sorted_chain;
 133
 134         u64                     count;
 135 };
 136
 137 /*
 138  * configurable sorting bits
 139  */
 140
 141 struct sort_entry {
 142         struct list_head list;
 143
 144         const char *header;
 145
 146         int64_t (*cmp)(struct hist_entry *, struct hist_entry *);
 147         int64_t (*collapse)(struct hist_entry *, struct hist_entry *);
 148         size_t  (*print)(FILE *fp, struct hist_entry *, unsigned int width);
 149         unsigned int *width;
 150         bool    elide;
 151 };
 152
 153 static int64_t cmp_null(void *l, void *r)
 154 {
 155         if (!l && !r)
 156                 return 0;
 157         else if (!l)
 158                 return -1;
 159         else
 160                 return 1;
 161 }
 162
 163 /* --sort pid */
 164
 165 static int64_t
 166 sort__thread_cmp(struct hist_entry *left, struct hist_entry *right)
 167 {
 168         return right->thread->pid - left->thread->pid;
 169 }
 170
 171 static size_t
 172 sort__thread_print(FILE *fp, struct hist_entry *self, unsigned int width)
 173 {
 174         return repsep_fprintf(fp, "%*s:%5d", width - 6,
 175                               self->thread->comm ?: "", self->thread->pid);
 176 }
 177
 178 static struct sort_entry sort_thread = {
 179         .header = "Command:  Pid",
 180         .cmp    = sort__thread_cmp,
 181         .print  = sort__thread_print,
 182         .width  = &threads__col_width,
 183 };
 184
 185 /* --sort comm */
 186
 187 static int64_t
 188 sort__comm_cmp(struct hist_entry *left, struct hist_entry *right)
 189 {
 190         return right->thread->pid - left->thread->pid;
 191 }
 192
 193 static int64_t
 194 sort__comm_collapse(struct hist_entry *left, struct hist_entry *right)
 195 {
 196         char *comm_l = left->thread->comm;
 197         char *comm_r = right->thread->comm;
 198
 199         if (!comm_l || !comm_r)
 200                 return cmp_null(comm_l, comm_r);
 201
 202         return strcmp(comm_l, comm_r);
 203 }
 204
 205 static size_t
 206 sort__comm_print(FILE *fp, struct hist_entry *self, unsigned int width)
 207 {
 208         return repsep_fprintf(fp, "%*s", width, self->thread->comm);
 209 }
 210
 211 static struct sort_entry sort_comm = {
 212         .header         = "Command",
 213         .cmp            = sort__comm_cmp,
 214         .collapse       = sort__comm_collapse,
 215         .print          = sort__comm_print,
 216         .width          = &comms__col_width,
 217 };
 218
 219 /* --sort dso */
 220
 221 static int64_t
 222 sort__dso_cmp(struct hist_entry *left, struct hist_entry *right)
 223 {
 224         struct dso *dso_l = left->dso;
 225         struct dso *dso_r = right->dso;
 226
 227         if (!dso_l || !dso_r)
 228                 return cmp_null(dso_l, dso_r);
 229
 230         return strcmp(dso_l->name, dso_r->name);
 231 }
 232
 233 static size_t
 234 sort__dso_print(FILE *fp, struct hist_entry *self, unsigned int width)
 235 {
 236         if (self->dso)
 237                 return repsep_fprintf(fp, "%-*s", width, self->dso->name);
 238
 239         return repsep_fprintf(fp, "%*llx", width, (u64)self->ip);
 240 }
 241
 242 static struct sort_entry sort_dso = {
 243         .header = "Shared Object",
 244         .cmp    = sort__dso_cmp,
 245         .print  = sort__dso_print,
 246         .width  = &dsos__col_width,
 247 };
 248
 249 /* --sort symbol */
 250
 251 static int64_t
 252 sort__sym_cmp(struct hist_entry *left, struct hist_entry *right)
 253 {
 254         u64 ip_l, ip_r;
 255
 256         if (left->sym == right->sym)
 257                 return 0;
 258
 259         ip_l = left->sym ? left->sym->start : left->ip;
 260         ip_r = right->sym ? right->sym->start : right->ip;
 261
 262         return (int64_t)(ip_r - ip_l);
 263 }
 264
 265 static size_t
 266 sort__sym_print(FILE *fp, struct hist_entry *self, unsigned int width __used)
 267 {
 268         size_t ret = 0;
 269
 270         if (verbose)
 271                 ret += repsep_fprintf(fp, "%#018llx %c ", (u64)self->ip,
 272                                       dso__symtab_origin(self->dso));
 273
 274         ret += repsep_fprintf(fp, "[%c] ", self->level);
 275         if (self->sym) {
 276                 ret += repsep_fprintf(fp, "%s", self->sym->name);
 277
 278                 if (self->sym->module)
 279                         ret += repsep_fprintf(fp, "\t[%s]",
 280                                              self->sym->module->name);
 281         } else {
 282                 ret += repsep_fprintf(fp, "%#016llx", (u64)self->ip);
 283         }
 284
 285         return ret;
 286 }
 287
 288 static struct sort_entry sort_sym = {
 289         .header = "Symbol",
 290         .cmp    = sort__sym_cmp,
 291         .print  = sort__sym_print,
 292 };
 293
 294 /* --sort parent */
 295
 296 static int64_t
 297 sort__parent_cmp(struct hist_entry *left, struct hist_entry *right)
 298 {
 299         struct symbol *sym_l = left->parent;
 300         struct symbol *sym_r = right->parent;
 301
 302         if (!sym_l || !sym_r)
 303                 return cmp_null(sym_l, sym_r);
 304
 305         return strcmp(sym_l->name, sym_r->name);
 306 }
 307
 308 static size_t
 309 sort__parent_print(FILE *fp, struct hist_entry *self, unsigned int width)
 310 {
 311         return repsep_fprintf(fp, "%-*s", width,
 312                               self->parent ? self->parent->name : "[other]");
 313 }
 314
 315 static unsigned int parent_symbol__col_width;
 316
 317 static struct sort_entry sort_parent = {
 318         .header = "Parent symbol",
 319         .cmp    = sort__parent_cmp,
 320         .print  = sort__parent_print,
 321         .width  = &parent_symbol__col_width,
 322 };
 323
 324 static int sort__need_collapse = 0;
 325 static int sort__has_parent = 0;
 326
 327 struct sort_dimension {
 328         const char              *name;
 329         struct sort_entry       *entry;
 330         int                     taken;
 331 };
 332
 333 static struct sort_dimension sort_dimensions[] = {
 334         { .name = "pid",        .entry = &sort_thread,  },
 335         { .name = "comm",       .entry = &sort_comm,    },
 336         { .name = "dso",        .entry = &sort_dso,     },
 337         { .name = "symbol",     .entry = &sort_sym,     },
 338         { .name = "parent",     .entry = &sort_parent,  },
 339 };
 340
 341 static LIST_HEAD(hist_entry__sort_list);
 342
 343 static int sort_dimension__add(const char *tok)
 344 {
 345         unsigned int i;
 346
 347         for (i = 0; i < ARRAY_SIZE(sort_dimensions); i++) {
 348                 struct sort_dimension *sd = &sort_dimensions[i];
 349
 350                 if (sd->taken)
 351                         continue;
 352
 353                 if (strncasecmp(tok, sd->name, strlen(tok)))
 354                         continue;
 355
 356                 if (sd->entry->collapse)
 357                         sort__need_collapse = 1;
 358
 359                 if (sd->entry == &sort_parent) {
 360                         int ret = regcomp(&parent_regex, parent_pattern, REG_EXTENDED);
 361                         if (ret) {
 362                                 char err[BUFSIZ];
 363
 364                                 regerror(ret, &parent_regex, err, sizeof(err));
 365                                 fprintf(stderr, "Invalid regex: %s\n%s",
 366                                         parent_pattern, err);
 367                                 exit(-1);
 368                         }
 369                         sort__has_parent = 1;
 370                 }
 371
 372                 list_add_tail(&sd->entry->list, &hist_entry__sort_list);
 373                 sd->taken = 1;
 374
 375                 return 0;
 376         }
 377
 378         return -ESRCH;
 379 }
 380
 381 static int64_t
 382 hist_entry__cmp(struct hist_entry *left, struct hist_entry *right)
 383 {
 384         struct sort_entry *se;
 385         int64_t cmp = 0;
 386
 387         list_for_each_entry(se, &hist_entry__sort_list, list) {
 388                 cmp = se->cmp(left, right);
 389                 if (cmp)
 390                         break;
 391         }
 392
 393         return cmp;
 394 }
 395
 396 static int64_t
 397 hist_entry__collapse(struct hist_entry *left, struct hist_entry *right)
 398 {
 399         struct sort_entry *se;
 400         int64_t cmp = 0;
 401
 402         list_for_each_entry(se, &hist_entry__sort_list, list) {
 403                 int64_t (*f)(struct hist_entry *, struct hist_entry *);
 404
 405                 f = se->collapse ?: se->cmp;
 406
 407                 cmp = f(left, right);
 408                 if (cmp)
 409                         break;
 410         }
 411
 412         return cmp;
 413 }
 414
 415 static size_t ipchain__fprintf_graph_line(FILE *fp, int depth, int depth_mask)
 416 {
 417         int i;
 418         size_t ret = 0;
 419
 420         ret += fprintf(fp, "%s", "                ");
 421
 422         for (i = 0; i < depth; i++)
 423                 if (depth_mask & (1 << i))
 424                         ret += fprintf(fp, "|          ");
 425                 else
 426                         ret += fprintf(fp, "           ");
 427
 428         ret += fprintf(fp, "\n");
 429
 430         return ret;
 431 }
 432 static size_t
 433 ipchain__fprintf_graph(FILE *fp, struct callchain_list *chain, int depth,
 434                        int depth_mask, int count, u64 total_samples,
 435                        int hits)
 436 {
 437         int i;
 438         size_t ret = 0;
 439
 440         ret += fprintf(fp, "%s", "                ");
 441         for (i = 0; i < depth; i++) {
 442                 if (depth_mask & (1 << i))
 443                         ret += fprintf(fp, "|");
 444                 else
 445                         ret += fprintf(fp, " ");
 446                 if (!count && i == depth - 1) {
 447                         double percent;
 448
 449                         percent = hits * 100.0 / total_samples;
 450                         ret += percent_color_fprintf(fp, "--%2.2f%%-- ", percent);
 451                 } else
 452                         ret += fprintf(fp, "%s", "          ");
 453         }
 454         if (chain->sym)
 455                 ret += fprintf(fp, "%s\n", chain->sym->name);
 456         else
 457                 ret += fprintf(fp, "%p\n", (void *)(long)chain->ip);
 458
 459         return ret;
 460 }
 461
 462 static struct symbol *rem_sq_bracket;
 463 static struct callchain_list rem_hits;
 464
 465 static void init_rem_hits(void)
 466 {
 467         rem_sq_bracket = malloc(sizeof(*rem_sq_bracket) + 6);
 468         if (!rem_sq_bracket) {
 469                 fprintf(stderr, "Not enough memory to display remaining hits\n");
 470                 return;
 471         }
 472
 473         strcpy(rem_sq_bracket->name, "[...]");
 474         rem_hits.sym = rem_sq_bracket;
 475 }
 476
 477 static size_t
 478 callchain__fprintf_graph(FILE *fp, struct callchain_node *self,
 479                         u64 total_samples, int depth, int depth_mask)
 480 {
 481         struct rb_node *node, *next;
 482         struct callchain_node *child;
 483         struct callchain_list *chain;
 484         int new_depth_mask = depth_mask;
 485         u64 new_total;
 486         u64 remaining;
 487         size_t ret = 0;
 488         int i;
 489
 490         if (callchain_param.mode == CHAIN_GRAPH_REL)
 491                 new_total = self->children_hit;
 492         else
 493                 new_total = total_samples;
 494
 495         remaining = new_total;
 496
 497         node = rb_first(&self->rb_root);
 498         while (node) {
 499                 u64 cumul;
 500
 501                 child = rb_entry(node, struct callchain_node, rb_node);
 502                 cumul = cumul_hits(child);
 503                 remaining -= cumul;
 504
 505                 /*
 506                  * The depth mask manages the output of pipes that show
 507                  * the depth. We don't want to keep the pipes of the current
 508                  * level for the last child of this depth.
 509                  * Except if we have remaining filtered hits. They will
 510                  * supersede the last child
 511                  */
 512                 next = rb_next(node);
 513                 if (!next && (callchain_param.mode != CHAIN_GRAPH_REL || !remaining))
 514                         new_depth_mask &= ~(1 << (depth - 1));
 515
 516                 /*
 517                  * But we keep the older depth mask for the line seperator
 518                  * to keep the level link until we reach the last child
 519                  */
 520                 ret += ipchain__fprintf_graph_line(fp, depth, depth_mask);
 521                 i = 0;
 522                 list_for_each_entry(chain, &child->val, list) {
 523                         if (chain->ip >= PERF_CONTEXT_MAX)
 524                                 continue;
 525                         ret += ipchain__fprintf_graph(fp, chain, depth,
 526                                                       new_depth_mask, i++,
 527                                                       new_total,
 528                                                       cumul);
 529                 }
 530                 ret += callchain__fprintf_graph(fp, child, new_total,
 531                                                 depth + 1,
 532                                                 new_depth_mask | (1 << depth));
 533                 node = next;
 534         }
 535
 536         if (callchain_param.mode == CHAIN_GRAPH_REL &&
 537                 remaining && remaining != new_total) {
 538
 539                 if (!rem_sq_bracket)
 540                         return ret;
 541
 542                 new_depth_mask &= ~(1 << (depth - 1));
 543
 544                 ret += ipchain__fprintf_graph(fp, &rem_hits, depth,
 545                                               new_depth_mask, 0, new_total,
 546                                               remaining);
 547         }
 548
 549         return ret;
 550 }
 551
 552 static size_t
 553 callchain__fprintf_flat(FILE *fp, struct callchain_node *self,
 554                         u64 total_samples)
 555 {
 556         struct callchain_list *chain;
 557         size_t ret = 0;
 558
 559         if (!self)
 560                 return 0;
 561
 562         ret += callchain__fprintf_flat(fp, self->parent, total_samples);
 563
 564
 565         list_for_each_entry(chain, &self->val, list) {
 566                 if (chain->ip >= PERF_CONTEXT_MAX)
 567                         continue;
 568                 if (chain->sym)
 569                         ret += fprintf(fp, "                %s\n", chain->sym->name);
 570                 else
 571                         ret += fprintf(fp, "                %p\n",
 572                                         (void *)(long)chain->ip);
 573         }
 574
 575         return ret;
 576 }
 577
 578 static size_t
 579 hist_entry_callchain__fprintf(FILE *fp, struct hist_entry *self,
 580                               u64 total_samples)
 581 {
 582         struct rb_node *rb_node;
 583         struct callchain_node *chain;
 584         size_t ret = 0;
 585
 586         rb_node = rb_first(&self->sorted_chain);
 587         while (rb_node) {
 588                 double percent;
 589
 590                 chain = rb_entry(rb_node, struct callchain_node, rb_node);
 591                 percent = chain->hit * 100.0 / total_samples;
 592                 switch (callchain_param.mode) {
 593                 case CHAIN_FLAT:
 594                         ret += percent_color_fprintf(fp, "           %6.2f%%\n",
 595                                                      percent);
 596                         ret += callchain__fprintf_flat(fp, chain, total_samples);
 597                         break;
 598                 case CHAIN_GRAPH_ABS: /* Falldown */
 599                 case CHAIN_GRAPH_REL:
 600                         ret += callchain__fprintf_graph(fp, chain,
 601                                                         total_samples, 1, 1);
 602                 case CHAIN_NONE:
 603                 default:
 604                         break;
 605                 }
 606                 ret += fprintf(fp, "\n");
 607                 rb_node = rb_next(rb_node);
 608         }
 609
 610         return ret;
 611 }
 612
 613
 614 static size_t
 615 hist_entry__fprintf(FILE *fp, struct hist_entry *self, u64 total_samples)
 616 {
 617         struct sort_entry *se;
 618         size_t ret;
 619
 620         if (exclude_other && !self->parent)
 621                 return 0;
 622
 623         if (total_samples)
 624                 ret = percent_color_fprintf(fp,
 625                                             field_sep ? "%.2f" : "   %6.2f%%",
 626                                         (self->count * 100.0) / total_samples);
 627         else
 628                 ret = fprintf(fp, field_sep ? "%lld" : "%12lld ", self->count);
 629
 630         if (show_nr_samples) {
 631                 if (field_sep)
 632                         fprintf(fp, "%c%lld", *field_sep, self->count);
 633                 else
 634                         fprintf(fp, "%11lld", self->count);
 635         }
 636
 637         list_for_each_entry(se, &hist_entry__sort_list, list) {
 638                 if (se->elide)
 639                         continue;
 640
 641                 fprintf(fp, "%s", field_sep ?: "  ");
 642                 ret += se->print(fp, self, se->width ? *se->width : 0);
 643         }
 644
 645         ret += fprintf(fp, "\n");
 646
 647         if (callchain)
 648                 hist_entry_callchain__fprintf(fp, self, total_samples);
 649
 650         return ret;
 651 }
 652
 653 /*
 654  *
 655  */
 656
 657 static void dso__calc_col_width(struct dso *self)
 658 {
 659         if (!col_width_list_str && !field_sep &&
 660             (!dso_list || strlist__has_entry(dso_list, self->name))) {
 661                 unsigned int slen = strlen(self->name);
 662                 if (slen > dsos__col_width)
 663                         dsos__col_width = slen;
 664         }
 665
 666         self->slen_calculated = 1;
 667 }
 668
 669 static int thread__set_comm_adjust(struct thread *self, const char *comm)
 670 {
 671         int ret = thread__set_comm(self, comm);
 672
 673         if (ret)
 674                 return ret;
 675
 676         if (!col_width_list_str && !field_sep &&
 677             (!comm_list || strlist__has_entry(comm_list, comm))) {
 678                 unsigned int slen = strlen(comm);
 679
 680                 if (slen > comms__col_width) {
 681                         comms__col_width = slen;
 682                         threads__col_width = slen + 6;
 683                 }
 684         }
 685
 686         return 0;
 687 }
 688
 689
 690 static struct symbol *
 691 resolve_symbol(struct thread *thread, struct map **mapp,
 692                struct dso **dsop, u64 *ipp)
 693 {
 694         struct dso *dso = dsop ? *dsop : NULL;
 695         struct map *map = mapp ? *mapp : NULL;
 696         u64 ip = *ipp;
 697
 698         if (!thread)
 699                 return NULL;
 700
 701         if (dso)
 702                 goto got_dso;
 703
 704         if (map)
 705                 goto got_map;
 706
 707         map = thread__find_map(thread, ip);
 708         if (map != NULL) {
 709                 /*
 710                  * We have to do this here as we may have a dso
 711                  * with no symbol hit that has a name longer than
 712                  * the ones with symbols sampled.
 713                  */
 714                 if (!sort_dso.elide && !map->dso->slen_calculated)
 715                         dso__calc_col_width(map->dso);
 716
 717                 if (mapp)
 718                         *mapp = map;
 719 got_map:
 720                 ip = map->map_ip(map, ip);
 721
 722                 dso = map->dso;
 723         } else {
 724                 /*
 725                  * If this is outside of all known maps,
 726                  * and is a negative address, try to look it
 727                  * up in the kernel dso, as it might be a
 728                  * vsyscall (which executes in user-mode):
 729                  */
 730                 if ((long long)ip < 0)
 731                 dso = kernel_dso;
 732         }
 733         dump_printf(" ...... dso: %s\n", dso ? dso->name : "<not found>");
 734         dump_printf(" ...... map: %Lx -> %Lx\n", *ipp, ip);
 735         *ipp  = ip;
 736
 737         if (dsop)
 738                 *dsop = dso;
 739
 740         if (!dso)
 741                 return NULL;
 742 got_dso:
 743         return dso->find_symbol(dso, ip);
 744 }
 745
 746 static int call__match(struct symbol *sym)
 747 {
 748         if (sym->name && !regexec(&parent_regex, sym->name, 0, NULL, 0))
 749                 return 1;
 750
 751         return 0;
 752 }
 753
 754 static struct symbol **
 755 resolve_callchain(struct thread *thread, struct map *map __used,
 756                     struct ip_callchain *chain, struct hist_entry *entry)
 757 {
 758         u64 context = PERF_CONTEXT_MAX;
 759         struct symbol **syms = NULL;
 760         unsigned int i;
 761
 762         if (callchain) {
 763                 syms = calloc(chain->nr, sizeof(*syms));
 764                 if (!syms) {
 765                         fprintf(stderr, "Can't allocate memory for symbols\n");
 766                         exit(-1);
 767                 }
 768         }
 769
 770         for (i = 0; i < chain->nr; i++) {
 771                 u64 ip = chain->ips[i];
 772                 struct dso *dso = NULL;
 773                 struct symbol *sym;
 774
 775                 if (ip >= PERF_CONTEXT_MAX) {
 776                         context = ip;
 777                         continue;
 778                 }
 779
 780                 switch (context) {
 781                 case PERF_CONTEXT_HV:
 782                         dso = hypervisor_dso;
 783                         break;
 784                 case PERF_CONTEXT_KERNEL:
 785                         dso = kernel_dso;
 786                         break;
 787                 default:
 788                         break;
 789                 }
 790
 791                 sym = resolve_symbol(thread, NULL, &dso, &ip);
 792
 793                 if (sym) {
 794                         if (sort__has_parent && call__match(sym) &&
 795                             !entry->parent)
 796                                 entry->parent = sym;
 797                         if (!callchain)
 798                                 break;
 799                         syms[i] = sym;
 800                 }
 801         }
 802
 803         return syms;
 804 }
 805
 806 /*
 807  * collect histogram counts
 808  */
 809
 810 static int
 811 hist_entry__add(struct thread *thread, struct map *map, struct dso *dso,
 812                 struct symbol *sym, u64 ip, struct ip_callchain *chain,
 813                 char level, u64 count)
 814 {
 815         struct rb_node **p = &hist.rb_node;
 816         struct rb_node *parent = NULL;
 817         struct hist_entry *he;
 818         struct symbol **syms = NULL;
 819         struct hist_entry entry = {
 820                 .thread = thread,
 821                 .map    = map,
 822                 .dso    = dso,
 823                 .sym    = sym,
 824                 .ip     = ip,
 825                 .level  = level,
 826                 .count  = count,
 827                 .parent = NULL,
 828                 .sorted_chain = RB_ROOT
 829         };
 830         int cmp;
 831
 832         if ((sort__has_parent || callchain) && chain)
 833                 syms = resolve_callchain(thread, map, chain, &entry);
 834
 835         while (*p != NULL) {
 836                 parent = *p;
 837                 he = rb_entry(parent, struct hist_entry, rb_node);
 838
 839                 cmp = hist_entry__cmp(&entry, he);
 840
 841                 if (!cmp) {
 842                         he->count += count;
 843                         if (callchain) {
 844                                 append_chain(&he->callchain, chain, syms);
 845                                 free(syms);
 846                         }
 847                         return 0;
 848                 }
 849
 850                 if (cmp < 0)
 851                         p = &(*p)->rb_left;
 852                 else
 853                         p = &(*p)->rb_right;
 854         }
 855
 856         he = malloc(sizeof(*he));
 857         if (!he)
 858                 return -ENOMEM;
 859         *he = entry;
 860         if (callchain) {
 861                 callchain_init(&he->callchain);
 862                 append_chain(&he->callchain, chain, syms);
 863                 free(syms);
 864         }
 865         rb_link_node(&he->rb_node, parent, p);
 866         rb_insert_color(&he->rb_node, &hist);
 867
 868         return 0;
 869 }
 870
 871 static void hist_entry__free(struct hist_entry *he)
 872 {
 873         free(he);
 874 }
 875
 876 /*
 877  * collapse the histogram
 878  */
 879
 880 static struct rb_root collapse_hists;
 881
 882 static void collapse__insert_entry(struct hist_entry *he)
 883 {
 884         struct rb_node **p = &collapse_hists.rb_node;
 885         struct rb_node *parent = NULL;
 886         struct hist_entry *iter;
 887         int64_t cmp;
 888
 889         while (*p != NULL) {
 890                 parent = *p;
 891                 iter = rb_entry(parent, struct hist_entry, rb_node);
 892
 893                 cmp = hist_entry__collapse(iter, he);
 894
 895                 if (!cmp) {
 896                         iter->count += he->count;
 897                         hist_entry__free(he);
 898                         return;
 899                 }
 900
 901                 if (cmp < 0)
 902                         p = &(*p)->rb_left;
 903                 else
 904                         p = &(*p)->rb_right;
 905         }
 906
 907         rb_link_node(&he->rb_node, parent, p);
 908         rb_insert_color(&he->rb_node, &collapse_hists);
 909 }
 910
 911 static void collapse__resort(void)
 912 {
 913         struct rb_node *next;
 914         struct hist_entry *n;
 915
 916         if (!sort__need_collapse)
 917                 return;
 918
 919         next = rb_first(&hist);
 920         while (next) {
 921                 n = rb_entry(next, struct hist_entry, rb_node);
 922                 next = rb_next(&n->rb_node);
 923
 924                 rb_erase(&n->rb_node, &hist);
 925                 collapse__insert_entry(n);
 926         }
 927 }
 928
 929 /*
 930  * reverse the map, sort on count.
 931  */
 932
 933 static struct rb_root output_hists;
 934
 935 static void output__insert_entry(struct hist_entry *he, u64 min_callchain_hits)
 936 {
 937         struct rb_node **p = &output_hists.rb_node;
 938         struct rb_node *parent = NULL;
 939         struct hist_entry *iter;
 940
 941         if (callchain)
 942                 callchain_param.sort(&he->sorted_chain, &he->callchain,
 943                                       min_callchain_hits, &callchain_param);
 944
 945         while (*p != NULL) {
 946                 parent = *p;
 947                 iter = rb_entry(parent, struct hist_entry, rb_node);
 948
 949                 if (he->count > iter->count)
 950                         p = &(*p)->rb_left;
 951                 else
 952                         p = &(*p)->rb_right;
 953         }
 954
 955         rb_link_node(&he->rb_node, parent, p);
 956         rb_insert_color(&he->rb_node, &output_hists);
 957 }
 958
 959 static void output__resort(u64 total_samples)
 960 {
 961         struct rb_node *next;
 962         struct hist_entry *n;
 963         struct rb_root *tree = &hist;
 964         u64 min_callchain_hits;
 965
 966         min_callchain_hits = total_samples * (callchain_param.min_percent / 100);
 967
 968         if (sort__need_collapse)
 969                 tree = &collapse_hists;
 970
 971         next = rb_first(tree);
 972
 973         while (next) {
 974                 n = rb_entry(next, struct hist_entry, rb_node);
 975                 next = rb_next(&n->rb_node);
 976
 977                 rb_erase(&n->rb_node, tree);
 978                 output__insert_entry(n, min_callchain_hits);
 979         }
 980 }
 981
 982 static size_t output__fprintf(FILE *fp, u64 total_samples)
 983 {
 984         struct hist_entry *pos;
 985         struct sort_entry *se;
 986         struct rb_node *nd;
 987         size_t ret = 0;
 988         unsigned int width;
 989         char *col_width = col_width_list_str;
 990         int raw_printing_style;
 991
 992         raw_printing_style = !strcmp(pretty_printing_style, "raw");
 993
 994         init_rem_hits();
 995
 996         fprintf(fp, "# Samples: %Ld\n", (u64)total_samples);
 997         fprintf(fp, "#\n");
 998
 999         fprintf(fp, "# Overhead");
1000         if (show_nr_samples) {
1001                 if (field_sep)
1002                         fprintf(fp, "%cSamples", *field_sep);
1003                 else
1004                         fputs("  Samples  ", fp);
1005         }
1006         list_for_each_entry(se, &hist_entry__sort_list, list) {
1007                 if (se->elide)
1008                         continue;
1009                 if (field_sep) {
1010                         fprintf(fp, "%c%s", *field_sep, se->header);
1011                         continue;
1012                 }
1013                 width = strlen(se->header);
1014                 if (se->width) {
1015                         if (col_width_list_str) {
1016                                 if (col_width) {
1017                                         *se->width = atoi(col_width);
1018                                         col_width = strchr(col_width, ',');
1019                                         if (col_width)
1020                                                 ++col_width;
1021                                 }
1022                         }
1023                         width = *se->width = max(*se->width, width);
1024                 }
1025                 fprintf(fp, "  %*s", width, se->header);
1026         }
1027         fprintf(fp, "\n");
1028
1029         if (field_sep)
1030                 goto print_entries;
1031
1032         fprintf(fp, "# ........");
1033         if (show_nr_samples)
1034                 fprintf(fp, " ..........");
1035         list_for_each_entry(se, &hist_entry__sort_list, list) {
1036                 unsigned int i;
1037
1038                 if (se->elide)
1039                         continue;
1040
1041                 fprintf(fp, "  ");
1042                 if (se->width)
1043                         width = *se->width;
1044                 else
1045                         width = strlen(se->header);
1046                 for (i = 0; i < width; i++)
1047                         fprintf(fp, ".");
1048         }
1049         fprintf(fp, "\n");
1050
1051         fprintf(fp, "#\n");
1052
1053 print_entries:
1054         for (nd = rb_first(&output_hists); nd; nd = rb_next(nd)) {
1055                 pos = rb_entry(nd, struct hist_entry, rb_node);
1056                 ret += hist_entry__fprintf(fp, pos, total_samples);
1057         }
1058
1059         if (sort_order == default_sort_order &&
1060                         parent_pattern == default_parent_pattern) {
1061                 fprintf(fp, "#\n");
1062                 fprintf(fp, "# (For a higher level overview, try: perf report --sort comm,dso)\n");
1063                 fprintf(fp, "#\n");
1064         }
1065         fprintf(fp, "\n");
1066
1067         free(rem_sq_bracket);
1068
1069         if (show_threads)
1070                 perf_read_values_display(fp, &show_threads_values,
1071                                          raw_printing_style);
1072
1073         return ret;
1074 }
1075
1076 static void register_idle_thread(void)
1077 {
1078         struct thread *thread = threads__findnew(0, &threads, &last_match);
1079
1080         if (thread == NULL ||
1081                         thread__set_comm_adjust(thread, "[idle]")) {
1082                 fprintf(stderr, "problem inserting idle task.\n");
1083                 exit(-1);
1084         }
1085 }
1086
1087 static unsigned long total = 0,
1088                      total_mmap = 0,
1089                      total_comm = 0,
1090                      total_fork = 0,
1091                      total_unknown = 0,
1092                      total_lost = 0;
1093
1094 static int validate_chain(struct ip_callchain *chain, event_t *event)
1095 {
1096         unsigned int chain_size;
1097
1098         chain_size = event->header.size;
1099         chain_size -= (unsigned long)&event->ip.__more_data - (unsigned long)event;
1100
1101         if (chain->nr*sizeof(u64) > chain_size)
1102                 return -1;
1103
1104         return 0;
1105 }
1106
1107 static int
1108 process_sample_event(event_t *event, unsigned long offset, unsigned long head)
1109 {
1110         char level;
1111         int show = 0;
1112         struct dso *dso = NULL;
1113         struct thread *thread;
1114         u64 ip = event->ip.ip;
1115         u64 period = 1;
1116         struct map *map = NULL;
1117         void *more_data = event->ip.__more_data;
1118         struct ip_callchain *chain = NULL;
1119         int cpumode;
1120
1121         thread = threads__findnew(event->ip.pid, &threads, &last_match);
1122
1123         if (sample_type & PERF_SAMPLE_PERIOD) {
1124                 period = *(u64 *)more_data;
1125                 more_data += sizeof(u64);
1126         }
1127
1128         dump_printf("%p [%p]: PERF_EVENT_SAMPLE (IP, %d): %d/%d: %p period: %Ld\n",
1129                 (void *)(offset + head),
1130                 (void *)(long)(event->header.size),
1131                 event->header.misc,
1132                 event->ip.pid, event->ip.tid,
1133                 (void *)(long)ip,
1134                 (long long)period);
1135
1136         if (sample_type & PERF_SAMPLE_CALLCHAIN) {
1137                 unsigned int i;
1138
1139                 chain = (void *)more_data;
1140
1141                 dump_printf("... chain: nr:%Lu\n", chain->nr);
1142
1143                 if (validate_chain(chain, event) < 0) {
1144                         eprintf("call-chain problem with event, skipping it.\n");
1145                         return 0;
1146                 }
1147
1148                 if (dump_trace) {
1149                         for (i = 0; i < chain->nr; i++)
1150                                 dump_printf("..... %2d: %016Lx\n", i, chain->ips[i]);
1151                 }
1152         }
1153
1154         dump_printf(" ... thread: %s:%d\n", thread->comm, thread->pid);
1155
1156         if (thread == NULL) {
1157                 eprintf("problem processing %d event, skipping it.\n",
1158                         event->header.type);
1159                 return -1;
1160         }
1161
1162         if (comm_list && !strlist__has_entry(comm_list, thread->comm))
1163                 return 0;
1164
1165         cpumode = event->header.misc & PERF_EVENT_MISC_CPUMODE_MASK;
1166
1167         if (cpumode == PERF_EVENT_MISC_KERNEL) {
1168                 show = SHOW_KERNEL;
1169                 level = 'k';
1170
1171                 dso = kernel_dso;
1172
1173                 dump_printf(" ...... dso: %s\n", dso->name);
1174
1175         } else if (cpumode == PERF_EVENT_MISC_USER) {
1176
1177                 show = SHOW_USER;
1178                 level = '.';
1179
1180         } else {
1181                 show = SHOW_HV;
1182                 level = 'H';
1183
1184                 dso = hypervisor_dso;
1185
1186                 dump_printf(" ...... dso: [hypervisor]\n");
1187         }
1188
1189         if (show & show_mask) {
1190                 struct symbol *sym = resolve_symbol(thread, &map, &dso, &ip);
1191
1192                 if (dso_list && (!dso || !dso->name ||
1193                                  !strlist__has_entry(dso_list, dso->name)))
1194                         return 0;
1195
1196                 if (sym_list && (!sym || !strlist__has_entry(sym_list, sym->name)))
1197                         return 0;
1198
1199                 if (hist_entry__add(thread, map, dso, sym, ip, chain, level, period)) {
1200                         eprintf("problem incrementing symbol count, skipping event\n");
1201                         return -1;
1202                 }
1203         }
1204         total += period;
1205
1206         return 0;
1207 }
1208
1209 static int
1210 process_mmap_event(event_t *event, unsigned long offset, unsigned long head)
1211 {
1212         struct thread *thread;
1213         struct map *map = map__new(&event->mmap, cwd, cwdlen);
1214
1215         thread = threads__findnew(event->mmap.pid, &threads, &last_match);
1216
1217         dump_printf("%p [%p]: PERF_EVENT_MMAP %d/%d: [%p(%p) @ %p]: %s\n",
1218                 (void *)(offset + head),
1219                 (void *)(long)(event->header.size),
1220                 event->mmap.pid,
1221                 event->mmap.tid,
1222                 (void *)(long)event->mmap.start,
1223                 (void *)(long)event->mmap.len,
1224                 (void *)(long)event->mmap.pgoff,
1225                 event->mmap.filename);
1226
1227         if (thread == NULL || map == NULL) {
1228                 dump_printf("problem processing PERF_EVENT_MMAP, skipping event.\n");
1229                 return 0;
1230         }
1231
1232         thread__insert_map(thread, map);
1233         total_mmap++;
1234
1235         return 0;
1236 }
1237
1238 static int
1239 process_comm_event(event_t *event, unsigned long offset, unsigned long head)
1240 {
1241         struct thread *thread;
1242
1243         thread = threads__findnew(event->comm.pid, &threads, &last_match);
1244
1245         dump_printf("%p [%p]: PERF_EVENT_COMM: %s:%d\n",
1246                 (void *)(offset + head),
1247                 (void *)(long)(event->header.size),
1248                 event->comm.comm, event->comm.pid);
1249
1250         if (thread == NULL ||
1251             thread__set_comm_adjust(thread, event->comm.comm)) {
1252                 dump_printf("problem processing PERF_EVENT_COMM, skipping event.\n");
1253                 return -1;
1254         }
1255         total_comm++;
1256
1257         return 0;
1258 }
1259
1260 static int
1261 process_task_event(event_t *event, unsigned long offset, unsigned long head)
1262 {
1263         struct thread *thread;
1264         struct thread *parent;
1265
1266         thread = threads__findnew(event->fork.pid, &threads, &last_match);
1267         parent = threads__findnew(event->fork.ppid, &threads, &last_match);
1268
1269         dump_printf("%p [%p]: PERF_EVENT_%s: (%d:%d):(%d:%d)\n",
1270                 (void *)(offset + head),
1271                 (void *)(long)(event->header.size),
1272                 event->header.type == PERF_EVENT_FORK ? "FORK" : "EXIT",
1273                 event->fork.pid, event->fork.tid,
1274                 event->fork.ppid, event->fork.ptid);
1275
1276         /*
1277          * A thread clone will have the same PID for both
1278          * parent and child.
1279          */
1280         if (thread == parent)
1281                 return 0;
1282
1283         if (event->header.type == PERF_EVENT_EXIT)
1284                 return 0;
1285
1286         if (!thread || !parent || thread__fork(thread, parent)) {
1287                 dump_printf("problem processing PERF_EVENT_FORK, skipping event.\n");
1288                 return -1;
1289         }
1290         total_fork++;
1291
1292         return 0;
1293 }
1294
1295 static int
1296 process_lost_event(event_t *event, unsigned long offset, unsigned long head)
1297 {
1298         dump_printf("%p [%p]: PERF_EVENT_LOST: id:%Ld: lost:%Ld\n",
1299                 (void *)(offset + head),
1300                 (void *)(long)(event->header.size),
1301                 event->lost.id,
1302                 event->lost.lost);
1303
1304         total_lost += event->lost.lost;
1305
1306         return 0;
1307 }
1308
1309 static int
1310 process_read_event(event_t *event, unsigned long offset, unsigned long head)
1311 {
1312         struct perf_counter_attr *attr;
1313
1314         attr = perf_header__find_attr(event->read.id, header);
1315
1316         if (show_threads) {
1317                 const char *name = attr ? __event_name(attr->type, attr->config)
1318                                    : "unknown";
1319                 perf_read_values_add_value(&show_threads_values,
1320                                            event->read.pid, event->read.tid,
1321                                            event->read.id,
1322                                            name,
1323                                            event->read.value);
1324         }
1325
1326         dump_printf("%p [%p]: PERF_EVENT_READ: %d %d %s %Lu\n",
1327                         (void *)(offset + head),
1328                         (void *)(long)(event->header.size),
1329                         event->read.pid,
1330                         event->read.tid,
1331                         attr ? __event_name(attr->type, attr->config)
1332                              : "FAIL",
1333                         event->read.value);
1334
1335         return 0;
1336 }
1337
1338 static int
1339 process_event(event_t *event, unsigned long offset, unsigned long head)
1340 {
1341         trace_event(event);
1342
1343         switch (event->header.type) {
1344         case PERF_EVENT_SAMPLE:
1345                 return process_sample_event(event, offset, head);
1346
1347         case PERF_EVENT_MMAP:
1348                 return process_mmap_event(event, offset, head);
1349
1350         case PERF_EVENT_COMM:
1351                 return process_comm_event(event, offset, head);
1352
1353         case PERF_EVENT_FORK:
1354         case PERF_EVENT_EXIT:
1355                 return process_task_event(event, offset, head);
1356
1357         case PERF_EVENT_LOST:
1358                 return process_lost_event(event, offset, head);
1359
1360         case PERF_EVENT_READ:
1361                 return process_read_event(event, offset, head);
1362
1363         /*
1364          * We dont process them right now but they are fine:
1365          */
1366
1367         case PERF_EVENT_THROTTLE:
1368         case PERF_EVENT_UNTHROTTLE:
1369                 return 0;
1370
1371         default:
1372                 return -1;
1373         }
1374
1375         return 0;
1376 }
1377
1378 static int __cmd_report(void)
1379 {
1380         int ret, rc = EXIT_FAILURE;
1381         unsigned long offset = 0;
1382         unsigned long head, shift;
1383         struct stat input_stat;
1384         event_t *event;
1385         uint32_t size;
1386         char *buf;
1387
1388         register_idle_thread();
1389
1390         if (show_threads)
1391                 perf_read_values_init(&show_threads_values);
1392
1393         input = open(input_name, O_RDONLY);
1394         if (input < 0) {
1395                 fprintf(stderr, " failed to open file: %s", input_name);
1396                 if (!strcmp(input_name, "perf.data"))
1397                         fprintf(stderr, "  (try 'perf record' first)");
1398                 fprintf(stderr, "\n");
1399                 exit(-1);
1400         }
1401
1402         ret = fstat(input, &input_stat);
1403         if (ret < 0) {
1404                 perror("failed to stat file");
1405                 exit(-1);
1406         }
1407
1408         if (!force && (input_stat.st_uid != geteuid())) {
1409                 fprintf(stderr, "file: %s not owned by current user\n", input_name);
1410                 exit(-1);
1411         }
1412
1413         if (!input_stat.st_size) {
1414                 fprintf(stderr, "zero-sized file, nothing to do!\n");
1415                 exit(0);
1416         }
1417
1418         header = perf_header__read(input);
1419         head = header->data_offset;
1420
1421         sample_type = perf_header__sample_type(header);
1422
1423         if (!(sample_type & PERF_SAMPLE_CALLCHAIN)) {
1424                 if (sort__has_parent) {
1425                         fprintf(stderr, "selected --sort parent, but no"
1426                                         " callchain data. Did you call"
1427                                         " perf record without -g?\n");
1428                         exit(-1);
1429                 }
1430                 if (callchain) {
1431                         fprintf(stderr, "selected -c but no callchain data."
1432                                         " Did you call perf record without"
1433                                         " -g?\n");
1434                         exit(-1);
1435                 }
1436         } else if (callchain_param.mode != CHAIN_NONE && !callchain) {
1437                         callchain = 1;
1438                         if (register_callchain_param(&callchain_param) < 0) {
1439                                 fprintf(stderr, "Can't register callchain"
1440                                                 " params\n");
1441                                 exit(-1);
1442                         }
1443         }
1444
1445         if (load_kernel() < 0) {
1446                 perror("failed to load kernel symbols");
1447                 return EXIT_FAILURE;
1448         }
1449
1450         if (!full_paths) {
1451                 if (getcwd(__cwd, sizeof(__cwd)) == NULL) {
1452                         perror("failed to get the current directory");
1453                         return EXIT_FAILURE;
1454                 }
1455                 cwdlen = strlen(cwd);
1456         } else {
1457                 cwd = NULL;
1458                 cwdlen = 0;
1459         }
1460
1461         shift = page_size * (head / page_size);
1462         offset += shift;
1463         head -= shift;
1464
1465 remap:
1466         buf = (char *)mmap(NULL, page_size * mmap_window, PROT_READ,
1467                            MAP_SHARED, input, offset);
1468         if (buf == MAP_FAILED) {
1469                 perror("failed to mmap file");
1470                 exit(-1);
1471         }
1472
1473 more:
1474         event = (event_t *)(buf + head);
1475
1476         size = event->header.size;
1477         if (!size)
1478                 size = 8;
1479
1480         if (head + event->header.size >= page_size * mmap_window) {
1481                 int munmap_ret;
1482
1483                 shift = page_size * (head / page_size);
1484
1485                 munmap_ret = munmap(buf, page_size * mmap_window);
1486                 assert(munmap_ret == 0);
1487
1488                 offset += shift;
1489                 head -= shift;
1490                 goto remap;
1491         }
1492
1493         size = event->header.size;
1494
1495         dump_printf("\n%p [%p]: event: %d\n",
1496                         (void *)(offset + head),
1497                         (void *)(long)event->header.size,
1498                         event->header.type);
1499
1500         if (!size || process_event(event, offset, head) < 0) {
1501
1502                 dump_printf("%p [%p]: skipping unknown header type: %d\n",
1503                         (void *)(offset + head),
1504                         (void *)(long)(event->header.size),
1505                         event->header.type);
1506
1507                 total_unknown++;
1508
1509                 /*
1510                  * assume we lost track of the stream, check alignment, and
1511                  * increment a single u64 in the hope to catch on again 'soon'.
1512                  */
1513
1514                 if (unlikely(head & 7))
1515                         head &= ~7ULL;
1516
1517                 size = 8;
1518         }
1519
1520         head += size;
1521
1522         if (offset + head >= header->data_offset + header->data_size)
1523                 goto done;
1524
1525         if (offset + head < (unsigned long)input_stat.st_size)
1526                 goto more;
1527
1528 done:
1529         rc = EXIT_SUCCESS;
1530         close(input);
1531
1532         dump_printf("      IP events: %10ld\n", total);
1533         dump_printf("    mmap events: %10ld\n", total_mmap);
1534         dump_printf("    comm events: %10ld\n", total_comm);
1535         dump_printf("    fork events: %10ld\n", total_fork);
1536         dump_printf("    lost events: %10ld\n", total_lost);
1537         dump_printf(" unknown events: %10ld\n", total_unknown);
1538
1539         if (dump_trace)
1540                 return 0;
1541
1542         if (verbose >= 3)
1543                 threads__fprintf(stdout, &threads);
1544
1545         if (verbose >= 2)
1546                 dsos__fprintf(stdout);
1547
1548         collapse__resort();
1549         output__resort(total);
1550         output__fprintf(stdout, total);
1551
1552         if (show_threads)
1553                 perf_read_values_destroy(&show_threads_values);
1554
1555         return rc;
1556 }
1557
1558 static int
1559 parse_callchain_opt(const struct option *opt __used, const char *arg,
1560                     int unset __used)
1561 {
1562         char *tok;
1563         char *endptr;
1564
1565         callchain = 1;
1566
1567         if (!arg)
1568                 return 0;
1569
1570         tok = strtok((char *)arg, ",");
1571         if (!tok)
1572                 return -1;
1573
1574         /* get the output mode */
1575         if (!strncmp(tok, "graph", strlen(arg)))
1576                 callchain_param.mode = CHAIN_GRAPH_ABS;
1577
1578         else if (!strncmp(tok, "flat", strlen(arg)))
1579                 callchain_param.mode = CHAIN_FLAT;
1580
1581         else if (!strncmp(tok, "fractal", strlen(arg)))
1582                 callchain_param.mode = CHAIN_GRAPH_REL;
1583
1584         else if (!strncmp(tok, "none", strlen(arg))) {
1585                 callchain_param.mode = CHAIN_NONE;
1586                 callchain = 0;
1587
1588                 return 0;
1589         }
1590
1591         else
1592                 return -1;
1593
1594         /* get the min percentage */
1595         tok = strtok(NULL, ",");
1596         if (!tok)
1597                 goto setup;
1598
1599         callchain_param.min_percent = strtod(tok, &endptr);
1600         if (tok == endptr)
1601                 return -1;
1602
1603 setup:
1604         if (register_callchain_param(&callchain_param) < 0) {
1605                 fprintf(stderr, "Can't register callchain params\n");
1606                 return -1;
1607         }
1608         return 0;
1609 }
1610
1611 static const char * const report_usage[] = {
1612         "perf report [<options>] <command>",
1613         NULL
1614 };
1615
1616 static const struct option options[] = {
1617         OPT_STRING('i', "input", &input_name, "file",
1618                     "input file name"),
1619         OPT_BOOLEAN('v', "verbose", &verbose,
1620                     "be more verbose (show symbol address, etc)"),
1621         OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace,
1622                     "dump raw trace in ASCII"),
1623         OPT_STRING('k', "vmlinux", &vmlinux_name, "file", "vmlinux pathname"),
1624         OPT_BOOLEAN('f', "force", &force, "don't complain, do it"),
1625         OPT_BOOLEAN('m', "modules", &modules,
1626                     "load module symbols - WARNING: use only with -k and LIVE kernel"),
1627         OPT_BOOLEAN('n', "show-nr-samples", &show_nr_samples,
1628                     "Show a column with the number of samples"),
1629         OPT_BOOLEAN('T', "threads", &show_threads,
1630                     "Show per-thread event counters"),
1631         OPT_STRING(0, "pretty", &pretty_printing_style, "key",
1632                    "pretty printing style key: normal raw"),
1633         OPT_STRING('s', "sort", &sort_order, "key[,key2...]",
1634                    "sort by key(s): pid, comm, dso, symbol, parent"),
1635         OPT_BOOLEAN('P', "full-paths", &full_paths,
1636                     "Don't shorten the pathnames taking into account the cwd"),
1637         OPT_STRING('p', "parent", &parent_pattern, "regex",
1638                    "regex filter to identify parent, see: '--sort parent'"),
1639         OPT_BOOLEAN('x', "exclude-other", &exclude_other,
1640                     "Only display entries with parent-match"),
1641         OPT_CALLBACK_DEFAULT('g', "call-graph", NULL, "output_type,min_percent",
1642                      "Display callchains using output_type and min percent threshold. "
1643                      "Default: fractal,0.5", &parse_callchain_opt, callchain_default_opt),
1644         OPT_STRING('d', "dsos", &dso_list_str, "dso[,dso...]",
1645                    "only consider symbols in these dsos"),
1646         OPT_STRING('C', "comms", &comm_list_str, "comm[,comm...]",
1647                    "only consider symbols in these comms"),
1648         OPT_STRING('S', "symbols", &sym_list_str, "symbol[,symbol...]",
1649                    "only consider these symbols"),
1650         OPT_STRING('w', "column-widths", &col_width_list_str,
1651                    "width[,width...]",
1652                    "don't try to adjust column width, use these fixed values"),
1653         OPT_STRING('t', "field-separator", &field_sep, "separator",
1654                    "separator for columns, no spaces will be added between "
1655                    "columns '.' is reserved."),
1656         OPT_END()
1657 };
1658
1659 static void setup_sorting(void)
1660 {
1661         char *tmp, *tok, *str = strdup(sort_order);
1662
1663         for (tok = strtok_r(str, ", ", &tmp);
1664                         tok; tok = strtok_r(NULL, ", ", &tmp)) {
1665                 if (sort_dimension__add(tok) < 0) {
1666                         error("Unknown --sort key: `%s'", tok);
1667                         usage_with_options(report_usage, options);
1668                 }
1669         }
1670
1671         free(str);
1672 }
1673
1674 static void setup_list(struct strlist **list, const char *list_str,
1675                        struct sort_entry *se, const char *list_name,
1676                        FILE *fp)
1677 {
1678         if (list_str) {
1679                 *list = strlist__new(true, list_str);
1680                 if (!*list) {
1681                         fprintf(stderr, "problems parsing %s list\n",
1682                                 list_name);
1683                         exit(129);
1684                 }
1685                 if (strlist__nr_entries(*list) == 1) {
1686                         fprintf(fp, "# %s: %s\n", list_name,
1687                                 strlist__entry(*list, 0)->s);
1688                         se->elide = true;
1689                 }
1690         }
1691 }
1692
1693 int cmd_report(int argc, const char **argv, const char *prefix __used)
1694 {
1695         symbol__init();
1696
1697         page_size = getpagesize();
1698
1699         argc = parse_options(argc, argv, options, report_usage, 0);
1700
1701         setup_sorting();
1702
1703         if (parent_pattern != default_parent_pattern) {
1704                 sort_dimension__add("parent");
1705                 sort_parent.elide = 1;
1706         } else
1707                 exclude_other = 0;
1708
1709         /*
1710          * Any (unrecognized) arguments left?
1711          */
1712         if (argc)
1713                 usage_with_options(report_usage, options);
1714
1715         setup_pager();
1716
1717         setup_list(&dso_list, dso_list_str, &sort_dso, "dso", stdout);
1718         setup_list(&comm_list, comm_list_str, &sort_comm, "comm", stdout);
1719         setup_list(&sym_list, sym_list_str, &sort_sym, "symbol", stdout);
1720
1721         if (field_sep && *field_sep == '.') {
1722                 fputs("'.' is the only non valid --field-separator argument\n",
1723                       stderr);
1724                 exit(129);
1725         }
1726
1727         return __cmd_report();
1728 }