hists.c 50.8 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
static void callchain_node__init_have_children(struct callchain_node *node)
231 232 233
{
	struct callchain_list *chain;

234 235
	if (!list_empty(&node->val)) {
		chain = list_entry(node->val.prev, struct callchain_list, list);
236
		chain->ms.has_children = !RB_EMPTY_ROOT(&node->rb_root);
237
	}
238

239
	callchain_node__init_have_children_rb_tree(node);
240 241
}

242
static void callchain__init_have_children(struct rb_root *root)
243 244 245
{
	struct rb_node *nd;

246
	for (nd = rb_first(root); nd; nd = rb_next(nd)) {
247 248 249 250 251
		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
		callchain_node__init_have_children(node);
	}
}

252
static void hist_entry__init_have_children(struct hist_entry *he)
253
{
254 255 256 257
	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;
258 259 260
	}
}

261
static bool hist_browser__toggle_fold(struct hist_browser *browser)
262
{
263 264
	if (map_symbol__toggle_fold(browser->selection)) {
		struct hist_entry *he = browser->he_selection;
265 266

		hist_entry__init_have_children(he);
267 268
		browser->b.nr_entries -= he->nr_rows;
		browser->nr_callchain_rows -= he->nr_rows;
269 270 271 272 273

		if (he->ms.unfolded)
			he->nr_rows = callchain__count_rows(&he->sorted_chain);
		else
			he->nr_rows = 0;
274 275 276

		browser->b.nr_entries += he->nr_rows;
		browser->nr_callchain_rows += he->nr_rows;
277 278 279 280 281 282 283 284

		return true;
	}

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

285
static int callchain_node__set_folding_rb_tree(struct callchain_node *node, bool unfold)
286 287 288 289
{
	int n = 0;
	struct rb_node *nd;

290
	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
291 292 293 294 295 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
		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;
}

339
static void hist_entry__set_folding(struct hist_entry *he, bool unfold)
340
{
341 342
	hist_entry__init_have_children(he);
	map_symbol__set_folding(&he->ms, unfold);
343

344 345 346
	if (he->ms.has_children) {
		int n = callchain__set_folding(&he->sorted_chain, unfold);
		he->nr_rows = unfold ? n : 0;
347
	} else
348
		he->nr_rows = 0;
349 350
}

351 352
static void
__hist_browser__set_folding(struct hist_browser *browser, bool unfold)
353 354
{
	struct rb_node *nd;
355
	struct hists *hists = browser->hists;
356

357
	for (nd = rb_first(&hists->entries);
358
	     (nd = hists__filter_entries(nd, browser->min_pcnt)) != NULL;
359
	     nd = rb_next(nd)) {
360 361
		struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node);
		hist_entry__set_folding(he, unfold);
362
		browser->nr_callchain_rows += he->nr_rows;
363 364 365
	}
}

366
static void hist_browser__set_folding(struct hist_browser *browser, bool unfold)
367
{
368 369 370 371
	browser->nr_callchain_rows = 0;
	__hist_browser__set_folding(browser, unfold);

	browser->b.nr_entries = hist_browser__nr_entries(browser);
372
	/* Go to the start, we may be way after valid entries after a collapse */
373
	ui_browser__reset_index(&browser->b);
374 375
}

376 377 378 379 380 381 382 383 384
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.");
}

385
static int hist_browser__run(struct hist_browser *browser,
386
			     struct hist_browser_timer *hbt)
387
{
388
	int key;
389
	char title[160];
390
	int delay_secs = hbt ? hbt->refresh : 0;
391

392
	browser->b.entries = &browser->hists->entries;
393
	browser->b.nr_entries = hist_browser__nr_entries(browser);
394

395
	hists__browser_title(browser->hists, hbt, title, sizeof(title));
396

397
	if (ui_browser__show(&browser->b, title,
398
			     "Press '?' for help on key bindings") < 0)
399 400 401
		return -1;

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

404
		switch (key) {
405 406
		case K_TIMER: {
			u64 nr_entries;
407
			hbt->timer(hbt->arg);
408

409
			if (hist_browser__has_filter(browser))
410
				hist_browser__update_nr_entries(browser);
411

412
			nr_entries = hist_browser__nr_entries(browser);
413
			ui_browser__update_nr_entries(&browser->b, nr_entries);
414

415 416 417 418 419
			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);
420 421
			}

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

466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481
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);

