hists.c 54.7 KB
Newer Older
1 2 3 4 5 6
#include <stdio.h>
#include "../libslang.h"
#include <stdlib.h>
#include <string.h>
#include <linux/rbtree.h>

7 8 9 10 11 12
#include "../../util/evsel.h"
#include "../../util/evlist.h"
#include "../../util/hist.h"
#include "../../util/pstack.h"
#include "../../util/sort.h"
#include "../../util/util.h"
13
#include "../../util/top.h"
14
#include "../../arch/common.h"
15 16 17 18

#include "../browser.h"
#include "../helpline.h"
#include "../util.h"
19
#include "../ui.h"
20
#include "map.h"
21
#include "annotate.h"
22 23 24 25 26 27

struct hist_browser {
	struct ui_browser   b;
	struct hists	    *hists;
	struct hist_entry   *he_selection;
	struct map_symbol   *selection;
28
	struct hist_browser_timer *hbt;
29
	struct pstack	    *pstack;
30
	struct perf_session_env *env;
31
	int		     print_seq;
32
	bool		     show_dso;
33
	bool		     show_headers;
34
	float		     min_pcnt;
35
	u64		     nr_non_filtered_entries;
36
	u64		     nr_callchain_rows;
37 38
};

39 40
extern void hist_browser__init_hpp(void);

41 42 43
static int hists__browser_title(struct hists *hists,
				struct hist_browser_timer *hbt,
				char *bf, size_t size);
44
static void hist_browser__update_nr_entries(struct hist_browser *hb);
45

46 47 48
static struct rb_node *hists__filter_entries(struct rb_node *nd,
					     float min_pcnt);

49 50 51 52 53
static bool hist_browser__has_filter(struct hist_browser *hb)
{
	return hists__has_filter(hb->hists) || hb->min_pcnt;
}

54 55 56 57 58 59 60 61 62 63 64 65
static int hist_browser__get_folding(struct hist_browser *browser)
{
	struct rb_node *nd;
	struct hists *hists = browser->hists;
	int unfolded_rows = 0;

	for (nd = rb_first(&hists->entries);
	     (nd = hists__filter_entries(nd, browser->min_pcnt)) != NULL;
	     nd = rb_next(nd)) {
		struct hist_entry *he =
			rb_entry(nd, struct hist_entry, rb_node);

66
		if (he->unfolded)
67 68 69 70 71
			unfolded_rows += he->nr_rows;
	}
	return unfolded_rows;
}

72 73 74 75 76 77 78 79 80
static u32 hist_browser__nr_entries(struct hist_browser *hb)
{
	u32 nr_entries;

	if (hist_browser__has_filter(hb))
		nr_entries = hb->nr_non_filtered_entries;
	else
		nr_entries = hb->hists->nr_entries;

81
	hb->nr_callchain_rows = hist_browser__get_folding(hb);
82 83 84
	return nr_entries + hb->nr_callchain_rows;
}

85 86 87 88 89 90 91 92 93 94 95 96 97 98 99
static void hist_browser__update_rows(struct hist_browser *hb)
{
	struct ui_browser *browser = &hb->b;
	u16 header_offset = hb->show_headers ? 1 : 0, index_row;

	browser->rows = browser->height - header_offset;
	/*
	 * Verify if we were at the last line and that line isn't
	 * visibe because we now show the header line(s).
	 */
	index_row = browser->index - browser->top_idx;
	if (index_row >= browser->rows)
		browser->index -= index_row - browser->rows + 1;
}

100
static void hist_browser__refresh_dimensions(struct ui_browser *browser)
101
{
102 103
	struct hist_browser *hb = container_of(browser, struct hist_browser, b);

104
	/* 3 == +/- toggle symbol before actual hist_entry rendering */
105 106 107 108 109 110 111 112
	browser->width = 3 + (hists__sort_list_width(hb->hists) + sizeof("[k]"));
	/*
 	 * FIXME: Just keeping existing behaviour, but this really should be
 	 *	  before updating browser->width, as it will invalidate the
 	 *	  calculation above. Fix this and the fallout in another
 	 *	  changeset.
 	 */
	ui_browser__refresh_dimensions(browser);
113
	hist_browser__update_rows(hb);
114 115
}

116 117
static void hist_browser__gotorc(struct hist_browser *browser, int row, int column)
{
118 119 120
	u16 header_offset = browser->show_headers ? 1 : 0;

	ui_browser__gotorc(&browser->b, row + header_offset, column);
121 122
}

123
static void hist_browser__reset(struct hist_browser *browser)
124
{
125 126 127 128 129 130
	/*
	 * The hists__remove_entry_filter() already folds non-filtered
	 * entries so we can assume it has 0 callchain rows.
	 */
	browser->nr_callchain_rows = 0;

131
	hist_browser__update_nr_entries(browser);
132
	browser->b.nr_entries = hist_browser__nr_entries(browser);
133
	hist_browser__refresh_dimensions(&browser->b);
134
	ui_browser__reset_index(&browser->b);
135 136 137 138 139 140 141
}

static char tree__folded_sign(bool unfolded)
{
	return unfolded ? '-' : '+';
}

142
static char hist_entry__folded(const struct hist_entry *he)
143
{
144
	return he->has_children ? tree__folded_sign(he->unfolded) : ' ';
145 146
}

147
static char callchain_list__folded(const struct callchain_list *cl)
148
{
149
	return cl->has_children ? tree__folded_sign(cl->unfolded) : ' ';
150 151
}

152
static void callchain_list__set_folding(struct callchain_list *cl, bool unfold)
153
{
154
	cl->unfolded = unfold ? cl->has_children : false;
155 156
}

157
static int callchain_node__count_rows_rb_tree(struct callchain_node *node)
158 159 160 161
{
	int n = 0;
	struct rb_node *nd;

162
	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189
		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
		struct callchain_list *chain;
		char folded_sign = ' '; /* No children */

		list_for_each_entry(chain, &child->val, list) {
			++n;
			/* We need this because we may not have children */
			folded_sign = callchain_list__folded(chain);
			if (folded_sign == '+')
				break;
		}

		if (folded_sign == '-') /* Have children and they're unfolded */
			n += callchain_node__count_rows_rb_tree(child);
	}

	return n;
}

static int callchain_node__count_rows(struct callchain_node *node)
{
	struct callchain_list *chain;
	bool unfolded = false;
	int n = 0;

	list_for_each_entry(chain, &node->val, list) {
		++n;
190
		unfolded = chain->unfolded;
191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211
	}

	if (unfolded)
		n += callchain_node__count_rows_rb_tree(node);

	return n;
}

static int callchain__count_rows(struct rb_root *chain)
{
	struct rb_node *nd;
	int n = 0;

	for (nd = rb_first(chain); nd; nd = rb_next(nd)) {
		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
		n += callchain_node__count_rows(node);
	}

	return n;
}

212
static bool hist_entry__toggle_fold(struct hist_entry *he)
213
{
214
	if (!he)
215 216
		return false;

217
	if (!he->has_children)
218 219
		return false;

220 221 222 223 224 225 226 227 228 229 230 231 232
	he->unfolded = !he->unfolded;
	return true;
}

static bool callchain_list__toggle_fold(struct callchain_list *cl)
{
	if (!cl)
		return false;

	if (!cl->has_children)
		return false;

	cl->unfolded = !cl->unfolded;
233 234 235
	return true;
}

236
static void callchain_node__init_have_children_rb_tree(struct callchain_node *node)
237
{
238
	struct rb_node *nd = rb_first(&node->rb_root);
239

240
	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
241 242
		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
		struct callchain_list *chain;
243
		bool first = true;
244 245 246 247

		list_for_each_entry(chain, &child->val, list) {
			if (first) {
				first = false;
248
				chain->has_children = chain->list.next != &child->val ||
249
							 !RB_EMPTY_ROOT(&child->rb_root);
250
			} else
251
				chain->has_children = chain->list.next == &child->val &&
252
							 !RB_EMPTY_ROOT(&child->rb_root);
253 254 255 256 257 258
		}

		callchain_node__init_have_children_rb_tree(child);
	}
}

259 260
static void callchain_node__init_have_children(struct callchain_node *node,
					       bool has_sibling)
261 262 263
{
	struct callchain_list *chain;

264
	chain = list_entry(node->val.next, struct callchain_list, list);
265
	chain->has_children = has_sibling;
266

267 268
	if (!list_empty(&node->val)) {
		chain = list_entry(node->val.prev, struct callchain_list, list);
269
		chain->has_children = !RB_EMPTY_ROOT(&node->rb_root);
270
	}
271

272
	callchain_node__init_have_children_rb_tree(node);
273 274
}

275
static void callchain__init_have_children(struct rb_root *root)
276
{
277 278
	struct rb_node *nd = rb_first(root);
	bool has_sibling = nd && rb_next(nd);
279

280
	for (nd = rb_first(root); nd; nd = rb_next(nd)) {
281
		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
282
		callchain_node__init_have_children(node, has_sibling);
283 284 285
	}
}

286
static void hist_entry__init_have_children(struct hist_entry *he)
287
{
288
	if (!he->init_have_children) {
289
		he->has_children = !RB_EMPTY_ROOT(&he->sorted_chain);
290 291
		callchain__init_have_children(&he->sorted_chain);
		he->init_have_children = true;
292 293 294
	}
}

