Home
last modified time | relevance | path

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

/scripts/dtc/
A Dlivetree.c202 new_node->children = new_child->next_sibling; in merge_nodes()
204 new_child->next_sibling = NULL; in merge_nodes()
264 assert(first->next_sibling == NULL); in chain_node()
266 first->next_sibling = list; in chain_node()
306 child->next_sibling = NULL; in add_child()
311 p = &((*p)->next_sibling); in add_child()
325 node = node->next_sibling; in delete_node_by_name()
789 tbl[i]->next_sibling = tbl[i+1]; in sort_subnodes()
790 tbl[n-1]->next_sibling = NULL; in sort_subnodes()
A Ddtc.h159 struct node *next_sibling; member
188 for ((c) = (n)->children; (c); (c) = (c)->next_sibling)
A Dchecks.c253 for (child2 = child->next_sibling; in check_duplicate_node_names()
255 child2 = child2->next_sibling) in check_duplicate_node_names()

Completed in 13 milliseconds