1 // SPDX-License-Identifier: GPL-2.0
8 #include <linux/rbtree.h>
9 #include <sys/ttydefaults.h>
11 #include "../../util/evsel.h"
12 #include "../../util/evlist.h"
13 #include "../../util/hist.h"
14 #include "../../util/pstack.h"
15 #include "../../util/sort.h"
16 #include "../../util/util.h"
17 #include "../../util/top.h"
18 #include "../../util/thread.h"
19 #include "../../arch/common.h"
21 #include "../browsers/hists.h"
22 #include "../helpline.h"
31 #include "sane_ctype.h"
33 extern void hist_browser__init_hpp(void);
35 static int hists_browser__scnprintf_title(struct hist_browser *browser, char *bf, size_t size);
36 static void hist_browser__update_nr_entries(struct hist_browser *hb);
38 static struct rb_node *hists__filter_entries(struct rb_node *nd,
41 static bool hist_browser__has_filter(struct hist_browser *hb)
43 return hists__has_filter(hb->hists) || hb->min_pcnt || symbol_conf.has_filter || hb->c2c_filter;
46 static int hist_browser__get_folding(struct hist_browser *browser)
49 struct hists *hists = browser->hists;
50 int unfolded_rows = 0;
52 for (nd = rb_first(&hists->entries);
53 (nd = hists__filter_entries(nd, browser->min_pcnt)) != NULL;
54 nd = rb_hierarchy_next(nd)) {
55 struct hist_entry *he =
56 rb_entry(nd, struct hist_entry, rb_node);
58 if (he->leaf && he->unfolded)
59 unfolded_rows += he->nr_rows;
64 static void hist_browser__set_title_space(struct hist_browser *hb)
66 struct ui_browser *browser = &hb->b;
67 struct hists *hists = hb->hists;
68 struct perf_hpp_list *hpp_list = hists->hpp_list;
70 browser->extra_title_lines = hb->show_headers ? hpp_list->nr_header_lines : 0;
73 static u32 hist_browser__nr_entries(struct hist_browser *hb)
77 if (symbol_conf.report_hierarchy)
78 nr_entries = hb->nr_hierarchy_entries;
79 else if (hist_browser__has_filter(hb))
80 nr_entries = hb->nr_non_filtered_entries;
82 nr_entries = hb->hists->nr_entries;
84 hb->nr_callchain_rows = hist_browser__get_folding(hb);
85 return nr_entries + hb->nr_callchain_rows;
88 static void hist_browser__update_rows(struct hist_browser *hb)
90 struct ui_browser *browser = &hb->b;
91 struct hists *hists = hb->hists;
92 struct perf_hpp_list *hpp_list = hists->hpp_list;
95 if (!hb->show_headers) {
96 browser->rows += browser->extra_title_lines;
97 browser->extra_title_lines = 0;
101 browser->extra_title_lines = hpp_list->nr_header_lines;
102 browser->rows -= browser->extra_title_lines;
104 * Verify if we were at the last line and that line isn't
105 * visibe because we now show the header line(s).
107 index_row = browser->index - browser->top_idx;
108 if (index_row >= browser->rows)
109 browser->index -= index_row - browser->rows + 1;
112 static void hist_browser__refresh_dimensions(struct ui_browser *browser)
114 struct hist_browser *hb = container_of(browser, struct hist_browser, b);
116 /* 3 == +/- toggle symbol before actual hist_entry rendering */
117 browser->width = 3 + (hists__sort_list_width(hb->hists) + sizeof("[k]"));
119 * FIXME: Just keeping existing behaviour, but this really should be
120 * before updating browser->width, as it will invalidate the
121 * calculation above. Fix this and the fallout in another
124 ui_browser__refresh_dimensions(browser);
127 static void hist_browser__reset(struct hist_browser *browser)
130 * The hists__remove_entry_filter() already folds non-filtered
131 * entries so we can assume it has 0 callchain rows.
133 browser->nr_callchain_rows = 0;
135 hist_browser__update_nr_entries(browser);
136 browser->b.nr_entries = hist_browser__nr_entries(browser);
137 hist_browser__refresh_dimensions(&browser->b);
138 ui_browser__reset_index(&browser->b);
141 static char tree__folded_sign(bool unfolded)
143 return unfolded ? '-' : '+';
146 static char hist_entry__folded(const struct hist_entry *he)
148 return he->has_children ? tree__folded_sign(he->unfolded) : ' ';
151 static char callchain_list__folded(const struct callchain_list *cl)
153 return cl->has_children ? tree__folded_sign(cl->unfolded) : ' ';
156 static void callchain_list__set_folding(struct callchain_list *cl, bool unfold)
158 cl->unfolded = unfold ? cl->has_children : false;
161 static int callchain_node__count_rows_rb_tree(struct callchain_node *node)
166 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
167 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
168 struct callchain_list *chain;
169 char folded_sign = ' '; /* No children */
171 list_for_each_entry(chain, &child->val, list) {
174 /* We need this because we may not have children */
175 folded_sign = callchain_list__folded(chain);
176 if (folded_sign == '+')
180 if (folded_sign == '-') /* Have children and they're unfolded */
181 n += callchain_node__count_rows_rb_tree(child);
187 static int callchain_node__count_flat_rows(struct callchain_node *node)
189 struct callchain_list *chain;
190 char folded_sign = 0;
193 list_for_each_entry(chain, &node->parent_val, list) {
195 /* only check first chain list entry */
196 folded_sign = callchain_list__folded(chain);
197 if (folded_sign == '+')
203 list_for_each_entry(chain, &node->val, list) {
205 /* node->parent_val list might be empty */
206 folded_sign = callchain_list__folded(chain);
207 if (folded_sign == '+')
216 static int callchain_node__count_folded_rows(struct callchain_node *node __maybe_unused)
221 static int callchain_node__count_rows(struct callchain_node *node)
223 struct callchain_list *chain;
224 bool unfolded = false;
227 if (callchain_param.mode == CHAIN_FLAT)
228 return callchain_node__count_flat_rows(node);
229 else if (callchain_param.mode == CHAIN_FOLDED)
230 return callchain_node__count_folded_rows(node);
232 list_for_each_entry(chain, &node->val, list) {
235 unfolded = chain->unfolded;
239 n += callchain_node__count_rows_rb_tree(node);
244 static int callchain__count_rows(struct rb_root *chain)
249 for (nd = rb_first(chain); nd; nd = rb_next(nd)) {
250 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
251 n += callchain_node__count_rows(node);
257 static int hierarchy_count_rows(struct hist_browser *hb, struct hist_entry *he,
258 bool include_children)
261 struct rb_node *node;
262 struct hist_entry *child;
265 return callchain__count_rows(&he->sorted_chain);
267 if (he->has_no_entry)
270 node = rb_first(&he->hroot_out);
274 child = rb_entry(node, struct hist_entry, rb_node);
275 percent = hist_entry__get_percent_limit(child);
277 if (!child->filtered && percent >= hb->min_pcnt) {
280 if (include_children && child->unfolded)
281 count += hierarchy_count_rows(hb, child, true);
284 node = rb_next(node);
289 static bool hist_entry__toggle_fold(struct hist_entry *he)
294 if (!he->has_children)
297 he->unfolded = !he->unfolded;
301 static bool callchain_list__toggle_fold(struct callchain_list *cl)
306 if (!cl->has_children)
309 cl->unfolded = !cl->unfolded;
313 static void callchain_node__init_have_children_rb_tree(struct callchain_node *node)
315 struct rb_node *nd = rb_first(&node->rb_root);
317 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
318 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
319 struct callchain_list *chain;
322 list_for_each_entry(chain, &child->val, list) {
325 chain->has_children = chain->list.next != &child->val ||
326 !RB_EMPTY_ROOT(&child->rb_root);
328 chain->has_children = chain->list.next == &child->val &&
329 !RB_EMPTY_ROOT(&child->rb_root);
332 callchain_node__init_have_children_rb_tree(child);
336 static void callchain_node__init_have_children(struct callchain_node *node,
339 struct callchain_list *chain;
341 chain = list_entry(node->val.next, struct callchain_list, list);
342 chain->has_children = has_sibling;
344 if (!list_empty(&node->val)) {
345 chain = list_entry(node->val.prev, struct callchain_list, list);
346 chain->has_children = !RB_EMPTY_ROOT(&node->rb_root);
349 callchain_node__init_have_children_rb_tree(node);
352 static void callchain__init_have_children(struct rb_root *root)
354 struct rb_node *nd = rb_first(root);
355 bool has_sibling = nd && rb_next(nd);
357 for (nd = rb_first(root); nd; nd = rb_next(nd)) {
358 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
359 callchain_node__init_have_children(node, has_sibling);
360 if (callchain_param.mode == CHAIN_FLAT ||
361 callchain_param.mode == CHAIN_FOLDED)
362 callchain_node__make_parent_list(node);
366 static void hist_entry__init_have_children(struct hist_entry *he)
368 if (he->init_have_children)
372 he->has_children = !RB_EMPTY_ROOT(&he->sorted_chain);
373 callchain__init_have_children(&he->sorted_chain);
375 he->has_children = !RB_EMPTY_ROOT(&he->hroot_out);
378 he->init_have_children = true;
381 static bool hist_browser__toggle_fold(struct hist_browser *browser)
383 struct hist_entry *he = browser->he_selection;
384 struct map_symbol *ms = browser->selection;
385 struct callchain_list *cl = container_of(ms, struct callchain_list, ms);
392 has_children = hist_entry__toggle_fold(he);
394 has_children = callchain_list__toggle_fold(cl);
399 hist_entry__init_have_children(he);
400 browser->b.nr_entries -= he->nr_rows;
403 browser->nr_callchain_rows -= he->nr_rows;
405 browser->nr_hierarchy_entries -= he->nr_rows;
407 if (symbol_conf.report_hierarchy)
408 child_rows = hierarchy_count_rows(browser, he, true);
412 he->nr_rows = callchain__count_rows(
415 he->nr_rows = hierarchy_count_rows(browser, he, false);
417 /* account grand children */
418 if (symbol_conf.report_hierarchy)
419 browser->b.nr_entries += child_rows - he->nr_rows;
421 if (!he->leaf && he->nr_rows == 0) {
422 he->has_no_entry = true;
426 if (symbol_conf.report_hierarchy)
427 browser->b.nr_entries -= child_rows - he->nr_rows;
429 if (he->has_no_entry)
430 he->has_no_entry = false;
435 browser->b.nr_entries += he->nr_rows;
438 browser->nr_callchain_rows += he->nr_rows;
440 browser->nr_hierarchy_entries += he->nr_rows;
445 /* If it doesn't have children, no toggling performed */
449 static int callchain_node__set_folding_rb_tree(struct callchain_node *node, bool unfold)
454 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
455 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
456 struct callchain_list *chain;
457 bool has_children = false;
459 list_for_each_entry(chain, &child->val, list) {
461 callchain_list__set_folding(chain, unfold);
462 has_children = chain->has_children;
466 n += callchain_node__set_folding_rb_tree(child, unfold);
472 static int callchain_node__set_folding(struct callchain_node *node, bool unfold)
474 struct callchain_list *chain;
475 bool has_children = false;
478 list_for_each_entry(chain, &node->val, list) {
480 callchain_list__set_folding(chain, unfold);
481 has_children = chain->has_children;
485 n += callchain_node__set_folding_rb_tree(node, unfold);
490 static int callchain__set_folding(struct rb_root *chain, bool unfold)
495 for (nd = rb_first(chain); nd; nd = rb_next(nd)) {
496 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
497 n += callchain_node__set_folding(node, unfold);
503 static int hierarchy_set_folding(struct hist_browser *hb, struct hist_entry *he,
504 bool unfold __maybe_unused)
508 struct hist_entry *child;
511 for (nd = rb_first(&he->hroot_out); nd; nd = rb_next(nd)) {
512 child = rb_entry(nd, struct hist_entry, rb_node);
513 percent = hist_entry__get_percent_limit(child);
514 if (!child->filtered && percent >= hb->min_pcnt)
521 static void __hist_entry__set_folding(struct hist_entry *he,
522 struct hist_browser *hb, bool unfold)
524 hist_entry__init_have_children(he);
525 he->unfolded = unfold ? he->has_children : false;
527 if (he->has_children) {
531 n = callchain__set_folding(&he->sorted_chain, unfold);
533 n = hierarchy_set_folding(hb, he, unfold);
535 he->nr_rows = unfold ? n : 0;
540 static void hist_entry__set_folding(struct hist_entry *he,
541 struct hist_browser *browser, bool unfold)
545 percent = hist_entry__get_percent_limit(he);
546 if (he->filtered || percent < browser->min_pcnt)
549 __hist_entry__set_folding(he, browser, unfold);
551 if (!he->depth || unfold)
552 browser->nr_hierarchy_entries++;
554 browser->nr_callchain_rows += he->nr_rows;
555 else if (unfold && !hist_entry__has_hierarchy_children(he, browser->min_pcnt)) {
556 browser->nr_hierarchy_entries++;
557 he->has_no_entry = true;
560 he->has_no_entry = false;
564 __hist_browser__set_folding(struct hist_browser *browser, bool unfold)
567 struct hist_entry *he;
569 nd = rb_first(&browser->hists->entries);
571 he = rb_entry(nd, struct hist_entry, rb_node);
573 /* set folding state even if it's currently folded */
574 nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD);
576 hist_entry__set_folding(he, browser, unfold);
580 static void hist_browser__set_folding(struct hist_browser *browser, bool unfold)
582 browser->nr_hierarchy_entries = 0;
583 browser->nr_callchain_rows = 0;
584 __hist_browser__set_folding(browser, unfold);
586 browser->b.nr_entries = hist_browser__nr_entries(browser);
587 /* Go to the start, we may be way after valid entries after a collapse */
588 ui_browser__reset_index(&browser->b);
591 static void hist_browser__set_folding_selected(struct hist_browser *browser, bool unfold)
593 if (!browser->he_selection)
596 hist_entry__set_folding(browser->he_selection, browser, unfold);
597 browser->b.nr_entries = hist_browser__nr_entries(browser);
600 static void ui_browser__warn_lost_events(struct ui_browser *browser)
602 ui_browser__warning(browser, 4,
603 "Events are being lost, check IO/CPU overload!\n\n"
604 "You may want to run 'perf' using a RT scheduler policy:\n\n"
605 " perf top -r 80\n\n"
606 "Or reduce the sampling frequency.");
609 static int hist_browser__title(struct hist_browser *browser, char *bf, size_t size)
611 return browser->title ? browser->title(browser, bf, size) : 0;
614 int hist_browser__run(struct hist_browser *browser, const char *help,
615 bool warn_lost_event)
619 struct hist_browser_timer *hbt = browser->hbt;
620 int delay_secs = hbt ? hbt->refresh : 0;
622 browser->b.entries = &browser->hists->entries;
623 browser->b.nr_entries = hist_browser__nr_entries(browser);
625 hist_browser__title(browser, title, sizeof(title));
627 if (ui_browser__show(&browser->b, title, "%s", help) < 0)
631 key = ui_browser__run(&browser->b, delay_secs);
636 hbt->timer(hbt->arg);
638 if (hist_browser__has_filter(browser) ||
639 symbol_conf.report_hierarchy)
640 hist_browser__update_nr_entries(browser);
642 nr_entries = hist_browser__nr_entries(browser);
643 ui_browser__update_nr_entries(&browser->b, nr_entries);
645 if (warn_lost_event &&
646 (browser->hists->stats.nr_lost_warned !=
647 browser->hists->stats.nr_events[PERF_RECORD_LOST])) {
648 browser->hists->stats.nr_lost_warned =
649 browser->hists->stats.nr_events[PERF_RECORD_LOST];
650 ui_browser__warn_lost_events(&browser->b);
653 hist_browser__title(browser, title, sizeof(title));
654 ui_browser__show_title(&browser->b, title);
657 case 'D': { /* Debug */
659 struct hist_entry *h = rb_entry(browser->b.top,
660 struct hist_entry, rb_node);
662 ui_helpline__fpush("%d: nr_ent=(%d,%d), etl: %d, rows=%d, idx=%d, fve: idx=%d, row_off=%d, nrows=%d",
663 seq++, browser->b.nr_entries,
664 browser->hists->nr_entries,
665 browser->b.extra_title_lines,
669 h->row_offset, h->nr_rows);
673 /* Collapse the whole world. */
674 hist_browser__set_folding(browser, false);
677 /* Collapse the selected entry. */
678 hist_browser__set_folding_selected(browser, false);
681 /* Expand the whole world. */
682 hist_browser__set_folding(browser, true);
685 /* Expand the selected entry. */
686 hist_browser__set_folding_selected(browser, true);
689 browser->show_headers = !browser->show_headers;
690 hist_browser__update_rows(browser);
693 if (hist_browser__toggle_fold(browser))
701 ui_browser__hide(&browser->b);
705 struct callchain_print_arg {
706 /* for hists browser */
708 bool is_current_entry;
715 typedef void (*print_callchain_entry_fn)(struct hist_browser *browser,
716 struct callchain_list *chain,
717 const char *str, int offset,
719 struct callchain_print_arg *arg);
721 static void hist_browser__show_callchain_entry(struct hist_browser *browser,
722 struct callchain_list *chain,
723 const char *str, int offset,
725 struct callchain_print_arg *arg)
728 char folded_sign = callchain_list__folded(chain);
729 bool show_annotated = browser->show_dso && chain->ms.sym && symbol__annotation(chain->ms.sym)->src;
731 color = HE_COLORSET_NORMAL;
732 width = browser->b.width - (offset + 2);
733 if (ui_browser__is_current_entry(&browser->b, row)) {
734 browser->selection = &chain->ms;
735 color = HE_COLORSET_SELECTED;
736 arg->is_current_entry = true;
739 ui_browser__set_color(&browser->b, color);
740 ui_browser__gotorc(&browser->b, row, 0);
741 ui_browser__write_nstring(&browser->b, " ", offset);
742 ui_browser__printf(&browser->b, "%c", folded_sign);
743 ui_browser__write_graph(&browser->b, show_annotated ? SLSMG_RARROW_CHAR : ' ');
744 ui_browser__write_nstring(&browser->b, str, width);
747 static void hist_browser__fprintf_callchain_entry(struct hist_browser *b __maybe_unused,
748 struct callchain_list *chain,
749 const char *str, int offset,
750 unsigned short row __maybe_unused,
751 struct callchain_print_arg *arg)
753 char folded_sign = callchain_list__folded(chain);
755 arg->printed += fprintf(arg->fp, "%*s%c %s\n", offset, " ",
759 typedef bool (*check_output_full_fn)(struct hist_browser *browser,
762 static bool hist_browser__check_output_full(struct hist_browser *browser,
765 return browser->b.rows == row;
768 static bool hist_browser__check_dump_full(struct hist_browser *browser __maybe_unused,
769 unsigned short row __maybe_unused)
774 #define LEVEL_OFFSET_STEP 3
776 static int hist_browser__show_callchain_list(struct hist_browser *browser,
777 struct callchain_node *node,
778 struct callchain_list *chain,
779 unsigned short row, u64 total,
780 bool need_percent, int offset,
781 print_callchain_entry_fn print,
782 struct callchain_print_arg *arg)
784 char bf[1024], *alloc_str;
785 char buf[64], *alloc_str2;
789 if (arg->row_offset != 0) {
797 str = callchain_list__sym_name(chain, bf, sizeof(bf),
800 if (symbol_conf.show_branchflag_count) {
801 callchain_list_counts__printf_value(chain, NULL,
804 if (asprintf(&alloc_str2, "%s%s", str, buf) < 0)
805 str = "Not enough memory!";
811 callchain_node__scnprintf_value(node, buf, sizeof(buf),
814 if (asprintf(&alloc_str, "%s %s", buf, str) < 0)
815 str = "Not enough memory!";
820 print(browser, chain, str, offset, row, arg);
827 static bool check_percent_display(struct rb_node *node, u64 parent_total)
829 struct callchain_node *child;
837 child = rb_entry(node, struct callchain_node, rb_node);
838 return callchain_cumul_hits(child) != parent_total;
841 static int hist_browser__show_callchain_flat(struct hist_browser *browser,
842 struct rb_root *root,
843 unsigned short row, u64 total,
845 print_callchain_entry_fn print,
846 struct callchain_print_arg *arg,
847 check_output_full_fn is_output_full)
849 struct rb_node *node;
850 int first_row = row, offset = LEVEL_OFFSET_STEP;
853 node = rb_first(root);
854 need_percent = check_percent_display(node, parent_total);
857 struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);
858 struct rb_node *next = rb_next(node);
859 struct callchain_list *chain;
860 char folded_sign = ' ';
862 int extra_offset = 0;
864 list_for_each_entry(chain, &child->parent_val, list) {
865 bool was_first = first;
869 else if (need_percent)
870 extra_offset = LEVEL_OFFSET_STEP;
872 folded_sign = callchain_list__folded(chain);
874 row += hist_browser__show_callchain_list(browser, child,
876 was_first && need_percent,
877 offset + extra_offset,
880 if (is_output_full(browser, row))
883 if (folded_sign == '+')
887 list_for_each_entry(chain, &child->val, list) {
888 bool was_first = first;
892 else if (need_percent)
893 extra_offset = LEVEL_OFFSET_STEP;
895 folded_sign = callchain_list__folded(chain);
897 row += hist_browser__show_callchain_list(browser, child,
899 was_first && need_percent,
900 offset + extra_offset,
903 if (is_output_full(browser, row))
906 if (folded_sign == '+')
911 if (is_output_full(browser, row))
916 return row - first_row;
919 static char *hist_browser__folded_callchain_str(struct hist_browser *browser,
920 struct callchain_list *chain,
921 char *value_str, char *old_str)
927 str = callchain_list__sym_name(chain, bf, sizeof(bf),
930 if (asprintf(&new, "%s%s%s", old_str,
931 symbol_conf.field_sep ?: ";", str) < 0)
935 if (asprintf(&new, "%s %s", value_str, str) < 0)
938 if (asprintf(&new, "%s", str) < 0)
945 static int hist_browser__show_callchain_folded(struct hist_browser *browser,
946 struct rb_root *root,
947 unsigned short row, u64 total,
949 print_callchain_entry_fn print,
950 struct callchain_print_arg *arg,
951 check_output_full_fn is_output_full)
953 struct rb_node *node;
954 int first_row = row, offset = LEVEL_OFFSET_STEP;
957 node = rb_first(root);
958 need_percent = check_percent_display(node, parent_total);
961 struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);
962 struct rb_node *next = rb_next(node);
963 struct callchain_list *chain, *first_chain = NULL;
965 char *value_str = NULL, *value_str_alloc = NULL;
966 char *chain_str = NULL, *chain_str_alloc = NULL;
968 if (arg->row_offset != 0) {
976 callchain_node__scnprintf_value(child, buf, sizeof(buf), total);
977 if (asprintf(&value_str, "%s", buf) < 0) {
978 value_str = (char *)"<...>";
981 value_str_alloc = value_str;
984 list_for_each_entry(chain, &child->parent_val, list) {
985 chain_str = hist_browser__folded_callchain_str(browser,
986 chain, value_str, chain_str);
992 if (chain_str == NULL) {
993 chain_str = (char *)"Not enough memory!";
997 chain_str_alloc = chain_str;
1000 list_for_each_entry(chain, &child->val, list) {
1001 chain_str = hist_browser__folded_callchain_str(browser,
1002 chain, value_str, chain_str);
1005 first_chain = chain;
1008 if (chain_str == NULL) {
1009 chain_str = (char *)"Not enough memory!";
1013 chain_str_alloc = chain_str;
1017 print(browser, first_chain, chain_str, offset, row++, arg);
1018 free(value_str_alloc);
1019 free(chain_str_alloc);
1022 if (is_output_full(browser, row))
1027 return row - first_row;
1030 static int hist_browser__show_callchain_graph(struct hist_browser *browser,
1031 struct rb_root *root, int level,
1032 unsigned short row, u64 total,
1034 print_callchain_entry_fn print,
1035 struct callchain_print_arg *arg,
1036 check_output_full_fn is_output_full)
1038 struct rb_node *node;
1039 int first_row = row, offset = level * LEVEL_OFFSET_STEP;
1041 u64 percent_total = total;
1043 if (callchain_param.mode == CHAIN_GRAPH_REL)
1044 percent_total = parent_total;
1046 node = rb_first(root);
1047 need_percent = check_percent_display(node, parent_total);
1050 struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);
1051 struct rb_node *next = rb_next(node);
1052 struct callchain_list *chain;
1053 char folded_sign = ' ';
1055 int extra_offset = 0;
1057 list_for_each_entry(chain, &child->val, list) {
1058 bool was_first = first;
1062 else if (need_percent)
1063 extra_offset = LEVEL_OFFSET_STEP;
1065 folded_sign = callchain_list__folded(chain);
1067 row += hist_browser__show_callchain_list(browser, child,
1068 chain, row, percent_total,
1069 was_first && need_percent,
1070 offset + extra_offset,
1073 if (is_output_full(browser, row))
1076 if (folded_sign == '+')
1080 if (folded_sign == '-') {
1081 const int new_level = level + (extra_offset ? 2 : 1);
1083 row += hist_browser__show_callchain_graph(browser, &child->rb_root,
1084 new_level, row, total,
1085 child->children_hit,
1086 print, arg, is_output_full);
1088 if (is_output_full(browser, row))
1093 return row - first_row;
1096 static int hist_browser__show_callchain(struct hist_browser *browser,
1097 struct hist_entry *entry, int level,
1099 print_callchain_entry_fn print,
1100 struct callchain_print_arg *arg,
1101 check_output_full_fn is_output_full)
1103 u64 total = hists__total_period(entry->hists);
1107 if (symbol_conf.cumulate_callchain)
1108 parent_total = entry->stat_acc->period;
1110 parent_total = entry->stat.period;
1112 if (callchain_param.mode == CHAIN_FLAT) {
1113 printed = hist_browser__show_callchain_flat(browser,
1114 &entry->sorted_chain, row,
1115 total, parent_total, print, arg,
1117 } else if (callchain_param.mode == CHAIN_FOLDED) {
1118 printed = hist_browser__show_callchain_folded(browser,
1119 &entry->sorted_chain, row,
1120 total, parent_total, print, arg,
1123 printed = hist_browser__show_callchain_graph(browser,
1124 &entry->sorted_chain, level, row,
1125 total, parent_total, print, arg,
1129 if (arg->is_current_entry)
1130 browser->he_selection = entry;
1136 struct ui_browser *b;
1141 int __hpp__slsmg_color_printf(struct perf_hpp *hpp, const char *fmt, ...)
1143 struct hpp_arg *arg = hpp->ptr;
1148 va_start(args, fmt);
1149 len = va_arg(args, int);
1150 percent = va_arg(args, double);
1153 ui_browser__set_percent_color(arg->b, percent, arg->current_entry);
1155 ret = scnprintf(hpp->buf, hpp->size, fmt, len, percent);
1156 ui_browser__printf(arg->b, "%s", hpp->buf);
1161 #define __HPP_COLOR_PERCENT_FN(_type, _field) \
1162 static u64 __hpp_get_##_field(struct hist_entry *he) \
1164 return he->stat._field; \
1168 hist_browser__hpp_color_##_type(struct perf_hpp_fmt *fmt, \
1169 struct perf_hpp *hpp, \
1170 struct hist_entry *he) \
1172 return hpp__fmt(fmt, hpp, he, __hpp_get_##_field, " %*.2f%%", \
1173 __hpp__slsmg_color_printf, true); \
1176 #define __HPP_COLOR_ACC_PERCENT_FN(_type, _field) \
1177 static u64 __hpp_get_acc_##_field(struct hist_entry *he) \
1179 return he->stat_acc->_field; \
1183 hist_browser__hpp_color_##_type(struct perf_hpp_fmt *fmt, \
1184 struct perf_hpp *hpp, \
1185 struct hist_entry *he) \
1187 if (!symbol_conf.cumulate_callchain) { \
1188 struct hpp_arg *arg = hpp->ptr; \
1189 int len = fmt->user_len ?: fmt->len; \
1190 int ret = scnprintf(hpp->buf, hpp->size, \
1191 "%*s", len, "N/A"); \
1192 ui_browser__printf(arg->b, "%s", hpp->buf); \
1196 return hpp__fmt(fmt, hpp, he, __hpp_get_acc_##_field, \
1197 " %*.2f%%", __hpp__slsmg_color_printf, true); \
1200 __HPP_COLOR_PERCENT_FN(overhead, period)
1201 __HPP_COLOR_PERCENT_FN(overhead_sys, period_sys)
1202 __HPP_COLOR_PERCENT_FN(overhead_us, period_us)
1203 __HPP_COLOR_PERCENT_FN(overhead_guest_sys, period_guest_sys)
1204 __HPP_COLOR_PERCENT_FN(overhead_guest_us, period_guest_us)
1205 __HPP_COLOR_ACC_PERCENT_FN(overhead_acc, period)
1207 #undef __HPP_COLOR_PERCENT_FN
1208 #undef __HPP_COLOR_ACC_PERCENT_FN
1210 void hist_browser__init_hpp(void)
1212 perf_hpp__format[PERF_HPP__OVERHEAD].color =
1213 hist_browser__hpp_color_overhead;
1214 perf_hpp__format[PERF_HPP__OVERHEAD_SYS].color =
1215 hist_browser__hpp_color_overhead_sys;
1216 perf_hpp__format[PERF_HPP__OVERHEAD_US].color =
1217 hist_browser__hpp_color_overhead_us;
1218 perf_hpp__format[PERF_HPP__OVERHEAD_GUEST_SYS].color =
1219 hist_browser__hpp_color_overhead_guest_sys;
1220 perf_hpp__format[PERF_HPP__OVERHEAD_GUEST_US].color =
1221 hist_browser__hpp_color_overhead_guest_us;
1222 perf_hpp__format[PERF_HPP__OVERHEAD_ACC].color =
1223 hist_browser__hpp_color_overhead_acc;
1226 static int hist_browser__show_entry(struct hist_browser *browser,
1227 struct hist_entry *entry,
1231 int width = browser->b.width;
1232 char folded_sign = ' ';
1233 bool current_entry = ui_browser__is_current_entry(&browser->b, row);
1234 off_t row_offset = entry->row_offset;
1236 struct perf_hpp_fmt *fmt;
1238 if (current_entry) {
1239 browser->he_selection = entry;
1240 browser->selection = &entry->ms;
1243 if (symbol_conf.use_callchain) {
1244 hist_entry__init_have_children(entry);
1245 folded_sign = hist_entry__folded(entry);
1248 if (row_offset == 0) {
1249 struct hpp_arg arg = {
1251 .folded_sign = folded_sign,
1252 .current_entry = current_entry,
1256 ui_browser__gotorc(&browser->b, row, 0);
1258 hists__for_each_format(browser->hists, fmt) {
1260 struct perf_hpp hpp = {
1266 if (perf_hpp__should_skip(fmt, entry->hists) ||
1267 column++ < browser->b.horiz_scroll)
1270 if (current_entry && browser->b.navkeypressed) {
1271 ui_browser__set_color(&browser->b,
1272 HE_COLORSET_SELECTED);
1274 ui_browser__set_color(&browser->b,
1275 HE_COLORSET_NORMAL);
1279 if (symbol_conf.use_callchain) {
1280 ui_browser__printf(&browser->b, "%c ", folded_sign);
1285 ui_browser__printf(&browser->b, " ");
1290 int ret = fmt->color(fmt, &hpp, entry);
1291 hist_entry__snprintf_alignment(entry, &hpp, fmt, ret);
1293 * fmt->color() already used ui_browser to
1294 * print the non alignment bits, skip it (+ret):
1296 ui_browser__printf(&browser->b, "%s", s + ret);
1298 hist_entry__snprintf_alignment(entry, &hpp, fmt, fmt->entry(fmt, &hpp, entry));
1299 ui_browser__printf(&browser->b, "%s", s);
1301 width -= hpp.buf - s;
1304 /* The scroll bar isn't being used */
1305 if (!browser->b.navkeypressed)
1308 ui_browser__write_nstring(&browser->b, "", width);
1315 if (folded_sign == '-' && row != browser->b.rows) {
1316 struct callchain_print_arg arg = {
1317 .row_offset = row_offset,
1318 .is_current_entry = current_entry,
1321 printed += hist_browser__show_callchain(browser,
1323 hist_browser__show_callchain_entry,
1325 hist_browser__check_output_full);
1331 static int hist_browser__show_hierarchy_entry(struct hist_browser *browser,
1332 struct hist_entry *entry,
1337 int width = browser->b.width;
1338 char folded_sign = ' ';
1339 bool current_entry = ui_browser__is_current_entry(&browser->b, row);
1340 off_t row_offset = entry->row_offset;
1342 struct perf_hpp_fmt *fmt;
1343 struct perf_hpp_list_node *fmt_node;
1344 struct hpp_arg arg = {
1346 .current_entry = current_entry,
1349 int hierarchy_indent = (entry->hists->nr_hpp_node - 2) * HIERARCHY_INDENT;
1351 if (current_entry) {
1352 browser->he_selection = entry;
1353 browser->selection = &entry->ms;
1356 hist_entry__init_have_children(entry);
1357 folded_sign = hist_entry__folded(entry);
1358 arg.folded_sign = folded_sign;
1360 if (entry->leaf && row_offset) {
1362 goto show_callchain;
1365 ui_browser__gotorc(&browser->b, row, 0);
1367 if (current_entry && browser->b.navkeypressed)
1368 ui_browser__set_color(&browser->b, HE_COLORSET_SELECTED);
1370 ui_browser__set_color(&browser->b, HE_COLORSET_NORMAL);
1372 ui_browser__write_nstring(&browser->b, "", level * HIERARCHY_INDENT);
1373 width -= level * HIERARCHY_INDENT;
1375 /* the first hpp_list_node is for overhead columns */
1376 fmt_node = list_first_entry(&entry->hists->hpp_formats,
1377 struct perf_hpp_list_node, list);
1378 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
1380 struct perf_hpp hpp = {
1386 if (perf_hpp__should_skip(fmt, entry->hists) ||
1387 column++ < browser->b.horiz_scroll)
1390 if (current_entry && browser->b.navkeypressed) {
1391 ui_browser__set_color(&browser->b,
1392 HE_COLORSET_SELECTED);
1394 ui_browser__set_color(&browser->b,
1395 HE_COLORSET_NORMAL);
1399 ui_browser__printf(&browser->b, "%c ", folded_sign);
1403 ui_browser__printf(&browser->b, " ");
1408 int ret = fmt->color(fmt, &hpp, entry);
1409 hist_entry__snprintf_alignment(entry, &hpp, fmt, ret);
1411 * fmt->color() already used ui_browser to
1412 * print the non alignment bits, skip it (+ret):
1414 ui_browser__printf(&browser->b, "%s", s + ret);
1416 int ret = fmt->entry(fmt, &hpp, entry);
1417 hist_entry__snprintf_alignment(entry, &hpp, fmt, ret);
1418 ui_browser__printf(&browser->b, "%s", s);
1420 width -= hpp.buf - s;
1424 ui_browser__write_nstring(&browser->b, "", hierarchy_indent);
1425 width -= hierarchy_indent;
1428 if (column >= browser->b.horiz_scroll) {
1430 struct perf_hpp hpp = {
1436 if (current_entry && browser->b.navkeypressed) {
1437 ui_browser__set_color(&browser->b,
1438 HE_COLORSET_SELECTED);
1440 ui_browser__set_color(&browser->b,
1441 HE_COLORSET_NORMAL);
1444 perf_hpp_list__for_each_format(entry->hpp_list, fmt) {
1446 ui_browser__printf(&browser->b, "%c ", folded_sign);
1449 ui_browser__write_nstring(&browser->b, "", 2);
1455 * No need to call hist_entry__snprintf_alignment()
1456 * since this fmt is always the last column in the
1460 width -= fmt->color(fmt, &hpp, entry);
1464 width -= fmt->entry(fmt, &hpp, entry);
1465 ui_browser__printf(&browser->b, "%s", ltrim(s));
1467 while (isspace(s[i++]))
1473 /* The scroll bar isn't being used */
1474 if (!browser->b.navkeypressed)
1477 ui_browser__write_nstring(&browser->b, "", width);
1483 if (entry->leaf && folded_sign == '-' && row != browser->b.rows) {
1484 struct callchain_print_arg carg = {
1485 .row_offset = row_offset,
1488 printed += hist_browser__show_callchain(browser, entry,
1490 hist_browser__show_callchain_entry, &carg,
1491 hist_browser__check_output_full);
1497 static int hist_browser__show_no_entry(struct hist_browser *browser,
1498 unsigned short row, int level)
1500 int width = browser->b.width;
1501 bool current_entry = ui_browser__is_current_entry(&browser->b, row);
1505 struct perf_hpp_fmt *fmt;
1506 struct perf_hpp_list_node *fmt_node;
1507 int indent = browser->hists->nr_hpp_node - 2;
1509 if (current_entry) {
1510 browser->he_selection = NULL;
1511 browser->selection = NULL;
1514 ui_browser__gotorc(&browser->b, row, 0);
1516 if (current_entry && browser->b.navkeypressed)
1517 ui_browser__set_color(&browser->b, HE_COLORSET_SELECTED);
1519 ui_browser__set_color(&browser->b, HE_COLORSET_NORMAL);
1521 ui_browser__write_nstring(&browser->b, "", level * HIERARCHY_INDENT);
1522 width -= level * HIERARCHY_INDENT;
1524 /* the first hpp_list_node is for overhead columns */
1525 fmt_node = list_first_entry(&browser->hists->hpp_formats,
1526 struct perf_hpp_list_node, list);
1527 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
1528 if (perf_hpp__should_skip(fmt, browser->hists) ||
1529 column++ < browser->b.horiz_scroll)
1532 ret = fmt->width(fmt, NULL, browser->hists);
1535 /* for folded sign */
1539 /* space between columns */
1543 ui_browser__write_nstring(&browser->b, "", ret);
1547 ui_browser__write_nstring(&browser->b, "", indent * HIERARCHY_INDENT);
1548 width -= indent * HIERARCHY_INDENT;
1550 if (column >= browser->b.horiz_scroll) {
1553 ret = snprintf(buf, sizeof(buf), "no entry >= %.2f%%", browser->min_pcnt);
1554 ui_browser__printf(&browser->b, " %s", buf);
1558 /* The scroll bar isn't being used */
1559 if (!browser->b.navkeypressed)
1562 ui_browser__write_nstring(&browser->b, "", width);
1566 static int advance_hpp_check(struct perf_hpp *hpp, int inc)
1568 advance_hpp(hpp, inc);
1569 return hpp->size <= 0;
1573 hists_browser__scnprintf_headers(struct hist_browser *browser, char *buf,
1574 size_t size, int line)
1576 struct hists *hists = browser->hists;
1577 struct perf_hpp dummy_hpp = {
1581 struct perf_hpp_fmt *fmt;
1586 if (symbol_conf.use_callchain) {
1587 ret = scnprintf(buf, size, " ");
1588 if (advance_hpp_check(&dummy_hpp, ret))
1592 hists__for_each_format(browser->hists, fmt) {
1593 if (perf_hpp__should_skip(fmt, hists) || column++ < browser->b.horiz_scroll)
1596 ret = fmt->header(fmt, &dummy_hpp, hists, line, &span);
1597 if (advance_hpp_check(&dummy_hpp, ret))
1603 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, " ");
1604 if (advance_hpp_check(&dummy_hpp, ret))
1611 static int hists_browser__scnprintf_hierarchy_headers(struct hist_browser *browser, char *buf, size_t size)
1613 struct hists *hists = browser->hists;
1614 struct perf_hpp dummy_hpp = {
1618 struct perf_hpp_fmt *fmt;
1619 struct perf_hpp_list_node *fmt_node;
1622 int indent = hists->nr_hpp_node - 2;
1623 bool first_node, first_col;
1625 ret = scnprintf(buf, size, " ");
1626 if (advance_hpp_check(&dummy_hpp, ret))
1630 /* the first hpp_list_node is for overhead columns */
1631 fmt_node = list_first_entry(&hists->hpp_formats,
1632 struct perf_hpp_list_node, list);
1633 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
1634 if (column++ < browser->b.horiz_scroll)
1637 ret = fmt->header(fmt, &dummy_hpp, hists, 0, NULL);
1638 if (advance_hpp_check(&dummy_hpp, ret))
1641 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, " ");
1642 if (advance_hpp_check(&dummy_hpp, ret))
1649 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, "%*s",
1650 indent * HIERARCHY_INDENT, "");
1651 if (advance_hpp_check(&dummy_hpp, ret))
1656 list_for_each_entry_continue(fmt_node, &hists->hpp_formats, list) {
1658 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, " / ");
1659 if (advance_hpp_check(&dummy_hpp, ret))
1665 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
1668 if (perf_hpp__should_skip(fmt, hists))
1672 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, "+");
1673 if (advance_hpp_check(&dummy_hpp, ret))
1678 ret = fmt->header(fmt, &dummy_hpp, hists, 0, NULL);
1679 dummy_hpp.buf[ret] = '\0';
1681 start = trim(dummy_hpp.buf);
1682 ret = strlen(start);
1684 if (start != dummy_hpp.buf)
1685 memmove(dummy_hpp.buf, start, ret + 1);
1687 if (advance_hpp_check(&dummy_hpp, ret))
1695 static void hists_browser__hierarchy_headers(struct hist_browser *browser)
1699 hists_browser__scnprintf_hierarchy_headers(browser, headers,
1702 ui_browser__gotorc(&browser->b, 0, 0);
1703 ui_browser__set_color(&browser->b, HE_COLORSET_ROOT);
1704 ui_browser__write_nstring(&browser->b, headers, browser->b.width + 1);
1707 static void hists_browser__headers(struct hist_browser *browser)
1709 struct hists *hists = browser->hists;
1710 struct perf_hpp_list *hpp_list = hists->hpp_list;
1714 for (line = 0; line < hpp_list->nr_header_lines; line++) {
1717 hists_browser__scnprintf_headers(browser, headers,
1718 sizeof(headers), line);
1720 ui_browser__gotorc_title(&browser->b, line, 0);
1721 ui_browser__set_color(&browser->b, HE_COLORSET_ROOT);
1722 ui_browser__write_nstring(&browser->b, headers, browser->b.width + 1);
1726 static void hist_browser__show_headers(struct hist_browser *browser)
1728 if (symbol_conf.report_hierarchy)
1729 hists_browser__hierarchy_headers(browser);
1731 hists_browser__headers(browser);
1734 static void ui_browser__hists_init_top(struct ui_browser *browser)
1736 if (browser->top == NULL) {
1737 struct hist_browser *hb;
1739 hb = container_of(browser, struct hist_browser, b);
1740 browser->top = rb_first(&hb->hists->entries);
1744 static unsigned int hist_browser__refresh(struct ui_browser *browser)
1748 struct hist_browser *hb = container_of(browser, struct hist_browser, b);
1750 if (hb->show_headers)
1751 hist_browser__show_headers(hb);
1753 ui_browser__hists_init_top(browser);
1754 hb->he_selection = NULL;
1755 hb->selection = NULL;
1757 for (nd = browser->top; nd; nd = rb_hierarchy_next(nd)) {
1758 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1762 /* let it move to sibling */
1763 h->unfolded = false;
1767 percent = hist_entry__get_percent_limit(h);
1768 if (percent < hb->min_pcnt)
1771 if (symbol_conf.report_hierarchy) {
1772 row += hist_browser__show_hierarchy_entry(hb, h, row,
1774 if (row == browser->rows)
1777 if (h->has_no_entry) {
1778 hist_browser__show_no_entry(hb, row, h->depth + 1);
1782 row += hist_browser__show_entry(hb, h, row);
1785 if (row == browser->rows)
1792 static struct rb_node *hists__filter_entries(struct rb_node *nd,
1795 while (nd != NULL) {
1796 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1797 float percent = hist_entry__get_percent_limit(h);
1799 if (!h->filtered && percent >= min_pcnt)
1803 * If it's filtered, its all children also were filtered.
1804 * So move to sibling node.
1809 nd = rb_hierarchy_next(nd);
1815 static struct rb_node *hists__filter_prev_entries(struct rb_node *nd,
1818 while (nd != NULL) {
1819 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1820 float percent = hist_entry__get_percent_limit(h);
1822 if (!h->filtered && percent >= min_pcnt)
1825 nd = rb_hierarchy_prev(nd);
1831 static void ui_browser__hists_seek(struct ui_browser *browser,
1832 off_t offset, int whence)
1834 struct hist_entry *h;
1837 struct hist_browser *hb;
1839 hb = container_of(browser, struct hist_browser, b);
1841 if (browser->nr_entries == 0)
1844 ui_browser__hists_init_top(browser);
1848 nd = hists__filter_entries(rb_first(browser->entries),
1855 nd = rb_hierarchy_last(rb_last(browser->entries));
1856 nd = hists__filter_prev_entries(nd, hb->min_pcnt);
1864 * Moves not relative to the first visible entry invalidates its
1867 h = rb_entry(browser->top, struct hist_entry, rb_node);
1871 * Here we have to check if nd is expanded (+), if it is we can't go
1872 * the next top level hist_entry, instead we must compute an offset of
1873 * what _not_ to show and not change the first visible entry.
1875 * This offset increments when we are going from top to bottom and
1876 * decreases when we're going from bottom to top.
1878 * As we don't have backpointers to the top level in the callchains
1879 * structure, we need to always print the whole hist_entry callchain,
1880 * skipping the first ones that are before the first visible entry
1881 * and stop when we printed enough lines to fill the screen.
1889 h = rb_entry(nd, struct hist_entry, rb_node);
1890 if (h->unfolded && h->leaf) {
1891 u16 remaining = h->nr_rows - h->row_offset;
1892 if (offset > remaining) {
1893 offset -= remaining;
1896 h->row_offset += offset;
1902 nd = hists__filter_entries(rb_hierarchy_next(nd),
1908 } while (offset != 0);
1909 } else if (offset < 0) {
1911 h = rb_entry(nd, struct hist_entry, rb_node);
1912 if (h->unfolded && h->leaf) {
1914 if (-offset > h->row_offset) {
1915 offset += h->row_offset;
1918 h->row_offset += offset;
1924 if (-offset > h->nr_rows) {
1925 offset += h->nr_rows;
1928 h->row_offset = h->nr_rows + offset;
1936 nd = hists__filter_prev_entries(rb_hierarchy_prev(nd),
1944 * Last unfiltered hist_entry, check if it is
1945 * unfolded, if it is then we should have
1946 * row_offset at its last entry.
1948 h = rb_entry(nd, struct hist_entry, rb_node);
1949 if (h->unfolded && h->leaf)
1950 h->row_offset = h->nr_rows;
1957 h = rb_entry(nd, struct hist_entry, rb_node);
1962 static int hist_browser__fprintf_callchain(struct hist_browser *browser,
1963 struct hist_entry *he, FILE *fp,
1966 struct callchain_print_arg arg = {
1970 hist_browser__show_callchain(browser, he, level, 0,
1971 hist_browser__fprintf_callchain_entry, &arg,
1972 hist_browser__check_dump_full);
1976 static int hist_browser__fprintf_entry(struct hist_browser *browser,
1977 struct hist_entry *he, FILE *fp)
1981 char folded_sign = ' ';
1982 struct perf_hpp hpp = {
1986 struct perf_hpp_fmt *fmt;
1990 if (symbol_conf.use_callchain) {
1991 folded_sign = hist_entry__folded(he);
1992 printed += fprintf(fp, "%c ", folded_sign);
1995 hists__for_each_format(browser->hists, fmt) {
1996 if (perf_hpp__should_skip(fmt, he->hists))
2000 ret = scnprintf(hpp.buf, hpp.size, " ");
2001 advance_hpp(&hpp, ret);
2005 ret = fmt->entry(fmt, &hpp, he);
2006 ret = hist_entry__snprintf_alignment(he, &hpp, fmt, ret);
2007 advance_hpp(&hpp, ret);
2009 printed += fprintf(fp, "%s\n", s);
2011 if (folded_sign == '-')
2012 printed += hist_browser__fprintf_callchain(browser, he, fp, 1);
2018 static int hist_browser__fprintf_hierarchy_entry(struct hist_browser *browser,
2019 struct hist_entry *he,
2020 FILE *fp, int level)
2024 char folded_sign = ' ';
2025 struct perf_hpp hpp = {
2029 struct perf_hpp_fmt *fmt;
2030 struct perf_hpp_list_node *fmt_node;
2033 int hierarchy_indent = (he->hists->nr_hpp_node - 2) * HIERARCHY_INDENT;
2035 printed = fprintf(fp, "%*s", level * HIERARCHY_INDENT, "");
2037 folded_sign = hist_entry__folded(he);
2038 printed += fprintf(fp, "%c", folded_sign);
2040 /* the first hpp_list_node is for overhead columns */
2041 fmt_node = list_first_entry(&he->hists->hpp_formats,
2042 struct perf_hpp_list_node, list);
2043 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
2045 ret = scnprintf(hpp.buf, hpp.size, " ");
2046 advance_hpp(&hpp, ret);
2050 ret = fmt->entry(fmt, &hpp, he);
2051 advance_hpp(&hpp, ret);
2054 ret = scnprintf(hpp.buf, hpp.size, "%*s", hierarchy_indent, "");
2055 advance_hpp(&hpp, ret);
2057 perf_hpp_list__for_each_format(he->hpp_list, fmt) {
2058 ret = scnprintf(hpp.buf, hpp.size, " ");
2059 advance_hpp(&hpp, ret);
2061 ret = fmt->entry(fmt, &hpp, he);
2062 advance_hpp(&hpp, ret);
2065 printed += fprintf(fp, "%s\n", rtrim(s));
2067 if (he->leaf && folded_sign == '-') {
2068 printed += hist_browser__fprintf_callchain(browser, he, fp,
2075 static int hist_browser__fprintf(struct hist_browser *browser, FILE *fp)
2077 struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries),
2082 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2084 if (symbol_conf.report_hierarchy) {
2085 printed += hist_browser__fprintf_hierarchy_entry(browser,
2089 printed += hist_browser__fprintf_entry(browser, h, fp);
2092 nd = hists__filter_entries(rb_hierarchy_next(nd),
2099 static int hist_browser__dump(struct hist_browser *browser)
2105 scnprintf(filename, sizeof(filename), "perf.hist.%d", browser->print_seq);
2106 if (access(filename, F_OK))
2109 * XXX: Just an arbitrary lazy upper limit
2111 if (++browser->print_seq == 8192) {
2112 ui_helpline__fpush("Too many perf.hist.N files, nothing written!");
2117 fp = fopen(filename, "w");
2120 const char *err = str_error_r(errno, bf, sizeof(bf));
2121 ui_helpline__fpush("Couldn't write to %s: %s", filename, err);
2125 ++browser->print_seq;
2126 hist_browser__fprintf(browser, fp);
2128 ui_helpline__fpush("%s written!", filename);
2133 void hist_browser__init(struct hist_browser *browser,
2134 struct hists *hists)
2136 struct perf_hpp_fmt *fmt;
2138 browser->hists = hists;
2139 browser->b.refresh = hist_browser__refresh;
2140 browser->b.refresh_dimensions = hist_browser__refresh_dimensions;
2141 browser->b.seek = ui_browser__hists_seek;
2142 browser->b.use_navkeypressed = true;
2143 browser->show_headers = symbol_conf.show_hist_headers;
2144 hist_browser__set_title_space(browser);
2146 if (symbol_conf.report_hierarchy) {
2147 struct perf_hpp_list_node *fmt_node;
2149 /* count overhead columns (in the first node) */
2150 fmt_node = list_first_entry(&hists->hpp_formats,
2151 struct perf_hpp_list_node, list);
2152 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt)
2153 ++browser->b.columns;
2155 /* add a single column for whole hierarchy sort keys*/
2156 ++browser->b.columns;
2158 hists__for_each_format(hists, fmt)
2159 ++browser->b.columns;
2162 hists__reset_column_width(hists);
2165 struct hist_browser *hist_browser__new(struct hists *hists)
2167 struct hist_browser *browser = zalloc(sizeof(*browser));
2170 hist_browser__init(browser, hists);
2175 static struct hist_browser *
2176 perf_evsel_browser__new(struct perf_evsel *evsel,
2177 struct hist_browser_timer *hbt,
2178 struct perf_env *env)
2180 struct hist_browser *browser = hist_browser__new(evsel__hists(evsel));
2185 browser->title = hists_browser__scnprintf_title;
2190 void hist_browser__delete(struct hist_browser *browser)
2195 static struct hist_entry *hist_browser__selected_entry(struct hist_browser *browser)
2197 return browser->he_selection;
2200 static struct thread *hist_browser__selected_thread(struct hist_browser *browser)
2202 return browser->he_selection->thread;
2205 /* Check whether the browser is for 'top' or 'report' */
2206 static inline bool is_report_browser(void *timer)
2208 return timer == NULL;
2211 static int hists_browser__scnprintf_title(struct hist_browser *browser, char *bf, size_t size)
2213 struct hist_browser_timer *hbt = browser->hbt;
2214 int printed = __hists__scnprintf_title(browser->hists, bf, size, !is_report_browser(hbt));
2216 if (!is_report_browser(hbt)) {
2217 struct perf_top *top = hbt->arg;
2220 printed += scnprintf(bf + printed, size - printed, " [z]");
2226 static inline void free_popup_options(char **options, int n)
2230 for (i = 0; i < n; ++i)
2235 * Only runtime switching of perf data file will make "input_name" point
2236 * to a malloced buffer. So add "is_input_name_malloced" flag to decide
2237 * whether we need to call free() for current "input_name" during the switch.
2239 static bool is_input_name_malloced = false;
2241 static int switch_data_file(void)
2243 char *pwd, *options[32], *abs_path[32], *tmp;
2245 int nr_options = 0, choice = -1, ret = -1;
2246 struct dirent *dent;
2248 pwd = getenv("PWD");
2252 pwd_dir = opendir(pwd);
2256 memset(options, 0, sizeof(options));
2257 memset(abs_path, 0, sizeof(abs_path));
2259 while ((dent = readdir(pwd_dir))) {
2260 char path[PATH_MAX];
2262 char *name = dent->d_name;
2265 if (!(dent->d_type == DT_REG))
2268 snprintf(path, sizeof(path), "%s/%s", pwd, name);
2270 file = fopen(path, "r");
2274 if (fread(&magic, 1, 8, file) < 8)
2275 goto close_file_and_continue;
2277 if (is_perf_magic(magic)) {
2278 options[nr_options] = strdup(name);
2279 if (!options[nr_options])
2280 goto close_file_and_continue;
2282 abs_path[nr_options] = strdup(path);
2283 if (!abs_path[nr_options]) {
2284 zfree(&options[nr_options]);
2285 ui__warning("Can't search all data files due to memory shortage.\n");
2293 close_file_and_continue:
2295 if (nr_options >= 32) {
2296 ui__warning("Too many perf data files in PWD!\n"
2297 "Only the first 32 files will be listed.\n");
2304 choice = ui__popup_menu(nr_options, options);
2305 if (choice < nr_options && choice >= 0) {
2306 tmp = strdup(abs_path[choice]);
2308 if (is_input_name_malloced)
2309 free((void *)input_name);
2311 is_input_name_malloced = true;
2314 ui__warning("Data switch failed due to memory shortage!\n");
2318 free_popup_options(options, nr_options);
2319 free_popup_options(abs_path, nr_options);
2323 struct popup_action {
2324 struct thread *thread;
2325 struct map_symbol ms;
2328 int (*fn)(struct hist_browser *browser, struct popup_action *act);
2332 do_annotate(struct hist_browser *browser, struct popup_action *act)
2334 struct perf_evsel *evsel;
2335 struct annotation *notes;
2336 struct hist_entry *he;
2339 if (!objdump_path && perf_env__lookup_objdump(browser->env))
2342 notes = symbol__annotation(act->ms.sym);
2346 evsel = hists_to_evsel(browser->hists);
2347 err = map_symbol__tui_annotate(&act->ms, evsel, browser->hbt);
2348 he = hist_browser__selected_entry(browser);
2350 * offer option to annotate the other branch source or target
2351 * (if they exists) when returning from annotate
2353 if ((err == 'q' || err == CTRL('c')) && he->branch_info)
2356 ui_browser__update_nr_entries(&browser->b, browser->hists->nr_entries);
2358 ui_browser__handle_resize(&browser->b);
2363 add_annotate_opt(struct hist_browser *browser __maybe_unused,
2364 struct popup_action *act, char **optstr,
2365 struct map *map, struct symbol *sym)
2367 if (sym == NULL || map->dso->annotate_warned)
2370 if (asprintf(optstr, "Annotate %s", sym->name) < 0)
2375 act->fn = do_annotate;
2380 do_zoom_thread(struct hist_browser *browser, struct popup_action *act)
2382 struct thread *thread = act->thread;
2384 if ((!hists__has(browser->hists, thread) &&
2385 !hists__has(browser->hists, comm)) || thread == NULL)
2388 if (browser->hists->thread_filter) {
2389 pstack__remove(browser->pstack, &browser->hists->thread_filter);
2390 perf_hpp__set_elide(HISTC_THREAD, false);
2391 thread__zput(browser->hists->thread_filter);
2394 if (hists__has(browser->hists, thread)) {
2395 ui_helpline__fpush("To zoom out press ESC or ENTER + \"Zoom out of %s(%d) thread\"",
2396 thread->comm_set ? thread__comm_str(thread) : "",
2399 ui_helpline__fpush("To zoom out press ESC or ENTER + \"Zoom out of %s thread\"",
2400 thread->comm_set ? thread__comm_str(thread) : "");
2403 browser->hists->thread_filter = thread__get(thread);
2404 perf_hpp__set_elide(HISTC_THREAD, false);
2405 pstack__push(browser->pstack, &browser->hists->thread_filter);
2408 hists__filter_by_thread(browser->hists);
2409 hist_browser__reset(browser);
2414 add_thread_opt(struct hist_browser *browser, struct popup_action *act,
2415 char **optstr, struct thread *thread)
2419 if ((!hists__has(browser->hists, thread) &&
2420 !hists__has(browser->hists, comm)) || thread == NULL)
2423 if (hists__has(browser->hists, thread)) {
2424 ret = asprintf(optstr, "Zoom %s %s(%d) thread",
2425 browser->hists->thread_filter ? "out of" : "into",
2426 thread->comm_set ? thread__comm_str(thread) : "",
2429 ret = asprintf(optstr, "Zoom %s %s thread",
2430 browser->hists->thread_filter ? "out of" : "into",
2431 thread->comm_set ? thread__comm_str(thread) : "");
2436 act->thread = thread;
2437 act->fn = do_zoom_thread;
2442 do_zoom_dso(struct hist_browser *browser, struct popup_action *act)
2444 struct map *map = act->ms.map;
2446 if (!hists__has(browser->hists, dso) || map == NULL)
2449 if (browser->hists->dso_filter) {
2450 pstack__remove(browser->pstack, &browser->hists->dso_filter);
2451 perf_hpp__set_elide(HISTC_DSO, false);
2452 browser->hists->dso_filter = NULL;
2455 ui_helpline__fpush("To zoom out press ESC or ENTER + \"Zoom out of %s DSO\"",
2456 __map__is_kernel(map) ? "the Kernel" : map->dso->short_name);
2457 browser->hists->dso_filter = map->dso;
2458 perf_hpp__set_elide(HISTC_DSO, true);
2459 pstack__push(browser->pstack, &browser->hists->dso_filter);
2462 hists__filter_by_dso(browser->hists);
2463 hist_browser__reset(browser);
2468 add_dso_opt(struct hist_browser *browser, struct popup_action *act,
2469 char **optstr, struct map *map)
2471 if (!hists__has(browser->hists, dso) || map == NULL)
2474 if (asprintf(optstr, "Zoom %s %s DSO",
2475 browser->hists->dso_filter ? "out of" : "into",
2476 __map__is_kernel(map) ? "the Kernel" : map->dso->short_name) < 0)
2480 act->fn = do_zoom_dso;
2485 do_browse_map(struct hist_browser *browser __maybe_unused,
2486 struct popup_action *act)
2488 map__browse(act->ms.map);
2493 add_map_opt(struct hist_browser *browser,
2494 struct popup_action *act, char **optstr, struct map *map)
2496 if (!hists__has(browser->hists, dso) || map == NULL)
2499 if (asprintf(optstr, "Browse map details") < 0)
2503 act->fn = do_browse_map;
2508 do_run_script(struct hist_browser *browser __maybe_unused,
2509 struct popup_action *act)
2511 char script_opt[64];
2512 memset(script_opt, 0, sizeof(script_opt));
2515 scnprintf(script_opt, sizeof(script_opt), " -c %s ",
2516 thread__comm_str(act->thread));
2517 } else if (act->ms.sym) {
2518 scnprintf(script_opt, sizeof(script_opt), " -S %s ",
2522 script_browse(script_opt);
2527 add_script_opt(struct hist_browser *browser __maybe_unused,
2528 struct popup_action *act, char **optstr,
2529 struct thread *thread, struct symbol *sym)
2532 if (asprintf(optstr, "Run scripts for samples of thread [%s]",
2533 thread__comm_str(thread)) < 0)
2536 if (asprintf(optstr, "Run scripts for samples of symbol [%s]",
2540 if (asprintf(optstr, "Run scripts for all samples") < 0)
2544 act->thread = thread;
2546 act->fn = do_run_script;
2551 do_switch_data(struct hist_browser *browser __maybe_unused,
2552 struct popup_action *act __maybe_unused)
2554 if (switch_data_file()) {
2555 ui__warning("Won't switch the data files due to\n"
2556 "no valid data file get selected!\n");
2560 return K_SWITCH_INPUT_DATA;
2564 add_switch_opt(struct hist_browser *browser,
2565 struct popup_action *act, char **optstr)
2567 if (!is_report_browser(browser->hbt))
2570 if (asprintf(optstr, "Switch to another data file in PWD") < 0)
2573 act->fn = do_switch_data;
2578 do_exit_browser(struct hist_browser *browser __maybe_unused,
2579 struct popup_action *act __maybe_unused)
2585 add_exit_opt(struct hist_browser *browser __maybe_unused,
2586 struct popup_action *act, char **optstr)
2588 if (asprintf(optstr, "Exit") < 0)
2591 act->fn = do_exit_browser;
2596 do_zoom_socket(struct hist_browser *browser, struct popup_action *act)
2598 if (!hists__has(browser->hists, socket) || act->socket < 0)
2601 if (browser->hists->socket_filter > -1) {
2602 pstack__remove(browser->pstack, &browser->hists->socket_filter);
2603 browser->hists->socket_filter = -1;
2604 perf_hpp__set_elide(HISTC_SOCKET, false);
2606 browser->hists->socket_filter = act->socket;
2607 perf_hpp__set_elide(HISTC_SOCKET, true);
2608 pstack__push(browser->pstack, &browser->hists->socket_filter);
2611 hists__filter_by_socket(browser->hists);
2612 hist_browser__reset(browser);
2617 add_socket_opt(struct hist_browser *browser, struct popup_action *act,
2618 char **optstr, int socket_id)
2620 if (!hists__has(browser->hists, socket) || socket_id < 0)
2623 if (asprintf(optstr, "Zoom %s Processor Socket %d",
2624 (browser->hists->socket_filter > -1) ? "out of" : "into",
2628 act->socket = socket_id;
2629 act->fn = do_zoom_socket;
2633 static void hist_browser__update_nr_entries(struct hist_browser *hb)
2636 struct rb_node *nd = rb_first(&hb->hists->entries);
2638 if (hb->min_pcnt == 0 && !symbol_conf.report_hierarchy) {
2639 hb->nr_non_filtered_entries = hb->hists->nr_non_filtered_entries;
2643 while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {
2645 nd = rb_hierarchy_next(nd);
2648 hb->nr_non_filtered_entries = nr_entries;
2649 hb->nr_hierarchy_entries = nr_entries;
2652 static void hist_browser__update_percent_limit(struct hist_browser *hb,
2655 struct hist_entry *he;
2656 struct rb_node *nd = rb_first(&hb->hists->entries);
2657 u64 total = hists__total_period(hb->hists);
2658 u64 min_callchain_hits = total * (percent / 100);
2660 hb->min_pcnt = callchain_param.min_percent = percent;
2662 while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {
2663 he = rb_entry(nd, struct hist_entry, rb_node);
2665 if (he->has_no_entry) {
2666 he->has_no_entry = false;
2670 if (!he->leaf || !symbol_conf.use_callchain)
2673 if (callchain_param.mode == CHAIN_GRAPH_REL) {
2674 total = he->stat.period;
2676 if (symbol_conf.cumulate_callchain)
2677 total = he->stat_acc->period;
2679 min_callchain_hits = total * (percent / 100);
2682 callchain_param.sort(&he->sorted_chain, he->callchain,
2683 min_callchain_hits, &callchain_param);
2686 nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD);
2688 /* force to re-evaluate folding state of callchains */
2689 he->init_have_children = false;
2690 hist_entry__set_folding(he, hb, false);
2694 static int perf_evsel__hists_browse(struct perf_evsel *evsel, int nr_events,
2695 const char *helpline,
2697 struct hist_browser_timer *hbt,
2699 struct perf_env *env,
2700 bool warn_lost_event)
2702 struct hists *hists = evsel__hists(evsel);
2703 struct hist_browser *browser = perf_evsel_browser__new(evsel, hbt, env);
2704 struct branch_info *bi;
2705 #define MAX_OPTIONS 16
2706 char *options[MAX_OPTIONS];
2707 struct popup_action actions[MAX_OPTIONS];
2711 int delay_secs = hbt ? hbt->refresh : 0;
2713 #define HIST_BROWSER_HELP_COMMON \
2714 "h/?/F1 Show this window\n" \
2716 "PGDN/SPACE Navigate\n" \
2717 "q/ESC/CTRL+C Exit browser or go back to previous screen\n\n" \
2718 "For multiple event sessions:\n\n" \
2719 "TAB/UNTAB Switch events\n\n" \
2720 "For symbolic views (--sort has sym):\n\n" \
2721 "ENTER Zoom into DSO/Threads & Annotate current symbol\n" \
2723 "a Annotate current symbol\n" \
2724 "C Collapse all callchains\n" \
2725 "d Zoom into current DSO\n" \
2726 "E Expand all callchains\n" \
2727 "F Toggle percentage of filtered entries\n" \
2728 "H Display column headers\n" \
2729 "L Change percent limit\n" \
2730 "m Display context menu\n" \
2731 "S Zoom into current Processor Socket\n" \
2733 /* help messages are sorted by lexical order of the hotkey */
2734 const char report_help[] = HIST_BROWSER_HELP_COMMON
2735 "i Show header information\n"
2736 "P Print histograms to perf.hist.N\n"
2737 "r Run available scripts\n"
2738 "s Switch to another data file in PWD\n"
2739 "t Zoom into current Thread\n"
2740 "V Verbose (DSO names in callchains, etc)\n"
2741 "/ Filter symbol by name";
2742 const char top_help[] = HIST_BROWSER_HELP_COMMON
2743 "P Print histograms to perf.hist.N\n"
2744 "t Zoom into current Thread\n"
2745 "V Verbose (DSO names in callchains, etc)\n"
2746 "z Toggle zeroing of samples\n"
2747 "f Enable/Disable events\n"
2748 "/ Filter symbol by name";
2750 if (browser == NULL)
2753 /* reset abort key so that it can get Ctrl-C as a key */
2755 SLang_init_tty(0, 0, 0);
2758 browser->min_pcnt = min_pcnt;
2759 hist_browser__update_nr_entries(browser);
2761 browser->pstack = pstack__new(3);
2762 if (browser->pstack == NULL)
2765 ui_helpline__push(helpline);
2767 memset(options, 0, sizeof(options));
2768 memset(actions, 0, sizeof(actions));
2770 if (symbol_conf.col_width_list_str)
2771 perf_hpp__set_user_width(symbol_conf.col_width_list_str);
2774 struct thread *thread = NULL;
2775 struct map *map = NULL;
2781 key = hist_browser__run(browser, helpline,
2784 if (browser->he_selection != NULL) {
2785 thread = hist_browser__selected_thread(browser);
2786 map = browser->selection->map;
2787 socked_id = browser->he_selection->socket;
2795 * Exit the browser, let hists__browser_tree
2796 * go to the next or previous
2798 goto out_free_stack;
2800 if (!hists__has(hists, sym)) {
2801 ui_browser__warning(&browser->b, delay_secs * 2,
2802 "Annotation is only available for symbolic views, "
2803 "include \"sym*\" in --sort to use it.");
2807 if (browser->selection == NULL ||
2808 browser->selection->sym == NULL ||
2809 browser->selection->map->dso->annotate_warned)
2812 actions->ms.map = browser->selection->map;
2813 actions->ms.sym = browser->selection->sym;
2814 do_annotate(browser, actions);
2817 hist_browser__dump(browser);
2820 actions->ms.map = map;
2821 do_zoom_dso(browser, actions);
2824 verbose = (verbose + 1) % 4;
2825 browser->show_dso = verbose > 0;
2826 ui_helpline__fpush("Verbosity level set to %d\n",
2830 actions->thread = thread;
2831 do_zoom_thread(browser, actions);
2834 actions->socket = socked_id;
2835 do_zoom_socket(browser, actions);
2838 if (ui_browser__input_window("Symbol to show",
2839 "Please enter the name of symbol you want to see.\n"
2840 "To remove the filter later, press / + ENTER.",
2841 buf, "ENTER: OK, ESC: Cancel",
2842 delay_secs * 2) == K_ENTER) {
2843 hists->symbol_filter_str = *buf ? buf : NULL;
2844 hists__filter_by_symbol(hists);
2845 hist_browser__reset(browser);
2849 if (is_report_browser(hbt)) {
2850 actions->thread = NULL;
2851 actions->ms.sym = NULL;
2852 do_run_script(browser, actions);
2856 if (is_report_browser(hbt)) {
2857 key = do_switch_data(browser, actions);
2858 if (key == K_SWITCH_INPUT_DATA)
2859 goto out_free_stack;
2863 /* env->arch is NULL for live-mode (i.e. perf top) */
2865 tui__header_window(env);
2868 symbol_conf.filter_relative ^= 1;
2871 if (!is_report_browser(hbt)) {
2872 struct perf_top *top = hbt->arg;
2874 top->zero = !top->zero;
2878 if (ui_browser__input_window("Percent Limit",
2879 "Please enter the value you want to hide entries under that percent.",
2880 buf, "ENTER: OK, ESC: Cancel",
2881 delay_secs * 2) == K_ENTER) {
2883 double new_percent = strtod(buf, &end);
2885 if (new_percent < 0 || new_percent > 100) {
2886 ui_browser__warning(&browser->b, delay_secs * 2,
2887 "Invalid percent: %.2f", new_percent);
2891 hist_browser__update_percent_limit(browser, new_percent);
2892 hist_browser__reset(browser);
2898 ui_browser__help_window(&browser->b,
2899 is_report_browser(hbt) ? report_help : top_help);
2910 if (pstack__empty(browser->pstack)) {
2912 * Go back to the perf_evsel_menu__run or other user
2915 goto out_free_stack;
2918 ui_browser__dialog_yesno(&browser->b,
2919 "Do you really want to exit?"))
2920 goto out_free_stack;
2924 top = pstack__peek(browser->pstack);
2925 if (top == &browser->hists->dso_filter) {
2927 * No need to set actions->dso here since
2928 * it's just to remove the current filter.
2929 * Ditto for thread below.
2931 do_zoom_dso(browser, actions);
2932 } else if (top == &browser->hists->thread_filter) {
2933 do_zoom_thread(browser, actions);
2934 } else if (top == &browser->hists->socket_filter) {
2935 do_zoom_socket(browser, actions);
2941 goto out_free_stack;
2943 if (!is_report_browser(hbt)) {
2944 struct perf_top *top = hbt->arg;
2946 perf_evlist__toggle_enable(top->evlist);
2948 * No need to refresh, resort/decay histogram
2949 * entries if we are not collecting samples:
2951 if (top->evlist->enabled) {
2952 helpline = "Press 'f' to disable the events or 'h' to see other hotkeys";
2953 hbt->refresh = delay_secs;
2955 helpline = "Press 'f' again to re-enable the events";
2962 helpline = "Press '?' for help on key bindings";
2966 if (!hists__has(hists, sym) || browser->selection == NULL)
2967 goto skip_annotation;
2969 if (sort__mode == SORT_MODE__BRANCH) {
2970 bi = browser->he_selection->branch_info;
2973 goto skip_annotation;
2975 nr_options += add_annotate_opt(browser,
2976 &actions[nr_options],
2977 &options[nr_options],
2980 if (bi->to.sym != bi->from.sym)
2981 nr_options += add_annotate_opt(browser,
2982 &actions[nr_options],
2983 &options[nr_options],
2987 nr_options += add_annotate_opt(browser,
2988 &actions[nr_options],
2989 &options[nr_options],
2990 browser->selection->map,
2991 browser->selection->sym);
2994 nr_options += add_thread_opt(browser, &actions[nr_options],
2995 &options[nr_options], thread);
2996 nr_options += add_dso_opt(browser, &actions[nr_options],
2997 &options[nr_options], map);
2998 nr_options += add_map_opt(browser, &actions[nr_options],
2999 &options[nr_options],
3000 browser->selection ?
3001 browser->selection->map : NULL);
3002 nr_options += add_socket_opt(browser, &actions[nr_options],
3003 &options[nr_options],
3005 /* perf script support */
3006 if (!is_report_browser(hbt))
3007 goto skip_scripting;
3009 if (browser->he_selection) {
3010 if (hists__has(hists, thread) && thread) {
3011 nr_options += add_script_opt(browser,
3012 &actions[nr_options],
3013 &options[nr_options],
3017 * Note that browser->selection != NULL
3018 * when browser->he_selection is not NULL,
3019 * so we don't need to check browser->selection
3020 * before fetching browser->selection->sym like what
3021 * we do before fetching browser->selection->map.
3023 * See hist_browser__show_entry.
3025 if (hists__has(hists, sym) && browser->selection->sym) {
3026 nr_options += add_script_opt(browser,
3027 &actions[nr_options],
3028 &options[nr_options],
3029 NULL, browser->selection->sym);
3032 nr_options += add_script_opt(browser, &actions[nr_options],
3033 &options[nr_options], NULL, NULL);
3034 nr_options += add_switch_opt(browser, &actions[nr_options],
3035 &options[nr_options]);
3037 nr_options += add_exit_opt(browser, &actions[nr_options],
3038 &options[nr_options]);
3041 struct popup_action *act;
3043 choice = ui__popup_menu(nr_options, options);
3044 if (choice == -1 || choice >= nr_options)
3047 act = &actions[choice];
3048 key = act->fn(browser, act);
3051 if (key == K_SWITCH_INPUT_DATA)
3055 pstack__delete(browser->pstack);
3057 hist_browser__delete(browser);
3058 free_popup_options(options, MAX_OPTIONS);
3062 struct perf_evsel_menu {
3063 struct ui_browser b;
3064 struct perf_evsel *selection;
3065 bool lost_events, lost_events_warned;
3067 struct perf_env *env;
3070 static void perf_evsel_menu__write(struct ui_browser *browser,
3071 void *entry, int row)
3073 struct perf_evsel_menu *menu = container_of(browser,
3074 struct perf_evsel_menu, b);
3075 struct perf_evsel *evsel = list_entry(entry, struct perf_evsel, node);
3076 struct hists *hists = evsel__hists(evsel);
3077 bool current_entry = ui_browser__is_current_entry(browser, row);
3078 unsigned long nr_events = hists->stats.nr_events[PERF_RECORD_SAMPLE];
3079 const char *ev_name = perf_evsel__name(evsel);
3081 const char *warn = " ";
3084 ui_browser__set_color(browser, current_entry ? HE_COLORSET_SELECTED :
3085 HE_COLORSET_NORMAL);
3087 if (perf_evsel__is_group_event(evsel)) {
3088 struct perf_evsel *pos;
3090 ev_name = perf_evsel__group_name(evsel);
3092 for_each_group_member(pos, evsel) {
3093 struct hists *pos_hists = evsel__hists(pos);
3094 nr_events += pos_hists->stats.nr_events[PERF_RECORD_SAMPLE];
3098 nr_events = convert_unit(nr_events, &unit);
3099 printed = scnprintf(bf, sizeof(bf), "%lu%c%s%s", nr_events,
3100 unit, unit == ' ' ? "" : " ", ev_name);
3101 ui_browser__printf(browser, "%s", bf);
3103 nr_events = hists->stats.nr_events[PERF_RECORD_LOST];
3104 if (nr_events != 0) {
3105 menu->lost_events = true;
3107 ui_browser__set_color(browser, HE_COLORSET_TOP);
3108 nr_events = convert_unit(nr_events, &unit);
3109 printed += scnprintf(bf, sizeof(bf), ": %ld%c%schunks LOST!",
3110 nr_events, unit, unit == ' ' ? "" : " ");
3114 ui_browser__write_nstring(browser, warn, browser->width - printed);
3117 menu->selection = evsel;
3120 static int perf_evsel_menu__run(struct perf_evsel_menu *menu,
3121 int nr_events, const char *help,
3122 struct hist_browser_timer *hbt,
3123 bool warn_lost_event)
3125 struct perf_evlist *evlist = menu->b.priv;
3126 struct perf_evsel *pos;
3127 const char *title = "Available samples";
3128 int delay_secs = hbt ? hbt->refresh : 0;
3131 if (ui_browser__show(&menu->b, title,
3132 "ESC: exit, ENTER|->: Browse histograms") < 0)
3136 key = ui_browser__run(&menu->b, delay_secs);
3140 hbt->timer(hbt->arg);
3142 if (!menu->lost_events_warned &&
3143 menu->lost_events &&
3145 ui_browser__warn_lost_events(&menu->b);
3146 menu->lost_events_warned = true;
3151 if (!menu->selection)
3153 pos = menu->selection;
3155 perf_evlist__set_selected(evlist, pos);
3157 * Give the calling tool a chance to populate the non
3158 * default evsel resorted hists tree.
3161 hbt->timer(hbt->arg);
3162 key = perf_evsel__hists_browse(pos, nr_events, help,
3167 ui_browser__show_title(&menu->b, title);
3170 if (pos->node.next == &evlist->entries)
3171 pos = perf_evlist__first(evlist);
3173 pos = perf_evsel__next(pos);
3176 if (pos->node.prev == &evlist->entries)
3177 pos = perf_evlist__last(evlist);
3179 pos = perf_evsel__prev(pos);
3181 case K_SWITCH_INPUT_DATA:
3192 if (!ui_browser__dialog_yesno(&menu->b,
3193 "Do you really want to exit?"))
3205 ui_browser__hide(&menu->b);
3209 static bool filter_group_entries(struct ui_browser *browser __maybe_unused,
3212 struct perf_evsel *evsel = list_entry(entry, struct perf_evsel, node);
3214 if (symbol_conf.event_group && !perf_evsel__is_group_leader(evsel))
3220 static int __perf_evlist__tui_browse_hists(struct perf_evlist *evlist,
3221 int nr_entries, const char *help,
3222 struct hist_browser_timer *hbt,
3224 struct perf_env *env,
3225 bool warn_lost_event)
3227 struct perf_evsel *pos;
3228 struct perf_evsel_menu menu = {
3230 .entries = &evlist->entries,
3231 .refresh = ui_browser__list_head_refresh,
3232 .seek = ui_browser__list_head_seek,
3233 .write = perf_evsel_menu__write,
3234 .filter = filter_group_entries,
3235 .nr_entries = nr_entries,
3238 .min_pcnt = min_pcnt,
3242 ui_helpline__push("Press ESC to exit");
3244 evlist__for_each_entry(evlist, pos) {
3245 const char *ev_name = perf_evsel__name(pos);
3246 size_t line_len = strlen(ev_name) + 7;
3248 if (menu.b.width < line_len)
3249 menu.b.width = line_len;
3252 return perf_evsel_menu__run(&menu, nr_entries, help,
3253 hbt, warn_lost_event);
3256 int perf_evlist__tui_browse_hists(struct perf_evlist *evlist, const char *help,
3257 struct hist_browser_timer *hbt,
3259 struct perf_env *env,
3260 bool warn_lost_event)
3262 int nr_entries = evlist->nr_entries;
3265 if (nr_entries == 1) {
3266 struct perf_evsel *first = perf_evlist__first(evlist);
3268 return perf_evsel__hists_browse(first, nr_entries, help,
3269 false, hbt, min_pcnt,
3270 env, warn_lost_event);
3273 if (symbol_conf.event_group) {
3274 struct perf_evsel *pos;
3277 evlist__for_each_entry(evlist, pos) {
3278 if (perf_evsel__is_group_leader(pos))
3282 if (nr_entries == 1)
3286 return __perf_evlist__tui_browse_hists(evlist, nr_entries, help,