hist.c 34.6 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
u16 hists__col_len(struct hists *hists, enum hist_column col)
20
{
21
	return hists->col_len[col];
22 23
}

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

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

38
void hists__reset_col_len(struct hists *hists)
39 40 41 42
{
	enum hist_column col;

	for (col = 0; col < HISTC_NR_COLS; ++col)
43
		hists__set_col_len(hists, col, 0);
44 45
}

46 47 48 49 50 51 52 53 54 55
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);
}

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

62 63 64 65 66 67 68 69 70 71 72
	/*
	 * +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 {
73 74
		symlen = unresolved_col_width + 4 + 2;
		hists__new_col_len(hists, HISTC_SYMBOL, symlen);
75
		hists__set_unres_dso_col_len(hists, HISTC_DSO);
76
	}
77 78

	len = thread__comm_len(h->thread);
79 80
	if (hists__new_col_len(hists, HISTC_COMM, len))
		hists__set_col_len(hists, HISTC_THREAD, len + 6);
81 82 83

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

87 88 89
	if (h->parent)
		hists__new_col_len(hists, HISTC_PARENT, h->parent->namelen);

90 91 92
	if (h->branch_info) {
		if (h->branch_info->from.sym) {
			symlen = (int)h->branch_info->from.sym->namelen + 4;
93 94
			if (verbose)
				symlen += BITS_PER_LONG / 4 + 2 + 3;
95 96 97 98 99 100 101 102 103 104 105 106
			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;
107 108
			if (verbose)
				symlen += BITS_PER_LONG / 4 + 2 + 3;
109 110 111 112 113 114 115 116 117 118
			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);
		}
	}
119 120 121 122 123 124 125

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

	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);
153 154 155 156

	if (h->transaction)
		hists__new_col_len(hists, HISTC_TRANSACTION,
				   hist_entry__transaction_len());
157 158
}

159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174
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);
	}
}

175 176
static void he_stat__add_cpumode_period(struct he_stat *he_stat,
					unsigned int cpumode, u64 period)
177
{
178
	switch (cpumode) {
179
	case PERF_RECORD_MISC_KERNEL:
180
		he_stat->period_sys += period;
181 182
		break;
	case PERF_RECORD_MISC_USER:
183
		he_stat->period_us += period;
184 185
		break;
	case PERF_RECORD_MISC_GUEST_KERNEL:
186
		he_stat->period_guest_sys += period;
187 188
		break;
	case PERF_RECORD_MISC_GUEST_USER:
189
		he_stat->period_guest_us += period;
190 191 192 193 194 195
		break;
	default:
		break;
	}
}

196 197
static void he_stat__add_period(struct he_stat *he_stat, u64 period,
				u64 weight)
198
{
199

200
	he_stat->period		+= period;
201
	he_stat->weight		+= weight;
202 203 204 205 206 207 208 209 210 211 212
	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;
213
	dest->weight		+= src->weight;
214 215
}

216
static void he_stat__decay(struct he_stat *he_stat)
217
{
218 219
	he_stat->period = (he_stat->period * 7) / 8;
	he_stat->nr_events = (he_stat->nr_events * 7) / 8;
220
	/* XXX need decay for weight too? */
221 222 223 224
}

static bool hists__decay_entry(struct hists *hists, struct hist_entry *he)
{
225
	u64 prev_period = he->stat.period;
226
	u64 diff;
227 228

	if (prev_period == 0)
229
		return true;
230

231
	he_stat__decay(&he->stat);
232 233
	if (symbol_conf.cumulate_callchain)
		he_stat__decay(he->stat_acc);
234

235 236 237
	diff = prev_period - he->stat.period;

	hists->stats.total_period -= diff;
238
	if (!he->filtered)
239
		hists->stats.total_non_filtered_period -= diff;
240

241
	return he->stat.period == 0;
242 243
}

244 245 246 247 248 249 250 251 252 253 254 255 256 257
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);

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

	hist_entry__delete(he);
}

258
void hists__decay_entries(struct hists *hists, bool zap_user, bool zap_kernel)
259 260 261 262 263 264 265
{
	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);
