Lines Matching refs:rb_entry

233 		n = rb_entry(next, struct hist_entry, rb_node);  in hists__output_recalc_col_len()
323 child = rb_entry(node, struct hist_entry, rb_node); in hists__decay_entry()
366 n = rb_entry(next, struct hist_entry, rb_node); in hists__decay_entries()
382 n = rb_entry(next, struct hist_entry, rb_node); in hists__delete_entries()
396 n = rb_entry(next, struct hist_entry, rb_node); in hists__get_entry()
581 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry()
1409 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hierarchy_insert_entry()
1528 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hists__collapse_insert_entry()
1606 n = rb_entry(next, struct hist_entry, rb_node_in); in hists__collapse_resort()
1691 he = rb_entry(node, struct hist_entry, rb_node); in hierarchy_recalc_total_periods()
1711 iter = rb_entry(parent, struct hist_entry, rb_node); in hierarchy_insert_output_entry()
1745 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__hierarchy_output_resort()
1811 iter = rb_entry(parent, struct hist_entry, rb_node); in __hists__insert_output_entry()
1869 n = rb_entry(next, struct hist_entry, rb_node_in); in output_resort()
1930 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
1934 he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
1941 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in __rb_hierarchy_next()
1960 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_prev()
1983 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
1987 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
2101 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_by_type()
2122 iter = rb_entry(parent, struct hist_entry, rb_node); in resort_filtered_entry()
2140 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in resort_filtered_entry()
2163 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2207 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2295 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__add_dummy_entry()
2340 he = rb_entry(parent, struct hist_entry, rb_node_in); in add_dummy_hierarchy_entry()
2383 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_entry()
2407 iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_hierarchy_entry()
2432 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__match_hierarchy()
2463 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__match()
2480 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__link_hierarchy()
2539 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__link()
2564 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__unlink()
2750 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__delete_remaining_entries()