hists.c 51.5 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 63 64 65 66 67 68
static int hist_browser__get_folding(struct hist_browser *browser)
{
	struct rb_node *nd;
	struct hists *hists = browser->hists;
	int unfolded_rows = 0;

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

		if (he->ms.unfolded)
			unfolded_rows += he->nr_rows;
	}
	return unfolded_rows;
}

69 70 71 72 73 74 75 76 77
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;

78
	hb->nr_callchain_rows = hist_browser__get_folding(hb);
79 80 81
	return nr_entries + hb->nr_callchain_rows;
}

82 83 84 85 86 87 88 89 90 91 92 93 94 95 96
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;
}

97
static void hist_browser__refresh_dimensions(struct ui_browser *browser)
98
{
99 100
	struct hist_browser *hb = container_of(browser, struct hist_browser, b);

101
	/* 3 == +/- toggle symbol before actual hist_entry rendering */
102 103 104 105 106 107 108 109
	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);
110
	hist_browser__update_rows(hb);
111 112
}

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

	ui_browser__gotorc(&browser->b, row + header_offset, column);
118 119
}

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

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

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

139
static char map_symbol__folded(const struct map_symbol *ms)
140
{
141
	return ms->has_children ? tree__folded_sign(ms->unfolded) : ' ';
142 143
}

144
static char hist_entry__folded(const struct hist_entry *he)
145
{
146
	return map_symbol__folded(&he->ms);
147 148
}

149
static char callchain_list__folded(const struct callchain_list *cl)
150
{
151
	return map_symbol__folded(&cl->ms);
152 153
}

154
static void map_symbol__set_folding(struct map_symbol *ms, bool unfold)
155
{
156
	ms->unfolded = unfold ? ms->has_children : false;
157 158
}

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

164
	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
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 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213
		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;
}

214
static bool map_symbol__toggle_fold(struct map_symbol *ms)
215
{
216
	if (!ms)
217 218
		return false;

219
	if (!ms->has_children)
220 221
		return false;

222
	ms->unfolded = !ms->unfolded;
223 224 225
	return true;
}

226
static void callchain_node__init_have_children_rb_tree(struct callchain_node *node)
227
{
228
	struct rb_node *nd = rb_first(&node->rb_root);
229

230
	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
231 232
		struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
		struct callchain_list *chain;
233
		bool first = true;
234 235 236 237 238

		list_for_each_entry(chain, &child->val, list) {
			if (first) {
				first = false;
				chain->ms.has_children = chain->list.next != &child->val ||
239
							 !RB_EMPTY_ROOT(&child->rb_root);
240 241
			} else
				chain->ms.has_children = chain->list.next == &child->val &&
242
							 !RB_EMPTY_ROOT(&child->rb_root);
243 244 245 246 247 248
		}

		callchain_node__init_have_children_rb_tree(child);
	}
}

249 250
static void callchain_node__init_have_children(struct callchain_node *node,
					       bool has_sibling)
251 252 253
{
	struct callchain_list *chain;

254 255 256
	chain = list_entry(node->val.next, struct callchain_list, list);
	chain->ms.has_children = has_sibling;

257 258
	if (!list_empty(&node->val)) {
		chain = list_entry(node->val.prev, struct callchain_list, list);
259
		chain->ms.has_children = !RB_EMPTY_ROOT(&node->rb_root);
260
	}
261

262
	callchain_node__init_have_children_rb_tree(node);
263 264
}

265
static void callchain__init_have_children(struct rb_root *root)
266
{
267 268
	struct rb_node *nd = rb_first(root);
	bool has_sibling = nd && rb_next(nd);
269

270
	for (nd = rb_first(root); nd; nd = rb_next(nd)) {
271
		struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
272
		callchain_node__init_have_children(node, has_sibling);
273 274 275
	}
}

276
static void hist_entry__init_have_children(struct hist_entry *he)
277
{
278 279 280 281
	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;
282 283 284
	}
}

285
static bool hist_browser__toggle_fold(struct hist_browser *browser)
286
{
287 288
	if (map_symbol__toggle_fold(browser->selection)) {
		struct hist_entry *he = browser->he_selection;
289 290

		hist_entry__init_have_children(he);
291 292
		browser->b.nr_entries -= he->nr_rows;
		browser->nr_callchain_rows -= he->nr_rows;
293 294 295 296 297

		if (he->ms.unfolded)
			he->nr_rows = callchain__count_rows(&he->sorted_chain);
		else
			he->nr_rows = 0;
298 299 300

		browser->b.nr_entries += he->nr_rows;
		browser->nr_callchain_rows += he->nr_rows;
301 302 303 304 305 306 307 308

		return true;
	}

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

309
static int callchain_node__set_folding_rb_tree(struct callchain_node *node, bool unfold)
310 311 312 313
{
	int n = 0;
	struct rb_node *nd;

314
	for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
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 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362
		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;
}

363
static void hist_entry__set_folding(struct hist_entry *he, bool unfold)
364
{
365 366
	hist_entry__init_have_children(he);
	map_symbol__set_folding(&he->ms, unfold);
367

368 369 370
	if (he->ms.has_children) {
		int n = callchain__set_folding(&he->sorted_chain, unfold);
		he->nr_rows = unfold ? n : 0;
371
	} else
372
		he->nr_rows = 0;
373 374
}

375 376
static void
__hist_browser__set_folding(struct hist_browser *browser, bool unfold)
377 378
{
	struct rb_node *nd;
379
	struct hists *hists = browser->hists;
380

381
	for (nd = rb_first(&hists->entries);
382
	     (nd = hists__filter_entries(nd, browser->min_pcnt)) != NULL;
383
	     nd = rb_next(nd)) {
384 385
		struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node);
		hist_entry__set_folding(he, unfold);
386
		browser->nr_callchain_rows += he->nr_rows;
387 388 389
	}
}

