hist.c 37.4 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 82
	if (hists__new_col_len(hists, HISTC_COMM, len))
		hists__set_col_len(hists, HISTC_THREAD, len + 6);
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 120
			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);
		}
	}
121 122 123 124 125 126 127

	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 已提交
128 129
			hists__new_col_len(hists, HISTC_MEM_DCACHELINE,
					   symlen + 1);
130 131 132 133
		} else {
			symlen = unresolved_col_width + 4 + 2;
			hists__new_col_len(hists, HISTC_MEM_DADDR_SYMBOL,
					   symlen);
134 135
			hists__new_col_len(hists, HISTC_MEM_DCACHELINE,
					   symlen);
136
		}
137 138 139 140 141 142 143 144 145 146 147 148

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

149 150 151 152 153 154 155 156 157 158 159
		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);
160
		hists__new_col_len(hists, HISTC_MEM_IADDR_SYMBOL, symlen);
161 162 163
		hists__set_unres_dso_col_len(hists, HISTC_MEM_DADDR_DSO);
	}

164
	hists__new_col_len(hists, HISTC_CPU, 3);
165
	hists__new_col_len(hists, HISTC_SOCKET, 6);
166 167 168 169 170 171
	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);
172

173 174 175
	if (h->srcline)
		hists__new_col_len(hists, HISTC_SRCLINE, strlen(h->srcline));

176 177 178
	if (h->srcfile)
		hists__new_col_len(hists, HISTC_SRCFILE, strlen(h->srcfile));

179 180 181
	if (h->transaction)
		hists__new_col_len(hists, HISTC_TRANSACTION,
				   hist_entry__transaction_len());
182 183
}

184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199
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);
	}
}

200 201
static void he_stat__add_cpumode_period(struct he_stat *he_stat,
					unsigned int cpumode, u64 period)
202
{
203
	switch (cpumode) {
204
	case PERF_RECORD_MISC_KERNEL:
205
		he_stat->period_sys += period;
206 207
		break;
	case PERF_RECORD_MISC_USER:
208
		he_stat->period_us += period;
209 210
		break;
	case PERF_RECORD_MISC_GUEST_KERNEL:
211
		he_stat->period_guest_sys += period;
212 213
		break;
	case PERF_RECORD_MISC_GUEST_USER:
214
		he_stat->period_guest_us += period;
215 216 217 218 219 220
		break;
	default:
		break;
	}
}

221 222
static void he_stat__add_period(struct he_stat *he_stat, u64 period,
				u64 weight)
223
{
224

225
	he_stat->period		+= period;
226
	he_stat->weight		+= weight;
227 228 229 230 231 232 233 234 235 236 237
	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;
238
	dest->weight		+= src->weight;
239 240
}

241
static void he_stat__decay(struct he_stat *he_stat)
242
{
243 244
	he_stat->period = (he_stat->period * 7) / 8;
	he_stat->nr_events = (he_stat->nr_events * 7) / 8;
245
	/* XXX need decay for weight too? */
246 247 248 249
}

static bool hists__decay_entry(struct hists *hists, struct hist_entry *he)
{
250
	u64 prev_period = he->stat.period;
251
	u64 diff;
252 253

	if (prev_period == 0)
254
		return true;
255

256
	he_stat__decay(&he->stat);
257 258
	if (symbol_conf.cumulate_callchain)
		he_stat__decay(he->stat_acc);
259
	decay_callchain(he->callchain);
260

261 262 263
	diff = prev_period - he->stat.period;

	hists->stats.total_period -= diff;
264
	if (!he->filtered)
265
		hists->stats.total_non_filtered_period -= diff;
266

267
	return he->stat.period == 0;
268 269
}