295
static bool hist_browser__toggle_fold(struct hist_browser *browser)
296
{
297 298 299 300 301 302 303 304 305
	struct hist_entry *he = browser->he_selection;
	struct map_symbol *ms = browser->selection;
	struct callchain_list *cl = container_of(ms, struct callchain_list, ms);
	bool has_children;

	if (ms == &he->ms)
		has_children = hist_entry__toggle_fold(he);
	else
		has_children = callchain_list__toggle_fold(cl);
306

307
	if (has_children) {
308
		hist_entry__init_have_children(he);
309 310
		browser->b.nr_entries -= he->nr_rows;
		browser->nr_callchain_rows -= he->nr_rows;
311

312
		if (he->unfolded)
313 314 315
			he->nr_rows = callchain__count_rows(&he->sorted_chain);
		else
			he->nr_rows = 0;
316 317 318

		browser->b.nr_entries += he->nr_rows;
		browser->nr_callchain_rows += he->nr_rows;
319 320 321 322 323 324 325 326

		return true;
	}

	/* If it doesn't have children, no toggling performed */
	return false;
}

327
static int callchain_node__set_folding_rb_tree(struct callchain_node *node, bool unfold)
328 329 330 331
{
	int n = 0;
	struct rb_node *nd;

332
	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
333 334 335 336 337 338
		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
		struct callchain_list *chain;
		bool has_children = false;

		list_for_each_entry(chain, &child->val, list) {
			++n;
339 340
			callchain_list__set_folding(chain, unfold);
			has_children = chain->has_children;
341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357
		}

		if (has_children)
			n += callchain_node__set_folding_rb_tree(child, unfold);
	}

	return n;
}

static int callchain_node__set_folding(struct callchain_node *node, bool unfold)
{
	struct callchain_list *chain;
	bool has_children = false;
	int n = 0;

	list_for_each_entry(chain, &node->val, list) {
		++n;
358 359
		callchain_list__set_folding(chain, unfold);
		has_children = chain->has_children;
360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380
	}

	if (has_children)
		n += callchain_node__set_folding_rb_tree(node, unfold);

	return n;
}

static int callchain__set_folding(struct rb_root *chain, bool unfold)
{
	struct rb_node *nd;
	int n = 0;

	for (nd = rb_first(chain); nd; nd = rb_next(nd)) {
		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
		n += callchain_node__set_folding(node, unfold);
	}

	return n;
}

381
static void hist_entry__set_folding(struct hist_entry *he, bool unfold)
382
{
383
	hist_entry__init_have_children(he);
384
	he->unfolded = unfold ? he->has_children : false;
385

386
	if (he->has_children) {
387 388
		int n = callchain__set_folding(&he->sorted_chain, unfold);
		he->nr_rows = unfold ? n : 0;
389
	} else
390
		he->nr_rows = 0;
391 392
}

393 394
static void
__hist_browser__set_folding(struct hist_browser *browser, bool unfold)
395 396
{
	struct rb_node *nd;
397
	struct hists *hists = browser->hists;
398

399
	for (nd = rb_first(&hists->entries);
400
	     (nd = hists__filter_entries(nd, browser->min_pcnt)) != NULL;
401
	     nd = rb_next(nd)) {
402 403
		struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node);
		hist_entry__set_folding(he, unfold);
404
		browser->nr_callchain_rows += he->nr_rows;
405 406 407
	}
}

408
static void hist_browser__set_folding(struct hist_browser *browser, bool unfold)
409
{
410 411 412 413
	browser->nr_callchain_rows = 0;
	__hist_browser__set_folding(browser, unfold);

	browser->b.nr_entries = hist_browser__nr_entries(browser);
414
	/* Go to the start, we may be way after valid entries after a collapse */
415
	ui_browser__reset_index(&browser->b);
416 417
}

418 419 420 421 422 423 424 425 426
static void ui_browser__warn_lost_events(struct ui_browser *browser)
{
	ui_browser__warning(browser, 4,
		"Events are being lost, check IO/CPU overload!\n\n"
		"You may want to run 'perf' using a RT scheduler policy:\n\n"
		" perf top -r 80\n\n"
		"Or reduce the sampling frequency.");
}

427
static int hist_browser__run(struct hist_browser *browser, const char *help)
428
{
429
	int key;
430
	char title[160];
431
	struct hist_browser_timer *hbt = browser->hbt;
432
	int delay_secs = hbt ? hbt->refresh : 0;
433

434
	browser->b.entries = &browser->hists->entries;
435
	browser->b.nr_entries = hist_browser__nr_entries(browser);
436

437
	hists__browser_title(browser->hists, hbt, title, sizeof(title));
438

439
	if (ui_browser__show(&browser->b, title, help) < 0)
440 441 442
		return -1;

	while (1) {
443
		key = ui_browser__run(&browser->b, delay_secs);
444

445
		switch (key) {
446 447
		case K_TIMER: {
			u64 nr_entries;
448
			hbt->timer(hbt->arg);
449

450
			if (hist_browser__has_filter(browser))
451
				hist_browser__update_nr_entries(browser);
452

453
			nr_entries = hist_browser__nr_entries(browser);
454
			ui_browser__update_nr_entries(&browser->b, nr_entries);
455

456 457 458 459 460
			if (browser->hists->stats.nr_lost_warned !=
			    browser->hists->stats.nr_events[PERF_RECORD_LOST]) {
				browser->hists->stats.nr_lost_warned =
					browser->hists->stats.nr_events[PERF_RECORD_LOST];
				ui_browser__warn_lost_events(&browser->b);
461 462
			}

463 464
			hists__browser_title(browser->hists,
					     hbt, title, sizeof(title));
465
			ui_browser__show_title(&browser->b, title);
466
			continue;
467
		}
468
		case 'D': { /* Debug */
469
			static int seq;
470
			struct hist_entry *h = rb_entry(browser->b.top,
471 472
							struct hist_entry, rb_node);
			ui_helpline__pop();
473
			ui_helpline__fpush("%d: nr_ent=(%d,%d), rows=%d, idx=%d, fve: idx=%d, row_off=%d, nrows=%d",
474 475
					   seq++, browser->b.nr_entries,
					   browser->hists->nr_entries,
476
					   browser->b.rows,
477 478
					   browser->b.index,
					   browser->b.top_idx,
479 480
					   h->row_offset, h->nr_rows);
		}
481 482 483
			break;
		case 'C':
			/* Collapse the whole world. */
484
			hist_browser__set_folding(browser, false);
485 486 487
			break;
		case 'E':
			/* Expand the whole world. */
488
			hist_browser__set_folding(browser, true);
489
			break;
490 491 492 493
		case 'H':
			browser->show_headers = !browser->show_headers;
			hist_browser__update_rows(browser);
			break;
494
		case K_ENTER:
495
			if (hist_browser__toggle_fold(browser))
496 497 498
				break;
			/* fall thru */
		default:
499
			goto out;
500 501
		}
	}
502
out:
503
	ui_browser__hide(&browser->b);
504
	return key;
505 506
}

507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522
struct callchain_print_arg {
	/* for hists browser */
	off_t	row_offset;
	bool	is_current_entry;

	/* for file dump */
	FILE	*fp;
	int	printed;
};

typedef void (*print_callchain_entry_fn)(struct hist_browser *browser,
					 struct callchain_list *chain,
					 const char *str, int offset,
					 unsigned short row,
					 struct callchain_print_arg *arg);

523 524
static void hist_browser__show_callchain_entry(struct hist_browser *browser,
					       struct callchain_list *chain,
525 526 527
					       const char *str, int offset,
					       unsigned short row,
					       struct callchain_print_arg *arg)
528 529
{
	int color, width;
530
	char folded_sign = callchain_list__folded(chain);
531
	bool show_annotated = browser->show_dso && chain->ms.sym && symbol__annotation(chain->ms.sym)->src;
532 533 534 535 536 537

	color = HE_COLORSET_NORMAL;
	width = browser->b.width - (offset + 2);
	if (ui_browser__is_current_entry(&browser->b, row)) {
		browser->selection = &chain->ms;
		color = HE_COLORSET_SELECTED;
538
		arg->is_current_entry = true;
539 540 541 542 543
	}

	ui_browser__set_color(&browser->b, color);
	hist_browser__gotorc(browser, row, 0);
	slsmg_write_nstring(" ", offset);
544 545
	slsmg_printf("%c", folded_sign);
	ui_browser__write_graph(&browser->b, show_annotated ? SLSMG_RARROW_CHAR : ' ');
546 547 548
	slsmg_write_nstring(str, width);
}

549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575
static void hist_browser__fprintf_callchain_entry(struct hist_browser *b __maybe_unused,
						  struct callchain_list *chain,
						  const char *str, int offset,
						  unsigned short row __maybe_unused,
						  struct callchain_print_arg *arg)
{
	char folded_sign = callchain_list__folded(chain);

	arg->printed += fprintf(arg->fp, "%*s%c %s\n", offset, " ",
				folded_sign, str);
}

typedef bool (*check_output_full_fn)(struct hist_browser *browser,
				     unsigned short row);

static bool hist_browser__check_output_full(struct hist_browser *browser,
					    unsigned short row)
{
	return browser->b.rows == row;
}

static bool hist_browser__check_dump_full(struct hist_browser *browser __maybe_unused,
					  unsigned short row __maybe_unused)
{
	return false;
}

