hists.c 51.0 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
	int		     print_seq;
29
	bool		     show_dso;
30
	bool		     show_headers;
31
	float		     min_pcnt;
32
	u64		     nr_non_filtered_entries;
33
	u64		     nr_callchain_rows;
34 35
};

36 37
extern void hist_browser__init_hpp(void);

38 39 40
static int hists__browser_title(struct hists *hists,
				struct hist_browser_timer *hbt,
				char *bf, size_t size);
41
static void hist_browser__update_nr_entries(struct hist_browser *hb);
42

43 44 45
static struct rb_node *hists__filter_entries(struct rb_node *nd,
					     float min_pcnt);

46 47 48 49 50
static bool hist_browser__has_filter(struct hist_browser *hb)
{
	return hists__has_filter(hb->hists) || hb->min_pcnt;
}

51 52 53 54 55 56 57 58 59 60 61 62
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;

	return nr_entries + hb->nr_callchain_rows;
}

63 64 65 66 67 68 69 70 71 72 73 74 75 76 77
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;
}

78
static void hist_browser__refresh_dimensions(struct ui_browser *browser)
79
{
80 81
	struct hist_browser *hb = container_of(browser, struct hist_browser, b);

82
	/* 3 == +/- toggle symbol before actual hist_entry rendering */
83 84 85 86 87 88 89 90
	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);
91
	hist_browser__update_rows(hb);
92 93
}

94 95
static void hist_browser__gotorc(struct hist_browser *browser, int row, int column)
{
96 97 98
	u16 header_offset = browser->show_headers ? 1 : 0;

	ui_browser__gotorc(&browser->b, row + header_offset, column);
99 100
}

101
static void hist_browser__reset(struct hist_browser *browser)
102
{
103 104 105 106 107 108
	/*
	 * The hists__remove_entry_filter() already folds non-filtered
	 * entries so we can assume it has 0 callchain rows.
	 */
	browser->nr_callchain_rows = 0;

109
	hist_browser__update_nr_entries(browser);
110
	browser->b.nr_entries = hist_browser__nr_entries(browser);
111
	hist_browser__refresh_dimensions(&browser->b);
112
	ui_browser__reset_index(&browser->b);
113 114 115 116 117 118 119
}

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

120
static char map_symbol__folded(const struct map_symbol *ms)
121
{
122
	return ms->has_children ? tree__folded_sign(ms->unfolded) : ' ';
123 124
}

125
static char hist_entry__folded(const struct hist_entry *he)
126
{
127
	return map_symbol__folded(&he->ms);
128 129
}

130
static char callchain_list__folded(const struct callchain_list *cl)
131
{
132
	return map_symbol__folded(&cl->ms);
133 134
}

135
static void map_symbol__set_folding(struct map_symbol *ms, bool unfold)
136
{
137
	ms->unfolded = unfold ? ms->has_children : false;
138 139
}

140
static int callchain_node__count_rows_rb_tree(struct callchain_node *node)
141 142 143 144
{
	int n = 0;
	struct rb_node *nd;

145
	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 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 190 191 192 193 194
		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;
		unfolded = chain->ms.unfolded;
	}

	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;
}

195
static bool map_symbol__toggle_fold(struct map_symbol *ms)
196
{
197
	if (!ms)
198 199
		return false;

200
	if (!ms->has_children)
201 202
		return false;

203
	ms->unfolded = !ms->unfolded;
204 205 206
	return true;
}

207
static void callchain_node__init_have_children_rb_tree(struct callchain_node *node)
208
{
209
	struct rb_node *nd = rb_first(&node->rb_root);
210

211
	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
212 213
		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
		struct callchain_list *chain;
214
		bool first = true;
215 216 217 218 219

		list_for_each_entry(chain, &child->val, list) {
			if (first) {
				first = false;
				chain->ms.has_children = chain->list.next != &child->val ||
220
							 !RB_EMPTY_ROOT(&child->rb_root);
221 222
			} else
				chain->ms.has_children = chain->list.next == &child->val &&
223
							 !RB_EMPTY_ROOT(&child->rb_root);
224 225 226 227 228 229
		}

		callchain_node__init_have_children_rb_tree(child);
	}
}

230 231
static void callchain_node__init_have_children(struct callchain_node *node,
					       bool has_sibling)
232 233 234
{
	struct callchain_list *chain;

235 236 237
	chain = list_entry(node->val.next, struct callchain_list, list);
	chain->ms.has_children = has_sibling;

238 239
	if (!list_empty(&node->val)) {
		chain = list_entry(node->val.prev, struct callchain_list, list);
240
		chain->ms.has_children = !RB_EMPTY_ROOT(&node->rb_root);
241
	}
242

243
	callchain_node__init_have_children_rb_tree(node);
244 245
}

246
static void callchain__init_have_children(struct rb_root *root)
247
{
248 249
	struct rb_node *nd = rb_first(root);
	bool has_sibling = nd && rb_next(nd);
250

251
	for (nd = rb_first(root); nd; nd = rb_next(nd)) {
252
		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
253
		callchain_node__init_have_children(node, has_sibling);
254 255 256
	}
}

257
static void hist_entry__init_have_children(struct hist_entry *he)
258
{
259 260 261 262
	if (!he->init_have_children) {
		he->ms.has_children = !RB_EMPTY_ROOT(&he->sorted_chain);
		callchain__init_have_children(&he->sorted_chain);
		he->init_have_children = true;
263 264 265
	}
}

266
static bool hist_browser__toggle_fold(struct hist_browser *browser)
267
{
268 269
	if (map_symbol__toggle_fold(browser->selection)) {
		struct hist_entry *he = browser->he_selection;
270 271

		hist_entry__init_have_children(he);
272 273
		browser->b.nr_entries -= he->nr_rows;
		browser->nr_callchain_rows -= he->nr_rows;
274 275 276 277 278

		if (he->ms.unfolded)
			he->nr_rows = callchain__count_rows(&he->sorted_chain);
		else
			he->nr_rows = 0;
279 280 281

		browser->b.nr_entries += he->nr_rows;
		browser->nr_callchain_rows += he->nr_rows;
282 283 284 285 286 287 288 289

		return true;
	}

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

290
static int callchain_node__set_folding_rb_tree(struct callchain_node *node, bool unfold)
291 292 293 294
{
	int n = 0;
	struct rb_node *nd;

295
	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343
		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;
			map_symbol__set_folding(&chain->ms, unfold);
			has_children = chain->ms.has_children;
		}

		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;
		map_symbol__set_folding(&chain->ms, unfold);
		has_children = chain->ms.has_children;
	}

	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;
}