270 271 272 273 274 275
static void hists__delete_entry(struct hists *hists, struct hist_entry *he)
{
	rb_erase(&he->rb_node, &hists->entries);

	if (sort__need_collapse)
		rb_erase(&he->rb_node_in, &hists->entries_collapsed);
276 277
	else
		rb_erase(&he->rb_node_in, hists->entries_in);
278 279 280 281 282 283 284 285

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

	hist_entry__delete(he);
}

286
void hists__decay_entries(struct hists *hists, bool zap_user, bool zap_kernel)
287 288 289 290 291 292 293
{
	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);
294 295
		if (((zap_user && n->level == '.') ||
		     (zap_kernel && n->level != '.') ||
296
		     hists__decay_entry(hists, n))) {
297
			hists__delete_entry(hists, n);
298 299 300 301
		}
	}
}

N
Namhyung Kim 已提交
302 303 304 305 306 307 308 309 310
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);

311
		hists__delete_entry(hists, n);
N
Namhyung Kim 已提交
312 313 314
	}
}

315
/*
316
 * histogram, sorted on item, collects periods
317 318
 */

319 320
static struct hist_entry *hist_entry__new(struct hist_entry *template,
					  bool sample_self)
321
{
322 323 324
	size_t callchain_size = 0;
	struct hist_entry *he;

325
	if (symbol_conf.use_callchain)
326 327 328
		callchain_size = sizeof(struct callchain_root);

	he = zalloc(sizeof(*he) + callchain_size);
329

330 331
	if (he != NULL) {
		*he = *template;
332

333 334 335 336 337 338 339
		if (symbol_conf.cumulate_callchain) {
			he->stat_acc = malloc(sizeof(he->stat));
			if (he->stat_acc == NULL) {
				free(he);
				return NULL;
			}
			memcpy(he->stat_acc, &he->stat, sizeof(he->stat));
340 341
			if (!sample_self)
				memset(&he->stat, 0, sizeof(he->stat));
342 343
		}

344
		map__get(he->ms.map);
345 346

		if (he->branch_info) {
347 348
			/*
			 * This branch info is (a part of) allocated from
349
			 * sample__resolve_bstack() and will be freed after
350 351 352 353
			 * adding new entries.  So we need to save a copy.
			 */
			he->branch_info = malloc(sizeof(*he->branch_info));
			if (he->branch_info == NULL) {
354
				map__zput(he->ms.map);
355
				free(he->stat_acc);
356 357 358 359 360 361 362
				free(he);
				return NULL;
			}

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

363 364
			map__get(he->branch_info->from.map);
			map__get(he->branch_info->to.map);
365 366
		}

367
		if (he->mem_info) {
368 369
			map__get(he->mem_info->iaddr.map);
			map__get(he->mem_info->daddr.map);
370 371
		}

372
		if (symbol_conf.use_callchain)
373
			callchain_init(he->callchain);
374

375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393
		if (he->raw_data) {
			he->raw_data = memdup(he->raw_data, he->raw_size);

			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);
				free(he);
				return NULL;
			}
		}
394
		INIT_LIST_HEAD(&he->pairs.node);
395
		thread__get(he->thread);
396 397
	}

398
	return he;
399 400
}

401 402 403 404 405 406 407
static u8 symbol__parent_filter(const struct symbol *parent)
{
	if (symbol_conf.exclude_other && parent == NULL)
		return 1 << HIST_FILTER__PARENT;
	return 0;
}

408 409 410 411
static struct hist_entry *hists__findnew_entry(struct hists *hists,
					       struct hist_entry *entry,
					       struct addr_location *al,
					       bool sample_self)
