Searched refs:next_sibling (Results 1 – 3 of 3) sorted by relevance
195 new_node->children = new_child->next_sibling; in merge_nodes()197 new_child->next_sibling = NULL; in merge_nodes()260 assert(first->next_sibling == NULL); in chain_node()262 first->next_sibling = list; in chain_node()302 child->next_sibling = NULL; in add_child()307 p = &((*p)->next_sibling); in add_child()321 node = node->next_sibling; in delete_node_by_name()761 tbl[i]->next_sibling = tbl[i+1]; in sort_subnodes()762 tbl[n-1]->next_sibling = NULL; in sort_subnodes()
188 struct node *next_sibling; member218 for ((c) = (n)->children; (c); (c) = (c)->next_sibling)
273 for (child2 = child->next_sibling; in check_duplicate_node_names()275 child2 = child2->next_sibling) in check_duplicate_node_names()