4 #include <linux/rbtree.h>
6 #include "../../util/evsel.h"
7 #include "../../util/evlist.h"
8 #include "../../util/hist.h"
9 #include "../../util/pstack.h"
10 #include "../../util/sort.h"
11 #include "../../util/util.h"
12 #include "../../util/top.h"
13 #include "../../arch/common.h"
15 #include "../browser.h"
16 #include "../helpline.h"
25 struct hist_entry
*he_selection
;
26 struct map_symbol
*selection
;
27 struct hist_browser_timer
*hbt
;
28 struct pstack
*pstack
;
34 u64 nr_non_filtered_entries
;
35 u64 nr_hierarchy_entries
;
36 u64 nr_callchain_rows
;
39 extern void hist_browser__init_hpp(void);
41 static int hists__browser_title(struct hists
*hists
,
42 struct hist_browser_timer
*hbt
,
43 char *bf
, size_t size
);
44 static void hist_browser__update_nr_entries(struct hist_browser
*hb
);
46 static struct rb_node
*hists__filter_entries(struct rb_node
*nd
,
49 static bool hist_browser__has_filter(struct hist_browser
*hb
)
51 return hists__has_filter(hb
->hists
) || hb
->min_pcnt
|| symbol_conf
.has_filter
;
54 static int hist_browser__get_folding(struct hist_browser
*browser
)
57 struct hists
*hists
= browser
->hists
;
58 int unfolded_rows
= 0;
60 for (nd
= rb_first(&hists
->entries
);
61 (nd
= hists__filter_entries(nd
, browser
->min_pcnt
)) != NULL
;
62 nd
= rb_hierarchy_next(nd
)) {
63 struct hist_entry
*he
=
64 rb_entry(nd
, struct hist_entry
, rb_node
);
66 if (he
->leaf
&& he
->unfolded
)
67 unfolded_rows
+= he
->nr_rows
;
72 static u32
hist_browser__nr_entries(struct hist_browser
*hb
)
76 if (symbol_conf
.report_hierarchy
)
77 nr_entries
= hb
->nr_hierarchy_entries
;
78 else if (hist_browser__has_filter(hb
))
79 nr_entries
= hb
->nr_non_filtered_entries
;
81 nr_entries
= hb
->hists
->nr_entries
;
83 hb
->nr_callchain_rows
= hist_browser__get_folding(hb
);
84 return nr_entries
+ hb
->nr_callchain_rows
;
87 static void hist_browser__update_rows(struct hist_browser
*hb
)
89 struct ui_browser
*browser
= &hb
->b
;
90 u16 header_offset
= hb
->show_headers
? 1 : 0, index_row
;
92 browser
->rows
= browser
->height
- header_offset
;
94 * Verify if we were at the last line and that line isn't
95 * visibe because we now show the header line(s).
97 index_row
= browser
->index
- browser
->top_idx
;
98 if (index_row
>= browser
->rows
)
99 browser
->index
-= index_row
- browser
->rows
+ 1;
102 static void hist_browser__refresh_dimensions(struct ui_browser
*browser
)
104 struct hist_browser
*hb
= container_of(browser
, struct hist_browser
, b
);
106 /* 3 == +/- toggle symbol before actual hist_entry rendering */
107 browser
->width
= 3 + (hists__sort_list_width(hb
->hists
) + sizeof("[k]"));
109 * FIXME: Just keeping existing behaviour, but this really should be
110 * before updating browser->width, as it will invalidate the
111 * calculation above. Fix this and the fallout in another
114 ui_browser__refresh_dimensions(browser
);
115 hist_browser__update_rows(hb
);
118 static void hist_browser__gotorc(struct hist_browser
*browser
, int row
, int column
)
120 u16 header_offset
= browser
->show_headers
? 1 : 0;
122 ui_browser__gotorc(&browser
->b
, row
+ header_offset
, column
);
125 static void hist_browser__reset(struct hist_browser
*browser
)
128 * The hists__remove_entry_filter() already folds non-filtered
129 * entries so we can assume it has 0 callchain rows.
131 browser
->nr_callchain_rows
= 0;
133 hist_browser__update_nr_entries(browser
);
134 browser
->b
.nr_entries
= hist_browser__nr_entries(browser
);
135 hist_browser__refresh_dimensions(&browser
->b
);
136 ui_browser__reset_index(&browser
->b
);
139 static char tree__folded_sign(bool unfolded
)
141 return unfolded
? '-' : '+';
144 static char hist_entry__folded(const struct hist_entry
*he
)
146 return he
->has_children
? tree__folded_sign(he
->unfolded
) : ' ';
149 static char callchain_list__folded(const struct callchain_list
*cl
)
151 return cl
->has_children
? tree__folded_sign(cl
->unfolded
) : ' ';
154 static void callchain_list__set_folding(struct callchain_list
*cl
, bool unfold
)
156 cl
->unfolded
= unfold
? cl
->has_children
: false;
159 static int callchain_node__count_rows_rb_tree(struct callchain_node
*node
)
164 for (nd
= rb_first(&node
->rb_root
); nd
; nd
= rb_next(nd
)) {
165 struct callchain_node
*child
= rb_entry(nd
, struct callchain_node
, rb_node
);
166 struct callchain_list
*chain
;
167 char folded_sign
= ' '; /* No children */
169 list_for_each_entry(chain
, &child
->val
, list
) {
171 /* We need this because we may not have children */
172 folded_sign
= callchain_list__folded(chain
);
173 if (folded_sign
== '+')
177 if (folded_sign
== '-') /* Have children and they're unfolded */
178 n
+= callchain_node__count_rows_rb_tree(child
);
184 static int callchain_node__count_flat_rows(struct callchain_node
*node
)
186 struct callchain_list
*chain
;
187 char folded_sign
= 0;
190 list_for_each_entry(chain
, &node
->parent_val
, list
) {
192 /* only check first chain list entry */
193 folded_sign
= callchain_list__folded(chain
);
194 if (folded_sign
== '+')
200 list_for_each_entry(chain
, &node
->val
, list
) {
202 /* node->parent_val list might be empty */
203 folded_sign
= callchain_list__folded(chain
);
204 if (folded_sign
== '+')
213 static int callchain_node__count_folded_rows(struct callchain_node
*node __maybe_unused
)
218 static int callchain_node__count_rows(struct callchain_node
*node
)
220 struct callchain_list
*chain
;
221 bool unfolded
= false;
224 if (callchain_param
.mode
== CHAIN_FLAT
)
225 return callchain_node__count_flat_rows(node
);
226 else if (callchain_param
.mode
== CHAIN_FOLDED
)
227 return callchain_node__count_folded_rows(node
);
229 list_for_each_entry(chain
, &node
->val
, list
) {
231 unfolded
= chain
->unfolded
;
235 n
+= callchain_node__count_rows_rb_tree(node
);
240 static int callchain__count_rows(struct rb_root
*chain
)
245 for (nd
= rb_first(chain
); nd
; nd
= rb_next(nd
)) {
246 struct callchain_node
*node
= rb_entry(nd
, struct callchain_node
, rb_node
);
247 n
+= callchain_node__count_rows(node
);
253 static int hierarchy_count_rows(struct hist_browser
*hb
, struct hist_entry
*he
,
254 bool include_children
)
257 struct rb_node
*node
;
258 struct hist_entry
*child
;
261 return callchain__count_rows(&he
->sorted_chain
);
263 if (he
->has_no_entry
)
266 node
= rb_first(&he
->hroot_out
);
270 child
= rb_entry(node
, struct hist_entry
, rb_node
);
271 percent
= hist_entry__get_percent_limit(child
);
273 if (!child
->filtered
&& percent
>= hb
->min_pcnt
) {
276 if (include_children
&& child
->unfolded
)
277 count
+= hierarchy_count_rows(hb
, child
, true);
280 node
= rb_next(node
);
285 static bool hist_entry__toggle_fold(struct hist_entry
*he
)
290 if (!he
->has_children
)
293 he
->unfolded
= !he
->unfolded
;
297 static bool callchain_list__toggle_fold(struct callchain_list
*cl
)
302 if (!cl
->has_children
)
305 cl
->unfolded
= !cl
->unfolded
;
309 static void callchain_node__init_have_children_rb_tree(struct callchain_node
*node
)
311 struct rb_node
*nd
= rb_first(&node
->rb_root
);
313 for (nd
= rb_first(&node
->rb_root
); nd
; nd
= rb_next(nd
)) {
314 struct callchain_node
*child
= rb_entry(nd
, struct callchain_node
, rb_node
);
315 struct callchain_list
*chain
;
318 list_for_each_entry(chain
, &child
->val
, list
) {
321 chain
->has_children
= chain
->list
.next
!= &child
->val
||
322 !RB_EMPTY_ROOT(&child
->rb_root
);
324 chain
->has_children
= chain
->list
.next
== &child
->val
&&
325 !RB_EMPTY_ROOT(&child
->rb_root
);
328 callchain_node__init_have_children_rb_tree(child
);
332 static void callchain_node__init_have_children(struct callchain_node
*node
,
335 struct callchain_list
*chain
;
337 chain
= list_entry(node
->val
.next
, struct callchain_list
, list
);
338 chain
->has_children
= has_sibling
;
340 if (node
->val
.next
!= node
->val
.prev
) {
341 chain
= list_entry(node
->val
.prev
, struct callchain_list
, list
);
342 chain
->has_children
= !RB_EMPTY_ROOT(&node
->rb_root
);
345 callchain_node__init_have_children_rb_tree(node
);
348 static void callchain__init_have_children(struct rb_root
*root
)
350 struct rb_node
*nd
= rb_first(root
);
351 bool has_sibling
= nd
&& rb_next(nd
);
353 for (nd
= rb_first(root
); nd
; nd
= rb_next(nd
)) {
354 struct callchain_node
*node
= rb_entry(nd
, struct callchain_node
, rb_node
);
355 callchain_node__init_have_children(node
, has_sibling
);
356 if (callchain_param
.mode
== CHAIN_FLAT
||
357 callchain_param
.mode
== CHAIN_FOLDED
)
358 callchain_node__make_parent_list(node
);
362 static void hist_entry__init_have_children(struct hist_entry
*he
)
364 if (he
->init_have_children
)
368 he
->has_children
= !RB_EMPTY_ROOT(&he
->sorted_chain
);
369 callchain__init_have_children(&he
->sorted_chain
);
371 he
->has_children
= !RB_EMPTY_ROOT(&he
->hroot_out
);
374 he
->init_have_children
= true;
377 static bool hist_browser__toggle_fold(struct hist_browser
*browser
)
379 struct hist_entry
*he
= browser
->he_selection
;
380 struct map_symbol
*ms
= browser
->selection
;
381 struct callchain_list
*cl
= container_of(ms
, struct callchain_list
, ms
);
388 has_children
= hist_entry__toggle_fold(he
);
390 has_children
= callchain_list__toggle_fold(cl
);
395 hist_entry__init_have_children(he
);
396 browser
->b
.nr_entries
-= he
->nr_rows
;
399 browser
->nr_callchain_rows
-= he
->nr_rows
;
401 browser
->nr_hierarchy_entries
-= he
->nr_rows
;
403 if (symbol_conf
.report_hierarchy
)
404 child_rows
= hierarchy_count_rows(browser
, he
, true);
408 he
->nr_rows
= callchain__count_rows(&he
->sorted_chain
);
410 he
->nr_rows
= hierarchy_count_rows(browser
, he
, false);
412 /* account grand children */
413 if (symbol_conf
.report_hierarchy
)
414 browser
->b
.nr_entries
+= child_rows
- he
->nr_rows
;
416 if (!he
->leaf
&& he
->nr_rows
== 0) {
417 he
->has_no_entry
= true;
421 if (symbol_conf
.report_hierarchy
)
422 browser
->b
.nr_entries
-= child_rows
- he
->nr_rows
;
424 if (he
->has_no_entry
)
425 he
->has_no_entry
= false;
430 browser
->b
.nr_entries
+= he
->nr_rows
;
433 browser
->nr_callchain_rows
+= he
->nr_rows
;
435 browser
->nr_hierarchy_entries
+= he
->nr_rows
;
440 /* If it doesn't have children, no toggling performed */
444 static int callchain_node__set_folding_rb_tree(struct callchain_node
*node
, bool unfold
)
449 for (nd
= rb_first(&node
->rb_root
); nd
; nd
= rb_next(nd
)) {
450 struct callchain_node
*child
= rb_entry(nd
, struct callchain_node
, rb_node
);
451 struct callchain_list
*chain
;
452 bool has_children
= false;
454 list_for_each_entry(chain
, &child
->val
, list
) {
456 callchain_list__set_folding(chain
, unfold
);
457 has_children
= chain
->has_children
;
461 n
+= callchain_node__set_folding_rb_tree(child
, unfold
);
467 static int callchain_node__set_folding(struct callchain_node
*node
, bool unfold
)
469 struct callchain_list
*chain
;
470 bool has_children
= false;
473 list_for_each_entry(chain
, &node
->val
, list
) {
475 callchain_list__set_folding(chain
, unfold
);
476 has_children
= chain
->has_children
;
480 n
+= callchain_node__set_folding_rb_tree(node
, unfold
);
485 static int callchain__set_folding(struct rb_root
*chain
, bool unfold
)
490 for (nd
= rb_first(chain
); nd
; nd
= rb_next(nd
)) {
491 struct callchain_node
*node
= rb_entry(nd
, struct callchain_node
, rb_node
);
492 n
+= callchain_node__set_folding(node
, unfold
);
498 static int hierarchy_set_folding(struct hist_browser
*hb
, struct hist_entry
*he
,
499 bool unfold __maybe_unused
)
503 struct hist_entry
*child
;
506 for (nd
= rb_first(&he
->hroot_out
); nd
; nd
= rb_next(nd
)) {
507 child
= rb_entry(nd
, struct hist_entry
, rb_node
);
508 percent
= hist_entry__get_percent_limit(child
);
509 if (!child
->filtered
&& percent
>= hb
->min_pcnt
)
516 static void hist_entry__set_folding(struct hist_entry
*he
,
517 struct hist_browser
*hb
, bool unfold
)
519 hist_entry__init_have_children(he
);
520 he
->unfolded
= unfold
? he
->has_children
: false;
522 if (he
->has_children
) {
526 n
= callchain__set_folding(&he
->sorted_chain
, unfold
);
528 n
= hierarchy_set_folding(hb
, he
, unfold
);
530 he
->nr_rows
= unfold
? n
: 0;
536 __hist_browser__set_folding(struct hist_browser
*browser
, bool unfold
)
539 struct hist_entry
*he
;
542 nd
= rb_first(&browser
->hists
->entries
);
544 he
= rb_entry(nd
, struct hist_entry
, rb_node
);
546 /* set folding state even if it's currently folded */
547 nd
= __rb_hierarchy_next(nd
, HMD_FORCE_CHILD
);
549 hist_entry__set_folding(he
, browser
, unfold
);
551 percent
= hist_entry__get_percent_limit(he
);
552 if (he
->filtered
|| percent
< browser
->min_pcnt
)
555 if (!he
->depth
|| unfold
)
556 browser
->nr_hierarchy_entries
++;
558 browser
->nr_callchain_rows
+= he
->nr_rows
;
559 else if (unfold
&& !hist_entry__has_hierarchy_children(he
, browser
->min_pcnt
)) {
560 browser
->nr_hierarchy_entries
++;
561 he
->has_no_entry
= true;
564 he
->has_no_entry
= false;
568 static void hist_browser__set_folding(struct hist_browser
*browser
, bool unfold
)
570 browser
->nr_hierarchy_entries
= 0;
571 browser
->nr_callchain_rows
= 0;
572 __hist_browser__set_folding(browser
, unfold
);
574 browser
->b
.nr_entries
= hist_browser__nr_entries(browser
);
575 /* Go to the start, we may be way after valid entries after a collapse */
576 ui_browser__reset_index(&browser
->b
);
579 static void ui_browser__warn_lost_events(struct ui_browser
*browser
)
581 ui_browser__warning(browser
, 4,
582 "Events are being lost, check IO/CPU overload!\n\n"
583 "You may want to run 'perf' using a RT scheduler policy:\n\n"
584 " perf top -r 80\n\n"
585 "Or reduce the sampling frequency.");
588 static int hist_browser__run(struct hist_browser
*browser
, const char *help
)
592 struct hist_browser_timer
*hbt
= browser
->hbt
;
593 int delay_secs
= hbt
? hbt
->refresh
: 0;
595 browser
->b
.entries
= &browser
->hists
->entries
;
596 browser
->b
.nr_entries
= hist_browser__nr_entries(browser
);
598 hists__browser_title(browser
->hists
, hbt
, title
, sizeof(title
));
600 if (ui_browser__show(&browser
->b
, title
, "%s", help
) < 0)
604 key
= ui_browser__run(&browser
->b
, delay_secs
);
609 hbt
->timer(hbt
->arg
);
611 if (hist_browser__has_filter(browser
))
612 hist_browser__update_nr_entries(browser
);
614 nr_entries
= hist_browser__nr_entries(browser
);
615 ui_browser__update_nr_entries(&browser
->b
, nr_entries
);
617 if (browser
->hists
->stats
.nr_lost_warned
!=
618 browser
->hists
->stats
.nr_events
[PERF_RECORD_LOST
]) {
619 browser
->hists
->stats
.nr_lost_warned
=
620 browser
->hists
->stats
.nr_events
[PERF_RECORD_LOST
];
621 ui_browser__warn_lost_events(&browser
->b
);
624 hists__browser_title(browser
->hists
,
625 hbt
, title
, sizeof(title
));
626 ui_browser__show_title(&browser
->b
, title
);
629 case 'D': { /* Debug */
631 struct hist_entry
*h
= rb_entry(browser
->b
.top
,
632 struct hist_entry
, rb_node
);
634 ui_helpline__fpush("%d: nr_ent=(%d,%d), rows=%d, idx=%d, fve: idx=%d, row_off=%d, nrows=%d",
635 seq
++, browser
->b
.nr_entries
,
636 browser
->hists
->nr_entries
,
640 h
->row_offset
, h
->nr_rows
);
644 /* Collapse the whole world. */
645 hist_browser__set_folding(browser
, false);
648 /* Expand the whole world. */
649 hist_browser__set_folding(browser
, true);
652 browser
->show_headers
= !browser
->show_headers
;
653 hist_browser__update_rows(browser
);
656 if (hist_browser__toggle_fold(browser
))
664 ui_browser__hide(&browser
->b
);
668 struct callchain_print_arg
{
669 /* for hists browser */
671 bool is_current_entry
;
678 typedef void (*print_callchain_entry_fn
)(struct hist_browser
*browser
,
679 struct callchain_list
*chain
,
680 const char *str
, int offset
,
682 struct callchain_print_arg
*arg
);
684 static void hist_browser__show_callchain_entry(struct hist_browser
*browser
,
685 struct callchain_list
*chain
,
686 const char *str
, int offset
,
688 struct callchain_print_arg
*arg
)
691 char folded_sign
= callchain_list__folded(chain
);
692 bool show_annotated
= browser
->show_dso
&& chain
->ms
.sym
&& symbol__annotation(chain
->ms
.sym
)->src
;
694 color
= HE_COLORSET_NORMAL
;
695 width
= browser
->b
.width
- (offset
+ 2);
696 if (ui_browser__is_current_entry(&browser
->b
, row
)) {
697 browser
->selection
= &chain
->ms
;
698 color
= HE_COLORSET_SELECTED
;
699 arg
->is_current_entry
= true;
702 ui_browser__set_color(&browser
->b
, color
);
703 hist_browser__gotorc(browser
, row
, 0);
704 ui_browser__write_nstring(&browser
->b
, " ", offset
);
705 ui_browser__printf(&browser
->b
, "%c", folded_sign
);
706 ui_browser__write_graph(&browser
->b
, show_annotated
? SLSMG_RARROW_CHAR
: ' ');
707 ui_browser__write_nstring(&browser
->b
, str
, width
);
710 static void hist_browser__fprintf_callchain_entry(struct hist_browser
*b __maybe_unused
,
711 struct callchain_list
*chain
,
712 const char *str
, int offset
,
713 unsigned short row __maybe_unused
,
714 struct callchain_print_arg
*arg
)
716 char folded_sign
= callchain_list__folded(chain
);
718 arg
->printed
+= fprintf(arg
->fp
, "%*s%c %s\n", offset
, " ",
722 typedef bool (*check_output_full_fn
)(struct hist_browser
*browser
,
725 static bool hist_browser__check_output_full(struct hist_browser
*browser
,
728 return browser
->b
.rows
== row
;
731 static bool hist_browser__check_dump_full(struct hist_browser
*browser __maybe_unused
,
732 unsigned short row __maybe_unused
)
737 #define LEVEL_OFFSET_STEP 3
739 static int hist_browser__show_callchain_list(struct hist_browser
*browser
,
740 struct callchain_node
*node
,
741 struct callchain_list
*chain
,
742 unsigned short row
, u64 total
,
743 bool need_percent
, int offset
,
744 print_callchain_entry_fn print
,
745 struct callchain_print_arg
*arg
)
747 char bf
[1024], *alloc_str
;
750 if (arg
->row_offset
!= 0) {
756 str
= callchain_list__sym_name(chain
, bf
, sizeof(bf
),
762 callchain_node__scnprintf_value(node
, buf
, sizeof(buf
),
765 if (asprintf(&alloc_str
, "%s %s", buf
, str
) < 0)
766 str
= "Not enough memory!";
771 print(browser
, chain
, str
, offset
, row
, arg
);
777 static bool check_percent_display(struct rb_node
*node
, u64 parent_total
)
779 struct callchain_node
*child
;
787 child
= rb_entry(node
, struct callchain_node
, rb_node
);
788 return callchain_cumul_hits(child
) != parent_total
;
791 static int hist_browser__show_callchain_flat(struct hist_browser
*browser
,
792 struct rb_root
*root
,
793 unsigned short row
, u64 total
,
795 print_callchain_entry_fn print
,
796 struct callchain_print_arg
*arg
,
797 check_output_full_fn is_output_full
)
799 struct rb_node
*node
;
800 int first_row
= row
, offset
= LEVEL_OFFSET_STEP
;
803 node
= rb_first(root
);
804 need_percent
= check_percent_display(node
, parent_total
);
807 struct callchain_node
*child
= rb_entry(node
, struct callchain_node
, rb_node
);
808 struct rb_node
*next
= rb_next(node
);
809 struct callchain_list
*chain
;
810 char folded_sign
= ' ';
812 int extra_offset
= 0;
814 list_for_each_entry(chain
, &child
->parent_val
, list
) {
815 bool was_first
= first
;
819 else if (need_percent
)
820 extra_offset
= LEVEL_OFFSET_STEP
;
822 folded_sign
= callchain_list__folded(chain
);
824 row
+= hist_browser__show_callchain_list(browser
, child
,
826 was_first
&& need_percent
,
827 offset
+ extra_offset
,
830 if (is_output_full(browser
, row
))
833 if (folded_sign
== '+')
837 list_for_each_entry(chain
, &child
->val
, list
) {
838 bool was_first
= first
;
842 else if (need_percent
)
843 extra_offset
= LEVEL_OFFSET_STEP
;
845 folded_sign
= callchain_list__folded(chain
);
847 row
+= hist_browser__show_callchain_list(browser
, child
,
849 was_first
&& need_percent
,
850 offset
+ extra_offset
,
853 if (is_output_full(browser
, row
))
856 if (folded_sign
== '+')
861 if (is_output_full(browser
, row
))
866 return row
- first_row
;
869 static char *hist_browser__folded_callchain_str(struct hist_browser
*browser
,
870 struct callchain_list
*chain
,
871 char *value_str
, char *old_str
)
877 str
= callchain_list__sym_name(chain
, bf
, sizeof(bf
),
880 if (asprintf(&new, "%s%s%s", old_str
,
881 symbol_conf
.field_sep
?: ";", str
) < 0)
885 if (asprintf(&new, "%s %s", value_str
, str
) < 0)
888 if (asprintf(&new, "%s", str
) < 0)
895 static int hist_browser__show_callchain_folded(struct hist_browser
*browser
,
896 struct rb_root
*root
,
897 unsigned short row
, u64 total
,
899 print_callchain_entry_fn print
,
900 struct callchain_print_arg
*arg
,
901 check_output_full_fn is_output_full
)
903 struct rb_node
*node
;
904 int first_row
= row
, offset
= LEVEL_OFFSET_STEP
;
907 node
= rb_first(root
);
908 need_percent
= check_percent_display(node
, parent_total
);
911 struct callchain_node
*child
= rb_entry(node
, struct callchain_node
, rb_node
);
912 struct rb_node
*next
= rb_next(node
);
913 struct callchain_list
*chain
, *first_chain
= NULL
;
915 char *value_str
= NULL
, *value_str_alloc
= NULL
;
916 char *chain_str
= NULL
, *chain_str_alloc
= NULL
;
918 if (arg
->row_offset
!= 0) {
926 callchain_node__scnprintf_value(child
, buf
, sizeof(buf
), total
);
927 if (asprintf(&value_str
, "%s", buf
) < 0) {
928 value_str
= (char *)"<...>";
931 value_str_alloc
= value_str
;
934 list_for_each_entry(chain
, &child
->parent_val
, list
) {
935 chain_str
= hist_browser__folded_callchain_str(browser
,
936 chain
, value_str
, chain_str
);
942 if (chain_str
== NULL
) {
943 chain_str
= (char *)"Not enough memory!";
947 chain_str_alloc
= chain_str
;
950 list_for_each_entry(chain
, &child
->val
, list
) {
951 chain_str
= hist_browser__folded_callchain_str(browser
,
952 chain
, value_str
, chain_str
);
958 if (chain_str
== NULL
) {
959 chain_str
= (char *)"Not enough memory!";
963 chain_str_alloc
= chain_str
;
967 print(browser
, first_chain
, chain_str
, offset
, row
++, arg
);
968 free(value_str_alloc
);
969 free(chain_str_alloc
);
972 if (is_output_full(browser
, row
))
977 return row
- first_row
;
980 static int hist_browser__show_callchain_graph(struct hist_browser
*browser
,
981 struct rb_root
*root
, int level
,
982 unsigned short row
, u64 total
,
984 print_callchain_entry_fn print
,
985 struct callchain_print_arg
*arg
,
986 check_output_full_fn is_output_full
)
988 struct rb_node
*node
;
989 int first_row
= row
, offset
= level
* LEVEL_OFFSET_STEP
;
991 u64 percent_total
= total
;
993 if (callchain_param
.mode
== CHAIN_GRAPH_REL
)
994 percent_total
= parent_total
;
996 node
= rb_first(root
);
997 need_percent
= check_percent_display(node
, parent_total
);
1000 struct callchain_node
*child
= rb_entry(node
, struct callchain_node
, rb_node
);
1001 struct rb_node
*next
= rb_next(node
);
1002 struct callchain_list
*chain
;
1003 char folded_sign
= ' ';
1005 int extra_offset
= 0;
1007 list_for_each_entry(chain
, &child
->val
, list
) {
1008 bool was_first
= first
;
1012 else if (need_percent
)
1013 extra_offset
= LEVEL_OFFSET_STEP
;
1015 folded_sign
= callchain_list__folded(chain
);
1017 row
+= hist_browser__show_callchain_list(browser
, child
,
1018 chain
, row
, percent_total
,
1019 was_first
&& need_percent
,
1020 offset
+ extra_offset
,
1023 if (is_output_full(browser
, row
))
1026 if (folded_sign
== '+')
1030 if (folded_sign
== '-') {
1031 const int new_level
= level
+ (extra_offset
? 2 : 1);
1033 row
+= hist_browser__show_callchain_graph(browser
, &child
->rb_root
,
1034 new_level
, row
, total
,
1035 child
->children_hit
,
1036 print
, arg
, is_output_full
);
1038 if (is_output_full(browser
, row
))
1043 return row
- first_row
;
1046 static int hist_browser__show_callchain(struct hist_browser
*browser
,
1047 struct hist_entry
*entry
, int level
,
1049 print_callchain_entry_fn print
,
1050 struct callchain_print_arg
*arg
,
1051 check_output_full_fn is_output_full
)
1053 u64 total
= hists__total_period(entry
->hists
);
1057 if (symbol_conf
.cumulate_callchain
)
1058 parent_total
= entry
->stat_acc
->period
;
1060 parent_total
= entry
->stat
.period
;
1062 if (callchain_param
.mode
== CHAIN_FLAT
) {
1063 printed
= hist_browser__show_callchain_flat(browser
,
1064 &entry
->sorted_chain
, row
,
1065 total
, parent_total
, print
, arg
,
1067 } else if (callchain_param
.mode
== CHAIN_FOLDED
) {
1068 printed
= hist_browser__show_callchain_folded(browser
,
1069 &entry
->sorted_chain
, row
,
1070 total
, parent_total
, print
, arg
,
1073 printed
= hist_browser__show_callchain_graph(browser
,
1074 &entry
->sorted_chain
, level
, row
,
1075 total
, parent_total
, print
, arg
,
1079 if (arg
->is_current_entry
)
1080 browser
->he_selection
= entry
;
1086 struct ui_browser
*b
;
1091 static int __hpp__slsmg_color_printf(struct perf_hpp
*hpp
, const char *fmt
, ...)
1093 struct hpp_arg
*arg
= hpp
->ptr
;
1098 va_start(args
, fmt
);
1099 len
= va_arg(args
, int);
1100 percent
= va_arg(args
, double);
1103 ui_browser__set_percent_color(arg
->b
, percent
, arg
->current_entry
);
1105 ret
= scnprintf(hpp
->buf
, hpp
->size
, fmt
, len
, percent
);
1106 ui_browser__printf(arg
->b
, "%s", hpp
->buf
);
1108 advance_hpp(hpp
, ret
);
1112 #define __HPP_COLOR_PERCENT_FN(_type, _field) \
1113 static u64 __hpp_get_##_field(struct hist_entry *he) \
1115 return he->stat._field; \
1119 hist_browser__hpp_color_##_type(struct perf_hpp_fmt *fmt, \
1120 struct perf_hpp *hpp, \
1121 struct hist_entry *he) \
1123 return hpp__fmt(fmt, hpp, he, __hpp_get_##_field, " %*.2f%%", \
1124 __hpp__slsmg_color_printf, true); \
1127 #define __HPP_COLOR_ACC_PERCENT_FN(_type, _field) \
1128 static u64 __hpp_get_acc_##_field(struct hist_entry *he) \
1130 return he->stat_acc->_field; \
1134 hist_browser__hpp_color_##_type(struct perf_hpp_fmt *fmt, \
1135 struct perf_hpp *hpp, \
1136 struct hist_entry *he) \
1138 if (!symbol_conf.cumulate_callchain) { \
1139 struct hpp_arg *arg = hpp->ptr; \
1140 int len = fmt->user_len ?: fmt->len; \
1141 int ret = scnprintf(hpp->buf, hpp->size, \
1142 "%*s", len, "N/A"); \
1143 ui_browser__printf(arg->b, "%s", hpp->buf); \
1147 return hpp__fmt(fmt, hpp, he, __hpp_get_acc_##_field, \
1148 " %*.2f%%", __hpp__slsmg_color_printf, true); \
1151 __HPP_COLOR_PERCENT_FN(overhead
, period
)
1152 __HPP_COLOR_PERCENT_FN(overhead_sys
, period_sys
)
1153 __HPP_COLOR_PERCENT_FN(overhead_us
, period_us
)
1154 __HPP_COLOR_PERCENT_FN(overhead_guest_sys
, period_guest_sys
)
1155 __HPP_COLOR_PERCENT_FN(overhead_guest_us
, period_guest_us
)
1156 __HPP_COLOR_ACC_PERCENT_FN(overhead_acc
, period
)
1158 #undef __HPP_COLOR_PERCENT_FN
1159 #undef __HPP_COLOR_ACC_PERCENT_FN
1161 void hist_browser__init_hpp(void)
1163 perf_hpp__format
[PERF_HPP__OVERHEAD
].color
=
1164 hist_browser__hpp_color_overhead
;
1165 perf_hpp__format
[PERF_HPP__OVERHEAD_SYS
].color
=
1166 hist_browser__hpp_color_overhead_sys
;
1167 perf_hpp__format
[PERF_HPP__OVERHEAD_US
].color
=
1168 hist_browser__hpp_color_overhead_us
;
1169 perf_hpp__format
[PERF_HPP__OVERHEAD_GUEST_SYS
].color
=
1170 hist_browser__hpp_color_overhead_guest_sys
;
1171 perf_hpp__format
[PERF_HPP__OVERHEAD_GUEST_US
].color
=
1172 hist_browser__hpp_color_overhead_guest_us
;
1173 perf_hpp__format
[PERF_HPP__OVERHEAD_ACC
].color
=
1174 hist_browser__hpp_color_overhead_acc
;
1177 static int hist_browser__show_entry(struct hist_browser
*browser
,
1178 struct hist_entry
*entry
,
1182 int width
= browser
->b
.width
;
1183 char folded_sign
= ' ';
1184 bool current_entry
= ui_browser__is_current_entry(&browser
->b
, row
);
1185 off_t row_offset
= entry
->row_offset
;
1187 struct perf_hpp_fmt
*fmt
;
1189 if (current_entry
) {
1190 browser
->he_selection
= entry
;
1191 browser
->selection
= &entry
->ms
;
1194 if (symbol_conf
.use_callchain
) {
1195 hist_entry__init_have_children(entry
);
1196 folded_sign
= hist_entry__folded(entry
);
1199 if (row_offset
== 0) {
1200 struct hpp_arg arg
= {
1202 .folded_sign
= folded_sign
,
1203 .current_entry
= current_entry
,
1207 hist_browser__gotorc(browser
, row
, 0);
1209 hists__for_each_format(browser
->hists
, fmt
) {
1211 struct perf_hpp hpp
= {
1217 if (perf_hpp__should_skip(fmt
, entry
->hists
) ||
1218 column
++ < browser
->b
.horiz_scroll
)
1221 if (current_entry
&& browser
->b
.navkeypressed
) {
1222 ui_browser__set_color(&browser
->b
,
1223 HE_COLORSET_SELECTED
);
1225 ui_browser__set_color(&browser
->b
,
1226 HE_COLORSET_NORMAL
);
1230 if (symbol_conf
.use_callchain
) {
1231 ui_browser__printf(&browser
->b
, "%c ", folded_sign
);
1236 ui_browser__printf(&browser
->b
, " ");
1241 int ret
= fmt
->color(fmt
, &hpp
, entry
);
1242 hist_entry__snprintf_alignment(entry
, &hpp
, fmt
, ret
);
1244 * fmt->color() already used ui_browser to
1245 * print the non alignment bits, skip it (+ret):
1247 ui_browser__printf(&browser
->b
, "%s", s
+ ret
);
1249 hist_entry__snprintf_alignment(entry
, &hpp
, fmt
, fmt
->entry(fmt
, &hpp
, entry
));
1250 ui_browser__printf(&browser
->b
, "%s", s
);
1252 width
-= hpp
.buf
- s
;
1255 /* The scroll bar isn't being used */
1256 if (!browser
->b
.navkeypressed
)
1259 ui_browser__write_nstring(&browser
->b
, "", width
);
1266 if (folded_sign
== '-' && row
!= browser
->b
.rows
) {
1267 struct callchain_print_arg arg
= {
1268 .row_offset
= row_offset
,
1269 .is_current_entry
= current_entry
,
1272 printed
+= hist_browser__show_callchain(browser
, entry
, 1, row
,
1273 hist_browser__show_callchain_entry
, &arg
,
1274 hist_browser__check_output_full
);
1280 static int hist_browser__show_hierarchy_entry(struct hist_browser
*browser
,
1281 struct hist_entry
*entry
,
1286 int width
= browser
->b
.width
;
1287 char folded_sign
= ' ';
1288 bool current_entry
= ui_browser__is_current_entry(&browser
->b
, row
);
1289 off_t row_offset
= entry
->row_offset
;
1291 struct perf_hpp_fmt
*fmt
;
1292 struct perf_hpp_list_node
*fmt_node
;
1293 struct hpp_arg arg
= {
1295 .current_entry
= current_entry
,
1298 int hierarchy_indent
= (entry
->hists
->nr_hpp_node
- 2) * HIERARCHY_INDENT
;
1300 if (current_entry
) {
1301 browser
->he_selection
= entry
;
1302 browser
->selection
= &entry
->ms
;
1305 hist_entry__init_have_children(entry
);
1306 folded_sign
= hist_entry__folded(entry
);
1307 arg
.folded_sign
= folded_sign
;
1309 if (entry
->leaf
&& row_offset
) {
1311 goto show_callchain
;
1314 hist_browser__gotorc(browser
, row
, 0);
1316 if (current_entry
&& browser
->b
.navkeypressed
)
1317 ui_browser__set_color(&browser
->b
, HE_COLORSET_SELECTED
);
1319 ui_browser__set_color(&browser
->b
, HE_COLORSET_NORMAL
);
1321 ui_browser__write_nstring(&browser
->b
, "", level
* HIERARCHY_INDENT
);
1322 width
-= level
* HIERARCHY_INDENT
;
1324 /* the first hpp_list_node is for overhead columns */
1325 fmt_node
= list_first_entry(&entry
->hists
->hpp_formats
,
1326 struct perf_hpp_list_node
, list
);
1327 perf_hpp_list__for_each_format(&fmt_node
->hpp
, fmt
) {
1329 struct perf_hpp hpp
= {
1335 if (perf_hpp__should_skip(fmt
, entry
->hists
) ||
1336 column
++ < browser
->b
.horiz_scroll
)
1339 if (current_entry
&& browser
->b
.navkeypressed
) {
1340 ui_browser__set_color(&browser
->b
,
1341 HE_COLORSET_SELECTED
);
1343 ui_browser__set_color(&browser
->b
,
1344 HE_COLORSET_NORMAL
);
1348 ui_browser__printf(&browser
->b
, "%c", folded_sign
);
1352 ui_browser__printf(&browser
->b
, " ");
1357 int ret
= fmt
->color(fmt
, &hpp
, entry
);
1358 hist_entry__snprintf_alignment(entry
, &hpp
, fmt
, ret
);
1360 * fmt->color() already used ui_browser to
1361 * print the non alignment bits, skip it (+ret):
1363 ui_browser__printf(&browser
->b
, "%s", s
+ ret
);
1365 int ret
= fmt
->entry(fmt
, &hpp
, entry
);
1366 hist_entry__snprintf_alignment(entry
, &hpp
, fmt
, ret
);
1367 ui_browser__printf(&browser
->b
, "%s", s
);
1369 width
-= hpp
.buf
- s
;
1372 ui_browser__write_nstring(&browser
->b
, "", hierarchy_indent
);
1373 width
-= hierarchy_indent
;
1375 if (column
>= browser
->b
.horiz_scroll
) {
1377 struct perf_hpp hpp
= {
1383 if (current_entry
&& browser
->b
.navkeypressed
) {
1384 ui_browser__set_color(&browser
->b
,
1385 HE_COLORSET_SELECTED
);
1387 ui_browser__set_color(&browser
->b
,
1388 HE_COLORSET_NORMAL
);
1391 perf_hpp_list__for_each_format(entry
->hpp_list
, fmt
) {
1392 ui_browser__write_nstring(&browser
->b
, "", 2);
1396 * No need to call hist_entry__snprintf_alignment()
1397 * since this fmt is always the last column in the
1401 width
-= fmt
->color(fmt
, &hpp
, entry
);
1405 width
-= fmt
->entry(fmt
, &hpp
, entry
);
1406 ui_browser__printf(&browser
->b
, "%s", ltrim(s
));
1408 while (isspace(s
[i
++]))
1414 /* The scroll bar isn't being used */
1415 if (!browser
->b
.navkeypressed
)
1418 ui_browser__write_nstring(&browser
->b
, "", width
);
1424 if (entry
->leaf
&& folded_sign
== '-' && row
!= browser
->b
.rows
) {
1425 struct callchain_print_arg carg
= {
1426 .row_offset
= row_offset
,
1429 printed
+= hist_browser__show_callchain(browser
, entry
,
1431 hist_browser__show_callchain_entry
, &carg
,
1432 hist_browser__check_output_full
);
1438 static int hist_browser__show_no_entry(struct hist_browser
*browser
,
1439 unsigned short row
, int level
)
1441 int width
= browser
->b
.width
;
1442 bool current_entry
= ui_browser__is_current_entry(&browser
->b
, row
);
1446 struct perf_hpp_fmt
*fmt
;
1447 struct perf_hpp_list_node
*fmt_node
;
1448 int indent
= browser
->hists
->nr_hpp_node
- 2;
1450 if (current_entry
) {
1451 browser
->he_selection
= NULL
;
1452 browser
->selection
= NULL
;
1455 hist_browser__gotorc(browser
, row
, 0);
1457 if (current_entry
&& browser
->b
.navkeypressed
)
1458 ui_browser__set_color(&browser
->b
, HE_COLORSET_SELECTED
);
1460 ui_browser__set_color(&browser
->b
, HE_COLORSET_NORMAL
);
1462 ui_browser__write_nstring(&browser
->b
, "", level
* HIERARCHY_INDENT
);
1463 width
-= level
* HIERARCHY_INDENT
;
1465 /* the first hpp_list_node is for overhead columns */
1466 fmt_node
= list_first_entry(&browser
->hists
->hpp_formats
,
1467 struct perf_hpp_list_node
, list
);
1468 perf_hpp_list__for_each_format(&fmt_node
->hpp
, fmt
) {
1469 if (perf_hpp__should_skip(fmt
, browser
->hists
) ||
1470 column
++ < browser
->b
.horiz_scroll
)
1473 ret
= fmt
->width(fmt
, NULL
, hists_to_evsel(browser
->hists
));
1476 /* for folded sign */
1480 /* space between columns */
1484 ui_browser__write_nstring(&browser
->b
, "", ret
);
1488 ui_browser__write_nstring(&browser
->b
, "", indent
* HIERARCHY_INDENT
);
1489 width
-= indent
* HIERARCHY_INDENT
;
1491 if (column
>= browser
->b
.horiz_scroll
) {
1494 ret
= snprintf(buf
, sizeof(buf
), "no entry >= %.2f%%", browser
->min_pcnt
);
1495 ui_browser__printf(&browser
->b
, " %s", buf
);
1499 /* The scroll bar isn't being used */
1500 if (!browser
->b
.navkeypressed
)
1503 ui_browser__write_nstring(&browser
->b
, "", width
);
1507 static int advance_hpp_check(struct perf_hpp
*hpp
, int inc
)
1509 advance_hpp(hpp
, inc
);
1510 return hpp
->size
<= 0;
1513 static int hists_browser__scnprintf_headers(struct hist_browser
*browser
, char *buf
, size_t size
)
1515 struct hists
*hists
= browser
->hists
;
1516 struct perf_hpp dummy_hpp
= {
1520 struct perf_hpp_fmt
*fmt
;
1524 if (symbol_conf
.use_callchain
) {
1525 ret
= scnprintf(buf
, size
, " ");
1526 if (advance_hpp_check(&dummy_hpp
, ret
))
1530 hists__for_each_format(browser
->hists
, fmt
) {
1531 if (perf_hpp__should_skip(fmt
, hists
) || column
++ < browser
->b
.horiz_scroll
)
1534 ret
= fmt
->header(fmt
, &dummy_hpp
, hists_to_evsel(hists
));
1535 if (advance_hpp_check(&dummy_hpp
, ret
))
1538 ret
= scnprintf(dummy_hpp
.buf
, dummy_hpp
.size
, " ");
1539 if (advance_hpp_check(&dummy_hpp
, ret
))
1546 static int hists_browser__scnprintf_hierarchy_headers(struct hist_browser
*browser
, char *buf
, size_t size
)
1548 struct hists
*hists
= browser
->hists
;
1549 struct perf_hpp dummy_hpp
= {
1553 struct perf_hpp_fmt
*fmt
;
1554 struct perf_hpp_list_node
*fmt_node
;
1557 int indent
= hists
->nr_hpp_node
- 2;
1558 bool first_node
, first_col
;
1560 ret
= scnprintf(buf
, size
, " ");
1561 if (advance_hpp_check(&dummy_hpp
, ret
))
1564 /* the first hpp_list_node is for overhead columns */
1565 fmt_node
= list_first_entry(&hists
->hpp_formats
,
1566 struct perf_hpp_list_node
, list
);
1567 perf_hpp_list__for_each_format(&fmt_node
->hpp
, fmt
) {
1568 if (column
++ < browser
->b
.horiz_scroll
)
1571 ret
= fmt
->header(fmt
, &dummy_hpp
, hists_to_evsel(hists
));
1572 if (advance_hpp_check(&dummy_hpp
, ret
))
1575 ret
= scnprintf(dummy_hpp
.buf
, dummy_hpp
.size
, " ");
1576 if (advance_hpp_check(&dummy_hpp
, ret
))
1580 ret
= scnprintf(dummy_hpp
.buf
, dummy_hpp
.size
, "%*s",
1581 indent
* HIERARCHY_INDENT
, "");
1582 if (advance_hpp_check(&dummy_hpp
, ret
))
1586 list_for_each_entry_continue(fmt_node
, &hists
->hpp_formats
, list
) {
1588 ret
= scnprintf(dummy_hpp
.buf
, dummy_hpp
.size
, " / ");
1589 if (advance_hpp_check(&dummy_hpp
, ret
))
1595 perf_hpp_list__for_each_format(&fmt_node
->hpp
, fmt
) {
1598 if (perf_hpp__should_skip(fmt
, hists
))
1602 ret
= scnprintf(dummy_hpp
.buf
, dummy_hpp
.size
, "+");
1603 if (advance_hpp_check(&dummy_hpp
, ret
))
1608 ret
= fmt
->header(fmt
, &dummy_hpp
, hists_to_evsel(hists
));
1609 dummy_hpp
.buf
[ret
] = '\0';
1610 rtrim(dummy_hpp
.buf
);
1612 start
= ltrim(dummy_hpp
.buf
);
1613 ret
= strlen(start
);
1615 if (start
!= dummy_hpp
.buf
)
1616 memmove(dummy_hpp
.buf
, start
, ret
+ 1);
1618 if (advance_hpp_check(&dummy_hpp
, ret
))
1626 static void hist_browser__show_headers(struct hist_browser
*browser
)
1630 if (symbol_conf
.report_hierarchy
)
1631 hists_browser__scnprintf_hierarchy_headers(browser
, headers
,
1634 hists_browser__scnprintf_headers(browser
, headers
,
1636 ui_browser__gotorc(&browser
->b
, 0, 0);
1637 ui_browser__set_color(&browser
->b
, HE_COLORSET_ROOT
);
1638 ui_browser__write_nstring(&browser
->b
, headers
, browser
->b
.width
+ 1);
1641 static void ui_browser__hists_init_top(struct ui_browser
*browser
)
1643 if (browser
->top
== NULL
) {
1644 struct hist_browser
*hb
;
1646 hb
= container_of(browser
, struct hist_browser
, b
);
1647 browser
->top
= rb_first(&hb
->hists
->entries
);
1651 static unsigned int hist_browser__refresh(struct ui_browser
*browser
)
1654 u16 header_offset
= 0;
1656 struct hist_browser
*hb
= container_of(browser
, struct hist_browser
, b
);
1658 if (hb
->show_headers
) {
1659 hist_browser__show_headers(hb
);
1663 ui_browser__hists_init_top(browser
);
1664 hb
->he_selection
= NULL
;
1665 hb
->selection
= NULL
;
1667 for (nd
= browser
->top
; nd
; nd
= rb_hierarchy_next(nd
)) {
1668 struct hist_entry
*h
= rb_entry(nd
, struct hist_entry
, rb_node
);
1672 /* let it move to sibling */
1673 h
->unfolded
= false;
1677 percent
= hist_entry__get_percent_limit(h
);
1678 if (percent
< hb
->min_pcnt
)
1681 if (symbol_conf
.report_hierarchy
) {
1682 row
+= hist_browser__show_hierarchy_entry(hb
, h
, row
,
1684 if (row
== browser
->rows
)
1687 if (h
->has_no_entry
) {
1688 hist_browser__show_no_entry(hb
, row
, h
->depth
+ 1);
1692 row
+= hist_browser__show_entry(hb
, h
, row
);
1695 if (row
== browser
->rows
)
1699 return row
+ header_offset
;
1702 static struct rb_node
*hists__filter_entries(struct rb_node
*nd
,
1705 while (nd
!= NULL
) {
1706 struct hist_entry
*h
= rb_entry(nd
, struct hist_entry
, rb_node
);
1707 float percent
= hist_entry__get_percent_limit(h
);
1709 if (!h
->filtered
&& percent
>= min_pcnt
)
1713 * If it's filtered, its all children also were filtered.
1714 * So move to sibling node.
1719 nd
= rb_hierarchy_next(nd
);
1725 static struct rb_node
*hists__filter_prev_entries(struct rb_node
*nd
,
1728 while (nd
!= NULL
) {
1729 struct hist_entry
*h
= rb_entry(nd
, struct hist_entry
, rb_node
);
1730 float percent
= hist_entry__get_percent_limit(h
);
1732 if (!h
->filtered
&& percent
>= min_pcnt
)
1735 nd
= rb_hierarchy_prev(nd
);
1741 static void ui_browser__hists_seek(struct ui_browser
*browser
,
1742 off_t offset
, int whence
)
1744 struct hist_entry
*h
;
1747 struct hist_browser
*hb
;
1749 hb
= container_of(browser
, struct hist_browser
, b
);
1751 if (browser
->nr_entries
== 0)
1754 ui_browser__hists_init_top(browser
);
1758 nd
= hists__filter_entries(rb_first(browser
->entries
),
1765 nd
= rb_hierarchy_last(rb_last(browser
->entries
));
1766 nd
= hists__filter_prev_entries(nd
, hb
->min_pcnt
);
1774 * Moves not relative to the first visible entry invalidates its
1777 h
= rb_entry(browser
->top
, struct hist_entry
, rb_node
);
1781 * Here we have to check if nd is expanded (+), if it is we can't go
1782 * the next top level hist_entry, instead we must compute an offset of
1783 * what _not_ to show and not change the first visible entry.
1785 * This offset increments when we are going from top to bottom and
1786 * decreases when we're going from bottom to top.
1788 * As we don't have backpointers to the top level in the callchains
1789 * structure, we need to always print the whole hist_entry callchain,
1790 * skipping the first ones that are before the first visible entry
1791 * and stop when we printed enough lines to fill the screen.
1799 h
= rb_entry(nd
, struct hist_entry
, rb_node
);
1800 if (h
->unfolded
&& h
->leaf
) {
1801 u16 remaining
= h
->nr_rows
- h
->row_offset
;
1802 if (offset
> remaining
) {
1803 offset
-= remaining
;
1806 h
->row_offset
+= offset
;
1812 nd
= hists__filter_entries(rb_hierarchy_next(nd
),
1818 } while (offset
!= 0);
1819 } else if (offset
< 0) {
1821 h
= rb_entry(nd
, struct hist_entry
, rb_node
);
1822 if (h
->unfolded
&& h
->leaf
) {
1824 if (-offset
> h
->row_offset
) {
1825 offset
+= h
->row_offset
;
1828 h
->row_offset
+= offset
;
1834 if (-offset
> h
->nr_rows
) {
1835 offset
+= h
->nr_rows
;
1838 h
->row_offset
= h
->nr_rows
+ offset
;
1846 nd
= hists__filter_prev_entries(rb_hierarchy_prev(nd
),
1854 * Last unfiltered hist_entry, check if it is
1855 * unfolded, if it is then we should have
1856 * row_offset at its last entry.
1858 h
= rb_entry(nd
, struct hist_entry
, rb_node
);
1859 if (h
->unfolded
&& h
->leaf
)
1860 h
->row_offset
= h
->nr_rows
;
1867 h
= rb_entry(nd
, struct hist_entry
, rb_node
);
1872 static int hist_browser__fprintf_callchain(struct hist_browser
*browser
,
1873 struct hist_entry
*he
, FILE *fp
,
1876 struct callchain_print_arg arg
= {
1880 hist_browser__show_callchain(browser
, he
, level
, 0,
1881 hist_browser__fprintf_callchain_entry
, &arg
,
1882 hist_browser__check_dump_full
);
1886 static int hist_browser__fprintf_entry(struct hist_browser
*browser
,
1887 struct hist_entry
*he
, FILE *fp
)
1891 char folded_sign
= ' ';
1892 struct perf_hpp hpp
= {
1896 struct perf_hpp_fmt
*fmt
;
1900 if (symbol_conf
.use_callchain
)
1901 folded_sign
= hist_entry__folded(he
);
1903 if (symbol_conf
.use_callchain
)
1904 printed
+= fprintf(fp
, "%c ", folded_sign
);
1906 hists__for_each_format(browser
->hists
, fmt
) {
1907 if (perf_hpp__should_skip(fmt
, he
->hists
))
1911 ret
= scnprintf(hpp
.buf
, hpp
.size
, " ");
1912 advance_hpp(&hpp
, ret
);
1916 ret
= fmt
->entry(fmt
, &hpp
, he
);
1917 ret
= hist_entry__snprintf_alignment(he
, &hpp
, fmt
, ret
);
1918 advance_hpp(&hpp
, ret
);
1920 printed
+= fprintf(fp
, "%s\n", s
);
1922 if (folded_sign
== '-')
1923 printed
+= hist_browser__fprintf_callchain(browser
, he
, fp
, 1);
1929 static int hist_browser__fprintf_hierarchy_entry(struct hist_browser
*browser
,
1930 struct hist_entry
*he
,
1931 FILE *fp
, int level
)
1935 char folded_sign
= ' ';
1936 struct perf_hpp hpp
= {
1940 struct perf_hpp_fmt
*fmt
;
1941 struct perf_hpp_list_node
*fmt_node
;
1944 int hierarchy_indent
= (he
->hists
->nr_hpp_node
- 2) * HIERARCHY_INDENT
;
1946 printed
= fprintf(fp
, "%*s", level
* HIERARCHY_INDENT
, "");
1948 folded_sign
= hist_entry__folded(he
);
1949 printed
+= fprintf(fp
, "%c", folded_sign
);
1951 /* the first hpp_list_node is for overhead columns */
1952 fmt_node
= list_first_entry(&he
->hists
->hpp_formats
,
1953 struct perf_hpp_list_node
, list
);
1954 perf_hpp_list__for_each_format(&fmt_node
->hpp
, fmt
) {
1956 ret
= scnprintf(hpp
.buf
, hpp
.size
, " ");
1957 advance_hpp(&hpp
, ret
);
1961 ret
= fmt
->entry(fmt
, &hpp
, he
);
1962 advance_hpp(&hpp
, ret
);
1965 ret
= scnprintf(hpp
.buf
, hpp
.size
, "%*s", hierarchy_indent
, "");
1966 advance_hpp(&hpp
, ret
);
1968 perf_hpp_list__for_each_format(he
->hpp_list
, fmt
) {
1969 ret
= scnprintf(hpp
.buf
, hpp
.size
, " ");
1970 advance_hpp(&hpp
, ret
);
1972 ret
= fmt
->entry(fmt
, &hpp
, he
);
1973 advance_hpp(&hpp
, ret
);
1976 printed
+= fprintf(fp
, "%s\n", rtrim(s
));
1978 if (he
->leaf
&& folded_sign
== '-') {
1979 printed
+= hist_browser__fprintf_callchain(browser
, he
, fp
,
1986 static int hist_browser__fprintf(struct hist_browser
*browser
, FILE *fp
)
1988 struct rb_node
*nd
= hists__filter_entries(rb_first(browser
->b
.entries
),
1993 struct hist_entry
*h
= rb_entry(nd
, struct hist_entry
, rb_node
);
1995 if (symbol_conf
.report_hierarchy
) {
1996 printed
+= hist_browser__fprintf_hierarchy_entry(browser
,
2000 printed
+= hist_browser__fprintf_entry(browser
, h
, fp
);
2003 nd
= hists__filter_entries(rb_hierarchy_next(nd
),
2010 static int hist_browser__dump(struct hist_browser
*browser
)
2016 scnprintf(filename
, sizeof(filename
), "perf.hist.%d", browser
->print_seq
);
2017 if (access(filename
, F_OK
))
2020 * XXX: Just an arbitrary lazy upper limit
2022 if (++browser
->print_seq
== 8192) {
2023 ui_helpline__fpush("Too many perf.hist.N files, nothing written!");
2028 fp
= fopen(filename
, "w");
2031 const char *err
= strerror_r(errno
, bf
, sizeof(bf
));
2032 ui_helpline__fpush("Couldn't write to %s: %s", filename
, err
);
2036 ++browser
->print_seq
;
2037 hist_browser__fprintf(browser
, fp
);
2039 ui_helpline__fpush("%s written!", filename
);
2044 static struct hist_browser
*hist_browser__new(struct hists
*hists
,
2045 struct hist_browser_timer
*hbt
,
2046 struct perf_env
*env
)
2048 struct hist_browser
*browser
= zalloc(sizeof(*browser
));
2051 browser
->hists
= hists
;
2052 browser
->b
.refresh
= hist_browser__refresh
;
2053 browser
->b
.refresh_dimensions
= hist_browser__refresh_dimensions
;
2054 browser
->b
.seek
= ui_browser__hists_seek
;
2055 browser
->b
.use_navkeypressed
= true;
2056 browser
->show_headers
= symbol_conf
.show_hist_headers
;
2064 static void hist_browser__delete(struct hist_browser
*browser
)
2069 static struct hist_entry
*hist_browser__selected_entry(struct hist_browser
*browser
)
2071 return browser
->he_selection
;
2074 static struct thread
*hist_browser__selected_thread(struct hist_browser
*browser
)
2076 return browser
->he_selection
->thread
;
2079 /* Check whether the browser is for 'top' or 'report' */
2080 static inline bool is_report_browser(void *timer
)
2082 return timer
== NULL
;
2085 static int hists__browser_title(struct hists
*hists
,
2086 struct hist_browser_timer
*hbt
,
2087 char *bf
, size_t size
)
2091 const struct dso
*dso
= hists
->dso_filter
;
2092 const struct thread
*thread
= hists
->thread_filter
;
2093 int socket_id
= hists
->socket_filter
;
2094 unsigned long nr_samples
= hists
->stats
.nr_events
[PERF_RECORD_SAMPLE
];
2095 u64 nr_events
= hists
->stats
.total_period
;
2096 struct perf_evsel
*evsel
= hists_to_evsel(hists
);
2097 const char *ev_name
= perf_evsel__name(evsel
);
2099 size_t buflen
= sizeof(buf
);
2100 char ref
[30] = " show reference callgraph, ";
2101 bool enable_ref
= false;
2103 if (symbol_conf
.filter_relative
) {
2104 nr_samples
= hists
->stats
.nr_non_filtered_samples
;
2105 nr_events
= hists
->stats
.total_non_filtered_period
;
2108 if (perf_evsel__is_group_event(evsel
)) {
2109 struct perf_evsel
*pos
;
2111 perf_evsel__group_desc(evsel
, buf
, buflen
);
2114 for_each_group_member(pos
, evsel
) {
2115 struct hists
*pos_hists
= evsel__hists(pos
);
2117 if (symbol_conf
.filter_relative
) {
2118 nr_samples
+= pos_hists
->stats
.nr_non_filtered_samples
;
2119 nr_events
+= pos_hists
->stats
.total_non_filtered_period
;
2121 nr_samples
+= pos_hists
->stats
.nr_events
[PERF_RECORD_SAMPLE
];
2122 nr_events
+= pos_hists
->stats
.total_period
;
2127 if (symbol_conf
.show_ref_callgraph
&&
2128 strstr(ev_name
, "call-graph=no"))
2130 nr_samples
= convert_unit(nr_samples
, &unit
);
2131 printed
= scnprintf(bf
, size
,
2132 "Samples: %lu%c of event '%s',%sEvent count (approx.): %" PRIu64
,
2133 nr_samples
, unit
, ev_name
, enable_ref
? ref
: " ", nr_events
);
2136 if (hists
->uid_filter_str
)
2137 printed
+= snprintf(bf
+ printed
, size
- printed
,
2138 ", UID: %s", hists
->uid_filter_str
);
2140 if (sort__has_thread
) {
2141 printed
+= scnprintf(bf
+ printed
, size
- printed
,
2143 (thread
->comm_set
? thread__comm_str(thread
) : ""),
2146 printed
+= scnprintf(bf
+ printed
, size
- printed
,
2148 (thread
->comm_set
? thread__comm_str(thread
) : ""));
2152 printed
+= scnprintf(bf
+ printed
, size
- printed
,
2153 ", DSO: %s", dso
->short_name
);
2155 printed
+= scnprintf(bf
+ printed
, size
- printed
,
2156 ", Processor Socket: %d", socket_id
);
2157 if (!is_report_browser(hbt
)) {
2158 struct perf_top
*top
= hbt
->arg
;
2161 printed
+= scnprintf(bf
+ printed
, size
- printed
, " [z]");
2167 static inline void free_popup_options(char **options
, int n
)
2171 for (i
= 0; i
< n
; ++i
)
2176 * Only runtime switching of perf data file will make "input_name" point
2177 * to a malloced buffer. So add "is_input_name_malloced" flag to decide
2178 * whether we need to call free() for current "input_name" during the switch.
2180 static bool is_input_name_malloced
= false;
2182 static int switch_data_file(void)
2184 char *pwd
, *options
[32], *abs_path
[32], *tmp
;
2186 int nr_options
= 0, choice
= -1, ret
= -1;
2187 struct dirent
*dent
;
2189 pwd
= getenv("PWD");
2193 pwd_dir
= opendir(pwd
);
2197 memset(options
, 0, sizeof(options
));
2198 memset(options
, 0, sizeof(abs_path
));
2200 while ((dent
= readdir(pwd_dir
))) {
2201 char path
[PATH_MAX
];
2203 char *name
= dent
->d_name
;
2206 if (!(dent
->d_type
== DT_REG
))
2209 snprintf(path
, sizeof(path
), "%s/%s", pwd
, name
);
2211 file
= fopen(path
, "r");
2215 if (fread(&magic
, 1, 8, file
) < 8)
2216 goto close_file_and_continue
;
2218 if (is_perf_magic(magic
)) {
2219 options
[nr_options
] = strdup(name
);
2220 if (!options
[nr_options
])
2221 goto close_file_and_continue
;
2223 abs_path
[nr_options
] = strdup(path
);
2224 if (!abs_path
[nr_options
]) {
2225 zfree(&options
[nr_options
]);
2226 ui__warning("Can't search all data files due to memory shortage.\n");
2234 close_file_and_continue
:
2236 if (nr_options
>= 32) {
2237 ui__warning("Too many perf data files in PWD!\n"
2238 "Only the first 32 files will be listed.\n");
2245 choice
= ui__popup_menu(nr_options
, options
);
2246 if (choice
< nr_options
&& choice
>= 0) {
2247 tmp
= strdup(abs_path
[choice
]);
2249 if (is_input_name_malloced
)
2250 free((void *)input_name
);
2252 is_input_name_malloced
= true;
2255 ui__warning("Data switch failed due to memory shortage!\n");
2259 free_popup_options(options
, nr_options
);
2260 free_popup_options(abs_path
, nr_options
);
2264 struct popup_action
{
2265 struct thread
*thread
;
2266 struct map_symbol ms
;
2269 int (*fn
)(struct hist_browser
*browser
, struct popup_action
*act
);
2273 do_annotate(struct hist_browser
*browser
, struct popup_action
*act
)
2275 struct perf_evsel
*evsel
;
2276 struct annotation
*notes
;
2277 struct hist_entry
*he
;
2280 if (!objdump_path
&& perf_env__lookup_objdump(browser
->env
))
2283 notes
= symbol__annotation(act
->ms
.sym
);
2287 evsel
= hists_to_evsel(browser
->hists
);
2288 err
= map_symbol__tui_annotate(&act
->ms
, evsel
, browser
->hbt
);
2289 he
= hist_browser__selected_entry(browser
);
2291 * offer option to annotate the other branch source or target
2292 * (if they exists) when returning from annotate
2294 if ((err
== 'q' || err
== CTRL('c')) && he
->branch_info
)
2297 ui_browser__update_nr_entries(&browser
->b
, browser
->hists
->nr_entries
);
2299 ui_browser__handle_resize(&browser
->b
);
2304 add_annotate_opt(struct hist_browser
*browser __maybe_unused
,
2305 struct popup_action
*act
, char **optstr
,
2306 struct map
*map
, struct symbol
*sym
)
2308 if (sym
== NULL
|| map
->dso
->annotate_warned
)
2311 if (asprintf(optstr
, "Annotate %s", sym
->name
) < 0)
2316 act
->fn
= do_annotate
;
2321 do_zoom_thread(struct hist_browser
*browser
, struct popup_action
*act
)
2323 struct thread
*thread
= act
->thread
;
2325 if (browser
->hists
->thread_filter
) {
2326 pstack__remove(browser
->pstack
, &browser
->hists
->thread_filter
);
2327 perf_hpp__set_elide(HISTC_THREAD
, false);
2328 thread__zput(browser
->hists
->thread_filter
);
2331 if (sort__has_thread
) {
2332 ui_helpline__fpush("To zoom out press ESC or ENTER + \"Zoom out of %s(%d) thread\"",
2333 thread
->comm_set
? thread__comm_str(thread
) : "",
2336 ui_helpline__fpush("To zoom out press ESC or ENTER + \"Zoom out of %s thread\"",
2337 thread
->comm_set
? thread__comm_str(thread
) : "");
2340 browser
->hists
->thread_filter
= thread__get(thread
);
2341 perf_hpp__set_elide(HISTC_THREAD
, false);
2342 pstack__push(browser
->pstack
, &browser
->hists
->thread_filter
);
2345 hists__filter_by_thread(browser
->hists
);
2346 hist_browser__reset(browser
);
2351 add_thread_opt(struct hist_browser
*browser
, struct popup_action
*act
,
2352 char **optstr
, struct thread
*thread
)
2356 if ((!sort__has_thread
&& !sort__has_comm
) || thread
== NULL
)
2359 if (sort__has_thread
) {
2360 ret
= asprintf(optstr
, "Zoom %s %s(%d) thread",
2361 browser
->hists
->thread_filter
? "out of" : "into",
2362 thread
->comm_set
? thread__comm_str(thread
) : "",
2365 ret
= asprintf(optstr
, "Zoom %s %s thread",
2366 browser
->hists
->thread_filter
? "out of" : "into",
2367 thread
->comm_set
? thread__comm_str(thread
) : "");
2372 act
->thread
= thread
;
2373 act
->fn
= do_zoom_thread
;
2378 do_zoom_dso(struct hist_browser
*browser
, struct popup_action
*act
)
2380 struct map
*map
= act
->ms
.map
;
2382 if (browser
->hists
->dso_filter
) {
2383 pstack__remove(browser
->pstack
, &browser
->hists
->dso_filter
);
2384 perf_hpp__set_elide(HISTC_DSO
, false);
2385 browser
->hists
->dso_filter
= NULL
;
2390 ui_helpline__fpush("To zoom out press ESC or ENTER + \"Zoom out of %s DSO\"",
2391 __map__is_kernel(map
) ? "the Kernel" : map
->dso
->short_name
);
2392 browser
->hists
->dso_filter
= map
->dso
;
2393 perf_hpp__set_elide(HISTC_DSO
, true);
2394 pstack__push(browser
->pstack
, &browser
->hists
->dso_filter
);
2397 hists__filter_by_dso(browser
->hists
);
2398 hist_browser__reset(browser
);
2403 add_dso_opt(struct hist_browser
*browser
, struct popup_action
*act
,
2404 char **optstr
, struct map
*map
)
2406 if (!sort__has_dso
|| map
== NULL
)
2409 if (asprintf(optstr
, "Zoom %s %s DSO",
2410 browser
->hists
->dso_filter
? "out of" : "into",
2411 __map__is_kernel(map
) ? "the Kernel" : map
->dso
->short_name
) < 0)
2415 act
->fn
= do_zoom_dso
;
2420 do_browse_map(struct hist_browser
*browser __maybe_unused
,
2421 struct popup_action
*act
)
2423 map__browse(act
->ms
.map
);
2428 add_map_opt(struct hist_browser
*browser __maybe_unused
,
2429 struct popup_action
*act
, char **optstr
, struct map
*map
)
2431 if (!sort__has_dso
|| map
== NULL
)
2434 if (asprintf(optstr
, "Browse map details") < 0)
2438 act
->fn
= do_browse_map
;
2443 do_run_script(struct hist_browser
*browser __maybe_unused
,
2444 struct popup_action
*act
)
2446 char script_opt
[64];
2447 memset(script_opt
, 0, sizeof(script_opt
));
2450 scnprintf(script_opt
, sizeof(script_opt
), " -c %s ",
2451 thread__comm_str(act
->thread
));
2452 } else if (act
->ms
.sym
) {
2453 scnprintf(script_opt
, sizeof(script_opt
), " -S %s ",
2457 script_browse(script_opt
);
2462 add_script_opt(struct hist_browser
*browser __maybe_unused
,
2463 struct popup_action
*act
, char **optstr
,
2464 struct thread
*thread
, struct symbol
*sym
)
2467 if (asprintf(optstr
, "Run scripts for samples of thread [%s]",
2468 thread__comm_str(thread
)) < 0)
2471 if (asprintf(optstr
, "Run scripts for samples of symbol [%s]",
2475 if (asprintf(optstr
, "Run scripts for all samples") < 0)
2479 act
->thread
= thread
;
2481 act
->fn
= do_run_script
;
2486 do_switch_data(struct hist_browser
*browser __maybe_unused
,
2487 struct popup_action
*act __maybe_unused
)
2489 if (switch_data_file()) {
2490 ui__warning("Won't switch the data files due to\n"
2491 "no valid data file get selected!\n");
2495 return K_SWITCH_INPUT_DATA
;
2499 add_switch_opt(struct hist_browser
*browser
,
2500 struct popup_action
*act
, char **optstr
)
2502 if (!is_report_browser(browser
->hbt
))
2505 if (asprintf(optstr
, "Switch to another data file in PWD") < 0)
2508 act
->fn
= do_switch_data
;
2513 do_exit_browser(struct hist_browser
*browser __maybe_unused
,
2514 struct popup_action
*act __maybe_unused
)
2520 add_exit_opt(struct hist_browser
*browser __maybe_unused
,
2521 struct popup_action
*act
, char **optstr
)
2523 if (asprintf(optstr
, "Exit") < 0)
2526 act
->fn
= do_exit_browser
;
2531 do_zoom_socket(struct hist_browser
*browser
, struct popup_action
*act
)
2533 if (browser
->hists
->socket_filter
> -1) {
2534 pstack__remove(browser
->pstack
, &browser
->hists
->socket_filter
);
2535 browser
->hists
->socket_filter
= -1;
2536 perf_hpp__set_elide(HISTC_SOCKET
, false);
2538 browser
->hists
->socket_filter
= act
->socket
;
2539 perf_hpp__set_elide(HISTC_SOCKET
, true);
2540 pstack__push(browser
->pstack
, &browser
->hists
->socket_filter
);
2543 hists__filter_by_socket(browser
->hists
);
2544 hist_browser__reset(browser
);
2549 add_socket_opt(struct hist_browser
*browser
, struct popup_action
*act
,
2550 char **optstr
, int socket_id
)
2552 if (!sort__has_socket
|| socket_id
< 0)
2555 if (asprintf(optstr
, "Zoom %s Processor Socket %d",
2556 (browser
->hists
->socket_filter
> -1) ? "out of" : "into",
2560 act
->socket
= socket_id
;
2561 act
->fn
= do_zoom_socket
;
2565 static void hist_browser__update_nr_entries(struct hist_browser
*hb
)
2568 struct rb_node
*nd
= rb_first(&hb
->hists
->entries
);
2570 if (hb
->min_pcnt
== 0 && !symbol_conf
.report_hierarchy
) {
2571 hb
->nr_non_filtered_entries
= hb
->hists
->nr_non_filtered_entries
;
2575 while ((nd
= hists__filter_entries(nd
, hb
->min_pcnt
)) != NULL
) {
2577 nd
= rb_hierarchy_next(nd
);
2580 hb
->nr_non_filtered_entries
= nr_entries
;
2581 hb
->nr_hierarchy_entries
= nr_entries
;
2584 static void hist_browser__update_percent_limit(struct hist_browser
*hb
,
2587 struct hist_entry
*he
;
2588 struct rb_node
*nd
= rb_first(&hb
->hists
->entries
);
2589 u64 total
= hists__total_period(hb
->hists
);
2590 u64 min_callchain_hits
= total
* (percent
/ 100);
2592 hb
->min_pcnt
= callchain_param
.min_percent
= percent
;
2594 while ((nd
= hists__filter_entries(nd
, hb
->min_pcnt
)) != NULL
) {
2595 he
= rb_entry(nd
, struct hist_entry
, rb_node
);
2597 if (he
->has_no_entry
) {
2598 he
->has_no_entry
= false;
2602 if (!he
->leaf
|| !symbol_conf
.use_callchain
)
2605 if (callchain_param
.mode
== CHAIN_GRAPH_REL
) {
2606 total
= he
->stat
.period
;
2608 if (symbol_conf
.cumulate_callchain
)
2609 total
= he
->stat_acc
->period
;
2611 min_callchain_hits
= total
* (percent
/ 100);
2614 callchain_param
.sort(&he
->sorted_chain
, he
->callchain
,
2615 min_callchain_hits
, &callchain_param
);
2618 nd
= __rb_hierarchy_next(nd
, HMD_FORCE_CHILD
);
2620 /* force to re-evaluate folding state of callchains */
2621 he
->init_have_children
= false;
2622 hist_entry__set_folding(he
, hb
, false);
2626 static int perf_evsel__hists_browse(struct perf_evsel
*evsel
, int nr_events
,
2627 const char *helpline
,
2629 struct hist_browser_timer
*hbt
,
2631 struct perf_env
*env
)
2633 struct hists
*hists
= evsel__hists(evsel
);
2634 struct hist_browser
*browser
= hist_browser__new(hists
, hbt
, env
);
2635 struct branch_info
*bi
;
2636 #define MAX_OPTIONS 16
2637 char *options
[MAX_OPTIONS
];
2638 struct popup_action actions
[MAX_OPTIONS
];
2642 int delay_secs
= hbt
? hbt
->refresh
: 0;
2643 struct perf_hpp_fmt
*fmt
;
2645 #define HIST_BROWSER_HELP_COMMON \
2646 "h/?/F1 Show this window\n" \
2648 "PGDN/SPACE Navigate\n" \
2649 "q/ESC/CTRL+C Exit browser\n\n" \
2650 "For multiple event sessions:\n\n" \
2651 "TAB/UNTAB Switch events\n\n" \
2652 "For symbolic views (--sort has sym):\n\n" \
2653 "ENTER Zoom into DSO/Threads & Annotate current symbol\n" \
2655 "a Annotate current symbol\n" \
2656 "C Collapse all callchains\n" \
2657 "d Zoom into current DSO\n" \
2658 "E Expand all callchains\n" \
2659 "F Toggle percentage of filtered entries\n" \
2660 "H Display column headers\n" \
2661 "L Change percent limit\n" \
2662 "m Display context menu\n" \
2663 "S Zoom into current Processor Socket\n" \
2665 /* help messages are sorted by lexical order of the hotkey */
2666 const char report_help
[] = HIST_BROWSER_HELP_COMMON
2667 "i Show header information\n"
2668 "P Print histograms to perf.hist.N\n"
2669 "r Run available scripts\n"
2670 "s Switch to another data file in PWD\n"
2671 "t Zoom into current Thread\n"
2672 "V Verbose (DSO names in callchains, etc)\n"
2673 "/ Filter symbol by name";
2674 const char top_help
[] = HIST_BROWSER_HELP_COMMON
2675 "P Print histograms to perf.hist.N\n"
2676 "t Zoom into current Thread\n"
2677 "V Verbose (DSO names in callchains, etc)\n"
2678 "z Toggle zeroing of samples\n"
2679 "f Enable/Disable events\n"
2680 "/ Filter symbol by name";
2682 if (browser
== NULL
)
2685 /* reset abort key so that it can get Ctrl-C as a key */
2687 SLang_init_tty(0, 0, 0);
2690 browser
->min_pcnt
= min_pcnt
;
2691 hist_browser__update_nr_entries(browser
);
2693 browser
->pstack
= pstack__new(3);
2694 if (browser
->pstack
== NULL
)
2697 ui_helpline__push(helpline
);
2699 memset(options
, 0, sizeof(options
));
2700 memset(actions
, 0, sizeof(actions
));
2702 hists__for_each_format(browser
->hists
, fmt
) {
2703 perf_hpp__reset_width(fmt
, hists
);
2705 * This is done just once, and activates the horizontal scrolling
2706 * code in the ui_browser code, it would be better to have a the
2707 * counter in the perf_hpp code, but I couldn't find doing it here
2708 * works, FIXME by setting this in hist_browser__new, for now, be
2711 ++browser
->b
.columns
;
2714 if (symbol_conf
.col_width_list_str
)
2715 perf_hpp__set_user_width(symbol_conf
.col_width_list_str
);
2718 struct thread
*thread
= NULL
;
2719 struct map
*map
= NULL
;
2725 key
= hist_browser__run(browser
, helpline
);
2727 if (browser
->he_selection
!= NULL
) {
2728 thread
= hist_browser__selected_thread(browser
);
2729 map
= browser
->selection
->map
;
2730 socked_id
= browser
->he_selection
->socket
;
2738 * Exit the browser, let hists__browser_tree
2739 * go to the next or previous
2741 goto out_free_stack
;
2743 if (!sort__has_sym
) {
2744 ui_browser__warning(&browser
->b
, delay_secs
* 2,
2745 "Annotation is only available for symbolic views, "
2746 "include \"sym*\" in --sort to use it.");
2750 if (browser
->selection
== NULL
||
2751 browser
->selection
->sym
== NULL
||
2752 browser
->selection
->map
->dso
->annotate_warned
)
2755 actions
->ms
.map
= browser
->selection
->map
;
2756 actions
->ms
.sym
= browser
->selection
->sym
;
2757 do_annotate(browser
, actions
);
2760 hist_browser__dump(browser
);
2763 actions
->ms
.map
= map
;
2764 do_zoom_dso(browser
, actions
);
2767 browser
->show_dso
= !browser
->show_dso
;
2770 actions
->thread
= thread
;
2771 do_zoom_thread(browser
, actions
);
2774 actions
->socket
= socked_id
;
2775 do_zoom_socket(browser
, actions
);
2778 if (ui_browser__input_window("Symbol to show",
2779 "Please enter the name of symbol you want to see.\n"
2780 "To remove the filter later, press / + ENTER.",
2781 buf
, "ENTER: OK, ESC: Cancel",
2782 delay_secs
* 2) == K_ENTER
) {
2783 hists
->symbol_filter_str
= *buf
? buf
: NULL
;
2784 hists__filter_by_symbol(hists
);
2785 hist_browser__reset(browser
);
2789 if (is_report_browser(hbt
)) {
2790 actions
->thread
= NULL
;
2791 actions
->ms
.sym
= NULL
;
2792 do_run_script(browser
, actions
);
2796 if (is_report_browser(hbt
)) {
2797 key
= do_switch_data(browser
, actions
);
2798 if (key
== K_SWITCH_INPUT_DATA
)
2799 goto out_free_stack
;
2803 /* env->arch is NULL for live-mode (i.e. perf top) */
2805 tui__header_window(env
);
2808 symbol_conf
.filter_relative
^= 1;
2811 if (!is_report_browser(hbt
)) {
2812 struct perf_top
*top
= hbt
->arg
;
2814 top
->zero
= !top
->zero
;
2818 if (ui_browser__input_window("Percent Limit",
2819 "Please enter the value you want to hide entries under that percent.",
2820 buf
, "ENTER: OK, ESC: Cancel",
2821 delay_secs
* 2) == K_ENTER
) {
2823 double new_percent
= strtod(buf
, &end
);
2825 if (new_percent
< 0 || new_percent
> 100) {
2826 ui_browser__warning(&browser
->b
, delay_secs
* 2,
2827 "Invalid percent: %.2f", new_percent
);
2831 hist_browser__update_percent_limit(browser
, new_percent
);
2832 hist_browser__reset(browser
);
2838 ui_browser__help_window(&browser
->b
,
2839 is_report_browser(hbt
) ? report_help
: top_help
);
2850 if (pstack__empty(browser
->pstack
)) {
2852 * Go back to the perf_evsel_menu__run or other user
2855 goto out_free_stack
;
2858 ui_browser__dialog_yesno(&browser
->b
,
2859 "Do you really want to exit?"))
2860 goto out_free_stack
;
2864 top
= pstack__peek(browser
->pstack
);
2865 if (top
== &browser
->hists
->dso_filter
) {
2867 * No need to set actions->dso here since
2868 * it's just to remove the current filter.
2869 * Ditto for thread below.
2871 do_zoom_dso(browser
, actions
);
2872 } else if (top
== &browser
->hists
->thread_filter
) {
2873 do_zoom_thread(browser
, actions
);
2874 } else if (top
== &browser
->hists
->socket_filter
) {
2875 do_zoom_socket(browser
, actions
);
2881 goto out_free_stack
;
2883 if (!is_report_browser(hbt
)) {
2884 struct perf_top
*top
= hbt
->arg
;
2886 perf_evlist__toggle_enable(top
->evlist
);
2888 * No need to refresh, resort/decay histogram
2889 * entries if we are not collecting samples:
2891 if (top
->evlist
->enabled
) {
2892 helpline
= "Press 'f' to disable the events or 'h' to see other hotkeys";
2893 hbt
->refresh
= delay_secs
;
2895 helpline
= "Press 'f' again to re-enable the events";
2902 helpline
= "Press '?' for help on key bindings";
2906 if (!sort__has_sym
|| browser
->selection
== NULL
)
2907 goto skip_annotation
;
2909 if (sort__mode
== SORT_MODE__BRANCH
) {
2910 bi
= browser
->he_selection
->branch_info
;
2913 goto skip_annotation
;
2915 nr_options
+= add_annotate_opt(browser
,
2916 &actions
[nr_options
],
2917 &options
[nr_options
],
2920 if (bi
->to
.sym
!= bi
->from
.sym
)
2921 nr_options
+= add_annotate_opt(browser
,
2922 &actions
[nr_options
],
2923 &options
[nr_options
],
2927 nr_options
+= add_annotate_opt(browser
,
2928 &actions
[nr_options
],
2929 &options
[nr_options
],
2930 browser
->selection
->map
,
2931 browser
->selection
->sym
);
2934 nr_options
+= add_thread_opt(browser
, &actions
[nr_options
],
2935 &options
[nr_options
], thread
);
2936 nr_options
+= add_dso_opt(browser
, &actions
[nr_options
],
2937 &options
[nr_options
], map
);
2938 nr_options
+= add_map_opt(browser
, &actions
[nr_options
],
2939 &options
[nr_options
],
2940 browser
->selection
?
2941 browser
->selection
->map
: NULL
);
2942 nr_options
+= add_socket_opt(browser
, &actions
[nr_options
],
2943 &options
[nr_options
],
2945 /* perf script support */
2946 if (!is_report_browser(hbt
))
2947 goto skip_scripting
;
2949 if (browser
->he_selection
) {
2950 if (sort__has_thread
&& thread
) {
2951 nr_options
+= add_script_opt(browser
,
2952 &actions
[nr_options
],
2953 &options
[nr_options
],
2957 * Note that browser->selection != NULL
2958 * when browser->he_selection is not NULL,
2959 * so we don't need to check browser->selection
2960 * before fetching browser->selection->sym like what
2961 * we do before fetching browser->selection->map.
2963 * See hist_browser__show_entry.
2965 if (sort__has_sym
&& browser
->selection
->sym
) {
2966 nr_options
+= add_script_opt(browser
,
2967 &actions
[nr_options
],
2968 &options
[nr_options
],
2969 NULL
, browser
->selection
->sym
);
2972 nr_options
+= add_script_opt(browser
, &actions
[nr_options
],
2973 &options
[nr_options
], NULL
, NULL
);
2974 nr_options
+= add_switch_opt(browser
, &actions
[nr_options
],
2975 &options
[nr_options
]);
2977 nr_options
+= add_exit_opt(browser
, &actions
[nr_options
],
2978 &options
[nr_options
]);
2981 struct popup_action
*act
;
2983 choice
= ui__popup_menu(nr_options
, options
);
2984 if (choice
== -1 || choice
>= nr_options
)
2987 act
= &actions
[choice
];
2988 key
= act
->fn(browser
, act
);
2991 if (key
== K_SWITCH_INPUT_DATA
)
2995 pstack__delete(browser
->pstack
);
2997 hist_browser__delete(browser
);
2998 free_popup_options(options
, MAX_OPTIONS
);
3002 struct perf_evsel_menu
{
3003 struct ui_browser b
;
3004 struct perf_evsel
*selection
;
3005 bool lost_events
, lost_events_warned
;
3007 struct perf_env
*env
;
3010 static void perf_evsel_menu__write(struct ui_browser
*browser
,
3011 void *entry
, int row
)
3013 struct perf_evsel_menu
*menu
= container_of(browser
,
3014 struct perf_evsel_menu
, b
);
3015 struct perf_evsel
*evsel
= list_entry(entry
, struct perf_evsel
, node
);
3016 struct hists
*hists
= evsel__hists(evsel
);
3017 bool current_entry
= ui_browser__is_current_entry(browser
, row
);
3018 unsigned long nr_events
= hists
->stats
.nr_events
[PERF_RECORD_SAMPLE
];
3019 const char *ev_name
= perf_evsel__name(evsel
);
3021 const char *warn
= " ";
3024 ui_browser__set_color(browser
, current_entry
? HE_COLORSET_SELECTED
:
3025 HE_COLORSET_NORMAL
);
3027 if (perf_evsel__is_group_event(evsel
)) {
3028 struct perf_evsel
*pos
;
3030 ev_name
= perf_evsel__group_name(evsel
);
3032 for_each_group_member(pos
, evsel
) {
3033 struct hists
*pos_hists
= evsel__hists(pos
);
3034 nr_events
+= pos_hists
->stats
.nr_events
[PERF_RECORD_SAMPLE
];
3038 nr_events
= convert_unit(nr_events
, &unit
);
3039 printed
= scnprintf(bf
, sizeof(bf
), "%lu%c%s%s", nr_events
,
3040 unit
, unit
== ' ' ? "" : " ", ev_name
);
3041 ui_browser__printf(browser
, "%s", bf
);
3043 nr_events
= hists
->stats
.nr_events
[PERF_RECORD_LOST
];
3044 if (nr_events
!= 0) {
3045 menu
->lost_events
= true;
3047 ui_browser__set_color(browser
, HE_COLORSET_TOP
);
3048 nr_events
= convert_unit(nr_events
, &unit
);
3049 printed
+= scnprintf(bf
, sizeof(bf
), ": %ld%c%schunks LOST!",
3050 nr_events
, unit
, unit
== ' ' ? "" : " ");
3054 ui_browser__write_nstring(browser
, warn
, browser
->width
- printed
);
3057 menu
->selection
= evsel
;
3060 static int perf_evsel_menu__run(struct perf_evsel_menu
*menu
,
3061 int nr_events
, const char *help
,
3062 struct hist_browser_timer
*hbt
)
3064 struct perf_evlist
*evlist
= menu
->b
.priv
;
3065 struct perf_evsel
*pos
;
3066 const char *title
= "Available samples";
3067 int delay_secs
= hbt
? hbt
->refresh
: 0;
3070 if (ui_browser__show(&menu
->b
, title
,
3071 "ESC: exit, ENTER|->: Browse histograms") < 0)
3075 key
= ui_browser__run(&menu
->b
, delay_secs
);
3079 hbt
->timer(hbt
->arg
);
3081 if (!menu
->lost_events_warned
&& menu
->lost_events
) {
3082 ui_browser__warn_lost_events(&menu
->b
);
3083 menu
->lost_events_warned
= true;
3088 if (!menu
->selection
)
3090 pos
= menu
->selection
;
3092 perf_evlist__set_selected(evlist
, pos
);
3094 * Give the calling tool a chance to populate the non
3095 * default evsel resorted hists tree.
3098 hbt
->timer(hbt
->arg
);
3099 key
= perf_evsel__hists_browse(pos
, nr_events
, help
,
3103 ui_browser__show_title(&menu
->b
, title
);
3106 if (pos
->node
.next
== &evlist
->entries
)
3107 pos
= perf_evlist__first(evlist
);
3109 pos
= perf_evsel__next(pos
);
3112 if (pos
->node
.prev
== &evlist
->entries
)
3113 pos
= perf_evlist__last(evlist
);
3115 pos
= perf_evsel__prev(pos
);
3117 case K_SWITCH_INPUT_DATA
:
3128 if (!ui_browser__dialog_yesno(&menu
->b
,
3129 "Do you really want to exit?"))
3141 ui_browser__hide(&menu
->b
);
3145 static bool filter_group_entries(struct ui_browser
*browser __maybe_unused
,
3148 struct perf_evsel
*evsel
= list_entry(entry
, struct perf_evsel
, node
);
3150 if (symbol_conf
.event_group
&& !perf_evsel__is_group_leader(evsel
))
3156 static int __perf_evlist__tui_browse_hists(struct perf_evlist
*evlist
,
3157 int nr_entries
, const char *help
,
3158 struct hist_browser_timer
*hbt
,
3160 struct perf_env
*env
)
3162 struct perf_evsel
*pos
;
3163 struct perf_evsel_menu menu
= {
3165 .entries
= &evlist
->entries
,
3166 .refresh
= ui_browser__list_head_refresh
,
3167 .seek
= ui_browser__list_head_seek
,
3168 .write
= perf_evsel_menu__write
,
3169 .filter
= filter_group_entries
,
3170 .nr_entries
= nr_entries
,
3173 .min_pcnt
= min_pcnt
,
3177 ui_helpline__push("Press ESC to exit");
3179 evlist__for_each(evlist
, pos
) {
3180 const char *ev_name
= perf_evsel__name(pos
);
3181 size_t line_len
= strlen(ev_name
) + 7;
3183 if (menu
.b
.width
< line_len
)
3184 menu
.b
.width
= line_len
;
3187 return perf_evsel_menu__run(&menu
, nr_entries
, help
, hbt
);
3190 int perf_evlist__tui_browse_hists(struct perf_evlist
*evlist
, const char *help
,
3191 struct hist_browser_timer
*hbt
,
3193 struct perf_env
*env
)
3195 int nr_entries
= evlist
->nr_entries
;
3198 if (nr_entries
== 1) {
3199 struct perf_evsel
*first
= perf_evlist__first(evlist
);
3201 return perf_evsel__hists_browse(first
, nr_entries
, help
,
3202 false, hbt
, min_pcnt
,
3206 if (symbol_conf
.event_group
) {
3207 struct perf_evsel
*pos
;
3210 evlist__for_each(evlist
, pos
) {
3211 if (perf_evsel__is_group_leader(pos
))
3215 if (nr_entries
== 1)
3219 return __perf_evlist__tui_browse_hists(evlist
, nr_entries
, help
,
3220 hbt
, min_pcnt
, env
);