Lines Matching refs:rb_node
265 struct rb_node *next = rb_first_cached(&hists->entries); in hists__output_recalc_col_len()
272 n = rb_entry(next, struct hist_entry, rb_node); in hists__output_recalc_col_len()
275 next = rb_next(&n->rb_node); in hists__output_recalc_col_len()
432 struct rb_node *node = rb_first_cached(&he->hroot_out); in hists__decay_entry()
434 child = rb_entry(node, struct hist_entry, rb_node); in hists__decay_entry()
462 rb_erase_cached(&he->rb_node, root_out); in hists__delete_entry()
473 struct rb_node *next = rb_first_cached(&hists->entries); in hists__decay_entries()
477 n = rb_entry(next, struct hist_entry, rb_node); in hists__decay_entries()
478 next = rb_next(&n->rb_node); in hists__decay_entries()
489 struct rb_node *next = rb_first_cached(&hists->entries); in hists__delete_entries()
493 n = rb_entry(next, struct hist_entry, rb_node); in hists__delete_entries()
494 next = rb_next(&n->rb_node); in hists__delete_entries()
502 struct rb_node *next = rb_first_cached(&hists->entries); in hists__get_entry()
507 n = rb_entry(next, struct hist_entry, rb_node); in hists__get_entry()
511 next = rb_next(&n->rb_node); in hists__get_entry()
686 struct rb_node **p; in hists__findnew_entry()
687 struct rb_node *parent = NULL; in hists__findnew_entry()
694 p = &hists->entries_in->rb_root.rb_node; in hists__findnew_entry()
1460 rbtree_postorder_for_each_entry_safe(child, tmp, root, rb_node) in hist_entry__delete()
1631 struct rb_node **p = &root->rb_root.rb_node; in hierarchy_insert_entry()
1632 struct rb_node *parent = NULL; in hierarchy_insert_entry()
1752 struct rb_node **p = &root->rb_root.rb_node; in hists__collapse_insert_entry()
1753 struct rb_node *parent = NULL; in hists__collapse_insert_entry()
1831 struct rb_node *next; in hists__collapse_resort()
1904 struct rb_node *node; in hierarchy_recalc_total_periods()
1920 he = rb_entry(node, struct hist_entry, rb_node); in hierarchy_recalc_total_periods()
1935 struct rb_node **p = &root->rb_root.rb_node; in hierarchy_insert_output_entry()
1936 struct rb_node *parent = NULL; in hierarchy_insert_output_entry()
1943 iter = rb_entry(parent, struct hist_entry, rb_node); in hierarchy_insert_output_entry()
1953 rb_link_node(&he->rb_node, parent, p); in hierarchy_insert_output_entry()
1954 rb_insert_color_cached(&he->rb_node, root, leftmost); in hierarchy_insert_output_entry()
1970 struct rb_node *node; in hists__hierarchy_output_resort()
2022 struct rb_node **p = &entries->rb_root.rb_node; in __hists__insert_output_entry()
2023 struct rb_node *parent = NULL; in __hists__insert_output_entry()
2043 iter = rb_entry(parent, struct hist_entry, rb_node); in __hists__insert_output_entry()
2053 rb_link_node(&he->rb_node, parent, p); in __hists__insert_output_entry()
2054 rb_insert_color_cached(&he->rb_node, entries, leftmost); in __hists__insert_output_entry()
2068 struct rb_node *next; in output_resort()
2160 struct rb_node *rb_hierarchy_last(struct rb_node *node) in rb_hierarchy_last()
2162 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
2166 he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
2171 struct rb_node *__rb_hierarchy_next(struct rb_node *node, enum hierarchy_move_dir hmd) in __rb_hierarchy_next()
2173 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in __rb_hierarchy_next()
2185 node = rb_next(&he->rb_node); in __rb_hierarchy_next()
2190 struct rb_node *rb_hierarchy_prev(struct rb_node *node) in rb_hierarchy_prev()
2192 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_prev()
2202 return &he->rb_node; in rb_hierarchy_prev()
2207 struct rb_node *node; in hist_entry__has_hierarchy_children()
2215 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
2219 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
2335 struct rb_node *nd; in hists__filter_by_type()
2343 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_by_type()
2355 struct rb_node **p = &root->rb_root.rb_node; in resort_filtered_entry()
2356 struct rb_node *parent = NULL; in resort_filtered_entry()
2359 struct rb_node *nd; in resort_filtered_entry()
2364 iter = rb_entry(parent, struct hist_entry, rb_node); in resort_filtered_entry()
2374 rb_link_node(&he->rb_node, parent, p); in resort_filtered_entry()
2375 rb_insert_color_cached(&he->rb_node, root, leftmost); in resort_filtered_entry()
2382 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in resort_filtered_entry()
2385 rb_erase_cached(&h->rb_node, &he->hroot_out); in resort_filtered_entry()
2395 struct rb_node *nd; in hists__filter_hierarchy()
2405 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2418 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_CHILD); in hists__filter_hierarchy()
2427 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING); in hists__filter_hierarchy()
2437 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING); in hists__filter_hierarchy()
2449 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2452 rb_erase_cached(&h->rb_node, &hists->entries); in hists__filter_hierarchy()
2547 struct rb_node **p; in hists__add_dummy_entry()
2548 struct rb_node *parent = NULL; in hists__add_dummy_entry()
2558 p = &root->rb_root.rb_node; in hists__add_dummy_entry()
2596 struct rb_node **p; in add_dummy_hierarchy_entry()
2597 struct rb_node *parent = NULL; in add_dummy_hierarchy_entry()
2601 p = &root->rb_root.rb_node; in add_dummy_hierarchy_entry()
2636 struct rb_node *n; in hists__find_entry()
2639 n = hists->entries_collapsed.rb_root.rb_node; in hists__find_entry()
2641 n = hists->entries_in->rb_root.rb_node; in hists__find_entry()
2661 struct rb_node *n = root->rb_root.rb_node; in hists__find_hierarchy_entry()
2683 struct rb_node *nd; in hists__match_hierarchy()
2703 struct rb_node *nd; in hists__match()
2731 struct rb_node *nd; in hists__link_hierarchy()
2778 struct rb_node *nd; in hists__link()
2810 struct rb_node *nd; in hists__unlink()
3030 struct rb_node *node; in hists__delete_remaining_entries()