scsi_reset_notify.c revision 7c478bd95313f5f23a4c958a745db2134aa03244
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright (c) 1998 by Sun Microsystems, Inc.
* All rights reserved.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/*
* support functions for hba drivers to handle scsi reset notifications.
*/
/*
* routine for reset notification setup.
* The function is entered without adapter driver mutex being held.
*/
int
struct scsi_reset_notify_entry **listp)
{
struct scsi_reset_notify_entry *p, *beforep;
int rval = DDI_FAILURE;
p = *listp;
while (p) {
break; /* An entry exist for this target */
beforep = p;
p = p->next;
}
} else {
}
kmem_free(p, sizeof (struct scsi_reset_notify_entry));
rval = DDI_SUCCESS;
p = kmem_zalloc(sizeof (struct scsi_reset_notify_entry),
KM_SLEEP);
*listp = p;
rval = DDI_SUCCESS;
}
return (rval);
}
/*
* routine to deallocate the callback list
*/
void
{
struct scsi_reset_notify_entry *p, *next;
p = listp;
while (p) {
kmem_free(p, sizeof (struct scsi_reset_notify_entry));
p = next;
}
}
/*
* routine to perform the notification callbacks after a reset.
* The function is entered with adapter driver mutex being held.
*/
void
struct scsi_reset_notify_entry **listp)
{
int i, count;
struct scsi_reset_notify_entry *p;
struct notify_entry {
} *list;
return;
count = 0;
while (p != NULL) {
count++;
p = p->next;
}
return;
}
}
for (i = 0; i < count; i++) {
}
}