Lines Matching defs:root
1475 struct rb_root_cached *root,
1480 struct rb_node **p = &root->rb_root.rb_node;
1542 rb_insert_color_cached(&new->rb_node_in, root, leftmost);
1547 struct rb_root_cached *root,
1562 new_he = hierarchy_insert_entry(hists, root, he, parent, &node->hpp);
1568 root = &new_he->hroot_in;
1599 struct rb_root_cached *root,
1602 struct rb_node **p = &root->rb_root.rb_node;
1609 return hists__hierarchy_insert_entry(hists, root, he);
1649 rb_insert_color_cached(&he->rb_node_in, root, leftmost);
1655 struct rb_root_cached *root;
1659 root = hists->entries_in;
1665 return root;
1678 struct rb_root_cached *root;
1688 root = hists__get_rotate_entries_in(hists);
1690 next = rb_first_cached(root);
1698 rb_erase_cached(&n->rb_node_in, root);
1789 static void hierarchy_insert_output_entry(struct rb_root_cached *root,
1792 struct rb_node **p = &root->rb_root.rb_node;
1811 rb_insert_color_cached(&he->rb_node, root, leftmost);
1924 struct rb_root_cached *root;
1950 root = &hists->entries_collapsed;
1952 root = hists->entries_in;
1954 next = rb_first_cached(root);
2199 static void resort_filtered_entry(struct rb_root_cached *root,
2202 struct rb_node **p = &root->rb_root.rb_node;
2222 rb_insert_color_cached(&he->rb_node, root, leftmost);
2378 struct rb_root_cached *root;
2386 root = &hists->entries_collapsed;
2388 root = hists->entries_in;
2390 p = &root->rb_root.rb_node;
2416 rb_insert_color_cached(&he->rb_node_in, root, leftmost);
2425 struct rb_root_cached *root,
2434 p = &root->rb_root.rb_node;
2460 rb_insert_color_cached(&he->rb_node_in, root, leftmost);
2496 static struct hist_entry *hists__find_hierarchy_entry(struct rb_root_cached *root,
2499 struct rb_node *n = root->rb_root.rb_node;
2546 struct rb_root_cached *root;
2557 root = &leader->entries_collapsed;
2559 root = leader->entries_in;
2561 for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {
2621 struct rb_root_cached *root;
2633 root = &other->entries_collapsed;
2635 root = other->entries_in;
2637 for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {
2653 struct rb_root_cached *root;
2658 root = &hists->entries_collapsed;
2660 root = hists->entries_in;
2662 for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {
2860 static void hists__delete_remaining_entries(struct rb_root_cached *root)
2865 while (!RB_EMPTY_ROOT(&root->rb_root)) {
2866 node = rb_first_cached(root);
2867 rb_erase_cached(node, root);