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;
72 struct g_provider *pp;
79 * This event offers a new class a chance to taste all preexisting providers.
82 g_load_class(void *arg, int flag)
85 struct g_class *mp2, *mp;
87 struct g_provider *pp;
90 if (flag == EV_CANCEL) /* XXX: can't happen ? */
102 g_trace(G_T_TOPOLOGY, "g_load_class(%s)", mp->name);
103 KASSERT(mp->name != NULL && *mp->name != '\0',
104 ("GEOM class has no name"));
105 LIST_FOREACH(mp2, &g_classes, class) {
107 printf("The GEOM class %s is already loaded.\n",
112 } else if (strcmp(mp2->name, mp->name) == 0) {
113 printf("A GEOM class %s is already loaded.\n",
121 LIST_INIT(&mp->geom);
122 LIST_INSERT_HEAD(&g_classes, mp, class);
123 if (mp->init != NULL)
125 if (mp->taste == NULL)
127 LIST_FOREACH(mp2, &g_classes, class) {
130 LIST_FOREACH(gp, &mp2->geom, geom) {
131 LIST_FOREACH(pp, &gp->provider, provider) {
132 mp->taste(mp, pp, 0);
140 g_unload_class(struct g_class *mp)
143 struct g_provider *pp;
144 struct g_consumer *cp;
148 g_trace(G_T_TOPOLOGY, "g_unload_class(%s)", mp->name);
151 LIST_FOREACH(gp, &mp->geom, geom) {
152 /* We refuse to unload if anything is open */
153 LIST_FOREACH(pp, &gp->provider, provider)
154 if (pp->acr || pp->acw || pp->ace) {
158 LIST_FOREACH(cp, &gp->consumer, consumer)
159 if (cp->acr || cp->acw || cp->ace) {
163 /* If the geom is withering, wait for it to finish. */
164 if (gp->flags & G_GEOM_WITHER) {
165 g_topology_sleep(mp, 1);
171 * We allow unloading if we have no geoms, or a class
172 * method we can use to get rid of them.
174 if (!LIST_EMPTY(&mp->geom) && mp->destroy_geom == NULL) {
179 /* Bar new entries */
183 LIST_FOREACH(gp, &mp->geom, geom) {
184 error = mp->destroy_geom(NULL, mp, gp);
190 /* Wait for withering to finish. */
192 gp = LIST_FIRST(&mp->geom);
195 KASSERT(gp->flags & G_GEOM_WITHER,
196 ("Non-withering geom in class %s", mp->name));
197 g_topology_sleep(mp, 1);
200 if (mp->fini != NULL)
202 LIST_REMOVE(mp, class);
209 g_modevent(module_t mod, int type, void *data)
213 static int g_ignition;
217 if (mp->version != G_VERSION) {
218 printf("GEOM class %s has Wrong version %x\n",
219 mp->name, mp->version);
229 g_trace(G_T_TOPOLOGY, "g_modevent(%s, LOAD)", mp->name);
230 hh = g_malloc(sizeof *hh, M_WAITOK | M_ZERO);
233 * Once the system is not cold, MOD_LOAD calls will be
234 * from the userland and the g_event thread will be able
235 * to acknowledge their completion.
239 error = g_post_event(g_load_class, hh, M_WAITOK, NULL);
241 error = g_waitfor_event(g_load_class, hh, M_WAITOK,
249 g_trace(G_T_TOPOLOGY, "g_modevent(%s, UNLOAD)", mp->name);
250 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 ? */
272 if (g_shutdown || g_notaste)
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;
363 gp->resize = mp->resize;
368 g_destroy_geom(struct g_geom *gp)
373 g_trace(G_T_TOPOLOGY, "g_destroy_geom(%p(%s))", gp, gp->name);
374 KASSERT(LIST_EMPTY(&gp->consumer),
375 ("g_destroy_geom(%s) with consumer(s) [%p]",
376 gp->name, LIST_FIRST(&gp->consumer)));
377 KASSERT(LIST_EMPTY(&gp->provider),
378 ("g_destroy_geom(%s) with provider(s) [%p]",
379 gp->name, LIST_FIRST(&gp->provider)));
381 LIST_REMOVE(gp, geom);
382 TAILQ_REMOVE(&geoms, gp, geoms);
388 * This function is called (repeatedly) until the geom has withered away.
391 g_wither_geom(struct g_geom *gp, int error)
393 struct g_provider *pp;
397 g_trace(G_T_TOPOLOGY, "g_wither_geom(%p(%s))", gp, gp->name);
398 if (!(gp->flags & G_GEOM_WITHER)) {
399 gp->flags |= G_GEOM_WITHER;
400 LIST_FOREACH(pp, &gp->provider, provider)
401 if (!(pp->flags & G_PF_ORPHAN))
402 g_orphan_provider(pp, error);
408 * Convenience function to destroy a particular provider.
411 g_wither_provider(struct g_provider *pp, int error)
414 pp->flags |= G_PF_WITHER;
415 if (!(pp->flags & G_PF_ORPHAN))
416 g_orphan_provider(pp, error);
420 * This function is called (repeatedly) until the has withered away.
423 g_wither_geom_close(struct g_geom *gp, int error)
425 struct g_consumer *cp;
429 g_trace(G_T_TOPOLOGY, "g_wither_geom_close(%p(%s))", gp, gp->name);
430 LIST_FOREACH(cp, &gp->consumer, consumer)
431 if (cp->acr || cp->acw || cp->ace)
432 g_access(cp, -cp->acr, -cp->acw, -cp->ace);
433 g_wither_geom(gp, error);
437 * This function is called (repeatedly) until we cant wash away more
438 * withered bits at present.
444 struct g_geom *gp, *gp2;
445 struct g_provider *pp, *pp2;
446 struct g_consumer *cp, *cp2;
449 LIST_FOREACH(mp, &g_classes, class) {
450 LIST_FOREACH_SAFE(gp, &mp->geom, geom, gp2) {
451 LIST_FOREACH_SAFE(pp, &gp->provider, provider, pp2) {
452 if (!(pp->flags & G_PF_WITHER))
454 if (LIST_EMPTY(&pp->consumers))
455 g_destroy_provider(pp);
457 if (!(gp->flags & G_GEOM_WITHER))
459 LIST_FOREACH_SAFE(pp, &gp->provider, provider, pp2) {
460 if (LIST_EMPTY(&pp->consumers))
461 g_destroy_provider(pp);
463 LIST_FOREACH_SAFE(cp, &gp->consumer, consumer, cp2) {
464 if (cp->acr || cp->acw || cp->ace)
466 if (cp->provider != NULL)
468 g_destroy_consumer(cp);
470 if (LIST_EMPTY(&gp->provider) &&
471 LIST_EMPTY(&gp->consumer))
478 g_new_consumer(struct g_geom *gp)
480 struct g_consumer *cp;
484 KASSERT(!(gp->flags & G_GEOM_WITHER),
485 ("g_new_consumer on WITHERing geom(%s) (class %s)",
486 gp->name, gp->class->name));
487 KASSERT(gp->orphan != NULL,
488 ("g_new_consumer on geom(%s) (class %s) without orphan",
489 gp->name, gp->class->name));
491 cp = g_malloc(sizeof *cp, M_WAITOK | M_ZERO);
493 cp->stat = devstat_new_entry(cp, -1, 0, DEVSTAT_ALL_SUPPORTED,
494 DEVSTAT_TYPE_DIRECT, DEVSTAT_PRIORITY_MAX);
495 LIST_INSERT_HEAD(&gp->consumer, cp, consumer);
500 g_destroy_consumer(struct g_consumer *cp)
505 G_VALID_CONSUMER(cp);
506 g_trace(G_T_TOPOLOGY, "g_destroy_consumer(%p)", cp);
507 KASSERT (cp->provider == NULL, ("g_destroy_consumer but attached"));
508 KASSERT (cp->acr == 0, ("g_destroy_consumer with acr"));
509 KASSERT (cp->acw == 0, ("g_destroy_consumer with acw"));
510 KASSERT (cp->ace == 0, ("g_destroy_consumer with ace"));
513 LIST_REMOVE(cp, consumer);
514 devstat_remove_entry(cp->stat);
516 if (gp->flags & G_GEOM_WITHER)
521 g_new_provider_event(void *arg, int flag)
524 struct g_provider *pp;
525 struct g_consumer *cp, *next_cp;
528 if (flag == EV_CANCEL)
533 G_VALID_PROVIDER(pp);
534 KASSERT(!(pp->flags & G_PF_WITHER),
535 ("g_new_provider_event but withered"));
536 LIST_FOREACH_SAFE(cp, &pp->consumers, consumers, next_cp) {
537 if ((cp->flags & G_CF_ORPHAN) == 0 &&
538 cp->geom->attrchanged != NULL)
539 cp->geom->attrchanged(cp, "GEOM::media");
543 LIST_FOREACH(mp, &g_classes, class) {
544 if (mp->taste == NULL)
546 LIST_FOREACH(cp, &pp->consumers, consumers)
547 if (cp->geom->class == mp &&
548 (cp->flags & G_CF_ORPHAN) == 0)
552 mp->taste(mp, pp, 0);
559 g_new_providerf(struct g_geom *gp, const char *fmt, ...)
561 struct g_provider *pp;
567 KASSERT(gp->access != NULL,
568 ("new provider on geom(%s) without ->access (class %s)",
569 gp->name, gp->class->name));
570 KASSERT(gp->start != NULL,
571 ("new provider on geom(%s) without ->start (class %s)",
572 gp->name, gp->class->name));
573 KASSERT(!(gp->flags & G_GEOM_WITHER),
574 ("new provider on WITHERing geom(%s) (class %s)",
575 gp->name, gp->class->name));
576 sb = sbuf_new_auto();
578 sbuf_vprintf(sb, fmt, ap);
581 pp = g_malloc(sizeof *pp + sbuf_len(sb) + 1, M_WAITOK | M_ZERO);
582 pp->name = (char *)(pp + 1);
583 strcpy(pp->name, sbuf_data(sb));
585 LIST_INIT(&pp->consumers);
588 pp->stat = devstat_new_entry(pp, -1, 0, DEVSTAT_ALL_SUPPORTED,
589 DEVSTAT_TYPE_DIRECT, DEVSTAT_PRIORITY_MAX);
590 LIST_INSERT_HEAD(&gp->provider, pp, provider);
591 g_post_event(g_new_provider_event, pp, M_WAITOK, pp, gp, NULL);
596 g_error_provider(struct g_provider *pp, int error)
599 /* G_VALID_PROVIDER(pp); We may not have g_topology */
604 g_resize_provider_event(void *arg, int flag)
609 struct g_provider *pp;
610 struct g_consumer *cp, *cp2;
622 G_VALID_PROVIDER(pp);
623 g_trace(G_T_TOPOLOGY, "g_resize_provider_event(%p)", pp);
625 LIST_FOREACH_SAFE(cp, &pp->consumers, consumers, cp2) {
627 if (gp->resize == NULL && size < pp->mediasize) {
628 cp->flags |= G_CF_ORPHAN;
629 cp->geom->orphan(cp);
633 pp->mediasize = size;
635 LIST_FOREACH_SAFE(cp, &pp->consumers, consumers, cp2) {
637 if (gp->resize != NULL)
642 * After resizing, the previously invalid GEOM class metadata
643 * might become valid. This means we should retaste.
645 LIST_FOREACH(mp, &g_classes, class) {
646 if (mp->taste == NULL)
648 LIST_FOREACH(cp, &pp->consumers, consumers)
649 if (cp->geom->class == mp &&
650 (cp->flags & G_CF_ORPHAN) == 0)
654 mp->taste(mp, pp, 0);
660 g_resize_provider(struct g_provider *pp, off_t size)
664 G_VALID_PROVIDER(pp);
666 if (size == pp->mediasize)
669 hh = g_malloc(sizeof *hh, M_WAITOK | M_ZERO);
672 g_post_event(g_resize_provider_event, hh, M_WAITOK, NULL);
676 #define _PATH_DEV "/dev/"
680 g_provider_by_name(char const *arg)
684 struct g_provider *pp, *wpp;
686 if (strncmp(arg, _PATH_DEV, sizeof(_PATH_DEV) - 1) == 0)
687 arg += sizeof(_PATH_DEV) - 1;
690 LIST_FOREACH(cp, &g_classes, class) {
691 LIST_FOREACH(gp, &cp->geom, geom) {
692 LIST_FOREACH(pp, &gp->provider, provider) {
693 if (strcmp(arg, pp->name) != 0)
695 if ((gp->flags & G_GEOM_WITHER) == 0 &&
696 (pp->flags & G_PF_WITHER) == 0)
708 g_destroy_provider(struct g_provider *pp)
713 G_VALID_PROVIDER(pp);
714 KASSERT(LIST_EMPTY(&pp->consumers),
715 ("g_destroy_provider but attached"));
716 KASSERT (pp->acr == 0, ("g_destroy_provider with acr"));
717 KASSERT (pp->acw == 0, ("g_destroy_provider with acw"));
718 KASSERT (pp->ace == 0, ("g_destroy_provider with ace"));
720 LIST_REMOVE(pp, provider);
722 devstat_remove_entry(pp->stat);
724 * If a callback was provided, send notification that the provider
727 if (gp->providergone != NULL)
728 gp->providergone(pp);
731 if ((gp->flags & G_GEOM_WITHER))
736 * We keep the "geoms" list sorted by topological order (== increasing
737 * numerical rank) at all times.
738 * When an attach is done, the attaching geoms rank is invalidated
739 * and it is moved to the tail of the list.
740 * All geoms later in the sequence has their ranks reevaluated in
741 * sequence. If we cannot assign rank to a geom because it's
742 * prerequisites do not have rank, we move that element to the tail
743 * of the sequence with invalid rank as well.
744 * At some point we encounter our original geom and if we stil fail
745 * to assign it a rank, there must be a loop and we fail back to
746 * g_attach() which detach again and calls redo_rank again
747 * to fix up the damage.
748 * It would be much simpler code wise to do it recursively, but we
749 * can't risk that on the kernel stack.
753 redo_rank(struct g_geom *gp)
755 struct g_consumer *cp;
756 struct g_geom *gp1, *gp2;
762 /* Invalidate this geoms rank and move it to the tail */
763 gp1 = TAILQ_NEXT(gp, geoms);
766 TAILQ_REMOVE(&geoms, gp, geoms);
767 TAILQ_INSERT_TAIL(&geoms, gp, geoms);
772 /* re-rank the rest of the sequence */
773 for (; gp1 != NULL; gp1 = gp2) {
776 LIST_FOREACH(cp, &gp1->consumer, consumer) {
777 if (cp->provider == NULL)
779 n = cp->provider->geom->rank;
787 gp2 = TAILQ_NEXT(gp1, geoms);
789 /* got a rank, moving on */
793 /* no rank to original geom means loop */
797 /* no rank, put it at the end move on */
798 TAILQ_REMOVE(&geoms, gp1, geoms);
799 TAILQ_INSERT_TAIL(&geoms, gp1, geoms);
805 g_attach(struct g_consumer *cp, struct g_provider *pp)
810 G_VALID_CONSUMER(cp);
811 G_VALID_PROVIDER(pp);
812 g_trace(G_T_TOPOLOGY, "g_attach(%p, %p)", cp, pp);
813 KASSERT(cp->provider == NULL, ("attach but attached"));
815 LIST_INSERT_HEAD(&pp->consumers, cp, consumers);
816 error = redo_rank(cp->geom);
818 LIST_REMOVE(cp, consumers);
826 g_detach(struct g_consumer *cp)
828 struct g_provider *pp;
831 G_VALID_CONSUMER(cp);
832 g_trace(G_T_TOPOLOGY, "g_detach(%p)", cp);
833 KASSERT(cp->provider != NULL, ("detach but not attached"));
834 KASSERT(cp->acr == 0, ("detach but nonzero acr"));
835 KASSERT(cp->acw == 0, ("detach but nonzero acw"));
836 KASSERT(cp->ace == 0, ("detach but nonzero ace"));
837 KASSERT(cp->nstart == cp->nend,
838 ("detach with active requests"));
840 LIST_REMOVE(cp, consumers);
842 if ((cp->geom->flags & G_GEOM_WITHER) ||
843 (pp->geom->flags & G_GEOM_WITHER) ||
844 (pp->flags & G_PF_WITHER))
852 * Access-check with delta values. The question asked is "can provider
853 * "cp" change the access counters by the relative amounts dc[rwe] ?"
857 g_access(struct g_consumer *cp, int dcr, int dcw, int dce)
859 struct g_provider *pp;
864 G_VALID_CONSUMER(cp);
866 KASSERT(pp != NULL, ("access but not attached"));
867 G_VALID_PROVIDER(pp);
869 g_trace(G_T_ACCESS, "g_access(%p(%s), %d, %d, %d)",
870 cp, pp->name, dcr, dcw, dce);
872 KASSERT(cp->acr + dcr >= 0, ("access resulting in negative acr"));
873 KASSERT(cp->acw + dcw >= 0, ("access resulting in negative acw"));
874 KASSERT(cp->ace + dce >= 0, ("access resulting in negative ace"));
875 KASSERT(dcr != 0 || dcw != 0 || dce != 0, ("NOP access request"));
876 KASSERT(pp->geom->access != NULL, ("NULL geom->access"));
879 * If our class cares about being spoiled, and we have been, we
880 * are probably just ahead of the event telling us that. Fail
881 * now rather than having to unravel this later.
883 if (cp->geom->spoiled != NULL && (cp->flags & G_CF_SPOILED) &&
884 (dcr > 0 || dcw > 0 || dce > 0))
888 * Figure out what counts the provider would have had, if this
889 * consumer had (r0w0e0) at this time.
891 pr = pp->acr - cp->acr;
892 pw = pp->acw - cp->acw;
893 pe = pp->ace - cp->ace;
896 "open delta:[r%dw%de%d] old:[r%dw%de%d] provider:[r%dw%de%d] %p(%s)",
898 cp->acr, cp->acw, cp->ace,
899 pp->acr, pp->acw, pp->ace,
902 /* If foot-shooting is enabled, any open on rank#1 is OK */
903 if ((g_debugflags & 16) && pp->geom->rank == 1)
905 /* If we try exclusive but already write: fail */
906 else if (dce > 0 && pw > 0)
908 /* If we try write but already exclusive: fail */
909 else if (dcw > 0 && pe > 0)
911 /* If we try to open more but provider is error'ed: fail */
912 else if ((dcr > 0 || dcw > 0 || dce > 0) && pp->error != 0)
917 error = pp->geom->access(pp, dcr, dcw, dce);
918 KASSERT(dcr > 0 || dcw > 0 || dce > 0 || error == 0,
919 ("Geom provider %s::%s dcr=%d dcw=%d dce=%d error=%d failed "
920 "closing ->access()", pp->geom->class->name, pp->name, dcr, dcw,
924 * If we open first write, spoil any partner consumers.
925 * If we close last write and provider is not errored,
928 if (pp->acw == 0 && dcw != 0)
930 else if (pp->acw != 0 && pp->acw == -dcw && pp->error == 0 &&
931 !(pp->geom->flags & G_GEOM_WITHER))
932 g_post_event(g_new_provider_event, pp, M_WAITOK,
941 if (pp->acr != 0 || pp->acw != 0 || pp->ace != 0)
942 KASSERT(pp->sectorsize > 0,
943 ("Provider %s lacks sectorsize", pp->name));
944 if ((cp->geom->flags & G_GEOM_WITHER) &&
945 cp->acr == 0 && cp->acw == 0 && cp->ace == 0)
952 g_handleattr_int(struct bio *bp, const char *attribute, int val)
955 return (g_handleattr(bp, attribute, &val, sizeof val));
959 g_handleattr_uint16_t(struct bio *bp, const char *attribute, uint16_t val)
962 return (g_handleattr(bp, attribute, &val, sizeof val));
966 g_handleattr_off_t(struct bio *bp, const char *attribute, off_t val)
969 return (g_handleattr(bp, attribute, &val, sizeof val));
973 g_handleattr_str(struct bio *bp, const char *attribute, const char *str)
976 return (g_handleattr(bp, attribute, str, 0));
980 g_handleattr(struct bio *bp, const char *attribute, const void *val, int len)
984 if (strcmp(bp->bio_attribute, attribute))
987 bzero(bp->bio_data, bp->bio_length);
988 if (strlcpy(bp->bio_data, val, bp->bio_length) >=
990 printf("%s: %s bio_length %jd len %zu -> EFAULT\n",
991 __func__, bp->bio_to->name,
992 (intmax_t)bp->bio_length, strlen(val));
995 } else if (bp->bio_length == len) {
996 bcopy(val, bp->bio_data, len);
998 printf("%s: %s bio_length %jd len %d -> EFAULT\n", __func__,
999 bp->bio_to->name, (intmax_t)bp->bio_length, len);
1003 bp->bio_completed = bp->bio_length;
1004 g_io_deliver(bp, error);
1009 g_std_access(struct g_provider *pp,
1010 int dr __unused, int dw __unused, int de __unused)
1013 g_topology_assert();
1014 G_VALID_PROVIDER(pp);
1019 g_std_done(struct bio *bp)
1023 bp2 = bp->bio_parent;
1024 if (bp2->bio_error == 0)
1025 bp2->bio_error = bp->bio_error;
1026 bp2->bio_completed += bp->bio_completed;
1029 if (bp2->bio_children == bp2->bio_inbed)
1030 g_io_deliver(bp2, bp2->bio_error);
1033 /* XXX: maybe this is only g_slice_spoiled */
1036 g_std_spoiled(struct g_consumer *cp)
1039 struct g_provider *pp;
1041 g_topology_assert();
1042 G_VALID_CONSUMER(cp);
1043 g_trace(G_T_TOPOLOGY, "g_std_spoiled(%p)", cp);
1044 cp->flags |= G_CF_ORPHAN;
1047 LIST_FOREACH(pp, &gp->provider, provider)
1048 g_orphan_provider(pp, ENXIO);
1049 g_destroy_consumer(cp);
1050 if (LIST_EMPTY(&gp->provider) && LIST_EMPTY(&gp->consumer))
1053 gp->flags |= G_GEOM_WITHER;
1057 * Spoiling happens when a provider is opened for writing, but consumers
1058 * which are configured by in-band data are attached (slicers for instance).
1059 * Since the write might potentially change the in-band data, such consumers
1060 * need to re-evaluate their existence after the writing session closes.
1061 * We do this by (offering to) tear them down when the open for write happens
1062 * in return for a re-taste when it closes again.
1063 * Together with the fact that such consumers grab an 'e' bit whenever they
1064 * are open, regardless of mode, this ends up DTRT.
1068 g_spoil_event(void *arg, int flag)
1070 struct g_provider *pp;
1071 struct g_consumer *cp, *cp2;
1073 g_topology_assert();
1074 if (flag == EV_CANCEL)
1077 G_VALID_PROVIDER(pp);
1078 g_trace(G_T_TOPOLOGY, "%s %p(%s:%s:%s)", __func__, pp,
1079 pp->geom->class->name, pp->geom->name, pp->name);
1080 for (cp = LIST_FIRST(&pp->consumers); cp != NULL; cp = cp2) {
1081 cp2 = LIST_NEXT(cp, consumers);
1082 if ((cp->flags & G_CF_SPOILED) == 0)
1084 cp->flags &= ~G_CF_SPOILED;
1085 if (cp->geom->spoiled == NULL)
1087 cp->geom->spoiled(cp);
1088 g_topology_assert();
1093 g_spoil(struct g_provider *pp, struct g_consumer *cp)
1095 struct g_consumer *cp2;
1097 g_topology_assert();
1098 G_VALID_PROVIDER(pp);
1099 G_VALID_CONSUMER(cp);
1101 LIST_FOREACH(cp2, &pp->consumers, consumers) {
1105 KASSERT(cp2->acr == 0, ("spoiling cp->acr = %d", cp2->acr));
1106 KASSERT(cp2->acw == 0, ("spoiling cp->acw = %d", cp2->acw));
1108 KASSERT(cp2->ace == 0, ("spoiling cp->ace = %d", cp2->ace));
1109 cp2->flags |= G_CF_SPOILED;
1111 g_post_event(g_spoil_event, pp, M_WAITOK, pp, NULL);
1115 g_media_changed_event(void *arg, int flag)
1117 struct g_provider *pp;
1120 g_topology_assert();
1121 if (flag == EV_CANCEL)
1124 G_VALID_PROVIDER(pp);
1127 * If provider was not open for writing, queue retaste after spoiling.
1128 * If it was, retaste will happen automatically on close.
1130 retaste = (pp->acw == 0 && pp->error == 0 &&
1131 !(pp->geom->flags & G_GEOM_WITHER));
1132 g_spoil_event(arg, flag);
1134 g_post_event(g_new_provider_event, pp, M_WAITOK, pp, NULL);
1138 g_media_changed(struct g_provider *pp, int flag)
1140 struct g_consumer *cp;
1142 LIST_FOREACH(cp, &pp->consumers, consumers)
1143 cp->flags |= G_CF_SPOILED;
1144 return (g_post_event(g_media_changed_event, pp, flag, pp, NULL));
1148 g_media_gone(struct g_provider *pp, int flag)
1150 struct g_consumer *cp;
1152 LIST_FOREACH(cp, &pp->consumers, consumers)
1153 cp->flags |= G_CF_SPOILED;
1154 return (g_post_event(g_spoil_event, pp, flag, pp, NULL));
1158 g_getattr__(const char *attr, struct g_consumer *cp, void *var, int len)
1163 error = g_io_getattr(attr, cp, &i, var);
1172 g_get_device_prefix_len(const char *name)
1176 if (strncmp(name, "ada", 3) == 0)
1178 else if (strncmp(name, "ad", 2) == 0)
1182 if (name[len] < '0' || name[len] > '9')
1186 } while (name[len] >= '0' && name[len] <= '9');
1191 g_compare_names(const char *namea, const char *nameb)
1195 if (strcmp(namea, nameb) == 0)
1197 deva = g_get_device_prefix_len(namea);
1200 devb = g_get_device_prefix_len(nameb);
1203 if (strcmp(namea + deva, nameb + devb) == 0)
1208 #if defined(DIAGNOSTIC) || defined(DDB)
1210 * This function walks the mesh and returns a non-zero integer if it
1211 * finds the argument pointer is an object. The return value indicates
1212 * which type of object it is believed to be. If topology is not locked,
1213 * this function is potentially dangerous, but we don't assert that the
1214 * topology lock is held when called from debugger.
1217 g_valid_obj(void const *ptr)
1221 struct g_consumer *cp;
1222 struct g_provider *pp;
1225 if (kdb_active == 0)
1227 g_topology_assert();
1229 LIST_FOREACH(mp, &g_classes, class) {
1232 LIST_FOREACH(gp, &mp->geom, geom) {
1235 LIST_FOREACH(cp, &gp->consumer, consumer)
1238 LIST_FOREACH(pp, &gp->provider, provider)
1249 #define gprintf(...) do { \
1250 db_printf("%*s", indent, ""); \
1251 db_printf(__VA_ARGS__); \
1253 #define gprintln(...) do { \
1254 gprintf(__VA_ARGS__); \
1258 #define ADDFLAG(obj, flag, sflag) do { \
1259 if ((obj)->flags & (flag)) { \
1261 strlcat(str, ",", size); \
1262 strlcat(str, (sflag), size); \
1268 provider_flags_to_string(struct g_provider *pp, char *str, size_t size)
1273 if (pp->flags == 0) {
1274 strlcpy(str, "NONE", size);
1277 ADDFLAG(pp, G_PF_WITHER, "G_PF_WITHER");
1278 ADDFLAG(pp, G_PF_ORPHAN, "G_PF_ORPHAN");
1283 geom_flags_to_string(struct g_geom *gp, char *str, size_t size)
1288 if (gp->flags == 0) {
1289 strlcpy(str, "NONE", size);
1292 ADDFLAG(gp, G_GEOM_WITHER, "G_GEOM_WITHER");
1296 db_show_geom_consumer(int indent, struct g_consumer *cp)
1300 gprintln("consumer: %p", cp);
1301 gprintln(" class: %s (%p)", cp->geom->class->name,
1303 gprintln(" geom: %s (%p)", cp->geom->name, cp->geom);
1304 if (cp->provider == NULL)
1305 gprintln(" provider: none");
1307 gprintln(" provider: %s (%p)", cp->provider->name,
1310 gprintln(" access: r%dw%de%d", cp->acr, cp->acw, cp->ace);
1311 gprintln(" flags: 0x%04x", cp->flags);
1312 gprintln(" nstart: %u", cp->nstart);
1313 gprintln(" nend: %u", cp->nend);
1315 gprintf("consumer: %p (%s), access=r%dw%de%d", cp,
1316 cp->provider != NULL ? cp->provider->name : "none",
1317 cp->acr, cp->acw, cp->ace);
1319 db_printf(", flags=0x%04x", cp->flags);
1325 db_show_geom_provider(int indent, struct g_provider *pp)
1327 struct g_consumer *cp;
1331 gprintln("provider: %s (%p)", pp->name, pp);
1332 gprintln(" class: %s (%p)", pp->geom->class->name,
1334 gprintln(" geom: %s (%p)", pp->geom->name, pp->geom);
1335 gprintln(" mediasize: %jd", (intmax_t)pp->mediasize);
1336 gprintln(" sectorsize: %u", pp->sectorsize);
1337 gprintln(" stripesize: %u", pp->stripesize);
1338 gprintln(" stripeoffset: %u", pp->stripeoffset);
1339 gprintln(" access: r%dw%de%d", pp->acr, pp->acw,
1341 gprintln(" flags: %s (0x%04x)",
1342 provider_flags_to_string(pp, flags, sizeof(flags)),
1344 gprintln(" error: %d", pp->error);
1345 gprintln(" nstart: %u", pp->nstart);
1346 gprintln(" nend: %u", pp->nend);
1347 if (LIST_EMPTY(&pp->consumers))
1348 gprintln(" consumers: none");
1350 gprintf("provider: %s (%p), access=r%dw%de%d",
1351 pp->name, pp, pp->acr, pp->acw, pp->ace);
1352 if (pp->flags != 0) {
1353 db_printf(", flags=%s (0x%04x)",
1354 provider_flags_to_string(pp, flags, sizeof(flags)),
1359 if (!LIST_EMPTY(&pp->consumers)) {
1360 LIST_FOREACH(cp, &pp->consumers, consumers) {
1361 db_show_geom_consumer(indent + 2, cp);
1369 db_show_geom_geom(int indent, struct g_geom *gp)
1371 struct g_provider *pp;
1372 struct g_consumer *cp;
1376 gprintln("geom: %s (%p)", gp->name, gp);
1377 gprintln(" class: %s (%p)", gp->class->name, gp->class);
1378 gprintln(" flags: %s (0x%04x)",
1379 geom_flags_to_string(gp, flags, sizeof(flags)), gp->flags);
1380 gprintln(" rank: %d", gp->rank);
1381 if (LIST_EMPTY(&gp->provider))
1382 gprintln(" providers: none");
1383 if (LIST_EMPTY(&gp->consumer))
1384 gprintln(" consumers: none");
1386 gprintf("geom: %s (%p), rank=%d", gp->name, gp, gp->rank);
1387 if (gp->flags != 0) {
1388 db_printf(", flags=%s (0x%04x)",
1389 geom_flags_to_string(gp, flags, sizeof(flags)),
1394 if (!LIST_EMPTY(&gp->provider)) {
1395 LIST_FOREACH(pp, &gp->provider, provider) {
1396 db_show_geom_provider(indent + 2, pp);
1401 if (!LIST_EMPTY(&gp->consumer)) {
1402 LIST_FOREACH(cp, &gp->consumer, consumer) {
1403 db_show_geom_consumer(indent + 2, cp);
1411 db_show_geom_class(struct g_class *mp)
1415 db_printf("class: %s (%p)\n", mp->name, mp);
1416 LIST_FOREACH(gp, &mp->geom, geom) {
1417 db_show_geom_geom(2, gp);
1424 * Print the GEOM topology or the given object.
1426 DB_SHOW_COMMAND(geom, db_show_geom)
1431 /* No address given, print the entire topology. */
1432 LIST_FOREACH(mp, &g_classes, class) {
1433 db_show_geom_class(mp);
1439 switch (g_valid_obj((void *)addr)) {
1441 db_show_geom_class((struct g_class *)addr);
1444 db_show_geom_geom(0, (struct g_geom *)addr);
1447 db_show_geom_consumer(0, (struct g_consumer *)addr);
1450 db_show_geom_provider(0, (struct g_provider *)addr);
1453 db_printf("Not a GEOM object.\n");
1460 db_print_bio_cmd(struct bio *bp)
1462 db_printf(" cmd: ");
1463 switch (bp->bio_cmd) {
1464 case BIO_READ: db_printf("BIO_READ"); break;
1465 case BIO_WRITE: db_printf("BIO_WRITE"); break;
1466 case BIO_DELETE: db_printf("BIO_DELETE"); break;
1467 case BIO_GETATTR: db_printf("BIO_GETATTR"); break;
1468 case BIO_FLUSH: db_printf("BIO_FLUSH"); break;
1469 case BIO_CMD0: db_printf("BIO_CMD0"); break;
1470 case BIO_CMD1: db_printf("BIO_CMD1"); break;
1471 case BIO_CMD2: db_printf("BIO_CMD2"); break;
1472 case BIO_ZONE: db_printf("BIO_ZONE"); break;
1473 default: db_printf("UNKNOWN"); break;
1479 db_print_bio_flags(struct bio *bp)
1484 db_printf(" flags: ");
1485 if (bp->bio_flags & BIO_ERROR) {
1486 db_printf("BIO_ERROR");
1489 if (bp->bio_flags & BIO_DONE) {
1490 db_printf("%sBIO_DONE", (comma ? ", " : ""));
1493 if (bp->bio_flags & BIO_ONQUEUE)
1494 db_printf("%sBIO_ONQUEUE", (comma ? ", " : ""));
1499 * Print useful information in a BIO
1501 DB_SHOW_COMMAND(bio, db_show_bio)
1506 bp = (struct bio *)addr;
1507 db_printf("BIO %p\n", bp);
1508 db_print_bio_cmd(bp);
1509 db_print_bio_flags(bp);
1510 db_printf(" cflags: 0x%hx\n", bp->bio_cflags);
1511 db_printf(" pflags: 0x%hx\n", bp->bio_pflags);
1512 db_printf(" offset: %jd\n", (intmax_t)bp->bio_offset);
1513 db_printf(" length: %jd\n", (intmax_t)bp->bio_length);
1514 db_printf(" bcount: %ld\n", bp->bio_bcount);
1515 db_printf(" resid: %ld\n", bp->bio_resid);
1516 db_printf(" completed: %jd\n", (intmax_t)bp->bio_completed);
1517 db_printf(" children: %u\n", bp->bio_children);
1518 db_printf(" inbed: %u\n", bp->bio_inbed);
1519 db_printf(" error: %d\n", bp->bio_error);
1520 db_printf(" parent: %p\n", bp->bio_parent);
1521 db_printf(" driver1: %p\n", bp->bio_driver1);
1522 db_printf(" driver2: %p\n", bp->bio_driver2);
1523 db_printf(" caller1: %p\n", bp->bio_caller1);
1524 db_printf(" caller2: %p\n", bp->bio_caller2);
1525 db_printf(" bio_from: %p\n", bp->bio_from);
1526 db_printf(" bio_to: %p\n", bp->bio_to);