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