Loading...
1// SPDX-License-Identifier: GPL-2.0
2#include <dirent.h>
3#include <errno.h>
4#include <inttypes.h>
5#include <stdio.h>
6#include <stdlib.h>
7#include <string.h>
8#include <linux/rbtree.h>
9#include <linux/string.h>
10#include <sys/ttydefaults.h>
11#include <linux/time64.h>
12#include <linux/zalloc.h>
13
14#include "../../util/debug.h"
15#include "../../util/dso.h"
16#include "../../util/callchain.h"
17#include "../../util/evsel.h"
18#include "../../util/evlist.h"
19#include "../../util/header.h"
20#include "../../util/hist.h"
21#include "../../util/map.h"
22#include "../../util/symbol.h"
23#include "../../util/map_symbol.h"
24#include "../../util/branch.h"
25#include "../../util/pstack.h"
26#include "../../util/sort.h"
27#include "../../util/top.h"
28#include "../../util/thread.h"
29#include "../../arch/common.h"
30#include "../../perf.h"
31
32#include "../browsers/hists.h"
33#include "../helpline.h"
34#include "../util.h"
35#include "../ui.h"
36#include "map.h"
37#include "annotate.h"
38#include "srcline.h"
39#include "string2.h"
40#include "units.h"
41#include "time-utils.h"
42
43#include <linux/ctype.h>
44
45extern void hist_browser__init_hpp(void);
46
47static int hists_browser__scnprintf_title(struct hist_browser *browser, char *bf, size_t size);
48static void hist_browser__update_nr_entries(struct hist_browser *hb);
49
50static struct rb_node *hists__filter_entries(struct rb_node *nd,
51 float min_pcnt);
52
53static bool hist_browser__has_filter(struct hist_browser *hb)
54{
55 return hists__has_filter(hb->hists) || hb->min_pcnt || symbol_conf.has_filter || hb->c2c_filter;
56}
57
58static int hist_browser__get_folding(struct hist_browser *browser)
59{
60 struct rb_node *nd;
61 struct hists *hists = browser->hists;
62 int unfolded_rows = 0;
63
64 for (nd = rb_first_cached(&hists->entries);
65 (nd = hists__filter_entries(nd, browser->min_pcnt)) != NULL;
66 nd = rb_hierarchy_next(nd)) {
67 struct hist_entry *he =
68 rb_entry(nd, struct hist_entry, rb_node);
69
70 if (he->leaf && he->unfolded)
71 unfolded_rows += he->nr_rows;
72 }
73 return unfolded_rows;
74}
75
76static void hist_browser__set_title_space(struct hist_browser *hb)
77{
78 struct ui_browser *browser = &hb->b;
79 struct hists *hists = hb->hists;
80 struct perf_hpp_list *hpp_list = hists->hpp_list;
81
82 browser->extra_title_lines = hb->show_headers ? hpp_list->nr_header_lines : 0;
83}
84
85static u32 hist_browser__nr_entries(struct hist_browser *hb)
86{
87 u32 nr_entries;
88
89 if (symbol_conf.report_hierarchy)
90 nr_entries = hb->nr_hierarchy_entries;
91 else if (hist_browser__has_filter(hb))
92 nr_entries = hb->nr_non_filtered_entries;
93 else
94 nr_entries = hb->hists->nr_entries;
95
96 hb->nr_callchain_rows = hist_browser__get_folding(hb);
97 return nr_entries + hb->nr_callchain_rows;
98}
99
100static void hist_browser__update_rows(struct hist_browser *hb)
101{
102 struct ui_browser *browser = &hb->b;
103 struct hists *hists = hb->hists;
104 struct perf_hpp_list *hpp_list = hists->hpp_list;
105 u16 index_row;
106
107 if (!hb->show_headers) {
108 browser->rows += browser->extra_title_lines;
109 browser->extra_title_lines = 0;
110 return;
111 }
112
113 browser->extra_title_lines = hpp_list->nr_header_lines;
114 browser->rows -= browser->extra_title_lines;
115 /*
116 * Verify if we were at the last line and that line isn't
117 * visibe because we now show the header line(s).
118 */
119 index_row = browser->index - browser->top_idx;
120 if (index_row >= browser->rows)
121 browser->index -= index_row - browser->rows + 1;
122}
123
124static void hist_browser__refresh_dimensions(struct ui_browser *browser)
125{
126 struct hist_browser *hb = container_of(browser, struct hist_browser, b);
127
128 /* 3 == +/- toggle symbol before actual hist_entry rendering */
129 browser->width = 3 + (hists__sort_list_width(hb->hists) + sizeof("[k]"));
130 /*
131 * FIXME: Just keeping existing behaviour, but this really should be
132 * before updating browser->width, as it will invalidate the
133 * calculation above. Fix this and the fallout in another
134 * changeset.
135 */
136 ui_browser__refresh_dimensions(browser);
137}
138
139static void hist_browser__reset(struct hist_browser *browser)
140{
141 /*
142 * The hists__remove_entry_filter() already folds non-filtered
143 * entries so we can assume it has 0 callchain rows.
144 */
145 browser->nr_callchain_rows = 0;
146
147 hist_browser__update_nr_entries(browser);
148 browser->b.nr_entries = hist_browser__nr_entries(browser);
149 hist_browser__refresh_dimensions(&browser->b);
150 ui_browser__reset_index(&browser->b);
151}
152
153static char tree__folded_sign(bool unfolded)
154{
155 return unfolded ? '-' : '+';
156}
157
158static char hist_entry__folded(const struct hist_entry *he)
159{
160 return he->has_children ? tree__folded_sign(he->unfolded) : ' ';
161}
162
163static char callchain_list__folded(const struct callchain_list *cl)
164{
165 return cl->has_children ? tree__folded_sign(cl->unfolded) : ' ';
166}
167
168static void callchain_list__set_folding(struct callchain_list *cl, bool unfold)
169{
170 cl->unfolded = unfold ? cl->has_children : false;
171}
172
173static int callchain_node__count_rows_rb_tree(struct callchain_node *node)
174{
175 int n = 0;
176 struct rb_node *nd;
177
178 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
179 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
180 struct callchain_list *chain;
181 char folded_sign = ' '; /* No children */
182
183 list_for_each_entry(chain, &child->val, list) {
184 ++n;
185
186 /* We need this because we may not have children */
187 folded_sign = callchain_list__folded(chain);
188 if (folded_sign == '+')
189 break;
190 }
191
192 if (folded_sign == '-') /* Have children and they're unfolded */
193 n += callchain_node__count_rows_rb_tree(child);
194 }
195
196 return n;
197}
198
199static int callchain_node__count_flat_rows(struct callchain_node *node)
200{
201 struct callchain_list *chain;
202 char folded_sign = 0;
203 int n = 0;
204
205 list_for_each_entry(chain, &node->parent_val, list) {
206 if (!folded_sign) {
207 /* only check first chain list entry */
208 folded_sign = callchain_list__folded(chain);
209 if (folded_sign == '+')
210 return 1;
211 }
212 n++;
213 }
214
215 list_for_each_entry(chain, &node->val, list) {
216 if (!folded_sign) {
217 /* node->parent_val list might be empty */
218 folded_sign = callchain_list__folded(chain);
219 if (folded_sign == '+')
220 return 1;
221 }
222 n++;
223 }
224
225 return n;
226}
227
228static int callchain_node__count_folded_rows(struct callchain_node *node __maybe_unused)
229{
230 return 1;
231}
232
233static int callchain_node__count_rows(struct callchain_node *node)
234{
235 struct callchain_list *chain;
236 bool unfolded = false;
237 int n = 0;
238
239 if (callchain_param.mode == CHAIN_FLAT)
240 return callchain_node__count_flat_rows(node);
241 else if (callchain_param.mode == CHAIN_FOLDED)
242 return callchain_node__count_folded_rows(node);
243
244 list_for_each_entry(chain, &node->val, list) {
245 ++n;
246
247 unfolded = chain->unfolded;
248 }
249
250 if (unfolded)
251 n += callchain_node__count_rows_rb_tree(node);
252
253 return n;
254}
255
256static int callchain__count_rows(struct rb_root *chain)
257{
258 struct rb_node *nd;
259 int n = 0;
260
261 for (nd = rb_first(chain); nd; nd = rb_next(nd)) {
262 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
263 n += callchain_node__count_rows(node);
264 }
265
266 return n;
267}
268
269static int hierarchy_count_rows(struct hist_browser *hb, struct hist_entry *he,
270 bool include_children)
271{
272 int count = 0;
273 struct rb_node *node;
274 struct hist_entry *child;
275
276 if (he->leaf)
277 return callchain__count_rows(&he->sorted_chain);
278
279 if (he->has_no_entry)
280 return 1;
281
282 node = rb_first_cached(&he->hroot_out);
283 while (node) {
284 float percent;
285
286 child = rb_entry(node, struct hist_entry, rb_node);
287 percent = hist_entry__get_percent_limit(child);
288
289 if (!child->filtered && percent >= hb->min_pcnt) {
290 count++;
291
292 if (include_children && child->unfolded)
293 count += hierarchy_count_rows(hb, child, true);
294 }
295
296 node = rb_next(node);
297 }
298 return count;
299}
300
301static bool hist_entry__toggle_fold(struct hist_entry *he)
302{
303 if (!he)
304 return false;
305
306 if (!he->has_children)
307 return false;
308
309 he->unfolded = !he->unfolded;
310 return true;
311}
312
313static bool callchain_list__toggle_fold(struct callchain_list *cl)
314{
315 if (!cl)
316 return false;
317
318 if (!cl->has_children)
319 return false;
320
321 cl->unfolded = !cl->unfolded;
322 return true;
323}
324
325static void callchain_node__init_have_children_rb_tree(struct callchain_node *node)
326{
327 struct rb_node *nd = rb_first(&node->rb_root);
328
329 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
330 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
331 struct callchain_list *chain;
332 bool first = true;
333
334 list_for_each_entry(chain, &child->val, list) {
335 if (first) {
336 first = false;
337 chain->has_children = chain->list.next != &child->val ||
338 !RB_EMPTY_ROOT(&child->rb_root);
339 } else
340 chain->has_children = chain->list.next == &child->val &&
341 !RB_EMPTY_ROOT(&child->rb_root);
342 }
343
344 callchain_node__init_have_children_rb_tree(child);
345 }
346}
347
348static void callchain_node__init_have_children(struct callchain_node *node,
349 bool has_sibling)
350{
351 struct callchain_list *chain;
352
353 chain = list_entry(node->val.next, struct callchain_list, list);
354 chain->has_children = has_sibling;
355
356 if (!list_empty(&node->val)) {
357 chain = list_entry(node->val.prev, struct callchain_list, list);
358 chain->has_children = !RB_EMPTY_ROOT(&node->rb_root);
359 }
360
361 callchain_node__init_have_children_rb_tree(node);
362}
363
364static void callchain__init_have_children(struct rb_root *root)
365{
366 struct rb_node *nd = rb_first(root);
367 bool has_sibling = nd && rb_next(nd);
368
369 for (nd = rb_first(root); nd; nd = rb_next(nd)) {
370 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
371 callchain_node__init_have_children(node, has_sibling);
372 if (callchain_param.mode == CHAIN_FLAT ||
373 callchain_param.mode == CHAIN_FOLDED)
374 callchain_node__make_parent_list(node);
375 }
376}
377
378static void hist_entry__init_have_children(struct hist_entry *he)
379{
380 if (he->init_have_children)
381 return;
382
383 if (he->leaf) {
384 he->has_children = !RB_EMPTY_ROOT(&he->sorted_chain);
385 callchain__init_have_children(&he->sorted_chain);
386 } else {
387 he->has_children = !RB_EMPTY_ROOT(&he->hroot_out.rb_root);
388 }
389
390 he->init_have_children = true;
391}
392
393static bool hist_browser__toggle_fold(struct hist_browser *browser)
394{
395 struct hist_entry *he = browser->he_selection;
396 struct map_symbol *ms = browser->selection;
397 struct callchain_list *cl = container_of(ms, struct callchain_list, ms);
398 bool has_children;
399
400 if (!he || !ms)
401 return false;
402
403 if (ms == &he->ms)
404 has_children = hist_entry__toggle_fold(he);
405 else
406 has_children = callchain_list__toggle_fold(cl);
407
408 if (has_children) {
409 int child_rows = 0;
410
411 hist_entry__init_have_children(he);
412 browser->b.nr_entries -= he->nr_rows;
413
414 if (he->leaf)
415 browser->nr_callchain_rows -= he->nr_rows;
416 else
417 browser->nr_hierarchy_entries -= he->nr_rows;
418
419 if (symbol_conf.report_hierarchy)
420 child_rows = hierarchy_count_rows(browser, he, true);
421
422 if (he->unfolded) {
423 if (he->leaf)
424 he->nr_rows = callchain__count_rows(
425 &he->sorted_chain);
426 else
427 he->nr_rows = hierarchy_count_rows(browser, he, false);
428
429 /* account grand children */
430 if (symbol_conf.report_hierarchy)
431 browser->b.nr_entries += child_rows - he->nr_rows;
432
433 if (!he->leaf && he->nr_rows == 0) {
434 he->has_no_entry = true;
435 he->nr_rows = 1;
436 }
437 } else {
438 if (symbol_conf.report_hierarchy)
439 browser->b.nr_entries -= child_rows - he->nr_rows;
440
441 if (he->has_no_entry)
442 he->has_no_entry = false;
443
444 he->nr_rows = 0;
445 }
446
447 browser->b.nr_entries += he->nr_rows;
448
449 if (he->leaf)
450 browser->nr_callchain_rows += he->nr_rows;
451 else
452 browser->nr_hierarchy_entries += he->nr_rows;
453
454 return true;
455 }
456
457 /* If it doesn't have children, no toggling performed */
458 return false;
459}
460
461static int callchain_node__set_folding_rb_tree(struct callchain_node *node, bool unfold)
462{
463 int n = 0;
464 struct rb_node *nd;
465
466 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
467 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
468 struct callchain_list *chain;
469 bool has_children = false;
470
471 list_for_each_entry(chain, &child->val, list) {
472 ++n;
473 callchain_list__set_folding(chain, unfold);
474 has_children = chain->has_children;
475 }
476
477 if (has_children)
478 n += callchain_node__set_folding_rb_tree(child, unfold);
479 }
480
481 return n;
482}
483
484static int callchain_node__set_folding(struct callchain_node *node, bool unfold)
485{
486 struct callchain_list *chain;
487 bool has_children = false;
488 int n = 0;
489
490 list_for_each_entry(chain, &node->val, list) {
491 ++n;
492 callchain_list__set_folding(chain, unfold);
493 has_children = chain->has_children;
494 }
495
496 if (has_children)
497 n += callchain_node__set_folding_rb_tree(node, unfold);
498
499 return n;
500}
501
502static int callchain__set_folding(struct rb_root *chain, bool unfold)
503{
504 struct rb_node *nd;
505 int n = 0;
506
507 for (nd = rb_first(chain); nd; nd = rb_next(nd)) {
508 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
509 n += callchain_node__set_folding(node, unfold);
510 }
511
512 return n;
513}
514
515static int hierarchy_set_folding(struct hist_browser *hb, struct hist_entry *he,
516 bool unfold __maybe_unused)
517{
518 float percent;
519 struct rb_node *nd;
520 struct hist_entry *child;
521 int n = 0;
522
523 for (nd = rb_first_cached(&he->hroot_out); nd; nd = rb_next(nd)) {
524 child = rb_entry(nd, struct hist_entry, rb_node);
525 percent = hist_entry__get_percent_limit(child);
526 if (!child->filtered && percent >= hb->min_pcnt)
527 n++;
528 }
529
530 return n;
531}
532
533static void __hist_entry__set_folding(struct hist_entry *he,
534 struct hist_browser *hb, bool unfold)
535{
536 hist_entry__init_have_children(he);
537 he->unfolded = unfold ? he->has_children : false;
538
539 if (he->has_children) {
540 int n;
541
542 if (he->leaf)
543 n = callchain__set_folding(&he->sorted_chain, unfold);
544 else
545 n = hierarchy_set_folding(hb, he, unfold);
546
547 he->nr_rows = unfold ? n : 0;
548 } else
549 he->nr_rows = 0;
550}
551
552static void hist_entry__set_folding(struct hist_entry *he,
553 struct hist_browser *browser, bool unfold)
554{
555 double percent;
556
557 percent = hist_entry__get_percent_limit(he);
558 if (he->filtered || percent < browser->min_pcnt)
559 return;
560
561 __hist_entry__set_folding(he, browser, unfold);
562
563 if (!he->depth || unfold)
564 browser->nr_hierarchy_entries++;
565 if (he->leaf)
566 browser->nr_callchain_rows += he->nr_rows;
567 else if (unfold && !hist_entry__has_hierarchy_children(he, browser->min_pcnt)) {
568 browser->nr_hierarchy_entries++;
569 he->has_no_entry = true;
570 he->nr_rows = 1;
571 } else
572 he->has_no_entry = false;
573}
574
575static void
576__hist_browser__set_folding(struct hist_browser *browser, bool unfold)
577{
578 struct rb_node *nd;
579 struct hist_entry *he;
580
581 nd = rb_first_cached(&browser->hists->entries);
582 while (nd) {
583 he = rb_entry(nd, struct hist_entry, rb_node);
584
585 /* set folding state even if it's currently folded */
586 nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD);
587
588 hist_entry__set_folding(he, browser, unfold);
589 }
590}
591
592static void hist_browser__set_folding(struct hist_browser *browser, bool unfold)
593{
594 browser->nr_hierarchy_entries = 0;
595 browser->nr_callchain_rows = 0;
596 __hist_browser__set_folding(browser, unfold);
597
598 browser->b.nr_entries = hist_browser__nr_entries(browser);
599 /* Go to the start, we may be way after valid entries after a collapse */
600 ui_browser__reset_index(&browser->b);
601}
602
603static void hist_browser__set_folding_selected(struct hist_browser *browser, bool unfold)
604{
605 if (!browser->he_selection)
606 return;
607
608 hist_entry__set_folding(browser->he_selection, browser, unfold);
609 browser->b.nr_entries = hist_browser__nr_entries(browser);
610}
611
612static void ui_browser__warn_lost_events(struct ui_browser *browser)
613{
614 ui_browser__warning(browser, 4,
615 "Events are being lost, check IO/CPU overload!\n\n"
616 "You may want to run 'perf' using a RT scheduler policy:\n\n"
617 " perf top -r 80\n\n"
618 "Or reduce the sampling frequency.");
619}
620
621static int hist_browser__title(struct hist_browser *browser, char *bf, size_t size)
622{
623 return browser->title ? browser->title(browser, bf, size) : 0;
624}
625
626int hist_browser__run(struct hist_browser *browser, const char *help,
627 bool warn_lost_event)
628{
629 int key;
630 char title[160];
631 struct hist_browser_timer *hbt = browser->hbt;
632 int delay_secs = hbt ? hbt->refresh : 0;
633
634 browser->b.entries = &browser->hists->entries;
635 browser->b.nr_entries = hist_browser__nr_entries(browser);
636
637 hist_browser__title(browser, title, sizeof(title));
638
639 if (ui_browser__show(&browser->b, title, "%s", help) < 0)
640 return -1;
641
642 while (1) {
643 key = ui_browser__run(&browser->b, delay_secs);
644
645 switch (key) {
646 case K_TIMER: {
647 u64 nr_entries;
648
649 WARN_ON_ONCE(!hbt);
650
651 if (hbt)
652 hbt->timer(hbt->arg);
653
654 if (hist_browser__has_filter(browser) ||
655 symbol_conf.report_hierarchy)
656 hist_browser__update_nr_entries(browser);
657
658 nr_entries = hist_browser__nr_entries(browser);
659 ui_browser__update_nr_entries(&browser->b, nr_entries);
660
661 if (warn_lost_event &&
662 (browser->hists->stats.nr_lost_warned !=
663 browser->hists->stats.nr_events[PERF_RECORD_LOST])) {
664 browser->hists->stats.nr_lost_warned =
665 browser->hists->stats.nr_events[PERF_RECORD_LOST];
666 ui_browser__warn_lost_events(&browser->b);
667 }
668
669 hist_browser__title(browser, title, sizeof(title));
670 ui_browser__show_title(&browser->b, title);
671 continue;
672 }
673 case 'D': { /* Debug */
674 static int seq;
675 struct hist_entry *h = rb_entry(browser->b.top,
676 struct hist_entry, rb_node);
677 ui_helpline__pop();
678 ui_helpline__fpush("%d: nr_ent=(%d,%d), etl: %d, rows=%d, idx=%d, fve: idx=%d, row_off=%d, nrows=%d",
679 seq++, browser->b.nr_entries,
680 browser->hists->nr_entries,
681 browser->b.extra_title_lines,
682 browser->b.rows,
683 browser->b.index,
684 browser->b.top_idx,
685 h->row_offset, h->nr_rows);
686 }
687 break;
688 case 'C':
689 /* Collapse the whole world. */
690 hist_browser__set_folding(browser, false);
691 break;
692 case 'c':
693 /* Collapse the selected entry. */
694 hist_browser__set_folding_selected(browser, false);
695 break;
696 case 'E':
697 /* Expand the whole world. */
698 hist_browser__set_folding(browser, true);
699 break;
700 case 'e':
701 /* Expand the selected entry. */
702 hist_browser__set_folding_selected(browser, true);
703 break;
704 case 'H':
705 browser->show_headers = !browser->show_headers;
706 hist_browser__update_rows(browser);
707 break;
708 case K_ENTER:
709 if (hist_browser__toggle_fold(browser))
710 break;
711 /* fall thru */
712 default:
713 goto out;
714 }
715 }
716out:
717 ui_browser__hide(&browser->b);
718 return key;
719}
720
721struct callchain_print_arg {
722 /* for hists browser */
723 off_t row_offset;
724 bool is_current_entry;
725
726 /* for file dump */
727 FILE *fp;
728 int printed;
729};
730
731typedef void (*print_callchain_entry_fn)(struct hist_browser *browser,
732 struct callchain_list *chain,
733 const char *str, int offset,
734 unsigned short row,
735 struct callchain_print_arg *arg);
736
737static void hist_browser__show_callchain_entry(struct hist_browser *browser,
738 struct callchain_list *chain,
739 const char *str, int offset,
740 unsigned short row,
741 struct callchain_print_arg *arg)
742{
743 int color, width;
744 char folded_sign = callchain_list__folded(chain);
745 bool show_annotated = browser->show_dso && chain->ms.sym && symbol__annotation(chain->ms.sym)->src;
746
747 color = HE_COLORSET_NORMAL;
748 width = browser->b.width - (offset + 2);
749 if (ui_browser__is_current_entry(&browser->b, row)) {
750 browser->selection = &chain->ms;
751 color = HE_COLORSET_SELECTED;
752 arg->is_current_entry = true;
753 }
754
755 ui_browser__set_color(&browser->b, color);
756 ui_browser__gotorc(&browser->b, row, 0);
757 ui_browser__write_nstring(&browser->b, " ", offset);
758 ui_browser__printf(&browser->b, "%c", folded_sign);
759 ui_browser__write_graph(&browser->b, show_annotated ? SLSMG_RARROW_CHAR : ' ');
760 ui_browser__write_nstring(&browser->b, str, width);
761}
762
763static void hist_browser__fprintf_callchain_entry(struct hist_browser *b __maybe_unused,
764 struct callchain_list *chain,
765 const char *str, int offset,
766 unsigned short row __maybe_unused,
767 struct callchain_print_arg *arg)
768{
769 char folded_sign = callchain_list__folded(chain);
770
771 arg->printed += fprintf(arg->fp, "%*s%c %s\n", offset, " ",
772 folded_sign, str);
773}
774
775typedef bool (*check_output_full_fn)(struct hist_browser *browser,
776 unsigned short row);
777
778static bool hist_browser__check_output_full(struct hist_browser *browser,
779 unsigned short row)
780{
781 return browser->b.rows == row;
782}
783
784static bool hist_browser__check_dump_full(struct hist_browser *browser __maybe_unused,
785 unsigned short row __maybe_unused)
786{
787 return false;
788}
789
790#define LEVEL_OFFSET_STEP 3
791
792static int hist_browser__show_callchain_list(struct hist_browser *browser,
793 struct callchain_node *node,
794 struct callchain_list *chain,
795 unsigned short row, u64 total,
796 bool need_percent, int offset,
797 print_callchain_entry_fn print,
798 struct callchain_print_arg *arg)
799{
800 char bf[1024], *alloc_str;
801 char buf[64], *alloc_str2;
802 const char *str;
803 int ret = 1;
804
805 if (arg->row_offset != 0) {
806 arg->row_offset--;
807 return 0;
808 }
809
810 alloc_str = NULL;
811 alloc_str2 = NULL;
812
813 str = callchain_list__sym_name(chain, bf, sizeof(bf),
814 browser->show_dso);
815
816 if (symbol_conf.show_branchflag_count) {
817 callchain_list_counts__printf_value(chain, NULL,
818 buf, sizeof(buf));
819
820 if (asprintf(&alloc_str2, "%s%s", str, buf) < 0)
821 str = "Not enough memory!";
822 else
823 str = alloc_str2;
824 }
825
826 if (need_percent) {
827 callchain_node__scnprintf_value(node, buf, sizeof(buf),
828 total);
829
830 if (asprintf(&alloc_str, "%s %s", buf, str) < 0)
831 str = "Not enough memory!";
832 else
833 str = alloc_str;
834 }
835
836 print(browser, chain, str, offset, row, arg);
837 free(alloc_str);
838 free(alloc_str2);
839
840 return ret;
841}
842
843static bool check_percent_display(struct rb_node *node, u64 parent_total)
844{
845 struct callchain_node *child;
846
847 if (node == NULL)
848 return false;
849
850 if (rb_next(node))
851 return true;
852
853 child = rb_entry(node, struct callchain_node, rb_node);
854 return callchain_cumul_hits(child) != parent_total;
855}
856
857static int hist_browser__show_callchain_flat(struct hist_browser *browser,
858 struct rb_root *root,
859 unsigned short row, u64 total,
860 u64 parent_total,
861 print_callchain_entry_fn print,
862 struct callchain_print_arg *arg,
863 check_output_full_fn is_output_full)
864{
865 struct rb_node *node;
866 int first_row = row, offset = LEVEL_OFFSET_STEP;
867 bool need_percent;
868
869 node = rb_first(root);
870 need_percent = check_percent_display(node, parent_total);
871
872 while (node) {
873 struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);
874 struct rb_node *next = rb_next(node);
875 struct callchain_list *chain;
876 char folded_sign = ' ';
877 int first = true;
878 int extra_offset = 0;
879
880 list_for_each_entry(chain, &child->parent_val, list) {
881 bool was_first = first;
882
883 if (first)
884 first = false;
885 else if (need_percent)
886 extra_offset = LEVEL_OFFSET_STEP;
887
888 folded_sign = callchain_list__folded(chain);
889
890 row += hist_browser__show_callchain_list(browser, child,
891 chain, row, total,
892 was_first && need_percent,
893 offset + extra_offset,
894 print, arg);
895
896 if (is_output_full(browser, row))
897 goto out;
898
899 if (folded_sign == '+')
900 goto next;
901 }
902
903 list_for_each_entry(chain, &child->val, list) {
904 bool was_first = first;
905
906 if (first)
907 first = false;
908 else if (need_percent)
909 extra_offset = LEVEL_OFFSET_STEP;
910
911 folded_sign = callchain_list__folded(chain);
912
913 row += hist_browser__show_callchain_list(browser, child,
914 chain, row, total,
915 was_first && need_percent,
916 offset + extra_offset,
917 print, arg);
918
919 if (is_output_full(browser, row))
920 goto out;
921
922 if (folded_sign == '+')
923 break;
924 }
925
926next:
927 if (is_output_full(browser, row))
928 break;
929 node = next;
930 }
931out:
932 return row - first_row;
933}
934
935static char *hist_browser__folded_callchain_str(struct hist_browser *browser,
936 struct callchain_list *chain,
937 char *value_str, char *old_str)
938{
939 char bf[1024];
940 const char *str;
941 char *new;
942
943 str = callchain_list__sym_name(chain, bf, sizeof(bf),
944 browser->show_dso);
945 if (old_str) {
946 if (asprintf(&new, "%s%s%s", old_str,
947 symbol_conf.field_sep ?: ";", str) < 0)
948 new = NULL;
949 } else {
950 if (value_str) {
951 if (asprintf(&new, "%s %s", value_str, str) < 0)
952 new = NULL;
953 } else {
954 if (asprintf(&new, "%s", str) < 0)
955 new = NULL;
956 }
957 }
958 return new;
959}
960
961static int hist_browser__show_callchain_folded(struct hist_browser *browser,
962 struct rb_root *root,
963 unsigned short row, u64 total,
964 u64 parent_total,
965 print_callchain_entry_fn print,
966 struct callchain_print_arg *arg,
967 check_output_full_fn is_output_full)
968{
969 struct rb_node *node;
970 int first_row = row, offset = LEVEL_OFFSET_STEP;
971 bool need_percent;
972
973 node = rb_first(root);
974 need_percent = check_percent_display(node, parent_total);
975
976 while (node) {
977 struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);
978 struct rb_node *next = rb_next(node);
979 struct callchain_list *chain, *first_chain = NULL;
980 int first = true;
981 char *value_str = NULL, *value_str_alloc = NULL;
982 char *chain_str = NULL, *chain_str_alloc = NULL;
983
984 if (arg->row_offset != 0) {
985 arg->row_offset--;
986 goto next;
987 }
988
989 if (need_percent) {
990 char buf[64];
991
992 callchain_node__scnprintf_value(child, buf, sizeof(buf), total);
993 if (asprintf(&value_str, "%s", buf) < 0) {
994 value_str = (char *)"<...>";
995 goto do_print;
996 }
997 value_str_alloc = value_str;
998 }
999
1000 list_for_each_entry(chain, &child->parent_val, list) {
1001 chain_str = hist_browser__folded_callchain_str(browser,
1002 chain, value_str, chain_str);
1003 if (first) {
1004 first = false;
1005 first_chain = chain;
1006 }
1007
1008 if (chain_str == NULL) {
1009 chain_str = (char *)"Not enough memory!";
1010 goto do_print;
1011 }
1012
1013 chain_str_alloc = chain_str;
1014 }
1015
1016 list_for_each_entry(chain, &child->val, list) {
1017 chain_str = hist_browser__folded_callchain_str(browser,
1018 chain, value_str, chain_str);
1019 if (first) {
1020 first = false;
1021 first_chain = chain;
1022 }
1023
1024 if (chain_str == NULL) {
1025 chain_str = (char *)"Not enough memory!";
1026 goto do_print;
1027 }
1028
1029 chain_str_alloc = chain_str;
1030 }
1031
1032do_print:
1033 print(browser, first_chain, chain_str, offset, row++, arg);
1034 free(value_str_alloc);
1035 free(chain_str_alloc);
1036
1037next:
1038 if (is_output_full(browser, row))
1039 break;
1040 node = next;
1041 }
1042
1043 return row - first_row;
1044}
1045
1046static int hist_browser__show_callchain_graph(struct hist_browser *browser,
1047 struct rb_root *root, int level,
1048 unsigned short row, u64 total,
1049 u64 parent_total,
1050 print_callchain_entry_fn print,
1051 struct callchain_print_arg *arg,
1052 check_output_full_fn is_output_full)
1053{
1054 struct rb_node *node;
1055 int first_row = row, offset = level * LEVEL_OFFSET_STEP;
1056 bool need_percent;
1057 u64 percent_total = total;
1058
1059 if (callchain_param.mode == CHAIN_GRAPH_REL)
1060 percent_total = parent_total;
1061
1062 node = rb_first(root);
1063 need_percent = check_percent_display(node, parent_total);
1064
1065 while (node) {
1066 struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);
1067 struct rb_node *next = rb_next(node);
1068 struct callchain_list *chain;
1069 char folded_sign = ' ';
1070 int first = true;
1071 int extra_offset = 0;
1072
1073 list_for_each_entry(chain, &child->val, list) {
1074 bool was_first = first;
1075
1076 if (first)
1077 first = false;
1078 else if (need_percent)
1079 extra_offset = LEVEL_OFFSET_STEP;
1080
1081 folded_sign = callchain_list__folded(chain);
1082
1083 row += hist_browser__show_callchain_list(browser, child,
1084 chain, row, percent_total,
1085 was_first && need_percent,
1086 offset + extra_offset,
1087 print, arg);
1088
1089 if (is_output_full(browser, row))
1090 goto out;
1091
1092 if (folded_sign == '+')
1093 break;
1094 }
1095
1096 if (folded_sign == '-') {
1097 const int new_level = level + (extra_offset ? 2 : 1);
1098
1099 row += hist_browser__show_callchain_graph(browser, &child->rb_root,
1100 new_level, row, total,
1101 child->children_hit,
1102 print, arg, is_output_full);
1103 }
1104 if (is_output_full(browser, row))
1105 break;
1106 node = next;
1107 }
1108out:
1109 return row - first_row;
1110}
1111
1112static int hist_browser__show_callchain(struct hist_browser *browser,
1113 struct hist_entry *entry, int level,
1114 unsigned short row,
1115 print_callchain_entry_fn print,
1116 struct callchain_print_arg *arg,
1117 check_output_full_fn is_output_full)
1118{
1119 u64 total = hists__total_period(entry->hists);
1120 u64 parent_total;
1121 int printed;
1122
1123 if (symbol_conf.cumulate_callchain)
1124 parent_total = entry->stat_acc->period;
1125 else
1126 parent_total = entry->stat.period;
1127
1128 if (callchain_param.mode == CHAIN_FLAT) {
1129 printed = hist_browser__show_callchain_flat(browser,
1130 &entry->sorted_chain, row,
1131 total, parent_total, print, arg,
1132 is_output_full);
1133 } else if (callchain_param.mode == CHAIN_FOLDED) {
1134 printed = hist_browser__show_callchain_folded(browser,
1135 &entry->sorted_chain, row,
1136 total, parent_total, print, arg,
1137 is_output_full);
1138 } else {
1139 printed = hist_browser__show_callchain_graph(browser,
1140 &entry->sorted_chain, level, row,
1141 total, parent_total, print, arg,
1142 is_output_full);
1143 }
1144
1145 if (arg->is_current_entry)
1146 browser->he_selection = entry;
1147
1148 return printed;
1149}
1150
1151struct hpp_arg {
1152 struct ui_browser *b;
1153 char folded_sign;
1154 bool current_entry;
1155};
1156
1157int __hpp__slsmg_color_printf(struct perf_hpp *hpp, const char *fmt, ...)
1158{
1159 struct hpp_arg *arg = hpp->ptr;
1160 int ret, len;
1161 va_list args;
1162 double percent;
1163
1164 va_start(args, fmt);
1165 len = va_arg(args, int);
1166 percent = va_arg(args, double);
1167 va_end(args);
1168
1169 ui_browser__set_percent_color(arg->b, percent, arg->current_entry);
1170
1171 ret = scnprintf(hpp->buf, hpp->size, fmt, len, percent);
1172 ui_browser__printf(arg->b, "%s", hpp->buf);
1173
1174 return ret;
1175}
1176
1177#define __HPP_COLOR_PERCENT_FN(_type, _field) \
1178static u64 __hpp_get_##_field(struct hist_entry *he) \
1179{ \
1180 return he->stat._field; \
1181} \
1182 \
1183static int \
1184hist_browser__hpp_color_##_type(struct perf_hpp_fmt *fmt, \
1185 struct perf_hpp *hpp, \
1186 struct hist_entry *he) \
1187{ \
1188 return hpp__fmt(fmt, hpp, he, __hpp_get_##_field, " %*.2f%%", \
1189 __hpp__slsmg_color_printf, true); \
1190}
1191
1192#define __HPP_COLOR_ACC_PERCENT_FN(_type, _field) \
1193static u64 __hpp_get_acc_##_field(struct hist_entry *he) \
1194{ \
1195 return he->stat_acc->_field; \
1196} \
1197 \
1198static int \
1199hist_browser__hpp_color_##_type(struct perf_hpp_fmt *fmt, \
1200 struct perf_hpp *hpp, \
1201 struct hist_entry *he) \
1202{ \
1203 if (!symbol_conf.cumulate_callchain) { \
1204 struct hpp_arg *arg = hpp->ptr; \
1205 int len = fmt->user_len ?: fmt->len; \
1206 int ret = scnprintf(hpp->buf, hpp->size, \
1207 "%*s", len, "N/A"); \
1208 ui_browser__printf(arg->b, "%s", hpp->buf); \
1209 \
1210 return ret; \
1211 } \
1212 return hpp__fmt(fmt, hpp, he, __hpp_get_acc_##_field, \
1213 " %*.2f%%", __hpp__slsmg_color_printf, true); \
1214}
1215
1216__HPP_COLOR_PERCENT_FN(overhead, period)
1217__HPP_COLOR_PERCENT_FN(overhead_sys, period_sys)
1218__HPP_COLOR_PERCENT_FN(overhead_us, period_us)
1219__HPP_COLOR_PERCENT_FN(overhead_guest_sys, period_guest_sys)
1220__HPP_COLOR_PERCENT_FN(overhead_guest_us, period_guest_us)
1221__HPP_COLOR_ACC_PERCENT_FN(overhead_acc, period)
1222
1223#undef __HPP_COLOR_PERCENT_FN
1224#undef __HPP_COLOR_ACC_PERCENT_FN
1225
1226void hist_browser__init_hpp(void)
1227{
1228 perf_hpp__format[PERF_HPP__OVERHEAD].color =
1229 hist_browser__hpp_color_overhead;
1230 perf_hpp__format[PERF_HPP__OVERHEAD_SYS].color =
1231 hist_browser__hpp_color_overhead_sys;
1232 perf_hpp__format[PERF_HPP__OVERHEAD_US].color =
1233 hist_browser__hpp_color_overhead_us;
1234 perf_hpp__format[PERF_HPP__OVERHEAD_GUEST_SYS].color =
1235 hist_browser__hpp_color_overhead_guest_sys;
1236 perf_hpp__format[PERF_HPP__OVERHEAD_GUEST_US].color =
1237 hist_browser__hpp_color_overhead_guest_us;
1238 perf_hpp__format[PERF_HPP__OVERHEAD_ACC].color =
1239 hist_browser__hpp_color_overhead_acc;
1240
1241 res_sample_init();
1242}
1243
1244static int hist_browser__show_entry(struct hist_browser *browser,
1245 struct hist_entry *entry,
1246 unsigned short row)
1247{
1248 int printed = 0;
1249 int width = browser->b.width;
1250 char folded_sign = ' ';
1251 bool current_entry = ui_browser__is_current_entry(&browser->b, row);
1252 bool use_callchain = hist_entry__has_callchains(entry) && symbol_conf.use_callchain;
1253 off_t row_offset = entry->row_offset;
1254 bool first = true;
1255 struct perf_hpp_fmt *fmt;
1256
1257 if (current_entry) {
1258 browser->he_selection = entry;
1259 browser->selection = &entry->ms;
1260 }
1261
1262 if (use_callchain) {
1263 hist_entry__init_have_children(entry);
1264 folded_sign = hist_entry__folded(entry);
1265 }
1266
1267 if (row_offset == 0) {
1268 struct hpp_arg arg = {
1269 .b = &browser->b,
1270 .folded_sign = folded_sign,
1271 .current_entry = current_entry,
1272 };
1273 int column = 0;
1274
1275 ui_browser__gotorc(&browser->b, row, 0);
1276
1277 hists__for_each_format(browser->hists, fmt) {
1278 char s[2048];
1279 struct perf_hpp hpp = {
1280 .buf = s,
1281 .size = sizeof(s),
1282 .ptr = &arg,
1283 };
1284
1285 if (perf_hpp__should_skip(fmt, entry->hists) ||
1286 column++ < browser->b.horiz_scroll)
1287 continue;
1288
1289 if (current_entry && browser->b.navkeypressed) {
1290 ui_browser__set_color(&browser->b,
1291 HE_COLORSET_SELECTED);
1292 } else {
1293 ui_browser__set_color(&browser->b,
1294 HE_COLORSET_NORMAL);
1295 }
1296
1297 if (first) {
1298 if (use_callchain) {
1299 ui_browser__printf(&browser->b, "%c ", folded_sign);
1300 width -= 2;
1301 }
1302 first = false;
1303 } else {
1304 ui_browser__printf(&browser->b, " ");
1305 width -= 2;
1306 }
1307
1308 if (fmt->color) {
1309 int ret = fmt->color(fmt, &hpp, entry);
1310 hist_entry__snprintf_alignment(entry, &hpp, fmt, ret);
1311 /*
1312 * fmt->color() already used ui_browser to
1313 * print the non alignment bits, skip it (+ret):
1314 */
1315 ui_browser__printf(&browser->b, "%s", s + ret);
1316 } else {
1317 hist_entry__snprintf_alignment(entry, &hpp, fmt, fmt->entry(fmt, &hpp, entry));
1318 ui_browser__printf(&browser->b, "%s", s);
1319 }
1320 width -= hpp.buf - s;
1321 }
1322
1323 /* The scroll bar isn't being used */
1324 if (!browser->b.navkeypressed)
1325 width += 1;
1326
1327 ui_browser__write_nstring(&browser->b, "", width);
1328
1329 ++row;
1330 ++printed;
1331 } else
1332 --row_offset;
1333
1334 if (folded_sign == '-' && row != browser->b.rows) {
1335 struct callchain_print_arg arg = {
1336 .row_offset = row_offset,
1337 .is_current_entry = current_entry,
1338 };
1339
1340 printed += hist_browser__show_callchain(browser,
1341 entry, 1, row,
1342 hist_browser__show_callchain_entry,
1343 &arg,
1344 hist_browser__check_output_full);
1345 }
1346
1347 return printed;
1348}
1349
1350static int hist_browser__show_hierarchy_entry(struct hist_browser *browser,
1351 struct hist_entry *entry,
1352 unsigned short row,
1353 int level)
1354{
1355 int printed = 0;
1356 int width = browser->b.width;
1357 char folded_sign = ' ';
1358 bool current_entry = ui_browser__is_current_entry(&browser->b, row);
1359 off_t row_offset = entry->row_offset;
1360 bool first = true;
1361 struct perf_hpp_fmt *fmt;
1362 struct perf_hpp_list_node *fmt_node;
1363 struct hpp_arg arg = {
1364 .b = &browser->b,
1365 .current_entry = current_entry,
1366 };
1367 int column = 0;
1368 int hierarchy_indent = (entry->hists->nr_hpp_node - 2) * HIERARCHY_INDENT;
1369
1370 if (current_entry) {
1371 browser->he_selection = entry;
1372 browser->selection = &entry->ms;
1373 }
1374
1375 hist_entry__init_have_children(entry);
1376 folded_sign = hist_entry__folded(entry);
1377 arg.folded_sign = folded_sign;
1378
1379 if (entry->leaf && row_offset) {
1380 row_offset--;
1381 goto show_callchain;
1382 }
1383
1384 ui_browser__gotorc(&browser->b, row, 0);
1385
1386 if (current_entry && browser->b.navkeypressed)
1387 ui_browser__set_color(&browser->b, HE_COLORSET_SELECTED);
1388 else
1389 ui_browser__set_color(&browser->b, HE_COLORSET_NORMAL);
1390
1391 ui_browser__write_nstring(&browser->b, "", level * HIERARCHY_INDENT);
1392 width -= level * HIERARCHY_INDENT;
1393
1394 /* the first hpp_list_node is for overhead columns */
1395 fmt_node = list_first_entry(&entry->hists->hpp_formats,
1396 struct perf_hpp_list_node, list);
1397 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
1398 char s[2048];
1399 struct perf_hpp hpp = {
1400 .buf = s,
1401 .size = sizeof(s),
1402 .ptr = &arg,
1403 };
1404
1405 if (perf_hpp__should_skip(fmt, entry->hists) ||
1406 column++ < browser->b.horiz_scroll)
1407 continue;
1408
1409 if (current_entry && browser->b.navkeypressed) {
1410 ui_browser__set_color(&browser->b,
1411 HE_COLORSET_SELECTED);
1412 } else {
1413 ui_browser__set_color(&browser->b,
1414 HE_COLORSET_NORMAL);
1415 }
1416
1417 if (first) {
1418 ui_browser__printf(&browser->b, "%c ", folded_sign);
1419 width -= 2;
1420 first = false;
1421 } else {
1422 ui_browser__printf(&browser->b, " ");
1423 width -= 2;
1424 }
1425
1426 if (fmt->color) {
1427 int ret = fmt->color(fmt, &hpp, entry);
1428 hist_entry__snprintf_alignment(entry, &hpp, fmt, ret);
1429 /*
1430 * fmt->color() already used ui_browser to
1431 * print the non alignment bits, skip it (+ret):
1432 */
1433 ui_browser__printf(&browser->b, "%s", s + ret);
1434 } else {
1435 int ret = fmt->entry(fmt, &hpp, entry);
1436 hist_entry__snprintf_alignment(entry, &hpp, fmt, ret);
1437 ui_browser__printf(&browser->b, "%s", s);
1438 }
1439 width -= hpp.buf - s;
1440 }
1441
1442 if (!first) {
1443 ui_browser__write_nstring(&browser->b, "", hierarchy_indent);
1444 width -= hierarchy_indent;
1445 }
1446
1447 if (column >= browser->b.horiz_scroll) {
1448 char s[2048];
1449 struct perf_hpp hpp = {
1450 .buf = s,
1451 .size = sizeof(s),
1452 .ptr = &arg,
1453 };
1454
1455 if (current_entry && browser->b.navkeypressed) {
1456 ui_browser__set_color(&browser->b,
1457 HE_COLORSET_SELECTED);
1458 } else {
1459 ui_browser__set_color(&browser->b,
1460 HE_COLORSET_NORMAL);
1461 }
1462
1463 perf_hpp_list__for_each_format(entry->hpp_list, fmt) {
1464 if (first) {
1465 ui_browser__printf(&browser->b, "%c ", folded_sign);
1466 first = false;
1467 } else {
1468 ui_browser__write_nstring(&browser->b, "", 2);
1469 }
1470
1471 width -= 2;
1472
1473 /*
1474 * No need to call hist_entry__snprintf_alignment()
1475 * since this fmt is always the last column in the
1476 * hierarchy mode.
1477 */
1478 if (fmt->color) {
1479 width -= fmt->color(fmt, &hpp, entry);
1480 } else {
1481 int i = 0;
1482
1483 width -= fmt->entry(fmt, &hpp, entry);
1484 ui_browser__printf(&browser->b, "%s", skip_spaces(s));
1485
1486 while (isspace(s[i++]))
1487 width++;
1488 }
1489 }
1490 }
1491
1492 /* The scroll bar isn't being used */
1493 if (!browser->b.navkeypressed)
1494 width += 1;
1495
1496 ui_browser__write_nstring(&browser->b, "", width);
1497
1498 ++row;
1499 ++printed;
1500
1501show_callchain:
1502 if (entry->leaf && folded_sign == '-' && row != browser->b.rows) {
1503 struct callchain_print_arg carg = {
1504 .row_offset = row_offset,
1505 };
1506
1507 printed += hist_browser__show_callchain(browser, entry,
1508 level + 1, row,
1509 hist_browser__show_callchain_entry, &carg,
1510 hist_browser__check_output_full);
1511 }
1512
1513 return printed;
1514}
1515
1516static int hist_browser__show_no_entry(struct hist_browser *browser,
1517 unsigned short row, int level)
1518{
1519 int width = browser->b.width;
1520 bool current_entry = ui_browser__is_current_entry(&browser->b, row);
1521 bool first = true;
1522 int column = 0;
1523 int ret;
1524 struct perf_hpp_fmt *fmt;
1525 struct perf_hpp_list_node *fmt_node;
1526 int indent = browser->hists->nr_hpp_node - 2;
1527
1528 if (current_entry) {
1529 browser->he_selection = NULL;
1530 browser->selection = NULL;
1531 }
1532
1533 ui_browser__gotorc(&browser->b, row, 0);
1534
1535 if (current_entry && browser->b.navkeypressed)
1536 ui_browser__set_color(&browser->b, HE_COLORSET_SELECTED);
1537 else
1538 ui_browser__set_color(&browser->b, HE_COLORSET_NORMAL);
1539
1540 ui_browser__write_nstring(&browser->b, "", level * HIERARCHY_INDENT);
1541 width -= level * HIERARCHY_INDENT;
1542
1543 /* the first hpp_list_node is for overhead columns */
1544 fmt_node = list_first_entry(&browser->hists->hpp_formats,
1545 struct perf_hpp_list_node, list);
1546 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
1547 if (perf_hpp__should_skip(fmt, browser->hists) ||
1548 column++ < browser->b.horiz_scroll)
1549 continue;
1550
1551 ret = fmt->width(fmt, NULL, browser->hists);
1552
1553 if (first) {
1554 /* for folded sign */
1555 first = false;
1556 ret++;
1557 } else {
1558 /* space between columns */
1559 ret += 2;
1560 }
1561
1562 ui_browser__write_nstring(&browser->b, "", ret);
1563 width -= ret;
1564 }
1565
1566 ui_browser__write_nstring(&browser->b, "", indent * HIERARCHY_INDENT);
1567 width -= indent * HIERARCHY_INDENT;
1568
1569 if (column >= browser->b.horiz_scroll) {
1570 char buf[32];
1571
1572 ret = snprintf(buf, sizeof(buf), "no entry >= %.2f%%", browser->min_pcnt);
1573 ui_browser__printf(&browser->b, " %s", buf);
1574 width -= ret + 2;
1575 }
1576
1577 /* The scroll bar isn't being used */
1578 if (!browser->b.navkeypressed)
1579 width += 1;
1580
1581 ui_browser__write_nstring(&browser->b, "", width);
1582 return 1;
1583}
1584
1585static int advance_hpp_check(struct perf_hpp *hpp, int inc)
1586{
1587 advance_hpp(hpp, inc);
1588 return hpp->size <= 0;
1589}
1590
1591static int
1592hists_browser__scnprintf_headers(struct hist_browser *browser, char *buf,
1593 size_t size, int line)
1594{
1595 struct hists *hists = browser->hists;
1596 struct perf_hpp dummy_hpp = {
1597 .buf = buf,
1598 .size = size,
1599 };
1600 struct perf_hpp_fmt *fmt;
1601 size_t ret = 0;
1602 int column = 0;
1603 int span = 0;
1604
1605 if (hists__has_callchains(hists) && symbol_conf.use_callchain) {
1606 ret = scnprintf(buf, size, " ");
1607 if (advance_hpp_check(&dummy_hpp, ret))
1608 return ret;
1609 }
1610
1611 hists__for_each_format(browser->hists, fmt) {
1612 if (perf_hpp__should_skip(fmt, hists) || column++ < browser->b.horiz_scroll)
1613 continue;
1614
1615 ret = fmt->header(fmt, &dummy_hpp, hists, line, &span);
1616 if (advance_hpp_check(&dummy_hpp, ret))
1617 break;
1618
1619 if (span)
1620 continue;
1621
1622 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, " ");
1623 if (advance_hpp_check(&dummy_hpp, ret))
1624 break;
1625 }
1626
1627 return ret;
1628}
1629
1630static int hists_browser__scnprintf_hierarchy_headers(struct hist_browser *browser, char *buf, size_t size)
1631{
1632 struct hists *hists = browser->hists;
1633 struct perf_hpp dummy_hpp = {
1634 .buf = buf,
1635 .size = size,
1636 };
1637 struct perf_hpp_fmt *fmt;
1638 struct perf_hpp_list_node *fmt_node;
1639 size_t ret = 0;
1640 int column = 0;
1641 int indent = hists->nr_hpp_node - 2;
1642 bool first_node, first_col;
1643
1644 ret = scnprintf(buf, size, " ");
1645 if (advance_hpp_check(&dummy_hpp, ret))
1646 return ret;
1647
1648 first_node = true;
1649 /* the first hpp_list_node is for overhead columns */
1650 fmt_node = list_first_entry(&hists->hpp_formats,
1651 struct perf_hpp_list_node, list);
1652 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
1653 if (column++ < browser->b.horiz_scroll)
1654 continue;
1655
1656 ret = fmt->header(fmt, &dummy_hpp, hists, 0, NULL);
1657 if (advance_hpp_check(&dummy_hpp, ret))
1658 break;
1659
1660 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, " ");
1661 if (advance_hpp_check(&dummy_hpp, ret))
1662 break;
1663
1664 first_node = false;
1665 }
1666
1667 if (!first_node) {
1668 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, "%*s",
1669 indent * HIERARCHY_INDENT, "");
1670 if (advance_hpp_check(&dummy_hpp, ret))
1671 return ret;
1672 }
1673
1674 first_node = true;
1675 list_for_each_entry_continue(fmt_node, &hists->hpp_formats, list) {
1676 if (!first_node) {
1677 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, " / ");
1678 if (advance_hpp_check(&dummy_hpp, ret))
1679 break;
1680 }
1681 first_node = false;
1682
1683 first_col = true;
1684 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
1685 char *start;
1686
1687 if (perf_hpp__should_skip(fmt, hists))
1688 continue;
1689
1690 if (!first_col) {
1691 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, "+");
1692 if (advance_hpp_check(&dummy_hpp, ret))
1693 break;
1694 }
1695 first_col = false;
1696
1697 ret = fmt->header(fmt, &dummy_hpp, hists, 0, NULL);
1698 dummy_hpp.buf[ret] = '\0';
1699
1700 start = strim(dummy_hpp.buf);
1701 ret = strlen(start);
1702
1703 if (start != dummy_hpp.buf)
1704 memmove(dummy_hpp.buf, start, ret + 1);
1705
1706 if (advance_hpp_check(&dummy_hpp, ret))
1707 break;
1708 }
1709 }
1710
1711 return ret;
1712}
1713
1714static void hists_browser__hierarchy_headers(struct hist_browser *browser)
1715{
1716 char headers[1024];
1717
1718 hists_browser__scnprintf_hierarchy_headers(browser, headers,
1719 sizeof(headers));
1720
1721 ui_browser__gotorc(&browser->b, 0, 0);
1722 ui_browser__set_color(&browser->b, HE_COLORSET_ROOT);
1723 ui_browser__write_nstring(&browser->b, headers, browser->b.width + 1);
1724}
1725
1726static void hists_browser__headers(struct hist_browser *browser)
1727{
1728 struct hists *hists = browser->hists;
1729 struct perf_hpp_list *hpp_list = hists->hpp_list;
1730
1731 int line;
1732
1733 for (line = 0; line < hpp_list->nr_header_lines; line++) {
1734 char headers[1024];
1735
1736 hists_browser__scnprintf_headers(browser, headers,
1737 sizeof(headers), line);
1738
1739 ui_browser__gotorc_title(&browser->b, line, 0);
1740 ui_browser__set_color(&browser->b, HE_COLORSET_ROOT);
1741 ui_browser__write_nstring(&browser->b, headers, browser->b.width + 1);
1742 }
1743}
1744
1745static void hist_browser__show_headers(struct hist_browser *browser)
1746{
1747 if (symbol_conf.report_hierarchy)
1748 hists_browser__hierarchy_headers(browser);
1749 else
1750 hists_browser__headers(browser);
1751}
1752
1753static void ui_browser__hists_init_top(struct ui_browser *browser)
1754{
1755 if (browser->top == NULL) {
1756 struct hist_browser *hb;
1757
1758 hb = container_of(browser, struct hist_browser, b);
1759 browser->top = rb_first_cached(&hb->hists->entries);
1760 }
1761}
1762
1763static unsigned int hist_browser__refresh(struct ui_browser *browser)
1764{
1765 unsigned row = 0;
1766 struct rb_node *nd;
1767 struct hist_browser *hb = container_of(browser, struct hist_browser, b);
1768
1769 if (hb->show_headers)
1770 hist_browser__show_headers(hb);
1771
1772 ui_browser__hists_init_top(browser);
1773 hb->he_selection = NULL;
1774 hb->selection = NULL;
1775
1776 for (nd = browser->top; nd; nd = rb_hierarchy_next(nd)) {
1777 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1778 float percent;
1779
1780 if (h->filtered) {
1781 /* let it move to sibling */
1782 h->unfolded = false;
1783 continue;
1784 }
1785
1786 percent = hist_entry__get_percent_limit(h);
1787 if (percent < hb->min_pcnt)
1788 continue;
1789
1790 if (symbol_conf.report_hierarchy) {
1791 row += hist_browser__show_hierarchy_entry(hb, h, row,
1792 h->depth);
1793 if (row == browser->rows)
1794 break;
1795
1796 if (h->has_no_entry) {
1797 hist_browser__show_no_entry(hb, row, h->depth + 1);
1798 row++;
1799 }
1800 } else {
1801 row += hist_browser__show_entry(hb, h, row);
1802 }
1803
1804 if (row == browser->rows)
1805 break;
1806 }
1807
1808 return row;
1809}
1810
1811static struct rb_node *hists__filter_entries(struct rb_node *nd,
1812 float min_pcnt)
1813{
1814 while (nd != NULL) {
1815 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1816 float percent = hist_entry__get_percent_limit(h);
1817
1818 if (!h->filtered && percent >= min_pcnt)
1819 return nd;
1820
1821 /*
1822 * If it's filtered, its all children also were filtered.
1823 * So move to sibling node.
1824 */
1825 if (rb_next(nd))
1826 nd = rb_next(nd);
1827 else
1828 nd = rb_hierarchy_next(nd);
1829 }
1830
1831 return NULL;
1832}
1833
1834static struct rb_node *hists__filter_prev_entries(struct rb_node *nd,
1835 float min_pcnt)
1836{
1837 while (nd != NULL) {
1838 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1839 float percent = hist_entry__get_percent_limit(h);
1840
1841 if (!h->filtered && percent >= min_pcnt)
1842 return nd;
1843
1844 nd = rb_hierarchy_prev(nd);
1845 }
1846
1847 return NULL;
1848}
1849
1850static void ui_browser__hists_seek(struct ui_browser *browser,
1851 off_t offset, int whence)
1852{
1853 struct hist_entry *h;
1854 struct rb_node *nd;
1855 bool first = true;
1856 struct hist_browser *hb;
1857
1858 hb = container_of(browser, struct hist_browser, b);
1859
1860 if (browser->nr_entries == 0)
1861 return;
1862
1863 ui_browser__hists_init_top(browser);
1864
1865 switch (whence) {
1866 case SEEK_SET:
1867 nd = hists__filter_entries(rb_first(browser->entries),
1868 hb->min_pcnt);
1869 break;
1870 case SEEK_CUR:
1871 nd = browser->top;
1872 goto do_offset;
1873 case SEEK_END:
1874 nd = rb_hierarchy_last(rb_last(browser->entries));
1875 nd = hists__filter_prev_entries(nd, hb->min_pcnt);
1876 first = false;
1877 break;
1878 default:
1879 return;
1880 }
1881
1882 /*
1883 * Moves not relative to the first visible entry invalidates its
1884 * row_offset:
1885 */
1886 h = rb_entry(browser->top, struct hist_entry, rb_node);
1887 h->row_offset = 0;
1888
1889 /*
1890 * Here we have to check if nd is expanded (+), if it is we can't go
1891 * the next top level hist_entry, instead we must compute an offset of
1892 * what _not_ to show and not change the first visible entry.
1893 *
1894 * This offset increments when we are going from top to bottom and
1895 * decreases when we're going from bottom to top.
1896 *
1897 * As we don't have backpointers to the top level in the callchains
1898 * structure, we need to always print the whole hist_entry callchain,
1899 * skipping the first ones that are before the first visible entry
1900 * and stop when we printed enough lines to fill the screen.
1901 */
1902do_offset:
1903 if (!nd)
1904 return;
1905
1906 if (offset > 0) {
1907 do {
1908 h = rb_entry(nd, struct hist_entry, rb_node);
1909 if (h->unfolded && h->leaf) {
1910 u16 remaining = h->nr_rows - h->row_offset;
1911 if (offset > remaining) {
1912 offset -= remaining;
1913 h->row_offset = 0;
1914 } else {
1915 h->row_offset += offset;
1916 offset = 0;
1917 browser->top = nd;
1918 break;
1919 }
1920 }
1921 nd = hists__filter_entries(rb_hierarchy_next(nd),
1922 hb->min_pcnt);
1923 if (nd == NULL)
1924 break;
1925 --offset;
1926 browser->top = nd;
1927 } while (offset != 0);
1928 } else if (offset < 0) {
1929 while (1) {
1930 h = rb_entry(nd, struct hist_entry, rb_node);
1931 if (h->unfolded && h->leaf) {
1932 if (first) {
1933 if (-offset > h->row_offset) {
1934 offset += h->row_offset;
1935 h->row_offset = 0;
1936 } else {
1937 h->row_offset += offset;
1938 offset = 0;
1939 browser->top = nd;
1940 break;
1941 }
1942 } else {
1943 if (-offset > h->nr_rows) {
1944 offset += h->nr_rows;
1945 h->row_offset = 0;
1946 } else {
1947 h->row_offset = h->nr_rows + offset;
1948 offset = 0;
1949 browser->top = nd;
1950 break;
1951 }
1952 }
1953 }
1954
1955 nd = hists__filter_prev_entries(rb_hierarchy_prev(nd),
1956 hb->min_pcnt);
1957 if (nd == NULL)
1958 break;
1959 ++offset;
1960 browser->top = nd;
1961 if (offset == 0) {
1962 /*
1963 * Last unfiltered hist_entry, check if it is
1964 * unfolded, if it is then we should have
1965 * row_offset at its last entry.
1966 */
1967 h = rb_entry(nd, struct hist_entry, rb_node);
1968 if (h->unfolded && h->leaf)
1969 h->row_offset = h->nr_rows;
1970 break;
1971 }
1972 first = false;
1973 }
1974 } else {
1975 browser->top = nd;
1976 h = rb_entry(nd, struct hist_entry, rb_node);
1977 h->row_offset = 0;
1978 }
1979}
1980
1981static int hist_browser__fprintf_callchain(struct hist_browser *browser,
1982 struct hist_entry *he, FILE *fp,
1983 int level)
1984{
1985 struct callchain_print_arg arg = {
1986 .fp = fp,
1987 };
1988
1989 hist_browser__show_callchain(browser, he, level, 0,
1990 hist_browser__fprintf_callchain_entry, &arg,
1991 hist_browser__check_dump_full);
1992 return arg.printed;
1993}
1994
1995static int hist_browser__fprintf_entry(struct hist_browser *browser,
1996 struct hist_entry *he, FILE *fp)
1997{
1998 char s[8192];
1999 int printed = 0;
2000 char folded_sign = ' ';
2001 struct perf_hpp hpp = {
2002 .buf = s,
2003 .size = sizeof(s),
2004 };
2005 struct perf_hpp_fmt *fmt;
2006 bool first = true;
2007 int ret;
2008
2009 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain) {
2010 folded_sign = hist_entry__folded(he);
2011 printed += fprintf(fp, "%c ", folded_sign);
2012 }
2013
2014 hists__for_each_format(browser->hists, fmt) {
2015 if (perf_hpp__should_skip(fmt, he->hists))
2016 continue;
2017
2018 if (!first) {
2019 ret = scnprintf(hpp.buf, hpp.size, " ");
2020 advance_hpp(&hpp, ret);
2021 } else
2022 first = false;
2023
2024 ret = fmt->entry(fmt, &hpp, he);
2025 ret = hist_entry__snprintf_alignment(he, &hpp, fmt, ret);
2026 advance_hpp(&hpp, ret);
2027 }
2028 printed += fprintf(fp, "%s\n", s);
2029
2030 if (folded_sign == '-')
2031 printed += hist_browser__fprintf_callchain(browser, he, fp, 1);
2032
2033 return printed;
2034}
2035
2036
2037static int hist_browser__fprintf_hierarchy_entry(struct hist_browser *browser,
2038 struct hist_entry *he,
2039 FILE *fp, int level)
2040{
2041 char s[8192];
2042 int printed = 0;
2043 char folded_sign = ' ';
2044 struct perf_hpp hpp = {
2045 .buf = s,
2046 .size = sizeof(s),
2047 };
2048 struct perf_hpp_fmt *fmt;
2049 struct perf_hpp_list_node *fmt_node;
2050 bool first = true;
2051 int ret;
2052 int hierarchy_indent = (he->hists->nr_hpp_node - 2) * HIERARCHY_INDENT;
2053
2054 printed = fprintf(fp, "%*s", level * HIERARCHY_INDENT, "");
2055
2056 folded_sign = hist_entry__folded(he);
2057 printed += fprintf(fp, "%c", folded_sign);
2058
2059 /* the first hpp_list_node is for overhead columns */
2060 fmt_node = list_first_entry(&he->hists->hpp_formats,
2061 struct perf_hpp_list_node, list);
2062 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
2063 if (!first) {
2064 ret = scnprintf(hpp.buf, hpp.size, " ");
2065 advance_hpp(&hpp, ret);
2066 } else
2067 first = false;
2068
2069 ret = fmt->entry(fmt, &hpp, he);
2070 advance_hpp(&hpp, ret);
2071 }
2072
2073 ret = scnprintf(hpp.buf, hpp.size, "%*s", hierarchy_indent, "");
2074 advance_hpp(&hpp, ret);
2075
2076 perf_hpp_list__for_each_format(he->hpp_list, fmt) {
2077 ret = scnprintf(hpp.buf, hpp.size, " ");
2078 advance_hpp(&hpp, ret);
2079
2080 ret = fmt->entry(fmt, &hpp, he);
2081 advance_hpp(&hpp, ret);
2082 }
2083
2084 strim(s);
2085 printed += fprintf(fp, "%s\n", s);
2086
2087 if (he->leaf && folded_sign == '-') {
2088 printed += hist_browser__fprintf_callchain(browser, he, fp,
2089 he->depth + 1);
2090 }
2091
2092 return printed;
2093}
2094
2095static int hist_browser__fprintf(struct hist_browser *browser, FILE *fp)
2096{
2097 struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries),
2098 browser->min_pcnt);
2099 int printed = 0;
2100
2101 while (nd) {
2102 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2103
2104 if (symbol_conf.report_hierarchy) {
2105 printed += hist_browser__fprintf_hierarchy_entry(browser,
2106 h, fp,
2107 h->depth);
2108 } else {
2109 printed += hist_browser__fprintf_entry(browser, h, fp);
2110 }
2111
2112 nd = hists__filter_entries(rb_hierarchy_next(nd),
2113 browser->min_pcnt);
2114 }
2115
2116 return printed;
2117}
2118
2119static int hist_browser__dump(struct hist_browser *browser)
2120{
2121 char filename[64];
2122 FILE *fp;
2123
2124 while (1) {
2125 scnprintf(filename, sizeof(filename), "perf.hist.%d", browser->print_seq);
2126 if (access(filename, F_OK))
2127 break;
2128 /*
2129 * XXX: Just an arbitrary lazy upper limit
2130 */
2131 if (++browser->print_seq == 8192) {
2132 ui_helpline__fpush("Too many perf.hist.N files, nothing written!");
2133 return -1;
2134 }
2135 }
2136
2137 fp = fopen(filename, "w");
2138 if (fp == NULL) {
2139 char bf[64];
2140 const char *err = str_error_r(errno, bf, sizeof(bf));
2141 ui_helpline__fpush("Couldn't write to %s: %s", filename, err);
2142 return -1;
2143 }
2144
2145 ++browser->print_seq;
2146 hist_browser__fprintf(browser, fp);
2147 fclose(fp);
2148 ui_helpline__fpush("%s written!", filename);
2149
2150 return 0;
2151}
2152
2153void hist_browser__init(struct hist_browser *browser,
2154 struct hists *hists)
2155{
2156 struct perf_hpp_fmt *fmt;
2157
2158 browser->hists = hists;
2159 browser->b.refresh = hist_browser__refresh;
2160 browser->b.refresh_dimensions = hist_browser__refresh_dimensions;
2161 browser->b.seek = ui_browser__hists_seek;
2162 browser->b.use_navkeypressed = true;
2163 browser->show_headers = symbol_conf.show_hist_headers;
2164 hist_browser__set_title_space(browser);
2165
2166 if (symbol_conf.report_hierarchy) {
2167 struct perf_hpp_list_node *fmt_node;
2168
2169 /* count overhead columns (in the first node) */
2170 fmt_node = list_first_entry(&hists->hpp_formats,
2171 struct perf_hpp_list_node, list);
2172 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt)
2173 ++browser->b.columns;
2174
2175 /* add a single column for whole hierarchy sort keys*/
2176 ++browser->b.columns;
2177 } else {
2178 hists__for_each_format(hists, fmt)
2179 ++browser->b.columns;
2180 }
2181
2182 hists__reset_column_width(hists);
2183}
2184
2185struct hist_browser *hist_browser__new(struct hists *hists)
2186{
2187 struct hist_browser *browser = zalloc(sizeof(*browser));
2188
2189 if (browser)
2190 hist_browser__init(browser, hists);
2191
2192 return browser;
2193}
2194
2195static struct hist_browser *
2196perf_evsel_browser__new(struct evsel *evsel,
2197 struct hist_browser_timer *hbt,
2198 struct perf_env *env,
2199 struct annotation_options *annotation_opts)
2200{
2201 struct hist_browser *browser = hist_browser__new(evsel__hists(evsel));
2202
2203 if (browser) {
2204 browser->hbt = hbt;
2205 browser->env = env;
2206 browser->title = hists_browser__scnprintf_title;
2207 browser->annotation_opts = annotation_opts;
2208 }
2209 return browser;
2210}
2211
2212void hist_browser__delete(struct hist_browser *browser)
2213{
2214 free(browser);
2215}
2216
2217static struct hist_entry *hist_browser__selected_entry(struct hist_browser *browser)
2218{
2219 return browser->he_selection;
2220}
2221
2222static struct thread *hist_browser__selected_thread(struct hist_browser *browser)
2223{
2224 return browser->he_selection->thread;
2225}
2226
2227/* Check whether the browser is for 'top' or 'report' */
2228static inline bool is_report_browser(void *timer)
2229{
2230 return timer == NULL;
2231}
2232
2233static int hists_browser__scnprintf_title(struct hist_browser *browser, char *bf, size_t size)
2234{
2235 struct hist_browser_timer *hbt = browser->hbt;
2236 int printed = __hists__scnprintf_title(browser->hists, bf, size, !is_report_browser(hbt));
2237
2238 if (!is_report_browser(hbt)) {
2239 struct perf_top *top = hbt->arg;
2240
2241 printed += scnprintf(bf + printed, size - printed,
2242 " lost: %" PRIu64 "/%" PRIu64,
2243 top->lost, top->lost_total);
2244
2245 printed += scnprintf(bf + printed, size - printed,
2246 " drop: %" PRIu64 "/%" PRIu64,
2247 top->drop, top->drop_total);
2248
2249 if (top->zero)
2250 printed += scnprintf(bf + printed, size - printed, " [z]");
2251
2252 perf_top__reset_sample_counters(top);
2253 }
2254
2255
2256 return printed;
2257}
2258
2259static inline void free_popup_options(char **options, int n)
2260{
2261 int i;
2262
2263 for (i = 0; i < n; ++i)
2264 zfree(&options[i]);
2265}
2266
2267/*
2268 * Only runtime switching of perf data file will make "input_name" point
2269 * to a malloced buffer. So add "is_input_name_malloced" flag to decide
2270 * whether we need to call free() for current "input_name" during the switch.
2271 */
2272static bool is_input_name_malloced = false;
2273
2274static int switch_data_file(void)
2275{
2276 char *pwd, *options[32], *abs_path[32], *tmp;
2277 DIR *pwd_dir;
2278 int nr_options = 0, choice = -1, ret = -1;
2279 struct dirent *dent;
2280
2281 pwd = getenv("PWD");
2282 if (!pwd)
2283 return ret;
2284
2285 pwd_dir = opendir(pwd);
2286 if (!pwd_dir)
2287 return ret;
2288
2289 memset(options, 0, sizeof(options));
2290 memset(abs_path, 0, sizeof(abs_path));
2291
2292 while ((dent = readdir(pwd_dir))) {
2293 char path[PATH_MAX];
2294 u64 magic;
2295 char *name = dent->d_name;
2296 FILE *file;
2297
2298 if (!(dent->d_type == DT_REG))
2299 continue;
2300
2301 snprintf(path, sizeof(path), "%s/%s", pwd, name);
2302
2303 file = fopen(path, "r");
2304 if (!file)
2305 continue;
2306
2307 if (fread(&magic, 1, 8, file) < 8)
2308 goto close_file_and_continue;
2309
2310 if (is_perf_magic(magic)) {
2311 options[nr_options] = strdup(name);
2312 if (!options[nr_options])
2313 goto close_file_and_continue;
2314
2315 abs_path[nr_options] = strdup(path);
2316 if (!abs_path[nr_options]) {
2317 zfree(&options[nr_options]);
2318 ui__warning("Can't search all data files due to memory shortage.\n");
2319 fclose(file);
2320 break;
2321 }
2322
2323 nr_options++;
2324 }
2325
2326close_file_and_continue:
2327 fclose(file);
2328 if (nr_options >= 32) {
2329 ui__warning("Too many perf data files in PWD!\n"
2330 "Only the first 32 files will be listed.\n");
2331 break;
2332 }
2333 }
2334 closedir(pwd_dir);
2335
2336 if (nr_options) {
2337 choice = ui__popup_menu(nr_options, options);
2338 if (choice < nr_options && choice >= 0) {
2339 tmp = strdup(abs_path[choice]);
2340 if (tmp) {
2341 if (is_input_name_malloced)
2342 free((void *)input_name);
2343 input_name = tmp;
2344 is_input_name_malloced = true;
2345 ret = 0;
2346 } else
2347 ui__warning("Data switch failed due to memory shortage!\n");
2348 }
2349 }
2350
2351 free_popup_options(options, nr_options);
2352 free_popup_options(abs_path, nr_options);
2353 return ret;
2354}
2355
2356struct popup_action {
2357 unsigned long time;
2358 struct thread *thread;
2359 struct map_symbol ms;
2360 int socket;
2361 struct evsel *evsel;
2362 enum rstype rstype;
2363
2364 int (*fn)(struct hist_browser *browser, struct popup_action *act);
2365};
2366
2367static int
2368do_annotate(struct hist_browser *browser, struct popup_action *act)
2369{
2370 struct evsel *evsel;
2371 struct annotation *notes;
2372 struct hist_entry *he;
2373 int err;
2374
2375 if (!browser->annotation_opts->objdump_path &&
2376 perf_env__lookup_objdump(browser->env, &browser->annotation_opts->objdump_path))
2377 return 0;
2378
2379 notes = symbol__annotation(act->ms.sym);
2380 if (!notes->src)
2381 return 0;
2382
2383 evsel = hists_to_evsel(browser->hists);
2384 err = map_symbol__tui_annotate(&act->ms, evsel, browser->hbt,
2385 browser->annotation_opts);
2386 he = hist_browser__selected_entry(browser);
2387 /*
2388 * offer option to annotate the other branch source or target
2389 * (if they exists) when returning from annotate
2390 */
2391 if ((err == 'q' || err == CTRL('c')) && he->branch_info)
2392 return 1;
2393
2394 ui_browser__update_nr_entries(&browser->b, browser->hists->nr_entries);
2395 if (err)
2396 ui_browser__handle_resize(&browser->b);
2397 return 0;
2398}
2399
2400static int
2401add_annotate_opt(struct hist_browser *browser __maybe_unused,
2402 struct popup_action *act, char **optstr,
2403 struct map *map, struct symbol *sym)
2404{
2405 if (sym == NULL || map->dso->annotate_warned)
2406 return 0;
2407
2408 if (asprintf(optstr, "Annotate %s", sym->name) < 0)
2409 return 0;
2410
2411 act->ms.map = map;
2412 act->ms.sym = sym;
2413 act->fn = do_annotate;
2414 return 1;
2415}
2416
2417static int
2418do_zoom_thread(struct hist_browser *browser, struct popup_action *act)
2419{
2420 struct thread *thread = act->thread;
2421
2422 if ((!hists__has(browser->hists, thread) &&
2423 !hists__has(browser->hists, comm)) || thread == NULL)
2424 return 0;
2425
2426 if (browser->hists->thread_filter) {
2427 pstack__remove(browser->pstack, &browser->hists->thread_filter);
2428 perf_hpp__set_elide(HISTC_THREAD, false);
2429 thread__zput(browser->hists->thread_filter);
2430 ui_helpline__pop();
2431 } else {
2432 if (hists__has(browser->hists, thread)) {
2433 ui_helpline__fpush("To zoom out press ESC or ENTER + \"Zoom out of %s(%d) thread\"",
2434 thread->comm_set ? thread__comm_str(thread) : "",
2435 thread->tid);
2436 } else {
2437 ui_helpline__fpush("To zoom out press ESC or ENTER + \"Zoom out of %s thread\"",
2438 thread->comm_set ? thread__comm_str(thread) : "");
2439 }
2440
2441 browser->hists->thread_filter = thread__get(thread);
2442 perf_hpp__set_elide(HISTC_THREAD, false);
2443 pstack__push(browser->pstack, &browser->hists->thread_filter);
2444 }
2445
2446 hists__filter_by_thread(browser->hists);
2447 hist_browser__reset(browser);
2448 return 0;
2449}
2450
2451static int
2452add_thread_opt(struct hist_browser *browser, struct popup_action *act,
2453 char **optstr, struct thread *thread)
2454{
2455 int ret;
2456
2457 if ((!hists__has(browser->hists, thread) &&
2458 !hists__has(browser->hists, comm)) || thread == NULL)
2459 return 0;
2460
2461 if (hists__has(browser->hists, thread)) {
2462 ret = asprintf(optstr, "Zoom %s %s(%d) thread",
2463 browser->hists->thread_filter ? "out of" : "into",
2464 thread->comm_set ? thread__comm_str(thread) : "",
2465 thread->tid);
2466 } else {
2467 ret = asprintf(optstr, "Zoom %s %s thread",
2468 browser->hists->thread_filter ? "out of" : "into",
2469 thread->comm_set ? thread__comm_str(thread) : "");
2470 }
2471 if (ret < 0)
2472 return 0;
2473
2474 act->thread = thread;
2475 act->fn = do_zoom_thread;
2476 return 1;
2477}
2478
2479static int
2480do_zoom_dso(struct hist_browser *browser, struct popup_action *act)
2481{
2482 struct map *map = act->ms.map;
2483
2484 if (!hists__has(browser->hists, dso) || map == NULL)
2485 return 0;
2486
2487 if (browser->hists->dso_filter) {
2488 pstack__remove(browser->pstack, &browser->hists->dso_filter);
2489 perf_hpp__set_elide(HISTC_DSO, false);
2490 browser->hists->dso_filter = NULL;
2491 ui_helpline__pop();
2492 } else {
2493 ui_helpline__fpush("To zoom out press ESC or ENTER + \"Zoom out of %s DSO\"",
2494 __map__is_kernel(map) ? "the Kernel" : map->dso->short_name);
2495 browser->hists->dso_filter = map->dso;
2496 perf_hpp__set_elide(HISTC_DSO, true);
2497 pstack__push(browser->pstack, &browser->hists->dso_filter);
2498 }
2499
2500 hists__filter_by_dso(browser->hists);
2501 hist_browser__reset(browser);
2502 return 0;
2503}
2504
2505static int
2506add_dso_opt(struct hist_browser *browser, struct popup_action *act,
2507 char **optstr, struct map *map)
2508{
2509 if (!hists__has(browser->hists, dso) || map == NULL)
2510 return 0;
2511
2512 if (asprintf(optstr, "Zoom %s %s DSO",
2513 browser->hists->dso_filter ? "out of" : "into",
2514 __map__is_kernel(map) ? "the Kernel" : map->dso->short_name) < 0)
2515 return 0;
2516
2517 act->ms.map = map;
2518 act->fn = do_zoom_dso;
2519 return 1;
2520}
2521
2522static int
2523do_browse_map(struct hist_browser *browser __maybe_unused,
2524 struct popup_action *act)
2525{
2526 map__browse(act->ms.map);
2527 return 0;
2528}
2529
2530static int
2531add_map_opt(struct hist_browser *browser,
2532 struct popup_action *act, char **optstr, struct map *map)
2533{
2534 if (!hists__has(browser->hists, dso) || map == NULL)
2535 return 0;
2536
2537 if (asprintf(optstr, "Browse map details") < 0)
2538 return 0;
2539
2540 act->ms.map = map;
2541 act->fn = do_browse_map;
2542 return 1;
2543}
2544
2545static int
2546do_run_script(struct hist_browser *browser __maybe_unused,
2547 struct popup_action *act)
2548{
2549 char *script_opt;
2550 int len;
2551 int n = 0;
2552
2553 len = 100;
2554 if (act->thread)
2555 len += strlen(thread__comm_str(act->thread));
2556 else if (act->ms.sym)
2557 len += strlen(act->ms.sym->name);
2558 script_opt = malloc(len);
2559 if (!script_opt)
2560 return -1;
2561
2562 script_opt[0] = 0;
2563 if (act->thread) {
2564 n = scnprintf(script_opt, len, " -c %s ",
2565 thread__comm_str(act->thread));
2566 } else if (act->ms.sym) {
2567 n = scnprintf(script_opt, len, " -S %s ",
2568 act->ms.sym->name);
2569 }
2570
2571 if (act->time) {
2572 char start[32], end[32];
2573 unsigned long starttime = act->time;
2574 unsigned long endtime = act->time + symbol_conf.time_quantum;
2575
2576 if (starttime == endtime) { /* Display 1ms as fallback */
2577 starttime -= 1*NSEC_PER_MSEC;
2578 endtime += 1*NSEC_PER_MSEC;
2579 }
2580 timestamp__scnprintf_usec(starttime, start, sizeof start);
2581 timestamp__scnprintf_usec(endtime, end, sizeof end);
2582 n += snprintf(script_opt + n, len - n, " --time %s,%s", start, end);
2583 }
2584
2585 script_browse(script_opt, act->evsel);
2586 free(script_opt);
2587 return 0;
2588}
2589
2590static int
2591do_res_sample_script(struct hist_browser *browser __maybe_unused,
2592 struct popup_action *act)
2593{
2594 struct hist_entry *he;
2595
2596 he = hist_browser__selected_entry(browser);
2597 res_sample_browse(he->res_samples, he->num_res, act->evsel, act->rstype);
2598 return 0;
2599}
2600
2601static int
2602add_script_opt_2(struct hist_browser *browser __maybe_unused,
2603 struct popup_action *act, char **optstr,
2604 struct thread *thread, struct symbol *sym,
2605 struct evsel *evsel, const char *tstr)
2606{
2607
2608 if (thread) {
2609 if (asprintf(optstr, "Run scripts for samples of thread [%s]%s",
2610 thread__comm_str(thread), tstr) < 0)
2611 return 0;
2612 } else if (sym) {
2613 if (asprintf(optstr, "Run scripts for samples of symbol [%s]%s",
2614 sym->name, tstr) < 0)
2615 return 0;
2616 } else {
2617 if (asprintf(optstr, "Run scripts for all samples%s", tstr) < 0)
2618 return 0;
2619 }
2620
2621 act->thread = thread;
2622 act->ms.sym = sym;
2623 act->evsel = evsel;
2624 act->fn = do_run_script;
2625 return 1;
2626}
2627
2628static int
2629add_script_opt(struct hist_browser *browser,
2630 struct popup_action *act, char **optstr,
2631 struct thread *thread, struct symbol *sym,
2632 struct evsel *evsel)
2633{
2634 int n, j;
2635 struct hist_entry *he;
2636
2637 n = add_script_opt_2(browser, act, optstr, thread, sym, evsel, "");
2638
2639 he = hist_browser__selected_entry(browser);
2640 if (sort_order && strstr(sort_order, "time")) {
2641 char tstr[128];
2642
2643 optstr++;
2644 act++;
2645 j = sprintf(tstr, " in ");
2646 j += timestamp__scnprintf_usec(he->time, tstr + j,
2647 sizeof tstr - j);
2648 j += sprintf(tstr + j, "-");
2649 timestamp__scnprintf_usec(he->time + symbol_conf.time_quantum,
2650 tstr + j, sizeof tstr - j);
2651 n += add_script_opt_2(browser, act, optstr, thread, sym,
2652 evsel, tstr);
2653 act->time = he->time;
2654 }
2655 return n;
2656}
2657
2658static int
2659add_res_sample_opt(struct hist_browser *browser __maybe_unused,
2660 struct popup_action *act, char **optstr,
2661 struct res_sample *res_sample,
2662 struct evsel *evsel,
2663 enum rstype type)
2664{
2665 if (!res_sample)
2666 return 0;
2667
2668 if (asprintf(optstr, "Show context for individual samples %s",
2669 type == A_ASM ? "with assembler" :
2670 type == A_SOURCE ? "with source" : "") < 0)
2671 return 0;
2672
2673 act->fn = do_res_sample_script;
2674 act->evsel = evsel;
2675 act->rstype = type;
2676 return 1;
2677}
2678
2679static int
2680do_switch_data(struct hist_browser *browser __maybe_unused,
2681 struct popup_action *act __maybe_unused)
2682{
2683 if (switch_data_file()) {
2684 ui__warning("Won't switch the data files due to\n"
2685 "no valid data file get selected!\n");
2686 return 0;
2687 }
2688
2689 return K_SWITCH_INPUT_DATA;
2690}
2691
2692static int
2693add_switch_opt(struct hist_browser *browser,
2694 struct popup_action *act, char **optstr)
2695{
2696 if (!is_report_browser(browser->hbt))
2697 return 0;
2698
2699 if (asprintf(optstr, "Switch to another data file in PWD") < 0)
2700 return 0;
2701
2702 act->fn = do_switch_data;
2703 return 1;
2704}
2705
2706static int
2707do_exit_browser(struct hist_browser *browser __maybe_unused,
2708 struct popup_action *act __maybe_unused)
2709{
2710 return 0;
2711}
2712
2713static int
2714add_exit_opt(struct hist_browser *browser __maybe_unused,
2715 struct popup_action *act, char **optstr)
2716{
2717 if (asprintf(optstr, "Exit") < 0)
2718 return 0;
2719
2720 act->fn = do_exit_browser;
2721 return 1;
2722}
2723
2724static int
2725do_zoom_socket(struct hist_browser *browser, struct popup_action *act)
2726{
2727 if (!hists__has(browser->hists, socket) || act->socket < 0)
2728 return 0;
2729
2730 if (browser->hists->socket_filter > -1) {
2731 pstack__remove(browser->pstack, &browser->hists->socket_filter);
2732 browser->hists->socket_filter = -1;
2733 perf_hpp__set_elide(HISTC_SOCKET, false);
2734 } else {
2735 browser->hists->socket_filter = act->socket;
2736 perf_hpp__set_elide(HISTC_SOCKET, true);
2737 pstack__push(browser->pstack, &browser->hists->socket_filter);
2738 }
2739
2740 hists__filter_by_socket(browser->hists);
2741 hist_browser__reset(browser);
2742 return 0;
2743}
2744
2745static int
2746add_socket_opt(struct hist_browser *browser, struct popup_action *act,
2747 char **optstr, int socket_id)
2748{
2749 if (!hists__has(browser->hists, socket) || socket_id < 0)
2750 return 0;
2751
2752 if (asprintf(optstr, "Zoom %s Processor Socket %d",
2753 (browser->hists->socket_filter > -1) ? "out of" : "into",
2754 socket_id) < 0)
2755 return 0;
2756
2757 act->socket = socket_id;
2758 act->fn = do_zoom_socket;
2759 return 1;
2760}
2761
2762static void hist_browser__update_nr_entries(struct hist_browser *hb)
2763{
2764 u64 nr_entries = 0;
2765 struct rb_node *nd = rb_first_cached(&hb->hists->entries);
2766
2767 if (hb->min_pcnt == 0 && !symbol_conf.report_hierarchy) {
2768 hb->nr_non_filtered_entries = hb->hists->nr_non_filtered_entries;
2769 return;
2770 }
2771
2772 while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {
2773 nr_entries++;
2774 nd = rb_hierarchy_next(nd);
2775 }
2776
2777 hb->nr_non_filtered_entries = nr_entries;
2778 hb->nr_hierarchy_entries = nr_entries;
2779}
2780
2781static void hist_browser__update_percent_limit(struct hist_browser *hb,
2782 double percent)
2783{
2784 struct hist_entry *he;
2785 struct rb_node *nd = rb_first_cached(&hb->hists->entries);
2786 u64 total = hists__total_period(hb->hists);
2787 u64 min_callchain_hits = total * (percent / 100);
2788
2789 hb->min_pcnt = callchain_param.min_percent = percent;
2790
2791 while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {
2792 he = rb_entry(nd, struct hist_entry, rb_node);
2793
2794 if (he->has_no_entry) {
2795 he->has_no_entry = false;
2796 he->nr_rows = 0;
2797 }
2798
2799 if (!he->leaf || !hist_entry__has_callchains(he) || !symbol_conf.use_callchain)
2800 goto next;
2801
2802 if (callchain_param.mode == CHAIN_GRAPH_REL) {
2803 total = he->stat.period;
2804
2805 if (symbol_conf.cumulate_callchain)
2806 total = he->stat_acc->period;
2807
2808 min_callchain_hits = total * (percent / 100);
2809 }
2810
2811 callchain_param.sort(&he->sorted_chain, he->callchain,
2812 min_callchain_hits, &callchain_param);
2813
2814next:
2815 nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD);
2816
2817 /* force to re-evaluate folding state of callchains */
2818 he->init_have_children = false;
2819 hist_entry__set_folding(he, hb, false);
2820 }
2821}
2822
2823static int perf_evsel__hists_browse(struct evsel *evsel, int nr_events,
2824 const char *helpline,
2825 bool left_exits,
2826 struct hist_browser_timer *hbt,
2827 float min_pcnt,
2828 struct perf_env *env,
2829 bool warn_lost_event,
2830 struct annotation_options *annotation_opts)
2831{
2832 struct hists *hists = evsel__hists(evsel);
2833 struct hist_browser *browser = perf_evsel_browser__new(evsel, hbt, env, annotation_opts);
2834 struct branch_info *bi = NULL;
2835#define MAX_OPTIONS 16
2836 char *options[MAX_OPTIONS];
2837 struct popup_action actions[MAX_OPTIONS];
2838 int nr_options = 0;
2839 int key = -1;
2840 char buf[64];
2841 int delay_secs = hbt ? hbt->refresh : 0;
2842
2843#define HIST_BROWSER_HELP_COMMON \
2844 "h/?/F1 Show this window\n" \
2845 "UP/DOWN/PGUP\n" \
2846 "PGDN/SPACE Navigate\n" \
2847 "q/ESC/CTRL+C Exit browser or go back to previous screen\n\n" \
2848 "For multiple event sessions:\n\n" \
2849 "TAB/UNTAB Switch events\n\n" \
2850 "For symbolic views (--sort has sym):\n\n" \
2851 "ENTER Zoom into DSO/Threads & Annotate current symbol\n" \
2852 "ESC Zoom out\n" \
2853 "a Annotate current symbol\n" \
2854 "C Collapse all callchains\n" \
2855 "d Zoom into current DSO\n" \
2856 "E Expand all callchains\n" \
2857 "F Toggle percentage of filtered entries\n" \
2858 "H Display column headers\n" \
2859 "L Change percent limit\n" \
2860 "m Display context menu\n" \
2861 "S Zoom into current Processor Socket\n" \
2862
2863 /* help messages are sorted by lexical order of the hotkey */
2864 static const char report_help[] = HIST_BROWSER_HELP_COMMON
2865 "i Show header information\n"
2866 "P Print histograms to perf.hist.N\n"
2867 "r Run available scripts\n"
2868 "s Switch to another data file in PWD\n"
2869 "t Zoom into current Thread\n"
2870 "V Verbose (DSO names in callchains, etc)\n"
2871 "/ Filter symbol by name";
2872 static const char top_help[] = HIST_BROWSER_HELP_COMMON
2873 "P Print histograms to perf.hist.N\n"
2874 "t Zoom into current Thread\n"
2875 "V Verbose (DSO names in callchains, etc)\n"
2876 "z Toggle zeroing of samples\n"
2877 "f Enable/Disable events\n"
2878 "/ Filter symbol by name";
2879
2880 if (browser == NULL)
2881 return -1;
2882
2883 /* reset abort key so that it can get Ctrl-C as a key */
2884 SLang_reset_tty();
2885 SLang_init_tty(0, 0, 0);
2886
2887 if (min_pcnt)
2888 browser->min_pcnt = min_pcnt;
2889 hist_browser__update_nr_entries(browser);
2890
2891 browser->pstack = pstack__new(3);
2892 if (browser->pstack == NULL)
2893 goto out;
2894
2895 ui_helpline__push(helpline);
2896
2897 memset(options, 0, sizeof(options));
2898 memset(actions, 0, sizeof(actions));
2899
2900 if (symbol_conf.col_width_list_str)
2901 perf_hpp__set_user_width(symbol_conf.col_width_list_str);
2902
2903 if (!is_report_browser(hbt))
2904 browser->b.no_samples_msg = "Collecting samples...";
2905
2906 while (1) {
2907 struct thread *thread = NULL;
2908 struct map *map = NULL;
2909 int choice = 0;
2910 int socked_id = -1;
2911
2912 nr_options = 0;
2913
2914 key = hist_browser__run(browser, helpline,
2915 warn_lost_event);
2916
2917 if (browser->he_selection != NULL) {
2918 thread = hist_browser__selected_thread(browser);
2919 map = browser->selection->map;
2920 socked_id = browser->he_selection->socket;
2921 }
2922 switch (key) {
2923 case K_TAB:
2924 case K_UNTAB:
2925 if (nr_events == 1)
2926 continue;
2927 /*
2928 * Exit the browser, let hists__browser_tree
2929 * go to the next or previous
2930 */
2931 goto out_free_stack;
2932 case 'a':
2933 if (!hists__has(hists, sym)) {
2934 ui_browser__warning(&browser->b, delay_secs * 2,
2935 "Annotation is only available for symbolic views, "
2936 "include \"sym*\" in --sort to use it.");
2937 continue;
2938 }
2939
2940 if (browser->selection == NULL ||
2941 browser->selection->sym == NULL ||
2942 browser->selection->map->dso->annotate_warned)
2943 continue;
2944
2945 actions->ms.map = browser->selection->map;
2946 actions->ms.sym = browser->selection->sym;
2947 do_annotate(browser, actions);
2948 continue;
2949 case 'P':
2950 hist_browser__dump(browser);
2951 continue;
2952 case 'd':
2953 actions->ms.map = map;
2954 do_zoom_dso(browser, actions);
2955 continue;
2956 case 'V':
2957 verbose = (verbose + 1) % 4;
2958 browser->show_dso = verbose > 0;
2959 ui_helpline__fpush("Verbosity level set to %d\n",
2960 verbose);
2961 continue;
2962 case 't':
2963 actions->thread = thread;
2964 do_zoom_thread(browser, actions);
2965 continue;
2966 case 'S':
2967 actions->socket = socked_id;
2968 do_zoom_socket(browser, actions);
2969 continue;
2970 case '/':
2971 if (ui_browser__input_window("Symbol to show",
2972 "Please enter the name of symbol you want to see.\n"
2973 "To remove the filter later, press / + ENTER.",
2974 buf, "ENTER: OK, ESC: Cancel",
2975 delay_secs * 2) == K_ENTER) {
2976 hists->symbol_filter_str = *buf ? buf : NULL;
2977 hists__filter_by_symbol(hists);
2978 hist_browser__reset(browser);
2979 }
2980 continue;
2981 case 'r':
2982 if (is_report_browser(hbt)) {
2983 actions->thread = NULL;
2984 actions->ms.sym = NULL;
2985 do_run_script(browser, actions);
2986 }
2987 continue;
2988 case 's':
2989 if (is_report_browser(hbt)) {
2990 key = do_switch_data(browser, actions);
2991 if (key == K_SWITCH_INPUT_DATA)
2992 goto out_free_stack;
2993 }
2994 continue;
2995 case 'i':
2996 /* env->arch is NULL for live-mode (i.e. perf top) */
2997 if (env->arch)
2998 tui__header_window(env);
2999 continue;
3000 case 'F':
3001 symbol_conf.filter_relative ^= 1;
3002 continue;
3003 case 'z':
3004 if (!is_report_browser(hbt)) {
3005 struct perf_top *top = hbt->arg;
3006
3007 top->zero = !top->zero;
3008 }
3009 continue;
3010 case 'L':
3011 if (ui_browser__input_window("Percent Limit",
3012 "Please enter the value you want to hide entries under that percent.",
3013 buf, "ENTER: OK, ESC: Cancel",
3014 delay_secs * 2) == K_ENTER) {
3015 char *end;
3016 double new_percent = strtod(buf, &end);
3017
3018 if (new_percent < 0 || new_percent > 100) {
3019 ui_browser__warning(&browser->b, delay_secs * 2,
3020 "Invalid percent: %.2f", new_percent);
3021 continue;
3022 }
3023
3024 hist_browser__update_percent_limit(browser, new_percent);
3025 hist_browser__reset(browser);
3026 }
3027 continue;
3028 case K_F1:
3029 case 'h':
3030 case '?':
3031 ui_browser__help_window(&browser->b,
3032 is_report_browser(hbt) ? report_help : top_help);
3033 continue;
3034 case K_ENTER:
3035 case K_RIGHT:
3036 case 'm':
3037 /* menu */
3038 break;
3039 case K_ESC:
3040 case K_LEFT: {
3041 const void *top;
3042
3043 if (pstack__empty(browser->pstack)) {
3044 /*
3045 * Go back to the perf_evsel_menu__run or other user
3046 */
3047 if (left_exits)
3048 goto out_free_stack;
3049
3050 if (key == K_ESC &&
3051 ui_browser__dialog_yesno(&browser->b,
3052 "Do you really want to exit?"))
3053 goto out_free_stack;
3054
3055 continue;
3056 }
3057 top = pstack__peek(browser->pstack);
3058 if (top == &browser->hists->dso_filter) {
3059 /*
3060 * No need to set actions->dso here since
3061 * it's just to remove the current filter.
3062 * Ditto for thread below.
3063 */
3064 do_zoom_dso(browser, actions);
3065 } else if (top == &browser->hists->thread_filter) {
3066 do_zoom_thread(browser, actions);
3067 } else if (top == &browser->hists->socket_filter) {
3068 do_zoom_socket(browser, actions);
3069 }
3070 continue;
3071 }
3072 case 'q':
3073 case CTRL('c'):
3074 goto out_free_stack;
3075 case 'f':
3076 if (!is_report_browser(hbt)) {
3077 struct perf_top *top = hbt->arg;
3078
3079 perf_evlist__toggle_enable(top->evlist);
3080 /*
3081 * No need to refresh, resort/decay histogram
3082 * entries if we are not collecting samples:
3083 */
3084 if (top->evlist->enabled) {
3085 helpline = "Press 'f' to disable the events or 'h' to see other hotkeys";
3086 hbt->refresh = delay_secs;
3087 } else {
3088 helpline = "Press 'f' again to re-enable the events";
3089 hbt->refresh = 0;
3090 }
3091 continue;
3092 }
3093 /* Fall thru */
3094 default:
3095 helpline = "Press '?' for help on key bindings";
3096 continue;
3097 }
3098
3099 if (!hists__has(hists, sym) || browser->selection == NULL)
3100 goto skip_annotation;
3101
3102 if (sort__mode == SORT_MODE__BRANCH) {
3103
3104 if (browser->he_selection)
3105 bi = browser->he_selection->branch_info;
3106
3107 if (bi == NULL)
3108 goto skip_annotation;
3109
3110 nr_options += add_annotate_opt(browser,
3111 &actions[nr_options],
3112 &options[nr_options],
3113 bi->from.map,
3114 bi->from.sym);
3115 if (bi->to.sym != bi->from.sym)
3116 nr_options += add_annotate_opt(browser,
3117 &actions[nr_options],
3118 &options[nr_options],
3119 bi->to.map,
3120 bi->to.sym);
3121 } else {
3122 nr_options += add_annotate_opt(browser,
3123 &actions[nr_options],
3124 &options[nr_options],
3125 browser->selection->map,
3126 browser->selection->sym);
3127 }
3128skip_annotation:
3129 nr_options += add_thread_opt(browser, &actions[nr_options],
3130 &options[nr_options], thread);
3131 nr_options += add_dso_opt(browser, &actions[nr_options],
3132 &options[nr_options], map);
3133 nr_options += add_map_opt(browser, &actions[nr_options],
3134 &options[nr_options],
3135 browser->selection ?
3136 browser->selection->map : NULL);
3137 nr_options += add_socket_opt(browser, &actions[nr_options],
3138 &options[nr_options],
3139 socked_id);
3140 /* perf script support */
3141 if (!is_report_browser(hbt))
3142 goto skip_scripting;
3143
3144 if (browser->he_selection) {
3145 if (hists__has(hists, thread) && thread) {
3146 nr_options += add_script_opt(browser,
3147 &actions[nr_options],
3148 &options[nr_options],
3149 thread, NULL, evsel);
3150 }
3151 /*
3152 * Note that browser->selection != NULL
3153 * when browser->he_selection is not NULL,
3154 * so we don't need to check browser->selection
3155 * before fetching browser->selection->sym like what
3156 * we do before fetching browser->selection->map.
3157 *
3158 * See hist_browser__show_entry.
3159 */
3160 if (hists__has(hists, sym) && browser->selection->sym) {
3161 nr_options += add_script_opt(browser,
3162 &actions[nr_options],
3163 &options[nr_options],
3164 NULL, browser->selection->sym,
3165 evsel);
3166 }
3167 }
3168 nr_options += add_script_opt(browser, &actions[nr_options],
3169 &options[nr_options], NULL, NULL, evsel);
3170 nr_options += add_res_sample_opt(browser, &actions[nr_options],
3171 &options[nr_options],
3172 hist_browser__selected_entry(browser)->res_samples,
3173 evsel, A_NORMAL);
3174 nr_options += add_res_sample_opt(browser, &actions[nr_options],
3175 &options[nr_options],
3176 hist_browser__selected_entry(browser)->res_samples,
3177 evsel, A_ASM);
3178 nr_options += add_res_sample_opt(browser, &actions[nr_options],
3179 &options[nr_options],
3180 hist_browser__selected_entry(browser)->res_samples,
3181 evsel, A_SOURCE);
3182 nr_options += add_switch_opt(browser, &actions[nr_options],
3183 &options[nr_options]);
3184skip_scripting:
3185 nr_options += add_exit_opt(browser, &actions[nr_options],
3186 &options[nr_options]);
3187
3188 do {
3189 struct popup_action *act;
3190
3191 choice = ui__popup_menu(nr_options, options);
3192 if (choice == -1 || choice >= nr_options)
3193 break;
3194
3195 act = &actions[choice];
3196 key = act->fn(browser, act);
3197 } while (key == 1);
3198
3199 if (key == K_SWITCH_INPUT_DATA)
3200 break;
3201 }
3202out_free_stack:
3203 pstack__delete(browser->pstack);
3204out:
3205 hist_browser__delete(browser);
3206 free_popup_options(options, MAX_OPTIONS);
3207 return key;
3208}
3209
3210struct evsel_menu {
3211 struct ui_browser b;
3212 struct evsel *selection;
3213 struct annotation_options *annotation_opts;
3214 bool lost_events, lost_events_warned;
3215 float min_pcnt;
3216 struct perf_env *env;
3217};
3218
3219static void perf_evsel_menu__write(struct ui_browser *browser,
3220 void *entry, int row)
3221{
3222 struct evsel_menu *menu = container_of(browser,
3223 struct evsel_menu, b);
3224 struct evsel *evsel = list_entry(entry, struct evsel, core.node);
3225 struct hists *hists = evsel__hists(evsel);
3226 bool current_entry = ui_browser__is_current_entry(browser, row);
3227 unsigned long nr_events = hists->stats.nr_events[PERF_RECORD_SAMPLE];
3228 const char *ev_name = perf_evsel__name(evsel);
3229 char bf[256], unit;
3230 const char *warn = " ";
3231 size_t printed;
3232
3233 ui_browser__set_color(browser, current_entry ? HE_COLORSET_SELECTED :
3234 HE_COLORSET_NORMAL);
3235
3236 if (perf_evsel__is_group_event(evsel)) {
3237 struct evsel *pos;
3238
3239 ev_name = perf_evsel__group_name(evsel);
3240
3241 for_each_group_member(pos, evsel) {
3242 struct hists *pos_hists = evsel__hists(pos);
3243 nr_events += pos_hists->stats.nr_events[PERF_RECORD_SAMPLE];
3244 }
3245 }
3246
3247 nr_events = convert_unit(nr_events, &unit);
3248 printed = scnprintf(bf, sizeof(bf), "%lu%c%s%s", nr_events,
3249 unit, unit == ' ' ? "" : " ", ev_name);
3250 ui_browser__printf(browser, "%s", bf);
3251
3252 nr_events = hists->stats.nr_events[PERF_RECORD_LOST];
3253 if (nr_events != 0) {
3254 menu->lost_events = true;
3255 if (!current_entry)
3256 ui_browser__set_color(browser, HE_COLORSET_TOP);
3257 nr_events = convert_unit(nr_events, &unit);
3258 printed += scnprintf(bf, sizeof(bf), ": %ld%c%schunks LOST!",
3259 nr_events, unit, unit == ' ' ? "" : " ");
3260 warn = bf;
3261 }
3262
3263 ui_browser__write_nstring(browser, warn, browser->width - printed);
3264
3265 if (current_entry)
3266 menu->selection = evsel;
3267}
3268
3269static int perf_evsel_menu__run(struct evsel_menu *menu,
3270 int nr_events, const char *help,
3271 struct hist_browser_timer *hbt,
3272 bool warn_lost_event)
3273{
3274 struct evlist *evlist = menu->b.priv;
3275 struct evsel *pos;
3276 const char *title = "Available samples";
3277 int delay_secs = hbt ? hbt->refresh : 0;
3278 int key;
3279
3280 if (ui_browser__show(&menu->b, title,
3281 "ESC: exit, ENTER|->: Browse histograms") < 0)
3282 return -1;
3283
3284 while (1) {
3285 key = ui_browser__run(&menu->b, delay_secs);
3286
3287 switch (key) {
3288 case K_TIMER:
3289 if (hbt)
3290 hbt->timer(hbt->arg);
3291
3292 if (!menu->lost_events_warned &&
3293 menu->lost_events &&
3294 warn_lost_event) {
3295 ui_browser__warn_lost_events(&menu->b);
3296 menu->lost_events_warned = true;
3297 }
3298 continue;
3299 case K_RIGHT:
3300 case K_ENTER:
3301 if (!menu->selection)
3302 continue;
3303 pos = menu->selection;
3304browse_hists:
3305 perf_evlist__set_selected(evlist, pos);
3306 /*
3307 * Give the calling tool a chance to populate the non
3308 * default evsel resorted hists tree.
3309 */
3310 if (hbt)
3311 hbt->timer(hbt->arg);
3312 key = perf_evsel__hists_browse(pos, nr_events, help,
3313 true, hbt,
3314 menu->min_pcnt,
3315 menu->env,
3316 warn_lost_event,
3317 menu->annotation_opts);
3318 ui_browser__show_title(&menu->b, title);
3319 switch (key) {
3320 case K_TAB:
3321 if (pos->core.node.next == &evlist->core.entries)
3322 pos = evlist__first(evlist);
3323 else
3324 pos = perf_evsel__next(pos);
3325 goto browse_hists;
3326 case K_UNTAB:
3327 if (pos->core.node.prev == &evlist->core.entries)
3328 pos = evlist__last(evlist);
3329 else
3330 pos = perf_evsel__prev(pos);
3331 goto browse_hists;
3332 case K_SWITCH_INPUT_DATA:
3333 case 'q':
3334 case CTRL('c'):
3335 goto out;
3336 case K_ESC:
3337 default:
3338 continue;
3339 }
3340 case K_LEFT:
3341 continue;
3342 case K_ESC:
3343 if (!ui_browser__dialog_yesno(&menu->b,
3344 "Do you really want to exit?"))
3345 continue;
3346 /* Fall thru */
3347 case 'q':
3348 case CTRL('c'):
3349 goto out;
3350 default:
3351 continue;
3352 }
3353 }
3354
3355out:
3356 ui_browser__hide(&menu->b);
3357 return key;
3358}
3359
3360static bool filter_group_entries(struct ui_browser *browser __maybe_unused,
3361 void *entry)
3362{
3363 struct evsel *evsel = list_entry(entry, struct evsel, core.node);
3364
3365 if (symbol_conf.event_group && !perf_evsel__is_group_leader(evsel))
3366 return true;
3367
3368 return false;
3369}
3370
3371static int __perf_evlist__tui_browse_hists(struct evlist *evlist,
3372 int nr_entries, const char *help,
3373 struct hist_browser_timer *hbt,
3374 float min_pcnt,
3375 struct perf_env *env,
3376 bool warn_lost_event,
3377 struct annotation_options *annotation_opts)
3378{
3379 struct evsel *pos;
3380 struct evsel_menu menu = {
3381 .b = {
3382 .entries = &evlist->core.entries,
3383 .refresh = ui_browser__list_head_refresh,
3384 .seek = ui_browser__list_head_seek,
3385 .write = perf_evsel_menu__write,
3386 .filter = filter_group_entries,
3387 .nr_entries = nr_entries,
3388 .priv = evlist,
3389 },
3390 .min_pcnt = min_pcnt,
3391 .env = env,
3392 .annotation_opts = annotation_opts,
3393 };
3394
3395 ui_helpline__push("Press ESC to exit");
3396
3397 evlist__for_each_entry(evlist, pos) {
3398 const char *ev_name = perf_evsel__name(pos);
3399 size_t line_len = strlen(ev_name) + 7;
3400
3401 if (menu.b.width < line_len)
3402 menu.b.width = line_len;
3403 }
3404
3405 return perf_evsel_menu__run(&menu, nr_entries, help,
3406 hbt, warn_lost_event);
3407}
3408
3409int perf_evlist__tui_browse_hists(struct evlist *evlist, const char *help,
3410 struct hist_browser_timer *hbt,
3411 float min_pcnt,
3412 struct perf_env *env,
3413 bool warn_lost_event,
3414 struct annotation_options *annotation_opts)
3415{
3416 int nr_entries = evlist->core.nr_entries;
3417
3418single_entry:
3419 if (nr_entries == 1) {
3420 struct evsel *first = evlist__first(evlist);
3421
3422 return perf_evsel__hists_browse(first, nr_entries, help,
3423 false, hbt, min_pcnt,
3424 env, warn_lost_event,
3425 annotation_opts);
3426 }
3427
3428 if (symbol_conf.event_group) {
3429 struct evsel *pos;
3430
3431 nr_entries = 0;
3432 evlist__for_each_entry(evlist, pos) {
3433 if (perf_evsel__is_group_leader(pos))
3434 nr_entries++;
3435 }
3436
3437 if (nr_entries == 1)
3438 goto single_entry;
3439 }
3440
3441 return __perf_evlist__tui_browse_hists(evlist, nr_entries, help,
3442 hbt, min_pcnt, env,
3443 warn_lost_event,
3444 annotation_opts);
3445}
1// SPDX-License-Identifier: GPL-2.0
2#include <dirent.h>
3#include <errno.h>
4#include <inttypes.h>
5#include <stdio.h>
6#include <stdlib.h>
7#include <string.h>
8#include <linux/rbtree.h>
9#include <linux/string.h>
10#include <sys/ttydefaults.h>
11#include <linux/time64.h>
12#include <linux/zalloc.h>
13
14#include "../../util/debug.h"
15#include "../../util/dso.h"
16#include "../../util/callchain.h"
17#include "../../util/evsel.h"
18#include "../../util/evlist.h"
19#include "../../util/header.h"
20#include "../../util/hist.h"
21#include "../../util/machine.h"
22#include "../../util/map.h"
23#include "../../util/maps.h"
24#include "../../util/symbol.h"
25#include "../../util/map_symbol.h"
26#include "../../util/branch.h"
27#include "../../util/pstack.h"
28#include "../../util/sort.h"
29#include "../../util/top.h"
30#include "../../util/thread.h"
31#include "../../util/block-info.h"
32#include "../../util/util.h"
33#include "../../arch/common.h"
34
35#include "../browsers/hists.h"
36#include "../helpline.h"
37#include "../util.h"
38#include "../ui.h"
39#include "map.h"
40#include "annotate.h"
41#include "srcline.h"
42#include "string2.h"
43#include "units.h"
44#include "time-utils.h"
45
46#include <linux/ctype.h>
47
48extern void hist_browser__init_hpp(void);
49
50static int hists_browser__scnprintf_title(struct hist_browser *browser, char *bf, size_t size);
51static void hist_browser__update_nr_entries(struct hist_browser *hb);
52
53static struct rb_node *hists__filter_entries(struct rb_node *nd,
54 float min_pcnt);
55
56static bool hist_browser__has_filter(struct hist_browser *hb)
57{
58 return hists__has_filter(hb->hists) || hb->min_pcnt || symbol_conf.has_filter || hb->c2c_filter;
59}
60
61static int hist_browser__get_folding(struct hist_browser *browser)
62{
63 struct rb_node *nd;
64 struct hists *hists = browser->hists;
65 int unfolded_rows = 0;
66
67 for (nd = rb_first_cached(&hists->entries);
68 (nd = hists__filter_entries(nd, browser->min_pcnt)) != NULL;
69 nd = rb_hierarchy_next(nd)) {
70 struct hist_entry *he =
71 rb_entry(nd, struct hist_entry, rb_node);
72
73 if (he->leaf && he->unfolded)
74 unfolded_rows += he->nr_rows;
75 }
76 return unfolded_rows;
77}
78
79static void hist_browser__set_title_space(struct hist_browser *hb)
80{
81 struct ui_browser *browser = &hb->b;
82 struct hists *hists = hb->hists;
83 struct perf_hpp_list *hpp_list = hists->hpp_list;
84
85 browser->extra_title_lines = hb->show_headers ? hpp_list->nr_header_lines : 0;
86}
87
88static u32 hist_browser__nr_entries(struct hist_browser *hb)
89{
90 u32 nr_entries;
91
92 if (symbol_conf.report_hierarchy)
93 nr_entries = hb->nr_hierarchy_entries;
94 else if (hist_browser__has_filter(hb))
95 nr_entries = hb->nr_non_filtered_entries;
96 else
97 nr_entries = hb->hists->nr_entries;
98
99 hb->nr_callchain_rows = hist_browser__get_folding(hb);
100 return nr_entries + hb->nr_callchain_rows;
101}
102
103static void hist_browser__update_rows(struct hist_browser *hb)
104{
105 struct ui_browser *browser = &hb->b;
106 struct hists *hists = hb->hists;
107 struct perf_hpp_list *hpp_list = hists->hpp_list;
108 u16 index_row;
109
110 if (!hb->show_headers) {
111 browser->rows += browser->extra_title_lines;
112 browser->extra_title_lines = 0;
113 return;
114 }
115
116 browser->extra_title_lines = hpp_list->nr_header_lines;
117 browser->rows -= browser->extra_title_lines;
118 /*
119 * Verify if we were at the last line and that line isn't
120 * visible because we now show the header line(s).
121 */
122 index_row = browser->index - browser->top_idx;
123 if (index_row >= browser->rows)
124 browser->index -= index_row - browser->rows + 1;
125}
126
127static void hist_browser__refresh_dimensions(struct ui_browser *browser)
128{
129 struct hist_browser *hb = container_of(browser, struct hist_browser, b);
130
131 /* 3 == +/- toggle symbol before actual hist_entry rendering */
132 browser->width = 3 + (hists__sort_list_width(hb->hists) + sizeof("[k]"));
133 /*
134 * FIXME: Just keeping existing behaviour, but this really should be
135 * before updating browser->width, as it will invalidate the
136 * calculation above. Fix this and the fallout in another
137 * changeset.
138 */
139 ui_browser__refresh_dimensions(browser);
140}
141
142static void hist_browser__reset(struct hist_browser *browser)
143{
144 /*
145 * The hists__remove_entry_filter() already folds non-filtered
146 * entries so we can assume it has 0 callchain rows.
147 */
148 browser->nr_callchain_rows = 0;
149
150 hist_browser__update_nr_entries(browser);
151 browser->b.nr_entries = hist_browser__nr_entries(browser);
152 hist_browser__refresh_dimensions(&browser->b);
153 ui_browser__reset_index(&browser->b);
154}
155
156static char tree__folded_sign(bool unfolded)
157{
158 return unfolded ? '-' : '+';
159}
160
161static char hist_entry__folded(const struct hist_entry *he)
162{
163 return he->has_children ? tree__folded_sign(he->unfolded) : ' ';
164}
165
166static char callchain_list__folded(const struct callchain_list *cl)
167{
168 return cl->has_children ? tree__folded_sign(cl->unfolded) : ' ';
169}
170
171static void callchain_list__set_folding(struct callchain_list *cl, bool unfold)
172{
173 cl->unfolded = unfold ? cl->has_children : false;
174}
175
176static int callchain_node__count_rows_rb_tree(struct callchain_node *node)
177{
178 int n = 0;
179 struct rb_node *nd;
180
181 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
182 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
183 struct callchain_list *chain;
184 char folded_sign = ' '; /* No children */
185
186 list_for_each_entry(chain, &child->val, list) {
187 ++n;
188
189 /* We need this because we may not have children */
190 folded_sign = callchain_list__folded(chain);
191 if (folded_sign == '+')
192 break;
193 }
194
195 if (folded_sign == '-') /* Have children and they're unfolded */
196 n += callchain_node__count_rows_rb_tree(child);
197 }
198
199 return n;
200}
201
202static int callchain_node__count_flat_rows(struct callchain_node *node)
203{
204 struct callchain_list *chain;
205 char folded_sign = 0;
206 int n = 0;
207
208 list_for_each_entry(chain, &node->parent_val, list) {
209 if (!folded_sign) {
210 /* only check first chain list entry */
211 folded_sign = callchain_list__folded(chain);
212 if (folded_sign == '+')
213 return 1;
214 }
215 n++;
216 }
217
218 list_for_each_entry(chain, &node->val, list) {
219 if (!folded_sign) {
220 /* node->parent_val list might be empty */
221 folded_sign = callchain_list__folded(chain);
222 if (folded_sign == '+')
223 return 1;
224 }
225 n++;
226 }
227
228 return n;
229}
230
231static int callchain_node__count_folded_rows(struct callchain_node *node __maybe_unused)
232{
233 return 1;
234}
235
236static int callchain_node__count_rows(struct callchain_node *node)
237{
238 struct callchain_list *chain;
239 bool unfolded = false;
240 int n = 0;
241
242 if (callchain_param.mode == CHAIN_FLAT)
243 return callchain_node__count_flat_rows(node);
244 else if (callchain_param.mode == CHAIN_FOLDED)
245 return callchain_node__count_folded_rows(node);
246
247 list_for_each_entry(chain, &node->val, list) {
248 ++n;
249
250 unfolded = chain->unfolded;
251 }
252
253 if (unfolded)
254 n += callchain_node__count_rows_rb_tree(node);
255
256 return n;
257}
258
259static int callchain__count_rows(struct rb_root *chain)
260{
261 struct rb_node *nd;
262 int n = 0;
263
264 for (nd = rb_first(chain); nd; nd = rb_next(nd)) {
265 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
266 n += callchain_node__count_rows(node);
267 }
268
269 return n;
270}
271
272static int hierarchy_count_rows(struct hist_browser *hb, struct hist_entry *he,
273 bool include_children)
274{
275 int count = 0;
276 struct rb_node *node;
277 struct hist_entry *child;
278
279 if (he->leaf)
280 return callchain__count_rows(&he->sorted_chain);
281
282 if (he->has_no_entry)
283 return 1;
284
285 node = rb_first_cached(&he->hroot_out);
286 while (node) {
287 float percent;
288
289 child = rb_entry(node, struct hist_entry, rb_node);
290 percent = hist_entry__get_percent_limit(child);
291
292 if (!child->filtered && percent >= hb->min_pcnt) {
293 count++;
294
295 if (include_children && child->unfolded)
296 count += hierarchy_count_rows(hb, child, true);
297 }
298
299 node = rb_next(node);
300 }
301 return count;
302}
303
304static bool hist_entry__toggle_fold(struct hist_entry *he)
305{
306 if (!he)
307 return false;
308
309 if (!he->has_children)
310 return false;
311
312 he->unfolded = !he->unfolded;
313 return true;
314}
315
316static bool callchain_list__toggle_fold(struct callchain_list *cl)
317{
318 if (!cl)
319 return false;
320
321 if (!cl->has_children)
322 return false;
323
324 cl->unfolded = !cl->unfolded;
325 return true;
326}
327
328static void callchain_node__init_have_children_rb_tree(struct callchain_node *node)
329{
330 struct rb_node *nd = rb_first(&node->rb_root);
331
332 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
333 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
334 struct callchain_list *chain;
335 bool first = true;
336
337 list_for_each_entry(chain, &child->val, list) {
338 if (first) {
339 first = false;
340 chain->has_children = chain->list.next != &child->val ||
341 !RB_EMPTY_ROOT(&child->rb_root);
342 } else
343 chain->has_children = chain->list.next == &child->val &&
344 !RB_EMPTY_ROOT(&child->rb_root);
345 }
346
347 callchain_node__init_have_children_rb_tree(child);
348 }
349}
350
351static void callchain_node__init_have_children(struct callchain_node *node,
352 bool has_sibling)
353{
354 struct callchain_list *chain;
355
356 chain = list_entry(node->val.next, struct callchain_list, list);
357 chain->has_children = has_sibling;
358
359 if (!list_empty(&node->val)) {
360 chain = list_entry(node->val.prev, struct callchain_list, list);
361 chain->has_children = !RB_EMPTY_ROOT(&node->rb_root);
362 }
363
364 callchain_node__init_have_children_rb_tree(node);
365}
366
367static void callchain__init_have_children(struct rb_root *root)
368{
369 struct rb_node *nd = rb_first(root);
370 bool has_sibling = nd && rb_next(nd);
371
372 for (nd = rb_first(root); nd; nd = rb_next(nd)) {
373 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
374 callchain_node__init_have_children(node, has_sibling);
375 if (callchain_param.mode == CHAIN_FLAT ||
376 callchain_param.mode == CHAIN_FOLDED)
377 callchain_node__make_parent_list(node);
378 }
379}
380
381static void hist_entry__init_have_children(struct hist_entry *he)
382{
383 if (he->init_have_children)
384 return;
385
386 if (he->leaf) {
387 he->has_children = !RB_EMPTY_ROOT(&he->sorted_chain);
388 callchain__init_have_children(&he->sorted_chain);
389 } else {
390 he->has_children = !RB_EMPTY_ROOT(&he->hroot_out.rb_root);
391 }
392
393 he->init_have_children = true;
394}
395
396static bool hist_browser__selection_has_children(struct hist_browser *browser)
397{
398 struct hist_entry *he = browser->he_selection;
399 struct map_symbol *ms = browser->selection;
400
401 if (!he || !ms)
402 return false;
403
404 if (ms == &he->ms)
405 return he->has_children;
406
407 return container_of(ms, struct callchain_list, ms)->has_children;
408}
409
410static bool hist_browser__selection_unfolded(struct hist_browser *browser)
411{
412 struct hist_entry *he = browser->he_selection;
413 struct map_symbol *ms = browser->selection;
414
415 if (!he || !ms)
416 return false;
417
418 if (ms == &he->ms)
419 return he->unfolded;
420
421 return container_of(ms, struct callchain_list, ms)->unfolded;
422}
423
424static char *hist_browser__selection_sym_name(struct hist_browser *browser, char *bf, size_t size)
425{
426 struct hist_entry *he = browser->he_selection;
427 struct map_symbol *ms = browser->selection;
428 struct callchain_list *callchain_entry;
429
430 if (!he || !ms)
431 return NULL;
432
433 if (ms == &he->ms) {
434 hist_entry__sym_snprintf(he, bf, size, 0);
435 return bf + 4; // skip the level, e.g. '[k] '
436 }
437
438 callchain_entry = container_of(ms, struct callchain_list, ms);
439 return callchain_list__sym_name(callchain_entry, bf, size, browser->show_dso);
440}
441
442static bool hist_browser__toggle_fold(struct hist_browser *browser)
443{
444 struct hist_entry *he = browser->he_selection;
445 struct map_symbol *ms = browser->selection;
446 struct callchain_list *cl = container_of(ms, struct callchain_list, ms);
447 bool has_children;
448
449 if (!he || !ms)
450 return false;
451
452 if (ms == &he->ms)
453 has_children = hist_entry__toggle_fold(he);
454 else
455 has_children = callchain_list__toggle_fold(cl);
456
457 if (has_children) {
458 int child_rows = 0;
459
460 hist_entry__init_have_children(he);
461 browser->b.nr_entries -= he->nr_rows;
462
463 if (he->leaf)
464 browser->nr_callchain_rows -= he->nr_rows;
465 else
466 browser->nr_hierarchy_entries -= he->nr_rows;
467
468 if (symbol_conf.report_hierarchy)
469 child_rows = hierarchy_count_rows(browser, he, true);
470
471 if (he->unfolded) {
472 if (he->leaf)
473 he->nr_rows = callchain__count_rows(
474 &he->sorted_chain);
475 else
476 he->nr_rows = hierarchy_count_rows(browser, he, false);
477
478 /* account grand children */
479 if (symbol_conf.report_hierarchy)
480 browser->b.nr_entries += child_rows - he->nr_rows;
481
482 if (!he->leaf && he->nr_rows == 0) {
483 he->has_no_entry = true;
484 he->nr_rows = 1;
485 }
486 } else {
487 if (symbol_conf.report_hierarchy)
488 browser->b.nr_entries -= child_rows - he->nr_rows;
489
490 if (he->has_no_entry)
491 he->has_no_entry = false;
492
493 he->nr_rows = 0;
494 }
495
496 browser->b.nr_entries += he->nr_rows;
497
498 if (he->leaf)
499 browser->nr_callchain_rows += he->nr_rows;
500 else
501 browser->nr_hierarchy_entries += he->nr_rows;
502
503 return true;
504 }
505
506 /* If it doesn't have children, no toggling performed */
507 return false;
508}
509
510static int callchain_node__set_folding_rb_tree(struct callchain_node *node, bool unfold)
511{
512 int n = 0;
513 struct rb_node *nd;
514
515 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
516 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
517 struct callchain_list *chain;
518 bool has_children = false;
519
520 list_for_each_entry(chain, &child->val, list) {
521 ++n;
522 callchain_list__set_folding(chain, unfold);
523 has_children = chain->has_children;
524 }
525
526 if (has_children)
527 n += callchain_node__set_folding_rb_tree(child, unfold);
528 }
529
530 return n;
531}
532
533static int callchain_node__set_folding(struct callchain_node *node, bool unfold)
534{
535 struct callchain_list *chain;
536 bool has_children = false;
537 int n = 0;
538
539 list_for_each_entry(chain, &node->val, list) {
540 ++n;
541 callchain_list__set_folding(chain, unfold);
542 has_children = chain->has_children;
543 }
544
545 if (has_children)
546 n += callchain_node__set_folding_rb_tree(node, unfold);
547
548 return n;
549}
550
551static int callchain__set_folding(struct rb_root *chain, bool unfold)
552{
553 struct rb_node *nd;
554 int n = 0;
555
556 for (nd = rb_first(chain); nd; nd = rb_next(nd)) {
557 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
558 n += callchain_node__set_folding(node, unfold);
559 }
560
561 return n;
562}
563
564static int hierarchy_set_folding(struct hist_browser *hb, struct hist_entry *he,
565 bool unfold __maybe_unused)
566{
567 float percent;
568 struct rb_node *nd;
569 struct hist_entry *child;
570 int n = 0;
571
572 for (nd = rb_first_cached(&he->hroot_out); nd; nd = rb_next(nd)) {
573 child = rb_entry(nd, struct hist_entry, rb_node);
574 percent = hist_entry__get_percent_limit(child);
575 if (!child->filtered && percent >= hb->min_pcnt)
576 n++;
577 }
578
579 return n;
580}
581
582static void hist_entry__set_folding(struct hist_entry *he,
583 struct hist_browser *hb, bool unfold)
584{
585 hist_entry__init_have_children(he);
586 he->unfolded = unfold ? he->has_children : false;
587
588 if (he->has_children) {
589 int n;
590
591 if (he->leaf)
592 n = callchain__set_folding(&he->sorted_chain, unfold);
593 else
594 n = hierarchy_set_folding(hb, he, unfold);
595
596 he->nr_rows = unfold ? n : 0;
597 } else
598 he->nr_rows = 0;
599}
600
601static void
602__hist_browser__set_folding(struct hist_browser *browser, bool unfold)
603{
604 struct rb_node *nd;
605 struct hist_entry *he;
606 double percent;
607
608 nd = rb_first_cached(&browser->hists->entries);
609 while (nd) {
610 he = rb_entry(nd, struct hist_entry, rb_node);
611
612 /* set folding state even if it's currently folded */
613 nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD);
614
615 hist_entry__set_folding(he, browser, unfold);
616
617 percent = hist_entry__get_percent_limit(he);
618 if (he->filtered || percent < browser->min_pcnt)
619 continue;
620
621 if (!he->depth || unfold)
622 browser->nr_hierarchy_entries++;
623 if (he->leaf)
624 browser->nr_callchain_rows += he->nr_rows;
625 else if (unfold && !hist_entry__has_hierarchy_children(he, browser->min_pcnt)) {
626 browser->nr_hierarchy_entries++;
627 he->has_no_entry = true;
628 he->nr_rows = 1;
629 } else
630 he->has_no_entry = false;
631 }
632}
633
634static void hist_browser__set_folding(struct hist_browser *browser, bool unfold)
635{
636 browser->nr_hierarchy_entries = 0;
637 browser->nr_callchain_rows = 0;
638 __hist_browser__set_folding(browser, unfold);
639
640 browser->b.nr_entries = hist_browser__nr_entries(browser);
641 /* Go to the start, we may be way after valid entries after a collapse */
642 ui_browser__reset_index(&browser->b);
643}
644
645static void hist_browser__set_folding_selected(struct hist_browser *browser, bool unfold)
646{
647 if (!browser->he_selection)
648 return;
649
650 if (unfold == browser->he_selection->unfolded)
651 return;
652
653 hist_browser__toggle_fold(browser);
654}
655
656static void ui_browser__warn_lost_events(struct ui_browser *browser)
657{
658 ui_browser__warning(browser, 4,
659 "Events are being lost, check IO/CPU overload!\n\n"
660 "You may want to run 'perf' using a RT scheduler policy:\n\n"
661 " perf top -r 80\n\n"
662 "Or reduce the sampling frequency.");
663}
664
665static int hist_browser__title(struct hist_browser *browser, char *bf, size_t size)
666{
667 return browser->title ? browser->title(browser, bf, size) : 0;
668}
669
670static int hist_browser__handle_hotkey(struct hist_browser *browser, bool warn_lost_event, char *title, size_t size, int key)
671{
672 switch (key) {
673 case K_TIMER: {
674 struct hist_browser_timer *hbt = browser->hbt;
675 struct evsel *evsel = hists_to_evsel(browser->hists);
676 u64 nr_entries;
677
678 WARN_ON_ONCE(!hbt);
679
680 if (hbt)
681 hbt->timer(hbt->arg);
682
683 if (hist_browser__has_filter(browser) || symbol_conf.report_hierarchy)
684 hist_browser__update_nr_entries(browser);
685
686 nr_entries = hist_browser__nr_entries(browser);
687 ui_browser__update_nr_entries(&browser->b, nr_entries);
688
689 if (warn_lost_event &&
690 (evsel->evlist->stats.nr_lost_warned !=
691 evsel->evlist->stats.nr_events[PERF_RECORD_LOST])) {
692 evsel->evlist->stats.nr_lost_warned =
693 evsel->evlist->stats.nr_events[PERF_RECORD_LOST];
694 ui_browser__warn_lost_events(&browser->b);
695 }
696
697 hist_browser__title(browser, title, size);
698 ui_browser__show_title(&browser->b, title);
699 break;
700 }
701 case 'D': { /* Debug */
702 struct hist_entry *h = rb_entry(browser->b.top, struct hist_entry, rb_node);
703 static int seq;
704
705 ui_helpline__pop();
706 ui_helpline__fpush("%d: nr_ent=(%d,%d), etl: %d, rows=%d, idx=%d, fve: idx=%d, row_off=%d, nrows=%d",
707 seq++, browser->b.nr_entries, browser->hists->nr_entries,
708 browser->b.extra_title_lines, browser->b.rows,
709 browser->b.index, browser->b.top_idx, h->row_offset, h->nr_rows);
710 }
711 break;
712 case 'C':
713 /* Collapse the whole world. */
714 hist_browser__set_folding(browser, false);
715 break;
716 case 'c':
717 /* Collapse the selected entry. */
718 hist_browser__set_folding_selected(browser, false);
719 break;
720 case 'E':
721 /* Expand the whole world. */
722 hist_browser__set_folding(browser, true);
723 break;
724 case 'e':
725 /* Toggle expand/collapse the selected entry. */
726 hist_browser__toggle_fold(browser);
727 break;
728 case 'H':
729 browser->show_headers = !browser->show_headers;
730 hist_browser__update_rows(browser);
731 break;
732 case '+':
733 if (hist_browser__toggle_fold(browser))
734 break;
735 /* fall thru */
736 default:
737 return -1;
738 }
739
740 return 0;
741}
742
743int hist_browser__run(struct hist_browser *browser, const char *help,
744 bool warn_lost_event, int key)
745{
746 char title[160];
747 struct hist_browser_timer *hbt = browser->hbt;
748 int delay_secs = hbt ? hbt->refresh : 0;
749
750 browser->b.entries = &browser->hists->entries;
751 browser->b.nr_entries = hist_browser__nr_entries(browser);
752
753 hist_browser__title(browser, title, sizeof(title));
754
755 if (ui_browser__show(&browser->b, title, "%s", help) < 0)
756 return -1;
757
758 if (key && hist_browser__handle_hotkey(browser, warn_lost_event, title, sizeof(title), key))
759 goto out;
760
761 while (1) {
762 key = ui_browser__run(&browser->b, delay_secs);
763
764 if (hist_browser__handle_hotkey(browser, warn_lost_event, title, sizeof(title), key))
765 break;
766 }
767out:
768 ui_browser__hide(&browser->b);
769 return key;
770}
771
772struct callchain_print_arg {
773 /* for hists browser */
774 off_t row_offset;
775 bool is_current_entry;
776
777 /* for file dump */
778 FILE *fp;
779 int printed;
780};
781
782typedef void (*print_callchain_entry_fn)(struct hist_browser *browser,
783 struct callchain_list *chain,
784 const char *str, int offset,
785 unsigned short row,
786 struct callchain_print_arg *arg);
787
788static void hist_browser__show_callchain_entry(struct hist_browser *browser,
789 struct callchain_list *chain,
790 const char *str, int offset,
791 unsigned short row,
792 struct callchain_print_arg *arg)
793{
794 int color, width;
795 char folded_sign = callchain_list__folded(chain);
796 bool show_annotated = browser->show_dso && chain->ms.sym && symbol__annotation(chain->ms.sym)->src;
797
798 color = HE_COLORSET_NORMAL;
799 width = browser->b.width - (offset + 2);
800 if (ui_browser__is_current_entry(&browser->b, row)) {
801 browser->selection = &chain->ms;
802 color = HE_COLORSET_SELECTED;
803 arg->is_current_entry = true;
804 }
805
806 ui_browser__set_color(&browser->b, color);
807 ui_browser__gotorc(&browser->b, row, 0);
808 ui_browser__write_nstring(&browser->b, " ", offset);
809 ui_browser__printf(&browser->b, "%c", folded_sign);
810 ui_browser__write_graph(&browser->b, show_annotated ? SLSMG_RARROW_CHAR : ' ');
811 ui_browser__write_nstring(&browser->b, str, width);
812}
813
814static void hist_browser__fprintf_callchain_entry(struct hist_browser *b __maybe_unused,
815 struct callchain_list *chain,
816 const char *str, int offset,
817 unsigned short row __maybe_unused,
818 struct callchain_print_arg *arg)
819{
820 char folded_sign = callchain_list__folded(chain);
821
822 arg->printed += fprintf(arg->fp, "%*s%c %s\n", offset, " ",
823 folded_sign, str);
824}
825
826typedef bool (*check_output_full_fn)(struct hist_browser *browser,
827 unsigned short row);
828
829static bool hist_browser__check_output_full(struct hist_browser *browser,
830 unsigned short row)
831{
832 return browser->b.rows == row;
833}
834
835static bool hist_browser__check_dump_full(struct hist_browser *browser __maybe_unused,
836 unsigned short row __maybe_unused)
837{
838 return false;
839}
840
841#define LEVEL_OFFSET_STEP 3
842
843static int hist_browser__show_callchain_list(struct hist_browser *browser,
844 struct callchain_node *node,
845 struct callchain_list *chain,
846 unsigned short row, u64 total,
847 bool need_percent, int offset,
848 print_callchain_entry_fn print,
849 struct callchain_print_arg *arg)
850{
851 char bf[1024], *alloc_str;
852 char buf[64], *alloc_str2;
853 const char *str;
854 int ret = 1;
855
856 if (arg->row_offset != 0) {
857 arg->row_offset--;
858 return 0;
859 }
860
861 alloc_str = NULL;
862 alloc_str2 = NULL;
863
864 str = callchain_list__sym_name(chain, bf, sizeof(bf),
865 browser->show_dso);
866
867 if (symbol_conf.show_branchflag_count) {
868 callchain_list_counts__printf_value(chain, NULL,
869 buf, sizeof(buf));
870
871 if (asprintf(&alloc_str2, "%s%s", str, buf) < 0)
872 str = "Not enough memory!";
873 else
874 str = alloc_str2;
875 }
876
877 if (need_percent) {
878 callchain_node__scnprintf_value(node, buf, sizeof(buf),
879 total);
880
881 if (asprintf(&alloc_str, "%s %s", buf, str) < 0)
882 str = "Not enough memory!";
883 else
884 str = alloc_str;
885 }
886
887 print(browser, chain, str, offset, row, arg);
888 free(alloc_str);
889 free(alloc_str2);
890
891 return ret;
892}
893
894static bool check_percent_display(struct rb_node *node, u64 parent_total)
895{
896 struct callchain_node *child;
897
898 if (node == NULL)
899 return false;
900
901 if (rb_next(node))
902 return true;
903
904 child = rb_entry(node, struct callchain_node, rb_node);
905 return callchain_cumul_hits(child) != parent_total;
906}
907
908static int hist_browser__show_callchain_flat(struct hist_browser *browser,
909 struct rb_root *root,
910 unsigned short row, u64 total,
911 u64 parent_total,
912 print_callchain_entry_fn print,
913 struct callchain_print_arg *arg,
914 check_output_full_fn is_output_full)
915{
916 struct rb_node *node;
917 int first_row = row, offset = LEVEL_OFFSET_STEP;
918 bool need_percent;
919
920 node = rb_first(root);
921 need_percent = check_percent_display(node, parent_total);
922
923 while (node) {
924 struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);
925 struct rb_node *next = rb_next(node);
926 struct callchain_list *chain;
927 char folded_sign = ' ';
928 int first = true;
929 int extra_offset = 0;
930
931 list_for_each_entry(chain, &child->parent_val, list) {
932 bool was_first = first;
933
934 if (first)
935 first = false;
936 else if (need_percent)
937 extra_offset = LEVEL_OFFSET_STEP;
938
939 folded_sign = callchain_list__folded(chain);
940
941 row += hist_browser__show_callchain_list(browser, child,
942 chain, row, total,
943 was_first && need_percent,
944 offset + extra_offset,
945 print, arg);
946
947 if (is_output_full(browser, row))
948 goto out;
949
950 if (folded_sign == '+')
951 goto next;
952 }
953
954 list_for_each_entry(chain, &child->val, list) {
955 bool was_first = first;
956
957 if (first)
958 first = false;
959 else if (need_percent)
960 extra_offset = LEVEL_OFFSET_STEP;
961
962 folded_sign = callchain_list__folded(chain);
963
964 row += hist_browser__show_callchain_list(browser, child,
965 chain, row, total,
966 was_first && need_percent,
967 offset + extra_offset,
968 print, arg);
969
970 if (is_output_full(browser, row))
971 goto out;
972
973 if (folded_sign == '+')
974 break;
975 }
976
977next:
978 if (is_output_full(browser, row))
979 break;
980 node = next;
981 }
982out:
983 return row - first_row;
984}
985
986static char *hist_browser__folded_callchain_str(struct hist_browser *browser,
987 struct callchain_list *chain,
988 char *value_str, char *old_str)
989{
990 char bf[1024];
991 const char *str;
992 char *new;
993
994 str = callchain_list__sym_name(chain, bf, sizeof(bf),
995 browser->show_dso);
996 if (old_str) {
997 if (asprintf(&new, "%s%s%s", old_str,
998 symbol_conf.field_sep ?: ";", str) < 0)
999 new = NULL;
1000 } else {
1001 if (value_str) {
1002 if (asprintf(&new, "%s %s", value_str, str) < 0)
1003 new = NULL;
1004 } else {
1005 if (asprintf(&new, "%s", str) < 0)
1006 new = NULL;
1007 }
1008 }
1009 return new;
1010}
1011
1012static int hist_browser__show_callchain_folded(struct hist_browser *browser,
1013 struct rb_root *root,
1014 unsigned short row, u64 total,
1015 u64 parent_total,
1016 print_callchain_entry_fn print,
1017 struct callchain_print_arg *arg,
1018 check_output_full_fn is_output_full)
1019{
1020 struct rb_node *node;
1021 int first_row = row, offset = LEVEL_OFFSET_STEP;
1022 bool need_percent;
1023
1024 node = rb_first(root);
1025 need_percent = check_percent_display(node, parent_total);
1026
1027 while (node) {
1028 struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);
1029 struct rb_node *next = rb_next(node);
1030 struct callchain_list *chain, *first_chain = NULL;
1031 int first = true;
1032 char *value_str = NULL, *value_str_alloc = NULL;
1033 char *chain_str = NULL, *chain_str_alloc = NULL;
1034
1035 if (arg->row_offset != 0) {
1036 arg->row_offset--;
1037 goto next;
1038 }
1039
1040 if (need_percent) {
1041 char buf[64];
1042
1043 callchain_node__scnprintf_value(child, buf, sizeof(buf), total);
1044 if (asprintf(&value_str, "%s", buf) < 0) {
1045 value_str = (char *)"<...>";
1046 goto do_print;
1047 }
1048 value_str_alloc = value_str;
1049 }
1050
1051 list_for_each_entry(chain, &child->parent_val, list) {
1052 chain_str = hist_browser__folded_callchain_str(browser,
1053 chain, value_str, chain_str);
1054 if (first) {
1055 first = false;
1056 first_chain = chain;
1057 }
1058
1059 if (chain_str == NULL) {
1060 chain_str = (char *)"Not enough memory!";
1061 goto do_print;
1062 }
1063
1064 chain_str_alloc = chain_str;
1065 }
1066
1067 list_for_each_entry(chain, &child->val, list) {
1068 chain_str = hist_browser__folded_callchain_str(browser,
1069 chain, value_str, chain_str);
1070 if (first) {
1071 first = false;
1072 first_chain = chain;
1073 }
1074
1075 if (chain_str == NULL) {
1076 chain_str = (char *)"Not enough memory!";
1077 goto do_print;
1078 }
1079
1080 chain_str_alloc = chain_str;
1081 }
1082
1083do_print:
1084 print(browser, first_chain, chain_str, offset, row++, arg);
1085 free(value_str_alloc);
1086 free(chain_str_alloc);
1087
1088next:
1089 if (is_output_full(browser, row))
1090 break;
1091 node = next;
1092 }
1093
1094 return row - first_row;
1095}
1096
1097static int hist_browser__show_callchain_graph(struct hist_browser *browser,
1098 struct rb_root *root, int level,
1099 unsigned short row, u64 total,
1100 u64 parent_total,
1101 print_callchain_entry_fn print,
1102 struct callchain_print_arg *arg,
1103 check_output_full_fn is_output_full)
1104{
1105 struct rb_node *node;
1106 int first_row = row, offset = level * LEVEL_OFFSET_STEP;
1107 bool need_percent;
1108 u64 percent_total = total;
1109
1110 if (callchain_param.mode == CHAIN_GRAPH_REL)
1111 percent_total = parent_total;
1112
1113 node = rb_first(root);
1114 need_percent = check_percent_display(node, parent_total);
1115
1116 while (node) {
1117 struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);
1118 struct rb_node *next = rb_next(node);
1119 struct callchain_list *chain;
1120 char folded_sign = ' ';
1121 int first = true;
1122 int extra_offset = 0;
1123
1124 list_for_each_entry(chain, &child->val, list) {
1125 bool was_first = first;
1126
1127 if (first)
1128 first = false;
1129 else if (need_percent)
1130 extra_offset = LEVEL_OFFSET_STEP;
1131
1132 folded_sign = callchain_list__folded(chain);
1133
1134 row += hist_browser__show_callchain_list(browser, child,
1135 chain, row, percent_total,
1136 was_first && need_percent,
1137 offset + extra_offset,
1138 print, arg);
1139
1140 if (is_output_full(browser, row))
1141 goto out;
1142
1143 if (folded_sign == '+')
1144 break;
1145 }
1146
1147 if (folded_sign == '-') {
1148 const int new_level = level + (extra_offset ? 2 : 1);
1149
1150 row += hist_browser__show_callchain_graph(browser, &child->rb_root,
1151 new_level, row, total,
1152 child->children_hit,
1153 print, arg, is_output_full);
1154 }
1155 if (is_output_full(browser, row))
1156 break;
1157 node = next;
1158 }
1159out:
1160 return row - first_row;
1161}
1162
1163static int hist_browser__show_callchain(struct hist_browser *browser,
1164 struct hist_entry *entry, int level,
1165 unsigned short row,
1166 print_callchain_entry_fn print,
1167 struct callchain_print_arg *arg,
1168 check_output_full_fn is_output_full)
1169{
1170 u64 total = hists__total_period(entry->hists);
1171 u64 parent_total;
1172 int printed;
1173
1174 if (symbol_conf.cumulate_callchain)
1175 parent_total = entry->stat_acc->period;
1176 else
1177 parent_total = entry->stat.period;
1178
1179 if (callchain_param.mode == CHAIN_FLAT) {
1180 printed = hist_browser__show_callchain_flat(browser,
1181 &entry->sorted_chain, row,
1182 total, parent_total, print, arg,
1183 is_output_full);
1184 } else if (callchain_param.mode == CHAIN_FOLDED) {
1185 printed = hist_browser__show_callchain_folded(browser,
1186 &entry->sorted_chain, row,
1187 total, parent_total, print, arg,
1188 is_output_full);
1189 } else {
1190 printed = hist_browser__show_callchain_graph(browser,
1191 &entry->sorted_chain, level, row,
1192 total, parent_total, print, arg,
1193 is_output_full);
1194 }
1195
1196 if (arg->is_current_entry)
1197 browser->he_selection = entry;
1198
1199 return printed;
1200}
1201
1202struct hpp_arg {
1203 struct ui_browser *b;
1204 char folded_sign;
1205 bool current_entry;
1206};
1207
1208int __hpp__slsmg_color_printf(struct perf_hpp *hpp, const char *fmt, ...)
1209{
1210 struct hpp_arg *arg = hpp->ptr;
1211 int ret, len;
1212 va_list args;
1213 double percent;
1214
1215 va_start(args, fmt);
1216 len = va_arg(args, int);
1217 percent = va_arg(args, double);
1218 va_end(args);
1219
1220 ui_browser__set_percent_color(arg->b, percent, arg->current_entry);
1221
1222 ret = scnprintf(hpp->buf, hpp->size, fmt, len, percent);
1223 ui_browser__printf(arg->b, "%s", hpp->buf);
1224
1225 return ret;
1226}
1227
1228#define __HPP_COLOR_PERCENT_FN(_type, _field) \
1229static u64 __hpp_get_##_field(struct hist_entry *he) \
1230{ \
1231 return he->stat._field; \
1232} \
1233 \
1234static int \
1235hist_browser__hpp_color_##_type(struct perf_hpp_fmt *fmt, \
1236 struct perf_hpp *hpp, \
1237 struct hist_entry *he) \
1238{ \
1239 return hpp__fmt(fmt, hpp, he, __hpp_get_##_field, " %*.2f%%", \
1240 __hpp__slsmg_color_printf, true); \
1241}
1242
1243#define __HPP_COLOR_ACC_PERCENT_FN(_type, _field) \
1244static u64 __hpp_get_acc_##_field(struct hist_entry *he) \
1245{ \
1246 return he->stat_acc->_field; \
1247} \
1248 \
1249static int \
1250hist_browser__hpp_color_##_type(struct perf_hpp_fmt *fmt, \
1251 struct perf_hpp *hpp, \
1252 struct hist_entry *he) \
1253{ \
1254 if (!symbol_conf.cumulate_callchain) { \
1255 struct hpp_arg *arg = hpp->ptr; \
1256 int len = fmt->user_len ?: fmt->len; \
1257 int ret = scnprintf(hpp->buf, hpp->size, \
1258 "%*s", len, "N/A"); \
1259 ui_browser__printf(arg->b, "%s", hpp->buf); \
1260 \
1261 return ret; \
1262 } \
1263 return hpp__fmt(fmt, hpp, he, __hpp_get_acc_##_field, \
1264 " %*.2f%%", __hpp__slsmg_color_printf, true); \
1265}
1266
1267__HPP_COLOR_PERCENT_FN(overhead, period)
1268__HPP_COLOR_PERCENT_FN(overhead_sys, period_sys)
1269__HPP_COLOR_PERCENT_FN(overhead_us, period_us)
1270__HPP_COLOR_PERCENT_FN(overhead_guest_sys, period_guest_sys)
1271__HPP_COLOR_PERCENT_FN(overhead_guest_us, period_guest_us)
1272__HPP_COLOR_ACC_PERCENT_FN(overhead_acc, period)
1273
1274#undef __HPP_COLOR_PERCENT_FN
1275#undef __HPP_COLOR_ACC_PERCENT_FN
1276
1277void hist_browser__init_hpp(void)
1278{
1279 perf_hpp__format[PERF_HPP__OVERHEAD].color =
1280 hist_browser__hpp_color_overhead;
1281 perf_hpp__format[PERF_HPP__OVERHEAD_SYS].color =
1282 hist_browser__hpp_color_overhead_sys;
1283 perf_hpp__format[PERF_HPP__OVERHEAD_US].color =
1284 hist_browser__hpp_color_overhead_us;
1285 perf_hpp__format[PERF_HPP__OVERHEAD_GUEST_SYS].color =
1286 hist_browser__hpp_color_overhead_guest_sys;
1287 perf_hpp__format[PERF_HPP__OVERHEAD_GUEST_US].color =
1288 hist_browser__hpp_color_overhead_guest_us;
1289 perf_hpp__format[PERF_HPP__OVERHEAD_ACC].color =
1290 hist_browser__hpp_color_overhead_acc;
1291
1292 res_sample_init();
1293}
1294
1295static int hist_browser__show_entry(struct hist_browser *browser,
1296 struct hist_entry *entry,
1297 unsigned short row)
1298{
1299 int printed = 0;
1300 int width = browser->b.width;
1301 char folded_sign = ' ';
1302 bool current_entry = ui_browser__is_current_entry(&browser->b, row);
1303 bool use_callchain = hist_entry__has_callchains(entry) && symbol_conf.use_callchain;
1304 off_t row_offset = entry->row_offset;
1305 bool first = true;
1306 struct perf_hpp_fmt *fmt;
1307
1308 if (current_entry) {
1309 browser->he_selection = entry;
1310 browser->selection = &entry->ms;
1311 }
1312
1313 if (use_callchain) {
1314 hist_entry__init_have_children(entry);
1315 folded_sign = hist_entry__folded(entry);
1316 }
1317
1318 if (row_offset == 0) {
1319 struct hpp_arg arg = {
1320 .b = &browser->b,
1321 .folded_sign = folded_sign,
1322 .current_entry = current_entry,
1323 };
1324 int column = 0;
1325
1326 ui_browser__gotorc(&browser->b, row, 0);
1327
1328 hists__for_each_format(browser->hists, fmt) {
1329 char s[2048];
1330 struct perf_hpp hpp = {
1331 .buf = s,
1332 .size = sizeof(s),
1333 .ptr = &arg,
1334 };
1335
1336 if (perf_hpp__should_skip(fmt, entry->hists) ||
1337 column++ < browser->b.horiz_scroll)
1338 continue;
1339
1340 if (current_entry && browser->b.navkeypressed) {
1341 ui_browser__set_color(&browser->b,
1342 HE_COLORSET_SELECTED);
1343 } else {
1344 ui_browser__set_color(&browser->b,
1345 HE_COLORSET_NORMAL);
1346 }
1347
1348 if (first) {
1349 if (use_callchain) {
1350 ui_browser__printf(&browser->b, "%c ", folded_sign);
1351 width -= 2;
1352 }
1353 first = false;
1354 } else {
1355 ui_browser__printf(&browser->b, " ");
1356 width -= 2;
1357 }
1358
1359 if (fmt->color) {
1360 int ret = fmt->color(fmt, &hpp, entry);
1361 hist_entry__snprintf_alignment(entry, &hpp, fmt, ret);
1362 /*
1363 * fmt->color() already used ui_browser to
1364 * print the non alignment bits, skip it (+ret):
1365 */
1366 ui_browser__printf(&browser->b, "%s", s + ret);
1367 } else {
1368 hist_entry__snprintf_alignment(entry, &hpp, fmt, fmt->entry(fmt, &hpp, entry));
1369 ui_browser__printf(&browser->b, "%s", s);
1370 }
1371 width -= hpp.buf - s;
1372 }
1373
1374 /* The scroll bar isn't being used */
1375 if (!browser->b.navkeypressed)
1376 width += 1;
1377
1378 ui_browser__write_nstring(&browser->b, "", width);
1379
1380 ++row;
1381 ++printed;
1382 } else
1383 --row_offset;
1384
1385 if (folded_sign == '-' && row != browser->b.rows) {
1386 struct callchain_print_arg arg = {
1387 .row_offset = row_offset,
1388 .is_current_entry = current_entry,
1389 };
1390
1391 printed += hist_browser__show_callchain(browser,
1392 entry, 1, row,
1393 hist_browser__show_callchain_entry,
1394 &arg,
1395 hist_browser__check_output_full);
1396 }
1397
1398 return printed;
1399}
1400
1401static int hist_browser__show_hierarchy_entry(struct hist_browser *browser,
1402 struct hist_entry *entry,
1403 unsigned short row,
1404 int level)
1405{
1406 int printed = 0;
1407 int width = browser->b.width;
1408 char folded_sign = ' ';
1409 bool current_entry = ui_browser__is_current_entry(&browser->b, row);
1410 off_t row_offset = entry->row_offset;
1411 bool first = true;
1412 struct perf_hpp_fmt *fmt;
1413 struct perf_hpp_list_node *fmt_node;
1414 struct hpp_arg arg = {
1415 .b = &browser->b,
1416 .current_entry = current_entry,
1417 };
1418 int column = 0;
1419 int hierarchy_indent = (entry->hists->nr_hpp_node - 2) * HIERARCHY_INDENT;
1420
1421 if (current_entry) {
1422 browser->he_selection = entry;
1423 browser->selection = &entry->ms;
1424 }
1425
1426 hist_entry__init_have_children(entry);
1427 folded_sign = hist_entry__folded(entry);
1428 arg.folded_sign = folded_sign;
1429
1430 if (entry->leaf && row_offset) {
1431 row_offset--;
1432 goto show_callchain;
1433 }
1434
1435 ui_browser__gotorc(&browser->b, row, 0);
1436
1437 if (current_entry && browser->b.navkeypressed)
1438 ui_browser__set_color(&browser->b, HE_COLORSET_SELECTED);
1439 else
1440 ui_browser__set_color(&browser->b, HE_COLORSET_NORMAL);
1441
1442 ui_browser__write_nstring(&browser->b, "", level * HIERARCHY_INDENT);
1443 width -= level * HIERARCHY_INDENT;
1444
1445 /* the first hpp_list_node is for overhead columns */
1446 fmt_node = list_first_entry(&entry->hists->hpp_formats,
1447 struct perf_hpp_list_node, list);
1448 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
1449 char s[2048];
1450 struct perf_hpp hpp = {
1451 .buf = s,
1452 .size = sizeof(s),
1453 .ptr = &arg,
1454 };
1455
1456 if (perf_hpp__should_skip(fmt, entry->hists) ||
1457 column++ < browser->b.horiz_scroll)
1458 continue;
1459
1460 if (current_entry && browser->b.navkeypressed) {
1461 ui_browser__set_color(&browser->b,
1462 HE_COLORSET_SELECTED);
1463 } else {
1464 ui_browser__set_color(&browser->b,
1465 HE_COLORSET_NORMAL);
1466 }
1467
1468 if (first) {
1469 ui_browser__printf(&browser->b, "%c ", folded_sign);
1470 width -= 2;
1471 first = false;
1472 } else {
1473 ui_browser__printf(&browser->b, " ");
1474 width -= 2;
1475 }
1476
1477 if (fmt->color) {
1478 int ret = fmt->color(fmt, &hpp, entry);
1479 hist_entry__snprintf_alignment(entry, &hpp, fmt, ret);
1480 /*
1481 * fmt->color() already used ui_browser to
1482 * print the non alignment bits, skip it (+ret):
1483 */
1484 ui_browser__printf(&browser->b, "%s", s + ret);
1485 } else {
1486 int ret = fmt->entry(fmt, &hpp, entry);
1487 hist_entry__snprintf_alignment(entry, &hpp, fmt, ret);
1488 ui_browser__printf(&browser->b, "%s", s);
1489 }
1490 width -= hpp.buf - s;
1491 }
1492
1493 if (!first) {
1494 ui_browser__write_nstring(&browser->b, "", hierarchy_indent);
1495 width -= hierarchy_indent;
1496 }
1497
1498 if (column >= browser->b.horiz_scroll) {
1499 char s[2048];
1500 struct perf_hpp hpp = {
1501 .buf = s,
1502 .size = sizeof(s),
1503 .ptr = &arg,
1504 };
1505
1506 if (current_entry && browser->b.navkeypressed) {
1507 ui_browser__set_color(&browser->b,
1508 HE_COLORSET_SELECTED);
1509 } else {
1510 ui_browser__set_color(&browser->b,
1511 HE_COLORSET_NORMAL);
1512 }
1513
1514 perf_hpp_list__for_each_format(entry->hpp_list, fmt) {
1515 if (first) {
1516 ui_browser__printf(&browser->b, "%c ", folded_sign);
1517 first = false;
1518 } else {
1519 ui_browser__write_nstring(&browser->b, "", 2);
1520 }
1521
1522 width -= 2;
1523
1524 /*
1525 * No need to call hist_entry__snprintf_alignment()
1526 * since this fmt is always the last column in the
1527 * hierarchy mode.
1528 */
1529 if (fmt->color) {
1530 width -= fmt->color(fmt, &hpp, entry);
1531 } else {
1532 int i = 0;
1533
1534 width -= fmt->entry(fmt, &hpp, entry);
1535 ui_browser__printf(&browser->b, "%s", skip_spaces(s));
1536
1537 while (isspace(s[i++]))
1538 width++;
1539 }
1540 }
1541 }
1542
1543 /* The scroll bar isn't being used */
1544 if (!browser->b.navkeypressed)
1545 width += 1;
1546
1547 ui_browser__write_nstring(&browser->b, "", width);
1548
1549 ++row;
1550 ++printed;
1551
1552show_callchain:
1553 if (entry->leaf && folded_sign == '-' && row != browser->b.rows) {
1554 struct callchain_print_arg carg = {
1555 .row_offset = row_offset,
1556 };
1557
1558 printed += hist_browser__show_callchain(browser, entry,
1559 level + 1, row,
1560 hist_browser__show_callchain_entry, &carg,
1561 hist_browser__check_output_full);
1562 }
1563
1564 return printed;
1565}
1566
1567static int hist_browser__show_no_entry(struct hist_browser *browser,
1568 unsigned short row, int level)
1569{
1570 int width = browser->b.width;
1571 bool current_entry = ui_browser__is_current_entry(&browser->b, row);
1572 bool first = true;
1573 int column = 0;
1574 int ret;
1575 struct perf_hpp_fmt *fmt;
1576 struct perf_hpp_list_node *fmt_node;
1577 int indent = browser->hists->nr_hpp_node - 2;
1578
1579 if (current_entry) {
1580 browser->he_selection = NULL;
1581 browser->selection = NULL;
1582 }
1583
1584 ui_browser__gotorc(&browser->b, row, 0);
1585
1586 if (current_entry && browser->b.navkeypressed)
1587 ui_browser__set_color(&browser->b, HE_COLORSET_SELECTED);
1588 else
1589 ui_browser__set_color(&browser->b, HE_COLORSET_NORMAL);
1590
1591 ui_browser__write_nstring(&browser->b, "", level * HIERARCHY_INDENT);
1592 width -= level * HIERARCHY_INDENT;
1593
1594 /* the first hpp_list_node is for overhead columns */
1595 fmt_node = list_first_entry(&browser->hists->hpp_formats,
1596 struct perf_hpp_list_node, list);
1597 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
1598 if (perf_hpp__should_skip(fmt, browser->hists) ||
1599 column++ < browser->b.horiz_scroll)
1600 continue;
1601
1602 ret = fmt->width(fmt, NULL, browser->hists);
1603
1604 if (first) {
1605 /* for folded sign */
1606 first = false;
1607 ret++;
1608 } else {
1609 /* space between columns */
1610 ret += 2;
1611 }
1612
1613 ui_browser__write_nstring(&browser->b, "", ret);
1614 width -= ret;
1615 }
1616
1617 ui_browser__write_nstring(&browser->b, "", indent * HIERARCHY_INDENT);
1618 width -= indent * HIERARCHY_INDENT;
1619
1620 if (column >= browser->b.horiz_scroll) {
1621 char buf[32];
1622
1623 ret = snprintf(buf, sizeof(buf), "no entry >= %.2f%%", browser->min_pcnt);
1624 ui_browser__printf(&browser->b, " %s", buf);
1625 width -= ret + 2;
1626 }
1627
1628 /* The scroll bar isn't being used */
1629 if (!browser->b.navkeypressed)
1630 width += 1;
1631
1632 ui_browser__write_nstring(&browser->b, "", width);
1633 return 1;
1634}
1635
1636static int advance_hpp_check(struct perf_hpp *hpp, int inc)
1637{
1638 advance_hpp(hpp, inc);
1639 return hpp->size <= 0;
1640}
1641
1642static int
1643hists_browser__scnprintf_headers(struct hist_browser *browser, char *buf,
1644 size_t size, int line)
1645{
1646 struct hists *hists = browser->hists;
1647 struct perf_hpp dummy_hpp = {
1648 .buf = buf,
1649 .size = size,
1650 };
1651 struct perf_hpp_fmt *fmt;
1652 size_t ret = 0;
1653 int column = 0;
1654 int span = 0;
1655
1656 if (hists__has_callchains(hists) && symbol_conf.use_callchain) {
1657 ret = scnprintf(buf, size, " ");
1658 if (advance_hpp_check(&dummy_hpp, ret))
1659 return ret;
1660 }
1661
1662 hists__for_each_format(browser->hists, fmt) {
1663 if (perf_hpp__should_skip(fmt, hists) || column++ < browser->b.horiz_scroll)
1664 continue;
1665
1666 ret = fmt->header(fmt, &dummy_hpp, hists, line, &span);
1667 if (advance_hpp_check(&dummy_hpp, ret))
1668 break;
1669
1670 if (span)
1671 continue;
1672
1673 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, " ");
1674 if (advance_hpp_check(&dummy_hpp, ret))
1675 break;
1676 }
1677
1678 return ret;
1679}
1680
1681static int hists_browser__scnprintf_hierarchy_headers(struct hist_browser *browser, char *buf, size_t size)
1682{
1683 struct hists *hists = browser->hists;
1684 struct perf_hpp dummy_hpp = {
1685 .buf = buf,
1686 .size = size,
1687 };
1688 struct perf_hpp_fmt *fmt;
1689 struct perf_hpp_list_node *fmt_node;
1690 size_t ret = 0;
1691 int column = 0;
1692 int indent = hists->nr_hpp_node - 2;
1693 bool first_node, first_col;
1694
1695 ret = scnprintf(buf, size, " ");
1696 if (advance_hpp_check(&dummy_hpp, ret))
1697 return ret;
1698
1699 first_node = true;
1700 /* the first hpp_list_node is for overhead columns */
1701 fmt_node = list_first_entry(&hists->hpp_formats,
1702 struct perf_hpp_list_node, list);
1703 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
1704 if (column++ < browser->b.horiz_scroll)
1705 continue;
1706
1707 ret = fmt->header(fmt, &dummy_hpp, hists, 0, NULL);
1708 if (advance_hpp_check(&dummy_hpp, ret))
1709 break;
1710
1711 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, " ");
1712 if (advance_hpp_check(&dummy_hpp, ret))
1713 break;
1714
1715 first_node = false;
1716 }
1717
1718 if (!first_node) {
1719 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, "%*s",
1720 indent * HIERARCHY_INDENT, "");
1721 if (advance_hpp_check(&dummy_hpp, ret))
1722 return ret;
1723 }
1724
1725 first_node = true;
1726 list_for_each_entry_continue(fmt_node, &hists->hpp_formats, list) {
1727 if (!first_node) {
1728 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, " / ");
1729 if (advance_hpp_check(&dummy_hpp, ret))
1730 break;
1731 }
1732 first_node = false;
1733
1734 first_col = true;
1735 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
1736 char *start;
1737
1738 if (perf_hpp__should_skip(fmt, hists))
1739 continue;
1740
1741 if (!first_col) {
1742 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, "+");
1743 if (advance_hpp_check(&dummy_hpp, ret))
1744 break;
1745 }
1746 first_col = false;
1747
1748 ret = fmt->header(fmt, &dummy_hpp, hists, 0, NULL);
1749 dummy_hpp.buf[ret] = '\0';
1750
1751 start = strim(dummy_hpp.buf);
1752 ret = strlen(start);
1753
1754 if (start != dummy_hpp.buf)
1755 memmove(dummy_hpp.buf, start, ret + 1);
1756
1757 if (advance_hpp_check(&dummy_hpp, ret))
1758 break;
1759 }
1760 }
1761
1762 return ret;
1763}
1764
1765static void hists_browser__hierarchy_headers(struct hist_browser *browser)
1766{
1767 char headers[1024];
1768
1769 hists_browser__scnprintf_hierarchy_headers(browser, headers,
1770 sizeof(headers));
1771
1772 ui_browser__gotorc_title(&browser->b, 0, 0);
1773 ui_browser__set_color(&browser->b, HE_COLORSET_ROOT);
1774 ui_browser__write_nstring(&browser->b, headers, browser->b.width + 1);
1775}
1776
1777static void hists_browser__headers(struct hist_browser *browser)
1778{
1779 struct hists *hists = browser->hists;
1780 struct perf_hpp_list *hpp_list = hists->hpp_list;
1781
1782 int line;
1783
1784 for (line = 0; line < hpp_list->nr_header_lines; line++) {
1785 char headers[1024];
1786
1787 hists_browser__scnprintf_headers(browser, headers,
1788 sizeof(headers), line);
1789
1790 ui_browser__gotorc_title(&browser->b, line, 0);
1791 ui_browser__set_color(&browser->b, HE_COLORSET_ROOT);
1792 ui_browser__write_nstring(&browser->b, headers, browser->b.width + 1);
1793 }
1794}
1795
1796static void hist_browser__show_headers(struct hist_browser *browser)
1797{
1798 if (symbol_conf.report_hierarchy)
1799 hists_browser__hierarchy_headers(browser);
1800 else
1801 hists_browser__headers(browser);
1802}
1803
1804static void ui_browser__hists_init_top(struct ui_browser *browser)
1805{
1806 if (browser->top == NULL) {
1807 struct hist_browser *hb;
1808
1809 hb = container_of(browser, struct hist_browser, b);
1810 browser->top = rb_first_cached(&hb->hists->entries);
1811 }
1812}
1813
1814static unsigned int hist_browser__refresh(struct ui_browser *browser)
1815{
1816 unsigned row = 0;
1817 struct rb_node *nd;
1818 struct hist_browser *hb = container_of(browser, struct hist_browser, b);
1819
1820 if (hb->show_headers)
1821 hist_browser__show_headers(hb);
1822
1823 ui_browser__hists_init_top(browser);
1824 hb->he_selection = NULL;
1825 hb->selection = NULL;
1826
1827 for (nd = browser->top; nd; nd = rb_hierarchy_next(nd)) {
1828 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1829 float percent;
1830
1831 if (h->filtered) {
1832 /* let it move to sibling */
1833 h->unfolded = false;
1834 continue;
1835 }
1836
1837 if (symbol_conf.report_individual_block)
1838 percent = block_info__total_cycles_percent(h);
1839 else
1840 percent = hist_entry__get_percent_limit(h);
1841
1842 if (percent < hb->min_pcnt)
1843 continue;
1844
1845 if (symbol_conf.report_hierarchy) {
1846 row += hist_browser__show_hierarchy_entry(hb, h, row,
1847 h->depth);
1848 if (row == browser->rows)
1849 break;
1850
1851 if (h->has_no_entry) {
1852 hist_browser__show_no_entry(hb, row, h->depth + 1);
1853 row++;
1854 }
1855 } else {
1856 row += hist_browser__show_entry(hb, h, row);
1857 }
1858
1859 if (row == browser->rows)
1860 break;
1861 }
1862
1863 return row;
1864}
1865
1866static struct rb_node *hists__filter_entries(struct rb_node *nd,
1867 float min_pcnt)
1868{
1869 while (nd != NULL) {
1870 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1871 float percent = hist_entry__get_percent_limit(h);
1872
1873 if (!h->filtered && percent >= min_pcnt)
1874 return nd;
1875
1876 /*
1877 * If it's filtered, its all children also were filtered.
1878 * So move to sibling node.
1879 */
1880 if (rb_next(nd))
1881 nd = rb_next(nd);
1882 else
1883 nd = rb_hierarchy_next(nd);
1884 }
1885
1886 return NULL;
1887}
1888
1889static struct rb_node *hists__filter_prev_entries(struct rb_node *nd,
1890 float min_pcnt)
1891{
1892 while (nd != NULL) {
1893 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1894 float percent = hist_entry__get_percent_limit(h);
1895
1896 if (!h->filtered && percent >= min_pcnt)
1897 return nd;
1898
1899 nd = rb_hierarchy_prev(nd);
1900 }
1901
1902 return NULL;
1903}
1904
1905static void ui_browser__hists_seek(struct ui_browser *browser,
1906 off_t offset, int whence)
1907{
1908 struct hist_entry *h;
1909 struct rb_node *nd;
1910 bool first = true;
1911 struct hist_browser *hb;
1912
1913 hb = container_of(browser, struct hist_browser, b);
1914
1915 if (browser->nr_entries == 0)
1916 return;
1917
1918 ui_browser__hists_init_top(browser);
1919
1920 switch (whence) {
1921 case SEEK_SET:
1922 nd = hists__filter_entries(rb_first(browser->entries),
1923 hb->min_pcnt);
1924 break;
1925 case SEEK_CUR:
1926 nd = browser->top;
1927 goto do_offset;
1928 case SEEK_END:
1929 nd = rb_hierarchy_last(rb_last(browser->entries));
1930 nd = hists__filter_prev_entries(nd, hb->min_pcnt);
1931 first = false;
1932 break;
1933 default:
1934 return;
1935 }
1936
1937 /*
1938 * Moves not relative to the first visible entry invalidates its
1939 * row_offset:
1940 */
1941 h = rb_entry(browser->top, struct hist_entry, rb_node);
1942 h->row_offset = 0;
1943
1944 /*
1945 * Here we have to check if nd is expanded (+), if it is we can't go
1946 * the next top level hist_entry, instead we must compute an offset of
1947 * what _not_ to show and not change the first visible entry.
1948 *
1949 * This offset increments when we are going from top to bottom and
1950 * decreases when we're going from bottom to top.
1951 *
1952 * As we don't have backpointers to the top level in the callchains
1953 * structure, we need to always print the whole hist_entry callchain,
1954 * skipping the first ones that are before the first visible entry
1955 * and stop when we printed enough lines to fill the screen.
1956 */
1957do_offset:
1958 if (!nd)
1959 return;
1960
1961 if (offset > 0) {
1962 do {
1963 h = rb_entry(nd, struct hist_entry, rb_node);
1964 if (h->unfolded && h->leaf) {
1965 u16 remaining = h->nr_rows - h->row_offset;
1966 if (offset > remaining) {
1967 offset -= remaining;
1968 h->row_offset = 0;
1969 } else {
1970 h->row_offset += offset;
1971 offset = 0;
1972 browser->top = nd;
1973 break;
1974 }
1975 }
1976 nd = hists__filter_entries(rb_hierarchy_next(nd),
1977 hb->min_pcnt);
1978 if (nd == NULL)
1979 break;
1980 --offset;
1981 browser->top = nd;
1982 } while (offset != 0);
1983 } else if (offset < 0) {
1984 while (1) {
1985 h = rb_entry(nd, struct hist_entry, rb_node);
1986 if (h->unfolded && h->leaf) {
1987 if (first) {
1988 if (-offset > h->row_offset) {
1989 offset += h->row_offset;
1990 h->row_offset = 0;
1991 } else {
1992 h->row_offset += offset;
1993 offset = 0;
1994 browser->top = nd;
1995 break;
1996 }
1997 } else {
1998 if (-offset > h->nr_rows) {
1999 offset += h->nr_rows;
2000 h->row_offset = 0;
2001 } else {
2002 h->row_offset = h->nr_rows + offset;
2003 offset = 0;
2004 browser->top = nd;
2005 break;
2006 }
2007 }
2008 }
2009
2010 nd = hists__filter_prev_entries(rb_hierarchy_prev(nd),
2011 hb->min_pcnt);
2012 if (nd == NULL)
2013 break;
2014 ++offset;
2015 browser->top = nd;
2016 if (offset == 0) {
2017 /*
2018 * Last unfiltered hist_entry, check if it is
2019 * unfolded, if it is then we should have
2020 * row_offset at its last entry.
2021 */
2022 h = rb_entry(nd, struct hist_entry, rb_node);
2023 if (h->unfolded && h->leaf)
2024 h->row_offset = h->nr_rows;
2025 break;
2026 }
2027 first = false;
2028 }
2029 } else {
2030 browser->top = nd;
2031 h = rb_entry(nd, struct hist_entry, rb_node);
2032 h->row_offset = 0;
2033 }
2034}
2035
2036static int hist_browser__fprintf_callchain(struct hist_browser *browser,
2037 struct hist_entry *he, FILE *fp,
2038 int level)
2039{
2040 struct callchain_print_arg arg = {
2041 .fp = fp,
2042 };
2043
2044 hist_browser__show_callchain(browser, he, level, 0,
2045 hist_browser__fprintf_callchain_entry, &arg,
2046 hist_browser__check_dump_full);
2047 return arg.printed;
2048}
2049
2050static int hist_browser__fprintf_entry(struct hist_browser *browser,
2051 struct hist_entry *he, FILE *fp)
2052{
2053 char s[8192];
2054 int printed = 0;
2055 char folded_sign = ' ';
2056 struct perf_hpp hpp = {
2057 .buf = s,
2058 .size = sizeof(s),
2059 };
2060 struct perf_hpp_fmt *fmt;
2061 bool first = true;
2062 int ret;
2063
2064 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain) {
2065 folded_sign = hist_entry__folded(he);
2066 printed += fprintf(fp, "%c ", folded_sign);
2067 }
2068
2069 hists__for_each_format(browser->hists, fmt) {
2070 if (perf_hpp__should_skip(fmt, he->hists))
2071 continue;
2072
2073 if (!first) {
2074 ret = scnprintf(hpp.buf, hpp.size, " ");
2075 advance_hpp(&hpp, ret);
2076 } else
2077 first = false;
2078
2079 ret = fmt->entry(fmt, &hpp, he);
2080 ret = hist_entry__snprintf_alignment(he, &hpp, fmt, ret);
2081 advance_hpp(&hpp, ret);
2082 }
2083 printed += fprintf(fp, "%s\n", s);
2084
2085 if (folded_sign == '-')
2086 printed += hist_browser__fprintf_callchain(browser, he, fp, 1);
2087
2088 return printed;
2089}
2090
2091
2092static int hist_browser__fprintf_hierarchy_entry(struct hist_browser *browser,
2093 struct hist_entry *he,
2094 FILE *fp, int level)
2095{
2096 char s[8192];
2097 int printed = 0;
2098 char folded_sign = ' ';
2099 struct perf_hpp hpp = {
2100 .buf = s,
2101 .size = sizeof(s),
2102 };
2103 struct perf_hpp_fmt *fmt;
2104 struct perf_hpp_list_node *fmt_node;
2105 bool first = true;
2106 int ret;
2107 int hierarchy_indent = (he->hists->nr_hpp_node - 2) * HIERARCHY_INDENT;
2108
2109 printed = fprintf(fp, "%*s", level * HIERARCHY_INDENT, "");
2110
2111 folded_sign = hist_entry__folded(he);
2112 printed += fprintf(fp, "%c", folded_sign);
2113
2114 /* the first hpp_list_node is for overhead columns */
2115 fmt_node = list_first_entry(&he->hists->hpp_formats,
2116 struct perf_hpp_list_node, list);
2117 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
2118 if (!first) {
2119 ret = scnprintf(hpp.buf, hpp.size, " ");
2120 advance_hpp(&hpp, ret);
2121 } else
2122 first = false;
2123
2124 ret = fmt->entry(fmt, &hpp, he);
2125 advance_hpp(&hpp, ret);
2126 }
2127
2128 ret = scnprintf(hpp.buf, hpp.size, "%*s", hierarchy_indent, "");
2129 advance_hpp(&hpp, ret);
2130
2131 perf_hpp_list__for_each_format(he->hpp_list, fmt) {
2132 ret = scnprintf(hpp.buf, hpp.size, " ");
2133 advance_hpp(&hpp, ret);
2134
2135 ret = fmt->entry(fmt, &hpp, he);
2136 advance_hpp(&hpp, ret);
2137 }
2138
2139 strim(s);
2140 printed += fprintf(fp, "%s\n", s);
2141
2142 if (he->leaf && folded_sign == '-') {
2143 printed += hist_browser__fprintf_callchain(browser, he, fp,
2144 he->depth + 1);
2145 }
2146
2147 return printed;
2148}
2149
2150static int hist_browser__fprintf(struct hist_browser *browser, FILE *fp)
2151{
2152 struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries),
2153 browser->min_pcnt);
2154 int printed = 0;
2155
2156 while (nd) {
2157 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
2158
2159 if (symbol_conf.report_hierarchy) {
2160 printed += hist_browser__fprintf_hierarchy_entry(browser,
2161 h, fp,
2162 h->depth);
2163 } else {
2164 printed += hist_browser__fprintf_entry(browser, h, fp);
2165 }
2166
2167 nd = hists__filter_entries(rb_hierarchy_next(nd),
2168 browser->min_pcnt);
2169 }
2170
2171 return printed;
2172}
2173
2174static int hist_browser__dump(struct hist_browser *browser)
2175{
2176 char filename[64];
2177 FILE *fp;
2178
2179 while (1) {
2180 scnprintf(filename, sizeof(filename), "perf.hist.%d", browser->print_seq);
2181 if (access(filename, F_OK))
2182 break;
2183 /*
2184 * XXX: Just an arbitrary lazy upper limit
2185 */
2186 if (++browser->print_seq == 8192) {
2187 ui_helpline__fpush("Too many perf.hist.N files, nothing written!");
2188 return -1;
2189 }
2190 }
2191
2192 fp = fopen(filename, "w");
2193 if (fp == NULL) {
2194 char bf[64];
2195 const char *err = str_error_r(errno, bf, sizeof(bf));
2196 ui_helpline__fpush("Couldn't write to %s: %s", filename, err);
2197 return -1;
2198 }
2199
2200 ++browser->print_seq;
2201 hist_browser__fprintf(browser, fp);
2202 fclose(fp);
2203 ui_helpline__fpush("%s written!", filename);
2204
2205 return 0;
2206}
2207
2208void hist_browser__init(struct hist_browser *browser,
2209 struct hists *hists)
2210{
2211 struct perf_hpp_fmt *fmt;
2212
2213 browser->hists = hists;
2214 browser->b.refresh = hist_browser__refresh;
2215 browser->b.refresh_dimensions = hist_browser__refresh_dimensions;
2216 browser->b.seek = ui_browser__hists_seek;
2217 browser->b.use_navkeypressed = true;
2218 browser->show_headers = symbol_conf.show_hist_headers;
2219 hist_browser__set_title_space(browser);
2220
2221 if (symbol_conf.report_hierarchy) {
2222 struct perf_hpp_list_node *fmt_node;
2223
2224 /* count overhead columns (in the first node) */
2225 fmt_node = list_first_entry(&hists->hpp_formats,
2226 struct perf_hpp_list_node, list);
2227 perf_hpp_list__for_each_format(&fmt_node->hpp, fmt)
2228 ++browser->b.columns;
2229
2230 /* add a single column for whole hierarchy sort keys*/
2231 ++browser->b.columns;
2232 } else {
2233 hists__for_each_format(hists, fmt)
2234 ++browser->b.columns;
2235 }
2236
2237 hists__reset_column_width(hists);
2238}
2239
2240struct hist_browser *hist_browser__new(struct hists *hists)
2241{
2242 struct hist_browser *browser = zalloc(sizeof(*browser));
2243
2244 if (browser)
2245 hist_browser__init(browser, hists);
2246
2247 return browser;
2248}
2249
2250static struct hist_browser *
2251perf_evsel_browser__new(struct evsel *evsel,
2252 struct hist_browser_timer *hbt,
2253 struct perf_env *env)
2254{
2255 struct hist_browser *browser = hist_browser__new(evsel__hists(evsel));
2256
2257 if (browser) {
2258 browser->hbt = hbt;
2259 browser->env = env;
2260 browser->title = hists_browser__scnprintf_title;
2261 }
2262 return browser;
2263}
2264
2265void hist_browser__delete(struct hist_browser *browser)
2266{
2267 free(browser);
2268}
2269
2270static struct hist_entry *hist_browser__selected_entry(struct hist_browser *browser)
2271{
2272 return browser->he_selection;
2273}
2274
2275static struct thread *hist_browser__selected_thread(struct hist_browser *browser)
2276{
2277 return browser->he_selection->thread;
2278}
2279
2280static struct res_sample *hist_browser__selected_res_sample(struct hist_browser *browser)
2281{
2282 return browser->he_selection ? browser->he_selection->res_samples : NULL;
2283}
2284
2285/* Check whether the browser is for 'top' or 'report' */
2286static inline bool is_report_browser(void *timer)
2287{
2288 return timer == NULL;
2289}
2290
2291static int hists_browser__scnprintf_title(struct hist_browser *browser, char *bf, size_t size)
2292{
2293 struct hist_browser_timer *hbt = browser->hbt;
2294 int printed = __hists__scnprintf_title(browser->hists, bf, size, !is_report_browser(hbt));
2295
2296 if (!is_report_browser(hbt)) {
2297 struct perf_top *top = hbt->arg;
2298
2299 printed += scnprintf(bf + printed, size - printed,
2300 " lost: %" PRIu64 "/%" PRIu64,
2301 top->lost, top->lost_total);
2302
2303 printed += scnprintf(bf + printed, size - printed,
2304 " drop: %" PRIu64 "/%" PRIu64,
2305 top->drop, top->drop_total);
2306
2307 if (top->zero)
2308 printed += scnprintf(bf + printed, size - printed, " [z]");
2309
2310 perf_top__reset_sample_counters(top);
2311 }
2312
2313
2314 return printed;
2315}
2316
2317static inline void free_popup_options(char **options, int n)
2318{
2319 int i;
2320
2321 for (i = 0; i < n; ++i)
2322 zfree(&options[i]);
2323}
2324
2325/*
2326 * Only runtime switching of perf data file will make "input_name" point
2327 * to a malloced buffer. So add "is_input_name_malloced" flag to decide
2328 * whether we need to call free() for current "input_name" during the switch.
2329 */
2330static bool is_input_name_malloced = false;
2331
2332static int switch_data_file(void)
2333{
2334 char *pwd, *options[32], *abs_path[32], *tmp;
2335 DIR *pwd_dir;
2336 int nr_options = 0, choice = -1, ret = -1;
2337 struct dirent *dent;
2338
2339 pwd = getenv("PWD");
2340 if (!pwd)
2341 return ret;
2342
2343 pwd_dir = opendir(pwd);
2344 if (!pwd_dir)
2345 return ret;
2346
2347 memset(options, 0, sizeof(options));
2348 memset(abs_path, 0, sizeof(abs_path));
2349
2350 while ((dent = readdir(pwd_dir))) {
2351 char path[PATH_MAX];
2352 u64 magic;
2353 char *name = dent->d_name;
2354 FILE *file;
2355
2356 if (!(dent->d_type == DT_REG))
2357 continue;
2358
2359 snprintf(path, sizeof(path), "%s/%s", pwd, name);
2360
2361 file = fopen(path, "r");
2362 if (!file)
2363 continue;
2364
2365 if (fread(&magic, 1, 8, file) < 8)
2366 goto close_file_and_continue;
2367
2368 if (is_perf_magic(magic)) {
2369 options[nr_options] = strdup(name);
2370 if (!options[nr_options])
2371 goto close_file_and_continue;
2372
2373 abs_path[nr_options] = strdup(path);
2374 if (!abs_path[nr_options]) {
2375 zfree(&options[nr_options]);
2376 ui__warning("Can't search all data files due to memory shortage.\n");
2377 fclose(file);
2378 break;
2379 }
2380
2381 nr_options++;
2382 }
2383
2384close_file_and_continue:
2385 fclose(file);
2386 if (nr_options >= 32) {
2387 ui__warning("Too many perf data files in PWD!\n"
2388 "Only the first 32 files will be listed.\n");
2389 break;
2390 }
2391 }
2392 closedir(pwd_dir);
2393
2394 if (nr_options) {
2395 choice = ui__popup_menu(nr_options, options, NULL);
2396 if (choice < nr_options && choice >= 0) {
2397 tmp = strdup(abs_path[choice]);
2398 if (tmp) {
2399 if (is_input_name_malloced)
2400 free((void *)input_name);
2401 input_name = tmp;
2402 is_input_name_malloced = true;
2403 ret = 0;
2404 } else
2405 ui__warning("Data switch failed due to memory shortage!\n");
2406 }
2407 }
2408
2409 free_popup_options(options, nr_options);
2410 free_popup_options(abs_path, nr_options);
2411 return ret;
2412}
2413
2414struct popup_action {
2415 unsigned long time;
2416 struct thread *thread;
2417 struct evsel *evsel;
2418 int (*fn)(struct hist_browser *browser, struct popup_action *act);
2419 struct map_symbol ms;
2420 int socket;
2421 enum rstype rstype;
2422
2423};
2424
2425static int
2426do_annotate(struct hist_browser *browser, struct popup_action *act)
2427{
2428 struct evsel *evsel;
2429 struct annotation *notes;
2430 struct hist_entry *he;
2431 int err;
2432
2433 if (!annotate_opts.objdump_path &&
2434 perf_env__lookup_objdump(browser->env, &annotate_opts.objdump_path))
2435 return 0;
2436
2437 notes = symbol__annotation(act->ms.sym);
2438 if (!notes->src)
2439 return 0;
2440
2441 if (browser->block_evsel)
2442 evsel = browser->block_evsel;
2443 else
2444 evsel = hists_to_evsel(browser->hists);
2445
2446 err = map_symbol__tui_annotate(&act->ms, evsel, browser->hbt);
2447 he = hist_browser__selected_entry(browser);
2448 /*
2449 * offer option to annotate the other branch source or target
2450 * (if they exists) when returning from annotate
2451 */
2452 if ((err == 'q' || err == CTRL('c')) && he->branch_info)
2453 return 1;
2454
2455 ui_browser__update_nr_entries(&browser->b, browser->hists->nr_entries);
2456 if (err)
2457 ui_browser__handle_resize(&browser->b);
2458 return 0;
2459}
2460
2461static struct symbol *symbol__new_unresolved(u64 addr, struct map *map)
2462{
2463 struct annotated_source *src;
2464 struct symbol *sym;
2465 char name[64];
2466
2467 snprintf(name, sizeof(name), "%.*" PRIx64, BITS_PER_LONG / 4, addr);
2468
2469 sym = symbol__new(addr, ANNOTATION_DUMMY_LEN, 0, 0, name);
2470 if (sym) {
2471 src = symbol__hists(sym, 1);
2472 if (!src) {
2473 symbol__delete(sym);
2474 return NULL;
2475 }
2476
2477 dso__insert_symbol(map__dso(map), sym);
2478 }
2479
2480 return sym;
2481}
2482
2483static int
2484add_annotate_opt(struct hist_browser *browser __maybe_unused,
2485 struct popup_action *act, char **optstr,
2486 struct map_symbol *ms,
2487 u64 addr)
2488{
2489 struct dso *dso;
2490
2491 if (!ms->map || (dso = map__dso(ms->map)) == NULL || dso->annotate_warned)
2492 return 0;
2493
2494 if (!ms->sym)
2495 ms->sym = symbol__new_unresolved(addr, ms->map);
2496
2497 if (ms->sym == NULL || symbol__annotation(ms->sym)->src == NULL)
2498 return 0;
2499
2500 if (asprintf(optstr, "Annotate %s", ms->sym->name) < 0)
2501 return 0;
2502
2503 act->ms = *ms;
2504 act->fn = do_annotate;
2505 return 1;
2506}
2507
2508static int
2509do_zoom_thread(struct hist_browser *browser, struct popup_action *act)
2510{
2511 struct thread *thread = act->thread;
2512
2513 if ((!hists__has(browser->hists, thread) &&
2514 !hists__has(browser->hists, comm)) || thread == NULL)
2515 return 0;
2516
2517 if (browser->hists->thread_filter) {
2518 pstack__remove(browser->pstack, &browser->hists->thread_filter);
2519 perf_hpp__set_elide(HISTC_THREAD, false);
2520 thread__zput(browser->hists->thread_filter);
2521 ui_helpline__pop();
2522 } else {
2523 const char *comm_set_str =
2524 thread__comm_set(thread) ? thread__comm_str(thread) : "";
2525
2526 if (hists__has(browser->hists, thread)) {
2527 ui_helpline__fpush("To zoom out press ESC or ENTER + \"Zoom out of %s(%d) thread\"",
2528 comm_set_str, thread__tid(thread));
2529 } else {
2530 ui_helpline__fpush("To zoom out press ESC or ENTER + \"Zoom out of %s thread\"",
2531 comm_set_str);
2532 }
2533
2534 browser->hists->thread_filter = thread__get(thread);
2535 perf_hpp__set_elide(HISTC_THREAD, false);
2536 pstack__push(browser->pstack, &browser->hists->thread_filter);
2537 }
2538
2539 hists__filter_by_thread(browser->hists);
2540 hist_browser__reset(browser);
2541 return 0;
2542}
2543
2544static int
2545add_thread_opt(struct hist_browser *browser, struct popup_action *act,
2546 char **optstr, struct thread *thread)
2547{
2548 int ret;
2549 const char *comm_set_str, *in_out;
2550
2551 if ((!hists__has(browser->hists, thread) &&
2552 !hists__has(browser->hists, comm)) || thread == NULL)
2553 return 0;
2554
2555 in_out = browser->hists->thread_filter ? "out of" : "into";
2556 comm_set_str = thread__comm_set(thread) ? thread__comm_str(thread) : "";
2557 if (hists__has(browser->hists, thread)) {
2558 ret = asprintf(optstr, "Zoom %s %s(%d) thread",
2559 in_out, comm_set_str, thread__tid(thread));
2560 } else {
2561 ret = asprintf(optstr, "Zoom %s %s thread", in_out, comm_set_str);
2562 }
2563 if (ret < 0)
2564 return 0;
2565
2566 act->thread = thread;
2567 act->fn = do_zoom_thread;
2568 return 1;
2569}
2570
2571static int hists_browser__zoom_map(struct hist_browser *browser, struct map *map)
2572{
2573 if (!hists__has(browser->hists, dso) || map == NULL)
2574 return 0;
2575
2576 if (browser->hists->dso_filter) {
2577 pstack__remove(browser->pstack, &browser->hists->dso_filter);
2578 perf_hpp__set_elide(HISTC_DSO, false);
2579 browser->hists->dso_filter = NULL;
2580 ui_helpline__pop();
2581 } else {
2582 struct dso *dso = map__dso(map);
2583 ui_helpline__fpush("To zoom out press ESC or ENTER + \"Zoom out of %s DSO\"",
2584 __map__is_kernel(map) ? "the Kernel" : dso->short_name);
2585 browser->hists->dso_filter = dso;
2586 perf_hpp__set_elide(HISTC_DSO, true);
2587 pstack__push(browser->pstack, &browser->hists->dso_filter);
2588 }
2589
2590 hists__filter_by_dso(browser->hists);
2591 hist_browser__reset(browser);
2592 return 0;
2593}
2594
2595static int
2596do_zoom_dso(struct hist_browser *browser, struct popup_action *act)
2597{
2598 return hists_browser__zoom_map(browser, act->ms.map);
2599}
2600
2601static int
2602add_dso_opt(struct hist_browser *browser, struct popup_action *act,
2603 char **optstr, struct map *map)
2604{
2605 if (!hists__has(browser->hists, dso) || map == NULL)
2606 return 0;
2607
2608 if (asprintf(optstr, "Zoom %s %s DSO (use the 'k' hotkey to zoom directly into the kernel)",
2609 browser->hists->dso_filter ? "out of" : "into",
2610 __map__is_kernel(map) ? "the Kernel" : map__dso(map)->short_name) < 0)
2611 return 0;
2612
2613 act->ms.map = map;
2614 act->fn = do_zoom_dso;
2615 return 1;
2616}
2617
2618static int do_toggle_callchain(struct hist_browser *browser, struct popup_action *act __maybe_unused)
2619{
2620 hist_browser__toggle_fold(browser);
2621 return 0;
2622}
2623
2624static int add_callchain_toggle_opt(struct hist_browser *browser, struct popup_action *act, char **optstr)
2625{
2626 char sym_name[512];
2627
2628 if (!hist_browser__selection_has_children(browser))
2629 return 0;
2630
2631 if (asprintf(optstr, "%s [%s] callchain (one level, same as '+' hotkey, use 'e'/'c' for the whole main level entry)",
2632 hist_browser__selection_unfolded(browser) ? "Collapse" : "Expand",
2633 hist_browser__selection_sym_name(browser, sym_name, sizeof(sym_name))) < 0)
2634 return 0;
2635
2636 act->fn = do_toggle_callchain;
2637 return 1;
2638}
2639
2640static int
2641do_browse_map(struct hist_browser *browser __maybe_unused,
2642 struct popup_action *act)
2643{
2644 map__browse(act->ms.map);
2645 return 0;
2646}
2647
2648static int
2649add_map_opt(struct hist_browser *browser,
2650 struct popup_action *act, char **optstr, struct map *map)
2651{
2652 if (!hists__has(browser->hists, dso) || map == NULL)
2653 return 0;
2654
2655 if (asprintf(optstr, "Browse map details") < 0)
2656 return 0;
2657
2658 act->ms.map = map;
2659 act->fn = do_browse_map;
2660 return 1;
2661}
2662
2663static int
2664do_run_script(struct hist_browser *browser __maybe_unused,
2665 struct popup_action *act)
2666{
2667 char *script_opt;
2668 int len;
2669 int n = 0;
2670
2671 len = 100;
2672 if (act->thread)
2673 len += strlen(thread__comm_str(act->thread));
2674 else if (act->ms.sym)
2675 len += strlen(act->ms.sym->name);
2676 script_opt = malloc(len);
2677 if (!script_opt)
2678 return -1;
2679
2680 script_opt[0] = 0;
2681 if (act->thread) {
2682 n = scnprintf(script_opt, len, " -c %s ",
2683 thread__comm_str(act->thread));
2684 } else if (act->ms.sym) {
2685 n = scnprintf(script_opt, len, " -S %s ",
2686 act->ms.sym->name);
2687 }
2688
2689 if (act->time) {
2690 char start[32], end[32];
2691 unsigned long starttime = act->time;
2692 unsigned long endtime = act->time + symbol_conf.time_quantum;
2693
2694 if (starttime == endtime) { /* Display 1ms as fallback */
2695 starttime -= 1*NSEC_PER_MSEC;
2696 endtime += 1*NSEC_PER_MSEC;
2697 }
2698 timestamp__scnprintf_usec(starttime, start, sizeof start);
2699 timestamp__scnprintf_usec(endtime, end, sizeof end);
2700 n += snprintf(script_opt + n, len - n, " --time %s,%s", start, end);
2701 }
2702
2703 script_browse(script_opt, act->evsel);
2704 free(script_opt);
2705 return 0;
2706}
2707
2708static int
2709do_res_sample_script(struct hist_browser *browser __maybe_unused,
2710 struct popup_action *act)
2711{
2712 struct hist_entry *he;
2713
2714 he = hist_browser__selected_entry(browser);
2715 res_sample_browse(he->res_samples, he->num_res, act->evsel, act->rstype);
2716 return 0;
2717}
2718
2719static int
2720add_script_opt_2(struct hist_browser *browser __maybe_unused,
2721 struct popup_action *act, char **optstr,
2722 struct thread *thread, struct symbol *sym,
2723 struct evsel *evsel, const char *tstr)
2724{
2725
2726 if (thread) {
2727 if (asprintf(optstr, "Run scripts for samples of thread [%s]%s",
2728 thread__comm_str(thread), tstr) < 0)
2729 return 0;
2730 } else if (sym) {
2731 if (asprintf(optstr, "Run scripts for samples of symbol [%s]%s",
2732 sym->name, tstr) < 0)
2733 return 0;
2734 } else {
2735 if (asprintf(optstr, "Run scripts for all samples%s", tstr) < 0)
2736 return 0;
2737 }
2738
2739 act->thread = thread;
2740 act->ms.sym = sym;
2741 act->evsel = evsel;
2742 act->fn = do_run_script;
2743 return 1;
2744}
2745
2746static int
2747add_script_opt(struct hist_browser *browser,
2748 struct popup_action *act, char **optstr,
2749 struct thread *thread, struct symbol *sym,
2750 struct evsel *evsel)
2751{
2752 int n, j;
2753 struct hist_entry *he;
2754
2755 n = add_script_opt_2(browser, act, optstr, thread, sym, evsel, "");
2756
2757 he = hist_browser__selected_entry(browser);
2758 if (sort_order && strstr(sort_order, "time")) {
2759 char tstr[128];
2760
2761 optstr++;
2762 act++;
2763 j = sprintf(tstr, " in ");
2764 j += timestamp__scnprintf_usec(he->time, tstr + j,
2765 sizeof tstr - j);
2766 j += sprintf(tstr + j, "-");
2767 timestamp__scnprintf_usec(he->time + symbol_conf.time_quantum,
2768 tstr + j, sizeof tstr - j);
2769 n += add_script_opt_2(browser, act, optstr, thread, sym,
2770 evsel, tstr);
2771 act->time = he->time;
2772 }
2773 return n;
2774}
2775
2776static int
2777add_res_sample_opt(struct hist_browser *browser __maybe_unused,
2778 struct popup_action *act, char **optstr,
2779 struct res_sample *res_sample,
2780 struct evsel *evsel,
2781 enum rstype type)
2782{
2783 if (!res_sample)
2784 return 0;
2785
2786 if (asprintf(optstr, "Show context for individual samples %s",
2787 type == A_ASM ? "with assembler" :
2788 type == A_SOURCE ? "with source" : "") < 0)
2789 return 0;
2790
2791 act->fn = do_res_sample_script;
2792 act->evsel = evsel;
2793 act->rstype = type;
2794 return 1;
2795}
2796
2797static int
2798do_switch_data(struct hist_browser *browser __maybe_unused,
2799 struct popup_action *act __maybe_unused)
2800{
2801 if (switch_data_file()) {
2802 ui__warning("Won't switch the data files due to\n"
2803 "no valid data file get selected!\n");
2804 return 0;
2805 }
2806
2807 return K_SWITCH_INPUT_DATA;
2808}
2809
2810static int
2811add_switch_opt(struct hist_browser *browser,
2812 struct popup_action *act, char **optstr)
2813{
2814 if (!is_report_browser(browser->hbt))
2815 return 0;
2816
2817 if (asprintf(optstr, "Switch to another data file in PWD") < 0)
2818 return 0;
2819
2820 act->fn = do_switch_data;
2821 return 1;
2822}
2823
2824static int
2825do_exit_browser(struct hist_browser *browser __maybe_unused,
2826 struct popup_action *act __maybe_unused)
2827{
2828 return 0;
2829}
2830
2831static int
2832add_exit_opt(struct hist_browser *browser __maybe_unused,
2833 struct popup_action *act, char **optstr)
2834{
2835 if (asprintf(optstr, "Exit") < 0)
2836 return 0;
2837
2838 act->fn = do_exit_browser;
2839 return 1;
2840}
2841
2842static int
2843do_zoom_socket(struct hist_browser *browser, struct popup_action *act)
2844{
2845 if (!hists__has(browser->hists, socket) || act->socket < 0)
2846 return 0;
2847
2848 if (browser->hists->socket_filter > -1) {
2849 pstack__remove(browser->pstack, &browser->hists->socket_filter);
2850 browser->hists->socket_filter = -1;
2851 perf_hpp__set_elide(HISTC_SOCKET, false);
2852 } else {
2853 browser->hists->socket_filter = act->socket;
2854 perf_hpp__set_elide(HISTC_SOCKET, true);
2855 pstack__push(browser->pstack, &browser->hists->socket_filter);
2856 }
2857
2858 hists__filter_by_socket(browser->hists);
2859 hist_browser__reset(browser);
2860 return 0;
2861}
2862
2863static int
2864add_socket_opt(struct hist_browser *browser, struct popup_action *act,
2865 char **optstr, int socket_id)
2866{
2867 if (!hists__has(browser->hists, socket) || socket_id < 0)
2868 return 0;
2869
2870 if (asprintf(optstr, "Zoom %s Processor Socket %d",
2871 (browser->hists->socket_filter > -1) ? "out of" : "into",
2872 socket_id) < 0)
2873 return 0;
2874
2875 act->socket = socket_id;
2876 act->fn = do_zoom_socket;
2877 return 1;
2878}
2879
2880static void hist_browser__update_nr_entries(struct hist_browser *hb)
2881{
2882 u64 nr_entries = 0;
2883 struct rb_node *nd = rb_first_cached(&hb->hists->entries);
2884
2885 if (hb->min_pcnt == 0 && !symbol_conf.report_hierarchy) {
2886 hb->nr_non_filtered_entries = hb->hists->nr_non_filtered_entries;
2887 return;
2888 }
2889
2890 while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {
2891 nr_entries++;
2892 nd = rb_hierarchy_next(nd);
2893 }
2894
2895 hb->nr_non_filtered_entries = nr_entries;
2896 hb->nr_hierarchy_entries = nr_entries;
2897}
2898
2899static void hist_browser__update_percent_limit(struct hist_browser *hb,
2900 double percent)
2901{
2902 struct hist_entry *he;
2903 struct rb_node *nd = rb_first_cached(&hb->hists->entries);
2904 u64 total = hists__total_period(hb->hists);
2905 u64 min_callchain_hits = total * (percent / 100);
2906
2907 hb->min_pcnt = callchain_param.min_percent = percent;
2908
2909 while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {
2910 he = rb_entry(nd, struct hist_entry, rb_node);
2911
2912 if (he->has_no_entry) {
2913 he->has_no_entry = false;
2914 he->nr_rows = 0;
2915 }
2916
2917 if (!he->leaf || !hist_entry__has_callchains(he) || !symbol_conf.use_callchain)
2918 goto next;
2919
2920 if (callchain_param.mode == CHAIN_GRAPH_REL) {
2921 total = he->stat.period;
2922
2923 if (symbol_conf.cumulate_callchain)
2924 total = he->stat_acc->period;
2925
2926 min_callchain_hits = total * (percent / 100);
2927 }
2928
2929 callchain_param.sort(&he->sorted_chain, he->callchain,
2930 min_callchain_hits, &callchain_param);
2931
2932next:
2933 nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD);
2934
2935 /* force to re-evaluate folding state of callchains */
2936 he->init_have_children = false;
2937 hist_entry__set_folding(he, hb, false);
2938 }
2939}
2940
2941static int evsel__hists_browse(struct evsel *evsel, int nr_events, const char *helpline,
2942 bool left_exits, struct hist_browser_timer *hbt, float min_pcnt,
2943 struct perf_env *env, bool warn_lost_event)
2944{
2945 struct hists *hists = evsel__hists(evsel);
2946 struct hist_browser *browser = perf_evsel_browser__new(evsel, hbt, env);
2947 struct branch_info *bi = NULL;
2948#define MAX_OPTIONS 16
2949 char *options[MAX_OPTIONS];
2950 struct popup_action actions[MAX_OPTIONS];
2951 int nr_options = 0;
2952 int key = -1;
2953 char buf[128];
2954 int delay_secs = hbt ? hbt->refresh : 0;
2955
2956#define HIST_BROWSER_HELP_COMMON \
2957 "h/?/F1 Show this window\n" \
2958 "UP/DOWN/PGUP\n" \
2959 "PGDN/SPACE Navigate\n" \
2960 "q/ESC/CTRL+C Exit browser or go back to previous screen\n\n" \
2961 "For multiple event sessions:\n\n" \
2962 "TAB/UNTAB Switch events\n\n" \
2963 "For symbolic views (--sort has sym):\n\n" \
2964 "ENTER Zoom into DSO/Threads & Annotate current symbol\n" \
2965 "ESC Zoom out\n" \
2966 "+ Expand/Collapse one callchain level\n" \
2967 "a Annotate current symbol\n" \
2968 "C Collapse all callchains\n" \
2969 "d Zoom into current DSO\n" \
2970 "e Expand/Collapse main entry callchains\n" \
2971 "E Expand all callchains\n" \
2972 "F Toggle percentage of filtered entries\n" \
2973 "H Display column headers\n" \
2974 "k Zoom into the kernel map\n" \
2975 "L Change percent limit\n" \
2976 "m Display context menu\n" \
2977 "S Zoom into current Processor Socket\n" \
2978
2979 /* help messages are sorted by lexical order of the hotkey */
2980 static const char report_help[] = HIST_BROWSER_HELP_COMMON
2981 "i Show header information\n"
2982 "P Print histograms to perf.hist.N\n"
2983 "r Run available scripts\n"
2984 "s Switch to another data file in PWD\n"
2985 "t Zoom into current Thread\n"
2986 "V Verbose (DSO names in callchains, etc)\n"
2987 "/ Filter symbol by name\n"
2988 "0-9 Sort by event n in group";
2989 static const char top_help[] = HIST_BROWSER_HELP_COMMON
2990 "P Print histograms to perf.hist.N\n"
2991 "t Zoom into current Thread\n"
2992 "V Verbose (DSO names in callchains, etc)\n"
2993 "z Toggle zeroing of samples\n"
2994 "f Enable/Disable events\n"
2995 "/ Filter symbol by name";
2996
2997 if (browser == NULL)
2998 return -1;
2999
3000 /* reset abort key so that it can get Ctrl-C as a key */
3001 SLang_reset_tty();
3002 SLang_init_tty(0, 0, 0);
3003 SLtty_set_suspend_state(true);
3004
3005 if (min_pcnt)
3006 browser->min_pcnt = min_pcnt;
3007 hist_browser__update_nr_entries(browser);
3008
3009 browser->pstack = pstack__new(3);
3010 if (browser->pstack == NULL)
3011 goto out;
3012
3013 ui_helpline__push(helpline);
3014
3015 memset(options, 0, sizeof(options));
3016 memset(actions, 0, sizeof(actions));
3017
3018 if (symbol_conf.col_width_list_str)
3019 perf_hpp__set_user_width(symbol_conf.col_width_list_str);
3020
3021 if (!is_report_browser(hbt))
3022 browser->b.no_samples_msg = "Collecting samples...";
3023
3024 while (1) {
3025 struct thread *thread = NULL;
3026 struct map *map = NULL;
3027 int choice;
3028 int socked_id = -1;
3029
3030 key = 0; // reset key
3031do_hotkey: // key came straight from options ui__popup_menu()
3032 choice = nr_options = 0;
3033 key = hist_browser__run(browser, helpline, warn_lost_event, key);
3034
3035 if (browser->he_selection != NULL) {
3036 thread = hist_browser__selected_thread(browser);
3037 map = browser->selection->map;
3038 socked_id = browser->he_selection->socket;
3039 }
3040 switch (key) {
3041 case K_TAB:
3042 case K_UNTAB:
3043 if (nr_events == 1)
3044 continue;
3045 /*
3046 * Exit the browser, let hists__browser_tree
3047 * go to the next or previous
3048 */
3049 goto out_free_stack;
3050 case '0' ... '9':
3051 if (!symbol_conf.event_group ||
3052 evsel->core.nr_members < 2) {
3053 snprintf(buf, sizeof(buf),
3054 "Sort by index only available with group events!");
3055 helpline = buf;
3056 continue;
3057 }
3058
3059 if (key - '0' == symbol_conf.group_sort_idx)
3060 continue;
3061
3062 symbol_conf.group_sort_idx = key - '0';
3063
3064 if (symbol_conf.group_sort_idx >= evsel->core.nr_members) {
3065 snprintf(buf, sizeof(buf),
3066 "Max event group index to sort is %d (index from 0 to %d)",
3067 evsel->core.nr_members - 1,
3068 evsel->core.nr_members - 1);
3069 helpline = buf;
3070 continue;
3071 }
3072
3073 key = K_RELOAD;
3074 goto out_free_stack;
3075 case 'a':
3076 if (!hists__has(hists, sym)) {
3077 ui_browser__warning(&browser->b, delay_secs * 2,
3078 "Annotation is only available for symbolic views, "
3079 "include \"sym*\" in --sort to use it.");
3080 continue;
3081 }
3082
3083 if (!browser->selection ||
3084 !browser->selection->map ||
3085 !map__dso(browser->selection->map) ||
3086 map__dso(browser->selection->map)->annotate_warned) {
3087 continue;
3088 }
3089
3090 if (!browser->selection->sym) {
3091 if (!browser->he_selection)
3092 continue;
3093
3094 if (sort__mode == SORT_MODE__BRANCH) {
3095 bi = browser->he_selection->branch_info;
3096 if (!bi || !bi->to.ms.map)
3097 continue;
3098
3099 actions->ms.sym = symbol__new_unresolved(bi->to.al_addr, bi->to.ms.map);
3100 actions->ms.map = bi->to.ms.map;
3101 } else {
3102 actions->ms.sym = symbol__new_unresolved(browser->he_selection->ip,
3103 browser->selection->map);
3104 actions->ms.map = browser->selection->map;
3105 }
3106
3107 if (!actions->ms.sym)
3108 continue;
3109 } else {
3110 if (symbol__annotation(browser->selection->sym)->src == NULL) {
3111 ui_browser__warning(&browser->b, delay_secs * 2,
3112 "No samples for the \"%s\" symbol.\n\n"
3113 "Probably appeared just in a callchain",
3114 browser->selection->sym->name);
3115 continue;
3116 }
3117
3118 actions->ms.map = browser->selection->map;
3119 actions->ms.sym = browser->selection->sym;
3120 }
3121
3122 do_annotate(browser, actions);
3123 continue;
3124 case 'P':
3125 hist_browser__dump(browser);
3126 continue;
3127 case 'd':
3128 actions->ms.map = map;
3129 do_zoom_dso(browser, actions);
3130 continue;
3131 case 'k':
3132 if (browser->selection != NULL)
3133 hists_browser__zoom_map(browser,
3134 maps__machine(browser->selection->maps)->vmlinux_map);
3135 continue;
3136 case 'V':
3137 verbose = (verbose + 1) % 4;
3138 browser->show_dso = verbose > 0;
3139 ui_helpline__fpush("Verbosity level set to %d\n",
3140 verbose);
3141 continue;
3142 case 't':
3143 actions->thread = thread;
3144 do_zoom_thread(browser, actions);
3145 continue;
3146 case 'S':
3147 actions->socket = socked_id;
3148 do_zoom_socket(browser, actions);
3149 continue;
3150 case '/':
3151 if (ui_browser__input_window("Symbol to show",
3152 "Please enter the name of symbol you want to see.\n"
3153 "To remove the filter later, press / + ENTER.",
3154 buf, "ENTER: OK, ESC: Cancel",
3155 delay_secs * 2) == K_ENTER) {
3156 hists->symbol_filter_str = *buf ? buf : NULL;
3157 hists__filter_by_symbol(hists);
3158 hist_browser__reset(browser);
3159 }
3160 continue;
3161 case 'r':
3162 if (is_report_browser(hbt)) {
3163 actions->thread = NULL;
3164 actions->ms.sym = NULL;
3165 do_run_script(browser, actions);
3166 }
3167 continue;
3168 case 's':
3169 if (is_report_browser(hbt)) {
3170 key = do_switch_data(browser, actions);
3171 if (key == K_SWITCH_INPUT_DATA)
3172 goto out_free_stack;
3173 }
3174 continue;
3175 case 'i':
3176 /* env->arch is NULL for live-mode (i.e. perf top) */
3177 if (env->arch)
3178 tui__header_window(env);
3179 continue;
3180 case 'F':
3181 symbol_conf.filter_relative ^= 1;
3182 continue;
3183 case 'z':
3184 if (!is_report_browser(hbt)) {
3185 struct perf_top *top = hbt->arg;
3186
3187 top->zero = !top->zero;
3188 }
3189 continue;
3190 case 'L':
3191 if (ui_browser__input_window("Percent Limit",
3192 "Please enter the value you want to hide entries under that percent.",
3193 buf, "ENTER: OK, ESC: Cancel",
3194 delay_secs * 2) == K_ENTER) {
3195 char *end;
3196 double new_percent = strtod(buf, &end);
3197
3198 if (new_percent < 0 || new_percent > 100) {
3199 ui_browser__warning(&browser->b, delay_secs * 2,
3200 "Invalid percent: %.2f", new_percent);
3201 continue;
3202 }
3203
3204 hist_browser__update_percent_limit(browser, new_percent);
3205 hist_browser__reset(browser);
3206 }
3207 continue;
3208 case K_F1:
3209 case 'h':
3210 case '?':
3211 ui_browser__help_window(&browser->b,
3212 is_report_browser(hbt) ? report_help : top_help);
3213 continue;
3214 case K_ENTER:
3215 case K_RIGHT:
3216 case 'm':
3217 /* menu */
3218 break;
3219 case K_ESC:
3220 case K_LEFT: {
3221 const void *top;
3222
3223 if (pstack__empty(browser->pstack)) {
3224 /*
3225 * Go back to the perf_evsel_menu__run or other user
3226 */
3227 if (left_exits)
3228 goto out_free_stack;
3229
3230 if (key == K_ESC &&
3231 ui_browser__dialog_yesno(&browser->b,
3232 "Do you really want to exit?"))
3233 goto out_free_stack;
3234
3235 continue;
3236 }
3237 actions->ms.map = map;
3238 top = pstack__peek(browser->pstack);
3239 if (top == &browser->hists->dso_filter) {
3240 /*
3241 * No need to set actions->dso here since
3242 * it's just to remove the current filter.
3243 * Ditto for thread below.
3244 */
3245 do_zoom_dso(browser, actions);
3246 } else if (top == &browser->hists->thread_filter) {
3247 do_zoom_thread(browser, actions);
3248 } else if (top == &browser->hists->socket_filter) {
3249 do_zoom_socket(browser, actions);
3250 }
3251 continue;
3252 }
3253 case 'q':
3254 case CTRL('c'):
3255 goto out_free_stack;
3256 case 'f':
3257 if (!is_report_browser(hbt)) {
3258 struct perf_top *top = hbt->arg;
3259
3260 evlist__toggle_enable(top->evlist);
3261 /*
3262 * No need to refresh, resort/decay histogram
3263 * entries if we are not collecting samples:
3264 */
3265 if (top->evlist->enabled) {
3266 helpline = "Press 'f' to disable the events or 'h' to see other hotkeys";
3267 hbt->refresh = delay_secs;
3268 } else {
3269 helpline = "Press 'f' again to re-enable the events";
3270 hbt->refresh = 0;
3271 }
3272 continue;
3273 }
3274 /* Fall thru */
3275 default:
3276 helpline = "Press '?' for help on key bindings";
3277 continue;
3278 }
3279
3280 if (!hists__has(hists, sym) || browser->selection == NULL)
3281 goto skip_annotation;
3282
3283 if (sort__mode == SORT_MODE__BRANCH) {
3284
3285 if (browser->he_selection)
3286 bi = browser->he_selection->branch_info;
3287
3288 if (bi == NULL)
3289 goto skip_annotation;
3290
3291 nr_options += add_annotate_opt(browser,
3292 &actions[nr_options],
3293 &options[nr_options],
3294 &bi->from.ms,
3295 bi->from.al_addr);
3296 if (bi->to.ms.sym != bi->from.ms.sym)
3297 nr_options += add_annotate_opt(browser,
3298 &actions[nr_options],
3299 &options[nr_options],
3300 &bi->to.ms,
3301 bi->to.al_addr);
3302 } else if (browser->he_selection) {
3303 nr_options += add_annotate_opt(browser,
3304 &actions[nr_options],
3305 &options[nr_options],
3306 browser->selection,
3307 browser->he_selection->ip);
3308 }
3309skip_annotation:
3310 nr_options += add_thread_opt(browser, &actions[nr_options],
3311 &options[nr_options], thread);
3312 nr_options += add_dso_opt(browser, &actions[nr_options],
3313 &options[nr_options], map);
3314 nr_options += add_callchain_toggle_opt(browser, &actions[nr_options], &options[nr_options]);
3315 nr_options += add_map_opt(browser, &actions[nr_options],
3316 &options[nr_options],
3317 browser->selection ?
3318 browser->selection->map : NULL);
3319 nr_options += add_socket_opt(browser, &actions[nr_options],
3320 &options[nr_options],
3321 socked_id);
3322 /* perf script support */
3323 if (!is_report_browser(hbt))
3324 goto skip_scripting;
3325
3326 if (browser->he_selection) {
3327 if (hists__has(hists, thread) && thread) {
3328 nr_options += add_script_opt(browser,
3329 &actions[nr_options],
3330 &options[nr_options],
3331 thread, NULL, evsel);
3332 }
3333 /*
3334 * Note that browser->selection != NULL
3335 * when browser->he_selection is not NULL,
3336 * so we don't need to check browser->selection
3337 * before fetching browser->selection->sym like what
3338 * we do before fetching browser->selection->map.
3339 *
3340 * See hist_browser__show_entry.
3341 */
3342 if (hists__has(hists, sym) && browser->selection->sym) {
3343 nr_options += add_script_opt(browser,
3344 &actions[nr_options],
3345 &options[nr_options],
3346 NULL, browser->selection->sym,
3347 evsel);
3348 }
3349 }
3350 nr_options += add_script_opt(browser, &actions[nr_options],
3351 &options[nr_options], NULL, NULL, evsel);
3352 nr_options += add_res_sample_opt(browser, &actions[nr_options],
3353 &options[nr_options],
3354 hist_browser__selected_res_sample(browser),
3355 evsel, A_NORMAL);
3356 nr_options += add_res_sample_opt(browser, &actions[nr_options],
3357 &options[nr_options],
3358 hist_browser__selected_res_sample(browser),
3359 evsel, A_ASM);
3360 nr_options += add_res_sample_opt(browser, &actions[nr_options],
3361 &options[nr_options],
3362 hist_browser__selected_res_sample(browser),
3363 evsel, A_SOURCE);
3364 nr_options += add_switch_opt(browser, &actions[nr_options],
3365 &options[nr_options]);
3366skip_scripting:
3367 nr_options += add_exit_opt(browser, &actions[nr_options],
3368 &options[nr_options]);
3369
3370 do {
3371 struct popup_action *act;
3372
3373 choice = ui__popup_menu(nr_options, options, &key);
3374 if (choice == -1)
3375 break;
3376
3377 if (choice == nr_options)
3378 goto do_hotkey;
3379
3380 act = &actions[choice];
3381 key = act->fn(browser, act);
3382 } while (key == 1);
3383
3384 if (key == K_SWITCH_INPUT_DATA)
3385 break;
3386 }
3387out_free_stack:
3388 pstack__delete(browser->pstack);
3389out:
3390 hist_browser__delete(browser);
3391 free_popup_options(options, MAX_OPTIONS);
3392 return key;
3393}
3394
3395struct evsel_menu {
3396 struct ui_browser b;
3397 struct evsel *selection;
3398 bool lost_events, lost_events_warned;
3399 float min_pcnt;
3400 struct perf_env *env;
3401};
3402
3403static void perf_evsel_menu__write(struct ui_browser *browser,
3404 void *entry, int row)
3405{
3406 struct evsel_menu *menu = container_of(browser,
3407 struct evsel_menu, b);
3408 struct evsel *evsel = list_entry(entry, struct evsel, core.node);
3409 struct hists *hists = evsel__hists(evsel);
3410 bool current_entry = ui_browser__is_current_entry(browser, row);
3411 unsigned long nr_events = hists->stats.nr_samples;
3412 const char *ev_name = evsel__name(evsel);
3413 char bf[256], unit;
3414 const char *warn = " ";
3415 size_t printed;
3416
3417 ui_browser__set_color(browser, current_entry ? HE_COLORSET_SELECTED :
3418 HE_COLORSET_NORMAL);
3419
3420 if (evsel__is_group_event(evsel)) {
3421 struct evsel *pos;
3422
3423 ev_name = evsel__group_name(evsel);
3424
3425 for_each_group_member(pos, evsel) {
3426 struct hists *pos_hists = evsel__hists(pos);
3427 nr_events += pos_hists->stats.nr_samples;
3428 }
3429 }
3430
3431 nr_events = convert_unit(nr_events, &unit);
3432 printed = scnprintf(bf, sizeof(bf), "%lu%c%s%s", nr_events,
3433 unit, unit == ' ' ? "" : " ", ev_name);
3434 ui_browser__printf(browser, "%s", bf);
3435
3436 nr_events = evsel->evlist->stats.nr_events[PERF_RECORD_LOST];
3437 if (nr_events != 0) {
3438 menu->lost_events = true;
3439 if (!current_entry)
3440 ui_browser__set_color(browser, HE_COLORSET_TOP);
3441 nr_events = convert_unit(nr_events, &unit);
3442 printed += scnprintf(bf, sizeof(bf), ": %ld%c%schunks LOST!",
3443 nr_events, unit, unit == ' ' ? "" : " ");
3444 warn = bf;
3445 }
3446
3447 ui_browser__write_nstring(browser, warn, browser->width - printed);
3448
3449 if (current_entry)
3450 menu->selection = evsel;
3451}
3452
3453static int perf_evsel_menu__run(struct evsel_menu *menu,
3454 int nr_events, const char *help,
3455 struct hist_browser_timer *hbt,
3456 bool warn_lost_event)
3457{
3458 struct evlist *evlist = menu->b.priv;
3459 struct evsel *pos;
3460 const char *title = "Available samples";
3461 int delay_secs = hbt ? hbt->refresh : 0;
3462 int key;
3463
3464 if (ui_browser__show(&menu->b, title,
3465 "ESC: exit, ENTER|->: Browse histograms") < 0)
3466 return -1;
3467
3468 while (1) {
3469 key = ui_browser__run(&menu->b, delay_secs);
3470
3471 switch (key) {
3472 case K_TIMER:
3473 if (hbt)
3474 hbt->timer(hbt->arg);
3475
3476 if (!menu->lost_events_warned &&
3477 menu->lost_events &&
3478 warn_lost_event) {
3479 ui_browser__warn_lost_events(&menu->b);
3480 menu->lost_events_warned = true;
3481 }
3482 continue;
3483 case K_RIGHT:
3484 case K_ENTER:
3485 if (!menu->selection)
3486 continue;
3487 pos = menu->selection;
3488browse_hists:
3489 evlist__set_selected(evlist, pos);
3490 /*
3491 * Give the calling tool a chance to populate the non
3492 * default evsel resorted hists tree.
3493 */
3494 if (hbt)
3495 hbt->timer(hbt->arg);
3496 key = evsel__hists_browse(pos, nr_events, help, true, hbt,
3497 menu->min_pcnt, menu->env,
3498 warn_lost_event);
3499 ui_browser__show_title(&menu->b, title);
3500 switch (key) {
3501 case K_TAB:
3502 if (pos->core.node.next == &evlist->core.entries)
3503 pos = evlist__first(evlist);
3504 else
3505 pos = evsel__next(pos);
3506 goto browse_hists;
3507 case K_UNTAB:
3508 if (pos->core.node.prev == &evlist->core.entries)
3509 pos = evlist__last(evlist);
3510 else
3511 pos = evsel__prev(pos);
3512 goto browse_hists;
3513 case K_SWITCH_INPUT_DATA:
3514 case K_RELOAD:
3515 case 'q':
3516 case CTRL('c'):
3517 goto out;
3518 case K_ESC:
3519 default:
3520 continue;
3521 }
3522 case K_LEFT:
3523 continue;
3524 case K_ESC:
3525 if (!ui_browser__dialog_yesno(&menu->b,
3526 "Do you really want to exit?"))
3527 continue;
3528 /* Fall thru */
3529 case 'q':
3530 case CTRL('c'):
3531 goto out;
3532 default:
3533 continue;
3534 }
3535 }
3536
3537out:
3538 ui_browser__hide(&menu->b);
3539 return key;
3540}
3541
3542static bool filter_group_entries(struct ui_browser *browser __maybe_unused,
3543 void *entry)
3544{
3545 struct evsel *evsel = list_entry(entry, struct evsel, core.node);
3546
3547 if (symbol_conf.event_group && !evsel__is_group_leader(evsel))
3548 return true;
3549
3550 return false;
3551}
3552
3553static int __evlist__tui_browse_hists(struct evlist *evlist, int nr_entries, const char *help,
3554 struct hist_browser_timer *hbt, float min_pcnt, struct perf_env *env,
3555 bool warn_lost_event)
3556{
3557 struct evsel *pos;
3558 struct evsel_menu menu = {
3559 .b = {
3560 .entries = &evlist->core.entries,
3561 .refresh = ui_browser__list_head_refresh,
3562 .seek = ui_browser__list_head_seek,
3563 .write = perf_evsel_menu__write,
3564 .filter = filter_group_entries,
3565 .nr_entries = nr_entries,
3566 .priv = evlist,
3567 },
3568 .min_pcnt = min_pcnt,
3569 .env = env,
3570 };
3571
3572 ui_helpline__push("Press ESC to exit");
3573
3574 evlist__for_each_entry(evlist, pos) {
3575 const char *ev_name = evsel__name(pos);
3576 size_t line_len = strlen(ev_name) + 7;
3577
3578 if (menu.b.width < line_len)
3579 menu.b.width = line_len;
3580 }
3581
3582 return perf_evsel_menu__run(&menu, nr_entries, help,
3583 hbt, warn_lost_event);
3584}
3585
3586static bool evlist__single_entry(struct evlist *evlist)
3587{
3588 int nr_entries = evlist->core.nr_entries;
3589
3590 if (nr_entries == 1)
3591 return true;
3592
3593 if (nr_entries == 2) {
3594 struct evsel *last = evlist__last(evlist);
3595
3596 if (evsel__is_dummy_event(last))
3597 return true;
3598 }
3599
3600 return false;
3601}
3602
3603int evlist__tui_browse_hists(struct evlist *evlist, const char *help, struct hist_browser_timer *hbt,
3604 float min_pcnt, struct perf_env *env, bool warn_lost_event)
3605{
3606 int nr_entries = evlist->core.nr_entries;
3607
3608 if (evlist__single_entry(evlist)) {
3609single_entry: {
3610 struct evsel *first = evlist__first(evlist);
3611
3612 return evsel__hists_browse(first, nr_entries, help, false, hbt, min_pcnt,
3613 env, warn_lost_event);
3614 }
3615 }
3616
3617 if (symbol_conf.event_group) {
3618 struct evsel *pos;
3619
3620 nr_entries = 0;
3621 evlist__for_each_entry(evlist, pos) {
3622 if (evsel__is_group_leader(pos))
3623 nr_entries++;
3624 }
3625
3626 if (nr_entries == 1)
3627 goto single_entry;
3628 }
3629
3630 return __evlist__tui_browse_hists(evlist, nr_entries, help, hbt, min_pcnt, env,
3631 warn_lost_event);
3632}
3633
3634static int block_hists_browser__title(struct hist_browser *browser, char *bf,
3635 size_t size)
3636{
3637 struct hists *hists = evsel__hists(browser->block_evsel);
3638 const char *evname = evsel__name(browser->block_evsel);
3639 unsigned long nr_samples = hists->stats.nr_samples;
3640 int ret;
3641
3642 ret = scnprintf(bf, size, "# Samples: %lu", nr_samples);
3643 if (evname)
3644 scnprintf(bf + ret, size - ret, " of event '%s'", evname);
3645
3646 return 0;
3647}
3648
3649int block_hists_tui_browse(struct block_hist *bh, struct evsel *evsel,
3650 float min_percent, struct perf_env *env)
3651{
3652 struct hists *hists = &bh->block_hists;
3653 struct hist_browser *browser;
3654 int key = -1;
3655 struct popup_action action;
3656 static const char help[] =
3657 " q Quit \n";
3658
3659 browser = hist_browser__new(hists);
3660 if (!browser)
3661 return -1;
3662
3663 browser->block_evsel = evsel;
3664 browser->title = block_hists_browser__title;
3665 browser->min_pcnt = min_percent;
3666 browser->env = env;
3667
3668 /* reset abort key so that it can get Ctrl-C as a key */
3669 SLang_reset_tty();
3670 SLang_init_tty(0, 0, 0);
3671 SLtty_set_suspend_state(true);
3672
3673 memset(&action, 0, sizeof(action));
3674
3675 while (1) {
3676 key = hist_browser__run(browser, "? - help", true, 0);
3677
3678 switch (key) {
3679 case 'q':
3680 goto out;
3681 case '?':
3682 ui_browser__help_window(&browser->b, help);
3683 break;
3684 case 'a':
3685 case K_ENTER:
3686 if (!browser->selection ||
3687 !browser->selection->sym) {
3688 continue;
3689 }
3690
3691 action.ms.map = browser->selection->map;
3692 action.ms.sym = browser->selection->sym;
3693 do_annotate(browser, &action);
3694 continue;
3695 default:
3696 break;
3697 }
3698 }
3699
3700out:
3701 hist_browser__delete(browser);
3702 return 0;
3703}