173 	struct callchain_node *new;  in create_child()  local
175 	new = zalloc(sizeof(*new));  in create_child()
176 	if (!new) {  in create_child()
180 	new->parent = parent;  in create_child()
181 	INIT_LIST_HEAD(&new->children);  in create_child()
182 	INIT_LIST_HEAD(&new->val);  in create_child()
187 		list_splice(&parent->children, &new->children);  in create_child()
190 		chain_for_each_child(next, new)  in create_child()
191 			next->parent = new;  in create_child()
193 	list_add_tail(&new->siblings, &parent->children);  in create_child()
195 	return new;  in create_child()
236 	struct callchain_node *new;  in add_child()  local
238 	new = create_child(parent, false);  in add_child()
239 	fill_node(new, cursor);  in add_child()
241 	new->children_hit = 0;  in add_child()
242 	new->hit = period;  in add_child()
256 	struct callchain_node *new;  in split_add_child()  local
261 	new = create_child(parent, true);  in split_add_child()
266 	new->val.next = &to_split->list;  in split_add_child()
267 	new->val.prev = old_tail;  in split_add_child()
268 	to_split->list.prev = &new->val;  in split_add_child()
269 	old_tail->next = &new->val;  in split_add_child()
272 	new->hit = parent->hit;  in split_add_child()
273 	new->children_hit = parent->children_hit;  in split_add_child()
274 	parent->children_hit = callchain_cumul_hits(new);  in split_add_child()
275 	new->val_nr = parent->val_nr - idx_local;  in split_add_child()