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$"); 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 66struct class_list_head g_classes = LIST_HEAD_INITIALIZER(g_classes); 67static struct g_tailq_head geoms = TAILQ_HEAD_INITIALIZER(geoms); 68char *g_wait_event, *g_wait_up, *g_wait_down, *g_wait_sim; 69 70struct 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 */ 81static void 82g_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 139static int 140g_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); 149retry: 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 208int 209g_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 262static void 263g_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 307int 308g_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 332struct g_geom * 333g_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 369void 370g_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 */ 392void 393g_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 */ 412void 413g_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 */ 424void 425g_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 */ 442void 443g_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 479struct g_consumer * 480g_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 501void 502g_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 522static void 523g_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 560struct g_provider * 561g_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 597void 598g_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 605static void 606g_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 661void 662g_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 681struct g_provider * 682g_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 703void 704g_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 748static int 749redo_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 800int 801g_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 821void 822g_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 852int 853g_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 dcr=%d dcw=%d dce=%d error=%d failed " 916 "closing ->access()", pp->geom->class->name, pp->name, dcr, dcw, 917 dce, error)); 918 if (!error) { 919 /* 920 * If we open first write, spoil any partner consumers. 921 * If we close last write and provider is not errored, 922 * trigger re-taste. 923 */ 924 if (pp->acw == 0 && dcw != 0) 925 g_spoil(pp, cp); 926 else if (pp->acw != 0 && pp->acw == -dcw && pp->error == 0 && 927 !(pp->geom->flags & G_GEOM_WITHER)) 928 g_post_event(g_new_provider_event, pp, M_WAITOK, 929 pp, NULL); 930 931 pp->acr += dcr; 932 pp->acw += dcw; 933 pp->ace += dce; 934 cp->acr += dcr; 935 cp->acw += dcw; 936 cp->ace += dce; 937 if (pp->acr != 0 || pp->acw != 0 || pp->ace != 0) 938 KASSERT(pp->sectorsize > 0, 939 ("Provider %s lacks sectorsize", pp->name)); 940 if ((cp->geom->flags & G_GEOM_WITHER) && 941 cp->acr == 0 && cp->acw == 0 && cp->ace == 0) 942 g_do_wither(); 943 } 944 return (error); 945} 946 947int 948g_handleattr_int(struct bio *bp, const char *attribute, int val) 949{ 950 951 return (g_handleattr(bp, attribute, &val, sizeof val)); 952} 953 954int 955g_handleattr_uint16_t(struct bio *bp, const char *attribute, uint16_t val) 956{ 957 958 return (g_handleattr(bp, attribute, &val, sizeof val)); 959} 960 961int 962g_handleattr_off_t(struct bio *bp, const char *attribute, off_t val) 963{ 964 965 return (g_handleattr(bp, attribute, &val, sizeof val)); 966} 967 968int 969g_handleattr_str(struct bio *bp, const char *attribute, const char *str) 970{ 971 972 return (g_handleattr(bp, attribute, str, 0)); 973} 974 975int 976g_handleattr(struct bio *bp, const char *attribute, const void *val, int len) 977{ 978 int error = 0; 979 980 if (strcmp(bp->bio_attribute, attribute)) 981 return (0); 982 if (len == 0) { 983 bzero(bp->bio_data, bp->bio_length); 984 if (strlcpy(bp->bio_data, val, bp->bio_length) >= 985 bp->bio_length) { 986 printf("%s: %s bio_length %jd len %zu -> EFAULT\n", 987 __func__, bp->bio_to->name, 988 (intmax_t)bp->bio_length, strlen(val)); 989 error = EFAULT; 990 } 991 } else if (bp->bio_length == len) { 992 bcopy(val, bp->bio_data, len); 993 } else { 994 printf("%s: %s bio_length %jd len %d -> EFAULT\n", __func__, 995 bp->bio_to->name, (intmax_t)bp->bio_length, len); 996 error = EFAULT; 997 } 998 if (error == 0) 999 bp->bio_completed = bp->bio_length; 1000 g_io_deliver(bp, error); 1001 return (1); 1002} 1003 1004int 1005g_std_access(struct g_provider *pp, 1006 int dr __unused, int dw __unused, int de __unused) 1007{ 1008 1009 g_topology_assert(); 1010 G_VALID_PROVIDER(pp); 1011 return (0); 1012} 1013 1014void 1015g_std_done(struct bio *bp) 1016{ 1017 struct bio *bp2; 1018 1019 bp2 = bp->bio_parent; 1020 if (bp2->bio_error == 0) 1021 bp2->bio_error = bp->bio_error; 1022 bp2->bio_completed += bp->bio_completed; 1023 g_destroy_bio(bp); 1024 bp2->bio_inbed++; 1025 if (bp2->bio_children == bp2->bio_inbed) 1026 g_io_deliver(bp2, bp2->bio_error); 1027} 1028 1029/* XXX: maybe this is only g_slice_spoiled */ 1030 1031void 1032g_std_spoiled(struct g_consumer *cp) 1033{ 1034 struct g_geom *gp; 1035 struct g_provider *pp; 1036 1037 g_topology_assert(); 1038 G_VALID_CONSUMER(cp); 1039 g_trace(G_T_TOPOLOGY, "g_std_spoiled(%p)", cp); 1040 cp->flags |= G_CF_ORPHAN; 1041 g_detach(cp); 1042 gp = cp->geom; 1043 LIST_FOREACH(pp, &gp->provider, provider) 1044 g_orphan_provider(pp, ENXIO); 1045 g_destroy_consumer(cp); 1046 if (LIST_EMPTY(&gp->provider) && LIST_EMPTY(&gp->consumer)) 1047 g_destroy_geom(gp); 1048 else 1049 gp->flags |= G_GEOM_WITHER; 1050} 1051 1052/* 1053 * Spoiling happens when a provider is opened for writing, but consumers 1054 * which are configured by in-band data are attached (slicers for instance). 1055 * Since the write might potentially change the in-band data, such consumers 1056 * need to re-evaluate their existence after the writing session closes. 1057 * We do this by (offering to) tear them down when the open for write happens 1058 * in return for a re-taste when it closes again. 1059 * Together with the fact that such consumers grab an 'e' bit whenever they 1060 * are open, regardless of mode, this ends up DTRT. 1061 */ 1062 1063static void 1064g_spoil_event(void *arg, int flag) 1065{ 1066 struct g_provider *pp; 1067 struct g_consumer *cp, *cp2; 1068 1069 g_topology_assert(); 1070 if (flag == EV_CANCEL) 1071 return; 1072 pp = arg; 1073 G_VALID_PROVIDER(pp); 1074 g_trace(G_T_TOPOLOGY, "%s %p(%s:%s:%s)", __func__, pp, 1075 pp->geom->class->name, pp->geom->name, pp->name); 1076 for (cp = LIST_FIRST(&pp->consumers); cp != NULL; cp = cp2) { 1077 cp2 = LIST_NEXT(cp, consumers); 1078 if ((cp->flags & G_CF_SPOILED) == 0) 1079 continue; 1080 cp->flags &= ~G_CF_SPOILED; 1081 if (cp->geom->spoiled == NULL) 1082 continue; 1083 cp->geom->spoiled(cp); 1084 g_topology_assert(); 1085 } 1086} 1087 1088void 1089g_spoil(struct g_provider *pp, struct g_consumer *cp) 1090{ 1091 struct g_consumer *cp2; 1092 1093 g_topology_assert(); 1094 G_VALID_PROVIDER(pp); 1095 G_VALID_CONSUMER(cp); 1096 1097 LIST_FOREACH(cp2, &pp->consumers, consumers) { 1098 if (cp2 == cp) 1099 continue; 1100/* 1101 KASSERT(cp2->acr == 0, ("spoiling cp->acr = %d", cp2->acr)); 1102 KASSERT(cp2->acw == 0, ("spoiling cp->acw = %d", cp2->acw)); 1103*/ 1104 KASSERT(cp2->ace == 0, ("spoiling cp->ace = %d", cp2->ace)); 1105 cp2->flags |= G_CF_SPOILED; 1106 } 1107 g_post_event(g_spoil_event, pp, M_WAITOK, pp, NULL); 1108} 1109 1110static void 1111g_media_changed_event(void *arg, int flag) 1112{ 1113 struct g_provider *pp; 1114 int retaste; 1115 1116 g_topology_assert(); 1117 if (flag == EV_CANCEL) 1118 return; 1119 pp = arg; 1120 G_VALID_PROVIDER(pp); 1121 1122 /* 1123 * If provider was not open for writing, queue retaste after spoiling. 1124 * If it was, retaste will happen automatically on close. 1125 */ 1126 retaste = (pp->acw == 0 && pp->error == 0 && 1127 !(pp->geom->flags & G_GEOM_WITHER)); 1128 g_spoil_event(arg, flag); 1129 if (retaste) 1130 g_post_event(g_new_provider_event, pp, M_WAITOK, pp, NULL); 1131} 1132 1133int 1134g_media_changed(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_media_changed_event, pp, flag, pp, NULL)); 1141} 1142 1143int 1144g_media_gone(struct g_provider *pp, int flag) 1145{ 1146 struct g_consumer *cp; 1147 1148 LIST_FOREACH(cp, &pp->consumers, consumers) 1149 cp->flags |= G_CF_SPOILED; 1150 return (g_post_event(g_spoil_event, pp, flag, pp, NULL)); 1151} 1152 1153int 1154g_getattr__(const char *attr, struct g_consumer *cp, void *var, int len) 1155{ 1156 int error, i; 1157 1158 i = len; 1159 error = g_io_getattr(attr, cp, &i, var); 1160 if (error) 1161 return (error); 1162 if (i != len) 1163 return (EINVAL); 1164 return (0); 1165} 1166 1167static int 1168g_get_device_prefix_len(const char *name) 1169{ 1170 int len; 1171 1172 if (strncmp(name, "ada", 3) == 0) 1173 len = 3; 1174 else if (strncmp(name, "ad", 2) == 0) 1175 len = 2; 1176 else 1177 return (0); 1178 if (name[len] < '0' || name[len] > '9') 1179 return (0); 1180 do { 1181 len++; 1182 } while (name[len] >= '0' && name[len] <= '9'); 1183 return (len); 1184} 1185 1186int 1187g_compare_names(const char *namea, const char *nameb) 1188{ 1189 int deva, devb; 1190 1191 if (strcmp(namea, nameb) == 0) 1192 return (1); 1193 deva = g_get_device_prefix_len(namea); 1194 if (deva == 0) 1195 return (0); 1196 devb = g_get_device_prefix_len(nameb); 1197 if (devb == 0) 1198 return (0); 1199 if (strcmp(namea + deva, nameb + devb) == 0) 1200 return (1); 1201 return (0); 1202} 1203 1204#if defined(DIAGNOSTIC) || defined(DDB) 1205/* 1206 * This function walks the mesh and returns a non-zero integer if it 1207 * finds the argument pointer is an object. The return value indicates 1208 * which type of object it is believed to be. If topology is not locked, 1209 * this function is potentially dangerous, but we don't assert that the 1210 * topology lock is held when called from debugger. 1211 */ 1212int 1213g_valid_obj(void const *ptr) 1214{ 1215 struct g_class *mp; 1216 struct g_geom *gp; 1217 struct g_consumer *cp; 1218 struct g_provider *pp; 1219 1220#ifdef KDB 1221 if (kdb_active == 0) 1222#endif 1223 g_topology_assert(); 1224 1225 LIST_FOREACH(mp, &g_classes, class) { 1226 if (ptr == mp) 1227 return (1); 1228 LIST_FOREACH(gp, &mp->geom, geom) { 1229 if (ptr == gp) 1230 return (2); 1231 LIST_FOREACH(cp, &gp->consumer, consumer) 1232 if (ptr == cp) 1233 return (3); 1234 LIST_FOREACH(pp, &gp->provider, provider) 1235 if (ptr == pp) 1236 return (4); 1237 } 1238 } 1239 return(0); 1240} 1241#endif 1242 1243#ifdef DDB 1244 1245#define gprintf(...) do { \ 1246 db_printf("%*s", indent, ""); \ 1247 db_printf(__VA_ARGS__); \ 1248} while (0) 1249#define gprintln(...) do { \ 1250 gprintf(__VA_ARGS__); \ 1251 db_printf("\n"); \ 1252} while (0) 1253 1254#define ADDFLAG(obj, flag, sflag) do { \ 1255 if ((obj)->flags & (flag)) { \ 1256 if (comma) \ 1257 strlcat(str, ",", size); \ 1258 strlcat(str, (sflag), size); \ 1259 comma = 1; \ 1260 } \ 1261} while (0) 1262 1263static char * 1264provider_flags_to_string(struct g_provider *pp, char *str, size_t size) 1265{ 1266 int comma = 0; 1267 1268 bzero(str, size); 1269 if (pp->flags == 0) { 1270 strlcpy(str, "NONE", size); 1271 return (str); 1272 } 1273 ADDFLAG(pp, G_PF_WITHER, "G_PF_WITHER"); 1274 ADDFLAG(pp, G_PF_ORPHAN, "G_PF_ORPHAN"); 1275 return (str); 1276} 1277 1278static char * 1279geom_flags_to_string(struct g_geom *gp, char *str, size_t size) 1280{ 1281 int comma = 0; 1282 1283 bzero(str, size); 1284 if (gp->flags == 0) { 1285 strlcpy(str, "NONE", size); 1286 return (str); 1287 } 1288 ADDFLAG(gp, G_GEOM_WITHER, "G_GEOM_WITHER"); 1289 return (str); 1290} 1291static void 1292db_show_geom_consumer(int indent, struct g_consumer *cp) 1293{ 1294 1295 if (indent == 0) { 1296 gprintln("consumer: %p", cp); 1297 gprintln(" class: %s (%p)", cp->geom->class->name, 1298 cp->geom->class); 1299 gprintln(" geom: %s (%p)", cp->geom->name, cp->geom); 1300 if (cp->provider == NULL) 1301 gprintln(" provider: none"); 1302 else { 1303 gprintln(" provider: %s (%p)", cp->provider->name, 1304 cp->provider); 1305 } 1306 gprintln(" access: r%dw%de%d", cp->acr, cp->acw, cp->ace); 1307 gprintln(" flags: 0x%04x", cp->flags); 1308 gprintln(" nstart: %u", cp->nstart); 1309 gprintln(" nend: %u", cp->nend); 1310 } else { 1311 gprintf("consumer: %p (%s), access=r%dw%de%d", cp, 1312 cp->provider != NULL ? cp->provider->name : "none", 1313 cp->acr, cp->acw, cp->ace); 1314 if (cp->flags) 1315 db_printf(", flags=0x%04x", cp->flags); 1316 db_printf("\n"); 1317 } 1318} 1319 1320static void 1321db_show_geom_provider(int indent, struct g_provider *pp) 1322{ 1323 struct g_consumer *cp; 1324 char flags[64]; 1325 1326 if (indent == 0) { 1327 gprintln("provider: %s (%p)", pp->name, pp); 1328 gprintln(" class: %s (%p)", pp->geom->class->name, 1329 pp->geom->class); 1330 gprintln(" geom: %s (%p)", pp->geom->name, pp->geom); 1331 gprintln(" mediasize: %jd", (intmax_t)pp->mediasize); 1332 gprintln(" sectorsize: %u", pp->sectorsize); 1333 gprintln(" stripesize: %u", pp->stripesize); 1334 gprintln(" stripeoffset: %u", pp->stripeoffset); 1335 gprintln(" access: r%dw%de%d", pp->acr, pp->acw, 1336 pp->ace); 1337 gprintln(" flags: %s (0x%04x)", 1338 provider_flags_to_string(pp, flags, sizeof(flags)), 1339 pp->flags); 1340 gprintln(" error: %d", pp->error); 1341 gprintln(" nstart: %u", pp->nstart); 1342 gprintln(" nend: %u", pp->nend); 1343 if (LIST_EMPTY(&pp->consumers)) 1344 gprintln(" consumers: none"); 1345 } else { 1346 gprintf("provider: %s (%p), access=r%dw%de%d", 1347 pp->name, pp, pp->acr, pp->acw, pp->ace); 1348 if (pp->flags != 0) { 1349 db_printf(", flags=%s (0x%04x)", 1350 provider_flags_to_string(pp, flags, sizeof(flags)), 1351 pp->flags); 1352 } 1353 db_printf("\n"); 1354 } 1355 if (!LIST_EMPTY(&pp->consumers)) { 1356 LIST_FOREACH(cp, &pp->consumers, consumers) { 1357 db_show_geom_consumer(indent + 2, cp); 1358 if (db_pager_quit) 1359 break; 1360 } 1361 } 1362} 1363 1364static void 1365db_show_geom_geom(int indent, struct g_geom *gp) 1366{ 1367 struct g_provider *pp; 1368 struct g_consumer *cp; 1369 char flags[64]; 1370 1371 if (indent == 0) { 1372 gprintln("geom: %s (%p)", gp->name, gp); 1373 gprintln(" class: %s (%p)", gp->class->name, gp->class); 1374 gprintln(" flags: %s (0x%04x)", 1375 geom_flags_to_string(gp, flags, sizeof(flags)), gp->flags); 1376 gprintln(" rank: %d", gp->rank); 1377 if (LIST_EMPTY(&gp->provider)) 1378 gprintln(" providers: none"); 1379 if (LIST_EMPTY(&gp->consumer)) 1380 gprintln(" consumers: none"); 1381 } else { 1382 gprintf("geom: %s (%p), rank=%d", gp->name, gp, gp->rank); 1383 if (gp->flags != 0) { 1384 db_printf(", flags=%s (0x%04x)", 1385 geom_flags_to_string(gp, flags, sizeof(flags)), 1386 gp->flags); 1387 } 1388 db_printf("\n"); 1389 } 1390 if (!LIST_EMPTY(&gp->provider)) { 1391 LIST_FOREACH(pp, &gp->provider, provider) { 1392 db_show_geom_provider(indent + 2, pp); 1393 if (db_pager_quit) 1394 break; 1395 } 1396 } 1397 if (!LIST_EMPTY(&gp->consumer)) { 1398 LIST_FOREACH(cp, &gp->consumer, consumer) { 1399 db_show_geom_consumer(indent + 2, cp); 1400 if (db_pager_quit) 1401 break; 1402 } 1403 } 1404} 1405 1406static void 1407db_show_geom_class(struct g_class *mp) 1408{ 1409 struct g_geom *gp; 1410 1411 db_printf("class: %s (%p)\n", mp->name, mp); 1412 LIST_FOREACH(gp, &mp->geom, geom) { 1413 db_show_geom_geom(2, gp); 1414 if (db_pager_quit) 1415 break; 1416 } 1417} 1418 1419/* 1420 * Print the GEOM topology or the given object. 1421 */ 1422DB_SHOW_COMMAND(geom, db_show_geom) 1423{ 1424 struct g_class *mp; 1425 1426 if (!have_addr) { 1427 /* No address given, print the entire topology. */ 1428 LIST_FOREACH(mp, &g_classes, class) { 1429 db_show_geom_class(mp); 1430 db_printf("\n"); 1431 if (db_pager_quit) 1432 break; 1433 } 1434 } else { 1435 switch (g_valid_obj((void *)addr)) { 1436 case 1: 1437 db_show_geom_class((struct g_class *)addr); 1438 break; 1439 case 2: 1440 db_show_geom_geom(0, (struct g_geom *)addr); 1441 break; 1442 case 3: 1443 db_show_geom_consumer(0, (struct g_consumer *)addr); 1444 break; 1445 case 4: 1446 db_show_geom_provider(0, (struct g_provider *)addr); 1447 break; 1448 default: 1449 db_printf("Not a GEOM object.\n"); 1450 break; 1451 } 1452 } 1453} 1454 1455static void 1456db_print_bio_cmd(struct bio *bp) 1457{ 1458 db_printf(" cmd: "); 1459 switch (bp->bio_cmd) { 1460 case BIO_READ: db_printf("BIO_READ"); break; 1461 case BIO_WRITE: db_printf("BIO_WRITE"); break; 1462 case BIO_DELETE: db_printf("BIO_DELETE"); break; 1463 case BIO_GETATTR: db_printf("BIO_GETATTR"); break; 1464 case BIO_FLUSH: db_printf("BIO_FLUSH"); break; 1465 case BIO_CMD0: db_printf("BIO_CMD0"); break; 1466 case BIO_CMD1: db_printf("BIO_CMD1"); break; 1467 case BIO_CMD2: db_printf("BIO_CMD2"); break; 1468 default: db_printf("UNKNOWN"); break; 1469 } 1470 db_printf("\n"); 1471} 1472 1473static void 1474db_print_bio_flags(struct bio *bp) 1475{ 1476 int comma; 1477 1478 comma = 0; 1479 db_printf(" flags: "); 1480 if (bp->bio_flags & BIO_ERROR) { 1481 db_printf("BIO_ERROR"); 1482 comma = 1; 1483 } 1484 if (bp->bio_flags & BIO_DONE) { 1485 db_printf("%sBIO_DONE", (comma ? ", " : "")); 1486 comma = 1; 1487 } 1488 if (bp->bio_flags & BIO_ONQUEUE) 1489 db_printf("%sBIO_ONQUEUE", (comma ? ", " : "")); 1490 db_printf("\n"); 1491} 1492 1493/* 1494 * Print useful information in a BIO 1495 */ 1496DB_SHOW_COMMAND(bio, db_show_bio) 1497{ 1498 struct bio *bp; 1499 1500 if (have_addr) { 1501 bp = (struct bio *)addr; 1502 db_printf("BIO %p\n", bp); 1503 db_print_bio_cmd(bp); 1504 db_print_bio_flags(bp); 1505 db_printf(" cflags: 0x%hhx\n", bp->bio_cflags); 1506 db_printf(" pflags: 0x%hhx\n", bp->bio_pflags); 1507 db_printf(" offset: %jd\n", (intmax_t)bp->bio_offset); 1508 db_printf(" length: %jd\n", (intmax_t)bp->bio_length); 1509 db_printf(" bcount: %ld\n", bp->bio_bcount); 1510 db_printf(" resid: %ld\n", bp->bio_resid); 1511 db_printf(" completed: %jd\n", (intmax_t)bp->bio_completed); 1512 db_printf(" children: %u\n", bp->bio_children); 1513 db_printf(" inbed: %u\n", bp->bio_inbed); 1514 db_printf(" error: %d\n", bp->bio_error); 1515 db_printf(" parent: %p\n", bp->bio_parent); 1516 db_printf(" driver1: %p\n", bp->bio_driver1); 1517 db_printf(" driver2: %p\n", bp->bio_driver2); 1518 db_printf(" caller1: %p\n", bp->bio_caller1); 1519 db_printf(" caller2: %p\n", bp->bio_caller2); 1520 db_printf(" bio_from: %p\n", bp->bio_from); 1521 db_printf(" bio_to: %p\n", bp->bio_to); 1522 } 1523} 1524 1525#undef gprintf 1526#undef gprintln 1527#undef ADDFLAG 1528 1529#endif /* DDB */ 1530