tools/perf/util/hist.c

   1 #include "util.h"
   2 #include "build-id.h"
   3 #include "hist.h"
   4 #include "session.h"
   5 #include "sort.h"
   6 #include "evsel.h"
   7 #include <math.h>
   8
   9 static bool hists__filter_entry_by_dso(struct hists *hists,
  10                                        struct hist_entry *he);
  11 static bool hists__filter_entry_by_thread(struct hists *hists,
  12                                           struct hist_entry *he);
  13 static bool hists__filter_entry_by_symbol(struct hists *hists,
  14                                           struct hist_entry *he);
  15
  16 struct callchain_param  callchain_param = {
  17         .mode   = CHAIN_GRAPH_REL,
  18         .min_percent = 0.5,
  19         .order  = ORDER_CALLEE,
  20         .key    = CCKEY_FUNCTION
  21 };
  22
  23 u16 hists__col_len(struct hists *hists, enum hist_column col)
  24 {
  25         return hists->col_len[col];
  26 }
  27
  28 void hists__set_col_len(struct hists *hists, enum hist_column col, u16 len)
  29 {
  30         hists->col_len[col] = len;
  31 }
  32
  33 bool hists__new_col_len(struct hists *hists, enum hist_column col, u16 len)
  34 {
  35         if (len > hists__col_len(hists, col)) {
  36                 hists__set_col_len(hists, col, len);
  37                 return true;
  38         }
  39         return false;
  40 }
  41
  42 void hists__reset_col_len(struct hists *hists)
  43 {
  44         enum hist_column col;
  45
  46         for (col = 0; col < HISTC_NR_COLS; ++col)
  47                 hists__set_col_len(hists, col, 0);
  48 }
  49
  50 static void hists__set_unres_dso_col_len(struct hists *hists, int dso)
  51 {
  52         const unsigned int unresolved_col_width = BITS_PER_LONG / 4;
  53
  54         if (hists__col_len(hists, dso) < unresolved_col_width &&
  55             !symbol_conf.col_width_list_str && !symbol_conf.field_sep &&
  56             !symbol_conf.dso_list)
  57                 hists__set_col_len(hists, dso, unresolved_col_width);
  58 }
  59
  60 void hists__calc_col_len(struct hists *hists, struct hist_entry *h)
  61 {
  62         const unsigned int unresolved_col_width = BITS_PER_LONG / 4;
  63         int symlen;
  64         u16 len;
  65
  66         /*
  67          * +4 accounts for '[x] ' priv level info
  68          * +2 accounts for 0x prefix on raw addresses
  69          * +3 accounts for ' y ' symtab origin info
  70          */
  71         if (h->ms.sym) {
  72                 symlen = h->ms.sym->namelen + 4;
  73                 if (verbose)
  74                         symlen += BITS_PER_LONG / 4 + 2 + 3;
  75                 hists__new_col_len(hists, HISTC_SYMBOL, symlen);
  76         } else {
  77                 symlen = unresolved_col_width + 4 + 2;
  78                 hists__new_col_len(hists, HISTC_SYMBOL, symlen);
  79                 hists__set_unres_dso_col_len(hists, HISTC_DSO);
  80         }
  81
  82         len = thread__comm_len(h->thread);
  83         if (hists__new_col_len(hists, HISTC_COMM, len))
  84                 hists__set_col_len(hists, HISTC_THREAD, len + 6);
  85
  86         if (h->ms.map) {
  87                 len = dso__name_len(h->ms.map->dso);
  88                 hists__new_col_len(hists, HISTC_DSO, len);
  89         }
  90
  91         if (h->parent)
  92                 hists__new_col_len(hists, HISTC_PARENT, h->parent->namelen);
  93
  94         if (h->branch_info) {
  95                 if (h->branch_info->from.sym) {
  96                         symlen = (int)h->branch_info->from.sym->namelen + 4;
  97                         if (verbose)
  98                                 symlen += BITS_PER_LONG / 4 + 2 + 3;
  99                         hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen);
 100
 101                         symlen = dso__name_len(h->branch_info->from.map->dso);
 102                         hists__new_col_len(hists, HISTC_DSO_FROM, symlen);
 103                 } else {
 104                         symlen = unresolved_col_width + 4 + 2;
 105                         hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen);
 106                         hists__set_unres_dso_col_len(hists, HISTC_DSO_FROM);
 107                 }
 108
 109                 if (h->branch_info->to.sym) {
 110                         symlen = (int)h->branch_info->to.sym->namelen + 4;
 111                         if (verbose)
 112                                 symlen += BITS_PER_LONG / 4 + 2 + 3;
 113                         hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen);
 114
 115                         symlen = dso__name_len(h->branch_info->to.map->dso);
 116                         hists__new_col_len(hists, HISTC_DSO_TO, symlen);
 117                 } else {
 118                         symlen = unresolved_col_width + 4 + 2;
 119                         hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen);
 120                         hists__set_unres_dso_col_len(hists, HISTC_DSO_TO);
 121                 }
 122         }
 123
 124         if (h->mem_info) {
 125                 if (h->mem_info->daddr.sym) {
 126                         symlen = (int)h->mem_info->daddr.sym->namelen + 4
 127                                + unresolved_col_width + 2;
 128                         hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL,
 129                                            symlen);
 130                 } else {
 131                         symlen = unresolved_col_width + 4 + 2;
 132                         hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL,
 133                                            symlen);
 134                 }
 135                 if (h->mem_info->daddr.map) {
 136                         symlen = dso__name_len(h->mem_info->daddr.map->dso);
 137                         hists__new_col_len(hists, HISTC_MEM_DADDR_DSO,
 138                                            symlen);
 139                 } else {
 140                         symlen = unresolved_col_width + 4 + 2;
 141                         hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO);
 142                 }
 143         } else {
 144                 symlen = unresolved_col_width + 4 + 2;
 145                 hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL, symlen);
 146                 hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO);
 147         }
 148
 149         hists__new_col_len(hists, HISTC_MEM_LOCKED, 6);
 150         hists__new_col_len(hists, HISTC_MEM_TLB, 22);
 151         hists__new_col_len(hists, HISTC_MEM_SNOOP, 12);
 152         hists__new_col_len(hists, HISTC_MEM_LVL, 21 + 3);
 153         hists__new_col_len(hists, HISTC_LOCAL_WEIGHT, 12);
 154         hists__new_col_len(hists, HISTC_GLOBAL_WEIGHT, 12);
 155
 156         if (h->transaction)
 157                 hists__new_col_len(hists, HISTC_TRANSACTION,
 158                                    hist_entry__transaction_len());
 159 }
 160
 161 void hists__output_recalc_col_len(struct hists *hists, int max_rows)
 162 {
 163         struct rb_node *next = rb_first(&hists->entries);
 164         struct hist_entry *n;
 165         int row = 0;
 166
 167         hists__reset_col_len(hists);
 168
 169         while (next && row++ < max_rows) {
 170                 n = rb_entry(next, struct hist_entry, rb_node);
 171                 if (!n->filtered)
 172                         hists__calc_col_len(hists, n);
 173                 next = rb_next(&n->rb_node);
 174         }
 175 }
 176
 177 static void he_stat__add_cpumode_period(struct he_stat *he_stat,
 178                                         unsigned int cpumode, u64 period)
 179 {
 180         switch (cpumode) {
 181         case PERF_RECORD_MISC_KERNEL:
 182                 he_stat->period_sys += period;
 183                 break;
 184         case PERF_RECORD_MISC_USER:
 185                 he_stat->period_us += period;
 186                 break;
 187         case PERF_RECORD_MISC_GUEST_KERNEL:
 188                 he_stat->period_guest_sys += period;
 189                 break;
 190         case PERF_RECORD_MISC_GUEST_USER:
 191                 he_stat->period_guest_us += period;
 192                 break;
 193         default:
 194                 break;
 195         }
 196 }
 197
 198 static void he_stat__add_period(struct he_stat *he_stat, u64 period,
 199                                 u64 weight)
 200 {
 201
 202         he_stat->period         += period;
 203         he_stat->weight         += weight;
 204         he_stat->nr_events      += 1;
 205 }
 206
 207 static void he_stat__add_stat(struct he_stat *dest, struct he_stat *src)
 208 {
 209         dest->period            += src->period;
 210         dest->period_sys        += src->period_sys;
 211         dest->period_us         += src->period_us;
 212         dest->period_guest_sys  += src->period_guest_sys;
 213         dest->period_guest_us   += src->period_guest_us;
 214         dest->nr_events         += src->nr_events;
 215         dest->weight            += src->weight;
 216 }
 217
 218 static void he_stat__decay(struct he_stat *he_stat)
 219 {
 220         he_stat->period = (he_stat->period * 7) / 8;
 221         he_stat->nr_events = (he_stat->nr_events * 7) / 8;
 222         /* XXX need decay for weight too? */
 223 }
 224
 225 static bool hists__decay_entry(struct hists *hists, struct hist_entry *he)
 226 {
 227         u64 prev_period = he->stat.period;
 228
 229         if (prev_period == 0)
 230                 return true;
 231
 232         he_stat__decay(&he->stat);
 233
 234         if (!he->filtered)
 235                 hists->stats.total_period -= prev_period - he->stat.period;
 236
 237         return he->stat.period == 0;
 238 }
 239
 240 void hists__decay_entries(struct hists *hists, bool zap_user, bool zap_kernel)
 241 {
 242         struct rb_node *next = rb_first(&hists->entries);
 243         struct hist_entry *n;
 244
 245         while (next) {
 246                 n = rb_entry(next, struct hist_entry, rb_node);
 247                 next = rb_next(&n->rb_node);
 248                 /*
 249                  * We may be annotating this, for instance, so keep it here in
 250                  * case some it gets new samples, we'll eventually free it when
 251                  * the user stops browsing and it agains gets fully decayed.
 252                  */
 253                 if (((zap_user && n->level == '.') ||
 254                      (zap_kernel && n->level != '.') ||
 255                      hists__decay_entry(hists, n)) &&
 256                     !n->used) {
 257                         rb_erase(&n->rb_node, &hists->entries);
 258
 259                         if (sort__need_collapse)
 260                                 rb_erase(&n->rb_node_in, &hists->entries_collapsed);
 261
 262                         hist_entry__free(n);
 263                         --hists->nr_entries;
 264                 }
 265         }
 266 }
 267
 268 /*
 269  * histogram, sorted on item, collects periods
 270  */
 271
 272 static struct hist_entry *hist_entry__new(struct hist_entry *template)
 273 {
 274         size_t callchain_size = symbol_conf.use_callchain ? sizeof(struct callchain_root) : 0;
 275         struct hist_entry *he = zalloc(sizeof(*he) + callchain_size);
 276
 277         if (he != NULL) {
 278                 *he = *template;
 279
 280                 if (he->ms.map)
 281                         he->ms.map->referenced = true;
 282
 283                 if (he->branch_info) {
 284                         /*
 285                          * This branch info is (a part of) allocated from
 286                          * sample__resolve_bstack() and will be freed after
 287                          * adding new entries.  So we need to save a copy.
 288                          */
 289                         he->branch_info = malloc(sizeof(*he->branch_info));
 290                         if (he->branch_info == NULL) {
 291                                 free(he);
 292                                 return NULL;
 293                         }
 294
 295                         memcpy(he->branch_info, template->branch_info,
 296                                sizeof(*he->branch_info));
 297
 298                         if (he->branch_info->from.map)
 299                                 he->branch_info->from.map->referenced = true;
 300                         if (he->branch_info->to.map)
 301                                 he->branch_info->to.map->referenced = true;
 302                 }
 303
 304                 if (he->mem_info) {
 305                         if (he->mem_info->iaddr.map)
 306                                 he->mem_info->iaddr.map->referenced = true;
 307                         if (he->mem_info->daddr.map)
 308                                 he->mem_info->daddr.map->referenced = true;
 309                 }
 310
 311                 if (symbol_conf.use_callchain)
 312                         callchain_init(he->callchain);
 313
 314                 INIT_LIST_HEAD(&he->pairs.node);
 315         }
 316
 317         return he;
 318 }
 319
 320 void hists__inc_nr_entries(struct hists *hists, struct hist_entry *h)
 321 {
 322         if (!h->filtered) {
 323                 hists__calc_col_len(hists, h);
 324                 hists->nr_non_filtered_entries++;
 325                 hists->stats.total_non_filtered_period += h->stat.period;
 326         }
 327         hists->nr_entries++;
 328         hists->stats.total_period += h->stat.period;
 329 }
 330
 331 static u8 symbol__parent_filter(const struct symbol *parent)
 332 {
 333         if (symbol_conf.exclude_other && parent == NULL)
 334                 return 1 << HIST_FILTER__PARENT;
 335         return 0;
 336 }
 337
 338 static struct hist_entry *add_hist_entry(struct hists *hists,
 339                                          struct hist_entry *entry,
 340                                          struct addr_location *al)
 341 {
 342         struct rb_node **p;
 343         struct rb_node *parent = NULL;
 344         struct hist_entry *he;
 345         int64_t cmp;
 346         u64 period = entry->stat.period;
 347         u64 weight = entry->stat.weight;
 348
 349         p = &hists->entries_in->rb_node;
 350
 351         while (*p != NULL) {
 352                 parent = *p;
 353                 he = rb_entry(parent, struct hist_entry, rb_node_in);
 354
 355                 /*
 356                  * Make sure that it receives arguments in a same order as
 357                  * hist_entry__collapse() so that we can use an appropriate
 358                  * function when searching an entry regardless which sort
 359                  * keys were used.
 360                  */
 361                 cmp = hist_entry__cmp(he, entry);
 362
 363                 if (!cmp) {
 364                         he_stat__add_period(&he->stat, period, weight);
 365
 366                         /*
 367                          * This mem info was allocated from sample__resolve_mem
 368                          * and will not be used anymore.
 369                          */
 370                         zfree(&entry->mem_info);
 371
 372                         /* If the map of an existing hist_entry has
 373                          * become out-of-date due to an exec() or
 374                          * similar, update it.  Otherwise we will
 375                          * mis-adjust symbol addresses when computing
 376                          * the history counter to increment.
 377                          */
 378                         if (he->ms.map != entry->ms.map) {
 379                                 he->ms.map = entry->ms.map;
 380                                 if (he->ms.map)
 381                                         he->ms.map->referenced = true;
 382                         }
 383                         goto out;
 384                 }
 385
 386                 if (cmp < 0)
 387                         p = &(*p)->rb_left;
 388                 else
 389                         p = &(*p)->rb_right;
 390         }
 391
 392         he = hist_entry__new(entry);
 393         if (!he)
 394                 return NULL;
 395
 396         hists->nr_entries++;
 397         rb_link_node(&he->rb_node_in, parent, p);
 398         rb_insert_color(&he->rb_node_in, hists->entries_in);
 399 out:
 400         he_stat__add_cpumode_period(&he->stat, al->cpumode, period);
 401         return he;
 402 }
 403
 404 struct hist_entry *__hists__add_entry(struct hists *hists,
 405                                       struct addr_location *al,
 406                                       struct symbol *sym_parent,
 407                                       struct branch_info *bi,
 408                                       struct mem_info *mi,
 409                                       u64 period, u64 weight, u64 transaction)
 410 {
 411         struct hist_entry entry = {
 412                 .thread = al->thread,
 413                 .comm = thread__comm(al->thread),
 414                 .ms = {
 415                         .map    = al->map,
 416                         .sym    = al->sym,
 417                 },
 418                 .cpu    = al->cpu,
 419                 .ip     = al->addr,
 420                 .level  = al->level,
 421                 .stat = {
 422                         .nr_events = 1,
 423                         .period = period,
 424                         .weight = weight,
 425                 },
 426                 .parent = sym_parent,
 427                 .filtered = symbol__parent_filter(sym_parent) | al->filtered,
 428                 .hists  = hists,
 429                 .branch_info = bi,
 430                 .mem_info = mi,
 431                 .transaction = transaction,
 432         };
 433
 434         return add_hist_entry(hists, &entry, al);
 435 }
 436
 437 int64_t
 438 hist_entry__cmp(struct hist_entry *left, struct hist_entry *right)
 439 {
 440         struct sort_entry *se;
 441         int64_t cmp = 0;
 442
 443         list_for_each_entry(se, &hist_entry__sort_list, list) {
 444                 cmp = se->se_cmp(left, right);
 445                 if (cmp)
 446                         break;
 447         }
 448
 449         return cmp;
 450 }
 451
 452 int64_t
 453 hist_entry__collapse(struct hist_entry *left, struct hist_entry *right)
 454 {
 455         struct sort_entry *se;
 456         int64_t cmp = 0;
 457
 458         list_for_each_entry(se, &hist_entry__sort_list, list) {
 459                 int64_t (*f)(struct hist_entry *, struct hist_entry *);
 460
 461                 f = se->se_collapse ?: se->se_cmp;
 462
 463                 cmp = f(left, right);
 464                 if (cmp)
 465                         break;
 466         }
 467
 468         return cmp;
 469 }
 470
 471 void hist_entry__free(struct hist_entry *he)
 472 {
 473         zfree(&he->branch_info);
 474         zfree(&he->mem_info);
 475         free_srcline(he->srcline);
 476         free(he);
 477 }
 478
 479 /*
 480  * collapse the histogram
 481  */
 482
 483 static bool hists__collapse_insert_entry(struct hists *hists __maybe_unused,
 484                                          struct rb_root *root,
 485                                          struct hist_entry *he)
 486 {
 487         struct rb_node **p = &root->rb_node;
 488         struct rb_node *parent = NULL;
 489         struct hist_entry *iter;
 490         int64_t cmp;
 491
 492         while (*p != NULL) {
 493                 parent = *p;
 494                 iter = rb_entry(parent, struct hist_entry, rb_node_in);
 495
 496                 cmp = hist_entry__collapse(iter, he);
 497
 498                 if (!cmp) {
 499                         he_stat__add_stat(&iter->stat, &he->stat);
 500
 501                         if (symbol_conf.use_callchain) {
 502                                 callchain_cursor_reset(&callchain_cursor);
 503                                 callchain_merge(&callchain_cursor,
 504                                                 iter->callchain,
 505                                                 he->callchain);
 506                         }
 507                         hist_entry__free(he);
 508                         return false;
 509                 }
 510
 511                 if (cmp < 0)
 512                         p = &(*p)->rb_left;
 513                 else
 514                         p = &(*p)->rb_right;
 515         }
 516
 517         rb_link_node(&he->rb_node_in, parent, p);
 518         rb_insert_color(&he->rb_node_in, root);
 519         return true;
 520 }
 521
 522 static struct rb_root *hists__get_rotate_entries_in(struct hists *hists)
 523 {
 524         struct rb_root *root;
 525
 526         pthread_mutex_lock(&hists->lock);
 527
 528         root = hists->entries_in;
 529         if (++hists->entries_in > &hists->entries_in_array[1])
 530                 hists->entries_in = &hists->entries_in_array[0];
 531
 532         pthread_mutex_unlock(&hists->lock);
 533
 534         return root;
 535 }
 536
 537 static void hists__apply_filters(struct hists *hists, struct hist_entry *he)
 538 {
 539         hists__filter_entry_by_dso(hists, he);
 540         hists__filter_entry_by_thread(hists, he);
 541         hists__filter_entry_by_symbol(hists, he);
 542 }
 543
 544 void hists__collapse_resort(struct hists *hists, struct ui_progress *prog)
 545 {
 546         struct rb_root *root;
 547         struct rb_node *next;
 548         struct hist_entry *n;
 549
 550         if (!sort__need_collapse)
 551                 return;
 552
 553         root = hists__get_rotate_entries_in(hists);
 554         next = rb_first(root);
 555
 556         while (next) {
 557                 if (session_done())
 558                         break;
 559                 n = rb_entry(next, struct hist_entry, rb_node_in);
 560                 next = rb_next(&n->rb_node_in);
 561
 562                 rb_erase(&n->rb_node_in, root);
 563                 if (hists__collapse_insert_entry(hists, &hists->entries_collapsed, n)) {
 564                         /*
 565                          * If it wasn't combined with one of the entries already
 566                          * collapsed, we need to apply the filters that may have
 567                          * been set by, say, the hist_browser.
 568                          */
 569                         hists__apply_filters(hists, n);
 570                 }
 571                 if (prog)
 572                         ui_progress__update(prog, 1);
 573         }
 574 }
 575
 576 /*
 577  * reverse the map, sort on period.
 578  */
 579
 580 static int period_cmp(u64 period_a, u64 period_b)
 581 {
 582         if (period_a > period_b)
 583                 return 1;
 584         if (period_a < period_b)
 585                 return -1;
 586         return 0;
 587 }
 588
 589 static int hist_entry__sort_on_period(struct hist_entry *a,
 590                                       struct hist_entry *b)
 591 {
 592         int ret;
 593         int i, nr_members;
 594         struct perf_evsel *evsel;
 595         struct hist_entry *pair;
 596         u64 *periods_a, *periods_b;
 597
 598         ret = period_cmp(a->stat.period, b->stat.period);
 599         if (ret || !symbol_conf.event_group)
 600                 return ret;
 601
 602         evsel = hists_to_evsel(a->hists);
 603         nr_members = evsel->nr_members;
 604         if (nr_members <= 1)
 605                 return ret;
 606
 607         periods_a = zalloc(sizeof(periods_a) * nr_members);
 608         periods_b = zalloc(sizeof(periods_b) * nr_members);
 609
 610         if (!periods_a || !periods_b)
 611                 goto out;
 612
 613         list_for_each_entry(pair, &a->pairs.head, pairs.node) {
 614                 evsel = hists_to_evsel(pair->hists);
 615                 periods_a[perf_evsel__group_idx(evsel)] = pair->stat.period;
 616         }
 617
 618         list_for_each_entry(pair, &b->pairs.head, pairs.node) {
 619                 evsel = hists_to_evsel(pair->hists);
 620                 periods_b[perf_evsel__group_idx(evsel)] = pair->stat.period;
 621         }
 622
 623         for (i = 1; i < nr_members; i++) {
 624                 ret = period_cmp(periods_a[i], periods_b[i]);
 625                 if (ret)
 626                         break;
 627         }
 628
 629 out:
 630         free(periods_a);
 631         free(periods_b);
 632
 633         return ret;
 634 }
 635
 636 static void __hists__insert_output_entry(struct rb_root *entries,
 637                                          struct hist_entry *he,
 638                                          u64 min_callchain_hits)
 639 {
 640         struct rb_node **p = &entries->rb_node;
 641         struct rb_node *parent = NULL;
 642         struct hist_entry *iter;
 643
 644         if (symbol_conf.use_callchain)
 645                 callchain_param.sort(&he->sorted_chain, he->callchain,
 646                                       min_callchain_hits, &callchain_param);
 647
 648         while (*p != NULL) {
 649                 parent = *p;
 650                 iter = rb_entry(parent, struct hist_entry, rb_node);
 651
 652                 if (hist_entry__sort_on_period(he, iter) > 0)
 653                         p = &(*p)->rb_left;
 654                 else
 655                         p = &(*p)->rb_right;
 656         }
 657
 658         rb_link_node(&he->rb_node, parent, p);
 659         rb_insert_color(&he->rb_node, entries);
 660 }
 661
 662 void hists__output_resort(struct hists *hists)
 663 {
 664         struct rb_root *root;
 665         struct rb_node *next;
 666         struct hist_entry *n;
 667         u64 min_callchain_hits;
 668
 669         min_callchain_hits = hists->stats.total_period * (callchain_param.min_percent / 100);
 670
 671         if (sort__need_collapse)
 672                 root = &hists->entries_collapsed;
 673         else
 674                 root = hists->entries_in;
 675
 676         next = rb_first(root);
 677         hists->entries = RB_ROOT;
 678
 679         hists->nr_non_filtered_entries = 0;
 680         hists->stats.total_period = 0;
 681         hists->stats.total_non_filtered_period = 0;
 682         hists__reset_col_len(hists);
 683
 684         while (next) {
 685                 n = rb_entry(next, struct hist_entry, rb_node_in);
 686                 next = rb_next(&n->rb_node_in);
 687
 688                 __hists__insert_output_entry(&hists->entries, n, min_callchain_hits);
 689                 hists__inc_nr_entries(hists, n);
 690         }
 691 }
 692
 693 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h,
 694                                        enum hist_filter filter)
 695 {
 696         h->filtered &= ~(1 << filter);
 697         if (h->filtered)
 698                 return;
 699
 700         ++hists->nr_non_filtered_entries;
 701         if (h->ms.unfolded)
 702                 hists->nr_non_filtered_entries += h->nr_rows;
 703         h->row_offset = 0;
 704         hists->stats.total_non_filtered_period += h->stat.period;
 705         hists->stats.nr_non_filtered_samples += h->stat.nr_events;
 706
 707         hists__calc_col_len(hists, h);
 708 }
 709
 710
 711 static bool hists__filter_entry_by_dso(struct hists *hists,
 712                                        struct hist_entry *he)
 713 {
 714         if (hists->dso_filter != NULL &&
 715             (he->ms.map == NULL || he->ms.map->dso != hists->dso_filter)) {
 716                 he->filtered |= (1 << HIST_FILTER__DSO);
 717                 return true;
 718         }
 719
 720         return false;
 721 }
 722
 723 void hists__filter_by_dso(struct hists *hists)
 724 {
 725         struct rb_node *nd;
 726
 727         hists->nr_non_filtered_entries = 0;
 728         hists->stats.total_non_filtered_period = 0;
 729         hists->stats.nr_non_filtered_samples = 0;
 730         hists__reset_col_len(hists);
 731
 732         for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
 733                 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
 734
 735                 if (symbol_conf.exclude_other && !h->parent)
 736                         continue;
 737
 738                 if (hists__filter_entry_by_dso(hists, h))
 739                         continue;
 740
 741                 hists__remove_entry_filter(hists, h, HIST_FILTER__DSO);
 742         }
 743 }
 744
 745 static bool hists__filter_entry_by_thread(struct hists *hists,
 746                                           struct hist_entry *he)
 747 {
 748         if (hists->thread_filter != NULL &&
 749             he->thread != hists->thread_filter) {
 750                 he->filtered |= (1 << HIST_FILTER__THREAD);
 751                 return true;
 752         }
 753
 754         return false;
 755 }
 756
 757 void hists__filter_by_thread(struct hists *hists)
 758 {
 759         struct rb_node *nd;
 760
 761         hists->nr_non_filtered_entries = 0;
 762         hists->stats.total_non_filtered_period = 0;
 763         hists->stats.nr_non_filtered_samples = 0;
 764         hists__reset_col_len(hists);
 765
 766         for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
 767                 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
 768
 769                 if (hists__filter_entry_by_thread(hists, h))
 770                         continue;
 771
 772                 hists__remove_entry_filter(hists, h, HIST_FILTER__THREAD);
 773         }
 774 }
 775
 776 static bool hists__filter_entry_by_symbol(struct hists *hists,
 777                                           struct hist_entry *he)
 778 {
 779         if (hists->symbol_filter_str != NULL &&
 780             (!he->ms.sym || strstr(he->ms.sym->name,
 781                                    hists->symbol_filter_str) == NULL)) {
 782                 he->filtered |= (1 << HIST_FILTER__SYMBOL);
 783                 return true;
 784         }
 785
 786         return false;
 787 }
 788
 789 void hists__filter_by_symbol(struct hists *hists)
 790 {
 791         struct rb_node *nd;
 792
 793         hists->nr_non_filtered_entries = 0;
 794         hists->stats.total_non_filtered_period = 0;
 795         hists->stats.nr_non_filtered_samples = 0;
 796         hists__reset_col_len(hists);
 797
 798         for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
 799                 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
 800
 801                 if (hists__filter_entry_by_symbol(hists, h))
 802                         continue;
 803
 804                 hists__remove_entry_filter(hists, h, HIST_FILTER__SYMBOL);
 805         }
 806 }
 807
 808 void events_stats__inc(struct events_stats *stats, u32 type)
 809 {
 810         ++stats->nr_events[0];
 811         ++stats->nr_events[type];
 812 }
 813
 814 void hists__inc_nr_events(struct hists *hists, u32 type)
 815 {
 816         events_stats__inc(&hists->stats, type);
 817 }
 818
 819 static struct hist_entry *hists__add_dummy_entry(struct hists *hists,
 820                                                  struct hist_entry *pair)
 821 {
 822         struct rb_root *root;
 823         struct rb_node **p;
 824         struct rb_node *parent = NULL;
 825         struct hist_entry *he;
 826         int64_t cmp;
 827
 828         if (sort__need_collapse)
 829                 root = &hists->entries_collapsed;
 830         else
 831                 root = hists->entries_in;
 832
 833         p = &root->rb_node;
 834
 835         while (*p != NULL) {
 836                 parent = *p;
 837                 he = rb_entry(parent, struct hist_entry, rb_node_in);
 838
 839                 cmp = hist_entry__collapse(he, pair);
 840
 841                 if (!cmp)
 842                         goto out;
 843
 844                 if (cmp < 0)
 845                         p = &(*p)->rb_left;
 846                 else
 847                         p = &(*p)->rb_right;
 848         }
 849
 850         he = hist_entry__new(pair);
 851         if (he) {
 852                 memset(&he->stat, 0, sizeof(he->stat));
 853                 he->hists = hists;
 854                 rb_link_node(&he->rb_node_in, parent, p);
 855                 rb_insert_color(&he->rb_node_in, root);
 856                 hists__inc_nr_entries(hists, he);
 857                 he->dummy = true;
 858         }
 859 out:
 860         return he;
 861 }
 862
 863 static struct hist_entry *hists__find_entry(struct hists *hists,
 864                                             struct hist_entry *he)
 865 {
 866         struct rb_node *n;
 867
 868         if (sort__need_collapse)
 869                 n = hists->entries_collapsed.rb_node;
 870         else
 871                 n = hists->entries_in->rb_node;
 872
 873         while (n) {
 874                 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in);
 875                 int64_t cmp = hist_entry__collapse(iter, he);
 876
 877                 if (cmp < 0)
 878                         n = n->rb_left;
 879                 else if (cmp > 0)
 880                         n = n->rb_right;
 881                 else
 882                         return iter;
 883         }
 884
 885         return NULL;
 886 }
 887
 888 /*
 889  * Look for pairs to link to the leader buckets (hist_entries):
 890  */
 891 void hists__match(struct hists *leader, struct hists *other)
 892 {
 893         struct rb_root *root;
 894         struct rb_node *nd;
 895         struct hist_entry *pos, *pair;
 896
 897         if (sort__need_collapse)
 898                 root = &leader->entries_collapsed;
 899         else
 900                 root = leader->entries_in;
 901
 902         for (nd = rb_first(root); nd; nd = rb_next(nd)) {
 903                 pos  = rb_entry(nd, struct hist_entry, rb_node_in);
 904                 pair = hists__find_entry(other, pos);
 905
 906                 if (pair)
 907                         hist_entry__add_pair(pair, pos);
 908         }
 909 }
 910
 911 /*
 912  * Look for entries in the other hists that are not present in the leader, if
 913  * we find them, just add a dummy entry on the leader hists, with period=0,
 914  * nr_events=0, to serve as the list header.
 915  */
 916 int hists__link(struct hists *leader, struct hists *other)
 917 {
 918         struct rb_root *root;
 919         struct rb_node *nd;
 920         struct hist_entry *pos, *pair;
 921
 922         if (sort__need_collapse)
 923                 root = &other->entries_collapsed;
 924         else
 925                 root = other->entries_in;
 926
 927         for (nd = rb_first(root); nd; nd = rb_next(nd)) {
 928                 pos = rb_entry(nd, struct hist_entry, rb_node_in);
 929
 930                 if (!hist_entry__has_pairs(pos)) {
 931                         pair = hists__add_dummy_entry(leader, pos);
 932                         if (pair == NULL)
 933                                 return -1;
 934                         hist_entry__add_pair(pos, pair);
 935                 }
 936         }
 937
 938         return 0;
 939 }
 940
 941 u64 hists__total_period(struct hists *hists)
 942 {
 943         return symbol_conf.filter_relative ? hists->stats.total_non_filtered_period :
 944                 hists->stats.total_period;
 945 }
 946
 947 int parse_filter_percentage(const struct option *opt __maybe_unused,
 948                             const char *arg, int unset __maybe_unused)
 949 {
 950         if (!strcmp(arg, "relative"))
 951                 symbol_conf.filter_relative = true;
 952         else if (!strcmp(arg, "absolute"))
 953                 symbol_conf.filter_relative = false;
 954         else
 955                 return -1;
 956
 957         return 0;
 958 }
 959
 960 int perf_hist_config(const char *var, const char *value)
 961 {
 962         if (!strcmp(var, "hist.percentage"))
 963                 return parse_filter_percentage(NULL, value, 0);
 964
 965         return 0;
 966 }