Searched refs:rb_node_in (Results 1 – 9 of 9) sorted by relevance
/linux-4.1.27/tools/perf/util/ |
D | callchain.c | 303 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_flat() 334 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_abs() 364 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_rel() 427 child = rb_entry(n, struct callchain_node, rb_node_in); in create_child() 433 rb_link_node(&new->rb_node_in, NULL, &parent->rb_root_in.rb_node); in create_child() 434 rb_insert_color(&new->rb_node_in, &parent->rb_root_in); in create_child() 551 first = rb_entry(p, struct callchain_node, rb_node_in); in split_add_child() 560 rb_link_node(&new->rb_node_in, p, pp); in split_add_child() 561 rb_insert_color(&new->rb_node_in, &parent->rb_root_in); in split_add_child() 591 rnode = rb_entry(parent, struct callchain_node, rb_node_in); in append_chain_children() [all …]
|
D | hist.c | 252 rb_erase(&he->rb_node_in, &hists->entries_collapsed); in hists__delete_entry() 384 he = rb_entry(parent, struct hist_entry, rb_node_in); in add_hist_entry() 432 rb_link_node(&he->rb_node_in, parent, p); in add_hist_entry() 433 rb_insert_color(&he->rb_node_in, hists->entries_in); in add_hist_entry() 966 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hists__collapse_insert_entry() 992 rb_link_node(&he->rb_node_in, parent, p); in hists__collapse_insert_entry() 993 rb_insert_color(&he->rb_node_in, root); in hists__collapse_insert_entry() 1037 n = rb_entry(next, struct hist_entry, rb_node_in); in hists__collapse_resort() 1038 next = rb_next(&n->rb_node_in); in hists__collapse_resort() 1040 rb_erase(&n->rb_node_in, root); in hists__collapse_resort() [all …]
|
D | sort.h | 79 struct rb_node rb_node_in; member
|
D | callchain.h | 33 struct rb_node rb_node_in; /* to insert nodes in an rbtree */ member
|
/linux-4.1.27/tools/perf/tests/ |
D | hists_link.c | 165 he = rb_entry(node, struct hist_entry, rb_node_in); in __validate_match() 217 he = rb_entry(node, struct hist_entry, rb_node_in); in __validate_link()
|
D | hists_common.c | 169 he = rb_entry(node, struct hist_entry, rb_node_in); in print_hists_in()
|
D | hists_cumulate.c | 142 rb_erase(&he->rb_node_in, root_in); in del_hist_entries()
|
D | hists_output.c | 108 rb_erase(&he->rb_node_in, root_in); in del_hist_entries()
|
/linux-4.1.27/tools/perf/ |
D | builtin-diff.c | 436 struct hist_entry *he = rb_entry(next, struct hist_entry, rb_node_in); in hists__baseline_only() 438 next = rb_next(&he->rb_node_in); in hists__baseline_only() 440 rb_erase(&he->rb_node_in, root); in hists__baseline_only() 462 he = rb_entry(next, struct hist_entry, rb_node_in); in hists__precompute() 463 next = rb_next(&he->rb_node_in); in hists__precompute()
|