Home
last modified time | relevance | path

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

/linux-3.4.99/scripts/dtc/
Dlivetree.c145 new_node->children = new_child->next_sibling; in merge_nodes()
147 new_child->next_sibling = NULL; in merge_nodes()
172 assert(first->next_sibling == NULL); in chain_node()
174 first->next_sibling = list; in chain_node()
195 child->next_sibling = NULL; in add_child()
200 p = &((*p)->next_sibling); in add_child()
589 tbl[i]->next_sibling = tbl[i+1]; in sort_subnodes()
590 tbl[n-1]->next_sibling = NULL; in sort_subnodes()
Ddtc.h148 struct node *next_sibling; member
166 for ((c) = (n)->children; (c); (c) = (c)->next_sibling)
Dchecks.c223 for (child2 = child->next_sibling; in check_duplicate_node_names()
225 child2 = child2->next_sibling) in check_duplicate_node_names()