vinumlock.c

Version: - FREEBSD - FREEBSD-13-STABLE - FREEBSD-13-0 - FREEBSD-12-STABLE - FREEBSD-12-0 - FREEBSD-11-STABLE - FREEBSD-11-0 - FREEBSD-10-STABLE - FREEBSD-10-0 - FREEBSD-9-STABLE - FREEBSD-9-0 - FREEBSD-8-STABLE - FREEBSD-8-0 - FREEBSD-7-STABLE - FREEBSD-7-0 - FREEBSD-6-STABLE - FREEBSD-6-0 - FREEBSD-5-STABLE - FREEBSD-5-0 - FREEBSD-4-STABLE - FREEBSD-3-STABLE - FREEBSD22 - l41 - OPENBSD - linux-2.6 - MK84 - PLAN9 - xnu-8792
SearchContext: - none - 3 - 10
    1 /*-
    2  * Copyright (c) 1997, 1998
    3  *      Nan Yang Computer Services Limited.  All rights reserved.
    4  *
    5  *  Parts copyright (c) 1997, 1998 Cybernet Corporation, NetMAX project.
    6  *
    7  *  Written by Greg Lehey
    8  *
    9  *  This software is distributed under the so-called ``Berkeley
   10  *  License'':
   11  *
   12  * Redistribution and use in source and binary forms, with or without
   13  * modification, are permitted provided that the following conditions
   14  * are met:
   15  * 1. Redistributions of source code must retain the above copyright
   16  *    notice, this list of conditions and the following disclaimer.
   17  * 2. Redistributions in binary form must reproduce the above copyright
   18  *    notice, this list of conditions and the following disclaimer in the
   19  *    documentation and/or other materials provided with the distribution.
   20  * 3. All advertising materials mentioning features or use of this software
   21  *    must display the following acknowledgement:
   22  *      This product includes software developed by Nan Yang Computer
   23  *      Services Limited.
   24  * 4. Neither the name of the Company nor the names of its contributors
   25  *    may be used to endorse or promote products derived from this software
   26  *    without specific prior written permission.
   27  *
   28  * This software is provided ``as is'', and any express or implied
   29  * warranties, including, but not limited to, the implied warranties of
   30  * merchantability and fitness for a particular purpose are disclaimed.
   31  * In no event shall the company or contributors be liable for any
   32  * direct, indirect, incidental, special, exemplary, or consequential
   33  * damages (including, but not limited to, procurement of substitute
   34  * goods or services; loss of use, data, or profits; or business
   35  * interruption) however caused and on any theory of liability, whether
   36  * in contract, strict liability, or tort (including negligence or
   37  * otherwise) arising in any way out of the use of this software, even if
   38  * advised of the possibility of such damage.
   39  *
   40  * $Id: vinumlock.c,v 1.1.1.1 2003/10/10 03:08:41 grog Exp $
   41  * $FreeBSD$
   42  */
   43 
   44 #include <dev/vinum/vinumhdr.h>
   45 #include <dev/vinum/request.h>
   46 
   47 /* Lock a drive, wait if it's in use */
   48 #ifdef VINUMDEBUG
   49 int
   50 lockdrive(struct drive *drive, char *file, int line)
   51 #else
   52 int
   53 lockdrive(struct drive *drive)
   54 #endif
   55 {
   56     int error;
   57 
   58     /* XXX get rid of     drive->flags |= VF_LOCKING; */
   59     if ((drive->flags & VF_LOCKED)                          /* it's locked */
   60     &&(drive->pid == curproc->p_pid)) {                     /* by us! */
   61 #ifdef VINUMDEBUG
   62         log(LOG_WARNING,
   63             "vinum lockdrive: already locking %s from %s:%d, called from %s:%d\n",
   64             drive->label.name,
   65             drive->lockfilename,
   66             drive->lockline,
   67             basename(file),
   68             line);
   69 #else
   70         log(LOG_WARNING,
   71             "vinum lockdrive: already locking %s\n",
   72             drive->label.name);
   73 #endif
   74         return 0;
   75     }
   76     while ((drive->flags & VF_LOCKED) != 0) {
   77         /*
   78          * There are problems sleeping on a unique identifier,
   79          * since the drive structure can move, and the unlock
   80          * function can be called after killing the drive.
   81          * Solve this by waiting on this function; the number
   82          * of conflicts is negligible.
   83          */
   84         if ((error = tsleep(&lockdrive,
   85                     PRIBIO,
   86                     "vindrv",
   87                     0)) != 0)
   88             return error;
   89     }
   90     drive->flags |= VF_LOCKED;
   91     drive->pid = curproc->p_pid;                            /* it's a panic error if curproc is null */
   92 #ifdef VINUMDEBUG
   93     bcopy(basename(file), drive->lockfilename, 15);
   94     drive->lockfilename[15] = '\0';                         /* truncate if necessary */
   95     drive->lockline = line;
   96 #endif
   97     return 0;
   98 }
   99 
  100 /* Unlock a drive and let the next one at it */
  101 void
  102 unlockdrive(struct drive *drive)
  103 {
  104     drive->flags &= ~VF_LOCKED;
  105     /* we don't reset pid: it's of hysterical interest */
  106     wakeup(&lockdrive);
  107 }
  108 
  109 /* Lock a stripe of a plex, wait if it's in use */
  110 struct rangelock *
  111 lockrange(daddr_t stripe, struct buf *bp, struct plex *plex)
  112 {
  113     int s;
  114     struct rangelock *lock;
  115     struct rangelock *pos;                                  /* position of first free lock */
  116     int foundlocks;                                         /* number of locks found */
  117 
  118     /*
  119      * We could get by without counting the number
  120      * of locks we find, but we have a linear search
  121      * through a table which in most cases will be
  122      * empty.  It's faster to stop when we've found
  123      * all the locks that are there.  This is also
  124      * the reason why we put pos at the beginning
  125      * instead of the end, though it requires an
  126      * extra test.
  127      */
  128     pos = NULL;
  129     foundlocks = 0;
  130 
  131     /*
  132      * we can't use 0 as a valid address, so
  133      * increment all addresses by 1.
  134      */
  135     stripe++;
  136     /*
  137      * We give the locks back from an interrupt
  138      * context, so we need to raise the spl here.
  139      */
  140     s = splbio();
  141 
  142     /* Wait here if the table is full */
  143     while (plex->usedlocks == PLEX_LOCKS)                   /* all in use */
  144         tsleep(&plex->usedlocks, PRIBIO, "vlock", 0);
  145 
  146 #ifdef DIAGNOSTIC
  147     if (plex->usedlocks >= PLEX_LOCKS)
  148         panic("lockrange: Too many locks in use");
  149 #endif
  150 
  151     lock = plex->lock;                                      /* pointer in lock table */
  152     if (plex->usedlocks > 0)                                /* something locked, */
  153         /* Search the lock table for our stripe */
  154         for (; lock < &plex->lock[PLEX_LOCKS]
  155             && foundlocks < plex->usedlocks;
  156             lock++) {
  157             if (lock->stripe) {                             /* in use */
  158                 foundlocks++;                               /* found another one in use */
  159                 if ((lock->stripe == stripe)                /* it's our stripe */
  160                 &&(lock->bp != bp)) {                       /* but not our request */
  161 #ifdef VINUMDEBUG
  162                     if (debug & DEBUG_LOCKREQS) {
  163                         struct rangelockinfo lockinfo;
  164 
  165                         lockinfo.stripe = stripe;
  166                         lockinfo.bp = bp;
  167                         lockinfo.plexno = plex->plexno;
  168                         logrq(loginfo_lockwait, (union rqinfou) &lockinfo, bp);
  169                     }
  170 #endif
  171                     plex->lockwaits++;                      /* waited one more time */
  172                     tsleep(lock, PRIBIO, "vrlock", 0);
  173                     lock = &plex->lock[-1];                 /* start again */
  174                     foundlocks = 0;
  175                     pos = NULL;
  176                 }
  177             } else if (pos == NULL)                         /* still looking for somewhere? */
  178                 pos = lock;                                 /* a place to put this one */
  179         }
  180     /*
  181      * This untidy looking code ensures that we'll
  182      * always end up pointing to the first free lock
  183      * entry, thus minimizing the number of
  184      * iterations necessary.
  185      */
  186     if (pos == NULL)                                        /* didn't find one on the way, */
  187         pos = lock;                                         /* use the one we're pointing to */
  188 
  189     /*
  190      * The address range is free, and we're pointing
  191      * to the first unused entry.  Make it ours.
  192      */
  193     pos->stripe = stripe;
  194     pos->bp = bp;
  195     plex->usedlocks++;                                      /* one more lock */
  196     splx(s);
  197 #ifdef VINUMDEBUG
  198     if (debug & DEBUG_LOCKREQS) {
  199         struct rangelockinfo lockinfo;
  200 
  201         lockinfo.stripe = stripe;
  202         lockinfo.bp = bp;
  203         lockinfo.plexno = plex->plexno;
  204         logrq(loginfo_lock, (union rqinfou) &lockinfo, bp);
  205     }
  206 #endif
  207     return pos;
  208 }
  209 
  210 /* Unlock a volume and let the next one at it */
  211 void
  212 unlockrange(int plexno, struct rangelock *lock)
  213 {
  214     struct plex *plex;
  215 
  216     plex = &PLEX[plexno];
  217 #ifdef DIAGNOSTIC
  218     if (lock < &plex->lock[0] || lock >= &plex->lock[PLEX_LOCKS])
  219         panic("vinum: rangelock %p on plex %d invalid, not between %p and %p",
  220             lock,
  221             plexno,
  222             &plex->lock[0],
  223             &plex->lock[PLEX_LOCKS]);
  224 #endif
  225 #ifdef VINUMDEBUG
  226     if (debug & DEBUG_LOCKREQS) {
  227         struct rangelockinfo lockinfo;
  228 
  229         lockinfo.stripe = lock->stripe;
  230         lockinfo.bp = lock->bp;
  231         lockinfo.plexno = plex->plexno;
  232         logrq(loginfo_lockwait, (union rqinfou) &lockinfo, lock->bp);
  233     }
  234 #endif
  235     lock->stripe = 0;                                       /* no longer used */
  236     plex->usedlocks--;                                      /* one less lock */
  237     if (plex->usedlocks == PLEX_LOCKS - 1)                  /* we were full, */
  238         wakeup(&plex->usedlocks);                           /* get a waiter if one's there */
  239     wakeup((void *) lock);
  240 }
  241 
  242 /* Get a lock for the global config, wait if it's not available */
  243 int
  244 lock_config(void)
  245 {
  246     int error;
  247 
  248     while ((vinum_conf.flags & VF_LOCKED) != 0) {
  249         vinum_conf.flags |= VF_LOCKING;
  250         if ((error = tsleep(&vinum_conf, PRIBIO, "vincfg", 0)) != 0)
  251             return error;
  252     }
  253     vinum_conf.flags |= VF_LOCKED;
  254     return 0;
  255 }
  256 
  257 /* Unlock and wake up any waiters  */
  258 void
  259 unlock_config(void)
  260 {
  261     vinum_conf.flags &= ~VF_LOCKED;
  262     if ((vinum_conf.flags & VF_LOCKING) != 0) {
  263         vinum_conf.flags &= ~VF_LOCKING;
  264         wakeup(&vinum_conf);
  265     }
  266 }
  267 /* Local Variables: */
  268 /* fill-column: 50 */
  269 /* End: */
Cache object: 86fa675bc49648f33762c3e4f64646e9
[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]
This page is part of the FreeBSD/Linux Linux Kernel Cross-Reference, and was automatically generated using a modified version of the LXR engine.
FreeBSD/Linux Kernel Cross Reference sys/dev/vinum/vinumlock.c

FreeBSD/Linux Kernel Cross Reference
sys/dev/vinum/vinumlock.c