412
{
413
	struct rb_node **p;
414 415
	struct rb_node *parent = NULL;
	struct hist_entry *he;
416
	int64_t cmp;
417 418
	u64 period = entry->stat.period;
	u64 weight = entry->stat.weight;
419

420 421
	p = &hists->entries_in->rb_node;

422 423
	while (*p != NULL) {
		parent = *p;
424
		he = rb_entry(parent, struct hist_entry, rb_node_in);
425

426 427 428 429 430 431 432
		/*
		 * 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);
433 434

		if (!cmp) {
435 436
			if (sample_self)
				he_stat__add_period(&he->stat, period, weight);
437 438
			if (symbol_conf.cumulate_callchain)
				he_stat__add_period(he->stat_acc, period, weight);
439

440
			/*
441
			 * This mem info was allocated from sample__resolve_mem
442 443
			 * and will not be used anymore.
			 */
444
			zfree(&entry->mem_info);
445

446 447 448 449 450 451 452
			/* 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) {
453 454
				map__put(he->ms.map);
				he->ms.map = map__get(entry->ms.map);
455
			}
456
			goto out;
457 458 459 460 461 462 463 464
		}

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

465
	he = hist_entry__new(entry, sample_self);
466
	if (!he)
467
		return NULL;
468

469 470
	hists->nr_entries++;

471 472
	rb_link_node(&he->rb_node_in, parent, p);
	rb_insert_color(&he->rb_node_in, hists->entries_in);
473
out:
474 475
	if (sample_self)
		he_stat__add_cpumode_period(&he->stat, al->cpumode, period);
476 477
	if (symbol_conf.cumulate_callchain)
		he_stat__add_cpumode_period(he->stat_acc, al->cpumode, period);
478 479 480
	return he;
}

481
struct hist_entry *__hists__add_entry(struct hists *hists,
482
				      struct addr_location *al,
483 484 485
				      struct symbol *sym_parent,
				      struct branch_info *bi,
				      struct mem_info *mi,
486
				      struct perf_sample *sample,
487
				      bool sample_self)
488 489 490
{
	struct hist_entry entry = {
		.thread	= al->thread,
491
		.comm = thread__comm(al->thread),
492 493 494 495
		.ms = {
			.map	= al->map,
			.sym	= al->sym,
		},
496
		.socket	 = al->socket,
497 498 499 500
		.cpu	 = al->cpu,
		.cpumode = al->cpumode,
		.ip	 = al->addr,
		.level	 = al->level,
501
		.stat = {
502
			.nr_events = 1,
503 504
			.period	= sample->period,
			.weight = sample->weight,
505
		},
506
		.parent = sym_parent,
507
		.filtered = symbol__parent_filter(sym_parent) | al->filtered,
508
		.hists	= hists,
509 510
		.branch_info = bi,
		.mem_info = mi,
511
		.transaction = sample->transaction,
512 513
		.raw_data = sample->raw_data,
		.raw_size = sample->raw_size,
514 515
	};

516
	return hists__findnew_entry(hists, &entry, al, sample_self);
517 518
}

519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551
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;
552
	struct hists *hists = evsel__hists(iter->evsel);
553
	struct perf_sample *sample = iter->sample;
554 555 556 557 558
	struct hist_entry *he;

	if (mi == NULL)
		return -EINVAL;

559
	cost = sample->weight;
560 561 562 563 564 565 566 567 568 569
	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.
	 */
570 571
	sample->period = cost;

572
	he = __hists__add_entry(hists, al, iter->parent, NULL, mi,
573
				sample, true);
574 575 576 577 578 579 580 581
	if (!he)
		return -ENOMEM;

	iter->he = he;
	return 0;
}

static int
582 583
iter_finish_mem_entry(struct hist_entry_iter *iter,
		      struct addr_location *al __maybe_unused)
584 585
{
	struct perf_evsel *evsel = iter->evsel;
586
	struct hists *hists = evsel__hists(evsel);
587 588 589 590 591 592
	struct hist_entry *he = iter->he;
	int err = -EINVAL;

	if (he == NULL)
		goto out;

593
	hists__inc_nr_samples(hists, he->filtered);
594 595 596 597 598

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

out:
	/*
599 600 601
	 * 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().
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 628 629
	 */
	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
iter_add_single_branch_entry(struct hist_entry_iter *iter __maybe_unused,
			     struct addr_location *al __maybe_unused)
{
630 631 632
	/* to avoid calling callback function */
	iter->he = NULL;

633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656
	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)
{
657
	struct branch_info *bi;
658
	struct perf_evsel *evsel = iter->evsel;
659
	struct hists *hists = evsel__hists(evsel);
660
	struct perf_sample *sample = iter->sample;
661 662 663 664 665 666 667 668 669 670 671 672 673
	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.
	 */
674 675 676
	sample->period = 1;
	sample->weight = bi->flags.cycles ? bi->flags.cycles : 1;

677
	he = __hists__add_entry(hists, al, iter->parent, &bi[i], NULL,
678
				sample, true);
679 680 681
	if (he == NULL)
		return -ENOMEM;

682
	hists__inc_nr_samples(hists, he->filtered);
683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713

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;

714
	he = __hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,
715
				sample, true);
716 717 718 719 720 721 722 723
	if (he == NULL)
		return -ENOMEM;

	iter->he = he;
	return 0;
}

static int
724 725
iter_finish_normal_entry(struct hist_entry_iter *iter,
			 struct addr_location *al __maybe_unused)
726 727 728 729 730 731 732 733 734 735
{
	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;

736
	hists__inc_nr_samples(evsel__hists(evsel), he->filtered);
737 738 739 740

	return hist_entry__append_callchain(he, sample);
}

741
static int
742
iter_prepare_cumulative_entry(struct hist_entry_iter *iter,
743 744
			      struct addr_location *al __maybe_unused)
{
745 746
	struct hist_entry **he_cache;

747
	callchain_cursor_commit(&callchain_cursor);
748 749 750 751 752 753

	/*
	 * This is for detecting cycles or recursions so that they're
	 * cumulated only one time to prevent entries more than 100%
	 * overhead.
	 */
754
	he_cache = malloc(sizeof(*he_cache) * (iter->max_stack + 1));
755 756 757 758 759 760
	if (he_cache == NULL)
		return -ENOMEM;

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

761 762 763 764 765 766 767 768
	return 0;
}

static int
iter_add_single_cumulative_entry(struct hist_entry_iter *iter,
				 struct addr_location *al)
{
	struct perf_evsel *evsel = iter->evsel;
769
	struct hists *hists = evsel__hists(evsel);
770
	struct perf_sample *sample = iter->sample;
771
	struct hist_entry **he_cache = iter->priv;
772 773 774
	struct hist_entry *he;
	int err = 0;

775
	he = __hists__add_entry(hists, al, iter->parent, NULL, NULL,
776
				sample, true);
777 778 779 780
	if (he == NULL)
		return -ENOMEM;

	iter->he = he;
781
	he_cache[iter->curr++] = he;
782

783
	hist_entry__append_callchain(he, sample);
784 785 786 787 788 789 790

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

791
	hists__inc_nr_samples(hists, he->filtered);
792 793 794 795 796 797 798 799 800 801 802 803 804 805

	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;

806
	return fill_callchain_info(al, node, iter->hide_unresolved);
807 808 809 810 811 812 813 814
}

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;
815
	struct hist_entry **he_cache = iter->priv;
816
	struct hist_entry *he;
817
	struct hist_entry he_tmp = {
818
		.hists = evsel__hists(evsel),
819 820 821 822 823 824 825 826 827
		.cpu = al->cpu,
		.thread = al->thread,
		.comm = thread__comm(al->thread),
		.ip = al->addr,
		.ms = {
			.map = al->map,
			.sym = al->sym,
		},
		.parent = iter->parent,
828 829
		.raw_data = sample->raw_data,
		.raw_size = sample->raw_size,
830 831
	};
	int i;
832 833 834 835 836
	struct callchain_cursor cursor;

	callchain_cursor_snapshot(&cursor, &callchain_cursor);

	callchain_cursor_advance(&callchain_cursor);
837 838 839 840 841 842

	/*
	 * 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++) {
843 844 845
		if (hist_entry__cmp(he_cache[i], &he_tmp) == 0) {
			/* to avoid calling callback function */
			iter->he = NULL;
846
			return 0;
847
		}
