Lines Matching refs:rb_entry
248 n = rb_entry(next, struct hist_entry, rb_node); in hists__output_recalc_col_len()
338 child = rb_entry(node, struct hist_entry, rb_node); in hists__decay_entry()
381 n = rb_entry(next, struct hist_entry, rb_node); in hists__decay_entries()
397 n = rb_entry(next, struct hist_entry, rb_node); in hists__delete_entries()
411 n = rb_entry(next, struct hist_entry, rb_node); in hists__get_entry()
596 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry()
1456 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hierarchy_insert_entry()
1575 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hists__collapse_insert_entry()
1653 n = rb_entry(next, struct hist_entry, rb_node_in); in hists__collapse_resort()
1738 he = rb_entry(node, struct hist_entry, rb_node); in hierarchy_recalc_total_periods()
1758 iter = rb_entry(parent, struct hist_entry, rb_node); in hierarchy_insert_output_entry()
1792 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__hierarchy_output_resort()
1858 iter = rb_entry(parent, struct hist_entry, rb_node); in __hists__insert_output_entry()
1916 n = rb_entry(next, struct hist_entry, rb_node_in); in output_resort()
1977 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
1981 he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
1988 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in __rb_hierarchy_next()
2007 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_prev()
2030 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
2034 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
2148 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_by_type()
2169 iter = rb_entry(parent, struct hist_entry, rb_node); in resort_filtered_entry()
2187 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in resort_filtered_entry()
2210 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2254 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2342 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__add_dummy_entry()
2387 he = rb_entry(parent, struct hist_entry, rb_node_in); in add_dummy_hierarchy_entry()
2430 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_entry()
2454 iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_hierarchy_entry()
2479 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__match_hierarchy()
2510 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__match()
2527 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__link_hierarchy()
2586 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__link()
2611 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__unlink()
2802 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__delete_remaining_entries()