390
static void hist_browser__set_folding(struct hist_browser *browser, bool unfold)
391
{
392 393 394 395
	browser->nr_callchain_rows = 0;
	__hist_browser__set_folding(browser, unfold);

	browser->b.nr_entries = hist_browser__nr_entries(browser);
396
	/* Go to the start, we may be way after valid entries after a collapse */
397
	ui_browser__reset_index(&browser->b);
398 399
}

400 401 402 403 404 405 406 407 408
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.");
}

409
static int hist_browser__run(struct hist_browser *browser,
410
			     struct hist_browser_timer *hbt)
411
{
412
	int key;
413
	char title[160];
414
	int delay_secs = hbt ? hbt->refresh : 0;
415

416
	browser->b.entries = &browser->hists->entries;
417
	browser->b.nr_entries = hist_browser__nr_entries(browser);
418

419
	hists__browser_title(browser->hists, hbt, title, sizeof(title));
420

421
	if (ui_browser__show(&browser->b, title,
422
			     "Press '?' for help on key bindings") < 0)
423 424 425
		return -1;

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

428
		switch (key) {
429 430
		case K_TIMER: {
			u64 nr_entries;
431
			hbt->timer(hbt->arg);
432

433
			if (hist_browser__has_filter(browser))
434
				hist_browser__update_nr_entries(browser);
435

436
			nr_entries = hist_browser__nr_entries(browser);
437
			ui_browser__update_nr_entries(&browser->b, nr_entries);
438

439 440 441 442 443
			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);
444 445
			}

446 447
			hists__browser_title(browser->hists,
					     hbt, title, sizeof(title));
448
			ui_browser__show_title(&browser->b, title);
449
			continue;
450
		}
451
		case 'D': { /* Debug */
452
			static int seq;
453
			struct hist_entry *h = rb_entry(browser->b.top,
454 455
							struct hist_entry, rb_node);
			ui_helpline__pop();
456
			ui_helpline__fpush("%d: nr_ent=(%d,%d), rows=%d, idx=%d, fve: idx=%d, row_off=%d, nrows=%d",
457 458
					   seq++, browser->b.nr_entries,
					   browser->hists->nr_entries,
459
					   browser->b.rows,
460 461
					   browser->b.index,
					   browser->b.top_idx,
462 463
					   h->row_offset, h->nr_rows);
		}
464 465 466
			break;
		case 'C':
			/* Collapse the whole world. */
467
			hist_browser__set_folding(browser, false);
468 469 470
			break;
		case 'E':
			/* Expand the whole world. */
471
			hist_browser__set_folding(browser, true);
472
			break;
473 474 475 476
		case 'H':
			browser->show_headers = !browser->show_headers;
			hist_browser__update_rows(browser);
			break;
477
		case K_ENTER:
478
			if (hist_browser__toggle_fold(browser))
479 480 481
				break;
			/* fall thru */
		default:
482
			goto out;
483 484
		}
	}
485
out:
486
	ui_browser__hide(&browser->b);
487
	return key;
488 489
}

490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505
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);

506 507
static void hist_browser__show_callchain_entry(struct hist_browser *browser,
					       struct callchain_list *chain,
508 509 510
					       const char *str, int offset,
					       unsigned short row,
					       struct callchain_print_arg *arg)
511 512
{
	int color, width;
513
	char folded_sign = callchain_list__folded(chain);
514
	bool show_annotated = browser->show_dso && chain->ms.sym && symbol__annotation(chain->ms.sym)->src;
515 516 517 518 519 520

	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;
521
		arg->is_current_entry = true;
522 523 524 525 526
	}

	ui_browser__set_color(&browser->b, color);
	hist_browser__gotorc(browser, row, 0);
	slsmg_write_nstring(" ", offset);
527 528
	slsmg_printf("%c", folded_sign);
	ui_browser__write_graph(&browser->b, show_annotated ? SLSMG_RARROW_CHAR : ' ');
529 530 531
	slsmg_write_nstring(str, width);
}

532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558
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;
}

559 560
#define LEVEL_OFFSET_STEP 3

561 562
static int hist_browser__show_callchain(struct hist_browser *browser,
					struct rb_root *root, int level,
563 564 565 566
					unsigned short row, u64 total,
					print_callchain_entry_fn print,
					struct callchain_print_arg *arg,
					check_output_full_fn is_output_full)
567 568
{
	struct rb_node *node;
569
	int first_row = row, offset = level * LEVEL_OFFSET_STEP;
570
	u64 new_total;
571
	bool need_percent;
572

573
	node = rb_first(root);
574
	need_percent = node && rb_next(node);
575

576 577 578
	while (node) {
		struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);
		struct rb_node *next = rb_next(node);
579
		u64 cumul = callchain_cumul_hits(child);
580 581 582 583 584 585
		struct callchain_list *chain;
		char folded_sign = ' ';
		int first = true;
		int extra_offset = 0;

		list_for_each_entry(chain, &child->val, list) {
586
			char bf[1024], *alloc_str;
587 588 589
			const char *str;
			bool was_first = first;

590
			if (first)
591
				first = false;
592
			else if (need_percent)
593 594 595
				extra_offset = LEVEL_OFFSET_STEP;

			folded_sign = callchain_list__folded(chain);
596 597
			if (arg->row_offset != 0) {
				arg->row_offset--;
598 599 600 601
				goto do_next;
			}

			alloc_str = NULL;
602 603
			str = callchain_list__sym_name(chain, bf, sizeof(bf),
						       browser->show_dso);
604

605
			if (was_first && need_percent) {
606
				double percent = cumul * 100.0 / total;
607 608 609 610 611 612 613

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

614 615
			print(browser, chain, str, offset + extra_offset, row, arg);

616 617
			free(alloc_str);

618
			if (is_output_full(browser, ++row))
619 620 621 622 623 624 625 626 627
				goto out;
do_next:
			if (folded_sign == '+')
				break;
		}

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

628 629 630 631
			if (callchain_param.mode == CHAIN_GRAPH_REL)
				new_total = child->children_hit;
			else
				new_total = total;
632

633
			row += hist_browser__show_callchain(browser, &child->rb_root,
634 635
							    new_level, row, new_total,
							    print, arg, is_output_full);
636
		}
637
		if (is_output_full(browser, row))
638
			break;
639
		node = next;
640
	}
