Lines Matching refs:he
34 struct hist_entry *he);
36 struct hist_entry *he);
38 struct hist_entry *he);
40 struct hist_entry *he);
315 static void hists__delete_entry(struct hists *hists, struct hist_entry *he);
317 static bool hists__decay_entry(struct hists *hists, struct hist_entry *he) in hists__decay_entry() argument
319 u64 prev_period = he->stat.period; in hists__decay_entry()
325 he_stat__decay(&he->stat); in hists__decay_entry()
327 he_stat__decay(he->stat_acc); in hists__decay_entry()
328 decay_callchain(he->callchain); in hists__decay_entry()
330 diff = prev_period - he->stat.period; in hists__decay_entry()
332 if (!he->depth) { in hists__decay_entry()
334 if (!he->filtered) in hists__decay_entry()
338 if (!he->leaf) { in hists__decay_entry()
340 struct rb_node *node = rb_first_cached(&he->hroot_out); in hists__decay_entry()
350 return he->stat.period == 0; in hists__decay_entry()
353 static void hists__delete_entry(struct hists *hists, struct hist_entry *he) in hists__delete_entry() argument
358 if (he->parent_he) { in hists__delete_entry()
359 root_in = &he->parent_he->hroot_in; in hists__delete_entry()
360 root_out = &he->parent_he->hroot_out; in hists__delete_entry()
369 rb_erase_cached(&he->rb_node_in, root_in); in hists__delete_entry()
370 rb_erase_cached(&he->rb_node, root_out); in hists__delete_entry()
373 if (!he->filtered) in hists__delete_entry()
376 hist_entry__delete(he); in hists__delete_entry()
430 static int hist_entry__init(struct hist_entry *he, in hist_entry__init() argument
435 *he = *template; in hist_entry__init()
436 he->callchain_size = callchain_size; in hist_entry__init()
439 he->stat_acc = malloc(sizeof(he->stat)); in hist_entry__init()
440 if (he->stat_acc == NULL) in hist_entry__init()
442 memcpy(he->stat_acc, &he->stat, sizeof(he->stat)); in hist_entry__init()
444 memset(&he->stat, 0, sizeof(he->stat)); in hist_entry__init()
447 map__get(he->ms.map); in hist_entry__init()
449 if (he->branch_info) { in hist_entry__init()
455 he->branch_info = malloc(sizeof(*he->branch_info)); in hist_entry__init()
456 if (he->branch_info == NULL) in hist_entry__init()
459 memcpy(he->branch_info, template->branch_info, in hist_entry__init()
460 sizeof(*he->branch_info)); in hist_entry__init()
462 map__get(he->branch_info->from.ms.map); in hist_entry__init()
463 map__get(he->branch_info->to.ms.map); in hist_entry__init()
466 if (he->mem_info) { in hist_entry__init()
467 map__get(he->mem_info->iaddr.ms.map); in hist_entry__init()
468 map__get(he->mem_info->daddr.ms.map); in hist_entry__init()
471 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain) in hist_entry__init()
472 callchain_init(he->callchain); in hist_entry__init()
474 if (he->raw_data) { in hist_entry__init()
475 he->raw_data = memdup(he->raw_data, he->raw_size); in hist_entry__init()
476 if (he->raw_data == NULL) in hist_entry__init()
480 if (he->srcline) { in hist_entry__init()
481 he->srcline = strdup(he->srcline); in hist_entry__init()
482 if (he->srcline == NULL) in hist_entry__init()
487 he->res_samples = calloc(sizeof(struct res_sample), in hist_entry__init()
489 if (!he->res_samples) in hist_entry__init()
493 INIT_LIST_HEAD(&he->pairs.node); in hist_entry__init()
494 thread__get(he->thread); in hist_entry__init()
495 he->hroot_in = RB_ROOT_CACHED; in hist_entry__init()
496 he->hroot_out = RB_ROOT_CACHED; in hist_entry__init()
499 he->leaf = true; in hist_entry__init()
504 zfree(&he->srcline); in hist_entry__init()
507 zfree(&he->raw_data); in hist_entry__init()
510 if (he->branch_info) { in hist_entry__init()
511 map__put(he->branch_info->from.ms.map); in hist_entry__init()
512 map__put(he->branch_info->to.ms.map); in hist_entry__init()
513 zfree(&he->branch_info); in hist_entry__init()
515 if (he->mem_info) { in hist_entry__init()
516 map__put(he->mem_info->iaddr.ms.map); in hist_entry__init()
517 map__put(he->mem_info->daddr.ms.map); in hist_entry__init()
520 map__zput(he->ms.map); in hist_entry__init()
521 zfree(&he->stat_acc); in hist_entry__init()
545 struct hist_entry *he; in hist_entry__new() local
554 he = ops->new(callchain_size); in hist_entry__new()
555 if (he) { in hist_entry__new()
556 err = hist_entry__init(he, template, sample_self, callchain_size); in hist_entry__new()
558 ops->free(he); in hist_entry__new()
559 he = NULL; in hist_entry__new()
563 return he; in hist_entry__new()
573 static void hist_entry__add_callchain_period(struct hist_entry *he, u64 period) in hist_entry__add_callchain_period() argument
575 if (!hist_entry__has_callchains(he) || !symbol_conf.use_callchain) in hist_entry__add_callchain_period()
578 he->hists->callchain_period += period; in hist_entry__add_callchain_period()
579 if (!he->filtered) in hist_entry__add_callchain_period()
580 he->hists->callchain_non_filtered_period += period; in hist_entry__add_callchain_period()
590 struct hist_entry *he; in hists__findnew_entry() local
599 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry()
607 cmp = hist_entry__cmp(he, entry); in hists__findnew_entry()
611 he_stat__add_period(&he->stat, period); in hists__findnew_entry()
612 hist_entry__add_callchain_period(he, period); in hists__findnew_entry()
615 he_stat__add_period(he->stat_acc, period); in hists__findnew_entry()
631 if (he->ms.map != entry->ms.map) { in hists__findnew_entry()
632 map__put(he->ms.map); in hists__findnew_entry()
633 he->ms.map = map__get(entry->ms.map); in hists__findnew_entry()
646 he = hist_entry__new(entry, sample_self); in hists__findnew_entry()
647 if (!he) in hists__findnew_entry()
651 hist_entry__add_callchain_period(he, period); in hists__findnew_entry()
654 rb_link_node(&he->rb_node_in, parent, p); in hists__findnew_entry()
655 rb_insert_color_cached(&he->rb_node_in, hists->entries_in, leftmost); in hists__findnew_entry()
658 he_stat__add_cpumode_period(&he->stat, al->cpumode, period); in hists__findnew_entry()
660 he_stat__add_cpumode_period(he->stat_acc, al->cpumode, period); in hists__findnew_entry()
661 return he; in hists__findnew_entry()
674 static void hists__res_sample(struct hist_entry *he, struct perf_sample *sample) in hists__res_sample() argument
679 if (he->num_res < symbol_conf.res_sample) { in hists__res_sample()
680 j = he->num_res++; in hists__res_sample()
684 r = &he->res_samples[j]; in hists__res_sample()
740 }, *he = hists__findnew_entry(hists, &entry, al, sample_self); in __hists__add_entry() local
742 if (!hists->has_callchains && he && he->callchain_size != 0) in __hists__add_entry()
744 if (he && symbol_conf.res_sample) in __hists__add_entry()
745 hists__res_sample(he, sample); in __hists__add_entry()
746 return he; in __hists__add_entry()
786 }, *he = hists__findnew_entry(hists, &entry, al, false); in hists__add_entry_block() local
788 return he; in hists__add_entry_block()
826 struct hist_entry *he; in iter_add_single_mem_entry() local
844 he = hists__add_entry(hists, al, iter->parent, NULL, mi, in iter_add_single_mem_entry()
846 if (!he) in iter_add_single_mem_entry()
849 iter->he = he; in iter_add_single_mem_entry()
859 struct hist_entry *he = iter->he; in iter_finish_mem_entry() local
862 if (he == NULL) in iter_finish_mem_entry()
865 hists__inc_nr_samples(hists, he->filtered); in iter_finish_mem_entry()
867 err = hist_entry__append_callchain(he, iter->sample); in iter_finish_mem_entry()
877 iter->he = NULL; in iter_finish_mem_entry()
931 struct hist_entry *he = NULL; in iter_add_next_branch_entry() local
947 he = hists__add_entry(hists, al, iter->parent, &bi[i], NULL, in iter_add_next_branch_entry()
949 if (he == NULL) in iter_add_next_branch_entry()
952 hists__inc_nr_samples(hists, he->filtered); in iter_add_next_branch_entry()
955 iter->he = he; in iter_add_next_branch_entry()
965 iter->he = NULL; in iter_finish_branch_entry()
982 struct hist_entry *he; in iter_add_single_normal_entry() local
984 he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL, in iter_add_single_normal_entry()
986 if (he == NULL) in iter_add_single_normal_entry()
989 iter->he = he; in iter_add_single_normal_entry()
997 struct hist_entry *he = iter->he; in iter_finish_normal_entry() local
1001 if (he == NULL) in iter_finish_normal_entry()
1004 iter->he = NULL; in iter_finish_normal_entry()
1006 hists__inc_nr_samples(evsel__hists(evsel), he->filtered); in iter_finish_normal_entry()
1008 return hist_entry__append_callchain(he, sample); in iter_finish_normal_entry()
1042 struct hist_entry *he; in iter_add_single_cumulative_entry() local
1045 he = hists__add_entry(hists, al, iter->parent, NULL, NULL, in iter_add_single_cumulative_entry()
1047 if (he == NULL) in iter_add_single_cumulative_entry()
1050 iter->he = he; in iter_add_single_cumulative_entry()
1051 he_cache[iter->curr++] = he; in iter_add_single_cumulative_entry()
1053 hist_entry__append_callchain(he, sample); in iter_add_single_cumulative_entry()
1061 hists__inc_nr_samples(hists, he->filtered); in iter_add_single_cumulative_entry()
1100 struct hist_entry *he; in iter_add_next_cumulative_entry() local
1140 iter->he = NULL; in iter_add_next_cumulative_entry()
1145 he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL, in iter_add_next_cumulative_entry()
1147 if (he == NULL) in iter_add_next_cumulative_entry()
1150 iter->he = he; in iter_add_next_cumulative_entry()
1151 he_cache[iter->curr++] = he; in iter_add_next_cumulative_entry()
1153 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain) in iter_add_next_cumulative_entry()
1154 callchain_append(he->callchain, &cursor, sample->period); in iter_add_next_cumulative_entry()
1163 iter->he = NULL; in iter_finish_cumulative_entry()
1224 if (iter->he && iter->add_entry_cb) { in hist_entry_iter__add()
1235 if (iter->he && iter->add_entry_cb) { in hist_entry_iter__add()
1292 void hist_entry__delete(struct hist_entry *he) in hist_entry__delete() argument
1294 struct hist_entry_ops *ops = he->ops; in hist_entry__delete()
1296 thread__zput(he->thread); in hist_entry__delete()
1297 map__zput(he->ms.map); in hist_entry__delete()
1299 if (he->branch_info) { in hist_entry__delete()
1300 map__zput(he->branch_info->from.ms.map); in hist_entry__delete()
1301 map__zput(he->branch_info->to.ms.map); in hist_entry__delete()
1302 free_srcline(he->branch_info->srcline_from); in hist_entry__delete()
1303 free_srcline(he->branch_info->srcline_to); in hist_entry__delete()
1304 zfree(&he->branch_info); in hist_entry__delete()
1307 if (he->mem_info) { in hist_entry__delete()
1308 map__zput(he->mem_info->iaddr.ms.map); in hist_entry__delete()
1309 map__zput(he->mem_info->daddr.ms.map); in hist_entry__delete()
1310 mem_info__zput(he->mem_info); in hist_entry__delete()
1313 if (he->block_info) in hist_entry__delete()
1314 block_info__zput(he->block_info); in hist_entry__delete()
1316 zfree(&he->res_samples); in hist_entry__delete()
1317 zfree(&he->stat_acc); in hist_entry__delete()
1318 free_srcline(he->srcline); in hist_entry__delete()
1319 if (he->srcfile && he->srcfile[0]) in hist_entry__delete()
1320 zfree(&he->srcfile); in hist_entry__delete()
1321 free_callchain(he->callchain); in hist_entry__delete()
1322 zfree(&he->trace_output); in hist_entry__delete()
1323 zfree(&he->raw_data); in hist_entry__delete()
1324 ops->free(he); in hist_entry__delete()
1334 int hist_entry__snprintf_alignment(struct hist_entry *he, struct perf_hpp *hpp, in hist_entry__snprintf_alignment() argument
1337 if (!list_is_last(&fmt->list, &he->hists->hpp_list->fields)) { in hist_entry__snprintf_alignment()
1338 const int width = fmt->width(fmt, hpp, he->hists); in hist_entry__snprintf_alignment()
1352 static void hists__apply_filters(struct hists *hists, struct hist_entry *he);
1353 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *he,
1363 static void hist_entry__check_and_remove_filter(struct hist_entry *he, in hist_entry__check_and_remove_filter() argument
1369 struct hist_entry *parent = he->parent_he; in hist_entry__check_and_remove_filter()
1396 perf_hpp_list__for_each_format(he->hpp_list, fmt) { in hist_entry__check_and_remove_filter()
1410 if (!(he->filtered & (1 << type))) { in hist_entry__check_and_remove_filter()
1427 he->filtered |= (1 << type); in hist_entry__check_and_remove_filter()
1429 he->filtered |= (parent->filtered & (1 << type)); in hist_entry__check_and_remove_filter()
1433 static void hist_entry__apply_hierarchy_filters(struct hist_entry *he) in hist_entry__apply_hierarchy_filters() argument
1435 hist_entry__check_and_remove_filter(he, HIST_FILTER__THREAD, in hist_entry__apply_hierarchy_filters()
1438 hist_entry__check_and_remove_filter(he, HIST_FILTER__DSO, in hist_entry__apply_hierarchy_filters()
1441 hist_entry__check_and_remove_filter(he, HIST_FILTER__SYMBOL, in hist_entry__apply_hierarchy_filters()
1444 hists__apply_filters(he->hists, he); in hist_entry__apply_hierarchy_filters()
1449 struct hist_entry *he, in hierarchy_insert_entry() argument
1466 cmp = fmt->collapse(fmt, iter, he); in hierarchy_insert_entry()
1472 he_stat__add_stat(&iter->stat, &he->stat); in hierarchy_insert_entry()
1484 new = hist_entry__new(he, true); in hierarchy_insert_entry()
1499 he->trace_output = NULL; in hierarchy_insert_entry()
1504 he->srcline = NULL; in hierarchy_insert_entry()
1509 he->srcfile = NULL; in hierarchy_insert_entry()
1521 struct hist_entry *he) in hists__hierarchy_insert_entry() argument
1535 new_he = hierarchy_insert_entry(hists, root, he, parent, &node->hpp); in hists__hierarchy_insert_entry()
1554 he->callchain) < 0) in hists__hierarchy_insert_entry()
1560 hist_entry__delete(he); in hists__hierarchy_insert_entry()
1568 struct hist_entry *he) in hists__collapse_insert_entry() argument
1577 return hists__hierarchy_insert_entry(hists, root, he); in hists__collapse_insert_entry()
1583 cmp = hist_entry__collapse(iter, he); in hists__collapse_insert_entry()
1588 he_stat__add_stat(&iter->stat, &he->stat); in hists__collapse_insert_entry()
1590 he_stat__add_stat(iter->stat_acc, he->stat_acc); in hists__collapse_insert_entry()
1592 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain) { in hists__collapse_insert_entry()
1596 he->callchain) < 0) in hists__collapse_insert_entry()
1599 hist_entry__delete(he); in hists__collapse_insert_entry()
1612 rb_link_node(&he->rb_node_in, parent, p); in hists__collapse_insert_entry()
1613 rb_insert_color_cached(&he->rb_node_in, root, leftmost); in hists__collapse_insert_entry()
1632 static void hists__apply_filters(struct hists *hists, struct hist_entry *he) in hists__apply_filters() argument
1634 hists__filter_entry_by_dso(hists, he); in hists__apply_filters()
1635 hists__filter_entry_by_thread(hists, he); in hists__apply_filters()
1636 hists__filter_entry_by_symbol(hists, he); in hists__apply_filters()
1637 hists__filter_entry_by_socket(hists, he); in hists__apply_filters()
1731 struct hist_entry *he; in hierarchy_recalc_total_periods() local
1744 he = rb_entry(node, struct hist_entry, rb_node); in hierarchy_recalc_total_periods()
1747 hists->stats.total_period += he->stat.period; in hierarchy_recalc_total_periods()
1748 if (!he->filtered) in hierarchy_recalc_total_periods()
1749 hists->stats.total_non_filtered_period += he->stat.period; in hierarchy_recalc_total_periods()
1754 struct hist_entry *he) in hierarchy_insert_output_entry() argument
1766 if (hist_entry__sort(he, iter) > 0) in hierarchy_insert_output_entry()
1774 rb_link_node(&he->rb_node, parent, p); in hierarchy_insert_output_entry()
1775 rb_insert_color_cached(&he->rb_node, root, leftmost); in hierarchy_insert_output_entry()
1778 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) { in hierarchy_insert_output_entry()
1780 fmt->sort(fmt, he, NULL); in hierarchy_insert_output_entry()
1792 struct hist_entry *he; in hists__hierarchy_output_resort() local
1798 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__hierarchy_output_resort()
1801 hierarchy_insert_output_entry(root_out, he); in hists__hierarchy_output_resort()
1807 if (!he->filtered) { in hists__hierarchy_output_resort()
1809 hists__calc_col_len(hists, he); in hists__hierarchy_output_resort()
1812 if (!he->leaf) { in hists__hierarchy_output_resort()
1814 &he->hroot_in, in hists__hierarchy_output_resort()
1815 &he->hroot_out, in hists__hierarchy_output_resort()
1825 u64 total = he->stat.period; in hists__hierarchy_output_resort()
1828 total = he->stat_acc->period; in hists__hierarchy_output_resort()
1833 callchain_param.sort(&he->sorted_chain, he->callchain, in hists__hierarchy_output_resort()
1839 struct hist_entry *he, in __hists__insert_output_entry() argument
1851 u64 total = he->stat.period; in __hists__insert_output_entry()
1854 total = he->stat_acc->period; in __hists__insert_output_entry()
1858 callchain_param.sort(&he->sorted_chain, he->callchain, in __hists__insert_output_entry()
1866 if (hist_entry__sort(he, iter) > 0) in __hists__insert_output_entry()
1874 rb_link_node(&he->rb_node, parent, p); in __hists__insert_output_entry()
1875 rb_insert_color_cached(&he->rb_node, entries, leftmost); in __hists__insert_output_entry()
1879 perf_hpp__defined_dynamic_entry(fmt, he->hists)) in __hists__insert_output_entry()
1880 fmt->sort(fmt, he, NULL); /* update column width */ in __hists__insert_output_entry()
1970 static bool can_goto_child(struct hist_entry *he, enum hierarchy_move_dir hmd) in can_goto_child() argument
1972 if (he->leaf || hmd == HMD_FORCE_SIBLING) in can_goto_child()
1975 if (he->unfolded || hmd == HMD_FORCE_CHILD) in can_goto_child()
1983 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last() local
1985 while (can_goto_child(he, HMD_NORMAL)) { in rb_hierarchy_last()
1986 node = rb_last(&he->hroot_out.rb_root); in rb_hierarchy_last()
1987 he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
1994 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in __rb_hierarchy_next() local
1996 if (can_goto_child(he, hmd)) in __rb_hierarchy_next()
1997 node = rb_first_cached(&he->hroot_out); in __rb_hierarchy_next()
2002 he = he->parent_he; in __rb_hierarchy_next()
2003 if (he == NULL) in __rb_hierarchy_next()
2006 node = rb_next(&he->rb_node); in __rb_hierarchy_next()
2013 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_prev() local
2019 he = he->parent_he; in rb_hierarchy_prev()
2020 if (he == NULL) in rb_hierarchy_prev()
2023 return &he->rb_node; in rb_hierarchy_prev()
2026 bool hist_entry__has_hierarchy_children(struct hist_entry *he, float limit) in hist_entry__has_hierarchy_children() argument
2032 if (he->leaf) in hist_entry__has_hierarchy_children()
2035 node = rb_first_cached(&he->hroot_out); in hist_entry__has_hierarchy_children()
2094 struct hist_entry *he) in hists__filter_entry_by_dso() argument
2097 (he->ms.map == NULL || he->ms.map->dso != hists->dso_filter)) { in hists__filter_entry_by_dso()
2098 he->filtered |= (1 << HIST_FILTER__DSO); in hists__filter_entry_by_dso()
2106 struct hist_entry *he) in hists__filter_entry_by_thread() argument
2109 he->thread != hists->thread_filter) { in hists__filter_entry_by_thread()
2110 he->filtered |= (1 << HIST_FILTER__THREAD); in hists__filter_entry_by_thread()
2118 struct hist_entry *he) in hists__filter_entry_by_symbol() argument
2121 (!he->ms.sym || strstr(he->ms.sym->name, in hists__filter_entry_by_symbol()
2123 he->filtered |= (1 << HIST_FILTER__SYMBOL); in hists__filter_entry_by_symbol()
2131 struct hist_entry *he) in hists__filter_entry_by_socket() argument
2134 (he->socket != hists->socket_filter)) { in hists__filter_entry_by_socket()
2135 he->filtered |= (1 << HIST_FILTER__SOCKET); in hists__filter_entry_by_socket()
2142 typedef bool (*filter_fn_t)(struct hists *hists, struct hist_entry *he);
2164 struct hist_entry *he) in resort_filtered_entry() argument
2177 if (hist_entry__sort(he, iter) > 0) in resort_filtered_entry()
2185 rb_link_node(&he->rb_node, parent, p); in resort_filtered_entry()
2186 rb_insert_color_cached(&he->rb_node, root, leftmost); in resort_filtered_entry()
2188 if (he->leaf || he->filtered) in resort_filtered_entry()
2191 nd = rb_first_cached(&he->hroot_out); in resort_filtered_entry()
2196 rb_erase_cached(&h->rb_node, &he->hroot_out); in resort_filtered_entry()
2201 he->hroot_out = new_root; in resort_filtered_entry()
2340 struct hist_entry *he; in hists__add_dummy_entry() local
2353 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__add_dummy_entry()
2355 cmp = hist_entry__collapse(he, pair); in hists__add_dummy_entry()
2368 he = hist_entry__new(pair, true); in hists__add_dummy_entry()
2369 if (he) { in hists__add_dummy_entry()
2370 memset(&he->stat, 0, sizeof(he->stat)); in hists__add_dummy_entry()
2371 he->hists = hists; in hists__add_dummy_entry()
2373 memset(he->stat_acc, 0, sizeof(he->stat)); in hists__add_dummy_entry()
2374 rb_link_node(&he->rb_node_in, parent, p); in hists__add_dummy_entry()
2375 rb_insert_color_cached(&he->rb_node_in, root, leftmost); in hists__add_dummy_entry()
2376 hists__inc_stats(hists, he); in hists__add_dummy_entry()
2377 he->dummy = true; in hists__add_dummy_entry()
2380 return he; in hists__add_dummy_entry()
2389 struct hist_entry *he; in add_dummy_hierarchy_entry() local
2398 he = rb_entry(parent, struct hist_entry, rb_node_in); in add_dummy_hierarchy_entry()
2400 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) { in add_dummy_hierarchy_entry()
2401 cmp = fmt->collapse(fmt, he, pair); in add_dummy_hierarchy_entry()
2416 he = hist_entry__new(pair, true); in add_dummy_hierarchy_entry()
2417 if (he) { in add_dummy_hierarchy_entry()
2418 rb_link_node(&he->rb_node_in, parent, p); in add_dummy_hierarchy_entry()
2419 rb_insert_color_cached(&he->rb_node_in, root, leftmost); in add_dummy_hierarchy_entry()
2421 he->dummy = true; in add_dummy_hierarchy_entry()
2422 he->hists = hists; in add_dummy_hierarchy_entry()
2423 memset(&he->stat, 0, sizeof(he->stat)); in add_dummy_hierarchy_entry()
2424 hists__inc_stats(hists, he); in add_dummy_hierarchy_entry()
2427 return he; in add_dummy_hierarchy_entry()
2431 struct hist_entry *he) in hists__find_entry() argument
2442 int64_t cmp = hist_entry__collapse(iter, he); in hists__find_entry()
2456 struct hist_entry *he) in hists__find_hierarchy_entry() argument
2466 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) { in hists__find_hierarchy_entry()
2467 cmp = fmt->collapse(fmt, iter, he); in hists__find_hierarchy_entry()
2818 struct hist_entry *he; in hists__delete_remaining_entries() local
2824 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__delete_remaining_entries()
2825 hist_entry__delete(he); in hists__delete_remaining_entries()