hist.c 58.5 KB
Newer Older
1
#include "util.h"
2
#include "build-id.h"
3
#include "hist.h"
4 5
#include "session.h"
#include "sort.h"
6
#include "evlist.h"
7
#include "evsel.h"
8
#include "annotate.h"
9
#include "ui/progress.h"
10
#include <math.h>
11

12 13 14 15
static bool hists__filter_entry_by_dso(struct hists *hists,
				       struct hist_entry *he);
static bool hists__filter_entry_by_thread(struct hists *hists,
					  struct hist_entry *he);
16 17
static bool hists__filter_entry_by_symbol(struct hists *hists,
					  struct hist_entry *he);
18 19
static bool hists__filter_entry_by_socket(struct hists *hists,
					  struct hist_entry *he);
20

21
u16 hists__col_len(struct hists *hists, enum hist_column col)
22
{
23
	return hists->col_len[col];
24 25
}

26
void hists__set_col_len(struct hists *hists, enum hist_column col, u16 len)
27
{
28
	hists->col_len[col] = len;
29 30
}

31
bool hists__new_col_len(struct hists *hists, enum hist_column col, u16 len)
32
{
33 34
	if (len > hists__col_len(hists, col)) {
		hists__set_col_len(hists, col, len);
35 36 37 38 39
		return true;
	}
	return false;
}

40
void hists__reset_col_len(struct hists *hists)
41 42 43 44
{
	enum hist_column col;

	for (col = 0; col < HISTC_NR_COLS; ++col)
45
		hists__set_col_len(hists, col, 0);
46 47
}

48 49 50 51 52 53 54 55 56 57
static void hists__set_unres_dso_col_len(struct hists *hists, int dso)
{
	const unsigned int unresolved_col_width = BITS_PER_LONG / 4;

	if (hists__col_len(hists, dso) < unresolved_col_width &&
	    !symbol_conf.col_width_list_str && !symbol_conf.field_sep &&
	    !symbol_conf.dso_list)
		hists__set_col_len(hists, dso, unresolved_col_width);
}

58
void hists__calc_col_len(struct hists *hists, struct hist_entry *h)
59
{
60
	const unsigned int unresolved_col_width = BITS_PER_LONG / 4;
61
	int symlen;
62 63
	u16 len;

64 65 66 67 68 69 70 71 72 73 74
	/*
	 * +4 accounts for '[x] ' priv level info
	 * +2 accounts for 0x prefix on raw addresses
	 * +3 accounts for ' y ' symtab origin info
	 */
	if (h->ms.sym) {
		symlen = h->ms.sym->namelen + 4;
		if (verbose)
			symlen += BITS_PER_LONG / 4 + 2 + 3;
		hists__new_col_len(hists, HISTC_SYMBOL, symlen);
	} else {
75 76
		symlen = unresolved_col_width + 4 + 2;
		hists__new_col_len(hists, HISTC_SYMBOL, symlen);
77
		hists__set_unres_dso_col_len(hists, HISTC_DSO);
78
	}
79 80

	len = thread__comm_len(h->thread);
81
	if (hists__new_col_len(hists, HISTC_COMM, len))
82
		hists__set_col_len(hists, HISTC_THREAD, len + 8);
83 84 85

	if (h->ms.map) {
		len = dso__name_len(h->ms.map->dso);
86
		hists__new_col_len(hists, HISTC_DSO, len);
87
	}
88

89 90 91
	if (h->parent)
		hists__new_col_len(hists, HISTC_PARENT, h->parent->namelen);

92 93 94
	if (h->branch_info) {
		if (h->branch_info->from.sym) {
			symlen = (int)h->branch_info->from.sym->namelen + 4;
95 96
			if (verbose)
				symlen += BITS_PER_LONG / 4 + 2 + 3;
97 98 99 100 101 102 103 104 105 106 107 108
			hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen);

			symlen = dso__name_len(h->branch_info->from.map->dso);
			hists__new_col_len(hists, HISTC_DSO_FROM, symlen);
		} else {
			symlen = unresolved_col_width + 4 + 2;
			hists__new_col_len(hists, HISTC_SYMBOL_FROM, symlen);
			hists__set_unres_dso_col_len(hists, HISTC_DSO_FROM);
		}

		if (h->branch_info->to.sym) {
			symlen = (int)h->branch_info->to.sym->namelen + 4;
109 110
			if (verbose)
				symlen += BITS_PER_LONG / 4 + 2 + 3;
111 112 113 114 115 116 117 118 119
			hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen);

			symlen = dso__name_len(h->branch_info->to.map->dso);
			hists__new_col_len(hists, HISTC_DSO_TO, symlen);
		} else {
			symlen = unresolved_col_width + 4 + 2;
			hists__new_col_len(hists, HISTC_SYMBOL_TO, symlen);
			hists__set_unres_dso_col_len(hists, HISTC_DSO_TO);
		}
120 121 122 123 124 125 126

		if (h->branch_info->srcline_from)
			hists__new_col_len(hists, HISTC_SRCLINE_FROM,
					strlen(h->branch_info->srcline_from));
		if (h->branch_info->srcline_to)
			hists__new_col_len(hists, HISTC_SRCLINE_TO,
					strlen(h->branch_info->srcline_to));
127
	}
128 129 130 131 132 133 134

	if (h->mem_info) {
		if (h->mem_info->daddr.sym) {
			symlen = (int)h->mem_info->daddr.sym->namelen + 4
			       + unresolved_col_width + 2;
			hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL,
					   symlen);
D
Don Zickus 已提交
135 136
			hists__new_col_len(hists, HISTC_MEM_DCACHELINE,
					   symlen + 1);
137 138 139 140
		} else {
			symlen = unresolved_col_width + 4 + 2;
			hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL,
					   symlen);
141 142
			hists__new_col_len(hists, HISTC_MEM_DCACHELINE,
					   symlen);
143
		}
144 145 146 147 148 149 150 151 152 153 154 155

		if (h->mem_info->iaddr.sym) {
			symlen = (int)h->mem_info->iaddr.sym->namelen + 4
			       + unresolved_col_width + 2;
			hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL,
					   symlen);
		} else {
			symlen = unresolved_col_width + 4 + 2;
			hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL,
					   symlen);
		}

156 157 158 159 160 161 162 163 164 165 166
		if (h->mem_info->daddr.map) {
			symlen = dso__name_len(h->mem_info->daddr.map->dso);
			hists__new_col_len(hists, HISTC_MEM_DADDR_DSO,
					   symlen);
		} else {
			symlen = unresolved_col_width + 4 + 2;
			hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO);
		}
	} else {
		symlen = unresolved_col_width + 4 + 2;
		hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL, symlen);
167
		hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL, symlen);
168 169 170
		hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO);
	}

171
	hists__new_col_len(hists, HISTC_CPU, 3);
172
	hists__new_col_len(hists, HISTC_SOCKET, 6);
173 174 175 176 177 178
	hists__new_col_len(hists, HISTC_MEM_LOCKED, 6);
	hists__new_col_len(hists, HISTC_MEM_TLB, 22);
	hists__new_col_len(hists, HISTC_MEM_SNOOP, 12);
	hists__new_col_len(hists, HISTC_MEM_LVL, 21 + 3);
	hists__new_col_len(hists, HISTC_LOCAL_WEIGHT, 12);
	hists__new_col_len(hists, HISTC_GLOBAL_WEIGHT, 12);
179

180 181 182
	if (h->srcline)
		hists__new_col_len(hists, HISTC_SRCLINE, strlen(h->srcline));

183 184 185
	if (h->srcfile)
		hists__new_col_len(hists, HISTC_SRCFILE, strlen(h->srcfile));

186 187 188
	if (h->transaction)
		hists__new_col_len(hists, HISTC_TRANSACTION,
				   hist_entry__transaction_len());
189 190 191

	if (h->trace_output)
		hists__new_col_len(hists, HISTC_TRACE, strlen(h->trace_output));
192 193
}

194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209
void hists__output_recalc_col_len(struct hists *hists, int max_rows)
{
	struct rb_node *next = rb_first(&hists->entries);
	struct hist_entry *n;
	int row = 0;

	hists__reset_col_len(hists);

	while (next && row++ < max_rows) {
		n = rb_entry(next, struct hist_entry, rb_node);
		if (!n->filtered)
			hists__calc_col_len(hists, n);
		next = rb_next(&n->rb_node);
	}
}

210 211
static void he_stat__add_cpumode_period(struct he_stat *he_stat,
					unsigned int cpumode, u64 period)
212
{
213
	switch (cpumode) {
214
	case PERF_RECORD_MISC_KERNEL:
215
		he_stat->period_sys += period;
216 217
		break;
	case PERF_RECORD_MISC_USER:
218
		he_stat->period_us += period;
219 220
		break;
	case PERF_RECORD_MISC_GUEST_KERNEL:
221
		he_stat->period_guest_sys += period;
222 223
		break;
	case PERF_RECORD_MISC_GUEST_USER:
224
		he_stat->period_guest_us += period;
225 226 227 228 229 230
		break;
	default:
		break;
	}
}

231 232
static void he_stat__add_period(struct he_stat *he_stat, u64 period,
				u64 weight)
233
{
234

235
	he_stat->period		+= period;
236
	he_stat->weight		+= weight;
237 238 239 240 241 242 243 244 245 246 247
	he_stat->nr_events	+= 1;
}

static void he_stat__add_stat(struct he_stat *dest, struct he_stat *src)
{
	dest->period		+= src->period;
	dest->period_sys	+= src->period_sys;
	dest->period_us		+= src->period_us;
	dest->period_guest_sys	+= src->period_guest_sys;
	dest->period_guest_us	+= src->period_guest_us;
	dest->nr_events		+= src->nr_events;
248
	dest->weight		+= src->weight;
249 250
}

251
static void he_stat__decay(struct he_stat *he_stat)
252
{
253 254
	he_stat->period = (he_stat->period * 7) / 8;
	he_stat->nr_events = (he_stat->nr_events * 7) / 8;
255
	/* XXX need decay for weight too? */
256 257
}

