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