576 577
#define LEVEL_OFFSET_STEP 3

578 579
static int hist_browser__show_callchain(struct hist_browser *browser,
					struct rb_root *root, int level,
580 581 582 583
					unsigned short row, u64 total,
					print_callchain_entry_fn print,
					struct callchain_print_arg *arg,
					check_output_full_fn is_output_full)
584 585
{
	struct rb_node *node;
586
	int first_row = row, offset = level * LEVEL_OFFSET_STEP;
587
	u64 new_total;
588
	bool need_percent;
589

590
	node = rb_first(root);
591
	need_percent = node && rb_next(node);
592

593 594 595
	while (node) {
		struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);
		struct rb_node *next = rb_next(node);
596
		u64 cumul = callchain_cumul_hits(child);
597 598 599 600 601 602
		struct callchain_list *chain;
		char folded_sign = ' ';
		int first = true;
		int extra_offset = 0;

		list_for_each_entry(chain, &child->val, list) {
603
			char bf[1024], *alloc_str;
604 605 606
			const char *str;
			bool was_first = first;

607
			if (first)
608
				first = false;
609
			else if (need_percent)
610 611 612
				extra_offset = LEVEL_OFFSET_STEP;

			folded_sign = callchain_list__folded(chain);
613 614
			if (arg->row_offset != 0) {
				arg->row_offset--;
615 616 617 618
				goto do_next;
			}

			alloc_str = NULL;
619 620
			str = callchain_list__sym_name(chain, bf, sizeof(bf),
						       browser->show_dso);
621

622
			if (was_first && need_percent) {
623
				double percent = cumul * 100.0 / total;
624 625 626 627 628 629 630

				if (asprintf(&alloc_str, "%2.2f%% %s", percent, str) < 0)
					str = "Not enough memory!";
				else
					str = alloc_str;
			}

631 632
			print(browser, chain, str, offset + extra_offset, row, arg);

633 634
			free(alloc_str);

635
			if (is_output_full(browser, ++row))
636 637 638 639 640 641 642 643 644
				goto out;
do_next:
			if (folded_sign == '+')
				break;
		}

		if (folded_sign == '-') {
			const int new_level = level + (extra_offset ? 2 : 1);

645 646 647 648
			if (callchain_param.mode == CHAIN_GRAPH_REL)
				new_total = child->children_hit;
			else
				new_total = total;
649

650
			row += hist_browser__show_callchain(browser, &child->rb_root,
651 652
							    new_level, row, new_total,
							    print, arg, is_output_full);
653
		}
654
		if (is_output_full(browser, row))
655
			break;
656
		node = next;
657
	}
658
out:
659 660 661
	return row - first_row;
}

662 663 664 665 666 667
struct hpp_arg {
	struct ui_browser *b;
	char folded_sign;
	bool current_entry;
};

668 669 670
static int __hpp__slsmg_color_printf(struct perf_hpp *hpp, const char *fmt, ...)
{
	struct hpp_arg *arg = hpp->ptr;
671
	int ret, len;
672 673
	va_list args;
	double percent;
674

675
	va_start(args, fmt);
676
	len = va_arg(args, int);
677 678
	percent = va_arg(args, double);
	va_end(args);
679

680
	ui_browser__set_percent_color(arg->b, percent, arg->current_entry);
681

682
	ret = scnprintf(hpp->buf, hpp->size, fmt, len, percent);
683
	slsmg_printf("%s", hpp->buf);
684

685
	advance_hpp(hpp, ret);
686 687 688
	return ret;
}

689
#define __HPP_COLOR_PERCENT_FN(_type, _field)				\
690 691 692 693 694
static u64 __hpp_get_##_field(struct hist_entry *he)			\
{									\
	return he->stat._field;						\
}									\
									\
695
static int								\
696
hist_browser__hpp_color_##_type(struct perf_hpp_fmt *fmt,		\
697 698
				struct perf_hpp *hpp,			\
				struct hist_entry *he)			\
699
{									\
700 701
	return hpp__fmt(fmt, hpp, he, __hpp_get_##_field, " %*.2f%%",	\
			__hpp__slsmg_color_printf, true);		\
702 703
}

704 705 706 707 708 709 710
#define __HPP_COLOR_ACC_PERCENT_FN(_type, _field)			\
static u64 __hpp_get_acc_##_field(struct hist_entry *he)		\
{									\
	return he->stat_acc->_field;					\
}									\
									\
static int								\
711
hist_browser__hpp_color_##_type(struct perf_hpp_fmt *fmt,		\
712 713 714 715
				struct perf_hpp *hpp,			\
				struct hist_entry *he)			\
{									\
	if (!symbol_conf.cumulate_callchain) {				\
716
		int len = fmt->user_len ?: fmt->len;			\
717
		int ret = scnprintf(hpp->buf, hpp->size,		\
718
				    "%*s", len, "N/A");			\
719 720 721 722
		slsmg_printf("%s", hpp->buf);				\
									\
		return ret;						\
	}								\
723 724
	return hpp__fmt(fmt, hpp, he, __hpp_get_acc_##_field,		\
			" %*.2f%%", __hpp__slsmg_color_printf, true);	\
725 726
}

727 728 729 730 731
__HPP_COLOR_PERCENT_FN(overhead, period)
__HPP_COLOR_PERCENT_FN(overhead_sys, period_sys)
__HPP_COLOR_PERCENT_FN(overhead_us, period_us)
__HPP_COLOR_PERCENT_FN(overhead_guest_sys, period_guest_sys)
__HPP_COLOR_PERCENT_FN(overhead_guest_us, period_guest_us)
732
__HPP_COLOR_ACC_PERCENT_FN(overhead_acc, period)
733

734
#undef __HPP_COLOR_PERCENT_FN
735
#undef __HPP_COLOR_ACC_PERCENT_FN
736 737 738 739 740 741 742 743 744 745 746 747 748

void hist_browser__init_hpp(void)
{
	perf_hpp__format[PERF_HPP__OVERHEAD].color =
				hist_browser__hpp_color_overhead;
	perf_hpp__format[PERF_HPP__OVERHEAD_SYS].color =
				hist_browser__hpp_color_overhead_sys;
	perf_hpp__format[PERF_HPP__OVERHEAD_US].color =
				hist_browser__hpp_color_overhead_us;
	perf_hpp__format[PERF_HPP__OVERHEAD_GUEST_SYS].color =
				hist_browser__hpp_color_overhead_guest_sys;
	perf_hpp__format[PERF_HPP__OVERHEAD_GUEST_US].color =
				hist_browser__hpp_color_overhead_guest_us;
749 750
	perf_hpp__format[PERF_HPP__OVERHEAD_ACC].color =
				hist_browser__hpp_color_overhead_acc;
751 752
}

753
static int hist_browser__show_entry(struct hist_browser *browser,
754 755 756 757
				    struct hist_entry *entry,
				    unsigned short row)
{
	char s[256];
758
	int printed = 0;
759
	int width = browser->b.width;
760
	char folded_sign = ' ';
761
	bool current_entry = ui_browser__is_current_entry(&browser->b, row);
762
	off_t row_offset = entry->row_offset;
763
	bool first = true;
764
	struct perf_hpp_fmt *fmt;
765 766

	if (current_entry) {
767 768
		browser->he_selection = entry;
		browser->selection = &entry->ms;
769 770 771
	}

	if (symbol_conf.use_callchain) {
772
		hist_entry__init_have_children(entry);
773 774 775 776
		folded_sign = hist_entry__folded(entry);
	}

	if (row_offset == 0) {
777
		struct hpp_arg arg = {
778
			.b		= &browser->b,
779 780 781
			.folded_sign	= folded_sign,
			.current_entry	= current_entry,
		};
782 783 784
		struct perf_hpp hpp = {
			.buf		= s,
			.size		= sizeof(s),
785
			.ptr		= &arg,
786
		};
787

788
		hist_browser__gotorc(browser, row, 0);
789

790
		perf_hpp__for_each_format(fmt) {
791 792 793
			if (perf_hpp__should_skip(fmt))
				continue;

794 795 796 797 798 799 800 801 802 803 804 805 806 807 808
			if (current_entry && browser->b.navkeypressed) {
				ui_browser__set_color(&browser->b,
						      HE_COLORSET_SELECTED);
			} else {
				ui_browser__set_color(&browser->b,
						      HE_COLORSET_NORMAL);
			}

			if (first) {
				if (symbol_conf.use_callchain) {
					slsmg_printf("%c ", folded_sign);
					width -= 2;
				}
				first = false;
			} else {
809 810 811
				slsmg_printf("  ");
				width -= 2;
			}
812

813
			if (fmt->color) {
814
				width -= fmt->color(fmt, &hpp, entry);
815
			} else {
816
				width -= fmt->entry(fmt, &hpp, entry);
817 818
				slsmg_printf("%s", s);
			}
819 820
		}

821 822 823 824
		/* The scroll bar isn't being used */
		if (!browser->b.navkeypressed)
			width += 1;

825 826
		slsmg_write_nstring("", width);

827 828 829 830 831
		++row;
		++printed;
	} else
		--row_offset;

832
	if (folded_sign == '-' && row != browser->b.rows) {
833
		u64 total = hists__total_period(entry->hists);
834 835 836 837
		struct callchain_print_arg arg = {
			.row_offset = row_offset,
			.is_current_entry = current_entry,
		};
838

839 840 841 842 843 844 845
		if (callchain_param.mode == CHAIN_GRAPH_REL) {
			if (symbol_conf.cumulate_callchain)
				total = entry->stat_acc->period;
			else
				total = entry->stat.period;
		}

846
		printed += hist_browser__show_callchain(browser,
847 848 849
					&entry->sorted_chain, 1, row, total,
					hist_browser__show_callchain_entry, &arg,
					hist_browser__check_output_full);
850

851
		if (arg.is_current_entry)
852
			browser->he_selection = entry;
853 854 855 856 857
	}

	return printed;
}

