Searched refs:rb_node_in (Results 1 – 9 of 9) sorted by relevance
/Linux-v4.19/tools/perf/util/ |
D | callchain.c | 414 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_flat() 446 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_abs() 476 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_rel() 541 child = rb_entry(n, struct callchain_node, rb_node_in); in create_child() 547 rb_link_node(&new->rb_node_in, NULL, &parent->rb_root_in.rb_node); in create_child() 548 rb_insert_color(&new->rb_node_in, &parent->rb_root_in); in create_child() 835 first = rb_entry(p, struct callchain_node, rb_node_in); in split_add_child() 844 rb_link_node(&new->rb_node_in, p, pp); in split_add_child() 845 rb_insert_color(&new->rb_node_in, &parent->rb_root_in); in split_add_child() 877 rnode = rb_entry(parent, struct callchain_node, rb_node_in); in append_chain_children() [all …]
|
D | hist.c | 328 rb_erase(&he->rb_node_in, root_in); in hists__delete_entry() 521 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry() 572 rb_link_node(&he->rb_node_in, parent, p); in hists__findnew_entry() 573 rb_insert_color(&he->rb_node_in, hists->entries_in); in hists__findnew_entry() 1295 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hierarchy_insert_entry() 1345 rb_link_node(&new->rb_node_in, parent, p); in hierarchy_insert_entry() 1346 rb_insert_color(&new->rb_node_in, root); in hierarchy_insert_entry() 1411 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hists__collapse_insert_entry() 1440 rb_link_node(&he->rb_node_in, parent, p); in hists__collapse_insert_entry() 1441 rb_insert_color(&he->rb_node_in, root); in hists__collapse_insert_entry() [all …]
|
D | sort.h | 90 struct rb_node rb_node_in; member
|
D | callchain.h | 59 struct rb_node rb_node_in; /* to insert nodes in an rbtree */ member
|
/Linux-v4.19/tools/perf/tests/ |
D | hists_link.c | 160 he = rb_entry(node, struct hist_entry, rb_node_in); in __validate_match() 212 he = rb_entry(node, struct hist_entry, rb_node_in); in __validate_link()
|
D | hists_common.c | 177 he = rb_entry(node, struct hist_entry, rb_node_in); in print_hists_in()
|
D | hists_cumulate.c | 144 rb_erase(&he->rb_node_in, root_in); in del_hist_entries()
|
D | hists_output.c | 110 rb_erase(&he->rb_node_in, root_in); in del_hist_entries()
|
/Linux-v4.19/tools/perf/ |
D | builtin-diff.c | 442 struct hist_entry *he = rb_entry(next, struct hist_entry, rb_node_in); in hists__baseline_only() 444 next = rb_next(&he->rb_node_in); in hists__baseline_only() 446 rb_erase(&he->rb_node_in, root); in hists__baseline_only() 468 he = rb_entry(next, struct hist_entry, rb_node_in); in hists__precompute() 469 next = rb_next(&he->rb_node_in); in hists__precompute()
|