Lines Matching refs:rb_entry

262 		n = rb_entry(next, struct hist_entry, rb_node);  in hists__output_recalc_col_len()
348 child = rb_entry(node, struct hist_entry, rb_node); in hists__decay_entry()
391 n = rb_entry(next, struct hist_entry, rb_node); in hists__decay_entries()
407 n = rb_entry(next, struct hist_entry, rb_node); in hists__delete_entries()
421 n = rb_entry(next, struct hist_entry, rb_node); in hists__get_entry()
607 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry()
1489 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hierarchy_insert_entry()
1613 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hists__collapse_insert_entry()
1695 n = rb_entry(next, struct hist_entry, rb_node_in); in hists__collapse_resort()
1780 he = rb_entry(node, struct hist_entry, rb_node); in hierarchy_recalc_total_periods()
1800 iter = rb_entry(parent, struct hist_entry, rb_node); in hierarchy_insert_output_entry()
1834 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__hierarchy_output_resort()
1900 iter = rb_entry(parent, struct hist_entry, rb_node); in __hists__insert_output_entry()
1958 n = rb_entry(next, struct hist_entry, rb_node_in); in output_resort()
2019 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
2023 he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
2030 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in __rb_hierarchy_next()
2049 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_prev()
2072 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
2076 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
2190 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_by_type()
2211 iter = rb_entry(parent, struct hist_entry, rb_node); in resort_filtered_entry()
2229 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in resort_filtered_entry()
2252 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2296 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2394 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__add_dummy_entry()
2439 he = rb_entry(parent, struct hist_entry, rb_node_in); in add_dummy_hierarchy_entry()
2482 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_entry()
2506 iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_hierarchy_entry()
2531 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__match_hierarchy()
2562 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__match()
2579 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__link_hierarchy()
2638 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__link()
2663 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__unlink()
2865 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__delete_remaining_entries()