Home
last modified time | relevance | path

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

/u-boot/fs/cbfs/
A Dcbfs.c124 new_node->next = NULL; in file_cbfs_next_file()
125 new_node->type = header.type; in file_cbfs_next_file()
127 new_node->data_length = header.len; in file_cbfs_next_file()
129 new_node->name = (char *)file_header + in file_cbfs_next_file()
131 new_node->name_length = name_len; in file_cbfs_next_file()
149 struct cbfs_cachenode *new_node; in file_cbfs_fill_cache() local
167 new_node = (struct cbfs_cachenode *) in file_cbfs_fill_cache()
169 if (!new_node) in file_cbfs_fill_cache()
175 free(new_node); in file_cbfs_fill_cache()
180 *cache_tail = new_node; in file_cbfs_fill_cache()
[all …]
/u-boot/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.h210 struct node *merge_nodes(struct node *old_node, struct node *new_node);
211 struct node *add_orphan_node(struct node *old_node, struct node *new_node, char *ref);

Completed in 12 milliseconds