344
static void hist_entry__set_folding(struct hist_entry *he, bool unfold)
345
{
346 347
	hist_entry__init_have_children(he);
	map_symbol__set_folding(&he->ms, unfold);
348

349 350 351
	if (he->ms.has_children) {
		int n = callchain__set_folding(&he->sorted_chain, unfold);
		he->nr_rows = unfold ? n : 0;
352
	} else
353
		he->nr_rows = 0;
354 355
}

356 357
static void
__hist_browser__set_folding(struct hist_browser *browser, bool unfold)
358 359
{
	struct rb_node *nd;
360
	struct hists *hists = browser->hists;
361

362
	for (nd = rb_first(&hists->entries);
363
	     (nd = hists__filter_entries(nd, browser->min_pcnt)) != NULL;
364
	     nd = rb_next(nd)) {
365 366
		struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node);
		hist_entry__set_folding(he, unfold);
367
		browser->nr_callchain_rows += he->nr_rows;
368 369 370
	}
}

371
static void hist_browser__set_folding(struct hist_browser *browser, bool unfold)
372
{
373 374 375 376
	browser->nr_callchain_rows = 0;
	__hist_browser__set_folding(browser, unfold);

	browser->b.nr_entries = hist_browser__nr_entries(browser);
377
	/* Go to the start, we may be way after valid entries after a collapse */
378
	ui_browser__reset_index(&browser->b);
379 380
}

381 382 383 384 385 386 387 388 389
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.");
}

390
static int hist_browser__run(struct hist_browser *browser,
391
			     struct hist_browser_timer *hbt)
392
{
393
	int key;
394
	char title[160];
395
	int delay_secs = hbt ? hbt->refresh : 0;
396

397
	browser->b.entries = &browser->hists->entries;
398
	browser->b.nr_entries = hist_browser__nr_entries(browser);
399

400
	hists__browser_title(browser->hists, hbt, title, sizeof(title));
401

402
	if (ui_browser__show(&browser->b, title,
403
			     "Press '?' for help on key bindings") < 0)
404 405 406
		return -1;

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

409
		switch (key) {
410 411
		case K_TIMER: {
			u64 nr_entries;
412
			hbt->timer(hbt->arg);
413

414
			if (hist_browser__has_filter(browser))
415
				hist_browser__update_nr_entries(browser);
416

417
			nr_entries = hist_browser__nr_entries(browser);
418
			ui_browser__update_nr_entries(&browser->b, nr_entries);
419

420 421 422 423 424
			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);
425 426
			}

427 428
			hists__browser_title(browser->hists,
					     hbt, title, sizeof(title));
429
			ui_browser__show_title(&browser->b, title);
430
			continue;
431
		}
432
		case 'D': { /* Debug */
433
			static int seq;
434
			struct hist_entry *h = rb_entry(browser->b.top,
435 436
							struct hist_entry, rb_node);
			ui_helpline__pop();
437
			ui_helpline__fpush("%d: nr_ent=(%d,%d), rows=%d, idx=%d, fve: idx=%d, row_off=%d, nrows=%d",
438 439
					   seq++, browser->b.nr_entries,
					   browser->hists->nr_entries,
440
					   browser->b.rows,
441 442
					   browser->b.index,
					   browser->b.top_idx,
443 444
					   h->row_offset, h->nr_rows);
		}
445 446 447
			break;
		case 'C':
			/* Collapse the whole world. */
448
			hist_browser__set_folding(browser, false);
449 450 451
			break;
		case 'E':
			/* Expand the whole world. */
452
			hist_browser__set_folding(browser, true);
453
			break;
454 455 456 457
		case 'H':
			browser->show_headers = !browser->show_headers;
			hist_browser__update_rows(browser);
			break;
458
		case K_ENTER:
459
			if (hist_browser__toggle_fold(browser))
460 461 462
				break;
			/* fall thru */
		default:
463
			goto out;
464 465
		}
	}
466
out:
467
	ui_browser__hide(&browser->b);
468
	return key;
469 470
}

471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486
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);

487 488
static void hist_browser__show_callchain_entry(struct hist_browser *browser,
					       struct callchain_list *chain,
489 490 491
					       const char *str, int offset,
					       unsigned short row,
					       struct callchain_print_arg *arg)
492 493
{
	int color, width;
494
	char folded_sign = callchain_list__folded(chain);
495 496 497 498 499 500

	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;
501
		arg->is_current_entry = true;
502 503 504 505 506 507 508 509 510
	}

	ui_browser__set_color(&browser->b, color);
	hist_browser__gotorc(browser, row, 0);
	slsmg_write_nstring(" ", offset);
	slsmg_printf("%c ", folded_sign);
	slsmg_write_nstring(str, width);
}

511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537
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;
}

538 539
#define LEVEL_OFFSET_STEP 3

540 541
static int hist_browser__show_callchain(struct hist_browser *browser,
					struct rb_root *root, int level,
542 543 544 545
					unsigned short row, u64 total,
					print_callchain_entry_fn print,
					struct callchain_print_arg *arg,
					check_output_full_fn is_output_full)
546 547
{
	struct rb_node *node;
548
	int first_row = row, offset = level * LEVEL_OFFSET_STEP;
549
	u64 new_total;
550
	bool need_percent;
551

552
	node = rb_first(root);
553
	need_percent = node && rb_next(node);
554

555 556 557
	while (node) {
		struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);
		struct rb_node *next = rb_next(node);
558
		u64 cumul = callchain_cumul_hits(child);
559 560 561 562 563 564
		struct callchain_list *chain;
		char folded_sign = ' ';
		int first = true;
		int extra_offset = 0;

		list_for_each_entry(chain, &child->val, list) {
565
			char bf[1024], *alloc_str;
566 567 568
			const char *str;
			bool was_first = first;

569
			if (first)
570
				first = false;
571
			else if (need_percent)
572 573 574
				extra_offset = LEVEL_OFFSET_STEP;

			folded_sign = callchain_list__folded(chain);
575 576
			if (arg->row_offset != 0) {
				arg->row_offset--;
577 578 579 580
				goto do_next;
			}

			alloc_str = NULL;
581 582
			str = callchain_list__sym_name(chain, bf, sizeof(bf),
						       browser->show_dso);
583

584
			if (was_first && need_percent) {
585
				double percent = cumul * 100.0 / total;
586 587 588 589 590 591 592

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

593 594
			print(browser, chain, str, offset + extra_offset, row, arg);

595 596
			free(alloc_str);

597
			if (is_output_full(browser, ++row))
598 599 600 601 602 603 604 605 606
				goto out;
do_next:
			if (folded_sign == '+')
				break;
		}

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

607 608 609 610
			if (callchain_param.mode == CHAIN_GRAPH_REL)
				new_total = child->children_hit;
			else
				new_total = total;
611

612
			row += hist_browser__show_callchain(browser, &child->rb_root,
613 614
							    new_level, row, new_total,
							    print, arg, is_output_full);
615
		}
616
		if (is_output_full(browser, row))
617
			break;
618
		node = next;
619
	}