848
	}
849

850
	he = __hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,
851
				sample, false);
852 853 854 855
	if (he == NULL)
		return -ENOMEM;

	iter->he = he;
856
	he_cache[iter->curr++] = he;
857

858 859
	if (symbol_conf.use_callchain)
		callchain_append(he->callchain, &cursor, sample->period);
860 861 862 863 864 865 866
	return 0;
}

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

870 871 872
	return 0;
}

873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896
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,
};

897 898 899 900 901 902 903 904
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,
};

905
int hist_entry_iter__add(struct hist_entry_iter *iter, struct addr_location *al,
906
			 int max_stack_depth, void *arg)
907 908 909
{
	int err, err2;

910 911
	err = sample__resolve_callchain(iter->sample, &iter->parent,
					iter->evsel, al, max_stack_depth);
912 913 914
	if (err)
		return err;

915 916
	iter->max_stack = max_stack_depth;

917 918 919 920 921 922 923 924
	err = iter->ops->prepare_entry(iter, al);
	if (err)
		goto out;

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

925 926 927 928 929 930
	if (iter->he && iter->add_entry_cb) {
		err = iter->add_entry_cb(iter, al, true, arg);
		if (err)
			goto out;
	}

931 932 933 934
	while (iter->ops->next_entry(iter, al)) {
		err = iter->ops->add_next_entry(iter, al);
		if (err)
			break;
935 936 937 938 939 940

		if (iter->he && iter->add_entry_cb) {
			err = iter->add_entry_cb(iter, al, false, arg);
			if (err)
				goto out;
		}
941 942 943 944 945 946 947 948 949 950
	}

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

	return err;
}

