Home
last modified time | relevance | path

Searched refs:new_node (Results 1 – 2 of 2) sorted by relevance

/scripts/dtc/
A Dlivetree.c151 struct node *merge_nodes(struct node *old_node, struct node *new_node) in merge_nodes() argument
160 for_each_label_withdel(new_node->labels, l) in merge_nodes()
165 while (new_node->proplist) { in merge_nodes()
167 new_prop = new_node->proplist; in merge_nodes()
168 new_node->proplist = new_prop->next; in merge_nodes()
199 while (new_node->children) { in merge_nodes()
201 new_child = new_node->children; in merge_nodes()
202 new_node->children = new_child->next_sibling; in merge_nodes()
228 free(new_node); in merge_nodes()
254 name_node(new_node, "__overlay__"); in add_orphan_node()
[all …]
A Ddtc.h208 struct node *merge_nodes(struct node *old_node, struct node *new_node);
209 struct node *add_orphan_node(struct node *old_node, struct node *new_node, char *ref);

Completed in 5 milliseconds