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 * $FreeBSD$ 36 */ 37 38 39 #include <sys/param.h> 40 #include <sys/stdint.h> 41 #ifndef _KERNEL 42 #include <stdio.h> 43 #include <unistd.h> 44 #include <stdlib.h> 45 #include <signal.h> 46 #include <string.h> 47 #include <err.h> 48 #else 49 #include <sys/systm.h> 50 #include <sys/kernel.h> 51 #include <sys/malloc.h> 52 #include <sys/bio.h> 53 #include <sys/sysctl.h> 54 #include <sys/proc.h> 55 #include <sys/kthread.h> 56 #include <sys/lock.h> 57 #include <sys/mutex.h> 58 #endif 59 #include <sys/errno.h> 60 #include <sys/sbuf.h> 61 #include <geom/geom.h> 62 #include <geom/geom_int.h> 63 #include <machine/stdarg.h> 64 65 struct class_list_head g_classes = LIST_HEAD_INITIALIZER(g_classes); 66 static struct g_tailq_head geoms = TAILQ_HEAD_INITIALIZER(geoms); 67 static int g_nproviders; 68 char *g_wait_event, *g_wait_up, *g_wait_down, *g_wait_sim; 69 70 static int g_ignition; 71 72 void 73 g_add_class(struct g_class *mp) 74 { 75 76 if (!g_ignition) { 77 g_ignition++; 78 g_init(); 79 } 80 mp->protect = 0x020016600; 81 g_topology_lock(); 82 g_trace(G_T_TOPOLOGY, "g_add_class(%s)", mp->name); 83 LIST_INIT(&mp->geom); 84 LIST_INSERT_HEAD(&g_classes, mp, class); 85 if (g_nproviders > 0) 86 g_post_event(EV_NEW_CLASS, mp, NULL, NULL, NULL); 87 g_topology_unlock(); 88 } 89 90 struct g_geom * 91 g_new_geomf(struct g_class *mp, char *fmt, ...) 92 { 93 struct g_geom *gp; 94 va_list ap; 95 struct sbuf *sb; 96 97 g_topology_assert(); 98 va_start(ap, fmt); 99 mtx_lock(&Giant); 100 sb = sbuf_new(NULL, NULL, 0, SBUF_AUTOEXTEND); 101 sbuf_vprintf(sb, fmt, ap); 102 sbuf_finish(sb); 103 mtx_unlock(&Giant); 104 gp = g_malloc(sizeof *gp, M_WAITOK | M_ZERO); 105 gp->protect = 0x020016601; 106 gp->name = g_malloc(sbuf_len(sb) + 1, M_WAITOK | M_ZERO); 107 gp->class = mp; 108 gp->rank = 1; 109 LIST_INIT(&gp->consumer); 110 LIST_INIT(&gp->provider); 111 LIST_INSERT_HEAD(&mp->geom, gp, geom); 112 TAILQ_INSERT_HEAD(&geoms, gp, geoms); 113 strcpy(gp->name, sbuf_data(sb)); 114 sbuf_delete(sb); 115 return (gp); 116 } 117 118 void 119 g_destroy_geom(struct g_geom *gp) 120 { 121 122 g_trace(G_T_TOPOLOGY, "g_destroy_geom(%p(%s))", gp, gp->name); 123 g_topology_assert(); 124 KASSERT(gp->event == NULL, ("g_destroy_geom() with event")); 125 KASSERT(LIST_EMPTY(&gp->consumer), 126 ("g_destroy_geom(%s) with consumer(s) [%p]", 127 gp->name, LIST_FIRST(&gp->consumer))); 128 KASSERT(LIST_EMPTY(&gp->provider), 129 ("g_destroy_geom(%s) with provider(s) [%p]", 130 gp->name, LIST_FIRST(&gp->consumer))); 131 LIST_REMOVE(gp, geom); 132 TAILQ_REMOVE(&geoms, gp, geoms); 133 g_free(gp->name); 134 g_free(gp); 135 } 136 137 struct g_consumer * 138 g_new_consumer(struct g_geom *gp) 139 { 140 struct g_consumer *cp; 141 142 g_topology_assert(); 143 KASSERT(gp->orphan != NULL, 144 ("g_new_consumer on geom(%s) (class %s) without orphan", 145 gp->name, gp->class->name)); 146 147 cp = g_malloc(sizeof *cp, M_WAITOK | M_ZERO); 148 cp->protect = 0x020016602; 149 cp->geom = gp; 150 LIST_INSERT_HEAD(&gp->consumer, cp, consumer); 151 return(cp); 152 } 153 154 void 155 g_destroy_consumer(struct g_consumer *cp) 156 { 157 158 g_trace(G_T_TOPOLOGY, "g_destroy_consumer(%p)", cp); 159 g_topology_assert(); 160 KASSERT(cp->event == NULL, ("g_destroy_consumer() with event")); 161 KASSERT (cp->provider == NULL, ("g_destroy_consumer but attached")); 162 KASSERT (cp->acr == 0, ("g_destroy_consumer with acr")); 163 KASSERT (cp->acw == 0, ("g_destroy_consumer with acw")); 164 KASSERT (cp->ace == 0, ("g_destroy_consumer with ace")); 165 LIST_REMOVE(cp, consumer); 166 g_free(cp); 167 } 168 169 struct g_provider * 170 g_new_providerf(struct g_geom *gp, char *fmt, ...) 171 { 172 struct g_provider *pp; 173 struct sbuf *sb; 174 va_list ap; 175 176 g_topology_assert(); 177 va_start(ap, fmt); 178 mtx_lock(&Giant); 179 sb = sbuf_new(NULL, NULL, 0, SBUF_AUTOEXTEND); 180 sbuf_vprintf(sb, fmt, ap); 181 sbuf_finish(sb); 182 mtx_unlock(&Giant); 183 pp = g_malloc(sizeof *pp + sbuf_len(sb) + 1, M_WAITOK | M_ZERO); 184 pp->protect = 0x020016603; 185 pp->name = (char *)(pp + 1); 186 strcpy(pp->name, sbuf_data(sb)); 187 sbuf_delete(sb); 188 LIST_INIT(&pp->consumers); 189 pp->error = ENXIO; 190 pp->geom = gp; 191 LIST_INSERT_HEAD(&gp->provider, pp, provider); 192 g_nproviders++; 193 if (strcmp(pp->name, "geom.ctl")) 194 g_post_event(EV_NEW_PROVIDER, NULL, NULL, pp, NULL); 195 return (pp); 196 } 197 198 void 199 g_error_provider(struct g_provider *pp, int error) 200 { 201 202 pp->error = error; 203 } 204 205 206 void 207 g_destroy_provider(struct g_provider *pp) 208 { 209 struct g_geom *gp; 210 struct g_consumer *cp; 211 212 g_topology_assert(); 213 KASSERT(pp->event == NULL, ("g_destroy_provider() with event")); 214 KASSERT(LIST_EMPTY(&pp->consumers), 215 ("g_destroy_provider but attached")); 216 KASSERT (pp->acr == 0, ("g_destroy_provider with acr")); 217 KASSERT (pp->acw == 0, ("g_destroy_provider with acw")); 218 KASSERT (pp->acw == 0, ("g_destroy_provider with ace")); 219 g_nproviders--; 220 LIST_REMOVE(pp, provider); 221 gp = pp->geom; 222 g_free(pp); 223 if (!(gp->flags & G_GEOM_WITHER)) 224 return; 225 if (!LIST_EMPTY(&gp->provider)) 226 return; 227 for (;;) { 228 cp = LIST_FIRST(&gp->consumer); 229 if (cp == NULL) 230 break; 231 g_detach(cp); 232 g_destroy_consumer(cp); 233 } 234 g_destroy_geom(gp); 235 } 236 237 /* 238 * We keep the "geoms" list sorted by topological order (== increasing 239 * numerical rank) at all times. 240 * When an attach is done, the attaching geoms rank is invalidated 241 * and it is moved to the tail of the list. 242 * All geoms later in the sequence has their ranks reevaluated in 243 * sequence. If we cannot assign rank to a geom because it's 244 * prerequisites do not have rank, we move that element to the tail 245 * of the sequence with invalid rank as well. 246 * At some point we encounter our original geom and if we stil fail 247 * to assign it a rank, there must be a loop and we fail back to 248 * g_attach() which detach again and calls redo_rank again 249 * to fix up the damage. 250 * It would be much simpler code wise to do it recursively, but we 251 * can't risk that on the kernel stack. 252 */ 253 254 static int 255 redo_rank(struct g_geom *gp) 256 { 257 struct g_consumer *cp; 258 struct g_geom *gp1, *gp2; 259 int n, m; 260 261 g_topology_assert(); 262 263 /* Invalidate this geoms rank and move it to the tail */ 264 gp1 = TAILQ_NEXT(gp, geoms); 265 if (gp1 != NULL) { 266 gp->rank = 0; 267 TAILQ_REMOVE(&geoms, gp, geoms); 268 TAILQ_INSERT_TAIL(&geoms, gp, geoms); 269 } else { 270 gp1 = gp; 271 } 272 273 /* re-rank the rest of the sequence */ 274 for (; gp1 != NULL; gp1 = gp2) { 275 gp1->rank = 0; 276 m = 1; 277 LIST_FOREACH(cp, &gp1->consumer, consumer) { 278 if (cp->provider == NULL) 279 continue; 280 n = cp->provider->geom->rank; 281 if (n == 0) { 282 m = 0; 283 break; 284 } else if (n >= m) 285 m = n + 1; 286 } 287 gp1->rank = m; 288 gp2 = TAILQ_NEXT(gp1, geoms); 289 290 /* got a rank, moving on */ 291 if (m != 0) 292 continue; 293 294 /* no rank to original geom means loop */ 295 if (gp == gp1) 296 return (ELOOP); 297 298 /* no rank, put it at the end move on */ 299 TAILQ_REMOVE(&geoms, gp1, geoms); 300 TAILQ_INSERT_TAIL(&geoms, gp1, geoms); 301 } 302 return (0); 303 } 304 305 int 306 g_attach(struct g_consumer *cp, struct g_provider *pp) 307 { 308 int error; 309 310 g_topology_assert(); 311 KASSERT(cp->provider == NULL, ("attach but attached")); 312 cp->provider = pp; 313 LIST_INSERT_HEAD(&pp->consumers, cp, consumers); 314 error = redo_rank(cp->geom); 315 if (error) { 316 LIST_REMOVE(cp, consumers); 317 cp->provider = NULL; 318 redo_rank(cp->geom); 319 } 320 return (error); 321 } 322 323 void 324 g_detach(struct g_consumer *cp) 325 { 326 struct g_provider *pp; 327 328 g_trace(G_T_TOPOLOGY, "g_detach(%p)", cp); 329 KASSERT(cp != (void*)0xd0d0d0d0, ("ARGH!")); 330 g_topology_assert(); 331 KASSERT(cp->provider != NULL, ("detach but not attached")); 332 KASSERT(cp->acr == 0, ("detach but nonzero acr")); 333 KASSERT(cp->acw == 0, ("detach but nonzero acw")); 334 KASSERT(cp->ace == 0, ("detach but nonzero ace")); 335 KASSERT(cp->biocount == 0, ("detach but nonzero biocount")); 336 pp = cp->provider; 337 LIST_REMOVE(cp, consumers); 338 cp->provider = NULL; 339 if (LIST_EMPTY(&pp->consumers)) { 340 if (pp->geom->flags & G_GEOM_WITHER) 341 g_destroy_provider(pp); 342 } 343 redo_rank(cp->geom); 344 } 345 346 347 /* 348 * g_access_abs() 349 * 350 * Access-check with absolute new values: Just fall through 351 * and use the relative version. 352 */ 353 int 354 g_access_abs(struct g_consumer *cp, int acr, int acw, int ace) 355 { 356 357 g_topology_assert(); 358 return(g_access_rel(cp, 359 acr - cp->acr, 360 acw - cp->acw, 361 ace - cp->ace)); 362 } 363 364 /* 365 * g_access_rel() 366 * 367 * Access-check with delta values. The question asked is "can provider 368 * "cp" change the access counters by the relative amounts dc[rwe] ?" 369 */ 370 371 int 372 g_access_rel(struct g_consumer *cp, int dcr, int dcw, int dce) 373 { 374 struct g_provider *pp; 375 int pr,pw,pe; 376 int error; 377 378 pp = cp->provider; 379 380 g_trace(G_T_ACCESS, "g_access_rel(%p(%s), %d, %d, %d)", 381 cp, pp->name, dcr, dcw, dce); 382 383 g_topology_assert(); 384 KASSERT(cp->provider != NULL, ("access but not attached")); 385 KASSERT(cp->acr + dcr >= 0, ("access resulting in negative acr")); 386 KASSERT(cp->acw + dcw >= 0, ("access resulting in negative acw")); 387 KASSERT(cp->ace + dce >= 0, ("access resulting in negative ace")); 388 KASSERT(pp->geom->access != NULL, ("NULL geom->access")); 389 390 /* 391 * If our class cares about being spoiled, and we have been, we 392 * are probably just ahead of the event telling us that. Fail 393 * now rather than having to unravel this later. 394 */ 395 if (cp->geom->spoiled != NULL && cp->spoiled) { 396 KASSERT(dcr >= 0, ("spoiled but dcr = %d", dcr)); 397 KASSERT(dcw >= 0, ("spoiled but dce = %d", dcw)); 398 KASSERT(dce >= 0, ("spoiled but dcw = %d", dce)); 399 KASSERT(cp->acr == 0, ("spoiled but cp->acr = %d", cp->acr)); 400 KASSERT(cp->acw == 0, ("spoiled but cp->acw = %d", cp->acw)); 401 KASSERT(cp->ace == 0, ("spoiled but cp->ace = %d", cp->ace)); 402 return(ENXIO); 403 } 404 405 /* 406 * Figure out what counts the provider would have had, if this 407 * consumer had (r0w0e0) at this time. 408 */ 409 pr = pp->acr - cp->acr; 410 pw = pp->acw - cp->acw; 411 pe = pp->ace - cp->ace; 412 413 g_trace(G_T_ACCESS, 414 "open delta:[r%dw%de%d] old:[r%dw%de%d] provider:[r%dw%de%d] %p(%s)", 415 dcr, dcw, dce, 416 cp->acr, cp->acw, cp->ace, 417 pp->acr, pp->acw, pp->ace, 418 pp, pp->name); 419 420 /* If we try exclusive but already write: fail */ 421 if (dce > 0 && pw > 0) 422 return (EPERM); 423 /* If we try write but already exclusive: fail */ 424 if (dcw > 0 && pe > 0) 425 return (EPERM); 426 /* If we try to open more but provider is error'ed: fail */ 427 if ((dcr > 0 || dcw > 0 || dce > 0) && pp->error != 0) 428 return (pp->error); 429 430 /* Ok then... */ 431 432 /* 433 * If we open first write, spoil any partner consumers. 434 * If we close last write, trigger re-taste. 435 */ 436 if (pp->acw == 0 && dcw != 0) 437 g_spoil(pp, cp); 438 else if (pp->acw != 0 && pp->acw == -dcw && !(pp->geom->flags & G_GEOM_WITHER)) 439 g_post_event(EV_NEW_PROVIDER, NULL, NULL, pp, NULL); 440 441 error = pp->geom->access(pp, dcr, dcw, dce); 442 if (!error) { 443 pp->acr += dcr; 444 pp->acw += dcw; 445 pp->ace += dce; 446 cp->acr += dcr; 447 cp->acw += dcw; 448 cp->ace += dce; 449 } 450 return (error); 451 } 452 453 int 454 g_handleattr_int(struct bio *bp, char *attribute, int val) 455 { 456 457 return (g_handleattr(bp, attribute, &val, sizeof val)); 458 } 459 460 int 461 g_handleattr_off_t(struct bio *bp, char *attribute, off_t val) 462 { 463 464 return (g_handleattr(bp, attribute, &val, sizeof val)); 465 } 466 467 468 int 469 g_handleattr(struct bio *bp, char *attribute, void *val, int len) 470 { 471 int error; 472 473 if (strcmp(bp->bio_attribute, attribute)) 474 return (0); 475 if (bp->bio_length != len) { 476 printf("bio_length %jd len %d -> EFAULT\n", 477 (intmax_t)bp->bio_length, len); 478 error = EFAULT; 479 } else { 480 error = 0; 481 bcopy(val, bp->bio_data, len); 482 bp->bio_completed = len; 483 } 484 g_io_deliver(bp, error); 485 return (1); 486 } 487 488 int 489 g_std_access(struct g_provider *pp __unused, 490 int dr __unused, int dw __unused, int de __unused) 491 { 492 493 return (0); 494 } 495 496 void 497 g_std_done(struct bio *bp) 498 { 499 struct bio *bp2; 500 501 bp2 = bp->bio_linkage; 502 if (bp2->bio_error == 0) 503 bp2->bio_error = bp->bio_error; 504 bp2->bio_completed += bp->bio_completed; 505 g_destroy_bio(bp); 506 bp2->bio_children--; /* XXX: atomic ? */ 507 if (bp2->bio_children == 0) 508 g_io_deliver(bp2, bp2->bio_error); 509 } 510 511 /* XXX: maybe this is only g_slice_spoiled */ 512 513 void 514 g_std_spoiled(struct g_consumer *cp) 515 { 516 struct g_geom *gp; 517 struct g_provider *pp; 518 519 g_trace(G_T_TOPOLOGY, "g_std_spoiled(%p)", cp); 520 g_topology_assert(); 521 g_detach(cp); 522 gp = cp->geom; 523 LIST_FOREACH(pp, &gp->provider, provider) 524 g_orphan_provider(pp, ENXIO); 525 g_destroy_consumer(cp); 526 if (LIST_EMPTY(&gp->provider) && LIST_EMPTY(&gp->consumer)) 527 g_destroy_geom(gp); 528 else 529 gp->flags |= G_GEOM_WITHER; 530 } 531 532 /* 533 * Spoiling happens when a provider is opened for writing, but consumers 534 * which are configured by in-band data are attached (slicers for instance). 535 * Since the write might potentially change the in-band data, such consumers 536 * need to re-evaluate their existence after the writing session closes. 537 * We do this by (offering to) tear them down when the open for write happens 538 * in return for a re-taste when it closes again. 539 * Together with the fact that such consumers grab an 'e' bit whenever they 540 * are open, regardless of mode, this ends up DTRT. 541 */ 542 543 void 544 g_spoil(struct g_provider *pp, struct g_consumer *cp) 545 { 546 struct g_consumer *cp2; 547 548 g_topology_assert(); 549 550 LIST_FOREACH(cp2, &pp->consumers, consumers) { 551 if (cp2 == cp) 552 continue; 553 /* 554 KASSERT(cp2->acr == 0, ("spoiling cp->acr = %d", cp2->acr)); 555 KASSERT(cp2->acw == 0, ("spoiling cp->acw = %d", cp2->acw)); 556 */ 557 KASSERT(cp2->ace == 0, ("spoiling cp->ace = %d", cp2->ace)); 558 cp2->spoiled++; 559 } 560 g_post_event(EV_SPOILED, NULL, NULL, pp, cp); 561 } 562 563 static struct g_class * 564 g_class_by_name(char *name) 565 { 566 struct g_class *mp; 567 568 g_trace(G_T_TOPOLOGY, "g_class_by_name(%s)", name); 569 g_topology_assert(); 570 LIST_FOREACH(mp, &g_classes, class) 571 if (!strcmp(mp->name, name)) 572 return (mp); 573 return (NULL); 574 } 575 576 struct g_geom * 577 g_insert_geom(char *class, struct g_consumer *cp) 578 { 579 struct g_class *mp; 580 struct g_geom *gp; 581 struct g_provider *pp, *pp2; 582 struct g_consumer *cp2; 583 int error; 584 585 g_trace(G_T_TOPOLOGY, "g_insert_geomf(%s, %p)", class, cp); 586 g_topology_assert(); 587 KASSERT(cp->provider != NULL, ("g_insert_geomf but not attached")); 588 /* XXX: check for events ?? */ 589 mp = g_class_by_name(class); 590 if (mp == NULL) 591 return (NULL); 592 if (mp->create_geom == NULL) 593 return (NULL); 594 pp = cp->provider; 595 gp = mp->taste(mp, pp, G_TF_TRANSPARENT); 596 if (gp == NULL) 597 return (NULL); 598 pp2 = LIST_FIRST(&gp->provider); 599 cp2 = LIST_FIRST(&gp->consumer); 600 cp2->acr += pp->acr; 601 cp2->acw += pp->acw; 602 cp2->ace += pp->ace; 603 pp2->acr += pp->acr; 604 pp2->acw += pp->acw; 605 pp2->ace += pp->ace; 606 LIST_REMOVE(cp, consumers); 607 LIST_INSERT_HEAD(&pp2->consumers, cp, consumers); 608 cp->provider = pp2; 609 error = redo_rank(gp); 610 KASSERT(error == 0, ("redo_rank failed in g_insert_geom")); 611 return (gp); 612 } 613 614 int 615 g_getattr__(const char *attr, struct g_consumer *cp, void *var, int len) 616 { 617 int error, i; 618 619 i = len; 620 error = g_io_getattr(attr, cp, &i, var); 621 if (error) 622 return (error); 623 if (i != len) 624 return (EINVAL); 625 return (0); 626 } 627 628 /* 629 * Check if the given pointer is a live object 630 */ 631 632 void 633 g_sanity(void *ptr) 634 { 635 struct g_class *mp; 636 struct g_geom *gp; 637 struct g_consumer *cp; 638 struct g_provider *pp; 639 640 if (!(g_debugflags & 0x8)) 641 return; 642 LIST_FOREACH(mp, &g_classes, class) { 643 KASSERT(mp != ptr, ("Ptr is live class")); 644 KASSERT(mp->protect == 0x20016600, 645 ("corrupt class %p %x", mp, mp->protect)); 646 LIST_FOREACH(gp, &mp->geom, geom) { 647 KASSERT(gp != ptr, ("Ptr is live geom")); 648 KASSERT(gp->protect == 0x20016601, 649 ("corrupt geom, %p %x", gp, gp->protect)); 650 KASSERT(gp->name != ptr, ("Ptr is live geom's name")); 651 LIST_FOREACH(cp, &gp->consumer, consumer) { 652 KASSERT(cp != ptr, ("Ptr is live consumer")); 653 KASSERT(cp->protect == 0x20016602, 654 ("corrupt consumer %p %x", 655 cp, cp->protect)); 656 } 657 LIST_FOREACH(pp, &gp->provider, provider) { 658 KASSERT(pp != ptr, ("Ptr is live provider")); 659 KASSERT(pp->protect == 0x20016603, 660 ("corrupt provider %p %x", 661 pp, pp->protect)); 662 } 663 } 664 } 665 } 666 667 #ifdef _KERNEL 668 struct g_class * 669 g_idclass(struct geomidorname *p) 670 { 671 struct g_class *mp; 672 char *n; 673 674 if (p->len == 0) { 675 LIST_FOREACH(mp, &g_classes, class) 676 if ((uintptr_t)mp == p->u.id) 677 return (mp); 678 return (NULL); 679 } 680 n = g_malloc(p->len + 1, M_WAITOK); 681 if (copyin(p->u.name, n, p->len) == 0) { 682 n[p->len] = '\0'; 683 LIST_FOREACH(mp, &g_classes, class) 684 if (!bcmp(n, mp->name, p->len + 1)) { 685 g_free(n); 686 return (mp); 687 } 688 } 689 g_free(n); 690 return (NULL); 691 } 692 693 struct g_geom * 694 g_idgeom(struct geomidorname *p) 695 { 696 struct g_class *mp; 697 struct g_geom *gp; 698 char *n; 699 700 if (p->len == 0) { 701 LIST_FOREACH(mp, &g_classes, class) 702 LIST_FOREACH(gp, &mp->geom, geom) 703 if ((uintptr_t)gp == p->u.id) 704 return (gp); 705 return (NULL); 706 } 707 n = g_malloc(p->len + 1, M_WAITOK); 708 if (copyin(p->u.name, n, p->len) == 0) { 709 n[p->len] = '\0'; 710 LIST_FOREACH(mp, &g_classes, class) 711 LIST_FOREACH(gp, &mp->geom, geom) 712 if (!bcmp(n, gp->name, p->len + 1)) { 713 g_free(n); 714 return (gp); 715 } 716 } 717 g_free(n); 718 return (NULL); 719 } 720 721 struct g_provider * 722 g_idprovider(struct geomidorname *p) 723 { 724 struct g_class *mp; 725 struct g_geom *gp; 726 struct g_provider *pp; 727 char *n; 728 729 if (p->len == 0) { 730 LIST_FOREACH(mp, &g_classes, class) 731 LIST_FOREACH(gp, &mp->geom, geom) 732 LIST_FOREACH(pp, &gp->provider, provider) 733 if ((uintptr_t)pp == p->u.id) 734 return (pp); 735 return (NULL); 736 } 737 n = g_malloc(p->len + 1, M_WAITOK); 738 if (copyin(p->u.name, n, p->len) == 0) { 739 n[p->len] = '\0'; 740 LIST_FOREACH(mp, &g_classes, class) 741 LIST_FOREACH(gp, &mp->geom, geom) 742 LIST_FOREACH(pp, &gp->provider, provider) 743 if (!bcmp(n, pp->name, p->len + 1)) { 744 g_free(n); 745 return (pp); 746 } 747 } 748 g_free(n); 749 return (NULL); 750 } 751 #endif /* _KERNEL */ 752