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