258 259
static void hists__delete_entry(struct hists *hists, struct hist_entry *he);

260 261
static bool hists__decay_entry(struct hists *hists, struct hist_entry *he)
{
262
	u64 prev_period = he->stat.period;
263
	u64 diff;
264 265

	if (prev_period == 0)
266
		return true;
267

268
	he_stat__decay(&he->stat);
269 270
	if (symbol_conf.cumulate_callchain)
		he_stat__decay(he->stat_acc);
271
	decay_callchain(he->callchain);
272

273 274
	diff = prev_period - he->stat.period;

275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291
	if (!he->depth) {
		hists->stats.total_period -= diff;
		if (!he->filtered)
			hists->stats.total_non_filtered_period -= diff;
	}

	if (!he->leaf) {
		struct hist_entry *child;
		struct rb_node *node = rb_first(&he->hroot_out);
		while (node) {
			child = rb_entry(node, struct hist_entry, rb_node);
			node = rb_next(node);

			if (hists__decay_entry(hists, child))
				hists__delete_entry(hists, child);
		}
	}
292

293
	return he->stat.period == 0;
294 295
}

296 297
static void hists__delete_entry(struct hists *hists, struct hist_entry *he)
{
298 299 300 301 302 303 304
	struct rb_root *root_in;
	struct rb_root *root_out;

	if (he->parent_he) {
		root_in  = &he->parent_he->hroot_in;
		root_out = &he->parent_he->hroot_out;
	} else {
305
		if (hists__has(hists, need_collapse))
306 307 308 309 310
			root_in = &hists->entries_collapsed;
		else
			root_in = hists->entries_in;
		root_out = &hists->entries;
	}
311

312 313
	rb_erase(&he->rb_node_in, root_in);
	rb_erase(&he->rb_node, root_out);
314 315 316 317 318 319 320 321

	--hists->nr_entries;
	if (!he->filtered)
		--hists->nr_non_filtered_entries;

	hist_entry__delete(he);
}

322
void hists__decay_entries(struct hists *hists, bool zap_user, bool zap_kernel)
323 324 325 326 327 328 329
{
	struct rb_node *next = rb_first(&hists->entries);
	struct hist_entry *n;

	while (next) {
		n = rb_entry(next, struct hist_entry, rb_node);
		next = rb_next(&n->rb_node);
330 331
		if (((zap_user && n->level == '.') ||
		     (zap_kernel && n->level != '.') ||
332
		     hists__decay_entry(hists, n))) {
333
			hists__delete_entry(hists, n);
334 335 336 337
		}
	}
}

N
Namhyung Kim 已提交
338 339 340 341 342 343 344 345 346
void hists__delete_entries(struct hists *hists)
{
	struct rb_node *next = rb_first(&hists->entries);
	struct hist_entry *n;

	while (next) {
		n = rb_entry(next, struct hist_entry, rb_node);
		next = rb_next(&n->rb_node);

347
		hists__delete_entry(hists, n);
N
Namhyung Kim 已提交
348 349 350
	}
}

351
/*
352
 * histogram, sorted on item, collects periods
353 354
 */

355 356 357
static int hist_entry__init(struct hist_entry *he,
			    struct hist_entry *template,
			    bool sample_self)
358
{
359 360 361 362 363 364 365 366 367 368
	*he = *template;

	if (symbol_conf.cumulate_callchain) {
		he->stat_acc = malloc(sizeof(he->stat));
		if (he->stat_acc == NULL)
			return -ENOMEM;
		memcpy(he->stat_acc, &he->stat, sizeof(he->stat));
		if (!sample_self)
			memset(&he->stat, 0, sizeof(he->stat));
	}
369

370 371 372 373 374 375 376 377 378 379 380 381 382 383
	map__get(he->ms.map);

	if (he->branch_info) {
		/*
		 * This branch info is (a part of) allocated from
		 * sample__resolve_bstack() and will be freed after
		 * adding new entries.  So we need to save a copy.
		 */
		he->branch_info = malloc(sizeof(*he->branch_info));
		if (he->branch_info == NULL) {
			map__zput(he->ms.map);
			free(he->stat_acc);
			return -ENOMEM;
		}
384

385 386
		memcpy(he->branch_info, template->branch_info,
		       sizeof(*he->branch_info));
387

388 389 390
		map__get(he->branch_info->from.map);
		map__get(he->branch_info->to.map);
	}
391

392 393 394 395
	if (he->mem_info) {
		map__get(he->mem_info->iaddr.map);
		map__get(he->mem_info->daddr.map);
	}
396

397 398
	if (symbol_conf.use_callchain)
		callchain_init(he->callchain);
399

400 401
	if (he->raw_data) {
		he->raw_data = memdup(he->raw_data, he->raw_size);
402

403 404 405 406 407 408 409 410 411 412 413 414 415
		if (he->raw_data == NULL) {
			map__put(he->ms.map);
			if (he->branch_info) {
				map__put(he->branch_info->from.map);
				map__put(he->branch_info->to.map);
				free(he->branch_info);
			}
			if (he->mem_info) {
				map__put(he->mem_info->iaddr.map);
				map__put(he->mem_info->daddr.map);
			}
			free(he->stat_acc);
			return -ENOMEM;
416
		}
417 418 419
	}
	INIT_LIST_HEAD(&he->pairs.node);
	thread__get(he->thread);
420

421 422
	if (!symbol_conf.report_hierarchy)
		he->leaf = true;
423

424 425 426
	return 0;
}

J
Jiri Olsa 已提交
427 428 429 430 431 432 433 434 435 436 437 438 439 440 441
static void *hist_entry__zalloc(size_t size)
{
	return zalloc(size + sizeof(struct hist_entry));
}

static void hist_entry__free(void *ptr)
{
	free(ptr);
}

static struct hist_entry_ops default_ops = {
	.new	= hist_entry__zalloc,
	.free	= hist_entry__free,
};

442 443 444
static struct hist_entry *hist_entry__new(struct hist_entry *template,
					  bool sample_self)
{
J
Jiri Olsa 已提交
445
	struct hist_entry_ops *ops = template->ops;
446 447 448
	size_t callchain_size = 0;
	struct hist_entry *he;
	int err = 0;
449

J
Jiri Olsa 已提交
450 451 452
	if (!ops)
		ops = template->ops = &default_ops;

453 454 455
	if (symbol_conf.use_callchain)
		callchain_size = sizeof(struct callchain_root);

J
Jiri Olsa 已提交
456
	he = ops->new(callchain_size);
457 458
	if (he) {
		err = hist_entry__init(he, template, sample_self);
J
Jiri Olsa 已提交
459 460 461 462
		if (err) {
			ops->free(he);
			he = NULL;
		}
463 464
	}

465
	return he;
466 467
}

468 469 470 471 472 473 474
static u8 symbol__parent_filter(const struct symbol *parent)
{
	if (symbol_conf.exclude_other && parent == NULL)
		return 1 << HIST_FILTER__PARENT;
	return 0;
}

475 476 477 478 479 480 481 482 483 484
static void hist_entry__add_callchain_period(struct hist_entry *he, u64 period)
{
	if (!symbol_conf.use_callchain)
		return;

	he->hists->callchain_period += period;
	if (!he->filtered)
		he->hists->callchain_non_filtered_period += period;
}

485 486 487 488
static struct hist_entry *hists__findnew_entry(struct hists *hists,
					       struct hist_entry *entry,
					       struct addr_location *al,
					       bool sample_self)
489
{
490
	struct rb_node **p;
491 492
	struct rb_node *parent = NULL;
	struct hist_entry *he;
493
	int64_t cmp;
494 495
	u64 period = entry->stat.period;
	u64 weight = entry->stat.weight;
496

497 498
	p = &hists->entries_in->rb_node;

499 500
	while (*p != NULL) {
		parent = *p;
501
		he = rb_entry(parent, struct hist_entry, rb_node_in);
502

503 504 505 506 507 508 509
		/*
		 * Make sure that it receives arguments in a same order as
		 * hist_entry__collapse() so that we can use an appropriate
		 * function when searching an entry regardless which sort
		 * keys were used.
		 */
		cmp = hist_entry__cmp(he, entry);
510 511

		if (!cmp) {
512
			if (sample_self) {
513
				he_stat__add_period(&he->stat, period, weight);
514
				hist_entry__add_callchain_period(he, period);
515
			}
516 517
			if (symbol_conf.cumulate_callchain)
				he_stat__add_period(he->stat_acc, period, weight);
518

519
			/*
520
			 * This mem info was allocated from sample__resolve_mem
521 522
			 * and will not be used anymore.
			 */
523
			zfree(&entry->mem_info);
524

525 526 527 528 529 530 531
			/* If the map of an existing hist_entry has
			 * become out-of-date due to an exec() or
			 * similar, update it.  Otherwise we will
			 * mis-adjust symbol addresses when computing
			 * the history counter to increment.
			 */
			if (he->ms.map != entry->ms.map) {
532 533
				map__put(he->ms.map);
				he->ms.map = map__get(entry->ms.map);
534
			}
535
			goto out;
536 537 538 539 540 541 542 543
		}

		if (cmp < 0)
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}

544
	he = hist_entry__new(entry, sample_self);
545
	if (!he)
546
		return NULL;
547

548
	if (sample_self)
549 550
		hist_entry__add_callchain_period(he, period);
	hists->nr_entries++;
551

552 553
	rb_link_node(&he->rb_node_in, parent, p);
	rb_insert_color(&he->rb_node_in, hists->entries_in);
554
out:
555 556
	if (sample_self)
		he_stat__add_cpumode_period(&he->stat, al->cpumode, period);
557 558
	if (symbol_conf.cumulate_callchain)
		he_stat__add_cpumode_period(he->stat_acc, al->cpumode, period);
559 560 561
	return he;
}

562 563 564 565 566 567 568 569 570
static struct hist_entry*
__hists__add_entry(struct hists *hists,
		   struct addr_location *al,
		   struct symbol *sym_parent,
		   struct branch_info *bi,
		   struct mem_info *mi,
		   struct perf_sample *sample,
		   bool sample_self,
		   struct hist_entry_ops *ops)
