• Home
  • Raw
  • Download

Lines Matching full:he

35 				       struct hist_entry *he);
37 struct hist_entry *he);
39 struct hist_entry *he);
41 struct hist_entry *he);
321 static void hists__delete_entry(struct hists *hists, struct hist_entry *he);
323 static bool hists__decay_entry(struct hists *hists, struct hist_entry *he) in hists__decay_entry() argument
325 u64 prev_period = he->stat.period; in hists__decay_entry()
331 he_stat__decay(&he->stat); in hists__decay_entry()
333 he_stat__decay(he->stat_acc); in hists__decay_entry()
334 decay_callchain(he->callchain); in hists__decay_entry()
336 diff = prev_period - he->stat.period; in hists__decay_entry()
338 if (!he->depth) { in hists__decay_entry()
340 if (!he->filtered) in hists__decay_entry()
344 if (!he->leaf) { in hists__decay_entry()
346 struct rb_node *node = rb_first_cached(&he->hroot_out); in hists__decay_entry()
356 return he->stat.period == 0; in hists__decay_entry()
359 static void hists__delete_entry(struct hists *hists, struct hist_entry *he) in hists__delete_entry() argument
364 if (he->parent_he) { in hists__delete_entry()
365 root_in = &he->parent_he->hroot_in; in hists__delete_entry()
366 root_out = &he->parent_he->hroot_out; in hists__delete_entry()
375 rb_erase_cached(&he->rb_node_in, root_in); in hists__delete_entry()
376 rb_erase_cached(&he->rb_node, root_out); in hists__delete_entry()
379 if (!he->filtered) in hists__delete_entry()
382 hist_entry__delete(he); in hists__delete_entry()
436 static int hist_entry__init(struct hist_entry *he, in hist_entry__init() argument
441 *he = *template; in hist_entry__init()
442 he->callchain_size = callchain_size; in hist_entry__init()
445 he->stat_acc = malloc(sizeof(he->stat)); in hist_entry__init()
446 if (he->stat_acc == NULL) in hist_entry__init()
448 memcpy(he->stat_acc, &he->stat, sizeof(he->stat)); in hist_entry__init()
450 memset(&he->stat, 0, sizeof(he->stat)); in hist_entry__init()
453 he->ms.maps = maps__get(he->ms.maps); in hist_entry__init()
454 he->ms.map = map__get(he->ms.map); in hist_entry__init()
456 if (he->branch_info) { in hist_entry__init()
462 he->branch_info = malloc(sizeof(*he->branch_info)); in hist_entry__init()
463 if (he->branch_info == NULL) in hist_entry__init()
466 memcpy(he->branch_info, template->branch_info, in hist_entry__init()
467 sizeof(*he->branch_info)); in hist_entry__init()
469 he->branch_info->from.ms.map = map__get(he->branch_info->from.ms.map); in hist_entry__init()
470 he->branch_info->to.ms.map = map__get(he->branch_info->to.ms.map); in hist_entry__init()
473 if (he->mem_info) { in hist_entry__init()
474 he->mem_info->iaddr.ms.map = map__get(he->mem_info->iaddr.ms.map); in hist_entry__init()
475 he->mem_info->daddr.ms.map = map__get(he->mem_info->daddr.ms.map); in hist_entry__init()
478 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain) in hist_entry__init()
479 callchain_init(he->callchain); in hist_entry__init()
481 if (he->raw_data) { in hist_entry__init()
482 he->raw_data = memdup(he->raw_data, he->raw_size); in hist_entry__init()
483 if (he->raw_data == NULL) in hist_entry__init()
487 if (he->srcline && he->srcline != SRCLINE_UNKNOWN) { in hist_entry__init()
488 he->srcline = strdup(he->srcline); in hist_entry__init()
489 if (he->srcline == NULL) in hist_entry__init()
494 he->res_samples = calloc(sizeof(struct res_sample), in hist_entry__init()
496 if (!he->res_samples) in hist_entry__init()
500 INIT_LIST_HEAD(&he->pairs.node); in hist_entry__init()
501 he->thread = thread__get(he->thread); in hist_entry__init()
502 he->hroot_in = RB_ROOT_CACHED; in hist_entry__init()
503 he->hroot_out = RB_ROOT_CACHED; in hist_entry__init()
506 he->leaf = true; in hist_entry__init()
511 zfree(&he->srcline); in hist_entry__init()
514 zfree(&he->raw_data); in hist_entry__init()
517 if (he->branch_info) { in hist_entry__init()
518 map__put(he->branch_info->from.ms.map); in hist_entry__init()
519 map__put(he->branch_info->to.ms.map); in hist_entry__init()
520 zfree(&he->branch_info); in hist_entry__init()
522 if (he->mem_info) { in hist_entry__init()
523 map__put(he->mem_info->iaddr.ms.map); in hist_entry__init()
524 map__put(he->mem_info->daddr.ms.map); in hist_entry__init()
527 maps__zput(he->ms.maps); 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
607 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry()
615 cmp = hist_entry__cmp(he, entry); in hists__findnew_entry()
618 he_stat__add_period(&he->stat, period); in hists__findnew_entry()
619 hist_entry__add_callchain_period(he, period); in hists__findnew_entry()
622 he_stat__add_period(he->stat_acc, period); in hists__findnew_entry()
640 if (he->ms.map != entry->ms.map) { in hists__findnew_entry()
641 map__put(he->ms.map); in hists__findnew_entry()
642 he->ms.map = map__get(entry->ms.map); in hists__findnew_entry()
655 he = hist_entry__new(entry, sample_self); in hists__findnew_entry()
656 if (!he) in hists__findnew_entry()
660 hist_entry__add_callchain_period(he, period); in hists__findnew_entry()
663 rb_link_node(&he->rb_node_in, parent, p); in hists__findnew_entry()
664 rb_insert_color_cached(&he->rb_node_in, hists->entries_in, leftmost); in hists__findnew_entry()
667 he_stat__add_cpumode_period(&he->stat, al->cpumode, period); in hists__findnew_entry()
669 he_stat__add_cpumode_period(he->stat_acc, al->cpumode, period); in hists__findnew_entry()
670 return he; in hists__findnew_entry()
683 static void hists__res_sample(struct hist_entry *he, struct perf_sample *sample) in hists__res_sample() argument
688 if (he->num_res < symbol_conf.res_sample) { in hists__res_sample()
689 j = he->num_res++; in hists__res_sample()
693 r = &he->res_samples[j]; in hists__res_sample()
752 }, *he = hists__findnew_entry(hists, &entry, al, sample_self); in __hists__add_entry() local
754 if (!hists->has_callchains && he && he->callchain_size != 0) in __hists__add_entry()
756 if (he && symbol_conf.res_sample) in __hists__add_entry()
757 hists__res_sample(he, sample); in __hists__add_entry()
758 return he; in __hists__add_entry()
800 }, *he = hists__findnew_entry(hists, &entry, al, false); in hists__add_entry_block() local
802 return he; in hists__add_entry_block()
840 struct hist_entry *he; in iter_add_single_mem_entry() local
858 he = hists__add_entry(hists, al, iter->parent, NULL, mi, NULL, in iter_add_single_mem_entry()
860 if (!he) in iter_add_single_mem_entry()
863 iter->he = he; in iter_add_single_mem_entry()
873 struct hist_entry *he = iter->he; in iter_finish_mem_entry() local
876 if (he == NULL) in iter_finish_mem_entry()
879 hists__inc_nr_samples(hists, he->filtered); in iter_finish_mem_entry()
881 err = hist_entry__append_callchain(he, iter->sample); in iter_finish_mem_entry()
891 iter->he = NULL; in iter_finish_mem_entry()
947 struct hist_entry *he = NULL; in iter_add_next_branch_entry() local
963 he = hists__add_entry(hists, al, iter->parent, &bi[i], NULL, NULL, in iter_add_next_branch_entry()
965 if (he == NULL) in iter_add_next_branch_entry()
968 hists__inc_nr_samples(hists, he->filtered); in iter_add_next_branch_entry()
971 iter->he = he; in iter_add_next_branch_entry()
981 iter->he = NULL; in iter_finish_branch_entry()
998 struct hist_entry *he; in iter_add_single_normal_entry() local
1000 he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL, in iter_add_single_normal_entry()
1002 if (he == NULL) in iter_add_single_normal_entry()
1005 iter->he = he; in iter_add_single_normal_entry()
1013 struct hist_entry *he = iter->he; in iter_finish_normal_entry() local
1017 if (he == NULL) in iter_finish_normal_entry()
1020 iter->he = NULL; in iter_finish_normal_entry()
1022 hists__inc_nr_samples(evsel__hists(evsel), he->filtered); in iter_finish_normal_entry()
1024 return hist_entry__append_callchain(he, sample); in iter_finish_normal_entry()
1062 struct hist_entry *he; in iter_add_single_cumulative_entry() local
1065 he = hists__add_entry(hists, al, iter->parent, NULL, NULL, NULL, in iter_add_single_cumulative_entry()
1067 if (he == NULL) in iter_add_single_cumulative_entry()
1070 iter->he = he; in iter_add_single_cumulative_entry()
1071 he_cache[iter->curr++] = he; in iter_add_single_cumulative_entry()
1073 hist_entry__append_callchain(he, sample); in iter_add_single_cumulative_entry()
1081 hists__inc_nr_samples(hists, he->filtered); in iter_add_single_cumulative_entry()
1120 struct hist_entry *he; in iter_add_next_cumulative_entry() local
1163 iter->he = NULL; in iter_add_next_cumulative_entry()
1168 he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL, in iter_add_next_cumulative_entry()
1170 if (he == NULL) in iter_add_next_cumulative_entry()
1173 iter->he = he; in iter_add_next_cumulative_entry()
1174 he_cache[iter->curr++] = he; in iter_add_next_cumulative_entry()
1176 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain) in iter_add_next_cumulative_entry()
1177 callchain_append(he->callchain, &cursor, sample->period); in iter_add_next_cumulative_entry()
1186 iter->he = NULL; in iter_finish_cumulative_entry()
1247 if (iter->he && iter->add_entry_cb) { in hist_entry_iter__add()
1258 if (iter->he && iter->add_entry_cb) { in hist_entry_iter__add()
1315 void hist_entry__delete(struct hist_entry *he) in hist_entry__delete() argument
1317 struct hist_entry_ops *ops = he->ops; in hist_entry__delete()
1319 thread__zput(he->thread); in hist_entry__delete()
1320 maps__zput(he->ms.maps); in hist_entry__delete()
1321 map__zput(he->ms.map); in hist_entry__delete()
1323 if (he->branch_info) { in hist_entry__delete()
1324 map__zput(he->branch_info->from.ms.map); in hist_entry__delete()
1325 map__zput(he->branch_info->to.ms.map); in hist_entry__delete()
1326 zfree_srcline(&he->branch_info->srcline_from); in hist_entry__delete()
1327 zfree_srcline(&he->branch_info->srcline_to); in hist_entry__delete()
1328 zfree(&he->branch_info); in hist_entry__delete()
1331 if (he->mem_info) { in hist_entry__delete()
1332 map__zput(he->mem_info->iaddr.ms.map); in hist_entry__delete()
1333 map__zput(he->mem_info->daddr.ms.map); in hist_entry__delete()
1334 mem_info__zput(he->mem_info); in hist_entry__delete()
1337 if (he->block_info) in hist_entry__delete()
1338 block_info__zput(he->block_info); in hist_entry__delete()
1340 if (he->kvm_info) in hist_entry__delete()
1341 kvm_info__zput(he->kvm_info); in hist_entry__delete()
1343 zfree(&he->res_samples); in hist_entry__delete()
1344 zfree(&he->stat_acc); in hist_entry__delete()
1345 zfree_srcline(&he->srcline); in hist_entry__delete()
1346 if (he->srcfile && he->srcfile[0]) in hist_entry__delete()
1347 zfree(&he->srcfile); in hist_entry__delete()
1348 free_callchain(he->callchain); in hist_entry__delete()
1349 zfree(&he->trace_output); in hist_entry__delete()
1350 zfree(&he->raw_data); in hist_entry__delete()
1351 ops->free(he); in hist_entry__delete()
1361 int hist_entry__snprintf_alignment(struct hist_entry *he, struct perf_hpp *hpp, in hist_entry__snprintf_alignment() argument
1364 if (!list_is_last(&fmt->list, &he->hists->hpp_list->fields)) { in hist_entry__snprintf_alignment()
1365 const int width = fmt->width(fmt, hpp, he->hists); in hist_entry__snprintf_alignment()
1379 static void hists__apply_filters(struct hists *hists, struct hist_entry *he);
1380 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *he,
1390 static void hist_entry__check_and_remove_filter(struct hist_entry *he, in hist_entry__check_and_remove_filter() argument
1396 struct hist_entry *parent = he->parent_he; in hist_entry__check_and_remove_filter()
1423 perf_hpp_list__for_each_format(he->hpp_list, fmt) { in hist_entry__check_and_remove_filter()
1437 if (!(he->filtered & (1 << type))) { in hist_entry__check_and_remove_filter()
1454 he->filtered |= (1 << type); in hist_entry__check_and_remove_filter()
1456 he->filtered |= (parent->filtered & (1 << type)); in hist_entry__check_and_remove_filter()
1460 static void hist_entry__apply_hierarchy_filters(struct hist_entry *he) in hist_entry__apply_hierarchy_filters() argument
1462 hist_entry__check_and_remove_filter(he, HIST_FILTER__THREAD, in hist_entry__apply_hierarchy_filters()
1465 hist_entry__check_and_remove_filter(he, HIST_FILTER__DSO, in hist_entry__apply_hierarchy_filters()
1468 hist_entry__check_and_remove_filter(he, HIST_FILTER__SYMBOL, in hist_entry__apply_hierarchy_filters()
1471 hists__apply_filters(he->hists, he); in hist_entry__apply_hierarchy_filters()
1476 struct hist_entry *he, in hierarchy_insert_entry() argument
1493 cmp = fmt->collapse(fmt, iter, he); in hierarchy_insert_entry()
1499 he_stat__add_stat(&iter->stat, &he->stat); in hierarchy_insert_entry()
1511 new = hist_entry__new(he, true); in hierarchy_insert_entry()
1526 he->trace_output = NULL; in hierarchy_insert_entry()
1531 he->srcline = NULL; in hierarchy_insert_entry()
1536 he->srcfile = NULL; in hierarchy_insert_entry()
1548 struct hist_entry *he) in hists__hierarchy_insert_entry() argument
1561 /* insert copy of 'he' for each fmt into the hierarchy */ in hists__hierarchy_insert_entry()
1562 new_he = hierarchy_insert_entry(hists, root, he, parent, &node->hpp); in hists__hierarchy_insert_entry()
1586 he->callchain) < 0) in hists__hierarchy_insert_entry()
1591 /* 'he' is no longer used */ in hists__hierarchy_insert_entry()
1592 hist_entry__delete(he); in hists__hierarchy_insert_entry()
1600 struct hist_entry *he) in hists__collapse_insert_entry() argument
1609 return hists__hierarchy_insert_entry(hists, root, he); in hists__collapse_insert_entry()
1615 cmp = hist_entry__collapse(iter, he); in hists__collapse_insert_entry()
1620 he_stat__add_stat(&iter->stat, &he->stat); in hists__collapse_insert_entry()
1622 he_stat__add_stat(iter->stat_acc, he->stat_acc); in hists__collapse_insert_entry()
1624 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain) { in hists__collapse_insert_entry()
1629 if (callchain_merge(cursor, iter->callchain, he->callchain) < 0) in hists__collapse_insert_entry()
1635 hist_entry__delete(he); in hists__collapse_insert_entry()
1648 rb_link_node(&he->rb_node_in, parent, p); in hists__collapse_insert_entry()
1649 rb_insert_color_cached(&he->rb_node_in, root, leftmost); in hists__collapse_insert_entry()
1668 static void hists__apply_filters(struct hists *hists, struct hist_entry *he) in hists__apply_filters() argument
1670 hists__filter_entry_by_dso(hists, he); in hists__apply_filters()
1671 hists__filter_entry_by_thread(hists, he); in hists__apply_filters()
1672 hists__filter_entry_by_symbol(hists, he); in hists__apply_filters()
1673 hists__filter_entry_by_socket(hists, he); in hists__apply_filters()
1767 struct hist_entry *he; in hierarchy_recalc_total_periods() local
1780 he = rb_entry(node, struct hist_entry, rb_node); in hierarchy_recalc_total_periods()
1783 hists->stats.total_period += he->stat.period; in hierarchy_recalc_total_periods()
1784 if (!he->filtered) in hierarchy_recalc_total_periods()
1785 hists->stats.total_non_filtered_period += he->stat.period; in hierarchy_recalc_total_periods()
1790 struct hist_entry *he) in hierarchy_insert_output_entry() argument
1802 if (hist_entry__sort(he, iter) > 0) in hierarchy_insert_output_entry()
1810 rb_link_node(&he->rb_node, parent, p); in hierarchy_insert_output_entry()
1811 rb_insert_color_cached(&he->rb_node, root, leftmost); in hierarchy_insert_output_entry()
1814 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) { in hierarchy_insert_output_entry()
1816 fmt->init(fmt, he); in hierarchy_insert_output_entry()
1828 struct hist_entry *he; in hists__hierarchy_output_resort() local
1834 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__hierarchy_output_resort()
1837 hierarchy_insert_output_entry(root_out, he); in hists__hierarchy_output_resort()
1843 if (!he->filtered) { in hists__hierarchy_output_resort()
1845 hists__calc_col_len(hists, he); in hists__hierarchy_output_resort()
1848 if (!he->leaf) { in hists__hierarchy_output_resort()
1850 &he->hroot_in, in hists__hierarchy_output_resort()
1851 &he->hroot_out, in hists__hierarchy_output_resort()
1861 u64 total = he->stat.period; in hists__hierarchy_output_resort()
1864 total = he->stat_acc->period; in hists__hierarchy_output_resort()
1869 callchain_param.sort(&he->sorted_chain, he->callchain, in hists__hierarchy_output_resort()
1875 struct hist_entry *he, in __hists__insert_output_entry() argument
1887 u64 total = he->stat.period; in __hists__insert_output_entry()
1890 total = he->stat_acc->period; in __hists__insert_output_entry()
1894 callchain_param.sort(&he->sorted_chain, he->callchain, in __hists__insert_output_entry()
1902 if (hist_entry__sort(he, iter) > 0) in __hists__insert_output_entry()
1910 rb_link_node(&he->rb_node, parent, p); in __hists__insert_output_entry()
1911 rb_insert_color_cached(&he->rb_node, entries, leftmost); in __hists__insert_output_entry()
1916 fmt->init(fmt, he); in __hists__insert_output_entry()
2006 static bool can_goto_child(struct hist_entry *he, enum hierarchy_move_dir hmd) in can_goto_child() argument
2008 if (he->leaf || hmd == HMD_FORCE_SIBLING) in can_goto_child()
2011 if (he->unfolded || hmd == HMD_FORCE_CHILD) in can_goto_child()
2019 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last() local
2021 while (can_goto_child(he, HMD_NORMAL)) { in rb_hierarchy_last()
2022 node = rb_last(&he->hroot_out.rb_root); in rb_hierarchy_last()
2023 he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
2030 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in __rb_hierarchy_next() local
2032 if (can_goto_child(he, hmd)) in __rb_hierarchy_next()
2033 node = rb_first_cached(&he->hroot_out); in __rb_hierarchy_next()
2038 he = he->parent_he; in __rb_hierarchy_next()
2039 if (he == NULL) in __rb_hierarchy_next()
2042 node = rb_next(&he->rb_node); in __rb_hierarchy_next()
2049 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_prev() local
2055 he = he->parent_he; in rb_hierarchy_prev()
2056 if (he == NULL) in rb_hierarchy_prev()
2059 return &he->rb_node; in rb_hierarchy_prev()
2062 bool hist_entry__has_hierarchy_children(struct hist_entry *he, float limit) in hist_entry__has_hierarchy_children() argument
2068 if (he->leaf) in hist_entry__has_hierarchy_children()
2071 node = rb_first_cached(&he->hroot_out); in hist_entry__has_hierarchy_children()
2130 struct hist_entry *he) in hists__filter_entry_by_dso() argument
2133 (he->ms.map == NULL || map__dso(he->ms.map) != hists->dso_filter)) { in hists__filter_entry_by_dso()
2134 he->filtered |= (1 << HIST_FILTER__DSO); in hists__filter_entry_by_dso()
2142 struct hist_entry *he) in hists__filter_entry_by_thread() argument
2145 RC_CHK_ACCESS(he->thread) != RC_CHK_ACCESS(hists->thread_filter)) { in hists__filter_entry_by_thread()
2146 he->filtered |= (1 << HIST_FILTER__THREAD); in hists__filter_entry_by_thread()
2154 struct hist_entry *he) in hists__filter_entry_by_symbol() argument
2157 (!he->ms.sym || strstr(he->ms.sym->name, in hists__filter_entry_by_symbol()
2159 he->filtered |= (1 << HIST_FILTER__SYMBOL); in hists__filter_entry_by_symbol()
2167 struct hist_entry *he) in hists__filter_entry_by_socket() argument
2170 (he->socket != hists->socket_filter)) { in hists__filter_entry_by_socket()
2171 he->filtered |= (1 << HIST_FILTER__SOCKET); in hists__filter_entry_by_socket()
2178 typedef bool (*filter_fn_t)(struct hists *hists, struct hist_entry *he);
2200 struct hist_entry *he) in resort_filtered_entry() argument
2213 if (hist_entry__sort(he, iter) > 0) in resort_filtered_entry()
2221 rb_link_node(&he->rb_node, parent, p); in resort_filtered_entry()
2222 rb_insert_color_cached(&he->rb_node, root, leftmost); in resort_filtered_entry()
2224 if (he->leaf || he->filtered) in resort_filtered_entry()
2227 nd = rb_first_cached(&he->hroot_out); in resort_filtered_entry()
2232 rb_erase_cached(&h->rb_node, &he->hroot_out); in resort_filtered_entry()
2237 he->hroot_out = new_root; in resort_filtered_entry()
2381 struct hist_entry *he; in hists__add_dummy_entry() local
2394 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__add_dummy_entry()
2396 cmp = hist_entry__collapse(he, pair); in hists__add_dummy_entry()
2409 he = hist_entry__new(pair, true); in hists__add_dummy_entry()
2410 if (he) { in hists__add_dummy_entry()
2411 memset(&he->stat, 0, sizeof(he->stat)); in hists__add_dummy_entry()
2412 he->hists = hists; in hists__add_dummy_entry()
2414 memset(he->stat_acc, 0, sizeof(he->stat)); in hists__add_dummy_entry()
2415 rb_link_node(&he->rb_node_in, parent, p); in hists__add_dummy_entry()
2416 rb_insert_color_cached(&he->rb_node_in, root, leftmost); in hists__add_dummy_entry()
2417 hists__inc_stats(hists, he); in hists__add_dummy_entry()
2418 he->dummy = true; in hists__add_dummy_entry()
2421 return he; in hists__add_dummy_entry()
2430 struct hist_entry *he; in add_dummy_hierarchy_entry() local
2439 he = rb_entry(parent, struct hist_entry, rb_node_in); in add_dummy_hierarchy_entry()
2441 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) { in add_dummy_hierarchy_entry()
2442 cmp = fmt->collapse(fmt, he, pair); in add_dummy_hierarchy_entry()
2457 he = hist_entry__new(pair, true); in add_dummy_hierarchy_entry()
2458 if (he) { in add_dummy_hierarchy_entry()
2459 rb_link_node(&he->rb_node_in, parent, p); in add_dummy_hierarchy_entry()
2460 rb_insert_color_cached(&he->rb_node_in, root, leftmost); in add_dummy_hierarchy_entry()
2462 he->dummy = true; in add_dummy_hierarchy_entry()
2463 he->hists = hists; in add_dummy_hierarchy_entry()
2464 memset(&he->stat, 0, sizeof(he->stat)); in add_dummy_hierarchy_entry()
2465 hists__inc_stats(hists, he); in add_dummy_hierarchy_entry()
2468 return he; in add_dummy_hierarchy_entry()
2472 struct hist_entry *he) in hists__find_entry() argument
2483 int64_t cmp = hist_entry__collapse(iter, he); in hists__find_entry()
2497 struct hist_entry *he) in hists__find_hierarchy_entry() argument
2507 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) { in hists__find_hierarchy_entry()
2508 cmp = fmt->collapse(fmt, iter, he); in hists__find_hierarchy_entry()
2863 struct hist_entry *he; in hists__delete_remaining_entries() local
2869 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__delete_remaining_entries()
2870 hist_entry__delete(he); in hists__delete_remaining_entries()