projects / deliverable / linux.git / blob
? search:


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