Home
last modified time | relevance | path

Searched refs:hroot_out (Results 1 – 4 of 4) sorted by relevance

/tools/perf/util/
A Dhist.c432 struct rb_node *node = rb_first_cached(&he->hroot_out); in hists__decay_entry()
452 root_out = &he->parent_he->hroot_out; in hists__delete_entry()
592 he->hroot_out = RB_ROOT_CACHED; in hist_entry__init()
1457 struct rb_root *root = &he->hroot_out.rb_root; in hist_entry__delete()
1994 &he->hroot_out, in hists__hierarchy_output_resort()
2165 node = rb_last(&he->hroot_out.rb_root); in rb_hierarchy_last()
2176 node = rb_first_cached(&he->hroot_out); in __rb_hierarchy_next()
2214 node = rb_first_cached(&he->hroot_out); in hist_entry__has_hierarchy_children()
2380 nd = rb_first_cached(&he->hroot_out); in resort_filtered_entry()
2385 rb_erase_cached(&h->rb_node, &he->hroot_out); in resort_filtered_entry()
[all …]
A Dhist.h314 struct rb_root_cached hroot_out; member
/tools/perf/ui/gtk/
A Dhists.c469 perf_gtk__add_hierarchy_entries(hists, &he->hroot_out, in perf_gtk__add_hierarchy_entries()
/tools/perf/ui/browsers/
A Dhists.c286 node = rb_first_cached(&he->hroot_out); in hierarchy_count_rows()
391 he->has_children = !RB_EMPTY_ROOT(&he->hroot_out.rb_root); in hist_entry__init_have_children()
573 for (nd = rb_first_cached(&he->hroot_out); nd; nd = rb_next(nd)) { in hierarchy_set_folding()

Completed in 21 milliseconds