Searched refs:rb_node_in (Results 1 – 9 of 9) sorted by relevance
| /tools/perf/util/ |
| D | callchain.c | 275 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_flat()
307 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_abs()
337 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_rel()
402 child = rb_entry(n, struct callchain_node, rb_node_in); in create_child()
408 rb_link_node(&new->rb_node_in, NULL, &parent->rb_root_in.rb_node); in create_child()
409 rb_insert_color(&new->rb_node_in, &parent->rb_root_in); in create_child()
567 first = rb_entry(p, struct callchain_node, rb_node_in); in split_add_child()
576 rb_link_node(&new->rb_node_in, p, pp); in split_add_child()
577 rb_insert_color(&new->rb_node_in, &parent->rb_root_in); in split_add_child()
609 rnode = rb_entry(parent, struct callchain_node, rb_node_in); in append_chain_children()
[all …]
|
| D | hist.c | 315 rb_erase(&he->rb_node_in, root_in); in hists__delete_entry()
506 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry()
557 rb_link_node(&he->rb_node_in, parent, p); in hists__findnew_entry()
558 rb_insert_color(&he->rb_node_in, hists->entries_in); in hists__findnew_entry()
1275 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hierarchy_insert_entry()
1325 rb_link_node(&new->rb_node_in, parent, p); in hierarchy_insert_entry()
1326 rb_insert_color(&new->rb_node_in, root); in hierarchy_insert_entry()
1390 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hists__collapse_insert_entry()
1419 rb_link_node(&he->rb_node_in, parent, p); in hists__collapse_insert_entry()
1420 rb_insert_color(&he->rb_node_in, root); in hists__collapse_insert_entry()
[all …]
|
| D | sort.h | 83 struct rb_node rb_node_in; member
|
| D | callchain.h | 57 struct rb_node rb_node_in; /* to insert nodes in an rbtree */ member
|
| /tools/perf/tests/ |
| D | hists_link.c | 157 he = rb_entry(node, struct hist_entry, rb_node_in); in __validate_match()
209 he = rb_entry(node, struct hist_entry, rb_node_in); in __validate_link()
|
| D | hists_common.c | 174 he = rb_entry(node, struct hist_entry, rb_node_in); in print_hists_in()
|
| D | hists_cumulate.c | 141 rb_erase(&he->rb_node_in, root_in); in del_hist_entries()
|
| D | hists_output.c | 107 rb_erase(&he->rb_node_in, root_in); in del_hist_entries()
|
| /tools/perf/ |
| D | builtin-diff.c | 428 struct hist_entry *he = rb_entry(next, struct hist_entry, rb_node_in); in hists__baseline_only()
430 next = rb_next(&he->rb_node_in); in hists__baseline_only()
432 rb_erase(&he->rb_node_in, root); in hists__baseline_only()
454 he = rb_entry(next, struct hist_entry, rb_node_in); in hists__precompute()
455 next = rb_next(&he->rb_node_in); in hists__precompute()
|