Lines Matching defs:child
24 #define chain_for_each_child(child, parent) \
25 list_for_each_entry(child, &parent->children, siblings)
27 #define chain_for_each_child_safe(child, next, parent) \
28 list_for_each_entry_safe(child, next, &parent->children, siblings)
74 struct callchain_node *child;
76 chain_for_each_child(child, node)
77 __sort_chain_flat(rb_root, child, min_hit);
97 struct callchain_node *child;
101 chain_for_each_child(child, node) {
102 __sort_chain_graph_abs(child, min_hit);
103 if (callchain_cumul_hits(child) >= min_hit)
104 rb_insert_callchain(&node->rb_root, child,
120 struct callchain_node *child;
126 chain_for_each_child(child, node) {
127 __sort_chain_graph_rel(child, min_percent);
128 if (callchain_cumul_hits(child) >= min_hit)
129 rb_insert_callchain(&node->rb_root, child,
162 * Create a child for a parent. If inherit_children, then the new child
172 perror("not enough memory to create child for code path tree");
241 * Split the parent in two parts (a new child is created) and
242 * give a part of its callchain to the created child.
243 * Then create another child to host the given callchain of new branch
258 /* split the callchain and move a part to the new child */
273 /* create a new child for the new branch if any */
398 struct callchain_node *child, *next_child;
415 chain_for_each_child_safe(child, next_child, src) {
416 err = merge_chain_branch(cursor, dst, child);
420 list_del(&child->siblings);
421 free(child);