571 572 573
{
	struct hist_entry entry = {
		.thread	= al->thread,
574
		.comm = thread__comm(al->thread),
575 576 577 578
		.ms = {
			.map	= al->map,
			.sym	= al->sym,
		},
579
		.socket	 = al->socket,
580 581 582 583
		.cpu	 = al->cpu,
		.cpumode = al->cpumode,
		.ip	 = al->addr,
		.level	 = al->level,
584
		.stat = {
585
			.nr_events = 1,
586 587
			.period	= sample->period,
			.weight = sample->weight,
588
		},
589
		.parent = sym_parent,
590
		.filtered = symbol__parent_filter(sym_parent) | al->filtered,
591
		.hists	= hists,
592 593
		.branch_info = bi,
		.mem_info = mi,
594
		.transaction = sample->transaction,
595 596
		.raw_data = sample->raw_data,
		.raw_size = sample->raw_size,
597
		.ops = ops,
598 599
	};

600
	return hists__findnew_entry(hists, &entry, al, sample_self);
601 602
}

603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627
struct hist_entry *hists__add_entry(struct hists *hists,
				    struct addr_location *al,
				    struct symbol *sym_parent,
				    struct branch_info *bi,
				    struct mem_info *mi,
				    struct perf_sample *sample,
				    bool sample_self)
{
	return __hists__add_entry(hists, al, sym_parent, bi, mi,
				  sample, sample_self, NULL);
}

struct hist_entry *hists__add_entry_ops(struct hists *hists,
					struct hist_entry_ops *ops,
					struct addr_location *al,
					struct symbol *sym_parent,
					struct branch_info *bi,
					struct mem_info *mi,
					struct perf_sample *sample,
					bool sample_self)
{
	return __hists__add_entry(hists, al, sym_parent, bi, mi,
				  sample, sample_self, ops);
}

628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660
static int
iter_next_nop_entry(struct hist_entry_iter *iter __maybe_unused,
		    struct addr_location *al __maybe_unused)
{
	return 0;
}

static int
iter_add_next_nop_entry(struct hist_entry_iter *iter __maybe_unused,
			struct addr_location *al __maybe_unused)
{
	return 0;
}

static int
iter_prepare_mem_entry(struct hist_entry_iter *iter, struct addr_location *al)
{
	struct perf_sample *sample = iter->sample;
	struct mem_info *mi;

	mi = sample__resolve_mem(sample, al);
	if (mi == NULL)
		return -ENOMEM;

	iter->priv = mi;
	return 0;
}

static int
iter_add_single_mem_entry(struct hist_entry_iter *iter, struct addr_location *al)
{
	u64 cost;
	struct mem_info *mi = iter->priv;
661
	struct hists *hists = evsel__hists(iter->evsel);
662
	struct perf_sample *sample = iter->sample;
663 664 665 666 667
	struct hist_entry *he;

	if (mi == NULL)
		return -EINVAL;

668
	cost = sample->weight;
669 670 671 672 673 674 675 676 677 678
	if (!cost)
		cost = 1;

	/*
	 * must pass period=weight in order to get the correct
	 * sorting from hists__collapse_resort() which is solely
	 * based on periods. We want sorting be done on nr_events * weight
	 * and this is indirectly achieved by passing period=weight here
	 * and the he_stat__add_period() function.
	 */
679 680
	sample->period = cost;

681 682
	he = hists__add_entry(hists, al, iter->parent, NULL, mi,
			      sample, true);
683 684 685 686 687 688 689 690
	if (!he)
		return -ENOMEM;

	iter->he = he;
	return 0;
}

static int
691 692
iter_finish_mem_entry(struct hist_entry_iter *iter,
		      struct addr_location *al __maybe_unused)
693 694
{
	struct perf_evsel *evsel = iter->evsel;
695
	struct hists *hists = evsel__hists(evsel);
696 697 698 699 700 701
	struct hist_entry *he = iter->he;
	int err = -EINVAL;

	if (he == NULL)
		goto out;

702
	hists__inc_nr_samples(hists, he->filtered);
703 704 705 706 707

	err = hist_entry__append_callchain(he, iter->sample);

out:
	/*
708 709 710
	 * We don't need to free iter->priv (mem_info) here since the mem info
	 * was either already freed in hists__findnew_entry() or passed to a
	 * new hist entry by hist_entry__new().
711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735
	 */
	iter->priv = NULL;

	iter->he = NULL;
	return err;
}

static int
iter_prepare_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
{
	struct branch_info *bi;
	struct perf_sample *sample = iter->sample;

	bi = sample__resolve_bstack(sample, al);
	if (!bi)
		return -ENOMEM;

	iter->curr = 0;
	iter->total = sample->branch_stack->nr;

	iter->priv = bi;
	return 0;
}

static int
736
iter_add_single_branch_entry(struct hist_entry_iter *iter,
737 738
			     struct addr_location *al __maybe_unused)
{
739 740 741
	/* to avoid calling callback function */
	iter->he = NULL;

742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765
	return 0;
}

static int
iter_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
{
	struct branch_info *bi = iter->priv;
	int i = iter->curr;

	if (bi == NULL)
		return 0;

	if (iter->curr >= iter->total)
		return 0;

	al->map = bi[i].to.map;
	al->sym = bi[i].to.sym;
	al->addr = bi[i].to.addr;
	return 1;
}

static int
iter_add_next_branch_entry(struct hist_entry_iter *iter, struct addr_location *al)
{
766
	struct branch_info *bi;
767
	struct perf_evsel *evsel = iter->evsel;
768
	struct hists *hists = evsel__hists(evsel);
769
	struct perf_sample *sample = iter->sample;
770 771 772 773 774 775 776 777 778 779 780 781 782
	struct hist_entry *he = NULL;
	int i = iter->curr;
	int err = 0;

	bi = iter->priv;

	if (iter->hide_unresolved && !(bi[i].from.sym && bi[i].to.sym))
		goto out;

	/*
	 * The report shows the percentage of total branches captured
	 * and not events sampled. Thus we use a pseudo period of 1.
	 */
783 784 785
	sample->period = 1;
	sample->weight = bi->flags.cycles ? bi->flags.cycles : 1;

786 787
	he = hists__add_entry(hists, al, iter->parent, &bi[i], NULL,
			      sample, true);
788 789 790
	if (he == NULL)
		return -ENOMEM;

791
	hists__inc_nr_samples(hists, he->filtered);
792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822

out:
	iter->he = he;
	iter->curr++;
	return err;
}

static int
iter_finish_branch_entry(struct hist_entry_iter *iter,
			 struct addr_location *al __maybe_unused)
{
	zfree(&iter->priv);
	iter->he = NULL;

	return iter->curr >= iter->total ? 0 : -1;
}

static int
iter_prepare_normal_entry(struct hist_entry_iter *iter __maybe_unused,
			  struct addr_location *al __maybe_unused)
{
	return 0;
}

static int
iter_add_single_normal_entry(struct hist_entry_iter *iter, struct addr_location *al)
{
	struct perf_evsel *evsel = iter->evsel;
	struct perf_sample *sample = iter->sample;
	struct hist_entry *he;

823 824
	he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,
			      sample, true);
825 826 827 828 829 830 831 832
	if (he == NULL)
		return -ENOMEM;

	iter->he = he;
	return 0;
}

static int
833 834
iter_finish_normal_entry(struct hist_entry_iter *iter,
			 struct addr_location *al __maybe_unused)
835 836 837 838 839 840 841 842 843 844
{
	struct hist_entry *he = iter->he;
	struct perf_evsel *evsel = iter->evsel;
	struct perf_sample *sample = iter->sample;

	if (he == NULL)
		return 0;

	iter->he = NULL;

845
	hists__inc_nr_samples(evsel__hists(evsel), he->filtered);
846 847 848 849

	return hist_entry__append_callchain(he, sample);
}

850
static int
851
iter_prepare_cumulative_entry(struct hist_entry_iter *iter,
852 853
			      struct addr_location *al __maybe_unused)
{
854 855
	struct hist_entry **he_cache;

856
	callchain_cursor_commit(&callchain_cursor);
857 858 859 860 861 862

	/*
	 * This is for detecting cycles or recursions so that they're
	 * cumulated only one time to prevent entries more than 100%
	 * overhead.
	 */
863
	he_cache = malloc(sizeof(*he_cache) * (iter->max_stack + 1));
864 865 866 867 868 869
	if (he_cache == NULL)
		return -ENOMEM;

	iter->priv = he_cache;
	iter->curr = 0;

870 871 872 873 874 875 876 877
	return 0;
}

static int
iter_add_single_cumulative_entry(struct hist_entry_iter *iter,
				 struct addr_location *al)
{
	struct perf_evsel *evsel = iter->evsel;
878
	struct hists *hists = evsel__hists(evsel);
879
	struct perf_sample *sample = iter->sample;
880
	struct hist_entry **he_cache = iter->priv;
881 882 883
	struct hist_entry *he;
	int err = 0;

884 885
	he = hists__add_entry(hists, al, iter->parent, NULL, NULL,
			      sample, true);
886 887 888 889
	if (he == NULL)
		return -ENOMEM;

	iter->he = he;
890
	he_cache[iter->curr++] = he;
891

892
	hist_entry__append_callchain(he, sample);
893 894 895 896 897 898 899

	/*
	 * We need to re-initialize the cursor since callchain_append()
	 * advanced the cursor to the end.
	 */
	callchain_cursor_commit(&callchain_cursor);

900
	hists__inc_nr_samples(hists, he->filtered);
901 902 903 904 905 906 907 908 909 910 911 912 913 914

	return err;
}

static int
iter_next_cumulative_entry(struct hist_entry_iter *iter,
			   struct addr_location *al)
{
	struct callchain_cursor_node *node;

	node = callchain_cursor_current(&callchain_cursor);
	if (node == NULL)
		return 0;

915
	return fill_callchain_info(al, node, iter->hide_unresolved);
916 917 918 919 920 921 922 923
}

