Lines Matching full:he
39 struct hist_entry *he);
41 struct hist_entry *he);
43 struct hist_entry *he);
45 struct hist_entry *he);
333 static void hists__delete_entry(struct hists *hists, struct hist_entry *he);
335 static bool hists__decay_entry(struct hists *hists, struct hist_entry *he) in hists__decay_entry() argument
337 u64 prev_period = he->stat.period; in hists__decay_entry()
343 he_stat__decay(&he->stat); in hists__decay_entry()
345 he_stat__decay(he->stat_acc); in hists__decay_entry()
346 decay_callchain(he->callchain); in hists__decay_entry()
348 diff = prev_period - he->stat.period; in hists__decay_entry()
350 if (!he->depth) { in hists__decay_entry()
352 if (!he->filtered) in hists__decay_entry()
356 if (!he->leaf) { in hists__decay_entry()
358 struct rb_node *node = rb_first_cached(&he->hroot_out); in hists__decay_entry()
368 return he->stat.period == 0; in hists__decay_entry()
371 static void hists__delete_entry(struct hists *hists, struct hist_entry *he) in hists__delete_entry() argument
376 if (he->parent_he) { in hists__delete_entry()
377 root_in = &he->parent_he->hroot_in; in hists__delete_entry()
378 root_out = &he->parent_he->hroot_out; in hists__delete_entry()
387 rb_erase_cached(&he->rb_node_in, root_in); in hists__delete_entry()
388 rb_erase_cached(&he->rb_node, root_out); in hists__delete_entry()
391 if (!he->filtered) in hists__delete_entry()
394 hist_entry__delete(he); in hists__delete_entry()
448 static int hist_entry__init(struct hist_entry *he, in hist_entry__init() argument
453 *he = *template; in hist_entry__init()
454 he->callchain_size = callchain_size; in hist_entry__init()
457 he->stat_acc = malloc(sizeof(he->stat)); in hist_entry__init()
458 if (he->stat_acc == NULL) in hist_entry__init()
460 memcpy(he->stat_acc, &he->stat, sizeof(he->stat)); in hist_entry__init()
462 memset(&he->stat, 0, sizeof(he->stat)); in hist_entry__init()
465 he->ms.maps = maps__get(he->ms.maps); in hist_entry__init()
466 he->ms.map = map__get(he->ms.map); in hist_entry__init()
468 if (he->branch_info) { in hist_entry__init()
474 he->branch_info = malloc(sizeof(*he->branch_info)); in hist_entry__init()
475 if (he->branch_info == NULL) in hist_entry__init()
478 memcpy(he->branch_info, template->branch_info, in hist_entry__init()
479 sizeof(*he->branch_info)); in hist_entry__init()
481 he->branch_info->from.ms.maps = maps__get(he->branch_info->from.ms.maps); in hist_entry__init()
482 he->branch_info->from.ms.map = map__get(he->branch_info->from.ms.map); in hist_entry__init()
483 he->branch_info->to.ms.maps = maps__get(he->branch_info->to.ms.maps); in hist_entry__init()
484 he->branch_info->to.ms.map = map__get(he->branch_info->to.ms.map); in hist_entry__init()
487 if (he->mem_info) { in hist_entry__init()
488 he->mem_info = mem_info__clone(template->mem_info); in hist_entry__init()
489 if (he->mem_info == NULL) in hist_entry__init()
493 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain) in hist_entry__init()
494 callchain_init(he->callchain); in hist_entry__init()
496 if (he->raw_data) { in hist_entry__init()
497 he->raw_data = memdup(he->raw_data, he->raw_size); in hist_entry__init()
498 if (he->raw_data == NULL) in hist_entry__init()
502 if (he->srcline && he->srcline != SRCLINE_UNKNOWN) { in hist_entry__init()
503 he->srcline = strdup(he->srcline); in hist_entry__init()
504 if (he->srcline == NULL) in hist_entry__init()
509 he->res_samples = calloc(symbol_conf.res_sample, in hist_entry__init()
511 if (!he->res_samples) in hist_entry__init()
515 INIT_LIST_HEAD(&he->pairs.node); in hist_entry__init()
516 he->thread = thread__get(he->thread); in hist_entry__init()
517 he->hroot_in = RB_ROOT_CACHED; in hist_entry__init()
518 he->hroot_out = RB_ROOT_CACHED; in hist_entry__init()
521 he->leaf = true; in hist_entry__init()
526 zfree(&he->srcline); in hist_entry__init()
529 zfree(&he->raw_data); in hist_entry__init()
532 if (he->branch_info) { in hist_entry__init()
533 map_symbol__exit(&he->branch_info->from.ms); in hist_entry__init()
534 map_symbol__exit(&he->branch_info->to.ms); in hist_entry__init()
535 zfree(&he->branch_info); in hist_entry__init()
537 if (he->mem_info) { in hist_entry__init()
538 map_symbol__exit(&mem_info__iaddr(he->mem_info)->ms); in hist_entry__init()
539 map_symbol__exit(&mem_info__daddr(he->mem_info)->ms); in hist_entry__init()
542 map_symbol__exit(&he->ms); in hist_entry__init()
543 zfree(&he->stat_acc); in hist_entry__init()
567 struct hist_entry *he; in hist_entry__new() local
576 he = ops->new(callchain_size); in hist_entry__new()
577 if (he) { in hist_entry__new()
578 err = hist_entry__init(he, template, sample_self, callchain_size); in hist_entry__new()
580 ops->free(he); in hist_entry__new()
581 he = NULL; in hist_entry__new()
584 return he; in hist_entry__new()
594 static void hist_entry__add_callchain_period(struct hist_entry *he, u64 period) in hist_entry__add_callchain_period() argument
596 if (!hist_entry__has_callchains(he) || !symbol_conf.use_callchain) in hist_entry__add_callchain_period()
599 he->hists->callchain_period += period; in hist_entry__add_callchain_period()
600 if (!he->filtered) in hist_entry__add_callchain_period()
601 he->hists->callchain_non_filtered_period += period; in hist_entry__add_callchain_period()
611 struct hist_entry *he; in hists__findnew_entry() local
620 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry()
628 cmp = hist_entry__cmp(he, entry); in hists__findnew_entry()
631 he_stat__add_stat(&he->stat, &entry->stat); in hists__findnew_entry()
632 hist_entry__add_callchain_period(he, period); in hists__findnew_entry()
635 he_stat__add_period(he->stat_acc, period); in hists__findnew_entry()
647 if (hists__has(hists, sym) && he->ms.map != entry->ms.map) { in hists__findnew_entry()
648 if (he->ms.sym) { in hists__findnew_entry()
649 u64 addr = he->ms.sym->start; in hists__findnew_entry()
650 he->ms.sym = map__find_symbol(entry->ms.map, addr); in hists__findnew_entry()
653 map__put(he->ms.map); in hists__findnew_entry()
654 he->ms.map = map__get(entry->ms.map); in hists__findnew_entry()
667 he = hist_entry__new(entry, sample_self); in hists__findnew_entry()
668 if (!he) in hists__findnew_entry()
672 hist_entry__add_callchain_period(he, period); in hists__findnew_entry()
675 rb_link_node(&he->rb_node_in, parent, p); in hists__findnew_entry()
676 rb_insert_color_cached(&he->rb_node_in, hists->entries_in, leftmost); in hists__findnew_entry()
679 he_stat__add_cpumode_period(&he->stat, al->cpumode, period); in hists__findnew_entry()
681 he_stat__add_cpumode_period(he->stat_acc, al->cpumode, period); in hists__findnew_entry()
682 return he; in hists__findnew_entry()
695 static void hists__res_sample(struct hist_entry *he, struct perf_sample *sample) in hists__res_sample() argument
700 if (he->num_res < symbol_conf.res_sample) { in hists__res_sample()
701 j = he->num_res++; in hists__res_sample()
705 r = &he->res_samples[j]; in hists__res_sample()
767 }, *he = hists__findnew_entry(hists, &entry, al, sample_self); in __hists__add_entry() local
769 if (!hists->has_callchains && he && he->callchain_size != 0) in __hists__add_entry()
771 if (he && symbol_conf.res_sample) in __hists__add_entry()
772 hists__res_sample(he, sample); in __hists__add_entry()
773 return he; in __hists__add_entry()
815 }, *he = hists__findnew_entry(hists, &entry, al, false); in hists__add_entry_block() local
817 return he; in hists__add_entry_block()
855 struct hist_entry *he; in iter_add_single_mem_entry() local
873 he = hists__add_entry(hists, al, iter->parent, NULL, mi, NULL, in iter_add_single_mem_entry()
875 if (!he) in iter_add_single_mem_entry()
878 iter->he = he; in iter_add_single_mem_entry()
888 struct hist_entry *he = iter->he; in iter_finish_mem_entry() local
891 if (he == NULL) in iter_finish_mem_entry()
894 hists__inc_nr_samples(hists, he->filtered); in iter_finish_mem_entry()
896 err = hist_entry__append_callchain(he, iter->sample); in iter_finish_mem_entry()
901 iter->he = NULL; in iter_finish_mem_entry()
957 struct hist_entry *he = NULL; in iter_add_next_branch_entry() local
973 he = hists__add_entry(hists, al, iter->parent, &bi[i], NULL, NULL, in iter_add_next_branch_entry()
975 if (he == NULL) in iter_add_next_branch_entry()
978 hists__inc_nr_samples(hists, he->filtered); in iter_add_next_branch_entry()
981 iter->he = he; in iter_add_next_branch_entry()
1002 iter->he = NULL; in iter_finish_branch_entry()
1019 struct hist_entry *he; in iter_add_single_normal_entry() local
1021 he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL, in iter_add_single_normal_entry()
1023 if (he == NULL) in iter_add_single_normal_entry()
1026 iter->he = he; in iter_add_single_normal_entry()
1034 struct hist_entry *he = iter->he; in iter_finish_normal_entry() local
1038 if (he == NULL) in iter_finish_normal_entry()
1041 iter->he = NULL; in iter_finish_normal_entry()
1043 hists__inc_nr_samples(evsel__hists(evsel), he->filtered); in iter_finish_normal_entry()
1045 return hist_entry__append_callchain(he, sample); in iter_finish_normal_entry()
1083 struct hist_entry *he; in iter_add_single_cumulative_entry() local
1086 he = hists__add_entry(hists, al, iter->parent, NULL, NULL, NULL, in iter_add_single_cumulative_entry()
1088 if (he == NULL) in iter_add_single_cumulative_entry()
1091 iter->he = he; in iter_add_single_cumulative_entry()
1092 he_cache[iter->curr++] = he; in iter_add_single_cumulative_entry()
1094 hist_entry__append_callchain(he, sample); in iter_add_single_cumulative_entry()
1102 hists__inc_nr_samples(hists, he->filtered); in iter_add_single_cumulative_entry()
1141 struct hist_entry *he; in iter_add_next_cumulative_entry() local
1184 iter->he = NULL; in iter_add_next_cumulative_entry()
1189 he = hists__add_entry(evsel__hists(evsel), al, iter->parent, NULL, NULL, in iter_add_next_cumulative_entry()
1191 if (he == NULL) in iter_add_next_cumulative_entry()
1194 iter->he = he; in iter_add_next_cumulative_entry()
1195 he_cache[iter->curr++] = he; in iter_add_next_cumulative_entry()
1197 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain) in iter_add_next_cumulative_entry()
1198 callchain_append(he->callchain, &cursor, sample->period); in iter_add_next_cumulative_entry()
1209 iter->he = NULL; in iter_finish_cumulative_entry()
1270 if (iter->he && iter->add_entry_cb) { in hist_entry_iter__add()
1281 if (iter->he && iter->add_entry_cb) { in hist_entry_iter__add()
1364 void hist_entry__delete(struct hist_entry *he) in hist_entry__delete() argument
1366 struct hist_entry_ops *ops = he->ops; in hist_entry__delete()
1368 thread__zput(he->thread); in hist_entry__delete()
1369 map_symbol__exit(&he->ms); in hist_entry__delete()
1371 if (he->branch_info) { in hist_entry__delete()
1372 branch_info__exit(he->branch_info); in hist_entry__delete()
1373 zfree(&he->branch_info); in hist_entry__delete()
1376 if (he->mem_info) { in hist_entry__delete()
1377 map_symbol__exit(&mem_info__iaddr(he->mem_info)->ms); in hist_entry__delete()
1378 map_symbol__exit(&mem_info__daddr(he->mem_info)->ms); in hist_entry__delete()
1379 mem_info__zput(he->mem_info); in hist_entry__delete()
1382 if (he->block_info) in hist_entry__delete()
1383 block_info__delete(he->block_info); in hist_entry__delete()
1385 if (he->kvm_info) in hist_entry__delete()
1386 kvm_info__zput(he->kvm_info); in hist_entry__delete()
1388 zfree(&he->res_samples); in hist_entry__delete()
1389 zfree(&he->stat_acc); in hist_entry__delete()
1390 zfree_srcline(&he->srcline); in hist_entry__delete()
1391 if (he->srcfile && he->srcfile[0]) in hist_entry__delete()
1392 zfree(&he->srcfile); in hist_entry__delete()
1393 free_callchain(he->callchain); in hist_entry__delete()
1394 zfree(&he->trace_output); in hist_entry__delete()
1395 zfree(&he->raw_data); in hist_entry__delete()
1396 ops->free(he); in hist_entry__delete()
1406 int hist_entry__snprintf_alignment(struct hist_entry *he, struct perf_hpp *hpp, in hist_entry__snprintf_alignment() argument
1409 if (!list_is_last(&fmt->list, &he->hists->hpp_list->fields)) { in hist_entry__snprintf_alignment()
1410 const int width = fmt->width(fmt, hpp, he->hists); in hist_entry__snprintf_alignment()
1424 static void hists__apply_filters(struct hists *hists, struct hist_entry *he);
1425 static void hists__remove_entry_filter(struct hists *hists, struct hist_entry *he,
1435 static void hist_entry__check_and_remove_filter(struct hist_entry *he, in hist_entry__check_and_remove_filter() argument
1441 struct hist_entry *parent = he->parent_he; in hist_entry__check_and_remove_filter()
1468 perf_hpp_list__for_each_format(he->hpp_list, fmt) { in hist_entry__check_and_remove_filter()
1482 if (!(he->filtered & (1 << type))) { in hist_entry__check_and_remove_filter()
1499 he->filtered |= (1 << type); in hist_entry__check_and_remove_filter()
1501 he->filtered |= (parent->filtered & (1 << type)); in hist_entry__check_and_remove_filter()
1505 static void hist_entry__apply_hierarchy_filters(struct hist_entry *he) in hist_entry__apply_hierarchy_filters() argument
1507 hist_entry__check_and_remove_filter(he, HIST_FILTER__THREAD, in hist_entry__apply_hierarchy_filters()
1510 hist_entry__check_and_remove_filter(he, HIST_FILTER__DSO, in hist_entry__apply_hierarchy_filters()
1513 hist_entry__check_and_remove_filter(he, HIST_FILTER__SYMBOL, in hist_entry__apply_hierarchy_filters()
1516 hists__apply_filters(he->hists, he); in hist_entry__apply_hierarchy_filters()
1521 struct hist_entry *he, in hierarchy_insert_entry() argument
1535 cmp = hist_entry__collapse_hierarchy(hpp_list, iter, he); in hierarchy_insert_entry()
1537 he_stat__add_stat(&iter->stat, &he->stat); in hierarchy_insert_entry()
1549 new = hist_entry__new(he, true); in hierarchy_insert_entry()
1564 he->trace_output = NULL; in hierarchy_insert_entry()
1569 he->srcline = NULL; in hierarchy_insert_entry()
1574 he->srcfile = NULL; in hierarchy_insert_entry()
1586 struct hist_entry *he) in hists__hierarchy_insert_entry() argument
1599 /* insert copy of 'he' for each fmt into the hierarchy */ in hists__hierarchy_insert_entry()
1600 new_he = hierarchy_insert_entry(hists, root, he, parent, &node->hpp); in hists__hierarchy_insert_entry()
1624 he->callchain) < 0) in hists__hierarchy_insert_entry()
1629 /* 'he' is no longer used */ in hists__hierarchy_insert_entry()
1630 hist_entry__delete(he); in hists__hierarchy_insert_entry()
1638 struct hist_entry *he) in hists__collapse_insert_entry() argument
1647 return hists__hierarchy_insert_entry(hists, root, he); in hists__collapse_insert_entry()
1653 cmp = hist_entry__collapse(iter, he); in hists__collapse_insert_entry()
1658 he_stat__add_stat(&iter->stat, &he->stat); in hists__collapse_insert_entry()
1660 he_stat__add_stat(iter->stat_acc, he->stat_acc); in hists__collapse_insert_entry()
1662 if (hist_entry__has_callchains(he) && symbol_conf.use_callchain) { in hists__collapse_insert_entry()
1667 if (callchain_merge(cursor, iter->callchain, he->callchain) < 0) in hists__collapse_insert_entry()
1673 hist_entry__delete(he); in hists__collapse_insert_entry()
1686 rb_link_node(&he->rb_node_in, parent, p); in hists__collapse_insert_entry()
1687 rb_insert_color_cached(&he->rb_node_in, root, leftmost); in hists__collapse_insert_entry()
1706 static void hists__apply_filters(struct hists *hists, struct hist_entry *he) in hists__apply_filters() argument
1708 hists__filter_entry_by_dso(hists, he); in hists__apply_filters()
1709 hists__filter_entry_by_thread(hists, he); in hists__apply_filters()
1710 hists__filter_entry_by_symbol(hists, he); in hists__apply_filters()
1711 hists__filter_entry_by_socket(hists, he); in hists__apply_filters()
1787 struct hist_entry *he; in hierarchy_recalc_total_periods() local
1800 he = rb_entry(node, struct hist_entry, rb_node); in hierarchy_recalc_total_periods()
1803 hists->stats.total_period += he->stat.period; in hierarchy_recalc_total_periods()
1804 if (!he->filtered) in hierarchy_recalc_total_periods()
1805 hists->stats.total_non_filtered_period += he->stat.period; in hierarchy_recalc_total_periods()
1810 struct hist_entry *he) in hierarchy_insert_output_entry() argument
1822 if (hist_entry__sort(he, iter) > 0) in hierarchy_insert_output_entry()
1830 rb_link_node(&he->rb_node, parent, p); in hierarchy_insert_output_entry()
1831 rb_insert_color_cached(&he->rb_node, root, leftmost); in hierarchy_insert_output_entry()
1834 perf_hpp_list__for_each_sort_list(he->hpp_list, fmt) { in hierarchy_insert_output_entry()
1836 fmt->init(fmt, he); in hierarchy_insert_output_entry()
1848 struct hist_entry *he; in hists__hierarchy_output_resort() local
1854 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__hierarchy_output_resort()
1857 hierarchy_insert_output_entry(root_out, he); in hists__hierarchy_output_resort()
1863 if (!he->filtered) { in hists__hierarchy_output_resort()
1865 hists__calc_col_len(hists, he); in hists__hierarchy_output_resort()
1868 if (!he->leaf) { in hists__hierarchy_output_resort()
1870 &he->hroot_in, in hists__hierarchy_output_resort()
1871 &he->hroot_out, in hists__hierarchy_output_resort()
1881 u64 total = he->stat.period; in hists__hierarchy_output_resort()
1884 total = he->stat_acc->period; in hists__hierarchy_output_resort()
1889 callchain_param.sort(&he->sorted_chain, he->callchain, in hists__hierarchy_output_resort()
1895 struct hist_entry *he, in __hists__insert_output_entry() argument
1907 u64 total = he->stat.period; in __hists__insert_output_entry()
1910 total = he->stat_acc->period; in __hists__insert_output_entry()
1914 callchain_param.sort(&he->sorted_chain, he->callchain, in __hists__insert_output_entry()
1922 if (hist_entry__sort(he, iter) > 0) in __hists__insert_output_entry()
1930 rb_link_node(&he->rb_node, parent, p); in __hists__insert_output_entry()
1931 rb_insert_color_cached(&he->rb_node, entries, leftmost); in __hists__insert_output_entry()
1936 fmt->init(fmt, he); in __hists__insert_output_entry()
2026 static bool can_goto_child(struct hist_entry *he, enum hierarchy_move_dir hmd) in can_goto_child() argument
2028 if (he->leaf || hmd == HMD_FORCE_SIBLING) in can_goto_child()
2031 if (he->unfolded || hmd == HMD_FORCE_CHILD) in can_goto_child()
2039 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last() local
2041 while (can_goto_child(he, HMD_NORMAL)) { in rb_hierarchy_last()
2042 node = rb_last(&he->hroot_out.rb_root); in rb_hierarchy_last()
2043 he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
2050 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in __rb_hierarchy_next() local
2052 if (can_goto_child(he, hmd)) in __rb_hierarchy_next()
2053 node = rb_first_cached(&he->hroot_out); in __rb_hierarchy_next()
2058 he = he->parent_he; in __rb_hierarchy_next()
2059 if (he == NULL) in __rb_hierarchy_next()
2062 node = rb_next(&he->rb_node); in __rb_hierarchy_next()
2069 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_prev() local
2075 he = he->parent_he; in rb_hierarchy_prev()
2076 if (he == NULL) in rb_hierarchy_prev()
2079 return &he->rb_node; in rb_hierarchy_prev()
2082 bool hist_entry__has_hierarchy_children(struct hist_entry *he, float limit) in hist_entry__has_hierarchy_children() argument
2088 if (he->leaf) in hist_entry__has_hierarchy_children()
2091 node = rb_first_cached(&he->hroot_out); in hist_entry__has_hierarchy_children()
2150 struct hist_entry *he) in hists__filter_entry_by_dso() argument
2153 (he->ms.map == NULL || !RC_CHK_EQUAL(map__dso(he->ms.map), hists->dso_filter))) { in hists__filter_entry_by_dso()
2154 he->filtered |= (1 << HIST_FILTER__DSO); in hists__filter_entry_by_dso()
2162 struct hist_entry *he) in hists__filter_entry_by_thread() argument
2165 !RC_CHK_EQUAL(he->thread, hists->thread_filter)) { in hists__filter_entry_by_thread()
2166 he->filtered |= (1 << HIST_FILTER__THREAD); in hists__filter_entry_by_thread()
2174 struct hist_entry *he) in hists__filter_entry_by_symbol() argument
2177 (!he->ms.sym || strstr(he->ms.sym->name, in hists__filter_entry_by_symbol()
2179 he->filtered |= (1 << HIST_FILTER__SYMBOL); in hists__filter_entry_by_symbol()
2187 struct hist_entry *he) in hists__filter_entry_by_socket() argument
2190 (he->socket != hists->socket_filter)) { in hists__filter_entry_by_socket()
2191 he->filtered |= (1 << HIST_FILTER__SOCKET); in hists__filter_entry_by_socket()
2198 typedef bool (*filter_fn_t)(struct hists *hists, struct hist_entry *he);
2220 struct hist_entry *he) in resort_filtered_entry() argument
2233 if (hist_entry__sort(he, iter) > 0) in resort_filtered_entry()
2241 rb_link_node(&he->rb_node, parent, p); in resort_filtered_entry()
2242 rb_insert_color_cached(&he->rb_node, root, leftmost); in resort_filtered_entry()
2244 if (he->leaf || he->filtered) in resort_filtered_entry()
2247 nd = rb_first_cached(&he->hroot_out); in resort_filtered_entry()
2252 rb_erase_cached(&h->rb_node, &he->hroot_out); in resort_filtered_entry()
2257 he->hroot_out = new_root; in resort_filtered_entry()
2406 struct hist_entry *he; in hists__add_dummy_entry() local
2419 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__add_dummy_entry()
2421 cmp = hist_entry__collapse(he, pair); in hists__add_dummy_entry()
2434 he = hist_entry__new(pair, true); in hists__add_dummy_entry()
2435 if (he) { in hists__add_dummy_entry()
2436 memset(&he->stat, 0, sizeof(he->stat)); in hists__add_dummy_entry()
2437 he->hists = hists; in hists__add_dummy_entry()
2439 memset(he->stat_acc, 0, sizeof(he->stat)); in hists__add_dummy_entry()
2440 rb_link_node(&he->rb_node_in, parent, p); in hists__add_dummy_entry()
2441 rb_insert_color_cached(&he->rb_node_in, root, leftmost); in hists__add_dummy_entry()
2442 hists__inc_stats(hists, he); in hists__add_dummy_entry()
2443 he->dummy = true; in hists__add_dummy_entry()
2446 return he; in hists__add_dummy_entry()
2455 struct hist_entry *he; in add_dummy_hierarchy_entry() local
2463 he = rb_entry(parent, struct hist_entry, rb_node_in); in add_dummy_hierarchy_entry()
2464 cmp = hist_entry__collapse_hierarchy(he->hpp_list, he, pair); in add_dummy_hierarchy_entry()
2476 he = hist_entry__new(pair, true); in add_dummy_hierarchy_entry()
2477 if (he) { in add_dummy_hierarchy_entry()
2478 rb_link_node(&he->rb_node_in, parent, p); in add_dummy_hierarchy_entry()
2479 rb_insert_color_cached(&he->rb_node_in, root, leftmost); in add_dummy_hierarchy_entry()
2481 he->dummy = true; in add_dummy_hierarchy_entry()
2482 he->hists = hists; in add_dummy_hierarchy_entry()
2483 memset(&he->stat, 0, sizeof(he->stat)); in add_dummy_hierarchy_entry()
2484 hists__inc_stats(hists, he); in add_dummy_hierarchy_entry()
2487 return he; in add_dummy_hierarchy_entry()
2491 struct hist_entry *he) in hists__find_entry() argument
2502 int64_t cmp = hist_entry__collapse(iter, he); in hists__find_entry()
2516 struct hist_entry *he) in hists__find_hierarchy_entry() argument
2525 cmp = hist_entry__collapse_hierarchy(he->hpp_list, iter, he); in hists__find_hierarchy_entry()
2881 struct hist_entry *he; in hists__delete_remaining_entries() local
2887 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__delete_remaining_entries()
2888 hist_entry__delete(he); in hists__delete_remaining_entries()