Lines Matching refs:rb_entry
263 n = rb_entry(next, struct hist_entry, rb_node); in hists__output_recalc_col_len()
354 child = rb_entry(node, struct hist_entry, rb_node); in hists__decay_entry()
397 n = rb_entry(next, struct hist_entry, rb_node); in hists__decay_entries()
413 n = rb_entry(next, struct hist_entry, rb_node); in hists__delete_entries()
427 n = rb_entry(next, struct hist_entry, rb_node); in hists__get_entry()
614 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry()
1502 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hierarchy_insert_entry()
1626 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hists__collapse_insert_entry()
1708 n = rb_entry(next, struct hist_entry, rb_node_in); in hists__collapse_resort()
1793 he = rb_entry(node, struct hist_entry, rb_node); in hierarchy_recalc_total_periods()
1813 iter = rb_entry(parent, struct hist_entry, rb_node); in hierarchy_insert_output_entry()
1847 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__hierarchy_output_resort()
1913 iter = rb_entry(parent, struct hist_entry, rb_node); in __hists__insert_output_entry()
1971 n = rb_entry(next, struct hist_entry, rb_node_in); in output_resort()
2032 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
2036 he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
2043 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in __rb_hierarchy_next()
2062 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_prev()
2085 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
2089 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
2203 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_by_type()
2224 iter = rb_entry(parent, struct hist_entry, rb_node); in resort_filtered_entry()
2242 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in resort_filtered_entry()
2265 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2309 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2412 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__add_dummy_entry()
2457 he = rb_entry(parent, struct hist_entry, rb_node_in); in add_dummy_hierarchy_entry()
2500 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_entry()
2524 iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_hierarchy_entry()
2549 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__match_hierarchy()
2580 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__match()
2597 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__link_hierarchy()
2656 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__link()
2681 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__unlink()
2892 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__delete_remaining_entries()