Lines Matching refs:rb_entry
261 n = rb_entry(next, struct hist_entry, rb_node); in hists__output_recalc_col_len()
347 child = rb_entry(node, struct hist_entry, rb_node); in hists__decay_entry()
390 n = rb_entry(next, struct hist_entry, rb_node); in hists__decay_entries()
406 n = rb_entry(next, struct hist_entry, rb_node); in hists__delete_entries()
420 n = rb_entry(next, struct hist_entry, rb_node); in hists__get_entry()
604 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry()
1467 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hierarchy_insert_entry()
1586 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hists__collapse_insert_entry()
1664 n = rb_entry(next, struct hist_entry, rb_node_in); in hists__collapse_resort()
1749 he = rb_entry(node, struct hist_entry, rb_node); in hierarchy_recalc_total_periods()
1769 iter = rb_entry(parent, struct hist_entry, rb_node); in hierarchy_insert_output_entry()
1803 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__hierarchy_output_resort()
1869 iter = rb_entry(parent, struct hist_entry, rb_node); in __hists__insert_output_entry()
1927 n = rb_entry(next, struct hist_entry, rb_node_in); in output_resort()
1988 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
1992 he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
1999 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in __rb_hierarchy_next()
2018 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_prev()
2041 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
2045 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
2159 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_by_type()
2180 iter = rb_entry(parent, struct hist_entry, rb_node); in resort_filtered_entry()
2198 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in resort_filtered_entry()
2221 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2265 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2363 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__add_dummy_entry()
2408 he = rb_entry(parent, struct hist_entry, rb_node_in); in add_dummy_hierarchy_entry()
2451 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_entry()
2475 iter = rb_entry(n, struct hist_entry, rb_node_in); in hists__find_hierarchy_entry()
2500 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__match_hierarchy()
2531 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__match()
2548 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__link_hierarchy()
2607 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__link()
2632 pos = rb_entry(nd, struct hist_entry, rb_node_in); in hists__unlink()
2834 he = rb_entry(node, struct hist_entry, rb_node_in); in hists__delete_remaining_entries()