Lines Matching refs:new
521 struct callchain_node *new; in create_child() local
523 new = zalloc(sizeof(*new)); in create_child()
524 if (!new) { in create_child()
528 new->parent = parent; in create_child()
529 INIT_LIST_HEAD(&new->val); in create_child()
530 INIT_LIST_HEAD(&new->parent_val); in create_child()
536 new->rb_root_in = parent->rb_root_in; in create_child()
539 n = rb_first(&new->rb_root_in); in create_child()
542 child->parent = new; in create_child()
547 rb_link_node(&new->rb_node_in, NULL, &parent->rb_root_in.rb_node); in create_child()
548 rb_insert_color(&new->rb_node_in, &parent->rb_root_in); in create_child()
551 return new; in create_child()
626 struct callchain_node *new; in add_child() local
628 new = create_child(parent, false); in add_child()
629 if (new == NULL) in add_child()
632 if (fill_node(new, cursor) < 0) { in add_child()
635 list_for_each_entry_safe(call, tmp, &new->val, list) { in add_child()
640 free(new); in add_child()
644 new->children_hit = 0; in add_child()
645 new->hit = period; in add_child()
646 new->children_count = 0; in add_child()
647 new->count = 1; in add_child()
648 return new; in add_child()
768 struct callchain_node *new; in split_add_child() local
773 new = create_child(parent, true); in split_add_child()
774 if (new == NULL) in split_add_child()
780 new->val.next = &to_split->list; in split_add_child()
781 new->val.prev = old_tail; in split_add_child()
782 to_split->list.prev = &new->val; in split_add_child()
783 old_tail->next = &new->val; in split_add_child()
786 new->hit = parent->hit; in split_add_child()
787 new->children_hit = parent->children_hit; in split_add_child()
788 parent->children_hit = callchain_cumul_hits(new); in split_add_child()
789 new->val_nr = parent->val_nr - idx_local; in split_add_child()
791 new->count = parent->count; in split_add_child()
792 new->children_count = parent->children_count; in split_add_child()
793 parent->children_count = callchain_cumul_counts(new); in split_add_child()
808 new = add_child(parent, cursor, period); in split_add_child()
809 if (new == NULL) in split_add_child()
826 rb_link_node(&new->rb_node_in, p, pp); in split_add_child()
827 rb_insert_color(&new->rb_node_in, &parent->rb_root_in); in split_add_child()
1490 struct callchain_list *chain, *new; in callchain_node__make_parent_list() local
1495 new = malloc(sizeof(*new)); in callchain_node__make_parent_list()
1496 if (new == NULL) in callchain_node__make_parent_list()
1498 *new = *chain; in callchain_node__make_parent_list()
1499 new->has_children = false; in callchain_node__make_parent_list()
1500 map__get(new->ms.map); in callchain_node__make_parent_list()
1501 list_add_tail(&new->list, &head); in callchain_node__make_parent_list()
1506 list_for_each_entry_safe_reverse(chain, new, &head, list) in callchain_node__make_parent_list()
1519 list_for_each_entry_safe(chain, new, &head, list) { in callchain_node__make_parent_list()