Lines Matching full:new

15 	struct label *new;  in add_label()  local
18 for_each_label_withdel(*labels, new) in add_label()
19 if (streq(new->label, label)) { in add_label()
20 new->deleted = 0; in add_label()
24 new = xmalloc(sizeof(*new)); in add_label()
25 memset(new, 0, sizeof(*new)); in add_label()
26 new->label = label; in add_label()
27 new->next = *labels; in add_label()
28 *labels = new; in add_label()
42 struct property *new = xmalloc(sizeof(*new)); in build_property() local
44 memset(new, 0, sizeof(*new)); in build_property()
46 new->name = name; in build_property()
47 new->val = val; in build_property()
48 new->srcpos = srcpos_copy(srcpos); in build_property()
50 return new; in build_property()
55 struct property *new = xmalloc(sizeof(*new)); in build_property_delete() local
57 memset(new, 0, sizeof(*new)); in build_property_delete()
59 new->name = name; in build_property_delete()
60 new->deleted = 1; in build_property_delete()
62 return new; in build_property_delete()
91 struct node *new = xmalloc(sizeof(*new)); in build_node() local
94 memset(new, 0, sizeof(*new)); in build_node()
96 new->proplist = reverse_properties(proplist); in build_node()
97 new->children = children; in build_node()
98 new->srcpos = srcpos_copy(srcpos); in build_node()
100 for_each_child(new, child) { in build_node()
101 child->parent = new; in build_node()
104 return new; in build_node()
109 struct node *new = xmalloc(sizeof(*new)); in build_node_delete() local
111 memset(new, 0, sizeof(*new)); in build_node_delete()
113 new->deleted = 1; in build_node_delete()
114 new->srcpos = srcpos_copy(srcpos); in build_node_delete()
116 return new; in build_node_delete()
150 /* Add new node labels to old node */ in merge_nodes()
154 /* Move properties from the new node to the old node. If there in merge_nodes()
155 * is a collision, replace the old value with the new */ in merge_nodes()
168 /* Look for a collision, set new value if there is */ in merge_nodes()
171 /* Add new labels to old property */ in merge_nodes()
221 /* The new node contents are now merged into the old node. Free in merge_nodes()
222 * the new node. */ in merge_nodes()
360 struct reserve_info *new = xmalloc(sizeof(*new)); in build_reserve_entry() local
362 memset(new, 0, sizeof(*new)); in build_reserve_entry()
364 new->address = address; in build_reserve_entry()
365 new->size = size; in build_reserve_entry()
367 return new; in build_reserve_entry()
380 struct reserve_info *new) in add_reserve_entry() argument
384 new->next = NULL; in add_reserve_entry()
387 return new; in add_reserve_entry()
392 last->next = new; in add_reserve_entry()
956 struct node *wn, *nwn; /* local fixup node, walk node, new */ in add_local_fixup_entry()