9 static bool hists__filter_entry_by_dso(struct hists
*hists
,
10 struct hist_entry
*he
);
11 static bool hists__filter_entry_by_thread(struct hists
*hists
,
12 struct hist_entry
*he
);
13 static bool hists__filter_entry_by_symbol(struct hists
*hists
,
14 struct hist_entry
*he
);
23 struct callchain_param callchain_param
= {
24 .mode
= CHAIN_GRAPH_REL
,
29 u16
hists__col_len(struct hists
*hists
, enum hist_column col
)
31 return hists
->col_len
[col
];
34 void hists__set_col_len(struct hists
*hists
, enum hist_column col
, u16 len
)
36 hists
->col_len
[col
] = len
;
39 bool hists__new_col_len(struct hists
*hists
, enum hist_column col
, u16 len
)
41 if (len
> hists__col_len(hists
, col
)) {
42 hists__set_col_len(hists
, col
, len
);
48 void hists__reset_col_len(struct hists
*hists
)
52 for (col
= 0; col
< HISTC_NR_COLS
; ++col
)
53 hists__set_col_len(hists
, col
, 0);
56 static void hists__set_unres_dso_col_len(struct hists
*hists
, int dso
)
58 const unsigned int unresolved_col_width
= BITS_PER_LONG
/ 4;
60 if (hists__col_len(hists
, dso
) < unresolved_col_width
&&
61 !symbol_conf
.col_width_list_str
&& !symbol_conf
.field_sep
&&
62 !symbol_conf
.dso_list
)
63 hists__set_col_len(hists
, dso
, unresolved_col_width
);
66 void hists__calc_col_len(struct hists
*hists
, struct hist_entry
*h
)
68 const unsigned int unresolved_col_width
= BITS_PER_LONG
/ 4;
72 hists__new_col_len(hists
, HISTC_SYMBOL
, h
->ms
.sym
->namelen
+ 4);
74 hists__set_unres_dso_col_len(hists
, HISTC_DSO
);
76 len
= thread__comm_len(h
->thread
);
77 if (hists__new_col_len(hists
, HISTC_COMM
, len
))
78 hists__set_col_len(hists
, HISTC_THREAD
, len
+ 6);
81 len
= dso__name_len(h
->ms
.map
->dso
);
82 hists__new_col_len(hists
, HISTC_DSO
, len
);
88 * +4 accounts for '[x] ' priv level info
89 * +2 account of 0x prefix on raw addresses
91 if (h
->branch_info
->from
.sym
) {
92 symlen
= (int)h
->branch_info
->from
.sym
->namelen
+ 4;
93 hists__new_col_len(hists
, HISTC_SYMBOL_FROM
, symlen
);
95 symlen
= dso__name_len(h
->branch_info
->from
.map
->dso
);
96 hists__new_col_len(hists
, HISTC_DSO_FROM
, symlen
);
98 symlen
= unresolved_col_width
+ 4 + 2;
99 hists__new_col_len(hists
, HISTC_SYMBOL_FROM
, symlen
);
100 hists__set_unres_dso_col_len(hists
, HISTC_DSO_FROM
);
103 if (h
->branch_info
->to
.sym
) {
104 symlen
= (int)h
->branch_info
->to
.sym
->namelen
+ 4;
105 hists__new_col_len(hists
, HISTC_SYMBOL_TO
, symlen
);
107 symlen
= dso__name_len(h
->branch_info
->to
.map
->dso
);
108 hists__new_col_len(hists
, HISTC_DSO_TO
, symlen
);
110 symlen
= unresolved_col_width
+ 4 + 2;
111 hists__new_col_len(hists
, HISTC_SYMBOL_TO
, symlen
);
112 hists__set_unres_dso_col_len(hists
, HISTC_DSO_TO
);
117 void hists__output_recalc_col_len(struct hists
*hists
, int max_rows
)
119 struct rb_node
*next
= rb_first(&hists
->entries
);
120 struct hist_entry
*n
;
123 hists__reset_col_len(hists
);
125 while (next
&& row
++ < max_rows
) {
126 n
= rb_entry(next
, struct hist_entry
, rb_node
);
128 hists__calc_col_len(hists
, n
);
129 next
= rb_next(&n
->rb_node
);
133 static void hist_entry__add_cpumode_period(struct hist_entry
*he
,
134 unsigned int cpumode
, u64 period
)
137 case PERF_RECORD_MISC_KERNEL
:
138 he
->stat
.period_sys
+= period
;
140 case PERF_RECORD_MISC_USER
:
141 he
->stat
.period_us
+= period
;
143 case PERF_RECORD_MISC_GUEST_KERNEL
:
144 he
->stat
.period_guest_sys
+= period
;
146 case PERF_RECORD_MISC_GUEST_USER
:
147 he
->stat
.period_guest_us
+= period
;
154 static void he_stat__add_period(struct he_stat
*he_stat
, u64 period
)
156 he_stat
->period
+= period
;
157 he_stat
->nr_events
+= 1;
160 static void he_stat__add_stat(struct he_stat
*dest
, struct he_stat
*src
)
162 dest
->period
+= src
->period
;
163 dest
->period_sys
+= src
->period_sys
;
164 dest
->period_us
+= src
->period_us
;
165 dest
->period_guest_sys
+= src
->period_guest_sys
;
166 dest
->period_guest_us
+= src
->period_guest_us
;
167 dest
->nr_events
+= src
->nr_events
;
170 static void hist_entry__decay(struct hist_entry
*he
)
172 he
->stat
.period
= (he
->stat
.period
* 7) / 8;
173 he
->stat
.nr_events
= (he
->stat
.nr_events
* 7) / 8;
176 static bool hists__decay_entry(struct hists
*hists
, struct hist_entry
*he
)
178 u64 prev_period
= he
->stat
.period
;
180 if (prev_period
== 0)
183 hist_entry__decay(he
);
186 hists
->stats
.total_period
-= prev_period
- he
->stat
.period
;
188 return he
->stat
.period
== 0;
191 static void __hists__decay_entries(struct hists
*hists
, bool zap_user
,
192 bool zap_kernel
, bool threaded
)
194 struct rb_node
*next
= rb_first(&hists
->entries
);
195 struct hist_entry
*n
;
198 n
= rb_entry(next
, struct hist_entry
, rb_node
);
199 next
= rb_next(&n
->rb_node
);
201 * We may be annotating this, for instance, so keep it here in
202 * case some it gets new samples, we'll eventually free it when
203 * the user stops browsing and it agains gets fully decayed.
205 if (((zap_user
&& n
->level
== '.') ||
206 (zap_kernel
&& n
->level
!= '.') ||
207 hists__decay_entry(hists
, n
)) &&
209 rb_erase(&n
->rb_node
, &hists
->entries
);
211 if (sort__need_collapse
|| threaded
)
212 rb_erase(&n
->rb_node_in
, &hists
->entries_collapsed
);
220 void hists__decay_entries(struct hists
*hists
, bool zap_user
, bool zap_kernel
)
222 return __hists__decay_entries(hists
, zap_user
, zap_kernel
, false);
225 void hists__decay_entries_threaded(struct hists
*hists
,
226 bool zap_user
, bool zap_kernel
)
228 return __hists__decay_entries(hists
, zap_user
, zap_kernel
, true);
232 * histogram, sorted on item, collects periods
235 static struct hist_entry
*hist_entry__new(struct hist_entry
*template)
237 size_t callchain_size
= symbol_conf
.use_callchain
? sizeof(struct callchain_root
) : 0;
238 struct hist_entry
*he
= malloc(sizeof(*he
) + callchain_size
);
244 he
->ms
.map
->referenced
= true;
245 if (symbol_conf
.use_callchain
)
246 callchain_init(he
->callchain
);
248 INIT_LIST_HEAD(&he
->pairs
.node
);
254 static void hists__inc_nr_entries(struct hists
*hists
, struct hist_entry
*h
)
257 hists__calc_col_len(hists
, h
);
259 hists
->stats
.total_period
+= h
->stat
.period
;
263 static u8
symbol__parent_filter(const struct symbol
*parent
)
265 if (symbol_conf
.exclude_other
&& parent
== NULL
)
266 return 1 << HIST_FILTER__PARENT
;
270 static struct hist_entry
*add_hist_entry(struct hists
*hists
,
271 struct hist_entry
*entry
,
272 struct addr_location
*al
,
276 struct rb_node
*parent
= NULL
;
277 struct hist_entry
*he
;
280 pthread_mutex_lock(&hists
->lock
);
282 p
= &hists
->entries_in
->rb_node
;
286 he
= rb_entry(parent
, struct hist_entry
, rb_node_in
);
288 cmp
= hist_entry__cmp(entry
, he
);
291 he_stat__add_period(&he
->stat
, period
);
293 /* If the map of an existing hist_entry has
294 * become out-of-date due to an exec() or
295 * similar, update it. Otherwise we will
296 * mis-adjust symbol addresses when computing
297 * the history counter to increment.
299 if (he
->ms
.map
!= entry
->ms
.map
) {
300 he
->ms
.map
= entry
->ms
.map
;
302 he
->ms
.map
->referenced
= true;
313 he
= hist_entry__new(entry
);
317 rb_link_node(&he
->rb_node_in
, parent
, p
);
318 rb_insert_color(&he
->rb_node_in
, hists
->entries_in
);
320 hist_entry__add_cpumode_period(he
, al
->cpumode
, period
);
322 pthread_mutex_unlock(&hists
->lock
);
326 struct hist_entry
*__hists__add_branch_entry(struct hists
*self
,
327 struct addr_location
*al
,
328 struct symbol
*sym_parent
,
329 struct branch_info
*bi
,
332 struct hist_entry entry
= {
333 .thread
= al
->thread
,
345 .parent
= sym_parent
,
346 .filtered
= symbol__parent_filter(sym_parent
),
351 return add_hist_entry(self
, &entry
, al
, period
);
354 struct hist_entry
*__hists__add_entry(struct hists
*self
,
355 struct addr_location
*al
,
356 struct symbol
*sym_parent
, u64 period
)
358 struct hist_entry entry
= {
359 .thread
= al
->thread
,
371 .parent
= sym_parent
,
372 .filtered
= symbol__parent_filter(sym_parent
),
376 return add_hist_entry(self
, &entry
, al
, period
);
380 hist_entry__cmp(struct hist_entry
*left
, struct hist_entry
*right
)
382 struct sort_entry
*se
;
385 list_for_each_entry(se
, &hist_entry__sort_list
, list
) {
386 cmp
= se
->se_cmp(left
, right
);
395 hist_entry__collapse(struct hist_entry
*left
, struct hist_entry
*right
)
397 struct sort_entry
*se
;
400 list_for_each_entry(se
, &hist_entry__sort_list
, list
) {
401 int64_t (*f
)(struct hist_entry
*, struct hist_entry
*);
403 f
= se
->se_collapse
?: se
->se_cmp
;
405 cmp
= f(left
, right
);
413 void hist_entry__free(struct hist_entry
*he
)
415 free(he
->branch_info
);
420 * collapse the histogram
423 static bool hists__collapse_insert_entry(struct hists
*hists __maybe_unused
,
424 struct rb_root
*root
,
425 struct hist_entry
*he
)
427 struct rb_node
**p
= &root
->rb_node
;
428 struct rb_node
*parent
= NULL
;
429 struct hist_entry
*iter
;
434 iter
= rb_entry(parent
, struct hist_entry
, rb_node_in
);
436 cmp
= hist_entry__collapse(iter
, he
);
439 he_stat__add_stat(&iter
->stat
, &he
->stat
);
441 if (symbol_conf
.use_callchain
) {
442 callchain_cursor_reset(&callchain_cursor
);
443 callchain_merge(&callchain_cursor
,
447 hist_entry__free(he
);
457 rb_link_node(&he
->rb_node_in
, parent
, p
);
458 rb_insert_color(&he
->rb_node_in
, root
);
462 static struct rb_root
*hists__get_rotate_entries_in(struct hists
*hists
)
464 struct rb_root
*root
;
466 pthread_mutex_lock(&hists
->lock
);
468 root
= hists
->entries_in
;
469 if (++hists
->entries_in
> &hists
->entries_in_array
[1])
470 hists
->entries_in
= &hists
->entries_in_array
[0];
472 pthread_mutex_unlock(&hists
->lock
);
477 static void hists__apply_filters(struct hists
*hists
, struct hist_entry
*he
)
479 hists__filter_entry_by_dso(hists
, he
);
480 hists__filter_entry_by_thread(hists
, he
);
481 hists__filter_entry_by_symbol(hists
, he
);
484 static void __hists__collapse_resort(struct hists
*hists
, bool threaded
)
486 struct rb_root
*root
;
487 struct rb_node
*next
;
488 struct hist_entry
*n
;
490 if (!sort__need_collapse
&& !threaded
)
493 root
= hists__get_rotate_entries_in(hists
);
494 next
= rb_first(root
);
497 n
= rb_entry(next
, struct hist_entry
, rb_node_in
);
498 next
= rb_next(&n
->rb_node_in
);
500 rb_erase(&n
->rb_node_in
, root
);
501 if (hists__collapse_insert_entry(hists
, &hists
->entries_collapsed
, n
)) {
503 * If it wasn't combined with one of the entries already
504 * collapsed, we need to apply the filters that may have
505 * been set by, say, the hist_browser.
507 hists__apply_filters(hists
, n
);
512 void hists__collapse_resort(struct hists
*hists
)
514 return __hists__collapse_resort(hists
, false);
517 void hists__collapse_resort_threaded(struct hists
*hists
)
519 return __hists__collapse_resort(hists
, true);
523 * reverse the map, sort on period.
526 static void __hists__insert_output_entry(struct rb_root
*entries
,
527 struct hist_entry
*he
,
528 u64 min_callchain_hits
)
530 struct rb_node
**p
= &entries
->rb_node
;
531 struct rb_node
*parent
= NULL
;
532 struct hist_entry
*iter
;
534 if (symbol_conf
.use_callchain
)
535 callchain_param
.sort(&he
->sorted_chain
, he
->callchain
,
536 min_callchain_hits
, &callchain_param
);
540 iter
= rb_entry(parent
, struct hist_entry
, rb_node
);
542 if (he
->stat
.period
> iter
->stat
.period
)
548 rb_link_node(&he
->rb_node
, parent
, p
);
549 rb_insert_color(&he
->rb_node
, entries
);
552 static void __hists__output_resort(struct hists
*hists
, bool threaded
)
554 struct rb_root
*root
;
555 struct rb_node
*next
;
556 struct hist_entry
*n
;
557 u64 min_callchain_hits
;
559 min_callchain_hits
= hists
->stats
.total_period
* (callchain_param
.min_percent
/ 100);
561 if (sort__need_collapse
|| threaded
)
562 root
= &hists
->entries_collapsed
;
564 root
= hists
->entries_in
;
566 next
= rb_first(root
);
567 hists
->entries
= RB_ROOT
;
569 hists
->nr_entries
= 0;
570 hists
->stats
.total_period
= 0;
571 hists__reset_col_len(hists
);
574 n
= rb_entry(next
, struct hist_entry
, rb_node_in
);
575 next
= rb_next(&n
->rb_node_in
);
577 __hists__insert_output_entry(&hists
->entries
, n
, min_callchain_hits
);
578 hists__inc_nr_entries(hists
, n
);
582 void hists__output_resort(struct hists
*hists
)
584 return __hists__output_resort(hists
, false);
587 void hists__output_resort_threaded(struct hists
*hists
)
589 return __hists__output_resort(hists
, true);
592 static void hists__remove_entry_filter(struct hists
*hists
, struct hist_entry
*h
,
593 enum hist_filter filter
)
595 h
->filtered
&= ~(1 << filter
);
601 hists
->nr_entries
+= h
->nr_rows
;
603 hists
->stats
.total_period
+= h
->stat
.period
;
604 hists
->stats
.nr_events
[PERF_RECORD_SAMPLE
] += h
->stat
.nr_events
;
606 hists__calc_col_len(hists
, h
);
610 static bool hists__filter_entry_by_dso(struct hists
*hists
,
611 struct hist_entry
*he
)
613 if (hists
->dso_filter
!= NULL
&&
614 (he
->ms
.map
== NULL
|| he
->ms
.map
->dso
!= hists
->dso_filter
)) {
615 he
->filtered
|= (1 << HIST_FILTER__DSO
);
622 void hists__filter_by_dso(struct hists
*hists
)
626 hists
->nr_entries
= hists
->stats
.total_period
= 0;
627 hists
->stats
.nr_events
[PERF_RECORD_SAMPLE
] = 0;
628 hists__reset_col_len(hists
);
630 for (nd
= rb_first(&hists
->entries
); nd
; nd
= rb_next(nd
)) {
631 struct hist_entry
*h
= rb_entry(nd
, struct hist_entry
, rb_node
);
633 if (symbol_conf
.exclude_other
&& !h
->parent
)
636 if (hists__filter_entry_by_dso(hists
, h
))
639 hists__remove_entry_filter(hists
, h
, HIST_FILTER__DSO
);
643 static bool hists__filter_entry_by_thread(struct hists
*hists
,
644 struct hist_entry
*he
)
646 if (hists
->thread_filter
!= NULL
&&
647 he
->thread
!= hists
->thread_filter
) {
648 he
->filtered
|= (1 << HIST_FILTER__THREAD
);
655 void hists__filter_by_thread(struct hists
*hists
)
659 hists
->nr_entries
= hists
->stats
.total_period
= 0;
660 hists
->stats
.nr_events
[PERF_RECORD_SAMPLE
] = 0;
661 hists__reset_col_len(hists
);
663 for (nd
= rb_first(&hists
->entries
); nd
; nd
= rb_next(nd
)) {
664 struct hist_entry
*h
= rb_entry(nd
, struct hist_entry
, rb_node
);
666 if (hists__filter_entry_by_thread(hists
, h
))
669 hists__remove_entry_filter(hists
, h
, HIST_FILTER__THREAD
);
673 static bool hists__filter_entry_by_symbol(struct hists
*hists
,
674 struct hist_entry
*he
)
676 if (hists
->symbol_filter_str
!= NULL
&&
677 (!he
->ms
.sym
|| strstr(he
->ms
.sym
->name
,
678 hists
->symbol_filter_str
) == NULL
)) {
679 he
->filtered
|= (1 << HIST_FILTER__SYMBOL
);
686 void hists__filter_by_symbol(struct hists
*hists
)
690 hists
->nr_entries
= hists
->stats
.total_period
= 0;
691 hists
->stats
.nr_events
[PERF_RECORD_SAMPLE
] = 0;
692 hists__reset_col_len(hists
);
694 for (nd
= rb_first(&hists
->entries
); nd
; nd
= rb_next(nd
)) {
695 struct hist_entry
*h
= rb_entry(nd
, struct hist_entry
, rb_node
);
697 if (hists__filter_entry_by_symbol(hists
, h
))
700 hists__remove_entry_filter(hists
, h
, HIST_FILTER__SYMBOL
);
704 int hist_entry__inc_addr_samples(struct hist_entry
*he
, int evidx
, u64 ip
)
706 return symbol__inc_addr_samples(he
->ms
.sym
, he
->ms
.map
, evidx
, ip
);
709 int hist_entry__annotate(struct hist_entry
*he
, size_t privsize
)
711 return symbol__annotate(he
->ms
.sym
, he
->ms
.map
, privsize
);
714 void hists__inc_nr_events(struct hists
*hists
, u32 type
)
716 ++hists
->stats
.nr_events
[0];
717 ++hists
->stats
.nr_events
[type
];
720 static struct hist_entry
*hists__add_dummy_entry(struct hists
*hists
,
721 struct hist_entry
*pair
)
723 struct rb_node
**p
= &hists
->entries
.rb_node
;
724 struct rb_node
*parent
= NULL
;
725 struct hist_entry
*he
;
730 he
= rb_entry(parent
, struct hist_entry
, rb_node
);
732 cmp
= hist_entry__cmp(pair
, he
);
743 he
= hist_entry__new(pair
);
745 memset(&he
->stat
, 0, sizeof(he
->stat
));
747 rb_link_node(&he
->rb_node
, parent
, p
);
748 rb_insert_color(&he
->rb_node
, &hists
->entries
);
749 hists__inc_nr_entries(hists
, he
);
755 static struct hist_entry
*hists__find_entry(struct hists
*hists
,
756 struct hist_entry
*he
)
758 struct rb_node
*n
= hists
->entries
.rb_node
;
761 struct hist_entry
*iter
= rb_entry(n
, struct hist_entry
, rb_node
);
762 int64_t cmp
= hist_entry__cmp(he
, iter
);
776 * Look for pairs to link to the leader buckets (hist_entries):
778 void hists__match(struct hists
*leader
, struct hists
*other
)
781 struct hist_entry
*pos
, *pair
;
783 for (nd
= rb_first(&leader
->entries
); nd
; nd
= rb_next(nd
)) {
784 pos
= rb_entry(nd
, struct hist_entry
, rb_node
);
785 pair
= hists__find_entry(other
, pos
);
788 hist_entry__add_pair(pair
, pos
);
793 * Look for entries in the other hists that are not present in the leader, if
794 * we find them, just add a dummy entry on the leader hists, with period=0,
795 * nr_events=0, to serve as the list header.
797 int hists__link(struct hists
*leader
, struct hists
*other
)
800 struct hist_entry
*pos
, *pair
;
802 for (nd
= rb_first(&other
->entries
); nd
; nd
= rb_next(nd
)) {
803 pos
= rb_entry(nd
, struct hist_entry
, rb_node
);
805 if (!hist_entry__has_pairs(pos
)) {
806 pair
= hists__add_dummy_entry(leader
, pos
);
809 hist_entry__add_pair(pos
, pair
);