951 952 953
int64_t
hist_entry__cmp(struct hist_entry *left, struct hist_entry *right)
{
954
	struct perf_hpp_fmt *fmt;
955 956
	int64_t cmp = 0;

957
	perf_hpp__for_each_sort_list(fmt) {
958
		cmp = fmt->cmp(fmt, left, right);
959 960 961 962 963 964 965 966 967 968
		if (cmp)
			break;
	}

	return cmp;
}

int64_t
hist_entry__collapse(struct hist_entry *left, struct hist_entry *right)
{
969
	struct perf_hpp_fmt *fmt;
970 971
	int64_t cmp = 0;

972
	perf_hpp__for_each_sort_list(fmt) {
973
		cmp = fmt->collapse(fmt, left, right);
974 975 976 977 978 979 980
		if (cmp)
			break;
	}

	return cmp;
}

981
void hist_entry__delete(struct hist_entry *he)
982
{
983
	thread__zput(he->thread);
984 985 986 987 988 989 990 991 992 993 994 995 996 997
	map__zput(he->ms.map);

	if (he->branch_info) {
		map__zput(he->branch_info->from.map);
		map__zput(he->branch_info->to.map);
		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);
	}

998
	zfree(&he->stat_acc);
999
	free_srcline(he->srcline);
1000 1001
	if (he->srcfile && he->srcfile[0])
		free(he->srcfile);
1002
	free_callchain(he->callchain);
1003
	free(he->trace_output);
1004
	free(he->raw_data);
1005 1006 1007 1008 1009 1010 1011
	free(he);
}

/*
 * collapse the histogram
 */

1012 1013
bool hists__collapse_insert_entry(struct hists *hists __maybe_unused,
				  struct rb_root *root, struct hist_entry *he)