641
out:
642 643 644
	return row - first_row;
}

645 646 647 648 649 650
struct hpp_arg {
	struct ui_browser *b;
	char folded_sign;
	bool current_entry;
};

651 652 653
static int __hpp__slsmg_color_printf(struct perf_hpp *hpp, const char *fmt, ...)
{
	struct hpp_arg *arg = hpp->ptr;
654
	int ret, len;
655 656
	va_list args;
	double percent;
657

658
	va_start(args, fmt);
659
	len = va_arg(args, int);
660 661
	percent = va_arg(args, double);
	va_end(args);
662

663
	ui_browser__set_percent_color(arg->b, percent, arg->current_entry);
664

665
	ret = scnprintf(hpp->buf, hpp->size, fmt, len, percent);
666
	slsmg_printf("%s", hpp->buf);
667

668
	advance_hpp(hpp, ret);
669 670 671
	return ret;
}

672
#define __HPP_COLOR_PERCENT_FN(_type, _field)				\
673 674 675 676 677
static u64 __hpp_get_##_field(struct hist_entry *he)			\
{									\
	return he->stat._field;						\
}									\
									\
678
static int								\
679
hist_browser__hpp_color_##_type(struct perf_hpp_fmt *fmt,		\
680 681
				struct perf_hpp *hpp,			\
				struct hist_entry *he)			\
682
{									\
683 684
	return hpp__fmt(fmt, hpp, he, __hpp_get_##_field, " %*.2f%%",	\
			__hpp__slsmg_color_printf, true);		\
685 686
}

687 688 689 690 691 692 693
#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								\
694
hist_browser__hpp_color_##_type(struct perf_hpp_fmt *fmt,		\
695 696 697 698
				struct perf_hpp *hpp,			\
				struct hist_entry *he)			\
{									\
	if (!symbol_conf.cumulate_callchain) {				\
699
		int len = fmt->user_len ?: fmt->len;			\
700
		int ret = scnprintf(hpp->buf, hpp->size,		\
701
				    "%*s", len, "N/A");			\
702 703 704 705
		slsmg_printf("%s", hpp->buf);				\
									\
		return ret;						\
	}								\
706 707
	return hpp__fmt(fmt, hpp, he, __hpp_get_acc_##_field,		\
			" %*.2f%%", __hpp__slsmg_color_printf, true);	\
708 709
}

710 711 712 713 714
__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)
715
__HPP_COLOR_ACC_PERCENT_FN(overhead_acc, period)
716

717
#undef __HPP_COLOR_PERCENT_FN
718
#undef __HPP_COLOR_ACC_PERCENT_FN
719 720 721 722 723 724 725 726 727 728 729 730 731

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;
732 733
	perf_hpp__format[PERF_HPP__OVERHEAD_ACC].color =
				hist_browser__hpp_color_overhead_acc;
734 735
}

736
static int hist_browser__show_entry(struct hist_browser *browser,
737 738 739 740
				    struct hist_entry *entry,
				    unsigned short row)
{
	char s[256];
741
	int printed = 0;
742
	int width = browser->b.width;
743
	char folded_sign = ' ';
744
	bool current_entry = ui_browser__is_current_entry(&browser->b, row);
745
	off_t row_offset = entry->row_offset;
746
	bool first = true;
747
	struct perf_hpp_fmt *fmt;
748 749

	if (current_entry) {
750 751
		browser->he_selection = entry;
		browser->selection = &entry->ms;
752 753 754
	}

	if (symbol_conf.use_callchain) {
755
		hist_entry__init_have_children(entry);
756 757 758 759
		folded_sign = hist_entry__folded(entry);
	}

	if (row_offset == 0) {
760
		struct hpp_arg arg = {
761
			.b		= &browser->b,
762 763 764
			.folded_sign	= folded_sign,
			.current_entry	= current_entry,
		};
765 766 767
		struct perf_hpp hpp = {
			.buf		= s,
			.size		= sizeof(s),
768
			.ptr		= &arg,
769
		};
770

771
		hist_browser__gotorc(browser, row, 0);
772

773
		perf_hpp__for_each_format(fmt) {
774 775 776
			if (perf_hpp__should_skip(fmt))
				continue;

777 778 779 780 781 782 783 784 785 786 787 788 789 790 791
			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 {
792 793 794
				slsmg_printf("  ");
				width -= 2;
			}
795

796
			if (fmt->color) {
797
				width -= fmt->color(fmt, &hpp, entry);
798
			} else {
799
				width -= fmt->entry(fmt, &hpp, entry);
800 801
				slsmg_printf("%s", s);
			}
802 803
		}

804 805 806 807
		/* The scroll bar isn't being used */
		if (!browser->b.navkeypressed)
			width += 1;

808 809
		slsmg_write_nstring("", width);

810 811 812 813 814
		++row;
		++printed;
	} else
		--row_offset;

815
	if (folded_sign == '-' && row != browser->b.rows) {
816
		u64 total = hists__total_period(entry->hists);
817 818 819 820
		struct callchain_print_arg arg = {
			.row_offset = row_offset,
			.is_current_entry = current_entry,
		};
821

822 823 824 825 826 827 828
		if (callchain_param.mode == CHAIN_GRAPH_REL) {
			if (symbol_conf.cumulate_callchain)
				total = entry->stat_acc->period;
			else
				total = entry->stat.period;
		}

829
		printed += hist_browser__show_callchain(browser,
830 831 832
					&entry->sorted_chain, 1, row, total,
					hist_browser__show_callchain_entry, &arg,
					hist_browser__check_output_full);
833

834
		if (arg.is_current_entry)
835
			browser->he_selection = entry;
836 837 838 839 840
	}

	return printed;
}

841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877
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;
}

878 879
static void hist_browser__show_headers(struct hist_browser *browser)
{
880 881 882
	char headers[1024];

	hists__scnprintf_headers(headers, sizeof(headers), browser->hists);
883 884
	ui_browser__gotorc(&browser->b, 0, 0);
	ui_browser__set_color(&browser->b, HE_COLORSET_ROOT);
885
	slsmg_write_nstring(headers, browser->b.width + 1);
886 887
}