static int
iter_add_next_cumulative_entry(struct hist_entry_iter *iter,
			       struct addr_location *al)
{
	struct perf_evsel *evsel = iter->evsel;
	struct perf_sample *sample = iter->sample;
924
	struct hist_entry **he_cache = iter->priv;
925
	struct hist_entry *he;
926
	struct hist_entry he_tmp = {
927
		.hists = evsel__hists(evsel),
928 929 930 931 932 933 934 935 936
		.cpu = al->cpu,
		.thread = al->thread,
		.comm = thread__comm(al->thread),
		.ip = al->addr,
		.ms = {
			.map = al->map,
			.sym = al->sym,
		},
		.parent = iter->parent,
937 938
		.raw_data = sample->raw_data,
		.raw_size = sample->raw_size,
939 940
	};
	int i;
941 942 943 944 945
	struct callchain_cursor cursor;

	callchain_cursor_snapshot(&cursor, &callchain_cursor);

	callchain_cursor_advance(&callchain_cursor);
946 947 948 949 950 951

	/*
	 * Check if there's duplicate entries in the callchain.
	 * It's possible that it has cycles or recursive calls.
	 */
	for (i = 0; i < iter->curr; i++) {
952 953 954
		if (hist_entry__cmp(he_cache[i], &he_tmp) == 0) {
			/* to avoid calling callback function */
			iter->he = NULL;
955
			return 0;
956
		}
957
	}
958

959 960
	he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,
			      sample, false);
961 962 963 964
	if (he == NULL)
		return -ENOMEM;

	iter->he = he;
965
	he_cache[iter->curr++] = he;
966

967 968
	if (symbol_conf.use_callchain)
		callchain_append(he->callchain, &cursor, sample->period);
969 970 971 972 973 974 975
	return 0;
}

static int
iter_finish_cumulative_entry(struct hist_entry_iter *iter,
			     struct addr_location *al __maybe_unused)
{
976
	zfree(&iter->priv);
977
	iter->he = NULL;
978

979 980 981
	return 0;
}

982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005
const struct hist_iter_ops hist_iter_mem = {
	.prepare_entry 		= iter_prepare_mem_entry,
	.add_single_entry 	= iter_add_single_mem_entry,
	.next_entry 		= iter_next_nop_entry,
	.add_next_entry 	= iter_add_next_nop_entry,
	.finish_entry 		= iter_finish_mem_entry,
};

const struct hist_iter_ops hist_iter_branch = {
	.prepare_entry 		= iter_prepare_branch_entry,
	.add_single_entry 	= iter_add_single_branch_entry,
	.next_entry 		= iter_next_branch_entry,
	.add_next_entry 	= iter_add_next_branch_entry,
	.finish_entry 		= iter_finish_branch_entry,
};

const struct hist_iter_ops hist_iter_normal = {
	.prepare_entry 		= iter_prepare_normal_entry,
	.add_single_entry 	= iter_add_single_normal_entry,
	.next_entry 		= iter_next_nop_entry,
	.add_next_entry 	= iter_add_next_nop_entry,
	.finish_entry 		= iter_finish_normal_entry,
};

1006 1007 1008 1009 1010 1011 1012 1013
const struct hist_iter_ops hist_iter_cumulative = {
	.prepare_entry 		= iter_prepare_cumulative_entry,
	.add_single_entry 	= iter_add_single_cumulative_entry,
	.next_entry 		= iter_next_cumulative_entry,
	.add_next_entry 	= iter_add_next_cumulative_entry,
	.finish_entry 		= iter_finish_cumulative_entry,
};

1014
int hist_entry_iter__add(struct hist_entry_iter *iter, struct addr_location *al,
1015
			 int max_stack_depth, void *arg)
1016 1017 1018
{
	int err, err2;

1019
	err = sample__resolve_callchain(iter->sample, &callchain_cursor, &iter->parent,
1020
					iter->evsel, al, max_stack_depth);
1021 1022 1023
	if (err)
		return err;

1024 1025
	iter->max_stack = max_stack_depth;

1026 1027 1028 1029 1030 1031 1032 1033
	err = iter->ops->prepare_entry(iter, al);
	if (err)
		goto out;

	err = iter->ops->add_single_entry(iter, al);
	if (err)
		goto out;

1034 1035 1036 1037 1038 1039
	if (iter->he && iter->add_entry_cb) {
		err = iter->add_entry_cb(iter, al, true, arg);
		if (err)
			goto out;
	}

1040 1041 1042 1043
	while (iter->ops->next_entry(iter, al)) {
		err = iter->ops->add_next_entry(iter, al);
		if (err)
			break;
1044 1045 1046 1047 1048 1049

		if (iter->he && iter->add_entry_cb) {
			err = iter->add_entry_cb(iter, al, false, arg);
			if (err)
				goto out;
		}
1050 1051 1052 1053 1054 1055 1056 1057 1058 1059
	}

out:
	err2 = iter->ops->finish_entry(iter, al);
	if (!err)
		err = err2;

	return err;
}

1060 1061 1062
int64_t
hist_entry__cmp(struct hist_entry *left, struct hist_entry *right)
{
1063
	struct hists *hists = left->hists;
1064
	struct perf_hpp_fmt *fmt;
1065 1066
	int64_t cmp = 0;

1067
	hists__for_each_sort_list(hists, fmt) {
1068 1069 1070 1071
		if (perf_hpp__is_dynamic_entry(fmt) &&
		    !perf_hpp__defined_dynamic_entry(fmt, hists))
			continue;

1072
		cmp = fmt->cmp(fmt, left, right);
1073 1074 1075 1076 1077 1078 1079 1080 1081 1082
		if (cmp)
			break;
	}

	return cmp;
}

int64_t
hist_entry__collapse(struct hist_entry *left, struct hist_entry *right)
{
1083
	struct hists *hists = left->hists;
1084
	struct perf_hpp_fmt *fmt;
1085 1086
	int64_t cmp = 0;

1087
	hists__for_each_sort_list(hists, fmt) {
1088 1089 1090 1091
		if (perf_hpp__is_dynamic_entry(fmt) &&
		    !perf_hpp__defined_dynamic_entry(fmt, hists))
			continue;

1092
		cmp = fmt->collapse(fmt, left, right);
1093 1094 1095 1096 1097 1098 1099
		if (cmp)
			break;
	}

	return cmp;
}

1100
void hist_entry__delete(struct hist_entry *he)
1101
{
J
Jiri Olsa 已提交
1102 1103
	struct hist_entry_ops *ops = he->ops;

1104
	thread__zput(he->thread);
1105 1106 1107 1108 1109
	map__zput(he->ms.map);

	if (he->branch_info) {
		map__zput(he->branch_info->from.map);
		map__zput(he->branch_info->to.map);
1110 1111
		free_srcline(he->branch_info->srcline_from);
		free_srcline(he->branch_info->srcline_to);
1112 1113 1114 1115 1116 1117 1118 1119 1120
		zfree(&he->branch_info);
	}

	if (he->mem_info) {
		map__zput(he->mem_info->iaddr.map);
		map__zput(he->mem_info->daddr.map);
		zfree(&he->mem_info);
	}

1121
	zfree(&he->stat_acc);
1122
	free_srcline(he->srcline);
1123 1124
	if (he->srcfile && he->srcfile[0])
		free(he->srcfile);
1125
	free_callchain(he->callchain);
1126
	free(he->trace_output);
1127
	free(he->raw_data);
J
Jiri Olsa 已提交
1128
	ops->free(he);
1129 1130
}

1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141
/*
 * If this is not the last column, then we need to pad it according to the
 * pre-calculated max lenght for this column, otherwise don't bother adding
 * spaces because that would break viewing this with, for instance, 'less',
 * that would show tons of trailing spaces when a long C++ demangled method
 * names is sampled.
*/
int hist_entry__snprintf_alignment(struct hist_entry *he, struct perf_hpp *hpp,
				   struct perf_hpp_fmt *fmt, int printed)
{
	if (!list_is_last(&fmt->list, &he->hists->hpp_list->fields)) {
1142
		const int width = fmt->width(fmt, hpp, he->hists);
1143 1144 1145 1146 1147 1148 1149 1150 1151
		if (printed < width) {
			advance_hpp(hpp, printed);
			printed = scnprintf(hpp->buf, hpp->size, "%-*s", width - printed, " ");
		}
	}

	return printed;
}

1152 1153 1154 1155
/*
 * collapse the histogram
 */

1156
static void hists__apply_filters(struct hists *hists, struct hist_entry *he);
1157 1158 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 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248
static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *he,
				       enum hist_filter type);

typedef bool (*fmt_chk_fn)(struct perf_hpp_fmt *fmt);

static bool check_thread_entry(struct perf_hpp_fmt *fmt)
{
	return perf_hpp__is_thread_entry(fmt) || perf_hpp__is_comm_entry(fmt);
}

static void hist_entry__check_and_remove_filter(struct hist_entry *he,
						enum hist_filter type,
						fmt_chk_fn check)
{
	struct perf_hpp_fmt *fmt;
	bool type_match = false;
	struct hist_entry *parent = he->parent_he;

	switch (type) {
	case HIST_FILTER__THREAD:
		if (symbol_conf.comm_list == NULL &&
		    symbol_conf.pid_list == NULL &&
		    symbol_conf.tid_list == NULL)
			return;
		break;
	case HIST_FILTER__DSO:
		if (symbol_conf.dso_list == NULL)
			return;
		break;
	case HIST_FILTER__SYMBOL:
		if (symbol_conf.sym_list == NULL)
			return;
		break;
	case HIST_FILTER__PARENT:
	case HIST_FILTER__GUEST:
	case HIST_FILTER__HOST:
	case HIST_FILTER__SOCKET:
	default:
		return;
	}

	/* if it's filtered by own fmt, it has to have filter bits */
	perf_hpp_list__for_each_format(he->hpp_list, fmt) {
		if (check(fmt)) {
			type_match = true;
			break;
		}
	}

	if (type_match) {
		/*
		 * If the filter is for current level entry, propagate
		 * filter marker to parents.  The marker bit was
		 * already set by default so it only needs to clear
		 * non-filtered entries.
		 */
		if (!(he->filtered & (1 << type))) {
			while (parent) {
				parent->filtered &= ~(1 << type);
				parent = parent->parent_he;
			}
		}
	} else {
		/*
		 * If current entry doesn't have matching formats, set
		 * filter marker for upper level entries.  it will be
		 * cleared if its lower level entries is not filtered.
		 *
		 * For lower-level entries, it inherits parent's
		 * filter bit so that lower level entries of a
		 * non-filtered entry won't set the filter marker.
		 */
		if (parent == NULL)
			he->filtered |= (1 << type);
		else
			he->filtered |= (parent->filtered & (1 << type));
	}
}

