Lines Matching refs:rb_entry
256 n = rb_entry(next, struct hist_entry, rb_node); in hists__output_recalc_col_len()
342 child = rb_entry(node, struct hist_entry, rb_node); in hists__decay_entry()
385 n = rb_entry(next, struct hist_entry, rb_node); in hists__decay_entries()
401 n = rb_entry(next, struct hist_entry, rb_node); in hists__delete_entries()
415 n = rb_entry(next, struct hist_entry, rb_node); in hists__get_entry()
599 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry()
1462 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hierarchy_insert_entry()
1581 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hists__collapse_insert_entry()
1659 n = rb_entry(next, struct hist_entry, rb_node_in); in hists__collapse_resort()
1744 he = rb_entry(node, struct hist_entry, rb_node); in hierarchy_recalc_total_periods()
1764 iter = rb_entry(parent, struct hist_entry, rb_node); in hierarchy_insert_output_entry()
1798 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__hierarchy_output_resort()
1864 iter = rb_entry(parent, struct hist_entry, rb_node); in __hists__insert_output_entry()
1922 n = rb_entry(next, struct hist_entry, rb_node_in); in output_resort()
1983 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
1987 he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
1994 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in __rb_hierarchy_next()
2013 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_prev()
2036 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
2040 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
2154 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_by_type()
2175 iter = rb_entry(parent, struct hist_entry, rb_node); in resort_filtered_entry()
2193 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in resort_filtered_entry()
2216 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2260 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2353 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__add_dummy_entry()
2398 he = rb_entry(parent, struct hist_entry, rb_node_in); in add_dummy_hierarchy_entry()
2441 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_entry()
2465 iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_hierarchy_entry()
2490 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__match_hierarchy()
2521 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__match()
2538 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__link_hierarchy()
2597 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__link()
2622 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__unlink()
2820 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__delete_remaining_entries()