9 #include "ui/progress.h"
12 static bool hists__filter_entry_by_dso(struct hists
*hists
,
13 struct hist_entry
*he
);
14 static bool hists__filter_entry_by_thread(struct hists
*hists
,
15 struct hist_entry
*he
);
16 static bool hists__filter_entry_by_symbol(struct hists
*hists
,
17 struct hist_entry
*he
);
18 static bool hists__filter_entry_by_socket(struct hists
*hists
,
19 struct hist_entry
*he
);
21 u16
hists__col_len(struct hists
*hists
, enum hist_column col
)
23 return hists
->col_len
[col
];
26 void hists__set_col_len(struct hists
*hists
, enum hist_column col
, u16 len
)
28 hists
->col_len
[col
] = len
;
31 bool hists__new_col_len(struct hists
*hists
, enum hist_column col
, u16 len
)
33 if (len
> hists__col_len(hists
, col
)) {
34 hists__set_col_len(hists
, col
, len
);
40 void hists__reset_col_len(struct hists
*hists
)
44 for (col
= 0; col
< HISTC_NR_COLS
; ++col
)
45 hists__set_col_len(hists
, col
, 0);
48 static void hists__set_unres_dso_col_len(struct hists
*hists
, int dso
)
50 const unsigned int unresolved_col_width
= BITS_PER_LONG
/ 4;
52 if (hists__col_len(hists
, dso
) < unresolved_col_width
&&
53 !symbol_conf
.col_width_list_str
&& !symbol_conf
.field_sep
&&
54 !symbol_conf
.dso_list
)
55 hists__set_col_len(hists
, dso
, unresolved_col_width
);
58 void hists__calc_col_len(struct hists
*hists
, struct hist_entry
*h
)
60 const unsigned int unresolved_col_width
= BITS_PER_LONG
/ 4;
65 * +4 accounts for '[x] ' priv level info
66 * +2 accounts for 0x prefix on raw addresses
67 * +3 accounts for ' y ' symtab origin info
70 symlen
= h
->ms
.sym
->namelen
+ 4;
72 symlen
+= BITS_PER_LONG
/ 4 + 2 + 3;
73 hists__new_col_len(hists
, HISTC_SYMBOL
, symlen
);
75 symlen
= unresolved_col_width
+ 4 + 2;
76 hists__new_col_len(hists
, HISTC_SYMBOL
, symlen
);
77 hists__set_unres_dso_col_len(hists
, HISTC_DSO
);
80 len
= thread__comm_len(h
->thread
);
81 if (hists__new_col_len(hists
, HISTC_COMM
, len
))
82 hists__set_col_len(hists
, HISTC_THREAD
, len
+ 6);
85 len
= dso__name_len(h
->ms
.map
->dso
);
86 hists__new_col_len(hists
, HISTC_DSO
, len
);
90 hists__new_col_len(hists
, HISTC_PARENT
, h
->parent
->namelen
);
93 if (h
->branch_info
->from
.sym
) {
94 symlen
= (int)h
->branch_info
->from
.sym
->namelen
+ 4;
96 symlen
+= BITS_PER_LONG
/ 4 + 2 + 3;
97 hists__new_col_len(hists
, HISTC_SYMBOL_FROM
, symlen
);
99 symlen
= dso__name_len(h
->branch_info
->from
.map
->dso
);
100 hists__new_col_len(hists
, HISTC_DSO_FROM
, symlen
);
102 symlen
= unresolved_col_width
+ 4 + 2;
103 hists__new_col_len(hists
, HISTC_SYMBOL_FROM
, symlen
);
104 hists__set_unres_dso_col_len(hists
, HISTC_DSO_FROM
);
107 if (h
->branch_info
->to
.sym
) {
108 symlen
= (int)h
->branch_info
->to
.sym
->namelen
+ 4;
110 symlen
+= BITS_PER_LONG
/ 4 + 2 + 3;
111 hists__new_col_len(hists
, HISTC_SYMBOL_TO
, symlen
);
113 symlen
= dso__name_len(h
->branch_info
->to
.map
->dso
);
114 hists__new_col_len(hists
, HISTC_DSO_TO
, symlen
);
116 symlen
= unresolved_col_width
+ 4 + 2;
117 hists__new_col_len(hists
, HISTC_SYMBOL_TO
, symlen
);
118 hists__set_unres_dso_col_len(hists
, HISTC_DSO_TO
);
123 if (h
->mem_info
->daddr
.sym
) {
124 symlen
= (int)h
->mem_info
->daddr
.sym
->namelen
+ 4
125 + unresolved_col_width
+ 2;
126 hists__new_col_len(hists
, HISTC_MEM_DADDR_SYMBOL
,
128 hists__new_col_len(hists
, HISTC_MEM_DCACHELINE
,
131 symlen
= unresolved_col_width
+ 4 + 2;
132 hists__new_col_len(hists
, HISTC_MEM_DADDR_SYMBOL
,
134 hists__new_col_len(hists
, HISTC_MEM_DCACHELINE
,
138 if (h
->mem_info
->iaddr
.sym
) {
139 symlen
= (int)h
->mem_info
->iaddr
.sym
->namelen
+ 4
140 + unresolved_col_width
+ 2;
141 hists__new_col_len(hists
, HISTC_MEM_IADDR_SYMBOL
,
144 symlen
= unresolved_col_width
+ 4 + 2;
145 hists__new_col_len(hists
, HISTC_MEM_IADDR_SYMBOL
,
149 if (h
->mem_info
->daddr
.map
) {
150 symlen
= dso__name_len(h
->mem_info
->daddr
.map
->dso
);
151 hists__new_col_len(hists
, HISTC_MEM_DADDR_DSO
,
154 symlen
= unresolved_col_width
+ 4 + 2;
155 hists__set_unres_dso_col_len(hists
, HISTC_MEM_DADDR_DSO
);
158 symlen
= unresolved_col_width
+ 4 + 2;
159 hists__new_col_len(hists
, HISTC_MEM_DADDR_SYMBOL
, symlen
);
160 hists__new_col_len(hists
, HISTC_MEM_IADDR_SYMBOL
, symlen
);
161 hists__set_unres_dso_col_len(hists
, HISTC_MEM_DADDR_DSO
);
164 hists__new_col_len(hists
, HISTC_CPU
, 3);
165 hists__new_col_len(hists
, HISTC_SOCKET
, 6);
166 hists__new_col_len(hists
, HISTC_MEM_LOCKED
, 6);
167 hists__new_col_len(hists
, HISTC_MEM_TLB
, 22);
168 hists__new_col_len(hists
, HISTC_MEM_SNOOP
, 12);
169 hists__new_col_len(hists
, HISTC_MEM_LVL
, 21 + 3);
170 hists__new_col_len(hists
, HISTC_LOCAL_WEIGHT
, 12);
171 hists__new_col_len(hists
, HISTC_GLOBAL_WEIGHT
, 12);
174 hists__new_col_len(hists
, HISTC_SRCLINE
, strlen(h
->srcline
));
177 hists__new_col_len(hists
, HISTC_SRCFILE
, strlen(h
->srcfile
));
180 hists__new_col_len(hists
, HISTC_TRANSACTION
,
181 hist_entry__transaction_len());
184 hists__new_col_len(hists
, HISTC_TRACE
, strlen(h
->trace_output
));
187 void hists__output_recalc_col_len(struct hists
*hists
, int max_rows
)
189 struct rb_node
*next
= rb_first(&hists
->entries
);
190 struct hist_entry
*n
;
193 hists__reset_col_len(hists
);
195 while (next
&& row
++ < max_rows
) {
196 n
= rb_entry(next
, struct hist_entry
, rb_node
);
198 hists__calc_col_len(hists
, n
);
199 next
= rb_next(&n
->rb_node
);
203 static void he_stat__add_cpumode_period(struct he_stat
*he_stat
,
204 unsigned int cpumode
, u64 period
)
207 case PERF_RECORD_MISC_KERNEL
:
208 he_stat
->period_sys
+= period
;
210 case PERF_RECORD_MISC_USER
:
211 he_stat
->period_us
+= period
;
213 case PERF_RECORD_MISC_GUEST_KERNEL
:
214 he_stat
->period_guest_sys
+= period
;
216 case PERF_RECORD_MISC_GUEST_USER
:
217 he_stat
->period_guest_us
+= period
;
224 static void he_stat__add_period(struct he_stat
*he_stat
, u64 period
,
228 he_stat
->period
+= period
;
229 he_stat
->weight
+= weight
;
230 he_stat
->nr_events
+= 1;
233 static void he_stat__add_stat(struct he_stat
*dest
, struct he_stat
*src
)
235 dest
->period
+= src
->period
;
236 dest
->period_sys
+= src
->period_sys
;
237 dest
->period_us
+= src
->period_us
;
238 dest
->period_guest_sys
+= src
->period_guest_sys
;
239 dest
->period_guest_us
+= src
->period_guest_us
;
240 dest
->nr_events
+= src
->nr_events
;
241 dest
->weight
+= src
->weight
;
244 static void he_stat__decay(struct he_stat
*he_stat
)
246 he_stat
->period
= (he_stat
->period
* 7) / 8;
247 he_stat
->nr_events
= (he_stat
->nr_events
* 7) / 8;
248 /* XXX need decay for weight too? */
251 static void hists__delete_entry(struct hists
*hists
, struct hist_entry
*he
);
253 static bool hists__decay_entry(struct hists
*hists
, struct hist_entry
*he
)
255 u64 prev_period
= he
->stat
.period
;
258 if (prev_period
== 0)
261 he_stat__decay(&he
->stat
);
262 if (symbol_conf
.cumulate_callchain
)
263 he_stat__decay(he
->stat_acc
);
264 decay_callchain(he
->callchain
);
266 diff
= prev_period
- he
->stat
.period
;
269 hists
->stats
.total_period
-= diff
;
271 hists
->stats
.total_non_filtered_period
-= diff
;
275 struct hist_entry
*child
;
276 struct rb_node
*node
= rb_first(&he
->hroot_out
);
278 child
= rb_entry(node
, struct hist_entry
, rb_node
);
279 node
= rb_next(node
);
281 if (hists__decay_entry(hists
, child
))
282 hists__delete_entry(hists
, child
);
286 return he
->stat
.period
== 0;
289 static void hists__delete_entry(struct hists
*hists
, struct hist_entry
*he
)
291 struct rb_root
*root_in
;
292 struct rb_root
*root_out
;
295 root_in
= &he
->parent_he
->hroot_in
;
296 root_out
= &he
->parent_he
->hroot_out
;
298 if (hists__has(hists
, need_collapse
))
299 root_in
= &hists
->entries_collapsed
;
301 root_in
= hists
->entries_in
;
302 root_out
= &hists
->entries
;
305 rb_erase(&he
->rb_node_in
, root_in
);
306 rb_erase(&he
->rb_node
, root_out
);
310 --hists
->nr_non_filtered_entries
;
312 hist_entry__delete(he
);
315 void hists__decay_entries(struct hists
*hists
, bool zap_user
, bool zap_kernel
)
317 struct rb_node
*next
= rb_first(&hists
->entries
);
318 struct hist_entry
*n
;
321 n
= rb_entry(next
, struct hist_entry
, rb_node
);
322 next
= rb_next(&n
->rb_node
);
323 if (((zap_user
&& n
->level
== '.') ||
324 (zap_kernel
&& n
->level
!= '.') ||
325 hists__decay_entry(hists
, n
))) {
326 hists__delete_entry(hists
, n
);
331 void hists__delete_entries(struct hists
*hists
)
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
);
340 hists__delete_entry(hists
, n
);
345 * histogram, sorted on item, collects periods
348 static struct hist_entry
*hist_entry__new(struct hist_entry
*template,
351 size_t callchain_size
= 0;
352 struct hist_entry
*he
;
354 if (symbol_conf
.use_callchain
)
355 callchain_size
= sizeof(struct callchain_root
);
357 he
= zalloc(sizeof(*he
) + callchain_size
);
362 if (symbol_conf
.cumulate_callchain
) {
363 he
->stat_acc
= malloc(sizeof(he
->stat
));
364 if (he
->stat_acc
== NULL
) {
368 memcpy(he
->stat_acc
, &he
->stat
, sizeof(he
->stat
));
370 memset(&he
->stat
, 0, sizeof(he
->stat
));
373 map__get(he
->ms
.map
);
375 if (he
->branch_info
) {
377 * This branch info is (a part of) allocated from
378 * sample__resolve_bstack() and will be freed after
379 * adding new entries. So we need to save a copy.
381 he
->branch_info
= malloc(sizeof(*he
->branch_info
));
382 if (he
->branch_info
== NULL
) {
383 map__zput(he
->ms
.map
);
389 memcpy(he
->branch_info
, template->branch_info
,
390 sizeof(*he
->branch_info
));
392 map__get(he
->branch_info
->from
.map
);
393 map__get(he
->branch_info
->to
.map
);
397 map__get(he
->mem_info
->iaddr
.map
);
398 map__get(he
->mem_info
->daddr
.map
);
401 if (symbol_conf
.use_callchain
)
402 callchain_init(he
->callchain
);
405 he
->raw_data
= memdup(he
->raw_data
, he
->raw_size
);
407 if (he
->raw_data
== NULL
) {
408 map__put(he
->ms
.map
);
409 if (he
->branch_info
) {
410 map__put(he
->branch_info
->from
.map
);
411 map__put(he
->branch_info
->to
.map
);
412 free(he
->branch_info
);
415 map__put(he
->mem_info
->iaddr
.map
);
416 map__put(he
->mem_info
->daddr
.map
);
423 INIT_LIST_HEAD(&he
->pairs
.node
);
424 thread__get(he
->thread
);
426 if (!symbol_conf
.report_hierarchy
)
433 static u8
symbol__parent_filter(const struct symbol
*parent
)
435 if (symbol_conf
.exclude_other
&& parent
== NULL
)
436 return 1 << HIST_FILTER__PARENT
;
440 static void hist_entry__add_callchain_period(struct hist_entry
*he
, u64 period
)
442 if (!symbol_conf
.use_callchain
)
445 he
->hists
->callchain_period
+= period
;
447 he
->hists
->callchain_non_filtered_period
+= period
;
450 static struct hist_entry
*hists__findnew_entry(struct hists
*hists
,
451 struct hist_entry
*entry
,
452 struct addr_location
*al
,
456 struct rb_node
*parent
= NULL
;
457 struct hist_entry
*he
;
459 u64 period
= entry
->stat
.period
;
460 u64 weight
= entry
->stat
.weight
;
462 p
= &hists
->entries_in
->rb_node
;
466 he
= rb_entry(parent
, struct hist_entry
, rb_node_in
);
469 * Make sure that it receives arguments in a same order as
470 * hist_entry__collapse() so that we can use an appropriate
471 * function when searching an entry regardless which sort
474 cmp
= hist_entry__cmp(he
, entry
);
478 he_stat__add_period(&he
->stat
, period
, weight
);
479 hist_entry__add_callchain_period(he
, period
);
481 if (symbol_conf
.cumulate_callchain
)
482 he_stat__add_period(he
->stat_acc
, period
, weight
);
485 * This mem info was allocated from sample__resolve_mem
486 * and will not be used anymore.
488 zfree(&entry
->mem_info
);
490 /* If the map of an existing hist_entry has
491 * become out-of-date due to an exec() or
492 * similar, update it. Otherwise we will
493 * mis-adjust symbol addresses when computing
494 * the history counter to increment.
496 if (he
->ms
.map
!= entry
->ms
.map
) {
497 map__put(he
->ms
.map
);
498 he
->ms
.map
= map__get(entry
->ms
.map
);
509 he
= hist_entry__new(entry
, sample_self
);
514 hist_entry__add_callchain_period(he
, period
);
517 rb_link_node(&he
->rb_node_in
, parent
, p
);
518 rb_insert_color(&he
->rb_node_in
, hists
->entries_in
);
521 he_stat__add_cpumode_period(&he
->stat
, al
->cpumode
, period
);
522 if (symbol_conf
.cumulate_callchain
)
523 he_stat__add_cpumode_period(he
->stat_acc
, al
->cpumode
, period
);
527 struct hist_entry
*__hists__add_entry(struct hists
*hists
,
528 struct addr_location
*al
,
529 struct symbol
*sym_parent
,
530 struct branch_info
*bi
,
532 struct perf_sample
*sample
,
535 struct hist_entry entry
= {
536 .thread
= al
->thread
,
537 .comm
= thread__comm(al
->thread
),
542 .socket
= al
->socket
,
544 .cpumode
= al
->cpumode
,
549 .period
= sample
->period
,
550 .weight
= sample
->weight
,
552 .parent
= sym_parent
,
553 .filtered
= symbol__parent_filter(sym_parent
) | al
->filtered
,
557 .transaction
= sample
->transaction
,
558 .raw_data
= sample
->raw_data
,
559 .raw_size
= sample
->raw_size
,
562 return hists__findnew_entry(hists
, &entry
, al
, sample_self
);
566 iter_next_nop_entry(struct hist_entry_iter
*iter __maybe_unused
,
567 struct addr_location
*al __maybe_unused
)
573 iter_add_next_nop_entry(struct hist_entry_iter
*iter __maybe_unused
,
574 struct addr_location
*al __maybe_unused
)
580 iter_prepare_mem_entry(struct hist_entry_iter
*iter
, struct addr_location
*al
)
582 struct perf_sample
*sample
= iter
->sample
;
585 mi
= sample__resolve_mem(sample
, al
);
594 iter_add_single_mem_entry(struct hist_entry_iter
*iter
, struct addr_location
*al
)
597 struct mem_info
*mi
= iter
->priv
;
598 struct hists
*hists
= evsel__hists(iter
->evsel
);
599 struct perf_sample
*sample
= iter
->sample
;
600 struct hist_entry
*he
;
605 cost
= sample
->weight
;
610 * must pass period=weight in order to get the correct
611 * sorting from hists__collapse_resort() which is solely
612 * based on periods. We want sorting be done on nr_events * weight
613 * and this is indirectly achieved by passing period=weight here
614 * and the he_stat__add_period() function.
616 sample
->period
= cost
;
618 he
= __hists__add_entry(hists
, al
, iter
->parent
, NULL
, mi
,
628 iter_finish_mem_entry(struct hist_entry_iter
*iter
,
629 struct addr_location
*al __maybe_unused
)
631 struct perf_evsel
*evsel
= iter
->evsel
;
632 struct hists
*hists
= evsel__hists(evsel
);
633 struct hist_entry
*he
= iter
->he
;
639 hists__inc_nr_samples(hists
, he
->filtered
);
641 err
= hist_entry__append_callchain(he
, iter
->sample
);
645 * We don't need to free iter->priv (mem_info) here since the mem info
646 * was either already freed in hists__findnew_entry() or passed to a
647 * new hist entry by hist_entry__new().
656 iter_prepare_branch_entry(struct hist_entry_iter
*iter
, struct addr_location
*al
)
658 struct branch_info
*bi
;
659 struct perf_sample
*sample
= iter
->sample
;
661 bi
= sample__resolve_bstack(sample
, al
);
666 iter
->total
= sample
->branch_stack
->nr
;
673 iter_add_single_branch_entry(struct hist_entry_iter
*iter
,
674 struct addr_location
*al __maybe_unused
)
676 /* to avoid calling callback function */
683 iter_next_branch_entry(struct hist_entry_iter
*iter
, struct addr_location
*al
)
685 struct branch_info
*bi
= iter
->priv
;
691 if (iter
->curr
>= iter
->total
)
694 al
->map
= bi
[i
].to
.map
;
695 al
->sym
= bi
[i
].to
.sym
;
696 al
->addr
= bi
[i
].to
.addr
;
701 iter_add_next_branch_entry(struct hist_entry_iter
*iter
, struct addr_location
*al
)
703 struct branch_info
*bi
;
704 struct perf_evsel
*evsel
= iter
->evsel
;
705 struct hists
*hists
= evsel__hists(evsel
);
706 struct perf_sample
*sample
= iter
->sample
;
707 struct hist_entry
*he
= NULL
;
713 if (iter
->hide_unresolved
&& !(bi
[i
].from
.sym
&& bi
[i
].to
.sym
))
717 * The report shows the percentage of total branches captured
718 * and not events sampled. Thus we use a pseudo period of 1.
721 sample
->weight
= bi
->flags
.cycles
? bi
->flags
.cycles
: 1;
723 he
= __hists__add_entry(hists
, al
, iter
->parent
, &bi
[i
], NULL
,
728 hists__inc_nr_samples(hists
, he
->filtered
);
737 iter_finish_branch_entry(struct hist_entry_iter
*iter
,
738 struct addr_location
*al __maybe_unused
)
743 return iter
->curr
>= iter
->total
? 0 : -1;
747 iter_prepare_normal_entry(struct hist_entry_iter
*iter __maybe_unused
,
748 struct addr_location
*al __maybe_unused
)
754 iter_add_single_normal_entry(struct hist_entry_iter
*iter
, struct addr_location
*al
)
756 struct perf_evsel
*evsel
= iter
->evsel
;
757 struct perf_sample
*sample
= iter
->sample
;
758 struct hist_entry
*he
;
760 he
= __hists__add_entry(evsel__hists(evsel
), al
, iter
->parent
, NULL
, NULL
,
770 iter_finish_normal_entry(struct hist_entry_iter
*iter
,
771 struct addr_location
*al __maybe_unused
)
773 struct hist_entry
*he
= iter
->he
;
774 struct perf_evsel
*evsel
= iter
->evsel
;
775 struct perf_sample
*sample
= iter
->sample
;
782 hists__inc_nr_samples(evsel__hists(evsel
), he
->filtered
);
784 return hist_entry__append_callchain(he
, sample
);
788 iter_prepare_cumulative_entry(struct hist_entry_iter
*iter
,
789 struct addr_location
*al __maybe_unused
)
791 struct hist_entry
**he_cache
;
793 callchain_cursor_commit(&callchain_cursor
);
796 * This is for detecting cycles or recursions so that they're
797 * cumulated only one time to prevent entries more than 100%
800 he_cache
= malloc(sizeof(*he_cache
) * (iter
->max_stack
+ 1));
801 if (he_cache
== NULL
)
804 iter
->priv
= he_cache
;
811 iter_add_single_cumulative_entry(struct hist_entry_iter
*iter
,
812 struct addr_location
*al
)
814 struct perf_evsel
*evsel
= iter
->evsel
;
815 struct hists
*hists
= evsel__hists(evsel
);
816 struct perf_sample
*sample
= iter
->sample
;
817 struct hist_entry
**he_cache
= iter
->priv
;
818 struct hist_entry
*he
;
821 he
= __hists__add_entry(hists
, al
, iter
->parent
, NULL
, NULL
,
827 he_cache
[iter
->curr
++] = he
;
829 hist_entry__append_callchain(he
, sample
);
832 * We need to re-initialize the cursor since callchain_append()
833 * advanced the cursor to the end.
835 callchain_cursor_commit(&callchain_cursor
);
837 hists__inc_nr_samples(hists
, he
->filtered
);
843 iter_next_cumulative_entry(struct hist_entry_iter
*iter
,
844 struct addr_location
*al
)
846 struct callchain_cursor_node
*node
;
848 node
= callchain_cursor_current(&callchain_cursor
);
852 return fill_callchain_info(al
, node
, iter
->hide_unresolved
);
856 iter_add_next_cumulative_entry(struct hist_entry_iter
*iter
,
857 struct addr_location
*al
)
859 struct perf_evsel
*evsel
= iter
->evsel
;
860 struct perf_sample
*sample
= iter
->sample
;
861 struct hist_entry
**he_cache
= iter
->priv
;
862 struct hist_entry
*he
;
863 struct hist_entry he_tmp
= {
864 .hists
= evsel__hists(evsel
),
866 .thread
= al
->thread
,
867 .comm
= thread__comm(al
->thread
),
873 .parent
= iter
->parent
,
874 .raw_data
= sample
->raw_data
,
875 .raw_size
= sample
->raw_size
,
878 struct callchain_cursor cursor
;
880 callchain_cursor_snapshot(&cursor
, &callchain_cursor
);
882 callchain_cursor_advance(&callchain_cursor
);
885 * Check if there's duplicate entries in the callchain.
886 * It's possible that it has cycles or recursive calls.
888 for (i
= 0; i
< iter
->curr
; i
++) {
889 if (hist_entry__cmp(he_cache
[i
], &he_tmp
) == 0) {
890 /* to avoid calling callback function */
896 he
= __hists__add_entry(evsel__hists(evsel
), al
, iter
->parent
, NULL
, NULL
,
902 he_cache
[iter
->curr
++] = he
;
904 if (symbol_conf
.use_callchain
)
905 callchain_append(he
->callchain
, &cursor
, sample
->period
);
910 iter_finish_cumulative_entry(struct hist_entry_iter
*iter
,
911 struct addr_location
*al __maybe_unused
)
919 const struct hist_iter_ops hist_iter_mem
= {
920 .prepare_entry
= iter_prepare_mem_entry
,
921 .add_single_entry
= iter_add_single_mem_entry
,
922 .next_entry
= iter_next_nop_entry
,
923 .add_next_entry
= iter_add_next_nop_entry
,
924 .finish_entry
= iter_finish_mem_entry
,
927 const struct hist_iter_ops hist_iter_branch
= {
928 .prepare_entry
= iter_prepare_branch_entry
,
929 .add_single_entry
= iter_add_single_branch_entry
,
930 .next_entry
= iter_next_branch_entry
,
931 .add_next_entry
= iter_add_next_branch_entry
,
932 .finish_entry
= iter_finish_branch_entry
,
935 const struct hist_iter_ops hist_iter_normal
= {
936 .prepare_entry
= iter_prepare_normal_entry
,
937 .add_single_entry
= iter_add_single_normal_entry
,
938 .next_entry
= iter_next_nop_entry
,
939 .add_next_entry
= iter_add_next_nop_entry
,
940 .finish_entry
= iter_finish_normal_entry
,
943 const struct hist_iter_ops hist_iter_cumulative
= {
944 .prepare_entry
= iter_prepare_cumulative_entry
,
945 .add_single_entry
= iter_add_single_cumulative_entry
,
946 .next_entry
= iter_next_cumulative_entry
,
947 .add_next_entry
= iter_add_next_cumulative_entry
,
948 .finish_entry
= iter_finish_cumulative_entry
,
951 int hist_entry_iter__add(struct hist_entry_iter
*iter
, struct addr_location
*al
,
952 int max_stack_depth
, void *arg
)
956 err
= sample__resolve_callchain(iter
->sample
, &callchain_cursor
, &iter
->parent
,
957 iter
->evsel
, al
, max_stack_depth
);
961 iter
->max_stack
= max_stack_depth
;
963 err
= iter
->ops
->prepare_entry(iter
, al
);
967 err
= iter
->ops
->add_single_entry(iter
, al
);
971 if (iter
->he
&& iter
->add_entry_cb
) {
972 err
= iter
->add_entry_cb(iter
, al
, true, arg
);
977 while (iter
->ops
->next_entry(iter
, al
)) {
978 err
= iter
->ops
->add_next_entry(iter
, al
);
982 if (iter
->he
&& iter
->add_entry_cb
) {
983 err
= iter
->add_entry_cb(iter
, al
, false, arg
);
990 err2
= iter
->ops
->finish_entry(iter
, al
);
998 hist_entry__cmp(struct hist_entry
*left
, struct hist_entry
*right
)
1000 struct hists
*hists
= left
->hists
;
1001 struct perf_hpp_fmt
*fmt
;
1004 hists__for_each_sort_list(hists
, fmt
) {
1005 if (perf_hpp__is_dynamic_entry(fmt
) &&
1006 !perf_hpp__defined_dynamic_entry(fmt
, hists
))
1009 cmp
= fmt
->cmp(fmt
, left
, right
);
1018 hist_entry__collapse(struct hist_entry
*left
, struct hist_entry
*right
)
1020 struct hists
*hists
= left
->hists
;
1021 struct perf_hpp_fmt
*fmt
;
1024 hists__for_each_sort_list(hists
, fmt
) {
1025 if (perf_hpp__is_dynamic_entry(fmt
) &&
1026 !perf_hpp__defined_dynamic_entry(fmt
, hists
))
1029 cmp
= fmt
->collapse(fmt
, left
, right
);
1037 void hist_entry__delete(struct hist_entry
*he
)
1039 thread__zput(he
->thread
);
1040 map__zput(he
->ms
.map
);
1042 if (he
->branch_info
) {
1043 map__zput(he
->branch_info
->from
.map
);
1044 map__zput(he
->branch_info
->to
.map
);
1045 zfree(&he
->branch_info
);
1049 map__zput(he
->mem_info
->iaddr
.map
);
1050 map__zput(he
->mem_info
->daddr
.map
);
1051 zfree(&he
->mem_info
);
1054 zfree(&he
->stat_acc
);
1055 free_srcline(he
->srcline
);
1056 if (he
->srcfile
&& he
->srcfile
[0])
1058 free_callchain(he
->callchain
);
1059 free(he
->trace_output
);
1065 * If this is not the last column, then we need to pad it according to the
1066 * pre-calculated max lenght for this column, otherwise don't bother adding
1067 * spaces because that would break viewing this with, for instance, 'less',
1068 * that would show tons of trailing spaces when a long C++ demangled method
1071 int hist_entry__snprintf_alignment(struct hist_entry
*he
, struct perf_hpp
*hpp
,
1072 struct perf_hpp_fmt
*fmt
, int printed
)
1074 if (!list_is_last(&fmt
->list
, &he
->hists
->hpp_list
->fields
)) {
1075 const int width
= fmt
->width(fmt
, hpp
, hists_to_evsel(he
->hists
));
1076 if (printed
< width
) {
1077 advance_hpp(hpp
, printed
);
1078 printed
= scnprintf(hpp
->buf
, hpp
->size
, "%-*s", width
- printed
, " ");
1086 * collapse the histogram
1089 static void hists__apply_filters(struct hists
*hists
, struct hist_entry
*he
);
1090 static void hists__remove_entry_filter(struct hists
*hists
, struct hist_entry
*he
,
1091 enum hist_filter type
);
1093 typedef bool (*fmt_chk_fn
)(struct perf_hpp_fmt
*fmt
);
1095 static bool check_thread_entry(struct perf_hpp_fmt
*fmt
)
1097 return perf_hpp__is_thread_entry(fmt
) || perf_hpp__is_comm_entry(fmt
);
1100 static void hist_entry__check_and_remove_filter(struct hist_entry
*he
,
1101 enum hist_filter type
,
1104 struct perf_hpp_fmt
*fmt
;
1105 bool type_match
= false;
1106 struct hist_entry
*parent
= he
->parent_he
;
1109 case HIST_FILTER__THREAD
:
1110 if (symbol_conf
.comm_list
== NULL
&&
1111 symbol_conf
.pid_list
== NULL
&&
1112 symbol_conf
.tid_list
== NULL
)
1115 case HIST_FILTER__DSO
:
1116 if (symbol_conf
.dso_list
== NULL
)
1119 case HIST_FILTER__SYMBOL
:
1120 if (symbol_conf
.sym_list
== NULL
)
1123 case HIST_FILTER__PARENT
:
1124 case HIST_FILTER__GUEST
:
1125 case HIST_FILTER__HOST
:
1126 case HIST_FILTER__SOCKET
:
1131 /* if it's filtered by own fmt, it has to have filter bits */
1132 perf_hpp_list__for_each_format(he
->hpp_list
, fmt
) {
1141 * If the filter is for current level entry, propagate
1142 * filter marker to parents. The marker bit was
1143 * already set by default so it only needs to clear
1144 * non-filtered entries.
1146 if (!(he
->filtered
& (1 << type
))) {
1148 parent
->filtered
&= ~(1 << type
);
1149 parent
= parent
->parent_he
;
1154 * If current entry doesn't have matching formats, set
1155 * filter marker for upper level entries. it will be
1156 * cleared if its lower level entries is not filtered.
1158 * For lower-level entries, it inherits parent's
1159 * filter bit so that lower level entries of a
1160 * non-filtered entry won't set the filter marker.
1163 he
->filtered
|= (1 << type
);
1165 he
->filtered
|= (parent
->filtered
& (1 << type
));
1169 static void hist_entry__apply_hierarchy_filters(struct hist_entry
*he
)
1171 hist_entry__check_and_remove_filter(he
, HIST_FILTER__THREAD
,
1172 check_thread_entry
);
1174 hist_entry__check_and_remove_filter(he
, HIST_FILTER__DSO
,
1175 perf_hpp__is_dso_entry
);
1177 hist_entry__check_and_remove_filter(he
, HIST_FILTER__SYMBOL
,
1178 perf_hpp__is_sym_entry
);
1180 hists__apply_filters(he
->hists
, he
);
1183 static struct hist_entry
*hierarchy_insert_entry(struct hists
*hists
,
1184 struct rb_root
*root
,
1185 struct hist_entry
*he
,
1186 struct hist_entry
*parent_he
,
1187 struct perf_hpp_list
*hpp_list
)
1189 struct rb_node
**p
= &root
->rb_node
;
1190 struct rb_node
*parent
= NULL
;
1191 struct hist_entry
*iter
, *new;
1192 struct perf_hpp_fmt
*fmt
;
1195 while (*p
!= NULL
) {
1197 iter
= rb_entry(parent
, struct hist_entry
, rb_node_in
);
1200 perf_hpp_list__for_each_sort_list(hpp_list
, fmt
) {
1201 cmp
= fmt
->collapse(fmt
, iter
, he
);
1207 he_stat__add_stat(&iter
->stat
, &he
->stat
);
1212 p
= &parent
->rb_left
;
1214 p
= &parent
->rb_right
;
1217 new = hist_entry__new(he
, true);
1221 hists
->nr_entries
++;
1223 /* save related format list for output */
1224 new->hpp_list
= hpp_list
;
1225 new->parent_he
= parent_he
;
1227 hist_entry__apply_hierarchy_filters(new);
1229 /* some fields are now passed to 'new' */
1230 perf_hpp_list__for_each_sort_list(hpp_list
, fmt
) {
1231 if (perf_hpp__is_trace_entry(fmt
) || perf_hpp__is_dynamic_entry(fmt
))
1232 he
->trace_output
= NULL
;
1234 new->trace_output
= NULL
;
1236 if (perf_hpp__is_srcline_entry(fmt
))
1239 new->srcline
= NULL
;
1241 if (perf_hpp__is_srcfile_entry(fmt
))
1244 new->srcfile
= NULL
;
1247 rb_link_node(&new->rb_node_in
, parent
, p
);
1248 rb_insert_color(&new->rb_node_in
, root
);
1252 static int hists__hierarchy_insert_entry(struct hists
*hists
,
1253 struct rb_root
*root
,
1254 struct hist_entry
*he
)
1256 struct perf_hpp_list_node
*node
;
1257 struct hist_entry
*new_he
= NULL
;
1258 struct hist_entry
*parent
= NULL
;
1262 list_for_each_entry(node
, &hists
->hpp_formats
, list
) {
1263 /* skip period (overhead) and elided columns */
1264 if (node
->level
== 0 || node
->skip
)
1267 /* insert copy of 'he' for each fmt into the hierarchy */
1268 new_he
= hierarchy_insert_entry(hists
, root
, he
, parent
, &node
->hpp
);
1269 if (new_he
== NULL
) {
1274 root
= &new_he
->hroot_in
;
1275 new_he
->depth
= depth
++;
1280 new_he
->leaf
= true;
1282 if (symbol_conf
.use_callchain
) {
1283 callchain_cursor_reset(&callchain_cursor
);
1284 if (callchain_merge(&callchain_cursor
,
1291 /* 'he' is no longer used */
1292 hist_entry__delete(he
);
1294 /* return 0 (or -1) since it already applied filters */
1298 static int hists__collapse_insert_entry(struct hists
*hists
,
1299 struct rb_root
*root
,
1300 struct hist_entry
*he
)
1302 struct rb_node
**p
= &root
->rb_node
;
1303 struct rb_node
*parent
= NULL
;
1304 struct hist_entry
*iter
;
1307 if (symbol_conf
.report_hierarchy
)
1308 return hists__hierarchy_insert_entry(hists
, root
, he
);
1310 while (*p
!= NULL
) {
1312 iter
= rb_entry(parent
, struct hist_entry
, rb_node_in
);
1314 cmp
= hist_entry__collapse(iter
, he
);
1319 he_stat__add_stat(&iter
->stat
, &he
->stat
);
1320 if (symbol_conf
.cumulate_callchain
)
1321 he_stat__add_stat(iter
->stat_acc
, he
->stat_acc
);
1323 if (symbol_conf
.use_callchain
) {
1324 callchain_cursor_reset(&callchain_cursor
);
1325 if (callchain_merge(&callchain_cursor
,
1330 hist_entry__delete(he
);
1337 p
= &(*p
)->rb_right
;
1339 hists
->nr_entries
++;
1341 rb_link_node(&he
->rb_node_in
, parent
, p
);
1342 rb_insert_color(&he
->rb_node_in
, root
);
1346 struct rb_root
*hists__get_rotate_entries_in(struct hists
*hists
)
1348 struct rb_root
*root
;
1350 pthread_mutex_lock(&hists
->lock
);
1352 root
= hists
->entries_in
;
1353 if (++hists
->entries_in
> &hists
->entries_in_array
[1])
1354 hists
->entries_in
= &hists
->entries_in_array
[0];
1356 pthread_mutex_unlock(&hists
->lock
);
1361 static void hists__apply_filters(struct hists
*hists
, struct hist_entry
*he
)
1363 hists__filter_entry_by_dso(hists
, he
);
1364 hists__filter_entry_by_thread(hists
, he
);
1365 hists__filter_entry_by_symbol(hists
, he
);
1366 hists__filter_entry_by_socket(hists
, he
);
1369 int hists__collapse_resort(struct hists
*hists
, struct ui_progress
*prog
)
1371 struct rb_root
*root
;
1372 struct rb_node
*next
;
1373 struct hist_entry
*n
;
1376 if (!hists__has(hists
, need_collapse
))
1379 hists
->nr_entries
= 0;
1381 root
= hists__get_rotate_entries_in(hists
);
1383 next
= rb_first(root
);
1388 n
= rb_entry(next
, struct hist_entry
, rb_node_in
);
1389 next
= rb_next(&n
->rb_node_in
);
1391 rb_erase(&n
->rb_node_in
, root
);
1392 ret
= hists__collapse_insert_entry(hists
, &hists
->entries_collapsed
, n
);
1398 * If it wasn't combined with one of the entries already
1399 * collapsed, we need to apply the filters that may have
1400 * been set by, say, the hist_browser.
1402 hists__apply_filters(hists
, n
);
1405 ui_progress__update(prog
, 1);
1410 static int hist_entry__sort(struct hist_entry
*a
, struct hist_entry
*b
)
1412 struct hists
*hists
= a
->hists
;
1413 struct perf_hpp_fmt
*fmt
;
1416 hists__for_each_sort_list(hists
, fmt
) {
1417 if (perf_hpp__should_skip(fmt
, a
->hists
))
1420 cmp
= fmt
->sort(fmt
, a
, b
);
1428 static void hists__reset_filter_stats(struct hists
*hists
)
1430 hists
->nr_non_filtered_entries
= 0;
1431 hists
->stats
.total_non_filtered_period
= 0;
1434 void hists__reset_stats(struct hists
*hists
)
1436 hists
->nr_entries
= 0;
1437 hists
->stats
.total_period
= 0;
1439 hists__reset_filter_stats(hists
);
1442 static void hists__inc_filter_stats(struct hists
*hists
, struct hist_entry
*h
)
1444 hists
->nr_non_filtered_entries
++;
1445 hists
->stats
.total_non_filtered_period
+= h
->stat
.period
;
1448 void hists__inc_stats(struct hists
*hists
, struct hist_entry
*h
)
1451 hists__inc_filter_stats(hists
, h
);
1453 hists
->nr_entries
++;
1454 hists
->stats
.total_period
+= h
->stat
.period
;
1457 static void hierarchy_recalc_total_periods(struct hists
*hists
)
1459 struct rb_node
*node
;
1460 struct hist_entry
*he
;
1462 node
= rb_first(&hists
->entries
);
1464 hists
->stats
.total_period
= 0;
1465 hists
->stats
.total_non_filtered_period
= 0;
1468 * recalculate total period using top-level entries only
1469 * since lower level entries only see non-filtered entries
1470 * but upper level entries have sum of both entries.
1473 he
= rb_entry(node
, struct hist_entry
, rb_node
);
1474 node
= rb_next(node
);
1476 hists
->stats
.total_period
+= he
->stat
.period
;
1478 hists
->stats
.total_non_filtered_period
+= he
->stat
.period
;
1482 static void hierarchy_insert_output_entry(struct rb_root
*root
,
1483 struct hist_entry
*he
)
1485 struct rb_node
**p
= &root
->rb_node
;
1486 struct rb_node
*parent
= NULL
;
1487 struct hist_entry
*iter
;
1488 struct perf_hpp_fmt
*fmt
;
1490 while (*p
!= NULL
) {
1492 iter
= rb_entry(parent
, struct hist_entry
, rb_node
);
1494 if (hist_entry__sort(he
, iter
) > 0)
1495 p
= &parent
->rb_left
;
1497 p
= &parent
->rb_right
;
1500 rb_link_node(&he
->rb_node
, parent
, p
);
1501 rb_insert_color(&he
->rb_node
, root
);
1503 /* update column width of dynamic entry */
1504 perf_hpp_list__for_each_sort_list(he
->hpp_list
, fmt
) {
1505 if (perf_hpp__is_dynamic_entry(fmt
))
1506 fmt
->sort(fmt
, he
, NULL
);
1510 static void hists__hierarchy_output_resort(struct hists
*hists
,
1511 struct ui_progress
*prog
,
1512 struct rb_root
*root_in
,
1513 struct rb_root
*root_out
,
1514 u64 min_callchain_hits
,
1517 struct rb_node
*node
;
1518 struct hist_entry
*he
;
1520 *root_out
= RB_ROOT
;
1521 node
= rb_first(root_in
);
1524 he
= rb_entry(node
, struct hist_entry
, rb_node_in
);
1525 node
= rb_next(node
);
1527 hierarchy_insert_output_entry(root_out
, he
);
1530 ui_progress__update(prog
, 1);
1533 hists__hierarchy_output_resort(hists
, prog
,
1538 hists
->nr_entries
++;
1539 if (!he
->filtered
) {
1540 hists
->nr_non_filtered_entries
++;
1541 hists__calc_col_len(hists
, he
);
1550 if (callchain_param
.mode
== CHAIN_GRAPH_REL
) {
1551 u64 total
= he
->stat
.period
;
1553 if (symbol_conf
.cumulate_callchain
)
1554 total
= he
->stat_acc
->period
;
1556 min_callchain_hits
= total
* (callchain_param
.min_percent
/ 100);
1559 callchain_param
.sort(&he
->sorted_chain
, he
->callchain
,
1560 min_callchain_hits
, &callchain_param
);
1564 static void __hists__insert_output_entry(struct rb_root
*entries
,
1565 struct hist_entry
*he
,
1566 u64 min_callchain_hits
,
1569 struct rb_node
**p
= &entries
->rb_node
;
1570 struct rb_node
*parent
= NULL
;
1571 struct hist_entry
*iter
;
1572 struct perf_hpp_fmt
*fmt
;
1574 if (use_callchain
) {
1575 if (callchain_param
.mode
== CHAIN_GRAPH_REL
) {
1576 u64 total
= he
->stat
.period
;
1578 if (symbol_conf
.cumulate_callchain
)
1579 total
= he
->stat_acc
->period
;
1581 min_callchain_hits
= total
* (callchain_param
.min_percent
/ 100);
1583 callchain_param
.sort(&he
->sorted_chain
, he
->callchain
,
1584 min_callchain_hits
, &callchain_param
);
1587 while (*p
!= NULL
) {
1589 iter
= rb_entry(parent
, struct hist_entry
, rb_node
);
1591 if (hist_entry__sort(he
, iter
) > 0)
1594 p
= &(*p
)->rb_right
;
1597 rb_link_node(&he
->rb_node
, parent
, p
);
1598 rb_insert_color(&he
->rb_node
, entries
);
1600 perf_hpp_list__for_each_sort_list(&perf_hpp_list
, fmt
) {
1601 if (perf_hpp__is_dynamic_entry(fmt
) &&
1602 perf_hpp__defined_dynamic_entry(fmt
, he
->hists
))
1603 fmt
->sort(fmt
, he
, NULL
); /* update column width */
1607 static void output_resort(struct hists
*hists
, struct ui_progress
*prog
,
1610 struct rb_root
*root
;
1611 struct rb_node
*next
;
1612 struct hist_entry
*n
;
1613 u64 callchain_total
;
1614 u64 min_callchain_hits
;
1616 callchain_total
= hists
->callchain_period
;
1617 if (symbol_conf
.filter_relative
)
1618 callchain_total
= hists
->callchain_non_filtered_period
;
1620 min_callchain_hits
= callchain_total
* (callchain_param
.min_percent
/ 100);
1622 hists__reset_stats(hists
);
1623 hists__reset_col_len(hists
);
1625 if (symbol_conf
.report_hierarchy
) {
1626 hists__hierarchy_output_resort(hists
, prog
,
1627 &hists
->entries_collapsed
,
1631 hierarchy_recalc_total_periods(hists
);
1635 if (hists__has(hists
, need_collapse
))
1636 root
= &hists
->entries_collapsed
;
1638 root
= hists
->entries_in
;
1640 next
= rb_first(root
);
1641 hists
->entries
= RB_ROOT
;
1644 n
= rb_entry(next
, struct hist_entry
, rb_node_in
);
1645 next
= rb_next(&n
->rb_node_in
);
1647 __hists__insert_output_entry(&hists
->entries
, n
, min_callchain_hits
, use_callchain
);
1648 hists__inc_stats(hists
, n
);
1651 hists__calc_col_len(hists
, n
);
1654 ui_progress__update(prog
, 1);
1658 void perf_evsel__output_resort(struct perf_evsel
*evsel
, struct ui_progress
*prog
)
1662 if (evsel
&& symbol_conf
.use_callchain
&& !symbol_conf
.show_ref_callgraph
)
1663 use_callchain
= evsel
->attr
.sample_type
& PERF_SAMPLE_CALLCHAIN
;
1665 use_callchain
= symbol_conf
.use_callchain
;
1667 output_resort(evsel__hists(evsel
), prog
, use_callchain
);
1670 void hists__output_resort(struct hists
*hists
, struct ui_progress
*prog
)
1672 output_resort(hists
, prog
, symbol_conf
.use_callchain
);
1675 static bool can_goto_child(struct hist_entry
*he
, enum hierarchy_move_dir hmd
)
1677 if (he
->leaf
|| hmd
== HMD_FORCE_SIBLING
)
1680 if (he
->unfolded
|| hmd
== HMD_FORCE_CHILD
)
1686 struct rb_node
*rb_hierarchy_last(struct rb_node
*node
)
1688 struct hist_entry
*he
= rb_entry(node
, struct hist_entry
, rb_node
);
1690 while (can_goto_child(he
, HMD_NORMAL
)) {
1691 node
= rb_last(&he
->hroot_out
);
1692 he
= rb_entry(node
, struct hist_entry
, rb_node
);
1697 struct rb_node
*__rb_hierarchy_next(struct rb_node
*node
, enum hierarchy_move_dir hmd
)
1699 struct hist_entry
*he
= rb_entry(node
, struct hist_entry
, rb_node
);
1701 if (can_goto_child(he
, hmd
))
1702 node
= rb_first(&he
->hroot_out
);
1704 node
= rb_next(node
);
1706 while (node
== NULL
) {
1711 node
= rb_next(&he
->rb_node
);
1716 struct rb_node
*rb_hierarchy_prev(struct rb_node
*node
)
1718 struct hist_entry
*he
= rb_entry(node
, struct hist_entry
, rb_node
);
1720 node
= rb_prev(node
);
1722 return rb_hierarchy_last(node
);
1728 return &he
->rb_node
;
1731 bool hist_entry__has_hierarchy_children(struct hist_entry
*he
, float limit
)
1733 struct rb_node
*node
;
1734 struct hist_entry
*child
;
1740 node
= rb_first(&he
->hroot_out
);
1741 child
= rb_entry(node
, struct hist_entry
, rb_node
);
1743 while (node
&& child
->filtered
) {
1744 node
= rb_next(node
);
1745 child
= rb_entry(node
, struct hist_entry
, rb_node
);
1749 percent
= hist_entry__get_percent_limit(child
);
1753 return node
&& percent
>= limit
;
1756 static void hists__remove_entry_filter(struct hists
*hists
, struct hist_entry
*h
,
1757 enum hist_filter filter
)
1759 h
->filtered
&= ~(1 << filter
);
1761 if (symbol_conf
.report_hierarchy
) {
1762 struct hist_entry
*parent
= h
->parent_he
;
1765 he_stat__add_stat(&parent
->stat
, &h
->stat
);
1767 parent
->filtered
&= ~(1 << filter
);
1769 if (parent
->filtered
)
1772 /* force fold unfiltered entry for simplicity */
1773 parent
->unfolded
= false;
1774 parent
->has_no_entry
= false;
1775 parent
->row_offset
= 0;
1776 parent
->nr_rows
= 0;
1778 parent
= parent
->parent_he
;
1785 /* force fold unfiltered entry for simplicity */
1786 h
->unfolded
= false;
1787 h
->has_no_entry
= false;
1791 hists
->stats
.nr_non_filtered_samples
+= h
->stat
.nr_events
;
1793 hists__inc_filter_stats(hists
, h
);
1794 hists__calc_col_len(hists
, h
);
1798 static bool hists__filter_entry_by_dso(struct hists
*hists
,
1799 struct hist_entry
*he
)
1801 if (hists
->dso_filter
!= NULL
&&
1802 (he
->ms
.map
== NULL
|| he
->ms
.map
->dso
!= hists
->dso_filter
)) {
1803 he
->filtered
|= (1 << HIST_FILTER__DSO
);
1810 static bool hists__filter_entry_by_thread(struct hists
*hists
,
1811 struct hist_entry
*he
)
1813 if (hists
->thread_filter
!= NULL
&&
1814 he
->thread
!= hists
->thread_filter
) {
1815 he
->filtered
|= (1 << HIST_FILTER__THREAD
);
1822 static bool hists__filter_entry_by_symbol(struct hists
*hists
,
1823 struct hist_entry
*he
)
1825 if (hists
->symbol_filter_str
!= NULL
&&
1826 (!he
->ms
.sym
|| strstr(he
->ms
.sym
->name
,
1827 hists
->symbol_filter_str
) == NULL
)) {
1828 he
->filtered
|= (1 << HIST_FILTER__SYMBOL
);
1835 static bool hists__filter_entry_by_socket(struct hists
*hists
,
1836 struct hist_entry
*he
)
1838 if ((hists
->socket_filter
> -1) &&
1839 (he
->socket
!= hists
->socket_filter
)) {
1840 he
->filtered
|= (1 << HIST_FILTER__SOCKET
);
1847 typedef bool (*filter_fn_t
)(struct hists
*hists
, struct hist_entry
*he
);
1849 static void hists__filter_by_type(struct hists
*hists
, int type
, filter_fn_t filter
)
1853 hists
->stats
.nr_non_filtered_samples
= 0;
1855 hists__reset_filter_stats(hists
);
1856 hists__reset_col_len(hists
);
1858 for (nd
= rb_first(&hists
->entries
); nd
; nd
= rb_next(nd
)) {
1859 struct hist_entry
*h
= rb_entry(nd
, struct hist_entry
, rb_node
);
1861 if (filter(hists
, h
))
1864 hists__remove_entry_filter(hists
, h
, type
);
1868 static void resort_filtered_entry(struct rb_root
*root
, struct hist_entry
*he
)
1870 struct rb_node
**p
= &root
->rb_node
;
1871 struct rb_node
*parent
= NULL
;
1872 struct hist_entry
*iter
;
1873 struct rb_root new_root
= RB_ROOT
;
1876 while (*p
!= NULL
) {
1878 iter
= rb_entry(parent
, struct hist_entry
, rb_node
);
1880 if (hist_entry__sort(he
, iter
) > 0)
1883 p
= &(*p
)->rb_right
;
1886 rb_link_node(&he
->rb_node
, parent
, p
);
1887 rb_insert_color(&he
->rb_node
, root
);
1889 if (he
->leaf
|| he
->filtered
)
1892 nd
= rb_first(&he
->hroot_out
);
1894 struct hist_entry
*h
= rb_entry(nd
, struct hist_entry
, rb_node
);
1897 rb_erase(&h
->rb_node
, &he
->hroot_out
);
1899 resort_filtered_entry(&new_root
, h
);
1902 he
->hroot_out
= new_root
;
1905 static void hists__filter_hierarchy(struct hists
*hists
, int type
, const void *arg
)
1908 struct rb_root new_root
= RB_ROOT
;
1910 hists
->stats
.nr_non_filtered_samples
= 0;
1912 hists__reset_filter_stats(hists
);
1913 hists__reset_col_len(hists
);
1915 nd
= rb_first(&hists
->entries
);
1917 struct hist_entry
*h
= rb_entry(nd
, struct hist_entry
, rb_node
);
1920 ret
= hist_entry__filter(h
, type
, arg
);
1923 * case 1. non-matching type
1924 * zero out the period, set filter marker and move to child
1927 memset(&h
->stat
, 0, sizeof(h
->stat
));
1928 h
->filtered
|= (1 << type
);
1930 nd
= __rb_hierarchy_next(&h
->rb_node
, HMD_FORCE_CHILD
);
1933 * case 2. matched type (filter out)
1934 * set filter marker and move to next
1936 else if (ret
== 1) {
1937 h
->filtered
|= (1 << type
);
1939 nd
= __rb_hierarchy_next(&h
->rb_node
, HMD_FORCE_SIBLING
);
1942 * case 3. ok (not filtered)
1943 * add period to hists and parents, erase the filter marker
1944 * and move to next sibling
1947 hists__remove_entry_filter(hists
, h
, type
);
1949 nd
= __rb_hierarchy_next(&h
->rb_node
, HMD_FORCE_SIBLING
);
1953 hierarchy_recalc_total_periods(hists
);
1956 * resort output after applying a new filter since filter in a lower
1957 * hierarchy can change periods in a upper hierarchy.
1959 nd
= rb_first(&hists
->entries
);
1961 struct hist_entry
*h
= rb_entry(nd
, struct hist_entry
, rb_node
);
1964 rb_erase(&h
->rb_node
, &hists
->entries
);
1966 resort_filtered_entry(&new_root
, h
);
1969 hists
->entries
= new_root
;
1972 void hists__filter_by_thread(struct hists
*hists
)
1974 if (symbol_conf
.report_hierarchy
)
1975 hists__filter_hierarchy(hists
, HIST_FILTER__THREAD
,
1976 hists
->thread_filter
);
1978 hists__filter_by_type(hists
, HIST_FILTER__THREAD
,
1979 hists__filter_entry_by_thread
);
1982 void hists__filter_by_dso(struct hists
*hists
)
1984 if (symbol_conf
.report_hierarchy
)
1985 hists__filter_hierarchy(hists
, HIST_FILTER__DSO
,
1988 hists__filter_by_type(hists
, HIST_FILTER__DSO
,
1989 hists__filter_entry_by_dso
);
1992 void hists__filter_by_symbol(struct hists
*hists
)
1994 if (symbol_conf
.report_hierarchy
)
1995 hists__filter_hierarchy(hists
, HIST_FILTER__SYMBOL
,
1996 hists
->symbol_filter_str
);
1998 hists__filter_by_type(hists
, HIST_FILTER__SYMBOL
,
1999 hists__filter_entry_by_symbol
);
2002 void hists__filter_by_socket(struct hists
*hists
)
2004 if (symbol_conf
.report_hierarchy
)
2005 hists__filter_hierarchy(hists
, HIST_FILTER__SOCKET
,
2006 &hists
->socket_filter
);
2008 hists__filter_by_type(hists
, HIST_FILTER__SOCKET
,
2009 hists__filter_entry_by_socket
);
2012 void events_stats__inc(struct events_stats
*stats
, u32 type
)
2014 ++stats
->nr_events
[0];
2015 ++stats
->nr_events
[type
];
2018 void hists__inc_nr_events(struct hists
*hists
, u32 type
)
2020 events_stats__inc(&hists
->stats
, type
);
2023 void hists__inc_nr_samples(struct hists
*hists
, bool filtered
)
2025 events_stats__inc(&hists
->stats
, PERF_RECORD_SAMPLE
);
2027 hists
->stats
.nr_non_filtered_samples
++;
2030 static struct hist_entry
*hists__add_dummy_entry(struct hists
*hists
,
2031 struct hist_entry
*pair
)
2033 struct rb_root
*root
;
2035 struct rb_node
*parent
= NULL
;
2036 struct hist_entry
*he
;
2039 if (hists__has(hists
, need_collapse
))
2040 root
= &hists
->entries_collapsed
;
2042 root
= hists
->entries_in
;
2046 while (*p
!= NULL
) {
2048 he
= rb_entry(parent
, struct hist_entry
, rb_node_in
);
2050 cmp
= hist_entry__collapse(he
, pair
);
2058 p
= &(*p
)->rb_right
;
2061 he
= hist_entry__new(pair
, true);
2063 memset(&he
->stat
, 0, sizeof(he
->stat
));
2065 if (symbol_conf
.cumulate_callchain
)
2066 memset(he
->stat_acc
, 0, sizeof(he
->stat
));
2067 rb_link_node(&he
->rb_node_in
, parent
, p
);
2068 rb_insert_color(&he
->rb_node_in
, root
);
2069 hists__inc_stats(hists
, he
);
2076 static struct hist_entry
*hists__find_entry(struct hists
*hists
,
2077 struct hist_entry
*he
)
2081 if (hists__has(hists
, need_collapse
))
2082 n
= hists
->entries_collapsed
.rb_node
;
2084 n
= hists
->entries_in
->rb_node
;
2087 struct hist_entry
*iter
= rb_entry(n
, struct hist_entry
, rb_node_in
);
2088 int64_t cmp
= hist_entry__collapse(iter
, he
);
2102 * Look for pairs to link to the leader buckets (hist_entries):
2104 void hists__match(struct hists
*leader
, struct hists
*other
)
2106 struct rb_root
*root
;
2108 struct hist_entry
*pos
, *pair
;
2110 if (hists__has(leader
, need_collapse
))
2111 root
= &leader
->entries_collapsed
;
2113 root
= leader
->entries_in
;
2115 for (nd
= rb_first(root
); nd
; nd
= rb_next(nd
)) {
2116 pos
= rb_entry(nd
, struct hist_entry
, rb_node_in
);
2117 pair
= hists__find_entry(other
, pos
);
2120 hist_entry__add_pair(pair
, pos
);
2125 * Look for entries in the other hists that are not present in the leader, if
2126 * we find them, just add a dummy entry on the leader hists, with period=0,
2127 * nr_events=0, to serve as the list header.
2129 int hists__link(struct hists
*leader
, struct hists
*other
)
2131 struct rb_root
*root
;
2133 struct hist_entry
*pos
, *pair
;
2135 if (hists__has(other
, need_collapse
))
2136 root
= &other
->entries_collapsed
;
2138 root
= other
->entries_in
;
2140 for (nd
= rb_first(root
); nd
; nd
= rb_next(nd
)) {
2141 pos
= rb_entry(nd
, struct hist_entry
, rb_node_in
);
2143 if (!hist_entry__has_pairs(pos
)) {
2144 pair
= hists__add_dummy_entry(leader
, pos
);
2147 hist_entry__add_pair(pos
, pair
);
2154 void hist__account_cycles(struct branch_stack
*bs
, struct addr_location
*al
,
2155 struct perf_sample
*sample
, bool nonany_branch_mode
)
2157 struct branch_info
*bi
;
2159 /* If we have branch cycles always annotate them. */
2160 if (bs
&& bs
->nr
&& bs
->entries
[0].flags
.cycles
) {
2163 bi
= sample__resolve_bstack(sample
, al
);
2165 struct addr_map_symbol
*prev
= NULL
;
2168 * Ignore errors, still want to process the
2171 * For non standard branch modes always
2172 * force no IPC (prev == NULL)
2174 * Note that perf stores branches reversed from
2177 for (i
= bs
->nr
- 1; i
>= 0; i
--) {
2178 addr_map_symbol__account_cycles(&bi
[i
].from
,
2179 nonany_branch_mode
? NULL
: prev
,
2180 bi
[i
].flags
.cycles
);
2188 size_t perf_evlist__fprintf_nr_events(struct perf_evlist
*evlist
, FILE *fp
)
2190 struct perf_evsel
*pos
;
2193 evlist__for_each(evlist
, pos
) {
2194 ret
+= fprintf(fp
, "%s stats:\n", perf_evsel__name(pos
));
2195 ret
+= events_stats__fprintf(&evsel__hists(pos
)->stats
, fp
);
2202 u64
hists__total_period(struct hists
*hists
)
2204 return symbol_conf
.filter_relative
? hists
->stats
.total_non_filtered_period
:
2205 hists
->stats
.total_period
;
2208 int parse_filter_percentage(const struct option
*opt __maybe_unused
,
2209 const char *arg
, int unset __maybe_unused
)
2211 if (!strcmp(arg
, "relative"))
2212 symbol_conf
.filter_relative
= true;
2213 else if (!strcmp(arg
, "absolute"))
2214 symbol_conf
.filter_relative
= false;
2221 int perf_hist_config(const char *var
, const char *value
)
2223 if (!strcmp(var
, "hist.percentage"))
2224 return parse_filter_percentage(NULL
, value
, 0);
2229 int __hists__init(struct hists
*hists
, struct perf_hpp_list
*hpp_list
)
2231 memset(hists
, 0, sizeof(*hists
));
2232 hists
->entries_in_array
[0] = hists
->entries_in_array
[1] = RB_ROOT
;
2233 hists
->entries_in
= &hists
->entries_in_array
[0];
2234 hists
->entries_collapsed
= RB_ROOT
;
2235 hists
->entries
= RB_ROOT
;
2236 pthread_mutex_init(&hists
->lock
, NULL
);
2237 hists
->socket_filter
= -1;
2238 hists
->hpp_list
= hpp_list
;
2239 INIT_LIST_HEAD(&hists
->hpp_formats
);
2243 static void hists__delete_remaining_entries(struct rb_root
*root
)
2245 struct rb_node
*node
;
2246 struct hist_entry
*he
;
2248 while (!RB_EMPTY_ROOT(root
)) {
2249 node
= rb_first(root
);
2250 rb_erase(node
, root
);
2252 he
= rb_entry(node
, struct hist_entry
, rb_node_in
);
2253 hist_entry__delete(he
);
2257 static void hists__delete_all_entries(struct hists
*hists
)
2259 hists__delete_entries(hists
);
2260 hists__delete_remaining_entries(&hists
->entries_in_array
[0]);
2261 hists__delete_remaining_entries(&hists
->entries_in_array
[1]);
2262 hists__delete_remaining_entries(&hists
->entries_collapsed
);
2265 static void hists_evsel__exit(struct perf_evsel
*evsel
)
2267 struct hists
*hists
= evsel__hists(evsel
);
2268 struct perf_hpp_fmt
*fmt
, *pos
;
2269 struct perf_hpp_list_node
*node
, *tmp
;
2271 hists__delete_all_entries(hists
);
2273 list_for_each_entry_safe(node
, tmp
, &hists
->hpp_formats
, list
) {
2274 perf_hpp_list__for_each_format_safe(&node
->hpp
, fmt
, pos
) {
2275 list_del(&fmt
->list
);
2278 list_del(&node
->list
);
2283 static int hists_evsel__init(struct perf_evsel
*evsel
)
2285 struct hists
*hists
= evsel__hists(evsel
);
2287 __hists__init(hists
, &perf_hpp_list
);
2292 * XXX We probably need a hists_evsel__exit() to free the hist_entries
2293 * stored in the rbtree...
2296 int hists__init(void)
2298 int err
= perf_evsel__object_config(sizeof(struct hists_evsel
),
2302 fputs("FATAL ERROR: Couldn't setup hists class\n", stderr
);
2307 void perf_hpp_list__init(struct perf_hpp_list
*list
)
2309 INIT_LIST_HEAD(&list
->fields
);
2310 INIT_LIST_HEAD(&list
->sorts
);