projects / deliverable / linux.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
perf hists: Fix indent for multiple hierarchy sort key
[deliverable/linux.git] / tools / perf / ui / browsers / hists.c
CommitLineData
d1b4f249 1#include <stdio.h>
d1b4f249
ACM		 2#include <stdlib.h>
3#include <string.h>
d1b4f249
ACM		 4#include <linux/rbtree.h>
5
aca7a94d
NK		 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"
42337a22 12#include "../../util/top.h"
68d80758 13#include "../../arch/common.h"
d1b4f249
ACM		 14
15#include "../browser.h"
16#include "../helpline.h"
17#include "../util.h"
4610e413 18#include "../ui.h"
d1b4f249 19#include "map.h"
d755330c 20#include "annotate.h"
d1b4f249 21
d1b4f249
ACM		 22struct hist_browser {
23 struct ui_browser b;
24 struct hists *hists;
25 struct hist_entry *he_selection;
26 struct map_symbol *selection;
c2a51ab8 27 struct hist_browser_timer *hbt;
01f00a1c 28 struct pstack *pstack;
ce80d3be 29 struct perf_env *env;
aff3f3f6 30 int print_seq;
a7cb8863 31 bool show_dso;
025bf7ea 32 bool show_headers;
064f1981 33 float min_pcnt;
112f761f 34 u64 nr_non_filtered_entries;
f5b763fe 35 u64 nr_hierarchy_entries;
c3b78952 36 u64 nr_callchain_rows;
d1b4f249
ACM		 37};
38
f5951d56
NK		 39extern void hist_browser__init_hpp(void);
40
1e378ebd
TS		 41static int hists__browser_title(struct hists *hists,
42 struct hist_browser_timer *hbt,
43 char *bf, size_t size);
112f761f 44static void hist_browser__update_nr_entries(struct hist_browser *hb);
81cce8de 45
c3b78952 46static struct rb_node *hists__filter_entries(struct rb_node *nd,
c3b78952
NK		 47 float min_pcnt);
48
268397cb
NK		 49static bool hist_browser__has_filter(struct hist_browser *hb)
50{
9c0fa8dd 51 return hists__has_filter(hb->hists) || hb->min_pcnt || symbol_conf.has_filter;
268397cb
NK		 52}
53
4fabf3d1
HK		 54static 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;
f5b763fe 62 nd = rb_hierarchy_next(nd)) {
4fabf3d1
HK		 63 struct hist_entry *he =
64 rb_entry(nd, struct hist_entry, rb_node);
65
f5b763fe 66 if (he->leaf && he->unfolded)
4fabf3d1
HK		 67 unfolded_rows += he->nr_rows;
68 }
69 return unfolded_rows;
70}
71
c3b78952
NK		 72static u32 hist_browser__nr_entries(struct hist_browser *hb)
73{
74 u32 nr_entries;
75
f5b763fe
NK		 76 if (symbol_conf.report_hierarchy)
77 nr_entries = hb->nr_hierarchy_entries;
78 else if (hist_browser__has_filter(hb))
c3b78952
NK		 79 nr_entries = hb->nr_non_filtered_entries;
80 else
81 nr_entries = hb->hists->nr_entries;
82
4fabf3d1 83 hb->nr_callchain_rows = hist_browser__get_folding(hb);
c3b78952
NK		 84 return nr_entries + hb->nr_callchain_rows;
85}
86
025bf7ea
ACM		 87static 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
357cfff1 102static void hist_browser__refresh_dimensions(struct ui_browser *browser)
d1b4f249 103{
357cfff1
ACM		 104 struct hist_browser *hb = container_of(browser, struct hist_browser, b);
105
d1b4f249 106 /* 3 == +/- toggle symbol before actual hist_entry rendering */
357cfff1
ACM		 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);
025bf7ea 115 hist_browser__update_rows(hb);
d1b4f249
ACM		 116}
117
ca3ff33b
ACM		 118static void hist_browser__gotorc(struct hist_browser *browser, int row, int column)
119{
025bf7ea
ACM		 120 u16 header_offset = browser->show_headers ? 1 : 0;
121
122 ui_browser__gotorc(&browser->b, row + header_offset, column);
ca3ff33b
ACM		 123}
124
05e8b080 125static void hist_browser__reset(struct hist_browser *browser)
d1b4f249 126{
c3b78952
NK		 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
268397cb 133 hist_browser__update_nr_entries(browser);
c3b78952 134 browser->b.nr_entries = hist_browser__nr_entries(browser);
357cfff1 135 hist_browser__refresh_dimensions(&browser->b);
05e8b080 136 ui_browser__reset_index(&browser->b);
d1b4f249
ACM		 137}
138
139static char tree__folded_sign(bool unfolded)
140{
141 return unfolded ? '-' : '+';
142}
143
05e8b080 144static char hist_entry__folded(const struct hist_entry *he)
d1b4f249 145{
3698dab1 146 return he->has_children ? tree__folded_sign(he->unfolded) : ' ';
d1b4f249
ACM		 147}
148
05e8b080 149static char callchain_list__folded(const struct callchain_list *cl)
d1b4f249 150{
3698dab1 151 return cl->has_children ? tree__folded_sign(cl->unfolded) : ' ';
d1b4f249
ACM		 152}
153
3698dab1 154static void callchain_list__set_folding(struct callchain_list *cl, bool unfold)
3c916cc2 155{
3698dab1 156 cl->unfolded = unfold ? cl->has_children : false;
3c916cc2
ACM		 157}
158
05e8b080 159static int callchain_node__count_rows_rb_tree(struct callchain_node *node)
d1b4f249
ACM		 160{
161 int n = 0;
162 struct rb_node *nd;
163
05e8b080 164 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
d1b4f249
ACM		 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
4b3a3212
NK		 184static 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
8c430a34
NK		 213static int callchain_node__count_folded_rows(struct callchain_node *node __maybe_unused)
214{
215 return 1;
216}
217
d1b4f249
ACM		 218static int callchain_node__count_rows(struct callchain_node *node)
219{
220 struct callchain_list *chain;
221 bool unfolded = false;
222 int n = 0;
223
4b3a3212
NK		 224 if (callchain_param.mode == CHAIN_FLAT)
225 return callchain_node__count_flat_rows(node);
8c430a34
NK		 226 else if (callchain_param.mode == CHAIN_FOLDED)
227 return callchain_node__count_folded_rows(node);
4b3a3212 228
d1b4f249
ACM		 229 list_for_each_entry(chain, &node->val, list) {
230 ++n;
3698dab1 231 unfolded = chain->unfolded;
d1b4f249
ACM		 232 }
233
234 if (unfolded)
235 n += callchain_node__count_rows_rb_tree(node);
236
237 return n;
238}
239
240static 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
f5b763fe
NK		 253static 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
79dded87
NK		 263 if (he->has_no_entry)
264 return 1;
265
f5b763fe
NK		 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
3698dab1 285static bool hist_entry__toggle_fold(struct hist_entry *he)
d1b4f249 286{
3698dab1 287 if (!he)
8493fe1d
JO		 288 return false;
289
3698dab1 290 if (!he->has_children)
d1b4f249
ACM		 291 return false;
292
3698dab1
NK		 293 he->unfolded = !he->unfolded;
294 return true;
295}
296
297static 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;
d1b4f249
ACM		 306 return true;
307}
308
05e8b080 309static void callchain_node__init_have_children_rb_tree(struct callchain_node *node)
d1b4f249 310{
05e8b080 311 struct rb_node *nd = rb_first(&node->rb_root);
d1b4f249 312
05e8b080 313 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
d1b4f249
ACM		 314 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
315 struct callchain_list *chain;
293db47f 316 bool first = true;
d1b4f249
ACM		 317
318 list_for_each_entry(chain, &child->val, list) {
319 if (first) {
320 first = false;
3698dab1 321 chain->has_children = chain->list.next != &child->val ||
293db47f 322 !RB_EMPTY_ROOT(&child->rb_root);
d1b4f249 323 } else
3698dab1 324 chain->has_children = chain->list.next == &child->val &&
293db47f 325 !RB_EMPTY_ROOT(&child->rb_root);
d1b4f249
ACM		 326 }
327
328 callchain_node__init_have_children_rb_tree(child);
329 }
330}
331
a7444af6
NK		 332static void callchain_node__init_have_children(struct callchain_node *node,
333 bool has_sibling)
d1b4f249
ACM		 334{
335 struct callchain_list *chain;
336
a7444af6 337 chain = list_entry(node->val.next, struct callchain_list, list);
3698dab1 338 chain->has_children = has_sibling;
a7444af6 339
4b3a3212 340 if (node->val.next != node->val.prev) {
82162b5a 341 chain = list_entry(node->val.prev, struct callchain_list, list);
3698dab1 342 chain->has_children = !RB_EMPTY_ROOT(&node->rb_root);
82162b5a 343 }
d1b4f249 344
05e8b080 345 callchain_node__init_have_children_rb_tree(node);
d1b4f249
ACM		 346}
347
05e8b080 348static void callchain__init_have_children(struct rb_root *root)
d1b4f249 349{
a7444af6
NK		 350 struct rb_node *nd = rb_first(root);
351 bool has_sibling = nd && rb_next(nd);
d1b4f249 352
05e8b080 353 for (nd = rb_first(root); nd; nd = rb_next(nd)) {
d1b4f249 354 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
a7444af6 355 callchain_node__init_have_children(node, has_sibling);
8c430a34
NK		 356 if (callchain_param.mode == CHAIN_FLAT ||
357 callchain_param.mode == CHAIN_FOLDED)
4b3a3212 358 callchain_node__make_parent_list(node);
d1b4f249
ACM		 359 }
360}
361
05e8b080 362static void hist_entry__init_have_children(struct hist_entry *he)
d1b4f249 363{
f5b763fe
NK		 364 if (he->init_have_children)
365 return;
366
367 if (he->leaf) {
3698dab1 368 he->has_children = !RB_EMPTY_ROOT(&he->sorted_chain);
05e8b080 369 callchain__init_have_children(&he->sorted_chain);
f5b763fe
NK		 370 } else {
371 he->has_children = !RB_EMPTY_ROOT(&he->hroot_out);
d1b4f249 372 }
f5b763fe
NK		 373
374 he->init_have_children = true;
d1b4f249
ACM		 375}
376
05e8b080 377static bool hist_browser__toggle_fold(struct hist_browser *browser)
d1b4f249 378{
3698dab1
NK		 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
4938cf0c
WN		 384 if (!he || !ms)
385 return false;
386
3698dab1
NK		 387 if (ms == &he->ms)
388 has_children = hist_entry__toggle_fold(he);
389 else
390 has_children = callchain_list__toggle_fold(cl);
d1b4f249 391
3698dab1 392 if (has_children) {
f5b763fe
NK		 393 int child_rows = 0;
394
d1b4f249 395 hist_entry__init_have_children(he);
c3b78952 396 browser->b.nr_entries -= he->nr_rows;
d1b4f249 397
f5b763fe
NK		 398 if (he->leaf)
399 browser->nr_callchain_rows -= he->nr_rows;
d1b4f249 400 else
f5b763fe
NK		 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;
79dded87
NK		 415
416 if (!he->leaf && he->nr_rows == 0) {
417 he->has_no_entry = true;
418 he->nr_rows = 1;
419 }
f5b763fe
NK		 420 } else {
421 if (symbol_conf.report_hierarchy)
422 browser->b.nr_entries -= child_rows - he->nr_rows;
423
79dded87
NK		 424 if (he->has_no_entry)
425 he->has_no_entry = false;
426
d1b4f249 427 he->nr_rows = 0;
f5b763fe 428 }
c3b78952
NK		 429
430 browser->b.nr_entries += he->nr_rows;
f5b763fe
NK		 431
432 if (he->leaf)
433 browser->nr_callchain_rows += he->nr_rows;
434 else
435 browser->nr_hierarchy_entries += he->nr_rows;
d1b4f249
ACM		 436
437 return true;
438 }
439
440 /* If it doesn't have children, no toggling performed */
441 return false;
442}
443
05e8b080 444static int callchain_node__set_folding_rb_tree(struct callchain_node *node, bool unfold)
3c916cc2
ACM		 445{
446 int n = 0;
447 struct rb_node *nd;
448
05e8b080 449 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
3c916cc2
ACM		 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;
3698dab1
NK		 456 callchain_list__set_folding(chain, unfold);
457 has_children = chain->has_children;
3c916cc2
ACM		 458 }
459
460 if (has_children)
461 n += callchain_node__set_folding_rb_tree(child, unfold);
462 }
463
464 return n;
465}
466
467static 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;
3698dab1
NK		 475 callchain_list__set_folding(chain, unfold);
476 has_children = chain->has_children;
3c916cc2
ACM		 477 }
478
479 if (has_children)
480 n += callchain_node__set_folding_rb_tree(node, unfold);
481
482 return n;
483}
484
485static 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
492b1010
NK		 498static 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
516static void hist_entry__set_folding(struct hist_entry *he,
517 struct hist_browser *hb, bool unfold)
3c916cc2 518{
05e8b080 519 hist_entry__init_have_children(he);
3698dab1 520 he->unfolded = unfold ? he->has_children : false;
3c916cc2 521
3698dab1 522 if (he->has_children) {
492b1010
NK		 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
05e8b080 530 he->nr_rows = unfold ? n : 0;
3c916cc2 531 } else
05e8b080 532 he->nr_rows = 0;
3c916cc2
ACM		 533}
534
c3b78952
NK		 535static void
536__hist_browser__set_folding(struct hist_browser *browser, bool unfold)
3c916cc2
ACM		 537{
538 struct rb_node *nd;
492b1010
NK		 539 struct hist_entry *he;
540 double percent;
3c916cc2 541
492b1010
NK		 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;
79dded87
NK		 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;
3c916cc2
ACM		 565 }
566}
567
05e8b080 568static void hist_browser__set_folding(struct hist_browser *browser, bool unfold)
3c916cc2 569{
492b1010 570 browser->nr_hierarchy_entries = 0;
c3b78952
NK		 571 browser->nr_callchain_rows = 0;
572 __hist_browser__set_folding(browser, unfold);
573
574 browser->b.nr_entries = hist_browser__nr_entries(browser);
3c916cc2 575 /* Go to the start, we may be way after valid entries after a collapse */
05e8b080 576 ui_browser__reset_index(&browser->b);
3c916cc2
ACM		 577}
578
7b27509f
ACM		 579static 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
5f00b0f4 588static int hist_browser__run(struct hist_browser *browser, const char *help)
d1b4f249 589{
b50e003d 590 int key;
81cce8de 591 char title[160];
c2a51ab8 592 struct hist_browser_timer *hbt = browser->hbt;
9783adf7 593 int delay_secs = hbt ? hbt->refresh : 0;
d1b4f249 594
05e8b080 595 browser->b.entries = &browser->hists->entries;
c3b78952 596 browser->b.nr_entries = hist_browser__nr_entries(browser);
d1b4f249 597
1e378ebd 598 hists__browser_title(browser->hists, hbt, title, sizeof(title));
d1b4f249 599
090cff3e 600 if (ui_browser__show(&browser->b, title, "%s", help) < 0)
d1b4f249
ACM		 601 return -1;
602
d1b4f249 603 while (1) {
05e8b080 604 key = ui_browser__run(&browser->b, delay_secs);
d1b4f249 605
b50e003d 606 switch (key) {
fa5df943
NK		 607 case K_TIMER: {
608 u64 nr_entries;
9783adf7 609 hbt->timer(hbt->arg);
fa5df943 610
c3b78952 611 if (hist_browser__has_filter(browser))
112f761f 612 hist_browser__update_nr_entries(browser);
fa5df943 613
c3b78952 614 nr_entries = hist_browser__nr_entries(browser);
fa5df943 615 ui_browser__update_nr_entries(&browser->b, nr_entries);
7b27509f 616
05e8b080
ACM		 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);
7b27509f
ACM		 622 }
623
1e378ebd
TS		 624 hists__browser_title(browser->hists,
625 hbt, title, sizeof(title));
05e8b080 626 ui_browser__show_title(&browser->b, title);
81cce8de 627 continue;
fa5df943 628 }
4694153c 629 case 'D': { /* Debug */
d1b4f249 630 static int seq;
05e8b080 631 struct hist_entry *h = rb_entry(browser->b.top,
d1b4f249
ACM		 632 struct hist_entry, rb_node);
633 ui_helpline__pop();
62c95ae3 634 ui_helpline__fpush("%d: nr_ent=(%d,%d), rows=%d, idx=%d, fve: idx=%d, row_off=%d, nrows=%d",
05e8b080
ACM		 635 seq++, browser->b.nr_entries,
636 browser->hists->nr_entries,
62c95ae3 637 browser->b.rows,
05e8b080
ACM		 638 browser->b.index,
639 browser->b.top_idx,
d1b4f249
ACM		 640 h->row_offset, h->nr_rows);
641 }
3c916cc2
ACM		 642 break;
643 case 'C':
644 /* Collapse the whole world. */
05e8b080 645 hist_browser__set_folding(browser, false);
3c916cc2
ACM		 646 break;
647 case 'E':
648 /* Expand the whole world. */
05e8b080 649 hist_browser__set_folding(browser, true);
3c916cc2 650 break;
025bf7ea
ACM		 651 case 'H':
652 browser->show_headers = !browser->show_headers;
653 hist_browser__update_rows(browser);
654 break;
cf958003 655 case K_ENTER:
05e8b080 656 if (hist_browser__toggle_fold(browser))
d1b4f249
ACM		 657 break;
658 /* fall thru */
659 default:
b50e003d 660 goto out;
d1b4f249
ACM		 661 }
662 }
b50e003d 663out:
05e8b080 664 ui_browser__hide(&browser->b);
b50e003d 665 return key;
d1b4f249
ACM		 666}
667
39ee533f
NK		 668struct 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
678typedef 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
f4536ddd
NK		 684static void hist_browser__show_callchain_entry(struct hist_browser *browser,
685 struct callchain_list *chain,
39ee533f
NK		 686 const char *str, int offset,
687 unsigned short row,
688 struct callchain_print_arg *arg)
f4536ddd
NK		 689{
690 int color, width;
39ee533f 691 char folded_sign = callchain_list__folded(chain);
70e97278 692 bool show_annotated = browser->show_dso && chain->ms.sym && symbol__annotation(chain->ms.sym)->src;
f4536ddd
NK		 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;
39ee533f 699 arg->is_current_entry = true;
f4536ddd
NK		 700 }
701
702 ui_browser__set_color(&browser->b, color);
703 hist_browser__gotorc(browser, row, 0);
26270a00 704 ui_browser__write_nstring(&browser->b, " ", offset);
517dfdb3 705 ui_browser__printf(&browser->b, "%c", folded_sign);
70e97278 706 ui_browser__write_graph(&browser->b, show_annotated ? SLSMG_RARROW_CHAR : ' ');
26270a00 707 ui_browser__write_nstring(&browser->b, str, width);
f4536ddd
NK		 708}
709
39ee533f
NK		 710static 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
722typedef bool (*check_output_full_fn)(struct hist_browser *browser,
723 unsigned short row);
724
725static bool hist_browser__check_output_full(struct hist_browser *browser,
726 unsigned short row)
727{
728 return browser->b.rows == row;
729}
730
731static bool hist_browser__check_dump_full(struct hist_browser *browser __maybe_unused,
732 unsigned short row __maybe_unused)
733{
734 return false;
735}
736
d1b4f249
ACM		 737#define LEVEL_OFFSET_STEP 3
738
18bb8381
NK		 739static 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
59c624e2
NK		 777static 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
4b3a3212
NK		 791static int hist_browser__show_callchain_flat(struct hist_browser *browser,
792 struct rb_root *root,
793 unsigned short row, u64 total,
59c624e2 794 u64 parent_total,
4b3a3212
NK		 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);
59c624e2 804 need_percent = check_percent_display(node, parent_total);
4b3a3212
NK		 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
860next:
861 if (is_output_full(browser, row))
862 break;
863 node = next;
864 }
865out:
866 return row - first_row;
867}
868
8c430a34
NK		 869static 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
895static int hist_browser__show_callchain_folded(struct hist_browser *browser,
896 struct rb_root *root,
897 unsigned short row, u64 total,
59c624e2 898 u64 parent_total,
8c430a34
NK		 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);
59c624e2 908 need_percent = check_percent_display(node, parent_total);
8c430a34
NK		 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
966do_print:
967 print(browser, first_chain, chain_str, offset, row++, arg);
968 free(value_str_alloc);
969 free(chain_str_alloc);
970
971next:
972 if (is_output_full(browser, row))
973 break;
974 node = next;
975 }
976
977 return row - first_row;
978}
979
0c841c6c 980static int hist_browser__show_callchain_graph(struct hist_browser *browser,
c09a7e75 981 struct rb_root *root, int level,
39ee533f 982 unsigned short row, u64 total,
5eca104e 983 u64 parent_total,
39ee533f
NK		 984 print_callchain_entry_fn print,
985 struct callchain_print_arg *arg,
986 check_output_full_fn is_output_full)
d1b4f249
ACM		 987{
988 struct rb_node *node;
f4536ddd 989 int first_row = row, offset = level * LEVEL_OFFSET_STEP;
4087d11c 990 bool need_percent;
5eca104e
NK		 991 u64 percent_total = total;
992
993 if (callchain_param.mode == CHAIN_GRAPH_REL)
994 percent_total = parent_total;
d1b4f249 995
c09a7e75 996 node = rb_first(root);
59c624e2 997 need_percent = check_percent_display(node, parent_total);
4087d11c 998
d1b4f249
ACM		 999 while (node) {
1000 struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);
1001 struct rb_node *next = rb_next(node);
d1b4f249
ACM		 1002 struct callchain_list *chain;
1003 char folded_sign = ' ';
1004 int first = true;
1005 int extra_offset = 0;
1006
d1b4f249 1007 list_for_each_entry(chain, &child->val, list) {
d1b4f249
ACM		 1008 bool was_first = first;
1009
163caed9 1010 if (first)
d1b4f249 1011 first = false;
4087d11c 1012 else if (need_percent)
d1b4f249 1013 extra_offset = LEVEL_OFFSET_STEP;
d1b4f249
ACM		 1014
1015 folded_sign = callchain_list__folded(chain);
c09a7e75 1016
18bb8381 1017 row += hist_browser__show_callchain_list(browser, child,
5eca104e 1018 chain, row, percent_total,
18bb8381
NK		 1019 was_first && need_percent,
1020 offset + extra_offset,
1021 print, arg);
d1b4f249 1022
18bb8381 1023 if (is_output_full(browser, row))
d1b4f249 1024 goto out;
18bb8381 1025
d1b4f249
ACM		 1026 if (folded_sign == '+')
1027 break;
1028 }
1029
1030 if (folded_sign == '-') {
1031 const int new_level = level + (extra_offset ? 2 : 1);
d1b4f249 1032
0c841c6c 1033 row += hist_browser__show_callchain_graph(browser, &child->rb_root,
5eca104e
NK		 1034 new_level, row, total,
1035 child->children_hit,
39ee533f 1036 print, arg, is_output_full);
d1b4f249 1037 }
39ee533f 1038 if (is_output_full(browser, row))
d1b4f249 1039 break;
c09a7e75 1040 node = next;
d1b4f249 1041 }
c09a7e75 1042out:
d1b4f249
ACM		 1043 return row - first_row;
1044}
1045
0c841c6c
NK		 1046static 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);
5eca104e 1054 u64 parent_total;
0c841c6c
NK		 1055 int printed;
1056
5eca104e
NK		 1057 if (symbol_conf.cumulate_callchain)
1058 parent_total = entry->stat_acc->period;
1059 else
1060 parent_total = entry->stat.period;
0c841c6c
NK		 1061
1062 if (callchain_param.mode == CHAIN_FLAT) {
1063 printed = hist_browser__show_callchain_flat(browser,
5eca104e
NK		 1064 &entry->sorted_chain, row,
1065 total, parent_total, print, arg,
1066 is_output_full);
0c841c6c
NK		 1067 } else if (callchain_param.mode == CHAIN_FOLDED) {
1068 printed = hist_browser__show_callchain_folded(browser,
5eca104e
NK		 1069 &entry->sorted_chain, row,
1070 total, parent_total, print, arg,
1071 is_output_full);
0c841c6c
NK		 1072 } else {
1073 printed = hist_browser__show_callchain_graph(browser,
5eca104e
NK		 1074 &entry->sorted_chain, level, row,
1075 total, parent_total, print, arg,
1076 is_output_full);
0c841c6c
NK		 1077 }
1078
1079 if (arg->is_current_entry)
1080 browser->he_selection = entry;
1081
1082 return printed;
1083}
1084
89701460
NK		 1085struct hpp_arg {
1086 struct ui_browser *b;
1087 char folded_sign;
1088 bool current_entry;
1089};
1090
2f6d9009
NK		 1091static int __hpp__slsmg_color_printf(struct perf_hpp *hpp, const char *fmt, ...)
1092{
1093 struct hpp_arg *arg = hpp->ptr;
d675107c 1094 int ret, len;
2f6d9009
NK		 1095 va_list args;
1096 double percent;
371d8c40 1097
2f6d9009 1098 va_start(args, fmt);
d675107c 1099 len = va_arg(args, int);
2f6d9009
NK		 1100 percent = va_arg(args, double);
1101 va_end(args);
371d8c40 1102
2f6d9009 1103 ui_browser__set_percent_color(arg->b, percent, arg->current_entry);
371d8c40 1104
d675107c 1105 ret = scnprintf(hpp->buf, hpp->size, fmt, len, percent);
517dfdb3 1106 ui_browser__printf(arg->b, "%s", hpp->buf);
5aed9d24 1107
2f6d9009 1108 advance_hpp(hpp, ret);
5aed9d24
NK		 1109 return ret;
1110}
1111
fb821c9e 1112#define __HPP_COLOR_PERCENT_FN(_type, _field) \
5aed9d24
NK		 1113static u64 __hpp_get_##_field(struct hist_entry *he) \
1114{ \
1115 return he->stat._field; \
1116} \
1117 \
2c5d4b4a 1118static int \
5b591669 1119hist_browser__hpp_color_##_type(struct perf_hpp_fmt *fmt, \
2c5d4b4a
JO		 1120 struct perf_hpp *hpp, \
1121 struct hist_entry *he) \
f5951d56 1122{ \
5b591669
NK		 1123 return hpp__fmt(fmt, hpp, he, __hpp_get_##_field, " %*.2f%%", \
1124 __hpp__slsmg_color_printf, true); \
f5951d56
NK		 1125}
1126
0434ddd2
NK		 1127#define __HPP_COLOR_ACC_PERCENT_FN(_type, _field) \
1128static u64 __hpp_get_acc_##_field(struct hist_entry *he) \
1129{ \
1130 return he->stat_acc->_field; \
1131} \
1132 \
1133static int \
5b591669 1134hist_browser__hpp_color_##_type(struct perf_hpp_fmt *fmt, \
0434ddd2
NK		 1135 struct perf_hpp *hpp, \
1136 struct hist_entry *he) \
1137{ \
1138 if (!symbol_conf.cumulate_callchain) { \
517dfdb3 1139 struct hpp_arg *arg = hpp->ptr; \
5b591669 1140 int len = fmt->user_len ?: fmt->len; \
d675107c 1141 int ret = scnprintf(hpp->buf, hpp->size, \
5b591669 1142 "%*s", len, "N/A"); \
517dfdb3 1143 ui_browser__printf(arg->b, "%s", hpp->buf); \
0434ddd2
NK		 1144 \
1145 return ret; \
1146 } \
5b591669
NK		 1147 return hpp__fmt(fmt, hpp, he, __hpp_get_acc_##_field, \
1148 " %*.2f%%", __hpp__slsmg_color_printf, true); \
0434ddd2
NK		 1149}
1150
fb821c9e
NK		 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)
0434ddd2 1156__HPP_COLOR_ACC_PERCENT_FN(overhead_acc, period)
f5951d56 1157
5aed9d24 1158#undef __HPP_COLOR_PERCENT_FN
0434ddd2 1159#undef __HPP_COLOR_ACC_PERCENT_FN
f5951d56
NK		 1160
1161void hist_browser__init_hpp(void)
1162{
f5951d56
NK		 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;
0434ddd2
NK		 1173 perf_hpp__format[PERF_HPP__OVERHEAD_ACC].color =
1174 hist_browser__hpp_color_overhead_acc;
f5951d56
NK		 1175}
1176
05e8b080 1177static int hist_browser__show_entry(struct hist_browser *browser,
d1b4f249
ACM		 1178 struct hist_entry *entry,
1179 unsigned short row)
1180{
1240005e 1181 int printed = 0;
67d25916 1182 int width = browser->b.width;
d1b4f249 1183 char folded_sign = ' ';
05e8b080 1184 bool current_entry = ui_browser__is_current_entry(&browser->b, row);
d1b4f249 1185 off_t row_offset = entry->row_offset;
63a1a3d8 1186 bool first = true;
1240005e 1187 struct perf_hpp_fmt *fmt;
d1b4f249
ACM		 1188
1189 if (current_entry) {
05e8b080
ACM		 1190 browser->he_selection = entry;
1191 browser->selection = &entry->ms;
d1b4f249
ACM		 1192 }
1193
1194 if (symbol_conf.use_callchain) {
163caed9 1195 hist_entry__init_have_children(entry);
d1b4f249
ACM		 1196 folded_sign = hist_entry__folded(entry);
1197 }
1198
1199 if (row_offset == 0) {
89701460 1200 struct hpp_arg arg = {
fb821c9e 1201 .b = &browser->b,
89701460
NK		 1202 .folded_sign = folded_sign,
1203 .current_entry = current_entry,
1204 };
c6c3c02d 1205 int column = 0;
d1b4f249 1206
ca3ff33b 1207 hist_browser__gotorc(browser, row, 0);
c172f742 1208
f0786af5 1209 hists__for_each_format(browser->hists, fmt) {
89fee709
ACM		 1210 char s[2048];
1211 struct perf_hpp hpp = {
1212 .buf = s,
1213 .size = sizeof(s),
1214 .ptr = &arg,
1215 };
1216
361459f1
NK		 1217 if (perf_hpp__should_skip(fmt, entry->hists) ||
1218 column++ < browser->b.horiz_scroll)
e67d49a7
NK		 1219 continue;
1220
fb821c9e
NK		 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) {
517dfdb3 1231 ui_browser__printf(&browser->b, "%c ", folded_sign);
fb821c9e
NK		 1232 width -= 2;
1233 }
1234 first = false;
1235 } else {
517dfdb3 1236 ui_browser__printf(&browser->b, " ");
f5951d56
NK		 1237 width -= 2;
1238 }
c172f742 1239
1240005e 1240 if (fmt->color) {
89fee709
ACM		 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);
f5951d56 1248 } else {
89fee709 1249 hist_entry__snprintf_alignment(entry, &hpp, fmt, fmt->entry(fmt, &hpp, entry));
517dfdb3 1250 ui_browser__printf(&browser->b, "%s", s);
f5951d56 1251 }
89fee709 1252 width -= hpp.buf - s;
2cf9cebf
ACM		 1253 }
1254
f5951d56
NK		 1255 /* The scroll bar isn't being used */
1256 if (!browser->b.navkeypressed)
1257 width += 1;
1258
26270a00 1259 ui_browser__write_nstring(&browser->b, "", width);
26d8b338 1260
d1b4f249
ACM		 1261 ++row;
1262 ++printed;
1263 } else
1264 --row_offset;
1265
62c95ae3 1266 if (folded_sign == '-' && row != browser->b.rows) {
39ee533f
NK		 1267 struct callchain_print_arg arg = {
1268 .row_offset = row_offset,
1269 .is_current_entry = current_entry,
1270 };
c09a7e75 1271
0c841c6c 1272 printed += hist_browser__show_callchain(browser, entry, 1, row,
39ee533f
NK		 1273 hist_browser__show_callchain_entry, &arg,
1274 hist_browser__check_output_full);
d1b4f249
ACM		 1275 }
1276
1277 return printed;
1278}
1279
d0506edb
NK		 1280static int hist_browser__show_hierarchy_entry(struct hist_browser *browser,
1281 struct hist_entry *entry,
1282 unsigned short row,
2dbbe9f2 1283 int level)
d0506edb
NK		 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;
2dbbe9f2 1297 int hierarchy_indent = (entry->hists->nr_hpp_node - 2) * HIERARCHY_INDENT;
d0506edb
NK		 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
1b2dbbf4
NK		 1391 perf_hpp_list__for_each_format(entry->hpp_list, fmt) {
1392 ui_browser__write_nstring(&browser->b, "", 2);
1393 width -= 2;
d0506edb 1394
1b2dbbf4
NK		 1395 /*
1396 * No need to call hist_entry__snprintf_alignment()
1397 * since this fmt is always the last column in the
1398 * hierarchy mode.
1399 */
1400 if (fmt->color) {
1401 width -= fmt->color(fmt, &hpp, entry);
1402 } else {
1403 int i = 0;
cb1fab91 1404
1b2dbbf4
NK		 1405 width -= fmt->entry(fmt, &hpp, entry);
1406 ui_browser__printf(&browser->b, "%s", ltrim(s));
cb1fab91 1407
1b2dbbf4
NK		 1408 while (isspace(s[i++]))
1409 width++;
1410 }
d0506edb
NK		 1411 }
1412 }
1413
1414 /* The scroll bar isn't being used */
1415 if (!browser->b.navkeypressed)
1416 width += 1;
1417
1418 ui_browser__write_nstring(&browser->b, "", width);
1419
1420 ++row;
1421 ++printed;
1422
1423show_callchain:
1424 if (entry->leaf && folded_sign == '-' && row != browser->b.rows) {
1425 struct callchain_print_arg carg = {
1426 .row_offset = row_offset,
1427 };
1428
1429 printed += hist_browser__show_callchain(browser, entry,
1430 level + 1, row,
1431 hist_browser__show_callchain_entry, &carg,
1432 hist_browser__check_output_full);
1433 }
1434
1435 return printed;
1436}
1437
79dded87 1438static int hist_browser__show_no_entry(struct hist_browser *browser,
2dbbe9f2 1439 unsigned short row, int level)
79dded87
NK		 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;
2dbbe9f2 1447 int indent = browser->hists->nr_hpp_node - 2;
79dded87
NK		 1448
1449 if (current_entry) {
1450 browser->he_selection = NULL;
1451 browser->selection = NULL;
1452 }
1453
1454 hist_browser__gotorc(browser, row, 0);
1455
1456 if (current_entry && browser->b.navkeypressed)
1457 ui_browser__set_color(&browser->b, HE_COLORSET_SELECTED);
1458 else
1459 ui_browser__set_color(&browser->b, HE_COLORSET_NORMAL);
1460
1461 ui_browser__write_nstring(&browser->b, "", level * HIERARCHY_INDENT);
1462 width -= level * HIERARCHY_INDENT;
1463
1464 hists__for_each_format(browser->hists, fmt) {
1465 if (perf_hpp__should_skip(fmt, browser->hists) ||
1466 column++ < browser->b.horiz_scroll)
1467 continue;
1468
1469 if (perf_hpp__is_sort_entry(fmt) ||
1470 perf_hpp__is_dynamic_entry(fmt))
1471 break;
1472
1473 ret = fmt->width(fmt, NULL, hists_to_evsel(browser->hists));
1474
1475 if (first) {
1476 /* for folded sign */
1477 first = false;
1478 ret++;
1479 } else {
1480 /* space between columns */
1481 ret += 2;
1482 }
1483
1484 ui_browser__write_nstring(&browser->b, "", ret);
1485 width -= ret;
1486 }
1487
2dbbe9f2
NK		 1488 ui_browser__write_nstring(&browser->b, "", indent * HIERARCHY_INDENT);
1489 width -= indent * HIERARCHY_INDENT;
79dded87
NK		 1490
1491 if (column >= browser->b.horiz_scroll) {
1492 char buf[32];
1493
1494 ret = snprintf(buf, sizeof(buf), "no entry >= %.2f%%", browser->min_pcnt);
1495 ui_browser__printf(&browser->b, " %s", buf);
1496 width -= ret + 2;
1497 }
1498
1499 /* The scroll bar isn't being used */
1500 if (!browser->b.navkeypressed)
1501 width += 1;
1502
1503 ui_browser__write_nstring(&browser->b, "", width);
1504 return 1;
1505}
1506
81a888fe
JO		 1507static int advance_hpp_check(struct perf_hpp *hpp, int inc)
1508{
1509 advance_hpp(hpp, inc);
1510 return hpp->size <= 0;
1511}
1512
c6c3c02d 1513static int hists_browser__scnprintf_headers(struct hist_browser *browser, char *buf, size_t size)
81a888fe 1514{
c6c3c02d 1515 struct hists *hists = browser->hists;
81a888fe
JO		 1516 struct perf_hpp dummy_hpp = {
1517 .buf = buf,
1518 .size = size,
1519 };
1520 struct perf_hpp_fmt *fmt;
1521 size_t ret = 0;
c6c3c02d 1522 int column = 0;
81a888fe
JO		 1523
1524 if (symbol_conf.use_callchain) {
1525 ret = scnprintf(buf, size, " ");
1526 if (advance_hpp_check(&dummy_hpp, ret))
1527 return ret;
1528 }
1529
f0786af5 1530 hists__for_each_format(browser->hists, fmt) {
361459f1 1531 if (perf_hpp__should_skip(fmt, hists) || column++ < browser->b.horiz_scroll)
81a888fe
JO		 1532 continue;
1533
81a888fe
JO		 1534 ret = fmt->header(fmt, &dummy_hpp, hists_to_evsel(hists));
1535 if (advance_hpp_check(&dummy_hpp, ret))
1536 break;
1537
1538 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, " ");
1539 if (advance_hpp_check(&dummy_hpp, ret))
1540 break;
1541 }
1542
1543 return ret;
1544}
1545
d8b92400
NK		 1546static int hists_browser__scnprintf_hierarchy_headers(struct hist_browser *browser, char *buf, size_t size)
1547{
1548 struct hists *hists = browser->hists;
1549 struct perf_hpp dummy_hpp = {
1550 .buf = buf,
1551 .size = size,
1552 };
1553 struct perf_hpp_fmt *fmt;
1554 size_t ret = 0;
1555 int column = 0;
2dbbe9f2 1556 int indent = hists->nr_hpp_node - 2;
d8b92400
NK		 1557 bool first = true;
1558
1559 ret = scnprintf(buf, size, " ");
1560 if (advance_hpp_check(&dummy_hpp, ret))
1561 return ret;
1562
1563 hists__for_each_format(hists, fmt) {
1564 if (column++ < browser->b.horiz_scroll)
1565 continue;
1566
1567 if (perf_hpp__is_sort_entry(fmt) || perf_hpp__is_dynamic_entry(fmt))
1568 break;
1569
1570 ret = fmt->header(fmt, &dummy_hpp, hists_to_evsel(hists));
1571 if (advance_hpp_check(&dummy_hpp, ret))
1572 break;
1573
1574 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, " ");
1575 if (advance_hpp_check(&dummy_hpp, ret))
1576 break;
1577 }
1578
1579 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, "%*s",
2dbbe9f2 1580 indent * HIERARCHY_INDENT, "");
d8b92400
NK		 1581 if (advance_hpp_check(&dummy_hpp, ret))
1582 return ret;
1583
1584 hists__for_each_format(hists, fmt) {
cb1fab91
NK		 1585 char *start;
1586
d8b92400
NK		 1587 if (!perf_hpp__is_sort_entry(fmt) && !perf_hpp__is_dynamic_entry(fmt))
1588 continue;
1589 if (perf_hpp__should_skip(fmt, hists))
1590 continue;
1591
1592 if (first) {
1593 first = false;
1594 } else {
1595 ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, " / ");
1596 if (advance_hpp_check(&dummy_hpp, ret))
1597 break;
1598 }
1599
1600 ret = fmt->header(fmt, &dummy_hpp, hists_to_evsel(hists));
1601 dummy_hpp.buf[ret] = '\0';
1602 rtrim(dummy_hpp.buf);
1603
cb1fab91
NK		 1604 start = ltrim(dummy_hpp.buf);
1605 ret = strlen(start);
1606
1607 if (start != dummy_hpp.buf)
1608 memmove(dummy_hpp.buf, start, ret + 1);
1609
d8b92400
NK		 1610 if (advance_hpp_check(&dummy_hpp, ret))
1611 break;
1612 }
1613
1614 return ret;
1615}
1616
025bf7ea
ACM		 1617static void hist_browser__show_headers(struct hist_browser *browser)
1618{
81a888fe
JO		 1619 char headers[1024];
1620
d8b92400
NK		 1621 if (symbol_conf.report_hierarchy)
1622 hists_browser__scnprintf_hierarchy_headers(browser, headers,
1623 sizeof(headers));
1624 else
1625 hists_browser__scnprintf_headers(browser, headers,
1626 sizeof(headers));
025bf7ea
ACM		 1627 ui_browser__gotorc(&browser->b, 0, 0);
1628 ui_browser__set_color(&browser->b, HE_COLORSET_ROOT);
26270a00 1629 ui_browser__write_nstring(&browser->b, headers, browser->b.width + 1);
025bf7ea
ACM		 1630}
1631
437cfe7a
ACM		 1632static void ui_browser__hists_init_top(struct ui_browser *browser)
1633{
1634 if (browser->top == NULL) {
1635 struct hist_browser *hb;
1636
1637 hb = container_of(browser, struct hist_browser, b);
1638 browser->top = rb_first(&hb->hists->entries);
1639 }
1640}
1641
05e8b080 1642static unsigned int hist_browser__refresh(struct ui_browser *browser)
d1b4f249
ACM		 1643{
1644 unsigned row = 0;
025bf7ea 1645 u16 header_offset = 0;
d1b4f249 1646 struct rb_node *nd;
05e8b080 1647 struct hist_browser *hb = container_of(browser, struct hist_browser, b);
d1b4f249 1648
025bf7ea
ACM		 1649 if (hb->show_headers) {
1650 hist_browser__show_headers(hb);
1651 header_offset = 1;
1652 }
1653
05e8b080 1654 ui_browser__hists_init_top(browser);
979d2cac
WN		 1655 hb->he_selection = NULL;
1656 hb->selection = NULL;
d1b4f249 1657
d0506edb 1658 for (nd = browser->top; nd; nd = rb_hierarchy_next(nd)) {
d1b4f249 1659 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
14135663 1660 float percent;
d1b4f249 1661
d0506edb
NK		 1662 if (h->filtered) {
1663 /* let it move to sibling */
1664 h->unfolded = false;
d1b4f249 1665 continue;
d0506edb 1666 }
d1b4f249 1667
14135663 1668 percent = hist_entry__get_percent_limit(h);
064f1981
NK		 1669 if (percent < hb->min_pcnt)
1670 continue;
1671
d0506edb
NK		 1672 if (symbol_conf.report_hierarchy) {
1673 row += hist_browser__show_hierarchy_entry(hb, h, row,
2dbbe9f2 1674 h->depth);
79dded87
NK		 1675 if (row == browser->rows)
1676 break;
1677
1678 if (h->has_no_entry) {
2dbbe9f2 1679 hist_browser__show_no_entry(hb, row, h->depth);
79dded87
NK		 1680 row++;
1681 }
d0506edb
NK		 1682 } else {
1683 row += hist_browser__show_entry(hb, h, row);
1684 }
1685
62c95ae3 1686 if (row == browser->rows)
d1b4f249
ACM		 1687 break;
1688 }
1689
025bf7ea 1690 return row + header_offset;
d1b4f249
ACM		 1691}
1692
064f1981 1693static struct rb_node *hists__filter_entries(struct rb_node *nd,
064f1981 1694 float min_pcnt)
d1b4f249
ACM		 1695{
1696 while (nd != NULL) {
1697 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
14135663 1698 float percent = hist_entry__get_percent_limit(h);
064f1981 1699
c0f1527b 1700 if (!h->filtered && percent >= min_pcnt)
d1b4f249
ACM		 1701 return nd;
1702
d0506edb
NK		 1703 /*
1704 * If it's filtered, its all children also were filtered.
1705 * So move to sibling node.
1706 */
1707 if (rb_next(nd))
1708 nd = rb_next(nd);
1709 else
1710 nd = rb_hierarchy_next(nd);
d1b4f249
ACM		 1711 }
1712
1713 return NULL;
1714}
1715
064f1981 1716static struct rb_node *hists__filter_prev_entries(struct rb_node *nd,
064f1981 1717 float min_pcnt)
d1b4f249
ACM		 1718{
1719 while (nd != NULL) {
1720 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
14135663 1721 float percent = hist_entry__get_percent_limit(h);
064f1981
NK		 1722
1723 if (!h->filtered && percent >= min_pcnt)
d1b4f249
ACM		 1724 return nd;
1725
d0506edb 1726 nd = rb_hierarchy_prev(nd);
d1b4f249
ACM		 1727 }
1728
1729 return NULL;
1730}
1731
05e8b080 1732static void ui_browser__hists_seek(struct ui_browser *browser,
d1b4f249
ACM		 1733 off_t offset, int whence)
1734{
1735 struct hist_entry *h;
1736 struct rb_node *nd;
1737 bool first = true;
064f1981
NK		 1738 struct hist_browser *hb;
1739
1740 hb = container_of(browser, struct hist_browser, b);
d1b4f249 1741
05e8b080 1742 if (browser->nr_entries == 0)
60098917
ACM		 1743 return;
1744
05e8b080 1745 ui_browser__hists_init_top(browser);
437cfe7a 1746
d1b4f249
ACM		 1747 switch (whence) {
1748 case SEEK_SET:
064f1981 1749 nd = hists__filter_entries(rb_first(browser->entries),
14135663 1750 hb->min_pcnt);
d1b4f249
ACM		 1751 break;
1752 case SEEK_CUR:
05e8b080 1753 nd = browser->top;
d1b4f249
ACM		 1754 goto do_offset;
1755 case SEEK_END:
d0506edb
NK		 1756 nd = rb_hierarchy_last(rb_last(browser->entries));
1757 nd = hists__filter_prev_entries(nd, hb->min_pcnt);
d1b4f249
ACM		 1758 first = false;
1759 break;
1760 default:
1761 return;
1762 }
1763
1764 /*
1765 * Moves not relative to the first visible entry invalidates its
1766 * row_offset:
1767 */
05e8b080 1768 h = rb_entry(browser->top, struct hist_entry, rb_node);
d1b4f249
ACM		 1769 h->row_offset = 0;
1770
1771 /*
1772 * Here we have to check if nd is expanded (+), if it is we can't go
1773 * the next top level hist_entry, instead we must compute an offset of
1774 * what _not_ to show and not change the first visible entry.
1775 *
1776 * This offset increments when we are going from top to bottom and
1777 * decreases when we're going from bottom to top.
1778 *
1779 * As we don't have backpointers to the top level in the callchains
1780 * structure, we need to always print the whole hist_entry callchain,
1781 * skipping the first ones that are before the first visible entry
1782 * and stop when we printed enough lines to fill the screen.
1783 */
1784do_offset:
837eeb75
WN		 1785 if (!nd)
1786 return;
1787
d1b4f249
ACM		 1788 if (offset > 0) {
1789 do {
1790 h = rb_entry(nd, struct hist_entry, rb_node);
d0506edb 1791 if (h->unfolded && h->leaf) {
d1b4f249
ACM		 1792 u16 remaining = h->nr_rows - h->row_offset;
1793 if (offset > remaining) {
1794 offset -= remaining;
1795 h->row_offset = 0;
1796 } else {
1797 h->row_offset += offset;
1798 offset = 0;
05e8b080 1799 browser->top = nd;
d1b4f249
ACM		 1800 break;
1801 }
1802 }
d0506edb
NK		 1803 nd = hists__filter_entries(rb_hierarchy_next(nd),
1804 hb->min_pcnt);
d1b4f249
ACM		 1805 if (nd == NULL)
1806 break;
1807 --offset;
05e8b080 1808 browser->top = nd;
d1b4f249
ACM		 1809 } while (offset != 0);
1810 } else if (offset < 0) {
1811 while (1) {
1812 h = rb_entry(nd, struct hist_entry, rb_node);
d0506edb 1813 if (h->unfolded && h->leaf) {
d1b4f249
ACM		 1814 if (first) {
1815 if (-offset > h->row_offset) {
1816 offset += h->row_offset;
1817 h->row_offset = 0;
1818 } else {
1819 h->row_offset += offset;
1820 offset = 0;
05e8b080 1821 browser->top = nd;
d1b4f249
ACM		 1822 break;
1823 }
1824 } else {
1825 if (-offset > h->nr_rows) {
1826 offset += h->nr_rows;
1827 h->row_offset = 0;
1828 } else {
1829 h->row_offset = h->nr_rows + offset;
1830 offset = 0;
05e8b080 1831 browser->top = nd;
d1b4f249
ACM		 1832 break;
1833 }
1834 }
1835 }
1836
d0506edb 1837 nd = hists__filter_prev_entries(rb_hierarchy_prev(nd),
064f1981 1838 hb->min_pcnt);
d1b4f249
ACM		 1839 if (nd == NULL)
1840 break;
1841 ++offset;
05e8b080 1842 browser->top = nd;
d1b4f249
ACM		 1843 if (offset == 0) {
1844 /*
1845 * Last unfiltered hist_entry, check if it is
1846 * unfolded, if it is then we should have
1847 * row_offset at its last entry.
1848 */
1849 h = rb_entry(nd, struct hist_entry, rb_node);
d0506edb 1850 if (h->unfolded && h->leaf)
d1b4f249
ACM		 1851 h->row_offset = h->nr_rows;
1852 break;
1853 }
1854 first = false;
1855 }
1856 } else {
05e8b080 1857 browser->top = nd;
d1b4f249
ACM		 1858 h = rb_entry(nd, struct hist_entry, rb_node);
1859 h->row_offset = 0;
1860 }
1861}
1862
aff3f3f6 1863static int hist_browser__fprintf_callchain(struct hist_browser *browser,
d0506edb
NK		 1864 struct hist_entry *he, FILE *fp,
1865 int level)
aff3f3f6 1866{
39ee533f
NK		 1867 struct callchain_print_arg arg = {
1868 .fp = fp,
1869 };
aff3f3f6 1870
d0506edb 1871 hist_browser__show_callchain(browser, he, level, 0,
39ee533f
NK		 1872 hist_browser__fprintf_callchain_entry, &arg,
1873 hist_browser__check_dump_full);
1874 return arg.printed;
aff3f3f6
ACM		 1875}
1876
1877static int hist_browser__fprintf_entry(struct hist_browser *browser,
1878 struct hist_entry *he, FILE *fp)
1879{
1880 char s[8192];
aff3f3f6
ACM		 1881 int printed = 0;
1882 char folded_sign = ' ';
26d8b338
NK		 1883 struct perf_hpp hpp = {
1884 .buf = s,
1885 .size = sizeof(s),
1886 };
1887 struct perf_hpp_fmt *fmt;
1888 bool first = true;
1889 int ret;
aff3f3f6
ACM		 1890
1891 if (symbol_conf.use_callchain)
1892 folded_sign = hist_entry__folded(he);
1893
aff3f3f6
ACM		 1894 if (symbol_conf.use_callchain)
1895 printed += fprintf(fp, "%c ", folded_sign);
1896
f0786af5 1897 hists__for_each_format(browser->hists, fmt) {
361459f1 1898 if (perf_hpp__should_skip(fmt, he->hists))
e67d49a7
NK		 1899 continue;
1900
26d8b338
NK		 1901 if (!first) {
1902 ret = scnprintf(hpp.buf, hpp.size, " ");
1903 advance_hpp(&hpp, ret);
1904 } else
1905 first = false;
aff3f3f6 1906
26d8b338 1907 ret = fmt->entry(fmt, &hpp, he);
89fee709 1908 ret = hist_entry__snprintf_alignment(he, &hpp, fmt, ret);
26d8b338
NK		 1909 advance_hpp(&hpp, ret);
1910 }
89fee709 1911 printed += fprintf(fp, "%s\n", s);
aff3f3f6
ACM		 1912
1913 if (folded_sign == '-')
d0506edb
NK		 1914 printed += hist_browser__fprintf_callchain(browser, he, fp, 1);
1915
1916 return printed;
1917}
1918
1919
1920static int hist_browser__fprintf_hierarchy_entry(struct hist_browser *browser,
1921 struct hist_entry *he,
1922 FILE *fp, int level,
1923 int nr_sort_keys)
1924{
1925 char s[8192];
1926 int printed = 0;
1927 char folded_sign = ' ';
1928 struct perf_hpp hpp = {
1929 .buf = s,
1930 .size = sizeof(s),
1931 };
1932 struct perf_hpp_fmt *fmt;
1933 bool first = true;
1934 int ret;
1b2dbbf4 1935 int hierarchy_indent = nr_sort_keys * HIERARCHY_INDENT;
d0506edb
NK		 1936
1937 printed = fprintf(fp, "%*s", level * HIERARCHY_INDENT, "");
1938
1939 folded_sign = hist_entry__folded(he);
1940 printed += fprintf(fp, "%c", folded_sign);
1941
1942 hists__for_each_format(he->hists, fmt) {
1943 if (perf_hpp__should_skip(fmt, he->hists))
1944 continue;
1945
1946 if (perf_hpp__is_sort_entry(fmt) ||
1947 perf_hpp__is_dynamic_entry(fmt))
1948 break;
1949
1950 if (!first) {
1951 ret = scnprintf(hpp.buf, hpp.size, " ");
1952 advance_hpp(&hpp, ret);
1953 } else
1954 first = false;
1955
1956 ret = fmt->entry(fmt, &hpp, he);
1957 advance_hpp(&hpp, ret);
1958 }
1959
1960 ret = scnprintf(hpp.buf, hpp.size, "%*s", hierarchy_indent, "");
1961 advance_hpp(&hpp, ret);
1962
1b2dbbf4
NK		 1963 perf_hpp_list__for_each_format(he->hpp_list, fmt) {
1964 ret = scnprintf(hpp.buf, hpp.size, " ");
1965 advance_hpp(&hpp, ret);
1966
1967 ret = fmt->entry(fmt, &hpp, he);
1968 advance_hpp(&hpp, ret);
1969 }
d0506edb
NK		 1970
1971 printed += fprintf(fp, "%s\n", rtrim(s));
1972
1973 if (he->leaf && folded_sign == '-') {
1974 printed += hist_browser__fprintf_callchain(browser, he, fp,
1975 he->depth + 1);
1976 }
aff3f3f6
ACM		 1977
1978 return printed;
1979}
1980
1981static int hist_browser__fprintf(struct hist_browser *browser, FILE *fp)
1982{
064f1981 1983 struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries),
064f1981 1984 browser->min_pcnt);
aff3f3f6 1985 int printed = 0;
d3a72fd8 1986 int nr_sort = browser->hists->nr_sort_keys;
aff3f3f6
ACM		 1987
1988 while (nd) {
1989 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
1990
d0506edb
NK		 1991 if (symbol_conf.report_hierarchy) {
1992 printed += hist_browser__fprintf_hierarchy_entry(browser,
1993 h, fp,
1994 h->depth,
1995 nr_sort);
1996 } else {
1997 printed += hist_browser__fprintf_entry(browser, h, fp);
1998 }
1999
2000 nd = hists__filter_entries(rb_hierarchy_next(nd),
2001 browser->min_pcnt);
aff3f3f6
ACM		 2002 }
2003
2004 return printed;
2005}
2006
2007static int hist_browser__dump(struct hist_browser *browser)
2008{
2009 char filename[64];
2010 FILE *fp;
2011
2012 while (1) {
2013 scnprintf(filename, sizeof(filename), "perf.hist.%d", browser->print_seq);
2014 if (access(filename, F_OK))
2015 break;
2016 /*
2017 * XXX: Just an arbitrary lazy upper limit
2018 */
2019 if (++browser->print_seq == 8192) {
2020 ui_helpline__fpush("Too many perf.hist.N files, nothing written!");
2021 return -1;
2022 }
2023 }
2024
2025 fp = fopen(filename, "w");
2026 if (fp == NULL) {
2027 char bf[64];
4cc49d4d
KS		 2028 const char *err = strerror_r(errno, bf, sizeof(bf));
2029 ui_helpline__fpush("Couldn't write to %s: %s", filename, err);
aff3f3f6
ACM		 2030 return -1;
2031 }
2032
2033 ++browser->print_seq;
2034 hist_browser__fprintf(browser, fp);
2035 fclose(fp);
2036 ui_helpline__fpush("%s written!", filename);
2037
2038 return 0;
2039}
2040
c2a51ab8 2041static struct hist_browser *hist_browser__new(struct hists *hists,
b1a9ceef 2042 struct hist_browser_timer *hbt,
ce80d3be 2043 struct perf_env *env)
d1b4f249 2044{
05e8b080 2045 struct hist_browser *browser = zalloc(sizeof(*browser));
d1b4f249 2046
05e8b080
ACM		 2047 if (browser) {
2048 browser->hists = hists;
2049 browser->b.refresh = hist_browser__refresh;
357cfff1 2050 browser->b.refresh_dimensions = hist_browser__refresh_dimensions;
05e8b080
ACM		 2051 browser->b.seek = ui_browser__hists_seek;
2052 browser->b.use_navkeypressed = true;
c8302367 2053 browser->show_headers = symbol_conf.show_hist_headers;
c2a51ab8 2054 browser->hbt = hbt;
b1a9ceef 2055 browser->env = env;
d1b4f249
ACM		 2056 }
2057
05e8b080 2058 return browser;
d1b4f249
ACM		 2059}
2060
05e8b080 2061static void hist_browser__delete(struct hist_browser *browser)
d1b4f249 2062{
05e8b080 2063 free(browser);
d1b4f249
ACM		 2064}
2065
05e8b080 2066static struct hist_entry *hist_browser__selected_entry(struct hist_browser *browser)
d1b4f249 2067{
05e8b080 2068 return browser->he_selection;
d1b4f249
ACM		 2069}
2070
05e8b080 2071static struct thread *hist_browser__selected_thread(struct hist_browser *browser)
d1b4f249 2072{
05e8b080 2073 return browser->he_selection->thread;
d1b4f249
ACM		 2074}
2075
1e378ebd
TS		 2076/* Check whether the browser is for 'top' or 'report' */
2077static inline bool is_report_browser(void *timer)
2078{
2079 return timer == NULL;
2080}
2081
2082static int hists__browser_title(struct hists *hists,
2083 struct hist_browser_timer *hbt,
2084 char *bf, size_t size)
d1b4f249 2085{
469917ce
ACM		 2086 char unit;
2087 int printed;
05e8b080
ACM		 2088 const struct dso *dso = hists->dso_filter;
2089 const struct thread *thread = hists->thread_filter;
84734b06 2090 int socket_id = hists->socket_filter;
05e8b080
ACM		 2091 unsigned long nr_samples = hists->stats.nr_events[PERF_RECORD_SAMPLE];
2092 u64 nr_events = hists->stats.total_period;
717e263f 2093 struct perf_evsel *evsel = hists_to_evsel(hists);
dd00d486 2094 const char *ev_name = perf_evsel__name(evsel);
717e263f
NK		 2095 char buf[512];
2096 size_t buflen = sizeof(buf);
9e207ddf
KL		 2097 char ref[30] = " show reference callgraph, ";
2098 bool enable_ref = false;
717e263f 2099
f2148330
NK		 2100 if (symbol_conf.filter_relative) {
2101 nr_samples = hists->stats.nr_non_filtered_samples;
2102 nr_events = hists->stats.total_non_filtered_period;
2103 }
2104
759ff497 2105 if (perf_evsel__is_group_event(evsel)) {
717e263f
NK		 2106 struct perf_evsel *pos;
2107
2108 perf_evsel__group_desc(evsel, buf, buflen);
2109 ev_name = buf;
2110
2111 for_each_group_member(pos, evsel) {
4ea062ed
ACM		 2112 struct hists *pos_hists = evsel__hists(pos);
2113
f2148330 2114 if (symbol_conf.filter_relative) {
4ea062ed
ACM		 2115 nr_samples += pos_hists->stats.nr_non_filtered_samples;
2116 nr_events += pos_hists->stats.total_non_filtered_period;
f2148330 2117 } else {
4ea062ed
ACM		 2118 nr_samples += pos_hists->stats.nr_events[PERF_RECORD_SAMPLE];
2119 nr_events += pos_hists->stats.total_period;
f2148330 2120 }
717e263f
NK		 2121 }
2122 }
cc686280 2123
9e207ddf
KL		 2124 if (symbol_conf.show_ref_callgraph &&
2125 strstr(ev_name, "call-graph=no"))
2126 enable_ref = true;
cc686280
AR		 2127 nr_samples = convert_unit(nr_samples, &unit);
2128 printed = scnprintf(bf, size,
9e207ddf
KL		 2129 "Samples: %lu%c of event '%s',%sEvent count (approx.): %" PRIu64,
2130 nr_samples, unit, ev_name, enable_ref ? ref : " ", nr_events);
469917ce 2131
d1b4f249 2132
05e8b080 2133 if (hists->uid_filter_str)
0d37aa34 2134 printed += snprintf(bf + printed, size - printed,
05e8b080 2135 ", UID: %s", hists->uid_filter_str);
d1b4f249 2136 if (thread)
e7f01d1e 2137 printed += scnprintf(bf + printed, size - printed,
469917ce 2138 ", Thread: %s(%d)",
b9c5143a 2139 (thread->comm_set ? thread__comm_str(thread) : ""),
38051234 2140 thread->tid);
d1b4f249 2141 if (dso)
e7f01d1e 2142 printed += scnprintf(bf + printed, size - printed,
469917ce 2143 ", DSO: %s", dso->short_name);
84734b06 2144 if (socket_id > -1)
21394d94 2145 printed += scnprintf(bf + printed, size - printed,
84734b06 2146 ", Processor Socket: %d", socket_id);
1e378ebd
TS		 2147 if (!is_report_browser(hbt)) {
2148 struct perf_top *top = hbt->arg;
2149
2150 if (top->zero)
2151 printed += scnprintf(bf + printed, size - printed, " [z]");
2152 }
2153
469917ce 2154 return printed;
d1b4f249
ACM		 2155}
2156
24bff2dc
SE		 2157static inline void free_popup_options(char **options, int n)
2158{
2159 int i;
2160
04662523
ACM		 2161 for (i = 0; i < n; ++i)
2162 zfree(&options[i]);
24bff2dc
SE		 2163}
2164
341487ab
FT		 2165/*
2166 * Only runtime switching of perf data file will make "input_name" point
2167 * to a malloced buffer. So add "is_input_name_malloced" flag to decide
2168 * whether we need to call free() for current "input_name" during the switch.
2169 */
2170static bool is_input_name_malloced = false;
2171
2172static int switch_data_file(void)
2173{
2174 char *pwd, *options[32], *abs_path[32], *tmp;
2175 DIR *pwd_dir;
2176 int nr_options = 0, choice = -1, ret = -1;
2177 struct dirent *dent;
2178
2179 pwd = getenv("PWD");
2180 if (!pwd)
2181 return ret;
2182
2183 pwd_dir = opendir(pwd);
2184 if (!pwd_dir)
2185 return ret;
2186
2187 memset(options, 0, sizeof(options));
2188 memset(options, 0, sizeof(abs_path));
2189
2190 while ((dent = readdir(pwd_dir))) {
2191 char path[PATH_MAX];
2192 u64 magic;
2193 char *name = dent->d_name;
2194 FILE *file;
2195
2196 if (!(dent->d_type == DT_REG))
2197 continue;
2198
2199 snprintf(path, sizeof(path), "%s/%s", pwd, name);
2200
2201 file = fopen(path, "r");
2202 if (!file)
2203 continue;
2204
2205 if (fread(&magic, 1, 8, file) < 8)
2206 goto close_file_and_continue;
2207
2208 if (is_perf_magic(magic)) {
2209 options[nr_options] = strdup(name);
2210 if (!options[nr_options])
2211 goto close_file_and_continue;
2212
2213 abs_path[nr_options] = strdup(path);
2214 if (!abs_path[nr_options]) {
74cf249d 2215 zfree(&options[nr_options]);
341487ab
FT		 2216 ui__warning("Can't search all data files due to memory shortage.\n");
2217 fclose(file);
2218 break;
2219 }
2220
2221 nr_options++;
2222 }
2223
2224close_file_and_continue:
2225 fclose(file);
2226 if (nr_options >= 32) {
2227 ui__warning("Too many perf data files in PWD!\n"
2228 "Only the first 32 files will be listed.\n");
2229 break;
2230 }
2231 }
2232 closedir(pwd_dir);
2233
2234 if (nr_options) {
2235 choice = ui__popup_menu(nr_options, options);
2236 if (choice < nr_options && choice >= 0) {
2237 tmp = strdup(abs_path[choice]);
2238 if (tmp) {
2239 if (is_input_name_malloced)
2240 free((void *)input_name);
2241 input_name = tmp;
2242 is_input_name_malloced = true;
2243 ret = 0;
2244 } else
2245 ui__warning("Data switch failed due to memory shortage!\n");
2246 }
2247 }
2248
2249 free_popup_options(options, nr_options);
2250 free_popup_options(abs_path, nr_options);
2251 return ret;
2252}
2253
ea7cd592
NK		 2254struct popup_action {
2255 struct thread *thread;
ea7cd592 2256 struct map_symbol ms;
84734b06 2257 int socket;
ea7cd592
NK		 2258
2259 int (*fn)(struct hist_browser *browser, struct popup_action *act);
2260};
2261
bc7cad42 2262static int
ea7cd592 2263do_annotate(struct hist_browser *browser, struct popup_action *act)
bc7cad42
NK		 2264{
2265 struct perf_evsel *evsel;
2266 struct annotation *notes;
2267 struct hist_entry *he;
2268 int err;
2269
eebd0bfc 2270 if (!objdump_path && perf_env__lookup_objdump(browser->env))
bc7cad42
NK		 2271 return 0;
2272
ea7cd592 2273 notes = symbol__annotation(act->ms.sym);
bc7cad42
NK		 2274 if (!notes->src)
2275 return 0;
2276
2277 evsel = hists_to_evsel(browser->hists);
ea7cd592 2278 err = map_symbol__tui_annotate(&act->ms, evsel, browser->hbt);
bc7cad42
NK		 2279 he = hist_browser__selected_entry(browser);
2280 /*
2281 * offer option to annotate the other branch source or target
2282 * (if they exists) when returning from annotate
2283 */
2284 if ((err == 'q' || err == CTRL('c')) && he->branch_info)
2285 return 1;
2286
2287 ui_browser__update_nr_entries(&browser->b, browser->hists->nr_entries);
2288 if (err)
2289 ui_browser__handle_resize(&browser->b);
2290 return 0;
2291}
2292
2293static int
ea7cd592
NK		 2294add_annotate_opt(struct hist_browser *browser __maybe_unused,
2295 struct popup_action *act, char **optstr,
2296 struct map *map, struct symbol *sym)
bc7cad42 2297{
ea7cd592
NK		 2298 if (sym == NULL || map->dso->annotate_warned)
2299 return 0;
2300
2301 if (asprintf(optstr, "Annotate %s", sym->name) < 0)
2302 return 0;
2303
2304 act->ms.map = map;
2305 act->ms.sym = sym;
2306 act->fn = do_annotate;
2307 return 1;
2308}
2309
2310static int
2311do_zoom_thread(struct hist_browser *browser, struct popup_action *act)
2312{
2313 struct thread *thread = act->thread;
2314
bc7cad42
NK		 2315 if (browser->hists->thread_filter) {
2316 pstack__remove(browser->pstack, &browser->hists->thread_filter);
2317 perf_hpp__set_elide(HISTC_THREAD, false);
2318 thread__zput(browser->hists->thread_filter);
2319 ui_helpline__pop();
2320 } else {
7727a925 2321 ui_helpline__fpush("To zoom out press ESC or ENTER + \"Zoom out of %s(%d) thread\"",
bc7cad42
NK		 2322 thread->comm_set ? thread__comm_str(thread) : "",
2323 thread->tid);
2324 browser->hists->thread_filter = thread__get(thread);
2325 perf_hpp__set_elide(HISTC_THREAD, false);
2326 pstack__push(browser->pstack, &browser->hists->thread_filter);
2327 }
2328
2329 hists__filter_by_thread(browser->hists);
2330 hist_browser__reset(browser);
2331 return 0;
2332}
2333
2334static int
ea7cd592
NK		 2335add_thread_opt(struct hist_browser *browser, struct popup_action *act,
2336 char **optstr, struct thread *thread)
2337{
2eafd410 2338 if (!sort__has_thread || thread == NULL)
ea7cd592
NK		 2339 return 0;
2340
2341 if (asprintf(optstr, "Zoom %s %s(%d) thread",
2342 browser->hists->thread_filter ? "out of" : "into",
2343 thread->comm_set ? thread__comm_str(thread) : "",
2344 thread->tid) < 0)
2345 return 0;
2346
2347 act->thread = thread;
2348 act->fn = do_zoom_thread;
2349 return 1;
2350}
2351
2352static int
2353do_zoom_dso(struct hist_browser *browser, struct popup_action *act)
bc7cad42 2354{
045b80dd 2355 struct map *map = act->ms.map;
ea7cd592 2356
bc7cad42
NK		 2357 if (browser->hists->dso_filter) {
2358 pstack__remove(browser->pstack, &browser->hists->dso_filter);
2359 perf_hpp__set_elide(HISTC_DSO, false);
2360 browser->hists->dso_filter = NULL;
2361 ui_helpline__pop();
2362 } else {
045b80dd 2363 if (map == NULL)
bc7cad42 2364 return 0;
7727a925 2365 ui_helpline__fpush("To zoom out press ESC or ENTER + \"Zoom out of %s DSO\"",
045b80dd
ACM		 2366 __map__is_kernel(map) ? "the Kernel" : map->dso->short_name);
2367 browser->hists->dso_filter = map->dso;
bc7cad42
NK		 2368 perf_hpp__set_elide(HISTC_DSO, true);
2369 pstack__push(browser->pstack, &browser->hists->dso_filter);
2370 }
2371
2372 hists__filter_by_dso(browser->hists);
2373 hist_browser__reset(browser);
2374 return 0;
2375}
2376
2377static int
ea7cd592 2378add_dso_opt(struct hist_browser *browser, struct popup_action *act,
045b80dd 2379 char **optstr, struct map *map)
bc7cad42 2380{
b1447a54 2381 if (!sort__has_dso || map == NULL)
ea7cd592
NK		 2382 return 0;
2383
2384 if (asprintf(optstr, "Zoom %s %s DSO",
2385 browser->hists->dso_filter ? "out of" : "into",
045b80dd 2386 __map__is_kernel(map) ? "the Kernel" : map->dso->short_name) < 0)
ea7cd592
NK		 2387 return 0;
2388
045b80dd 2389 act->ms.map = map;
ea7cd592
NK		 2390 act->fn = do_zoom_dso;
2391 return 1;
2392}
2393
2394static int
2395do_browse_map(struct hist_browser *browser __maybe_unused,
2396 struct popup_action *act)
2397{
2398 map__browse(act->ms.map);
bc7cad42
NK		 2399 return 0;
2400}
2401
ea7cd592
NK		 2402static int
2403add_map_opt(struct hist_browser *browser __maybe_unused,
2404 struct popup_action *act, char **optstr, struct map *map)
2405{
b1447a54 2406 if (!sort__has_dso || map == NULL)
ea7cd592
NK		 2407 return 0;
2408
2409 if (asprintf(optstr, "Browse map details") < 0)
2410 return 0;
2411
2412 act->ms.map = map;
2413 act->fn = do_browse_map;
2414 return 1;
2415}
2416
bc7cad42
NK		 2417static int
2418do_run_script(struct hist_browser *browser __maybe_unused,
ea7cd592 2419 struct popup_action *act)
bc7cad42
NK		 2420{
2421 char script_opt[64];
2422 memset(script_opt, 0, sizeof(script_opt));
2423
ea7cd592 2424 if (act->thread) {
bc7cad42 2425 scnprintf(script_opt, sizeof(script_opt), " -c %s ",
ea7cd592
NK		 2426 thread__comm_str(act->thread));
2427 } else if (act->ms.sym) {
bc7cad42 2428 scnprintf(script_opt, sizeof(script_opt), " -S %s ",
ea7cd592 2429 act->ms.sym->name);
bc7cad42
NK		 2430 }
2431
2432 script_browse(script_opt);
2433 return 0;
2434}
2435
2436static int
ea7cd592
NK		 2437add_script_opt(struct hist_browser *browser __maybe_unused,
2438 struct popup_action *act, char **optstr,
2439 struct thread *thread, struct symbol *sym)
2440{
2441 if (thread) {
2442 if (asprintf(optstr, "Run scripts for samples of thread [%s]",
2443 thread__comm_str(thread)) < 0)
2444 return 0;
2445 } else if (sym) {
2446 if (asprintf(optstr, "Run scripts for samples of symbol [%s]",
2447 sym->name) < 0)
2448 return 0;
2449 } else {
2450 if (asprintf(optstr, "Run scripts for all samples") < 0)
2451 return 0;
2452 }
2453
2454 act->thread = thread;
2455 act->ms.sym = sym;
2456 act->fn = do_run_script;
2457 return 1;
2458}
2459
2460static int
2461do_switch_data(struct hist_browser *browser __maybe_unused,
2462 struct popup_action *act __maybe_unused)
bc7cad42
NK		 2463{
2464 if (switch_data_file()) {
2465 ui__warning("Won't switch the data files due to\n"
2466 "no valid data file get selected!\n");
ea7cd592 2467 return 0;
bc7cad42
NK		 2468 }
2469
2470 return K_SWITCH_INPUT_DATA;
2471}
2472
ea7cd592
NK		 2473static int
2474add_switch_opt(struct hist_browser *browser,
2475 struct popup_action *act, char **optstr)
2476{
2477 if (!is_report_browser(browser->hbt))
2478 return 0;
2479
2480 if (asprintf(optstr, "Switch to another data file in PWD") < 0)
2481 return 0;
2482
2483 act->fn = do_switch_data;
2484 return 1;
2485}
2486
2487static int
2488do_exit_browser(struct hist_browser *browser __maybe_unused,
2489 struct popup_action *act __maybe_unused)
2490{
2491 return 0;
2492}
2493
2494static int
2495add_exit_opt(struct hist_browser *browser __maybe_unused,
2496 struct popup_action *act, char **optstr)
2497{
2498 if (asprintf(optstr, "Exit") < 0)
2499 return 0;
2500
2501 act->fn = do_exit_browser;
2502 return 1;
2503}
2504
84734b06
KL		 2505static int
2506do_zoom_socket(struct hist_browser *browser, struct popup_action *act)
2507{
2508 if (browser->hists->socket_filter > -1) {
2509 pstack__remove(browser->pstack, &browser->hists->socket_filter);
2510 browser->hists->socket_filter = -1;
2511 perf_hpp__set_elide(HISTC_SOCKET, false);
2512 } else {
2513 browser->hists->socket_filter = act->socket;
2514 perf_hpp__set_elide(HISTC_SOCKET, true);
2515 pstack__push(browser->pstack, &browser->hists->socket_filter);
2516 }
2517
2518 hists__filter_by_socket(browser->hists);
2519 hist_browser__reset(browser);
2520 return 0;
2521}
2522
2523static int
2524add_socket_opt(struct hist_browser *browser, struct popup_action *act,
2525 char **optstr, int socket_id)
2526{
d9695d9f 2527 if (!sort__has_socket || socket_id < 0)
84734b06
KL		 2528 return 0;
2529
2530 if (asprintf(optstr, "Zoom %s Processor Socket %d",
2531 (browser->hists->socket_filter > -1) ? "out of" : "into",
2532 socket_id) < 0)
2533 return 0;
2534
2535 act->socket = socket_id;
2536 act->fn = do_zoom_socket;
2537 return 1;
2538}
2539
112f761f 2540static void hist_browser__update_nr_entries(struct hist_browser *hb)
064f1981
NK		 2541{
2542 u64 nr_entries = 0;
2543 struct rb_node *nd = rb_first(&hb->hists->entries);
2544
f5b763fe 2545 if (hb->min_pcnt == 0 && !symbol_conf.report_hierarchy) {
268397cb
NK		 2546 hb->nr_non_filtered_entries = hb->hists->nr_non_filtered_entries;
2547 return;
2548 }
2549
14135663 2550 while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {
064f1981 2551 nr_entries++;
f5b763fe 2552 nd = rb_hierarchy_next(nd);
064f1981
NK		 2553 }
2554
112f761f 2555 hb->nr_non_filtered_entries = nr_entries;
f5b763fe 2556 hb->nr_hierarchy_entries = nr_entries;
064f1981 2557}
341487ab 2558
b62e8dfc
NK		 2559static void hist_browser__update_percent_limit(struct hist_browser *hb,
2560 double percent)
2561{
2562 struct hist_entry *he;
2563 struct rb_node *nd = rb_first(&hb->hists->entries);
2564 u64 total = hists__total_period(hb->hists);
2565 u64 min_callchain_hits = total * (percent / 100);
2566
2567 hb->min_pcnt = callchain_param.min_percent = percent;
2568
b62e8dfc
NK		 2569 while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {
2570 he = rb_entry(nd, struct hist_entry, rb_node);
2571
79dded87
NK		 2572 if (he->has_no_entry) {
2573 he->has_no_entry = false;
2574 he->nr_rows = 0;
2575 }
2576
d0506edb
NK		 2577 if (!he->leaf || !symbol_conf.use_callchain)
2578 goto next;
2579
b62e8dfc
NK		 2580 if (callchain_param.mode == CHAIN_GRAPH_REL) {
2581 total = he->stat.period;
2582
2583 if (symbol_conf.cumulate_callchain)
2584 total = he->stat_acc->period;
2585
2586 min_callchain_hits = total * (percent / 100);
2587 }
2588
2589 callchain_param.sort(&he->sorted_chain, he->callchain,
2590 min_callchain_hits, &callchain_param);
2591
d0506edb 2592next:
201fde73 2593 nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD);
d0506edb 2594
b62e8dfc
NK		 2595 /* force to re-evaluate folding state of callchains */
2596 he->init_have_children = false;
492b1010 2597 hist_entry__set_folding(he, hb, false);
b62e8dfc
NK		 2598 }
2599}
2600
34958544 2601static int perf_evsel__hists_browse(struct perf_evsel *evsel, int nr_events,
dd00d486 2602 const char *helpline,
81cce8de 2603 bool left_exits,
68d80758 2604 struct hist_browser_timer *hbt,
064f1981 2605 float min_pcnt,
ce80d3be 2606 struct perf_env *env)
d1b4f249 2607{
4ea062ed 2608 struct hists *hists = evsel__hists(evsel);
b1a9ceef 2609 struct hist_browser *browser = hist_browser__new(hists, hbt, env);
a68c2c58 2610 struct branch_info *bi;
f2b487db
NK		 2611#define MAX_OPTIONS 16
2612 char *options[MAX_OPTIONS];
ea7cd592 2613 struct popup_action actions[MAX_OPTIONS];
24bff2dc 2614 int nr_options = 0;
d1b4f249 2615 int key = -1;
938a23ae 2616 char buf[64];
9783adf7 2617 int delay_secs = hbt ? hbt->refresh : 0;
59dc9f25 2618 struct perf_hpp_fmt *fmt;
d1b4f249 2619
e8e684a5
NK		 2620#define HIST_BROWSER_HELP_COMMON \
2621 "h/?/F1 Show this window\n" \
2622 "UP/DOWN/PGUP\n" \
2623 "PGDN/SPACE Navigate\n" \
2624 "q/ESC/CTRL+C Exit browser\n\n" \
2625 "For multiple event sessions:\n\n" \
2626 "TAB/UNTAB Switch events\n\n" \
2627 "For symbolic views (--sort has sym):\n\n" \
7727a925
ACM		 2628 "ENTER Zoom into DSO/Threads & Annotate current symbol\n" \
2629 "ESC Zoom out\n" \
e8e684a5
NK		 2630 "a Annotate current symbol\n" \
2631 "C Collapse all callchains\n" \
2632 "d Zoom into current DSO\n" \
2633 "E Expand all callchains\n" \
105eb30f 2634 "F Toggle percentage of filtered entries\n" \
025bf7ea 2635 "H Display column headers\n" \
b62e8dfc 2636 "L Change percent limit\n" \
31eb4360 2637 "m Display context menu\n" \
84734b06 2638 "S Zoom into current Processor Socket\n" \
e8e684a5
NK		 2639
2640 /* help messages are sorted by lexical order of the hotkey */
2641 const char report_help[] = HIST_BROWSER_HELP_COMMON
6dd60135 2642 "i Show header information\n"
e8e684a5
NK		 2643 "P Print histograms to perf.hist.N\n"
2644 "r Run available scripts\n"
2645 "s Switch to another data file in PWD\n"
2646 "t Zoom into current Thread\n"
2647 "V Verbose (DSO names in callchains, etc)\n"
2648 "/ Filter symbol by name";
2649 const char top_help[] = HIST_BROWSER_HELP_COMMON
2650 "P Print histograms to perf.hist.N\n"
2651 "t Zoom into current Thread\n"
2652 "V Verbose (DSO names in callchains, etc)\n"
42337a22 2653 "z Toggle zeroing of samples\n"
fbb7997e 2654 "f Enable/Disable events\n"
e8e684a5
NK		 2655 "/ Filter symbol by name";
2656
d1b4f249
ACM		 2657 if (browser == NULL)
2658 return -1;
2659
ed426915
NK		 2660 /* reset abort key so that it can get Ctrl-C as a key */
2661 SLang_reset_tty();
2662 SLang_init_tty(0, 0, 0);
2663
03905048 2664 if (min_pcnt)
064f1981 2665 browser->min_pcnt = min_pcnt;
03905048 2666 hist_browser__update_nr_entries(browser);
064f1981 2667
84734b06 2668 browser->pstack = pstack__new(3);
01f00a1c 2669 if (browser->pstack == NULL)
d1b4f249
ACM		 2670 goto out;
2671
2672 ui_helpline__push(helpline);
2673
24bff2dc 2674 memset(options, 0, sizeof(options));
ea7cd592 2675 memset(actions, 0, sizeof(actions));
24bff2dc 2676
f0786af5 2677 hists__for_each_format(browser->hists, fmt) {
59dc9f25 2678 perf_hpp__reset_width(fmt, hists);
c6c3c02d
ACM		 2679 /*
2680 * This is done just once, and activates the horizontal scrolling
2681 * code in the ui_browser code, it would be better to have a the
2682 * counter in the perf_hpp code, but I couldn't find doing it here
2683 * works, FIXME by setting this in hist_browser__new, for now, be
2684 * clever 8-)
2685 */
2686 ++browser->b.columns;
2687 }
59dc9f25 2688
5b591669
NK		 2689 if (symbol_conf.col_width_list_str)
2690 perf_hpp__set_user_width(symbol_conf.col_width_list_str);
2691
d1b4f249 2692 while (1) {
f3b623b8 2693 struct thread *thread = NULL;
045b80dd 2694 struct map *map = NULL;
ea7cd592 2695 int choice = 0;
84734b06 2696 int socked_id = -1;
d1b4f249 2697
24bff2dc
SE		 2698 nr_options = 0;
2699
5f00b0f4 2700 key = hist_browser__run(browser, helpline);
d1b4f249 2701
60098917
ACM		 2702 if (browser->he_selection != NULL) {
2703 thread = hist_browser__selected_thread(browser);
045b80dd 2704 map = browser->selection->map;
84734b06 2705 socked_id = browser->he_selection->socket;
60098917 2706 }
b50e003d 2707 switch (key) {
cf958003
ACM		 2708 case K_TAB:
2709 case K_UNTAB:
e4419b8e
DA		 2710 if (nr_events == 1)
2711 continue;
b50e003d
ACM		 2712 /*
2713 * Exit the browser, let hists__browser_tree
2714 * go to the next or previous
2715 */
2716 goto out_free_stack;
2717 case 'a':
9c796ec8 2718 if (!sort__has_sym) {
7b27509f 2719 ui_browser__warning(&browser->b, delay_secs * 2,
a6e51f9f 2720 "Annotation is only available for symbolic views, "
a68c2c58 2721 "include \"sym*\" in --sort to use it.");
a6e51f9f
ACM		 2722 continue;
2723 }
2724
60098917 2725 if (browser->selection == NULL ||
db9a9cbc 2726 browser->selection->sym == NULL ||
b50e003d 2727 browser->selection->map->dso->annotate_warned)
d1b4f249 2728 continue;
bc7cad42 2729
ea7cd592
NK		 2730 actions->ms.map = browser->selection->map;
2731 actions->ms.sym = browser->selection->sym;
2732 do_annotate(browser, actions);
bc7cad42 2733 continue;
aff3f3f6
ACM		 2734 case 'P':
2735 hist_browser__dump(browser);
2736 continue;
b50e003d 2737 case 'd':
fae00650 2738 actions->ms.map = map;
ea7cd592 2739 do_zoom_dso(browser, actions);
bc7cad42 2740 continue;
a7cb8863
ACM		 2741 case 'V':
2742 browser->show_dso = !browser->show_dso;
2743 continue;
b50e003d 2744 case 't':
ea7cd592
NK		 2745 actions->thread = thread;
2746 do_zoom_thread(browser, actions);
bc7cad42 2747 continue;
84734b06
KL		 2748 case 'S':
2749 actions->socket = socked_id;
2750 do_zoom_socket(browser, actions);
2751 continue;
5a5626b1 2752 case '/':
938a23ae 2753 if (ui_browser__input_window("Symbol to show",
4aa8e454
ACM		 2754 "Please enter the name of symbol you want to see.\n"
2755 "To remove the filter later, press / + ENTER.",
938a23ae
NK		 2756 buf, "ENTER: OK, ESC: Cancel",
2757 delay_secs * 2) == K_ENTER) {
05e8b080
ACM		 2758 hists->symbol_filter_str = *buf ? buf : NULL;
2759 hists__filter_by_symbol(hists);
938a23ae
NK		 2760 hist_browser__reset(browser);
2761 }
2762 continue;
cdbab7c2 2763 case 'r':
ea7cd592
NK		 2764 if (is_report_browser(hbt)) {
2765 actions->thread = NULL;
2766 actions->ms.sym = NULL;
2767 do_run_script(browser, actions);
2768 }
c77d8d70 2769 continue;
341487ab 2770 case 's':
bc7cad42 2771 if (is_report_browser(hbt)) {
ea7cd592 2772 key = do_switch_data(browser, actions);
bc7cad42
NK		 2773 if (key == K_SWITCH_INPUT_DATA)
2774 goto out_free_stack;
2775 }
341487ab 2776 continue;
6dd60135
NK		 2777 case 'i':
2778 /* env->arch is NULL for live-mode (i.e. perf top) */
2779 if (env->arch)
2780 tui__header_window(env);
2781 continue;
105eb30f
NK		 2782 case 'F':
2783 symbol_conf.filter_relative ^= 1;
2784 continue;
42337a22
NK		 2785 case 'z':
2786 if (!is_report_browser(hbt)) {
2787 struct perf_top *top = hbt->arg;
2788
2789 top->zero = !top->zero;
2790 }
2791 continue;
b62e8dfc
NK		 2792 case 'L':
2793 if (ui_browser__input_window("Percent Limit",
2794 "Please enter the value you want to hide entries under that percent.",
2795 buf, "ENTER: OK, ESC: Cancel",
2796 delay_secs * 2) == K_ENTER) {
2797 char *end;
2798 double new_percent = strtod(buf, &end);
2799
2800 if (new_percent < 0 || new_percent > 100) {
2801 ui_browser__warning(&browser->b, delay_secs * 2,
2802 "Invalid percent: %.2f", new_percent);
2803 continue;
2804 }
2805
2806 hist_browser__update_percent_limit(browser, new_percent);
2807 hist_browser__reset(browser);
2808 }
2809 continue;
cf958003 2810 case K_F1:
b50e003d
ACM		 2811 case 'h':
2812 case '?':
4610e413 2813 ui_browser__help_window(&browser->b,
e8e684a5 2814 is_report_browser(hbt) ? report_help : top_help);
b50e003d 2815 continue;
cf958003
ACM		 2816 case K_ENTER:
2817 case K_RIGHT:
31eb4360 2818 case 'm':
b50e003d
ACM		 2819 /* menu */
2820 break;
63ab1749 2821 case K_ESC:
cf958003 2822 case K_LEFT: {
b50e003d 2823 const void *top;
d1b4f249 2824
01f00a1c 2825 if (pstack__empty(browser->pstack)) {
7f0030b2
ACM		 2826 /*
2827 * Go back to the perf_evsel_menu__run or other user
2828 */
2829 if (left_exits)
2830 goto out_free_stack;
63ab1749
ACM		 2831
2832 if (key == K_ESC &&
2833 ui_browser__dialog_yesno(&browser->b,
2834 "Do you really want to exit?"))
2835 goto out_free_stack;
2836
d1b4f249 2837 continue;
7f0030b2 2838 }
6422184b 2839 top = pstack__peek(browser->pstack);
bc7cad42 2840 if (top == &browser->hists->dso_filter) {
6422184b
NK		 2841 /*
2842 * No need to set actions->dso here since
2843 * it's just to remove the current filter.
2844 * Ditto for thread below.
2845 */
2846 do_zoom_dso(browser, actions);
84734b06 2847 } else if (top == &browser->hists->thread_filter) {
6422184b 2848 do_zoom_thread(browser, actions);
84734b06
KL		 2849 } else if (top == &browser->hists->socket_filter) {
2850 do_zoom_socket(browser, actions);
2851 }
b50e003d
ACM		 2852 continue;
2853 }
ed7e5662
ACM		 2854 case 'q':
2855 case CTRL('c'):
516e5368 2856 goto out_free_stack;
fbb7997e 2857 case 'f':
13d1e536
NK		 2858 if (!is_report_browser(hbt)) {
2859 struct perf_top *top = hbt->arg;
2860
2861 perf_evlist__toggle_enable(top->evlist);
2862 /*
2863 * No need to refresh, resort/decay histogram
2864 * entries if we are not collecting samples:
2865 */
2866 if (top->evlist->enabled) {
2867 helpline = "Press 'f' to disable the events or 'h' to see other hotkeys";
2868 hbt->refresh = delay_secs;
2869 } else {
2870 helpline = "Press 'f' again to re-enable the events";
2871 hbt->refresh = 0;
2872 }
2873 continue;
2874 }
3e323dc0 2875 /* Fall thru */
ed7e5662 2876 default:
3e323dc0 2877 helpline = "Press '?' for help on key bindings";
ed7e5662 2878 continue;
d1b4f249
ACM		 2879 }
2880
4056132e 2881 if (!sort__has_sym || browser->selection == NULL)
0ba332f7
ACM		 2882 goto skip_annotation;
2883
55369fc1 2884 if (sort__mode == SORT_MODE__BRANCH) {
a68c2c58 2885 bi = browser->he_selection->branch_info;
0ba332f7
ACM		 2886
2887 if (bi == NULL)
2888 goto skip_annotation;
2889
ea7cd592
NK		 2890 nr_options += add_annotate_opt(browser,
2891 &actions[nr_options],
2892 &options[nr_options],
2893 bi->from.map,
2894 bi->from.sym);
2895 if (bi->to.sym != bi->from.sym)
2896 nr_options += add_annotate_opt(browser,
2897 &actions[nr_options],
2898 &options[nr_options],
2899 bi->to.map,
2900 bi->to.sym);
a68c2c58 2901 } else {
ea7cd592
NK		 2902 nr_options += add_annotate_opt(browser,
2903 &actions[nr_options],
2904 &options[nr_options],
2905 browser->selection->map,
2906 browser->selection->sym);
a68c2c58 2907 }
0ba332f7 2908skip_annotation:
ea7cd592
NK		 2909 nr_options += add_thread_opt(browser, &actions[nr_options],
2910 &options[nr_options], thread);
2911 nr_options += add_dso_opt(browser, &actions[nr_options],
045b80dd 2912 &options[nr_options], map);
ea7cd592
NK		 2913 nr_options += add_map_opt(browser, &actions[nr_options],
2914 &options[nr_options],
bd315aab
WN		 2915 browser->selection ?
2916 browser->selection->map : NULL);
84734b06
KL		 2917 nr_options += add_socket_opt(browser, &actions[nr_options],
2918 &options[nr_options],
2919 socked_id);
cdbab7c2 2920 /* perf script support */
b1baae89
NK		 2921 if (!is_report_browser(hbt))
2922 goto skip_scripting;
2923
cdbab7c2 2924 if (browser->he_selection) {
2eafd410
NK		 2925 if (sort__has_thread && thread) {
2926 nr_options += add_script_opt(browser,
2927 &actions[nr_options],
2928 &options[nr_options],
2929 thread, NULL);
2930 }
bd315aab
WN		 2931 /*
2932 * Note that browser->selection != NULL
2933 * when browser->he_selection is not NULL,
2934 * so we don't need to check browser->selection
2935 * before fetching browser->selection->sym like what
2936 * we do before fetching browser->selection->map.
2937 *
2938 * See hist_browser__show_entry.
2939 */
c221acb0
NK		 2940 if (sort__has_sym && browser->selection->sym) {
2941 nr_options += add_script_opt(browser,
2942 &actions[nr_options],
2943 &options[nr_options],
2944 NULL, browser->selection->sym);
2945 }
cdbab7c2 2946 }
ea7cd592
NK		 2947 nr_options += add_script_opt(browser, &actions[nr_options],
2948 &options[nr_options], NULL, NULL);
2949 nr_options += add_switch_opt(browser, &actions[nr_options],
2950 &options[nr_options]);
b1baae89 2951skip_scripting:
ea7cd592
NK		 2952 nr_options += add_exit_opt(browser, &actions[nr_options],
2953 &options[nr_options]);
d1b4f249 2954
ea7cd592
NK		 2955 do {
2956 struct popup_action *act;
68d80758 2957
ea7cd592
NK		 2958 choice = ui__popup_menu(nr_options, options);
2959 if (choice == -1 || choice >= nr_options)
2960 break;
a68c2c58 2961
ea7cd592
NK		 2962 act = &actions[choice];
2963 key = act->fn(browser, act);
2964 } while (key == 1);
a68c2c58 2965
ea7cd592
NK		 2966 if (key == K_SWITCH_INPUT_DATA)
2967 break;
d1b4f249
ACM		 2968 }
2969out_free_stack:
01f00a1c 2970 pstack__delete(browser->pstack);
d1b4f249
ACM		 2971out:
2972 hist_browser__delete(browser);
f2b487db 2973 free_popup_options(options, MAX_OPTIONS);
d1b4f249
ACM		 2974 return key;
2975}
2976
7f0030b2
ACM		 2977struct perf_evsel_menu {
2978 struct ui_browser b;
2979 struct perf_evsel *selection;
7b27509f 2980 bool lost_events, lost_events_warned;
064f1981 2981 float min_pcnt;
ce80d3be 2982 struct perf_env *env;
7f0030b2
ACM		 2983};
2984
2985static void perf_evsel_menu__write(struct ui_browser *browser,
2986 void *entry, int row)
2987{
2988 struct perf_evsel_menu *menu = container_of(browser,
2989 struct perf_evsel_menu, b);
2990 struct perf_evsel *evsel = list_entry(entry, struct perf_evsel, node);
4ea062ed 2991 struct hists *hists = evsel__hists(evsel);
7f0030b2 2992 bool current_entry = ui_browser__is_current_entry(browser, row);
4ea062ed 2993 unsigned long nr_events = hists->stats.nr_events[PERF_RECORD_SAMPLE];
7289f83c 2994 const char *ev_name = perf_evsel__name(evsel);
7f0030b2 2995 char bf[256], unit;
7b27509f
ACM		 2996 const char *warn = " ";
2997 size_t printed;
7f0030b2
ACM		 2998
2999 ui_browser__set_color(browser, current_entry ? HE_COLORSET_SELECTED :
3000 HE_COLORSET_NORMAL);
3001
759ff497 3002 if (perf_evsel__is_group_event(evsel)) {
717e263f
NK		 3003 struct perf_evsel *pos;
3004
3005 ev_name = perf_evsel__group_name(evsel);
3006
3007 for_each_group_member(pos, evsel) {
4ea062ed
ACM		 3008 struct hists *pos_hists = evsel__hists(pos);
3009 nr_events += pos_hists->stats.nr_events[PERF_RECORD_SAMPLE];
717e263f
NK		 3010 }
3011 }
3012
7f0030b2 3013 nr_events = convert_unit(nr_events, &unit);
e7f01d1e 3014 printed = scnprintf(bf, sizeof(bf), "%lu%c%s%s", nr_events,
7b27509f 3015 unit, unit == ' ' ? "" : " ", ev_name);
517dfdb3 3016 ui_browser__printf(browser, "%s", bf);
7b27509f 3017
4ea062ed 3018 nr_events = hists->stats.nr_events[PERF_RECORD_LOST];
7b27509f
ACM		 3019 if (nr_events != 0) {
3020 menu->lost_events = true;
3021 if (!current_entry)
3022 ui_browser__set_color(browser, HE_COLORSET_TOP);
3023 nr_events = convert_unit(nr_events, &unit);
e7f01d1e
ACM		 3024 printed += scnprintf(bf, sizeof(bf), ": %ld%c%schunks LOST!",
3025 nr_events, unit, unit == ' ' ? "" : " ");
7b27509f
ACM		 3026 warn = bf;
3027 }
3028
26270a00 3029 ui_browser__write_nstring(browser, warn, browser->width - printed);
7f0030b2
ACM		 3030
3031 if (current_entry)
3032 menu->selection = evsel;
3033}
3034
34958544
ACM		 3035static int perf_evsel_menu__run(struct perf_evsel_menu *menu,
3036 int nr_events, const char *help,
9783adf7 3037 struct hist_browser_timer *hbt)
d1b4f249 3038{
7f0030b2 3039 struct perf_evlist *evlist = menu->b.priv;
e248de33 3040 struct perf_evsel *pos;
dd00d486 3041 const char *title = "Available samples";
9783adf7 3042 int delay_secs = hbt ? hbt->refresh : 0;
7f0030b2 3043 int key;
d1b4f249 3044
7f0030b2
ACM		 3045 if (ui_browser__show(&menu->b, title,
3046 "ESC: exit, ENTER|->: Browse histograms") < 0)
3047 return -1;
3048
7f0030b2 3049 while (1) {
3af6e338 3050 key = ui_browser__run(&menu->b, delay_secs);
7f0030b2
ACM		 3051
3052 switch (key) {
cf958003 3053 case K_TIMER:
9783adf7 3054 hbt->timer(hbt->arg);
7b27509f
ACM		 3055
3056 if (!menu->lost_events_warned && menu->lost_events) {
3057 ui_browser__warn_lost_events(&menu->b);
3058 menu->lost_events_warned = true;
3059 }
81cce8de 3060 continue;
cf958003
ACM		 3061 case K_RIGHT:
3062 case K_ENTER:
7f0030b2
ACM		 3063 if (!menu->selection)
3064 continue;
3065 pos = menu->selection;
3066browse_hists:
18eaf0b8
ACM		 3067 perf_evlist__set_selected(evlist, pos);
3068 /*
3069 * Give the calling tool a chance to populate the non
3070 * default evsel resorted hists tree.
3071 */
9783adf7
NK		 3072 if (hbt)
3073 hbt->timer(hbt->arg);
34958544 3074 key = perf_evsel__hists_browse(pos, nr_events, help,
dd00d486 3075 true, hbt,
064f1981 3076 menu->min_pcnt,
68d80758 3077 menu->env);
7f0030b2 3078 ui_browser__show_title(&menu->b, title);
18eaf0b8 3079 switch (key) {
cf958003 3080 case K_TAB:
18eaf0b8 3081 if (pos->node.next == &evlist->entries)
9a354cdc 3082 pos = perf_evlist__first(evlist);
18eaf0b8 3083 else
9a354cdc 3084 pos = perf_evsel__next(pos);
18eaf0b8 3085 goto browse_hists;
cf958003 3086 case K_UNTAB:
18eaf0b8 3087 if (pos->node.prev == &evlist->entries)
9a354cdc 3088 pos = perf_evlist__last(evlist);
18eaf0b8 3089 else
d87fcb4a 3090 pos = perf_evsel__prev(pos);
18eaf0b8 3091 goto browse_hists;
341487ab 3092 case K_SWITCH_INPUT_DATA:
18eaf0b8
ACM		 3093 case 'q':
3094 case CTRL('c'):
3095 goto out;
63ab1749 3096 case K_ESC:
18eaf0b8
ACM		 3097 default:
3098 continue;
3099 }
cf958003 3100 case K_LEFT:
7f0030b2 3101 continue;
cf958003 3102 case K_ESC:
4610e413
ACM		 3103 if (!ui_browser__dialog_yesno(&menu->b,
3104 "Do you really want to exit?"))
ed7e5662
ACM		 3105 continue;
3106 /* Fall thru */
7f0030b2
ACM		 3107 case 'q':
3108 case CTRL('c'):
3109 goto out;
d1b4f249 3110 default:
18eaf0b8 3111 continue;
d1b4f249
ACM		 3112 }
3113 }
3114
7f0030b2
ACM		 3115out:
3116 ui_browser__hide(&menu->b);
3117 return key;
3118}
3119
316c7136 3120static bool filter_group_entries(struct ui_browser *browser __maybe_unused,
fc24d7c2
NK		 3121 void *entry)
3122{
3123 struct perf_evsel *evsel = list_entry(entry, struct perf_evsel, node);
3124
3125 if (symbol_conf.event_group && !perf_evsel__is_group_leader(evsel))
3126 return true;
3127
3128 return false;
3129}
3130
7f0030b2 3131static int __perf_evlist__tui_browse_hists(struct perf_evlist *evlist,
fc24d7c2 3132 int nr_entries, const char *help,
68d80758 3133 struct hist_browser_timer *hbt,
064f1981 3134 float min_pcnt,
ce80d3be 3135 struct perf_env *env)
7f0030b2
ACM		 3136{
3137 struct perf_evsel *pos;
3138 struct perf_evsel_menu menu = {
3139 .b = {
3140 .entries = &evlist->entries,
3141 .refresh = ui_browser__list_head_refresh,
3142 .seek = ui_browser__list_head_seek,
3143 .write = perf_evsel_menu__write,
fc24d7c2
NK		 3144 .filter = filter_group_entries,
3145 .nr_entries = nr_entries,
7f0030b2
ACM		 3146 .priv = evlist,
3147 },
064f1981 3148 .min_pcnt = min_pcnt,
68d80758 3149 .env = env,
7f0030b2
ACM		 3150 };
3151
3152 ui_helpline__push("Press ESC to exit");
3153
0050f7aa 3154 evlist__for_each(evlist, pos) {
7289f83c 3155 const char *ev_name = perf_evsel__name(pos);
7f0030b2
ACM		 3156 size_t line_len = strlen(ev_name) + 7;
3157
3158 if (menu.b.width < line_len)
3159 menu.b.width = line_len;
7f0030b2
ACM		 3160 }
3161
fc24d7c2 3162 return perf_evsel_menu__run(&menu, nr_entries, help, hbt);
7f0030b2
ACM		 3163}
3164
81cce8de 3165int perf_evlist__tui_browse_hists(struct perf_evlist *evlist, const char *help,
68d80758 3166 struct hist_browser_timer *hbt,
064f1981 3167 float min_pcnt,
ce80d3be 3168 struct perf_env *env)
7f0030b2 3169{
fc24d7c2
NK		 3170 int nr_entries = evlist->nr_entries;
3171
3172single_entry:
3173 if (nr_entries == 1) {
9a354cdc 3174 struct perf_evsel *first = perf_evlist__first(evlist);
fc24d7c2
NK		 3175
3176 return perf_evsel__hists_browse(first, nr_entries, help,
dd00d486 3177 false, hbt, min_pcnt,
064f1981 3178 env);
7f0030b2
ACM		 3179 }
3180
fc24d7c2
NK		 3181 if (symbol_conf.event_group) {
3182 struct perf_evsel *pos;
3183
3184 nr_entries = 0;
0050f7aa 3185 evlist__for_each(evlist, pos) {
fc24d7c2
NK		 3186 if (perf_evsel__is_group_leader(pos))
3187 nr_entries++;
0050f7aa 3188 }
fc24d7c2
NK		 3189
3190 if (nr_entries == 1)
3191 goto single_entry;
3192 }
3193
3194 return __perf_evlist__tui_browse_hists(evlist, nr_entries, help,
064f1981 3195 hbt, min_pcnt, env);
d1b4f249 3196}
Linux kernel - Deliverables
This page took 0.358459 seconds and 5 git commands to generate.