Lines Matching defs:child
607 if (dp->child) {
608 fc_remove_subtree(dp->child);
609 dp->child = NULL;
627 ASSERT((dp->child == NULL) && (dp->peer == NULL));
650 if (dp->child)
651 fc_remove_device_tree(&dp->child);
656 ASSERT((dp->child == NULL) && (dp->peer == NULL));
671 if (hp->child)
672 if ((p = fc_find_node(dip, hp->child)) != NULL)
681 fc_add_child(dev_info_t *child, dev_info_t *parent, struct fc_device_tree *hp)
686 q->dip = child;
692 p = fc_find_node(child, hp);
699 q->peer = p->child;
700 p->child = q;
706 fc_remove_child(dev_info_t *child, struct fc_device_tree *head)
709 dev_info_t *parent = ddi_get_parent(child);
717 * Find the child within the parent's subtree ...
719 c = fc_find_node(child, p);
721 ASSERT(c->child == NULL);
724 * If it's the first child, remove it, otherwise
725 * remove it from the child's peer list.
727 if (p->child == c) {
728 p->child = c->peer;
731 for (n = p->child; n->peer; n = n->peer) {
754 if (p && p->child)
755 dip = p->child->dip;