482 483
static void hist_browser__show_callchain_entry(struct hist_browser *browser,
					       struct callchain_list *chain,
484 485 486
					       const char *str, int offset,
					       unsigned short row,
					       struct callchain_print_arg *arg)
487 488
{
	int color, width;
489
	char folded_sign = callchain_list__folded(chain);
490 491 492 493 494 495

	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;
496
		arg->is_current_entry = true;
497 498 499 500 501 502 503 504 505
	}

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

506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532
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;
}

533 534
#define LEVEL_OFFSET_STEP 3

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

547
	node = rb_first(root);
548 549
	need_percent = !!rb_next(node);

550 551 552
	while (node) {
		struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);
		struct rb_node *next = rb_next(node);
553
		u64 cumul = callchain_cumul_hits(child);
554 555 556 557 558 559
		struct callchain_list *chain;
		char folded_sign = ' ';
		int first = true;
		int extra_offset = 0;

		list_for_each_entry(chain, &child->val, list) {
560
			char bf[1024], *alloc_str;
561 562 563
			const char *str;
			bool was_first = first;

564
			if (first)
565
				first = false;
566
			else if (need_percent)
567 568 569
				extra_offset = LEVEL_OFFSET_STEP;

			folded_sign = callchain_list__folded(chain);
570 571
			if (arg->row_offset != 0) {
				arg->row_offset--;
572 573 574 575
				goto do_next;
			}

			alloc_str = NULL;
576 577
			str = callchain_list__sym_name(chain, bf, sizeof(bf),
						       browser->show_dso);
578

579
			if (was_first && need_percent) {
580
				double percent = cumul * 100.0 / total;
581 582 583 584 585 586 587

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

588 589
			print(browser, chain, str, offset + extra_offset, row, arg);

590 591
			free(alloc_str);

592
			if (is_output_full(browser, ++row))
593 594 595 596 597 598 599 600 601
				goto out;
do_next:
			if (folded_sign == '+')
				break;
		}

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

602 603 604 605
			if (callchain_param.mode == CHAIN_GRAPH_REL)
				new_total = child->children_hit;
			else
				new_total = total;
606

607
			row += hist_browser__show_callchain(browser, &child->rb_root,
608 609
							    new_level, row, new_total,
							    print, arg, is_output_full);
610
		}
611
		if (is_output_full(browser, row))
612
			break;
613
		node = next;
614
	}
615
out:
616 617 618
	return row - first_row;
}

619 620 621 622 623 624
struct hpp_arg {
	struct ui_browser *b;
	char folded_sign;
	bool current_entry;
};

625 626 627
static int __hpp__slsmg_color_printf(struct perf_hpp *hpp, const char *fmt, ...)
{
	struct hpp_arg *arg = hpp->ptr;
628
	int ret, len;
629 630
	va_list args;
	double percent;
631

632
	va_start(args, fmt);
633
	len = va_arg(args, int);
634 635
	percent = va_arg(args, double);
	va_end(args);
636

637
	ui_browser__set_percent_color(arg->b, percent, arg->current_entry);
638

639
	ret = scnprintf(hpp->buf, hpp->size, fmt, len, percent);
640
	slsmg_printf("%s", hpp->buf);
641

642
	advance_hpp(hpp, ret);
643 644 645
	return ret;
}

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

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

684 685 686 687 688
__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)
689
__HPP_COLOR_ACC_PERCENT_FN(overhead_acc, period)
690