static void hist_entry__apply_hierarchy_filters(struct hist_entry *he)
{
	hist_entry__check_and_remove_filter(he, HIST_FILTER__THREAD,
					    check_thread_entry);

	hist_entry__check_and_remove_filter(he, HIST_FILTER__DSO,
					    perf_hpp__is_dso_entry);

	hist_entry__check_and_remove_filter(he, HIST_FILTER__SYMBOL,
					    perf_hpp__is_sym_entry);

	hists__apply_filters(he->hists, he);
}
1249 1250 1251 1252

static struct hist_entry *hierarchy_insert_entry(struct hists *hists,
						 struct rb_root *root,
						 struct hist_entry *he,
1253
						 struct hist_entry *parent_he,
1254
						 struct perf_hpp_list *hpp_list)
1255 1256 1257 1258
{
	struct rb_node **p = &root->rb_node;
	struct rb_node *parent = NULL;
	struct hist_entry *iter, *new;
1259
	struct perf_hpp_fmt *fmt;
1260 1261 1262 1263 1264 1265
	int64_t cmp;

	while (*p != NULL) {
		parent = *p;
		iter = rb_entry(parent, struct hist_entry, rb_node_in);

1266 1267 1268 1269 1270 1271 1272
		cmp = 0;
		perf_hpp_list__for_each_sort_list(hpp_list, fmt) {
			cmp = fmt->collapse(fmt, iter, he);
			if (cmp)
				break;
		}

1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289
		if (!cmp) {
			he_stat__add_stat(&iter->stat, &he->stat);
			return iter;
		}

		if (cmp < 0)
			p = &parent->rb_left;
		else
			p = &parent->rb_right;
	}

	new = hist_entry__new(he, true);
	if (new == NULL)
		return NULL;

	hists->nr_entries++;

1290 1291
	/* save related format list for output */
	new->hpp_list = hpp_list;
1292 1293 1294
	new->parent_he = parent_he;

	hist_entry__apply_hierarchy_filters(new);
1295 1296

	/* some fields are now passed to 'new' */
1297 1298 1299 1300 1301
	perf_hpp_list__for_each_sort_list(hpp_list, fmt) {
		if (perf_hpp__is_trace_entry(fmt) || perf_hpp__is_dynamic_entry(fmt))
			he->trace_output = NULL;
		else
			new->trace_output = NULL;
1302

1303 1304 1305 1306
		if (perf_hpp__is_srcline_entry(fmt))
			he->srcline = NULL;
		else
			new->srcline = NULL;
1307

1308 1309 1310 1311 1312
		if (perf_hpp__is_srcfile_entry(fmt))
			he->srcfile = NULL;
		else
			new->srcfile = NULL;
	}
1313 1314 1315 1316 1317 1318 1319 1320 1321 1322

	rb_link_node(&new->rb_node_in, parent, p);
	rb_insert_color(&new->rb_node_in, root);
	return new;
}

static int hists__hierarchy_insert_entry(struct hists *hists,
					 struct rb_root *root,
					 struct hist_entry *he)
{
1323
	struct perf_hpp_list_node *node;
1324 1325 1326 1327 1328
	struct hist_entry *new_he = NULL;
	struct hist_entry *parent = NULL;
	int depth = 0;
	int ret = 0;

1329 1330 1331
	list_for_each_entry(node, &hists->hpp_formats, list) {
		/* skip period (overhead) and elided columns */
		if (node->level == 0 || node->skip)
1332 1333 1334
			continue;

		/* insert copy of 'he' for each fmt into the hierarchy */
1335
		new_he = hierarchy_insert_entry(hists, root, he, parent, &node->hpp);
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
		if (new_he == NULL) {
			ret = -1;
			break;
		}

		root = &new_he->hroot_in;
		new_he->depth = depth++;
		parent = new_he;
	}

	if (new_he) {
		new_he->leaf = true;

		if (symbol_conf.use_callchain) {
			callchain_cursor_reset(&callchain_cursor);
			if (callchain_merge(&callchain_cursor,
					    new_he->callchain,
					    he->callchain) < 0)
				ret = -1;
		}
	}

	/* 'he' is no longer used */
	hist_entry__delete(he);

	/* return 0 (or -1) since it already applied filters */
	return ret;
}

1365 1366 1367
static int hists__collapse_insert_entry(struct hists *hists,
					struct rb_root *root,
					struct hist_entry *he)
1368
{
1369
	struct rb_node **p = &root->rb_node;
1370 1371 1372 1373
	struct rb_node *parent = NULL;
	struct hist_entry *iter;
	int64_t cmp;

1374 1375 1376
	if (symbol_conf.report_hierarchy)
		return hists__hierarchy_insert_entry(hists, root, he);

1377 1378
	while (*p != NULL) {
		parent = *p;
1379
		iter = rb_entry(parent, struct hist_entry, rb_node_in);
1380 1381 1382 1383

		cmp = hist_entry__collapse(iter, he);

		if (!cmp) {
1384 1385
			int ret = 0;

1386
			he_stat__add_stat(&iter->stat, &he->stat);
1387 1388
			if (symbol_conf.cumulate_callchain)
				he_stat__add_stat(iter->stat_acc, he->stat_acc);
1389

1390
			if (symbol_conf.use_callchain) {
1391
				callchain_cursor_reset(&callchain_cursor);
1392 1393 1394 1395
				if (callchain_merge(&callchain_cursor,
						    iter->callchain,
						    he->callchain) < 0)
					ret = -1;
1396
			}
1397
			hist_entry__delete(he);
1398
			return ret;
1399 1400 1401 1402 1403 1404 1405
		}

		if (cmp < 0)
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}
1406
	hists->nr_entries++;
1407

1408 1409
	rb_link_node(&he->rb_node_in, parent, p);
	rb_insert_color(&he->rb_node_in, root);
1410
	return 1;
1411 1412
}

1413
struct rb_root *hists__get_rotate_entries_in(struct hists *hists)
1414
{
1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427
	struct rb_root *root;

	pthread_mutex_lock(&hists->lock);

	root = hists->entries_in;
	if (++hists->entries_in > &hists->entries_in_array[1])
		hists->entries_in = &hists->entries_in_array[0];

	pthread_mutex_unlock(&hists->lock);

	return root;
}

1428 1429 1430 1431
static void hists__apply_filters(struct hists *hists, struct hist_entry *he)
{
	hists__filter_entry_by_dso(hists, he);
	hists__filter_entry_by_thread(hists, he);
1432
	hists__filter_entry_by_symbol(hists, he);
1433
	hists__filter_entry_by_socket(hists, he);
1434 1435
}

1436
int hists__collapse_resort(struct hists *hists, struct ui_progress *prog)
1437 1438
{
	struct rb_root *root;
1439 1440
	struct rb_node *next;
	struct hist_entry *n;
1441
	int ret;
1442

1443
	if (!hists__has(hists, need_collapse))
1444
		return 0;
1445

1446 1447
	hists->nr_entries = 0;

1448
	root = hists__get_rotate_entries_in(hists);
1449

1450
	next = rb_first(root);
1451

1452
	while (next) {
1453 1454
		if (session_done())
			break;
1455 1456
		n = rb_entry(next, struct hist_entry, rb_node_in);
		next = rb_next(&n->rb_node_in);
1457

1458
		rb_erase(&n->rb_node_in, root);
1459 1460 1461 1462 1463
		ret = hists__collapse_insert_entry(hists, &hists->entries_collapsed, n);
		if (ret < 0)
			return -1;

		if (ret) {
1464 1465 1466 1467 1468 1469 1470
			/*
			 * If it wasn't combined with one of the entries already
			 * collapsed, we need to apply the filters that may have
			 * been set by, say, the hist_browser.
			 */
			hists__apply_filters(hists, n);
		}
1471 1472
		if (prog)
			ui_progress__update(prog, 1);
1473
	}
1474
	return 0;
1475
}
1476

1477
static int hist_entry__sort(struct hist_entry *a, struct hist_entry *b)
1478
{
1479
	struct hists *hists = a->hists;
1480 1481
	struct perf_hpp_fmt *fmt;
	int64_t cmp = 0;
1482

1483
	hists__for_each_sort_list(hists, fmt) {
1484
		if (perf_hpp__should_skip(fmt, a->hists))
1485 1486
			continue;

1487
		cmp = fmt->sort(fmt, a, b);
1488
		if (cmp)
1489 1490 1491
			break;
	}

1492
	return cmp;
1493 1494
}

1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523
static void hists__reset_filter_stats(struct hists *hists)
{
	hists->nr_non_filtered_entries = 0;
	hists->stats.total_non_filtered_period = 0;
}

void hists__reset_stats(struct hists *hists)
{
	hists->nr_entries = 0;
	hists->stats.total_period = 0;

	hists__reset_filter_stats(hists);
}

static void hists__inc_filter_stats(struct hists *hists, struct hist_entry *h)
{
	hists->nr_non_filtered_entries++;
	hists->stats.total_non_filtered_period += h->stat.period;
}

void hists__inc_stats(struct hists *hists, struct hist_entry *h)
{
	if (!h->filtered)
		hists__inc_filter_stats(hists, h);

	hists->nr_entries++;
	hists->stats.total_period += h->stat.period;
}