858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894
static int advance_hpp_check(struct perf_hpp *hpp, int inc)
{
	advance_hpp(hpp, inc);
	return hpp->size <= 0;
}

static int hists__scnprintf_headers(char *buf, size_t size, struct hists *hists)
{
	struct perf_hpp dummy_hpp = {
		.buf    = buf,
		.size   = size,
	};
	struct perf_hpp_fmt *fmt;
	size_t ret = 0;

	if (symbol_conf.use_callchain) {
		ret = scnprintf(buf, size, "  ");
		if (advance_hpp_check(&dummy_hpp, ret))
			return ret;
	}

	perf_hpp__for_each_format(fmt) {
		if (perf_hpp__should_skip(fmt))
			continue;

		ret = fmt->header(fmt, &dummy_hpp, hists_to_evsel(hists));
		if (advance_hpp_check(&dummy_hpp, ret))
			break;

		ret = scnprintf(dummy_hpp.buf, dummy_hpp.size, "  ");
		if (advance_hpp_check(&dummy_hpp, ret))
			break;
	}

	return ret;
}

895 896
static void hist_browser__show_headers(struct hist_browser *browser)
{
897 898 899
	char headers[1024];

	hists__scnprintf_headers(headers, sizeof(headers), browser->hists);
900 901
	ui_browser__gotorc(&browser->b, 0, 0);
	ui_browser__set_color(&browser->b, HE_COLORSET_ROOT);
902
	slsmg_write_nstring(headers, browser->b.width + 1);
903 904
}

905 906 907 908 909 910 911 912 913 914
static void ui_browser__hists_init_top(struct ui_browser *browser)
{
	if (browser->top == NULL) {
		struct hist_browser *hb;

		hb = container_of(browser, struct hist_browser, b);
		browser->top = rb_first(&hb->hists->entries);
	}
}

915
static unsigned int hist_browser__refresh(struct ui_browser *browser)
916 917
{
	unsigned row = 0;
918
	u16 header_offset = 0;
919
	struct rb_node *nd;
920
	struct hist_browser *hb = container_of(browser, struct hist_browser, b);
921

922 923 924 925 926
	if (hb->show_headers) {
		hist_browser__show_headers(hb);
		header_offset = 1;
	}

927
	ui_browser__hists_init_top(browser);
928

929
	for (nd = browser->top; nd; nd = rb_next(nd)) {
930
		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
931
		float percent;
932 933 934 935

		if (h->filtered)
			continue;

936
		percent = hist_entry__get_percent_limit(h);
937 938 939
		if (percent < hb->min_pcnt)
			continue;

940
		row += hist_browser__show_entry(hb, h, row);
941
		if (row == browser->rows)
942 943 944
			break;
	}

945
	return row + header_offset;
946 947
}

948 949
static struct rb_node *hists__filter_entries(struct rb_node *nd,
					     float min_pcnt)
950 951 952
{
	while (nd != NULL) {
		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
953
		float percent = hist_entry__get_percent_limit(h);
954

955
		if (!h->filtered && percent >= min_pcnt)
956 957 958 959 960 961 962 963
			return nd;

		nd = rb_next(nd);
	}

	return NULL;
}

964 965
static struct rb_node *hists__filter_prev_entries(struct rb_node *nd,
						  float min_pcnt)
966 967 968
{
	while (nd != NULL) {
		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
969
		float percent = hist_entry__get_percent_limit(h);
970 971

		if (!h->filtered && percent >= min_pcnt)
972 973 974 975 976 977 978 979
			return nd;

		nd = rb_prev(nd);
	}

	return NULL;
}

980
static void ui_browser__hists_seek(struct ui_browser *browser,
981 982 983 984 985
				   off_t offset, int whence)
{
	struct hist_entry *h;
	struct rb_node *nd;
	bool first = true;
986 987 988
	struct hist_browser *hb;

	hb = container_of(browser, struct hist_browser, b);
989

990
	if (browser->nr_entries == 0)
991 992
		return;

993
	ui_browser__hists_init_top(browser);
994

995 996
	switch (whence) {
	case SEEK_SET:
997
		nd = hists__filter_entries(rb_first(browser->entries),
998
					   hb->min_pcnt);
999 1000
		break;
	case SEEK_CUR:
1001
		nd = browser->top;
1002 1003
		goto do_offset;
	case SEEK_END:
1004
		nd = hists__filter_prev_entries(rb_last(browser->entries),
1005
						hb->min_pcnt);
1006 1007 1008 1009 1010 1011 1012 1013 1014 1015
		first = false;
		break;
	default:
		return;
	}

	/*
	 * Moves not relative to the first visible entry invalidates its
	 * row_offset:
	 */
1016
	h = rb_entry(browser->top, struct hist_entry, rb_node);
1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035
	h->row_offset = 0;

	/*
	 * Here we have to check if nd is expanded (+), if it is we can't go
	 * the next top level hist_entry, instead we must compute an offset of
	 * what _not_ to show and not change the first visible entry.
	 *
	 * This offset increments when we are going from top to bottom and
	 * decreases when we're going from bottom to top.
	 *
	 * As we don't have backpointers to the top level in the callchains
	 * structure, we need to always print the whole hist_entry callchain,
	 * skipping the first ones that are before the first visible entry
	 * and stop when we printed enough lines to fill the screen.
	 */
do_offset:
	if (offset > 0) {
		do {
			h = rb_entry(nd, struct hist_entry, rb_node);
1036
			if (h->unfolded) {
1037 1038 1039 1040 1041 1042 1043
				u16 remaining = h->nr_rows - h->row_offset;
				if (offset > remaining) {
					offset -= remaining;
					h->row_offset = 0;
				} else {
					h->row_offset += offset;
					offset = 0;
1044
					browser->top = nd;
1045 1046 1047
					break;
				}
			}
1048
			nd = hists__filter_entries(rb_next(nd), hb->min_pcnt);
1049 1050 1051
			if (nd == NULL)
				break;
			--offset;
1052
			browser->top = nd;
1053 1054 1055 1056
		} while (offset != 0);
	} else if (offset < 0) {
		while (1) {
			h = rb_entry(nd, struct hist_entry, rb_node);
1057
			if (h->unfolded) {
1058 1059 1060 1061 1062 1063 1064
				if (first) {
					if (-offset > h->row_offset) {
						offset += h->row_offset;
						h->row_offset = 0;
					} else {
						h->row_offset += offset;
						offset = 0;
1065
						browser->top = nd;
1066 1067 1068 1069 1070 1071 1072 1073 1074
						break;
					}
				} else {
					if (-offset > h->nr_rows) {
						offset += h->nr_rows;
						h->row_offset = 0;
					} else {
						h->row_offset = h->nr_rows + offset;
						offset = 0;
1075
						browser->top = nd;
1076 1077 1078 1079 1080
						break;
					}
				}
			}

1081
			nd = hists__filter_prev_entries(rb_prev(nd),
1082
							hb->min_pcnt);
1083 1084 1085
			if (nd == NULL)
				break;
			++offset;
1086
			browser->top = nd;
1087 1088 1089 1090 1091 1092 1093
			if (offset == 0) {
				/*
				 * Last unfiltered hist_entry, check if it is
				 * unfolded, if it is then we should have
				 * row_offset at its last entry.
				 */
				h = rb_entry(nd, struct hist_entry, rb_node);
1094
				if (h->unfolded)
1095 1096 1097 1098 1099 1100
					h->row_offset = h->nr_rows;
				break;
			}
			first = false;
		}
	} else {
1101
		browser->top = nd;
1102 1103 1104 1105 1106
		h = rb_entry(nd, struct hist_entry, rb_node);
		h->row_offset = 0;
	}
}

1107
static int hist_browser__fprintf_callchain(struct hist_browser *browser,
1108
					   struct hist_entry *he, FILE *fp)
1109
{
1110 1111 1112 1113
	u64 total = hists__total_period(he->hists);
	struct callchain_print_arg arg  = {
		.fp = fp,
	};
1114

1115 1116
	if (symbol_conf.cumulate_callchain)
		total = he->stat_acc->period;
1117

1118 1119 1120 1121
	hist_browser__show_callchain(browser, &he->sorted_chain, 1, 0, total,
				     hist_browser__fprintf_callchain_entry, &arg,
				     hist_browser__check_dump_full);
	return arg.printed;
1122 1123 1124 1125 1126 1127 1128 1129
}

static int hist_browser__fprintf_entry(struct hist_browser *browser,
				       struct hist_entry *he, FILE *fp)
{
	char s[8192];
	int printed = 0;
	char folded_sign = ' ';
1130 1131 1132 1133 1134 1135 1136
	struct perf_hpp hpp = {
		.buf = s,
		.size = sizeof(s),
	};
	struct perf_hpp_fmt *fmt;
	bool first = true;
	int ret;
1137 1138 1139 1140 1141 1142 1143