691
#undef __HPP_COLOR_PERCENT_FN
692
#undef __HPP_COLOR_ACC_PERCENT_FN
693 694 695 696 697 698 699 700 701 702 703 704 705

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;
706 707
	perf_hpp__format[PERF_HPP__OVERHEAD_ACC].color =
				hist_browser__hpp_color_overhead_acc;
708 709
}

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

	if (current_entry) {
724 725
		browser->he_selection = entry;
		browser->selection = &entry->ms;
726 727 728
	}

	if (symbol_conf.use_callchain) {
729
		hist_entry__init_have_children(entry);
730 731 732 733
		folded_sign = hist_entry__folded(entry);
	}

	if (row_offset == 0) {
734
		struct hpp_arg arg = {
735
			.b		= &browser->b,
736 737 738
			.folded_sign	= folded_sign,
			.current_entry	= current_entry,
		};
739 740 741
		struct perf_hpp hpp = {
			.buf		= s,
			.size		= sizeof(s),
742
			.ptr		= &arg,
743
		};
744

745
		hist_browser__gotorc(browser, row, 0);
746

747
		perf_hpp__for_each_format(fmt) {
748 749 750
			if (perf_hpp__should_skip(fmt))
				continue;

751 752 753 754 755 756 757 758 759 760 761 762 763 764 765
			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 {
766 767 768
				slsmg_printf("  ");
				width -= 2;
			}
769

770
			if (fmt->color) {
771
				width -= fmt->color(fmt, &hpp, entry);
772
			} else {
773
				width -= fmt->entry(fmt, &hpp, entry);
774 775
				slsmg_printf("%s", s);
			}
776 777
		}

778 779 780 781
		/* The scroll bar isn't being used */
		if (!browser->b.navkeypressed)
			width += 1;

782 783
		slsmg_write_nstring("", width);

784 785 786 787 788
		++row;
		++printed;
	} else
		--row_offset;

789
	if (folded_sign == '-' && row != browser->b.rows) {
790
		u64 total = hists__total_period(entry->hists);
791 792 793 794
		struct callchain_print_arg arg = {
			.row_offset = row_offset,
			.is_current_entry = current_entry,
		};
795

796 797 798 799 800 801 802
		if (callchain_param.mode == CHAIN_GRAPH_REL) {
			if (symbol_conf.cumulate_callchain)
				total = entry->stat_acc->period;
			else
				total = entry->stat.period;
		}

803
		printed += hist_browser__show_callchain(browser,
804 805 806
					&entry->sorted_chain, 1, row, total,
					hist_browser__show_callchain_entry, &arg,
					hist_browser__check_output_full);
807

808
		if (arg.is_current_entry)
809
			browser->he_selection = entry;
810 811 812 813 814
	}

	return printed;
}

815 816 817 818 819 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
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;
}

852 853
static void hist_browser__show_headers(struct hist_browser *browser)
{
854 855 856
	char headers[1024];

	hists__scnprintf_headers(headers, sizeof(headers), browser->hists);
857 858
	ui_browser__gotorc(&browser->b, 0, 0);
	ui_browser__set_color(&browser->b, HE_COLORSET_ROOT);
859
	slsmg_write_nstring(headers, browser->b.width + 1);
860 861
}

862 863 864 865 866 867 868 869 870 871
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);
	}
}

872
static unsigned int hist_browser__refresh(struct ui_browser *browser)
873 874
{
	unsigned row = 0;
875
	u16 header_offset = 0;
876
	struct rb_node *nd;
877
	struct hist_browser *hb = container_of(browser, struct hist_browser, b);
878

879 880 881 882 883
	if (hb->show_headers) {
		hist_browser__show_headers(hb);
		header_offset = 1;
	}

884
	ui_browser__hists_init_top(browser);
885

886
	for (nd = browser->top; nd; nd = rb_next(nd)) {
887
		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
888
		float percent;
889 890 891 892

		if (h->filtered)
			continue;

893
		percent = hist_entry__get_percent_limit(h);
894 895 896
		if (percent < hb->min_pcnt)
			continue;

897
		row += hist_browser__show_entry(hb, h, row);
898
		if (row == browser->rows)
899 900 901
			break;
	}

902
	return row + header_offset;
903 904
}

