Lines Matching refs:parent
394 DPRINTF((DI_TRACE, "Get parent of node %s\n", di_node_name(node)));
398 if (DI_NODE(node)->parent) {
399 return (DI_NODE(pa + DI_NODE(node)->parent));
404 * If parent doesn't exist and node is not the root,
608 * returns 1 if node is a descendant of parent, 0 otherwise
611 is_descendant(di_node_t node, di_node_t parent)
614 * DI_NODE_NIL is parent of root, so it is
615 * the parent of all nodes.
617 if (parent == DI_NODE_NIL) {
623 } while ((node != DI_NODE_NIL) && (node != parent));
629 * Insert list before the first node which is NOT a descendent of parent.
634 di_node_t parent)
647 if (!is_descendant(tmp->node, parent)) {
655 while (tmp->next && is_descendant(tmp->next->node, parent)) {
710 di_node_t parent, curr_par, curr_gpar;
714 * get handle to parent of first node
716 if ((parent = di_parent_node((*headp)->node)) == DI_NODE_NIL) {
737 * Hence, we compare parent with BOTH the parent and grandparent
744 ((curr_par == parent) || ((curr_gpar =
746 (curr_gpar == parent))) {
748 * match parent/grandparent: delete curr
774 di_node_t parent = di_parent_node((*headp)->node);
829 insert_node_list(headp, children, parent);
1150 di_node_t parent;
1162 while ((parent = di_parent_node(node)) != DI_NODE_NIL) {
1169 node = parent;
2269 * If parent doesn't exist and node is not the root,
2300 * If parent doesn't exist and node is not the root,