620
out:
621 622 623
	return row - first_row;
}

624 625 626 627 628 629
struct hpp_arg {
	struct ui_browser *b;
	char folded_sign;
	bool current_entry;
};

630 631 632
static int __hpp__slsmg_color_printf(struct perf_hpp *hpp, const char *fmt, ...)
{
	struct hpp_arg *arg = hpp->ptr;
633
	int ret, len;
634 635
	va_list args;
	double percent;
636

637
	va_start(args, fmt);
638
	len = va_arg(args, int);
639 640
	percent = va_arg(args, double);
	va_end(args);
641

642
	ui_browser__set_percent_color(arg->b, percent, arg->current_entry);
643

644
	ret = scnprintf(hpp->buf, hpp->size, fmt, len, percent);
645
	slsmg_printf("%s", hpp->buf);
646

647
	advance_hpp(hpp, ret);
648 649 650
	return ret;
}

651
#define __HPP_COLOR_PERCENT_FN(_type, _field)				\
652 653 654 655 656
static u64 __hpp_get_##_field(struct hist_entry *he)			\
{									\
	return he->stat._field;						\
}									\
									\
657
static int								\
658
hist_browser__hpp_color_##_type(struct perf_hpp_fmt *fmt,		\
659 660
				struct perf_hpp *hpp,			\
				struct hist_entry *he)			\
661
{									\
662 663
	return hpp__fmt(fmt, hpp, he, __hpp_get_##_field, " %*.2f%%",	\
			__hpp__slsmg_color_printf, true);		\
664 665
}

666 667 668 669 670 671 672
#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								\
673
hist_browser__hpp_color_##_type(struct perf_hpp_fmt *fmt,		\
674 675 676 677
				struct perf_hpp *hpp,			\
				struct hist_entry *he)			\
{									\
	if (!symbol_conf.cumulate_callchain) {				\
678
		int len = fmt->user_len ?: fmt->len;			\
679
		int ret = scnprintf(hpp->buf, hpp->size,		\
680
				    "%*s", len, "N/A");			\
681 682 683 684
		slsmg_printf("%s", hpp->buf);				\
									\
		return ret;						\
	}								\
685 686
	return hpp__fmt(fmt, hpp, he, __hpp_get_acc_##_field,		\
			" %*.2f%%", __hpp__slsmg_color_printf, true);	\
687 688
}

689 690 691 692 693
__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)
694
__HPP_COLOR_ACC_PERCENT_FN(overhead_acc, period)
695

696
#undef __HPP_COLOR_PERCENT_FN
697
#undef __HPP_COLOR_ACC_PERCENT_FN
698 699 700 701 702 703 704 705 706 707 708 709 710

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;
711 712
	perf_hpp__format[PERF_HPP__OVERHEAD_ACC].color =
				hist_browser__hpp_color_overhead_acc;
713 714
}

715
static int hist_browser__show_entry(struct hist_browser *browser,
716 717 718 719
				    struct hist_entry *entry,
				    unsigned short row)
{
	char s[256];
720
	int printed = 0;
721
	int width = browser->b.width;
722
	char folded_sign = ' ';
723
	bool current_entry = ui_browser__is_current_entry(&browser->b, row);
724
	off_t row_offset = entry->row_offset;
725
	bool first = true;
726
	struct perf_hpp_fmt *fmt;
727 728

	if (current_entry) {
729 730
		browser->he_selection = entry;
		browser->selection = &entry->ms;
731 732 733
	}

	if (symbol_conf.use_callchain) {
734
		hist_entry__init_have_children(entry);
735 736 737 738
		folded_sign = hist_entry__folded(entry);
	}

	if (row_offset == 0) {
739
		struct hpp_arg arg = {
740
			.b		= &browser->b,
741 742 743
			.folded_sign	= folded_sign,
			.current_entry	= current_entry,
		};
744 745 746
		struct perf_hpp hpp = {
			.buf		= s,
			.size		= sizeof(s),
747
			.ptr		= &arg,
748
		};
749

750
		hist_browser__gotorc(browser, row, 0);
751

752
		perf_hpp__for_each_format(fmt) {
753 754 755
			if (perf_hpp__should_skip(fmt))
				continue;

756 757 758 759 760 761 762 763 764 765 766 767 768 769 770
			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 {
771 772 773
				slsmg_printf("  ");
				width -= 2;
			}
774

775
			if (fmt->color) {
776
				width -= fmt->color(fmt, &hpp, entry);
777
			} else {
778
				width -= fmt->entry(fmt, &hpp, entry);
779 780
				slsmg_printf("%s", s);
			}
781 782
		}

783 784 785 786
		/* The scroll bar isn't being used */
		if (!browser->b.navkeypressed)
			width += 1;

787 788
		slsmg_write_nstring("", width);

789 790 791 792 793
		++row;
		++printed;
	} else
		--row_offset;

794
	if (folded_sign == '-' && row != browser->b.rows) {
795
		u64 total = hists__total_period(entry->hists);
796 797 798 799
		struct callchain_print_arg arg = {
			.row_offset = row_offset,
			.is_current_entry = current_entry,
		};
800

801 802 803 804 805 806 807
		if (callchain_param.mode == CHAIN_GRAPH_REL) {
			if (symbol_conf.cumulate_callchain)
				total = entry->stat_acc->period;
			else
				total = entry->stat.period;
		}

808
		printed += hist_browser__show_callchain(browser,
809 810 811
					&entry->sorted_chain, 1, row, total,
					hist_browser__show_callchain_entry, &arg,
					hist_browser__check_output_full);
812

813
		if (arg.is_current_entry)
814
			browser->he_selection = entry;
815 816 817 818 819
	}

	return printed;
}

820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856
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;
}

857 858
static void hist_browser__show_headers(struct hist_browser *browser)
{
859 860 861
	char headers[1024];

	hists__scnprintf_headers(headers, sizeof(headers), browser->hists);
862 863
	ui_browser__gotorc(&browser->b, 0, 0);
	ui_browser__set_color(&browser->b, HE_COLORSET_ROOT);
864
	slsmg_write_nstring(headers, browser->b.width + 1);
865 866
}

