1 // SPDX-License-Identifier: GPL-2.0
8 #include "map_symbol.h"
10 #include "mem-events.h"
12 #include "namespaces.h"
22 #include "block-info.h"
23 #include "ui/progress.h"
27 #include <sys/param.h>
28 #include <linux/rbtree.h>
29 #include <linux/string.h>
30 #include <linux/time64.h>
31 #include <linux/zalloc.h>
33 static bool hists__filter_entry_by_dso(struct hists *hists,
34 struct hist_entry *he);
35 static bool hists__filter_entry_by_thread(struct hists *hists,
36 struct hist_entry *he);
37 static bool hists__filter_entry_by_symbol(struct hists *hists,
38 struct hist_entry *he);
39 static bool hists__filter_entry_by_socket(struct hists *hists,
40 struct hist_entry *he);
42 u16 hists__col_len(struct hists *hists, enum hist_column col)
44 return hists->col_len[col];
47 void hists__set_col_len(struct hists *hists, enum hist_column col, u16 len)
49 hists->col_len[col] = len;
52 bool hists__new_col_len(struct hists *hists, enum hist_column col, u16 len)
54 if (len > hists__col_len(hists, col)) {
55 hists__set_col_len(hists, col, len);
61 void hists__reset_col_len(struct hists *hists)
65 for (col = 0; col < HISTC_NR_COLS; ++col)
66 hists__set_col_len(hists, col, 0);
69 static void hists__set_unres_dso_col_len(struct hists *hists, int dso)
71 const unsigned int unresolved_col_width = BITS_PER_LONG / 4;
73 if (hists__col_len(hists, dso) < unresolved_col_width &&
74 !symbol_conf.col_width_list_str && !symbol_conf.field_sep &&
75 !symbol_conf.dso_list)
76 hists__set_col_len(hists, dso, unresolved_col_width);
79 void hists__calc_col_len(struct hists *hists, struct hist_entry *h)
81 const unsigned int unresolved_col_width = BITS_PER_LONG / 4;
88 * +4 accounts for '[x] ' priv level info
89 * +2 accounts for 0x prefix on raw addresses
90 * +3 accounts for ' y ' symtab origin info
93 symlen = h->ms.sym->namelen + 4;
95 symlen += BITS_PER_LONG / 4 + 2 + 3;
96 hists__new_col_len(hists, HISTC_SYMBOL, symlen);
98 symlen = unresolved_col_width + 4 + 2;
99 hists__new_col_len(hists, HISTC_SYMBOL, symlen);
100 hists__set_unres_dso_col_len(hists, HISTC_DSO);
103 len = thread__comm_len(h->thread);
104 if (hists__new_col_len(hists, HISTC_COMM, len))
105 hists__set_col_len(hists, HISTC_THREAD, len + 8);
108 len = dso__name_len(h->ms.map->dso);
109 hists__new_col_len(hists, HISTC_DSO, len);
113 hists__new_col_len(hists, HISTC_PARENT, h->parent->namelen);
115 if (h->branch_info) {
116 if (h->branch_info->from.ms.sym) {
117 symlen = (int)h->branch_info->from.ms.sym->namelen + 4;
119 symlen += BITS_PER_LONG / 4 + 2 + 3;
120 hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen);
122 symlen = dso__name_len(h->branch_info->from.ms.map->dso);
123 hists__new_col_len(hists, HISTC_DSO_FROM, symlen);
125 symlen = unresolved_col_width + 4 + 2;
126 hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen);
127 hists__set_unres_dso_col_len(hists, HISTC_DSO_FROM);
130 if (h->branch_info->to.ms.sym) {
131 symlen = (int)h->branch_info->to.ms.sym->namelen + 4;
133 symlen += BITS_PER_LONG / 4 + 2 + 3;
134 hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen);
136 symlen = dso__name_len(h->branch_info->to.ms.map->dso);
137 hists__new_col_len(hists, HISTC_DSO_TO, symlen);
139 symlen = unresolved_col_width + 4 + 2;
140 hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen);
141 hists__set_unres_dso_col_len(hists, HISTC_DSO_TO);
144 if (h->branch_info->srcline_from)
145 hists__new_col_len(hists, HISTC_SRCLINE_FROM,
146 strlen(h->branch_info->srcline_from));
147 if (h->branch_info->srcline_to)
148 hists__new_col_len(hists, HISTC_SRCLINE_TO,
149 strlen(h->branch_info->srcline_to));
153 if (h->mem_info->daddr.ms.sym) {
154 symlen = (int)h->mem_info->daddr.ms.sym->namelen + 4
155 + unresolved_col_width + 2;
156 hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL,
158 hists__new_col_len(hists, HISTC_MEM_DCACHELINE,
161 symlen = unresolved_col_width + 4 + 2;
162 hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL,
164 hists__new_col_len(hists, HISTC_MEM_DCACHELINE,
168 if (h->mem_info->iaddr.ms.sym) {
169 symlen = (int)h->mem_info->iaddr.ms.sym->namelen + 4
170 + unresolved_col_width + 2;
171 hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL,
174 symlen = unresolved_col_width + 4 + 2;
175 hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL,
179 if (h->mem_info->daddr.ms.map) {
180 symlen = dso__name_len(h->mem_info->daddr.ms.map->dso);
181 hists__new_col_len(hists, HISTC_MEM_DADDR_DSO,
184 symlen = unresolved_col_width + 4 + 2;
185 hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO);
188 hists__new_col_len(hists, HISTC_MEM_PHYS_DADDR,
189 unresolved_col_width + 4 + 2);
191 hists__new_col_len(hists, HISTC_MEM_DATA_PAGE_SIZE,
192 unresolved_col_width + 4 + 2);
195 symlen = unresolved_col_width + 4 + 2;
196 hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL, symlen);
197 hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL, symlen);
198 hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO);
201 hists__new_col_len(hists, HISTC_CGROUP, 6);
202 hists__new_col_len(hists, HISTC_CGROUP_ID, 20);
203 hists__new_col_len(hists, HISTC_CPU, 3);
204 hists__new_col_len(hists, HISTC_SOCKET, 6);
205 hists__new_col_len(hists, HISTC_MEM_LOCKED, 6);
206 hists__new_col_len(hists, HISTC_MEM_TLB, 22);
207 hists__new_col_len(hists, HISTC_MEM_SNOOP, 12);
208 hists__new_col_len(hists, HISTC_MEM_LVL, 21 + 3);
209 hists__new_col_len(hists, HISTC_LOCAL_WEIGHT, 12);
210 hists__new_col_len(hists, HISTC_GLOBAL_WEIGHT, 12);
211 hists__new_col_len(hists, HISTC_MEM_BLOCKED, 10);
212 hists__new_col_len(hists, HISTC_LOCAL_INS_LAT, 13);
213 hists__new_col_len(hists, HISTC_GLOBAL_INS_LAT, 13);
214 hists__new_col_len(hists, HISTC_P_STAGE_CYC, 13);
215 if (symbol_conf.nanosecs)
216 hists__new_col_len(hists, HISTC_TIME, 16);
218 hists__new_col_len(hists, HISTC_TIME, 12);
219 hists__new_col_len(hists, HISTC_CODE_PAGE_SIZE, 6);
222 len = MAX(strlen(h->srcline), strlen(sort_srcline.se_header));
223 hists__new_col_len(hists, HISTC_SRCLINE, len);
227 hists__new_col_len(hists, HISTC_SRCFILE, strlen(h->srcfile));
230 hists__new_col_len(hists, HISTC_TRANSACTION,
231 hist_entry__transaction_len());
234 hists__new_col_len(hists, HISTC_TRACE, strlen(h->trace_output));
237 const char *cgrp_name = "unknown";
238 struct cgroup *cgrp = cgroup__find(h->ms.maps->machine->env,
241 cgrp_name = cgrp->name;
243 hists__new_col_len(hists, HISTC_CGROUP, strlen(cgrp_name));
247 void hists__output_recalc_col_len(struct hists *hists, int max_rows)
249 struct rb_node *next = rb_first_cached(&hists->entries);
250 struct hist_entry *n;
253 hists__reset_col_len(hists);
255 while (next && row++ < max_rows) {
256 n = rb_entry(next, struct hist_entry, rb_node);
258 hists__calc_col_len(hists, n);
259 next = rb_next(&n->rb_node);
263 static void he_stat__add_cpumode_period(struct he_stat *he_stat,
264 unsigned int cpumode, u64 period)
267 case PERF_RECORD_MISC_KERNEL:
268 he_stat->period_sys += period;
270 case PERF_RECORD_MISC_USER:
271 he_stat->period_us += period;
273 case PERF_RECORD_MISC_GUEST_KERNEL:
274 he_stat->period_guest_sys += period;
276 case PERF_RECORD_MISC_GUEST_USER:
277 he_stat->period_guest_us += period;
284 static long hist_time(unsigned long htime)
286 unsigned long time_quantum = symbol_conf.time_quantum;
288 return (htime / time_quantum) * time_quantum;
292 static void he_stat__add_period(struct he_stat *he_stat, u64 period,
293 u64 weight, u64 ins_lat, u64 p_stage_cyc)
296 he_stat->period += period;
297 he_stat->weight += weight;
298 he_stat->nr_events += 1;
299 he_stat->ins_lat += ins_lat;
300 he_stat->p_stage_cyc += p_stage_cyc;
303 static void he_stat__add_stat(struct he_stat *dest, struct he_stat *src)
305 dest->period += src->period;
306 dest->period_sys += src->period_sys;
307 dest->period_us += src->period_us;
308 dest->period_guest_sys += src->period_guest_sys;
309 dest->period_guest_us += src->period_guest_us;
310 dest->nr_events += src->nr_events;
311 dest->weight += src->weight;
312 dest->ins_lat += src->ins_lat;
313 dest->p_stage_cyc += src->p_stage_cyc;
316 static void he_stat__decay(struct he_stat *he_stat)
318 he_stat->period = (he_stat->period * 7) / 8;
319 he_stat->nr_events = (he_stat->nr_events * 7) / 8;
320 /* XXX need decay for weight too? */
323 static void hists__delete_entry(struct hists *hists, struct hist_entry *he);
325 static bool hists__decay_entry(struct hists *hists, struct hist_entry *he)
327 u64 prev_period = he->stat.period;
330 if (prev_period == 0)
333 he_stat__decay(&he->stat);
334 if (symbol_conf.cumulate_callchain)
335 he_stat__decay(he->stat_acc);
336 decay_callchain(he->callchain);
338 diff = prev_period - he->stat.period;
341 hists->stats.total_period -= diff;
343 hists->stats.total_non_filtered_period -= diff;
347 struct hist_entry *child;
348 struct rb_node *node = rb_first_cached(&he->hroot_out);
350 child = rb_entry(node, struct hist_entry, rb_node);
351 node = rb_next(node);
353 if (hists__decay_entry(hists, child))
354 hists__delete_entry(hists, child);
358 return he->stat.period == 0;
361 static void hists__delete_entry(struct hists *hists, struct hist_entry *he)
363 struct rb_root_cached *root_in;
364 struct rb_root_cached *root_out;
367 root_in = &he->parent_he->hroot_in;
368 root_out = &he->parent_he->hroot_out;
370 if (hists__has(hists, need_collapse))
371 root_in = &hists->entries_collapsed;
373 root_in = hists->entries_in;
374 root_out = &hists->entries;
377 rb_erase_cached(&he->rb_node_in, root_in);
378 rb_erase_cached(&he->rb_node, root_out);
382 --hists->nr_non_filtered_entries;
384 hist_entry__delete(he);
387 void hists__decay_entries(struct hists *hists, bool zap_user, bool zap_kernel)
389 struct rb_node *next = rb_first_cached(&hists->entries);
390 struct hist_entry *n;
393 n = rb_entry(next, struct hist_entry, rb_node);
394 next = rb_next(&n->rb_node);
395 if (((zap_user && n->level == '.') ||
396 (zap_kernel && n->level != '.') ||
397 hists__decay_entry(hists, n))) {
398 hists__delete_entry(hists, n);
403 void hists__delete_entries(struct hists *hists)
405 struct rb_node *next = rb_first_cached(&hists->entries);
406 struct hist_entry *n;
409 n = rb_entry(next, struct hist_entry, rb_node);
410 next = rb_next(&n->rb_node);
412 hists__delete_entry(hists, n);
416 struct hist_entry *hists__get_entry(struct hists *hists, int idx)
418 struct rb_node *next = rb_first_cached(&hists->entries);
419 struct hist_entry *n;
423 n = rb_entry(next, struct hist_entry, rb_node);
427 next = rb_next(&n->rb_node);
435 * histogram, sorted on item, collects periods
438 static int hist_entry__init(struct hist_entry *he,
439 struct hist_entry *template,
441 size_t callchain_size)
444 he->callchain_size = callchain_size;
446 if (symbol_conf.cumulate_callchain) {
447 he->stat_acc = malloc(sizeof(he->stat));
448 if (he->stat_acc == NULL)
450 memcpy(he->stat_acc, &he->stat, sizeof(he->stat));
452 memset(&he->stat, 0, sizeof(he->stat));
455 map__get(he->ms.map);
457 if (he->branch_info) {
459 * This branch info is (a part of) allocated from
460 * sample__resolve_bstack() and will be freed after
461 * adding new entries. So we need to save a copy.
463 he->branch_info = malloc(sizeof(*he->branch_info));
464 if (he->branch_info == NULL)
467 memcpy(he->branch_info, template->branch_info,
468 sizeof(*he->branch_info));
470 map__get(he->branch_info->from.ms.map);
471 map__get(he->branch_info->to.ms.map);
475 map__get(he->mem_info->iaddr.ms.map);
476 map__get(he->mem_info->daddr.ms.map);
479 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain)
480 callchain_init(he->callchain);
483 he->raw_data = memdup(he->raw_data, he->raw_size);
484 if (he->raw_data == NULL)
489 he->srcline = strdup(he->srcline);
490 if (he->srcline == NULL)
494 if (symbol_conf.res_sample) {
495 he->res_samples = calloc(sizeof(struct res_sample),
496 symbol_conf.res_sample);
497 if (!he->res_samples)
501 INIT_LIST_HEAD(&he->pairs.node);
502 thread__get(he->thread);
503 he->hroot_in = RB_ROOT_CACHED;
504 he->hroot_out = RB_ROOT_CACHED;
506 if (!symbol_conf.report_hierarchy)
515 zfree(&he->raw_data);
518 if (he->branch_info) {
519 map__put(he->branch_info->from.ms.map);
520 map__put(he->branch_info->to.ms.map);
521 zfree(&he->branch_info);
524 map__put(he->mem_info->iaddr.ms.map);
525 map__put(he->mem_info->daddr.ms.map);
528 map__zput(he->ms.map);
529 zfree(&he->stat_acc);
533 static void *hist_entry__zalloc(size_t size)
535 return zalloc(size + sizeof(struct hist_entry));
538 static void hist_entry__free(void *ptr)
543 static struct hist_entry_ops default_ops = {
544 .new = hist_entry__zalloc,
545 .free = hist_entry__free,
548 static struct hist_entry *hist_entry__new(struct hist_entry *template,
551 struct hist_entry_ops *ops = template->ops;
552 size_t callchain_size = 0;
553 struct hist_entry *he;
557 ops = template->ops = &default_ops;
559 if (symbol_conf.use_callchain)
560 callchain_size = sizeof(struct callchain_root);
562 he = ops->new(callchain_size);
564 err = hist_entry__init(he, template, sample_self, callchain_size);
574 static u8 symbol__parent_filter(const struct symbol *parent)
576 if (symbol_conf.exclude_other && parent == NULL)
577 return 1 << HIST_FILTER__PARENT;
581 static void hist_entry__add_callchain_period(struct hist_entry *he, u64 period)
583 if (!hist_entry__has_callchains(he) || !symbol_conf.use_callchain)
586 he->hists->callchain_period += period;
588 he->hists->callchain_non_filtered_period += period;
591 static struct hist_entry *hists__findnew_entry(struct hists *hists,
592 struct hist_entry *entry,
593 struct addr_location *al,
597 struct rb_node *parent = NULL;
598 struct hist_entry *he;
600 u64 period = entry->stat.period;
601 u64 weight = entry->stat.weight;
602 u64 ins_lat = entry->stat.ins_lat;
603 u64 p_stage_cyc = entry->stat.p_stage_cyc;
604 bool leftmost = true;
606 p = &hists->entries_in->rb_root.rb_node;
610 he = rb_entry(parent, struct hist_entry, rb_node_in);
613 * Make sure that it receives arguments in a same order as
614 * hist_entry__collapse() so that we can use an appropriate
615 * function when searching an entry regardless which sort
618 cmp = hist_entry__cmp(he, entry);
622 he_stat__add_period(&he->stat, period, weight, ins_lat, p_stage_cyc);
623 hist_entry__add_callchain_period(he, period);
625 if (symbol_conf.cumulate_callchain)
626 he_stat__add_period(he->stat_acc, period, weight, ins_lat, p_stage_cyc);
629 * This mem info was allocated from sample__resolve_mem
630 * and will not be used anymore.
632 mem_info__zput(entry->mem_info);
634 block_info__zput(entry->block_info);
636 /* If the map of an existing hist_entry has
637 * become out-of-date due to an exec() or
638 * similar, update it. Otherwise we will
639 * mis-adjust symbol addresses when computing
640 * the history counter to increment.
642 if (he->ms.map != entry->ms.map) {
643 map__put(he->ms.map);
644 he->ms.map = map__get(entry->ms.map);
657 he = hist_entry__new(entry, sample_self);
662 hist_entry__add_callchain_period(he, period);
665 rb_link_node(&he->rb_node_in, parent, p);
666 rb_insert_color_cached(&he->rb_node_in, hists->entries_in, leftmost);
669 he_stat__add_cpumode_period(&he->stat, al->cpumode, period);
670 if (symbol_conf.cumulate_callchain)
671 he_stat__add_cpumode_period(he->stat_acc, al->cpumode, period);
675 static unsigned random_max(unsigned high)
677 unsigned thresh = -high % high;
679 unsigned r = random();
685 static void hists__res_sample(struct hist_entry *he, struct perf_sample *sample)
687 struct res_sample *r;
690 if (he->num_res < symbol_conf.res_sample) {
693 j = random_max(symbol_conf.res_sample);
695 r = &he->res_samples[j];
696 r->time = sample->time;
697 r->cpu = sample->cpu;
698 r->tid = sample->tid;
701 static struct hist_entry*
702 __hists__add_entry(struct hists *hists,
703 struct addr_location *al,
704 struct symbol *sym_parent,
705 struct branch_info *bi,
707 struct block_info *block_info,
708 struct perf_sample *sample,
710 struct hist_entry_ops *ops)
712 struct namespaces *ns = thread__namespaces(al->thread);
713 struct hist_entry entry = {
714 .thread = al->thread,
715 .comm = thread__comm(al->thread),
717 .dev = ns ? ns->link_info[CGROUP_NS_INDEX].dev : 0,
718 .ino = ns ? ns->link_info[CGROUP_NS_INDEX].ino : 0,
720 .cgroup = sample->cgroup,
726 .srcline = (char *) al->srcline,
727 .socket = al->socket,
729 .cpumode = al->cpumode,
732 .code_page_size = sample->code_page_size,
735 .period = sample->period,
736 .weight = sample->weight,
737 .ins_lat = sample->ins_lat,
738 .p_stage_cyc = sample->p_stage_cyc,
740 .parent = sym_parent,
741 .filtered = symbol__parent_filter(sym_parent) | al->filtered,
745 .block_info = block_info,
746 .transaction = sample->transaction,
747 .raw_data = sample->raw_data,
748 .raw_size = sample->raw_size,
750 .time = hist_time(sample->time),
751 }, *he = hists__findnew_entry(hists, &entry, al, sample_self);
753 if (!hists->has_callchains && he && he->callchain_size != 0)
754 hists->has_callchains = true;
755 if (he && symbol_conf.res_sample)
756 hists__res_sample(he, sample);
760 struct hist_entry *hists__add_entry(struct hists *hists,
761 struct addr_location *al,
762 struct symbol *sym_parent,
763 struct branch_info *bi,
765 struct perf_sample *sample,
768 return __hists__add_entry(hists, al, sym_parent, bi, mi, NULL,
769 sample, sample_self, NULL);
772 struct hist_entry *hists__add_entry_ops(struct hists *hists,
773 struct hist_entry_ops *ops,
774 struct addr_location *al,
775 struct symbol *sym_parent,
776 struct branch_info *bi,
778 struct perf_sample *sample,
781 return __hists__add_entry(hists, al, sym_parent, bi, mi, NULL,
782 sample, sample_self, ops);
785 struct hist_entry *hists__add_entry_block(struct hists *hists,
786 struct addr_location *al,
787 struct block_info *block_info)
789 struct hist_entry entry = {
790 .block_info = block_info,
797 }, *he = hists__findnew_entry(hists, &entry, al, false);
803 iter_next_nop_entry(struct hist_entry_iter *iter __maybe_unused,
804 struct addr_location *al __maybe_unused)
810 iter_add_next_nop_entry(struct hist_entry_iter *iter __maybe_unused,
811 struct addr_location *al __maybe_unused)
817 iter_prepare_mem_entry(struct hist_entry_iter *iter, struct addr_location *al)
819 struct perf_sample *sample = iter->sample;
822 mi = sample__resolve_mem(sample, al);
831 iter_add_single_mem_entry(struct hist_entry_iter *iter, struct addr_location *al)
834 struct mem_info *mi = iter->priv;
835 struct hists *hists = evsel__hists(iter->evsel);
836 struct perf_sample *sample = iter->sample;
837 struct hist_entry *he;
842 cost = sample->weight;
847 * must pass period=weight in order to get the correct
848 * sorting from hists__collapse_resort() which is solely
849 * based on periods. We want sorting be done on nr_events * weight
850 * and this is indirectly achieved by passing period=weight here
851 * and the he_stat__add_period() function.
853 sample->period = cost;
855 he = hists__add_entry(hists, al, iter->parent, NULL, mi,
865 iter_finish_mem_entry(struct hist_entry_iter *iter,
866 struct addr_location *al __maybe_unused)
868 struct evsel *evsel = iter->evsel;
869 struct hists *hists = evsel__hists(evsel);
870 struct hist_entry *he = iter->he;
876 hists__inc_nr_samples(hists, he->filtered);
878 err = hist_entry__append_callchain(he, iter->sample);
882 * We don't need to free iter->priv (mem_info) here since the mem info
883 * was either already freed in hists__findnew_entry() or passed to a
884 * new hist entry by hist_entry__new().
893 iter_prepare_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
895 struct branch_info *bi;
896 struct perf_sample *sample = iter->sample;
898 bi = sample__resolve_bstack(sample, al);
903 iter->total = sample->branch_stack->nr;
910 iter_add_single_branch_entry(struct hist_entry_iter *iter __maybe_unused,
911 struct addr_location *al __maybe_unused)
917 iter_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
919 struct branch_info *bi = iter->priv;
925 if (iter->curr >= iter->total)
928 al->maps = bi[i].to.ms.maps;
929 al->map = bi[i].to.ms.map;
930 al->sym = bi[i].to.ms.sym;
931 al->addr = bi[i].to.addr;
936 iter_add_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
938 struct branch_info *bi;
939 struct evsel *evsel = iter->evsel;
940 struct hists *hists = evsel__hists(evsel);
941 struct perf_sample *sample = iter->sample;
942 struct hist_entry *he = NULL;
948 if (iter->hide_unresolved && !(bi[i].from.ms.sym && bi[i].to.ms.sym))
952 * The report shows the percentage of total branches captured
953 * and not events sampled. Thus we use a pseudo period of 1.
956 sample->weight = bi->flags.cycles ? bi->flags.cycles : 1;
958 he = hists__add_entry(hists, al, iter->parent, &bi[i], NULL,
963 hists__inc_nr_samples(hists, he->filtered);
972 iter_finish_branch_entry(struct hist_entry_iter *iter,
973 struct addr_location *al __maybe_unused)
978 return iter->curr >= iter->total ? 0 : -1;
982 iter_prepare_normal_entry(struct hist_entry_iter *iter __maybe_unused,
983 struct addr_location *al __maybe_unused)
989 iter_add_single_normal_entry(struct hist_entry_iter *iter, struct addr_location *al)
991 struct evsel *evsel = iter->evsel;
992 struct perf_sample *sample = iter->sample;
993 struct hist_entry *he;
995 he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,
1005 iter_finish_normal_entry(struct hist_entry_iter *iter,
1006 struct addr_location *al __maybe_unused)
1008 struct hist_entry *he = iter->he;
1009 struct evsel *evsel = iter->evsel;
1010 struct perf_sample *sample = iter->sample;
1017 hists__inc_nr_samples(evsel__hists(evsel), he->filtered);
1019 return hist_entry__append_callchain(he, sample);
1023 iter_prepare_cumulative_entry(struct hist_entry_iter *iter,
1024 struct addr_location *al __maybe_unused)
1026 struct hist_entry **he_cache;
1028 callchain_cursor_commit(&callchain_cursor);
1031 * This is for detecting cycles or recursions so that they're
1032 * cumulated only one time to prevent entries more than 100%
1035 he_cache = malloc(sizeof(*he_cache) * (callchain_cursor.nr + 1));
1036 if (he_cache == NULL)
1039 iter->priv = he_cache;
1046 iter_add_single_cumulative_entry(struct hist_entry_iter *iter,
1047 struct addr_location *al)
1049 struct evsel *evsel = iter->evsel;
1050 struct hists *hists = evsel__hists(evsel);
1051 struct perf_sample *sample = iter->sample;
1052 struct hist_entry **he_cache = iter->priv;
1053 struct hist_entry *he;
1056 he = hists__add_entry(hists, al, iter->parent, NULL, NULL,
1062 he_cache[iter->curr++] = he;
1064 hist_entry__append_callchain(he, sample);
1067 * We need to re-initialize the cursor since callchain_append()
1068 * advanced the cursor to the end.
1070 callchain_cursor_commit(&callchain_cursor);
1072 hists__inc_nr_samples(hists, he->filtered);
1078 iter_next_cumulative_entry(struct hist_entry_iter *iter,
1079 struct addr_location *al)
1081 struct callchain_cursor_node *node;
1083 node = callchain_cursor_current(&callchain_cursor);
1087 return fill_callchain_info(al, node, iter->hide_unresolved);
1091 hist_entry__fast__sym_diff(struct hist_entry *left,
1092 struct hist_entry *right)
1094 struct symbol *sym_l = left->ms.sym;
1095 struct symbol *sym_r = right->ms.sym;
1097 if (!sym_l && !sym_r)
1098 return left->ip != right->ip;
1100 return !!_sort__sym_cmp(sym_l, sym_r);
1105 iter_add_next_cumulative_entry(struct hist_entry_iter *iter,
1106 struct addr_location *al)
1108 struct evsel *evsel = iter->evsel;
1109 struct perf_sample *sample = iter->sample;
1110 struct hist_entry **he_cache = iter->priv;
1111 struct hist_entry *he;
1112 struct hist_entry he_tmp = {
1113 .hists = evsel__hists(evsel),
1115 .thread = al->thread,
1116 .comm = thread__comm(al->thread),
1123 .srcline = (char *) al->srcline,
1124 .parent = iter->parent,
1125 .raw_data = sample->raw_data,
1126 .raw_size = sample->raw_size,
1129 struct callchain_cursor cursor;
1130 bool fast = hists__has(he_tmp.hists, sym);
1132 callchain_cursor_snapshot(&cursor, &callchain_cursor);
1134 callchain_cursor_advance(&callchain_cursor);
1137 * Check if there's duplicate entries in the callchain.
1138 * It's possible that it has cycles or recursive calls.
1140 for (i = 0; i < iter->curr; i++) {
1142 * For most cases, there are no duplicate entries in callchain.
1143 * The symbols are usually different. Do a quick check for
1146 if (fast && hist_entry__fast__sym_diff(he_cache[i], &he_tmp))
1149 if (hist_entry__cmp(he_cache[i], &he_tmp) == 0) {
1150 /* to avoid calling callback function */
1156 he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,
1162 he_cache[iter->curr++] = he;
1164 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain)
1165 callchain_append(he->callchain, &cursor, sample->period);
1170 iter_finish_cumulative_entry(struct hist_entry_iter *iter,
1171 struct addr_location *al __maybe_unused)
1179 const struct hist_iter_ops hist_iter_mem = {
1180 .prepare_entry = iter_prepare_mem_entry,
1181 .add_single_entry = iter_add_single_mem_entry,
1182 .next_entry = iter_next_nop_entry,
1183 .add_next_entry = iter_add_next_nop_entry,
1184 .finish_entry = iter_finish_mem_entry,
1187 const struct hist_iter_ops hist_iter_branch = {
1188 .prepare_entry = iter_prepare_branch_entry,
1189 .add_single_entry = iter_add_single_branch_entry,
1190 .next_entry = iter_next_branch_entry,
1191 .add_next_entry = iter_add_next_branch_entry,
1192 .finish_entry = iter_finish_branch_entry,
1195 const struct hist_iter_ops hist_iter_normal = {
1196 .prepare_entry = iter_prepare_normal_entry,
1197 .add_single_entry = iter_add_single_normal_entry,
1198 .next_entry = iter_next_nop_entry,
1199 .add_next_entry = iter_add_next_nop_entry,
1200 .finish_entry = iter_finish_normal_entry,
1203 const struct hist_iter_ops hist_iter_cumulative = {
1204 .prepare_entry = iter_prepare_cumulative_entry,
1205 .add_single_entry = iter_add_single_cumulative_entry,
1206 .next_entry = iter_next_cumulative_entry,
1207 .add_next_entry = iter_add_next_cumulative_entry,
1208 .finish_entry = iter_finish_cumulative_entry,
1211 int hist_entry_iter__add(struct hist_entry_iter *iter, struct addr_location *al,
1212 int max_stack_depth, void *arg)
1215 struct map *alm = NULL;
1218 alm = map__get(al->map);
1220 err = sample__resolve_callchain(iter->sample, &callchain_cursor, &iter->parent,
1221 iter->evsel, al, max_stack_depth);
1227 err = iter->ops->prepare_entry(iter, al);
1231 err = iter->ops->add_single_entry(iter, al);
1235 if (iter->he && iter->add_entry_cb) {
1236 err = iter->add_entry_cb(iter, al, true, arg);
1241 while (iter->ops->next_entry(iter, al)) {
1242 err = iter->ops->add_next_entry(iter, al);
1246 if (iter->he && iter->add_entry_cb) {
1247 err = iter->add_entry_cb(iter, al, false, arg);
1254 err2 = iter->ops->finish_entry(iter, al);
1264 hist_entry__cmp(struct hist_entry *left, struct hist_entry *right)
1266 struct hists *hists = left->hists;
1267 struct perf_hpp_fmt *fmt;
1270 hists__for_each_sort_list(hists, fmt) {
1271 if (perf_hpp__is_dynamic_entry(fmt) &&
1272 !perf_hpp__defined_dynamic_entry(fmt, hists))
1275 cmp = fmt->cmp(fmt, left, right);
1284 hist_entry__collapse(struct hist_entry *left, struct hist_entry *right)
1286 struct hists *hists = left->hists;
1287 struct perf_hpp_fmt *fmt;
1290 hists__for_each_sort_list(hists, fmt) {
1291 if (perf_hpp__is_dynamic_entry(fmt) &&
1292 !perf_hpp__defined_dynamic_entry(fmt, hists))
1295 cmp = fmt->collapse(fmt, left, right);
1303 void hist_entry__delete(struct hist_entry *he)
1305 struct hist_entry_ops *ops = he->ops;
1307 thread__zput(he->thread);
1308 map__zput(he->ms.map);
1310 if (he->branch_info) {
1311 map__zput(he->branch_info->from.ms.map);
1312 map__zput(he->branch_info->to.ms.map);
1313 free_srcline(he->branch_info->srcline_from);
1314 free_srcline(he->branch_info->srcline_to);
1315 zfree(&he->branch_info);
1319 map__zput(he->mem_info->iaddr.ms.map);
1320 map__zput(he->mem_info->daddr.ms.map);
1321 mem_info__zput(he->mem_info);
1325 block_info__zput(he->block_info);
1327 zfree(&he->res_samples);
1328 zfree(&he->stat_acc);
1329 free_srcline(he->srcline);
1330 if (he->srcfile && he->srcfile[0])
1331 zfree(&he->srcfile);
1332 free_callchain(he->callchain);
1333 zfree(&he->trace_output);
1334 zfree(&he->raw_data);
1339 * If this is not the last column, then we need to pad it according to the
1340 * pre-calculated max length for this column, otherwise don't bother adding
1341 * spaces because that would break viewing this with, for instance, 'less',
1342 * that would show tons of trailing spaces when a long C++ demangled method
1345 int hist_entry__snprintf_alignment(struct hist_entry *he, struct perf_hpp *hpp,
1346 struct perf_hpp_fmt *fmt, int printed)
1348 if (!list_is_last(&fmt->list, &he->hists->hpp_list->fields)) {
1349 const int width = fmt->width(fmt, hpp, he->hists);
1350 if (printed < width) {
1351 advance_hpp(hpp, printed);
1352 printed = scnprintf(hpp->buf, hpp->size, "%-*s", width - printed, " ");
1360 * collapse the histogram
1363 static void hists__apply_filters(struct hists *hists, struct hist_entry *he);
1364 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *he,
1365 enum hist_filter type);
1367 typedef bool (*fmt_chk_fn)(struct perf_hpp_fmt *fmt);
1369 static bool check_thread_entry(struct perf_hpp_fmt *fmt)
1371 return perf_hpp__is_thread_entry(fmt) || perf_hpp__is_comm_entry(fmt);
1374 static void hist_entry__check_and_remove_filter(struct hist_entry *he,
1375 enum hist_filter type,
1378 struct perf_hpp_fmt *fmt;
1379 bool type_match = false;
1380 struct hist_entry *parent = he->parent_he;
1383 case HIST_FILTER__THREAD:
1384 if (symbol_conf.comm_list == NULL &&
1385 symbol_conf.pid_list == NULL &&
1386 symbol_conf.tid_list == NULL)
1389 case HIST_FILTER__DSO:
1390 if (symbol_conf.dso_list == NULL)
1393 case HIST_FILTER__SYMBOL:
1394 if (symbol_conf.sym_list == NULL)
1397 case HIST_FILTER__PARENT:
1398 case HIST_FILTER__GUEST:
1399 case HIST_FILTER__HOST:
1400 case HIST_FILTER__SOCKET:
1401 case HIST_FILTER__C2C:
1406 /* if it's filtered by own fmt, it has to have filter bits */
1407 perf_hpp_list__for_each_format(he->hpp_list, fmt) {
1416 * If the filter is for current level entry, propagate
1417 * filter marker to parents. The marker bit was
1418 * already set by default so it only needs to clear
1419 * non-filtered entries.
1421 if (!(he->filtered & (1 << type))) {
1423 parent->filtered &= ~(1 << type);
1424 parent = parent->parent_he;
1429 * If current entry doesn't have matching formats, set
1430 * filter marker for upper level entries. it will be
1431 * cleared if its lower level entries is not filtered.
1433 * For lower-level entries, it inherits parent's
1434 * filter bit so that lower level entries of a
1435 * non-filtered entry won't set the filter marker.
1438 he->filtered |= (1 << type);
1440 he->filtered |= (parent->filtered & (1 << type));
1444 static void hist_entry__apply_hierarchy_filters(struct hist_entry *he)
1446 hist_entry__check_and_remove_filter(he, HIST_FILTER__THREAD,
1447 check_thread_entry);
1449 hist_entry__check_and_remove_filter(he, HIST_FILTER__DSO,
1450 perf_hpp__is_dso_entry);
1452 hist_entry__check_and_remove_filter(he, HIST_FILTER__SYMBOL,
1453 perf_hpp__is_sym_entry);
1455 hists__apply_filters(he->hists, he);
1458 static struct hist_entry *hierarchy_insert_entry(struct hists *hists,
1459 struct rb_root_cached *root,
1460 struct hist_entry *he,
1461 struct hist_entry *parent_he,
1462 struct perf_hpp_list *hpp_list)
1464 struct rb_node **p = &root->rb_root.rb_node;
1465 struct rb_node *parent = NULL;
1466 struct hist_entry *iter, *new;
1467 struct perf_hpp_fmt *fmt;
1469 bool leftmost = true;
1471 while (*p != NULL) {
1473 iter = rb_entry(parent, struct hist_entry, rb_node_in);
1476 perf_hpp_list__for_each_sort_list(hpp_list, fmt) {
1477 cmp = fmt->collapse(fmt, iter, he);
1483 he_stat__add_stat(&iter->stat, &he->stat);
1488 p = &parent->rb_left;
1490 p = &parent->rb_right;
1495 new = hist_entry__new(he, true);
1499 hists->nr_entries++;
1501 /* save related format list for output */
1502 new->hpp_list = hpp_list;
1503 new->parent_he = parent_he;
1505 hist_entry__apply_hierarchy_filters(new);
1507 /* some fields are now passed to 'new' */
1508 perf_hpp_list__for_each_sort_list(hpp_list, fmt) {
1509 if (perf_hpp__is_trace_entry(fmt) || perf_hpp__is_dynamic_entry(fmt))
1510 he->trace_output = NULL;
1512 new->trace_output = NULL;
1514 if (perf_hpp__is_srcline_entry(fmt))
1517 new->srcline = NULL;
1519 if (perf_hpp__is_srcfile_entry(fmt))
1522 new->srcfile = NULL;
1525 rb_link_node(&new->rb_node_in, parent, p);
1526 rb_insert_color_cached(&new->rb_node_in, root, leftmost);
1530 static int hists__hierarchy_insert_entry(struct hists *hists,
1531 struct rb_root_cached *root,
1532 struct hist_entry *he)
1534 struct perf_hpp_list_node *node;
1535 struct hist_entry *new_he = NULL;
1536 struct hist_entry *parent = NULL;
1540 list_for_each_entry(node, &hists->hpp_formats, list) {
1541 /* skip period (overhead) and elided columns */
1542 if (node->level == 0 || node->skip)
1545 /* insert copy of 'he' for each fmt into the hierarchy */
1546 new_he = hierarchy_insert_entry(hists, root, he, parent, &node->hpp);
1547 if (new_he == NULL) {
1552 root = &new_he->hroot_in;
1553 new_he->depth = depth++;
1558 new_he->leaf = true;
1560 if (hist_entry__has_callchains(new_he) &&
1561 symbol_conf.use_callchain) {
1562 callchain_cursor_reset(&callchain_cursor);
1563 if (callchain_merge(&callchain_cursor,
1570 /* 'he' is no longer used */
1571 hist_entry__delete(he);
1573 /* return 0 (or -1) since it already applied filters */
1577 static int hists__collapse_insert_entry(struct hists *hists,
1578 struct rb_root_cached *root,
1579 struct hist_entry *he)
1581 struct rb_node **p = &root->rb_root.rb_node;
1582 struct rb_node *parent = NULL;
1583 struct hist_entry *iter;
1585 bool leftmost = true;
1587 if (symbol_conf.report_hierarchy)
1588 return hists__hierarchy_insert_entry(hists, root, he);
1590 while (*p != NULL) {
1592 iter = rb_entry(parent, struct hist_entry, rb_node_in);
1594 cmp = hist_entry__collapse(iter, he);
1599 he_stat__add_stat(&iter->stat, &he->stat);
1600 if (symbol_conf.cumulate_callchain)
1601 he_stat__add_stat(iter->stat_acc, he->stat_acc);
1603 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain) {
1604 callchain_cursor_reset(&callchain_cursor);
1605 if (callchain_merge(&callchain_cursor,
1610 hist_entry__delete(he);
1617 p = &(*p)->rb_right;
1621 hists->nr_entries++;
1623 rb_link_node(&he->rb_node_in, parent, p);
1624 rb_insert_color_cached(&he->rb_node_in, root, leftmost);
1628 struct rb_root_cached *hists__get_rotate_entries_in(struct hists *hists)
1630 struct rb_root_cached *root;
1632 pthread_mutex_lock(&hists->lock);
1634 root = hists->entries_in;
1635 if (++hists->entries_in > &hists->entries_in_array[1])
1636 hists->entries_in = &hists->entries_in_array[0];
1638 pthread_mutex_unlock(&hists->lock);
1643 static void hists__apply_filters(struct hists *hists, struct hist_entry *he)
1645 hists__filter_entry_by_dso(hists, he);
1646 hists__filter_entry_by_thread(hists, he);
1647 hists__filter_entry_by_symbol(hists, he);
1648 hists__filter_entry_by_socket(hists, he);
1651 int hists__collapse_resort(struct hists *hists, struct ui_progress *prog)
1653 struct rb_root_cached *root;
1654 struct rb_node *next;
1655 struct hist_entry *n;
1658 if (!hists__has(hists, need_collapse))
1661 hists->nr_entries = 0;
1663 root = hists__get_rotate_entries_in(hists);
1665 next = rb_first_cached(root);
1670 n = rb_entry(next, struct hist_entry, rb_node_in);
1671 next = rb_next(&n->rb_node_in);
1673 rb_erase_cached(&n->rb_node_in, root);
1674 ret = hists__collapse_insert_entry(hists, &hists->entries_collapsed, n);
1680 * If it wasn't combined with one of the entries already
1681 * collapsed, we need to apply the filters that may have
1682 * been set by, say, the hist_browser.
1684 hists__apply_filters(hists, n);
1687 ui_progress__update(prog, 1);
1692 static int64_t hist_entry__sort(struct hist_entry *a, struct hist_entry *b)
1694 struct hists *hists = a->hists;
1695 struct perf_hpp_fmt *fmt;
1698 hists__for_each_sort_list(hists, fmt) {
1699 if (perf_hpp__should_skip(fmt, a->hists))
1702 cmp = fmt->sort(fmt, a, b);
1710 static void hists__reset_filter_stats(struct hists *hists)
1712 hists->nr_non_filtered_entries = 0;
1713 hists->stats.total_non_filtered_period = 0;
1716 void hists__reset_stats(struct hists *hists)
1718 hists->nr_entries = 0;
1719 hists->stats.total_period = 0;
1721 hists__reset_filter_stats(hists);
1724 static void hists__inc_filter_stats(struct hists *hists, struct hist_entry *h)
1726 hists->nr_non_filtered_entries++;
1727 hists->stats.total_non_filtered_period += h->stat.period;
1730 void hists__inc_stats(struct hists *hists, struct hist_entry *h)
1733 hists__inc_filter_stats(hists, h);
1735 hists->nr_entries++;
1736 hists->stats.total_period += h->stat.period;
1739 static void hierarchy_recalc_total_periods(struct hists *hists)
1741 struct rb_node *node;
1742 struct hist_entry *he;
1744 node = rb_first_cached(&hists->entries);
1746 hists->stats.total_period = 0;
1747 hists->stats.total_non_filtered_period = 0;
1750 * recalculate total period using top-level entries only
1751 * since lower level entries only see non-filtered entries
1752 * but upper level entries have sum of both entries.
1755 he = rb_entry(node, struct hist_entry, rb_node);
1756 node = rb_next(node);
1758 hists->stats.total_period += he->stat.period;
1760 hists->stats.total_non_filtered_period += he->stat.period;
1764 static void hierarchy_insert_output_entry(struct rb_root_cached *root,
1765 struct hist_entry *he)
1767 struct rb_node **p = &root->rb_root.rb_node;
1768 struct rb_node *parent = NULL;
1769 struct hist_entry *iter;
1770 struct perf_hpp_fmt *fmt;
1771 bool leftmost = true;
1773 while (*p != NULL) {
1775 iter = rb_entry(parent, struct hist_entry, rb_node);
1777 if (hist_entry__sort(he, iter) > 0)
1778 p = &parent->rb_left;
1780 p = &parent->rb_right;
1785 rb_link_node(&he->rb_node, parent, p);
1786 rb_insert_color_cached(&he->rb_node, root, leftmost);
1788 /* update column width of dynamic entry */
1789 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) {
1790 if (perf_hpp__is_dynamic_entry(fmt))
1791 fmt->sort(fmt, he, NULL);
1795 static void hists__hierarchy_output_resort(struct hists *hists,
1796 struct ui_progress *prog,
1797 struct rb_root_cached *root_in,
1798 struct rb_root_cached *root_out,
1799 u64 min_callchain_hits,
1802 struct rb_node *node;
1803 struct hist_entry *he;
1805 *root_out = RB_ROOT_CACHED;
1806 node = rb_first_cached(root_in);
1809 he = rb_entry(node, struct hist_entry, rb_node_in);
1810 node = rb_next(node);
1812 hierarchy_insert_output_entry(root_out, he);
1815 ui_progress__update(prog, 1);
1817 hists->nr_entries++;
1818 if (!he->filtered) {
1819 hists->nr_non_filtered_entries++;
1820 hists__calc_col_len(hists, he);
1824 hists__hierarchy_output_resort(hists, prog,
1835 if (callchain_param.mode == CHAIN_GRAPH_REL) {
1836 u64 total = he->stat.period;
1838 if (symbol_conf.cumulate_callchain)
1839 total = he->stat_acc->period;
1841 min_callchain_hits = total * (callchain_param.min_percent / 100);
1844 callchain_param.sort(&he->sorted_chain, he->callchain,
1845 min_callchain_hits, &callchain_param);
1849 static void __hists__insert_output_entry(struct rb_root_cached *entries,
1850 struct hist_entry *he,
1851 u64 min_callchain_hits,
1854 struct rb_node **p = &entries->rb_root.rb_node;
1855 struct rb_node *parent = NULL;
1856 struct hist_entry *iter;
1857 struct perf_hpp_fmt *fmt;
1858 bool leftmost = true;
1860 if (use_callchain) {
1861 if (callchain_param.mode == CHAIN_GRAPH_REL) {
1862 u64 total = he->stat.period;
1864 if (symbol_conf.cumulate_callchain)
1865 total = he->stat_acc->period;
1867 min_callchain_hits = total * (callchain_param.min_percent / 100);
1869 callchain_param.sort(&he->sorted_chain, he->callchain,
1870 min_callchain_hits, &callchain_param);
1873 while (*p != NULL) {
1875 iter = rb_entry(parent, struct hist_entry, rb_node);
1877 if (hist_entry__sort(he, iter) > 0)
1880 p = &(*p)->rb_right;
1885 rb_link_node(&he->rb_node, parent, p);
1886 rb_insert_color_cached(&he->rb_node, entries, leftmost);
1888 perf_hpp_list__for_each_sort_list(&perf_hpp_list, fmt) {
1889 if (perf_hpp__is_dynamic_entry(fmt) &&
1890 perf_hpp__defined_dynamic_entry(fmt, he->hists))
1891 fmt->sort(fmt, he, NULL); /* update column width */
1895 static void output_resort(struct hists *hists, struct ui_progress *prog,
1896 bool use_callchain, hists__resort_cb_t cb,
1899 struct rb_root_cached *root;
1900 struct rb_node *next;
1901 struct hist_entry *n;
1902 u64 callchain_total;
1903 u64 min_callchain_hits;
1905 callchain_total = hists->callchain_period;
1906 if (symbol_conf.filter_relative)
1907 callchain_total = hists->callchain_non_filtered_period;
1909 min_callchain_hits = callchain_total * (callchain_param.min_percent / 100);
1911 hists__reset_stats(hists);
1912 hists__reset_col_len(hists);
1914 if (symbol_conf.report_hierarchy) {
1915 hists__hierarchy_output_resort(hists, prog,
1916 &hists->entries_collapsed,
1920 hierarchy_recalc_total_periods(hists);
1924 if (hists__has(hists, need_collapse))
1925 root = &hists->entries_collapsed;
1927 root = hists->entries_in;
1929 next = rb_first_cached(root);
1930 hists->entries = RB_ROOT_CACHED;
1933 n = rb_entry(next, struct hist_entry, rb_node_in);
1934 next = rb_next(&n->rb_node_in);
1936 if (cb && cb(n, cb_arg))
1939 __hists__insert_output_entry(&hists->entries, n, min_callchain_hits, use_callchain);
1940 hists__inc_stats(hists, n);
1943 hists__calc_col_len(hists, n);
1946 ui_progress__update(prog, 1);
1950 void evsel__output_resort_cb(struct evsel *evsel, struct ui_progress *prog,
1951 hists__resort_cb_t cb, void *cb_arg)
1955 if (evsel && symbol_conf.use_callchain && !symbol_conf.show_ref_callgraph)
1956 use_callchain = evsel__has_callchain(evsel);
1958 use_callchain = symbol_conf.use_callchain;
1960 use_callchain |= symbol_conf.show_branchflag_count;
1962 output_resort(evsel__hists(evsel), prog, use_callchain, cb, cb_arg);
1965 void evsel__output_resort(struct evsel *evsel, struct ui_progress *prog)
1967 return evsel__output_resort_cb(evsel, prog, NULL, NULL);
1970 void hists__output_resort(struct hists *hists, struct ui_progress *prog)
1972 output_resort(hists, prog, symbol_conf.use_callchain, NULL, NULL);
1975 void hists__output_resort_cb(struct hists *hists, struct ui_progress *prog,
1976 hists__resort_cb_t cb)
1978 output_resort(hists, prog, symbol_conf.use_callchain, cb, NULL);
1981 static bool can_goto_child(struct hist_entry *he, enum hierarchy_move_dir hmd)
1983 if (he->leaf || hmd == HMD_FORCE_SIBLING)
1986 if (he->unfolded || hmd == HMD_FORCE_CHILD)
1992 struct rb_node *rb_hierarchy_last(struct rb_node *node)
1994 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
1996 while (can_goto_child(he, HMD_NORMAL)) {
1997 node = rb_last(&he->hroot_out.rb_root);
1998 he = rb_entry(node, struct hist_entry, rb_node);
2003 struct rb_node *__rb_hierarchy_next(struct rb_node *node, enum hierarchy_move_dir hmd)
2005 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
2007 if (can_goto_child(he, hmd))
2008 node = rb_first_cached(&he->hroot_out);
2010 node = rb_next(node);
2012 while (node == NULL) {
2017 node = rb_next(&he->rb_node);
2022 struct rb_node *rb_hierarchy_prev(struct rb_node *node)
2024 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);
2026 node = rb_prev(node);
2028 return rb_hierarchy_last(node);
2034 return &he->rb_node;
2037 bool hist_entry__has_hierarchy_children(struct hist_entry *he, float limit)
2039 struct rb_node *node;
2040 struct hist_entry *child;
2046 node = rb_first_cached(&he->hroot_out);
2047 child = rb_entry(node, struct hist_entry, rb_node);
2049 while (node && child->filtered) {
2050 node = rb_next(node);
2051 child = rb_entry(node, struct hist_entry, rb_node);
2055 percent = hist_entry__get_percent_limit(child);
2059 return node && percent >= limit;
2062 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h,
2063 enum hist_filter filter)
2065 h->filtered &= ~(1 << filter);
2067 if (symbol_conf.report_hierarchy) {
2068 struct hist_entry *parent = h->parent_he;
2071 he_stat__add_stat(&parent->stat, &h->stat);
2073 parent->filtered &= ~(1 << filter);
2075 if (parent->filtered)
2078 /* force fold unfiltered entry for simplicity */
2079 parent->unfolded = false;
2080 parent->has_no_entry = false;
2081 parent->row_offset = 0;
2082 parent->nr_rows = 0;
2084 parent = parent->parent_he;
2091 /* force fold unfiltered entry for simplicity */
2092 h->unfolded = false;
2093 h->has_no_entry = false;
2097 hists->stats.nr_non_filtered_samples += h->stat.nr_events;
2099 hists__inc_filter_stats(hists, h);
2100 hists__calc_col_len(hists, h);
2104 static bool hists__filter_entry_by_dso(struct hists *hists,
2105 struct hist_entry *he)
2107 if (hists->dso_filter != NULL &&
2108 (he->ms.map == NULL || he->ms.map->dso != hists->dso_filter)) {
2109 he->filtered |= (1 << HIST_FILTER__DSO);
2116 static bool hists__filter_entry_by_thread(struct hists *hists,
2117 struct hist_entry *he)
2119 if (hists->thread_filter != NULL &&
2120 he->thread != hists->thread_filter) {
2121 he->filtered |= (1 << HIST_FILTER__THREAD);
2128 static bool hists__filter_entry_by_symbol(struct hists *hists,
2129 struct hist_entry *he)
2131 if (hists->symbol_filter_str != NULL &&
2132 (!he->ms.sym || strstr(he->ms.sym->name,
2133 hists->symbol_filter_str) == NULL)) {
2134 he->filtered |= (1 << HIST_FILTER__SYMBOL);
2141 static bool hists__filter_entry_by_socket(struct hists *hists,
2142 struct hist_entry *he)
2144 if ((hists->socket_filter > -1) &&
2145 (he->socket != hists->socket_filter)) {
2146 he->filtered |= (1 << HIST_FILTER__SOCKET);
2153 typedef bool (*filter_fn_t)(struct hists *hists, struct hist_entry *he);
2155 static void hists__filter_by_type(struct hists *hists, int type, filter_fn_t filter)
2159 hists->stats.nr_non_filtered_samples = 0;
2161 hists__reset_filter_stats(hists);
2162 hists__reset_col_len(hists);
2164 for (nd = rb_first_cached(&hists->entries); nd; nd = rb_next(nd)) {
2165 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2167 if (filter(hists, h))
2170 hists__remove_entry_filter(hists, h, type);
2174 static void resort_filtered_entry(struct rb_root_cached *root,
2175 struct hist_entry *he)
2177 struct rb_node **p = &root->rb_root.rb_node;
2178 struct rb_node *parent = NULL;
2179 struct hist_entry *iter;
2180 struct rb_root_cached new_root = RB_ROOT_CACHED;
2182 bool leftmost = true;
2184 while (*p != NULL) {
2186 iter = rb_entry(parent, struct hist_entry, rb_node);
2188 if (hist_entry__sort(he, iter) > 0)
2191 p = &(*p)->rb_right;
2196 rb_link_node(&he->rb_node, parent, p);
2197 rb_insert_color_cached(&he->rb_node, root, leftmost);
2199 if (he->leaf || he->filtered)
2202 nd = rb_first_cached(&he->hroot_out);
2204 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2207 rb_erase_cached(&h->rb_node, &he->hroot_out);
2209 resort_filtered_entry(&new_root, h);
2212 he->hroot_out = new_root;
2215 static void hists__filter_hierarchy(struct hists *hists, int type, const void *arg)
2218 struct rb_root_cached new_root = RB_ROOT_CACHED;
2220 hists->stats.nr_non_filtered_samples = 0;
2222 hists__reset_filter_stats(hists);
2223 hists__reset_col_len(hists);
2225 nd = rb_first_cached(&hists->entries);
2227 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2230 ret = hist_entry__filter(h, type, arg);
2233 * case 1. non-matching type
2234 * zero out the period, set filter marker and move to child
2237 memset(&h->stat, 0, sizeof(h->stat));
2238 h->filtered |= (1 << type);
2240 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_CHILD);
2243 * case 2. matched type (filter out)
2244 * set filter marker and move to next
2246 else if (ret == 1) {
2247 h->filtered |= (1 << type);
2249 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);
2252 * case 3. ok (not filtered)
2253 * add period to hists and parents, erase the filter marker
2254 * and move to next sibling
2257 hists__remove_entry_filter(hists, h, type);
2259 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);
2263 hierarchy_recalc_total_periods(hists);
2266 * resort output after applying a new filter since filter in a lower
2267 * hierarchy can change periods in a upper hierarchy.
2269 nd = rb_first_cached(&hists->entries);
2271 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2274 rb_erase_cached(&h->rb_node, &hists->entries);
2276 resort_filtered_entry(&new_root, h);
2279 hists->entries = new_root;
2282 void hists__filter_by_thread(struct hists *hists)
2284 if (symbol_conf.report_hierarchy)
2285 hists__filter_hierarchy(hists, HIST_FILTER__THREAD,
2286 hists->thread_filter);
2288 hists__filter_by_type(hists, HIST_FILTER__THREAD,
2289 hists__filter_entry_by_thread);
2292 void hists__filter_by_dso(struct hists *hists)
2294 if (symbol_conf.report_hierarchy)
2295 hists__filter_hierarchy(hists, HIST_FILTER__DSO,
2298 hists__filter_by_type(hists, HIST_FILTER__DSO,
2299 hists__filter_entry_by_dso);
2302 void hists__filter_by_symbol(struct hists *hists)
2304 if (symbol_conf.report_hierarchy)
2305 hists__filter_hierarchy(hists, HIST_FILTER__SYMBOL,
2306 hists->symbol_filter_str);
2308 hists__filter_by_type(hists, HIST_FILTER__SYMBOL,
2309 hists__filter_entry_by_symbol);
2312 void hists__filter_by_socket(struct hists *hists)
2314 if (symbol_conf.report_hierarchy)
2315 hists__filter_hierarchy(hists, HIST_FILTER__SOCKET,
2316 &hists->socket_filter);
2318 hists__filter_by_type(hists, HIST_FILTER__SOCKET,
2319 hists__filter_entry_by_socket);
2322 void events_stats__inc(struct events_stats *stats, u32 type)
2324 ++stats->nr_events[0];
2325 ++stats->nr_events[type];
2328 static void hists_stats__inc(struct hists_stats *stats)
2330 ++stats->nr_samples;
2333 void hists__inc_nr_events(struct hists *hists)
2335 hists_stats__inc(&hists->stats);
2338 void hists__inc_nr_samples(struct hists *hists, bool filtered)
2340 hists_stats__inc(&hists->stats);
2342 hists->stats.nr_non_filtered_samples++;
2345 static struct hist_entry *hists__add_dummy_entry(struct hists *hists,
2346 struct hist_entry *pair)
2348 struct rb_root_cached *root;
2350 struct rb_node *parent = NULL;
2351 struct hist_entry *he;
2353 bool leftmost = true;
2355 if (hists__has(hists, need_collapse))
2356 root = &hists->entries_collapsed;
2358 root = hists->entries_in;
2360 p = &root->rb_root.rb_node;
2362 while (*p != NULL) {
2364 he = rb_entry(parent, struct hist_entry, rb_node_in);
2366 cmp = hist_entry__collapse(he, pair);
2374 p = &(*p)->rb_right;
2379 he = hist_entry__new(pair, true);
2381 memset(&he->stat, 0, sizeof(he->stat));
2383 if (symbol_conf.cumulate_callchain)
2384 memset(he->stat_acc, 0, sizeof(he->stat));
2385 rb_link_node(&he->rb_node_in, parent, p);
2386 rb_insert_color_cached(&he->rb_node_in, root, leftmost);
2387 hists__inc_stats(hists, he);
2394 static struct hist_entry *add_dummy_hierarchy_entry(struct hists *hists,
2395 struct rb_root_cached *root,
2396 struct hist_entry *pair)
2399 struct rb_node *parent = NULL;
2400 struct hist_entry *he;
2401 struct perf_hpp_fmt *fmt;
2402 bool leftmost = true;
2404 p = &root->rb_root.rb_node;
2405 while (*p != NULL) {
2409 he = rb_entry(parent, struct hist_entry, rb_node_in);
2411 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) {
2412 cmp = fmt->collapse(fmt, he, pair);
2420 p = &parent->rb_left;
2422 p = &parent->rb_right;
2427 he = hist_entry__new(pair, true);
2429 rb_link_node(&he->rb_node_in, parent, p);
2430 rb_insert_color_cached(&he->rb_node_in, root, leftmost);
2434 memset(&he->stat, 0, sizeof(he->stat));
2435 hists__inc_stats(hists, he);
2441 static struct hist_entry *hists__find_entry(struct hists *hists,
2442 struct hist_entry *he)
2446 if (hists__has(hists, need_collapse))
2447 n = hists->entries_collapsed.rb_root.rb_node;
2449 n = hists->entries_in->rb_root.rb_node;
2452 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in);
2453 int64_t cmp = hist_entry__collapse(iter, he);
2466 static struct hist_entry *hists__find_hierarchy_entry(struct rb_root_cached *root,
2467 struct hist_entry *he)
2469 struct rb_node *n = root->rb_root.rb_node;
2472 struct hist_entry *iter;
2473 struct perf_hpp_fmt *fmt;
2476 iter = rb_entry(n, struct hist_entry, rb_node_in);
2477 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) {
2478 cmp = fmt->collapse(fmt, iter, he);
2494 static void hists__match_hierarchy(struct rb_root_cached *leader_root,
2495 struct rb_root_cached *other_root)
2498 struct hist_entry *pos, *pair;
2500 for (nd = rb_first_cached(leader_root); nd; nd = rb_next(nd)) {
2501 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2502 pair = hists__find_hierarchy_entry(other_root, pos);
2505 hist_entry__add_pair(pair, pos);
2506 hists__match_hierarchy(&pos->hroot_in, &pair->hroot_in);
2512 * Look for pairs to link to the leader buckets (hist_entries):
2514 void hists__match(struct hists *leader, struct hists *other)
2516 struct rb_root_cached *root;
2518 struct hist_entry *pos, *pair;
2520 if (symbol_conf.report_hierarchy) {
2521 /* hierarchy report always collapses entries */
2522 return hists__match_hierarchy(&leader->entries_collapsed,
2523 &other->entries_collapsed);
2526 if (hists__has(leader, need_collapse))
2527 root = &leader->entries_collapsed;
2529 root = leader->entries_in;
2531 for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {
2532 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2533 pair = hists__find_entry(other, pos);
2536 hist_entry__add_pair(pair, pos);
2540 static int hists__link_hierarchy(struct hists *leader_hists,
2541 struct hist_entry *parent,
2542 struct rb_root_cached *leader_root,
2543 struct rb_root_cached *other_root)
2546 struct hist_entry *pos, *leader;
2548 for (nd = rb_first_cached(other_root); nd; nd = rb_next(nd)) {
2549 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2551 if (hist_entry__has_pairs(pos)) {
2554 list_for_each_entry(leader, &pos->pairs.head, pairs.node) {
2555 if (leader->hists == leader_hists) {
2563 leader = add_dummy_hierarchy_entry(leader_hists,
2568 /* do not point parent in the pos */
2569 leader->parent_he = parent;
2571 hist_entry__add_pair(pos, leader);
2575 if (hists__link_hierarchy(leader_hists, leader,
2577 &pos->hroot_in) < 0)
2585 * Look for entries in the other hists that are not present in the leader, if
2586 * we find them, just add a dummy entry on the leader hists, with period=0,
2587 * nr_events=0, to serve as the list header.
2589 int hists__link(struct hists *leader, struct hists *other)
2591 struct rb_root_cached *root;
2593 struct hist_entry *pos, *pair;
2595 if (symbol_conf.report_hierarchy) {
2596 /* hierarchy report always collapses entries */
2597 return hists__link_hierarchy(leader, NULL,
2598 &leader->entries_collapsed,
2599 &other->entries_collapsed);
2602 if (hists__has(other, need_collapse))
2603 root = &other->entries_collapsed;
2605 root = other->entries_in;
2607 for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {
2608 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2610 if (!hist_entry__has_pairs(pos)) {
2611 pair = hists__add_dummy_entry(leader, pos);
2614 hist_entry__add_pair(pos, pair);
2621 int hists__unlink(struct hists *hists)
2623 struct rb_root_cached *root;
2625 struct hist_entry *pos;
2627 if (hists__has(hists, need_collapse))
2628 root = &hists->entries_collapsed;
2630 root = hists->entries_in;
2632 for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {
2633 pos = rb_entry(nd, struct hist_entry, rb_node_in);
2634 list_del_init(&pos->pairs.node);
2640 void hist__account_cycles(struct branch_stack *bs, struct addr_location *al,
2641 struct perf_sample *sample, bool nonany_branch_mode,
2644 struct branch_info *bi;
2645 struct branch_entry *entries = perf_sample__branch_entries(sample);
2647 /* If we have branch cycles always annotate them. */
2648 if (bs && bs->nr && entries[0].flags.cycles) {
2651 bi = sample__resolve_bstack(sample, al);
2653 struct addr_map_symbol *prev = NULL;
2656 * Ignore errors, still want to process the
2659 * For non standard branch modes always
2660 * force no IPC (prev == NULL)
2662 * Note that perf stores branches reversed from
2665 for (i = bs->nr - 1; i >= 0; i--) {
2666 addr_map_symbol__account_cycles(&bi[i].from,
2667 nonany_branch_mode ? NULL : prev,
2668 bi[i].flags.cycles);
2672 *total_cycles += bi[i].flags.cycles;
2679 size_t evlist__fprintf_nr_events(struct evlist *evlist, FILE *fp,
2685 evlist__for_each_entry(evlist, pos) {
2686 struct hists *hists = evsel__hists(pos);
2688 if (skip_empty && !hists->stats.nr_samples)
2691 ret += fprintf(fp, "%s stats:\n", evsel__name(pos));
2692 ret += fprintf(fp, "%16s events: %10d\n",
2693 "SAMPLE", hists->stats.nr_samples);
2700 u64 hists__total_period(struct hists *hists)
2702 return symbol_conf.filter_relative ? hists->stats.total_non_filtered_period :
2703 hists->stats.total_period;
2706 int __hists__scnprintf_title(struct hists *hists, char *bf, size_t size, bool show_freq)
2710 const struct dso *dso = hists->dso_filter;
2711 struct thread *thread = hists->thread_filter;
2712 int socket_id = hists->socket_filter;
2713 unsigned long nr_samples = hists->stats.nr_samples;
2714 u64 nr_events = hists->stats.total_period;
2715 struct evsel *evsel = hists_to_evsel(hists);
2716 const char *ev_name = evsel__name(evsel);
2717 char buf[512], sample_freq_str[64] = "";
2718 size_t buflen = sizeof(buf);
2719 char ref[30] = " show reference callgraph, ";
2720 bool enable_ref = false;
2722 if (symbol_conf.filter_relative) {
2723 nr_samples = hists->stats.nr_non_filtered_samples;
2724 nr_events = hists->stats.total_non_filtered_period;
2727 if (evsel__is_group_event(evsel)) {
2730 evsel__group_desc(evsel, buf, buflen);
2733 for_each_group_member(pos, evsel) {
2734 struct hists *pos_hists = evsel__hists(pos);
2736 if (symbol_conf.filter_relative) {
2737 nr_samples += pos_hists->stats.nr_non_filtered_samples;
2738 nr_events += pos_hists->stats.total_non_filtered_period;
2740 nr_samples += pos_hists->stats.nr_samples;
2741 nr_events += pos_hists->stats.total_period;
2746 if (symbol_conf.show_ref_callgraph &&
2747 strstr(ev_name, "call-graph=no"))
2751 scnprintf(sample_freq_str, sizeof(sample_freq_str), " %d Hz,", evsel->core.attr.sample_freq);
2753 nr_samples = convert_unit(nr_samples, &unit);
2754 printed = scnprintf(bf, size,
2755 "Samples: %lu%c of event%s '%s',%s%sEvent count (approx.): %" PRIu64,
2756 nr_samples, unit, evsel->core.nr_members > 1 ? "s" : "",
2757 ev_name, sample_freq_str, enable_ref ? ref : " ", nr_events);
2760 if (hists->uid_filter_str)
2761 printed += snprintf(bf + printed, size - printed,
2762 ", UID: %s", hists->uid_filter_str);
2764 if (hists__has(hists, thread)) {
2765 printed += scnprintf(bf + printed, size - printed,
2767 (thread->comm_set ? thread__comm_str(thread) : ""),
2770 printed += scnprintf(bf + printed, size - printed,
2772 (thread->comm_set ? thread__comm_str(thread) : ""));
2776 printed += scnprintf(bf + printed, size - printed,
2777 ", DSO: %s", dso->short_name);
2779 printed += scnprintf(bf + printed, size - printed,
2780 ", Processor Socket: %d", socket_id);
2785 int parse_filter_percentage(const struct option *opt __maybe_unused,
2786 const char *arg, int unset __maybe_unused)
2788 if (!strcmp(arg, "relative"))
2789 symbol_conf.filter_relative = true;
2790 else if (!strcmp(arg, "absolute"))
2791 symbol_conf.filter_relative = false;
2793 pr_debug("Invalid percentage: %s\n", arg);
2800 int perf_hist_config(const char *var, const char *value)
2802 if (!strcmp(var, "hist.percentage"))
2803 return parse_filter_percentage(NULL, value, 0);
2808 int __hists__init(struct hists *hists, struct perf_hpp_list *hpp_list)
2810 memset(hists, 0, sizeof(*hists));
2811 hists->entries_in_array[0] = hists->entries_in_array[1] = RB_ROOT_CACHED;
2812 hists->entries_in = &hists->entries_in_array[0];
2813 hists->entries_collapsed = RB_ROOT_CACHED;
2814 hists->entries = RB_ROOT_CACHED;
2815 pthread_mutex_init(&hists->lock, NULL);
2816 hists->socket_filter = -1;
2817 hists->hpp_list = hpp_list;
2818 INIT_LIST_HEAD(&hists->hpp_formats);
2822 static void hists__delete_remaining_entries(struct rb_root_cached *root)
2824 struct rb_node *node;
2825 struct hist_entry *he;
2827 while (!RB_EMPTY_ROOT(&root->rb_root)) {
2828 node = rb_first_cached(root);
2829 rb_erase_cached(node, root);
2831 he = rb_entry(node, struct hist_entry, rb_node_in);
2832 hist_entry__delete(he);
2836 static void hists__delete_all_entries(struct hists *hists)
2838 hists__delete_entries(hists);
2839 hists__delete_remaining_entries(&hists->entries_in_array[0]);
2840 hists__delete_remaining_entries(&hists->entries_in_array[1]);
2841 hists__delete_remaining_entries(&hists->entries_collapsed);
2844 static void hists_evsel__exit(struct evsel *evsel)
2846 struct hists *hists = evsel__hists(evsel);
2847 struct perf_hpp_fmt *fmt, *pos;
2848 struct perf_hpp_list_node *node, *tmp;
2850 hists__delete_all_entries(hists);
2852 list_for_each_entry_safe(node, tmp, &hists->hpp_formats, list) {
2853 perf_hpp_list__for_each_format_safe(&node->hpp, fmt, pos) {
2854 list_del_init(&fmt->list);
2857 list_del_init(&node->list);
2862 static int hists_evsel__init(struct evsel *evsel)
2864 struct hists *hists = evsel__hists(evsel);
2866 __hists__init(hists, &perf_hpp_list);
2871 * XXX We probably need a hists_evsel__exit() to free the hist_entries
2872 * stored in the rbtree...
2875 int hists__init(void)
2877 int err = evsel__object_config(sizeof(struct hists_evsel),
2878 hists_evsel__init, hists_evsel__exit);
2880 fputs("FATAL ERROR: Couldn't setup hists class\n", stderr);
2885 void perf_hpp_list__init(struct perf_hpp_list *list)
2887 INIT_LIST_HEAD(&list->fields);
2888 INIT_LIST_HEAD(&list->sorts);