Now available: The Design and Implementation of the FreeBSD Operating System (Second Edition)
[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]
FreeBSD/Linux Kernel Cross Reference
sys/geom/geom_subr.c
Version:
- FREEBSD - FREEBSD-13-STABLE - FREEBSD-13-0 - FREEBSD-12-STABLE - FREEBSD-12-0 - FREEBSD-11-STABLE - FREEBSD-11-0 - FREEBSD-10-STABLE - FREEBSD-10-0 - FREEBSD-9-STABLE - FREEBSD-9-0 - FREEBSD-8-STABLE - FREEBSD-8-0 - FREEBSD-7-STABLE - FREEBSD-7-0 - FREEBSD-6-STABLE - FREEBSD-6-0 - FREEBSD-5-STABLE - FREEBSD-5-0 - FREEBSD-4-STABLE - FREEBSD-3-STABLE - FREEBSD22 - l41 - OPENBSD - linux-2.6 - MK84 - PLAN9 - xnu-8792
SearchContext: - none - 3 - 10
SearchContext: - none - 3 - 10
1 /*- 2 * Copyright (c) 2002 Poul-Henning Kamp 3 * Copyright (c) 2002 Networks Associates Technology, Inc. 4 * All rights reserved. 5 * 6 * This software was developed for the FreeBSD Project by Poul-Henning Kamp 7 * and NAI Labs, the Security Research Division of Network Associates, Inc. 8 * under DARPA/SPAWAR contract N66001-01-C-8035 ("CBOSS"), as part of the 9 * DARPA CHATS research program. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in the 18 * documentation and/or other materials provided with the distribution. 19 * 3. The names of the authors may not be used to endorse or promote 20 * products derived from this software without specific prior written 21 * permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 */ 35 36 #include <sys/cdefs.h> 37 __FBSDID("$FreeBSD: releng/11.2/sys/geom/geom_subr.c 332095 2018-04-06 12:13:32Z avg $"); 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_INSERT_HEAD(&mp->geom, gp, geom); 351 TAILQ_INSERT_HEAD(&geoms, gp, geoms); 352 strcpy(gp->name, sbuf_data(sb)); 353 sbuf_delete(sb); 354 /* Fill in defaults from class */ 355 gp->start = mp->start; 356 gp->spoiled = mp->spoiled; 357 gp->attrchanged = mp->attrchanged; 358 gp->providergone = mp->providergone; 359 gp->dumpconf = mp->dumpconf; 360 gp->access = mp->access; 361 gp->orphan = mp->orphan; 362 gp->ioctl = mp->ioctl; 363 gp->resize = mp->resize; 364 return (gp); 365 } 366 367 void 368 g_destroy_geom(struct g_geom *gp) 369 { 370 371 g_topology_assert(); 372 G_VALID_GEOM(gp); 373 g_trace(G_T_TOPOLOGY, "g_destroy_geom(%p(%s))", gp, gp->name); 374 KASSERT(LIST_EMPTY(&gp->consumer), 375 ("g_destroy_geom(%s) with consumer(s) [%p]", 376 gp->name, LIST_FIRST(&gp->consumer))); 377 KASSERT(LIST_EMPTY(&gp->provider), 378 ("g_destroy_geom(%s) with provider(s) [%p]", 379 gp->name, LIST_FIRST(&gp->provider))); 380 g_cancel_event(gp); 381 LIST_REMOVE(gp, geom); 382 TAILQ_REMOVE(&geoms, gp, geoms); 383 g_free(gp->name); 384 g_free(gp); 385 } 386 387 /* 388 * This function is called (repeatedly) until the geom has withered away. 389 */ 390 void 391 g_wither_geom(struct g_geom *gp, int error) 392 { 393 struct g_provider *pp; 394 395 g_topology_assert(); 396 G_VALID_GEOM(gp); 397 g_trace(G_T_TOPOLOGY, "g_wither_geom(%p(%s))", gp, gp->name); 398 if (!(gp->flags & G_GEOM_WITHER)) { 399 gp->flags |= G_GEOM_WITHER; 400 LIST_FOREACH(pp, &gp->provider, provider) 401 if (!(pp->flags & G_PF_ORPHAN)) 402 g_orphan_provider(pp, error); 403 } 404 g_do_wither(); 405 } 406 407 /* 408 * Convenience function to destroy a particular provider. 409 */ 410 void 411 g_wither_provider(struct g_provider *pp, int error) 412 { 413 414 pp->flags |= G_PF_WITHER; 415 if (!(pp->flags & G_PF_ORPHAN)) 416 g_orphan_provider(pp, error); 417 } 418 419 /* 420 * This function is called (repeatedly) until the has withered away. 421 */ 422 void 423 g_wither_geom_close(struct g_geom *gp, int error) 424 { 425 struct g_consumer *cp; 426 427 g_topology_assert(); 428 G_VALID_GEOM(gp); 429 g_trace(G_T_TOPOLOGY, "g_wither_geom_close(%p(%s))", gp, gp->name); 430 LIST_FOREACH(cp, &gp->consumer, consumer) 431 if (cp->acr || cp->acw || cp->ace) 432 g_access(cp, -cp->acr, -cp->acw, -cp->ace); 433 g_wither_geom(gp, error); 434 } 435 436 /* 437 * This function is called (repeatedly) until we cant wash away more 438 * withered bits at present. 439 */ 440 void 441 g_wither_washer() 442 { 443 struct g_class *mp; 444 struct g_geom *gp, *gp2; 445 struct g_provider *pp, *pp2; 446 struct g_consumer *cp, *cp2; 447 448 g_topology_assert(); 449 LIST_FOREACH(mp, &g_classes, class) { 450 LIST_FOREACH_SAFE(gp, &mp->geom, geom, gp2) { 451 LIST_FOREACH_SAFE(pp, &gp->provider, provider, pp2) { 452 if (!(pp->flags & G_PF_WITHER)) 453 continue; 454 if (LIST_EMPTY(&pp->consumers)) 455 g_destroy_provider(pp); 456 } 457 if (!(gp->flags & G_GEOM_WITHER)) 458 continue; 459 LIST_FOREACH_SAFE(pp, &gp->provider, provider, pp2) { 460 if (LIST_EMPTY(&pp->consumers)) 461 g_destroy_provider(pp); 462 } 463 LIST_FOREACH_SAFE(cp, &gp->consumer, consumer, cp2) { 464 if (cp->acr || cp->acw || cp->ace) 465 continue; 466 if (cp->provider != NULL) 467 g_detach(cp); 468 g_destroy_consumer(cp); 469 } 470 if (LIST_EMPTY(&gp->provider) && 471 LIST_EMPTY(&gp->consumer)) 472 g_destroy_geom(gp); 473 } 474 } 475 } 476 477 struct g_consumer * 478 g_new_consumer(struct g_geom *gp) 479 { 480 struct g_consumer *cp; 481 482 g_topology_assert(); 483 G_VALID_GEOM(gp); 484 KASSERT(!(gp->flags & G_GEOM_WITHER), 485 ("g_new_consumer on WITHERing geom(%s) (class %s)", 486 gp->name, gp->class->name)); 487 KASSERT(gp->orphan != NULL, 488 ("g_new_consumer on geom(%s) (class %s) without orphan", 489 gp->name, gp->class->name)); 490 491 cp = g_malloc(sizeof *cp, M_WAITOK | M_ZERO); 492 cp->geom = gp; 493 cp->stat = devstat_new_entry(cp, -1, 0, DEVSTAT_ALL_SUPPORTED, 494 DEVSTAT_TYPE_DIRECT, DEVSTAT_PRIORITY_MAX); 495 LIST_INSERT_HEAD(&gp->consumer, cp, consumer); 496 return(cp); 497 } 498 499 void 500 g_destroy_consumer(struct g_consumer *cp) 501 { 502 struct g_geom *gp; 503 504 g_topology_assert(); 505 G_VALID_CONSUMER(cp); 506 g_trace(G_T_TOPOLOGY, "g_destroy_consumer(%p)", cp); 507 KASSERT (cp->provider == NULL, ("g_destroy_consumer but attached")); 508 KASSERT (cp->acr == 0, ("g_destroy_consumer with acr")); 509 KASSERT (cp->acw == 0, ("g_destroy_consumer with acw")); 510 KASSERT (cp->ace == 0, ("g_destroy_consumer with ace")); 511 g_cancel_event(cp); 512 gp = cp->geom; 513 LIST_REMOVE(cp, consumer); 514 devstat_remove_entry(cp->stat); 515 g_free(cp); 516 if (gp->flags & G_GEOM_WITHER) 517 g_do_wither(); 518 } 519 520 static void 521 g_new_provider_event(void *arg, int flag) 522 { 523 struct g_class *mp; 524 struct g_provider *pp; 525 struct g_consumer *cp, *next_cp; 526 527 g_topology_assert(); 528 if (flag == EV_CANCEL) 529 return; 530 if (g_shutdown) 531 return; 532 pp = arg; 533 G_VALID_PROVIDER(pp); 534 KASSERT(!(pp->flags & G_PF_WITHER), 535 ("g_new_provider_event but withered")); 536 LIST_FOREACH_SAFE(cp, &pp->consumers, consumers, next_cp) { 537 if ((cp->flags & G_CF_ORPHAN) == 0 && 538 cp->geom->attrchanged != NULL) 539 cp->geom->attrchanged(cp, "GEOM::media"); 540 } 541 if (g_notaste) 542 return; 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 558 struct g_provider * 559 g_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 595 void 596 g_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 603 static void 604 g_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 KASSERT(!(pp->flags & G_PF_WITHER), 624 ("g_resize_provider_event but withered")); 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->flags & G_GEOM_WITHER) == 0 && gp->resize != NULL) 640 gp->resize(cp); 641 } 642 643 /* 644 * After resizing, the previously invalid GEOM class metadata 645 * might become valid. This means we should retaste. 646 */ 647 LIST_FOREACH(mp, &g_classes, class) { 648 if (mp->taste == NULL) 649 continue; 650 LIST_FOREACH(cp, &pp->consumers, consumers) 651 if (cp->geom->class == mp && 652 (cp->flags & G_CF_ORPHAN) == 0) 653 break; 654 if (cp != NULL) 655 continue; 656 mp->taste(mp, pp, 0); 657 g_topology_assert(); 658 } 659 } 660 661 void 662 g_resize_provider(struct g_provider *pp, off_t size) 663 { 664 struct g_hh00 *hh; 665 666 G_VALID_PROVIDER(pp); 667 if (pp->flags & G_PF_WITHER) 668 return; 669 670 if (size == pp->mediasize) 671 return; 672 673 hh = g_malloc(sizeof *hh, M_WAITOK | M_ZERO); 674 hh->pp = pp; 675 hh->size = size; 676 g_post_event(g_resize_provider_event, hh, M_WAITOK, NULL); 677 } 678 679 #ifndef _PATH_DEV 680 #define _PATH_DEV "/dev/" 681 #endif 682 683 struct g_provider * 684 g_provider_by_name(char const *arg) 685 { 686 struct g_class *cp; 687 struct g_geom *gp; 688 struct g_provider *pp, *wpp; 689 690 if (strncmp(arg, _PATH_DEV, sizeof(_PATH_DEV) - 1) == 0) 691 arg += sizeof(_PATH_DEV) - 1; 692 693 wpp = NULL; 694 LIST_FOREACH(cp, &g_classes, class) { 695 LIST_FOREACH(gp, &cp->geom, geom) { 696 LIST_FOREACH(pp, &gp->provider, provider) { 697 if (strcmp(arg, pp->name) != 0) 698 continue; 699 if ((gp->flags & G_GEOM_WITHER) == 0 && 700 (pp->flags & G_PF_WITHER) == 0) 701 return (pp); 702 else 703 wpp = pp; 704 } 705 } 706 } 707 708 return (wpp); 709 } 710 711 void 712 g_destroy_provider(struct g_provider *pp) 713 { 714 struct g_geom *gp; 715 716 g_topology_assert(); 717 G_VALID_PROVIDER(pp); 718 KASSERT(LIST_EMPTY(&pp->consumers), 719 ("g_destroy_provider but attached")); 720 KASSERT (pp->acr == 0, ("g_destroy_provider with acr")); 721 KASSERT (pp->acw == 0, ("g_destroy_provider with acw")); 722 KASSERT (pp->ace == 0, ("g_destroy_provider with ace")); 723 g_cancel_event(pp); 724 LIST_REMOVE(pp, provider); 725 gp = pp->geom; 726 devstat_remove_entry(pp->stat); 727 /* 728 * If a callback was provided, send notification that the provider 729 * is now gone. 730 */ 731 if (gp->providergone != NULL) 732 gp->providergone(pp); 733 734 g_free(pp); 735 if ((gp->flags & G_GEOM_WITHER)) 736 g_do_wither(); 737 } 738 739 /* 740 * We keep the "geoms" list sorted by topological order (== increasing 741 * numerical rank) at all times. 742 * When an attach is done, the attaching geoms rank is invalidated 743 * and it is moved to the tail of the list. 744 * All geoms later in the sequence has their ranks reevaluated in 745 * sequence. If we cannot assign rank to a geom because it's 746 * prerequisites do not have rank, we move that element to the tail 747 * of the sequence with invalid rank as well. 748 * At some point we encounter our original geom and if we stil fail 749 * to assign it a rank, there must be a loop and we fail back to 750 * g_attach() which detach again and calls redo_rank again 751 * to fix up the damage. 752 * It would be much simpler code wise to do it recursively, but we 753 * can't risk that on the kernel stack. 754 */ 755 756 static int 757 redo_rank(struct g_geom *gp) 758 { 759 struct g_consumer *cp; 760 struct g_geom *gp1, *gp2; 761 int n, m; 762 763 g_topology_assert(); 764 G_VALID_GEOM(gp); 765 766 /* Invalidate this geoms rank and move it to the tail */ 767 gp1 = TAILQ_NEXT(gp, geoms); 768 if (gp1 != NULL) { 769 gp->rank = 0; 770 TAILQ_REMOVE(&geoms, gp, geoms); 771 TAILQ_INSERT_TAIL(&geoms, gp, geoms); 772 } else { 773 gp1 = gp; 774 } 775 776 /* re-rank the rest of the sequence */ 777 for (; gp1 != NULL; gp1 = gp2) { 778 gp1->rank = 0; 779 m = 1; 780 LIST_FOREACH(cp, &gp1->consumer, consumer) { 781 if (cp->provider == NULL) 782 continue; 783 n = cp->provider->geom->rank; 784 if (n == 0) { 785 m = 0; 786 break; 787 } else if (n >= m) 788 m = n + 1; 789 } 790 gp1->rank = m; 791 gp2 = TAILQ_NEXT(gp1, geoms); 792 793 /* got a rank, moving on */ 794 if (m != 0) 795 continue; 796 797 /* no rank to original geom means loop */ 798 if (gp == gp1) 799 return (ELOOP); 800 801 /* no rank, put it at the end move on */ 802 TAILQ_REMOVE(&geoms, gp1, geoms); 803 TAILQ_INSERT_TAIL(&geoms, gp1, geoms); 804 } 805 return (0); 806 } 807 808 int 809 g_attach(struct g_consumer *cp, struct g_provider *pp) 810 { 811 int error; 812 813 g_topology_assert(); 814 G_VALID_CONSUMER(cp); 815 G_VALID_PROVIDER(pp); 816 g_trace(G_T_TOPOLOGY, "g_attach(%p, %p)", cp, pp); 817 KASSERT(cp->provider == NULL, ("attach but attached")); 818 cp->provider = pp; 819 cp->flags &= ~G_CF_ORPHAN; 820 LIST_INSERT_HEAD(&pp->consumers, cp, consumers); 821 error = redo_rank(cp->geom); 822 if (error) { 823 LIST_REMOVE(cp, consumers); 824 cp->provider = NULL; 825 redo_rank(cp->geom); 826 } 827 return (error); 828 } 829 830 void 831 g_detach(struct g_consumer *cp) 832 { 833 struct g_provider *pp; 834 835 g_topology_assert(); 836 G_VALID_CONSUMER(cp); 837 g_trace(G_T_TOPOLOGY, "g_detach(%p)", cp); 838 KASSERT(cp->provider != NULL, ("detach but not attached")); 839 KASSERT(cp->acr == 0, ("detach but nonzero acr")); 840 KASSERT(cp->acw == 0, ("detach but nonzero acw")); 841 KASSERT(cp->ace == 0, ("detach but nonzero ace")); 842 KASSERT(cp->nstart == cp->nend, 843 ("detach with active requests")); 844 pp = cp->provider; 845 LIST_REMOVE(cp, consumers); 846 cp->provider = NULL; 847 if ((cp->geom->flags & G_GEOM_WITHER) || 848 (pp->geom->flags & G_GEOM_WITHER) || 849 (pp->flags & G_PF_WITHER)) 850 g_do_wither(); 851 redo_rank(cp->geom); 852 } 853 854 /* 855 * g_access() 856 * 857 * Access-check with delta values. The question asked is "can provider 858 * "cp" change the access counters by the relative amounts dc[rwe] ?" 859 */ 860 861 int 862 g_access(struct g_consumer *cp, int dcr, int dcw, int dce) 863 { 864 struct g_provider *pp; 865 struct g_geom *gp; 866 int pw, pe; 867 #ifdef INVARIANTS 868 int sr, sw, se; 869 #endif 870 int error; 871 872 g_topology_assert(); 873 G_VALID_CONSUMER(cp); 874 pp = cp->provider; 875 KASSERT(pp != NULL, ("access but not attached")); 876 G_VALID_PROVIDER(pp); 877 gp = pp->geom; 878 879 g_trace(G_T_ACCESS, "g_access(%p(%s), %d, %d, %d)", 880 cp, pp->name, dcr, dcw, dce); 881 882 KASSERT(cp->acr + dcr >= 0, ("access resulting in negative acr")); 883 KASSERT(cp->acw + dcw >= 0, ("access resulting in negative acw")); 884 KASSERT(cp->ace + dce >= 0, ("access resulting in negative ace")); 885 KASSERT(dcr != 0 || dcw != 0 || dce != 0, ("NOP access request")); 886 KASSERT(gp->access != NULL, ("NULL geom->access")); 887 888 /* 889 * If our class cares about being spoiled, and we have been, we 890 * are probably just ahead of the event telling us that. Fail 891 * now rather than having to unravel this later. 892 */ 893 if (cp->geom->spoiled != NULL && (cp->flags & G_CF_SPOILED) && 894 (dcr > 0 || dcw > 0 || dce > 0)) 895 return (ENXIO); 896 897 /* 898 * A number of GEOM classes either need to perform an I/O on the first 899 * open or to acquire a different subsystem's lock. To do that they 900 * may have to drop the topology lock. 901 * Other GEOM classes perform special actions when opening a lower rank 902 * geom for the first time. As a result, more than one thread may 903 * end up performing the special actions. 904 * So, we prevent concurrent "first" opens by marking the consumer with 905 * special flag. 906 * 907 * Note that if the geom's access method never drops the topology lock, 908 * then we will never see G_GEOM_IN_ACCESS here. 909 */ 910 while ((gp->flags & G_GEOM_IN_ACCESS) != 0) { 911 g_trace(G_T_ACCESS, 912 "%s: race on geom %s via provider %s and consumer of %s", 913 __func__, gp->name, pp->name, cp->geom->name); 914 gp->flags |= G_GEOM_ACCESS_WAIT; 915 g_topology_sleep(gp, 0); 916 } 917 918 /* 919 * Figure out what counts the provider would have had, if this 920 * consumer had (r0w0e0) at this time. 921 */ 922 pw = pp->acw - cp->acw; 923 pe = pp->ace - cp->ace; 924 925 g_trace(G_T_ACCESS, 926 "open delta:[r%dw%de%d] old:[r%dw%de%d] provider:[r%dw%de%d] %p(%s)", 927 dcr, dcw, dce, 928 cp->acr, cp->acw, cp->ace, 929 pp->acr, pp->acw, pp->ace, 930 pp, pp->name); 931 932 /* If foot-shooting is enabled, any open on rank#1 is OK */ 933 if ((g_debugflags & 16) && gp->rank == 1) 934 ; 935 /* If we try exclusive but already write: fail */ 936 else if (dce > 0 && pw > 0) 937 return (EPERM); 938 /* If we try write but already exclusive: fail */ 939 else if (dcw > 0 && pe > 0) 940 return (EPERM); 941 /* If we try to open more but provider is error'ed: fail */ 942 else if ((dcr > 0 || dcw > 0 || dce > 0) && pp->error != 0) { 943 printf("%s(%d): provider %s has error %d set\n", 944 __func__, __LINE__, pp->name, pp->error); 945 return (pp->error); 946 } 947 948 /* Ok then... */ 949 950 #ifdef INVARIANTS 951 sr = cp->acr; 952 sw = cp->acw; 953 se = cp->ace; 954 #endif 955 gp->flags |= G_GEOM_IN_ACCESS; 956 error = gp->access(pp, dcr, dcw, dce); 957 KASSERT(dcr > 0 || dcw > 0 || dce > 0 || error == 0, 958 ("Geom provider %s::%s dcr=%d dcw=%d dce=%d error=%d failed " 959 "closing ->access()", gp->class->name, pp->name, dcr, dcw, 960 dce, error)); 961 962 g_topology_assert(); 963 gp->flags &= ~G_GEOM_IN_ACCESS; 964 KASSERT(cp->acr == sr && cp->acw == sw && cp->ace == se, 965 ("Access counts changed during geom->access")); 966 if ((gp->flags & G_GEOM_ACCESS_WAIT) != 0) { 967 gp->flags &= ~G_GEOM_ACCESS_WAIT; 968 wakeup(gp); 969 } 970 971 if (!error) { 972 /* 973 * If we open first write, spoil any partner consumers. 974 * If we close last write and provider is not errored, 975 * trigger re-taste. 976 */ 977 if (pp->acw == 0 && dcw != 0) 978 g_spoil(pp, cp); 979 else if (pp->acw != 0 && pp->acw == -dcw && pp->error == 0 && 980 !(gp->flags & G_GEOM_WITHER)) 981 g_post_event(g_new_provider_event, pp, M_WAITOK, 982 pp, NULL); 983 984 pp->acr += dcr; 985 pp->acw += dcw; 986 pp->ace += dce; 987 cp->acr += dcr; 988 cp->acw += dcw; 989 cp->ace += dce; 990 if (pp->acr != 0 || pp->acw != 0 || pp->ace != 0) 991 KASSERT(pp->sectorsize > 0, 992 ("Provider %s lacks sectorsize", pp->name)); 993 if ((cp->geom->flags & G_GEOM_WITHER) && 994 cp->acr == 0 && cp->acw == 0 && cp->ace == 0) 995 g_do_wither(); 996 } 997 return (error); 998 } 999 1000 int 1001 g_handleattr_int(struct bio *bp, const char *attribute, int val) 1002 { 1003 1004 return (g_handleattr(bp, attribute, &val, sizeof val)); 1005 } 1006 1007 int 1008 g_handleattr_uint16_t(struct bio *bp, const char *attribute, uint16_t val) 1009 { 1010 1011 return (g_handleattr(bp, attribute, &val, sizeof val)); 1012 } 1013 1014 int 1015 g_handleattr_off_t(struct bio *bp, const char *attribute, off_t val) 1016 { 1017 1018 return (g_handleattr(bp, attribute, &val, sizeof val)); 1019 } 1020 1021 int 1022 g_handleattr_str(struct bio *bp, const char *attribute, const char *str) 1023 { 1024 1025 return (g_handleattr(bp, attribute, str, 0)); 1026 } 1027 1028 int 1029 g_handleattr(struct bio *bp, const char *attribute, const void *val, int len) 1030 { 1031 int error = 0; 1032 1033 if (strcmp(bp->bio_attribute, attribute)) 1034 return (0); 1035 if (len == 0) { 1036 bzero(bp->bio_data, bp->bio_length); 1037 if (strlcpy(bp->bio_data, val, bp->bio_length) >= 1038 bp->bio_length) { 1039 printf("%s: %s bio_length %jd len %zu -> EFAULT\n", 1040 __func__, bp->bio_to->name, 1041 (intmax_t)bp->bio_length, strlen(val)); 1042 error = EFAULT; 1043 } 1044 } else if (bp->bio_length == len) { 1045 bcopy(val, bp->bio_data, len); 1046 } else { 1047 printf("%s: %s bio_length %jd len %d -> EFAULT\n", __func__, 1048 bp->bio_to->name, (intmax_t)bp->bio_length, len); 1049 error = EFAULT; 1050 } 1051 if (error == 0) 1052 bp->bio_completed = bp->bio_length; 1053 g_io_deliver(bp, error); 1054 return (1); 1055 } 1056 1057 int 1058 g_std_access(struct g_provider *pp, 1059 int dr __unused, int dw __unused, int de __unused) 1060 { 1061 1062 g_topology_assert(); 1063 G_VALID_PROVIDER(pp); 1064 return (0); 1065 } 1066 1067 void 1068 g_std_done(struct bio *bp) 1069 { 1070 struct bio *bp2; 1071 1072 bp2 = bp->bio_parent; 1073 if (bp2->bio_error == 0) 1074 bp2->bio_error = bp->bio_error; 1075 bp2->bio_completed += bp->bio_completed; 1076 g_destroy_bio(bp); 1077 bp2->bio_inbed++; 1078 if (bp2->bio_children == bp2->bio_inbed) 1079 g_io_deliver(bp2, bp2->bio_error); 1080 } 1081 1082 /* XXX: maybe this is only g_slice_spoiled */ 1083 1084 void 1085 g_std_spoiled(struct g_consumer *cp) 1086 { 1087 struct g_geom *gp; 1088 struct g_provider *pp; 1089 1090 g_topology_assert(); 1091 G_VALID_CONSUMER(cp); 1092 g_trace(G_T_TOPOLOGY, "g_std_spoiled(%p)", cp); 1093 cp->flags |= G_CF_ORPHAN; 1094 g_detach(cp); 1095 gp = cp->geom; 1096 LIST_FOREACH(pp, &gp->provider, provider) 1097 g_orphan_provider(pp, ENXIO); 1098 g_destroy_consumer(cp); 1099 if (LIST_EMPTY(&gp->provider) && LIST_EMPTY(&gp->consumer)) 1100 g_destroy_geom(gp); 1101 else 1102 gp->flags |= G_GEOM_WITHER; 1103 } 1104 1105 /* 1106 * Spoiling happens when a provider is opened for writing, but consumers 1107 * which are configured by in-band data are attached (slicers for instance). 1108 * Since the write might potentially change the in-band data, such consumers 1109 * need to re-evaluate their existence after the writing session closes. 1110 * We do this by (offering to) tear them down when the open for write happens 1111 * in return for a re-taste when it closes again. 1112 * Together with the fact that such consumers grab an 'e' bit whenever they 1113 * are open, regardless of mode, this ends up DTRT. 1114 */ 1115 1116 static void 1117 g_spoil_event(void *arg, int flag) 1118 { 1119 struct g_provider *pp; 1120 struct g_consumer *cp, *cp2; 1121 1122 g_topology_assert(); 1123 if (flag == EV_CANCEL) 1124 return; 1125 pp = arg; 1126 G_VALID_PROVIDER(pp); 1127 g_trace(G_T_TOPOLOGY, "%s %p(%s:%s:%s)", __func__, pp, 1128 pp->geom->class->name, pp->geom->name, pp->name); 1129 for (cp = LIST_FIRST(&pp->consumers); cp != NULL; cp = cp2) { 1130 cp2 = LIST_NEXT(cp, consumers); 1131 if ((cp->flags & G_CF_SPOILED) == 0) 1132 continue; 1133 cp->flags &= ~G_CF_SPOILED; 1134 if (cp->geom->spoiled == NULL) 1135 continue; 1136 cp->geom->spoiled(cp); 1137 g_topology_assert(); 1138 } 1139 } 1140 1141 void 1142 g_spoil(struct g_provider *pp, struct g_consumer *cp) 1143 { 1144 struct g_consumer *cp2; 1145 1146 g_topology_assert(); 1147 G_VALID_PROVIDER(pp); 1148 G_VALID_CONSUMER(cp); 1149 1150 LIST_FOREACH(cp2, &pp->consumers, consumers) { 1151 if (cp2 == cp) 1152 continue; 1153 /* 1154 KASSERT(cp2->acr == 0, ("spoiling cp->acr = %d", cp2->acr)); 1155 KASSERT(cp2->acw == 0, ("spoiling cp->acw = %d", cp2->acw)); 1156 */ 1157 KASSERT(cp2->ace == 0, ("spoiling cp->ace = %d", cp2->ace)); 1158 cp2->flags |= G_CF_SPOILED; 1159 } 1160 g_post_event(g_spoil_event, pp, M_WAITOK, pp, NULL); 1161 } 1162 1163 static void 1164 g_media_changed_event(void *arg, int flag) 1165 { 1166 struct g_provider *pp; 1167 int retaste; 1168 1169 g_topology_assert(); 1170 if (flag == EV_CANCEL) 1171 return; 1172 pp = arg; 1173 G_VALID_PROVIDER(pp); 1174 1175 /* 1176 * If provider was not open for writing, queue retaste after spoiling. 1177 * If it was, retaste will happen automatically on close. 1178 */ 1179 retaste = (pp->acw == 0 && pp->error == 0 && 1180 !(pp->geom->flags & G_GEOM_WITHER)); 1181 g_spoil_event(arg, flag); 1182 if (retaste) 1183 g_post_event(g_new_provider_event, pp, M_WAITOK, pp, NULL); 1184 } 1185 1186 int 1187 g_media_changed(struct g_provider *pp, int flag) 1188 { 1189 struct g_consumer *cp; 1190 1191 LIST_FOREACH(cp, &pp->consumers, consumers) 1192 cp->flags |= G_CF_SPOILED; 1193 return (g_post_event(g_media_changed_event, pp, flag, pp, NULL)); 1194 } 1195 1196 int 1197 g_media_gone(struct g_provider *pp, int flag) 1198 { 1199 struct g_consumer *cp; 1200 1201 LIST_FOREACH(cp, &pp->consumers, consumers) 1202 cp->flags |= G_CF_SPOILED; 1203 return (g_post_event(g_spoil_event, pp, flag, pp, NULL)); 1204 } 1205 1206 int 1207 g_getattr__(const char *attr, struct g_consumer *cp, void *var, int len) 1208 { 1209 int error, i; 1210 1211 i = len; 1212 error = g_io_getattr(attr, cp, &i, var); 1213 if (error) 1214 return (error); 1215 if (i != len) 1216 return (EINVAL); 1217 return (0); 1218 } 1219 1220 static int 1221 g_get_device_prefix_len(const char *name) 1222 { 1223 int len; 1224 1225 if (strncmp(name, "ada", 3) == 0) 1226 len = 3; 1227 else if (strncmp(name, "ad", 2) == 0) 1228 len = 2; 1229 else 1230 return (0); 1231 if (name[len] < '' || name[len] > '9') 1232 return (0); 1233 do { 1234 len++; 1235 } while (name[len] >= '' && name[len] <= '9'); 1236 return (len); 1237 } 1238 1239 int 1240 g_compare_names(const char *namea, const char *nameb) 1241 { 1242 int deva, devb; 1243 1244 if (strcmp(namea, nameb) == 0) 1245 return (1); 1246 deva = g_get_device_prefix_len(namea); 1247 if (deva == 0) 1248 return (0); 1249 devb = g_get_device_prefix_len(nameb); 1250 if (devb == 0) 1251 return (0); 1252 if (strcmp(namea + deva, nameb + devb) == 0) 1253 return (1); 1254 return (0); 1255 } 1256 1257 #if defined(DIAGNOSTIC) || defined(DDB) 1258 /* 1259 * This function walks the mesh and returns a non-zero integer if it 1260 * finds the argument pointer is an object. The return value indicates 1261 * which type of object it is believed to be. If topology is not locked, 1262 * this function is potentially dangerous, but we don't assert that the 1263 * topology lock is held when called from debugger. 1264 */ 1265 int 1266 g_valid_obj(void const *ptr) 1267 { 1268 struct g_class *mp; 1269 struct g_geom *gp; 1270 struct g_consumer *cp; 1271 struct g_provider *pp; 1272 1273 #ifdef KDB 1274 if (kdb_active == 0) 1275 #endif 1276 g_topology_assert(); 1277 1278 LIST_FOREACH(mp, &g_classes, class) { 1279 if (ptr == mp) 1280 return (1); 1281 LIST_FOREACH(gp, &mp->geom, geom) { 1282 if (ptr == gp) 1283 return (2); 1284 LIST_FOREACH(cp, &gp->consumer, consumer) 1285 if (ptr == cp) 1286 return (3); 1287 LIST_FOREACH(pp, &gp->provider, provider) 1288 if (ptr == pp) 1289 return (4); 1290 } 1291 } 1292 return(0); 1293 } 1294 #endif 1295 1296 #ifdef DDB 1297 1298 #define gprintf(...) do { \ 1299 db_printf("%*s", indent, ""); \ 1300 db_printf(__VA_ARGS__); \ 1301 } while (0) 1302 #define gprintln(...) do { \ 1303 gprintf(__VA_ARGS__); \ 1304 db_printf("\n"); \ 1305 } while (0) 1306 1307 #define ADDFLAG(obj, flag, sflag) do { \ 1308 if ((obj)->flags & (flag)) { \ 1309 if (comma) \ 1310 strlcat(str, ",", size); \ 1311 strlcat(str, (sflag), size); \ 1312 comma = 1; \ 1313 } \ 1314 } while (0) 1315 1316 static char * 1317 provider_flags_to_string(struct g_provider *pp, char *str, size_t size) 1318 { 1319 int comma = 0; 1320 1321 bzero(str, size); 1322 if (pp->flags == 0) { 1323 strlcpy(str, "NONE", size); 1324 return (str); 1325 } 1326 ADDFLAG(pp, G_PF_WITHER, "G_PF_WITHER"); 1327 ADDFLAG(pp, G_PF_ORPHAN, "G_PF_ORPHAN"); 1328 return (str); 1329 } 1330 1331 static char * 1332 geom_flags_to_string(struct g_geom *gp, char *str, size_t size) 1333 { 1334 int comma = 0; 1335 1336 bzero(str, size); 1337 if (gp->flags == 0) { 1338 strlcpy(str, "NONE", size); 1339 return (str); 1340 } 1341 ADDFLAG(gp, G_GEOM_WITHER, "G_GEOM_WITHER"); 1342 return (str); 1343 } 1344 static void 1345 db_show_geom_consumer(int indent, struct g_consumer *cp) 1346 { 1347 1348 if (indent == 0) { 1349 gprintln("consumer: %p", cp); 1350 gprintln(" class: %s (%p)", cp->geom->class->name, 1351 cp->geom->class); 1352 gprintln(" geom: %s (%p)", cp->geom->name, cp->geom); 1353 if (cp->provider == NULL) 1354 gprintln(" provider: none"); 1355 else { 1356 gprintln(" provider: %s (%p)", cp->provider->name, 1357 cp->provider); 1358 } 1359 gprintln(" access: r%dw%de%d", cp->acr, cp->acw, cp->ace); 1360 gprintln(" flags: 0x%04x", cp->flags); 1361 gprintln(" nstart: %u", cp->nstart); 1362 gprintln(" nend: %u", cp->nend); 1363 } else { 1364 gprintf("consumer: %p (%s), access=r%dw%de%d", cp, 1365 cp->provider != NULL ? cp->provider->name : "none", 1366 cp->acr, cp->acw, cp->ace); 1367 if (cp->flags) 1368 db_printf(", flags=0x%04x", cp->flags); 1369 db_printf("\n"); 1370 } 1371 } 1372 1373 static void 1374 db_show_geom_provider(int indent, struct g_provider *pp) 1375 { 1376 struct g_consumer *cp; 1377 char flags[64]; 1378 1379 if (indent == 0) { 1380 gprintln("provider: %s (%p)", pp->name, pp); 1381 gprintln(" class: %s (%p)", pp->geom->class->name, 1382 pp->geom->class); 1383 gprintln(" geom: %s (%p)", pp->geom->name, pp->geom); 1384 gprintln(" mediasize: %jd", (intmax_t)pp->mediasize); 1385 gprintln(" sectorsize: %u", pp->sectorsize); 1386 gprintln(" stripesize: %u", pp->stripesize); 1387 gprintln(" stripeoffset: %u", pp->stripeoffset); 1388 gprintln(" access: r%dw%de%d", pp->acr, pp->acw, 1389 pp->ace); 1390 gprintln(" flags: %s (0x%04x)", 1391 provider_flags_to_string(pp, flags, sizeof(flags)), 1392 pp->flags); 1393 gprintln(" error: %d", pp->error); 1394 gprintln(" nstart: %u", pp->nstart); 1395 gprintln(" nend: %u", pp->nend); 1396 if (LIST_EMPTY(&pp->consumers)) 1397 gprintln(" consumers: none"); 1398 } else { 1399 gprintf("provider: %s (%p), access=r%dw%de%d", 1400 pp->name, pp, pp->acr, pp->acw, pp->ace); 1401 if (pp->flags != 0) { 1402 db_printf(", flags=%s (0x%04x)", 1403 provider_flags_to_string(pp, flags, sizeof(flags)), 1404 pp->flags); 1405 } 1406 db_printf("\n"); 1407 } 1408 if (!LIST_EMPTY(&pp->consumers)) { 1409 LIST_FOREACH(cp, &pp->consumers, consumers) { 1410 db_show_geom_consumer(indent + 2, cp); 1411 if (db_pager_quit) 1412 break; 1413 } 1414 } 1415 } 1416 1417 static void 1418 db_show_geom_geom(int indent, struct g_geom *gp) 1419 { 1420 struct g_provider *pp; 1421 struct g_consumer *cp; 1422 char flags[64]; 1423 1424 if (indent == 0) { 1425 gprintln("geom: %s (%p)", gp->name, gp); 1426 gprintln(" class: %s (%p)", gp->class->name, gp->class); 1427 gprintln(" flags: %s (0x%04x)", 1428 geom_flags_to_string(gp, flags, sizeof(flags)), gp->flags); 1429 gprintln(" rank: %d", gp->rank); 1430 if (LIST_EMPTY(&gp->provider)) 1431 gprintln(" providers: none"); 1432 if (LIST_EMPTY(&gp->consumer)) 1433 gprintln(" consumers: none"); 1434 } else { 1435 gprintf("geom: %s (%p), rank=%d", gp->name, gp, gp->rank); 1436 if (gp->flags != 0) { 1437 db_printf(", flags=%s (0x%04x)", 1438 geom_flags_to_string(gp, flags, sizeof(flags)), 1439 gp->flags); 1440 } 1441 db_printf("\n"); 1442 } 1443 if (!LIST_EMPTY(&gp->provider)) { 1444 LIST_FOREACH(pp, &gp->provider, provider) { 1445 db_show_geom_provider(indent + 2, pp); 1446 if (db_pager_quit) 1447 break; 1448 } 1449 } 1450 if (!LIST_EMPTY(&gp->consumer)) { 1451 LIST_FOREACH(cp, &gp->consumer, consumer) { 1452 db_show_geom_consumer(indent + 2, cp); 1453 if (db_pager_quit) 1454 break; 1455 } 1456 } 1457 } 1458 1459 static void 1460 db_show_geom_class(struct g_class *mp) 1461 { 1462 struct g_geom *gp; 1463 1464 db_printf("class: %s (%p)\n", mp->name, mp); 1465 LIST_FOREACH(gp, &mp->geom, geom) { 1466 db_show_geom_geom(2, gp); 1467 if (db_pager_quit) 1468 break; 1469 } 1470 } 1471 1472 /* 1473 * Print the GEOM topology or the given object. 1474 */ 1475 DB_SHOW_COMMAND(geom, db_show_geom) 1476 { 1477 struct g_class *mp; 1478 1479 if (!have_addr) { 1480 /* No address given, print the entire topology. */ 1481 LIST_FOREACH(mp, &g_classes, class) { 1482 db_show_geom_class(mp); 1483 db_printf("\n"); 1484 if (db_pager_quit) 1485 break; 1486 } 1487 } else { 1488 switch (g_valid_obj((void *)addr)) { 1489 case 1: 1490 db_show_geom_class((struct g_class *)addr); 1491 break; 1492 case 2: 1493 db_show_geom_geom(0, (struct g_geom *)addr); 1494 break; 1495 case 3: 1496 db_show_geom_consumer(0, (struct g_consumer *)addr); 1497 break; 1498 case 4: 1499 db_show_geom_provider(0, (struct g_provider *)addr); 1500 break; 1501 default: 1502 db_printf("Not a GEOM object.\n"); 1503 break; 1504 } 1505 } 1506 } 1507 1508 static void 1509 db_print_bio_cmd(struct bio *bp) 1510 { 1511 db_printf(" cmd: "); 1512 switch (bp->bio_cmd) { 1513 case BIO_READ: db_printf("BIO_READ"); break; 1514 case BIO_WRITE: db_printf("BIO_WRITE"); break; 1515 case BIO_DELETE: db_printf("BIO_DELETE"); break; 1516 case BIO_GETATTR: db_printf("BIO_GETATTR"); break; 1517 case BIO_FLUSH: db_printf("BIO_FLUSH"); break; 1518 case BIO_CMD0: db_printf("BIO_CMD0"); break; 1519 case BIO_CMD1: db_printf("BIO_CMD1"); break; 1520 case BIO_CMD2: db_printf("BIO_CMD2"); break; 1521 case BIO_ZONE: db_printf("BIO_ZONE"); break; 1522 default: db_printf("UNKNOWN"); break; 1523 } 1524 db_printf("\n"); 1525 } 1526 1527 static void 1528 db_print_bio_flags(struct bio *bp) 1529 { 1530 int comma; 1531 1532 comma = 0; 1533 db_printf(" flags: "); 1534 if (bp->bio_flags & BIO_ERROR) { 1535 db_printf("BIO_ERROR"); 1536 comma = 1; 1537 } 1538 if (bp->bio_flags & BIO_DONE) { 1539 db_printf("%sBIO_DONE", (comma ? ", " : "")); 1540 comma = 1; 1541 } 1542 if (bp->bio_flags & BIO_ONQUEUE) 1543 db_printf("%sBIO_ONQUEUE", (comma ? ", " : "")); 1544 db_printf("\n"); 1545 } 1546 1547 /* 1548 * Print useful information in a BIO 1549 */ 1550 DB_SHOW_COMMAND(bio, db_show_bio) 1551 { 1552 struct bio *bp; 1553 1554 if (have_addr) { 1555 bp = (struct bio *)addr; 1556 db_printf("BIO %p\n", bp); 1557 db_print_bio_cmd(bp); 1558 db_print_bio_flags(bp); 1559 db_printf(" cflags: 0x%hx\n", bp->bio_cflags); 1560 db_printf(" pflags: 0x%hx\n", bp->bio_pflags); 1561 db_printf(" offset: %jd\n", (intmax_t)bp->bio_offset); 1562 db_printf(" length: %jd\n", (intmax_t)bp->bio_length); 1563 db_printf(" bcount: %ld\n", bp->bio_bcount); 1564 db_printf(" resid: %ld\n", bp->bio_resid); 1565 db_printf(" completed: %jd\n", (intmax_t)bp->bio_completed); 1566 db_printf(" children: %u\n", bp->bio_children); 1567 db_printf(" inbed: %u\n", bp->bio_inbed); 1568 db_printf(" error: %d\n", bp->bio_error); 1569 db_printf(" parent: %p\n", bp->bio_parent); 1570 db_printf(" driver1: %p\n", bp->bio_driver1); 1571 db_printf(" driver2: %p\n", bp->bio_driver2); 1572 db_printf(" caller1: %p\n", bp->bio_caller1); 1573 db_printf(" caller2: %p\n", bp->bio_caller2); 1574 db_printf(" bio_from: %p\n", bp->bio_from); 1575 db_printf(" bio_to: %p\n", bp->bio_to); 1576 } 1577 } 1578 1579 #undef gprintf 1580 #undef gprintln 1581 #undef ADDFLAG 1582 1583 #endif /* DDB */
Cache object: 8903edd0055369dc88760979d222819d
[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]