Lines Matching defs:parent
326 DPRINTF((DI_TRACE, "Get parent of node %s\n", di_node_name(node)));
330 if (DI_NODE(node)->parent) {
331 return (DI_NODE(pa + DI_NODE(node)->parent));
336 * If parent doesn't exist and node is not the root,
540 * returns 1 if node is a descendant of parent, 0 otherwise
543 is_descendant(di_node_t node, di_node_t parent)
546 * DI_NODE_NIL is parent of root, so it is
547 * the parent of all nodes.
549 if (parent == DI_NODE_NIL) {
555 } while ((node != DI_NODE_NIL) && (node != parent));
561 * Insert list before the first node which is NOT a descendent of parent.
566 di_node_t parent)
579 if (!is_descendant(tmp->node, parent)) {
587 while (tmp->next && is_descendant(tmp->next->node, parent)) {
642 di_node_t parent, curr_par, curr_gpar;
646 * get handle to parent of first node
648 if ((parent = di_parent_node((*headp)->node)) == DI_NODE_NIL) {
669 * Hence, we compare parent with BOTH the parent and grandparent
676 ((curr_par == parent) || ((curr_gpar =
678 (curr_gpar == parent))) {
680 * match parent/grandparent: delete curr
706 di_node_t parent = di_parent_node((*headp)->node);
761 insert_node_list(headp, children, parent);
1074 di_node_t parent;
1086 while ((parent = di_parent_node(node)) != DI_NODE_NIL) {
1093 node = parent;
2085 * If parent doesn't exist and node is not the root,
2116 * If parent doesn't exist and node is not the root,