2 * Copyright (c) 2002 Poul-Henning Kamp
3 * Copyright (c) 2002 Networks Associates Technology, Inc.
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.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
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
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
36 #include <sys/cdefs.h>
37 __FBSDID("$FreeBSD$");
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>
47 #include <sys/sysctl.h>
49 #include <sys/kthread.h>
51 #include <sys/mutex.h>
52 #include <sys/errno.h>
54 #include <geom/geom.h>
55 #include <geom/geom_int.h>
56 #include <machine/stdarg.h>
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;
77 * This event offers a new class a chance to taste all preexisting providers.
80 g_load_class(void *arg, int flag)
83 struct g_class *mp2, *mp;
85 struct g_provider *pp;
88 if (flag == EV_CANCEL) /* XXX: can't happen ? */
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) {
105 printf("The GEOM class %s is already loaded.\n",
110 } else if (strcmp(mp2->name, mp->name) == 0) {
111 printf("A GEOM class %s is already loaded.\n",
119 LIST_INIT(&mp->geom);
120 LIST_INSERT_HEAD(&g_classes, mp, class);
121 if (mp->init != NULL)
123 if (mp->taste == NULL)
125 LIST_FOREACH(mp2, &g_classes, class) {
128 LIST_FOREACH(gp, &mp2->geom, geom) {
129 LIST_FOREACH(pp, &gp->provider, provider) {
130 mp->taste(mp, pp, 0);
138 g_unload_class(struct g_class *mp)
141 struct g_provider *pp;
142 struct g_consumer *cp;
146 g_trace(G_T_TOPOLOGY, "g_unload_class(%s)", mp->name);
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) {
156 LIST_FOREACH(cp, &gp->consumer, consumer)
157 if (cp->acr || cp->acw || cp->ace) {
161 /* If the geom is withering, wait for it to finish. */
162 if (gp->flags & G_GEOM_WITHER) {
163 g_topology_sleep(mp, 1);
169 * We allow unloading if we have no geoms, or a class
170 * method we can use to get rid of them.
172 if (!LIST_EMPTY(&mp->geom) && mp->destroy_geom == NULL) {
177 /* Bar new entries */
181 LIST_FOREACH(gp, &mp->geom, geom) {
182 error = mp->destroy_geom(NULL, mp, gp);
188 /* Wait for withering to finish. */
190 gp = LIST_FIRST(&mp->geom);
193 KASSERT(gp->flags & G_GEOM_WITHER,
194 ("Non-withering geom in class %s", mp->name));
195 g_topology_sleep(mp, 1);
198 if (mp->fini != NULL)
200 LIST_REMOVE(mp, class);
207 g_modevent(module_t mod, int type, void *data)
211 static int g_ignition;
215 if (mp->version != G_VERSION) {
216 printf("GEOM class %s has Wrong version %x\n",
217 mp->name, mp->version);
227 g_trace(G_T_TOPOLOGY, "g_modevent(%s, LOAD)", mp->name);
228 hh = g_malloc(sizeof *hh, M_WAITOK | M_ZERO);
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.
237 error = g_post_event(g_load_class, hh, M_WAITOK, NULL);
239 error = g_waitfor_event(g_load_class, hh, M_WAITOK,
247 g_trace(G_T_TOPOLOGY, "g_modevent(%s, UNLOAD)", mp->name);
249 error = g_unload_class(mp);
252 KASSERT(LIST_EMPTY(&mp->geom),
253 ("Unloaded class (%s) still has geom", mp->name));
261 g_retaste_event(void *arg, int flag)
263 struct g_class *mp, *mp2;
266 struct g_provider *pp;
267 struct g_consumer *cp;
270 if (flag == EV_CANCEL) /* XXX: can't happen ? */
282 g_trace(G_T_TOPOLOGY, "g_retaste(%s)", mp->name);
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)
289 LIST_FOREACH(cp, &pp->consumers, consumers) {
290 if (cp->geom->class == mp &&
291 (cp->flags & G_CF_ORPHAN) == 0)
295 cp->flags |= G_CF_ORPHAN;
296 g_wither_geom(cp->geom, ENXIO);
298 mp->taste(mp, pp, 0);
306 g_retaste(struct g_class *mp)
311 if (mp->taste == NULL)
314 hh = g_malloc(sizeof *hh, M_WAITOK | M_ZERO);
319 error = g_post_event(g_retaste_event, hh, M_WAITOK, NULL);
321 error = g_waitfor_event(g_retaste_event, hh, M_WAITOK, NULL);
331 g_new_geomf(struct g_class *mp, const char *fmt, ...)
339 sb = sbuf_new_auto();
341 sbuf_vprintf(sb, fmt, ap);
344 gp = g_malloc(sizeof *gp, M_WAITOK | M_ZERO);
345 gp->name = g_malloc(sbuf_len(sb) + 1, M_WAITOK | M_ZERO);
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));
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;
367 g_destroy_geom(struct g_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)));
380 LIST_REMOVE(gp, geom);
381 TAILQ_REMOVE(&geoms, gp, geoms);
387 * This function is called (repeatedly) until the geom has withered away.
390 g_wither_geom(struct g_geom *gp, int error)
392 struct g_provider *pp;
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);
407 * Convenience function to destroy a particular provider.
410 g_wither_provider(struct g_provider *pp, int error)
413 pp->flags |= G_PF_WITHER;
414 if (!(pp->flags & G_PF_ORPHAN))
415 g_orphan_provider(pp, error);
419 * This function is called (repeatedly) until the has withered away.
422 g_wither_geom_close(struct g_geom *gp, int error)
424 struct g_consumer *cp;
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);
436 * This function is called (repeatedly) until we cant wash away more
437 * withered bits at present. Return value contains two bits. Bit 0
438 * set means "withering stuff we can't wash now", bit 1 means "call
439 * me again, there may be stuff I didn't get the first time around.
445 struct g_geom *gp, *gp2;
446 struct g_provider *pp, *pp2;
447 struct g_consumer *cp, *cp2;
452 LIST_FOREACH(mp, &g_classes, class) {
453 LIST_FOREACH_SAFE(gp, &mp->geom, geom, gp2) {
454 LIST_FOREACH_SAFE(pp, &gp->provider, provider, pp2) {
455 if (!(pp->flags & G_PF_WITHER))
457 if (LIST_EMPTY(&pp->consumers))
458 g_destroy_provider(pp);
462 if (!(gp->flags & G_GEOM_WITHER))
464 LIST_FOREACH_SAFE(pp, &gp->provider, provider, pp2) {
465 if (LIST_EMPTY(&pp->consumers))
466 g_destroy_provider(pp);
470 LIST_FOREACH_SAFE(cp, &gp->consumer, consumer, cp2) {
471 if (cp->acr || cp->acw || cp->ace) {
475 if (cp->provider != NULL)
477 g_destroy_consumer(cp);
480 if (LIST_EMPTY(&gp->provider) &&
481 LIST_EMPTY(&gp->consumer))
491 g_new_consumer(struct g_geom *gp)
493 struct g_consumer *cp;
497 KASSERT(!(gp->flags & G_GEOM_WITHER),
498 ("g_new_consumer on WITHERing geom(%s) (class %s)",
499 gp->name, gp->class->name));
500 KASSERT(gp->orphan != NULL,
501 ("g_new_consumer on geom(%s) (class %s) without orphan",
502 gp->name, gp->class->name));
504 cp = g_malloc(sizeof *cp, M_WAITOK | M_ZERO);
506 cp->stat = devstat_new_entry(cp, -1, 0, DEVSTAT_ALL_SUPPORTED,
507 DEVSTAT_TYPE_DIRECT, DEVSTAT_PRIORITY_MAX);
508 LIST_INSERT_HEAD(&gp->consumer, cp, consumer);
513 g_destroy_consumer(struct g_consumer *cp)
518 G_VALID_CONSUMER(cp);
519 g_trace(G_T_TOPOLOGY, "g_destroy_consumer(%p)", cp);
520 KASSERT (cp->provider == NULL, ("g_destroy_consumer but attached"));
521 KASSERT (cp->acr == 0, ("g_destroy_consumer with acr"));
522 KASSERT (cp->acw == 0, ("g_destroy_consumer with acw"));
523 KASSERT (cp->ace == 0, ("g_destroy_consumer with ace"));
526 LIST_REMOVE(cp, consumer);
527 devstat_remove_entry(cp->stat);
529 if (gp->flags & G_GEOM_WITHER)
534 g_new_provider_event(void *arg, int flag)
537 struct g_provider *pp;
538 struct g_consumer *cp, *next_cp;
541 if (flag == EV_CANCEL)
546 G_VALID_PROVIDER(pp);
547 KASSERT(!(pp->flags & G_PF_WITHER),
548 ("g_new_provider_event but withered"));
549 LIST_FOREACH_SAFE(cp, &pp->consumers, consumers, next_cp) {
550 if ((cp->flags & G_CF_ORPHAN) == 0 &&
551 cp->geom->attrchanged != NULL)
552 cp->geom->attrchanged(cp, "GEOM::media");
554 LIST_FOREACH(mp, &g_classes, class) {
555 if (mp->taste == NULL)
557 LIST_FOREACH(cp, &pp->consumers, consumers)
558 if (cp->geom->class == mp &&
559 (cp->flags & G_CF_ORPHAN) == 0)
563 mp->taste(mp, pp, 0);
570 g_new_providerf(struct g_geom *gp, const char *fmt, ...)
572 struct g_provider *pp;
578 KASSERT(gp->access != NULL,
579 ("new provider on geom(%s) without ->access (class %s)",
580 gp->name, gp->class->name));
581 KASSERT(gp->start != NULL,
582 ("new provider on geom(%s) without ->start (class %s)",
583 gp->name, gp->class->name));
584 KASSERT(!(gp->flags & G_GEOM_WITHER),
585 ("new provider on WITHERing geom(%s) (class %s)",
586 gp->name, gp->class->name));
587 sb = sbuf_new_auto();
589 sbuf_vprintf(sb, fmt, ap);
592 pp = g_malloc(sizeof *pp + sbuf_len(sb) + 1, M_WAITOK | M_ZERO);
593 pp->name = (char *)(pp + 1);
594 strcpy(pp->name, sbuf_data(sb));
596 LIST_INIT(&pp->consumers);
599 pp->stat = devstat_new_entry(pp, -1, 0, DEVSTAT_ALL_SUPPORTED,
600 DEVSTAT_TYPE_DIRECT, DEVSTAT_PRIORITY_MAX);
601 LIST_INSERT_HEAD(&gp->provider, pp, provider);
602 g_post_event(g_new_provider_event, pp, M_WAITOK, pp, gp, NULL);
607 g_error_provider(struct g_provider *pp, int error)
610 /* G_VALID_PROVIDER(pp); We may not have g_topology */
615 #define _PATH_DEV "/dev/"
619 g_provider_by_name(char const *arg)
623 struct g_provider *pp;
625 if (strncmp(arg, _PATH_DEV, sizeof(_PATH_DEV) - 1) == 0)
626 arg += sizeof(_PATH_DEV) - 1;
628 LIST_FOREACH(cp, &g_classes, class) {
629 LIST_FOREACH(gp, &cp->geom, geom) {
630 LIST_FOREACH(pp, &gp->provider, provider) {
631 if (!strcmp(arg, pp->name))
641 g_destroy_provider(struct g_provider *pp)
646 G_VALID_PROVIDER(pp);
647 KASSERT(LIST_EMPTY(&pp->consumers),
648 ("g_destroy_provider but attached"));
649 KASSERT (pp->acr == 0, ("g_destroy_provider with acr"));
650 KASSERT (pp->acw == 0, ("g_destroy_provider with acw"));
651 KASSERT (pp->ace == 0, ("g_destroy_provider with ace"));
653 LIST_REMOVE(pp, provider);
655 devstat_remove_entry(pp->stat);
657 * If a callback was provided, send notification that the provider
660 if (gp->providergone != NULL)
661 gp->providergone(pp);
664 if ((gp->flags & G_GEOM_WITHER))
669 * We keep the "geoms" list sorted by topological order (== increasing
670 * numerical rank) at all times.
671 * When an attach is done, the attaching geoms rank is invalidated
672 * and it is moved to the tail of the list.
673 * All geoms later in the sequence has their ranks reevaluated in
674 * sequence. If we cannot assign rank to a geom because it's
675 * prerequisites do not have rank, we move that element to the tail
676 * of the sequence with invalid rank as well.
677 * At some point we encounter our original geom and if we stil fail
678 * to assign it a rank, there must be a loop and we fail back to
679 * g_attach() which detach again and calls redo_rank again
680 * to fix up the damage.
681 * It would be much simpler code wise to do it recursively, but we
682 * can't risk that on the kernel stack.
686 redo_rank(struct g_geom *gp)
688 struct g_consumer *cp;
689 struct g_geom *gp1, *gp2;
695 /* Invalidate this geoms rank and move it to the tail */
696 gp1 = TAILQ_NEXT(gp, geoms);
699 TAILQ_REMOVE(&geoms, gp, geoms);
700 TAILQ_INSERT_TAIL(&geoms, gp, geoms);
705 /* re-rank the rest of the sequence */
706 for (; gp1 != NULL; gp1 = gp2) {
709 LIST_FOREACH(cp, &gp1->consumer, consumer) {
710 if (cp->provider == NULL)
712 n = cp->provider->geom->rank;
720 gp2 = TAILQ_NEXT(gp1, geoms);
722 /* got a rank, moving on */
726 /* no rank to original geom means loop */
730 /* no rank, put it at the end move on */
731 TAILQ_REMOVE(&geoms, gp1, geoms);
732 TAILQ_INSERT_TAIL(&geoms, gp1, geoms);
738 g_attach(struct g_consumer *cp, struct g_provider *pp)
743 G_VALID_CONSUMER(cp);
744 G_VALID_PROVIDER(pp);
745 g_trace(G_T_TOPOLOGY, "g_attach(%p, %p)", cp, pp);
746 KASSERT(cp->provider == NULL, ("attach but attached"));
748 LIST_INSERT_HEAD(&pp->consumers, cp, consumers);
749 error = redo_rank(cp->geom);
751 LIST_REMOVE(cp, consumers);
759 g_detach(struct g_consumer *cp)
761 struct g_provider *pp;
764 G_VALID_CONSUMER(cp);
765 g_trace(G_T_TOPOLOGY, "g_detach(%p)", cp);
766 KASSERT(cp->provider != NULL, ("detach but not attached"));
767 KASSERT(cp->acr == 0, ("detach but nonzero acr"));
768 KASSERT(cp->acw == 0, ("detach but nonzero acw"));
769 KASSERT(cp->ace == 0, ("detach but nonzero ace"));
770 KASSERT(cp->nstart == cp->nend,
771 ("detach with active requests"));
773 LIST_REMOVE(cp, consumers);
775 if (pp->geom->flags & G_GEOM_WITHER)
777 else if (pp->flags & G_PF_WITHER)
785 * Access-check with delta values. The question asked is "can provider
786 * "cp" change the access counters by the relative amounts dc[rwe] ?"
790 g_access(struct g_consumer *cp, int dcr, int dcw, int dce)
792 struct g_provider *pp;
797 G_VALID_CONSUMER(cp);
799 KASSERT(pp != NULL, ("access but not attached"));
800 G_VALID_PROVIDER(pp);
802 g_trace(G_T_ACCESS, "g_access(%p(%s), %d, %d, %d)",
803 cp, pp->name, dcr, dcw, dce);
805 KASSERT(cp->acr + dcr >= 0, ("access resulting in negative acr"));
806 KASSERT(cp->acw + dcw >= 0, ("access resulting in negative acw"));
807 KASSERT(cp->ace + dce >= 0, ("access resulting in negative ace"));
808 KASSERT(dcr != 0 || dcw != 0 || dce != 0, ("NOP access request"));
809 KASSERT(pp->geom->access != NULL, ("NULL geom->access"));
812 * If our class cares about being spoiled, and we have been, we
813 * are probably just ahead of the event telling us that. Fail
814 * now rather than having to unravel this later.
816 if (cp->geom->spoiled != NULL && (cp->flags & G_CF_SPOILED) &&
817 (dcr > 0 || dcw > 0 || dce > 0))
821 * Figure out what counts the provider would have had, if this
822 * consumer had (r0w0e0) at this time.
824 pr = pp->acr - cp->acr;
825 pw = pp->acw - cp->acw;
826 pe = pp->ace - cp->ace;
829 "open delta:[r%dw%de%d] old:[r%dw%de%d] provider:[r%dw%de%d] %p(%s)",
831 cp->acr, cp->acw, cp->ace,
832 pp->acr, pp->acw, pp->ace,
835 /* If foot-shooting is enabled, any open on rank#1 is OK */
836 if ((g_debugflags & 16) && pp->geom->rank == 1)
838 /* If we try exclusive but already write: fail */
839 else if (dce > 0 && pw > 0)
841 /* If we try write but already exclusive: fail */
842 else if (dcw > 0 && pe > 0)
844 /* If we try to open more but provider is error'ed: fail */
845 else if ((dcr > 0 || dcw > 0 || dce > 0) && pp->error != 0)
850 error = pp->geom->access(pp, dcr, dcw, dce);
851 KASSERT(dcr > 0 || dcw > 0 || dce > 0 || error == 0,
852 ("Geom provider %s::%s failed closing ->access()",
853 pp->geom->class->name, pp->name));
856 * If we open first write, spoil any partner consumers.
857 * If we close last write and provider is not errored,
860 if (pp->acw == 0 && dcw != 0)
862 else if (pp->acw != 0 && pp->acw == -dcw && pp->error == 0 &&
863 !(pp->geom->flags & G_GEOM_WITHER))
864 g_post_event(g_new_provider_event, pp, M_WAITOK,
873 if (pp->acr != 0 || pp->acw != 0 || pp->ace != 0)
874 KASSERT(pp->sectorsize > 0,
875 ("Provider %s lacks sectorsize", pp->name));
881 g_handleattr_int(struct bio *bp, const char *attribute, int val)
884 return (g_handleattr(bp, attribute, &val, sizeof val));
888 g_handleattr_off_t(struct bio *bp, const char *attribute, off_t val)
891 return (g_handleattr(bp, attribute, &val, sizeof val));
895 g_handleattr_str(struct bio *bp, const char *attribute, const char *str)
898 return (g_handleattr(bp, attribute, str, 0));
902 g_handleattr(struct bio *bp, const char *attribute, const void *val, int len)
906 if (strcmp(bp->bio_attribute, attribute))
909 bzero(bp->bio_data, bp->bio_length);
910 if (strlcpy(bp->bio_data, val, bp->bio_length) >=
912 printf("%s: %s bio_length %jd len %zu -> EFAULT\n",
913 __func__, bp->bio_to->name,
914 (intmax_t)bp->bio_length, strlen(val));
917 } else if (bp->bio_length == len) {
918 bcopy(val, bp->bio_data, len);
920 printf("%s: %s bio_length %jd len %d -> EFAULT\n", __func__,
921 bp->bio_to->name, (intmax_t)bp->bio_length, len);
925 bp->bio_completed = bp->bio_length;
926 g_io_deliver(bp, error);
931 g_std_access(struct g_provider *pp,
932 int dr __unused, int dw __unused, int de __unused)
936 G_VALID_PROVIDER(pp);
941 g_std_done(struct bio *bp)
945 bp2 = bp->bio_parent;
946 if (bp2->bio_error == 0)
947 bp2->bio_error = bp->bio_error;
948 bp2->bio_completed += bp->bio_completed;
951 if (bp2->bio_children == bp2->bio_inbed)
952 g_io_deliver(bp2, bp2->bio_error);
955 /* XXX: maybe this is only g_slice_spoiled */
958 g_std_spoiled(struct g_consumer *cp)
961 struct g_provider *pp;
964 G_VALID_CONSUMER(cp);
965 g_trace(G_T_TOPOLOGY, "g_std_spoiled(%p)", cp);
966 cp->flags |= G_CF_ORPHAN;
969 LIST_FOREACH(pp, &gp->provider, provider)
970 g_orphan_provider(pp, ENXIO);
971 g_destroy_consumer(cp);
972 if (LIST_EMPTY(&gp->provider) && LIST_EMPTY(&gp->consumer))
975 gp->flags |= G_GEOM_WITHER;
979 * Spoiling happens when a provider is opened for writing, but consumers
980 * which are configured by in-band data are attached (slicers for instance).
981 * Since the write might potentially change the in-band data, such consumers
982 * need to re-evaluate their existence after the writing session closes.
983 * We do this by (offering to) tear them down when the open for write happens
984 * in return for a re-taste when it closes again.
985 * Together with the fact that such consumers grab an 'e' bit whenever they
986 * are open, regardless of mode, this ends up DTRT.
990 g_spoil_event(void *arg, int flag)
992 struct g_provider *pp;
993 struct g_consumer *cp, *cp2;
996 if (flag == EV_CANCEL)
999 G_VALID_PROVIDER(pp);
1000 for (cp = LIST_FIRST(&pp->consumers); cp != NULL; cp = cp2) {
1001 cp2 = LIST_NEXT(cp, consumers);
1002 if ((cp->flags & G_CF_SPOILED) == 0)
1004 cp->flags &= ~G_CF_SPOILED;
1005 if (cp->geom->spoiled == NULL)
1007 cp->geom->spoiled(cp);
1008 g_topology_assert();
1013 g_spoil(struct g_provider *pp, struct g_consumer *cp)
1015 struct g_consumer *cp2;
1017 g_topology_assert();
1018 G_VALID_PROVIDER(pp);
1019 G_VALID_CONSUMER(cp);
1021 LIST_FOREACH(cp2, &pp->consumers, consumers) {
1025 KASSERT(cp2->acr == 0, ("spoiling cp->acr = %d", cp2->acr));
1026 KASSERT(cp2->acw == 0, ("spoiling cp->acw = %d", cp2->acw));
1028 KASSERT(cp2->ace == 0, ("spoiling cp->ace = %d", cp2->ace));
1029 cp2->flags |= G_CF_SPOILED;
1031 g_post_event(g_spoil_event, pp, M_WAITOK, pp, NULL);
1035 g_media_changed_event(void *arg, int flag)
1037 struct g_provider *pp;
1040 g_topology_assert();
1041 if (flag == EV_CANCEL)
1044 G_VALID_PROVIDER(pp);
1047 * If provider was not open for writing, queue retaste after spoiling.
1048 * If it was, retaste will happen automatically on close.
1050 retaste = (pp->acw == 0 && pp->error == 0 &&
1051 !(pp->geom->flags & G_GEOM_WITHER));
1052 g_spoil_event(arg, flag);
1054 g_post_event(g_new_provider_event, pp, M_WAITOK, pp, NULL);
1058 g_media_changed(struct g_provider *pp, int flag)
1060 struct g_consumer *cp;
1062 LIST_FOREACH(cp, &pp->consumers, consumers)
1063 cp->flags |= G_CF_SPOILED;
1064 return (g_post_event(g_media_changed_event, pp, flag, pp, NULL));
1068 g_media_gone(struct g_provider *pp, int flag)
1070 struct g_consumer *cp;
1072 LIST_FOREACH(cp, &pp->consumers, consumers)
1073 cp->flags |= G_CF_SPOILED;
1074 return (g_post_event(g_spoil_event, pp, flag, pp, NULL));
1078 g_getattr__(const char *attr, struct g_consumer *cp, void *var, int len)
1083 error = g_io_getattr(attr, cp, &i, var);
1092 g_get_device_prefix_len(const char *name)
1096 if (strncmp(name, "ada", 3) == 0)
1098 else if (strncmp(name, "ad", 2) == 0)
1102 if (name[len] < '0' || name[len] > '9')
1106 } while (name[len] >= '0' && name[len] <= '9');
1111 g_compare_names(const char *namea, const char *nameb)
1115 if (strcmp(namea, nameb) == 0)
1117 deva = g_get_device_prefix_len(namea);
1120 devb = g_get_device_prefix_len(nameb);
1123 if (strcmp(namea + deva, nameb + devb) == 0)
1128 #if defined(DIAGNOSTIC) || defined(DDB)
1130 * This function walks the mesh and returns a non-zero integer if it
1131 * finds the argument pointer is an object. The return value indicates
1132 * which type of object it is believed to be. If topology is not locked,
1133 * this function is potentially dangerous, but we don't assert that the
1134 * topology lock is held when called from debugger.
1137 g_valid_obj(void const *ptr)
1141 struct g_consumer *cp;
1142 struct g_provider *pp;
1145 if (kdb_active == 0)
1147 g_topology_assert();
1149 LIST_FOREACH(mp, &g_classes, class) {
1152 LIST_FOREACH(gp, &mp->geom, geom) {
1155 LIST_FOREACH(cp, &gp->consumer, consumer)
1158 LIST_FOREACH(pp, &gp->provider, provider)
1169 #define gprintf(...) do { \
1170 db_printf("%*s", indent, ""); \
1171 db_printf(__VA_ARGS__); \
1173 #define gprintln(...) do { \
1174 gprintf(__VA_ARGS__); \
1178 #define ADDFLAG(obj, flag, sflag) do { \
1179 if ((obj)->flags & (flag)) { \
1181 strlcat(str, ",", size); \
1182 strlcat(str, (sflag), size); \
1188 provider_flags_to_string(struct g_provider *pp, char *str, size_t size)
1193 if (pp->flags == 0) {
1194 strlcpy(str, "NONE", size);
1197 ADDFLAG(pp, G_PF_CANDELETE, "G_PF_CANDELETE");
1198 ADDFLAG(pp, G_PF_WITHER, "G_PF_WITHER");
1199 ADDFLAG(pp, G_PF_ORPHAN, "G_PF_ORPHAN");
1204 geom_flags_to_string(struct g_geom *gp, char *str, size_t size)
1209 if (gp->flags == 0) {
1210 strlcpy(str, "NONE", size);
1213 ADDFLAG(gp, G_GEOM_WITHER, "G_GEOM_WITHER");
1217 db_show_geom_consumer(int indent, struct g_consumer *cp)
1221 gprintln("consumer: %p", cp);
1222 gprintln(" class: %s (%p)", cp->geom->class->name,
1224 gprintln(" geom: %s (%p)", cp->geom->name, cp->geom);
1225 if (cp->provider == NULL)
1226 gprintln(" provider: none");
1228 gprintln(" provider: %s (%p)", cp->provider->name,
1231 gprintln(" access: r%dw%de%d", cp->acr, cp->acw, cp->ace);
1232 gprintln(" flags: 0x%04x", cp->flags);
1233 gprintln(" nstart: %u", cp->nstart);
1234 gprintln(" nend: %u", cp->nend);
1236 gprintf("consumer: %p (%s), access=r%dw%de%d", cp,
1237 cp->provider != NULL ? cp->provider->name : "none",
1238 cp->acr, cp->acw, cp->ace);
1240 db_printf(", flags=0x%04x", cp->flags);
1246 db_show_geom_provider(int indent, struct g_provider *pp)
1248 struct g_consumer *cp;
1252 gprintln("provider: %s (%p)", pp->name, pp);
1253 gprintln(" class: %s (%p)", pp->geom->class->name,
1255 gprintln(" geom: %s (%p)", pp->geom->name, pp->geom);
1256 gprintln(" mediasize: %jd", (intmax_t)pp->mediasize);
1257 gprintln(" sectorsize: %u", pp->sectorsize);
1258 gprintln(" stripesize: %u", pp->stripesize);
1259 gprintln(" stripeoffset: %u", pp->stripeoffset);
1260 gprintln(" access: r%dw%de%d", pp->acr, pp->acw,
1262 gprintln(" flags: %s (0x%04x)",
1263 provider_flags_to_string(pp, flags, sizeof(flags)),
1265 gprintln(" error: %d", pp->error);
1266 gprintln(" nstart: %u", pp->nstart);
1267 gprintln(" nend: %u", pp->nend);
1268 if (LIST_EMPTY(&pp->consumers))
1269 gprintln(" consumers: none");
1271 gprintf("provider: %s (%p), access=r%dw%de%d",
1272 pp->name, pp, pp->acr, pp->acw, pp->ace);
1273 if (pp->flags != 0) {
1274 db_printf(", flags=%s (0x%04x)",
1275 provider_flags_to_string(pp, flags, sizeof(flags)),
1280 if (!LIST_EMPTY(&pp->consumers)) {
1281 LIST_FOREACH(cp, &pp->consumers, consumers) {
1282 db_show_geom_consumer(indent + 2, cp);
1290 db_show_geom_geom(int indent, struct g_geom *gp)
1292 struct g_provider *pp;
1293 struct g_consumer *cp;
1297 gprintln("geom: %s (%p)", gp->name, gp);
1298 gprintln(" class: %s (%p)", gp->class->name, gp->class);
1299 gprintln(" flags: %s (0x%04x)",
1300 geom_flags_to_string(gp, flags, sizeof(flags)), gp->flags);
1301 gprintln(" rank: %d", gp->rank);
1302 if (LIST_EMPTY(&gp->provider))
1303 gprintln(" providers: none");
1304 if (LIST_EMPTY(&gp->consumer))
1305 gprintln(" consumers: none");
1307 gprintf("geom: %s (%p), rank=%d", gp->name, gp, gp->rank);
1308 if (gp->flags != 0) {
1309 db_printf(", flags=%s (0x%04x)",
1310 geom_flags_to_string(gp, flags, sizeof(flags)),
1315 if (!LIST_EMPTY(&gp->provider)) {
1316 LIST_FOREACH(pp, &gp->provider, provider) {
1317 db_show_geom_provider(indent + 2, pp);
1322 if (!LIST_EMPTY(&gp->consumer)) {
1323 LIST_FOREACH(cp, &gp->consumer, consumer) {
1324 db_show_geom_consumer(indent + 2, cp);
1332 db_show_geom_class(struct g_class *mp)
1336 db_printf("class: %s (%p)\n", mp->name, mp);
1337 LIST_FOREACH(gp, &mp->geom, geom) {
1338 db_show_geom_geom(2, gp);
1345 * Print the GEOM topology or the given object.
1347 DB_SHOW_COMMAND(geom, db_show_geom)
1352 /* No address given, print the entire topology. */
1353 LIST_FOREACH(mp, &g_classes, class) {
1354 db_show_geom_class(mp);
1360 switch (g_valid_obj((void *)addr)) {
1362 db_show_geom_class((struct g_class *)addr);
1365 db_show_geom_geom(0, (struct g_geom *)addr);
1368 db_show_geom_consumer(0, (struct g_consumer *)addr);
1371 db_show_geom_provider(0, (struct g_provider *)addr);
1374 db_printf("Not a GEOM object.\n");
1381 db_print_bio_cmd(struct bio *bp)
1383 db_printf(" cmd: ");
1384 switch (bp->bio_cmd) {
1385 case BIO_READ: db_printf("BIO_READ"); break;
1386 case BIO_WRITE: db_printf("BIO_WRITE"); break;
1387 case BIO_DELETE: db_printf("BIO_DELETE"); break;
1388 case BIO_GETATTR: db_printf("BIO_GETATTR"); break;
1389 case BIO_FLUSH: db_printf("BIO_FLUSH"); break;
1390 case BIO_CMD0: db_printf("BIO_CMD0"); break;
1391 case BIO_CMD1: db_printf("BIO_CMD1"); break;
1392 case BIO_CMD2: db_printf("BIO_CMD2"); break;
1393 default: db_printf("UNKNOWN"); break;
1399 db_print_bio_flags(struct bio *bp)
1404 db_printf(" flags: ");
1405 if (bp->bio_flags & BIO_ERROR) {
1406 db_printf("BIO_ERROR");
1409 if (bp->bio_flags & BIO_DONE) {
1410 db_printf("%sBIO_DONE", (comma ? ", " : ""));
1413 if (bp->bio_flags & BIO_ONQUEUE)
1414 db_printf("%sBIO_ONQUEUE", (comma ? ", " : ""));
1419 * Print useful information in a BIO
1421 DB_SHOW_COMMAND(bio, db_show_bio)
1426 bp = (struct bio *)addr;
1427 db_printf("BIO %p\n", bp);
1428 db_print_bio_cmd(bp);
1429 db_print_bio_flags(bp);
1430 db_printf(" cflags: 0x%hhx\n", bp->bio_cflags);
1431 db_printf(" pflags: 0x%hhx\n", bp->bio_pflags);
1432 db_printf(" offset: %jd\n", (intmax_t)bp->bio_offset);
1433 db_printf(" length: %jd\n", (intmax_t)bp->bio_length);
1434 db_printf(" bcount: %ld\n", bp->bio_bcount);
1435 db_printf(" resid: %ld\n", bp->bio_resid);
1436 db_printf(" completed: %jd\n", (intmax_t)bp->bio_completed);
1437 db_printf(" children: %u\n", bp->bio_children);
1438 db_printf(" inbed: %u\n", bp->bio_inbed);
1439 db_printf(" error: %d\n", bp->bio_error);
1440 db_printf(" parent: %p\n", bp->bio_parent);
1441 db_printf(" driver1: %p\n", bp->bio_driver1);
1442 db_printf(" driver2: %p\n", bp->bio_driver2);
1443 db_printf(" caller1: %p\n", bp->bio_caller1);
1444 db_printf(" caller2: %p\n", bp->bio_caller2);
1445 db_printf(" bio_from: %p\n", bp->bio_from);
1446 db_printf(" bio_to: %p\n", bp->bio_to);