	if (symbol_conf.use_callchain)
		folded_sign = hist_entry__folded(he);

	if (symbol_conf.use_callchain)
		printed += fprintf(fp, "%c ", folded_sign);

1144
	perf_hpp__for_each_format(fmt) {
1145 1146 1147
		if (perf_hpp__should_skip(fmt))
			continue;

1148 1149 1150 1151 1152
		if (!first) {
			ret = scnprintf(hpp.buf, hpp.size, "  ");
			advance_hpp(&hpp, ret);
		} else
			first = false;
1153

1154 1155 1156
		ret = fmt->entry(fmt, &hpp, he);
		advance_hpp(&hpp, ret);
	}
1157 1158 1159
	printed += fprintf(fp, "%s\n", rtrim(s));

	if (folded_sign == '-')
1160
		printed += hist_browser__fprintf_callchain(browser, he, fp);
1161 1162 1163 1164 1165 1166

	return printed;
}

static int hist_browser__fprintf(struct hist_browser *browser, FILE *fp)
{
1167 1168
	struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries),
						   browser->min_pcnt);
1169 1170 1171 1172 1173 1174
	int printed = 0;

	while (nd) {
		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);

		printed += hist_browser__fprintf_entry(browser, h, fp);
1175
		nd = hists__filter_entries(rb_next(nd), browser->min_pcnt);
1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201
	}

	return printed;
}

static int hist_browser__dump(struct hist_browser *browser)
{
	char filename[64];
	FILE *fp;

	while (1) {
		scnprintf(filename, sizeof(filename), "perf.hist.%d", browser->print_seq);
		if (access(filename, F_OK))
			break;
		/*
 		 * XXX: Just an arbitrary lazy upper limit
 		 */
		if (++browser->print_seq == 8192) {
			ui_helpline__fpush("Too many perf.hist.N files, nothing written!");
			return -1;
		}
	}

	fp = fopen(filename, "w");
	if (fp == NULL) {
		char bf[64];
1202 1203
		const char *err = strerror_r(errno, bf, sizeof(bf));
		ui_helpline__fpush("Couldn't write to %s: %s", filename, err);
1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214
		return -1;
	}

	++browser->print_seq;
	hist_browser__fprintf(browser, fp);
	fclose(fp);
	ui_helpline__fpush("%s written!", filename);

	return 0;
}

1215
static struct hist_browser *hist_browser__new(struct hists *hists,
1216 1217
					      struct hist_browser_timer *hbt,
					      struct perf_session_env *env)
1218
{
1219
	struct hist_browser *browser = zalloc(sizeof(*browser));
1220

1221 1222 1223
	if (browser) {
		browser->hists = hists;
		browser->b.refresh = hist_browser__refresh;
1224
		browser->b.refresh_dimensions = hist_browser__refresh_dimensions;
1225 1226
		browser->b.seek = ui_browser__hists_seek;
		browser->b.use_navkeypressed = true;
1227
		browser->show_headers = symbol_conf.show_hist_headers;
1228
		browser->hbt = hbt;
1229
		browser->env = env;
1230 1231
	}

1232
	return browser;
1233 1234
}

1235
static void hist_browser__delete(struct hist_browser *browser)
1236
{
1237
	free(browser);
1238 1239
}

1240
static struct hist_entry *hist_browser__selected_entry(struct hist_browser *browser)
1241
{
1242
	return browser->he_selection;
1243 1244
}

1245
static struct thread *hist_browser__selected_thread(struct hist_browser *browser)
1246
{
1247
	return browser->he_selection->thread;
1248 1249
}

1250 1251 1252 1253 1254 1255 1256 1257 1258
/* Check whether the browser is for 'top' or 'report' */
static inline bool is_report_browser(void *timer)
{
	return timer == NULL;
}

static int hists__browser_title(struct hists *hists,
				struct hist_browser_timer *hbt,
				char *bf, size_t size)
1259
{
1260 1261
	char unit;
	int printed;
1262 1263 1264 1265
	const struct dso *dso = hists->dso_filter;
	const struct thread *thread = hists->thread_filter;
	unsigned long nr_samples = hists->stats.nr_events[PERF_RECORD_SAMPLE];
	u64 nr_events = hists->stats.total_period;
1266
	struct perf_evsel *evsel = hists_to_evsel(hists);
1267
	const char *ev_name = perf_evsel__name(evsel);
1268 1269 1270
	char buf[512];
	size_t buflen = sizeof(buf);

1271 1272 1273 1274 1275
	if (symbol_conf.filter_relative) {
		nr_samples = hists->stats.nr_non_filtered_samples;
		nr_events = hists->stats.total_non_filtered_period;
	}

1276
	if (perf_evsel__is_group_event(evsel)) {
1277 1278 1279 1280 1281 1282
		struct perf_evsel *pos;

		perf_evsel__group_desc(evsel, buf, buflen);
		ev_name = buf;

		for_each_group_member(pos, evsel) {
1283 1284
			struct hists *pos_hists = evsel__hists(pos);

1285
			if (symbol_conf.filter_relative) {
1286 1287
				nr_samples += pos_hists->stats.nr_non_filtered_samples;
				nr_events += pos_hists->stats.total_non_filtered_period;
1288
			} else {
1289 1290
				nr_samples += pos_hists->stats.nr_events[PERF_RECORD_SAMPLE];
				nr_events += pos_hists->stats.total_period;
1291
			}
1292 1293
		}
	}
1294 1295 1296

	nr_samples = convert_unit(nr_samples, &unit);
	printed = scnprintf(bf, size,
1297
			   "Samples: %lu%c of event '%s', Event count (approx.): %" PRIu64,
1298
			   nr_samples, unit, ev_name, nr_events);
1299

1300

1301
	if (hists->uid_filter_str)
1302
		printed += snprintf(bf + printed, size - printed,
1303
				    ", UID: %s", hists->uid_filter_str);
1304
	if (thread)
1305
		printed += scnprintf(bf + printed, size - printed,
1306
				    ", Thread: %s(%d)",
1307
				     (thread->comm_set ? thread__comm_str(thread) : ""),
1308
				    thread->tid);
1309
	if (dso)
1310
		printed += scnprintf(bf + printed, size - printed,
1311
				    ", DSO: %s", dso->short_name);
1312 1313 1314 1315 1316 1317 1318
	if (!is_report_browser(hbt)) {
		struct perf_top *top = hbt->arg;

		if (top->zero)
			printed += scnprintf(bf + printed, size - printed, " [z]");
	}

1319
	return printed;
1320 1321
}

1322 1323 1324 1325
static inline void free_popup_options(char **options, int n)
{
	int i;

1326 1327
	for (i = 0; i < n; ++i)
		zfree(&options[i]);
1328 1329
}

1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379
/*
 * Only runtime switching of perf data file will make "input_name" point
 * to a malloced buffer. So add "is_input_name_malloced" flag to decide
 * whether we need to call free() for current "input_name" during the switch.
 */
static bool is_input_name_malloced = false;

static int switch_data_file(void)
{
	char *pwd, *options[32], *abs_path[32], *tmp;
	DIR *pwd_dir;
	int nr_options = 0, choice = -1, ret = -1;
	struct dirent *dent;

	pwd = getenv("PWD");
	if (!pwd)
		return ret;

	pwd_dir = opendir(pwd);
	if (!pwd_dir)
		return ret;

	memset(options, 0, sizeof(options));
	memset(options, 0, sizeof(abs_path));

	while ((dent = readdir(pwd_dir))) {
		char path[PATH_MAX];
		u64 magic;
		char *name = dent->d_name;
		FILE *file;

		if (!(dent->d_type == DT_REG))
			continue;

		snprintf(path, sizeof(path), "%s/%s", pwd, name);

		file = fopen(path, "r");
		if (!file)
			continue;

		if (fread(&magic, 1, 8, file) < 8)
			goto close_file_and_continue;

		if (is_perf_magic(magic)) {
			options[nr_options] = strdup(name);
			if (!options[nr_options])
				goto close_file_and_continue;

			abs_path[nr_options] = strdup(path);
			if (!abs_path[nr_options]) {
1380
				zfree(&options[nr_options]);
1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418
				ui__warning("Can't search all data files due to memory shortage.\n");
				fclose(file);
				break;
			}

			nr_options++;
		}

close_file_and_continue:
		fclose(file);
		if (nr_options >= 32) {
			ui__warning("Too many perf data files in PWD!\n"
				    "Only the first 32 files will be listed.\n");
			break;
		}
	}
	closedir(pwd_dir);

	if (nr_options) {
		choice = ui__popup_menu(nr_options, options);
		if (choice < nr_options && choice >= 0) {
			tmp = strdup(abs_path[choice]);
			if (tmp) {
				if (is_input_name_malloced)
					free((void *)input_name);
				input_name = tmp;
				is_input_name_malloced = true;
				ret = 0;
			} else
				ui__warning("Data switch failed due to memory shortage!\n");
		}
	}

	free_popup_options(options, nr_options);
	free_popup_options(abs_path, nr_options);
	return ret;
}