266 267
		if (((zap_user && n->level == '.') ||
		     (zap_kernel && n->level != '.') ||
268
		     hists__decay_entry(hists, n))) {
269
			hists__delete_entry(hists, n);
270 271 272 273
		}
	}
}

N
Namhyung Kim 已提交
274 275 276 277 278 279 280 281 282
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);

283
		hists__delete_entry(hists, n);
N
Namhyung Kim 已提交
284 285 286
	}
}

287
/*
288
 * histogram, sorted on item, collects periods
289 290
 */

291 292
static struct hist_entry *hist_entry__new(struct hist_entry *template,
					  bool sample_self)
293
{
294 295 296
	size_t callchain_size = 0;
	struct hist_entry *he;

297
	if (symbol_conf.use_callchain)
298 299 300
		callchain_size = sizeof(struct callchain_root);

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

302 303
	if (he != NULL) {
		*he = *template;
304

305 306 307 308 309 310 311
		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));
312 313
			if (!sample_self)
				memset(&he->stat, 0, sizeof(he->stat));
314 315
		}

316
		map__get(he->ms.map);
317 318

		if (he->branch_info) {
319 320
			/*
			 * This branch info is (a part of) allocated from
321
			 * sample__resolve_bstack() and will be freed after
322 323 324 325
			 * adding new entries.  So we need to save a copy.
			 */
			he->branch_info = malloc(sizeof(*he->branch_info));
			if (he->branch_info == NULL) {
326
				map__zput(he->ms.map);
327
				free(he->stat_acc);
328 329 330 331 332 333 334
				free(he);
				return NULL;
			}

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

335 336
			map__get(he->branch_info->from.map);
			map__get(he->branch_info->to.map);
337 338
		}

339
		if (he->mem_info) {
340 341
			map__get(he->mem_info->iaddr.map);
			map__get(he->mem_info->daddr.map);
342 343
		}

344
		if (symbol_conf.use_callchain)
345
			callchain_init(he->callchain);
346 347

		INIT_LIST_HEAD(&he->pairs.node);
348
		thread__get(he->thread);
349 350
	}

351
	return he;
352 353
}

354 355 356 357 358 359 360
static u8 symbol__parent_filter(const struct symbol *parent)
{
	if (symbol_conf.exclude_other && parent == NULL)
		return 1 << HIST_FILTER__PARENT;
	return 0;
}

361 362 363 364
static struct hist_entry *hists__findnew_entry(struct hists *hists,
					       struct hist_entry *entry,
					       struct addr_location *al,
					       bool sample_self)
