The Design and Implementation of the FreeBSD Operating System, Second Edition
Now available: The Design and Implementation of the FreeBSD Operating System (Second Edition)


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]

FreeBSD/Linux Kernel Cross Reference
sys/geom/geom_subr.c

Version: -  FREEBSD  -  FREEBSD-12-STABLE  -  FREEBSD-12-0  -  FREEBSD-11-STABLE  -  FREEBSD-11-2  -  FREEBSD-11-1  -  FREEBSD-11-0  -  FREEBSD-10-STABLE  -  FREEBSD-10-4  -  FREEBSD-10-3  -  FREEBSD-10-2  -  FREEBSD-10-1  -  FREEBSD-10-0  -  FREEBSD-9-STABLE  -  FREEBSD-9-3  -  FREEBSD-9-2  -  FREEBSD-9-1  -  FREEBSD-9-0  -  FREEBSD-8-STABLE  -  FREEBSD-8-4  -  FREEBSD-8-3  -  FREEBSD-8-2  -  FREEBSD-8-1  -  FREEBSD-8-0  -  FREEBSD-7-STABLE  -  FREEBSD-7-4  -  FREEBSD-7-3  -  FREEBSD-7-2  -  FREEBSD-7-1  -  FREEBSD-7-0  -  FREEBSD-6-STABLE  -  FREEBSD-6-4  -  FREEBSD-6-3  -  FREEBSD-6-2  -  FREEBSD-6-1  -  FREEBSD-6-0  -  FREEBSD-5-STABLE  -  FREEBSD-5-5  -  FREEBSD-5-4  -  FREEBSD-5-3  -  FREEBSD-5-2  -  FREEBSD-5-1  -  FREEBSD-5-0  -  FREEBSD-4-STABLE  -  FREEBSD-3-STABLE  -  FREEBSD22  -  linux-2.6  -  linux-2.4.22  -  MK83  -  MK84  -  PLAN9  -  DFBSD  -  NETBSD  -  NETBSD5  -  NETBSD4  -  NETBSD3  -  NETBSD20  -  OPENBSD  -  xnu-517  -  xnu-792  -  xnu-792.6.70  -  xnu-1228  -  xnu-1456.1.26  -  xnu-1699.24.8  -  xnu-2050.18.24  -  OPENSOLARIS  -  minix-3-1-1 
SearchContext: -  none  -  3  -  10 

    1 /*-
    2  * Copyright (c) 2002 Poul-Henning Kamp
    3  * Copyright (c) 2002 Networks Associates Technology, Inc.
    4  * All rights reserved.
    5  *
    6  * This software was developed for the FreeBSD Project by Poul-Henning Kamp
    7  * and NAI Labs, the Security Research Division of Network Associates, Inc.
    8  * under DARPA/SPAWAR contract N66001-01-C-8035 ("CBOSS"), as part of the
    9  * DARPA CHATS research program.
   10  *
   11  * Redistribution and use in source and binary forms, with or without
   12  * modification, are permitted provided that the following conditions
   13  * are met:
   14  * 1. Redistributions of source code must retain the above copyright
   15  *    notice, this list of conditions and the following disclaimer.
   16  * 2. Redistributions in binary form must reproduce the above copyright
   17  *    notice, this list of conditions and the following disclaimer in the
   18  *    documentation and/or other materials provided with the distribution.
   19  * 3. The names of the authors may not be used to endorse or promote
   20  *    products derived from this software without specific prior written
   21  *    permission.
   22  *
   23  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
   24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
   25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
   26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
   27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
   28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
   29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
   30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
   31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
   32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
   33  * SUCH DAMAGE.
   34  */
   35 
   36 #include <sys/cdefs.h>
   37 __FBSDID("$FreeBSD: releng/9.2/sys/geom/geom_subr.c 249619 2013-04-18 10:49:52Z mav $");
   38 
   39 #include "opt_ddb.h"
   40 
   41 #include <sys/param.h>
   42 #include <sys/systm.h>
   43 #include <sys/devicestat.h>
   44 #include <sys/kernel.h>
   45 #include <sys/malloc.h>
   46 #include <sys/bio.h>
   47 #include <sys/sysctl.h>
   48 #include <sys/proc.h>
   49 #include <sys/kthread.h>
   50 #include <sys/lock.h>
   51 #include <sys/mutex.h>
   52 #include <sys/errno.h>
   53 #include <sys/sbuf.h>
   54 #include <geom/geom.h>
   55 #include <geom/geom_int.h>
   56 #include <machine/stdarg.h>
   57 
   58 #ifdef DDB
   59 #include <ddb/ddb.h>
   60 #endif
   61 
   62 #ifdef KDB
   63 #include <sys/kdb.h>
   64 #endif
   65 
   66 struct class_list_head g_classes = LIST_HEAD_INITIALIZER(g_classes);
   67 static struct g_tailq_head geoms = TAILQ_HEAD_INITIALIZER(geoms);
   68 char *g_wait_event, *g_wait_up, *g_wait_down, *g_wait_sim;
   69 
   70 struct g_hh00 {
   71         struct g_class  *mp;
   72         int             error;
   73         int             post;
   74 };
   75 
   76 /*
   77  * This event offers a new class a chance to taste all preexisting providers.
   78  */
   79 static void
   80 g_load_class(void *arg, int flag)
   81 {
   82         struct g_hh00 *hh;
   83         struct g_class *mp2, *mp;
   84         struct g_geom *gp;
   85         struct g_provider *pp;
   86 
   87         g_topology_assert();
   88         if (flag == EV_CANCEL)  /* XXX: can't happen ? */
   89                 return;
   90         if (g_shutdown)
   91                 return;
   92 
   93         hh = arg;
   94         mp = hh->mp;
   95         hh->error = 0;
   96         if (hh->post) {
   97                 g_free(hh);
   98                 hh = NULL;
   99         }
  100         g_trace(G_T_TOPOLOGY, "g_load_class(%s)", mp->name);
  101         KASSERT(mp->name != NULL && *mp->name != '\0',
  102             ("GEOM class has no name"));
  103         LIST_FOREACH(mp2, &g_classes, class) {
  104                 if (mp2 == mp) {
  105                         printf("The GEOM class %s is already loaded.\n",
  106                             mp2->name);
  107                         if (hh != NULL)
  108                                 hh->error = EEXIST;
  109                         return;
  110                 } else if (strcmp(mp2->name, mp->name) == 0) {
  111                         printf("A GEOM class %s is already loaded.\n",
  112                             mp2->name);
  113                         if (hh != NULL)
  114                                 hh->error = EEXIST;
  115                         return;
  116                 }
  117         }
  118 
  119         LIST_INIT(&mp->geom);
  120         LIST_INSERT_HEAD(&g_classes, mp, class);
  121         if (mp->init != NULL)
  122                 mp->init(mp);
  123         if (mp->taste == NULL)
  124                 return;
  125         LIST_FOREACH(mp2, &g_classes, class) {
  126                 if (mp == mp2)
  127                         continue;
  128                 LIST_FOREACH(gp, &mp2->geom, geom) {
  129                         LIST_FOREACH(pp, &gp->provider, provider) {
  130                                 mp->taste(mp, pp, 0);
  131                                 g_topology_assert();
  132                         }
  133                 }
  134         }
  135 }
  136 
  137 static int
  138 g_unload_class(struct g_class *mp)
  139 {
  140         struct g_geom *gp;
  141         struct g_provider *pp;
  142         struct g_consumer *cp;
  143         int error;
  144 
  145         g_topology_lock();
  146         g_trace(G_T_TOPOLOGY, "g_unload_class(%s)", mp->name);
  147 retry:
  148         G_VALID_CLASS(mp);
  149         LIST_FOREACH(gp, &mp->geom, geom) {
  150                 /* We refuse to unload if anything is open */
  151                 LIST_FOREACH(pp, &gp->provider, provider)
  152                         if (pp->acr || pp->acw || pp->ace) {
  153                                 g_topology_unlock();
  154                                 return (EBUSY);
  155                         }
  156                 LIST_FOREACH(cp, &gp->consumer, consumer)
  157                         if (cp->acr || cp->acw || cp->ace) {
  158                                 g_topology_unlock();
  159                                 return (EBUSY);
  160                         }
  161                 /* If the geom is withering, wait for it to finish. */
  162                 if (gp->flags & G_GEOM_WITHER) {
  163                         g_topology_sleep(mp, 1);
  164                         goto retry;
  165                 }
  166         }
  167 
  168         /*
  169          * We allow unloading if we have no geoms, or a class
  170          * method we can use to get rid of them.
  171          */
  172         if (!LIST_EMPTY(&mp->geom) && mp->destroy_geom == NULL) {
  173                 g_topology_unlock();
  174                 return (EOPNOTSUPP);
  175         }
  176 
  177         /* Bar new entries */
  178         mp->taste = NULL;
  179         mp->config = NULL;
  180 
  181         LIST_FOREACH(gp, &mp->geom, geom) {
  182                 error = mp->destroy_geom(NULL, mp, gp);
  183                 if (error != 0) {
  184                         g_topology_unlock();
  185                         return (error);
  186                 }
  187         }
  188         /* Wait for withering to finish. */
  189         for (;;) {
  190                 gp = LIST_FIRST(&mp->geom);
  191                 if (gp == NULL)
  192                         break;
  193                 KASSERT(gp->flags & G_GEOM_WITHER,
  194                    ("Non-withering geom in class %s", mp->name));
  195                 g_topology_sleep(mp, 1);
  196         }
  197         G_VALID_CLASS(mp);
  198         if (mp->fini != NULL)
  199                 mp->fini(mp);
  200         LIST_REMOVE(mp, class);
  201         g_topology_unlock();
  202 
  203         return (0);
  204 }
  205 
  206 int
  207 g_modevent(module_t mod, int type, void *data)
  208 {
  209         struct g_hh00 *hh;
  210         int error;
  211         static int g_ignition;
  212         struct g_class *mp;
  213 
  214         mp = data;
  215         if (mp->version != G_VERSION) {
  216                 printf("GEOM class %s has Wrong version %x\n",
  217                     mp->name, mp->version);
  218                 return (EINVAL);
  219         }
  220         if (!g_ignition) {
  221                 g_ignition++;
  222                 g_init();
  223         }
  224         error = EOPNOTSUPP;
  225         switch (type) {
  226         case MOD_LOAD:
  227                 g_trace(G_T_TOPOLOGY, "g_modevent(%s, LOAD)", mp->name);
  228                 hh = g_malloc(sizeof *hh, M_WAITOK | M_ZERO);
  229                 hh->mp = mp;
  230                 /*
  231                  * Once the system is not cold, MOD_LOAD calls will be
  232                  * from the userland and the g_event thread will be able
  233                  * to acknowledge their completion.
  234                  */
  235                 if (cold) {
  236                         hh->post = 1;
  237                         error = g_post_event(g_load_class, hh, M_WAITOK, NULL);
  238                 } else {
  239                         error = g_waitfor_event(g_load_class, hh, M_WAITOK,
  240                             NULL);
  241                         if (error == 0)
  242                                 error = hh->error;
  243                         g_free(hh);
  244                 }
  245                 break;
  246         case MOD_UNLOAD:
  247                 g_trace(G_T_TOPOLOGY, "g_modevent(%s, UNLOAD)", mp->name);
  248                 DROP_GIANT();
  249                 error = g_unload_class(mp);
  250                 PICKUP_GIANT();
  251                 if (error == 0) {
  252                         KASSERT(LIST_EMPTY(&mp->geom),
  253                             ("Unloaded class (%s) still has geom", mp->name));
  254                 }
  255                 break;
  256         }
  257         return (error);
  258 }
  259 
  260 static void
  261 g_retaste_event(void *arg, int flag)
  262 {
  263         struct g_class *mp, *mp2;
  264         struct g_geom *gp;
  265         struct g_hh00 *hh;
  266         struct g_provider *pp;
  267         struct g_consumer *cp;
  268 
  269         g_topology_assert();
  270         if (flag == EV_CANCEL)  /* XXX: can't happen ? */
  271                 return;
  272         if (g_shutdown)
  273                 return;
  274 
  275         hh = arg;
  276         mp = hh->mp;
  277         hh->error = 0;
  278         if (hh->post) {
  279                 g_free(hh);
  280                 hh = NULL;
  281         }
  282         g_trace(G_T_TOPOLOGY, "g_retaste(%s)", mp->name);
  283 
  284         LIST_FOREACH(mp2, &g_classes, class) {
  285                 LIST_FOREACH(gp, &mp2->geom, geom) {
  286                         LIST_FOREACH(pp, &gp->provider, provider) {
  287                                 if (pp->acr || pp->acw || pp->ace)
  288                                         continue;
  289                                 LIST_FOREACH(cp, &pp->consumers, consumers) {
  290                                         if (cp->geom->class == mp &&
  291                                             (cp->flags & G_CF_ORPHAN) == 0)
  292                                                 break;
  293                                 }
  294                                 if (cp != NULL) {
  295                                         cp->flags |= G_CF_ORPHAN;
  296                                         g_wither_geom(cp->geom, ENXIO);
  297                                 }
  298                                 mp->taste(mp, pp, 0);
  299                                 g_topology_assert();
  300                         }
  301                 }
  302         }
  303 }
  304 
  305 int
  306 g_retaste(struct g_class *mp)
  307 {
  308         struct g_hh00 *hh;
  309         int error;
  310 
  311         if (mp->taste == NULL)
  312                 return (EINVAL);
  313 
  314         hh = g_malloc(sizeof *hh, M_WAITOK | M_ZERO);
  315         hh->mp = mp;
  316 
  317         if (cold) {
  318                 hh->post = 1;
  319                 error = g_post_event(g_retaste_event, hh, M_WAITOK, NULL);
  320         } else {
  321                 error = g_waitfor_event(g_retaste_event, hh, M_WAITOK, NULL);
  322                 if (error == 0)
  323                         error = hh->error;
  324                 g_free(hh);
  325         }
  326 
  327         return (error);
  328 }
  329 
  330 struct g_geom *
  331 g_new_geomf(struct g_class *mp, const char *fmt, ...)
  332 {
  333         struct g_geom *gp;
  334         va_list ap;
  335         struct sbuf *sb;
  336 
  337         g_topology_assert();
  338         G_VALID_CLASS(mp);
  339         sb = sbuf_new_auto();
  340         va_start(ap, fmt);
  341         sbuf_vprintf(sb, fmt, ap);
  342         va_end(ap);
  343         sbuf_finish(sb);
  344         gp = g_malloc(sizeof *gp, M_WAITOK | M_ZERO);
  345         gp->name = g_malloc(sbuf_len(sb) + 1, M_WAITOK | M_ZERO);
  346         gp->class = mp;
  347         gp->rank = 1;
  348         LIST_INIT(&gp->consumer);
  349         LIST_INIT(&gp->provider);
  350         LIST_INSERT_HEAD(&mp->geom, gp, geom);
  351         TAILQ_INSERT_HEAD(&geoms, gp, geoms);
  352         strcpy(gp->name, sbuf_data(sb));
  353         sbuf_delete(sb);
  354         /* Fill in defaults from class */
  355         gp->start = mp->start;
  356         gp->spoiled = mp->spoiled;
  357         gp->attrchanged = mp->attrchanged;
  358         gp->providergone = mp->providergone;
  359         gp->dumpconf = mp->dumpconf;
  360         gp->access = mp->access;
  361         gp->orphan = mp->orphan;
  362         gp->ioctl = mp->ioctl;
  363         return (gp);
  364 }
  365 
  366 void
  367 g_destroy_geom(struct g_geom *gp)
  368 {
  369 
  370         g_topology_assert();
  371         G_VALID_GEOM(gp);
  372         g_trace(G_T_TOPOLOGY, "g_destroy_geom(%p(%s))", gp, gp->name);
  373         KASSERT(LIST_EMPTY(&gp->consumer),
  374             ("g_destroy_geom(%s) with consumer(s) [%p]",
  375             gp->name, LIST_FIRST(&gp->consumer)));
  376         KASSERT(LIST_EMPTY(&gp->provider),
  377             ("g_destroy_geom(%s) with provider(s) [%p]",
  378             gp->name, LIST_FIRST(&gp->provider)));
  379         g_cancel_event(gp);
  380         LIST_REMOVE(gp, geom);
  381         TAILQ_REMOVE(&geoms, gp, geoms);
  382         g_free(gp->name);
  383         g_free(gp);
  384 }
  385 
  386 /*
  387  * This function is called (repeatedly) until the geom has withered away.
  388  */
  389 void
  390 g_wither_geom(struct g_geom *gp, int error)
  391 {
  392         struct g_provider *pp;
  393 
  394         g_topology_assert();
  395         G_VALID_GEOM(gp);
  396         g_trace(G_T_TOPOLOGY, "g_wither_geom(%p(%s))", gp, gp->name);
  397         if (!(gp->flags & G_GEOM_WITHER)) {
  398                 gp->flags |= G_GEOM_WITHER;
  399                 LIST_FOREACH(pp, &gp->provider, provider)
  400                         if (!(pp->flags & G_PF_ORPHAN))
  401                                 g_orphan_provider(pp, error);
  402         }
  403         g_do_wither();
  404 }
  405 
  406 /*
  407  * Convenience function to destroy a particular provider.
  408  */
  409 void
  410 g_wither_provider(struct g_provider *pp, int error)
  411 {
  412 
  413         pp->flags |= G_PF_WITHER;
  414         if (!(pp->flags & G_PF_ORPHAN))
  415                 g_orphan_provider(pp, error);
  416 }
  417 
  418 /*
  419  * This function is called (repeatedly) until the has withered away.
  420  */
  421 void
  422 g_wither_geom_close(struct g_geom *gp, int error)
  423 {
  424         struct g_consumer *cp;
  425 
  426         g_topology_assert();
  427         G_VALID_GEOM(gp);
  428         g_trace(G_T_TOPOLOGY, "g_wither_geom_close(%p(%s))", gp, gp->name);
  429         LIST_FOREACH(cp, &gp->consumer, consumer)
  430                 if (cp->acr || cp->acw || cp->ace)
  431                         g_access(cp, -cp->acr, -cp->acw, -cp->ace);
  432         g_wither_geom(gp, error);
  433 }
  434 
  435 /*
  436  * This function is called (repeatedly) until we cant wash away more
  437  * withered bits at present.
  438  */
  439 void
  440 g_wither_washer()
  441 {
  442         struct g_class *mp;
  443         struct g_geom *gp, *gp2;
  444         struct g_provider *pp, *pp2;
  445         struct g_consumer *cp, *cp2;
  446 
  447         g_topology_assert();
  448         LIST_FOREACH(mp, &g_classes, class) {
  449                 LIST_FOREACH_SAFE(gp, &mp->geom, geom, gp2) {
  450                         LIST_FOREACH_SAFE(pp, &gp->provider, provider, pp2) {
  451                                 if (!(pp->flags & G_PF_WITHER))
  452                                         continue;
  453                                 if (LIST_EMPTY(&pp->consumers))
  454                                         g_destroy_provider(pp);
  455                         }
  456                         if (!(gp->flags & G_GEOM_WITHER))
  457                                 continue;
  458                         LIST_FOREACH_SAFE(pp, &gp->provider, provider, pp2) {
  459                                 if (LIST_EMPTY(&pp->consumers))
  460                                         g_destroy_provider(pp);
  461                         }
  462                         LIST_FOREACH_SAFE(cp, &gp->consumer, consumer, cp2) {
  463                                 if (cp->acr || cp->acw || cp->ace)
  464                                         continue;
  465                                 if (cp->provider != NULL)
  466                                         g_detach(cp);
  467                                 g_destroy_consumer(cp);
  468                         }
  469                         if (LIST_EMPTY(&gp->provider) &&
  470                             LIST_EMPTY(&gp->consumer))
  471                                 g_destroy_geom(gp);
  472                 }
  473         }
  474 }
  475 
  476 struct g_consumer *
  477 g_new_consumer(struct g_geom *gp)
  478 {
  479         struct g_consumer *cp;
  480 
  481         g_topology_assert();
  482         G_VALID_GEOM(gp);
  483         KASSERT(!(gp->flags & G_GEOM_WITHER),
  484             ("g_new_consumer on WITHERing geom(%s) (class %s)",
  485             gp->name, gp->class->name));
  486         KASSERT(gp->orphan != NULL,
  487             ("g_new_consumer on geom(%s) (class %s) without orphan",
  488             gp->name, gp->class->name));
  489 
  490         cp = g_malloc(sizeof *cp, M_WAITOK | M_ZERO);
  491         cp->geom = gp;
  492         cp->stat = devstat_new_entry(cp, -1, 0, DEVSTAT_ALL_SUPPORTED,
  493             DEVSTAT_TYPE_DIRECT, DEVSTAT_PRIORITY_MAX);
  494         LIST_INSERT_HEAD(&gp->consumer, cp, consumer);
  495         return(cp);
  496 }
  497 
  498 void
  499 g_destroy_consumer(struct g_consumer *cp)
  500 {
  501         struct g_geom *gp;
  502 
  503         g_topology_assert();
  504         G_VALID_CONSUMER(cp);
  505         g_trace(G_T_TOPOLOGY, "g_destroy_consumer(%p)", cp);
  506         KASSERT (cp->provider == NULL, ("g_destroy_consumer but attached"));
  507         KASSERT (cp->acr == 0, ("g_destroy_consumer with acr"));
  508         KASSERT (cp->acw == 0, ("g_destroy_consumer with acw"));
  509         KASSERT (cp->ace == 0, ("g_destroy_consumer with ace"));
  510         g_cancel_event(cp);
  511         gp = cp->geom;
  512         LIST_REMOVE(cp, consumer);
  513         devstat_remove_entry(cp->stat);
  514         g_free(cp);
  515         if (gp->flags & G_GEOM_WITHER)
  516                 g_do_wither();
  517 }
  518 
  519 static void
  520 g_new_provider_event(void *arg, int flag)
  521 {
  522         struct g_class *mp;
  523         struct g_provider *pp;
  524         struct g_consumer *cp, *next_cp;
  525 
  526         g_topology_assert();
  527         if (flag == EV_CANCEL)
  528                 return;
  529         if (g_shutdown)
  530                 return;
  531         pp = arg;
  532         G_VALID_PROVIDER(pp);
  533         KASSERT(!(pp->flags & G_PF_WITHER),
  534             ("g_new_provider_event but withered"));
  535         LIST_FOREACH_SAFE(cp, &pp->consumers, consumers, next_cp) {
  536                 if ((cp->flags & G_CF_ORPHAN) == 0 &&
  537                     cp->geom->attrchanged != NULL)
  538                         cp->geom->attrchanged(cp, "GEOM::media");
  539         }
  540         LIST_FOREACH(mp, &g_classes, class) {
  541                 if (mp->taste == NULL)
  542                         continue;
  543                 LIST_FOREACH(cp, &pp->consumers, consumers)
  544                         if (cp->geom->class == mp &&
  545                             (cp->flags & G_CF_ORPHAN) == 0)
  546                                 break;
  547                 if (cp != NULL)
  548                         continue;
  549                 mp->taste(mp, pp, 0);
  550                 g_topology_assert();
  551         }
  552 }
  553 
  554 
  555 struct g_provider *
  556 g_new_providerf(struct g_geom *gp, const char *fmt, ...)
  557 {
  558         struct g_provider *pp;
  559         struct sbuf *sb;
  560         va_list ap;
  561 
  562         g_topology_assert();
  563         G_VALID_GEOM(gp);
  564         KASSERT(gp->access != NULL,
  565             ("new provider on geom(%s) without ->access (class %s)",
  566             gp->name, gp->class->name));
  567         KASSERT(gp->start != NULL,
  568             ("new provider on geom(%s) without ->start (class %s)",
  569             gp->name, gp->class->name));
  570         KASSERT(!(gp->flags & G_GEOM_WITHER),
  571             ("new provider on WITHERing geom(%s) (class %s)",
  572             gp->name, gp->class->name));
  573         sb = sbuf_new_auto();
  574         va_start(ap, fmt);
  575         sbuf_vprintf(sb, fmt, ap);
  576         va_end(ap);
  577         sbuf_finish(sb);
  578         pp = g_malloc(sizeof *pp + sbuf_len(sb) + 1, M_WAITOK | M_ZERO);
  579         pp->name = (char *)(pp + 1);
  580         strcpy(pp->name, sbuf_data(sb));
  581         sbuf_delete(sb);
  582         LIST_INIT(&pp->consumers);
  583         pp->error = ENXIO;
  584         pp->geom = gp;
  585         pp->stat = devstat_new_entry(pp, -1, 0, DEVSTAT_ALL_SUPPORTED,
  586             DEVSTAT_TYPE_DIRECT, DEVSTAT_PRIORITY_MAX);
  587         LIST_INSERT_HEAD(&gp->provider, pp, provider);
  588         g_post_event(g_new_provider_event, pp, M_WAITOK, pp, gp, NULL);
  589         return (pp);
  590 }
  591 
  592 void
  593 g_error_provider(struct g_provider *pp, int error)
  594 {
  595 
  596         /* G_VALID_PROVIDER(pp);  We may not have g_topology */
  597         pp->error = error;
  598 }
  599 
  600 #ifndef _PATH_DEV
  601 #define _PATH_DEV       "/dev/"
  602 #endif
  603 
  604 struct g_provider *
  605 g_provider_by_name(char const *arg)
  606 {
  607         struct g_class *cp;
  608         struct g_geom *gp;
  609         struct g_provider *pp;
  610 
  611         if (strncmp(arg, _PATH_DEV, sizeof(_PATH_DEV) - 1) == 0)
  612                 arg += sizeof(_PATH_DEV) - 1;
  613 
  614         LIST_FOREACH(cp, &g_classes, class) {
  615                 LIST_FOREACH(gp, &cp->geom, geom) {
  616                         LIST_FOREACH(pp, &gp->provider, provider) {
  617                                 if (!strcmp(arg, pp->name))
  618                                         return (pp);
  619                         }
  620                 }
  621         }
  622 
  623         return (NULL);
  624 }
  625 
  626 void
  627 g_destroy_provider(struct g_provider *pp)
  628 {
  629         struct g_geom *gp;
  630 
  631         g_topology_assert();
  632         G_VALID_PROVIDER(pp);
  633         KASSERT(LIST_EMPTY(&pp->consumers),
  634             ("g_destroy_provider but attached"));
  635         KASSERT (pp->acr == 0, ("g_destroy_provider with acr"));
  636         KASSERT (pp->acw == 0, ("g_destroy_provider with acw"));
  637         KASSERT (pp->ace == 0, ("g_destroy_provider with ace"));
  638         g_cancel_event(pp);
  639         LIST_REMOVE(pp, provider);
  640         gp = pp->geom;
  641         devstat_remove_entry(pp->stat);
  642         /*
  643          * If a callback was provided, send notification that the provider
  644          * is now gone.
  645          */
  646         if (gp->providergone != NULL)
  647                 gp->providergone(pp);
  648 
  649         g_free(pp);
  650         if ((gp->flags & G_GEOM_WITHER))
  651                 g_do_wither();
  652 }
  653 
  654 /*
  655  * We keep the "geoms" list sorted by topological order (== increasing
  656  * numerical rank) at all times.
  657  * When an attach is done, the attaching geoms rank is invalidated
  658  * and it is moved to the tail of the list.
  659  * All geoms later in the sequence has their ranks reevaluated in
  660  * sequence.  If we cannot assign rank to a geom because it's
  661  * prerequisites do not have rank, we move that element to the tail
  662  * of the sequence with invalid rank as well.
  663  * At some point we encounter our original geom and if we stil fail
  664  * to assign it a rank, there must be a loop and we fail back to
  665  * g_attach() which detach again and calls redo_rank again
  666  * to fix up the damage.
  667  * It would be much simpler code wise to do it recursively, but we
  668  * can't risk that on the kernel stack.
  669  */
  670 
  671 static int
  672 redo_rank(struct g_geom *gp)
  673 {
  674         struct g_consumer *cp;
  675         struct g_geom *gp1, *gp2;
  676         int n, m;
  677 
  678         g_topology_assert();
  679         G_VALID_GEOM(gp);
  680 
  681         /* Invalidate this geoms rank and move it to the tail */
  682         gp1 = TAILQ_NEXT(gp, geoms);
  683         if (gp1 != NULL) {
  684                 gp->rank = 0;
  685                 TAILQ_REMOVE(&geoms, gp, geoms);
  686                 TAILQ_INSERT_TAIL(&geoms, gp, geoms);
  687         } else {
  688                 gp1 = gp;
  689         }
  690 
  691         /* re-rank the rest of the sequence */
  692         for (; gp1 != NULL; gp1 = gp2) {
  693                 gp1->rank = 0;
  694                 m = 1;
  695                 LIST_FOREACH(cp, &gp1->consumer, consumer) {
  696                         if (cp->provider == NULL)
  697                                 continue;
  698                         n = cp->provider->geom->rank;
  699                         if (n == 0) {
  700                                 m = 0;
  701                                 break;
  702                         } else if (n >= m)
  703                                 m = n + 1;
  704                 }
  705                 gp1->rank = m;
  706                 gp2 = TAILQ_NEXT(gp1, geoms);
  707 
  708                 /* got a rank, moving on */
  709                 if (m != 0)
  710                         continue;
  711 
  712                 /* no rank to original geom means loop */
  713                 if (gp == gp1) 
  714                         return (ELOOP);
  715 
  716                 /* no rank, put it at the end move on */
  717                 TAILQ_REMOVE(&geoms, gp1, geoms);
  718                 TAILQ_INSERT_TAIL(&geoms, gp1, geoms);
  719         }
  720         return (0);
  721 }
  722 
  723 int
  724 g_attach(struct g_consumer *cp, struct g_provider *pp)
  725 {
  726         int error;
  727 
  728         g_topology_assert();
  729         G_VALID_CONSUMER(cp);
  730         G_VALID_PROVIDER(pp);
  731         g_trace(G_T_TOPOLOGY, "g_attach(%p, %p)", cp, pp);
  732         KASSERT(cp->provider == NULL, ("attach but attached"));
  733         cp->provider = pp;
  734         LIST_INSERT_HEAD(&pp->consumers, cp, consumers);
  735         error = redo_rank(cp->geom);
  736         if (error) {
  737                 LIST_REMOVE(cp, consumers);
  738                 cp->provider = NULL;
  739                 redo_rank(cp->geom);
  740         }
  741         return (error);
  742 }
  743 
  744 void
  745 g_detach(struct g_consumer *cp)
  746 {
  747         struct g_provider *pp;
  748 
  749         g_topology_assert();
  750         G_VALID_CONSUMER(cp);
  751         g_trace(G_T_TOPOLOGY, "g_detach(%p)", cp);
  752         KASSERT(cp->provider != NULL, ("detach but not attached"));
  753         KASSERT(cp->acr == 0, ("detach but nonzero acr"));
  754         KASSERT(cp->acw == 0, ("detach but nonzero acw"));
  755         KASSERT(cp->ace == 0, ("detach but nonzero ace"));
  756         KASSERT(cp->nstart == cp->nend,
  757             ("detach with active requests"));
  758         pp = cp->provider;
  759         LIST_REMOVE(cp, consumers);
  760         cp->provider = NULL;
  761         if ((cp->geom->flags & G_GEOM_WITHER) ||
  762             (pp->geom->flags & G_GEOM_WITHER) ||
  763             (pp->flags & G_PF_WITHER))
  764                 g_do_wither();
  765         redo_rank(cp->geom);
  766 }
  767 
  768 /*
  769  * g_access()
  770  *
  771  * Access-check with delta values.  The question asked is "can provider
  772  * "cp" change the access counters by the relative amounts dc[rwe] ?"
  773  */
  774 
  775 int
  776 g_access(struct g_consumer *cp, int dcr, int dcw, int dce)
  777 {
  778         struct g_provider *pp;
  779         int pr,pw,pe;
  780         int error;
  781 
  782         g_topology_assert();
  783         G_VALID_CONSUMER(cp);
  784         pp = cp->provider;
  785         KASSERT(pp != NULL, ("access but not attached"));
  786         G_VALID_PROVIDER(pp);
  787 
  788         g_trace(G_T_ACCESS, "g_access(%p(%s), %d, %d, %d)",
  789             cp, pp->name, dcr, dcw, dce);
  790 
  791         KASSERT(cp->acr + dcr >= 0, ("access resulting in negative acr"));
  792         KASSERT(cp->acw + dcw >= 0, ("access resulting in negative acw"));
  793         KASSERT(cp->ace + dce >= 0, ("access resulting in negative ace"));
  794         KASSERT(dcr != 0 || dcw != 0 || dce != 0, ("NOP access request"));
  795         KASSERT(pp->geom->access != NULL, ("NULL geom->access"));
  796 
  797         /*
  798          * If our class cares about being spoiled, and we have been, we
  799          * are probably just ahead of the event telling us that.  Fail
  800          * now rather than having to unravel this later.
  801          */
  802         if (cp->geom->spoiled != NULL && (cp->flags & G_CF_SPOILED) &&
  803             (dcr > 0 || dcw > 0 || dce > 0))
  804                 return (ENXIO);
  805 
  806         /*
  807          * Figure out what counts the provider would have had, if this
  808          * consumer had (r0w0e0) at this time.
  809          */
  810         pr = pp->acr - cp->acr;
  811         pw = pp->acw - cp->acw;
  812         pe = pp->ace - cp->ace;
  813 
  814         g_trace(G_T_ACCESS,
  815     "open delta:[r%dw%de%d] old:[r%dw%de%d] provider:[r%dw%de%d] %p(%s)",
  816             dcr, dcw, dce,
  817             cp->acr, cp->acw, cp->ace,
  818             pp->acr, pp->acw, pp->ace,
  819             pp, pp->name);
  820 
  821         /* If foot-shooting is enabled, any open on rank#1 is OK */
  822         if ((g_debugflags & 16) && pp->geom->rank == 1)
  823                 ;
  824         /* If we try exclusive but already write: fail */
  825         else if (dce > 0 && pw > 0)
  826                 return (EPERM);
  827         /* If we try write but already exclusive: fail */
  828         else if (dcw > 0 && pe > 0)
  829                 return (EPERM);
  830         /* If we try to open more but provider is error'ed: fail */
  831         else if ((dcr > 0 || dcw > 0 || dce > 0) && pp->error != 0)
  832                 return (pp->error);
  833 
  834         /* Ok then... */
  835 
  836         error = pp->geom->access(pp, dcr, dcw, dce);
  837         KASSERT(dcr > 0 || dcw > 0 || dce > 0 || error == 0,
  838             ("Geom provider %s::%s failed closing ->access()",
  839             pp->geom->class->name, pp->name));
  840         if (!error) {
  841                 /*
  842                  * If we open first write, spoil any partner consumers.
  843                  * If we close last write and provider is not errored,
  844                  * trigger re-taste.
  845                  */
  846                 if (pp->acw == 0 && dcw != 0)
  847                         g_spoil(pp, cp);
  848                 else if (pp->acw != 0 && pp->acw == -dcw && pp->error == 0 &&
  849                     !(pp->geom->flags & G_GEOM_WITHER))
  850                         g_post_event(g_new_provider_event, pp, M_WAITOK, 
  851                             pp, NULL);
  852 
  853                 pp->acr += dcr;
  854                 pp->acw += dcw;
  855                 pp->ace += dce;
  856                 cp->acr += dcr;
  857                 cp->acw += dcw;
  858                 cp->ace += dce;
  859                 if (pp->acr != 0 || pp->acw != 0 || pp->ace != 0)
  860                         KASSERT(pp->sectorsize > 0,
  861                             ("Provider %s lacks sectorsize", pp->name));
  862                 if ((cp->geom->flags & G_GEOM_WITHER) &&
  863                     cp->acr == 0 && cp->acw == 0 && cp->ace == 0)
  864                         g_do_wither();
  865         }
  866         return (error);
  867 }
  868 
  869 int
  870 g_handleattr_int(struct bio *bp, const char *attribute, int val)
  871 {
  872 
  873         return (g_handleattr(bp, attribute, &val, sizeof val));
  874 }
  875 
  876 int
  877 g_handleattr_off_t(struct bio *bp, const char *attribute, off_t val)
  878 {
  879 
  880         return (g_handleattr(bp, attribute, &val, sizeof val));
  881 }
  882 
  883 int
  884 g_handleattr_str(struct bio *bp, const char *attribute, const char *str)
  885 {
  886 
  887         return (g_handleattr(bp, attribute, str, 0));
  888 }
  889 
  890 int
  891 g_handleattr(struct bio *bp, const char *attribute, const void *val, int len)
  892 {
  893         int error = 0;
  894 
  895         if (strcmp(bp->bio_attribute, attribute))
  896                 return (0);
  897         if (len == 0) {
  898                 bzero(bp->bio_data, bp->bio_length);
  899                 if (strlcpy(bp->bio_data, val, bp->bio_length) >=
  900                     bp->bio_length) {
  901                         printf("%s: %s bio_length %jd len %zu -> EFAULT\n",
  902                             __func__, bp->bio_to->name,
  903                             (intmax_t)bp->bio_length, strlen(val));
  904                         error = EFAULT;
  905                 }
  906         } else if (bp->bio_length == len) {
  907                 bcopy(val, bp->bio_data, len);
  908         } else {
  909                 printf("%s: %s bio_length %jd len %d -> EFAULT\n", __func__,
  910                     bp->bio_to->name, (intmax_t)bp->bio_length, len);
  911                 error = EFAULT;
  912         }
  913         if (error == 0)
  914                 bp->bio_completed = bp->bio_length;
  915         g_io_deliver(bp, error);
  916         return (1);
  917 }
  918 
  919 int
  920 g_std_access(struct g_provider *pp,
  921         int dr __unused, int dw __unused, int de __unused)
  922 {
  923 
  924         g_topology_assert();
  925         G_VALID_PROVIDER(pp);
  926         return (0);
  927 }
  928 
  929 void
  930 g_std_done(struct bio *bp)
  931 {
  932         struct bio *bp2;
  933 
  934         bp2 = bp->bio_parent;
  935         if (bp2->bio_error == 0)
  936                 bp2->bio_error = bp->bio_error;
  937         bp2->bio_completed += bp->bio_completed;
  938         g_destroy_bio(bp);
  939         bp2->bio_inbed++;
  940         if (bp2->bio_children == bp2->bio_inbed)
  941                 g_io_deliver(bp2, bp2->bio_error);
  942 }
  943 
  944 /* XXX: maybe this is only g_slice_spoiled */
  945 
  946 void
  947 g_std_spoiled(struct g_consumer *cp)
  948 {
  949         struct g_geom *gp;
  950         struct g_provider *pp;
  951 
  952         g_topology_assert();
  953         G_VALID_CONSUMER(cp);
  954         g_trace(G_T_TOPOLOGY, "g_std_spoiled(%p)", cp);
  955         cp->flags |= G_CF_ORPHAN;
  956         g_detach(cp);
  957         gp = cp->geom;
  958         LIST_FOREACH(pp, &gp->provider, provider)
  959                 g_orphan_provider(pp, ENXIO);
  960         g_destroy_consumer(cp);
  961         if (LIST_EMPTY(&gp->provider) && LIST_EMPTY(&gp->consumer))
  962                 g_destroy_geom(gp);
  963         else
  964                 gp->flags |= G_GEOM_WITHER;
  965 }
  966 
  967 /*
  968  * Spoiling happens when a provider is opened for writing, but consumers
  969  * which are configured by in-band data are attached (slicers for instance).
  970  * Since the write might potentially change the in-band data, such consumers
  971  * need to re-evaluate their existence after the writing session closes.
  972  * We do this by (offering to) tear them down when the open for write happens
  973  * in return for a re-taste when it closes again.
  974  * Together with the fact that such consumers grab an 'e' bit whenever they
  975  * are open, regardless of mode, this ends up DTRT.
  976  */
  977 
  978 static void
  979 g_spoil_event(void *arg, int flag)
  980 {
  981         struct g_provider *pp;
  982         struct g_consumer *cp, *cp2;
  983 
  984         g_topology_assert();
  985         if (flag == EV_CANCEL)
  986                 return;
  987         pp = arg;
  988         G_VALID_PROVIDER(pp);
  989         for (cp = LIST_FIRST(&pp->consumers); cp != NULL; cp = cp2) {
  990                 cp2 = LIST_NEXT(cp, consumers);
  991                 if ((cp->flags & G_CF_SPOILED) == 0)
  992                         continue;
  993                 cp->flags &= ~G_CF_SPOILED;
  994                 if (cp->geom->spoiled == NULL)
  995                         continue;
  996                 cp->geom->spoiled(cp);
  997                 g_topology_assert();
  998         }
  999 }
 1000 
 1001 void
 1002 g_spoil(struct g_provider *pp, struct g_consumer *cp)
 1003 {
 1004         struct g_consumer *cp2;
 1005 
 1006         g_topology_assert();
 1007         G_VALID_PROVIDER(pp);
 1008         G_VALID_CONSUMER(cp);
 1009 
 1010         LIST_FOREACH(cp2, &pp->consumers, consumers) {
 1011                 if (cp2 == cp)
 1012                         continue;
 1013 /*
 1014                 KASSERT(cp2->acr == 0, ("spoiling cp->acr = %d", cp2->acr));
 1015                 KASSERT(cp2->acw == 0, ("spoiling cp->acw = %d", cp2->acw));
 1016 */
 1017                 KASSERT(cp2->ace == 0, ("spoiling cp->ace = %d", cp2->ace));
 1018                 cp2->flags |= G_CF_SPOILED;
 1019         }
 1020         g_post_event(g_spoil_event, pp, M_WAITOK, pp, NULL);
 1021 }
 1022 
 1023 static void
 1024 g_media_changed_event(void *arg, int flag)
 1025 {
 1026         struct g_provider *pp;
 1027         int retaste;
 1028 
 1029         g_topology_assert();
 1030         if (flag == EV_CANCEL)
 1031                 return;
 1032         pp = arg;
 1033         G_VALID_PROVIDER(pp);
 1034 
 1035         /*
 1036          * If provider was not open for writing, queue retaste after spoiling.
 1037          * If it was, retaste will happen automatically on close.
 1038          */
 1039         retaste = (pp->acw == 0 && pp->error == 0 &&
 1040             !(pp->geom->flags & G_GEOM_WITHER));
 1041         g_spoil_event(arg, flag);
 1042         if (retaste)
 1043                 g_post_event(g_new_provider_event, pp, M_WAITOK, pp, NULL);
 1044 }
 1045 
 1046 int
 1047 g_media_changed(struct g_provider *pp, int flag)
 1048 {
 1049         struct g_consumer *cp;
 1050 
 1051         LIST_FOREACH(cp, &pp->consumers, consumers)
 1052                 cp->flags |= G_CF_SPOILED;
 1053         return (g_post_event(g_media_changed_event, pp, flag, pp, NULL));
 1054 }
 1055 
 1056 int
 1057 g_media_gone(struct g_provider *pp, int flag)
 1058 {
 1059         struct g_consumer *cp;
 1060 
 1061         LIST_FOREACH(cp, &pp->consumers, consumers)
 1062                 cp->flags |= G_CF_SPOILED;
 1063         return (g_post_event(g_spoil_event, pp, flag, pp, NULL));
 1064 }
 1065 
 1066 int
 1067 g_getattr__(const char *attr, struct g_consumer *cp, void *var, int len)
 1068 {
 1069         int error, i;
 1070 
 1071         i = len;
 1072         error = g_io_getattr(attr, cp, &i, var);
 1073         if (error)
 1074                 return (error);
 1075         if (i != len)
 1076                 return (EINVAL);
 1077         return (0);
 1078 }
 1079 
 1080 static int
 1081 g_get_device_prefix_len(const char *name)
 1082 {
 1083         int len;
 1084 
 1085         if (strncmp(name, "ada", 3) == 0)
 1086                 len = 3;
 1087         else if (strncmp(name, "ad", 2) == 0)
 1088                 len = 2;
 1089         else
 1090                 return (0);
 1091         if (name[len] < '' || name[len] > '9')
 1092                 return (0);
 1093         do {
 1094                 len++;
 1095         } while (name[len] >= '' && name[len] <= '9');
 1096         return (len);
 1097 }
 1098 
 1099 int
 1100 g_compare_names(const char *namea, const char *nameb)
 1101 {
 1102         int deva, devb;
 1103 
 1104         if (strcmp(namea, nameb) == 0)
 1105                 return (1);
 1106         deva = g_get_device_prefix_len(namea);
 1107         if (deva == 0)
 1108                 return (0);
 1109         devb = g_get_device_prefix_len(nameb);
 1110         if (devb == 0)
 1111                 return (0);
 1112         if (strcmp(namea + deva, nameb + devb) == 0)
 1113                 return (1);
 1114         return (0);
 1115 }
 1116 
 1117 #if defined(DIAGNOSTIC) || defined(DDB)
 1118 /*
 1119  * This function walks the mesh and returns a non-zero integer if it
 1120  * finds the argument pointer is an object. The return value indicates
 1121  * which type of object it is believed to be. If topology is not locked,
 1122  * this function is potentially dangerous, but we don't assert that the
 1123  * topology lock is held when called from debugger.
 1124  */
 1125 int
 1126 g_valid_obj(void const *ptr)
 1127 {
 1128         struct g_class *mp;
 1129         struct g_geom *gp;
 1130         struct g_consumer *cp;
 1131         struct g_provider *pp;
 1132 
 1133 #ifdef KDB
 1134         if (kdb_active == 0)
 1135 #endif
 1136                 g_topology_assert();
 1137 
 1138         LIST_FOREACH(mp, &g_classes, class) {
 1139                 if (ptr == mp)
 1140                         return (1);
 1141                 LIST_FOREACH(gp, &mp->geom, geom) {
 1142                         if (ptr == gp)
 1143                                 return (2);
 1144                         LIST_FOREACH(cp, &gp->consumer, consumer)
 1145                                 if (ptr == cp)
 1146                                         return (3);
 1147                         LIST_FOREACH(pp, &gp->provider, provider)
 1148                                 if (ptr == pp)
 1149                                         return (4);
 1150                 }
 1151         }
 1152         return(0);
 1153 }
 1154 #endif
 1155 
 1156 #ifdef DDB
 1157 
 1158 #define gprintf(...)    do {                                            \
 1159         db_printf("%*s", indent, "");                                   \
 1160         db_printf(__VA_ARGS__);                                         \
 1161 } while (0)
 1162 #define gprintln(...)   do {                                            \
 1163         gprintf(__VA_ARGS__);                                           \
 1164         db_printf("\n");                                                \
 1165 } while (0)
 1166 
 1167 #define ADDFLAG(obj, flag, sflag)       do {                            \
 1168         if ((obj)->flags & (flag)) {                                    \
 1169                 if (comma)                                              \
 1170                         strlcat(str, ",", size);                        \
 1171                 strlcat(str, (sflag), size);                            \
 1172                 comma = 1;                                              \
 1173         }                                                               \
 1174 } while (0)
 1175 
 1176 static char *
 1177 provider_flags_to_string(struct g_provider *pp, char *str, size_t size)
 1178 {
 1179         int comma = 0;
 1180 
 1181         bzero(str, size);
 1182         if (pp->flags == 0) {
 1183                 strlcpy(str, "NONE", size);
 1184                 return (str);
 1185         }
 1186         ADDFLAG(pp, G_PF_CANDELETE, "G_PF_CANDELETE");
 1187         ADDFLAG(pp, G_PF_WITHER, "G_PF_WITHER");
 1188         ADDFLAG(pp, G_PF_ORPHAN, "G_PF_ORPHAN");
 1189         return (str);
 1190 }
 1191 
 1192 static char *
 1193 geom_flags_to_string(struct g_geom *gp, char *str, size_t size)
 1194 {
 1195         int comma = 0;
 1196 
 1197         bzero(str, size);
 1198         if (gp->flags == 0) {
 1199                 strlcpy(str, "NONE", size);
 1200                 return (str);
 1201         }
 1202         ADDFLAG(gp, G_GEOM_WITHER, "G_GEOM_WITHER");
 1203         return (str);
 1204 }
 1205 static void
 1206 db_show_geom_consumer(int indent, struct g_consumer *cp)
 1207 {
 1208 
 1209         if (indent == 0) {
 1210                 gprintln("consumer: %p", cp);
 1211                 gprintln("  class:    %s (%p)", cp->geom->class->name,
 1212                     cp->geom->class);
 1213                 gprintln("  geom:     %s (%p)", cp->geom->name, cp->geom);
 1214                 if (cp->provider == NULL)
 1215                         gprintln("  provider: none");
 1216                 else {
 1217                         gprintln("  provider: %s (%p)", cp->provider->name,
 1218                             cp->provider);
 1219                 }
 1220                 gprintln("  access:   r%dw%de%d", cp->acr, cp->acw, cp->ace);
 1221                 gprintln("  flags:    0x%04x", cp->flags);
 1222                 gprintln("  nstart:   %u", cp->nstart);
 1223                 gprintln("  nend:     %u", cp->nend);
 1224         } else {
 1225                 gprintf("consumer: %p (%s), access=r%dw%de%d", cp,
 1226                     cp->provider != NULL ? cp->provider->name : "none",
 1227                     cp->acr, cp->acw, cp->ace);
 1228                 if (cp->flags)
 1229                         db_printf(", flags=0x%04x", cp->flags);
 1230                 db_printf("\n");
 1231         }
 1232 }
 1233 
 1234 static void
 1235 db_show_geom_provider(int indent, struct g_provider *pp)
 1236 {
 1237         struct g_consumer *cp;
 1238         char flags[64];
 1239 
 1240         if (indent == 0) {
 1241                 gprintln("provider: %s (%p)", pp->name, pp);
 1242                 gprintln("  class:        %s (%p)", pp->geom->class->name,
 1243                     pp->geom->class);
 1244                 gprintln("  geom:         %s (%p)", pp->geom->name, pp->geom);
 1245                 gprintln("  mediasize:    %jd", (intmax_t)pp->mediasize);
 1246                 gprintln("  sectorsize:   %u", pp->sectorsize);
 1247                 gprintln("  stripesize:   %u", pp->stripesize);
 1248                 gprintln("  stripeoffset: %u", pp->stripeoffset);
 1249                 gprintln("  access:       r%dw%de%d", pp->acr, pp->acw,
 1250                     pp->ace);
 1251                 gprintln("  flags:        %s (0x%04x)",
 1252                     provider_flags_to_string(pp, flags, sizeof(flags)),
 1253                     pp->flags);
 1254                 gprintln("  error:        %d", pp->error);
 1255                 gprintln("  nstart:       %u", pp->nstart);
 1256                 gprintln("  nend:         %u", pp->nend);
 1257                 if (LIST_EMPTY(&pp->consumers))
 1258                         gprintln("  consumers:    none");
 1259         } else {
 1260                 gprintf("provider: %s (%p), access=r%dw%de%d",
 1261                     pp->name, pp, pp->acr, pp->acw, pp->ace);
 1262                 if (pp->flags != 0) {
 1263                         db_printf(", flags=%s (0x%04x)",
 1264                             provider_flags_to_string(pp, flags, sizeof(flags)),
 1265                             pp->flags);
 1266                 }
 1267                 db_printf("\n");
 1268         }
 1269         if (!LIST_EMPTY(&pp->consumers)) {
 1270                 LIST_FOREACH(cp, &pp->consumers, consumers) {
 1271                         db_show_geom_consumer(indent + 2, cp);
 1272                         if (db_pager_quit)
 1273                                 break;
 1274                 }
 1275         }
 1276 }
 1277 
 1278 static void
 1279 db_show_geom_geom(int indent, struct g_geom *gp)
 1280 {
 1281         struct g_provider *pp;
 1282         struct g_consumer *cp;
 1283         char flags[64];
 1284 
 1285         if (indent == 0) {
 1286                 gprintln("geom: %s (%p)", gp->name, gp);
 1287                 gprintln("  class:     %s (%p)", gp->class->name, gp->class);
 1288                 gprintln("  flags:     %s (0x%04x)",
 1289                     geom_flags_to_string(gp, flags, sizeof(flags)), gp->flags);
 1290                 gprintln("  rank:      %d", gp->rank);
 1291                 if (LIST_EMPTY(&gp->provider))
 1292                         gprintln("  providers: none");
 1293                 if (LIST_EMPTY(&gp->consumer))
 1294                         gprintln("  consumers: none");
 1295         } else {
 1296                 gprintf("geom: %s (%p), rank=%d", gp->name, gp, gp->rank);
 1297                 if (gp->flags != 0) {
 1298                         db_printf(", flags=%s (0x%04x)",
 1299                             geom_flags_to_string(gp, flags, sizeof(flags)),
 1300                             gp->flags);
 1301                 }
 1302                 db_printf("\n");
 1303         }
 1304         if (!LIST_EMPTY(&gp->provider)) {
 1305                 LIST_FOREACH(pp, &gp->provider, provider) {
 1306                         db_show_geom_provider(indent + 2, pp);
 1307                         if (db_pager_quit)
 1308                                 break;
 1309                 }
 1310         }
 1311         if (!LIST_EMPTY(&gp->consumer)) {
 1312                 LIST_FOREACH(cp, &gp->consumer, consumer) {
 1313                         db_show_geom_consumer(indent + 2, cp);
 1314                         if (db_pager_quit)
 1315                                 break;
 1316                 }
 1317         }
 1318 }
 1319 
 1320 static void
 1321 db_show_geom_class(struct g_class *mp)
 1322 {
 1323         struct g_geom *gp;
 1324 
 1325         db_printf("class: %s (%p)\n", mp->name, mp);
 1326         LIST_FOREACH(gp, &mp->geom, geom) {
 1327                 db_show_geom_geom(2, gp);
 1328                 if (db_pager_quit)
 1329                         break;
 1330         }
 1331 }
 1332 
 1333 /*
 1334  * Print the GEOM topology or the given object.
 1335  */
 1336 DB_SHOW_COMMAND(geom, db_show_geom)
 1337 {
 1338         struct g_class *mp;
 1339 
 1340         if (!have_addr) {
 1341                 /* No address given, print the entire topology. */
 1342                 LIST_FOREACH(mp, &g_classes, class) {
 1343                         db_show_geom_class(mp);
 1344                         db_printf("\n");
 1345                         if (db_pager_quit)
 1346                                 break;
 1347                 }
 1348         } else {
 1349                 switch (g_valid_obj((void *)addr)) {
 1350                 case 1:
 1351                         db_show_geom_class((struct g_class *)addr);
 1352                         break;
 1353                 case 2:
 1354                         db_show_geom_geom(0, (struct g_geom *)addr);
 1355                         break;
 1356                 case 3:
 1357                         db_show_geom_consumer(0, (struct g_consumer *)addr);
 1358                         break;
 1359                 case 4:
 1360                         db_show_geom_provider(0, (struct g_provider *)addr);
 1361                         break;
 1362                 default:
 1363                         db_printf("Not a GEOM object.\n");
 1364                         break;
 1365                 }
 1366         }
 1367 }
 1368 
 1369 static void
 1370 db_print_bio_cmd(struct bio *bp)
 1371 {
 1372         db_printf("  cmd: ");
 1373         switch (bp->bio_cmd) {
 1374         case BIO_READ: db_printf("BIO_READ"); break;
 1375         case BIO_WRITE: db_printf("BIO_WRITE"); break;
 1376         case BIO_DELETE: db_printf("BIO_DELETE"); break;
 1377         case BIO_GETATTR: db_printf("BIO_GETATTR"); break;
 1378         case BIO_FLUSH: db_printf("BIO_FLUSH"); break;
 1379         case BIO_CMD0: db_printf("BIO_CMD0"); break;
 1380         case BIO_CMD1: db_printf("BIO_CMD1"); break;
 1381         case BIO_CMD2: db_printf("BIO_CMD2"); break;
 1382         default: db_printf("UNKNOWN"); break;
 1383         }
 1384         db_printf("\n");
 1385 }
 1386 
 1387 static void
 1388 db_print_bio_flags(struct bio *bp)
 1389 {
 1390         int comma;
 1391 
 1392         comma = 0;
 1393         db_printf("  flags: ");
 1394         if (bp->bio_flags & BIO_ERROR) {
 1395                 db_printf("BIO_ERROR");
 1396                 comma = 1;
 1397         }
 1398         if (bp->bio_flags & BIO_DONE) {
 1399                 db_printf("%sBIO_DONE", (comma ? ", " : ""));
 1400                 comma = 1;
 1401         }
 1402         if (bp->bio_flags & BIO_ONQUEUE)
 1403                 db_printf("%sBIO_ONQUEUE", (comma ? ", " : ""));
 1404         db_printf("\n");
 1405 }
 1406 
 1407 /*
 1408  * Print useful information in a BIO
 1409  */
 1410 DB_SHOW_COMMAND(bio, db_show_bio)
 1411 {
 1412         struct bio *bp;
 1413 
 1414         if (have_addr) {
 1415                 bp = (struct bio *)addr;
 1416                 db_printf("BIO %p\n", bp);
 1417                 db_print_bio_cmd(bp);
 1418                 db_print_bio_flags(bp);
 1419                 db_printf("  cflags: 0x%hhx\n", bp->bio_cflags);
 1420                 db_printf("  pflags: 0x%hhx\n", bp->bio_pflags);
 1421                 db_printf("  offset: %jd\n", (intmax_t)bp->bio_offset);
 1422                 db_printf("  length: %jd\n", (intmax_t)bp->bio_length);
 1423                 db_printf("  bcount: %ld\n", bp->bio_bcount);
 1424                 db_printf("  resid: %ld\n", bp->bio_resid);
 1425                 db_printf("  completed: %jd\n", (intmax_t)bp->bio_completed);
 1426                 db_printf("  children: %u\n", bp->bio_children);
 1427                 db_printf("  inbed: %u\n", bp->bio_inbed);
 1428                 db_printf("  error: %d\n", bp->bio_error);
 1429                 db_printf("  parent: %p\n", bp->bio_parent);
 1430                 db_printf("  driver1: %p\n", bp->bio_driver1);
 1431                 db_printf("  driver2: %p\n", bp->bio_driver2);
 1432                 db_printf("  caller1: %p\n", bp->bio_caller1);
 1433                 db_printf("  caller2: %p\n", bp->bio_caller2);
 1434                 db_printf("  bio_from: %p\n", bp->bio_from);
 1435                 db_printf("  bio_to: %p\n", bp->bio_to);
 1436         }
 1437 }
 1438 
 1439 #undef  gprintf
 1440 #undef  gprintln
 1441 #undef  ADDFLAG
 1442 
 1443 #endif  /* DDB */

Cache object: 91a3e903c7bbdf183d9231c02112539c


[ 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.