248 	struct callchain_node *child;  in __sort_chain_flat()  local
252 		child = rb_entry(n, struct callchain_node, rb_node_in);  in __sort_chain_flat()
255 		__sort_chain_flat(rb_root, child, min_hit);  in __sort_chain_flat()
277 	struct callchain_node *child;  in __sort_chain_graph_abs()  local
283 		child = rb_entry(n, struct callchain_node, rb_node_in);  in __sort_chain_graph_abs()
286 		__sort_chain_graph_abs(child, min_hit);  in __sort_chain_graph_abs()
287 		if (callchain_cumul_hits(child) >= min_hit)  in __sort_chain_graph_abs()
288 			rb_insert_callchain(&node->rb_root, child,  in __sort_chain_graph_abs()
305 	struct callchain_node *child;  in __sort_chain_graph_rel()  local
313 		child = rb_entry(n, struct callchain_node, rb_node_in);  in __sort_chain_graph_rel()
316 		__sort_chain_graph_rel(child, min_percent);  in __sort_chain_graph_rel()
317 		if (callchain_cumul_hits(child) >= min_hit)  in __sort_chain_graph_rel()
318 			rb_insert_callchain(&node->rb_root, child,  in __sort_chain_graph_rel()
369 		struct callchain_node *child;  in create_child()  local
376 			child = rb_entry(n, struct callchain_node, rb_node_in);  in create_child()
377 			child->parent = new;  in create_child()
642 	struct callchain_node *child;  in merge_chain_branch()  local
662 		child = container_of(n, struct callchain_node, rb_node_in);  in merge_chain_branch()
664 		rb_erase(&child->rb_node_in, &src->rb_root_in);  in merge_chain_branch()
666 		err = merge_chain_branch(cursor, dst, child);  in merge_chain_branch()
670 		free(child);  in merge_chain_branch()
805 	struct callchain_node *child;  in free_callchain_node()  local
815 		child = container_of(n, struct callchain_node, rb_node_in);  in free_callchain_node()
817 		rb_erase(&child->rb_node_in, &node->rb_root_in);  in free_callchain_node()
819 		free_callchain_node(child);  in free_callchain_node()
820 		free(child);  in free_callchain_node()