Lines Matching refs:he
34 struct hist_entry *he);
36 struct hist_entry *he);
38 struct hist_entry *he);
40 struct hist_entry *he);
311 static void hists__delete_entry(struct hists *hists, struct hist_entry *he);
313 static bool hists__decay_entry(struct hists *hists, struct hist_entry *he) in hists__decay_entry() argument
315 u64 prev_period = he->stat.period; in hists__decay_entry()
321 he_stat__decay(&he->stat); in hists__decay_entry()
323 he_stat__decay(he->stat_acc); in hists__decay_entry()
324 decay_callchain(he->callchain); in hists__decay_entry()
326 diff = prev_period - he->stat.period; in hists__decay_entry()
328 if (!he->depth) { in hists__decay_entry()
330 if (!he->filtered) in hists__decay_entry()
334 if (!he->leaf) { in hists__decay_entry()
336 struct rb_node *node = rb_first_cached(&he->hroot_out); in hists__decay_entry()
346 return he->stat.period == 0; in hists__decay_entry()
349 static void hists__delete_entry(struct hists *hists, struct hist_entry *he) in hists__delete_entry() argument
354 if (he->parent_he) { in hists__delete_entry()
355 root_in = &he->parent_he->hroot_in; in hists__delete_entry()
356 root_out = &he->parent_he->hroot_out; in hists__delete_entry()
365 rb_erase_cached(&he->rb_node_in, root_in); in hists__delete_entry()
366 rb_erase_cached(&he->rb_node, root_out); in hists__delete_entry()
369 if (!he->filtered) in hists__delete_entry()
372 hist_entry__delete(he); in hists__delete_entry()
426 static int hist_entry__init(struct hist_entry *he, in hist_entry__init() argument
431 *he = *template; in hist_entry__init()
432 he->callchain_size = callchain_size; in hist_entry__init()
435 he->stat_acc = malloc(sizeof(he->stat)); in hist_entry__init()
436 if (he->stat_acc == NULL) in hist_entry__init()
438 memcpy(he->stat_acc, &he->stat, sizeof(he->stat)); in hist_entry__init()
440 memset(&he->stat, 0, sizeof(he->stat)); in hist_entry__init()
443 map__get(he->ms.map); in hist_entry__init()
445 if (he->branch_info) { in hist_entry__init()
451 he->branch_info = malloc(sizeof(*he->branch_info)); in hist_entry__init()
452 if (he->branch_info == NULL) in hist_entry__init()
455 memcpy(he->branch_info, template->branch_info, in hist_entry__init()
456 sizeof(*he->branch_info)); in hist_entry__init()
458 map__get(he->branch_info->from.ms.map); in hist_entry__init()
459 map__get(he->branch_info->to.ms.map); in hist_entry__init()
462 if (he->mem_info) { in hist_entry__init()
463 map__get(he->mem_info->iaddr.ms.map); in hist_entry__init()
464 map__get(he->mem_info->daddr.ms.map); in hist_entry__init()
467 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain) in hist_entry__init()
468 callchain_init(he->callchain); in hist_entry__init()
470 if (he->raw_data) { in hist_entry__init()
471 he->raw_data = memdup(he->raw_data, he->raw_size); in hist_entry__init()
472 if (he->raw_data == NULL) in hist_entry__init()
476 if (he->srcline) { in hist_entry__init()
477 he->srcline = strdup(he->srcline); in hist_entry__init()
478 if (he->srcline == NULL) in hist_entry__init()
483 he->res_samples = calloc(sizeof(struct res_sample), in hist_entry__init()
485 if (!he->res_samples) in hist_entry__init()
489 INIT_LIST_HEAD(&he->pairs.node); in hist_entry__init()
490 thread__get(he->thread); in hist_entry__init()
491 he->hroot_in = RB_ROOT_CACHED; in hist_entry__init()
492 he->hroot_out = RB_ROOT_CACHED; in hist_entry__init()
495 he->leaf = true; in hist_entry__init()
500 zfree(&he->srcline); in hist_entry__init()
503 zfree(&he->raw_data); in hist_entry__init()
506 if (he->branch_info) { in hist_entry__init()
507 map__put(he->branch_info->from.ms.map); in hist_entry__init()
508 map__put(he->branch_info->to.ms.map); in hist_entry__init()
509 zfree(&he->branch_info); in hist_entry__init()
511 if (he->mem_info) { in hist_entry__init()
512 map__put(he->mem_info->iaddr.ms.map); in hist_entry__init()
513 map__put(he->mem_info->daddr.ms.map); in hist_entry__init()
516 map__zput(he->ms.map); in hist_entry__init()
517 zfree(&he->stat_acc); in hist_entry__init()
541 struct hist_entry *he; in hist_entry__new() local
550 he = ops->new(callchain_size); in hist_entry__new()
551 if (he) { in hist_entry__new()
552 err = hist_entry__init(he, template, sample_self, callchain_size); in hist_entry__new()
554 ops->free(he); in hist_entry__new()
555 he = NULL; in hist_entry__new()
559 return he; in hist_entry__new()
569 static void hist_entry__add_callchain_period(struct hist_entry *he, u64 period) in hist_entry__add_callchain_period() argument
571 if (!hist_entry__has_callchains(he) || !symbol_conf.use_callchain) in hist_entry__add_callchain_period()
574 he->hists->callchain_period += period; in hist_entry__add_callchain_period()
575 if (!he->filtered) in hist_entry__add_callchain_period()
576 he->hists->callchain_non_filtered_period += period; in hist_entry__add_callchain_period()
586 struct hist_entry *he; in hists__findnew_entry() local
596 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry()
604 cmp = hist_entry__cmp(he, entry); in hists__findnew_entry()
608 he_stat__add_period(&he->stat, period, weight); in hists__findnew_entry()
609 hist_entry__add_callchain_period(he, period); in hists__findnew_entry()
612 he_stat__add_period(he->stat_acc, period, weight); in hists__findnew_entry()
628 if (he->ms.map != entry->ms.map) { in hists__findnew_entry()
629 map__put(he->ms.map); in hists__findnew_entry()
630 he->ms.map = map__get(entry->ms.map); in hists__findnew_entry()
643 he = hist_entry__new(entry, sample_self); in hists__findnew_entry()
644 if (!he) in hists__findnew_entry()
648 hist_entry__add_callchain_period(he, period); in hists__findnew_entry()
651 rb_link_node(&he->rb_node_in, parent, p); in hists__findnew_entry()
652 rb_insert_color_cached(&he->rb_node_in, hists->entries_in, leftmost); in hists__findnew_entry()
655 he_stat__add_cpumode_period(&he->stat, al->cpumode, period); in hists__findnew_entry()
657 he_stat__add_cpumode_period(he->stat_acc, al->cpumode, period); in hists__findnew_entry()
658 return he; in hists__findnew_entry()
671 static void hists__res_sample(struct hist_entry *he, struct perf_sample *sample) in hists__res_sample() argument
676 if (he->num_res < symbol_conf.res_sample) { in hists__res_sample()
677 j = he->num_res++; in hists__res_sample()
681 r = &he->res_samples[j]; in hists__res_sample()
734 }, *he = hists__findnew_entry(hists, &entry, al, sample_self); in __hists__add_entry() local
736 if (!hists->has_callchains && he && he->callchain_size != 0) in __hists__add_entry()
738 if (he && symbol_conf.res_sample) in __hists__add_entry()
739 hists__res_sample(he, sample); in __hists__add_entry()
740 return he; in __hists__add_entry()
780 }, *he = hists__findnew_entry(hists, &entry, al, false); in hists__add_entry_block() local
782 return he; in hists__add_entry_block()
820 struct hist_entry *he; in iter_add_single_mem_entry() local
838 he = hists__add_entry(hists, al, iter->parent, NULL, mi, in iter_add_single_mem_entry()
840 if (!he) in iter_add_single_mem_entry()
843 iter->he = he; in iter_add_single_mem_entry()
853 struct hist_entry *he = iter->he; in iter_finish_mem_entry() local
856 if (he == NULL) in iter_finish_mem_entry()
859 hists__inc_nr_samples(hists, he->filtered); in iter_finish_mem_entry()
861 err = hist_entry__append_callchain(he, iter->sample); in iter_finish_mem_entry()
871 iter->he = NULL; in iter_finish_mem_entry()
925 struct hist_entry *he = NULL; in iter_add_next_branch_entry() local
941 he = hists__add_entry(hists, al, iter->parent, &bi[i], NULL, in iter_add_next_branch_entry()
943 if (he == NULL) in iter_add_next_branch_entry()
946 hists__inc_nr_samples(hists, he->filtered); in iter_add_next_branch_entry()
949 iter->he = he; in iter_add_next_branch_entry()
959 iter->he = NULL; in iter_finish_branch_entry()
976 struct hist_entry *he; in iter_add_single_normal_entry() local
978 he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL, in iter_add_single_normal_entry()
980 if (he == NULL) in iter_add_single_normal_entry()
983 iter->he = he; in iter_add_single_normal_entry()
991 struct hist_entry *he = iter->he; in iter_finish_normal_entry() local
995 if (he == NULL) in iter_finish_normal_entry()
998 iter->he = NULL; in iter_finish_normal_entry()
1000 hists__inc_nr_samples(evsel__hists(evsel), he->filtered); in iter_finish_normal_entry()
1002 return hist_entry__append_callchain(he, sample); in iter_finish_normal_entry()
1036 struct hist_entry *he; in iter_add_single_cumulative_entry() local
1039 he = hists__add_entry(hists, al, iter->parent, NULL, NULL, in iter_add_single_cumulative_entry()
1041 if (he == NULL) in iter_add_single_cumulative_entry()
1044 iter->he = he; in iter_add_single_cumulative_entry()
1045 he_cache[iter->curr++] = he; in iter_add_single_cumulative_entry()
1047 hist_entry__append_callchain(he, sample); in iter_add_single_cumulative_entry()
1055 hists__inc_nr_samples(hists, he->filtered); in iter_add_single_cumulative_entry()
1094 struct hist_entry *he; in iter_add_next_cumulative_entry() local
1134 iter->he = NULL; in iter_add_next_cumulative_entry()
1139 he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL, in iter_add_next_cumulative_entry()
1141 if (he == NULL) in iter_add_next_cumulative_entry()
1144 iter->he = he; in iter_add_next_cumulative_entry()
1145 he_cache[iter->curr++] = he; in iter_add_next_cumulative_entry()
1147 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain) in iter_add_next_cumulative_entry()
1148 callchain_append(he->callchain, &cursor, sample->period); in iter_add_next_cumulative_entry()
1157 iter->he = NULL; in iter_finish_cumulative_entry()
1218 if (iter->he && iter->add_entry_cb) { in hist_entry_iter__add()
1229 if (iter->he && iter->add_entry_cb) { in hist_entry_iter__add()
1286 void hist_entry__delete(struct hist_entry *he) in hist_entry__delete() argument
1288 struct hist_entry_ops *ops = he->ops; in hist_entry__delete()
1290 thread__zput(he->thread); in hist_entry__delete()
1291 map__zput(he->ms.map); in hist_entry__delete()
1293 if (he->branch_info) { in hist_entry__delete()
1294 map__zput(he->branch_info->from.ms.map); in hist_entry__delete()
1295 map__zput(he->branch_info->to.ms.map); in hist_entry__delete()
1296 free_srcline(he->branch_info->srcline_from); in hist_entry__delete()
1297 free_srcline(he->branch_info->srcline_to); in hist_entry__delete()
1298 zfree(&he->branch_info); in hist_entry__delete()
1301 if (he->mem_info) { in hist_entry__delete()
1302 map__zput(he->mem_info->iaddr.ms.map); in hist_entry__delete()
1303 map__zput(he->mem_info->daddr.ms.map); in hist_entry__delete()
1304 mem_info__zput(he->mem_info); in hist_entry__delete()
1307 if (he->block_info) in hist_entry__delete()
1308 block_info__zput(he->block_info); in hist_entry__delete()
1310 zfree(&he->res_samples); in hist_entry__delete()
1311 zfree(&he->stat_acc); in hist_entry__delete()
1312 free_srcline(he->srcline); in hist_entry__delete()
1313 if (he->srcfile && he->srcfile[0]) in hist_entry__delete()
1314 zfree(&he->srcfile); in hist_entry__delete()
1315 free_callchain(he->callchain); in hist_entry__delete()
1316 zfree(&he->trace_output); in hist_entry__delete()
1317 zfree(&he->raw_data); in hist_entry__delete()
1318 ops->free(he); in hist_entry__delete()
1328 int hist_entry__snprintf_alignment(struct hist_entry *he, struct perf_hpp *hpp, in hist_entry__snprintf_alignment() argument
1331 if (!list_is_last(&fmt->list, &he->hists->hpp_list->fields)) { in hist_entry__snprintf_alignment()
1332 const int width = fmt->width(fmt, hpp, he->hists); in hist_entry__snprintf_alignment()
1346 static void hists__apply_filters(struct hists *hists, struct hist_entry *he);
1347 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *he,
1357 static void hist_entry__check_and_remove_filter(struct hist_entry *he, in hist_entry__check_and_remove_filter() argument
1363 struct hist_entry *parent = he->parent_he; in hist_entry__check_and_remove_filter()
1390 perf_hpp_list__for_each_format(he->hpp_list, fmt) { in hist_entry__check_and_remove_filter()
1404 if (!(he->filtered & (1 << type))) { in hist_entry__check_and_remove_filter()
1421 he->filtered |= (1 << type); in hist_entry__check_and_remove_filter()
1423 he->filtered |= (parent->filtered & (1 << type)); in hist_entry__check_and_remove_filter()
1427 static void hist_entry__apply_hierarchy_filters(struct hist_entry *he) in hist_entry__apply_hierarchy_filters() argument
1429 hist_entry__check_and_remove_filter(he, HIST_FILTER__THREAD, in hist_entry__apply_hierarchy_filters()
1432 hist_entry__check_and_remove_filter(he, HIST_FILTER__DSO, in hist_entry__apply_hierarchy_filters()
1435 hist_entry__check_and_remove_filter(he, HIST_FILTER__SYMBOL, in hist_entry__apply_hierarchy_filters()
1438 hists__apply_filters(he->hists, he); in hist_entry__apply_hierarchy_filters()
1443 struct hist_entry *he, in hierarchy_insert_entry() argument
1460 cmp = fmt->collapse(fmt, iter, he); in hierarchy_insert_entry()
1466 he_stat__add_stat(&iter->stat, &he->stat); in hierarchy_insert_entry()
1478 new = hist_entry__new(he, true); in hierarchy_insert_entry()
1493 he->trace_output = NULL; in hierarchy_insert_entry()
1498 he->srcline = NULL; in hierarchy_insert_entry()
1503 he->srcfile = NULL; in hierarchy_insert_entry()
1515 struct hist_entry *he) in hists__hierarchy_insert_entry() argument
1529 new_he = hierarchy_insert_entry(hists, root, he, parent, &node->hpp); in hists__hierarchy_insert_entry()
1548 he->callchain) < 0) in hists__hierarchy_insert_entry()
1554 hist_entry__delete(he); in hists__hierarchy_insert_entry()
1562 struct hist_entry *he) in hists__collapse_insert_entry() argument
1571 return hists__hierarchy_insert_entry(hists, root, he); in hists__collapse_insert_entry()
1577 cmp = hist_entry__collapse(iter, he); in hists__collapse_insert_entry()
1582 he_stat__add_stat(&iter->stat, &he->stat); in hists__collapse_insert_entry()
1584 he_stat__add_stat(iter->stat_acc, he->stat_acc); in hists__collapse_insert_entry()
1586 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain) { in hists__collapse_insert_entry()
1590 he->callchain) < 0) in hists__collapse_insert_entry()
1593 hist_entry__delete(he); in hists__collapse_insert_entry()
1606 rb_link_node(&he->rb_node_in, parent, p); in hists__collapse_insert_entry()
1607 rb_insert_color_cached(&he->rb_node_in, root, leftmost); in hists__collapse_insert_entry()
1626 static void hists__apply_filters(struct hists *hists, struct hist_entry *he) in hists__apply_filters() argument
1628 hists__filter_entry_by_dso(hists, he); in hists__apply_filters()
1629 hists__filter_entry_by_thread(hists, he); in hists__apply_filters()
1630 hists__filter_entry_by_symbol(hists, he); in hists__apply_filters()
1631 hists__filter_entry_by_socket(hists, he); in hists__apply_filters()
1725 struct hist_entry *he; in hierarchy_recalc_total_periods() local
1738 he = rb_entry(node, struct hist_entry, rb_node); in hierarchy_recalc_total_periods()
1741 hists->stats.total_period += he->stat.period; in hierarchy_recalc_total_periods()
1742 if (!he->filtered) in hierarchy_recalc_total_periods()
1743 hists->stats.total_non_filtered_period += he->stat.period; in hierarchy_recalc_total_periods()
1748 struct hist_entry *he) in hierarchy_insert_output_entry() argument
1760 if (hist_entry__sort(he, iter) > 0) in hierarchy_insert_output_entry()
1768 rb_link_node(&he->rb_node, parent, p); in hierarchy_insert_output_entry()
1769 rb_insert_color_cached(&he->rb_node, root, leftmost); in hierarchy_insert_output_entry()
1772 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) { in hierarchy_insert_output_entry()
1774 fmt->sort(fmt, he, NULL); in hierarchy_insert_output_entry()
1786 struct hist_entry *he; in hists__hierarchy_output_resort() local
1792 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__hierarchy_output_resort()
1795 hierarchy_insert_output_entry(root_out, he); in hists__hierarchy_output_resort()
1801 if (!he->filtered) { in hists__hierarchy_output_resort()
1803 hists__calc_col_len(hists, he); in hists__hierarchy_output_resort()
1806 if (!he->leaf) { in hists__hierarchy_output_resort()
1808 &he->hroot_in, in hists__hierarchy_output_resort()
1809 &he->hroot_out, in hists__hierarchy_output_resort()
1819 u64 total = he->stat.period; in hists__hierarchy_output_resort()
1822 total = he->stat_acc->period; in hists__hierarchy_output_resort()
1827 callchain_param.sort(&he->sorted_chain, he->callchain, in hists__hierarchy_output_resort()
1833 struct hist_entry *he, in __hists__insert_output_entry() argument
1845 u64 total = he->stat.period; in __hists__insert_output_entry()
1848 total = he->stat_acc->period; in __hists__insert_output_entry()
1852 callchain_param.sort(&he->sorted_chain, he->callchain, in __hists__insert_output_entry()
1860 if (hist_entry__sort(he, iter) > 0) in __hists__insert_output_entry()
1868 rb_link_node(&he->rb_node, parent, p); in __hists__insert_output_entry()
1869 rb_insert_color_cached(&he->rb_node, entries, leftmost); in __hists__insert_output_entry()
1873 perf_hpp__defined_dynamic_entry(fmt, he->hists)) in __hists__insert_output_entry()
1874 fmt->sort(fmt, he, NULL); /* update column width */ in __hists__insert_output_entry()
1964 static bool can_goto_child(struct hist_entry *he, enum hierarchy_move_dir hmd) in can_goto_child() argument
1966 if (he->leaf || hmd == HMD_FORCE_SIBLING) in can_goto_child()
1969 if (he->unfolded || hmd == HMD_FORCE_CHILD) in can_goto_child()
1977 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last() local
1979 while (can_goto_child(he, HMD_NORMAL)) { in rb_hierarchy_last()
1980 node = rb_last(&he->hroot_out.rb_root); in rb_hierarchy_last()
1981 he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
1988 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in __rb_hierarchy_next() local
1990 if (can_goto_child(he, hmd)) in __rb_hierarchy_next()
1991 node = rb_first_cached(&he->hroot_out); in __rb_hierarchy_next()
1996 he = he->parent_he; in __rb_hierarchy_next()
1997 if (he == NULL) in __rb_hierarchy_next()
2000 node = rb_next(&he->rb_node); in __rb_hierarchy_next()
2007 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_prev() local
2013 he = he->parent_he; in rb_hierarchy_prev()
2014 if (he == NULL) in rb_hierarchy_prev()
2017 return &he->rb_node; in rb_hierarchy_prev()
2020 bool hist_entry__has_hierarchy_children(struct hist_entry *he, float limit) in hist_entry__has_hierarchy_children() argument
2026 if (he->leaf) in hist_entry__has_hierarchy_children()
2029 node = rb_first_cached(&he->hroot_out); in hist_entry__has_hierarchy_children()
2088 struct hist_entry *he) in hists__filter_entry_by_dso() argument
2091 (he->ms.map == NULL || he->ms.map->dso != hists->dso_filter)) { in hists__filter_entry_by_dso()
2092 he->filtered |= (1 << HIST_FILTER__DSO); in hists__filter_entry_by_dso()
2100 struct hist_entry *he) in hists__filter_entry_by_thread() argument
2103 he->thread != hists->thread_filter) { in hists__filter_entry_by_thread()
2104 he->filtered |= (1 << HIST_FILTER__THREAD); in hists__filter_entry_by_thread()
2112 struct hist_entry *he) in hists__filter_entry_by_symbol() argument
2115 (!he->ms.sym || strstr(he->ms.sym->name, in hists__filter_entry_by_symbol()
2117 he->filtered |= (1 << HIST_FILTER__SYMBOL); in hists__filter_entry_by_symbol()
2125 struct hist_entry *he) in hists__filter_entry_by_socket() argument
2128 (he->socket != hists->socket_filter)) { in hists__filter_entry_by_socket()
2129 he->filtered |= (1 << HIST_FILTER__SOCKET); in hists__filter_entry_by_socket()
2136 typedef bool (*filter_fn_t)(struct hists *hists, struct hist_entry *he);
2158 struct hist_entry *he) in resort_filtered_entry() argument
2171 if (hist_entry__sort(he, iter) > 0) in resort_filtered_entry()
2179 rb_link_node(&he->rb_node, parent, p); in resort_filtered_entry()
2180 rb_insert_color_cached(&he->rb_node, root, leftmost); in resort_filtered_entry()
2182 if (he->leaf || he->filtered) in resort_filtered_entry()
2185 nd = rb_first_cached(&he->hroot_out); in resort_filtered_entry()
2190 rb_erase_cached(&h->rb_node, &he->hroot_out); in resort_filtered_entry()
2195 he->hroot_out = new_root; in resort_filtered_entry()
2329 struct hist_entry *he; in hists__add_dummy_entry() local
2342 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__add_dummy_entry()
2344 cmp = hist_entry__collapse(he, pair); in hists__add_dummy_entry()
2357 he = hist_entry__new(pair, true); in hists__add_dummy_entry()
2358 if (he) { in hists__add_dummy_entry()
2359 memset(&he->stat, 0, sizeof(he->stat)); in hists__add_dummy_entry()
2360 he->hists = hists; in hists__add_dummy_entry()
2362 memset(he->stat_acc, 0, sizeof(he->stat)); in hists__add_dummy_entry()
2363 rb_link_node(&he->rb_node_in, parent, p); in hists__add_dummy_entry()
2364 rb_insert_color_cached(&he->rb_node_in, root, leftmost); in hists__add_dummy_entry()
2365 hists__inc_stats(hists, he); in hists__add_dummy_entry()
2366 he->dummy = true; in hists__add_dummy_entry()
2369 return he; in hists__add_dummy_entry()
2378 struct hist_entry *he; in add_dummy_hierarchy_entry() local
2387 he = rb_entry(parent, struct hist_entry, rb_node_in); in add_dummy_hierarchy_entry()
2389 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) { in add_dummy_hierarchy_entry()
2390 cmp = fmt->collapse(fmt, he, pair); in add_dummy_hierarchy_entry()
2405 he = hist_entry__new(pair, true); in add_dummy_hierarchy_entry()
2406 if (he) { in add_dummy_hierarchy_entry()
2407 rb_link_node(&he->rb_node_in, parent, p); in add_dummy_hierarchy_entry()
2408 rb_insert_color_cached(&he->rb_node_in, root, leftmost); in add_dummy_hierarchy_entry()
2410 he->dummy = true; in add_dummy_hierarchy_entry()
2411 he->hists = hists; in add_dummy_hierarchy_entry()
2412 memset(&he->stat, 0, sizeof(he->stat)); in add_dummy_hierarchy_entry()
2413 hists__inc_stats(hists, he); in add_dummy_hierarchy_entry()
2416 return he; in add_dummy_hierarchy_entry()
2420 struct hist_entry *he) in hists__find_entry() argument
2431 int64_t cmp = hist_entry__collapse(iter, he); in hists__find_entry()
2445 struct hist_entry *he) in hists__find_hierarchy_entry() argument
2455 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) { in hists__find_hierarchy_entry()
2456 cmp = fmt->collapse(fmt, iter, he); in hists__find_hierarchy_entry()
2796 struct hist_entry *he; in hists__delete_remaining_entries() local
2802 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__delete_remaining_entries()
2803 hist_entry__delete(he); in hists__delete_remaining_entries()