1419 1420 1421 1422 1423 1424 1425 1426
struct popup_action {
	struct thread 		*thread;
	struct dso		*dso;
	struct map_symbol 	ms;

	int (*fn)(struct hist_browser *browser, struct popup_action *act);
};

1427
static int
1428
do_annotate(struct hist_browser *browser, struct popup_action *act)
1429 1430 1431 1432 1433 1434 1435 1436 1437
{
	struct perf_evsel *evsel;
	struct annotation *notes;
	struct hist_entry *he;
	int err;

	if (!objdump_path && perf_session_env__lookup_objdump(browser->env))
		return 0;

1438
	notes = symbol__annotation(act->ms.sym);
1439 1440 1441 1442
	if (!notes->src)
		return 0;

	evsel = hists_to_evsel(browser->hists);
1443
	err = map_symbol__tui_annotate(&act->ms, evsel, browser->hbt);
1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458
	he = hist_browser__selected_entry(browser);
	/*
	 * offer option to annotate the other branch source or target
	 * (if they exists) when returning from annotate
	 */
	if ((err == 'q' || err == CTRL('c')) && he->branch_info)
		return 1;

	ui_browser__update_nr_entries(&browser->b, browser->hists->nr_entries);
	if (err)
		ui_browser__handle_resize(&browser->b);
	return 0;
}

static int
1459 1460 1461
add_annotate_opt(struct hist_browser *browser __maybe_unused,
		 struct popup_action *act, char **optstr,
		 struct map *map, struct symbol *sym)
1462
{
1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479
	if (sym == NULL || map->dso->annotate_warned)
		return 0;

	if (asprintf(optstr, "Annotate %s", sym->name) < 0)
		return 0;

	act->ms.map = map;
	act->ms.sym = sym;
	act->fn = do_annotate;
	return 1;
}

static int
do_zoom_thread(struct hist_browser *browser, struct popup_action *act)
{
	struct thread *thread = act->thread;

1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499
	if (browser->hists->thread_filter) {
		pstack__remove(browser->pstack, &browser->hists->thread_filter);
		perf_hpp__set_elide(HISTC_THREAD, false);
		thread__zput(browser->hists->thread_filter);
		ui_helpline__pop();
	} else {
		ui_helpline__fpush("To zoom out press <- or -> + \"Zoom out of %s(%d) thread\"",
				   thread->comm_set ? thread__comm_str(thread) : "",
				   thread->tid);
		browser->hists->thread_filter = thread__get(thread);
		perf_hpp__set_elide(HISTC_THREAD, false);
		pstack__push(browser->pstack, &browser->hists->thread_filter);
	}

	hists__filter_by_thread(browser->hists);
	hist_browser__reset(browser);
	return 0;
}

static int
1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518
add_thread_opt(struct hist_browser *browser, struct popup_action *act,
	       char **optstr, struct thread *thread)
{
	if (thread == NULL)
		return 0;

	if (asprintf(optstr, "Zoom %s %s(%d) thread",
		     browser->hists->thread_filter ? "out of" : "into",
		     thread->comm_set ? thread__comm_str(thread) : "",
		     thread->tid) < 0)
		return 0;

	act->thread = thread;
	act->fn = do_zoom_thread;
	return 1;
}

static int
do_zoom_dso(struct hist_browser *browser, struct popup_action *act)
1519
{
1520 1521
	struct dso *dso = act->dso;

1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542
	if (browser->hists->dso_filter) {
		pstack__remove(browser->pstack, &browser->hists->dso_filter);
		perf_hpp__set_elide(HISTC_DSO, false);
		browser->hists->dso_filter = NULL;
		ui_helpline__pop();
	} else {
		if (dso == NULL)
			return 0;
		ui_helpline__fpush("To zoom out press <- or -> + \"Zoom out of %s DSO\"",
				   dso->kernel ? "the Kernel" : dso->short_name);
		browser->hists->dso_filter = dso;
		perf_hpp__set_elide(HISTC_DSO, true);
		pstack__push(browser->pstack, &browser->hists->dso_filter);
	}

	hists__filter_by_dso(browser->hists);
	hist_browser__reset(browser);
	return 0;
}

static int
1543 1544
add_dso_opt(struct hist_browser *browser, struct popup_action *act,
	    char **optstr, struct dso *dso)
1545
{
1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563
	if (dso == NULL)
		return 0;

	if (asprintf(optstr, "Zoom %s %s DSO",
		     browser->hists->dso_filter ? "out of" : "into",
		     dso->kernel ? "the Kernel" : dso->short_name) < 0)
		return 0;

	act->dso = dso;
	act->fn = do_zoom_dso;
	return 1;
}

static int
do_browse_map(struct hist_browser *browser __maybe_unused,
	      struct popup_action *act)
{
	map__browse(act->ms.map);
1564 1565 1566
	return 0;
}

1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581
static int
add_map_opt(struct hist_browser *browser __maybe_unused,
	    struct popup_action *act, char **optstr, struct map *map)
{
	if (map == NULL)
		return 0;

	if (asprintf(optstr, "Browse map details") < 0)
		return 0;

	act->ms.map = map;
	act->fn = do_browse_map;
	return 1;
}

1582 1583
static int
do_run_script(struct hist_browser *browser __maybe_unused,
1584
	      struct popup_action *act)
1585 1586 1587 1588
{
	char script_opt[64];
	memset(script_opt, 0, sizeof(script_opt));

1589
	if (act->thread) {
1590
		scnprintf(script_opt, sizeof(script_opt), " -c %s ",
1591 1592
			  thread__comm_str(act->thread));
	} else if (act->ms.sym) {
1593
		scnprintf(script_opt, sizeof(script_opt), " -S %s ",
1594
			  act->ms.sym->name);
1595 1596 1597 1598 1599 1600 1601
	}

	script_browse(script_opt);
	return 0;
}

static int
1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627
add_script_opt(struct hist_browser *browser __maybe_unused,
	       struct popup_action *act, char **optstr,
	       struct thread *thread, struct symbol *sym)
{
	if (thread) {
		if (asprintf(optstr, "Run scripts for samples of thread [%s]",
			     thread__comm_str(thread)) < 0)
			return 0;
	} else if (sym) {
		if (asprintf(optstr, "Run scripts for samples of symbol [%s]",
			     sym->name) < 0)
			return 0;
	} else {
		if (asprintf(optstr, "Run scripts for all samples") < 0)
			return 0;
	}

	act->thread = thread;
	act->ms.sym = sym;
	act->fn = do_run_script;
	return 1;
}

static int
do_switch_data(struct hist_browser *browser __maybe_unused,
	       struct popup_action *act __maybe_unused)
1628 1629 1630 1631
{
	if (switch_data_file()) {
		ui__warning("Won't switch the data files due to\n"
			    "no valid data file get selected!\n");
1632
		return 0;
1633 1634 1635 1636 1637
	}

	return K_SWITCH_INPUT_DATA;
}

1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669
static int
add_switch_opt(struct hist_browser *browser,
	       struct popup_action *act, char **optstr)
{
	if (!is_report_browser(browser->hbt))
		return 0;

	if (asprintf(optstr, "Switch to another data file in PWD") < 0)
		return 0;

	act->fn = do_switch_data;
	return 1;
}

static int
do_exit_browser(struct hist_browser *browser __maybe_unused,
		struct popup_action *act __maybe_unused)
{
	return 0;
}

static int
add_exit_opt(struct hist_browser *browser __maybe_unused,
	     struct popup_action *act, char **optstr)
{
	if (asprintf(optstr, "Exit") < 0)
		return 0;

	act->fn = do_exit_browser;
	return 1;
}

1670
static void hist_browser__update_nr_entries(struct hist_browser *hb)
1671 1672 1673 1674
{
	u64 nr_entries = 0;
	struct rb_node *nd = rb_first(&hb->hists->entries);

1675 1676 1677 1678 1679
	if (hb->min_pcnt == 0) {
		hb->nr_non_filtered_entries = hb->hists->nr_non_filtered_entries;
		return;
	}

1680
	while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {
1681
		nr_entries++;
1682
		nd = rb_next(nd);
1683 1684
	}

1685
	hb->nr_non_filtered_entries = nr_entries;
1686
}
1687

1688
static int perf_evsel__hists_browse(struct perf_evsel *evsel, int nr_events,
1689
				    const char *helpline,
1690
				    bool left_exits,
1691
				    struct hist_browser_timer *hbt,
1692
				    float min_pcnt,
1693
				    struct perf_session_env *env)