867 868 869 870 871 872 873 874 875 876
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);
	}
}

877
static unsigned int hist_browser__refresh(struct ui_browser *browser)
878 879
{
	unsigned row = 0;
880
	u16 header_offset = 0;
881
	struct rb_node *nd;
882
	struct hist_browser *hb = container_of(browser, struct hist_browser, b);
883

884 885 886 887 888
	if (hb->show_headers) {
		hist_browser__show_headers(hb);
		header_offset = 1;
	}

889
	ui_browser__hists_init_top(browser);
890

891
	for (nd = browser->top; nd; nd = rb_next(nd)) {
892
		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
893
		float percent;
894 895 896 897

		if (h->filtered)
			continue;

898
		percent = hist_entry__get_percent_limit(h);
899 900 901
		if (percent < hb->min_pcnt)
			continue;

902
		row += hist_browser__show_entry(hb, h, row);
903
		if (row == browser->rows)
904 905 906
			break;
	}

907
	return row + header_offset;
908 909
}

910 911
static struct rb_node *hists__filter_entries(struct rb_node *nd,
					     float min_pcnt)
912 913 914
{
	while (nd != NULL) {
		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
915
		float percent = hist_entry__get_percent_limit(h);
916

917
		if (!h->filtered && percent >= min_pcnt)
918 919 920 921 922 923 924 925
			return nd;

		nd = rb_next(nd);
	}

	return NULL;
}

926 927
static struct rb_node *hists__filter_prev_entries(struct rb_node *nd,
						  float min_pcnt)
928 929 930
{
	while (nd != NULL) {
		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
931
		float percent = hist_entry__get_percent_limit(h);
932 933

		if (!h->filtered && percent >= min_pcnt)
934 935 936 937 938 939 940 941
			return nd;

		nd = rb_prev(nd);
	}

	return NULL;
}

942
static void ui_browser__hists_seek(struct ui_browser *browser,
943 944 945 946 947
				   off_t offset, int whence)
{
	struct hist_entry *h;
	struct rb_node *nd;
	bool first = true;
948 949 950
	struct hist_browser *hb;

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

952
	if (browser->nr_entries == 0)
953 954
		return;

955
	ui_browser__hists_init_top(browser);
956

957 958
	switch (whence) {
	case SEEK_SET:
959
		nd = hists__filter_entries(rb_first(browser->entries),
960
					   hb->min_pcnt);
961 962
		break;
	case SEEK_CUR:
963
		nd = browser->top;
964 965
		goto do_offset;
	case SEEK_END:
966
		nd = hists__filter_prev_entries(rb_last(browser->entries),
967
						hb->min_pcnt);
968 969 970 971 972 973 974 975 976 977
		first = false;
		break;
	default:
		return;
	}

	/*
	 * Moves not relative to the first visible entry invalidates its
	 * row_offset:
	 */
978
	h = rb_entry(browser->top, struct hist_entry, rb_node);
979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005
	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);
			if (h->ms.unfolded) {
				u16 remaining = h->nr_rows - h->row_offset;
				if (offset > remaining) {
					offset -= remaining;
					h->row_offset = 0;
				} else {
					h->row_offset += offset;
					offset = 0;
1006
					browser->top = nd;
1007 1008 1009
					break;
				}
			}
1010
			nd = hists__filter_entries(rb_next(nd), hb->min_pcnt);
1011 1012 1013
			if (nd == NULL)
				break;
			--offset;
1014
			browser->top = nd;
1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026
		} while (offset != 0);
	} else if (offset < 0) {
		while (1) {
			h = rb_entry(nd, struct hist_entry, rb_node);
			if (h->ms.unfolded) {
				if (first) {
					if (-offset > h->row_offset) {
						offset += h->row_offset;
						h->row_offset = 0;
					} else {
						h->row_offset += offset;
						offset = 0;
1027
						browser->top = nd;
1028 1029 1030 1031 1032 1033 1034 1035 1036
						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;
1037
						browser->top = nd;
1038 1039 1040 1041 1042
						break;
					}
				}
			}

1043
			nd = hists__filter_prev_entries(rb_prev(nd),
1044
							hb->min_pcnt);
1045 1046 1047
			if (nd == NULL)
				break;
			++offset;
1048
			browser->top = nd;
1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062
			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);
				if (h->ms.unfolded)
					h->row_offset = h->nr_rows;
				break;
			}
			first = false;
		}
	} else {
1063
		browser->top = nd;
1064 1065 1066 1067 1068
		h = rb_entry(nd, struct hist_entry, rb_node);
		h->row_offset = 0;
	}
}

1069
static int hist_browser__fprintf_callchain(struct hist_browser *browser,
1070
					   struct hist_entry *he, FILE *fp)
1071
{
1072 1073 1074 1075
	u64 total = hists__total_period(he->hists);
	struct callchain_print_arg arg  = {
		.fp = fp,
	};
1076

1077 1078
	if (symbol_conf.cumulate_callchain)
		total = he->stat_acc->period;
1079

1080 1081 1082 1083
	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;
1084 1085 1086 1087 1088 1089 1090 1091
}

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 = ' ';
1092 1093 1094 1095 1096 1097 1098
	struct perf_hpp hpp = {
		.buf = s,
		.size = sizeof(s),
	};
	struct perf_hpp_fmt *fmt;
	bool first = true;
	int ret;
1099 1100 1101 1102 1103 1104 1105

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

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

1106
	perf_hpp__for_each_format(fmt) {
1107 1108 1109
		if (perf_hpp__should_skip(fmt))
			continue;

1110 1111 1112 1113 1114
		if (!first) {
			ret = scnprintf(hpp.buf, hpp.size, "  ");
			advance_hpp(&hpp, ret);
		} else
			first = false;
1115

1116 1117 1118
		ret = fmt->entry(fmt, &hpp, he);
		advance_hpp(&hpp, ret);
	}
1119 1120 1121
	printed += fprintf(fp, "%s\n", rtrim(s));

	if (folded_sign == '-')
1122
		printed += hist_browser__fprintf_callchain(browser, he, fp);
1123 1124 1125 1126 1127 1128

	return printed;
}

static int hist_browser__fprintf(struct hist_browser *browser, FILE *fp)
{
1129 1130
	struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries),
						   browser->min_pcnt);
1131 1132 1133 1134 1135 1136
	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);
1137
		nd = hists__filter_entries(rb_next(nd), browser->min_pcnt);
1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163
	}

	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];
1164 1165
		const char *err = strerror_r(errno, bf, sizeof(bf));
		ui_helpline__fpush("Couldn't write to %s: %s", filename, err);
