9 #include "ui/progress.h"
12 static bool hists__filter_entry_by_dso(struct hists *hists,
13 struct hist_entry *he);
14 static bool hists__filter_entry_by_thread(struct hists *hists,
15 struct hist_entry *he);
16 static bool hists__filter_entry_by_symbol(struct hists *hists,
17 struct hist_entry *he);
18 static bool hists__filter_entry_by_socket(struct hists *hists,
19 struct hist_entry *he);
21 u16 hists__col_len(struct hists *hists, enum hist_column col)
23 return hists->col_len[col];
26 void hists__set_col_len(struct hists *hists, enum hist_column col, u16 len)
28 hists->col_len[col] = len;
31 bool hists__new_col_len(struct hists *hists, enum hist_column col, u16 len)
33 if (len > hists__col_len(hists, col)) {
34 hists__set_col_len(hists, col, len);
40 void hists__reset_col_len(struct hists *hists)
44 for (col = 0; col < HISTC_NR_COLS; ++col)
45 hists__set_col_len(hists, col, 0);
48 static void hists__set_unres_dso_col_len(struct hists *hists, int dso)
50 const unsigned int unresolved_col_width = BITS_PER_LONG / 4;
52 if (hists__col_len(hists, dso) < unresolved_col_width &&
53 !symbol_conf.col_width_list_str && !symbol_conf.field_sep &&
54 !symbol_conf.dso_list)
55 hists__set_col_len(hists, dso, unresolved_col_width);
58 void hists__calc_col_len(struct hists *hists, struct hist_entry *h)
60 const unsigned int unresolved_col_width = BITS_PER_LONG / 4;
65 * +4 accounts for '[x] ' priv level info
66 * +2 accounts for 0x prefix on raw addresses
67 * +3 accounts for ' y ' symtab origin info
70 symlen = h->ms.sym->namelen + 4;
72 symlen += BITS_PER_LONG / 4 + 2 + 3;
73 hists__new_col_len(hists, HISTC_SYMBOL, symlen);
75 symlen = unresolved_col_width + 4 + 2;
76 hists__new_col_len(hists, HISTC_SYMBOL, symlen);
77 hists__set_unres_dso_col_len(hists, HISTC_DSO);
80 len = thread__comm_len(h->thread);
81 if (hists__new_col_len(hists, HISTC_COMM, len))
82 hists__set_col_len(hists, HISTC_THREAD, len + 8);
85 len = dso__name_len(h->ms.map->dso);
86 hists__new_col_len(hists, HISTC_DSO, len);
90 hists__new_col_len(hists, HISTC_PARENT, h->parent->namelen);
93 if (h->branch_info->from.sym) {
94 symlen = (int)h->branch_info->from.sym->namelen + 4;
96 symlen += BITS_PER_LONG / 4 + 2 + 3;
97 hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen);
99 symlen = dso__name_len(h->branch_info->from.map->dso);
100 hists__new_col_len(hists, HISTC_DSO_FROM, symlen);
102 symlen = unresolved_col_width + 4 + 2;
103 hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen);
104 hists__set_unres_dso_col_len(hists, HISTC_DSO_FROM);
107 if (h->branch_info->to.sym) {
108 symlen = (int)h->branch_info->to.sym->namelen + 4;
110 symlen += BITS_PER_LONG / 4 + 2 + 3;
111 hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen);
113 symlen = dso__name_len(h->branch_info->to.map->dso);
114 hists__new_col_len(hists, HISTC_DSO_TO, symlen);
116 symlen = unresolved_col_width + 4 + 2;
117 hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen);
118 hists__set_unres_dso_col_len(hists, HISTC_DSO_TO);
121 if (h->branch_info->srcline_from)
122 hists__new_col_len(hists, HISTC_SRCLINE_FROM,
123 strlen(h->branch_info->srcline_from));
124 if (h->branch_info->srcline_to)
125 hists__new_col_len(hists, HISTC_SRCLINE_TO,
126 strlen(h->branch_info->srcline_to));
130 if (h->mem_info->daddr.sym) {
131 symlen = (int)h->mem_info->daddr.sym->namelen + 4
132 + unresolved_col_width + 2;
133 hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL,
135 hists__new_col_len(hists, HISTC_MEM_DCACHELINE,
138 symlen = unresolved_col_width + 4 + 2;
139 hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL,
141 hists__new_col_len(hists, HISTC_MEM_DCACHELINE,
145 if (h->mem_info->iaddr.sym) {
146 symlen = (int)h->mem_info->iaddr.sym->namelen + 4
147 + unresolved_col_width + 2;
148 hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL,
151 symlen = unresolved_col_width + 4 + 2;
152 hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL,
156 if (h->mem_info->daddr.map) {
157 symlen = dso__name_len(h->mem_info->daddr.map->dso);
158 hists__new_col_len(hists, HISTC_MEM_DADDR_DSO,
161 symlen = unresolved_col_width + 4 + 2;
162 hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO);
165 symlen = unresolved_col_width + 4 + 2;
166 hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL, symlen);
167 hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL, symlen);
168 hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO);
171 hists__new_col_len(hists, HISTC_CPU, 3);
172 hists__new_col_len(hists, HISTC_SOCKET, 6);
173 hists__new_col_len(hists, HISTC_MEM_LOCKED, 6);
174 hists__new_col_len(hists, HISTC_MEM_TLB, 22);
175 hists__new_col_len(hists, HISTC_MEM_SNOOP, 12);
176 hists__new_col_len(hists, HISTC_MEM_LVL, 21 + 3);
177 hists__new_col_len(hists, HISTC_LOCAL_WEIGHT, 12);
178 hists__new_col_len(hists, HISTC_GLOBAL_WEIGHT, 12);
181 len = MAX(strlen(h->srcline), strlen(sort_srcline.se_header));
182 hists__new_col_len(hists, HISTC_SRCLINE, len);
186 hists__new_col_len(hists, HISTC_SRCFILE, strlen(h->srcfile));
189 hists__new_col_len(hists, HISTC_TRANSACTION,
190 hist_entry__transaction_len());
193 hists__new_col_len(hists, HISTC_TRACE, strlen(h->trace_output));
196 void hists__output_recalc_col_len(struct hists *hists, int max_rows)
198 struct rb_node *next = rb_first(&hists->entries);
199 struct hist_entry *n;
202 hists__reset_col_len(hists);
204 while (next && row++ < max_rows) {
205 n = rb_entry(next, struct hist_entry, rb_node);
207 hists__calc_col_len(hists, n);
208 next = rb_next(&n->rb_node);
212 static void he_stat__add_cpumode_period(struct he_stat *he_stat,
213 unsigned int cpumode, u64 period)
216 case PERF_RECORD_MISC_KERNEL:
217 he_stat->period_sys += period;
219 case PERF_RECORD_MISC_USER:
220 he_stat->period_us += period;
222 case PERF_RECORD_MISC_GUEST_KERNEL:
223 he_stat->period_guest_sys += period;
225 case PERF_RECORD_MISC_GUEST_USER:
226 he_stat->period_guest_us += period;
233 static void he_stat__add_period(struct he_stat *he_stat, u64 period,
237 he_stat->period += period;
238 he_stat->weight += weight;
239 he_stat->nr_events += 1;
242 static void he_stat__add_stat(struct he_stat *dest, struct he_stat *src)
244 dest->period += src->period;
245 dest->period_sys += src->period_sys;
246 dest->period_us += src->period_us;
247 dest->period_guest_sys += src->period_guest_sys;
248 dest->period_guest_us += src->period_guest_us;
249 dest->nr_events += src->nr_events;
250 dest->weight += src->weight;
253 static void he_stat__decay(struct he_stat *he_stat)
255 he_stat->period = (he_stat->period * 7) / 8;
256 he_stat->nr_events = (he_stat->nr_events * 7) / 8;
257 /* XXX need decay for weight too? */
260 static void hists__delete_entry(struct hists *hists, struct hist_entry *he);
262 static bool hists__decay_entry(struct hists *hists, struct hist_entry *he)
264 u64 prev_period = he->stat.period;
267 if (prev_period == 0)
270 he_stat__decay(&he->stat);
271 if (symbol_conf.cumulate_callchain)
272 he_stat__decay(he->stat_acc);
273 decay_callchain(he->callchain);
275 diff = prev_period - he->stat.period;
278 hists->stats.total_period -= diff;
280 hists->stats.total_non_filtered_period -= diff;
284 struct hist_entry *child;
285 struct rb_node *node = rb_first(&he->hroot_out);
287 child = rb_entry(node, struct hist_entry, rb_node);
288 node = rb_next(node);
290 if (hists__decay_entry(hists, child))
291 hists__delete_entry(hists, child);
295 return he->stat.period == 0;
298 static void hists__delete_entry(struct hists *hists, struct hist_entry *he)
300 struct rb_root *root_in;
301 struct rb_root *root_out;
304 root_in = &he->parent_he->hroot_in;
305 root_out = &he->parent_he->hroot_out;
307 if (hists__has(hists, need_collapse))
308 root_in = &hists->entries_collapsed;
310 root_in = hists->entries_in;
311 root_out = &hists->entries;
314 rb_erase(&he->rb_node_in, root_in);
315 rb_erase(&he->rb_node, root_out);
319 --hists->nr_non_filtered_entries;
321 hist_entry__delete(he);
324 void hists__decay_entries(struct hists *hists, bool zap_user, bool zap_kernel)
326 struct rb_node *next = rb_first(&hists->entries);
327 struct hist_entry *n;
330 n = rb_entry(next, struct hist_entry, rb_node);
331 next = rb_next(&n->rb_node);
332 if (((zap_user && n->level == '.') ||
333 (zap_kernel && n->level != '.') ||
334 hists__decay_entry(hists, n))) {
335 hists__delete_entry(hists, n);
340 void hists__delete_entries(struct hists *hists)
342 struct rb_node *next = rb_first(&hists->entries);
343 struct hist_entry *n;
346 n = rb_entry(next, struct hist_entry, rb_node);
347 next = rb_next(&n->rb_node);
349 hists__delete_entry(hists, n);
354 * histogram, sorted on item, collects periods
357 static int hist_entry__init(struct hist_entry *he,
358 struct hist_entry *template,
363 if (symbol_conf.cumulate_callchain) {
364 he->stat_acc = malloc(sizeof(he->stat));
365 if (he->stat_acc == NULL)
367 memcpy(he->stat_acc, &he->stat, sizeof(he->stat));
369 memset(&he->stat, 0, sizeof(he->stat));
372 map__get(he->ms.map);
374 if (he->branch_info) {
376 * This branch info is (a part of) allocated from
377 * sample__resolve_bstack() and will be freed after
378 * adding new entries. So we need to save a copy.
380 he->branch_info = malloc(sizeof(*he->branch_info));
381 if (he->branch_info == NULL) {
382 map__zput(he->ms.map);
387 memcpy(he->branch_info, template->branch_info,
388 sizeof(*he->branch_info));
390 map__get(he->branch_info->from.map);
391 map__get(he->branch_info->to.map);
395 map__get(he->mem_info->iaddr.map);
396 map__get(he->mem_info->daddr.map);
399 if (symbol_conf.use_callchain)
400 callchain_init(he->callchain);
403 he->raw_data = memdup(he->raw_data, he->raw_size);
405 if (he->raw_data == NULL) {
406 map__put(he->ms.map);
407 if (he->branch_info) {
408 map__put(he->branch_info->from.map);
409 map__put(he->branch_info->to.map);
410 free(he->branch_info);
413 map__put(he->mem_info->iaddr.map);
414 map__put(he->mem_info->daddr.map);
420 INIT_LIST_HEAD(&he->pairs.node);
421 thread__get(he->thread);
422 he->hroot_in = RB_ROOT;
423 he->hroot_out = RB_ROOT;
425 if (!symbol_conf.report_hierarchy)
431 static void *hist_entry__zalloc(size_t size)
433 return zalloc(size + sizeof(struct hist_entry));
436 static void hist_entry__free(void *ptr)
441 static struct hist_entry_ops default_ops = {
442 .new = hist_entry__zalloc,
443 .free = hist_entry__free,
446 static struct hist_entry *hist_entry__new(struct hist_entry *template,
449 struct hist_entry_ops *ops = template->ops;
450 size_t callchain_size = 0;
451 struct hist_entry *he;
455 ops = template->ops = &default_ops;
457 if (symbol_conf.use_callchain)
458 callchain_size = sizeof(struct callchain_root);
460 he = ops->new(callchain_size);
462 err = hist_entry__init(he, template, sample_self);
472 static u8 symbol__parent_filter(const struct symbol *parent)
474 if (symbol_conf.exclude_other && parent == NULL)
475 return 1 << HIST_FILTER__PARENT;
479 static void hist_entry__add_callchain_period(struct hist_entry *he, u64 period)
481 if (!symbol_conf.use_callchain)
484 he->hists->callchain_period += period;
486 he->hists->callchain_non_filtered_period += period;
489 static struct hist_entry *hists__findnew_entry(struct hists *hists,
490 struct hist_entry *entry,
491 struct addr_location *al,
495 struct rb_node *parent = NULL;
496 struct hist_entry *he;
498 u64 period = entry->stat.period;
499 u64 weight = entry->stat.weight;
501 p = &hists->entries_in->rb_node;
505 he = rb_entry(parent, struct hist_entry, rb_node_in);
508 * Make sure that it receives arguments in a same order as
509 * hist_entry__collapse() so that we can use an appropriate
510 * function when searching an entry regardless which sort
513 cmp = hist_entry__cmp(he, entry);
517 he_stat__add_period(&he->stat, period, weight);
518 hist_entry__add_callchain_period(he, period);
520 if (symbol_conf.cumulate_callchain)
521 he_stat__add_period(he->stat_acc, period, weight);
524 * This mem info was allocated from sample__resolve_mem
525 * and will not be used anymore.
527 zfree(&entry->mem_info);
529 /* If the map of an existing hist_entry has
530 * become out-of-date due to an exec() or
531 * similar, update it. Otherwise we will
532 * mis-adjust symbol addresses when computing
533 * the history counter to increment.
535 if (he->ms.map != entry->ms.map) {
536 map__put(he->ms.map);
537 he->ms.map = map__get(entry->ms.map);
548 he = hist_entry__new(entry, sample_self);
553 hist_entry__add_callchain_period(he, period);
556 rb_link_node(&he->rb_node_in, parent, p);
557 rb_insert_color(&he->rb_node_in, hists->entries_in);
560 he_stat__add_cpumode_period(&he->stat, al->cpumode, period);
561 if (symbol_conf.cumulate_callchain)
562 he_stat__add_cpumode_period(he->stat_acc, al->cpumode, period);
566 static struct hist_entry*
567 __hists__add_entry(struct hists *hists,
568 struct addr_location *al,
569 struct symbol *sym_parent,
570 struct branch_info *bi,
572 struct perf_sample *sample,
574 struct hist_entry_ops *ops)
576 struct hist_entry entry = {
577 .thread = al->thread,
578 .comm = thread__comm(al->thread),
583 .socket = al->socket,
585 .cpumode = al->cpumode,
590 .period = sample->period,
591 .weight = sample->weight,
593 .parent = sym_parent,
594 .filtered = symbol__parent_filter(sym_parent) | al->filtered,
598 .transaction = sample->transaction,
599 .raw_data = sample->raw_data,
600 .raw_size = sample->raw_size,
604 return hists__findnew_entry(hists, &entry, al, sample_self);
607 struct hist_entry *hists__add_entry(struct hists *hists,
608 struct addr_location *al,
609 struct symbol *sym_parent,
610 struct branch_info *bi,
612 struct perf_sample *sample,
615 return __hists__add_entry(hists, al, sym_parent, bi, mi,
616 sample, sample_self, NULL);
619 struct hist_entry *hists__add_entry_ops(struct hists *hists,
620 struct hist_entry_ops *ops,
621 struct addr_location *al,
622 struct symbol *sym_parent,
623 struct branch_info *bi,
625 struct perf_sample *sample,
628 return __hists__add_entry(hists, al, sym_parent, bi, mi,
629 sample, sample_self, ops);
633 iter_next_nop_entry(struct hist_entry_iter *iter __maybe_unused,
634 struct addr_location *al __maybe_unused)
640 iter_add_next_nop_entry(struct hist_entry_iter *iter __maybe_unused,
641 struct addr_location *al __maybe_unused)
647 iter_prepare_mem_entry(struct hist_entry_iter *iter, struct addr_location *al)
649 struct perf_sample *sample = iter->sample;
652 mi = sample__resolve_mem(sample, al);
661 iter_add_single_mem_entry(struct hist_entry_iter *iter, struct addr_location *al)
664 struct mem_info *mi = iter->priv;
665 struct hists *hists = evsel__hists(iter->evsel);
666 struct perf_sample *sample = iter->sample;
667 struct hist_entry *he;
672 cost = sample->weight;
677 * must pass period=weight in order to get the correct
678 * sorting from hists__collapse_resort() which is solely
679 * based on periods. We want sorting be done on nr_events * weight
680 * and this is indirectly achieved by passing period=weight here
681 * and the he_stat__add_period() function.
683 sample->period = cost;
685 he = hists__add_entry(hists, al, iter->parent, NULL, mi,
695 iter_finish_mem_entry(struct hist_entry_iter *iter,
696 struct addr_location *al __maybe_unused)
698 struct perf_evsel *evsel = iter->evsel;
699 struct hists *hists = evsel__hists(evsel);
700 struct hist_entry *he = iter->he;
706 hists__inc_nr_samples(hists, he->filtered);
708 err = hist_entry__append_callchain(he, iter->sample);
712 * We don't need to free iter->priv (mem_info) here since the mem info
713 * was either already freed in hists__findnew_entry() or passed to a
714 * new hist entry by hist_entry__new().
723 iter_prepare_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
725 struct branch_info *bi;
726 struct perf_sample *sample = iter->sample;
728 bi = sample__resolve_bstack(sample, al);
733 iter->total = sample->branch_stack->nr;
740 iter_add_single_branch_entry(struct hist_entry_iter *iter,
741 struct addr_location *al __maybe_unused)
743 /* to avoid calling callback function */
750 iter_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
752 struct branch_info *bi = iter->priv;
758 if (iter->curr >= iter->total)
761 al->map = bi[i].to.map;
762 al->sym = bi[i].to.sym;
763 al->addr = bi[i].to.addr;
768 iter_add_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
770 struct branch_info *bi;
771 struct perf_evsel *evsel = iter->evsel;
772 struct hists *hists = evsel__hists(evsel);
773 struct perf_sample *sample = iter->sample;
774 struct hist_entry *he = NULL;
780 if (iter->hide_unresolved && !(bi[i].from.sym && bi[i].to.sym))
784 * The report shows the percentage of total branches captured
785 * and not events sampled. Thus we use a pseudo period of 1.
788 sample->weight = bi->flags.cycles ? bi->flags.cycles : 1;
790 he = hists__add_entry(hists, al, iter->parent, &bi[i], NULL,
795 hists__inc_nr_samples(hists, he->filtered);
804 iter_finish_branch_entry(struct hist_entry_iter *iter,
805 struct addr_location *al __maybe_unused)
810 return iter->curr >= iter->total ? 0 : -1;
814 iter_prepare_normal_entry(struct hist_entry_iter *iter __maybe_unused,
815 struct addr_location *al __maybe_unused)
821 iter_add_single_normal_entry(struct hist_entry_iter *iter, struct addr_location *al)
823 struct perf_evsel *evsel = iter->evsel;
824 struct perf_sample *sample = iter->sample;
825 struct hist_entry *he;
827 he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,
837 iter_finish_normal_entry(struct hist_entry_iter *iter,
838 struct addr_location *al __maybe_unused)
840 struct hist_entry *he = iter->he;
841 struct perf_evsel *evsel = iter->evsel;
842 struct perf_sample *sample = iter->sample;
849 hists__inc_nr_samples(evsel__hists(evsel), he->filtered);
851 return hist_entry__append_callchain(he, sample);
855 iter_prepare_cumulative_entry(struct hist_entry_iter *iter,
856 struct addr_location *al __maybe_unused)
858 struct hist_entry **he_cache;
860 callchain_cursor_commit(&callchain_cursor);
863 * This is for detecting cycles or recursions so that they're
864 * cumulated only one time to prevent entries more than 100%
867 he_cache = malloc(sizeof(*he_cache) * (iter->max_stack + 1));
868 if (he_cache == NULL)
871 iter->priv = he_cache;
878 iter_add_single_cumulative_entry(struct hist_entry_iter *iter,
879 struct addr_location *al)
881 struct perf_evsel *evsel = iter->evsel;
882 struct hists *hists = evsel__hists(evsel);
883 struct perf_sample *sample = iter->sample;
884 struct hist_entry **he_cache = iter->priv;
885 struct hist_entry *he;
888 he = hists__add_entry(hists, al, iter->parent, NULL, NULL,
894 he_cache[iter->curr++] = he;
896 hist_entry__append_callchain(he, sample);
899 * We need to re-initialize the cursor since callchain_append()
900 * advanced the cursor to the end.
902 callchain_cursor_commit(&callchain_cursor);
904 hists__inc_nr_samples(hists, he->filtered);
910 iter_next_cumulative_entry(struct hist_entry_iter *iter,
911 struct addr_location *al)
913 struct callchain_cursor_node *node;
915 node = callchain_cursor_current(&callchain_cursor);
919 return fill_callchain_info(al, node, iter->hide_unresolved);
923 iter_add_next_cumulative_entry(struct hist_entry_iter *iter,
924 struct addr_location *al)
926 struct perf_evsel *evsel = iter->evsel;
927 struct perf_sample *sample = iter->sample;
928 struct hist_entry **he_cache = iter->priv;
929 struct hist_entry *he;
930 struct hist_entry he_tmp = {
931 .hists = evsel__hists(evsel),
933 .thread = al->thread,
934 .comm = thread__comm(al->thread),
940 .parent = iter->parent,
941 .raw_data = sample->raw_data,
942 .raw_size = sample->raw_size,
945 struct callchain_cursor cursor;
947 callchain_cursor_snapshot(&cursor, &callchain_cursor);
949 callchain_cursor_advance(&callchain_cursor);
952 * Check if there's duplicate entries in the callchain.
953 * It's possible that it has cycles or recursive calls.
955 for (i = 0; i < iter->curr; i++) {
956 if (hist_entry__cmp(he_cache[i], &he_tmp) == 0) {
957 /* to avoid calling callback function */
963 he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,
969 he_cache[iter->curr++] = he;
971 if (symbol_conf.use_callchain)
972 callchain_append(he->callchain, &cursor, sample->period);
977 iter_finish_cumulative_entry(struct hist_entry_iter *iter,
978 struct addr_location *al __maybe_unused)
986 const struct hist_iter_ops hist_iter_mem = {
987 .prepare_entry = iter_prepare_mem_entry,
988 .add_single_entry = iter_add_single_mem_entry,
989 .next_entry = iter_next_nop_entry,
990 .add_next_entry = iter_add_next_nop_entry,
991 .finish_entry = iter_finish_mem_entry,
994 const struct hist_iter_ops hist_iter_branch = {
995 .prepare_entry = iter_prepare_branch_entry,
996 .add_single_entry = iter_add_single_branch_entry,
997 .next_entry = iter_next_branch_entry,
998 .add_next_entry = iter_add_next_branch_entry,
999 .finish_entry = iter_finish_branch_entry,
1002 const struct hist_iter_ops hist_iter_normal = {
1003 .prepare_entry = iter_prepare_normal_entry,
1004 .add_single_entry = iter_add_single_normal_entry,
1005 .next_entry = iter_next_nop_entry,
1006 .add_next_entry = iter_add_next_nop_entry,
1007 .finish_entry = iter_finish_normal_entry,
1010 const struct hist_iter_ops hist_iter_cumulative = {
1011 .prepare_entry = iter_prepare_cumulative_entry,
1012 .add_single_entry = iter_add_single_cumulative_entry,
1013 .next_entry = iter_next_cumulative_entry,
1014 .add_next_entry = iter_add_next_cumulative_entry,
1015 .finish_entry = iter_finish_cumulative_entry,
1018 int hist_entry_iter__add(struct hist_entry_iter *iter, struct addr_location *al,
1019 int max_stack_depth, void *arg)
1023 err = sample__resolve_callchain(iter->sample, &callchain_cursor, &iter->parent,
1024 iter->evsel, al, max_stack_depth);
1028 iter->max_stack = max_stack_depth;
1030 err = iter->ops->prepare_entry(iter, al);
1034 err = iter->ops->add_single_entry(iter, al);
1038 if (iter->he && iter->add_entry_cb) {
1039 err = iter->add_entry_cb(iter, al, true, arg);
1044 while (iter->ops->next_entry(iter, al)) {
1045 err = iter->ops->add_next_entry(iter, al);
1049 if (iter->he && iter->add_entry_cb) {
1050 err = iter->add_entry_cb(iter, al, false, arg);
1057 err2 = iter->ops->finish_entry(iter, al);
1065 hist_entry__cmp(struct hist_entry *left, struct hist_entry *right)
1067 struct hists *hists = left->hists;
1068 struct perf_hpp_fmt *fmt;
1071 hists__for_each_sort_list(hists, fmt) {
1072 if (perf_hpp__is_dynamic_entry(fmt) &&
1073 !perf_hpp__defined_dynamic_entry(fmt, hists))
1076 cmp = fmt->cmp(fmt, left, right);
1085 hist_entry__collapse(struct hist_entry *left, struct hist_entry *right)
1087 struct hists *hists = left->hists;
1088 struct perf_hpp_fmt *fmt;
1091 hists__for_each_sort_list(hists, fmt) {
1092 if (perf_hpp__is_dynamic_entry(fmt) &&
1093 !perf_hpp__defined_dynamic_entry(fmt, hists))
1096 cmp = fmt->collapse(fmt, left, right);
1104 void hist_entry__delete(struct hist_entry *he)
1106 struct hist_entry_ops *ops = he->ops;
1108 thread__zput(he->thread);
1109 map__zput(he->ms.map);
1111 if (he->branch_info) {
1112 map__zput(he->branch_info->from.map);
1113 map__zput(he->branch_info->to.map);
1114 free_srcline(he->branch_info->srcline_from);
1115 free_srcline(he->branch_info->srcline_to);
1116 zfree(&he->branch_info);
1120 map__zput(he->mem_info->iaddr.map);
1121 map__zput(he->mem_info->daddr.map);
1122 zfree(&he->mem_info);
1125 zfree(&he->stat_acc);
1126 free_srcline(he->srcline);
1127 if (he->srcfile && he->srcfile[0])
1129 free_callchain(he->callchain);
1130 free(he->trace_output);
1136 * If this is not the last column, then we need to pad it according to the
1137 * pre-calculated max lenght for this column, otherwise don't bother adding
1138 * spaces because that would break viewing this with, for instance, 'less',
1139 * that would show tons of trailing spaces when a long C++ demangled method
1142 int hist_entry__snprintf_alignment(struct hist_entry *he, struct perf_hpp *hpp,
1143 struct perf_hpp_fmt *fmt, int printed)
1145 if (!list_is_last(&fmt->list, &he->hists->hpp_list->fields)) {
1146 const int width = fmt->width(fmt, hpp, he->hists);
1147 if (printed < width) {
1148 advance_hpp(hpp, printed);
1149 printed = scnprintf(hpp->buf, hpp->size, "%-*s", width - printed, " ");
1157 * collapse the histogram
1160 static void hists__apply_filters(struct hists *hists, struct hist_entry *he);
1161 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *he,
1162 enum hist_filter type);
1164 typedef bool (*fmt_chk_fn)(struct perf_hpp_fmt *fmt);
1166 static bool check_thread_entry(struct perf_hpp_fmt *fmt)
1168 return perf_hpp__is_thread_entry(fmt) || perf_hpp__is_comm_entry(fmt);
1171 static void hist_entry__check_and_remove_filter(struct hist_entry *he,
1172 enum hist_filter type,
1175 struct perf_hpp_fmt *fmt;
1176 bool type_match = false;
1177 struct hist_entry *parent = he->parent_he;
1180 case HIST_FILTER__THREAD:
1181 if (symbol_conf.comm_list == NULL &&
1182 symbol_conf.pid_list == NULL &&
1183 symbol_conf.tid_list == NULL)
1186 case HIST_FILTER__DSO:
1187 if (symbol_conf.dso_list == NULL)
1190 case HIST_FILTER__SYMBOL:
1191 if (symbol_conf.sym_list == NULL)
1194 case HIST_FILTER__PARENT:
1195 case HIST_FILTER__GUEST:
1196 case HIST_FILTER__HOST:
1197 case HIST_FILTER__SOCKET:
1202 /* if it's filtered by own fmt, it has to have filter bits */
1203 perf_hpp_list__for_each_format(he->hpp_list, fmt) {
1212 * If the filter is for current level entry, propagate
1213 * filter marker to parents. The marker bit was
1214 * already set by default so it only needs to clear
1215 * non-filtered entries.
1217 if (!(he->filtered & (1 << type))) {
1219 parent->filtered &= ~(1 << type);
1220 parent = parent->parent_he;
1225 * If current entry doesn't have matching formats, set
1226 * filter marker for upper level entries. it will be
1227 * cleared if its lower level entries is not filtered.
1229 * For lower-level entries, it inherits parent's
1230 * filter bit so that lower level entries of a
1231 * non-filtered entry won't set the filter marker.
1234 he->filtered |= (1 << type);
1236 he->filtered |= (parent->filtered & (1 << type));
1240 static void hist_entry__apply_hierarchy_filters(struct hist_entry *he)
1242 hist_entry__check_and_remove_filter(he, HIST_FILTER__THREAD,
1243 check_thread_entry);
1245 hist_entry__check_and_remove_filter(he, HIST_FILTER__DSO,
1246 perf_hpp__is_dso_entry);
1248 hist_entry__check_and_remove_filter(he, HIST_FILTER__SYMBOL,
1249 perf_hpp__is_sym_entry);
1251 hists__apply_filters(he->hists, he);
1254 static struct hist_entry *hierarchy_insert_entry(struct hists *hists,
1255 struct rb_root *root,
1256 struct hist_entry *he,
1257 struct hist_entry *parent_he,
1258 struct perf_hpp_list *hpp_list)
1260 struct rb_node **p = &root->rb_node;
1261 struct rb_node *parent = NULL;
1262 struct hist_entry *iter, *new;
1263 struct perf_hpp_fmt *fmt;
1266 while (*p != NULL) {
1268 iter = rb_entry(parent, struct hist_entry, rb_node_in);
1271 perf_hpp_list__for_each_sort_list(hpp_list, fmt) {
1272 cmp = fmt->collapse(fmt, iter, he);
1278 he_stat__add_stat(&iter->stat, &he->stat);
1283 p = &parent->rb_left;
1285 p = &parent->rb_right;
1288 new = hist_entry__new(he, true);
1292 hists->nr_entries++;
1294 /* save related format list for output */
1295 new->hpp_list = hpp_list;
1296 new->parent_he = parent_he;
1298 hist_entry__apply_hierarchy_filters(new);
1300 /* some fields are now passed to 'new' */
1301 perf_hpp_list__for_each_sort_list(hpp_list, fmt) {
1302 if (perf_hpp__is_trace_entry(fmt) || perf_hpp__is_dynamic_entry(fmt))
1303 he->trace_output = NULL;
1305 new->trace_output = NULL;
1307 if (perf_hpp__is_srcline_entry(fmt))
1310 new->srcline = NULL;
1312 if (perf_hpp__is_srcfile_entry(fmt))
1315 new->srcfile = NULL;
1318 rb_link_node(&new->rb_node_in, parent, p);
1319 rb_insert_color(&new->rb_node_in, root);
1323 static int hists__hierarchy_insert_entry(struct hists *hists,
1324 struct rb_root *root,
1325 struct hist_entry *he)
1327 struct perf_hpp_list_node *node;
1328 struct hist_entry *new_he = NULL;
1329 struct hist_entry *parent = NULL;
1333 list_for_each_entry(node, &hists->hpp_formats, list) {
1334 /* skip period (overhead) and elided columns */
1335 if (node->level == 0 || node->skip)
1338 /* insert copy of 'he' for each fmt into the hierarchy */
1339 new_he = hierarchy_insert_entry(hists, root, he, parent, &node->hpp);
1340 if (new_he == NULL) {
1345 root = &new_he->hroot_in;
1346 new_he->depth = depth++;
1351 new_he->leaf = true;
1353 if (symbol_conf.use_callchain) {
1354 callchain_cursor_reset(&callchain_cursor);
1355 if (callchain_merge(&callchain_cursor,
1362 /* 'he' is no longer used */
1363 hist_entry__delete(he);
1365 /* return 0 (or -1) since it already applied filters */
1369 static int hists__collapse_insert_entry(struct hists *hists,
1370 struct rb_root *root,
1371 struct hist_entry *he)
1373 struct rb_node **p = &root->rb_node;
1374 struct rb_node *parent = NULL;
1375 struct hist_entry *iter;
1378 if (symbol_conf.report_hierarchy)
1379 return hists__hierarchy_insert_entry(hists, root, he);
1381 while (*p != NULL) {
1383 iter = rb_entry(parent, struct hist_entry, rb_node_in);
1385 cmp = hist_entry__collapse(iter, he);
1390 he_stat__add_stat(&iter->stat, &he->stat);
1391 if (symbol_conf.cumulate_callchain)
1392 he_stat__add_stat(iter->stat_acc, he->stat_acc);
1394 if (symbol_conf.use_callchain) {
1395 callchain_cursor_reset(&callchain_cursor);
1396 if (callchain_merge(&callchain_cursor,
1401 hist_entry__delete(he);
1408 p = &(*p)->rb_right;
1410 hists->nr_entries++;
1412 rb_link_node(&he->rb_node_in, parent, p);
1413 rb_insert_color(&he->rb_node_in, root);
1417 struct rb_root *hists__get_rotate_entries_in(struct hists *hists)
1419 struct rb_root *root;
1421 pthread_mutex_lock(&hists->lock);
1423 root = hists->entries_in;
1424 if (++hists->entries_in > &hists->entries_in_array[1])
1425 hists->entries_in = &hists->entries_in_array[0];
1427 pthread_mutex_unlock(&hists->lock);
1432 static void hists__apply_filters(struct hists *hists, struct hist_entry *he)
1434 hists__filter_entry_by_dso(hists, he);
1435 hists__filter_entry_by_thread(hists, he);
1436 hists__filter_entry_by_symbol(hists, he);
1437 hists__filter_entry_by_socket(hists, he);
1440 int hists__collapse_resort(struct hists *hists, struct ui_progress *prog)
1442 struct rb_root *root;
1443 struct rb_node *next;
1444 struct hist_entry *n;
1447 if (!hists__has(hists, need_collapse))
1450 hists->nr_entries = 0;
1452 root = hists__get_rotate_entries_in(hists);
1454 next = rb_first(root);
1459 n = rb_entry(next, struct hist_entry, rb_node_in);
1460 next = rb_next(&n->rb_node_in);
1462 rb_erase(&n->rb_node_in, root);
1463 ret = hists__collapse_insert_entry(hists, &hists->entries_collapsed, n);
1469 * If it wasn't combined with one of the entries already
1470 * collapsed, we need to apply the filters that may have
1471 * been set by, say, the hist_browser.
1473 hists__apply_filters(hists, n);
1476 ui_progress__update(prog, 1);
1481 static int hist_entry__sort(struct hist_entry *a, struct hist_entry *b)
1483 struct hists *hists = a->hists;
1484 struct perf_hpp_fmt *fmt;
1487 hists__for_each_sort_list(hists, fmt) {
1488 if (perf_hpp__should_skip(fmt, a->hists))
1491 cmp = fmt->sort(fmt, a, b);
1499 static void hists__reset_filter_stats(struct hists *hists)
1501 hists->nr_non_filtered_entries = 0;
1502 hists->stats.total_non_filtered_period = 0;
1505 void hists__reset_stats(struct hists *hists)
1507 hists->nr_entries = 0;
1508 hists->stats.total_period = 0;
1510 hists__reset_filter_stats(hists);
1513 static void hists__inc_filter_stats(struct hists *hists, struct hist_entry *h)
1515 hists->nr_non_filtered_entries++;
1516 hists->stats.total_non_filtered_period += h->stat.period;
1519 void hists__inc_stats(struct hists *hists, struct hist_entry *h)
1522 hists__inc_filter_stats(hists, h);
1524 hists->nr_entries++;
1525 hists->stats.total_period += h->stat.period;
1528 static void hierarchy_recalc_total_periods(struct hists *hists)
1530 struct rb_node *node;
1531 struct hist_entry *he;
1533 node = rb_first(&hists->entries);
1535 hists->stats.total_period = 0;
1536 hists->stats.total_non_filtered_period = 0;
1539 * recalculate total period using top-level entries only
1540 * since lower level entries only see non-filtered entries
1541 * but upper level entries have sum of both entries.
1544 he = rb_entry(node, struct hist_entry, rb_node);
1545 node = rb_next(node);
1547 hists->stats.total_period += he->stat.period;
1549 hists->stats.total_non_filtered_period += he->stat.period;
1553 static void hierarchy_insert_output_entry(struct rb_root *root,
1554 struct hist_entry *he)
1556 struct rb_node **p = &root->rb_node;
1557 struct rb_node *parent = NULL;
1558 struct hist_entry *iter;
1559 struct perf_hpp_fmt *fmt;
1561 while (*p != NULL) {
1563 iter = rb_entry(parent, struct hist_entry, rb_node);
1565 if (hist_entry__sort(he, iter) > 0)
1566 p = &parent->rb_left;
1568 p = &parent->rb_right;
1571 rb_link_node(&he->rb_node, parent, p);
1572 rb_insert_color(&he->rb_node, root);
1574 /* update column width of dynamic entry */
1575 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) {
1576 if (perf_hpp__is_dynamic_entry(fmt))
1577 fmt->sort(fmt, he, NULL);
1581 static void hists__hierarchy_output_resort(struct hists *hists,
1582 struct ui_progress *prog,
1583 struct rb_root *root_in,
1584 struct rb_root *root_out,
1585 u64 min_callchain_hits,
1588 struct rb_node *node;
1589 struct hist_entry *he;
1591 *root_out = RB_ROOT;
1592 node = rb_first(root_in);
1595 he = rb_entry(node, struct hist_entry, rb_node_in);
1596 node = rb_next(node);
1598 hierarchy_insert_output_entry(root_out, he);
1601 ui_progress__update(prog, 1);
1604 hists__hierarchy_output_resort(hists, prog,
1609 hists->nr_entries++;
1610 if (!he->filtered) {
1611 hists->nr_non_filtered_entries++;
1612 hists__calc_col_len(hists, he);
1621 if (callchain_param.mode == CHAIN_GRAPH_REL) {
1622 u64 total = he->stat.period;
1624 if (symbol_conf.cumulate_callchain)
1625 total = he->stat_acc->period;
1627 min_callchain_hits = total * (callchain_param.min_percent / 100);
1630 callchain_param.sort(&he->sorted_chain, he->callchain,
1631 min_callchain_hits, &callchain_param);
1635 static void __hists__insert_output_entry(struct rb_root *entries,
1636 struct hist_entry *he,
1637 u64 min_callchain_hits,
1640 struct rb_node **p = &entries->rb_node;
1641 struct rb_node *parent = NULL;
1642 struct hist_entry *iter;
1643 struct perf_hpp_fmt *fmt;
1645 if (use_callchain) {
1646 if (callchain_param.mode == CHAIN_GRAPH_REL) {
1647 u64 total = he->stat.period;
1649 if (symbol_conf.cumulate_callchain)
1650 total = he->stat_acc->period;
1652 min_callchain_hits = total * (callchain_param.min_percent / 100);
1654 callchain_param.sort(&he->sorted_chain, he->callchain,
1655 min_callchain_hits, &callchain_param);
1658 while (*p != NULL) {
1660 iter = rb_entry(parent, struct hist_entry, rb_node);
1662 if (hist_entry__sort(he, iter) > 0)
1665 p = &(*p)->rb_right;
1668 rb_link_node(&he->rb_node, parent, p);
1669 rb_insert_color(&he->rb_node, entries);
1671 perf_hpp_list__for_each_sort_list(&perf_hpp_list, fmt) {
1672 if (perf_hpp__is_dynamic_entry(fmt) &&
1673 perf_hpp__defined_dynamic_entry(fmt, he->hists))
1674 fmt->sort(fmt, he, NULL); /* update column width */
1678 static void output_resort(struct hists *hists, struct ui_progress *prog,
1679 bool use_callchain, hists__resort_cb_t cb)
1681 struct rb_root *root;
1682 struct rb_node *next;
1683 struct hist_entry *n;
1684 u64 callchain_total;
1685 u64 min_callchain_hits;
1687 callchain_total = hists->callchain_period;
1688 if (symbol_conf.filter_relative)
1689 callchain_total = hists->callchain_non_filtered_period;
1691 min_callchain_hits = callchain_total * (callchain_param.min_percent / 100);
1693 hists__reset_stats(hists);
1694 hists__reset_col_len(hists);
1696 if (symbol_conf.report_hierarchy) {
1697 hists__hierarchy_output_resort(hists, prog,
1698 &hists->entries_collapsed,
1702 hierarchy_recalc_total_periods(hists);
1706 if (hists__has(hists, need_collapse))
1707 root = &hists->entries_collapsed;
1709 root = hists->entries_in;
1711 next = rb_first(root);
1712 hists->entries = RB_ROOT;
1715 n = rb_entry(next, struct hist_entry, rb_node_in);
1716 next = rb_next(&n->rb_node_in);
1721 __hists__insert_output_entry(&hists->entries, n, min_callchain_hits, use_callchain);
1722 hists__inc_stats(hists, n);
1725 hists__calc_col_len(hists, n);
1728 ui_progress__update(prog, 1);
1732 void perf_evsel__output_resort(struct perf_evsel *evsel, struct ui_progress *prog)
1736 if (evsel && symbol_conf.use_callchain && !symbol_conf.show_ref_callgraph)
1737 use_callchain = evsel->attr.sample_type & PERF_SAMPLE_CALLCHAIN;
1739 use_callchain = symbol_conf.use_callchain;
1741 output_resort(evsel__hists(evsel), prog, use_callchain, NULL);
1744 void hists__output_resort(struct hists *hists, struct ui_progress *prog)
1746 output_resort(hists, prog, symbol_conf.use_callchain, NULL);
1749 void hists__output_resort_cb(struct hists *hists, struct ui_progress *prog,
1750 hists__resort_cb_t cb)
1752 output_resort(hists, prog, symbol_conf.use_callchain, cb);
1755 static bool can_goto_child(struct hist_entry *he, enum hierarchy_move_dir hmd)
1757 if (he->leaf || hmd == HMD_FORCE_SIBLING)
1760 if (he->unfolded || hmd == HMD_FORCE_CHILD)
1766 struct rb_node *rb_hierarchy_last(struct rb_node *node)
1768 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
1770 while (can_goto_child(he, HMD_NORMAL)) {
1771 node = rb_last(&he->hroot_out);
1772 he = rb_entry(node, struct hist_entry, rb_node);
1777 struct rb_node *__rb_hierarchy_next(struct rb_node *node, enum hierarchy_move_dir hmd)
1779 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
1781 if (can_goto_child(he, hmd))
1782 node = rb_first(&he->hroot_out);
1784 node = rb_next(node);
1786 while (node == NULL) {
1791 node = rb_next(&he->rb_node);
1796 struct rb_node *rb_hierarchy_prev(struct rb_node *node)
1798 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
1800 node = rb_prev(node);
1802 return rb_hierarchy_last(node);
1808 return &he->rb_node;
1811 bool hist_entry__has_hierarchy_children(struct hist_entry *he, float limit)
1813 struct rb_node *node;
1814 struct hist_entry *child;
1820 node = rb_first(&he->hroot_out);
1821 child = rb_entry(node, struct hist_entry, rb_node);
1823 while (node && child->filtered) {
1824 node = rb_next(node);
1825 child = rb_entry(node, struct hist_entry, rb_node);
1829 percent = hist_entry__get_percent_limit(child);
1833 return node && percent >= limit;
1836 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h,
1837 enum hist_filter filter)
1839 h->filtered &= ~(1 << filter);
1841 if (symbol_conf.report_hierarchy) {
1842 struct hist_entry *parent = h->parent_he;
1845 he_stat__add_stat(&parent->stat, &h->stat);
1847 parent->filtered &= ~(1 << filter);
1849 if (parent->filtered)
1852 /* force fold unfiltered entry for simplicity */
1853 parent->unfolded = false;
1854 parent->has_no_entry = false;
1855 parent->row_offset = 0;
1856 parent->nr_rows = 0;
1858 parent = parent->parent_he;
1865 /* force fold unfiltered entry for simplicity */
1866 h->unfolded = false;
1867 h->has_no_entry = false;
1871 hists->stats.nr_non_filtered_samples += h->stat.nr_events;
1873 hists__inc_filter_stats(hists, h);
1874 hists__calc_col_len(hists, h);
1878 static bool hists__filter_entry_by_dso(struct hists *hists,
1879 struct hist_entry *he)
1881 if (hists->dso_filter != NULL &&
1882 (he->ms.map == NULL || he->ms.map->dso != hists->dso_filter)) {
1883 he->filtered |= (1 << HIST_FILTER__DSO);
1890 static bool hists__filter_entry_by_thread(struct hists *hists,
1891 struct hist_entry *he)
1893 if (hists->thread_filter != NULL &&
1894 he->thread != hists->thread_filter) {
1895 he->filtered |= (1 << HIST_FILTER__THREAD);
1902 static bool hists__filter_entry_by_symbol(struct hists *hists,
1903 struct hist_entry *he)
1905 if (hists->symbol_filter_str != NULL &&
1906 (!he->ms.sym || strstr(he->ms.sym->name,
1907 hists->symbol_filter_str) == NULL)) {
1908 he->filtered |= (1 << HIST_FILTER__SYMBOL);
1915 static bool hists__filter_entry_by_socket(struct hists *hists,
1916 struct hist_entry *he)
1918 if ((hists->socket_filter > -1) &&
1919 (he->socket != hists->socket_filter)) {
1920 he->filtered |= (1 << HIST_FILTER__SOCKET);
1927 typedef bool (*filter_fn_t)(struct hists *hists, struct hist_entry *he);
1929 static void hists__filter_by_type(struct hists *hists, int type, filter_fn_t filter)
1933 hists->stats.nr_non_filtered_samples = 0;
1935 hists__reset_filter_stats(hists);
1936 hists__reset_col_len(hists);
1938 for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
1939 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1941 if (filter(hists, h))
1944 hists__remove_entry_filter(hists, h, type);
1948 static void resort_filtered_entry(struct rb_root *root, struct hist_entry *he)
1950 struct rb_node **p = &root->rb_node;
1951 struct rb_node *parent = NULL;
1952 struct hist_entry *iter;
1953 struct rb_root new_root = RB_ROOT;
1956 while (*p != NULL) {
1958 iter = rb_entry(parent, struct hist_entry, rb_node);
1960 if (hist_entry__sort(he, iter) > 0)
1963 p = &(*p)->rb_right;
1966 rb_link_node(&he->rb_node, parent, p);
1967 rb_insert_color(&he->rb_node, root);
1969 if (he->leaf || he->filtered)
1972 nd = rb_first(&he->hroot_out);
1974 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1977 rb_erase(&h->rb_node, &he->hroot_out);
1979 resort_filtered_entry(&new_root, h);
1982 he->hroot_out = new_root;
1985 static void hists__filter_hierarchy(struct hists *hists, int type, const void *arg)
1988 struct rb_root new_root = RB_ROOT;
1990 hists->stats.nr_non_filtered_samples = 0;
1992 hists__reset_filter_stats(hists);
1993 hists__reset_col_len(hists);
1995 nd = rb_first(&hists->entries);
1997 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2000 ret = hist_entry__filter(h, type, arg);
2003 * case 1. non-matching type
2004 * zero out the period, set filter marker and move to child
2007 memset(&h->stat, 0, sizeof(h->stat));
2008 h->filtered |= (1 << type);
2010 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_CHILD);
2013 * case 2. matched type (filter out)
2014 * set filter marker and move to next
2016 else if (ret == 1) {
2017 h->filtered |= (1 << type);
2019 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);
2022 * case 3. ok (not filtered)
2023 * add period to hists and parents, erase the filter marker
2024 * and move to next sibling
2027 hists__remove_entry_filter(hists, h, type);
2029 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);
2033 hierarchy_recalc_total_periods(hists);
2036 * resort output after applying a new filter since filter in a lower
2037 * hierarchy can change periods in a upper hierarchy.
2039 nd = rb_first(&hists->entries);
2041 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2044 rb_erase(&h->rb_node, &hists->entries);
2046 resort_filtered_entry(&new_root, h);
2049 hists->entries = new_root;
2052 void hists__filter_by_thread(struct hists *hists)
2054 if (symbol_conf.report_hierarchy)
2055 hists__filter_hierarchy(hists, HIST_FILTER__THREAD,
2056 hists->thread_filter);
2058 hists__filter_by_type(hists, HIST_FILTER__THREAD,
2059 hists__filter_entry_by_thread);
2062 void hists__filter_by_dso(struct hists *hists)
2064 if (symbol_conf.report_hierarchy)
2065 hists__filter_hierarchy(hists, HIST_FILTER__DSO,
2068 hists__filter_by_type(hists, HIST_FILTER__DSO,
2069 hists__filter_entry_by_dso);
2072 void hists__filter_by_symbol(struct hists *hists)
2074 if (symbol_conf.report_hierarchy)
2075 hists__filter_hierarchy(hists, HIST_FILTER__SYMBOL,
2076 hists->symbol_filter_str);
2078 hists__filter_by_type(hists, HIST_FILTER__SYMBOL,
2079 hists__filter_entry_by_symbol);
2082 void hists__filter_by_socket(struct hists *hists)
2084 if (symbol_conf.report_hierarchy)
2085 hists__filter_hierarchy(hists, HIST_FILTER__SOCKET,
2086 &hists->socket_filter);
2088 hists__filter_by_type(hists, HIST_FILTER__SOCKET,
2089 hists__filter_entry_by_socket);
2092 void events_stats__inc(struct events_stats *stats, u32 type)
2094 ++stats->nr_events[0];
2095 ++stats->nr_events[type];
2098 void hists__inc_nr_events(struct hists *hists, u32 type)
2100 events_stats__inc(&hists->stats, type);
2103 void hists__inc_nr_samples(struct hists *hists, bool filtered)
2105 events_stats__inc(&hists->stats, PERF_RECORD_SAMPLE);
2107 hists->stats.nr_non_filtered_samples++;
2110 static struct hist_entry *hists__add_dummy_entry(struct hists *hists,
2111 struct hist_entry *pair)
2113 struct rb_root *root;
2115 struct rb_node *parent = NULL;
2116 struct hist_entry *he;
2119 if (hists__has(hists, need_collapse))
2120 root = &hists->entries_collapsed;
2122 root = hists->entries_in;
2126 while (*p != NULL) {
2128 he = rb_entry(parent, struct hist_entry, rb_node_in);
2130 cmp = hist_entry__collapse(he, pair);
2138 p = &(*p)->rb_right;
2141 he = hist_entry__new(pair, true);
2143 memset(&he->stat, 0, sizeof(he->stat));
2145 if (symbol_conf.cumulate_callchain)
2146 memset(he->stat_acc, 0, sizeof(he->stat));
2147 rb_link_node(&he->rb_node_in, parent, p);
2148 rb_insert_color(&he->rb_node_in, root);
2149 hists__inc_stats(hists, he);
2156 static struct hist_entry *add_dummy_hierarchy_entry(struct hists *hists,
2157 struct rb_root *root,
2158 struct hist_entry *pair)
2161 struct rb_node *parent = NULL;
2162 struct hist_entry *he;
2163 struct perf_hpp_fmt *fmt;
2166 while (*p != NULL) {
2170 he = rb_entry(parent, struct hist_entry, rb_node_in);
2172 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) {
2173 cmp = fmt->collapse(fmt, he, pair);
2181 p = &parent->rb_left;
2183 p = &parent->rb_right;
2186 he = hist_entry__new(pair, true);
2188 rb_link_node(&he->rb_node_in, parent, p);
2189 rb_insert_color(&he->rb_node_in, root);
2193 memset(&he->stat, 0, sizeof(he->stat));
2194 hists__inc_stats(hists, he);
2200 static struct hist_entry *hists__find_entry(struct hists *hists,
2201 struct hist_entry *he)
2205 if (hists__has(hists, need_collapse))
2206 n = hists->entries_collapsed.rb_node;
2208 n = hists->entries_in->rb_node;
2211 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in);
2212 int64_t cmp = hist_entry__collapse(iter, he);
2225 static struct hist_entry *hists__find_hierarchy_entry(struct rb_root *root,
2226 struct hist_entry *he)
2228 struct rb_node *n = root->rb_node;
2231 struct hist_entry *iter;
2232 struct perf_hpp_fmt *fmt;
2235 iter = rb_entry(n, struct hist_entry, rb_node_in);
2236 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) {
2237 cmp = fmt->collapse(fmt, iter, he);
2253 static void hists__match_hierarchy(struct rb_root *leader_root,
2254 struct rb_root *other_root)
2257 struct hist_entry *pos, *pair;
2259 for (nd = rb_first(leader_root); nd; nd = rb_next(nd)) {
2260 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2261 pair = hists__find_hierarchy_entry(other_root, pos);
2264 hist_entry__add_pair(pair, pos);
2265 hists__match_hierarchy(&pos->hroot_in, &pair->hroot_in);
2271 * Look for pairs to link to the leader buckets (hist_entries):
2273 void hists__match(struct hists *leader, struct hists *other)
2275 struct rb_root *root;
2277 struct hist_entry *pos, *pair;
2279 if (symbol_conf.report_hierarchy) {
2280 /* hierarchy report always collapses entries */
2281 return hists__match_hierarchy(&leader->entries_collapsed,
2282 &other->entries_collapsed);
2285 if (hists__has(leader, need_collapse))
2286 root = &leader->entries_collapsed;
2288 root = leader->entries_in;
2290 for (nd = rb_first(root); nd; nd = rb_next(nd)) {
2291 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2292 pair = hists__find_entry(other, pos);
2295 hist_entry__add_pair(pair, pos);
2299 static int hists__link_hierarchy(struct hists *leader_hists,
2300 struct hist_entry *parent,
2301 struct rb_root *leader_root,
2302 struct rb_root *other_root)
2305 struct hist_entry *pos, *leader;
2307 for (nd = rb_first(other_root); nd; nd = rb_next(nd)) {
2308 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2310 if (hist_entry__has_pairs(pos)) {
2313 list_for_each_entry(leader, &pos->pairs.head, pairs.node) {
2314 if (leader->hists == leader_hists) {
2322 leader = add_dummy_hierarchy_entry(leader_hists,
2327 /* do not point parent in the pos */
2328 leader->parent_he = parent;
2330 hist_entry__add_pair(pos, leader);
2334 if (hists__link_hierarchy(leader_hists, leader,
2336 &pos->hroot_in) < 0)
2344 * Look for entries in the other hists that are not present in the leader, if
2345 * we find them, just add a dummy entry on the leader hists, with period=0,
2346 * nr_events=0, to serve as the list header.
2348 int hists__link(struct hists *leader, struct hists *other)
2350 struct rb_root *root;
2352 struct hist_entry *pos, *pair;
2354 if (symbol_conf.report_hierarchy) {
2355 /* hierarchy report always collapses entries */
2356 return hists__link_hierarchy(leader, NULL,
2357 &leader->entries_collapsed,
2358 &other->entries_collapsed);
2361 if (hists__has(other, need_collapse))
2362 root = &other->entries_collapsed;
2364 root = other->entries_in;
2366 for (nd = rb_first(root); nd; nd = rb_next(nd)) {
2367 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2369 if (!hist_entry__has_pairs(pos)) {
2370 pair = hists__add_dummy_entry(leader, pos);
2373 hist_entry__add_pair(pos, pair);
2380 void hist__account_cycles(struct branch_stack *bs, struct addr_location *al,
2381 struct perf_sample *sample, bool nonany_branch_mode)
2383 struct branch_info *bi;
2385 /* If we have branch cycles always annotate them. */
2386 if (bs && bs->nr && bs->entries[0].flags.cycles) {
2389 bi = sample__resolve_bstack(sample, al);
2391 struct addr_map_symbol *prev = NULL;
2394 * Ignore errors, still want to process the
2397 * For non standard branch modes always
2398 * force no IPC (prev == NULL)
2400 * Note that perf stores branches reversed from
2403 for (i = bs->nr - 1; i >= 0; i--) {
2404 addr_map_symbol__account_cycles(&bi[i].from,
2405 nonany_branch_mode ? NULL : prev,
2406 bi[i].flags.cycles);
2414 size_t perf_evlist__fprintf_nr_events(struct perf_evlist *evlist, FILE *fp)
2416 struct perf_evsel *pos;
2419 evlist__for_each_entry(evlist, pos) {
2420 ret += fprintf(fp, "%s stats:\n", perf_evsel__name(pos));
2421 ret += events_stats__fprintf(&evsel__hists(pos)->stats, fp);
2428 u64 hists__total_period(struct hists *hists)
2430 return symbol_conf.filter_relative ? hists->stats.total_non_filtered_period :
2431 hists->stats.total_period;
2434 int parse_filter_percentage(const struct option *opt __maybe_unused,
2435 const char *arg, int unset __maybe_unused)
2437 if (!strcmp(arg, "relative"))
2438 symbol_conf.filter_relative = true;
2439 else if (!strcmp(arg, "absolute"))
2440 symbol_conf.filter_relative = false;
2447 int perf_hist_config(const char *var, const char *value)
2449 if (!strcmp(var, "hist.percentage"))
2450 return parse_filter_percentage(NULL, value, 0);
2455 int __hists__init(struct hists *hists, struct perf_hpp_list *hpp_list)
2457 memset(hists, 0, sizeof(*hists));
2458 hists->entries_in_array[0] = hists->entries_in_array[1] = RB_ROOT;
2459 hists->entries_in = &hists->entries_in_array[0];
2460 hists->entries_collapsed = RB_ROOT;
2461 hists->entries = RB_ROOT;
2462 pthread_mutex_init(&hists->lock, NULL);
2463 hists->socket_filter = -1;
2464 hists->hpp_list = hpp_list;
2465 INIT_LIST_HEAD(&hists->hpp_formats);
2469 static void hists__delete_remaining_entries(struct rb_root *root)
2471 struct rb_node *node;
2472 struct hist_entry *he;
2474 while (!RB_EMPTY_ROOT(root)) {
2475 node = rb_first(root);
2476 rb_erase(node, root);
2478 he = rb_entry(node, struct hist_entry, rb_node_in);
2479 hist_entry__delete(he);
2483 static void hists__delete_all_entries(struct hists *hists)
2485 hists__delete_entries(hists);
2486 hists__delete_remaining_entries(&hists->entries_in_array[0]);
2487 hists__delete_remaining_entries(&hists->entries_in_array[1]);
2488 hists__delete_remaining_entries(&hists->entries_collapsed);
2491 static void hists_evsel__exit(struct perf_evsel *evsel)
2493 struct hists *hists = evsel__hists(evsel);
2494 struct perf_hpp_fmt *fmt, *pos;
2495 struct perf_hpp_list_node *node, *tmp;
2497 hists__delete_all_entries(hists);
2499 list_for_each_entry_safe(node, tmp, &hists->hpp_formats, list) {
2500 perf_hpp_list__for_each_format_safe(&node->hpp, fmt, pos) {
2501 list_del(&fmt->list);
2504 list_del(&node->list);
2509 static int hists_evsel__init(struct perf_evsel *evsel)
2511 struct hists *hists = evsel__hists(evsel);
2513 __hists__init(hists, &perf_hpp_list);
2518 * XXX We probably need a hists_evsel__exit() to free the hist_entries
2519 * stored in the rbtree...
2522 int hists__init(void)
2524 int err = perf_evsel__object_config(sizeof(struct hists_evsel),
2528 fputs("FATAL ERROR: Couldn't setup hists class\n", stderr);
2533 void perf_hpp_list__init(struct perf_hpp_list *list)
2535 INIT_LIST_HEAD(&list->fields);
2536 INIT_LIST_HEAD(&list->sorts);