projects / deliverable / linux.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
perf report: Fix indentation of dynamic entries in hierarchy
[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 width -= fmt->entry(fmt, &hpp, entry);
1404 ui_browser__printf(&browser->b, "%s", s);
1405 }
1406 }
1407
1408 /* The scroll bar isn't being used */
1409 if (!browser->b.navkeypressed)
1410 width += 1;
1411
1412 ui_browser__write_nstring(&browser->b, "", width);
1413
1414 ++row;
1415 ++printed;
1416
1417 show_callchain:
1418 if (entry->leaf && folded_sign == '-' && row != browser->b.rows) {
1419 struct callchain_print_arg carg = {
1420 .row_offset = row_offset,
1421 };
1422
1423 printed += hist_browser__show_callchain(browser, entry,
1424 level + 1, row,
1425 hist_browser__show_callchain_entry, &carg,
1426 hist_browser__check_output_full);
1427 }
1428
1429 return printed;
1430 }
1431
1432 static int hist_browser__show_no_entry(struct hist_browser *browser,
1433 unsigned short row,
1434 int level, int nr_sort_keys)
1435 {
1436 int width = browser->b.width;
1437 bool current_entry = ui_browser__is_current_entry(&browser->b, row);
1438 bool first = true;
1439 int column = 0;
1440 int ret;
1441 struct perf_hpp_fmt *fmt;
1442
1443 if (current_entry) {
1444 browser->he_selection = NULL;
1445 browser->selection = NULL;
1446 }
1447
1448 hist_browser__gotorc(browser, row, 0);
1449
1450 if (current_entry && browser->b.navkeypressed)
1451 ui_browser__set_color(&browser->b, HE_COLORSET_SELECTED);
1452 else
1453 ui_browser__set_color(&browser->b, HE_COLORSET_NORMAL);
1454
1455 ui_browser__write_nstring(&browser->b, "", level * HIERARCHY_INDENT);
1456 width -= level * HIERARCHY_INDENT;
1457
1458 hists__for_each_format(browser->hists, fmt) {
1459 if (perf_hpp__should_skip(fmt, browser->hists) ||
1460 column++ < browser->b.horiz_scroll)
1461 continue;
1462
1463 if (perf_hpp__is_sort_entry(fmt) ||
1464 perf_hpp__is_dynamic_entry(fmt))
1465 break;
1466
1467 ret = fmt->width(fmt, NULL, hists_to_evsel(browser->hists));
1468
1469 if (first) {
1470 /* for folded sign */
1471 first = false;
1472 ret++;
1473 } else {
1474 /* space between columns */
1475 ret += 2;
1476 }
1477
1478 ui_browser__write_nstring(&browser->b, "", ret);
1479 width -= ret;
1480 }
1481
1482 ui_browser__write_nstring(&browser->b, "", nr_sort_keys * HIERARCHY_INDENT);
1483 width -= nr_sort_keys * HIERARCHY_INDENT;
1484
1485 if (column >= browser->b.horiz_scroll) {
1486 char buf[32];
1487
1488 ret = snprintf(buf, sizeof(buf), "no entry >= %.2f%%", browser->min_pcnt);
1489 ui_browser__printf(&browser->b, " %s", buf);
1490 width -= ret + 2;
1491 }
1492
1493 /* The scroll bar isn't being used */
1494 if (!browser->b.navkeypressed)
1495 width += 1;
1496
1497 ui_browser__write_nstring(&browser->b, "", width);
1498 return 1;
1499 }
1500
1501 static int advance_hpp_check(struct perf_hpp *hpp, int inc)
1502 {
1503 advance_hpp(hpp, inc);
1504 return hpp->size <= 0;
1505 }
1506
1507 static int hists_browser__scnprintf_headers(struct hist_browser *browser, char *buf, size_t size)
1508 {
1509 struct hists *hists = browser->hists;
1510 struct perf_hpp dummy_hpp = {
1511 .buf = buf,
1512 .size = size,
1513 };
1514 struct perf_hpp_fmt *fmt;
1515 size_t ret = 0;
1516 int column = 0;
1517
1518 if (symbol_conf.use_callchain) {
1519 ret = scnprintf(buf, size, " ");
1520 if (advance_hpp_check(&dummy_hpp, ret))
1521 return ret;
1522 }
1523
1524 hists__for_each_format(browser->hists, fmt) {
1525 if (perf_hpp__should_skip(fmt, hists) || column++ < browser->b.horiz_scroll)
1526 continue;
1527
1528 ret = fmt->header(fmt, &dummy_hpp, hists_to_evsel(hists));
1529 if (advance_hpp_check(&dummy_hpp, ret))
1530 break;
1531
1532 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, " ");
1533 if (advance_hpp_check(&dummy_hpp, ret))
1534 break;
1535 }
1536
1537 return ret;
1538 }
1539
1540 static int hists_browser__scnprintf_hierarchy_headers(struct hist_browser *browser, char *buf, size_t size)
1541 {
1542 struct hists *hists = browser->hists;
1543 struct perf_hpp dummy_hpp = {
1544 .buf = buf,
1545 .size = size,
1546 };
1547 struct perf_hpp_fmt *fmt;
1548 size_t ret = 0;
1549 int column = 0;
1550 int nr_sort_keys = hists->nr_sort_keys;
1551 bool first = true;
1552
1553 ret = scnprintf(buf, size, " ");
1554 if (advance_hpp_check(&dummy_hpp, ret))
1555 return ret;
1556
1557 hists__for_each_format(hists, fmt) {
1558 if (column++ < browser->b.horiz_scroll)
1559 continue;
1560
1561 if (perf_hpp__is_sort_entry(fmt) || perf_hpp__is_dynamic_entry(fmt))
1562 break;
1563
1564 ret = fmt->header(fmt, &dummy_hpp, hists_to_evsel(hists));
1565 if (advance_hpp_check(&dummy_hpp, ret))
1566 break;
1567
1568 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, " ");
1569 if (advance_hpp_check(&dummy_hpp, ret))
1570 break;
1571 }
1572
1573 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, "%*s",
1574 (nr_sort_keys - 1) * HIERARCHY_INDENT, "");
1575 if (advance_hpp_check(&dummy_hpp, ret))
1576 return ret;
1577
1578 hists__for_each_format(hists, fmt) {
1579 if (!perf_hpp__is_sort_entry(fmt) && !perf_hpp__is_dynamic_entry(fmt))
1580 continue;
1581 if (perf_hpp__should_skip(fmt, hists))
1582 continue;
1583
1584 if (first) {
1585 first = false;
1586 } else {
1587 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, " / ");
1588 if (advance_hpp_check(&dummy_hpp, ret))
1589 break;
1590 }
1591
1592 ret = fmt->header(fmt, &dummy_hpp, hists_to_evsel(hists));
1593 dummy_hpp.buf[ret] = '\0';
1594 rtrim(dummy_hpp.buf);
1595
1596 ret = strlen(dummy_hpp.buf);
1597 if (advance_hpp_check(&dummy_hpp, ret))
1598 break;
1599 }
1600
1601 return ret;
1602 }
1603
1604 static void hist_browser__show_headers(struct hist_browser *browser)
1605 {
1606 char headers[1024];
1607
1608 if (symbol_conf.report_hierarchy)
1609 hists_browser__scnprintf_hierarchy_headers(browser, headers,
1610 sizeof(headers));
1611 else
1612 hists_browser__scnprintf_headers(browser, headers,
1613 sizeof(headers));
1614 ui_browser__gotorc(&browser->b, 0, 0);
1615 ui_browser__set_color(&browser->b, HE_COLORSET_ROOT);
1616 ui_browser__write_nstring(&browser->b, headers, browser->b.width + 1);
1617 }
1618
1619 static void ui_browser__hists_init_top(struct ui_browser *browser)
1620 {
1621 if (browser->top == NULL) {
1622 struct hist_browser *hb;
1623
1624 hb = container_of(browser, struct hist_browser, b);
1625 browser->top = rb_first(&hb->hists->entries);
1626 }
1627 }
1628
1629 static unsigned int hist_browser__refresh(struct ui_browser *browser)
1630 {
1631 unsigned row = 0;
1632 u16 header_offset = 0;
1633 struct rb_node *nd;
1634 struct hist_browser *hb = container_of(browser, struct hist_browser, b);
1635 int nr_sort = hb->hists->nr_sort_keys;
1636
1637 if (hb->show_headers) {
1638 hist_browser__show_headers(hb);
1639 header_offset = 1;
1640 }
1641
1642 ui_browser__hists_init_top(browser);
1643 hb->he_selection = NULL;
1644 hb->selection = NULL;
1645
1646 for (nd = browser->top; nd; nd = rb_hierarchy_next(nd)) {
1647 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1648 float percent;
1649
1650 if (h->filtered) {
1651 /* let it move to sibling */
1652 h->unfolded = false;
1653 continue;
1654 }
1655
1656 percent = hist_entry__get_percent_limit(h);
1657 if (percent < hb->min_pcnt)
1658 continue;
1659
1660 if (symbol_conf.report_hierarchy) {
1661 row += hist_browser__show_hierarchy_entry(hb, h, row,
1662 h->depth,
1663 nr_sort);
1664 if (row == browser->rows)
1665 break;
1666
1667 if (h->has_no_entry) {
1668 hist_browser__show_no_entry(hb, row, h->depth,
1669 nr_sort);
1670 row++;
1671 }
1672 } else {
1673 row += hist_browser__show_entry(hb, h, row);
1674 }
1675
1676 if (row == browser->rows)
1677 break;
1678 }
1679
1680 return row + header_offset;
1681 }
1682
1683 static struct rb_node *hists__filter_entries(struct rb_node *nd,
1684 float min_pcnt)
1685 {
1686 while (nd != NULL) {
1687 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1688 float percent = hist_entry__get_percent_limit(h);
1689
1690 if (!h->filtered && percent >= min_pcnt)
1691 return nd;
1692
1693 /*
1694 * If it's filtered, its all children also were filtered.
1695 * So move to sibling node.
1696 */
1697 if (rb_next(nd))
1698 nd = rb_next(nd);
1699 else
1700 nd = rb_hierarchy_next(nd);
1701 }
1702
1703 return NULL;
1704 }
1705
1706 static struct rb_node *hists__filter_prev_entries(struct rb_node *nd,
1707 float min_pcnt)
1708 {
1709 while (nd != NULL) {
1710 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1711 float percent = hist_entry__get_percent_limit(h);
1712
1713 if (!h->filtered && percent >= min_pcnt)
1714 return nd;
1715
1716 nd = rb_hierarchy_prev(nd);
1717 }
1718
1719 return NULL;
1720 }
1721
1722 static void ui_browser__hists_seek(struct ui_browser *browser,
1723 off_t offset, int whence)
1724 {
1725 struct hist_entry *h;
1726 struct rb_node *nd;
1727 bool first = true;
1728 struct hist_browser *hb;
1729
1730 hb = container_of(browser, struct hist_browser, b);
1731
1732 if (browser->nr_entries == 0)
1733 return;
1734
1735 ui_browser__hists_init_top(browser);
1736
1737 switch (whence) {
1738 case SEEK_SET:
1739 nd = hists__filter_entries(rb_first(browser->entries),
1740 hb->min_pcnt);
1741 break;
1742 case SEEK_CUR:
1743 nd = browser->top;
1744 goto do_offset;
1745 case SEEK_END:
1746 nd = rb_hierarchy_last(rb_last(browser->entries));
1747 nd = hists__filter_prev_entries(nd, hb->min_pcnt);
1748 first = false;
1749 break;
1750 default:
1751 return;
1752 }
1753
1754 /*
1755 * Moves not relative to the first visible entry invalidates its
1756 * row_offset:
1757 */
1758 h = rb_entry(browser->top, struct hist_entry, rb_node);
1759 h->row_offset = 0;
1760
1761 /*
1762 * Here we have to check if nd is expanded (+), if it is we can't go
1763 * the next top level hist_entry, instead we must compute an offset of
1764 * what _not_ to show and not change the first visible entry.
1765 *
1766 * This offset increments when we are going from top to bottom and
1767 * decreases when we're going from bottom to top.
1768 *
1769 * As we don't have backpointers to the top level in the callchains
1770 * structure, we need to always print the whole hist_entry callchain,
1771 * skipping the first ones that are before the first visible entry
1772 * and stop when we printed enough lines to fill the screen.
1773 */
1774 do_offset:
1775 if (!nd)
1776 return;
1777
1778 if (offset > 0) {
1779 do {
1780 h = rb_entry(nd, struct hist_entry, rb_node);
1781 if (h->unfolded && h->leaf) {
1782 u16 remaining = h->nr_rows - h->row_offset;
1783 if (offset > remaining) {
1784 offset -= remaining;
1785 h->row_offset = 0;
1786 } else {
1787 h->row_offset += offset;
1788 offset = 0;
1789 browser->top = nd;
1790 break;
1791 }
1792 }
1793 nd = hists__filter_entries(rb_hierarchy_next(nd),
1794 hb->min_pcnt);
1795 if (nd == NULL)
1796 break;
1797 --offset;
1798 browser->top = nd;
1799 } while (offset != 0);
1800 } else if (offset < 0) {
1801 while (1) {
1802 h = rb_entry(nd, struct hist_entry, rb_node);
1803 if (h->unfolded && h->leaf) {
1804 if (first) {
1805 if (-offset > h->row_offset) {
1806 offset += h->row_offset;
1807 h->row_offset = 0;
1808 } else {
1809 h->row_offset += offset;
1810 offset = 0;
1811 browser->top = nd;
1812 break;
1813 }
1814 } else {
1815 if (-offset > h->nr_rows) {
1816 offset += h->nr_rows;
1817 h->row_offset = 0;
1818 } else {
1819 h->row_offset = h->nr_rows + offset;
1820 offset = 0;
1821 browser->top = nd;
1822 break;
1823 }
1824 }
1825 }
1826
1827 nd = hists__filter_prev_entries(rb_hierarchy_prev(nd),
1828 hb->min_pcnt);
1829 if (nd == NULL)
1830 break;
1831 ++offset;
1832 browser->top = nd;
1833 if (offset == 0) {
1834 /*
1835 * Last unfiltered hist_entry, check if it is
1836 * unfolded, if it is then we should have
1837 * row_offset at its last entry.
1838 */
1839 h = rb_entry(nd, struct hist_entry, rb_node);
1840 if (h->unfolded && h->leaf)
1841 h->row_offset = h->nr_rows;
1842 break;
1843 }
1844 first = false;
1845 }
1846 } else {
1847 browser->top = nd;
1848 h = rb_entry(nd, struct hist_entry, rb_node);
1849 h->row_offset = 0;
1850 }
1851 }
1852
1853 static int hist_browser__fprintf_callchain(struct hist_browser *browser,
1854 struct hist_entry *he, FILE *fp,
1855 int level)
1856 {
1857 struct callchain_print_arg arg = {
1858 .fp = fp,
1859 };
1860
1861 hist_browser__show_callchain(browser, he, level, 0,
1862 hist_browser__fprintf_callchain_entry, &arg,
1863 hist_browser__check_dump_full);
1864 return arg.printed;
1865 }
1866
1867 static int hist_browser__fprintf_entry(struct hist_browser *browser,
1868 struct hist_entry *he, FILE *fp)
1869 {
1870 char s[8192];
1871 int printed = 0;
1872 char folded_sign = ' ';
1873 struct perf_hpp hpp = {
1874 .buf = s,
1875 .size = sizeof(s),
1876 };
1877 struct perf_hpp_fmt *fmt;
1878 bool first = true;
1879 int ret;
1880
1881 if (symbol_conf.use_callchain)
1882 folded_sign = hist_entry__folded(he);
1883
1884 if (symbol_conf.use_callchain)
1885 printed += fprintf(fp, "%c ", folded_sign);
1886
1887 hists__for_each_format(browser->hists, fmt) {
1888 if (perf_hpp__should_skip(fmt, he->hists))
1889 continue;
1890
1891 if (!first) {
1892 ret = scnprintf(hpp.buf, hpp.size, " ");
1893 advance_hpp(&hpp, ret);
1894 } else
1895 first = false;
1896
1897 ret = fmt->entry(fmt, &hpp, he);
1898 ret = hist_entry__snprintf_alignment(he, &hpp, fmt, ret);
1899 advance_hpp(&hpp, ret);
1900 }
1901 printed += fprintf(fp, "%s\n", s);
1902
1903 if (folded_sign == '-')
1904 printed += hist_browser__fprintf_callchain(browser, he, fp, 1);
1905
1906 return printed;
1907 }
1908
1909
1910 static int hist_browser__fprintf_hierarchy_entry(struct hist_browser *browser,
1911 struct hist_entry *he,
1912 FILE *fp, int level,
1913 int nr_sort_keys)
1914 {
1915 char s[8192];
1916 int printed = 0;
1917 char folded_sign = ' ';
1918 struct perf_hpp hpp = {
1919 .buf = s,
1920 .size = sizeof(s),
1921 };
1922 struct perf_hpp_fmt *fmt;
1923 bool first = true;
1924 int ret;
1925 int hierarchy_indent = (nr_sort_keys + 1) * HIERARCHY_INDENT;
1926
1927 printed = fprintf(fp, "%*s", level * HIERARCHY_INDENT, "");
1928
1929 folded_sign = hist_entry__folded(he);
1930 printed += fprintf(fp, "%c", folded_sign);
1931
1932 hists__for_each_format(he->hists, fmt) {
1933 if (perf_hpp__should_skip(fmt, he->hists))
1934 continue;
1935
1936 if (perf_hpp__is_sort_entry(fmt) ||
1937 perf_hpp__is_dynamic_entry(fmt))
1938 break;
1939
1940 if (!first) {
1941 ret = scnprintf(hpp.buf, hpp.size, " ");
1942 advance_hpp(&hpp, ret);
1943 } else
1944 first = false;
1945
1946 ret = fmt->entry(fmt, &hpp, he);
1947 advance_hpp(&hpp, ret);
1948 }
1949
1950 ret = scnprintf(hpp.buf, hpp.size, "%*s", hierarchy_indent, "");
1951 advance_hpp(&hpp, ret);
1952
1953 fmt = he->fmt;
1954 ret = fmt->entry(fmt, &hpp, he);
1955 advance_hpp(&hpp, ret);
1956
1957 printed += fprintf(fp, "%s\n", rtrim(s));
1958
1959 if (he->leaf && folded_sign == '-') {
1960 printed += hist_browser__fprintf_callchain(browser, he, fp,
1961 he->depth + 1);
1962 }
1963
1964 return printed;
1965 }
1966
1967 static int hist_browser__fprintf(struct hist_browser *browser, FILE *fp)
1968 {
1969 struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries),
1970 browser->min_pcnt);
1971 int printed = 0;
1972 int nr_sort = browser->hists->nr_sort_keys;
1973
1974 while (nd) {
1975 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1976
1977 if (symbol_conf.report_hierarchy) {
1978 printed += hist_browser__fprintf_hierarchy_entry(browser,
1979 h, fp,
1980 h->depth,
1981 nr_sort);
1982 } else {
1983 printed += hist_browser__fprintf_entry(browser, h, fp);
1984 }
1985
1986 nd = hists__filter_entries(rb_hierarchy_next(nd),
1987 browser->min_pcnt);
1988 }
1989
1990 return printed;
1991 }
1992
1993 static int hist_browser__dump(struct hist_browser *browser)
1994 {
1995 char filename[64];
1996 FILE *fp;
1997
1998 while (1) {
1999 scnprintf(filename, sizeof(filename), "perf.hist.%d", browser->print_seq);
2000 if (access(filename, F_OK))
2001 break;
2002 /*
2003 * XXX: Just an arbitrary lazy upper limit
2004 */
2005 if (++browser->print_seq == 8192) {
2006 ui_helpline__fpush("Too many perf.hist.N files, nothing written!");
2007 return -1;
2008 }
2009 }
2010
2011 fp = fopen(filename, "w");
2012 if (fp == NULL) {
2013 char bf[64];
2014 const char *err = strerror_r(errno, bf, sizeof(bf));
2015 ui_helpline__fpush("Couldn't write to %s: %s", filename, err);
2016 return -1;
2017 }
2018
2019 ++browser->print_seq;
2020 hist_browser__fprintf(browser, fp);
2021 fclose(fp);
2022 ui_helpline__fpush("%s written!", filename);
2023
2024 return 0;
2025 }
2026
2027 static struct hist_browser *hist_browser__new(struct hists *hists,
2028 struct hist_browser_timer *hbt,
2029 struct perf_env *env)
2030 {
2031 struct hist_browser *browser = zalloc(sizeof(*browser));
2032
2033 if (browser) {
2034 browser->hists = hists;
2035 browser->b.refresh = hist_browser__refresh;
2036 browser->b.refresh_dimensions = hist_browser__refresh_dimensions;
2037 browser->b.seek = ui_browser__hists_seek;
2038 browser->b.use_navkeypressed = true;
2039 browser->show_headers = symbol_conf.show_hist_headers;
2040 browser->hbt = hbt;
2041 browser->env = env;
2042 }
2043
2044 return browser;
2045 }
2046
2047 static void hist_browser__delete(struct hist_browser *browser)
2048 {
2049 free(browser);
2050 }
2051
2052 static struct hist_entry *hist_browser__selected_entry(struct hist_browser *browser)
2053 {
2054 return browser->he_selection;
2055 }
2056
2057 static struct thread *hist_browser__selected_thread(struct hist_browser *browser)
2058 {
2059 return browser->he_selection->thread;
2060 }
2061
2062 /* Check whether the browser is for 'top' or 'report' */
2063 static inline bool is_report_browser(void *timer)
2064 {
2065 return timer == NULL;
2066 }
2067
2068 static int hists__browser_title(struct hists *hists,
2069 struct hist_browser_timer *hbt,
2070 char *bf, size_t size)
2071 {
2072 char unit;
2073 int printed;
2074 const struct dso *dso = hists->dso_filter;
2075 const struct thread *thread = hists->thread_filter;
2076 int socket_id = hists->socket_filter;
2077 unsigned long nr_samples = hists->stats.nr_events[PERF_RECORD_SAMPLE];
2078 u64 nr_events = hists->stats.total_period;
2079 struct perf_evsel *evsel = hists_to_evsel(hists);
2080 const char *ev_name = perf_evsel__name(evsel);
2081 char buf[512];
2082 size_t buflen = sizeof(buf);
2083 char ref[30] = " show reference callgraph, ";
2084 bool enable_ref = false;
2085
2086 if (symbol_conf.filter_relative) {
2087 nr_samples = hists->stats.nr_non_filtered_samples;
2088 nr_events = hists->stats.total_non_filtered_period;
2089 }
2090
2091 if (perf_evsel__is_group_event(evsel)) {
2092 struct perf_evsel *pos;
2093
2094 perf_evsel__group_desc(evsel, buf, buflen);
2095 ev_name = buf;
2096
2097 for_each_group_member(pos, evsel) {
2098 struct hists *pos_hists = evsel__hists(pos);
2099
2100 if (symbol_conf.filter_relative) {
2101 nr_samples += pos_hists->stats.nr_non_filtered_samples;
2102 nr_events += pos_hists->stats.total_non_filtered_period;
2103 } else {
2104 nr_samples += pos_hists->stats.nr_events[PERF_RECORD_SAMPLE];
2105 nr_events += pos_hists->stats.total_period;
2106 }
2107 }
2108 }
2109
2110 if (symbol_conf.show_ref_callgraph &&
2111 strstr(ev_name, "call-graph=no"))
2112 enable_ref = true;
2113 nr_samples = convert_unit(nr_samples, &unit);
2114 printed = scnprintf(bf, size,
2115 "Samples: %lu%c of event '%s',%sEvent count (approx.): %" PRIu64,
2116 nr_samples, unit, ev_name, enable_ref ? ref : " ", nr_events);
2117
2118
2119 if (hists->uid_filter_str)
2120 printed += snprintf(bf + printed, size - printed,
2121 ", UID: %s", hists->uid_filter_str);
2122 if (thread)
2123 printed += scnprintf(bf + printed, size - printed,
2124 ", Thread: %s(%d)",
2125 (thread->comm_set ? thread__comm_str(thread) : ""),
2126 thread->tid);
2127 if (dso)
2128 printed += scnprintf(bf + printed, size - printed,
2129 ", DSO: %s", dso->short_name);
2130 if (socket_id > -1)
2131 printed += scnprintf(bf + printed, size - printed,
2132 ", Processor Socket: %d", socket_id);
2133 if (!is_report_browser(hbt)) {
2134 struct perf_top *top = hbt->arg;
2135
2136 if (top->zero)
2137 printed += scnprintf(bf + printed, size - printed, " [z]");
2138 }
2139
2140 return printed;
2141 }
2142
2143 static inline void free_popup_options(char **options, int n)
2144 {
2145 int i;
2146
2147 for (i = 0; i < n; ++i)
2148 zfree(&options[i]);
2149 }
2150
2151 /*
2152 * Only runtime switching of perf data file will make "input_name" point
2153 * to a malloced buffer. So add "is_input_name_malloced" flag to decide
2154 * whether we need to call free() for current "input_name" during the switch.
2155 */
2156 static bool is_input_name_malloced = false;
2157
2158 static int switch_data_file(void)
2159 {
2160 char *pwd, *options[32], *abs_path[32], *tmp;
2161 DIR *pwd_dir;
2162 int nr_options = 0, choice = -1, ret = -1;
2163 struct dirent *dent;
2164
2165 pwd = getenv("PWD");
2166 if (!pwd)
2167 return ret;
2168
2169 pwd_dir = opendir(pwd);
2170 if (!pwd_dir)
2171 return ret;
2172
2173 memset(options, 0, sizeof(options));
2174 memset(options, 0, sizeof(abs_path));
2175
2176 while ((dent = readdir(pwd_dir))) {
2177 char path[PATH_MAX];
2178 u64 magic;
2179 char *name = dent->d_name;
2180 FILE *file;
2181
2182 if (!(dent->d_type == DT_REG))
2183 continue;
2184
2185 snprintf(path, sizeof(path), "%s/%s", pwd, name);
2186
2187 file = fopen(path, "r");
2188 if (!file)
2189 continue;
2190
2191 if (fread(&magic, 1, 8, file) < 8)
2192 goto close_file_and_continue;
2193
2194 if (is_perf_magic(magic)) {
2195 options[nr_options] = strdup(name);
2196 if (!options[nr_options])
2197 goto close_file_and_continue;
2198
2199 abs_path[nr_options] = strdup(path);
2200 if (!abs_path[nr_options]) {
2201 zfree(&options[nr_options]);
2202 ui__warning("Can't search all data files due to memory shortage.\n");
2203 fclose(file);
2204 break;
2205 }
2206
2207 nr_options++;
2208 }
2209
2210 close_file_and_continue:
2211 fclose(file);
2212 if (nr_options >= 32) {
2213 ui__warning("Too many perf data files in PWD!\n"
2214 "Only the first 32 files will be listed.\n");
2215 break;
2216 }
2217 }
2218 closedir(pwd_dir);
2219
2220 if (nr_options) {
2221 choice = ui__popup_menu(nr_options, options);
2222 if (choice < nr_options && choice >= 0) {
2223 tmp = strdup(abs_path[choice]);
2224 if (tmp) {
2225 if (is_input_name_malloced)
2226 free((void *)input_name);
2227 input_name = tmp;
2228 is_input_name_malloced = true;
2229 ret = 0;
2230 } else
2231 ui__warning("Data switch failed due to memory shortage!\n");
2232 }
2233 }
2234
2235 free_popup_options(options, nr_options);
2236 free_popup_options(abs_path, nr_options);
2237 return ret;
2238 }
2239
2240 struct popup_action {
2241 struct thread *thread;
2242 struct map_symbol ms;
2243 int socket;
2244
2245 int (*fn)(struct hist_browser *browser, struct popup_action *act);
2246 };
2247
2248 static int
2249 do_annotate(struct hist_browser *browser, struct popup_action *act)
2250 {
2251 struct perf_evsel *evsel;
2252 struct annotation *notes;
2253 struct hist_entry *he;
2254 int err;
2255
2256 if (!objdump_path && perf_env__lookup_objdump(browser->env))
2257 return 0;
2258
2259 notes = symbol__annotation(act->ms.sym);
2260 if (!notes->src)
2261 return 0;
2262
2263 evsel = hists_to_evsel(browser->hists);
2264 err = map_symbol__tui_annotate(&act->ms, evsel, browser->hbt);
2265 he = hist_browser__selected_entry(browser);
2266 /*
2267 * offer option to annotate the other branch source or target
2268 * (if they exists) when returning from annotate
2269 */
2270 if ((err == 'q' || err == CTRL('c')) && he->branch_info)
2271 return 1;
2272
2273 ui_browser__update_nr_entries(&browser->b, browser->hists->nr_entries);
2274 if (err)
2275 ui_browser__handle_resize(&browser->b);
2276 return 0;
2277 }
2278
2279 static int
2280 add_annotate_opt(struct hist_browser *browser __maybe_unused,
2281 struct popup_action *act, char **optstr,
2282 struct map *map, struct symbol *sym)
2283 {
2284 if (sym == NULL || map->dso->annotate_warned)
2285 return 0;
2286
2287 if (asprintf(optstr, "Annotate %s", sym->name) < 0)
2288 return 0;
2289
2290 act->ms.map = map;
2291 act->ms.sym = sym;
2292 act->fn = do_annotate;
2293 return 1;
2294 }
2295
2296 static int
2297 do_zoom_thread(struct hist_browser *browser, struct popup_action *act)
2298 {
2299 struct thread *thread = act->thread;
2300
2301 if (browser->hists->thread_filter) {
2302 pstack__remove(browser->pstack, &browser->hists->thread_filter);
2303 perf_hpp__set_elide(HISTC_THREAD, false);
2304 thread__zput(browser->hists->thread_filter);
2305 ui_helpline__pop();
2306 } else {
2307 ui_helpline__fpush("To zoom out press ESC or ENTER + \"Zoom out of %s(%d) thread\"",
2308 thread->comm_set ? thread__comm_str(thread) : "",
2309 thread->tid);
2310 browser->hists->thread_filter = thread__get(thread);
2311 perf_hpp__set_elide(HISTC_THREAD, false);
2312 pstack__push(browser->pstack, &browser->hists->thread_filter);
2313 }
2314
2315 hists__filter_by_thread(browser->hists);
2316 hist_browser__reset(browser);
2317 return 0;
2318 }
2319
2320 static int
2321 add_thread_opt(struct hist_browser *browser, struct popup_action *act,
2322 char **optstr, struct thread *thread)
2323 {
2324 if (!sort__has_thread || thread == NULL)
2325 return 0;
2326
2327 if (asprintf(optstr, "Zoom %s %s(%d) thread",
2328 browser->hists->thread_filter ? "out of" : "into",
2329 thread->comm_set ? thread__comm_str(thread) : "",
2330 thread->tid) < 0)
2331 return 0;
2332
2333 act->thread = thread;
2334 act->fn = do_zoom_thread;
2335 return 1;
2336 }
2337
2338 static int
2339 do_zoom_dso(struct hist_browser *browser, struct popup_action *act)
2340 {
2341 struct map *map = act->ms.map;
2342
2343 if (browser->hists->dso_filter) {
2344 pstack__remove(browser->pstack, &browser->hists->dso_filter);
2345 perf_hpp__set_elide(HISTC_DSO, false);
2346 browser->hists->dso_filter = NULL;
2347 ui_helpline__pop();
2348 } else {
2349 if (map == NULL)
2350 return 0;
2351 ui_helpline__fpush("To zoom out press ESC or ENTER + \"Zoom out of %s DSO\"",
2352 __map__is_kernel(map) ? "the Kernel" : map->dso->short_name);
2353 browser->hists->dso_filter = map->dso;
2354 perf_hpp__set_elide(HISTC_DSO, true);
2355 pstack__push(browser->pstack, &browser->hists->dso_filter);
2356 }
2357
2358 hists__filter_by_dso(browser->hists);
2359 hist_browser__reset(browser);
2360 return 0;
2361 }
2362
2363 static int
2364 add_dso_opt(struct hist_browser *browser, struct popup_action *act,
2365 char **optstr, struct map *map)
2366 {
2367 if (!sort__has_dso || map == NULL)
2368 return 0;
2369
2370 if (asprintf(optstr, "Zoom %s %s DSO",
2371 browser->hists->dso_filter ? "out of" : "into",
2372 __map__is_kernel(map) ? "the Kernel" : map->dso->short_name) < 0)
2373 return 0;
2374
2375 act->ms.map = map;
2376 act->fn = do_zoom_dso;
2377 return 1;
2378 }
2379
2380 static int
2381 do_browse_map(struct hist_browser *browser __maybe_unused,
2382 struct popup_action *act)
2383 {
2384 map__browse(act->ms.map);
2385 return 0;
2386 }
2387
2388 static int
2389 add_map_opt(struct hist_browser *browser __maybe_unused,
2390 struct popup_action *act, char **optstr, struct map *map)
2391 {
2392 if (!sort__has_dso || map == NULL)
2393 return 0;
2394
2395 if (asprintf(optstr, "Browse map details") < 0)
2396 return 0;
2397
2398 act->ms.map = map;
2399 act->fn = do_browse_map;
2400 return 1;
2401 }
2402
2403 static int
2404 do_run_script(struct hist_browser *browser __maybe_unused,
2405 struct popup_action *act)
2406 {
2407 char script_opt[64];
2408 memset(script_opt, 0, sizeof(script_opt));
2409
2410 if (act->thread) {
2411 scnprintf(script_opt, sizeof(script_opt), " -c %s ",
2412 thread__comm_str(act->thread));
2413 } else if (act->ms.sym) {
2414 scnprintf(script_opt, sizeof(script_opt), " -S %s ",
2415 act->ms.sym->name);
2416 }
2417
2418 script_browse(script_opt);
2419 return 0;
2420 }
2421
2422 static int
2423 add_script_opt(struct hist_browser *browser __maybe_unused,
2424 struct popup_action *act, char **optstr,
2425 struct thread *thread, struct symbol *sym)
2426 {
2427 if (thread) {
2428 if (asprintf(optstr, "Run scripts for samples of thread [%s]",
2429 thread__comm_str(thread)) < 0)
2430 return 0;
2431 } else if (sym) {
2432 if (asprintf(optstr, "Run scripts for samples of symbol [%s]",
2433 sym->name) < 0)
2434 return 0;
2435 } else {
2436 if (asprintf(optstr, "Run scripts for all samples") < 0)
2437 return 0;
2438 }
2439
2440 act->thread = thread;
2441 act->ms.sym = sym;
2442 act->fn = do_run_script;
2443 return 1;
2444 }
2445
2446 static int
2447 do_switch_data(struct hist_browser *browser __maybe_unused,
2448 struct popup_action *act __maybe_unused)
2449 {
2450 if (switch_data_file()) {
2451 ui__warning("Won't switch the data files due to\n"
2452 "no valid data file get selected!\n");
2453 return 0;
2454 }
2455
2456 return K_SWITCH_INPUT_DATA;
2457 }
2458
2459 static int
2460 add_switch_opt(struct hist_browser *browser,
2461 struct popup_action *act, char **optstr)
2462 {
2463 if (!is_report_browser(browser->hbt))
2464 return 0;
2465
2466 if (asprintf(optstr, "Switch to another data file in PWD") < 0)
2467 return 0;
2468
2469 act->fn = do_switch_data;
2470 return 1;
2471 }
2472
2473 static int
2474 do_exit_browser(struct hist_browser *browser __maybe_unused,
2475 struct popup_action *act __maybe_unused)
2476 {
2477 return 0;
2478 }
2479
2480 static int
2481 add_exit_opt(struct hist_browser *browser __maybe_unused,
2482 struct popup_action *act, char **optstr)
2483 {
2484 if (asprintf(optstr, "Exit") < 0)
2485 return 0;
2486
2487 act->fn = do_exit_browser;
2488 return 1;
2489 }
2490
2491 static int
2492 do_zoom_socket(struct hist_browser *browser, struct popup_action *act)
2493 {
2494 if (browser->hists->socket_filter > -1) {
2495 pstack__remove(browser->pstack, &browser->hists->socket_filter);
2496 browser->hists->socket_filter = -1;
2497 perf_hpp__set_elide(HISTC_SOCKET, false);
2498 } else {
2499 browser->hists->socket_filter = act->socket;
2500 perf_hpp__set_elide(HISTC_SOCKET, true);
2501 pstack__push(browser->pstack, &browser->hists->socket_filter);
2502 }
2503
2504 hists__filter_by_socket(browser->hists);
2505 hist_browser__reset(browser);
2506 return 0;
2507 }
2508
2509 static int
2510 add_socket_opt(struct hist_browser *browser, struct popup_action *act,
2511 char **optstr, int socket_id)
2512 {
2513 if (!sort__has_socket || socket_id < 0)
2514 return 0;
2515
2516 if (asprintf(optstr, "Zoom %s Processor Socket %d",
2517 (browser->hists->socket_filter > -1) ? "out of" : "into",
2518 socket_id) < 0)
2519 return 0;
2520
2521 act->socket = socket_id;
2522 act->fn = do_zoom_socket;
2523 return 1;
2524 }
2525
2526 static void hist_browser__update_nr_entries(struct hist_browser *hb)
2527 {
2528 u64 nr_entries = 0;
2529 struct rb_node *nd = rb_first(&hb->hists->entries);
2530
2531 if (hb->min_pcnt == 0 && !symbol_conf.report_hierarchy) {
2532 hb->nr_non_filtered_entries = hb->hists->nr_non_filtered_entries;
2533 return;
2534 }
2535
2536 while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {
2537 nr_entries++;
2538 nd = rb_hierarchy_next(nd);
2539 }
2540
2541 hb->nr_non_filtered_entries = nr_entries;
2542 hb->nr_hierarchy_entries = nr_entries;
2543 }
2544
2545 static void hist_browser__update_percent_limit(struct hist_browser *hb,
2546 double percent)
2547 {
2548 struct hist_entry *he;
2549 struct rb_node *nd = rb_first(&hb->hists->entries);
2550 u64 total = hists__total_period(hb->hists);
2551 u64 min_callchain_hits = total * (percent / 100);
2552
2553 hb->min_pcnt = callchain_param.min_percent = percent;
2554
2555 while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {
2556 he = rb_entry(nd, struct hist_entry, rb_node);
2557
2558 if (he->has_no_entry) {
2559 he->has_no_entry = false;
2560 he->nr_rows = 0;
2561 }
2562
2563 if (!he->leaf || !symbol_conf.use_callchain)
2564 goto next;
2565
2566 if (callchain_param.mode == CHAIN_GRAPH_REL) {
2567 total = he->stat.period;
2568
2569 if (symbol_conf.cumulate_callchain)
2570 total = he->stat_acc->period;
2571
2572 min_callchain_hits = total * (percent / 100);
2573 }
2574
2575 callchain_param.sort(&he->sorted_chain, he->callchain,
2576 min_callchain_hits, &callchain_param);
2577
2578 next:
2579 nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD);
2580
2581 /* force to re-evaluate folding state of callchains */
2582 he->init_have_children = false;
2583 hist_entry__set_folding(he, hb, false);
2584 }
2585 }
2586
2587 static int perf_evsel__hists_browse(struct perf_evsel *evsel, int nr_events,
2588 const char *helpline,
2589 bool left_exits,
2590 struct hist_browser_timer *hbt,
2591 float min_pcnt,
2592 struct perf_env *env)
2593 {
2594 struct hists *hists = evsel__hists(evsel);
2595 struct hist_browser *browser = hist_browser__new(hists, hbt, env);
2596 struct branch_info *bi;
2597 #define MAX_OPTIONS 16
2598 char *options[MAX_OPTIONS];
2599 struct popup_action actions[MAX_OPTIONS];
2600 int nr_options = 0;
2601 int key = -1;
2602 char buf[64];
2603 int delay_secs = hbt ? hbt->refresh : 0;
2604 struct perf_hpp_fmt *fmt;
2605
2606 #define HIST_BROWSER_HELP_COMMON \
2607 "h/?/F1 Show this window\n" \
2608 "UP/DOWN/PGUP\n" \
2609 "PGDN/SPACE Navigate\n" \
2610 "q/ESC/CTRL+C Exit browser\n\n" \
2611 "For multiple event sessions:\n\n" \
2612 "TAB/UNTAB Switch events\n\n" \
2613 "For symbolic views (--sort has sym):\n\n" \
2614 "ENTER Zoom into DSO/Threads & Annotate current symbol\n" \
2615 "ESC Zoom out\n" \
2616 "a Annotate current symbol\n" \
2617 "C Collapse all callchains\n" \
2618 "d Zoom into current DSO\n" \
2619 "E Expand all callchains\n" \
2620 "F Toggle percentage of filtered entries\n" \
2621 "H Display column headers\n" \
2622 "L Change percent limit\n" \
2623 "m Display context menu\n" \
2624 "S Zoom into current Processor Socket\n" \
2625
2626 /* help messages are sorted by lexical order of the hotkey */
2627 const char report_help[] = HIST_BROWSER_HELP_COMMON
2628 "i Show header information\n"
2629 "P Print histograms to perf.hist.N\n"
2630 "r Run available scripts\n"
2631 "s Switch to another data file in PWD\n"
2632 "t Zoom into current Thread\n"
2633 "V Verbose (DSO names in callchains, etc)\n"
2634 "/ Filter symbol by name";
2635 const char top_help[] = HIST_BROWSER_HELP_COMMON
2636 "P Print histograms to perf.hist.N\n"
2637 "t Zoom into current Thread\n"
2638 "V Verbose (DSO names in callchains, etc)\n"
2639 "z Toggle zeroing of samples\n"
2640 "f Enable/Disable events\n"
2641 "/ Filter symbol by name";
2642
2643 if (browser == NULL)
2644 return -1;
2645
2646 /* reset abort key so that it can get Ctrl-C as a key */
2647 SLang_reset_tty();
2648 SLang_init_tty(0, 0, 0);
2649
2650 if (min_pcnt)
2651 browser->min_pcnt = min_pcnt;
2652 hist_browser__update_nr_entries(browser);
2653
2654 browser->pstack = pstack__new(3);
2655 if (browser->pstack == NULL)
2656 goto out;
2657
2658 ui_helpline__push(helpline);
2659
2660 memset(options, 0, sizeof(options));
2661 memset(actions, 0, sizeof(actions));
2662
2663 hists__for_each_format(browser->hists, fmt) {
2664 perf_hpp__reset_width(fmt, hists);
2665 /*
2666 * This is done just once, and activates the horizontal scrolling
2667 * code in the ui_browser code, it would be better to have a the
2668 * counter in the perf_hpp code, but I couldn't find doing it here
2669 * works, FIXME by setting this in hist_browser__new, for now, be
2670 * clever 8-)
2671 */
2672 ++browser->b.columns;
2673 }
2674
2675 if (symbol_conf.col_width_list_str)
2676 perf_hpp__set_user_width(symbol_conf.col_width_list_str);
2677
2678 while (1) {
2679 struct thread *thread = NULL;
2680 struct map *map = NULL;
2681 int choice = 0;
2682 int socked_id = -1;
2683
2684 nr_options = 0;
2685
2686 key = hist_browser__run(browser, helpline);
2687
2688 if (browser->he_selection != NULL) {
2689 thread = hist_browser__selected_thread(browser);
2690 map = browser->selection->map;
2691 socked_id = browser->he_selection->socket;
2692 }
2693 switch (key) {
2694 case K_TAB:
2695 case K_UNTAB:
2696 if (nr_events == 1)
2697 continue;
2698 /*
2699 * Exit the browser, let hists__browser_tree
2700 * go to the next or previous
2701 */
2702 goto out_free_stack;
2703 case 'a':
2704 if (!sort__has_sym) {
2705 ui_browser__warning(&browser->b, delay_secs * 2,
2706 "Annotation is only available for symbolic views, "
2707 "include \"sym*\" in --sort to use it.");
2708 continue;
2709 }
2710
2711 if (browser->selection == NULL ||
2712 browser->selection->sym == NULL ||
2713 browser->selection->map->dso->annotate_warned)
2714 continue;
2715
2716 actions->ms.map = browser->selection->map;
2717 actions->ms.sym = browser->selection->sym;
2718 do_annotate(browser, actions);
2719 continue;
2720 case 'P':
2721 hist_browser__dump(browser);
2722 continue;
2723 case 'd':
2724 actions->ms.map = map;
2725 do_zoom_dso(browser, actions);
2726 continue;
2727 case 'V':
2728 browser->show_dso = !browser->show_dso;
2729 continue;
2730 case 't':
2731 actions->thread = thread;
2732 do_zoom_thread(browser, actions);
2733 continue;
2734 case 'S':
2735 actions->socket = socked_id;
2736 do_zoom_socket(browser, actions);
2737 continue;
2738 case '/':
2739 if (ui_browser__input_window("Symbol to show",
2740 "Please enter the name of symbol you want to see.\n"
2741 "To remove the filter later, press / + ENTER.",
2742 buf, "ENTER: OK, ESC: Cancel",
2743 delay_secs * 2) == K_ENTER) {
2744 hists->symbol_filter_str = *buf ? buf : NULL;
2745 hists__filter_by_symbol(hists);
2746 hist_browser__reset(browser);
2747 }
2748 continue;
2749 case 'r':
2750 if (is_report_browser(hbt)) {
2751 actions->thread = NULL;
2752 actions->ms.sym = NULL;
2753 do_run_script(browser, actions);
2754 }
2755 continue;
2756 case 's':
2757 if (is_report_browser(hbt)) {
2758 key = do_switch_data(browser, actions);
2759 if (key == K_SWITCH_INPUT_DATA)
2760 goto out_free_stack;
2761 }
2762 continue;
2763 case 'i':
2764 /* env->arch is NULL for live-mode (i.e. perf top) */
2765 if (env->arch)
2766 tui__header_window(env);
2767 continue;
2768 case 'F':
2769 symbol_conf.filter_relative ^= 1;
2770 continue;
2771 case 'z':
2772 if (!is_report_browser(hbt)) {
2773 struct perf_top *top = hbt->arg;
2774
2775 top->zero = !top->zero;
2776 }
2777 continue;
2778 case 'L':
2779 if (ui_browser__input_window("Percent Limit",
2780 "Please enter the value you want to hide entries under that percent.",
2781 buf, "ENTER: OK, ESC: Cancel",
2782 delay_secs * 2) == K_ENTER) {
2783 char *end;
2784 double new_percent = strtod(buf, &end);
2785
2786 if (new_percent < 0 || new_percent > 100) {
2787 ui_browser__warning(&browser->b, delay_secs * 2,
2788 "Invalid percent: %.2f", new_percent);
2789 continue;
2790 }
2791
2792 hist_browser__update_percent_limit(browser, new_percent);
2793 hist_browser__reset(browser);
2794 }
2795 continue;
2796 case K_F1:
2797 case 'h':
2798 case '?':
2799 ui_browser__help_window(&browser->b,
2800 is_report_browser(hbt) ? report_help : top_help);
2801 continue;
2802 case K_ENTER:
2803 case K_RIGHT:
2804 case 'm':
2805 /* menu */
2806 break;
2807 case K_ESC:
2808 case K_LEFT: {
2809 const void *top;
2810
2811 if (pstack__empty(browser->pstack)) {
2812 /*
2813 * Go back to the perf_evsel_menu__run or other user
2814 */
2815 if (left_exits)
2816 goto out_free_stack;
2817
2818 if (key == K_ESC &&
2819 ui_browser__dialog_yesno(&browser->b,
2820 "Do you really want to exit?"))
2821 goto out_free_stack;
2822
2823 continue;
2824 }
2825 top = pstack__peek(browser->pstack);
2826 if (top == &browser->hists->dso_filter) {
2827 /*
2828 * No need to set actions->dso here since
2829 * it's just to remove the current filter.
2830 * Ditto for thread below.
2831 */
2832 do_zoom_dso(browser, actions);
2833 } else if (top == &browser->hists->thread_filter) {
2834 do_zoom_thread(browser, actions);
2835 } else if (top == &browser->hists->socket_filter) {
2836 do_zoom_socket(browser, actions);
2837 }
2838 continue;
2839 }
2840 case 'q':
2841 case CTRL('c'):
2842 goto out_free_stack;
2843 case 'f':
2844 if (!is_report_browser(hbt)) {
2845 struct perf_top *top = hbt->arg;
2846
2847 perf_evlist__toggle_enable(top->evlist);
2848 /*
2849 * No need to refresh, resort/decay histogram
2850 * entries if we are not collecting samples:
2851 */
2852 if (top->evlist->enabled) {
2853 helpline = "Press 'f' to disable the events or 'h' to see other hotkeys";
2854 hbt->refresh = delay_secs;
2855 } else {
2856 helpline = "Press 'f' again to re-enable the events";
2857 hbt->refresh = 0;
2858 }
2859 continue;
2860 }
2861 /* Fall thru */
2862 default:
2863 helpline = "Press '?' for help on key bindings";
2864 continue;
2865 }
2866
2867 if (!sort__has_sym || browser->selection == NULL)
2868 goto skip_annotation;
2869
2870 if (sort__mode == SORT_MODE__BRANCH) {
2871 bi = browser->he_selection->branch_info;
2872
2873 if (bi == NULL)
2874 goto skip_annotation;
2875
2876 nr_options += add_annotate_opt(browser,
2877 &actions[nr_options],
2878 &options[nr_options],
2879 bi->from.map,
2880 bi->from.sym);
2881 if (bi->to.sym != bi->from.sym)
2882 nr_options += add_annotate_opt(browser,
2883 &actions[nr_options],
2884 &options[nr_options],
2885 bi->to.map,
2886 bi->to.sym);
2887 } else {
2888 nr_options += add_annotate_opt(browser,
2889 &actions[nr_options],
2890 &options[nr_options],
2891 browser->selection->map,
2892 browser->selection->sym);
2893 }
2894 skip_annotation:
2895 nr_options += add_thread_opt(browser, &actions[nr_options],
2896 &options[nr_options], thread);
2897 nr_options += add_dso_opt(browser, &actions[nr_options],
2898 &options[nr_options], map);
2899 nr_options += add_map_opt(browser, &actions[nr_options],
2900 &options[nr_options],
2901 browser->selection ?
2902 browser->selection->map : NULL);
2903 nr_options += add_socket_opt(browser, &actions[nr_options],
2904 &options[nr_options],
2905 socked_id);
2906 /* perf script support */
2907 if (!is_report_browser(hbt))
2908 goto skip_scripting;
2909
2910 if (browser->he_selection) {
2911 if (sort__has_thread && thread) {
2912 nr_options += add_script_opt(browser,
2913 &actions[nr_options],
2914 &options[nr_options],
2915 thread, NULL);
2916 }
2917 /*
2918 * Note that browser->selection != NULL
2919 * when browser->he_selection is not NULL,
2920 * so we don't need to check browser->selection
2921 * before fetching browser->selection->sym like what
2922 * we do before fetching browser->selection->map.
2923 *
2924 * See hist_browser__show_entry.
2925 */
2926 if (sort__has_sym && browser->selection->sym) {
2927 nr_options += add_script_opt(browser,
2928 &actions[nr_options],
2929 &options[nr_options],
2930 NULL, browser->selection->sym);
2931 }
2932 }
2933 nr_options += add_script_opt(browser, &actions[nr_options],
2934 &options[nr_options], NULL, NULL);
2935 nr_options += add_switch_opt(browser, &actions[nr_options],
2936 &options[nr_options]);
2937 skip_scripting:
2938 nr_options += add_exit_opt(browser, &actions[nr_options],
2939 &options[nr_options]);
2940
2941 do {
2942 struct popup_action *act;
2943
2944 choice = ui__popup_menu(nr_options, options);
2945 if (choice == -1 || choice >= nr_options)
2946 break;
2947
2948 act = &actions[choice];
2949 key = act->fn(browser, act);
2950 } while (key == 1);
2951
2952 if (key == K_SWITCH_INPUT_DATA)
2953 break;
2954 }
2955 out_free_stack:
2956 pstack__delete(browser->pstack);
2957 out:
2958 hist_browser__delete(browser);
2959 free_popup_options(options, MAX_OPTIONS);
2960 return key;
2961 }
2962
2963 struct perf_evsel_menu {
2964 struct ui_browser b;
2965 struct perf_evsel *selection;
2966 bool lost_events, lost_events_warned;
2967 float min_pcnt;
2968 struct perf_env *env;
2969 };
2970
2971 static void perf_evsel_menu__write(struct ui_browser *browser,
2972 void *entry, int row)
2973 {
2974 struct perf_evsel_menu *menu = container_of(browser,
2975 struct perf_evsel_menu, b);
2976 struct perf_evsel *evsel = list_entry(entry, struct perf_evsel, node);
2977 struct hists *hists = evsel__hists(evsel);
2978 bool current_entry = ui_browser__is_current_entry(browser, row);
2979 unsigned long nr_events = hists->stats.nr_events[PERF_RECORD_SAMPLE];
2980 const char *ev_name = perf_evsel__name(evsel);
2981 char bf[256], unit;
2982 const char *warn = " ";
2983 size_t printed;
2984
2985 ui_browser__set_color(browser, current_entry ? HE_COLORSET_SELECTED :
2986 HE_COLORSET_NORMAL);
2987
2988 if (perf_evsel__is_group_event(evsel)) {
2989 struct perf_evsel *pos;
2990
2991 ev_name = perf_evsel__group_name(evsel);
2992
2993 for_each_group_member(pos, evsel) {
2994 struct hists *pos_hists = evsel__hists(pos);
2995 nr_events += pos_hists->stats.nr_events[PERF_RECORD_SAMPLE];
2996 }
2997 }
2998
2999 nr_events = convert_unit(nr_events, &unit);
3000 printed = scnprintf(bf, sizeof(bf), "%lu%c%s%s", nr_events,
3001 unit, unit == ' ' ? "" : " ", ev_name);
3002 ui_browser__printf(browser, "%s", bf);
3003
3004 nr_events = hists->stats.nr_events[PERF_RECORD_LOST];
3005 if (nr_events != 0) {
3006 menu->lost_events = true;
3007 if (!current_entry)
3008 ui_browser__set_color(browser, HE_COLORSET_TOP);
3009 nr_events = convert_unit(nr_events, &unit);
3010 printed += scnprintf(bf, sizeof(bf), ": %ld%c%schunks LOST!",
3011 nr_events, unit, unit == ' ' ? "" : " ");
3012 warn = bf;
3013 }
3014
3015 ui_browser__write_nstring(browser, warn, browser->width - printed);
3016
3017 if (current_entry)
3018 menu->selection = evsel;
3019 }
3020
3021 static int perf_evsel_menu__run(struct perf_evsel_menu *menu,
3022 int nr_events, const char *help,
3023 struct hist_browser_timer *hbt)
3024 {
3025 struct perf_evlist *evlist = menu->b.priv;
3026 struct perf_evsel *pos;
3027 const char *title = "Available samples";
3028 int delay_secs = hbt ? hbt->refresh : 0;
3029 int key;
3030
3031 if (ui_browser__show(&menu->b, title,
3032 "ESC: exit, ENTER|->: Browse histograms") < 0)
3033 return -1;
3034
3035 while (1) {
3036 key = ui_browser__run(&menu->b, delay_secs);
3037
3038 switch (key) {
3039 case K_TIMER:
3040 hbt->timer(hbt->arg);
3041
3042 if (!menu->lost_events_warned && menu->lost_events) {
3043 ui_browser__warn_lost_events(&menu->b);
3044 menu->lost_events_warned = true;
3045 }
3046 continue;
3047 case K_RIGHT:
3048 case K_ENTER:
3049 if (!menu->selection)
3050 continue;
3051 pos = menu->selection;
3052 browse_hists:
3053 perf_evlist__set_selected(evlist, pos);
3054 /*
3055 * Give the calling tool a chance to populate the non
3056 * default evsel resorted hists tree.
3057 */
3058 if (hbt)
3059 hbt->timer(hbt->arg);
3060 key = perf_evsel__hists_browse(pos, nr_events, help,
3061 true, hbt,
3062 menu->min_pcnt,
3063 menu->env);
3064 ui_browser__show_title(&menu->b, title);
3065 switch (key) {
3066 case K_TAB:
3067 if (pos->node.next == &evlist->entries)
3068 pos = perf_evlist__first(evlist);
3069 else
3070 pos = perf_evsel__next(pos);
3071 goto browse_hists;
3072 case K_UNTAB:
3073 if (pos->node.prev == &evlist->entries)
3074 pos = perf_evlist__last(evlist);
3075 else
3076 pos = perf_evsel__prev(pos);
3077 goto browse_hists;
3078 case K_SWITCH_INPUT_DATA:
3079 case 'q':
3080 case CTRL('c'):
3081 goto out;
3082 case K_ESC:
3083 default:
3084 continue;
3085 }
3086 case K_LEFT:
3087 continue;
3088 case K_ESC:
3089 if (!ui_browser__dialog_yesno(&menu->b,
3090 "Do you really want to exit?"))
3091 continue;
3092 /* Fall thru */
3093 case 'q':
3094 case CTRL('c'):
3095 goto out;
3096 default:
3097 continue;
3098 }
3099 }
3100
3101 out:
3102 ui_browser__hide(&menu->b);
3103 return key;
3104 }
3105
3106 static bool filter_group_entries(struct ui_browser *browser __maybe_unused,
3107 void *entry)
3108 {
3109 struct perf_evsel *evsel = list_entry(entry, struct perf_evsel, node);
3110
3111 if (symbol_conf.event_group && !perf_evsel__is_group_leader(evsel))
3112 return true;
3113
3114 return false;
3115 }
3116
3117 static int __perf_evlist__tui_browse_hists(struct perf_evlist *evlist,
3118 int nr_entries, const char *help,
3119 struct hist_browser_timer *hbt,
3120 float min_pcnt,
3121 struct perf_env *env)
3122 {
3123 struct perf_evsel *pos;
3124 struct perf_evsel_menu menu = {
3125 .b = {
3126 .entries = &evlist->entries,
3127 .refresh = ui_browser__list_head_refresh,
3128 .seek = ui_browser__list_head_seek,
3129 .write = perf_evsel_menu__write,
3130 .filter = filter_group_entries,
3131 .nr_entries = nr_entries,
3132 .priv = evlist,
3133 },
3134 .min_pcnt = min_pcnt,
3135 .env = env,
3136 };
3137
3138 ui_helpline__push("Press ESC to exit");
3139
3140 evlist__for_each(evlist, pos) {
3141 const char *ev_name = perf_evsel__name(pos);
3142 size_t line_len = strlen(ev_name) + 7;
3143
3144 if (menu.b.width < line_len)
3145 menu.b.width = line_len;
3146 }
3147
3148 return perf_evsel_menu__run(&menu, nr_entries, help, hbt);
3149 }
3150
3151 int perf_evlist__tui_browse_hists(struct perf_evlist *evlist, const char *help,
3152 struct hist_browser_timer *hbt,
3153 float min_pcnt,
3154 struct perf_env *env)
3155 {
3156 int nr_entries = evlist->nr_entries;
3157
3158 single_entry:
3159 if (nr_entries == 1) {
3160 struct perf_evsel *first = perf_evlist__first(evlist);
3161
3162 return perf_evsel__hists_browse(first, nr_entries, help,
3163 false, hbt, min_pcnt,
3164 env);
3165 }
3166
3167 if (symbol_conf.event_group) {
3168 struct perf_evsel *pos;
3169
3170 nr_entries = 0;
3171 evlist__for_each(evlist, pos) {
3172 if (perf_evsel__is_group_leader(pos))
3173 nr_entries++;
3174 }
3175
3176 if (nr_entries == 1)
3177 goto single_entry;
3178 }
3179
3180 return __perf_evlist__tui_browse_hists(evlist, nr_entries, help,
3181 hbt, min_pcnt, env);
3182 }
Linux kernel - Deliverables
This page took 0.092641 seconds and 6 git commands to generate.