905 906
static struct rb_node *hists__filter_entries(struct rb_node *nd,
					     float min_pcnt)
907 908 909
{
	while (nd != NULL) {
		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
910
		float percent = hist_entry__get_percent_limit(h);
911

912
		if (!h->filtered && percent >= min_pcnt)
913 914 915 916 917 918 919 920
			return nd;

		nd = rb_next(nd);
	}

	return NULL;
}

921 922
static struct rb_node *hists__filter_prev_entries(struct rb_node *nd,
						  float min_pcnt)
923 924 925
{
	while (nd != NULL) {
		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
926
		float percent = hist_entry__get_percent_limit(h);
927 928

		if (!h->filtered && percent >= min_pcnt)
929 930 931 932 933 934 935 936
			return nd;

		nd = rb_prev(nd);
	}

	return NULL;
}

937
static void ui_browser__hists_seek(struct ui_browser *browser,
938 939 940 941 942
				   off_t offset, int whence)
{
	struct hist_entry *h;
	struct rb_node *nd;
	bool first = true;
943 944 945
	struct hist_browser *hb;

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

947
	if (browser->nr_entries == 0)
948 949
		return;

950
	ui_browser__hists_init_top(browser);
951

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

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

1038
			nd = hists__filter_prev_entries(rb_prev(nd),
1039
							hb->min_pcnt);
1040 1041 1042
			if (nd == NULL)
				break;
			++offset;
1043
			browser->top = nd;
1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057
			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 {
1058
		browser->top = nd;
1059 1060 1061 1062 1063
		h = rb_entry(nd, struct hist_entry, rb_node);
		h->row_offset = 0;
	}
}

1064
static int hist_browser__fprintf_callchain(struct hist_browser *browser,
1065
					   struct hist_entry *he, FILE *fp)
1066
{
1067 1068 1069 1070
	u64 total = hists__total_period(he->hists);
	struct callchain_print_arg arg  = {
		.fp = fp,
	};
1071

1072 1073
	if (symbol_conf.cumulate_callchain)
		total = he->stat_acc->period;
1074

1075 1076 1077 1078
	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;
1079 1080 1081 1082 1083 1084 1085 1086
}

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

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

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

1101
	perf_hpp__for_each_format(fmt) {
1102 1103 1104
		if (perf_hpp__should_skip(fmt))
			continue;

1105 1106 1107 1108 1109
		if (!first) {
			ret = scnprintf(hpp.buf, hpp.size, "  ");
			advance_hpp(&hpp, ret);
		} else
			first = false;
1110

1111 1112 1113
		ret = fmt->entry(fmt, &hpp, he);
		advance_hpp(&hpp, ret);
	}
1114 1115 1116
	printed += fprintf(fp, "%s\n", rtrim(s));

	if (folded_sign == '-')
1117
		printed += hist_browser__fprintf_callchain(browser, he, fp);
1118 1119 1120 1121 1122 1123

	return printed;
}

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

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

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

	return 0;
}

1172 1173
static struct hist_browser *hist_browser__new(struct hists *hists)
{
1174
	struct hist_browser *browser = zalloc(sizeof(*browser));
1175

1176 1177 1178
	if (browser) {
		browser->hists = hists;
		browser->b.refresh = hist_browser__refresh;
1179
		browser->b.refresh_dimensions = hist_browser__refresh_dimensions;
1180 1181
		browser->b.seek = ui_browser__hists_seek;
		browser->b.use_navkeypressed = true;
1182
		browser->show_headers = symbol_conf.show_hist_headers;
1183 1184
	}

1185
	return browser;
1186 1187
}

1188
static void hist_browser__delete(struct hist_browser *browser)
1189
{
1190
	free(browser);
1191 1192
}