365
{
366
	struct rb_node **p;
367 368
	struct rb_node *parent = NULL;
	struct hist_entry *he;
369
	int64_t cmp;
370 371
	u64 period = entry->stat.period;
	u64 weight = entry->stat.weight;
372

373 374
	p = &hists->entries_in->rb_node;

375 376
	while (*p != NULL) {
		parent = *p;
377
		he = rb_entry(parent, struct hist_entry, rb_node_in);
378

379 380 381 382 383 384 385
		/*
		 * 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);
386 387

		if (!cmp) {
388 389
			if (sample_self)
				he_stat__add_period(&he->stat, period, weight);
390 391
			if (symbol_conf.cumulate_callchain)
				he_stat__add_period(he->stat_acc, period, weight);
392

393
			/*
394
			 * This mem info was allocated from sample__resolve_mem
395 396
			 * and will not be used anymore.
			 */
397
			zfree(&entry->mem_info);
398

399 400 401 402 403 404 405
			/* 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) {
406 407
				map__put(he->ms.map);
				he->ms.map = map__get(entry->ms.map);
408
			}
409
			goto out;
410 411 412 413 414 415 416 417
		}

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

418
	he = hist_entry__new(entry, sample_self);
419
	if (!he)
420
		return NULL;
421

422 423
	hists->nr_entries++;

424 425
	rb_link_node(&he->rb_node_in, parent, p);
	rb_insert_color(&he->rb_node_in, hists->entries_in);
426
out:
427 428
	if (sample_self)
		he_stat__add_cpumode_period(&he->stat, al->cpumode, period);
429 430
	if (symbol_conf.cumulate_callchain)
		he_stat__add_cpumode_period(he->stat_acc, al->cpumode, period);
431 432 433
	return he;
}

434
struct hist_entry *__hists__add_entry(struct hists *hists,
435
				      struct addr_location *al,
436 437 438
				      struct symbol *sym_parent,
				      struct branch_info *bi,
				      struct mem_info *mi,
439 440
				      u64 period, u64 weight, u64 transaction,
				      bool sample_self)
441 442 443
{
	struct hist_entry entry = {
		.thread	= al->thread,
444
		.comm = thread__comm(al->thread),
445 446 447 448
		.ms = {
			.map	= al->map,
			.sym	= al->sym,
		},
449 450 451 452
		.cpu	 = al->cpu,
		.cpumode = al->cpumode,
		.ip	 = al->addr,
		.level	 = al->level,
453
		.stat = {
454
			.nr_events = 1,
455
			.period	= period,
456
			.weight = weight,
457
		},
458
		.parent = sym_parent,
459
		.filtered = symbol__parent_filter(sym_parent) | al->filtered,
460
		.hists	= hists,
461 462
		.branch_info = bi,
		.mem_info = mi,
463
		.transaction = transaction,
464 465
	};

466
	return hists__findnew_entry(hists, &entry, al, sample_self);
467 468
}

469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501
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;
502
	struct hists *hists = evsel__hists(iter->evsel);
503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518
	struct hist_entry *he;

	if (mi == NULL)
		return -EINVAL;

	cost = iter->sample->weight;
	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.
	 */
519
	he = __hists__add_entry(hists, al, iter->parent, NULL, mi,
520
				cost, cost, 0, true);
521 522 523 524 525 526 527 528
	if (!he)
		return -ENOMEM;

	iter->he = he;
	return 0;
}

static int
529 530
iter_finish_mem_entry(struct hist_entry_iter *iter,
		      struct addr_location *al __maybe_unused)
531 532
{
	struct perf_evsel *evsel = iter->evsel;
533
	struct hists *hists = evsel__hists(evsel);
534 535 536 537 538 539
	struct hist_entry *he = iter->he;
	int err = -EINVAL;

	if (he == NULL)
		goto out;

540
	hists__inc_nr_samples(hists, he->filtered);
541 542 543 544 545

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

out:
	/*
546 547 548
	 * 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().
549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576
	 */
	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)
{
577 578 579
	/* to avoid calling callback function */
	iter->he = NULL;

580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603
	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)
{
604
	struct branch_info *bi;
605
	struct perf_evsel *evsel = iter->evsel;
606
	struct hists *hists = evsel__hists(evsel);
607 608 609 610 611 612 613 614 615 616 617 618 619
	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.
	 */
620
	he = __hists__add_entry(hists, al, iter->parent, &bi[i], NULL,
621 622
				1, bi->flags.cycles ? bi->flags.cycles : 1,
				0, true);
623 624 625
	if (he == NULL)
		return -ENOMEM;

626
	hists__inc_nr_samples(hists, he->filtered);
627 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

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;

658
	he = __hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,
659
				sample->period, sample->weight,
660
				sample->transaction, true);
661 662 663 664 665 666 667 668
	if (he == NULL)
		return -ENOMEM;

	iter->he = he;
	return 0;
}

static int
669 670
iter_finish_normal_entry(struct hist_entry_iter *iter,
			 struct addr_location *al __maybe_unused)
671 672 673 674 675 676 677 678 679 680
{
	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;

681
	hists__inc_nr_samples(evsel__hists(evsel), he->filtered);
682 683 684 685

	return hist_entry__append_callchain(he, sample);
}

686 687 688 689
static int
iter_prepare_cumulative_entry(struct hist_entry_iter *iter __maybe_unused,
			      struct addr_location *al __maybe_unused)
{
690 691
	struct hist_entry **he_cache;

692
	callchain_cursor_commit(&callchain_cursor);
693 694 695 696 697 698 699 700 701 702 703 704 705

