Lines Matching defs:root
379 rb_insert_callchain(struct rb_root *root, struct callchain_node *chain,
382 struct rb_node **p = &root->rb_node;
416 rb_insert_color(&chain->rb_node, root);
443 sort_chain_flat(struct rb_root *rb_root, struct callchain_root *root,
447 __sort_chain_flat(rb_root, &root->node, min_hit);
871 append_chain(struct callchain_node *root,
876 append_chain_children(struct callchain_node *root,
882 struct rb_node **p = &root->rb_root_in.rb_node;
909 rnode = add_child(root, cursor, period);
914 rb_insert_color(&rnode->rb_node_in, &root->rb_root_in);
917 root->children_hit += period;
918 root->children_count++;
923 append_chain(struct callchain_node *root,
939 list_for_each_entry(cnode, &root->val, list) {
964 if (matches < root->val_nr) {
965 if (split_add_child(root, cursor, cnode, start, matches,
973 if (matches == root->val_nr && cursor->pos == cursor->nr) {
974 root->hit += period;
975 root->count++;
980 if (append_chain_children(root, cursor, period) < 0)
986 int callchain_append(struct callchain_root *root,
998 if (append_chain_children(&root->node, cursor, period) < 0)
1001 if (cursor->nr > root->max_depth)
1002 root->max_depth = cursor->nr;
1302 int callchain_branch_counts(struct callchain_root *root,
1318 return callchain_node_branch_counts_cumul(&root->node,
1500 void free_callchain(struct callchain_root *root)
1505 free_callchain_node(&root->node);
1528 void decay_callchain(struct callchain_root *root)
1533 decay_callchain_node(&root->node);
1742 struct rb_root *root = &he->sorted_chain;
1743 struct rb_node *rb_node = rb_first(root);