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()
696 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry()
1638 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hierarchy_insert_entry()
1761 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hists__collapse_insert_entry()
1845 n = rb_entry(next, struct hist_entry, rb_node_in); in hists__collapse_resort()
1918 he = rb_entry(node, struct hist_entry, rb_node); in hierarchy_recalc_total_periods()
1941 iter = rb_entry(parent, struct hist_entry, rb_node); in hierarchy_insert_output_entry()
1975 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__hierarchy_output_resort()
2041 iter = rb_entry(parent, struct hist_entry, rb_node); in __hists__insert_output_entry()
2099 n = rb_entry(next, struct hist_entry, rb_node_in); in output_resort()
2160 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
2164 he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
2171 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in __rb_hierarchy_next()
2190 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_prev()
2213 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
2217 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
2341 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_by_type()
2362 iter = rb_entry(parent, struct hist_entry, rb_node); in resort_filtered_entry()
2380 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in resort_filtered_entry()
2403 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2447 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2560 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__add_dummy_entry()
2604 he = rb_entry(parent, struct hist_entry, rb_node_in); in add_dummy_hierarchy_entry()
2642 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_entry()
2665 iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_hierarchy_entry()
2685 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__match_hierarchy()
2716 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__match()
2733 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__link_hierarchy()
2792 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__link()
2817 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__unlink()
3035 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__delete_remaining_entries()