888 889 890 891 892 893 894 895 896 897
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);
	}
}

898
static unsigned int hist_browser__refresh(struct ui_browser *browser)
899 900
{
	unsigned row = 0;
901
	u16 header_offset = 0;
902
	struct rb_node *nd;
903
	struct hist_browser *hb = container_of(browser, struct hist_browser, b);
904

905 906 907 908 909
	if (hb->show_headers) {
		hist_browser__show_headers(hb);
		header_offset = 1;
	}

910
	ui_browser__hists_init_top(browser);
911

912
	for (nd = browser->top; nd; nd = rb_next(nd)) {
913
		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
914
		float percent;
915 916 917 918

		if (h->filtered)
			continue;

919
		percent = hist_entry__get_percent_limit(h);
920 921 922
		if (percent < hb->min_pcnt)
			continue;

923
		row += hist_browser__show_entry(hb, h, row);
924
		if (row == browser->rows)
925 926 927
			break;
	}

928
	return row + header_offset;
929 930
}

931 932
static struct rb_node *hists__filter_entries(struct rb_node *nd,
					     float min_pcnt)
933 934 935
{
	while (nd != NULL) {
		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
936
		float percent = hist_entry__get_percent_limit(h);
937

938
		if (!h->filtered && percent >= min_pcnt)
939 940 941 942 943 944 945 946
			return nd;

		nd = rb_next(nd);
	}

	return NULL;
}

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

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

		nd = rb_prev(nd);
	}

	return NULL;
}

963
static void ui_browser__hists_seek(struct ui_browser *browser,
964 965 966 967 968
				   off_t offset, int whence)
{
	struct hist_entry *h;
	struct rb_node *nd;
	bool first = true;
969 970 971
	struct hist_browser *hb;

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

973
	if (browser->nr_entries == 0)
974 975
		return;

976
	ui_browser__hists_init_top(browser);
977

978 979
	switch (whence) {
	case SEEK_SET:
980
		nd = hists__filter_entries(rb_first(browser->entries),
981
					   hb->min_pcnt);
982 983
		break;
	case SEEK_CUR:
984
		nd = browser->top;
985 986
		goto do_offset;
	case SEEK_END:
987
		nd = hists__filter_prev_entries(rb_last(browser->entries),
988
						hb->min_pcnt);
989 990 991 992 993 994 995 996 997 998
		first = false;
		break;
	default:
		return;
	}

	/*
	 * Moves not relative to the first visible entry invalidates its
	 * row_offset:
	 */
999
	h = rb_entry(browser->top, struct hist_entry, rb_node);
1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026
	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;
1027
					browser->top = nd;
1028 1029 1030
					break;
				}
			}
1031
			nd = hists__filter_entries(rb_next(nd), hb->min_pcnt);
1032 1033 1034
			if (nd == NULL)
				break;
			--offset;
1035
			browser->top = nd;
1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047
		} 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;
1048
						browser->top = nd;
1049 1050 1051 1052 1053 1054 1055 1056 1057
						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;
1058
						browser->top = nd;
1059 1060 1061 1062 1063
						break;
					}
				}
			}

1064
			nd = hists__filter_prev_entries(rb_prev(nd),
1065
							hb->min_pcnt);
1066 1067 1068
			if (nd == NULL)
				break;
			++offset;
1069
			browser->top = nd;
1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083
			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 {
1084
		browser->top = nd;
1085 1086 1087 1088 1089
		h = rb_entry(nd, struct hist_entry, rb_node);
		h->row_offset = 0;
	}
}

1090
static int hist_browser__fprintf_callchain(struct hist_browser *browser,
1091
					   struct hist_entry *he, FILE *fp)
1092
{
1093 1094 1095 1096
	u64 total = hists__total_period(he->hists);
	struct callchain_print_arg arg  = {
		.fp = fp,
	};
1097

1098 1099
	if (symbol_conf.cumulate_callchain)
		total = he->stat_acc->period;
1100

1101 1102 1103 1104
	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;
1105 1106 1107 1108 1109 1110 1111 1112
}

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 = ' ';
1113 1114 1115 1116 1117 1118 1119
	struct perf_hpp hpp = {
		.buf = s,
		.size = sizeof(s),
	};
	struct perf_hpp_fmt *fmt;
	bool first = true;
	int ret;
1120 1121 1122 1123 1124 1125 1126

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

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

1127
	perf_hpp__for_each_format(fmt) {
1128 1129 1130
		if (perf_hpp__should_skip(fmt))
			continue;

1131 1132 1133 1134 1135
		if (!first) {
			ret = scnprintf(hpp.buf, hpp.size, "  ");
			advance_hpp(&hpp, ret);
		} else
			first = false;
1136

1137 1138 1139
		ret = fmt->entry(fmt, &hpp, he);
		advance_hpp(&hpp, ret);
	}
1140 1141 1142
	printed += fprintf(fp, "%s\n", rtrim(s));

	if (folded_sign == '-')
1143
		printed += hist_browser__fprintf_callchain(browser, he, fp);
1144 1145 1146 1147 1148 1149

	return printed;
}

static int hist_browser__fprintf(struct hist_browser *browser, FILE *fp)
{
1150 1151
	struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries),
						   browser->min_pcnt);
1152 1153 1154 1155 1156 1157
	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);
1158
		nd = hists__filter_entries(rb_next(nd), browser->min_pcnt);
1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184
	}

	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];
1185 1186
		const char *err = strerror_r(errno, bf, sizeof(bf));
		ui_helpline__fpush("Couldn't write to %s: %s", filename, err);
1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197
		return -1;
	}

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

	return 0;
}