1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176
		return -1;
	}

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

	return 0;
}

1177 1178
static struct hist_browser *hist_browser__new(struct hists *hists)
{
1179
	struct hist_browser *browser = zalloc(sizeof(*browser));
1180

1181 1182 1183
	if (browser) {
		browser->hists = hists;
		browser->b.refresh = hist_browser__refresh;
1184
		browser->b.refresh_dimensions = hist_browser__refresh_dimensions;
1185 1186
		browser->b.seek = ui_browser__hists_seek;
		browser->b.use_navkeypressed = true;
1187
		browser->show_headers = symbol_conf.show_hist_headers;
1188 1189
	}

1190
	return browser;
1191 1192
}

1193
static void hist_browser__delete(struct hist_browser *browser)
1194
{
1195
	free(browser);
1196 1197
}

1198
static struct hist_entry *hist_browser__selected_entry(struct hist_browser *browser)
1199
{
1200
	return browser->he_selection;
1201 1202
}

1203
static struct thread *hist_browser__selected_thread(struct hist_browser *browser)
1204
{
1205
	return browser->he_selection->thread;
1206 1207
}

1208 1209 1210 1211 1212 1213 1214 1215 1216
/* 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)
1217
{
1218 1219
	char unit;
	int printed;
1220 1221 1222 1223
	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;
1224
	struct perf_evsel *evsel = hists_to_evsel(hists);
1225
	const char *ev_name = perf_evsel__name(evsel);
1226 1227 1228
	char buf[512];
	size_t buflen = sizeof(buf);

1229 1230 1231 1232 1233
	if (symbol_conf.filter_relative) {
		nr_samples = hists->stats.nr_non_filtered_samples;
		nr_events = hists->stats.total_non_filtered_period;
	}

1234
	if (perf_evsel__is_group_event(evsel)) {
1235 1236 1237 1238 1239 1240
		struct perf_evsel *pos;

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

		for_each_group_member(pos, evsel) {
1241 1242
			struct hists *pos_hists = evsel__hists(pos);

1243
			if (symbol_conf.filter_relative) {
1244 1245
				nr_samples += pos_hists->stats.nr_non_filtered_samples;
				nr_events += pos_hists->stats.total_non_filtered_period;
1246
			} else {
1247 1248
				nr_samples += pos_hists->stats.nr_events[PERF_RECORD_SAMPLE];
				nr_events += pos_hists->stats.total_period;
1249
			}
1250 1251
		}
	}
1252 1253 1254

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

1258

1259
	if (hists->uid_filter_str)
1260
		printed += snprintf(bf + printed, size - printed,
1261
				    ", UID: %s", hists->uid_filter_str);
1262
	if (thread)
1263
		printed += scnprintf(bf + printed, size - printed,
1264
				    ", Thread: %s(%d)",
1265
				     (thread->comm_set ? thread__comm_str(thread) : ""),
1266
				    thread->tid);
1267
	if (dso)
1268
		printed += scnprintf(bf + printed, size - printed,
1269
				    ", DSO: %s", dso->short_name);
1270 1271 1272 1273 1274 1275 1276
	if (!is_report_browser(hbt)) {
		struct perf_top *top = hbt->arg;

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

1277
	return printed;
1278 1279
}

1280 1281 1282 1283
static inline void free_popup_options(char **options, int n)
{
	int i;

1284 1285
	for (i = 0; i < n; ++i)
		zfree(&options[i]);
1286 1287
}

1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337
/*
 * 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]) {
1338
				zfree(&options[nr_options]);
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
				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;
}

1377
static void hist_browser__update_nr_entries(struct hist_browser *hb)
1378 1379 1380 1381
{
	u64 nr_entries = 0;
	struct rb_node *nd = rb_first(&hb->hists->entries);

1382 1383 1384 1385 1386
	if (hb->min_pcnt == 0) {
		hb->nr_non_filtered_entries = hb->hists->nr_non_filtered_entries;
		return;
	}

1387
	while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {
1388
		nr_entries++;
1389
		nd = rb_next(nd);
1390 1391
	}

1392
	hb->nr_non_filtered_entries = nr_entries;
1393
}
1394

1395
static int perf_evsel__hists_browse(struct perf_evsel *evsel, int nr_events,
1396
				    const char *helpline,
1397
				    bool left_exits,
1398
				    struct hist_browser_timer *hbt,
1399
				    float min_pcnt,
1400
				    struct perf_session_env *env)
1401
{
1402
	struct hists *hists = evsel__hists(evsel);
1403
	struct hist_browser *browser = hist_browser__new(hists);
1404
	struct branch_info *bi;
1405
	struct pstack *fstack;
1406 1407
	char *options[16];
	int nr_options = 0;
1408
	int key = -1;
1409
	char buf[64];
1410
	char script_opt[64];
1411
	int delay_secs = hbt ? hbt->refresh : 0;
1412
	struct perf_hpp_fmt *fmt;
1413

1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427
#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"				\
1428
	"F             Toggle percentage of filtered entries\n"		\
1429
	"H             Display column headers\n"			\
1430 1431 1432

	/* help messages are sorted by lexical order of the hotkey */
	const char report_help[] = HIST_BROWSER_HELP_COMMON
1433
	"i             Show header information\n"
1434 1435 1436 1437 1438 1439 1440 1441 1442 1443
	"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"
1444
	"z             Toggle zeroing of samples\n"
1445 1446
	"/             Filter symbol by name";

1447 1448 1449
	if (browser == NULL)
		return -1;

1450 1451
	if (min_pcnt) {
		browser->min_pcnt = min_pcnt;
1452
		hist_browser__update_nr_entries(browser);
1453 1454
	}

1455 1456 1457 1458 1459 1460
	fstack = pstack__new(2);
	if (fstack == NULL)
		goto out;

	ui_helpline__push(helpline);

1461 1462
	memset(options, 0, sizeof(options));

1463 1464 1465
	perf_hpp__for_each_format(fmt)
		perf_hpp__reset_width(fmt, hists);

1466 1467 1468
	if (symbol_conf.col_width_list_str)
		perf_hpp__set_user_width(symbol_conf.col_width_list_str);