1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548
static void hierarchy_recalc_total_periods(struct hists *hists)
{
	struct rb_node *node;
	struct hist_entry *he;

	node = rb_first(&hists->entries);

	hists->stats.total_period = 0;
	hists->stats.total_non_filtered_period = 0;

	/*
	 * recalculate total period using top-level entries only
	 * since lower level entries only see non-filtered entries
	 * but upper level entries have sum of both entries.
	 */
	while (node) {
		he = rb_entry(node, struct hist_entry, rb_node);
		node = rb_next(node);

		hists->stats.total_period += he->stat.period;
		if (!he->filtered)
			hists->stats.total_non_filtered_period += he->stat.period;
	}
}

1549 1550 1551 1552 1553 1554
static void hierarchy_insert_output_entry(struct rb_root *root,
					  struct hist_entry *he)
{
	struct rb_node **p = &root->rb_node;
	struct rb_node *parent = NULL;
	struct hist_entry *iter;
1555
	struct perf_hpp_fmt *fmt;
1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568

	while (*p != NULL) {
		parent = *p;
		iter = rb_entry(parent, struct hist_entry, rb_node);

		if (hist_entry__sort(he, iter) > 0)
			p = &parent->rb_left;
		else
			p = &parent->rb_right;
	}

	rb_link_node(&he->rb_node, parent, p);
	rb_insert_color(&he->rb_node, root);
1569 1570

	/* update column width of dynamic entry */
1571 1572 1573 1574
	perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) {
		if (perf_hpp__is_dynamic_entry(fmt))
			fmt->sort(fmt, he, NULL);
	}
1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630
}

static void hists__hierarchy_output_resort(struct hists *hists,
					   struct ui_progress *prog,
					   struct rb_root *root_in,
					   struct rb_root *root_out,
					   u64 min_callchain_hits,
					   bool use_callchain)
{
	struct rb_node *node;
	struct hist_entry *he;

	*root_out = RB_ROOT;
	node = rb_first(root_in);

	while (node) {
		he = rb_entry(node, struct hist_entry, rb_node_in);
		node = rb_next(node);

		hierarchy_insert_output_entry(root_out, he);

		if (prog)
			ui_progress__update(prog, 1);

		if (!he->leaf) {
			hists__hierarchy_output_resort(hists, prog,
						       &he->hroot_in,
						       &he->hroot_out,
						       min_callchain_hits,
						       use_callchain);
			hists->nr_entries++;
			if (!he->filtered) {
				hists->nr_non_filtered_entries++;
				hists__calc_col_len(hists, he);
			}

			continue;
		}

		if (!use_callchain)
			continue;

		if (callchain_param.mode == CHAIN_GRAPH_REL) {
			u64 total = he->stat.period;

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

			min_callchain_hits = total * (callchain_param.min_percent / 100);
		}

		callchain_param.sort(&he->sorted_chain, he->callchain,
				     min_callchain_hits, &callchain_param);
	}
}

1631 1632
static void __hists__insert_output_entry(struct rb_root *entries,
					 struct hist_entry *he,
1633 1634
					 u64 min_callchain_hits,
					 bool use_callchain)
1635
{
1636
	struct rb_node **p = &entries->rb_node;
1637 1638
	struct rb_node *parent = NULL;
	struct hist_entry *iter;
1639
	struct perf_hpp_fmt *fmt;
1640

1641 1642 1643 1644 1645 1646 1647 1648 1649
	if (use_callchain) {
		if (callchain_param.mode == CHAIN_GRAPH_REL) {
			u64 total = he->stat.period;

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

			min_callchain_hits = total * (callchain_param.min_percent / 100);
		}
1650
		callchain_param.sort(&he->sorted_chain, he->callchain,
1651
				      min_callchain_hits, &callchain_param);
1652
	}
1653 1654 1655 1656 1657

	while (*p != NULL) {
		parent = *p;
		iter = rb_entry(parent, struct hist_entry, rb_node);

1658
		if (hist_entry__sort(he, iter) > 0)
1659 1660 1661 1662 1663 1664
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}

	rb_link_node(&he->rb_node, parent, p);
1665
	rb_insert_color(&he->rb_node, entries);
1666 1667 1668 1669 1670 1671

	perf_hpp_list__for_each_sort_list(&perf_hpp_list, fmt) {
		if (perf_hpp__is_dynamic_entry(fmt) &&
		    perf_hpp__defined_dynamic_entry(fmt, he->hists))
			fmt->sort(fmt, he, NULL);  /* update column width */
	}
1672 1673
}

1674
static void output_resort(struct hists *hists, struct ui_progress *prog,
1675
			  bool use_callchain, hists__resort_cb_t cb)
1676
{
1677
	struct rb_root *root;
1678 1679
	struct rb_node *next;
	struct hist_entry *n;
1680
	u64 callchain_total;
1681 1682
	u64 min_callchain_hits;

1683 1684 1685 1686 1687
	callchain_total = hists->callchain_period;
	if (symbol_conf.filter_relative)
		callchain_total = hists->callchain_non_filtered_period;

	min_callchain_hits = callchain_total * (callchain_param.min_percent / 100);
1688

1689 1690 1691 1692
	hists__reset_stats(hists);
	hists__reset_col_len(hists);

	if (symbol_conf.report_hierarchy) {
1693 1694 1695 1696 1697 1698 1699
		hists__hierarchy_output_resort(hists, prog,
					       &hists->entries_collapsed,
					       &hists->entries,
					       min_callchain_hits,
					       use_callchain);
		hierarchy_recalc_total_periods(hists);
		return;
1700 1701
	}

1702
	if (hists__has(hists, need_collapse))
1703 1704 1705 1706 1707 1708
		root = &hists->entries_collapsed;
	else
		root = hists->entries_in;

	next = rb_first(root);
	hists->entries = RB_ROOT;
1709 1710

	while (next) {
1711 1712
		n = rb_entry(next, struct hist_entry, rb_node_in);
		next = rb_next(&n->rb_node_in);
1713

1714 1715 1716
		if (cb && cb(n))
			continue;

1717
		__hists__insert_output_entry(&hists->entries, n, min_callchain_hits, use_callchain);
1718
		hists__inc_stats(hists, n);
1719 1720 1721

		if (!n->filtered)
			hists__calc_col_len(hists, n);
1722 1723 1724

		if (prog)
			ui_progress__update(prog, 1);
1725
	}
1726
}
1727

1728
void perf_evsel__output_resort(struct perf_evsel *evsel, struct ui_progress *prog)
1729 1730 1731 1732 1733 1734 1735 1736
{
	bool use_callchain;

	if (evsel && symbol_conf.use_callchain && !symbol_conf.show_ref_callgraph)
		use_callchain = evsel->attr.sample_type & PERF_SAMPLE_CALLCHAIN;
	else
		use_callchain = symbol_conf.use_callchain;

1737
	output_resort(evsel__hists(evsel), prog, use_callchain, NULL);
1738 1739 1740 1741
}

void hists__output_resort(struct hists *hists, struct ui_progress *prog)
{
1742 1743 1744 1745 1746 1747 1748
	output_resort(hists, prog, symbol_conf.use_callchain, NULL);
}

void hists__output_resort_cb(struct hists *hists, struct ui_progress *prog,
			     hists__resort_cb_t cb)
{
	output_resort(hists, prog, symbol_conf.use_callchain, cb);
1749 1750
}

1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806
static bool can_goto_child(struct hist_entry *he, enum hierarchy_move_dir hmd)
{
	if (he->leaf || hmd == HMD_FORCE_SIBLING)
		return false;

	if (he->unfolded || hmd == HMD_FORCE_CHILD)
		return true;

	return false;
}

struct rb_node *rb_hierarchy_last(struct rb_node *node)
{
	struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);

	while (can_goto_child(he, HMD_NORMAL)) {
		node = rb_last(&he->hroot_out);
		he = rb_entry(node, struct hist_entry, rb_node);
	}
	return node;
}

struct rb_node *__rb_hierarchy_next(struct rb_node *node, enum hierarchy_move_dir hmd)
{
	struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);

	if (can_goto_child(he, hmd))
		node = rb_first(&he->hroot_out);
	else
		node = rb_next(node);

	while (node == NULL) {
		he = he->parent_he;
		if (he == NULL)
			break;

		node = rb_next(&he->rb_node);
	}
	return node;
}

struct rb_node *rb_hierarchy_prev(struct rb_node *node)
{
	struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);

	node = rb_prev(node);
	if (node)
		return rb_hierarchy_last(node);

	he = he->parent_he;
	if (he == NULL)
		return NULL;

	return &he->rb_node;
}

1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831
bool hist_entry__has_hierarchy_children(struct hist_entry *he, float limit)
{
	struct rb_node *node;
	struct hist_entry *child;
	float percent;

	if (he->leaf)
		return false;

	node = rb_first(&he->hroot_out);
	child = rb_entry(node, struct hist_entry, rb_node);

	while (node && child->filtered) {
		node = rb_next(node);
		child = rb_entry(node, struct hist_entry, rb_node);
	}

	if (node)
		percent = hist_entry__get_percent_limit(child);
	else
		percent = 0;

	return node && percent >= limit;
}

1832
static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h,
1833 1834 1835
				       enum hist_filter filter)
{
	h->filtered &= ~(1 << filter);
1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849

	if (symbol_conf.report_hierarchy) {
		struct hist_entry *parent = h->parent_he;

		while (parent) {
			he_stat__add_stat(&parent->stat, &h->stat);

			parent->filtered &= ~(1 << filter);

			if (parent->filtered)
				goto next;

			/* force fold unfiltered entry for simplicity */
			parent->unfolded = false;
1850
			parent->has_no_entry = false;
1851 1852 1853 1854 1855 1856 1857
			parent->row_offset = 0;
			parent->nr_rows = 0;
next:
			parent = parent->parent_he;
		}
	}

1858 1859 1860
	if (h->filtered)
		return;

1861
	/* force fold unfiltered entry for simplicity */
1862
	h->unfolded = false;
1863
	h->has_no_entry = false;
1864
	h->row_offset = 0;
1865
	h->nr_rows = 0;
1866

1867
	hists->stats.nr_non_filtered_samples += h->stat.nr_events;
1868

1869
	hists__inc_filter_stats(hists, h);
1870
	hists__calc_col_len(hists, h);
1871 1872
}