	/*
	 * This is for detecting cycles or recursions so that they're
	 * cumulated only one time to prevent entries more than 100%
	 * overhead.
	 */
	he_cache = malloc(sizeof(*he_cache) * (PERF_MAX_STACK_DEPTH + 1));
	if (he_cache == NULL)
		return -ENOMEM;

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

706 707 708 709 710 711 712 713
	return 0;
}

static int
iter_add_single_cumulative_entry(struct hist_entry_iter *iter,
				 struct addr_location *al)
{
	struct perf_evsel *evsel = iter->evsel;
714
	struct hists *hists = evsel__hists(evsel);
715
	struct perf_sample *sample = iter->sample;
716
	struct hist_entry **he_cache = iter->priv;
717 718 719
	struct hist_entry *he;
	int err = 0;

720
	he = __hists__add_entry(hists, al, iter->parent, NULL, NULL,
721 722 723 724 725 726
				sample->period, sample->weight,
				sample->transaction, true);
	if (he == NULL)
		return -ENOMEM;

	iter->he = he;
727
	he_cache[iter->curr++] = he;
728

729
	hist_entry__append_callchain(he, sample);
730 731 732 733 734 735 736

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

737
	hists__inc_nr_samples(hists, he->filtered);
738 739 740 741 742 743 744 745 746 747 748 749 750 751

	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;

752
	return fill_callchain_info(al, node, iter->hide_unresolved);
753 754 755 756 757 758 759 760
}

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;
761
	struct hist_entry **he_cache = iter->priv;
762
	struct hist_entry *he;
763
	struct hist_entry he_tmp = {
764
		.hists = evsel__hists(evsel),
765 766 767 768 769 770 771 772 773 774 775
		.cpu = al->cpu,
		.thread = al->thread,
		.comm = thread__comm(al->thread),
		.ip = al->addr,
		.ms = {
			.map = al->map,
			.sym = al->sym,
		},
		.parent = iter->parent,
	};
	int i;
776 777 778 779 780
	struct callchain_cursor cursor;

	callchain_cursor_snapshot(&cursor, &callchain_cursor);

	callchain_cursor_advance(&callchain_cursor);
781 782 783 784 785 786

	/*
	 * 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++) {
787 788 789
		if (hist_entry__cmp(he_cache[i], &he_tmp) == 0) {
			/* to avoid calling callback function */
			iter->he = NULL;
790
			return 0;
791
		}
792
	}
793

794
	he = __hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,
795 796 797 798 799 800
				sample->period, sample->weight,
				sample->transaction, false);
	if (he == NULL)
		return -ENOMEM;

	iter->he = he;
801
	he_cache[iter->curr++] = he;
802

803 804
	if (symbol_conf.use_callchain)
		callchain_append(he->callchain, &cursor, sample->period);
805 806 807 808 809 810 811
	return 0;
}

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

815 816 817
	return 0;
}

818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841
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,
};

842 843 844 845 846 847 848 849
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,
};

850
int hist_entry_iter__add(struct hist_entry_iter *iter, struct addr_location *al,
851
			 int max_stack_depth, void *arg)
852 853 854
{
	int err, err2;

855 856
	err = sample__resolve_callchain(iter->sample, &iter->parent,
					iter->evsel, al, max_stack_depth);
857 858 859 860 861 862 863 864 865 866 867
	if (err)
		return err;

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

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

868 869 870 871 872 873
	if (iter->he && iter->add_entry_cb) {
		err = iter->add_entry_cb(iter, al, true, arg);
		if (err)
			goto out;
	}

874 875 876 877
	while (iter->ops->next_entry(iter, al)) {
		err = iter->ops->add_next_entry(iter, al);
		if (err)
			break;
878 879 880 881 882 883

		if (iter->he && iter->add_entry_cb) {
			err = iter->add_entry_cb(iter, al, false, arg);
			if (err)
				goto out;
		}
884 885 886 887 888 889 890 891 892 893
	}

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

	return err;
}