1694
{
1695
	struct hists *hists = evsel__hists(evsel);
1696
	struct hist_browser *browser = hist_browser__new(hists, hbt, env);
1697
	struct branch_info *bi;
1698 1699
#define MAX_OPTIONS  16
	char *options[MAX_OPTIONS];
1700
	struct popup_action actions[MAX_OPTIONS];
1701
	int nr_options = 0;
1702
	int key = -1;
1703
	char buf[64];
1704
	int delay_secs = hbt ? hbt->refresh : 0;
1705
	struct perf_hpp_fmt *fmt;
1706

1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720
#define HIST_BROWSER_HELP_COMMON					\
	"h/?/F1        Show this window\n"				\
	"UP/DOWN/PGUP\n"						\
	"PGDN/SPACE    Navigate\n"					\
	"q/ESC/CTRL+C  Exit browser\n\n"				\
	"For multiple event sessions:\n\n"				\
	"TAB/UNTAB     Switch events\n\n"				\
	"For symbolic views (--sort has sym):\n\n"			\
	"->            Zoom into DSO/Threads & Annotate current symbol\n" \
	"<-            Zoom out\n"					\
	"a             Annotate current symbol\n"			\
	"C             Collapse all callchains\n"			\
	"d             Zoom into current DSO\n"				\
	"E             Expand all callchains\n"				\
1721
	"F             Toggle percentage of filtered entries\n"		\
1722
	"H             Display column headers\n"			\
1723 1724 1725

	/* help messages are sorted by lexical order of the hotkey */
	const char report_help[] = HIST_BROWSER_HELP_COMMON
1726
	"i             Show header information\n"
1727 1728 1729 1730 1731 1732 1733 1734 1735 1736
	"P             Print histograms to perf.hist.N\n"
	"r             Run available scripts\n"
	"s             Switch to another data file in PWD\n"
	"t             Zoom into current Thread\n"
	"V             Verbose (DSO names in callchains, etc)\n"
	"/             Filter symbol by name";
	const char top_help[] = HIST_BROWSER_HELP_COMMON
	"P             Print histograms to perf.hist.N\n"
	"t             Zoom into current Thread\n"
	"V             Verbose (DSO names in callchains, etc)\n"
1737
	"z             Toggle zeroing of samples\n"
1738
	"f             Enable/Disable events\n"
1739 1740
	"/             Filter symbol by name";

1741 1742 1743
	if (browser == NULL)
		return -1;

1744 1745 1746 1747
	/* reset abort key so that it can get Ctrl-C as a key */
	SLang_reset_tty();
	SLang_init_tty(0, 0, 0);

1748 1749
	if (min_pcnt) {
		browser->min_pcnt = min_pcnt;
1750
		hist_browser__update_nr_entries(browser);
1751 1752
	}

1753 1754
	browser->pstack = pstack__new(2);
	if (browser->pstack == NULL)
1755 1756 1757 1758
		goto out;

	ui_helpline__push(helpline);

1759
	memset(options, 0, sizeof(options));
1760
	memset(actions, 0, sizeof(actions));
1761

1762 1763 1764
	perf_hpp__for_each_format(fmt)
		perf_hpp__reset_width(fmt, hists);

1765 1766 1767
	if (symbol_conf.col_width_list_str)
		perf_hpp__set_user_width(symbol_conf.col_width_list_str);

1768
	while (1) {
1769
		struct thread *thread = NULL;
1770
		struct dso *dso = NULL;
1771
		int choice = 0;
1772

1773 1774
		nr_options = 0;

1775
		key = hist_browser__run(browser, helpline);
1776

1777 1778 1779 1780
		if (browser->he_selection != NULL) {
			thread = hist_browser__selected_thread(browser);
			dso = browser->selection->map ? browser->selection->map->dso : NULL;
		}
1781
		switch (key) {
1782 1783
		case K_TAB:
		case K_UNTAB:
1784 1785
			if (nr_events == 1)
				continue;
1786 1787 1788 1789 1790 1791
			/*
			 * Exit the browser, let hists__browser_tree
			 * go to the next or previous
			 */
			goto out_free_stack;
		case 'a':
1792
			if (!sort__has_sym) {
1793
				ui_browser__warning(&browser->b, delay_secs * 2,
1794
			"Annotation is only available for symbolic views, "
1795
			"include \"sym*\" in --sort to use it.");
1796 1797 1798
				continue;
			}

1799
			if (browser->selection == NULL ||
1800
			    browser->selection->sym == NULL ||
1801
			    browser->selection->map->dso->annotate_warned)
1802
				continue;
1803

1804 1805 1806
			actions->ms.map = browser->selection->map;
			actions->ms.sym = browser->selection->sym;
			do_annotate(browser, actions);
1807
			continue;
1808 1809 1810
		case 'P':
			hist_browser__dump(browser);
			continue;
1811
		case 'd':
1812 1813
			actions->dso = dso;
			do_zoom_dso(browser, actions);
1814
			continue;
1815 1816 1817
		case 'V':
			browser->show_dso = !browser->show_dso;
			continue;
1818
		case 't':
1819 1820
			actions->thread = thread;
			do_zoom_thread(browser, actions);
1821
			continue;
1822
		case '/':
1823 1824 1825 1826
			if (ui_browser__input_window("Symbol to show",
					"Please enter the name of symbol you want to see",
					buf, "ENTER: OK, ESC: Cancel",
					delay_secs * 2) == K_ENTER) {
1827 1828
				hists->symbol_filter_str = *buf ? buf : NULL;
				hists__filter_by_symbol(hists);
1829 1830 1831
				hist_browser__reset(browser);
			}
			continue;
1832
		case 'r':
1833 1834 1835 1836 1837
			if (is_report_browser(hbt)) {
				actions->thread = NULL;
				actions->ms.sym = NULL;
				do_run_script(browser, actions);
			}
1838
			continue;
1839
		case 's':
1840
			if (is_report_browser(hbt)) {
1841
				key = do_switch_data(browser, actions);
1842 1843 1844
				if (key == K_SWITCH_INPUT_DATA)
					goto out_free_stack;
			}
1845
			continue;
1846 1847 1848 1849 1850
		case 'i':
			/* env->arch is NULL for live-mode (i.e. perf top) */
			if (env->arch)
				tui__header_window(env);
			continue;
1851 1852 1853
		case 'F':
			symbol_conf.filter_relative ^= 1;
			continue;
1854 1855 1856 1857 1858 1859 1860
		case 'z':
			if (!is_report_browser(hbt)) {
				struct perf_top *top = hbt->arg;

				top->zero = !top->zero;
			}
			continue;
1861
		case K_F1:
1862 1863
		case 'h':
		case '?':
1864
			ui_browser__help_window(&browser->b,
1865
				is_report_browser(hbt) ? report_help : top_help);
1866
			continue;
1867 1868
		case K_ENTER:
		case K_RIGHT:
1869 1870
			/* menu */
			break;
1871
		case K_LEFT: {
1872
			const void *top;
1873

1874
			if (pstack__empty(browser->pstack)) {
1875 1876 1877 1878 1879
				/*
				 * Go back to the perf_evsel_menu__run or other user
				 */
				if (left_exits)
					goto out_free_stack;
1880
				continue;
1881
			}
1882
			top = pstack__peek(browser->pstack);
1883
			if (top == &browser->hists->dso_filter) {
1884 1885 1886 1887 1888 1889
				/*
				 * No need to set actions->dso here since
				 * it's just to remove the current filter.
				 * Ditto for thread below.
				 */
				do_zoom_dso(browser, actions);
1890
			}
1891 1892
			if (top == &browser->hists->thread_filter)
				do_zoom_thread(browser, actions);
1893 1894
			continue;
		}
1895
		case K_ESC:
1896
			if (!left_exits &&
1897 1898
			    !ui_browser__dialog_yesno(&browser->b,
					       "Do you really want to exit?"))
1899 1900
				continue;
			/* Fall thru */
1901 1902
		case 'q':
		case CTRL('c'):
1903
			goto out_free_stack;
1904
		case 'f':
1905 1906 1907
			if (!is_report_browser(hbt))
				goto out_free_stack;
			/* Fall thru */
1908
		default:
1909
			helpline = "Press '?' for help on key bindings";
1910
			continue;
1911 1912
		}

1913
		if (!sort__has_sym)
1914 1915
			goto add_exit_option;

1916 1917 1918
		if (browser->selection == NULL)
			goto skip_annotation;

1919
		if (sort__mode == SORT_MODE__BRANCH) {
1920
			bi = browser->he_selection->branch_info;
1921 1922 1923 1924

			if (bi == NULL)
				goto skip_annotation;

1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935
			nr_options += add_annotate_opt(browser,
						       &actions[nr_options],
						       &options[nr_options],
						       bi->from.map,
						       bi->from.sym);
			if (bi->to.sym != bi->from.sym)
				nr_options += add_annotate_opt(browser,
							&actions[nr_options],
							&options[nr_options],
							bi->to.map,
							bi->to.sym);
1936
		} else {
1937 1938 1939 1940 1941
			nr_options += add_annotate_opt(browser,
						       &actions[nr_options],
						       &options[nr_options],
						       browser->selection->map,
						       browser->selection->sym);
1942
		}
1943
skip_annotation:
1944 1945 1946 1947 1948 1949 1950
		nr_options += add_thread_opt(browser, &actions[nr_options],
					     &options[nr_options], thread);
		nr_options += add_dso_opt(browser, &actions[nr_options],
					  &options[nr_options], dso);
		nr_options += add_map_opt(browser, &actions[nr_options],
					  &options[nr_options],
					  browser->selection->map);
1951 1952 1953

		/* perf script support */
		if (browser->he_selection) {
1954 1955 1956 1957 1958 1959 1960 1961
			nr_options += add_script_opt(browser,
						     &actions[nr_options],
						     &options[nr_options],
						     thread, NULL);
			nr_options += add_script_opt(browser,
						     &actions[nr_options],
						     &options[nr_options],
						     NULL, browser->selection->sym);
1962
		}
1963 1964 1965 1966
		nr_options += add_script_opt(browser, &actions[nr_options],
					     &options[nr_options], NULL, NULL);
		nr_options += add_switch_opt(browser, &actions[nr_options],
					     &options[nr_options]);
1967
add_exit_option:
1968 1969
		nr_options += add_exit_opt(browser, &actions[nr_options],
					   &options[nr_options]);
1970

1971 1972
		do {
			struct popup_action *act;
1973

1974 1975 1976
			choice = ui__popup_menu(nr_options, options);
			if (choice == -1 || choice >= nr_options)
				break;
1977

1978 1979 1980
			act = &actions[choice];
			key = act->fn(browser, act);
		} while (key == 1);
1981

1982 1983
		if (key == K_SWITCH_INPUT_DATA)
			break;
1984 1985
	}
out_free_stack:
1986
	pstack__delete(browser->pstack);
1987 1988
out:
	hist_browser__delete(browser);
1989
	free_popup_options(options, MAX_OPTIONS);
1990 1991 1992
	return key;
}

