34 				       struct hist_entry *he);
36 					  struct hist_entry *he);
38 					  struct hist_entry *he);
40 					  struct hist_entry *he);
323 static void hists__delete_entry(struct hists *hists, struct hist_entry *he);
325 static bool hists__decay_entry(struct hists *hists, struct hist_entry *he)  in hists__decay_entry()  argument
327 	u64 prev_period = he->stat.period;  in hists__decay_entry()
333 	he_stat__decay(&he->stat);  in hists__decay_entry()
335 		he_stat__decay(he->stat_acc);  in hists__decay_entry()
336 	decay_callchain(he->callchain);  in hists__decay_entry()
338 	diff = prev_period - he->stat.period;  in hists__decay_entry()
340 	if (!he->depth) {  in hists__decay_entry()
342 		if (!he->filtered)  in hists__decay_entry()
346 	if (!he->leaf) {  in hists__decay_entry()
348 		struct rb_node *node = rb_first_cached(&he->hroot_out);  in hists__decay_entry()
358 	return he->stat.period == 0;  in hists__decay_entry()
361 static void hists__delete_entry(struct hists *hists, struct hist_entry *he)  in hists__delete_entry()  argument
366 	if (he->parent_he) {  in hists__delete_entry()
367 		root_in  = &he->parent_he->hroot_in;  in hists__delete_entry()
368 		root_out = &he->parent_he->hroot_out;  in hists__delete_entry()
377 	rb_erase_cached(&he->rb_node_in, root_in);  in hists__delete_entry()
378 	rb_erase_cached(&he->rb_node, root_out);  in hists__delete_entry()
381 	if (!he->filtered)  in hists__delete_entry()
384 	hist_entry__delete(he);  in hists__delete_entry()
438 static int hist_entry__init(struct hist_entry *he,  in hist_entry__init()  argument
443 	*he = *template;  in hist_entry__init()
444 	he->callchain_size = callchain_size;  in hist_entry__init()
447 		he->stat_acc = malloc(sizeof(he->stat));  in hist_entry__init()
448 		if (he->stat_acc == NULL)  in hist_entry__init()
450 		memcpy(he->stat_acc, &he->stat, sizeof(he->stat));  in hist_entry__init()
452 			memset(&he->stat, 0, sizeof(he->stat));  in hist_entry__init()
455 	map__get(he->ms.map);  in hist_entry__init()
457 	if (he->branch_info) {  in hist_entry__init()
463 		he->branch_info = malloc(sizeof(*he->branch_info));  in hist_entry__init()
464 		if (he->branch_info == NULL)  in hist_entry__init()
467 		memcpy(he->branch_info, template->branch_info,  in hist_entry__init()
468 		       sizeof(*he->branch_info));  in hist_entry__init()
470 		map__get(he->branch_info->from.ms.map);  in hist_entry__init()
471 		map__get(he->branch_info->to.ms.map);  in hist_entry__init()
474 	if (he->mem_info) {  in hist_entry__init()
475 		map__get(he->mem_info->iaddr.ms.map);  in hist_entry__init()
476 		map__get(he->mem_info->daddr.ms.map);  in hist_entry__init()
479 	if (hist_entry__has_callchains(he) && symbol_conf.use_callchain)  in hist_entry__init()
480 		callchain_init(he->callchain);  in hist_entry__init()
482 	if (he->raw_data) {  in hist_entry__init()
483 		he->raw_data = memdup(he->raw_data, he->raw_size);  in hist_entry__init()
484 		if (he->raw_data == NULL)  in hist_entry__init()
488 	if (he->srcline) {  in hist_entry__init()
489 		he->srcline = strdup(he->srcline);  in hist_entry__init()
490 		if (he->srcline == NULL)  in hist_entry__init()
495 		he->res_samples = calloc(sizeof(struct res_sample),  in hist_entry__init()
497 		if (!he->res_samples)  in hist_entry__init()
501 	INIT_LIST_HEAD(&he->pairs.node);  in hist_entry__init()
502 	thread__get(he->thread);  in hist_entry__init()
503 	he->hroot_in  = RB_ROOT_CACHED;  in hist_entry__init()
504 	he->hroot_out = RB_ROOT_CACHED;  in hist_entry__init()
507 		he->leaf = true;  in hist_entry__init()
512 	zfree(&he->srcline);  in hist_entry__init()
515 	zfree(&he->raw_data);  in hist_entry__init()
518 	if (he->branch_info) {  in hist_entry__init()
519 		map__put(he->branch_info->from.ms.map);  in hist_entry__init()
520 		map__put(he->branch_info->to.ms.map);  in hist_entry__init()
521 		zfree(&he->branch_info);  in hist_entry__init()
523 	if (he->mem_info) {  in hist_entry__init()
524 		map__put(he->mem_info->iaddr.ms.map);  in hist_entry__init()
525 		map__put(he->mem_info->daddr.ms.map);  in hist_entry__init()
528 	map__zput(he->ms.map);  in hist_entry__init()
529 	zfree(&he->stat_acc);  in hist_entry__init()
553 	struct hist_entry *he;  in hist_entry__new()  local
562 	he = ops->new(callchain_size);  in hist_entry__new()
563 	if (he) {  in hist_entry__new()
564 		err = hist_entry__init(he, template, sample_self, callchain_size);  in hist_entry__new()
566 			ops->free(he);  in hist_entry__new()
567 			he = NULL;  in hist_entry__new()
571 	return he;  in hist_entry__new()
581 static void hist_entry__add_callchain_period(struct hist_entry *he, u64 period)  in hist_entry__add_callchain_period()  argument
583 	if (!hist_entry__has_callchains(he) || !symbol_conf.use_callchain)  in hist_entry__add_callchain_period()
586 	he->hists->callchain_period += period;  in hist_entry__add_callchain_period()
587 	if (!he->filtered)  in hist_entry__add_callchain_period()
588 		he->hists->callchain_non_filtered_period += period;  in hist_entry__add_callchain_period()
598 	struct hist_entry *he;  in hists__findnew_entry()  local
610 		he = rb_entry(parent, struct hist_entry, rb_node_in);  in hists__findnew_entry()
618 		cmp = hist_entry__cmp(he, entry);  in hists__findnew_entry()
622 				he_stat__add_period(&he->stat, period, weight, ins_lat, p_stage_cyc);  in hists__findnew_entry()
623 				hist_entry__add_callchain_period(he, period);  in hists__findnew_entry()
626 				he_stat__add_period(he->stat_acc, period, weight, ins_lat, p_stage_cyc);  in hists__findnew_entry()
642 			if (he->ms.map != entry->ms.map) {  in hists__findnew_entry()
643 				map__put(he->ms.map);  in hists__findnew_entry()
644 				he->ms.map = map__get(entry->ms.map);  in hists__findnew_entry()
657 	he = hist_entry__new(entry, sample_self);  in hists__findnew_entry()
658 	if (!he)  in hists__findnew_entry()
662 		hist_entry__add_callchain_period(he, period);  in hists__findnew_entry()
665 	rb_link_node(&he->rb_node_in, parent, p);  in hists__findnew_entry()
666 	rb_insert_color_cached(&he->rb_node_in, hists->entries_in, leftmost);  in hists__findnew_entry()
669 		he_stat__add_cpumode_period(&he->stat, al->cpumode, period);  in hists__findnew_entry()
671 		he_stat__add_cpumode_period(he->stat_acc, al->cpumode, period);  in hists__findnew_entry()
672 	return he;  in hists__findnew_entry()
685 static void hists__res_sample(struct hist_entry *he, struct perf_sample *sample)  in hists__res_sample()  argument
690 	if (he->num_res < symbol_conf.res_sample) {  in hists__res_sample()
691 		j = he->num_res++;  in hists__res_sample()
695 	r = &he->res_samples[j];  in hists__res_sample()
751 	}, *he = hists__findnew_entry(hists, &entry, al, sample_self);  in __hists__add_entry()  local
753 	if (!hists->has_callchains && he && he->callchain_size != 0)  in __hists__add_entry()
755 	if (he && symbol_conf.res_sample)  in __hists__add_entry()
756 		hists__res_sample(he, sample);  in __hists__add_entry()
757 	return he;  in __hists__add_entry()
797 	}, *he = hists__findnew_entry(hists, &entry, al, false);  in hists__add_entry_block()  local
799 	return he;  in hists__add_entry_block()
837 	struct hist_entry *he;  in iter_add_single_mem_entry()  local
855 	he = hists__add_entry(hists, al, iter->parent, NULL, mi,  in iter_add_single_mem_entry()
857 	if (!he)  in iter_add_single_mem_entry()
860 	iter->he = he;  in iter_add_single_mem_entry()
870 	struct hist_entry *he = iter->he;  in iter_finish_mem_entry()  local
873 	if (he == NULL)  in iter_finish_mem_entry()
876 	hists__inc_nr_samples(hists, he->filtered);  in iter_finish_mem_entry()
878 	err = hist_entry__append_callchain(he, iter->sample);  in iter_finish_mem_entry()
888 	iter->he = NULL;  in iter_finish_mem_entry()
942 	struct hist_entry *he = NULL;  in iter_add_next_branch_entry()  local
958 	he = hists__add_entry(hists, al, iter->parent, &bi[i], NULL,  in iter_add_next_branch_entry()
960 	if (he == NULL)  in iter_add_next_branch_entry()
963 	hists__inc_nr_samples(hists, he->filtered);  in iter_add_next_branch_entry()
966 	iter->he = he;  in iter_add_next_branch_entry()
976 	iter->he = NULL;  in iter_finish_branch_entry()
993 	struct hist_entry *he;  in iter_add_single_normal_entry()  local
995 	he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,  in iter_add_single_normal_entry()
997 	if (he == NULL)  in iter_add_single_normal_entry()
1000 	iter->he = he;  in iter_add_single_normal_entry()
1008 	struct hist_entry *he = iter->he;  in iter_finish_normal_entry()  local
1012 	if (he == NULL)  in iter_finish_normal_entry()
1015 	iter->he = NULL;  in iter_finish_normal_entry()
1017 	hists__inc_nr_samples(evsel__hists(evsel), he->filtered);  in iter_finish_normal_entry()
1019 	return hist_entry__append_callchain(he, sample);  in iter_finish_normal_entry()
1053 	struct hist_entry *he;  in iter_add_single_cumulative_entry()  local
1056 	he = hists__add_entry(hists, al, iter->parent, NULL, NULL,  in iter_add_single_cumulative_entry()
1058 	if (he == NULL)  in iter_add_single_cumulative_entry()
1061 	iter->he = he;  in iter_add_single_cumulative_entry()
1062 	he_cache[iter->curr++] = he;  in iter_add_single_cumulative_entry()
1064 	hist_entry__append_callchain(he, sample);  in iter_add_single_cumulative_entry()
1072 	hists__inc_nr_samples(hists, he->filtered);  in iter_add_single_cumulative_entry()
1111 	struct hist_entry *he;  in iter_add_next_cumulative_entry()  local
1151 			iter->he = NULL;  in iter_add_next_cumulative_entry()
1156 	he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL,  in iter_add_next_cumulative_entry()
1158 	if (he == NULL)  in iter_add_next_cumulative_entry()
1161 	iter->he = he;  in iter_add_next_cumulative_entry()
1162 	he_cache[iter->curr++] = he;  in iter_add_next_cumulative_entry()
1164 	if (hist_entry__has_callchains(he) && symbol_conf.use_callchain)  in iter_add_next_cumulative_entry()
1165 		callchain_append(he->callchain, &cursor, sample->period);  in iter_add_next_cumulative_entry()
1174 	iter->he = NULL;  in iter_finish_cumulative_entry()
1235 	if (iter->he && iter->add_entry_cb) {  in hist_entry_iter__add()
1246 		if (iter->he && iter->add_entry_cb) {  in hist_entry_iter__add()
1303 void hist_entry__delete(struct hist_entry *he)  in hist_entry__delete()  argument
1305 	struct hist_entry_ops *ops = he->ops;  in hist_entry__delete()
1307 	thread__zput(he->thread);  in hist_entry__delete()
1308 	map__zput(he->ms.map);  in hist_entry__delete()
1310 	if (he->branch_info) {  in hist_entry__delete()
1311 		map__zput(he->branch_info->from.ms.map);  in hist_entry__delete()
1312 		map__zput(he->branch_info->to.ms.map);  in hist_entry__delete()
1313 		free_srcline(he->branch_info->srcline_from);  in hist_entry__delete()
1314 		free_srcline(he->branch_info->srcline_to);  in hist_entry__delete()
1315 		zfree(&he->branch_info);  in hist_entry__delete()
1318 	if (he->mem_info) {  in hist_entry__delete()
1319 		map__zput(he->mem_info->iaddr.ms.map);  in hist_entry__delete()
1320 		map__zput(he->mem_info->daddr.ms.map);  in hist_entry__delete()
1321 		mem_info__zput(he->mem_info);  in hist_entry__delete()
1324 	if (he->block_info)  in hist_entry__delete()
1325 		block_info__zput(he->block_info);  in hist_entry__delete()
1327 	zfree(&he->res_samples);  in hist_entry__delete()
1328 	zfree(&he->stat_acc);  in hist_entry__delete()
1329 	free_srcline(he->srcline);  in hist_entry__delete()
1330 	if (he->srcfile && he->srcfile[0])  in hist_entry__delete()
1331 		zfree(&he->srcfile);  in hist_entry__delete()
1332 	free_callchain(he->callchain);  in hist_entry__delete()
1333 	zfree(&he->trace_output);  in hist_entry__delete()
1334 	zfree(&he->raw_data);  in hist_entry__delete()
1335 	ops->free(he);  in hist_entry__delete()
1345 int hist_entry__snprintf_alignment(struct hist_entry *he, struct perf_hpp *hpp,  in hist_entry__snprintf_alignment()  argument
1348 	if (!list_is_last(&fmt->list, &he->hists->hpp_list->fields)) {  in hist_entry__snprintf_alignment()
1349 		const int width = fmt->width(fmt, hpp, he->hists);  in hist_entry__snprintf_alignment()
1363 static void hists__apply_filters(struct hists *hists, struct hist_entry *he);
1364 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *he,
1374 static void hist_entry__check_and_remove_filter(struct hist_entry *he,  in hist_entry__check_and_remove_filter()  argument
1380 	struct hist_entry *parent = he->parent_he;  in hist_entry__check_and_remove_filter()
1407 	perf_hpp_list__for_each_format(he->hpp_list, fmt) {  in hist_entry__check_and_remove_filter()
1421 		if (!(he->filtered & (1 << type))) {  in hist_entry__check_and_remove_filter()
1438 			he->filtered |= (1 << type);  in hist_entry__check_and_remove_filter()
1440 			he->filtered |= (parent->filtered & (1 << type));  in hist_entry__check_and_remove_filter()
1444 static void hist_entry__apply_hierarchy_filters(struct hist_entry *he)  in hist_entry__apply_hierarchy_filters()  argument
1446 	hist_entry__check_and_remove_filter(he, HIST_FILTER__THREAD,  in hist_entry__apply_hierarchy_filters()
1449 	hist_entry__check_and_remove_filter(he, HIST_FILTER__DSO,  in hist_entry__apply_hierarchy_filters()
1452 	hist_entry__check_and_remove_filter(he, HIST_FILTER__SYMBOL,  in hist_entry__apply_hierarchy_filters()
1455 	hists__apply_filters(he->hists, he);  in hist_entry__apply_hierarchy_filters()
1460 						 struct hist_entry *he,  in hierarchy_insert_entry()  argument
1477 			cmp = fmt->collapse(fmt, iter, he);  in hierarchy_insert_entry()
1483 			he_stat__add_stat(&iter->stat, &he->stat);  in hierarchy_insert_entry()
1495 	new = hist_entry__new(he, true);  in hierarchy_insert_entry()
1510 			he->trace_output = NULL;  in hierarchy_insert_entry()
1515 			he->srcline = NULL;  in hierarchy_insert_entry()
1520 			he->srcfile = NULL;  in hierarchy_insert_entry()
1532 					 struct hist_entry *he)  in hists__hierarchy_insert_entry()  argument
1546 		new_he = hierarchy_insert_entry(hists, root, he, parent, &node->hpp);  in hists__hierarchy_insert_entry()
1565 					    he->callchain) < 0)  in hists__hierarchy_insert_entry()
1571 	hist_entry__delete(he);  in hists__hierarchy_insert_entry()
1579 					struct hist_entry *he)  in hists__collapse_insert_entry()  argument
1588 		return hists__hierarchy_insert_entry(hists, root, he);  in hists__collapse_insert_entry()
1594 		cmp = hist_entry__collapse(iter, he);  in hists__collapse_insert_entry()
1599 			he_stat__add_stat(&iter->stat, &he->stat);  in hists__collapse_insert_entry()
1601 				he_stat__add_stat(iter->stat_acc, he->stat_acc);  in hists__collapse_insert_entry()
1603 			if (hist_entry__has_callchains(he) && symbol_conf.use_callchain) {  in hists__collapse_insert_entry()
1607 						    he->callchain) < 0)  in hists__collapse_insert_entry()
1610 			hist_entry__delete(he);  in hists__collapse_insert_entry()
1623 	rb_link_node(&he->rb_node_in, parent, p);  in hists__collapse_insert_entry()
1624 	rb_insert_color_cached(&he->rb_node_in, root, leftmost);  in hists__collapse_insert_entry()
1643 static void hists__apply_filters(struct hists *hists, struct hist_entry *he)  in hists__apply_filters()  argument
1645 	hists__filter_entry_by_dso(hists, he);  in hists__apply_filters()
1646 	hists__filter_entry_by_thread(hists, he);  in hists__apply_filters()
1647 	hists__filter_entry_by_symbol(hists, he);  in hists__apply_filters()
1648 	hists__filter_entry_by_socket(hists, he);  in hists__apply_filters()
1742 	struct hist_entry *he;  in hierarchy_recalc_total_periods()  local
1755 		he = rb_entry(node, struct hist_entry, rb_node);  in hierarchy_recalc_total_periods()
1758 		hists->stats.total_period += he->stat.period;  in hierarchy_recalc_total_periods()
1759 		if (!he->filtered)  in hierarchy_recalc_total_periods()
1760 			hists->stats.total_non_filtered_period += he->stat.period;  in hierarchy_recalc_total_periods()
1765 					  struct hist_entry *he)  in hierarchy_insert_output_entry()  argument
1777 		if (hist_entry__sort(he, iter) > 0)  in hierarchy_insert_output_entry()
1785 	rb_link_node(&he->rb_node, parent, p);  in hierarchy_insert_output_entry()
1786 	rb_insert_color_cached(&he->rb_node, root, leftmost);  in hierarchy_insert_output_entry()
1789 	perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) {  in hierarchy_insert_output_entry()
1791 			fmt->sort(fmt, he, NULL);  in hierarchy_insert_output_entry()
1803 	struct hist_entry *he;  in hists__hierarchy_output_resort()  local
1809 		he = rb_entry(node, struct hist_entry, rb_node_in);  in hists__hierarchy_output_resort()
1812 		hierarchy_insert_output_entry(root_out, he);  in hists__hierarchy_output_resort()
1818 		if (!he->filtered) {  in hists__hierarchy_output_resort()
1820 			hists__calc_col_len(hists, he);  in hists__hierarchy_output_resort()
1823 		if (!he->leaf) {  in hists__hierarchy_output_resort()
1825 						       &he->hroot_in,  in hists__hierarchy_output_resort()
1826 						       &he->hroot_out,  in hists__hierarchy_output_resort()
1836 			u64 total = he->stat.period;  in hists__hierarchy_output_resort()
1839 				total = he->stat_acc->period;  in hists__hierarchy_output_resort()
1844 		callchain_param.sort(&he->sorted_chain, he->callchain,  in hists__hierarchy_output_resort()
1850 					 struct hist_entry *he,  in __hists__insert_output_entry()  argument
1862 			u64 total = he->stat.period;  in __hists__insert_output_entry()
1865 				total = he->stat_acc->period;  in __hists__insert_output_entry()
1869 		callchain_param.sort(&he->sorted_chain, he->callchain,  in __hists__insert_output_entry()
1877 		if (hist_entry__sort(he, iter) > 0)  in __hists__insert_output_entry()
1885 	rb_link_node(&he->rb_node, parent, p);  in __hists__insert_output_entry()
1886 	rb_insert_color_cached(&he->rb_node, entries, leftmost);  in __hists__insert_output_entry()
1890 		    perf_hpp__defined_dynamic_entry(fmt, he->hists))  in __hists__insert_output_entry()
1891 			fmt->sort(fmt, he, NULL);  /* update column width */  in __hists__insert_output_entry()
1981 static bool can_goto_child(struct hist_entry *he, enum hierarchy_move_dir hmd)  in can_goto_child()  argument
1983 	if (he->leaf || hmd == HMD_FORCE_SIBLING)  in can_goto_child()
1986 	if (he->unfolded || hmd == HMD_FORCE_CHILD)  in can_goto_child()
1994 	struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);  in rb_hierarchy_last()  local
1996 	while (can_goto_child(he, HMD_NORMAL)) {  in rb_hierarchy_last()
1997 		node = rb_last(&he->hroot_out.rb_root);  in rb_hierarchy_last()
1998 		he = rb_entry(node, struct hist_entry, rb_node);  in rb_hierarchy_last()
2005 	struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);  in __rb_hierarchy_next()  local
2007 	if (can_goto_child(he, hmd))  in __rb_hierarchy_next()
2008 		node = rb_first_cached(&he->hroot_out);  in __rb_hierarchy_next()
2013 		he = he->parent_he;  in __rb_hierarchy_next()
2014 		if (he == NULL)  in __rb_hierarchy_next()
2017 		node = rb_next(&he->rb_node);  in __rb_hierarchy_next()
2024 	struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);  in rb_hierarchy_prev()  local
2030 	he = he->parent_he;  in rb_hierarchy_prev()
2031 	if (he == NULL)  in rb_hierarchy_prev()
2034 	return &he->rb_node;  in rb_hierarchy_prev()
2037 bool hist_entry__has_hierarchy_children(struct hist_entry *he, float limit)  in hist_entry__has_hierarchy_children()  argument
2043 	if (he->leaf)  in hist_entry__has_hierarchy_children()
2046 	node = rb_first_cached(&he->hroot_out);  in hist_entry__has_hierarchy_children()
2105 				       struct hist_entry *he)  in hists__filter_entry_by_dso()  argument
2108 	    (he->ms.map == NULL || he->ms.map->dso != hists->dso_filter)) {  in hists__filter_entry_by_dso()
2109 		he->filtered |= (1 << HIST_FILTER__DSO);  in hists__filter_entry_by_dso()
2117 					  struct hist_entry *he)  in hists__filter_entry_by_thread()  argument
2120 	    he->thread != hists->thread_filter) {  in hists__filter_entry_by_thread()
2121 		he->filtered |= (1 << HIST_FILTER__THREAD);  in hists__filter_entry_by_thread()
2129 					  struct hist_entry *he)  in hists__filter_entry_by_symbol()  argument
2132 	    (!he->ms.sym || strstr(he->ms.sym->name,  in hists__filter_entry_by_symbol()
2134 		he->filtered |= (1 << HIST_FILTER__SYMBOL);  in hists__filter_entry_by_symbol()
2142 					  struct hist_entry *he)  in hists__filter_entry_by_socket()  argument
2145 	    (he->socket != hists->socket_filter)) {  in hists__filter_entry_by_socket()
2146 		he->filtered |= (1 << HIST_FILTER__SOCKET);  in hists__filter_entry_by_socket()
2153 typedef bool (*filter_fn_t)(struct hists *hists, struct hist_entry *he);
2175 				  struct hist_entry *he)  in resort_filtered_entry()  argument
2188 		if (hist_entry__sort(he, iter) > 0)  in resort_filtered_entry()
2196 	rb_link_node(&he->rb_node, parent, p);  in resort_filtered_entry()
2197 	rb_insert_color_cached(&he->rb_node, root, leftmost);  in resort_filtered_entry()
2199 	if (he->leaf || he->filtered)  in resort_filtered_entry()
2202 	nd = rb_first_cached(&he->hroot_out);  in resort_filtered_entry()
2207 		rb_erase_cached(&h->rb_node, &he->hroot_out);  in resort_filtered_entry()
2212 	he->hroot_out = new_root;  in resort_filtered_entry()
2351 	struct hist_entry *he;  in hists__add_dummy_entry()  local
2364 		he = rb_entry(parent, struct hist_entry, rb_node_in);  in hists__add_dummy_entry()
2366 		cmp = hist_entry__collapse(he, pair);  in hists__add_dummy_entry()
2379 	he = hist_entry__new(pair, true);  in hists__add_dummy_entry()
2380 	if (he) {  in hists__add_dummy_entry()
2381 		memset(&he->stat, 0, sizeof(he->stat));  in hists__add_dummy_entry()
2382 		he->hists = hists;  in hists__add_dummy_entry()
2384 			memset(he->stat_acc, 0, sizeof(he->stat));  in hists__add_dummy_entry()
2385 		rb_link_node(&he->rb_node_in, parent, p);  in hists__add_dummy_entry()
2386 		rb_insert_color_cached(&he->rb_node_in, root, leftmost);  in hists__add_dummy_entry()
2387 		hists__inc_stats(hists, he);  in hists__add_dummy_entry()
2388 		he->dummy = true;  in hists__add_dummy_entry()
2391 	return he;  in hists__add_dummy_entry()
2400 	struct hist_entry *he;  in add_dummy_hierarchy_entry()  local
2409 		he = rb_entry(parent, struct hist_entry, rb_node_in);  in add_dummy_hierarchy_entry()
2411 		perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) {  in add_dummy_hierarchy_entry()
2412 			cmp = fmt->collapse(fmt, he, pair);  in add_dummy_hierarchy_entry()
2427 	he = hist_entry__new(pair, true);  in add_dummy_hierarchy_entry()
2428 	if (he) {  in add_dummy_hierarchy_entry()
2429 		rb_link_node(&he->rb_node_in, parent, p);  in add_dummy_hierarchy_entry()
2430 		rb_insert_color_cached(&he->rb_node_in, root, leftmost);  in add_dummy_hierarchy_entry()
2432 		he->dummy = true;  in add_dummy_hierarchy_entry()
2433 		he->hists = hists;  in add_dummy_hierarchy_entry()
2434 		memset(&he->stat, 0, sizeof(he->stat));  in add_dummy_hierarchy_entry()
2435 		hists__inc_stats(hists, he);  in add_dummy_hierarchy_entry()
2438 	return he;  in add_dummy_hierarchy_entry()
2442 					    struct hist_entry *he)  in hists__find_entry()  argument
2453 		int64_t cmp = hist_entry__collapse(iter, he);  in hists__find_entry()
2467 						      struct hist_entry *he)  in hists__find_hierarchy_entry()  argument
2477 		perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) {  in hists__find_hierarchy_entry()
2478 			cmp = fmt->collapse(fmt, iter, he);  in hists__find_hierarchy_entry()
2825 	struct hist_entry *he;  in hists__delete_remaining_entries()  local
2831 		he = rb_entry(node, struct hist_entry, rb_node_in);  in hists__delete_remaining_entries()
2832 		hist_entry__delete(he);  in hists__delete_remaining_entries()