1014
{
1015
	struct rb_node **p = &root->rb_node;
1016 1017 1018 1019 1020 1021
	struct rb_node *parent = NULL;
	struct hist_entry *iter;
	int64_t cmp;

	while (*p != NULL) {
		parent = *p;
1022
		iter = rb_entry(parent, struct hist_entry, rb_node_in);
1023 1024 1025 1026

		cmp = hist_entry__collapse(iter, he);

		if (!cmp) {
1027
			he_stat__add_stat(&iter->stat, &he->stat);
1028 1029
			if (symbol_conf.cumulate_callchain)
				he_stat__add_stat(iter->stat_acc, he->stat_acc);
1030

1031
			if (symbol_conf.use_callchain) {
1032 1033 1034
				callchain_cursor_reset(&callchain_cursor);
				callchain_merge(&callchain_cursor,
						iter->callchain,
1035 1036
						he->callchain);
			}
1037
			hist_entry__delete(he);
1038
			return false;
1039 1040 1041 1042 1043 1044 1045
		}

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

1048 1049
	rb_link_node(&he->rb_node_in, parent, p);
	rb_insert_color(&he->rb_node_in, root);
1050
	return true;
1051 1052
}

1053
struct rb_root *hists__get_rotate_entries_in(struct hists *hists)
1054
{
1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067
	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;
}

1068 1069 1070 1071
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);
1072
	hists__filter_entry_by_symbol(hists, he);
1073
	hists__filter_entry_by_socket(hists, he);
1074 1075
}

1076
void hists__collapse_resort(struct hists *hists, struct ui_progress *prog)
1077 1078
{
	struct rb_root *root;
1079 1080 1081
	struct rb_node *next;
	struct hist_entry *n;

1082
	if (!sort__need_collapse)
1083 1084
		return;

1085 1086
	hists->nr_entries = 0;

1087
	root = hists__get_rotate_entries_in(hists);
1088

1089
	next = rb_first(root);
1090

1091
	while (next) {
1092 1093
		if (session_done())
			break;
1094 1095
		n = rb_entry(next, struct hist_entry, rb_node_in);
		next = rb_next(&n->rb_node_in);
1096

1097
		rb_erase(&n->rb_node_in, root);
1098 1099 1100 1101 1102 1103 1104 1105
		if (hists__collapse_insert_entry(hists, &hists->entries_collapsed, n)) {
			/*
			 * 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);
		}
1106 1107
		if (prog)
			ui_progress__update(prog, 1);
1108
	}
1109
}
1110

1111
static int hist_entry__sort(struct hist_entry *a, struct hist_entry *b)
1112
{
1113 1114
	struct perf_hpp_fmt *fmt;
	int64_t cmp = 0;
1115

1116
	perf_hpp__for_each_sort_list(fmt) {
1117
		if (perf_hpp__should_skip(fmt, a->hists))
1118 1119
			continue;

1120
		cmp = fmt->sort(fmt, a, b);
1121
		if (cmp)
1122 1123 1124
			break;
	}

1125
	return cmp;
1126 1127
}

1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156
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;
}

1157 1158
static void __hists__insert_output_entry(struct rb_root *entries,
					 struct hist_entry *he,
1159 1160
					 u64 min_callchain_hits,
					 bool use_callchain)
1161
{
1162
	struct rb_node **p = &entries->rb_node;
1163 1164 1165
	struct rb_node *parent = NULL;
	struct hist_entry *iter;

1166 1167 1168 1169 1170 1171 1172 1173 1174
	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);
		}
1175
		callchain_param.sort(&he->sorted_chain, he->callchain,
1176
				      min_callchain_hits, &callchain_param);
1177
	}
1178 1179 1180 1181 1182

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

1183
		if (hist_entry__sort(he, iter) > 0)
1184 1185 1186 1187 1188 1189
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}

	rb_link_node(&he->rb_node, parent, p);
1190
	rb_insert_color(&he->rb_node, entries);
1191 1192
}

1193
void hists__output_resort(struct hists *hists, struct ui_progress *prog)
1194
{
1195
	struct rb_root *root;
1196 1197 1198
	struct rb_node *next;
	struct hist_entry *n;
	u64 min_callchain_hits;
1199
	struct perf_evsel *evsel = hists_to_evsel(hists);
1200 1201
	bool use_callchain;

1202
	if (evsel && symbol_conf.use_callchain && !symbol_conf.show_ref_callgraph)
1203 1204 1205
		use_callchain = evsel->attr.sample_type & PERF_SAMPLE_CALLCHAIN;
	else
		use_callchain = symbol_conf.use_callchain;
1206

1207
	min_callchain_hits = hists__total_period(hists) * (callchain_param.min_percent / 100);
1208

1209
	if (sort__need_collapse)
1210 1211 1212 1213 1214 1215
		root = &hists->entries_collapsed;
	else
		root = hists->entries_in;

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

1217
	hists__reset_stats(hists);
1218
	hists__reset_col_len(hists);
1219

1220
	while (next) {
1221 1222
		n = rb_entry(next, struct hist_entry, rb_node_in);
		next = rb_next(&n->rb_node_in);
1223

1224
		__hists__insert_output_entry(&hists->entries, n, min_callchain_hits, use_callchain);
1225
		hists__inc_stats(hists, n);
1226 1227 1228

		if (!n->filtered)
			hists__calc_col_len(hists, n);
1229 1230 1231

		if (prog)
			ui_progress__update(prog, 1);
1232
	}
1233
}
1234

1235
static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h,
1236 1237 1238 1239 1240 1241
				       enum hist_filter filter)
{
	h->filtered &= ~(1 << filter);
	if (h->filtered)
		return;

1242
	/* force fold unfiltered entry for simplicity */
1243
	h->unfolded = false;
1244
	h->row_offset = 0;
1245
	h->nr_rows = 0;
1246

1247
	hists->stats.nr_non_filtered_samples += h->stat.nr_events;
1248

1249
	hists__inc_filter_stats(hists, h);
1250
	hists__calc_col_len(hists, h);
1251 1252
}

1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277

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

1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290
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;
}

1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302
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;
}

