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