1198 1199
static struct hist_browser *hist_browser__new(struct hists *hists)
{
1200
	struct hist_browser *browser = zalloc(sizeof(*browser));
1201

1202 1203 1204
	if (browser) {
		browser->hists = hists;
		browser->b.refresh = hist_browser__refresh;
1205
		browser->b.refresh_dimensions = hist_browser__refresh_dimensions;
1206 1207
		browser->b.seek = ui_browser__hists_seek;
		browser->b.use_navkeypressed = true;
1208
		browser->show_headers = symbol_conf.show_hist_headers;
1209 1210
	}

1211
	return browser;
1212 1213
}

1214
static void hist_browser__delete(struct hist_browser *browser)
1215
{
1216
	free(browser);
1217 1218
}

1219
static struct hist_entry *hist_browser__selected_entry(struct hist_browser *browser)
1220
{
1221
	return browser->he_selection;
1222 1223
}

1224
static struct thread *hist_browser__selected_thread(struct hist_browser *browser)
1225
{
1226
	return browser->he_selection->thread;
1227 1228
}

1229 1230 1231 1232 1233 1234 1235 1236 1237
/* 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)
1238
{
1239 1240
	char unit;
	int printed;
1241 1242 1243 1244
	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;
1245
	struct perf_evsel *evsel = hists_to_evsel(hists);
1246
	const char *ev_name = perf_evsel__name(evsel);
1247 1248 1249
	char buf[512];
	size_t buflen = sizeof(buf);

1250 1251 1252 1253 1254
	if (symbol_conf.filter_relative) {
		nr_samples = hists->stats.nr_non_filtered_samples;
		nr_events = hists->stats.total_non_filtered_period;
	}

1255
	if (perf_evsel__is_group_event(evsel)) {
1256 1257 1258 1259 1260 1261
		struct perf_evsel *pos;

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

		for_each_group_member(pos, evsel) {
1262 1263
			struct hists *pos_hists = evsel__hists(pos);

1264
			if (symbol_conf.filter_relative) {
1265 1266
				nr_samples += pos_hists->stats.nr_non_filtered_samples;
				nr_events += pos_hists->stats.total_non_filtered_period;
1267
			} else {
1268 1269
				nr_samples += pos_hists->stats.nr_events[PERF_RECORD_SAMPLE];
				nr_events += pos_hists->stats.total_period;
1270
			}
1271 1272
		}
	}
1273 1274 1275

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

1279

1280
	if (hists->uid_filter_str)
1281
		printed += snprintf(bf + printed, size - printed,
1282
				    ", UID: %s", hists->uid_filter_str);
1283
	if (thread)
1284
		printed += scnprintf(bf + printed, size - printed,
1285
				    ", Thread: %s(%d)",
1286
				     (thread->comm_set ? thread__comm_str(thread) : ""),
1287
				    thread->tid);
1288
	if (dso)
1289
		printed += scnprintf(bf + printed, size - printed,
1290
				    ", DSO: %s", dso->short_name);
1291 1292 1293 1294 1295 1296 1297
	if (!is_report_browser(hbt)) {
		struct perf_top *top = hbt->arg;

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

1298
	return printed;
1299 1300
}

1301 1302 1303 1304
static inline void free_popup_options(char **options, int n)
{
	int i;

1305 1306
	for (i = 0; i < n; ++i)
		zfree(&options[i]);
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 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358
/*
 * 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]) {
1359
				zfree(&options[nr_options]);
1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397
				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;
}

1398
static void hist_browser__update_nr_entries(struct hist_browser *hb)
1399 1400 1401 1402
{
	u64 nr_entries = 0;
	struct rb_node *nd = rb_first(&hb->hists->entries);

1403 1404 1405 1406 1407
	if (hb->min_pcnt == 0) {
		hb->nr_non_filtered_entries = hb->hists->nr_non_filtered_entries;
		return;
	}

1408
	while ((nd = hists__filter_entries(nd, hb->min_pcnt)) != NULL) {
1409
		nr_entries++;
1410
		nd = rb_next(nd);
1411 1412
	}

1413
	hb->nr_non_filtered_entries = nr_entries;
1414
}
1415

1416
static int perf_evsel__hists_browse(struct perf_evsel *evsel, int nr_events,
1417
				    const char *helpline,
1418
				    bool left_exits,
1419
				    struct hist_browser_timer *hbt,
1420
				    float min_pcnt,
1421
				    struct perf_session_env *env)
1422
{
1423
	struct hists *hists = evsel__hists(evsel);
1424
	struct hist_browser *browser = hist_browser__new(hists);
1425
	struct branch_info *bi;
1426
	struct pstack *fstack;
1427 1428
#define MAX_OPTIONS  16
	char *options[MAX_OPTIONS];
1429
	int nr_options = 0;
1430
	int key = -1;
1431
	char buf[64];
1432
	char script_opt[64];
1433
	int delay_secs = hbt ? hbt->refresh : 0;
1434
	struct perf_hpp_fmt *fmt;
1435

1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449
#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"				\
1450
	"F             Toggle percentage of filtered entries\n"		\
1451
	"H             Display column headers\n"			\
1452 1453 1454

	/* help messages are sorted by lexical order of the hotkey */
	const char report_help[] = HIST_BROWSER_HELP_COMMON
1455
	"i             Show header information\n"
1456 1457 1458 1459 1460 1461 1462 1463 1464 1465
	"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"
1466
	"z             Toggle zeroing of samples\n"
1467 1468
	"/             Filter symbol by name";

1469 1470 1471
	if (browser == NULL)
		return -1;

1472 1473
	if (min_pcnt) {
		browser->min_pcnt = min_pcnt;
1474
		hist_browser__update_nr_entries(browser);
1475 1476
	}

1477 1478 1479 1480 1481 1482
	fstack = pstack__new(2);
	if (fstack == NULL)
		goto out;

	ui_helpline__push(helpline);

1483 1484
	memset(options, 0, sizeof(options));

1485 1486 1487
	perf_hpp__for_each_format(fmt)
		perf_hpp__reset_width(fmt, hists);

1488 1489 1490
	if (symbol_conf.col_width_list_str)
		perf_hpp__set_user_width(symbol_conf.col_width_list_str);

