Lines Matching refs:new
163 * Create a child for a parent. If inherit_children, then the new child
164 * will become the new parent of it's parent children
169 struct callchain_node *new;
171 new = zalloc(sizeof(*new));
172 if (!new) {
176 new->parent = parent;
177 INIT_LIST_HEAD(&new->children);
178 INIT_LIST_HEAD(&new->val);
183 list_splice(&parent->children, &new->children);
186 chain_for_each_child(next, new)
187 next->parent = new;
189 list_add_tail(&new->brothers, &parent->children);
191 return new;
235 struct callchain_node *new;
237 new = create_child(parent, false);
238 fill_node(new, chain, start);
240 new->children_hit = 0;
241 new->hit = period;
245 * Split the parent in two parts (a new child is created) and
247 * Then create another child to host the given callchain of new branch
254 struct callchain_node *new;
259 new = create_child(parent, true);
261 /* split the callchain and move a part to the new child */
264 new->val.next = &to_split->list;
265 new->val.prev = old_tail;
266 to_split->list.prev = &new->val;
267 old_tail->next = &new->val;
270 new->hit = parent->hit;
271 new->children_hit = parent->children_hit;
272 parent->children_hit = cumul_hits(new);
273 new->val_nr = parent->val_nr - idx_local;
276 /* create a new child for the new branch if any */
347 /* we match only a part of the node. Split it and add the new chain */
365 static void filter_context(struct ip_callchain *old, struct resolved_chain *new,
374 new->ips[j].ip = old->ips[i];
375 new->ips[j].ms = syms[i];
379 new->nr = j;