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>
62 struct class_list_head g_classes = LIST_HEAD_INITIALIZER(g_classes);
63 static struct g_tailq_head geoms = TAILQ_HEAD_INITIALIZER(geoms);
64 char *g_wait_event, *g_wait_up, *g_wait_down, *g_wait_sim;
73 * This event offers a new class a chance to taste all preexisting providers.
76 g_load_class(void *arg, int flag)
79 struct g_class *mp2, *mp;
81 struct g_provider *pp;
84 if (flag == EV_CANCEL) /* XXX: can't happen ? */
96 g_trace(G_T_TOPOLOGY, "g_load_class(%s)", mp->name);
97 KASSERT(mp->name != NULL && *mp->name != '\0',
98 ("GEOM class has no name"));
99 LIST_FOREACH(mp2, &g_classes, class) {
101 printf("The GEOM class %s is already loaded.\n",
106 } else if (strcmp(mp2->name, mp->name) == 0) {
107 printf("A GEOM class %s is already loaded.\n",
115 LIST_INIT(&mp->geom);
116 LIST_INSERT_HEAD(&g_classes, mp, class);
117 if (mp->init != NULL)
119 if (mp->taste == NULL)
121 LIST_FOREACH(mp2, &g_classes, class) {
124 LIST_FOREACH(gp, &mp2->geom, geom) {
125 LIST_FOREACH(pp, &gp->provider, provider) {
126 mp->taste(mp, pp, 0);
134 g_unload_class(void *arg, int flag)
139 struct g_provider *pp;
140 struct g_consumer *cp;
147 g_trace(G_T_TOPOLOGY, "g_unload_class(%s)", mp->name);
150 * We allow unloading if we have no geoms, or a class
151 * method we can use to get rid of them.
153 if (!LIST_EMPTY(&mp->geom) && mp->destroy_geom == NULL) {
154 hh->error = EOPNOTSUPP;
158 /* We refuse to unload if anything is open */
159 LIST_FOREACH(gp, &mp->geom, geom) {
160 LIST_FOREACH(pp, &gp->provider, provider)
161 if (pp->acr || pp->acw || pp->ace) {
165 LIST_FOREACH(cp, &gp->consumer, consumer)
166 if (cp->acr || cp->acw || cp->ace) {
172 /* Bar new entries */
178 gp = LIST_FIRST(&mp->geom);
181 error = mp->destroy_geom(NULL, mp, gp);
186 if (mp->fini != NULL)
188 LIST_REMOVE(mp, class);
195 g_modevent(module_t mod, int type, void *data)
199 static int g_ignition;
203 if (mp->version != G_VERSION) {
204 printf("GEOM class %s has Wrong version %x\n",
205 mp->name, mp->version);
212 hh = g_malloc(sizeof *hh, M_WAITOK | M_ZERO);
217 g_trace(G_T_TOPOLOGY, "g_modevent(%s, LOAD)", hh->mp->name);
219 * Once the system is not cold, MOD_LOAD calls will be
220 * from the userland and the g_event thread will be able
221 * to acknowledge their completion.
225 error = g_post_event(g_load_class, hh, M_WAITOK, NULL);
227 error = g_waitfor_event(g_load_class, hh, M_WAITOK,
235 g_trace(G_T_TOPOLOGY, "g_modevent(%s, UNLOAD)", hh->mp->name);
236 error = g_waitfor_event(g_unload_class, hh, M_WAITOK, NULL);
240 KASSERT(LIST_EMPTY(&hh->mp->geom),
241 ("Unloaded class (%s) still has geom", hh->mp->name));
253 g_retaste_event(void *arg, int flag)
255 struct g_class *cp, *mp;
256 struct g_geom *gp, *gp2;
258 struct g_provider *pp;
261 if (flag == EV_CANCEL) /* XXX: can't happen ? */
273 g_trace(G_T_TOPOLOGY, "g_retaste(%s)", mp->name);
275 LIST_FOREACH(cp, &g_classes, class) {
276 LIST_FOREACH(gp, &cp->geom, geom) {
277 LIST_FOREACH(pp, &gp->provider, provider) {
278 if (pp->acr || pp->acw || pp->ace)
280 LIST_FOREACH(gp2, &mp->geom, geom) {
281 if (!strcmp(pp->name, gp2->name))
285 g_wither_geom(gp2, ENXIO);
286 mp->taste(mp, pp, 0);
294 g_retaste(struct g_class *mp)
299 if (mp->taste == NULL)
302 hh = g_malloc(sizeof *hh, M_WAITOK | M_ZERO);
307 error = g_post_event(g_retaste_event, hh, M_WAITOK, NULL);
309 error = g_waitfor_event(g_retaste_event, hh, M_WAITOK, NULL);
319 g_new_geomf(struct g_class *mp, const char *fmt, ...)
327 sb = sbuf_new_auto();
329 sbuf_vprintf(sb, fmt, ap);
332 gp = g_malloc(sizeof *gp, M_WAITOK | M_ZERO);
333 gp->name = g_malloc(sbuf_len(sb) + 1, M_WAITOK | M_ZERO);
336 LIST_INIT(&gp->consumer);
337 LIST_INIT(&gp->provider);
338 LIST_INSERT_HEAD(&mp->geom, gp, geom);
339 TAILQ_INSERT_HEAD(&geoms, gp, geoms);
340 strcpy(gp->name, sbuf_data(sb));
342 /* Fill in defaults from class */
343 gp->start = mp->start;
344 gp->spoiled = mp->spoiled;
345 gp->dumpconf = mp->dumpconf;
346 gp->access = mp->access;
347 gp->orphan = mp->orphan;
348 gp->ioctl = mp->ioctl;
353 g_destroy_geom(struct g_geom *gp)
358 g_trace(G_T_TOPOLOGY, "g_destroy_geom(%p(%s))", gp, gp->name);
359 KASSERT(LIST_EMPTY(&gp->consumer),
360 ("g_destroy_geom(%s) with consumer(s) [%p]",
361 gp->name, LIST_FIRST(&gp->consumer)));
362 KASSERT(LIST_EMPTY(&gp->provider),
363 ("g_destroy_geom(%s) with provider(s) [%p]",
364 gp->name, LIST_FIRST(&gp->provider)));
366 LIST_REMOVE(gp, geom);
367 TAILQ_REMOVE(&geoms, gp, geoms);
373 * This function is called (repeatedly) until the has withered away.
376 g_wither_geom(struct g_geom *gp, int error)
378 struct g_provider *pp;
382 g_trace(G_T_TOPOLOGY, "g_wither_geom(%p(%s))", gp, gp->name);
383 if (!(gp->flags & G_GEOM_WITHER)) {
384 gp->flags |= G_GEOM_WITHER;
385 LIST_FOREACH(pp, &gp->provider, provider)
386 if (!(pp->flags & G_PF_ORPHAN))
387 g_orphan_provider(pp, error);
393 * Convenience function to destroy a particular provider.
396 g_wither_provider(struct g_provider *pp, int error)
399 pp->flags |= G_PF_WITHER;
400 if (!(pp->flags & G_PF_ORPHAN))
401 g_orphan_provider(pp, error);
405 * This function is called (repeatedly) until the has withered away.
408 g_wither_geom_close(struct g_geom *gp, int error)
410 struct g_consumer *cp;
414 g_trace(G_T_TOPOLOGY, "g_wither_geom_close(%p(%s))", gp, gp->name);
415 LIST_FOREACH(cp, &gp->consumer, consumer)
416 if (cp->acr || cp->acw || cp->ace)
417 g_access(cp, -cp->acr, -cp->acw, -cp->ace);
418 g_wither_geom(gp, error);
422 * This function is called (repeatedly) until we cant wash away more
423 * withered bits at present. Return value contains two bits. Bit 0
424 * set means "withering stuff we can't wash now", bit 1 means "call
425 * me again, there may be stuff I didn't get the first time around.
431 struct g_geom *gp, *gp2;
432 struct g_provider *pp, *pp2;
433 struct g_consumer *cp, *cp2;
438 LIST_FOREACH(mp, &g_classes, class) {
439 LIST_FOREACH_SAFE(gp, &mp->geom, geom, gp2) {
440 LIST_FOREACH_SAFE(pp, &gp->provider, provider, pp2) {
441 if (!(pp->flags & G_PF_WITHER))
443 if (LIST_EMPTY(&pp->consumers))
444 g_destroy_provider(pp);
448 if (!(gp->flags & G_GEOM_WITHER))
450 LIST_FOREACH_SAFE(pp, &gp->provider, provider, pp2) {
451 if (LIST_EMPTY(&pp->consumers))
452 g_destroy_provider(pp);
456 LIST_FOREACH_SAFE(cp, &gp->consumer, consumer, cp2) {
457 if (cp->acr || cp->acw || cp->ace) {
461 if (cp->provider != NULL)
463 g_destroy_consumer(cp);
466 if (LIST_EMPTY(&gp->provider) &&
467 LIST_EMPTY(&gp->consumer))
477 g_new_consumer(struct g_geom *gp)
479 struct g_consumer *cp;
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));
490 cp = g_malloc(sizeof *cp, M_WAITOK | M_ZERO);
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);
499 g_destroy_consumer(struct g_consumer *cp)
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"));
512 LIST_REMOVE(cp, consumer);
513 devstat_remove_entry(cp->stat);
515 if (gp->flags & G_GEOM_WITHER)
520 g_new_provider_event(void *arg, int flag)
523 struct g_provider *pp;
524 struct g_consumer *cp;
528 if (flag == EV_CANCEL)
533 G_VALID_PROVIDER(pp);
534 LIST_FOREACH(mp, &g_classes, class) {
535 if (mp->taste == NULL)
538 LIST_FOREACH(cp, &pp->consumers, consumers)
539 if (cp->geom->class == mp)
543 mp->taste(mp, pp, 0);
550 g_new_providerf(struct g_geom *gp, const char *fmt, ...)
552 struct g_provider *pp;
558 KASSERT(gp->access != NULL,
559 ("new provider on geom(%s) without ->access (class %s)",
560 gp->name, gp->class->name));
561 KASSERT(gp->start != NULL,
562 ("new provider on geom(%s) without ->start (class %s)",
563 gp->name, gp->class->name));
564 KASSERT(!(gp->flags & G_GEOM_WITHER),
565 ("new provider on WITHERing geom(%s) (class %s)",
566 gp->name, gp->class->name));
567 sb = sbuf_new_auto();
569 sbuf_vprintf(sb, fmt, ap);
572 pp = g_malloc(sizeof *pp + sbuf_len(sb) + 1, M_WAITOK | M_ZERO);
573 pp->name = (char *)(pp + 1);
574 strcpy(pp->name, sbuf_data(sb));
576 LIST_INIT(&pp->consumers);
579 pp->stat = devstat_new_entry(pp, -1, 0, DEVSTAT_ALL_SUPPORTED,
580 DEVSTAT_TYPE_DIRECT, DEVSTAT_PRIORITY_MAX);
581 LIST_INSERT_HEAD(&gp->provider, pp, provider);
582 g_post_event(g_new_provider_event, pp, M_WAITOK, pp, gp, NULL);
587 g_error_provider(struct g_provider *pp, int error)
590 /* G_VALID_PROVIDER(pp); We may not have g_topology */
595 g_provider_by_name(char const *arg)
599 struct g_provider *pp;
601 LIST_FOREACH(cp, &g_classes, class) {
602 LIST_FOREACH(gp, &cp->geom, geom) {
603 LIST_FOREACH(pp, &gp->provider, provider) {
604 if (!strcmp(arg, pp->name))
613 g_destroy_provider(struct g_provider *pp)
618 G_VALID_PROVIDER(pp);
619 KASSERT(LIST_EMPTY(&pp->consumers),
620 ("g_destroy_provider but attached"));
621 KASSERT (pp->acr == 0, ("g_destroy_provider with acr"));
622 KASSERT (pp->acw == 0, ("g_destroy_provider with acw"));
623 KASSERT (pp->acw == 0, ("g_destroy_provider with ace"));
625 LIST_REMOVE(pp, provider);
627 devstat_remove_entry(pp->stat);
629 if ((gp->flags & G_GEOM_WITHER))
634 * We keep the "geoms" list sorted by topological order (== increasing
635 * numerical rank) at all times.
636 * When an attach is done, the attaching geoms rank is invalidated
637 * and it is moved to the tail of the list.
638 * All geoms later in the sequence has their ranks reevaluated in
639 * sequence. If we cannot assign rank to a geom because it's
640 * prerequisites do not have rank, we move that element to the tail
641 * of the sequence with invalid rank as well.
642 * At some point we encounter our original geom and if we stil fail
643 * to assign it a rank, there must be a loop and we fail back to
644 * g_attach() which detach again and calls redo_rank again
645 * to fix up the damage.
646 * It would be much simpler code wise to do it recursively, but we
647 * can't risk that on the kernel stack.
651 redo_rank(struct g_geom *gp)
653 struct g_consumer *cp;
654 struct g_geom *gp1, *gp2;
660 /* Invalidate this geoms rank and move it to the tail */
661 gp1 = TAILQ_NEXT(gp, geoms);
664 TAILQ_REMOVE(&geoms, gp, geoms);
665 TAILQ_INSERT_TAIL(&geoms, gp, geoms);
670 /* re-rank the rest of the sequence */
671 for (; gp1 != NULL; gp1 = gp2) {
674 LIST_FOREACH(cp, &gp1->consumer, consumer) {
675 if (cp->provider == NULL)
677 n = cp->provider->geom->rank;
685 gp2 = TAILQ_NEXT(gp1, geoms);
687 /* got a rank, moving on */
691 /* no rank to original geom means loop */
695 /* no rank, put it at the end move on */
696 TAILQ_REMOVE(&geoms, gp1, geoms);
697 TAILQ_INSERT_TAIL(&geoms, gp1, geoms);
703 g_attach(struct g_consumer *cp, struct g_provider *pp)
708 G_VALID_CONSUMER(cp);
709 G_VALID_PROVIDER(pp);
710 KASSERT(cp->provider == NULL, ("attach but attached"));
712 LIST_INSERT_HEAD(&pp->consumers, cp, consumers);
713 error = redo_rank(cp->geom);
715 LIST_REMOVE(cp, consumers);
723 g_detach(struct g_consumer *cp)
725 struct g_provider *pp;
728 G_VALID_CONSUMER(cp);
729 g_trace(G_T_TOPOLOGY, "g_detach(%p)", cp);
730 KASSERT(cp->provider != NULL, ("detach but not attached"));
731 KASSERT(cp->acr == 0, ("detach but nonzero acr"));
732 KASSERT(cp->acw == 0, ("detach but nonzero acw"));
733 KASSERT(cp->ace == 0, ("detach but nonzero ace"));
734 KASSERT(cp->nstart == cp->nend,
735 ("detach with active requests"));
737 LIST_REMOVE(cp, consumers);
739 if (pp->geom->flags & G_GEOM_WITHER)
741 else if (pp->flags & G_PF_WITHER)
749 * Access-check with delta values. The question asked is "can provider
750 * "cp" change the access counters by the relative amounts dc[rwe] ?"
754 g_access(struct g_consumer *cp, int dcr, int dcw, int dce)
756 struct g_provider *pp;
761 G_VALID_CONSUMER(cp);
763 KASSERT(pp != NULL, ("access but not attached"));
764 G_VALID_PROVIDER(pp);
766 g_trace(G_T_ACCESS, "g_access(%p(%s), %d, %d, %d)",
767 cp, pp->name, dcr, dcw, dce);
769 KASSERT(cp->acr + dcr >= 0, ("access resulting in negative acr"));
770 KASSERT(cp->acw + dcw >= 0, ("access resulting in negative acw"));
771 KASSERT(cp->ace + dce >= 0, ("access resulting in negative ace"));
772 KASSERT(dcr != 0 || dcw != 0 || dce != 0, ("NOP access request"));
773 KASSERT(pp->geom->access != NULL, ("NULL geom->access"));
776 * If our class cares about being spoiled, and we have been, we
777 * are probably just ahead of the event telling us that. Fail
778 * now rather than having to unravel this later.
780 if (cp->geom->spoiled != NULL && cp->spoiled &&
781 (dcr > 0 || dcw > 0 || dce > 0))
785 * Figure out what counts the provider would have had, if this
786 * consumer had (r0w0e0) at this time.
788 pr = pp->acr - cp->acr;
789 pw = pp->acw - cp->acw;
790 pe = pp->ace - cp->ace;
793 "open delta:[r%dw%de%d] old:[r%dw%de%d] provider:[r%dw%de%d] %p(%s)",
795 cp->acr, cp->acw, cp->ace,
796 pp->acr, pp->acw, pp->ace,
799 /* If foot-shooting is enabled, any open on rank#1 is OK */
800 if ((g_debugflags & 16) && pp->geom->rank == 1)
802 /* If we try exclusive but already write: fail */
803 else if (dce > 0 && pw > 0)
805 /* If we try write but already exclusive: fail */
806 else if (dcw > 0 && pe > 0)
808 /* If we try to open more but provider is error'ed: fail */
809 else if ((dcr > 0 || dcw > 0 || dce > 0) && pp->error != 0)
814 error = pp->geom->access(pp, dcr, dcw, dce);
815 KASSERT(dcr > 0 || dcw > 0 || dce > 0 || error == 0,
816 ("Geom provider %s::%s failed closing ->access()",
817 pp->geom->class->name, pp->name));
820 * If we open first write, spoil any partner consumers.
821 * If we close last write and provider is not errored,
824 if (pp->acw == 0 && dcw != 0)
826 else if (pp->acw != 0 && pp->acw == -dcw && pp->error == 0 &&
827 !(pp->geom->flags & G_GEOM_WITHER))
828 g_post_event(g_new_provider_event, pp, M_WAITOK,
837 if (pp->acr != 0 || pp->acw != 0 || pp->ace != 0)
838 KASSERT(pp->sectorsize > 0,
839 ("Provider %s lacks sectorsize", pp->name));
845 g_handleattr_int(struct bio *bp, const char *attribute, int val)
848 return (g_handleattr(bp, attribute, &val, sizeof val));
852 g_handleattr_off_t(struct bio *bp, const char *attribute, off_t val)
855 return (g_handleattr(bp, attribute, &val, sizeof val));
859 g_handleattr_str(struct bio *bp, const char *attribute, const char *str)
862 return (g_handleattr(bp, attribute, str, 0));
866 g_handleattr(struct bio *bp, const char *attribute, const void *val, int len)
870 if (strcmp(bp->bio_attribute, attribute))
873 bzero(bp->bio_data, bp->bio_length);
874 if (strlcpy(bp->bio_data, val, bp->bio_length) >=
876 printf("%s: %s bio_length %jd len %zu -> EFAULT\n",
877 __func__, bp->bio_to->name,
878 (intmax_t)bp->bio_length, strlen(val));
881 } else if (bp->bio_length == len) {
882 bcopy(val, bp->bio_data, len);
884 printf("%s: %s bio_length %jd len %d -> EFAULT\n", __func__,
885 bp->bio_to->name, (intmax_t)bp->bio_length, len);
889 bp->bio_completed = bp->bio_length;
890 g_io_deliver(bp, error);
895 g_std_access(struct g_provider *pp,
896 int dr __unused, int dw __unused, int de __unused)
900 G_VALID_PROVIDER(pp);
905 g_std_done(struct bio *bp)
909 bp2 = bp->bio_parent;
910 if (bp2->bio_error == 0)
911 bp2->bio_error = bp->bio_error;
912 bp2->bio_completed += bp->bio_completed;
915 if (bp2->bio_children == bp2->bio_inbed)
916 g_io_deliver(bp2, bp2->bio_error);
919 /* XXX: maybe this is only g_slice_spoiled */
922 g_std_spoiled(struct g_consumer *cp)
925 struct g_provider *pp;
928 G_VALID_CONSUMER(cp);
929 g_trace(G_T_TOPOLOGY, "g_std_spoiled(%p)", cp);
932 LIST_FOREACH(pp, &gp->provider, provider)
933 g_orphan_provider(pp, ENXIO);
934 g_destroy_consumer(cp);
935 if (LIST_EMPTY(&gp->provider) && LIST_EMPTY(&gp->consumer))
938 gp->flags |= G_GEOM_WITHER;
942 * Spoiling happens when a provider is opened for writing, but consumers
943 * which are configured by in-band data are attached (slicers for instance).
944 * Since the write might potentially change the in-band data, such consumers
945 * need to re-evaluate their existence after the writing session closes.
946 * We do this by (offering to) tear them down when the open for write happens
947 * in return for a re-taste when it closes again.
948 * Together with the fact that such consumers grab an 'e' bit whenever they
949 * are open, regardless of mode, this ends up DTRT.
953 g_spoil_event(void *arg, int flag)
955 struct g_provider *pp;
956 struct g_consumer *cp, *cp2;
959 if (flag == EV_CANCEL)
962 G_VALID_PROVIDER(pp);
963 for (cp = LIST_FIRST(&pp->consumers); cp != NULL; cp = cp2) {
964 cp2 = LIST_NEXT(cp, consumers);
968 if (cp->geom->spoiled == NULL)
970 cp->geom->spoiled(cp);
976 g_spoil(struct g_provider *pp, struct g_consumer *cp)
978 struct g_consumer *cp2;
981 G_VALID_PROVIDER(pp);
982 G_VALID_CONSUMER(cp);
984 LIST_FOREACH(cp2, &pp->consumers, consumers) {
988 KASSERT(cp2->acr == 0, ("spoiling cp->acr = %d", cp2->acr));
989 KASSERT(cp2->acw == 0, ("spoiling cp->acw = %d", cp2->acw));
991 KASSERT(cp2->ace == 0, ("spoiling cp->ace = %d", cp2->ace));
994 g_post_event(g_spoil_event, pp, M_WAITOK, pp, NULL);
998 g_getattr__(const char *attr, struct g_consumer *cp, void *var, int len)
1003 error = g_io_getattr(attr, cp, &i, var);
1011 #if defined(DIAGNOSTIC) || defined(DDB)
1013 * This function walks (topologically unsafely) the mesh and return a
1014 * non-zero integer if it finds the argument pointer is an object.
1015 * The return value indicates which type of object it is belived to be.
1016 * If topology is not locked, this function is potentially dangerous,
1017 * but since it is for debugging purposes and can be useful for instance
1018 * from DDB, we do not assert topology lock is held.
1021 g_valid_obj(void const *ptr)
1025 struct g_consumer *cp;
1026 struct g_provider *pp;
1028 LIST_FOREACH(mp, &g_classes, class) {
1031 LIST_FOREACH(gp, &mp->geom, geom) {
1034 LIST_FOREACH(cp, &gp->consumer, consumer)
1037 LIST_FOREACH(pp, &gp->provider, provider)
1048 #define gprintf(...) do { \
1049 printf("%*s", indent, ""); \
1050 printf(__VA_ARGS__); \
1052 #define gprintln(...) do { \
1053 gprintf(__VA_ARGS__); \
1057 #define ADDFLAG(obj, flag, sflag) do { \
1058 if ((obj)->flags & (flag)) { \
1060 strlcat(str, ",", size); \
1061 strlcat(str, (sflag), size); \
1067 provider_flags_to_string(struct g_provider *pp, char *str, size_t size)
1072 if (pp->flags == 0) {
1073 strlcpy(str, "NONE", size);
1076 ADDFLAG(pp, G_PF_CANDELETE, "G_PF_CANDELETE");
1077 ADDFLAG(pp, G_PF_WITHER, "G_PF_WITHER");
1078 ADDFLAG(pp, G_PF_ORPHAN, "G_PF_ORPHAN");
1083 geom_flags_to_string(struct g_geom *gp, char *str, size_t size)
1088 if (gp->flags == 0) {
1089 strlcpy(str, "NONE", size);
1092 ADDFLAG(gp, G_GEOM_WITHER, "G_GEOM_WITHER");
1096 db_show_geom_consumer(int indent, struct g_consumer *cp)
1100 gprintln("consumer: %p", cp);
1101 gprintln(" class: %s (%p)", cp->geom->class->name,
1103 gprintln(" geom: %s (%p)", cp->geom->name, cp->geom);
1104 if (cp->provider == NULL)
1105 gprintln(" provider: none");
1107 gprintln(" provider: %s (%p)", cp->provider->name,
1110 gprintln(" access: r%dw%de%d", cp->acr, cp->acw, cp->ace);
1111 gprintln(" spoiled: %d", cp->spoiled);
1112 gprintln(" nstart: %u", cp->nstart);
1113 gprintln(" nend: %u", cp->nend);
1115 gprintf("consumer: %p (%s), access=r%dw%de%d", cp,
1116 cp->provider != NULL ? cp->provider->name : "none",
1117 cp->acr, cp->acw, cp->ace);
1119 printf(", spoiled=%d", cp->spoiled);
1125 db_show_geom_provider(int indent, struct g_provider *pp)
1127 struct g_consumer *cp;
1131 gprintln("provider: %s (%p)", pp->name, pp);
1132 gprintln(" class: %s (%p)", pp->geom->class->name,
1134 gprintln(" geom: %s (%p)", pp->geom->name, pp->geom);
1135 gprintln(" mediasize: %jd", (intmax_t)pp->mediasize);
1136 gprintln(" sectorsize: %u", pp->sectorsize);
1137 gprintln(" stripesize: %u", pp->stripesize);
1138 gprintln(" stripeoffset: %u", pp->stripeoffset);
1139 gprintln(" access: r%dw%de%d", pp->acr, pp->acw,
1141 gprintln(" flags: %s (0x%04x)",
1142 provider_flags_to_string(pp, flags, sizeof(flags)),
1144 gprintln(" error: %d", pp->error);
1145 gprintln(" nstart: %u", pp->nstart);
1146 gprintln(" nend: %u", pp->nend);
1147 if (LIST_EMPTY(&pp->consumers))
1148 gprintln(" consumers: none");
1150 gprintf("provider: %s (%p), access=r%dw%de%d",
1151 pp->name, pp, pp->acr, pp->acw, pp->ace);
1152 if (pp->flags != 0) {
1153 printf(", flags=%s (0x%04x)",
1154 provider_flags_to_string(pp, flags, sizeof(flags)),
1159 if (!LIST_EMPTY(&pp->consumers)) {
1160 LIST_FOREACH(cp, &pp->consumers, consumers)
1161 db_show_geom_consumer(indent + 2, cp);
1166 db_show_geom_geom(int indent, struct g_geom *gp)
1168 struct g_provider *pp;
1169 struct g_consumer *cp;
1173 gprintln("geom: %s (%p)", gp->name, gp);
1174 gprintln(" class: %s (%p)", gp->class->name, gp->class);
1175 gprintln(" flags: %s (0x%04x)",
1176 geom_flags_to_string(gp, flags, sizeof(flags)), gp->flags);
1177 gprintln(" rank: %d", gp->rank);
1178 if (LIST_EMPTY(&gp->provider))
1179 gprintln(" providers: none");
1180 if (LIST_EMPTY(&gp->consumer))
1181 gprintln(" consumers: none");
1183 gprintf("geom: %s (%p), rank=%d", gp->name, gp, gp->rank);
1184 if (gp->flags != 0) {
1185 printf(", flags=%s (0x%04x)",
1186 geom_flags_to_string(gp, flags, sizeof(flags)),
1191 if (!LIST_EMPTY(&gp->provider)) {
1192 LIST_FOREACH(pp, &gp->provider, provider)
1193 db_show_geom_provider(indent + 2, pp);
1195 if (!LIST_EMPTY(&gp->consumer)) {
1196 LIST_FOREACH(cp, &gp->consumer, consumer)
1197 db_show_geom_consumer(indent + 2, cp);
1202 db_show_geom_class(struct g_class *mp)
1206 printf("class: %s (%p)\n", mp->name, mp);
1207 LIST_FOREACH(gp, &mp->geom, geom)
1208 db_show_geom_geom(2, gp);
1212 * Print the GEOM topology or the given object.
1214 DB_SHOW_COMMAND(geom, db_show_geom)
1219 /* No address given, print the entire topology. */
1220 LIST_FOREACH(mp, &g_classes, class) {
1221 db_show_geom_class(mp);
1225 switch (g_valid_obj((void *)addr)) {
1227 db_show_geom_class((struct g_class *)addr);
1230 db_show_geom_geom(0, (struct g_geom *)addr);
1233 db_show_geom_consumer(0, (struct g_consumer *)addr);
1236 db_show_geom_provider(0, (struct g_provider *)addr);
1239 printf("Not a GEOM object.\n");