1193
static struct hist_entry *hist_browser__selected_entry(struct hist_browser *browser)
1194
{
1195
	return browser->he_selection;
1196 1197
}

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

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

1224 1225 1226 1227 1228
	if (symbol_conf.filter_relative) {
		nr_samples = hists->stats.nr_non_filtered_samples;
		nr_events = hists->stats.total_non_filtered_period;
	}

1229
	if (perf_evsel__is_group_event(evsel)) {
1230 1231 1232 1233 1234 1235
		struct perf_evsel *pos;

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

		for_each_group_member(pos, evsel) {
1236 1237
			struct hists *pos_hists = evsel__hists(pos);

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

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

1253

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

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

1272
	return printed;
1273 1274
}

1275 1276 1277 1278
static inline void free_popup_options(char **options, int n)
{
	int i;

1279 1280
	for (i = 0; i < n; ++i)
		zfree(&options[i]);
1281 1282
}

1283 1284 1285 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
/*
 * 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]) {
1333
				zfree(&options[nr_options]);
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
				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;
}

1372
static void hist_browser__update_nr_entries(struct hist_browser *hb)
1373 1374 1375 1376
{
	u64 nr_entries = 0;
	struct rb_node *nd = rb_first(&hb->hists->entries);

1377 1378 1379 1380 1381
	if (hb->min_pcnt == 0) {
		hb->nr_non_filtered_entries = hb->hists->nr_non_filtered_entries;
		return;
	}

1382
	while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {
1383
		nr_entries++;
1384
		nd = rb_next(nd);
1385 1386
	}

1387
	hb->nr_non_filtered_entries = nr_entries;
1388
}
1389

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

1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422
#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"				\
1423
	"F             Toggle percentage of filtered entries\n"		\
1424
	"H             Display column headers\n"			\
1425 1426 1427

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

1442 1443 1444
	if (browser == NULL)
		return -1;

1445 1446
	if (min_pcnt) {
		browser->min_pcnt = min_pcnt;
1447
		hist_browser__update_nr_entries(browser);
1448 1449
	}

1450 1451 1452 1453 1454 1455
	fstack = pstack__new(2);
	if (fstack == NULL)
		goto out;

	ui_helpline__push(helpline);

1456 1457
	memset(options, 0, sizeof(options));

1458 1459 1460
	perf_hpp__for_each_format(fmt)
		perf_hpp__reset_width(fmt, hists);

1461 1462 1463
	if (symbol_conf.col_width_list_str)
		perf_hpp__set_user_width(symbol_conf.col_width_list_str);

1464
	while (1) {
1465 1466
		const struct thread *thread = NULL;
		const struct dso *dso = NULL;
1467
		int choice = 0,
1468
		    annotate = -2, zoom_dso = -2, zoom_thread = -2,
1469
		    annotate_f = -2, annotate_t = -2, browse_map = -2;
1470 1471
		int scripts_comm = -2, scripts_symbol = -2,
		    scripts_all = -2, switch_data = -2;
1472

1473 1474
		nr_options = 0;

1475
		key = hist_browser__run(browser, hbt);
1476

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

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

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

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

1588
		if (!sort__has_sym)
1589 1590
			goto add_exit_option;

1591
		if (sort__mode == SORT_MODE__BRANCH) {
1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604
			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 &&
1605 1606
			    (bi->to.sym != bi->from.sym ||
			     bi->to.map->dso != bi->from.map->dso) &&
1607 1608 1609 1610 1611 1612
				asprintf(&options[nr_options], "Annotate %s",
					 bi->to.sym->name) > 0)
				annotate_t = nr_options++;
		} else {
			if (browser->selection != NULL &&
			    browser->selection->sym != NULL &&
1613 1614 1615 1616 1617 1618 1619 1620 1621 1622
			    !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++;
			}
1623
		}
1624 1625 1626

		if (thread != NULL &&
		    asprintf(&options[nr_options], "Zoom %s %s(%d) thread",
1627
			     (browser->hists->thread_filter ? "out of" : "into"),
1628
			     (thread->comm_set ? thread__comm_str(thread) : ""),
1629
			     thread->tid) > 0)
1630 1631 1632 1633
			zoom_thread = nr_options++;

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

1638 1639
		if (browser->selection != NULL &&
		    browser->selection->map != NULL &&
1640 1641
		    asprintf(&options[nr_options], "Browse map details") > 0)
			browse_map = nr_options++;
1642 1643 1644 1645 1646 1647

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

			if (asprintf(&options[nr_options], "Run scripts for samples of thread [%s]",
1648
				     thread__comm_str(browser->he_selection->thread)) > 0)
1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660
				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++;

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

		if (choice == nr_options - 1)
			break;

1672 1673
		if (choice == -1) {
			free_popup_options(options, nr_options - 1);
1674
			continue;
1675
		}
1676

1677
		if (choice == annotate || choice == annotate_t || choice == annotate_f) {
1678
			struct hist_entry *he;
1679
			struct annotation *notes;
1680
			int err;
1681
do_annotate:
1682 1683 1684
			if (!objdump_path && perf_session_env__lookup_objdump(env))
				continue;

1685 1686 1687
			he = hist_browser__selected_entry(browser);
			if (he == NULL)
				continue;
1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702

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

1703 1704 1705 1706
			notes = symbol__annotation(he->ms.sym);
			if (!notes->src)
				continue;

1707 1708 1709 1710
			/*
			 * Don't let this be freed, say, by hists__decay_entry.
			 */
			he->used = true;
1711
			err = hist_entry__tui_annotate(he, evsel, hbt);
1712
			he->used = false;
1713 1714 1715 1716 1717 1718 1719 1720
			/*
			 * 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;

1721
			ui_browser__update_nr_entries(&browser->b, browser->hists->nr_entries);
1722 1723
			if (err)
				ui_browser__handle_resize(&browser->b);
1724

1725 1726 1727 1728
		} else if (choice == browse_map)
			map__browse(browser->selection->map);
		else if (choice == zoom_dso) {
zoom_dso:
1729 1730
			if (browser->hists->dso_filter) {
				pstack__remove(fstack, &browser->hists->dso_filter);
1731 1732
zoom_out_dso:
				ui_helpline__pop();
1733
				browser->hists->dso_filter = NULL;
1734
				perf_hpp__set_elide(HISTC_DSO, false);
1735 1736 1737 1738 1739
			} 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);
1740
				browser->hists->dso_filter = dso;
1741
				perf_hpp__set_elide(HISTC_DSO, true);
1742
				pstack__push(fstack, &browser->hists->dso_filter);
1743
			}
1744
			hists__filter_by_dso(hists);
1745 1746 1747
			hist_browser__reset(browser);
		} else if (choice == zoom_thread) {
zoom_thread:
1748 1749
			if (browser->hists->thread_filter) {
				pstack__remove(fstack, &browser->hists->thread_filter);
1750 1751
zoom_out_thread:
				ui_helpline__pop();
1752
				browser->hists->thread_filter = NULL;
1753
				perf_hpp__set_elide(HISTC_THREAD, false);
1754 1755
			} else {
				ui_helpline__fpush("To zoom out press <- or -> + \"Zoom out of %s(%d) thread\"",
1756
						   thread->comm_set ? thread__comm_str(thread) : "",
1757
						   thread->tid);
1758
				browser->hists->thread_filter = thread;
1759
				perf_hpp__set_elide(HISTC_THREAD, false);
1760
				pstack__push(fstack, &browser->hists->thread_filter);
1761
			}
1762
			hists__filter_by_thread(hists);
1763 1764
			hist_browser__reset(browser);
		}
1765 1766 1767 1768 1769 1770 1771
		/* 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)
1772
				sprintf(script_opt, " -c %s ", thread__comm_str(browser->he_selection->thread));
1773 1774 1775 1776 1777 1778

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

			script_browse(script_opt);
		}
1779 1780 1781 1782 1783 1784 1785 1786 1787 1788
		/* 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");
		}
1789 1790 1791 1792 1793
	}
out_free_stack:
	pstack__delete(fstack);
out:
	hist_browser__delete(browser);
1794
	free_popup_options(options, nr_options - 1);
1795 1796 1797
	return key;
}

1798 1799 1800
struct perf_evsel_menu {
	struct ui_browser b;
	struct perf_evsel *selection;
1801
	bool lost_events, lost_events_warned;
1802
	float min_pcnt;
1803
	struct perf_session_env *env;
1804 1805 1806 1807 1808 1809 1810 1811
};

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

	ui_browser__set_color(browser, current_entry ? HE_COLORSET_SELECTED :
						       HE_COLORSET_NORMAL);

1823
	if (perf_evsel__is_group_event(evsel)) {
1824 1825 1826 1827 1828
		struct perf_evsel *pos;

		ev_name = perf_evsel__group_name(evsel);

		for_each_group_member(pos, evsel) {
1829 1830
			struct hists *pos_hists = evsel__hists(pos);
			nr_events += pos_hists->stats.nr_events[PERF_RECORD_SAMPLE];
1831 1832 1833
		}
	}

1834
	nr_events = convert_unit(nr_events, &unit);
1835
	printed = scnprintf(bf, sizeof(bf), "%lu%c%s%s", nr_events,
1836 1837 1838
			   unit, unit == ' ' ? "" : " ", ev_name);
	slsmg_printf("%s", bf);

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

	slsmg_write_nstring(warn, browser->width - printed);
1851 1852 1853 1854 1855

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

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

1866 1867 1868 1869 1870
	if (ui_browser__show(&menu->b, title,
			     "ESC: exit, ENTER|->: Browse histograms") < 0)
		return -1;

	while (1) {
1871
		key = ui_browser__run(&menu->b, delay_secs);
1872 1873

		switch (key) {
1874
		case K_TIMER:
1875
			hbt->timer(hbt->arg);
1876 1877 1878 1879 1880

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

1940 1941 1942 1943 1944
out:
	ui_browser__hide(&menu->b);
	return key;
}

1945
static bool filter_group_entries(struct ui_browser *browser __maybe_unused,
1946 1947 1948 1949 1950 1951 1952 1953 1954 1955
				 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;
}

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

	ui_helpline__push("Press ESC to exit");

1979
	evlist__for_each(evlist, pos) {
1980
		const char *ev_name = perf_evsel__name(pos);
1981 1982 1983 1984 1985 1986
		size_t line_len = strlen(ev_name) + 7;

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

1987
	return perf_evsel_menu__run(&menu, nr_entries, help, hbt);
1988 1989
}

1990
int perf_evlist__tui_browse_hists(struct perf_evlist *evlist, const char *help,
1991
				  struct hist_browser_timer *hbt,
1992
				  float min_pcnt,
1993
				  struct perf_session_env *env)
1994
{
1995 1996 1997 1998
	int nr_entries = evlist->nr_entries;

single_entry:
	if (nr_entries == 1) {
1999
		struct perf_evsel *first = perf_evlist__first(evlist);
2000 2001

		return perf_evsel__hists_browse(first, nr_entries, help,
2002
						false, hbt, min_pcnt,
2003
						env);
2004 2005
	}

2006 2007 2008 2009
	if (symbol_conf.event_group) {
		struct perf_evsel *pos;

		nr_entries = 0;
2010
		evlist__for_each(evlist, pos) {
2011 2012
			if (perf_evsel__is_group_leader(pos))
				nr_entries++;
2013
		}
2014 2015 2016 2017 2018 2019

		if (nr_entries == 1)
			goto single_entry;
	}

	return __perf_evlist__tui_browse_hists(evlist, nr_entries, help,
2020
					       hbt, min_pcnt, env);
2021
}