Searched refs:rb_node_in (Results 1 – 9 of 9) sorted by relevance
/linux-4.4.14/tools/perf/util/ |
D | callchain.c | 252 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_flat() 283 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_abs() 313 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_rel() 376 child = rb_entry(n, struct callchain_node, rb_node_in); in create_child() 382 rb_link_node(&new->rb_node_in, NULL, &parent->rb_root_in.rb_node); in create_child() 383 rb_insert_color(&new->rb_node_in, &parent->rb_root_in); in create_child() 500 first = rb_entry(p, struct callchain_node, rb_node_in); in split_add_child() 509 rb_link_node(&new->rb_node_in, p, pp); in split_add_child() 510 rb_insert_color(&new->rb_node_in, &parent->rb_root_in); in split_add_child() 540 rnode = rb_entry(parent, struct callchain_node, rb_node_in); in append_chain_children() [all …]
|
D | hist.c | 272 rb_erase(&he->rb_node_in, &hists->entries_collapsed); in hists__delete_entry() 400 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry() 447 rb_link_node(&he->rb_node_in, parent, p); in hists__findnew_entry() 448 rb_insert_color(&he->rb_node_in, hists->entries_in); in hists__findnew_entry() 996 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hists__collapse_insert_entry() 1022 rb_link_node(&he->rb_node_in, parent, p); in hists__collapse_insert_entry() 1023 rb_insert_color(&he->rb_node_in, root); in hists__collapse_insert_entry() 1068 n = rb_entry(next, struct hist_entry, rb_node_in); in hists__collapse_resort() 1069 next = rb_next(&n->rb_node_in); in hists__collapse_resort() 1071 rb_erase(&n->rb_node_in, root); in hists__collapse_resort() [all …]
|
D | sort.h | 81 struct rb_node rb_node_in; member
|
D | callchain.h | 57 struct rb_node rb_node_in; /* to insert nodes in an rbtree */ member
|
/linux-4.4.14/tools/perf/tests/ |
D | hists_link.c | 169 he = rb_entry(node, struct hist_entry, rb_node_in); in __validate_match() 221 he = rb_entry(node, struct hist_entry, rb_node_in); in __validate_link()
|
D | hists_common.c | 173 he = rb_entry(node, struct hist_entry, rb_node_in); in print_hists_in()
|
D | hists_cumulate.c | 146 rb_erase(&he->rb_node_in, root_in); in del_hist_entries()
|
D | hists_output.c | 112 rb_erase(&he->rb_node_in, root_in); in del_hist_entries()
|
/linux-4.4.14/tools/perf/ |
D | builtin-diff.c | 439 struct hist_entry *he = rb_entry(next, struct hist_entry, rb_node_in); in hists__baseline_only() 441 next = rb_next(&he->rb_node_in); in hists__baseline_only() 443 rb_erase(&he->rb_node_in, root); in hists__baseline_only() 465 he = rb_entry(next, struct hist_entry, rb_node_in); in hists__precompute() 466 next = rb_next(&he->rb_node_in); in hists__precompute()
|