1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897

static bool hists__filter_entry_by_dso(struct hists *hists,
				       struct hist_entry *he)
{
	if (hists->dso_filter != NULL &&
	    (he->ms.map == NULL || he->ms.map->dso != hists->dso_filter)) {
		he->filtered |= (1 << HIST_FILTER__DSO);
		return true;
	}

	return false;
}

static bool hists__filter_entry_by_thread(struct hists *hists,
					  struct hist_entry *he)
{
	if (hists->thread_filter != NULL &&
	    he->thread != hists->thread_filter) {
		he->filtered |= (1 << HIST_FILTER__THREAD);
		return true;
	}

	return false;
}

1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910
static bool hists__filter_entry_by_symbol(struct hists *hists,
					  struct hist_entry *he)
{
	if (hists->symbol_filter_str != NULL &&
	    (!he->ms.sym || strstr(he->ms.sym->name,
				   hists->symbol_filter_str) == NULL)) {
		he->filtered |= (1 << HIST_FILTER__SYMBOL);
		return true;
	}

	return false;
}

1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922
static bool hists__filter_entry_by_socket(struct hists *hists,
					  struct hist_entry *he)
{
	if ((hists->socket_filter > -1) &&
	    (he->socket != hists->socket_filter)) {
		he->filtered |= (1 << HIST_FILTER__SOCKET);
		return true;
	}

	return false;
}

1923 1924 1925
typedef bool (*filter_fn_t)(struct hists *hists, struct hist_entry *he);

static void hists__filter_by_type(struct hists *hists, int type, filter_fn_t filter)
1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936
{
	struct rb_node *nd;

	hists->stats.nr_non_filtered_samples = 0;

	hists__reset_filter_stats(hists);
	hists__reset_col_len(hists);

	for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);

1937
		if (filter(hists, h))
1938 1939
			continue;

1940
		hists__remove_entry_filter(hists, h, type);
1941 1942 1943
	}
}

1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980
static void resort_filtered_entry(struct rb_root *root, struct hist_entry *he)
{
	struct rb_node **p = &root->rb_node;
	struct rb_node *parent = NULL;
	struct hist_entry *iter;
	struct rb_root new_root = RB_ROOT;
	struct rb_node *nd;

	while (*p != NULL) {
		parent = *p;
		iter = rb_entry(parent, struct hist_entry, rb_node);

		if (hist_entry__sort(he, iter) > 0)
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}

	rb_link_node(&he->rb_node, parent, p);
	rb_insert_color(&he->rb_node, root);

	if (he->leaf || he->filtered)
		return;

	nd = rb_first(&he->hroot_out);
	while (nd) {
		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);

		nd = rb_next(nd);
		rb_erase(&h->rb_node, &he->hroot_out);

		resort_filtered_entry(&new_root, h);
	}

	he->hroot_out = new_root;
}

1981 1982 1983
static void hists__filter_hierarchy(struct hists *hists, int type, const void *arg)
{
	struct rb_node *nd;
1984
	struct rb_root new_root = RB_ROOT;
1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027

	hists->stats.nr_non_filtered_samples = 0;

	hists__reset_filter_stats(hists);
	hists__reset_col_len(hists);

	nd = rb_first(&hists->entries);
	while (nd) {
		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
		int ret;

		ret = hist_entry__filter(h, type, arg);

		/*
		 * case 1. non-matching type
		 * zero out the period, set filter marker and move to child
		 */
		if (ret < 0) {
			memset(&h->stat, 0, sizeof(h->stat));
			h->filtered |= (1 << type);

			nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_CHILD);
		}
		/*
		 * case 2. matched type (filter out)
		 * set filter marker and move to next
		 */
		else if (ret == 1) {
			h->filtered |= (1 << type);

			nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);
		}
		/*
		 * case 3. ok (not filtered)
		 * add period to hists and parents, erase the filter marker
		 * and move to next sibling
		 */
		else {
			hists__remove_entry_filter(hists, h, type);

			nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);
		}
	}
2028

2029 2030
	hierarchy_recalc_total_periods(hists);

2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045
	/*
	 * resort output after applying a new filter since filter in a lower
	 * hierarchy can change periods in a upper hierarchy.
	 */
	nd = rb_first(&hists->entries);
	while (nd) {
		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);

		nd = rb_next(nd);
		rb_erase(&h->rb_node, &hists->entries);

		resort_filtered_entry(&new_root, h);
	}

	hists->entries = new_root;
2046 2047
}

2048 2049
void hists__filter_by_thread(struct hists *hists)
{
2050 2051 2052 2053 2054 2055
	if (symbol_conf.report_hierarchy)
		hists__filter_hierarchy(hists, HIST_FILTER__THREAD,
					hists->thread_filter);
	else
		hists__filter_by_type(hists, HIST_FILTER__THREAD,
				      hists__filter_entry_by_thread);
2056 2057 2058 2059
}

void hists__filter_by_dso(struct hists *hists)
{
2060 2061 2062 2063 2064 2065
	if (symbol_conf.report_hierarchy)
		hists__filter_hierarchy(hists, HIST_FILTER__DSO,
					hists->dso_filter);
	else
		hists__filter_by_type(hists, HIST_FILTER__DSO,
				      hists__filter_entry_by_dso);
2066 2067 2068 2069
}

void hists__filter_by_symbol(struct hists *hists)
{
2070 2071 2072 2073 2074 2075
	if (symbol_conf.report_hierarchy)
		hists__filter_hierarchy(hists, HIST_FILTER__SYMBOL,
					hists->symbol_filter_str);
	else
		hists__filter_by_type(hists, HIST_FILTER__SYMBOL,
				      hists__filter_entry_by_symbol);
2076 2077 2078 2079
}

void hists__filter_by_socket(struct hists *hists)
{
2080 2081 2082 2083 2084 2085
	if (symbol_conf.report_hierarchy)
		hists__filter_hierarchy(hists, HIST_FILTER__SOCKET,
					&hists->socket_filter);
	else
		hists__filter_by_type(hists, HIST_FILTER__SOCKET,
				      hists__filter_entry_by_socket);
2086 2087
}

2088 2089 2090 2091 2092 2093
void events_stats__inc(struct events_stats *stats, u32 type)
{
	++stats->nr_events[0];
	++stats->nr_events[type];
}

2094
void hists__inc_nr_events(struct hists *hists, u32 type)
2095
{
2096
	events_stats__inc(&hists->stats, type);
2097
}
2098

2099 2100 2101 2102 2103 2104 2105
void hists__inc_nr_samples(struct hists *hists, bool filtered)
{
	events_stats__inc(&hists->stats, PERF_RECORD_SAMPLE);
	if (!filtered)
		hists->stats.nr_non_filtered_samples++;
}

2106 2107 2108
static struct hist_entry *hists__add_dummy_entry(struct hists *hists,
						 struct hist_entry *pair)
{
2109 2110
	struct rb_root *root;
	struct rb_node **p;
2111 2112
	struct rb_node *parent = NULL;
	struct hist_entry *he;
2113
	int64_t cmp;
2114

2115
	if (hists__has(hists, need_collapse))
2116 2117 2118 2119 2120 2121
		root = &hists->entries_collapsed;
	else
		root = hists->entries_in;

	p = &root->rb_node;

2122 2123
	while (*p != NULL) {
		parent = *p;
2124
		he = rb_entry(parent, struct hist_entry, rb_node_in);
2125

2126
		cmp = hist_entry__collapse(he, pair);
2127 2128 2129 2130 2131 2132 2133 2134 2135 2136

		if (!cmp)
			goto out;

		if (cmp < 0)
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}

2137
	he = hist_entry__new(pair, true);
2138
	if (he) {
2139 2140
		memset(&he->stat, 0, sizeof(he->stat));
		he->hists = hists;
2141 2142
		if (symbol_conf.cumulate_callchain)
			memset(he->stat_acc, 0, sizeof(he->stat));
2143 2144
		rb_link_node(&he->rb_node_in, parent, p);
		rb_insert_color(&he->rb_node_in, root);
2145
		hists__inc_stats(hists, he);
2146
		he->dummy = true;
2147 2148 2149 2150 2151
	}
out:
	return he;
}

2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195
static struct hist_entry *add_dummy_hierarchy_entry(struct hists *hists,
						    struct rb_root *root,
						    struct hist_entry *pair)
{
	struct rb_node **p;
	struct rb_node *parent = NULL;
	struct hist_entry *he;
	struct perf_hpp_fmt *fmt;

	p = &root->rb_node;
	while (*p != NULL) {
		int64_t cmp = 0;

		parent = *p;
		he = rb_entry(parent, struct hist_entry, rb_node_in);

		perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) {
			cmp = fmt->collapse(fmt, he, pair);
			if (cmp)
				break;
		}
		if (!cmp)
			goto out;

		if (cmp < 0)
			p = &parent->rb_left;
		else
			p = &parent->rb_right;
	}

	he = hist_entry__new(pair, true);
	if (he) {
		rb_link_node(&he->rb_node_in, parent, p);
		rb_insert_color(&he->rb_node_in, root);

		he->dummy = true;
		he->hists = hists;
		memset(&he->stat, 0, sizeof(he->stat));
		hists__inc_stats(hists, he);
	}
out:
	return he;
}

2196 2197 2198
static struct hist_entry *hists__find_entry(struct hists *hists,
					    struct hist_entry *he)
{
2199 2200
	struct rb_node *n;

2201
	if (hists__has(hists, need_collapse))
2202 2203 2204
		n = hists->entries_collapsed.rb_node;
	else
		n = hists->entries_in->rb_node;
2205 2206

	while (n) {
2207 2208
		struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in);
		int64_t cmp = hist_entry__collapse(iter, he);
2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220

		if (cmp < 0)
			n = n->rb_left;
		else if (cmp > 0)
			n = n->rb_right;
		else
			return iter;
	}

	return NULL;
}