1491
	while (1) {
1492
		struct thread *thread = NULL;
1493
		const struct dso *dso = NULL;
1494
		int choice = 0,
1495
		    annotate = -2, zoom_dso = -2, zoom_thread = -2,
1496
		    annotate_f = -2, annotate_t = -2, browse_map = -2;
1497 1498
		int scripts_comm = -2, scripts_symbol = -2,
		    scripts_all = -2, switch_data = -2;
1499

1500 1501
		nr_options = 0;

1502
		key = hist_browser__run(browser, hbt);
1503

1504 1505 1506 1507
		if (browser->he_selection != NULL) {
			thread = hist_browser__selected_thread(browser);
			dso = browser->selection->map ? browser->selection->map->dso : NULL;
		}
1508
		switch (key) {
1509 1510
		case K_TAB:
		case K_UNTAB:
1511 1512
			if (nr_events == 1)
				continue;
1513 1514 1515 1516 1517 1518
			/*
			 * Exit the browser, let hists__browser_tree
			 * go to the next or previous
			 */
			goto out_free_stack;
		case 'a':
1519
			if (!sort__has_sym) {
1520
				ui_browser__warning(&browser->b, delay_secs * 2,
1521
			"Annotation is only available for symbolic views, "
1522
			"include \"sym*\" in --sort to use it.");
1523 1524 1525
				continue;
			}

1526
			if (browser->selection == NULL ||
1527
			    browser->selection->sym == NULL ||
1528
			    browser->selection->map->dso->annotate_warned)
1529
				continue;
1530
			goto do_annotate;
1531 1532 1533
		case 'P':
			hist_browser__dump(browser);
			continue;
1534 1535
		case 'd':
			goto zoom_dso;
1536 1537 1538
		case 'V':
			browser->show_dso = !browser->show_dso;
			continue;
1539 1540
		case 't':
			goto zoom_thread;
1541
		case '/':
1542 1543 1544 1545
			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) {
1546 1547
				hists->symbol_filter_str = *buf ? buf : NULL;
				hists__filter_by_symbol(hists);
1548 1549 1550
				hist_browser__reset(browser);
			}
			continue;
1551
		case 'r':
1552
			if (is_report_browser(hbt))
1553 1554
				goto do_scripts;
			continue;
1555 1556 1557 1558
		case 's':
			if (is_report_browser(hbt))
				goto do_data_switch;
			continue;
1559 1560 1561 1562 1563
		case 'i':
			/* env->arch is NULL for live-mode (i.e. perf top) */
			if (env->arch)
				tui__header_window(env);
			continue;
1564 1565 1566
		case 'F':
			symbol_conf.filter_relative ^= 1;
			continue;
1567 1568 1569 1570 1571 1572 1573
		case 'z':
			if (!is_report_browser(hbt)) {
				struct perf_top *top = hbt->arg;

				top->zero = !top->zero;
			}
			continue;
1574
		case K_F1:
1575 1576
		case 'h':
		case '?':
1577
			ui_browser__help_window(&browser->b,
1578
				is_report_browser(hbt) ? report_help : top_help);
1579
			continue;
1580 1581
		case K_ENTER:
		case K_RIGHT:
1582 1583
			/* menu */
			break;
1584
		case K_LEFT: {
1585
			const void *top;
1586

1587 1588 1589 1590 1591 1592
			if (pstack__empty(fstack)) {
				/*
				 * Go back to the perf_evsel_menu__run or other user
				 */
				if (left_exits)
					goto out_free_stack;
1593
				continue;
1594
			}
1595
			top = pstack__pop(fstack);
1596
			if (top == &browser->hists->dso_filter)
1597
				goto zoom_out_dso;
1598
			if (top == &browser->hists->thread_filter)
1599 1600 1601
				goto zoom_out_thread;
			continue;
		}
1602
		case K_ESC:
1603
			if (!left_exits &&
1604 1605
			    !ui_browser__dialog_yesno(&browser->b,
					       "Do you really want to exit?"))
1606 1607
				continue;
			/* Fall thru */
1608 1609
		case 'q':
		case CTRL('c'):
1610
			goto out_free_stack;
1611 1612
		default:
			continue;
1613 1614
		}

1615
		if (!sort__has_sym)
1616 1617
			goto add_exit_option;

1618 1619 1620
		if (browser->selection == NULL)
			goto skip_annotation;

1621
		if (sort__mode == SORT_MODE__BRANCH) {
1622
			bi = browser->he_selection->branch_info;
1623 1624 1625 1626 1627

			if (bi == NULL)
				goto skip_annotation;

			if (bi->from.sym != NULL &&
1628
			    !bi->from.map->dso->annotate_warned &&
1629
			    asprintf(&options[nr_options], "Annotate %s", bi->from.sym->name) > 0) {
1630
				annotate_f = nr_options++;
1631
			}
1632

1633
			if (bi->to.sym != NULL &&
1634
			    !bi->to.map->dso->annotate_warned &&
1635 1636
			    (bi->to.sym != bi->from.sym ||
			     bi->to.map->dso != bi->from.map->dso) &&
1637
			    asprintf(&options[nr_options], "Annotate %s", bi->to.sym->name) > 0) {
1638
				annotate_t = nr_options++;
1639
			}
1640
		} else {
1641
			if (browser->selection->sym != NULL &&
1642 1643 1644 1645 1646 1647 1648
			    !browser->selection->map->dso->annotate_warned) {
				struct annotation *notes;

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

				if (notes->src &&
				    asprintf(&options[nr_options], "Annotate %s",
1649
						 browser->selection->sym->name) > 0) {
1650
					annotate = nr_options++;
1651
				}
1652
			}
1653
		}
1654
skip_annotation:
1655 1656
		if (thread != NULL &&
		    asprintf(&options[nr_options], "Zoom %s %s(%d) thread",
1657
			     (browser->hists->thread_filter ? "out of" : "into"),
1658
			     (thread->comm_set ? thread__comm_str(thread) : ""),
1659
			     thread->tid) > 0)
1660 1661 1662 1663
			zoom_thread = nr_options++;

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

1668 1669
		if (browser->selection != NULL &&
		    browser->selection->map != NULL &&
1670 1671
		    asprintf(&options[nr_options], "Browse map details") > 0)
			browse_map = nr_options++;