1469
	while (1) {
1470
		struct thread *thread = NULL;
1471
		const struct dso *dso = NULL;
1472
		int choice = 0,
1473
		    annotate = -2, zoom_dso = -2, zoom_thread = -2,
1474
		    annotate_f = -2, annotate_t = -2, browse_map = -2;
1475 1476
		int scripts_comm = -2, scripts_symbol = -2,
		    scripts_all = -2, switch_data = -2;
1477

1478 1479
		nr_options = 0;

1480
		key = hist_browser__run(browser, hbt);
1481

1482 1483 1484 1485
		if (browser->he_selection != NULL) {
			thread = hist_browser__selected_thread(browser);
			dso = browser->selection->map ? browser->selection->map->dso : NULL;
		}
1486
		switch (key) {
1487 1488
		case K_TAB:
		case K_UNTAB:
1489 1490
			if (nr_events == 1)
				continue;
1491 1492 1493 1494 1495 1496
			/*
			 * Exit the browser, let hists__browser_tree
			 * go to the next or previous
			 */
			goto out_free_stack;
		case 'a':
1497
			if (!sort__has_sym) {
1498
				ui_browser__warning(&browser->b, delay_secs * 2,
1499
			"Annotation is only available for symbolic views, "
1500
			"include \"sym*\" in --sort to use it.");
1501 1502 1503
				continue;
			}

1504
			if (browser->selection == NULL ||
1505
			    browser->selection->sym == NULL ||
1506
			    browser->selection->map->dso->annotate_warned)
1507
				continue;
1508
			goto do_annotate;
1509 1510 1511
		case 'P':
			hist_browser__dump(browser);
			continue;
1512 1513
		case 'd':
			goto zoom_dso;
1514 1515 1516
		case 'V':
			browser->show_dso = !browser->show_dso;
			continue;
1517 1518
		case 't':
			goto zoom_thread;
1519
		case '/':
1520 1521 1522 1523
			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) {
1524 1525
				hists->symbol_filter_str = *buf ? buf : NULL;
				hists__filter_by_symbol(hists);
1526 1527 1528
				hist_browser__reset(browser);
			}
			continue;
1529
		case 'r':
1530
			if (is_report_browser(hbt))
1531 1532
				goto do_scripts;
			continue;
1533 1534 1535 1536
		case 's':
			if (is_report_browser(hbt))
				goto do_data_switch;
			continue;
1537 1538 1539 1540 1541
		case 'i':
			/* env->arch is NULL for live-mode (i.e. perf top) */
			if (env->arch)
				tui__header_window(env);
			continue;
1542 1543 1544
		case 'F':
			symbol_conf.filter_relative ^= 1;
			continue;
1545 1546 1547 1548 1549 1550 1551
		case 'z':
			if (!is_report_browser(hbt)) {
				struct perf_top *top = hbt->arg;

				top->zero = !top->zero;
			}
			continue;
1552
		case K_F1:
1553 1554
		case 'h':
		case '?':
1555
			ui_browser__help_window(&browser->b,
1556
				is_report_browser(hbt) ? report_help : top_help);
1557
			continue;
1558 1559
		case K_ENTER:
		case K_RIGHT:
1560 1561
			/* menu */
			break;
1562
		case K_LEFT: {
1563
			const void *top;
1564

1565 1566 1567 1568 1569 1570
			if (pstack__empty(fstack)) {
				/*
				 * Go back to the perf_evsel_menu__run or other user
				 */
				if (left_exits)
					goto out_free_stack;
1571
				continue;
1572
			}
1573
			top = pstack__pop(fstack);
1574
			if (top == &browser->hists->dso_filter)
1575
				goto zoom_out_dso;
1576
			if (top == &browser->hists->thread_filter)
1577 1578 1579
				goto zoom_out_thread;
			continue;
		}
1580
		case K_ESC:
1581
			if (!left_exits &&
1582 1583
			    !ui_browser__dialog_yesno(&browser->b,
					       "Do you really want to exit?"))
1584 1585
				continue;
			/* Fall thru */
1586 1587
		case 'q':
		case CTRL('c'):
1588
			goto out_free_stack;
1589 1590
		default:
			continue;
1591 1592
		}

1593
		if (!sort__has_sym)
1594 1595
			goto add_exit_option;

1596
		if (sort__mode == SORT_MODE__BRANCH) {
1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609
			bi = browser->he_selection->branch_info;
			if (browser->selection != NULL &&
			    bi &&
			    bi->from.sym != NULL &&
			    !bi->from.map->dso->annotate_warned &&
				asprintf(&options[nr_options], "Annotate %s",
					 bi->from.sym->name) > 0)
				annotate_f = nr_options++;

			if (browser->selection != NULL &&
			    bi &&
			    bi->to.sym != NULL &&
			    !bi->to.map->dso->annotate_warned &&
1610 1611
			    (bi->to.sym != bi->from.sym ||
			     bi->to.map->dso != bi->from.map->dso) &&
1612 1613 1614 1615 1616 1617
				asprintf(&options[nr_options], "Annotate %s",
					 bi->to.sym->name) > 0)
				annotate_t = nr_options++;
		} else {
			if (browser->selection != NULL &&
			    browser->selection->sym != NULL &&
1618 1619 1620 1621 1622 1623 1624 1625 1626 1627
			    !browser->selection->map->dso->annotate_warned) {
				struct annotation *notes;

				notes = symbol__annotation(browser->selection->sym);

				if (notes->src &&
				    asprintf(&options[nr_options], "Annotate %s",
						 browser->selection->sym->name) > 0)
					annotate = nr_options++;
			}
1628
		}
1629 1630 1631

		if (thread != NULL &&
		    asprintf(&options[nr_options], "Zoom %s %s(%d) thread",
1632
			     (browser->hists->thread_filter ? "out of" : "into"),
1633
			     (thread->comm_set ? thread__comm_str(thread) : ""),
1634
			     thread->tid) > 0)
1635 1636 1637 1638
			zoom_thread = nr_options++;

		if (dso != NULL &&
		    asprintf(&options[nr_options], "Zoom %s %s DSO",
1639
			     (browser->hists->dso_filter ? "out of" : "into"),
1640 1641 1642
			     (dso->kernel ? "the Kernel" : dso->short_name)) > 0)
			zoom_dso = nr_options++;

1643 1644
		if (browser->selection != NULL &&
		    browser->selection->map != NULL &&
1645 1646
		    asprintf(&options[nr_options], "Browse map details") > 0)
			browse_map = nr_options++;
1647 1648 1649 1650 1651 1652

		/* perf script support */
		if (browser->he_selection) {
			struct symbol *sym;

			if (asprintf(&options[nr_options], "Run scripts for samples of thread [%s]",
1653
				     thread__comm_str(browser->he_selection->thread)) > 0)
1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665
				scripts_comm = nr_options++;

			sym = browser->he_selection->ms.sym;
			if (sym && sym->namelen &&
				asprintf(&options[nr_options], "Run scripts for samples of symbol [%s]",
						sym->name) > 0)
				scripts_symbol = nr_options++;
		}

		if (asprintf(&options[nr_options], "Run scripts for all samples") > 0)
			scripts_all = nr_options++;

