6 #include "namespaces.h"
13 #include "ui/progress.h"
16 #include <sys/param.h>
18 static bool hists__filter_entry_by_dso(struct hists *hists,
19 struct hist_entry *he);
20 static bool hists__filter_entry_by_thread(struct hists *hists,
21 struct hist_entry *he);
22 static bool hists__filter_entry_by_symbol(struct hists *hists,
23 struct hist_entry *he);
24 static bool hists__filter_entry_by_socket(struct hists *hists,
25 struct hist_entry *he);
27 u16 hists__col_len(struct hists *hists, enum hist_column col)
29 return hists->col_len[col];
32 void hists__set_col_len(struct hists *hists, enum hist_column col, u16 len)
34 hists->col_len[col] = len;
37 bool hists__new_col_len(struct hists *hists, enum hist_column col, u16 len)
39 if (len > hists__col_len(hists, col)) {
40 hists__set_col_len(hists, col, len);
46 void hists__reset_col_len(struct hists *hists)
50 for (col = 0; col < HISTC_NR_COLS; ++col)
51 hists__set_col_len(hists, col, 0);
54 static void hists__set_unres_dso_col_len(struct hists *hists, int dso)
56 const unsigned int unresolved_col_width = BITS_PER_LONG / 4;
58 if (hists__col_len(hists, dso) < unresolved_col_width &&
59 !symbol_conf.col_width_list_str && !symbol_conf.field_sep &&
60 !symbol_conf.dso_list)
61 hists__set_col_len(hists, dso, unresolved_col_width);
64 void hists__calc_col_len(struct hists *hists, struct hist_entry *h)
66 const unsigned int unresolved_col_width = BITS_PER_LONG / 4;
71 * +4 accounts for '[x] ' priv level info
72 * +2 accounts for 0x prefix on raw addresses
73 * +3 accounts for ' y ' symtab origin info
76 symlen = h->ms.sym->namelen + 4;
78 symlen += BITS_PER_LONG / 4 + 2 + 3;
79 hists__new_col_len(hists, HISTC_SYMBOL, symlen);
81 symlen = unresolved_col_width + 4 + 2;
82 hists__new_col_len(hists, HISTC_SYMBOL, symlen);
83 hists__set_unres_dso_col_len(hists, HISTC_DSO);
86 len = thread__comm_len(h->thread);
87 if (hists__new_col_len(hists, HISTC_COMM, len))
88 hists__set_col_len(hists, HISTC_THREAD, len + 8);
91 len = dso__name_len(h->ms.map->dso);
92 hists__new_col_len(hists, HISTC_DSO, len);
96 hists__new_col_len(hists, HISTC_PARENT, h->parent->namelen);
99 if (h->branch_info->from.sym) {
100 symlen = (int)h->branch_info->from.sym->namelen + 4;
102 symlen += BITS_PER_LONG / 4 + 2 + 3;
103 hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen);
105 symlen = dso__name_len(h->branch_info->from.map->dso);
106 hists__new_col_len(hists, HISTC_DSO_FROM, symlen);
108 symlen = unresolved_col_width + 4 + 2;
109 hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen);
110 hists__set_unres_dso_col_len(hists, HISTC_DSO_FROM);
113 if (h->branch_info->to.sym) {
114 symlen = (int)h->branch_info->to.sym->namelen + 4;
116 symlen += BITS_PER_LONG / 4 + 2 + 3;
117 hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen);
119 symlen = dso__name_len(h->branch_info->to.map->dso);
120 hists__new_col_len(hists, HISTC_DSO_TO, symlen);
122 symlen = unresolved_col_width + 4 + 2;
123 hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen);
124 hists__set_unres_dso_col_len(hists, HISTC_DSO_TO);
127 if (h->branch_info->srcline_from)
128 hists__new_col_len(hists, HISTC_SRCLINE_FROM,
129 strlen(h->branch_info->srcline_from));
130 if (h->branch_info->srcline_to)
131 hists__new_col_len(hists, HISTC_SRCLINE_TO,
132 strlen(h->branch_info->srcline_to));
136 if (h->mem_info->daddr.sym) {
137 symlen = (int)h->mem_info->daddr.sym->namelen + 4
138 + unresolved_col_width + 2;
139 hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL,
141 hists__new_col_len(hists, HISTC_MEM_DCACHELINE,
144 symlen = unresolved_col_width + 4 + 2;
145 hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL,
147 hists__new_col_len(hists, HISTC_MEM_DCACHELINE,
151 if (h->mem_info->iaddr.sym) {
152 symlen = (int)h->mem_info->iaddr.sym->namelen + 4
153 + unresolved_col_width + 2;
154 hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL,
157 symlen = unresolved_col_width + 4 + 2;
158 hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL,
162 if (h->mem_info->daddr.map) {
163 symlen = dso__name_len(h->mem_info->daddr.map->dso);
164 hists__new_col_len(hists, HISTC_MEM_DADDR_DSO,
167 symlen = unresolved_col_width + 4 + 2;
168 hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO);
171 symlen = unresolved_col_width + 4 + 2;
172 hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL, symlen);
173 hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL, symlen);
174 hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO);
177 hists__new_col_len(hists, HISTC_CGROUP_ID, 20);
178 hists__new_col_len(hists, HISTC_CPU, 3);
179 hists__new_col_len(hists, HISTC_SOCKET, 6);
180 hists__new_col_len(hists, HISTC_MEM_LOCKED, 6);
181 hists__new_col_len(hists, HISTC_MEM_TLB, 22);
182 hists__new_col_len(hists, HISTC_MEM_SNOOP, 12);
183 hists__new_col_len(hists, HISTC_MEM_LVL, 21 + 3);
184 hists__new_col_len(hists, HISTC_LOCAL_WEIGHT, 12);
185 hists__new_col_len(hists, HISTC_GLOBAL_WEIGHT, 12);
188 len = MAX(strlen(h->srcline), strlen(sort_srcline.se_header));
189 hists__new_col_len(hists, HISTC_SRCLINE, len);
193 hists__new_col_len(hists, HISTC_SRCFILE, strlen(h->srcfile));
196 hists__new_col_len(hists, HISTC_TRANSACTION,
197 hist_entry__transaction_len());
200 hists__new_col_len(hists, HISTC_TRACE, strlen(h->trace_output));
203 void hists__output_recalc_col_len(struct hists *hists, int max_rows)
205 struct rb_node *next = rb_first(&hists->entries);
206 struct hist_entry *n;
209 hists__reset_col_len(hists);
211 while (next && row++ < max_rows) {
212 n = rb_entry(next, struct hist_entry, rb_node);
214 hists__calc_col_len(hists, n);
215 next = rb_next(&n->rb_node);
219 static void he_stat__add_cpumode_period(struct he_stat *he_stat,
220 unsigned int cpumode, u64 period)
223 case PERF_RECORD_MISC_KERNEL:
224 he_stat->period_sys += period;
226 case PERF_RECORD_MISC_USER:
227 he_stat->period_us += period;
229 case PERF_RECORD_MISC_GUEST_KERNEL:
230 he_stat->period_guest_sys += period;
232 case PERF_RECORD_MISC_GUEST_USER:
233 he_stat->period_guest_us += period;
240 static void he_stat__add_period(struct he_stat *he_stat, u64 period,
244 he_stat->period += period;
245 he_stat->weight += weight;
246 he_stat->nr_events += 1;
249 static void he_stat__add_stat(struct he_stat *dest, struct he_stat *src)
251 dest->period += src->period;
252 dest->period_sys += src->period_sys;
253 dest->period_us += src->period_us;
254 dest->period_guest_sys += src->period_guest_sys;
255 dest->period_guest_us += src->period_guest_us;
256 dest->nr_events += src->nr_events;
257 dest->weight += src->weight;
260 static void he_stat__decay(struct he_stat *he_stat)
262 he_stat->period = (he_stat->period * 7) / 8;
263 he_stat->nr_events = (he_stat->nr_events * 7) / 8;
264 /* XXX need decay for weight too? */
267 static void hists__delete_entry(struct hists *hists, struct hist_entry *he);
269 static bool hists__decay_entry(struct hists *hists, struct hist_entry *he)
271 u64 prev_period = he->stat.period;
274 if (prev_period == 0)
277 he_stat__decay(&he->stat);
278 if (symbol_conf.cumulate_callchain)
279 he_stat__decay(he->stat_acc);
280 decay_callchain(he->callchain);
282 diff = prev_period - he->stat.period;
285 hists->stats.total_period -= diff;
287 hists->stats.total_non_filtered_period -= diff;
291 struct hist_entry *child;
292 struct rb_node *node = rb_first(&he->hroot_out);
294 child = rb_entry(node, struct hist_entry, rb_node);
295 node = rb_next(node);
297 if (hists__decay_entry(hists, child))
298 hists__delete_entry(hists, child);
302 return he->stat.period == 0;
305 static void hists__delete_entry(struct hists *hists, struct hist_entry *he)
307 struct rb_root *root_in;
308 struct rb_root *root_out;
311 root_in = &he->parent_he->hroot_in;
312 root_out = &he->parent_he->hroot_out;
314 if (hists__has(hists, need_collapse))
315 root_in = &hists->entries_collapsed;
317 root_in = hists->entries_in;
318 root_out = &hists->entries;
321 rb_erase(&he->rb_node_in, root_in);
322 rb_erase(&he->rb_node, root_out);
326 --hists->nr_non_filtered_entries;
328 hist_entry__delete(he);
331 void hists__decay_entries(struct hists *hists, bool zap_user, bool zap_kernel)
333 struct rb_node *next = rb_first(&hists->entries);
334 struct hist_entry *n;
337 n = rb_entry(next, struct hist_entry, rb_node);
338 next = rb_next(&n->rb_node);
339 if (((zap_user && n->level == '.') ||
340 (zap_kernel && n->level != '.') ||
341 hists__decay_entry(hists, n))) {
342 hists__delete_entry(hists, n);
347 void hists__delete_entries(struct hists *hists)
349 struct rb_node *next = rb_first(&hists->entries);
350 struct hist_entry *n;
353 n = rb_entry(next, struct hist_entry, rb_node);
354 next = rb_next(&n->rb_node);
356 hists__delete_entry(hists, n);
361 * histogram, sorted on item, collects periods
364 static int hist_entry__init(struct hist_entry *he,
365 struct hist_entry *template,
370 if (symbol_conf.cumulate_callchain) {
371 he->stat_acc = malloc(sizeof(he->stat));
372 if (he->stat_acc == NULL)
374 memcpy(he->stat_acc, &he->stat, sizeof(he->stat));
376 memset(&he->stat, 0, sizeof(he->stat));
379 map__get(he->ms.map);
381 if (he->branch_info) {
383 * This branch info is (a part of) allocated from
384 * sample__resolve_bstack() and will be freed after
385 * adding new entries. So we need to save a copy.
387 he->branch_info = malloc(sizeof(*he->branch_info));
388 if (he->branch_info == NULL) {
389 map__zput(he->ms.map);
394 memcpy(he->branch_info, template->branch_info,
395 sizeof(*he->branch_info));
397 map__get(he->branch_info->from.map);
398 map__get(he->branch_info->to.map);
402 map__get(he->mem_info->iaddr.map);
403 map__get(he->mem_info->daddr.map);
406 if (symbol_conf.use_callchain)
407 callchain_init(he->callchain);
410 he->raw_data = memdup(he->raw_data, he->raw_size);
412 if (he->raw_data == NULL) {
413 map__put(he->ms.map);
414 if (he->branch_info) {
415 map__put(he->branch_info->from.map);
416 map__put(he->branch_info->to.map);
417 free(he->branch_info);
420 map__put(he->mem_info->iaddr.map);
421 map__put(he->mem_info->daddr.map);
427 INIT_LIST_HEAD(&he->pairs.node);
428 thread__get(he->thread);
429 he->hroot_in = RB_ROOT;
430 he->hroot_out = RB_ROOT;
432 if (!symbol_conf.report_hierarchy)
438 static void *hist_entry__zalloc(size_t size)
440 return zalloc(size + sizeof(struct hist_entry));
443 static void hist_entry__free(void *ptr)
448 static struct hist_entry_ops default_ops = {
449 .new = hist_entry__zalloc,
450 .free = hist_entry__free,
453 static struct hist_entry *hist_entry__new(struct hist_entry *template,
456 struct hist_entry_ops *ops = template->ops;
457 size_t callchain_size = 0;
458 struct hist_entry *he;
462 ops = template->ops = &default_ops;
464 if (symbol_conf.use_callchain)
465 callchain_size = sizeof(struct callchain_root);
467 he = ops->new(callchain_size);
469 err = hist_entry__init(he, template, sample_self);
479 static u8 symbol__parent_filter(const struct symbol *parent)
481 if (symbol_conf.exclude_other && parent == NULL)
482 return 1 << HIST_FILTER__PARENT;
486 static void hist_entry__add_callchain_period(struct hist_entry *he, u64 period)
488 if (!symbol_conf.use_callchain)
491 he->hists->callchain_period += period;
493 he->hists->callchain_non_filtered_period += period;
496 static struct hist_entry *hists__findnew_entry(struct hists *hists,
497 struct hist_entry *entry,
498 struct addr_location *al,
502 struct rb_node *parent = NULL;
503 struct hist_entry *he;
505 u64 period = entry->stat.period;
506 u64 weight = entry->stat.weight;
508 p = &hists->entries_in->rb_node;
512 he = rb_entry(parent, struct hist_entry, rb_node_in);
515 * Make sure that it receives arguments in a same order as
516 * hist_entry__collapse() so that we can use an appropriate
517 * function when searching an entry regardless which sort
520 cmp = hist_entry__cmp(he, entry);
524 he_stat__add_period(&he->stat, period, weight);
525 hist_entry__add_callchain_period(he, period);
527 if (symbol_conf.cumulate_callchain)
528 he_stat__add_period(he->stat_acc, period, weight);
531 * This mem info was allocated from sample__resolve_mem
532 * and will not be used anymore.
534 zfree(&entry->mem_info);
536 /* If the map of an existing hist_entry has
537 * become out-of-date due to an exec() or
538 * similar, update it. Otherwise we will
539 * mis-adjust symbol addresses when computing
540 * the history counter to increment.
542 if (he->ms.map != entry->ms.map) {
543 map__put(he->ms.map);
544 he->ms.map = map__get(entry->ms.map);
555 he = hist_entry__new(entry, sample_self);
560 hist_entry__add_callchain_period(he, period);
563 rb_link_node(&he->rb_node_in, parent, p);
564 rb_insert_color(&he->rb_node_in, hists->entries_in);
567 he_stat__add_cpumode_period(&he->stat, al->cpumode, period);
568 if (symbol_conf.cumulate_callchain)
569 he_stat__add_cpumode_period(he->stat_acc, al->cpumode, period);
573 static struct hist_entry*
574 __hists__add_entry(struct hists *hists,
575 struct addr_location *al,
576 struct symbol *sym_parent,
577 struct branch_info *bi,
579 struct perf_sample *sample,
581 struct hist_entry_ops *ops)
583 struct namespaces *ns = thread__namespaces(al->thread);
584 struct hist_entry entry = {
585 .thread = al->thread,
586 .comm = thread__comm(al->thread),
588 .dev = ns ? ns->link_info[CGROUP_NS_INDEX].dev : 0,
589 .ino = ns ? ns->link_info[CGROUP_NS_INDEX].ino : 0,
595 .socket = al->socket,
597 .cpumode = al->cpumode,
602 .period = sample->period,
603 .weight = sample->weight,
605 .parent = sym_parent,
606 .filtered = symbol__parent_filter(sym_parent) | al->filtered,
610 .transaction = sample->transaction,
611 .raw_data = sample->raw_data,
612 .raw_size = sample->raw_size,
616 return hists__findnew_entry(hists, &entry, al, sample_self);
619 struct hist_entry *hists__add_entry(struct hists *hists,
620 struct addr_location *al,
621 struct symbol *sym_parent,
622 struct branch_info *bi,
624 struct perf_sample *sample,
627 return __hists__add_entry(hists, al, sym_parent, bi, mi,
628 sample, sample_self, NULL);
631 struct hist_entry *hists__add_entry_ops(struct hists *hists,
632 struct hist_entry_ops *ops,
633 struct addr_location *al,
634 struct symbol *sym_parent,
635 struct branch_info *bi,
637 struct perf_sample *sample,
640 return __hists__add_entry(hists, al, sym_parent, bi, mi,
641 sample, sample_self, ops);
645 iter_next_nop_entry(struct hist_entry_iter *iter __maybe_unused,
646 struct addr_location *al __maybe_unused)
652 iter_add_next_nop_entry(struct hist_entry_iter *iter __maybe_unused,
653 struct addr_location *al __maybe_unused)
659 iter_prepare_mem_entry(struct hist_entry_iter *iter, struct addr_location *al)
661 struct perf_sample *sample = iter->sample;
664 mi = sample__resolve_mem(sample, al);
673 iter_add_single_mem_entry(struct hist_entry_iter *iter, struct addr_location *al)
676 struct mem_info *mi = iter->priv;
677 struct hists *hists = evsel__hists(iter->evsel);
678 struct perf_sample *sample = iter->sample;
679 struct hist_entry *he;
684 cost = sample->weight;
689 * must pass period=weight in order to get the correct
690 * sorting from hists__collapse_resort() which is solely
691 * based on periods. We want sorting be done on nr_events * weight
692 * and this is indirectly achieved by passing period=weight here
693 * and the he_stat__add_period() function.
695 sample->period = cost;
697 he = hists__add_entry(hists, al, iter->parent, NULL, mi,
707 iter_finish_mem_entry(struct hist_entry_iter *iter,
708 struct addr_location *al __maybe_unused)
710 struct perf_evsel *evsel = iter->evsel;
711 struct hists *hists = evsel__hists(evsel);
712 struct hist_entry *he = iter->he;
718 hists__inc_nr_samples(hists, he->filtered);
720 err = hist_entry__append_callchain(he, iter->sample);
724 * We don't need to free iter->priv (mem_info) here since the mem info
725 * was either already freed in hists__findnew_entry() or passed to a
726 * new hist entry by hist_entry__new().
735 iter_prepare_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
737 struct branch_info *bi;
738 struct perf_sample *sample = iter->sample;
740 bi = sample__resolve_bstack(sample, al);
745 iter->total = sample->branch_stack->nr;
752 iter_add_single_branch_entry(struct hist_entry_iter *iter __maybe_unused,
753 struct addr_location *al __maybe_unused)
759 iter_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
761 struct branch_info *bi = iter->priv;
767 if (iter->curr >= iter->total)
770 al->map = bi[i].to.map;
771 al->sym = bi[i].to.sym;
772 al->addr = bi[i].to.addr;
777 iter_add_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
779 struct branch_info *bi;
780 struct perf_evsel *evsel = iter->evsel;
781 struct hists *hists = evsel__hists(evsel);
782 struct perf_sample *sample = iter->sample;
783 struct hist_entry *he = NULL;
789 if (iter->hide_unresolved && !(bi[i].from.sym && bi[i].to.sym))
793 * The report shows the percentage of total branches captured
794 * and not events sampled. Thus we use a pseudo period of 1.
797 sample->weight = bi->flags.cycles ? bi->flags.cycles : 1;
799 he = hists__add_entry(hists, al, iter->parent, &bi[i], NULL,
804 hists__inc_nr_samples(hists, he->filtered);
813 iter_finish_branch_entry(struct hist_entry_iter *iter,
814 struct addr_location *al __maybe_unused)
819 return iter->curr >= iter->total ? 0 : -1;
823 iter_prepare_normal_entry(struct hist_entry_iter *iter __maybe_unused,
824 struct addr_location *al __maybe_unused)
830 iter_add_single_normal_entry(struct hist_entry_iter *iter, struct addr_location *al)
832 struct perf_evsel *evsel = iter->evsel;
833 struct perf_sample *sample = iter->sample;
834 struct hist_entry *he;
836 he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,
846 iter_finish_normal_entry(struct hist_entry_iter *iter,
847 struct addr_location *al __maybe_unused)
849 struct hist_entry *he = iter->he;
850 struct perf_evsel *evsel = iter->evsel;
851 struct perf_sample *sample = iter->sample;
858 hists__inc_nr_samples(evsel__hists(evsel), he->filtered);
860 return hist_entry__append_callchain(he, sample);
864 iter_prepare_cumulative_entry(struct hist_entry_iter *iter,
865 struct addr_location *al __maybe_unused)
867 struct hist_entry **he_cache;
869 callchain_cursor_commit(&callchain_cursor);
872 * This is for detecting cycles or recursions so that they're
873 * cumulated only one time to prevent entries more than 100%
876 he_cache = malloc(sizeof(*he_cache) * (iter->max_stack + 1));
877 if (he_cache == NULL)
880 iter->priv = he_cache;
887 iter_add_single_cumulative_entry(struct hist_entry_iter *iter,
888 struct addr_location *al)
890 struct perf_evsel *evsel = iter->evsel;
891 struct hists *hists = evsel__hists(evsel);
892 struct perf_sample *sample = iter->sample;
893 struct hist_entry **he_cache = iter->priv;
894 struct hist_entry *he;
897 he = hists__add_entry(hists, al, iter->parent, NULL, NULL,
903 he_cache[iter->curr++] = he;
905 hist_entry__append_callchain(he, sample);
908 * We need to re-initialize the cursor since callchain_append()
909 * advanced the cursor to the end.
911 callchain_cursor_commit(&callchain_cursor);
913 hists__inc_nr_samples(hists, he->filtered);
919 iter_next_cumulative_entry(struct hist_entry_iter *iter,
920 struct addr_location *al)
922 struct callchain_cursor_node *node;
924 node = callchain_cursor_current(&callchain_cursor);
928 return fill_callchain_info(al, node, iter->hide_unresolved);
932 iter_add_next_cumulative_entry(struct hist_entry_iter *iter,
933 struct addr_location *al)
935 struct perf_evsel *evsel = iter->evsel;
936 struct perf_sample *sample = iter->sample;
937 struct hist_entry **he_cache = iter->priv;
938 struct hist_entry *he;
939 struct hist_entry he_tmp = {
940 .hists = evsel__hists(evsel),
942 .thread = al->thread,
943 .comm = thread__comm(al->thread),
949 .parent = iter->parent,
950 .raw_data = sample->raw_data,
951 .raw_size = sample->raw_size,
954 struct callchain_cursor cursor;
956 callchain_cursor_snapshot(&cursor, &callchain_cursor);
958 callchain_cursor_advance(&callchain_cursor);
961 * Check if there's duplicate entries in the callchain.
962 * It's possible that it has cycles or recursive calls.
964 for (i = 0; i < iter->curr; i++) {
965 if (hist_entry__cmp(he_cache[i], &he_tmp) == 0) {
966 /* to avoid calling callback function */
972 he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,
978 he_cache[iter->curr++] = he;
980 if (symbol_conf.use_callchain)
981 callchain_append(he->callchain, &cursor, sample->period);
986 iter_finish_cumulative_entry(struct hist_entry_iter *iter,
987 struct addr_location *al __maybe_unused)
995 const struct hist_iter_ops hist_iter_mem = {
996 .prepare_entry = iter_prepare_mem_entry,
997 .add_single_entry = iter_add_single_mem_entry,
998 .next_entry = iter_next_nop_entry,
999 .add_next_entry = iter_add_next_nop_entry,
1000 .finish_entry = iter_finish_mem_entry,
1003 const struct hist_iter_ops hist_iter_branch = {
1004 .prepare_entry = iter_prepare_branch_entry,
1005 .add_single_entry = iter_add_single_branch_entry,
1006 .next_entry = iter_next_branch_entry,
1007 .add_next_entry = iter_add_next_branch_entry,
1008 .finish_entry = iter_finish_branch_entry,
1011 const struct hist_iter_ops hist_iter_normal = {
1012 .prepare_entry = iter_prepare_normal_entry,
1013 .add_single_entry = iter_add_single_normal_entry,
1014 .next_entry = iter_next_nop_entry,
1015 .add_next_entry = iter_add_next_nop_entry,
1016 .finish_entry = iter_finish_normal_entry,
1019 const struct hist_iter_ops hist_iter_cumulative = {
1020 .prepare_entry = iter_prepare_cumulative_entry,
1021 .add_single_entry = iter_add_single_cumulative_entry,
1022 .next_entry = iter_next_cumulative_entry,
1023 .add_next_entry = iter_add_next_cumulative_entry,
1024 .finish_entry = iter_finish_cumulative_entry,
1027 int hist_entry_iter__add(struct hist_entry_iter *iter, struct addr_location *al,
1028 int max_stack_depth, void *arg)
1031 struct map *alm = NULL;
1034 alm = map__get(al->map);
1036 err = sample__resolve_callchain(iter->sample, &callchain_cursor, &iter->parent,
1037 iter->evsel, al, max_stack_depth);
1041 iter->max_stack = max_stack_depth;
1043 err = iter->ops->prepare_entry(iter, al);
1047 err = iter->ops->add_single_entry(iter, al);
1051 if (iter->he && iter->add_entry_cb) {
1052 err = iter->add_entry_cb(iter, al, true, arg);
1057 while (iter->ops->next_entry(iter, al)) {
1058 err = iter->ops->add_next_entry(iter, al);
1062 if (iter->he && iter->add_entry_cb) {
1063 err = iter->add_entry_cb(iter, al, false, arg);
1070 err2 = iter->ops->finish_entry(iter, al);
1080 hist_entry__cmp(struct hist_entry *left, struct hist_entry *right)
1082 struct hists *hists = left->hists;
1083 struct perf_hpp_fmt *fmt;
1086 hists__for_each_sort_list(hists, fmt) {
1087 if (perf_hpp__is_dynamic_entry(fmt) &&
1088 !perf_hpp__defined_dynamic_entry(fmt, hists))
1091 cmp = fmt->cmp(fmt, left, right);
1100 hist_entry__collapse(struct hist_entry *left, struct hist_entry *right)
1102 struct hists *hists = left->hists;
1103 struct perf_hpp_fmt *fmt;
1106 hists__for_each_sort_list(hists, fmt) {
1107 if (perf_hpp__is_dynamic_entry(fmt) &&
1108 !perf_hpp__defined_dynamic_entry(fmt, hists))
1111 cmp = fmt->collapse(fmt, left, right);
1119 void hist_entry__delete(struct hist_entry *he)
1121 struct hist_entry_ops *ops = he->ops;
1123 thread__zput(he->thread);
1124 map__zput(he->ms.map);
1126 if (he->branch_info) {
1127 map__zput(he->branch_info->from.map);
1128 map__zput(he->branch_info->to.map);
1129 free_srcline(he->branch_info->srcline_from);
1130 free_srcline(he->branch_info->srcline_to);
1131 zfree(&he->branch_info);
1135 map__zput(he->mem_info->iaddr.map);
1136 map__zput(he->mem_info->daddr.map);
1137 zfree(&he->mem_info);
1140 if (he->inline_node) {
1141 inline_node__delete(he->inline_node);
1142 he->inline_node = NULL;
1145 zfree(&he->stat_acc);
1146 free_srcline(he->srcline);
1147 if (he->srcfile && he->srcfile[0])
1149 free_callchain(he->callchain);
1150 free(he->trace_output);
1156 * If this is not the last column, then we need to pad it according to the
1157 * pre-calculated max lenght for this column, otherwise don't bother adding
1158 * spaces because that would break viewing this with, for instance, 'less',
1159 * that would show tons of trailing spaces when a long C++ demangled method
1162 int hist_entry__snprintf_alignment(struct hist_entry *he, struct perf_hpp *hpp,
1163 struct perf_hpp_fmt *fmt, int printed)
1165 if (!list_is_last(&fmt->list, &he->hists->hpp_list->fields)) {
1166 const int width = fmt->width(fmt, hpp, he->hists);
1167 if (printed < width) {
1168 advance_hpp(hpp, printed);
1169 printed = scnprintf(hpp->buf, hpp->size, "%-*s", width - printed, " ");
1177 * collapse the histogram
1180 static void hists__apply_filters(struct hists *hists, struct hist_entry *he);
1181 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *he,
1182 enum hist_filter type);
1184 typedef bool (*fmt_chk_fn)(struct perf_hpp_fmt *fmt);
1186 static bool check_thread_entry(struct perf_hpp_fmt *fmt)
1188 return perf_hpp__is_thread_entry(fmt) || perf_hpp__is_comm_entry(fmt);
1191 static void hist_entry__check_and_remove_filter(struct hist_entry *he,
1192 enum hist_filter type,
1195 struct perf_hpp_fmt *fmt;
1196 bool type_match = false;
1197 struct hist_entry *parent = he->parent_he;
1200 case HIST_FILTER__THREAD:
1201 if (symbol_conf.comm_list == NULL &&
1202 symbol_conf.pid_list == NULL &&
1203 symbol_conf.tid_list == NULL)
1206 case HIST_FILTER__DSO:
1207 if (symbol_conf.dso_list == NULL)
1210 case HIST_FILTER__SYMBOL:
1211 if (symbol_conf.sym_list == NULL)
1214 case HIST_FILTER__PARENT:
1215 case HIST_FILTER__GUEST:
1216 case HIST_FILTER__HOST:
1217 case HIST_FILTER__SOCKET:
1218 case HIST_FILTER__C2C:
1223 /* if it's filtered by own fmt, it has to have filter bits */
1224 perf_hpp_list__for_each_format(he->hpp_list, fmt) {
1233 * If the filter is for current level entry, propagate
1234 * filter marker to parents. The marker bit was
1235 * already set by default so it only needs to clear
1236 * non-filtered entries.
1238 if (!(he->filtered & (1 << type))) {
1240 parent->filtered &= ~(1 << type);
1241 parent = parent->parent_he;
1246 * If current entry doesn't have matching formats, set
1247 * filter marker for upper level entries. it will be
1248 * cleared if its lower level entries is not filtered.
1250 * For lower-level entries, it inherits parent's
1251 * filter bit so that lower level entries of a
1252 * non-filtered entry won't set the filter marker.
1255 he->filtered |= (1 << type);
1257 he->filtered |= (parent->filtered & (1 << type));
1261 static void hist_entry__apply_hierarchy_filters(struct hist_entry *he)
1263 hist_entry__check_and_remove_filter(he, HIST_FILTER__THREAD,
1264 check_thread_entry);
1266 hist_entry__check_and_remove_filter(he, HIST_FILTER__DSO,
1267 perf_hpp__is_dso_entry);
1269 hist_entry__check_and_remove_filter(he, HIST_FILTER__SYMBOL,
1270 perf_hpp__is_sym_entry);
1272 hists__apply_filters(he->hists, he);
1275 static struct hist_entry *hierarchy_insert_entry(struct hists *hists,
1276 struct rb_root *root,
1277 struct hist_entry *he,
1278 struct hist_entry *parent_he,
1279 struct perf_hpp_list *hpp_list)
1281 struct rb_node **p = &root->rb_node;
1282 struct rb_node *parent = NULL;
1283 struct hist_entry *iter, *new;
1284 struct perf_hpp_fmt *fmt;
1287 while (*p != NULL) {
1289 iter = rb_entry(parent, struct hist_entry, rb_node_in);
1292 perf_hpp_list__for_each_sort_list(hpp_list, fmt) {
1293 cmp = fmt->collapse(fmt, iter, he);
1299 he_stat__add_stat(&iter->stat, &he->stat);
1304 p = &parent->rb_left;
1306 p = &parent->rb_right;
1309 new = hist_entry__new(he, true);
1313 hists->nr_entries++;
1315 /* save related format list for output */
1316 new->hpp_list = hpp_list;
1317 new->parent_he = parent_he;
1319 hist_entry__apply_hierarchy_filters(new);
1321 /* some fields are now passed to 'new' */
1322 perf_hpp_list__for_each_sort_list(hpp_list, fmt) {
1323 if (perf_hpp__is_trace_entry(fmt) || perf_hpp__is_dynamic_entry(fmt))
1324 he->trace_output = NULL;
1326 new->trace_output = NULL;
1328 if (perf_hpp__is_srcline_entry(fmt))
1331 new->srcline = NULL;
1333 if (perf_hpp__is_srcfile_entry(fmt))
1336 new->srcfile = NULL;
1339 rb_link_node(&new->rb_node_in, parent, p);
1340 rb_insert_color(&new->rb_node_in, root);
1344 static int hists__hierarchy_insert_entry(struct hists *hists,
1345 struct rb_root *root,
1346 struct hist_entry *he)
1348 struct perf_hpp_list_node *node;
1349 struct hist_entry *new_he = NULL;
1350 struct hist_entry *parent = NULL;
1354 list_for_each_entry(node, &hists->hpp_formats, list) {
1355 /* skip period (overhead) and elided columns */
1356 if (node->level == 0 || node->skip)
1359 /* insert copy of 'he' for each fmt into the hierarchy */
1360 new_he = hierarchy_insert_entry(hists, root, he, parent, &node->hpp);
1361 if (new_he == NULL) {
1366 root = &new_he->hroot_in;
1367 new_he->depth = depth++;
1372 new_he->leaf = true;
1374 if (symbol_conf.use_callchain) {
1375 callchain_cursor_reset(&callchain_cursor);
1376 if (callchain_merge(&callchain_cursor,
1383 /* 'he' is no longer used */
1384 hist_entry__delete(he);
1386 /* return 0 (or -1) since it already applied filters */
1390 static int hists__collapse_insert_entry(struct hists *hists,
1391 struct rb_root *root,
1392 struct hist_entry *he)
1394 struct rb_node **p = &root->rb_node;
1395 struct rb_node *parent = NULL;
1396 struct hist_entry *iter;
1399 if (symbol_conf.report_hierarchy)
1400 return hists__hierarchy_insert_entry(hists, root, he);
1402 while (*p != NULL) {
1404 iter = rb_entry(parent, struct hist_entry, rb_node_in);
1406 cmp = hist_entry__collapse(iter, he);
1411 he_stat__add_stat(&iter->stat, &he->stat);
1412 if (symbol_conf.cumulate_callchain)
1413 he_stat__add_stat(iter->stat_acc, he->stat_acc);
1415 if (symbol_conf.use_callchain) {
1416 callchain_cursor_reset(&callchain_cursor);
1417 if (callchain_merge(&callchain_cursor,
1422 hist_entry__delete(he);
1429 p = &(*p)->rb_right;
1431 hists->nr_entries++;
1433 rb_link_node(&he->rb_node_in, parent, p);
1434 rb_insert_color(&he->rb_node_in, root);
1438 struct rb_root *hists__get_rotate_entries_in(struct hists *hists)
1440 struct rb_root *root;
1442 pthread_mutex_lock(&hists->lock);
1444 root = hists->entries_in;
1445 if (++hists->entries_in > &hists->entries_in_array[1])
1446 hists->entries_in = &hists->entries_in_array[0];
1448 pthread_mutex_unlock(&hists->lock);
1453 static void hists__apply_filters(struct hists *hists, struct hist_entry *he)
1455 hists__filter_entry_by_dso(hists, he);
1456 hists__filter_entry_by_thread(hists, he);
1457 hists__filter_entry_by_symbol(hists, he);
1458 hists__filter_entry_by_socket(hists, he);
1461 int hists__collapse_resort(struct hists *hists, struct ui_progress *prog)
1463 struct rb_root *root;
1464 struct rb_node *next;
1465 struct hist_entry *n;
1468 if (!hists__has(hists, need_collapse))
1471 hists->nr_entries = 0;
1473 root = hists__get_rotate_entries_in(hists);
1475 next = rb_first(root);
1480 n = rb_entry(next, struct hist_entry, rb_node_in);
1481 next = rb_next(&n->rb_node_in);
1483 rb_erase(&n->rb_node_in, root);
1484 ret = hists__collapse_insert_entry(hists, &hists->entries_collapsed, n);
1490 * If it wasn't combined with one of the entries already
1491 * collapsed, we need to apply the filters that may have
1492 * been set by, say, the hist_browser.
1494 hists__apply_filters(hists, n);
1497 ui_progress__update(prog, 1);
1502 static int hist_entry__sort(struct hist_entry *a, struct hist_entry *b)
1504 struct hists *hists = a->hists;
1505 struct perf_hpp_fmt *fmt;
1508 hists__for_each_sort_list(hists, fmt) {
1509 if (perf_hpp__should_skip(fmt, a->hists))
1512 cmp = fmt->sort(fmt, a, b);
1520 static void hists__reset_filter_stats(struct hists *hists)
1522 hists->nr_non_filtered_entries = 0;
1523 hists->stats.total_non_filtered_period = 0;
1526 void hists__reset_stats(struct hists *hists)
1528 hists->nr_entries = 0;
1529 hists->stats.total_period = 0;
1531 hists__reset_filter_stats(hists);
1534 static void hists__inc_filter_stats(struct hists *hists, struct hist_entry *h)
1536 hists->nr_non_filtered_entries++;
1537 hists->stats.total_non_filtered_period += h->stat.period;
1540 void hists__inc_stats(struct hists *hists, struct hist_entry *h)
1543 hists__inc_filter_stats(hists, h);
1545 hists->nr_entries++;
1546 hists->stats.total_period += h->stat.period;
1549 static void hierarchy_recalc_total_periods(struct hists *hists)
1551 struct rb_node *node;
1552 struct hist_entry *he;
1554 node = rb_first(&hists->entries);
1556 hists->stats.total_period = 0;
1557 hists->stats.total_non_filtered_period = 0;
1560 * recalculate total period using top-level entries only
1561 * since lower level entries only see non-filtered entries
1562 * but upper level entries have sum of both entries.
1565 he = rb_entry(node, struct hist_entry, rb_node);
1566 node = rb_next(node);
1568 hists->stats.total_period += he->stat.period;
1570 hists->stats.total_non_filtered_period += he->stat.period;
1574 static void hierarchy_insert_output_entry(struct rb_root *root,
1575 struct hist_entry *he)
1577 struct rb_node **p = &root->rb_node;
1578 struct rb_node *parent = NULL;
1579 struct hist_entry *iter;
1580 struct perf_hpp_fmt *fmt;
1582 while (*p != NULL) {
1584 iter = rb_entry(parent, struct hist_entry, rb_node);
1586 if (hist_entry__sort(he, iter) > 0)
1587 p = &parent->rb_left;
1589 p = &parent->rb_right;
1592 rb_link_node(&he->rb_node, parent, p);
1593 rb_insert_color(&he->rb_node, root);
1595 /* update column width of dynamic entry */
1596 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) {
1597 if (perf_hpp__is_dynamic_entry(fmt))
1598 fmt->sort(fmt, he, NULL);
1602 static void hists__hierarchy_output_resort(struct hists *hists,
1603 struct ui_progress *prog,
1604 struct rb_root *root_in,
1605 struct rb_root *root_out,
1606 u64 min_callchain_hits,
1609 struct rb_node *node;
1610 struct hist_entry *he;
1612 *root_out = RB_ROOT;
1613 node = rb_first(root_in);
1616 he = rb_entry(node, struct hist_entry, rb_node_in);
1617 node = rb_next(node);
1619 hierarchy_insert_output_entry(root_out, he);
1622 ui_progress__update(prog, 1);
1624 hists->nr_entries++;
1625 if (!he->filtered) {
1626 hists->nr_non_filtered_entries++;
1627 hists__calc_col_len(hists, he);
1631 hists__hierarchy_output_resort(hists, prog,
1642 if (callchain_param.mode == CHAIN_GRAPH_REL) {
1643 u64 total = he->stat.period;
1645 if (symbol_conf.cumulate_callchain)
1646 total = he->stat_acc->period;
1648 min_callchain_hits = total * (callchain_param.min_percent / 100);
1651 callchain_param.sort(&he->sorted_chain, he->callchain,
1652 min_callchain_hits, &callchain_param);
1656 static void __hists__insert_output_entry(struct rb_root *entries,
1657 struct hist_entry *he,
1658 u64 min_callchain_hits,
1661 struct rb_node **p = &entries->rb_node;
1662 struct rb_node *parent = NULL;
1663 struct hist_entry *iter;
1664 struct perf_hpp_fmt *fmt;
1666 if (use_callchain) {
1667 if (callchain_param.mode == CHAIN_GRAPH_REL) {
1668 u64 total = he->stat.period;
1670 if (symbol_conf.cumulate_callchain)
1671 total = he->stat_acc->period;
1673 min_callchain_hits = total * (callchain_param.min_percent / 100);
1675 callchain_param.sort(&he->sorted_chain, he->callchain,
1676 min_callchain_hits, &callchain_param);
1679 while (*p != NULL) {
1681 iter = rb_entry(parent, struct hist_entry, rb_node);
1683 if (hist_entry__sort(he, iter) > 0)
1686 p = &(*p)->rb_right;
1689 rb_link_node(&he->rb_node, parent, p);
1690 rb_insert_color(&he->rb_node, entries);
1692 perf_hpp_list__for_each_sort_list(&perf_hpp_list, fmt) {
1693 if (perf_hpp__is_dynamic_entry(fmt) &&
1694 perf_hpp__defined_dynamic_entry(fmt, he->hists))
1695 fmt->sort(fmt, he, NULL); /* update column width */
1699 static void output_resort(struct hists *hists, struct ui_progress *prog,
1700 bool use_callchain, hists__resort_cb_t cb)
1702 struct rb_root *root;
1703 struct rb_node *next;
1704 struct hist_entry *n;
1705 u64 callchain_total;
1706 u64 min_callchain_hits;
1708 callchain_total = hists->callchain_period;
1709 if (symbol_conf.filter_relative)
1710 callchain_total = hists->callchain_non_filtered_period;
1712 min_callchain_hits = callchain_total * (callchain_param.min_percent / 100);
1714 hists__reset_stats(hists);
1715 hists__reset_col_len(hists);
1717 if (symbol_conf.report_hierarchy) {
1718 hists__hierarchy_output_resort(hists, prog,
1719 &hists->entries_collapsed,
1723 hierarchy_recalc_total_periods(hists);
1727 if (hists__has(hists, need_collapse))
1728 root = &hists->entries_collapsed;
1730 root = hists->entries_in;
1732 next = rb_first(root);
1733 hists->entries = RB_ROOT;
1736 n = rb_entry(next, struct hist_entry, rb_node_in);
1737 next = rb_next(&n->rb_node_in);
1742 __hists__insert_output_entry(&hists->entries, n, min_callchain_hits, use_callchain);
1743 hists__inc_stats(hists, n);
1746 hists__calc_col_len(hists, n);
1749 ui_progress__update(prog, 1);
1753 void perf_evsel__output_resort(struct perf_evsel *evsel, struct ui_progress *prog)
1757 if (evsel && symbol_conf.use_callchain && !symbol_conf.show_ref_callgraph)
1758 use_callchain = evsel->attr.sample_type & PERF_SAMPLE_CALLCHAIN;
1760 use_callchain = symbol_conf.use_callchain;
1762 use_callchain |= symbol_conf.show_branchflag_count;
1764 output_resort(evsel__hists(evsel), prog, use_callchain, NULL);
1767 void hists__output_resort(struct hists *hists, struct ui_progress *prog)
1769 output_resort(hists, prog, symbol_conf.use_callchain, NULL);
1772 void hists__output_resort_cb(struct hists *hists, struct ui_progress *prog,
1773 hists__resort_cb_t cb)
1775 output_resort(hists, prog, symbol_conf.use_callchain, cb);
1778 static bool can_goto_child(struct hist_entry *he, enum hierarchy_move_dir hmd)
1780 if (he->leaf || hmd == HMD_FORCE_SIBLING)
1783 if (he->unfolded || hmd == HMD_FORCE_CHILD)
1789 struct rb_node *rb_hierarchy_last(struct rb_node *node)
1791 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
1793 while (can_goto_child(he, HMD_NORMAL)) {
1794 node = rb_last(&he->hroot_out);
1795 he = rb_entry(node, struct hist_entry, rb_node);
1800 struct rb_node *__rb_hierarchy_next(struct rb_node *node, enum hierarchy_move_dir hmd)
1802 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
1804 if (can_goto_child(he, hmd))
1805 node = rb_first(&he->hroot_out);
1807 node = rb_next(node);
1809 while (node == NULL) {
1814 node = rb_next(&he->rb_node);
1819 struct rb_node *rb_hierarchy_prev(struct rb_node *node)
1821 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
1823 node = rb_prev(node);
1825 return rb_hierarchy_last(node);
1831 return &he->rb_node;
1834 bool hist_entry__has_hierarchy_children(struct hist_entry *he, float limit)
1836 struct rb_node *node;
1837 struct hist_entry *child;
1843 node = rb_first(&he->hroot_out);
1844 child = rb_entry(node, struct hist_entry, rb_node);
1846 while (node && child->filtered) {
1847 node = rb_next(node);
1848 child = rb_entry(node, struct hist_entry, rb_node);
1852 percent = hist_entry__get_percent_limit(child);
1856 return node && percent >= limit;
1859 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h,
1860 enum hist_filter filter)
1862 h->filtered &= ~(1 << filter);
1864 if (symbol_conf.report_hierarchy) {
1865 struct hist_entry *parent = h->parent_he;
1868 he_stat__add_stat(&parent->stat, &h->stat);
1870 parent->filtered &= ~(1 << filter);
1872 if (parent->filtered)
1875 /* force fold unfiltered entry for simplicity */
1876 parent->unfolded = false;
1877 parent->has_no_entry = false;
1878 parent->row_offset = 0;
1879 parent->nr_rows = 0;
1881 parent = parent->parent_he;
1888 /* force fold unfiltered entry for simplicity */
1889 h->unfolded = false;
1890 h->has_no_entry = false;
1894 hists->stats.nr_non_filtered_samples += h->stat.nr_events;
1896 hists__inc_filter_stats(hists, h);
1897 hists__calc_col_len(hists, h);
1901 static bool hists__filter_entry_by_dso(struct hists *hists,
1902 struct hist_entry *he)
1904 if (hists->dso_filter != NULL &&
1905 (he->ms.map == NULL || he->ms.map->dso != hists->dso_filter)) {
1906 he->filtered |= (1 << HIST_FILTER__DSO);
1913 static bool hists__filter_entry_by_thread(struct hists *hists,
1914 struct hist_entry *he)
1916 if (hists->thread_filter != NULL &&
1917 he->thread != hists->thread_filter) {
1918 he->filtered |= (1 << HIST_FILTER__THREAD);
1925 static bool hists__filter_entry_by_symbol(struct hists *hists,
1926 struct hist_entry *he)
1928 if (hists->symbol_filter_str != NULL &&
1929 (!he->ms.sym || strstr(he->ms.sym->name,
1930 hists->symbol_filter_str) == NULL)) {
1931 he->filtered |= (1 << HIST_FILTER__SYMBOL);
1938 static bool hists__filter_entry_by_socket(struct hists *hists,
1939 struct hist_entry *he)
1941 if ((hists->socket_filter > -1) &&
1942 (he->socket != hists->socket_filter)) {
1943 he->filtered |= (1 << HIST_FILTER__SOCKET);
1950 typedef bool (*filter_fn_t)(struct hists *hists, struct hist_entry *he);
1952 static void hists__filter_by_type(struct hists *hists, int type, filter_fn_t filter)
1956 hists->stats.nr_non_filtered_samples = 0;
1958 hists__reset_filter_stats(hists);
1959 hists__reset_col_len(hists);
1961 for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
1962 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1964 if (filter(hists, h))
1967 hists__remove_entry_filter(hists, h, type);
1971 static void resort_filtered_entry(struct rb_root *root, struct hist_entry *he)
1973 struct rb_node **p = &root->rb_node;
1974 struct rb_node *parent = NULL;
1975 struct hist_entry *iter;
1976 struct rb_root new_root = RB_ROOT;
1979 while (*p != NULL) {
1981 iter = rb_entry(parent, struct hist_entry, rb_node);
1983 if (hist_entry__sort(he, iter) > 0)
1986 p = &(*p)->rb_right;
1989 rb_link_node(&he->rb_node, parent, p);
1990 rb_insert_color(&he->rb_node, root);
1992 if (he->leaf || he->filtered)
1995 nd = rb_first(&he->hroot_out);
1997 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2000 rb_erase(&h->rb_node, &he->hroot_out);
2002 resort_filtered_entry(&new_root, h);
2005 he->hroot_out = new_root;
2008 static void hists__filter_hierarchy(struct hists *hists, int type, const void *arg)
2011 struct rb_root new_root = RB_ROOT;
2013 hists->stats.nr_non_filtered_samples = 0;
2015 hists__reset_filter_stats(hists);
2016 hists__reset_col_len(hists);
2018 nd = rb_first(&hists->entries);
2020 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2023 ret = hist_entry__filter(h, type, arg);
2026 * case 1. non-matching type
2027 * zero out the period, set filter marker and move to child
2030 memset(&h->stat, 0, sizeof(h->stat));
2031 h->filtered |= (1 << type);
2033 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_CHILD);
2036 * case 2. matched type (filter out)
2037 * set filter marker and move to next
2039 else if (ret == 1) {
2040 h->filtered |= (1 << type);
2042 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);
2045 * case 3. ok (not filtered)
2046 * add period to hists and parents, erase the filter marker
2047 * and move to next sibling
2050 hists__remove_entry_filter(hists, h, type);
2052 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);
2056 hierarchy_recalc_total_periods(hists);
2059 * resort output after applying a new filter since filter in a lower
2060 * hierarchy can change periods in a upper hierarchy.
2062 nd = rb_first(&hists->entries);
2064 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2067 rb_erase(&h->rb_node, &hists->entries);
2069 resort_filtered_entry(&new_root, h);
2072 hists->entries = new_root;
2075 void hists__filter_by_thread(struct hists *hists)
2077 if (symbol_conf.report_hierarchy)
2078 hists__filter_hierarchy(hists, HIST_FILTER__THREAD,
2079 hists->thread_filter);
2081 hists__filter_by_type(hists, HIST_FILTER__THREAD,
2082 hists__filter_entry_by_thread);
2085 void hists__filter_by_dso(struct hists *hists)
2087 if (symbol_conf.report_hierarchy)
2088 hists__filter_hierarchy(hists, HIST_FILTER__DSO,
2091 hists__filter_by_type(hists, HIST_FILTER__DSO,
2092 hists__filter_entry_by_dso);
2095 void hists__filter_by_symbol(struct hists *hists)
2097 if (symbol_conf.report_hierarchy)
2098 hists__filter_hierarchy(hists, HIST_FILTER__SYMBOL,
2099 hists->symbol_filter_str);
2101 hists__filter_by_type(hists, HIST_FILTER__SYMBOL,
2102 hists__filter_entry_by_symbol);
2105 void hists__filter_by_socket(struct hists *hists)
2107 if (symbol_conf.report_hierarchy)
2108 hists__filter_hierarchy(hists, HIST_FILTER__SOCKET,
2109 &hists->socket_filter);
2111 hists__filter_by_type(hists, HIST_FILTER__SOCKET,
2112 hists__filter_entry_by_socket);
2115 void events_stats__inc(struct events_stats *stats, u32 type)
2117 ++stats->nr_events[0];
2118 ++stats->nr_events[type];
2121 void hists__inc_nr_events(struct hists *hists, u32 type)
2123 events_stats__inc(&hists->stats, type);
2126 void hists__inc_nr_samples(struct hists *hists, bool filtered)
2128 events_stats__inc(&hists->stats, PERF_RECORD_SAMPLE);
2130 hists->stats.nr_non_filtered_samples++;
2133 static struct hist_entry *hists__add_dummy_entry(struct hists *hists,
2134 struct hist_entry *pair)
2136 struct rb_root *root;
2138 struct rb_node *parent = NULL;
2139 struct hist_entry *he;
2142 if (hists__has(hists, need_collapse))
2143 root = &hists->entries_collapsed;
2145 root = hists->entries_in;
2149 while (*p != NULL) {
2151 he = rb_entry(parent, struct hist_entry, rb_node_in);
2153 cmp = hist_entry__collapse(he, pair);
2161 p = &(*p)->rb_right;
2164 he = hist_entry__new(pair, true);
2166 memset(&he->stat, 0, sizeof(he->stat));
2168 if (symbol_conf.cumulate_callchain)
2169 memset(he->stat_acc, 0, sizeof(he->stat));
2170 rb_link_node(&he->rb_node_in, parent, p);
2171 rb_insert_color(&he->rb_node_in, root);
2172 hists__inc_stats(hists, he);
2179 static struct hist_entry *add_dummy_hierarchy_entry(struct hists *hists,
2180 struct rb_root *root,
2181 struct hist_entry *pair)
2184 struct rb_node *parent = NULL;
2185 struct hist_entry *he;
2186 struct perf_hpp_fmt *fmt;
2189 while (*p != NULL) {
2193 he = rb_entry(parent, struct hist_entry, rb_node_in);
2195 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) {
2196 cmp = fmt->collapse(fmt, he, pair);
2204 p = &parent->rb_left;
2206 p = &parent->rb_right;
2209 he = hist_entry__new(pair, true);
2211 rb_link_node(&he->rb_node_in, parent, p);
2212 rb_insert_color(&he->rb_node_in, root);
2216 memset(&he->stat, 0, sizeof(he->stat));
2217 hists__inc_stats(hists, he);
2223 static struct hist_entry *hists__find_entry(struct hists *hists,
2224 struct hist_entry *he)
2228 if (hists__has(hists, need_collapse))
2229 n = hists->entries_collapsed.rb_node;
2231 n = hists->entries_in->rb_node;
2234 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in);
2235 int64_t cmp = hist_entry__collapse(iter, he);
2248 static struct hist_entry *hists__find_hierarchy_entry(struct rb_root *root,
2249 struct hist_entry *he)
2251 struct rb_node *n = root->rb_node;
2254 struct hist_entry *iter;
2255 struct perf_hpp_fmt *fmt;
2258 iter = rb_entry(n, struct hist_entry, rb_node_in);
2259 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) {
2260 cmp = fmt->collapse(fmt, iter, he);
2276 static void hists__match_hierarchy(struct rb_root *leader_root,
2277 struct rb_root *other_root)
2280 struct hist_entry *pos, *pair;
2282 for (nd = rb_first(leader_root); nd; nd = rb_next(nd)) {
2283 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2284 pair = hists__find_hierarchy_entry(other_root, pos);
2287 hist_entry__add_pair(pair, pos);
2288 hists__match_hierarchy(&pos->hroot_in, &pair->hroot_in);
2294 * Look for pairs to link to the leader buckets (hist_entries):
2296 void hists__match(struct hists *leader, struct hists *other)
2298 struct rb_root *root;
2300 struct hist_entry *pos, *pair;
2302 if (symbol_conf.report_hierarchy) {
2303 /* hierarchy report always collapses entries */
2304 return hists__match_hierarchy(&leader->entries_collapsed,
2305 &other->entries_collapsed);
2308 if (hists__has(leader, need_collapse))
2309 root = &leader->entries_collapsed;
2311 root = leader->entries_in;
2313 for (nd = rb_first(root); nd; nd = rb_next(nd)) {
2314 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2315 pair = hists__find_entry(other, pos);
2318 hist_entry__add_pair(pair, pos);
2322 static int hists__link_hierarchy(struct hists *leader_hists,
2323 struct hist_entry *parent,
2324 struct rb_root *leader_root,
2325 struct rb_root *other_root)
2328 struct hist_entry *pos, *leader;
2330 for (nd = rb_first(other_root); nd; nd = rb_next(nd)) {
2331 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2333 if (hist_entry__has_pairs(pos)) {
2336 list_for_each_entry(leader, &pos->pairs.head, pairs.node) {
2337 if (leader->hists == leader_hists) {
2345 leader = add_dummy_hierarchy_entry(leader_hists,
2350 /* do not point parent in the pos */
2351 leader->parent_he = parent;
2353 hist_entry__add_pair(pos, leader);
2357 if (hists__link_hierarchy(leader_hists, leader,
2359 &pos->hroot_in) < 0)
2367 * Look for entries in the other hists that are not present in the leader, if
2368 * we find them, just add a dummy entry on the leader hists, with period=0,
2369 * nr_events=0, to serve as the list header.
2371 int hists__link(struct hists *leader, struct hists *other)
2373 struct rb_root *root;
2375 struct hist_entry *pos, *pair;
2377 if (symbol_conf.report_hierarchy) {
2378 /* hierarchy report always collapses entries */
2379 return hists__link_hierarchy(leader, NULL,
2380 &leader->entries_collapsed,
2381 &other->entries_collapsed);
2384 if (hists__has(other, need_collapse))
2385 root = &other->entries_collapsed;
2387 root = other->entries_in;
2389 for (nd = rb_first(root); nd; nd = rb_next(nd)) {
2390 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2392 if (!hist_entry__has_pairs(pos)) {
2393 pair = hists__add_dummy_entry(leader, pos);
2396 hist_entry__add_pair(pos, pair);
2403 void hist__account_cycles(struct branch_stack *bs, struct addr_location *al,
2404 struct perf_sample *sample, bool nonany_branch_mode)
2406 struct branch_info *bi;
2408 /* If we have branch cycles always annotate them. */
2409 if (bs && bs->nr && bs->entries[0].flags.cycles) {
2412 bi = sample__resolve_bstack(sample, al);
2414 struct addr_map_symbol *prev = NULL;
2417 * Ignore errors, still want to process the
2420 * For non standard branch modes always
2421 * force no IPC (prev == NULL)
2423 * Note that perf stores branches reversed from
2426 for (i = bs->nr - 1; i >= 0; i--) {
2427 addr_map_symbol__account_cycles(&bi[i].from,
2428 nonany_branch_mode ? NULL : prev,
2429 bi[i].flags.cycles);
2437 size_t perf_evlist__fprintf_nr_events(struct perf_evlist *evlist, FILE *fp)
2439 struct perf_evsel *pos;
2442 evlist__for_each_entry(evlist, pos) {
2443 ret += fprintf(fp, "%s stats:\n", perf_evsel__name(pos));
2444 ret += events_stats__fprintf(&evsel__hists(pos)->stats, fp);
2451 u64 hists__total_period(struct hists *hists)
2453 return symbol_conf.filter_relative ? hists->stats.total_non_filtered_period :
2454 hists->stats.total_period;
2457 int parse_filter_percentage(const struct option *opt __maybe_unused,
2458 const char *arg, int unset __maybe_unused)
2460 if (!strcmp(arg, "relative"))
2461 symbol_conf.filter_relative = true;
2462 else if (!strcmp(arg, "absolute"))
2463 symbol_conf.filter_relative = false;
2465 pr_debug("Invalid percentage: %s\n", arg);
2472 int perf_hist_config(const char *var, const char *value)
2474 if (!strcmp(var, "hist.percentage"))
2475 return parse_filter_percentage(NULL, value, 0);
2480 int __hists__init(struct hists *hists, struct perf_hpp_list *hpp_list)
2482 memset(hists, 0, sizeof(*hists));
2483 hists->entries_in_array[0] = hists->entries_in_array[1] = RB_ROOT;
2484 hists->entries_in = &hists->entries_in_array[0];
2485 hists->entries_collapsed = RB_ROOT;
2486 hists->entries = RB_ROOT;
2487 pthread_mutex_init(&hists->lock, NULL);
2488 hists->socket_filter = -1;
2489 hists->hpp_list = hpp_list;
2490 INIT_LIST_HEAD(&hists->hpp_formats);
2494 static void hists__delete_remaining_entries(struct rb_root *root)
2496 struct rb_node *node;
2497 struct hist_entry *he;
2499 while (!RB_EMPTY_ROOT(root)) {
2500 node = rb_first(root);
2501 rb_erase(node, root);
2503 he = rb_entry(node, struct hist_entry, rb_node_in);
2504 hist_entry__delete(he);
2508 static void hists__delete_all_entries(struct hists *hists)
2510 hists__delete_entries(hists);
2511 hists__delete_remaining_entries(&hists->entries_in_array[0]);
2512 hists__delete_remaining_entries(&hists->entries_in_array[1]);
2513 hists__delete_remaining_entries(&hists->entries_collapsed);
2516 static void hists_evsel__exit(struct perf_evsel *evsel)
2518 struct hists *hists = evsel__hists(evsel);
2519 struct perf_hpp_fmt *fmt, *pos;
2520 struct perf_hpp_list_node *node, *tmp;
2522 hists__delete_all_entries(hists);
2524 list_for_each_entry_safe(node, tmp, &hists->hpp_formats, list) {
2525 perf_hpp_list__for_each_format_safe(&node->hpp, fmt, pos) {
2526 list_del(&fmt->list);
2529 list_del(&node->list);
2534 static int hists_evsel__init(struct perf_evsel *evsel)
2536 struct hists *hists = evsel__hists(evsel);
2538 __hists__init(hists, &perf_hpp_list);
2543 * XXX We probably need a hists_evsel__exit() to free the hist_entries
2544 * stored in the rbtree...
2547 int hists__init(void)
2549 int err = perf_evsel__object_config(sizeof(struct hists_evsel),
2553 fputs("FATAL ERROR: Couldn't setup hists class\n", stderr);
2558 void perf_hpp_list__init(struct perf_hpp_list *list)
2560 INIT_LIST_HEAD(&list->fields);
2561 INIT_LIST_HEAD(&list->sorts);