1672 1673 1674 1675 1676 1677

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

			if (asprintf(&options[nr_options], "Run scripts for samples of thread [%s]",
1678
				     thread__comm_str(browser->he_selection->thread)) > 0)
1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690
				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++;

1691 1692 1693
		if (is_report_browser(hbt) && asprintf(&options[nr_options],
				"Switch to another data file in PWD") > 0)
			switch_data = nr_options++;
1694
add_exit_option:
1695 1696
		if (asprintf(&options[nr_options], "Exit") > 0)
			nr_options++;
1697
retry_popup_menu:
1698
		choice = ui__popup_menu(nr_options, options);
1699 1700 1701 1702

		if (choice == nr_options - 1)
			break;

1703 1704
		if (choice == -1) {
			free_popup_options(options, nr_options - 1);
1705
			continue;
1706
		}
1707

1708
		if (choice == annotate || choice == annotate_t || choice == annotate_f) {
1709
			struct hist_entry *he;
1710
			struct annotation *notes;
1711
			struct map_symbol ms;
1712
			int err;
1713
do_annotate:
1714 1715 1716
			if (!objdump_path && perf_session_env__lookup_objdump(env))
				continue;

1717 1718 1719
			he = hist_browser__selected_entry(browser);
			if (he == NULL)
				continue;
1720 1721

			if (choice == annotate_f) {
1722 1723 1724 1725 1726 1727 1728
				ms.map = he->branch_info->from.map;
				ms.sym = he->branch_info->from.sym;
			} else if (choice == annotate_t) {
				ms.map = he->branch_info->to.map;
				ms.sym = he->branch_info->to.sym;
			} else {
				ms = *browser->selection;
1729 1730
			}

1731
			notes = symbol__annotation(ms.sym);
1732 1733 1734
			if (!notes->src)
				continue;

1735
			err = map_symbol__tui_annotate(&ms, evsel, hbt);
1736 1737 1738 1739 1740 1741 1742 1743
			/*
			 * 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;

1744
			ui_browser__update_nr_entries(&browser->b, browser->hists->nr_entries);
1745 1746
			if (err)
				ui_browser__handle_resize(&browser->b);
1747

1748 1749 1750 1751
		} else if (choice == browse_map)
			map__browse(browser->selection->map);
		else if (choice == zoom_dso) {
zoom_dso:
1752 1753
			if (browser->hists->dso_filter) {
				pstack__remove(fstack, &browser->hists->dso_filter);
1754 1755
zoom_out_dso:
				ui_helpline__pop();
1756
				browser->hists->dso_filter = NULL;
1757
				perf_hpp__set_elide(HISTC_DSO, false);
1758 1759 1760 1761 1762
			} 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);
1763
				browser->hists->dso_filter = dso;
1764
				perf_hpp__set_elide(HISTC_DSO, true);
1765
				pstack__push(fstack, &browser->hists->dso_filter);
1766
			}
1767
			hists__filter_by_dso(hists);
1768 1769 1770
			hist_browser__reset(browser);
		} else if (choice == zoom_thread) {
zoom_thread:
1771 1772
			if (browser->hists->thread_filter) {
				pstack__remove(fstack, &browser->hists->thread_filter);
1773 1774
zoom_out_thread:
				ui_helpline__pop();
1775
				thread__zput(browser->hists->thread_filter);
1776
				perf_hpp__set_elide(HISTC_THREAD, false);
1777 1778
			} else {
				ui_helpline__fpush("To zoom out press <- or -> + \"Zoom out of %s(%d) thread\"",
1779
						   thread->comm_set ? thread__comm_str(thread) : "",
1780
						   thread->tid);
1781
				browser->hists->thread_filter = thread__get(thread);
1782
				perf_hpp__set_elide(HISTC_THREAD, false);
1783
				pstack__push(fstack, &browser->hists->thread_filter);
1784
			}
1785
			hists__filter_by_thread(hists);
1786 1787
			hist_browser__reset(browser);
		}
1788 1789 1790 1791 1792 1793 1794
		/* 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)
1795
				sprintf(script_opt, " -c %s ", thread__comm_str(browser->he_selection->thread));
1796 1797 1798 1799 1800 1801

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

			script_browse(script_opt);
		}
1802 1803 1804 1805 1806 1807 1808 1809 1810 1811
		/* 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");
		}
1812 1813 1814 1815 1816
	}
out_free_stack:
	pstack__delete(fstack);
out:
	hist_browser__delete(browser);
1817
	free_popup_options(options, MAX_OPTIONS);
1818 1819 1820
	return key;
}

1821 1822 1823
struct perf_evsel_menu {
	struct ui_browser b;
	struct perf_evsel *selection;
1824
	bool lost_events, lost_events_warned;
1825
	float min_pcnt;
1826
	struct perf_session_env *env;
1827 1828 1829 1830 1831 1832 1833 1834
};

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);
1835
	struct hists *hists = evsel__hists(evsel);
1836
	bool current_entry = ui_browser__is_current_entry(browser, row);
1837
	unsigned long nr_events = hists->stats.nr_events[PERF_RECORD_SAMPLE];
1838
	const char *ev_name = perf_evsel__name(evsel);
1839
	char bf[256], unit;
1840 1841
	const char *warn = " ";
	size_t printed;
1842 1843 1844 1845

	ui_browser__set_color(browser, current_entry ? HE_COLORSET_SELECTED :
						       HE_COLORSET_NORMAL);

1846
	if (perf_evsel__is_group_event(evsel)) {
1847 1848 1849 1850 1851
		struct perf_evsel *pos;

		ev_name = perf_evsel__group_name(evsel);

		for_each_group_member(pos, evsel) {
1852 1853
			struct hists *pos_hists = evsel__hists(pos);
			nr_events += pos_hists->stats.nr_events[PERF_RECORD_SAMPLE];
1854 1855 1856
		}
	}

1857
	nr_events = convert_unit(nr_events, &unit);
1858
	printed = scnprintf(bf, sizeof(bf), "%lu%c%s%s", nr_events,
1859 1860 1861
			   unit, unit == ' ' ? "" : " ", ev_name);
	slsmg_printf("%s", bf);

1862
	nr_events = hists->stats.nr_events[PERF_RECORD_LOST];
1863 1864 1865 1866 1867
	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);
1868 1869
		printed += scnprintf(bf, sizeof(bf), ": %ld%c%schunks LOST!",
				     nr_events, unit, unit == ' ' ? "" : " ");
1870 1871 1872 1873
		warn = bf;
	}

	slsmg_write_nstring(warn, browser->width - printed);
1874 1875 1876 1877 1878

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

1879 1880
static int perf_evsel_menu__run(struct perf_evsel_menu *menu,
				int nr_events, const char *help,
1881
				struct hist_browser_timer *hbt)
1882
{
1883
	struct perf_evlist *evlist = menu->b.priv;
1884
	struct perf_evsel *pos;
1885
	const char *title = "Available samples";
1886
	int delay_secs = hbt ? hbt->refresh : 0;
1887
	int key;
1888

1889 1890 1891 1892 1893
	if (ui_browser__show(&menu->b, title,
			     "ESC: exit, ENTER|->: Browse histograms") < 0)
		return -1;

	while (1) {
1894
		key = ui_browser__run(&menu->b, delay_secs);
1895 1896

		switch (key) {
1897
		case K_TIMER:
1898
			hbt->timer(hbt->arg);
1899 1900 1901 1902 1903

			if (!menu->lost_events_warned && menu->lost_events) {
				ui_browser__warn_lost_events(&menu->b);
				menu->lost_events_warned = true;
			}
1904
			continue;
1905 1906
		case K_RIGHT:
		case K_ENTER:
1907 1908 1909 1910
			if (!menu->selection)
				continue;
			pos = menu->selection;
browse_hists:
1911 1912 1913 1914 1915
			perf_evlist__set_selected(evlist, pos);
			/*
			 * Give the calling tool a chance to populate the non
			 * default evsel resorted hists tree.
			 */
1916 1917
			if (hbt)
				hbt->timer(hbt->arg);
1918
			key = perf_evsel__hists_browse(pos, nr_events, help,
1919
						       true, hbt,
1920
						       menu->min_pcnt,
1921
						       menu->env);
1922
			ui_browser__show_title(&menu->b, title);
1923
			switch (key) {
1924
			case K_TAB:
1925
				if (pos->node.next == &evlist->entries)
1926
					pos = perf_evlist__first(evlist);
1927
				else
1928
					pos = perf_evsel__next(pos);
1929
				goto browse_hists;
1930
			case K_UNTAB:
1931
				if (pos->node.prev == &evlist->entries)
1932
					pos = perf_evlist__last(evlist);
1933
				else
1934
					pos = perf_evsel__prev(pos);
1935
				goto browse_hists;
1936
			case K_ESC:
1937 1938
				if (!ui_browser__dialog_yesno(&menu->b,
						"Do you really want to exit?"))
1939 1940
					continue;
				/* Fall thru */
1941
			case K_SWITCH_INPUT_DATA:
1942 1943 1944 1945 1946 1947
			case 'q':
			case CTRL('c'):
				goto out;
			default:
				continue;
			}
1948
		case K_LEFT:
1949
			continue;
1950
		case K_ESC:
1951 1952
			if (!ui_browser__dialog_yesno(&menu->b,
					       "Do you really want to exit?"))
1953 1954
				continue;
			/* Fall thru */
1955 1956 1957
		case 'q':
		case CTRL('c'):
			goto out;
1958
		default:
1959
			continue;
1960 1961 1962
		}
	}