1993 1994 1995
struct perf_evsel_menu {
	struct ui_browser b;
	struct perf_evsel *selection;
1996
	bool lost_events, lost_events_warned;
1997
	float min_pcnt;
1998
	struct perf_session_env *env;
1999 2000 2001 2002 2003 2004 2005 2006
};

static void perf_evsel_menu__write(struct ui_browser *browser,
				   void *entry, int row)
{
	struct perf_evsel_menu *menu = container_of(browser,
						    struct perf_evsel_menu, b);
	struct perf_evsel *evsel = list_entry(entry, struct perf_evsel, node);
2007
	struct hists *hists = evsel__hists(evsel);
2008
	bool current_entry = ui_browser__is_current_entry(browser, row);
2009
	unsigned long nr_events = hists->stats.nr_events[PERF_RECORD_SAMPLE];
2010
	const char *ev_name = perf_evsel__name(evsel);
2011
	char bf[256], unit;
2012 2013
	const char *warn = " ";
	size_t printed;
2014 2015 2016 2017

	ui_browser__set_color(browser, current_entry ? HE_COLORSET_SELECTED :
						       HE_COLORSET_NORMAL);

2018
	if (perf_evsel__is_group_event(evsel)) {
2019 2020 2021 2022 2023
		struct perf_evsel *pos;

		ev_name = perf_evsel__group_name(evsel);

		for_each_group_member(pos, evsel) {
2024 2025
			struct hists *pos_hists = evsel__hists(pos);
			nr_events += pos_hists->stats.nr_events[PERF_RECORD_SAMPLE];
2026 2027 2028
		}
	}

2029
	nr_events = convert_unit(nr_events, &unit);
2030
	printed = scnprintf(bf, sizeof(bf), "%lu%c%s%s", nr_events,
2031 2032 2033
			   unit, unit == ' ' ? "" : " ", ev_name);
	slsmg_printf("%s", bf);

2034
	nr_events = hists->stats.nr_events[PERF_RECORD_LOST];
2035 2036 2037 2038 2039
	if (nr_events != 0) {
		menu->lost_events = true;
		if (!current_entry)
			ui_browser__set_color(browser, HE_COLORSET_TOP);
		nr_events = convert_unit(nr_events, &unit);
2040 2041
		printed += scnprintf(bf, sizeof(bf), ": %ld%c%schunks LOST!",
				     nr_events, unit, unit == ' ' ? "" : " ");
2042 2043 2044 2045
		warn = bf;
	}

	slsmg_write_nstring(warn, browser->width - printed);
2046 2047 2048 2049 2050

	if (current_entry)
		menu->selection = evsel;
}

2051 2052
static int perf_evsel_menu__run(struct perf_evsel_menu *menu,
				int nr_events, const char *help,
2053
				struct hist_browser_timer *hbt)
2054
{
2055
	struct perf_evlist *evlist = menu->b.priv;
2056
	struct perf_evsel *pos;
2057
	const char *title = "Available samples";
2058
	int delay_secs = hbt ? hbt->refresh : 0;
2059
	int key;
2060

2061 2062 2063 2064 2065
	if (ui_browser__show(&menu->b, title,
			     "ESC: exit, ENTER|->: Browse histograms") < 0)
		return -1;

	while (1) {
2066
		key = ui_browser__run(&menu->b, delay_secs);
2067 2068

		switch (key) {
2069
		case K_TIMER:
2070
			hbt->timer(hbt->arg);
2071 2072 2073 2074 2075

			if (!menu->lost_events_warned && menu->lost_events) {
				ui_browser__warn_lost_events(&menu->b);
				menu->lost_events_warned = true;
			}
2076
			continue;
2077 2078
		case K_RIGHT:
		case K_ENTER:
2079 2080 2081 2082
			if (!menu->selection)
				continue;
			pos = menu->selection;
browse_hists:
2083 2084 2085 2086 2087
			perf_evlist__set_selected(evlist, pos);
			/*
			 * Give the calling tool a chance to populate the non
			 * default evsel resorted hists tree.
			 */
2088 2089
			if (hbt)
				hbt->timer(hbt->arg);
2090
			key = perf_evsel__hists_browse(pos, nr_events, help,
2091
						       true, hbt,
2092
						       menu->min_pcnt,
2093
						       menu->env);
2094
			ui_browser__show_title(&menu->b, title);
2095
			switch (key) {
2096
			case K_TAB:
2097
				if (pos->node.next == &evlist->entries)
2098
					pos = perf_evlist__first(evlist);
2099
				else
2100
					pos = perf_evsel__next(pos);
2101
				goto browse_hists;
2102
			case K_UNTAB:
2103
				if (pos->node.prev == &evlist->entries)
2104
					pos = perf_evlist__last(evlist);
2105
				else
2106
					pos = perf_evsel__prev(pos);
2107
				goto browse_hists;
2108
			case K_ESC:
2109 2110
				if (!ui_browser__dialog_yesno(&menu->b,
						"Do you really want to exit?"))
2111 2112
					continue;
				/* Fall thru */
2113
			case K_SWITCH_INPUT_DATA:
2114 2115 2116 2117 2118 2119
			case 'q':
			case CTRL('c'):
				goto out;
			default:
				continue;
			}
2120
		case K_LEFT:
2121
			continue;
2122
		case K_ESC:
2123 2124
			if (!ui_browser__dialog_yesno(&menu->b,
					       "Do you really want to exit?"))
2125 2126
				continue;
			/* Fall thru */
2127 2128 2129
		case 'q':
		case CTRL('c'):
			goto out;
2130
		default:
2131
			continue;
2132 2133 2134
		}
	}

2135 2136 2137 2138 2139
out:
	ui_browser__hide(&menu->b);
	return key;
}

2140
static bool filter_group_entries(struct ui_browser *browser __maybe_unused,
2141 2142 2143 2144 2145 2146 2147 2148 2149 2150
				 void *entry)
{
	struct perf_evsel *evsel = list_entry(entry, struct perf_evsel, node);

	if (symbol_conf.event_group && !perf_evsel__is_group_leader(evsel))
		return true;

	return false;
}

2151
static int __perf_evlist__tui_browse_hists(struct perf_evlist *evlist,
2152
					   int nr_entries, const char *help,
2153
					   struct hist_browser_timer *hbt,
2154
					   float min_pcnt,
2155
					   struct perf_session_env *env)
2156 2157 2158 2159 2160 2161 2162 2163
{
	struct perf_evsel *pos;
	struct perf_evsel_menu menu = {
		.b = {
			.entries    = &evlist->entries,
			.refresh    = ui_browser__list_head_refresh,
			.seek	    = ui_browser__list_head_seek,
			.write	    = perf_evsel_menu__write,
2164 2165
			.filter	    = filter_group_entries,
			.nr_entries = nr_entries,
2166 2167
			.priv	    = evlist,
		},
2168
		.min_pcnt = min_pcnt,
2169
		.env = env,
2170 2171 2172 2173
	};

	ui_helpline__push("Press ESC to exit");

2174
	evlist__for_each(evlist, pos) {
2175
		const char *ev_name = perf_evsel__name(pos);
2176 2177 2178 2179 2180 2181
		size_t line_len = strlen(ev_name) + 7;

		if (menu.b.width < line_len)
			menu.b.width = line_len;
	}

2182
	return perf_evsel_menu__run(&menu, nr_entries, help, hbt);
2183 2184
}

2185
int perf_evlist__tui_browse_hists(struct perf_evlist *evlist, const char *help,
2186
				  struct hist_browser_timer *hbt,
2187
				  float min_pcnt,
2188
				  struct perf_session_env *env)
2189
{
2190 2191 2192 2193
	int nr_entries = evlist->nr_entries;

single_entry:
	if (nr_entries == 1) {
2194
		struct perf_evsel *first = perf_evlist__first(evlist);
2195 2196

		return perf_evsel__hists_browse(first, nr_entries, help,
2197
						false, hbt, min_pcnt,
2198
						env);
2199 2200
	}

2201 2202 2203 2204
	if (symbol_conf.event_group) {
		struct perf_evsel *pos;

		nr_entries = 0;
2205
		evlist__for_each(evlist, pos) {
2206 2207
			if (perf_evsel__is_group_leader(pos))
				nr_entries++;
2208
		}
2209 2210 2211 2212 2213 2214

		if (nr_entries == 1)
			goto single_entry;
	}

	return __perf_evlist__tui_browse_hists(evlist, nr_entries, help,
2215
					       hbt, min_pcnt, env);
2216
}