Home
last modified time | relevance | path

Searched refs:sorted_chain (Results 1 – 7 of 7) sorted by relevance

/linux-6.6.21/tools/perf/ui/stdio/
Dhist.c392 return callchain__fprintf_graph(fp, &he->sorted_chain, total_samples, in hist_entry_callchain__fprintf()
396 return callchain__fprintf_graph(fp, &he->sorted_chain, total_samples, in hist_entry_callchain__fprintf()
400 return callchain__fprintf_flat(fp, &he->sorted_chain, total_samples); in hist_entry_callchain__fprintf()
403 return callchain__fprintf_folded(fp, &he->sorted_chain, total_samples); in hist_entry_callchain__fprintf()
/linux-6.6.21/tools/perf/util/
Dsort.h163 struct rb_root sorted_chain; /* leaf entry has callchains */ member
Dstream.c102 struct rb_root *root = &he->sorted_chain; in update_hot_callchain()
Dhist.c1869 callchain_param.sort(&he->sorted_chain, he->callchain, in hists__hierarchy_output_resort()
1894 callchain_param.sort(&he->sorted_chain, he->callchain, in __hists__insert_output_entry()
Dcallchain.c1742 struct rb_root *root = &he->sorted_chain; in count_callchain_hits()
/linux-6.6.21/tools/perf/ui/browsers/
Dhists.c280 return callchain__count_rows(&he->sorted_chain); in hierarchy_count_rows()
387 he->has_children = !RB_EMPTY_ROOT(&he->sorted_chain); in hist_entry__init_have_children()
388 callchain__init_have_children(&he->sorted_chain); in hist_entry__init_have_children()
474 &he->sorted_chain); in hist_browser__toggle_fold()
592 n = callchain__set_folding(&he->sorted_chain, unfold); in hist_entry__set_folding()
1181 &entry->sorted_chain, row, in hist_browser__show_callchain()
1186 &entry->sorted_chain, row, in hist_browser__show_callchain()
1191 &entry->sorted_chain, level, row, in hist_browser__show_callchain()
2932 callchain_param.sort(&he->sorted_chain, he->callchain, in hist_browser__update_percent_limit()
/linux-6.6.21/tools/perf/ui/gtk/
Dhists.c393 perf_gtk__add_callchain(&h->sorted_chain, store, &iter, in perf_gtk__show_hists()
490 perf_gtk__add_callchain(&he->sorted_chain, store, &iter, in perf_gtk__add_hierarchy_entries()