2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265
static struct hist_entry *hists__find_hierarchy_entry(struct rb_root *root,
						      struct hist_entry *he)
{
	struct rb_node *n = root->rb_node;

	while (n) {
		struct hist_entry *iter;
		struct perf_hpp_fmt *fmt;
		int64_t cmp = 0;

		iter = rb_entry(n, struct hist_entry, rb_node_in);
		perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) {
			cmp = fmt->collapse(fmt, iter, he);
			if (cmp)
				break;
		}

		if (cmp < 0)
			n = n->rb_left;
		else if (cmp > 0)
			n = n->rb_right;
		else
			return iter;
	}

	return NULL;
}

static void hists__match_hierarchy(struct rb_root *leader_root,
				   struct rb_root *other_root)
{
	struct rb_node *nd;
	struct hist_entry *pos, *pair;

	for (nd = rb_first(leader_root); nd; nd = rb_next(nd)) {
		pos  = rb_entry(nd, struct hist_entry, rb_node_in);
		pair = hists__find_hierarchy_entry(other_root, pos);

		if (pair) {
			hist_entry__add_pair(pair, pos);
			hists__match_hierarchy(&pos->hroot_in, &pair->hroot_in);
		}
	}
}

2266 2267 2268 2269 2270
/*
 * Look for pairs to link to the leader buckets (hist_entries):
 */
void hists__match(struct hists *leader, struct hists *other)
{
2271
	struct rb_root *root;
2272 2273 2274
	struct rb_node *nd;
	struct hist_entry *pos, *pair;

2275 2276 2277 2278 2279 2280
	if (symbol_conf.report_hierarchy) {
		/* hierarchy report always collapses entries */
		return hists__match_hierarchy(&leader->entries_collapsed,
					      &other->entries_collapsed);
	}

2281
	if (hists__has(leader, need_collapse))
2282 2283 2284 2285 2286 2287
		root = &leader->entries_collapsed;
	else
		root = leader->entries_in;

	for (nd = rb_first(root); nd; nd = rb_next(nd)) {
		pos  = rb_entry(nd, struct hist_entry, rb_node_in);
2288 2289 2290
		pair = hists__find_entry(other, pos);

		if (pair)
2291
			hist_entry__add_pair(pair, pos);
2292 2293
	}
}
2294

2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338
static int hists__link_hierarchy(struct hists *leader_hists,
				 struct hist_entry *parent,
				 struct rb_root *leader_root,
				 struct rb_root *other_root)
{
	struct rb_node *nd;
	struct hist_entry *pos, *leader;

	for (nd = rb_first(other_root); nd; nd = rb_next(nd)) {
		pos = rb_entry(nd, struct hist_entry, rb_node_in);

		if (hist_entry__has_pairs(pos)) {
			bool found = false;

			list_for_each_entry(leader, &pos->pairs.head, pairs.node) {
				if (leader->hists == leader_hists) {
					found = true;
					break;
				}
			}
			if (!found)
				return -1;
		} else {
			leader = add_dummy_hierarchy_entry(leader_hists,
							   leader_root, pos);
			if (leader == NULL)
				return -1;

			/* do not point parent in the pos */
			leader->parent_he = parent;

			hist_entry__add_pair(pos, leader);
		}

		if (!pos->leaf) {
			if (hists__link_hierarchy(leader_hists, leader,
						  &leader->hroot_in,
						  &pos->hroot_in) < 0)
				return -1;
		}
	}
	return 0;
}

2339 2340 2341 2342 2343 2344 2345
/*
 * Look for entries in the other hists that are not present in the leader, if
 * we find them, just add a dummy entry on the leader hists, with period=0,
 * nr_events=0, to serve as the list header.
 */
int hists__link(struct hists *leader, struct hists *other)
{
2346
	struct rb_root *root;
2347 2348 2349
	struct rb_node *nd;
	struct hist_entry *pos, *pair;

2350 2351 2352 2353 2354 2355 2356
	if (symbol_conf.report_hierarchy) {
		/* hierarchy report always collapses entries */
		return hists__link_hierarchy(leader, NULL,
					     &leader->entries_collapsed,
					     &other->entries_collapsed);
	}

2357
	if (hists__has(other, need_collapse))
2358 2359 2360 2361 2362 2363
		root = &other->entries_collapsed;
	else
		root = other->entries_in;

	for (nd = rb_first(root); nd; nd = rb_next(nd)) {
		pos = rb_entry(nd, struct hist_entry, rb_node_in);
2364 2365 2366 2367 2368

		if (!hist_entry__has_pairs(pos)) {
			pair = hists__add_dummy_entry(leader, pos);
			if (pair == NULL)
				return -1;
2369
			hist_entry__add_pair(pos, pair);
2370 2371 2372 2373 2374
		}
	}

	return 0;
}
2375

2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408
void hist__account_cycles(struct branch_stack *bs, struct addr_location *al,
			  struct perf_sample *sample, bool nonany_branch_mode)
{
	struct branch_info *bi;

	/* If we have branch cycles always annotate them. */
	if (bs && bs->nr && bs->entries[0].flags.cycles) {
		int i;

		bi = sample__resolve_bstack(sample, al);
		if (bi) {
			struct addr_map_symbol *prev = NULL;

			/*
			 * Ignore errors, still want to process the
			 * other entries.
			 *
			 * For non standard branch modes always
			 * force no IPC (prev == NULL)
			 *
			 * Note that perf stores branches reversed from
			 * program order!
			 */
			for (i = bs->nr - 1; i >= 0; i--) {
				addr_map_symbol__account_cycles(&bi[i].from,
					nonany_branch_mode ? NULL : prev,
					bi[i].flags.cycles);
				prev = &bi[i].to;
			}
			free(bi);
		}
	}
}
2409 2410 2411 2412 2413 2414

size_t perf_evlist__fprintf_nr_events(struct perf_evlist *evlist, FILE *fp)
{
	struct perf_evsel *pos;
	size_t ret = 0;

2415
	evlist__for_each_entry(evlist, pos) {
2416 2417 2418 2419 2420 2421 2422 2423
		ret += fprintf(fp, "%s stats:\n", perf_evsel__name(pos));
		ret += events_stats__fprintf(&evsel__hists(pos)->stats, fp);
	}

	return ret;
}


2424 2425 2426 2427 2428
u64 hists__total_period(struct hists *hists)
{
	return symbol_conf.filter_relative ? hists->stats.total_non_filtered_period :
		hists->stats.total_period;
}
N
Namhyung Kim 已提交
2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441

int parse_filter_percentage(const struct option *opt __maybe_unused,
			    const char *arg, int unset __maybe_unused)
{
	if (!strcmp(arg, "relative"))
		symbol_conf.filter_relative = true;
	else if (!strcmp(arg, "absolute"))
		symbol_conf.filter_relative = false;
	else
		return -1;

	return 0;
}
2442 2443 2444 2445 2446 2447 2448 2449

int perf_hist_config(const char *var, const char *value)
{
	if (!strcmp(var, "hist.percentage"))
		return parse_filter_percentage(NULL, value, 0);

	return 0;
}
2450

2451
int __hists__init(struct hists *hists, struct perf_hpp_list *hpp_list)
2452 2453 2454 2455 2456 2457 2458
{
	memset(hists, 0, sizeof(*hists));
	hists->entries_in_array[0] = hists->entries_in_array[1] = RB_ROOT;
	hists->entries_in = &hists->entries_in_array[0];
	hists->entries_collapsed = RB_ROOT;
	hists->entries = RB_ROOT;
	pthread_mutex_init(&hists->lock, NULL);
2459
	hists->socket_filter = -1;
2460
	hists->hpp_list = hpp_list;
2461
	INIT_LIST_HEAD(&hists->hpp_formats);
2462 2463 2464
	return 0;
}

2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486
static void hists__delete_remaining_entries(struct rb_root *root)
{
	struct rb_node *node;
	struct hist_entry *he;

	while (!RB_EMPTY_ROOT(root)) {
		node = rb_first(root);
		rb_erase(node, root);

		he = rb_entry(node, struct hist_entry, rb_node_in);
		hist_entry__delete(he);
	}
}

static void hists__delete_all_entries(struct hists *hists)
{
	hists__delete_entries(hists);
	hists__delete_remaining_entries(&hists->entries_in_array[0]);
	hists__delete_remaining_entries(&hists->entries_in_array[1]);
	hists__delete_remaining_entries(&hists->entries_collapsed);
}

2487 2488 2489
static void hists_evsel__exit(struct perf_evsel *evsel)
{
	struct hists *hists = evsel__hists(evsel);
2490 2491
	struct perf_hpp_fmt *fmt, *pos;
	struct perf_hpp_list_node *node, *tmp;
2492

2493
	hists__delete_all_entries(hists);
2494 2495 2496 2497 2498 2499 2500 2501 2502

	list_for_each_entry_safe(node, tmp, &hists->hpp_formats, list) {
		perf_hpp_list__for_each_format_safe(&node->hpp, fmt, pos) {
			list_del(&fmt->list);
			free(fmt);
		}
		list_del(&node->list);
		free(node);
	}
2503 2504
}

2505 2506 2507 2508
static int hists_evsel__init(struct perf_evsel *evsel)
{
	struct hists *hists = evsel__hists(evsel);

2509
	__hists__init(hists, &perf_hpp_list);
2510 2511 2512
	return 0;
}

2513 2514 2515 2516 2517 2518 2519 2520
/*
 * XXX We probably need a hists_evsel__exit() to free the hist_entries
 * stored in the rbtree...
 */

int hists__init(void)
{
	int err = perf_evsel__object_config(sizeof(struct hists_evsel),
2521 2522
					    hists_evsel__init,
					    hists_evsel__exit);
2523 2524 2525 2526 2527
	if (err)
		fputs("FATAL ERROR: Couldn't setup hists class\n", stderr);

	return err;
}
2528 2529 2530 2531 2532 2533

void perf_hpp_list__init(struct perf_hpp_list *list)
{
	INIT_LIST_HEAD(&list->fields);
	INIT_LIST_HEAD(&list->sorts);
}