1666 1667 1668
		if (is_report_browser(hbt) && asprintf(&options[nr_options],
				"Switch to another data file in PWD") > 0)
			switch_data = nr_options++;
1669
add_exit_option:
1670
		options[nr_options++] = (char *)"Exit";
1671
retry_popup_menu:
1672
		choice = ui__popup_menu(nr_options, options);
1673 1674 1675 1676

		if (choice == nr_options - 1)
			break;

1677 1678
		if (choice == -1) {
			free_popup_options(options, nr_options - 1);
1679
			continue;
1680
		}
1681

1682
		if (choice == annotate || choice == annotate_t || choice == annotate_f) {
1683
			struct hist_entry *he;
1684
			struct annotation *notes;
1685
			int err;
1686
do_annotate:
1687 1688 1689
			if (!objdump_path && perf_session_env__lookup_objdump(env))
				continue;

1690 1691 1692
			he = hist_browser__selected_entry(browser);
			if (he == NULL)
				continue;
1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707

			/*
			 * we stash the branch_info symbol + map into the
			 * the ms so we don't have to rewrite all the annotation
			 * code to use branch_info.
			 * in branch mode, the ms struct is not used
			 */
			if (choice == annotate_f) {
				he->ms.sym = he->branch_info->from.sym;
				he->ms.map = he->branch_info->from.map;
			}  else if (choice == annotate_t) {
				he->ms.sym = he->branch_info->to.sym;
				he->ms.map = he->branch_info->to.map;
			}

1708 1709 1710 1711
			notes = symbol__annotation(he->ms.sym);
			if (!notes->src)
				continue;

1712 1713 1714 1715
			/*
			 * Don't let this be freed, say, by hists__decay_entry.
			 */
			he->used = true;
1716
			err = hist_entry__tui_annotate(he, evsel, hbt);
1717
			he->used = false;
1718 1719 1720 1721 1722 1723 1724 1725
			/*
			 * offer option to annotate the other branch source or target
			 * (if they exists) when returning from annotate
			 */
			if ((err == 'q' || err == CTRL('c'))
			    && annotate_t != -2 && annotate_f != -2)
				goto retry_popup_menu;

1726
			ui_browser__update_nr_entries(&browser->b, browser->hists->nr_entries);
1727 1728
			if (err)
				ui_browser__handle_resize(&browser->b);
1729

1730 1731 1732 1733
		} else if (choice == browse_map)
			map__browse(browser->selection->map);
		else if (choice == zoom_dso) {
zoom_dso:
1734 1735
			if (browser->hists->dso_filter) {
				pstack__remove(fstack, &browser->hists->dso_filter);
1736 1737
zoom_out_dso:
				ui_helpline__pop();
1738
				browser->hists->dso_filter = NULL;
1739
				perf_hpp__set_elide(HISTC_DSO, false);
1740 1741 1742 1743 1744
			} else {
				if (dso == NULL)
					continue;
				ui_helpline__fpush("To zoom out press <- or -> + \"Zoom out of %s DSO\"",
						   dso->kernel ? "the Kernel" : dso->short_name);
1745
				browser->hists->dso_filter = dso;
1746
				perf_hpp__set_elide(HISTC_DSO, true);
1747
				pstack__push(fstack, &browser->hists->dso_filter);
1748
			}
1749
			hists__filter_by_dso(hists);
1750 1751 1752
			hist_browser__reset(browser);
		} else if (choice == zoom_thread) {
zoom_thread:
1753 1754
			if (browser->hists->thread_filter) {
				pstack__remove(fstack, &browser->hists->thread_filter);
1755 1756
zoom_out_thread:
				ui_helpline__pop();
1757
				thread__zput(browser->hists->thread_filter);
1758
				perf_hpp__set_elide(HISTC_THREAD, false);
1759 1760
			} else {
				ui_helpline__fpush("To zoom out press <- or -> + \"Zoom out of %s(%d) thread\"",
1761
						   thread->comm_set ? thread__comm_str(thread) : "",
1762
						   thread->tid);
1763
				browser->hists->thread_filter = thread__get(thread);
1764
				perf_hpp__set_elide(HISTC_THREAD, false);
1765
				pstack__push(fstack, &browser->hists->thread_filter);
1766
			}
1767
			hists__filter_by_thread(hists);
1768 1769
			hist_browser__reset(browser);
		}
1770 1771 1772 1773 1774 1775 1776
		/* perf scripts support */
		else if (choice == scripts_all || choice == scripts_comm ||
				choice == scripts_symbol) {
do_scripts:
			memset(script_opt, 0, 64);

			if (choice == scripts_comm)
1777
				sprintf(script_opt, " -c %s ", thread__comm_str(browser->he_selection->thread));
1778 1779 1780 1781 1782 1783

			if (choice == scripts_symbol)
				sprintf(script_opt, " -S %s ", browser->he_selection->ms.sym->name);

			script_browse(script_opt);
		}
1784 1785 1786 1787 1788 1789 1790 1791 1792 1793
		/* Switch to another data file */
		else if (choice == switch_data) {
do_data_switch:
			if (!switch_data_file()) {
				key = K_SWITCH_INPUT_DATA;
				break;
			} else
				ui__warning("Won't switch the data files due to\n"
					"no valid data file get selected!\n");
		}
1794 1795 1796 1797 1798
	}
out_free_stack:
	pstack__delete(fstack);
out:
	hist_browser__delete(browser);
1799
	free_popup_options(options, nr_options - 1);
1800 1801 1802
	return key;
}

1803 1804 1805
struct perf_evsel_menu {
	struct ui_browser b;
	struct perf_evsel *selection;
1806
	bool lost_events, lost_events_warned;
1807
	float min_pcnt;
1808
	struct perf_session_env *env;
1809 1810 1811 1812 1813 1814 1815 1816
};

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);
1817
	struct hists *hists = evsel__hists(evsel);
1818
	bool current_entry = ui_browser__is_current_entry(browser, row);
1819
	unsigned long nr_events = hists->stats.nr_events[PERF_RECORD_SAMPLE];
1820
	const char *ev_name = perf_evsel__name(evsel);
1821
	char bf[256], unit;
1822 1823
	const char *warn = " ";
	size_t printed;
1824 1825 1826 1827

	ui_browser__set_color(browser, current_entry ? HE_COLORSET_SELECTED :
						       HE_COLORSET_NORMAL);

