Lines Matching full:child

29 #define chain_for_each_child(child, parent)	\  argument
30 list_for_each_entry(child, &parent->children, siblings)
32 #define chain_for_each_child_safe(child, next, parent) \ argument
33 list_for_each_entry_safe(child, next, &parent->children, siblings)
79 struct callchain_node *child; in __sort_chain_flat() local
81 chain_for_each_child(child, node) in __sort_chain_flat()
82 __sort_chain_flat(rb_root, child, min_hit); in __sort_chain_flat()
102 struct callchain_node *child; in __sort_chain_graph_abs() local
106 chain_for_each_child(child, node) { in __sort_chain_graph_abs()
107 __sort_chain_graph_abs(child, min_hit); in __sort_chain_graph_abs()
108 if (callchain_cumul_hits(child) >= min_hit) in __sort_chain_graph_abs()
109 rb_insert_callchain(&node->rb_root, child, in __sort_chain_graph_abs()
125 struct callchain_node *child; in __sort_chain_graph_rel() local
131 chain_for_each_child(child, node) { in __sort_chain_graph_rel()
132 __sort_chain_graph_rel(child, min_percent); in __sort_chain_graph_rel()
133 if (callchain_cumul_hits(child) >= min_hit) in __sort_chain_graph_rel()
134 rb_insert_callchain(&node->rb_root, child, in __sort_chain_graph_rel()
167 * Create a child for a parent. If inherit_children, then the new child
177 perror("not enough memory to create child for code path tree"); in create_child()
246 * Split the parent in two parts (a new child is created) and
247 * give a part of its callchain to the created child.
248 * Then create another child to host the given callchain of new branch
263 /* split the callchain and move a part to the new child */ in split_add_child()
278 /* create a new child for the new branch if any */ in split_add_child()
401 struct callchain_node *child, *next_child; in merge_chain_branch() local
418 chain_for_each_child_safe(child, next_child, src) { in merge_chain_branch()
419 err = merge_chain_branch(cursor, dst, child); in merge_chain_branch()
423 list_del(&child->siblings); in merge_chain_branch()
424 free(child); in merge_chain_branch()