1303 1304 1305
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)
1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316
{
	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);

1317
		if (filter(hists, h))
1318 1319
			continue;

1320
		hists__remove_entry_filter(hists, h, type);
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
void hists__filter_by_thread(struct hists *hists)
{
	hists__filter_by_type(hists, HIST_FILTER__THREAD,
			      hists__filter_entry_by_thread);
}

void hists__filter_by_dso(struct hists *hists)
{
	hists__filter_by_type(hists, HIST_FILTER__DSO,
			      hists__filter_entry_by_dso);
}

void hists__filter_by_symbol(struct hists *hists)
{
	hists__filter_by_type(hists, HIST_FILTER__SYMBOL,
			      hists__filter_entry_by_symbol);
}

void hists__filter_by_socket(struct hists *hists)
{
	hists__filter_by_type(hists, HIST_FILTER__SOCKET,
			      hists__filter_entry_by_socket);
}

1348 1349 1350 1351 1352 1353
void events_stats__inc(struct events_stats *stats, u32 type)
{
	++stats->nr_events[0];
	++stats->nr_events[type];
}

1354
void hists__inc_nr_events(struct hists *hists, u32 type)
1355
{
1356
	events_stats__inc(&hists->stats, type);
1357
}
1358

1359 1360 1361 1362 1363 1364 1365
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++;
}

1366 1367 1368
static struct hist_entry *hists__add_dummy_entry(struct hists *hists,
						 struct hist_entry *pair)
{
1369 1370
	struct rb_root *root;
	struct rb_node **p;
1371 1372
	struct rb_node *parent = NULL;
	struct hist_entry *he;
1373
	int64_t cmp;
1374

1375 1376 1377 1378 1379 1380 1381
	if (sort__need_collapse)
		root = &hists->entries_collapsed;
	else
		root = hists->entries_in;

