Searched refs:rb_node_in (Results 1 – 10 of 10) sorted by relevance
| /linux/tools/perf/util/ |
| H A D | callchain.c | 439 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_flat() 471 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_abs() 501 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_rel() 566 child = rb_entry(n, struct callchain_node, rb_node_in); in create_child() 572 rb_link_node(&new->rb_node_in, NULL, &parent->rb_root_in.rb_node); in create_child() 573 rb_insert_color(&new->rb_node_in, &parent->rb_root_in); in create_child() 878 first = rb_entry(p, struct callchain_node, rb_node_in); in split_add_child() 887 rb_link_node(&new->rb_node_in, p, pp); in split_add_child() 888 rb_insert_color(&new->rb_node_in, &parent->rb_root_in); in split_add_child() 920 rnode = rb_entry(parent, struct callchain_node, rb_node_in); in append_chain_children() [all …]
|
| H A D | hist.c | 461 rb_erase_cached(&he->rb_node_in, root_in); in hists__delete_entry() 696 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry() 751 rb_link_node(&he->rb_node_in, parent, p); in hists__findnew_entry() 752 rb_insert_color_cached(&he->rb_node_in, hists->entries_in, leftmost); in hists__findnew_entry() 1638 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hierarchy_insert_entry() 1689 rb_link_node(&new->rb_node_in, parent, p); in hierarchy_insert_entry() 1690 rb_insert_color_cached(&new->rb_node_in, root, leftmost); in hierarchy_insert_entry() 1761 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hists__collapse_insert_entry() 1797 rb_link_node(&he->rb_node_in, parent, p); in hists__collapse_insert_entry() 1798 rb_insert_color_cached(&he->rb_node_in, root, leftmost); in hists__collapse_insert_entry() [all …]
|
| H A D | callchain.h | 64 struct rb_node rb_node_in; /* to insert nodes in an rbtree */ member
|
| H A D | hist.h | 239 struct rb_node rb_node_in; member
|
| /linux/tools/perf/ |
| H A D | builtin-diff.c | 538 struct hist_entry *he = rb_entry(next, struct hist_entry, rb_node_in); in hists__baseline_only() 540 next = rb_next(&he->rb_node_in); in hists__baseline_only() 542 rb_erase_cached(&he->rb_node_in, root); in hists__baseline_only() 592 rb_node_in); in get_block_pair() 594 next = rb_next(&he_pair->rb_node_in); in get_block_pair() 658 rb_node_in); in block_hists_match() 661 next = rb_next(&he->rb_node_in); in block_hists_match() 687 he = rb_entry(next, struct hist_entry, rb_node_in); in hists__precompute() 688 next = rb_next(&he->rb_node_in); in hists__precompute()
|
| H A D | builtin-kvm.c | 655 he = rb_entry(nd, struct hist_entry, rb_node_in); in clear_events_cache_stats()
|
| /linux/tools/perf/tests/ |
| H A D | hists_link.c | 178 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 D | hists_common.c | 179 he = rb_entry(node, struct hist_entry, rb_node_in); in print_hists_in()
|
| H A D | hists_cumulate.c | 149 rb_erase_cached(&he->rb_node_in, root_in); in del_hist_entries()
|
| H A D | hists_output.c | 114 rb_erase_cached(&he->rb_node_in, root_in); in del_hist_entries()
|