Lines Matching refs:rb_entry
272 n = rb_entry(next, struct hist_entry, rb_node); in hists__output_recalc_col_len()
434 child = rb_entry(node, struct hist_entry, rb_node); in hists__decay_entry()
477 n = rb_entry(next, struct hist_entry, rb_node); in hists__decay_entries()
493 n = rb_entry(next, struct hist_entry, rb_node); in hists__delete_entries()
507 n = rb_entry(next, struct hist_entry, rb_node); in hists__get_entry()
698 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry()
1640 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hierarchy_insert_entry()
1763 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hists__collapse_insert_entry()
1847 n = rb_entry(next, struct hist_entry, rb_node_in); in hists__collapse_resort()
1920 he = rb_entry(node, struct hist_entry, rb_node); in hierarchy_recalc_total_periods()
1943 iter = rb_entry(parent, struct hist_entry, rb_node); in hierarchy_insert_output_entry()
1977 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__hierarchy_output_resort()
2043 iter = rb_entry(parent, struct hist_entry, rb_node); in __hists__insert_output_entry()
2101 n = rb_entry(next, struct hist_entry, rb_node_in); in output_resort()
2162 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
2166 he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
2173 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in __rb_hierarchy_next()
2192 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_prev()
2215 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
2219 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
2343 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_by_type()
2364 iter = rb_entry(parent, struct hist_entry, rb_node); in resort_filtered_entry()
2382 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in resort_filtered_entry()
2405 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2449 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2562 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__add_dummy_entry()
2606 he = rb_entry(parent, struct hist_entry, rb_node_in); in add_dummy_hierarchy_entry()
2644 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_entry()
2667 iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_hierarchy_entry()
2687 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__match_hierarchy()
2718 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__match()
2735 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__link_hierarchy()
2794 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__link()
2819 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__unlink()
3037 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__delete_remaining_entries()