1828
	if (perf_evsel__is_group_event(evsel)) {
1829 1830 1831 1832 1833
		struct perf_evsel *pos;

		ev_name = perf_evsel__group_name(evsel);

		for_each_group_member(pos, evsel) {
1834 1835
			struct hists *pos_hists = evsel__hists(pos);
			nr_events += pos_hists->stats.nr_events[PERF_RECORD_SAMPLE];
1836 1837 1838
		}
	}

1839
	nr_events = convert_unit(nr_events, &unit);
1840
	printed = scnprintf(bf, sizeof(bf), "%lu%c%s%s", nr_events,
1841 1842 1843
			   unit, unit == ' ' ? "" : " ", ev_name);
	slsmg_printf("%s", bf);

1844
	nr_events = hists->stats.nr_events[PERF_RECORD_LOST];
1845 1846 1847 1848 1849
	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);
1850 1851
		printed += scnprintf(bf, sizeof(bf), ": %ld%c%schunks LOST!",
				     nr_events, unit, unit == ' ' ? "" : " ");
1852 1853 1854 1855
		warn = bf;
	}

	slsmg_write_nstring(warn, browser->width - printed);
1856 1857 1858 1859 1860

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

1861 1862
static int perf_evsel_menu__run(struct perf_evsel_menu *menu,
				int nr_events, const char *help,
1863
				struct hist_browser_timer *hbt)
1864
{
1865
	struct perf_evlist *evlist = menu->b.priv;
1866
	struct perf_evsel *pos;
1867
	const char *title = "Available samples";
1868
	int delay_secs = hbt ? hbt->refresh : 0;
1869
	int key;
1870

1871 1872 1873 1874 1875
	if (ui_browser__show(&menu->b, title,
			     "ESC: exit, ENTER|->: Browse histograms") < 0)
		return -1;

	while (1) {
1876
		key = ui_browser__run(&menu->b, delay_secs);
1877 1878

		switch (key) {
1879
		case K_TIMER:
1880
			hbt->timer(hbt->arg);
1881 1882 1883 1884 1885

			if (!menu->lost_events_warned && menu->lost_events) {
				ui_browser__warn_lost_events(&menu->b);
				menu->lost_events_warned = true;
			}
1886
			continue;
1887 1888
		case K_RIGHT:
		case K_ENTER:
1889 1890 1891 1892
			if (!menu->selection)
				continue;
			pos = menu->selection;
browse_hists:
1893 1894 1895 1896 1897
			perf_evlist__set_selected(evlist, pos);
			/*
			 * Give the calling tool a chance to populate the non
			 * default evsel resorted hists tree.
			 */
1898 1899
			if (hbt)
				hbt->timer(hbt->arg);
1900
			key = perf_evsel__hists_browse(pos, nr_events, help,
1901
						       true, hbt,
1902
						       menu->min_pcnt,
1903
						       menu->env);
1904
			ui_browser__show_title(&menu->b, title);
1905
			switch (key) {
1906
			case K_TAB:
1907
				if (pos->node.next == &evlist->entries)
1908
					pos = perf_evlist__first(evlist);
1909
				else
1910
					pos = perf_evsel__next(pos);
1911
				goto browse_hists;
1912
			case K_UNTAB:
1913
				if (pos->node.prev == &evlist->entries)
1914
					pos = perf_evlist__last(evlist);
1915
				else
1916
					pos = perf_evsel__prev(pos);
1917
				goto browse_hists;
1918
			case K_ESC:
1919 1920
				if (!ui_browser__dialog_yesno(&menu->b,
						"Do you really want to exit?"))
1921 1922
					continue;
				/* Fall thru */
1923
			case K_SWITCH_INPUT_DATA:
1924 1925 1926 1927 1928 1929
			case 'q':
			case CTRL('c'):
				goto out;
			default:
				continue;
			}
1930
		case K_LEFT:
1931
			continue;
1932
		case K_ESC:
1933 1934
			if (!ui_browser__dialog_yesno(&menu->b,
					       "Do you really want to exit?"))
1935 1936
				continue;
			/* Fall thru */
1937 1938 1939
		case 'q':
		case CTRL('c'):
			goto out;
1940
		default:
1941
			continue;
1942 1943 1944
		}
	}

1945 1946 1947 1948 1949
out:
	ui_browser__hide(&menu->b);
	return key;
}

1950
static bool filter_group_entries(struct ui_browser *browser __maybe_unused,
1951 1952 1953 1954 1955 1956 1957 1958 1959 1960
				 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;
}

1961
static int __perf_evlist__tui_browse_hists(struct perf_evlist *evlist,
1962
					   int nr_entries, const char *help,
1963
					   struct hist_browser_timer *hbt,
1964
					   float min_pcnt,
1965
					   struct perf_session_env *env)
1966 1967 1968 1969 1970 1971 1972 1973
{
	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,
1974 1975
			.filter	    = filter_group_entries,
			.nr_entries = nr_entries,
1976 1977
			.priv	    = evlist,
		},
1978
		.min_pcnt = min_pcnt,
1979
		.env = env,
1980 1981 1982 1983
	};

	ui_helpline__push("Press ESC to exit");

1984
	evlist__for_each(evlist, pos) {
1985
		const char *ev_name = perf_evsel__name(pos);
1986 1987 1988 1989 1990 1991
		size_t line_len = strlen(ev_name) + 7;

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

1992
	return perf_evsel_menu__run(&menu, nr_entries, help, hbt);
1993 1994
}

1995
int perf_evlist__tui_browse_hists(struct perf_evlist *evlist, const char *help,
1996
				  struct hist_browser_timer *hbt,
1997
				  float min_pcnt,
1998
				  struct perf_session_env *env)
1999
{
2000 2001 2002 2003
	int nr_entries = evlist->nr_entries;

single_entry:
	if (nr_entries == 1) {
2004
		struct perf_evsel *first = perf_evlist__first(evlist);
2005 2006

		return perf_evsel__hists_browse(first, nr_entries, help,
2007
						false, hbt, min_pcnt,
2008
						env);
2009 2010
	}

2011 2012 2013 2014
	if (symbol_conf.event_group) {
		struct perf_evsel *pos;

		nr_entries = 0;
2015
		evlist__for_each(evlist, pos) {
2016 2017
			if (perf_evsel__is_group_leader(pos))
				nr_entries++;
2018
		}
2019 2020 2021 2022 2023 2024

		if (nr_entries == 1)
			goto single_entry;
	}

	return __perf_evlist__tui_browse_hists(evlist, nr_entries, help,
2025
					       hbt, min_pcnt, env);
2026
}