Lines Matching refs:rb_node
249 struct rb_node *next = rb_first_cached(&hists->entries); in hists__output_recalc_col_len()
256 n = rb_entry(next, struct hist_entry, rb_node); in hists__output_recalc_col_len()
259 next = rb_next(&n->rb_node); in hists__output_recalc_col_len()
340 struct rb_node *node = rb_first_cached(&he->hroot_out); in hists__decay_entry()
342 child = rb_entry(node, struct hist_entry, rb_node); in hists__decay_entry()
370 rb_erase_cached(&he->rb_node, root_out); in hists__delete_entry()
381 struct rb_node *next = rb_first_cached(&hists->entries); in hists__decay_entries()
385 n = rb_entry(next, struct hist_entry, rb_node); in hists__decay_entries()
386 next = rb_next(&n->rb_node); in hists__decay_entries()
397 struct rb_node *next = rb_first_cached(&hists->entries); in hists__delete_entries()
401 n = rb_entry(next, struct hist_entry, rb_node); in hists__delete_entries()
402 next = rb_next(&n->rb_node); in hists__delete_entries()
410 struct rb_node *next = rb_first_cached(&hists->entries); in hists__get_entry()
415 n = rb_entry(next, struct hist_entry, rb_node); in hists__get_entry()
419 next = rb_next(&n->rb_node); in hists__get_entry()
588 struct rb_node **p; in hists__findnew_entry()
589 struct rb_node *parent = NULL; in hists__findnew_entry()
595 p = &hists->entries_in->rb_root.rb_node; in hists__findnew_entry()
1453 struct rb_node **p = &root->rb_root.rb_node; in hierarchy_insert_entry()
1454 struct rb_node *parent = NULL; in hierarchy_insert_entry()
1570 struct rb_node **p = &root->rb_root.rb_node; in hists__collapse_insert_entry()
1571 struct rb_node *parent = NULL; in hists__collapse_insert_entry()
1643 struct rb_node *next; in hists__collapse_resort()
1730 struct rb_node *node; in hierarchy_recalc_total_periods()
1744 he = rb_entry(node, struct hist_entry, rb_node); in hierarchy_recalc_total_periods()
1756 struct rb_node **p = &root->rb_root.rb_node; in hierarchy_insert_output_entry()
1757 struct rb_node *parent = NULL; in hierarchy_insert_output_entry()
1764 iter = rb_entry(parent, struct hist_entry, rb_node); in hierarchy_insert_output_entry()
1774 rb_link_node(&he->rb_node, parent, p); in hierarchy_insert_output_entry()
1775 rb_insert_color_cached(&he->rb_node, root, leftmost); in hierarchy_insert_output_entry()
1791 struct rb_node *node; in hists__hierarchy_output_resort()
1843 struct rb_node **p = &entries->rb_root.rb_node; in __hists__insert_output_entry()
1844 struct rb_node *parent = NULL; in __hists__insert_output_entry()
1864 iter = rb_entry(parent, struct hist_entry, rb_node); in __hists__insert_output_entry()
1874 rb_link_node(&he->rb_node, parent, p); in __hists__insert_output_entry()
1875 rb_insert_color_cached(&he->rb_node, entries, leftmost); in __hists__insert_output_entry()
1889 struct rb_node *next; in output_resort()
1981 struct rb_node *rb_hierarchy_last(struct rb_node *node) in rb_hierarchy_last()
1983 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
1987 he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_last()
1992 struct rb_node *__rb_hierarchy_next(struct rb_node *node, enum hierarchy_move_dir hmd) in __rb_hierarchy_next()
1994 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in __rb_hierarchy_next()
2006 node = rb_next(&he->rb_node); in __rb_hierarchy_next()
2011 struct rb_node *rb_hierarchy_prev(struct rb_node *node) in rb_hierarchy_prev()
2013 struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); in rb_hierarchy_prev()
2023 return &he->rb_node; in rb_hierarchy_prev()
2028 struct rb_node *node; in hist_entry__has_hierarchy_children()
2036 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
2040 child = rb_entry(node, struct hist_entry, rb_node); in hist_entry__has_hierarchy_children()
2146 struct rb_node *nd; in hists__filter_by_type()
2154 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_by_type()
2166 struct rb_node **p = &root->rb_root.rb_node; in resort_filtered_entry()
2167 struct rb_node *parent = NULL; in resort_filtered_entry()
2170 struct rb_node *nd; in resort_filtered_entry()
2175 iter = rb_entry(parent, struct hist_entry, rb_node); in resort_filtered_entry()
2185 rb_link_node(&he->rb_node, parent, p); in resort_filtered_entry()
2186 rb_insert_color_cached(&he->rb_node, root, leftmost); in resort_filtered_entry()
2193 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in resort_filtered_entry()
2196 rb_erase_cached(&h->rb_node, &he->hroot_out); in resort_filtered_entry()
2206 struct rb_node *nd; in hists__filter_hierarchy()
2216 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2229 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_CHILD); in hists__filter_hierarchy()
2238 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING); in hists__filter_hierarchy()
2248 nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING); in hists__filter_hierarchy()
2260 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_hierarchy()
2263 rb_erase_cached(&h->rb_node, &hists->entries); in hists__filter_hierarchy()
2338 struct rb_node **p; in hists__add_dummy_entry()
2339 struct rb_node *parent = NULL; in hists__add_dummy_entry()
2349 p = &root->rb_root.rb_node; in hists__add_dummy_entry()
2387 struct rb_node **p; in add_dummy_hierarchy_entry()
2388 struct rb_node *parent = NULL; in add_dummy_hierarchy_entry()
2393 p = &root->rb_root.rb_node; in add_dummy_hierarchy_entry()
2433 struct rb_node *n; in hists__find_entry()
2436 n = hists->entries_collapsed.rb_root.rb_node; in hists__find_entry()
2438 n = hists->entries_in->rb_root.rb_node; in hists__find_entry()
2458 struct rb_node *n = root->rb_root.rb_node; in hists__find_hierarchy_entry()
2486 struct rb_node *nd; in hists__match_hierarchy()
2506 struct rb_node *nd; in hists__match()
2534 struct rb_node *nd; in hists__link_hierarchy()
2581 struct rb_node *nd; in hists__link()
2613 struct rb_node *nd; in hists__unlink()
2817 struct rb_node *node; in hists__delete_remaining_entries()