1*130f4520SKenneth D. Merry /*- 2*130f4520SKenneth D. Merry * Copyright (c) 2003 Silicon Graphics International Corp. 3*130f4520SKenneth D. Merry * All rights reserved. 4*130f4520SKenneth D. Merry * 5*130f4520SKenneth D. Merry * Redistribution and use in source and binary forms, with or without 6*130f4520SKenneth D. Merry * modification, are permitted provided that the following conditions 7*130f4520SKenneth D. Merry * are met: 8*130f4520SKenneth D. Merry * 1. Redistributions of source code must retain the above copyright 9*130f4520SKenneth D. Merry * notice, this list of conditions, and the following disclaimer, 10*130f4520SKenneth D. Merry * without modification. 11*130f4520SKenneth D. Merry * 2. Redistributions in binary form must reproduce at minimum a disclaimer 12*130f4520SKenneth D. Merry * substantially similar to the "NO WARRANTY" disclaimer below 13*130f4520SKenneth D. Merry * ("Disclaimer") and any redistribution must be conditioned upon 14*130f4520SKenneth D. Merry * including a substantially similar Disclaimer requirement for further 15*130f4520SKenneth D. Merry * binary redistribution. 16*130f4520SKenneth D. Merry * 17*130f4520SKenneth D. Merry * NO WARRANTY 18*130f4520SKenneth D. Merry * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 19*130f4520SKenneth D. Merry * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 20*130f4520SKenneth D. Merry * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR 21*130f4520SKenneth D. Merry * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 22*130f4520SKenneth D. Merry * HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 23*130f4520SKenneth D. Merry * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 24*130f4520SKenneth D. Merry * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 25*130f4520SKenneth D. Merry * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, 26*130f4520SKenneth D. Merry * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING 27*130f4520SKenneth D. Merry * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 28*130f4520SKenneth D. Merry * POSSIBILITY OF SUCH DAMAGES. 29*130f4520SKenneth D. Merry * 30*130f4520SKenneth D. Merry * $Id: //depot/users/kenm/FreeBSD-test2/sys/cam/ctl/ctl_backend.c#3 $ 31*130f4520SKenneth D. Merry */ 32*130f4520SKenneth D. Merry /* 33*130f4520SKenneth D. Merry * CTL backend driver registration routines 34*130f4520SKenneth D. Merry * 35*130f4520SKenneth D. Merry * Author: Ken Merry <ken@FreeBSD.org> 36*130f4520SKenneth D. Merry */ 37*130f4520SKenneth D. Merry 38*130f4520SKenneth D. Merry #include <sys/cdefs.h> 39*130f4520SKenneth D. Merry __FBSDID("$FreeBSD$"); 40*130f4520SKenneth D. Merry 41*130f4520SKenneth D. Merry #include <sys/param.h> 42*130f4520SKenneth D. Merry #include <sys/systm.h> 43*130f4520SKenneth D. Merry #include <sys/kernel.h> 44*130f4520SKenneth D. Merry #include <sys/types.h> 45*130f4520SKenneth D. Merry #include <sys/malloc.h> 46*130f4520SKenneth D. Merry #include <sys/lock.h> 47*130f4520SKenneth D. Merry #include <sys/mutex.h> 48*130f4520SKenneth D. Merry #include <sys/condvar.h> 49*130f4520SKenneth D. Merry #include <sys/queue.h> 50*130f4520SKenneth D. Merry 51*130f4520SKenneth D. Merry #include <cam/scsi/scsi_all.h> 52*130f4520SKenneth D. Merry #include <cam/scsi/scsi_da.h> 53*130f4520SKenneth D. Merry #include <cam/ctl/ctl_io.h> 54*130f4520SKenneth D. Merry #include <cam/ctl/ctl.h> 55*130f4520SKenneth D. Merry #include <cam/ctl/ctl_frontend.h> 56*130f4520SKenneth D. Merry #include <cam/ctl/ctl_backend.h> 57*130f4520SKenneth D. Merry #include <cam/ctl/ctl_frontend_internal.h> 58*130f4520SKenneth D. Merry #include <cam/ctl/ctl_ioctl.h> 59*130f4520SKenneth D. Merry #include <cam/ctl/ctl_ha.h> 60*130f4520SKenneth D. Merry #include <cam/ctl/ctl_private.h> 61*130f4520SKenneth D. Merry #include <cam/ctl/ctl_debug.h> 62*130f4520SKenneth D. Merry 63*130f4520SKenneth D. Merry extern struct ctl_softc *control_softc; 64*130f4520SKenneth D. Merry 65*130f4520SKenneth D. Merry int 66*130f4520SKenneth D. Merry ctl_backend_register(struct ctl_backend_driver *be) 67*130f4520SKenneth D. Merry { 68*130f4520SKenneth D. Merry struct ctl_softc *ctl_softc; 69*130f4520SKenneth D. Merry struct ctl_backend_driver *be_tmp; 70*130f4520SKenneth D. Merry 71*130f4520SKenneth D. Merry ctl_softc = control_softc; 72*130f4520SKenneth D. Merry 73*130f4520SKenneth D. Merry mtx_lock(&ctl_softc->ctl_lock); 74*130f4520SKenneth D. Merry /* 75*130f4520SKenneth D. Merry * Sanity check, make sure this isn't a duplicate registration. 76*130f4520SKenneth D. Merry */ 77*130f4520SKenneth D. Merry STAILQ_FOREACH(be_tmp, &ctl_softc->be_list, links) { 78*130f4520SKenneth D. Merry if (strcmp(be_tmp->name, be->name) == 0) { 79*130f4520SKenneth D. Merry mtx_unlock(&ctl_softc->ctl_lock); 80*130f4520SKenneth D. Merry return (-1); 81*130f4520SKenneth D. Merry } 82*130f4520SKenneth D. Merry } 83*130f4520SKenneth D. Merry mtx_unlock(&ctl_softc->ctl_lock); 84*130f4520SKenneth D. Merry 85*130f4520SKenneth D. Merry /* 86*130f4520SKenneth D. Merry * Call the backend's initialization routine. 87*130f4520SKenneth D. Merry */ 88*130f4520SKenneth D. Merry be->init(); 89*130f4520SKenneth D. Merry 90*130f4520SKenneth D. Merry mtx_lock(&ctl_softc->ctl_lock); 91*130f4520SKenneth D. Merry 92*130f4520SKenneth D. Merry STAILQ_INSERT_TAIL(&ctl_softc->be_list, be, links); 93*130f4520SKenneth D. Merry 94*130f4520SKenneth D. Merry ctl_softc->num_backends++; 95*130f4520SKenneth D. Merry 96*130f4520SKenneth D. Merry /* 97*130f4520SKenneth D. Merry * Don't want to increment the usage count for internal consumers, 98*130f4520SKenneth D. Merry * we won't be able to unload otherwise. 99*130f4520SKenneth D. Merry */ 100*130f4520SKenneth D. Merry /* XXX KDM find a substitute for this? */ 101*130f4520SKenneth D. Merry #if 0 102*130f4520SKenneth D. Merry if ((be->flags & CTL_BE_FLAG_INTERNAL) == 0) 103*130f4520SKenneth D. Merry MOD_INC_USE_COUNT; 104*130f4520SKenneth D. Merry #endif 105*130f4520SKenneth D. Merry 106*130f4520SKenneth D. Merry #ifdef CS_BE_CONFIG_MOVE_DONE_IS_NOT_USED 107*130f4520SKenneth D. Merry be->config_move_done = ctl_config_move_done; 108*130f4520SKenneth D. Merry #endif 109*130f4520SKenneth D. Merry /* XXX KDM fix this! */ 110*130f4520SKenneth D. Merry be->num_luns = 0; 111*130f4520SKenneth D. Merry #if 0 112*130f4520SKenneth D. Merry atomic_set(&be->num_luns, 0); 113*130f4520SKenneth D. Merry #endif 114*130f4520SKenneth D. Merry 115*130f4520SKenneth D. Merry mtx_unlock(&ctl_softc->ctl_lock); 116*130f4520SKenneth D. Merry 117*130f4520SKenneth D. Merry return (0); 118*130f4520SKenneth D. Merry } 119*130f4520SKenneth D. Merry 120*130f4520SKenneth D. Merry int 121*130f4520SKenneth D. Merry ctl_backend_deregister(struct ctl_backend_driver *be) 122*130f4520SKenneth D. Merry { 123*130f4520SKenneth D. Merry struct ctl_softc *ctl_softc; 124*130f4520SKenneth D. Merry 125*130f4520SKenneth D. Merry ctl_softc = control_softc; 126*130f4520SKenneth D. Merry 127*130f4520SKenneth D. Merry mtx_lock(&ctl_softc->ctl_lock); 128*130f4520SKenneth D. Merry 129*130f4520SKenneth D. Merry #if 0 130*130f4520SKenneth D. Merry if (atomic_read(&be->num_luns) != 0) { 131*130f4520SKenneth D. Merry #endif 132*130f4520SKenneth D. Merry /* XXX KDM fix this! */ 133*130f4520SKenneth D. Merry if (be->num_luns != 0) { 134*130f4520SKenneth D. Merry mtx_unlock(&ctl_softc->ctl_lock); 135*130f4520SKenneth D. Merry return (-1); 136*130f4520SKenneth D. Merry } 137*130f4520SKenneth D. Merry 138*130f4520SKenneth D. Merry STAILQ_REMOVE(&ctl_softc->be_list, be, ctl_backend_driver, links); 139*130f4520SKenneth D. Merry 140*130f4520SKenneth D. Merry ctl_softc->num_backends--; 141*130f4520SKenneth D. Merry 142*130f4520SKenneth D. Merry /* XXX KDM find a substitute for this? */ 143*130f4520SKenneth D. Merry #if 0 144*130f4520SKenneth D. Merry if ((be->flags & CTL_BE_FLAG_INTERNAL) == 0) 145*130f4520SKenneth D. Merry MOD_DEC_USE_COUNT; 146*130f4520SKenneth D. Merry #endif 147*130f4520SKenneth D. Merry 148*130f4520SKenneth D. Merry mtx_unlock(&ctl_softc->ctl_lock); 149*130f4520SKenneth D. Merry 150*130f4520SKenneth D. Merry return (0); 151*130f4520SKenneth D. Merry } 152*130f4520SKenneth D. Merry 153*130f4520SKenneth D. Merry struct ctl_backend_driver * 154*130f4520SKenneth D. Merry ctl_backend_find(char *backend_name) 155*130f4520SKenneth D. Merry { 156*130f4520SKenneth D. Merry struct ctl_softc *ctl_softc; 157*130f4520SKenneth D. Merry struct ctl_backend_driver *be_tmp; 158*130f4520SKenneth D. Merry 159*130f4520SKenneth D. Merry ctl_softc = control_softc; 160*130f4520SKenneth D. Merry 161*130f4520SKenneth D. Merry mtx_lock(&ctl_softc->ctl_lock); 162*130f4520SKenneth D. Merry 163*130f4520SKenneth D. Merry STAILQ_FOREACH(be_tmp, &ctl_softc->be_list, links) { 164*130f4520SKenneth D. Merry if (strcmp(be_tmp->name, backend_name) == 0) { 165*130f4520SKenneth D. Merry mtx_unlock(&ctl_softc->ctl_lock); 166*130f4520SKenneth D. Merry return (be_tmp); 167*130f4520SKenneth D. Merry } 168*130f4520SKenneth D. Merry } 169*130f4520SKenneth D. Merry 170*130f4520SKenneth D. Merry mtx_unlock(&ctl_softc->ctl_lock); 171*130f4520SKenneth D. Merry 172*130f4520SKenneth D. Merry return (NULL); 173*130f4520SKenneth D. Merry } 174*130f4520SKenneth D. Merry 175*130f4520SKenneth D. Merry /* 176*130f4520SKenneth D. Merry * vim: ts=8 177*130f4520SKenneth D. Merry */ 178