	p = &root->rb_node;

1382 1383
	while (*p != NULL) {
		parent = *p;
1384
		he = rb_entry(parent, struct hist_entry, rb_node_in);
1385

1386
		cmp = hist_entry__collapse(he, pair);
1387 1388 1389 1390 1391 1392 1393 1394 1395 1396

		if (!cmp)
			goto out;

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

1397
	he = hist_entry__new(pair, true);
1398
	if (he) {
1399 1400
		memset(&he->stat, 0, sizeof(he->stat));
		he->hists = hists;
1401 1402
		rb_link_node(&he->rb_node_in, parent, p);
		rb_insert_color(&he->rb_node_in, root);
1403
		hists__inc_stats(hists, he);
1404
		he->dummy = true;
1405 1406 1407 1408 1409
	}
out:
	return he;
}

1410 1411 1412
static struct hist_entry *hists__find_entry(struct hists *hists,
					    struct hist_entry *he)
{
1413 1414 1415 1416 1417 1418
	struct rb_node *n;

	if (sort__need_collapse)
		n = hists->entries_collapsed.rb_node;
	else
		n = hists->entries_in->rb_node;
1419 1420

	while (n) {
1421 1422
		struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in);
		int64_t cmp = hist_entry__collapse(iter, he);
1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439

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

	return NULL;
}

/*
 * Look for pairs to link to the leader buckets (hist_entries):
 */
void hists__match(struct hists *leader, struct hists *other)
{
1440
	struct rb_root *root;
1441 1442 1443
	struct rb_node *nd;
	struct hist_entry *pos, *pair;

1444 1445 1446 1447 1448 1449 1450
	if (sort__need_collapse)
		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);
1451 1452 1453
		pair = hists__find_entry(other, pos);

		if (pair)
1454
			hist_entry__add_pair(pair, pos);
1455 1456
	}
}
1457 1458 1459 1460 1461 1462 1463 1464

/*
 * 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)
{
1465
	struct rb_root *root;
1466 1467 1468
	struct rb_node *nd;
	struct hist_entry *pos, *pair;

1469 1470 1471 1472 1473 1474 1475
	if (sort__need_collapse)
		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);
1476 1477 1478 1479 1480

		if (!hist_entry__has_pairs(pos)) {
			pair = hists__add_dummy_entry(leader, pos);
			if (pair == NULL)
				return -1;
1481
			hist_entry__add_pair(pos, pair);
1482 1483 1484 1485 1486
		}
	}

	return 0;
}
1487

1488 1489 1490 1491 1492 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
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);
		}
	}
}
1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535

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

	evlist__for_each(evlist, pos) {
		ret += fprintf(fp, "%s stats:\n", perf_evsel__name(pos));
		ret += events_stats__fprintf(&evsel__hists(pos)->stats, fp);
	}

	return ret;
}


1536 1537 1538 1539 1540
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 已提交
1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553

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;
}
1554 1555 1556 1557 1558 1559 1560 1561

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

	return 0;
}
1562

1563
int __hists__init(struct hists *hists)
1564 1565 1566 1567 1568 1569 1570
{
	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);
1571
	hists->socket_filter = -1;
1572 1573 1574
	return 0;
}

1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596
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);
}

1597 1598 1599 1600
static void hists_evsel__exit(struct perf_evsel *evsel)
{
	struct hists *hists = evsel__hists(evsel);

1601
	hists__delete_all_entries(hists);
1602 1603
}

1604 1605 1606 1607 1608 1609 1610 1611
static int hists_evsel__init(struct perf_evsel *evsel)
{
	struct hists *hists = evsel__hists(evsel);

	__hists__init(hists);
	return 0;
}

1612 1613 1614 1615 1616 1617 1618 1619
/*
 * 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),
1620 1621
					    hists_evsel__init,
					    hists_evsel__exit);
1622 1623 1624 1625 1626
	if (err)
		fputs("FATAL ERROR: Couldn't setup hists class\n", stderr);

	return err;
}