894 895 896
int64_t
hist_entry__cmp(struct hist_entry *left, struct hist_entry *right)
{
897
	struct perf_hpp_fmt *fmt;
898 899
	int64_t cmp = 0;

900
	perf_hpp__for_each_sort_list(fmt) {
901 902 903
		if (perf_hpp__should_skip(fmt))
			continue;

904
		cmp = fmt->cmp(fmt, left, right);
905 906 907 908 909 910 911 912 913 914
		if (cmp)
			break;
	}

	return cmp;
}

int64_t
hist_entry__collapse(struct hist_entry *left, struct hist_entry *right)
{
915
	struct perf_hpp_fmt *fmt;
916 917
	int64_t cmp = 0;

918
	perf_hpp__for_each_sort_list(fmt) {
919 920 921
		if (perf_hpp__should_skip(fmt))
			continue;

922
		cmp = fmt->collapse(fmt, left, right);
923 924 925 926 927 928 929
		if (cmp)
			break;
	}

	return cmp;
}

930
void hist_entry__delete(struct hist_entry *he)
931
{
932
	thread__zput(he->thread);
933 934 935 936 937 938 939 940 941 942 943 944 945 946
	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);
	}

947
	zfree(&he->stat_acc);
948
	free_srcline(he->srcline);
949
	free_callchain(he->callchain);
950 951 952 953 954 955 956
	free(he);
}

/*
 * collapse the histogram
 */

957
static bool hists__collapse_insert_entry(struct hists *hists __maybe_unused,
958 959
					 struct rb_root *root,
					 struct hist_entry *he)
960
{
961
	struct rb_node **p = &root->rb_node;
962 963 964 965 966 967
	struct rb_node *parent = NULL;
	struct hist_entry *iter;
	int64_t cmp;

	while (*p != NULL) {
		parent = *p;
968
		iter = rb_entry(parent, struct hist_entry, rb_node_in);
969 970 971 972

		cmp = hist_entry__collapse(iter, he);

		if (!cmp) {
973
			he_stat__add_stat(&iter->stat, &he->stat);
974 975
			if (symbol_conf.cumulate_callchain)
				he_stat__add_stat(iter->stat_acc, he->stat_acc);
976

977
			if (symbol_conf.use_callchain) {
978 979 980
				callchain_cursor_reset(&callchain_cursor);
				callchain_merge(&callchain_cursor,
						iter->callchain,
981 982
						he->callchain);
			}
983
			hist_entry__delete(he);
984
			return false;
985 986 987 988 989 990 991
		}

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

994 995
	rb_link_node(&he->rb_node_in, parent, p);
	rb_insert_color(&he->rb_node_in, root);
996
	return true;
997 998
}

999
static struct rb_root *hists__get_rotate_entries_in(struct hists *hists)
1000
{
1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013
	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;
}

1014 1015 1016 1017
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);
1018
	hists__filter_entry_by_symbol(hists, he);
1019 1020
}

1021
void hists__collapse_resort(struct hists *hists, struct ui_progress *prog)
1022 1023
{
	struct rb_root *root;
1024 1025 1026
	struct rb_node *next;
	struct hist_entry *n;

1027
	if (!sort__need_collapse)
1028 1029
		return;

1030 1031
	hists->nr_entries = 0;

1032
	root = hists__get_rotate_entries_in(hists);
1033

1034
	next = rb_first(root);
1035

1036
	while (next) {
1037 1038
		if (session_done())
			break;
1039 1040
		n = rb_entry(next, struct hist_entry, rb_node_in);
		next = rb_next(&n->rb_node_in);
1041

1042
		rb_erase(&n->rb_node_in, root);
1043 1044 1045 1046 1047 1048 1049 1050
		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);
		}
1051 1052
		if (prog)
			ui_progress__update(prog, 1);
1053
	}
1054
}
1055

