299 	struct callchain_node *child;  in __sort_chain_flat()  local
303 		child = rb_entry(n, struct callchain_node, rb_node_in);  in __sort_chain_flat()
306 		__sort_chain_flat(rb_root, child, min_hit);  in __sort_chain_flat()
328 	struct callchain_node *child;  in __sort_chain_graph_abs()  local
334 		child = rb_entry(n, struct callchain_node, rb_node_in);  in __sort_chain_graph_abs()
337 		__sort_chain_graph_abs(child, min_hit);  in __sort_chain_graph_abs()
338 		if (callchain_cumul_hits(child) >= min_hit)  in __sort_chain_graph_abs()
339 			rb_insert_callchain(&node->rb_root, child,  in __sort_chain_graph_abs()
356 	struct callchain_node *child;  in __sort_chain_graph_rel()  local
364 		child = rb_entry(n, struct callchain_node, rb_node_in);  in __sort_chain_graph_rel()
367 		__sort_chain_graph_rel(child, min_percent);  in __sort_chain_graph_rel()
368 		if (callchain_cumul_hits(child) >= min_hit)  in __sort_chain_graph_rel()
369 			rb_insert_callchain(&node->rb_root, child,  in __sort_chain_graph_rel()
420 		struct callchain_node *child;  in create_child()  local
427 			child = rb_entry(n, struct callchain_node, rb_node_in);  in create_child()
428 			child->parent = new;  in create_child()
693 	struct callchain_node *child;  in merge_chain_branch()  local
713 		child = container_of(n, struct callchain_node, rb_node_in);  in merge_chain_branch()
715 		rb_erase(&child->rb_node_in, &src->rb_root_in);  in merge_chain_branch()
717 		err = merge_chain_branch(cursor, dst, child);  in merge_chain_branch()
721 		free(child);  in merge_chain_branch()
856 	struct callchain_node *child;  in free_callchain_node()  local
866 		child = container_of(n, struct callchain_node, rb_node_in);  in free_callchain_node()
868 		rb_erase(&child->rb_node_in, &node->rb_root_in);  in free_callchain_node()
870 		free_callchain_node(child);  in free_callchain_node()
871 		free(child);  in free_callchain_node()