1963 1964 1965 1966 1967
out:
	ui_browser__hide(&menu->b);
	return key;
}

1968
static bool filter_group_entries(struct ui_browser *browser __maybe_unused,
1969 1970 1971 1972 1973 1974 1975 1976 1977 1978
				 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;
}

1979
static int __perf_evlist__tui_browse_hists(struct perf_evlist *evlist,
1980
					   int nr_entries, const char *help,
1981
					   struct hist_browser_timer *hbt,
1982
					   float min_pcnt,
1983
					   struct perf_session_env *env)
1984 1985 1986 1987 1988 1989 1990 1991
{
	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,
1992 1993
			.filter	    = filter_group_entries,
			.nr_entries = nr_entries,
1994 1995
			.priv	    = evlist,
		},
1996
		.min_pcnt = min_pcnt,
1997
		.env = env,
1998 1999 2000 2001
	};

	ui_helpline__push("Press ESC to exit");

2002
	evlist__for_each(evlist, pos) {
2003
		const char *ev_name = perf_evsel__name(pos);
2004 2005 2006 2007 2008 2009
		size_t line_len = strlen(ev_name) + 7;

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

2010
	return perf_evsel_menu__run(&menu, nr_entries, help, hbt);
2011 2012
}

2013
int perf_evlist__tui_browse_hists(struct perf_evlist *evlist, const char *help,
2014
				  struct hist_browser_timer *hbt,
2015
				  float min_pcnt,
2016
				  struct perf_session_env *env)
2017
{
2018 2019 2020 2021
	int nr_entries = evlist->nr_entries;

single_entry:
	if (nr_entries == 1) {
2022
		struct perf_evsel *first = perf_evlist__first(evlist);
2023 2024

		return perf_evsel__hists_browse(first, nr_entries, help,
2025
						false, hbt, min_pcnt,
2026
						env);
2027 2028
	}

2029 2030 2031 2032
	if (symbol_conf.event_group) {
		struct perf_evsel *pos;

		nr_entries = 0;
2033
		evlist__for_each(evlist, pos) {
2034 2035
			if (perf_evsel__is_group_leader(pos))
				nr_entries++;
2036
		}
2037 2038 2039 2040 2041 2042

		if (nr_entries == 1)
			goto single_entry;
	}

	return __perf_evlist__tui_browse_hists(evlist, nr_entries, help,
2043
					       hbt, min_pcnt, env);
2044
}