1056
static int hist_entry__sort(struct hist_entry *a, struct hist_entry *b)
1057
{
1058 1059
	struct perf_hpp_fmt *fmt;
	int64_t cmp = 0;
1060

1061
	perf_hpp__for_each_sort_list(fmt) {
1062 1063 1064
		if (perf_hpp__should_skip(fmt))
			continue;

1065
		cmp = fmt->sort(fmt, a, b);
1066
		if (cmp)
1067 1068 1069
			break;
	}

1070
	return cmp;
1071 1072
}

1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101
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;
}

1102 1103 1104
static void __hists__insert_output_entry(struct rb_root *entries,
					 struct hist_entry *he,
					 u64 min_callchain_hits)
1105
{
1106
	struct rb_node **p = &entries->rb_node;
1107 1108 1109
	struct rb_node *parent = NULL;
	struct hist_entry *iter;

1110
	if (symbol_conf.use_callchain)
1111
		callchain_param.sort(&he->sorted_chain, he->callchain,
1112 1113 1114 1115 1116 1117
				      min_callchain_hits, &callchain_param);

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

1118
		if (hist_entry__sort(he, iter) > 0)
1119 1120 1121 1122 1123 1124
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}

	rb_link_node(&he->rb_node, parent, p);
1125
	rb_insert_color(&he->rb_node, entries);
1126 1127
}

1128
void hists__output_resort(struct hists *hists, struct ui_progress *prog)
1129
{
1130
	struct rb_root *root;
1131 1132 1133 1134
	struct rb_node *next;
	struct hist_entry *n;
	u64 min_callchain_hits;

1135
	min_callchain_hits = hists->stats.total_period * (callchain_param.min_percent / 100);
1136

1137
	if (sort__need_collapse)
1138 1139 1140 1141 1142 1143
		root = &hists->entries_collapsed;
	else
		root = hists->entries_in;

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

1145
	hists__reset_stats(hists);
1146
	hists__reset_col_len(hists);
1147

1148
	while (next) {
1149 1150
		n = rb_entry(next, struct hist_entry, rb_node_in);
		next = rb_next(&n->rb_node_in);
1151

1152
		__hists__insert_output_entry(&hists->entries, n, min_callchain_hits);
1153
		hists__inc_stats(hists, n);
1154 1155 1156

		if (!n->filtered)
			hists__calc_col_len(hists, n);
1157 1158 1159

		if (prog)
			ui_progress__update(prog, 1);
1160
	}
1161
}
1162

1163
static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *h,
1164 1165 1166 1167 1168 1169
				       enum hist_filter filter)
{
	h->filtered &= ~(1 << filter);
	if (h->filtered)
		return;

1170
	/* force fold unfiltered entry for simplicity */
1171
	h->unfolded = false;
1172
	h->row_offset = 0;
1173
	h->nr_rows = 0;
1174

1175
	hists->stats.nr_non_filtered_samples += h->stat.nr_events;
1176

1177
	hists__inc_filter_stats(hists, h);
1178
	hists__calc_col_len(hists, h);
1179 1180
}

1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193

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

1194
void hists__filter_by_dso(struct hists *hists)
1195 1196 1197
{
	struct rb_node *nd;

1198
	hists->stats.nr_non_filtered_samples = 0;
1199 1200

	hists__reset_filter_stats(hists);
1201
	hists__reset_col_len(hists);
1202

1203
	for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
1204 1205 1206 1207 1208
		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);

		if (symbol_conf.exclude_other && !h->parent)
			continue;

1209
		if (hists__filter_entry_by_dso(hists, h))
1210 1211
			continue;

1212
		hists__remove_entry_filter(hists, h, HIST_FILTER__DSO);
1213 1214 1215
	}
}

1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227
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;
}

1228
void hists__filter_by_thread(struct hists *hists)
1229 1230 1231
{
	struct rb_node *nd;

1232
	hists->stats.nr_non_filtered_samples = 0;
1233 1234

	hists__reset_filter_stats(hists);
1235
	hists__reset_col_len(hists);
1236

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

1240
		if (hists__filter_entry_by_thread(hists, h))
1241
			continue;
1242

1243
		hists__remove_entry_filter(hists, h, HIST_FILTER__THREAD);
1244 1245
	}
}
1246

1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263
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;
}

