255 rb_insert_callchain(struct rb_root *root, struct callchain_node *chain,  in rb_insert_callchain()  argument
258 	struct rb_node **p = &root->rb_node;  in rb_insert_callchain()
291 	rb_insert_color(&chain->rb_node, root);  in rb_insert_callchain()
318 sort_chain_flat(struct rb_root *rb_root, struct callchain_root *root,  in sort_chain_flat()  argument
321 	__sort_chain_flat(rb_root, &root->node, min_hit);  in sort_chain_flat()
568 append_chain(struct callchain_node *root,
573 append_chain_children(struct callchain_node *root,  in append_chain_children()  argument
579 	struct rb_node **p = &root->rb_root_in.rb_node;  in append_chain_children()
604 	rnode = add_child(root, cursor, period);  in append_chain_children()
606 	rb_insert_color(&rnode->rb_node_in, &root->rb_root_in);  in append_chain_children()
609 	root->children_hit += period;  in append_chain_children()
613 append_chain(struct callchain_node *root,  in append_chain()  argument
629 	list_for_each_entry(cnode, &root->val, list) {  in append_chain()
654 	if (matches < root->val_nr) {  in append_chain()
655 		split_add_child(root, cursor, cnode, start, matches, period);  in append_chain()
660 	if (matches == root->val_nr && cursor->pos == cursor->nr) {  in append_chain()
661 		root->hit += period;  in append_chain()
666 	append_chain_children(root, cursor, period);  in append_chain()
671 int callchain_append(struct callchain_root *root,  in callchain_append()  argument
680 	append_chain_children(&root->node, cursor, period);  in callchain_append()
682 	if (cursor->nr > root->max_depth)  in callchain_append()
683 		root->max_depth = cursor->nr;  in callchain_append()
875 void free_callchain(struct callchain_root *root)  in free_callchain()  argument
880 	free_callchain_node(&root->node);  in free_callchain()