219 		n = rb_entry(next, struct hist_entry, rb_node);  in hists__output_recalc_col_len()
301 			child = rb_entry(node, struct hist_entry, rb_node);  in hists__decay_entry()
344 		n = rb_entry(next, struct hist_entry, rb_node);  in hists__decay_entries()
360 		n = rb_entry(next, struct hist_entry, rb_node);  in hists__delete_entries()
521 		he = rb_entry(parent, struct hist_entry, rb_node_in);  in hists__findnew_entry()
1295 		iter = rb_entry(parent, struct hist_entry, rb_node_in);  in hierarchy_insert_entry()
1411 		iter = rb_entry(parent, struct hist_entry, rb_node_in);  in hists__collapse_insert_entry()
1487 		n = rb_entry(next, struct hist_entry, rb_node_in);  in hists__collapse_resort()
1572 		he = rb_entry(node, struct hist_entry, rb_node);  in hierarchy_recalc_total_periods()
1591 		iter = rb_entry(parent, struct hist_entry, rb_node);  in hierarchy_insert_output_entry()
1623 		he = rb_entry(node, struct hist_entry, rb_node_in);  in hists__hierarchy_output_resort()
1688 		iter = rb_entry(parent, struct hist_entry, rb_node);  in __hists__insert_output_entry()
1743 		n = rb_entry(next, struct hist_entry, rb_node_in);  in output_resort()
1798 	struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);  in rb_hierarchy_last()
1802 		he = rb_entry(node, struct hist_entry, rb_node);  in rb_hierarchy_last()
1809 	struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);  in __rb_hierarchy_next()
1828 	struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);  in rb_hierarchy_prev()
1851 	child = rb_entry(node, struct hist_entry, rb_node);  in hist_entry__has_hierarchy_children()
1855 		child = rb_entry(node, struct hist_entry, rb_node);  in hist_entry__has_hierarchy_children()
1969 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_by_type()
1988 		iter = rb_entry(parent, struct hist_entry, rb_node);  in resort_filtered_entry()
2004 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in resort_filtered_entry()
2027 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_hierarchy()
2071 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_hierarchy()
2158 		he = rb_entry(parent, struct hist_entry, rb_node_in);  in hists__add_dummy_entry()
2200 		he = rb_entry(parent, struct hist_entry, rb_node_in);  in add_dummy_hierarchy_entry()
2241 		struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in);  in hists__find_entry()
2265 		iter = rb_entry(n, struct hist_entry, rb_node_in);  in hists__find_hierarchy_entry()
2290 		pos  = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__match_hierarchy()
2321 		pos  = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__match()
2338 		pos = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__link_hierarchy()
2397 		pos = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__link()
2589 		he = rb_entry(node, struct hist_entry, rb_node_in);  in hists__delete_remaining_entries()