void hists__filter_by_symbol(struct hists *hists)
{
	struct rb_node *nd;

1264
	hists->stats.nr_non_filtered_samples = 0;
1265 1266

	hists__reset_filter_stats(hists);
1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278
	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);

		if (hists__filter_entry_by_symbol(hists, h))
			continue;

		hists__remove_entry_filter(hists, h, HIST_FILTER__SYMBOL);
	}
}

1279 1280 1281 1282 1283 1284
void events_stats__inc(struct events_stats *stats, u32 type)
{
	++stats->nr_events[0];
	++stats->nr_events[type];
}

1285
void hists__inc_nr_events(struct hists *hists, u32 type)
1286
{
1287
	events_stats__inc(&hists->stats, type);
1288
}
1289

1290 1291 1292 1293 1294 1295 1296
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++;
}

1297 1298 1299
static struct hist_entry *hists__add_dummy_entry(struct hists *hists,
						 struct hist_entry *pair)
{
1300 1301
	struct rb_root *root;
	struct rb_node **p;
1302 1303
	struct rb_node *parent = NULL;
	struct hist_entry *he;
1304
	int64_t cmp;
1305

1306 1307 1308 1309 1310 1311 1312
	if (sort__need_collapse)
		root = &hists->entries_collapsed;
	else
		root = hists->entries_in;

	p = &root->rb_node;

1313 1314
	while (*p != NULL) {
		parent = *p;
1315
		he = rb_entry(parent, struct hist_entry, rb_node_in);
1316

1317
		cmp = hist_entry__collapse(he, pair);
1318 1319 1320 1321 1322 1323 1324 1325 1326 1327

		if (!cmp)
			goto out;

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

1328
	he = hist_entry__new(pair, true);
1329
	if (he) {
1330 1331
		memset(&he->stat, 0, sizeof(he->stat));
		he->hists = hists;
1332 1333
		rb_link_node(&he->rb_node_in, parent, p);
		rb_insert_color(&he->rb_node_in, root);
1334
		hists__inc_stats(hists, he);
1335
		he->dummy = true;
1336 1337 1338 1339 1340
	}
out:
	return he;
}

1341 1342 1343
static struct hist_entry *hists__find_entry(struct hists *hists,
					    struct hist_entry *he)
{
1344 1345 1346 1347 1348 1349
	struct rb_node *n;

	if (sort__need_collapse)
		n = hists->entries_collapsed.rb_node;
	else
		n = hists->entries_in->rb_node;
1350 1351

	while (n) {
1352 1353
		struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in);
		int64_t cmp = hist_entry__collapse(iter, he);
1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370

		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)
{
1371
	struct rb_root *root;
1372 1373 1374
	struct rb_node *nd;
	struct hist_entry *pos, *pair;

1375 1376 1377 1378 1379 1380 1381
	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);
1382 1383 1384
		pair = hists__find_entry(other, pos);

		if (pair)
1385
			hist_entry__add_pair(pair, pos);
1386 1387
	}
}
1388 1389 1390 1391 1392 1393 1394 1395

/*
 * 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)
{
1396
	struct rb_root *root;
1397 1398 1399
	struct rb_node *nd;
	struct hist_entry *pos, *pair;

1400 1401 1402 1403 1404 1405 1406
	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);
1407 1408 1409 1410 1411

		if (!hist_entry__has_pairs(pos)) {
			pair = hists__add_dummy_entry(leader, pos);
			if (pair == NULL)
				return -1;
1412
			hist_entry__add_pair(pos, pair);
1413 1414 1415 1416 1417
		}
	}

	return 0;
}
1418

1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451
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);
		}
	}
}
1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466

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


1467 1468 1469 1470 1471
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 已提交
1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484

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;
}
1485 1486 1487 1488 1489 1490 1491 1492

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

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

static int hists_evsel__init(struct perf_evsel *evsel)
{
	struct hists *hists = evsel__hists(evsel);

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

/*
 * 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),
					    hists_evsel__init, NULL);
	if (err)
		fputs("FATAL ERROR: Couldn't setup hists class\n", stderr);

	return err;
}