Home
last modified time | relevance | path

Searched refs:rb_node_in (Results 1 – 10 of 10) sorted by relevance

/openbmc/linux/tools/perf/util/
H A Dhist.c375 rb_erase_cached(&he->rb_node_in, root_in); in hists__delete_entry()
607 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry()
668 rb_link_node(&he->rb_node_in, parent, p); in hists__findnew_entry()
669 rb_insert_color_cached(&he->rb_node_in, hists->entries_in, leftmost); in hists__findnew_entry()
1494 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hierarchy_insert_entry()
1546 rb_link_node(&new->rb_node_in, parent, p); in hierarchy_insert_entry()
1547 rb_insert_color_cached(&new->rb_node_in, root, leftmost); in hierarchy_insert_entry()
1618 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hists__collapse_insert_entry()
1653 rb_link_node(&he->rb_node_in, parent, p); in hists__collapse_insert_entry()
1654 rb_insert_color_cached(&he->rb_node_in, root, leftmost); in hists__collapse_insert_entry()
[all …]
H A Dcallchain.c428 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_flat()
460 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_abs()
490 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_rel()
555 child = rb_entry(n, struct callchain_node, rb_node_in); in create_child()
561 rb_link_node(&new->rb_node_in, NULL, &parent->rb_root_in.rb_node); in create_child()
562 rb_insert_color(&new->rb_node_in, &parent->rb_root_in); in create_child()
852 first = rb_entry(p, struct callchain_node, rb_node_in); in split_add_child()
861 rb_link_node(&new->rb_node_in, p, pp); in split_add_child()
862 rb_insert_color(&new->rb_node_in, &parent->rb_root_in); in split_add_child()
894 rnode = rb_entry(parent, struct callchain_node, rb_node_in); in append_chain_children()
[all …]
H A Dsort.h91 struct rb_node rb_node_in; member
H A Dcallchain.h64 struct rb_node rb_node_in; /* to insert nodes in an rbtree */ member
/openbmc/linux/tools/perf/
H A Dbuiltin-diff.c553 struct hist_entry *he = rb_entry(next, struct hist_entry, rb_node_in); in hists__baseline_only()
555 next = rb_next(&he->rb_node_in); in hists__baseline_only()
557 rb_erase_cached(&he->rb_node_in, root); in hists__baseline_only()
607 rb_node_in); in get_block_pair()
609 next = rb_next(&he_pair->rb_node_in); in get_block_pair()
673 rb_node_in); in block_hists_match()
676 next = rb_next(&he->rb_node_in); in block_hists_match()
702 he = rb_entry(next, struct hist_entry, rb_node_in); in hists__precompute()
703 next = rb_next(&he->rb_node_in); in hists__precompute()
H A Dbuiltin-kvm.c715 he = rb_entry(nd, struct hist_entry, rb_node_in); in clear_events_cache_stats()
/openbmc/linux/tools/perf/tests/
H A Dhists_link.c178 he = rb_entry(node, struct hist_entry, rb_node_in); in __validate_match()
230 he = rb_entry(node, struct hist_entry, rb_node_in); in __validate_link()
H A Dhists_common.c179 he = rb_entry(node, struct hist_entry, rb_node_in); in print_hists_in()
H A Dhists_cumulate.c149 rb_erase_cached(&he->rb_node_in, root_in); in del_hist_entries()
H A Dhists_output.c114 rb_erase_cached(&he->rb_node_in, root_in); in del_hist_entries()