geom_subr.c revision 112030
1150286Srwatson/*- 2150286Srwatson * Copyright (c) 2002 Poul-Henning Kamp 3150286Srwatson * Copyright (c) 2002 Networks Associates Technology, Inc. 4276486Sngie * All rights reserved. 5281974Sngie * 6150286Srwatson * This software was developed for the FreeBSD Project by Poul-Henning Kamp 7150286Srwatson * 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: head/sys/geom/geom_subr.c 112030 2003-03-09 10:04:21Z phk $ 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 65struct class_list_head g_classes = LIST_HEAD_INITIALIZER(g_classes); 66static struct g_tailq_head geoms = TAILQ_HEAD_INITIALIZER(geoms); 67static int g_nproviders; 68char *g_wait_event, *g_wait_up, *g_wait_down, *g_wait_sim; 69 70static int g_ignition; 71 72void 73g_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 90struct g_geom * 91g_new_geomf(struct g_class *mp, const 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 sb = sbuf_new(NULL, NULL, 0, SBUF_AUTOEXTEND); 100 sbuf_vprintf(sb, fmt, ap); 101 sbuf_finish(sb); 102 gp = g_malloc(sizeof *gp, M_WAITOK | M_ZERO); 103 gp->protect = 0x020016601; 104 gp->name = g_malloc(sbuf_len(sb) + 1, M_WAITOK | M_ZERO); 105 gp->class = mp; 106 gp->rank = 1; 107 LIST_INIT(&gp->consumer); 108 LIST_INIT(&gp->provider); 109 LIST_INSERT_HEAD(&mp->geom, gp, geom); 110 TAILQ_INSERT_HEAD(&geoms, gp, geoms); 111 strcpy(gp->name, sbuf_data(sb)); 112 sbuf_delete(sb); 113 return (gp); 114} 115 116void 117g_destroy_geom(struct g_geom *gp) 118{ 119 120 g_trace(G_T_TOPOLOGY, "g_destroy_geom(%p(%s))", gp, gp->name); 121 g_topology_assert(); 122 KASSERT(gp->event == NULL, ("g_destroy_geom() with event")); 123 KASSERT(LIST_EMPTY(&gp->consumer), 124 ("g_destroy_geom(%s) with consumer(s) [%p]", 125 gp->name, LIST_FIRST(&gp->consumer))); 126 KASSERT(LIST_EMPTY(&gp->provider), 127 ("g_destroy_geom(%s) with provider(s) [%p]", 128 gp->name, LIST_FIRST(&gp->consumer))); 129 LIST_REMOVE(gp, geom); 130 TAILQ_REMOVE(&geoms, gp, geoms); 131 g_free(gp->name); 132 g_free(gp); 133} 134 135struct g_consumer * 136g_new_consumer(struct g_geom *gp) 137{ 138 struct g_consumer *cp; 139 140 g_topology_assert(); 141 KASSERT(gp->orphan != NULL, 142 ("g_new_consumer on geom(%s) (class %s) without orphan", 143 gp->name, gp->class->name)); 144 145 cp = g_malloc(sizeof *cp, M_WAITOK | M_ZERO); 146 cp->protect = 0x020016602; 147 cp->geom = gp; 148 cp->stat = g_stat_new(cp); 149 LIST_INSERT_HEAD(&gp->consumer, cp, consumer); 150 return(cp); 151} 152 153void 154g_destroy_consumer(struct g_consumer *cp) 155{ 156 157 g_trace(G_T_TOPOLOGY, "g_destroy_consumer(%p)", cp); 158 g_topology_assert(); 159 KASSERT(cp->event == NULL, ("g_destroy_consumer() with event")); 160 KASSERT (cp->provider == NULL, ("g_destroy_consumer but attached")); 161 KASSERT (cp->acr == 0, ("g_destroy_consumer with acr")); 162 KASSERT (cp->acw == 0, ("g_destroy_consumer with acw")); 163 KASSERT (cp->ace == 0, ("g_destroy_consumer with ace")); 164 LIST_REMOVE(cp, consumer); 165 g_stat_delete(cp->stat); 166 g_free(cp); 167} 168 169struct g_provider * 170g_new_providerf(struct g_geom *gp, const 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 sb = sbuf_new(NULL, NULL, 0, SBUF_AUTOEXTEND); 179 sbuf_vprintf(sb, fmt, ap); 180 sbuf_finish(sb); 181 pp = g_malloc(sizeof *pp + sbuf_len(sb) + 1, M_WAITOK | M_ZERO); 182 pp->protect = 0x020016603; 183 pp->name = (char *)(pp + 1); 184 strcpy(pp->name, sbuf_data(sb)); 185 sbuf_delete(sb); 186 LIST_INIT(&pp->consumers); 187 pp->error = ENXIO; 188 pp->geom = gp; 189 pp->stat = g_stat_new(pp); 190 LIST_INSERT_HEAD(&gp->provider, pp, provider); 191 g_nproviders++; 192 g_post_event(EV_NEW_PROVIDER, NULL, NULL, pp, NULL); 193 return (pp); 194} 195 196void 197g_error_provider(struct g_provider *pp, int error) 198{ 199 200 pp->error = error; 201} 202 203 204void 205g_destroy_provider(struct g_provider *pp) 206{ 207 struct g_geom *gp; 208 struct g_consumer *cp; 209 210 g_topology_assert(); 211 KASSERT(pp->event == NULL, ("g_destroy_provider() with event")); 212 KASSERT(LIST_EMPTY(&pp->consumers), 213 ("g_destroy_provider but attached")); 214 KASSERT (pp->acr == 0, ("g_destroy_provider with acr")); 215 KASSERT (pp->acw == 0, ("g_destroy_provider with acw")); 216 KASSERT (pp->acw == 0, ("g_destroy_provider with ace")); 217 g_nproviders--; 218 LIST_REMOVE(pp, provider); 219 gp = pp->geom; 220 g_stat_delete(pp->stat); 221 g_free(pp); 222 if (!(gp->flags & G_GEOM_WITHER)) 223 return; 224 if (!LIST_EMPTY(&gp->provider)) 225 return; 226 for (;;) { 227 cp = LIST_FIRST(&gp->consumer); 228 if (cp == NULL) 229 break; 230 g_detach(cp); 231 g_destroy_consumer(cp); 232 } 233 g_destroy_geom(gp); 234} 235 236/* 237 * We keep the "geoms" list sorted by topological order (== increasing 238 * numerical rank) at all times. 239 * When an attach is done, the attaching geoms rank is invalidated 240 * and it is moved to the tail of the list. 241 * All geoms later in the sequence has their ranks reevaluated in 242 * sequence. If we cannot assign rank to a geom because it's 243 * prerequisites do not have rank, we move that element to the tail 244 * of the sequence with invalid rank as well. 245 * At some point we encounter our original geom and if we stil fail 246 * to assign it a rank, there must be a loop and we fail back to 247 * g_attach() which detach again and calls redo_rank again 248 * to fix up the damage. 249 * It would be much simpler code wise to do it recursively, but we 250 * can't risk that on the kernel stack. 251 */ 252 253static int 254redo_rank(struct g_geom *gp) 255{ 256 struct g_consumer *cp; 257 struct g_geom *gp1, *gp2; 258 int n, m; 259 260 g_topology_assert(); 261 262 /* Invalidate this geoms rank and move it to the tail */ 263 gp1 = TAILQ_NEXT(gp, geoms); 264 if (gp1 != NULL) { 265 gp->rank = 0; 266 TAILQ_REMOVE(&geoms, gp, geoms); 267 TAILQ_INSERT_TAIL(&geoms, gp, geoms); 268 } else { 269 gp1 = gp; 270 } 271 272 /* re-rank the rest of the sequence */ 273 for (; gp1 != NULL; gp1 = gp2) { 274 gp1->rank = 0; 275 m = 1; 276 LIST_FOREACH(cp, &gp1->consumer, consumer) { 277 if (cp->provider == NULL) 278 continue; 279 n = cp->provider->geom->rank; 280 if (n == 0) { 281 m = 0; 282 break; 283 } else if (n >= m) 284 m = n + 1; 285 } 286 gp1->rank = m; 287 gp2 = TAILQ_NEXT(gp1, geoms); 288 289 /* got a rank, moving on */ 290 if (m != 0) 291 continue; 292 293 /* no rank to original geom means loop */ 294 if (gp == gp1) 295 return (ELOOP); 296 297 /* no rank, put it at the end move on */ 298 TAILQ_REMOVE(&geoms, gp1, geoms); 299 TAILQ_INSERT_TAIL(&geoms, gp1, geoms); 300 } 301 return (0); 302} 303 304int 305g_attach(struct g_consumer *cp, struct g_provider *pp) 306{ 307 int error; 308 309 g_topology_assert(); 310 KASSERT(cp->provider == NULL, ("attach but attached")); 311 cp->provider = pp; 312 LIST_INSERT_HEAD(&pp->consumers, cp, consumers); 313 error = redo_rank(cp->geom); 314 if (error) { 315 LIST_REMOVE(cp, consumers); 316 cp->provider = NULL; 317 redo_rank(cp->geom); 318 } 319 return (error); 320} 321 322void 323g_detach(struct g_consumer *cp) 324{ 325 struct g_provider *pp; 326 327 g_trace(G_T_TOPOLOGY, "g_detach(%p)", cp); 328 KASSERT(cp != (void*)0xd0d0d0d0, ("ARGH!")); 329 g_topology_assert(); 330 KASSERT(cp->provider != NULL, ("detach but not attached")); 331 KASSERT(cp->acr == 0, ("detach but nonzero acr")); 332 KASSERT(cp->acw == 0, ("detach but nonzero acw")); 333 KASSERT(cp->ace == 0, ("detach but nonzero ace")); 334 KASSERT(cp->nstart == cp->nend, 335 ("detach with active requests")); 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 */ 353int 354g_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 371int 372g_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 foot-shooting is enabled, any open on rank#1 is OK */ 421 if ((g_debugflags & 16) && pp->geom->rank == 1) 422 ; 423 /* If we try exclusive but already write: fail */ 424 else if (dce > 0 && pw > 0) 425 return (EPERM); 426 /* If we try write but already exclusive: fail */ 427 else if (dcw > 0 && pe > 0) 428 return (EPERM); 429 /* If we try to open more but provider is error'ed: fail */ 430 else if ((dcr > 0 || dcw > 0 || dce > 0) && pp->error != 0) 431 return (pp->error); 432 433 /* Ok then... */ 434 435 /* 436 * If we open first write, spoil any partner consumers. 437 * If we close last write, trigger re-taste. 438 */ 439 if (pp->acw == 0 && dcw != 0) 440 g_spoil(pp, cp); 441 else if (pp->acw != 0 && pp->acw == -dcw && 442 !(pp->geom->flags & G_GEOM_WITHER)) 443 g_post_event(EV_NEW_PROVIDER, NULL, NULL, pp, NULL); 444 445 error = pp->geom->access(pp, dcr, dcw, dce); 446 if (!error) { 447 pp->acr += dcr; 448 pp->acw += dcw; 449 pp->ace += dce; 450 cp->acr += dcr; 451 cp->acw += dcw; 452 cp->ace += dce; 453 } 454 return (error); 455} 456 457int 458g_handleattr_int(struct bio *bp, const char *attribute, int val) 459{ 460 461 return (g_handleattr(bp, attribute, &val, sizeof val)); 462} 463 464int 465g_handleattr_off_t(struct bio *bp, const char *attribute, off_t val) 466{ 467 468 return (g_handleattr(bp, attribute, &val, sizeof val)); 469} 470 471 472int 473g_handleattr(struct bio *bp, const char *attribute, void *val, int len) 474{ 475 int error; 476 477 if (strcmp(bp->bio_attribute, attribute)) 478 return (0); 479 if (bp->bio_length != len) { 480 printf("bio_length %jd len %d -> EFAULT\n", 481 (intmax_t)bp->bio_length, len); 482 error = EFAULT; 483 } else { 484 error = 0; 485 bcopy(val, bp->bio_data, len); 486 bp->bio_completed = len; 487 } 488 g_io_deliver(bp, error); 489 return (1); 490} 491 492int 493g_std_access(struct g_provider *pp __unused, 494 int dr __unused, int dw __unused, int de __unused) 495{ 496 497 return (0); 498} 499 500void 501g_std_done(struct bio *bp) 502{ 503 struct bio *bp2; 504 505 bp2 = bp->bio_parent; 506 if (bp2->bio_error == 0) 507 bp2->bio_error = bp->bio_error; 508 bp2->bio_completed += bp->bio_completed; 509 g_destroy_bio(bp); 510 bp2->bio_inbed++; 511 if (bp2->bio_children == bp2->bio_inbed) 512 g_io_deliver(bp2, bp2->bio_error); 513} 514 515/* XXX: maybe this is only g_slice_spoiled */ 516 517void 518g_std_spoiled(struct g_consumer *cp) 519{ 520 struct g_geom *gp; 521 struct g_provider *pp; 522 523 g_trace(G_T_TOPOLOGY, "g_std_spoiled(%p)", cp); 524 g_topology_assert(); 525 g_detach(cp); 526 gp = cp->geom; 527 LIST_FOREACH(pp, &gp->provider, provider) 528 g_orphan_provider(pp, ENXIO); 529 g_destroy_consumer(cp); 530 if (LIST_EMPTY(&gp->provider) && LIST_EMPTY(&gp->consumer)) 531 g_destroy_geom(gp); 532 else 533 gp->flags |= G_GEOM_WITHER; 534} 535 536/* 537 * Spoiling happens when a provider is opened for writing, but consumers 538 * which are configured by in-band data are attached (slicers for instance). 539 * Since the write might potentially change the in-band data, such consumers 540 * need to re-evaluate their existence after the writing session closes. 541 * We do this by (offering to) tear them down when the open for write happens 542 * in return for a re-taste when it closes again. 543 * Together with the fact that such consumers grab an 'e' bit whenever they 544 * are open, regardless of mode, this ends up DTRT. 545 */ 546 547void 548g_spoil(struct g_provider *pp, struct g_consumer *cp) 549{ 550 struct g_consumer *cp2; 551 552 g_topology_assert(); 553 554 if (!strcmp(pp->name, "geom.ctl")) 555 return; 556 LIST_FOREACH(cp2, &pp->consumers, consumers) { 557 if (cp2 == cp) 558 continue; 559/* 560 KASSERT(cp2->acr == 0, ("spoiling cp->acr = %d", cp2->acr)); 561 KASSERT(cp2->acw == 0, ("spoiling cp->acw = %d", cp2->acw)); 562*/ 563 KASSERT(cp2->ace == 0, ("spoiling cp->ace = %d", cp2->ace)); 564 cp2->spoiled++; 565 } 566 g_post_event(EV_SPOILED, NULL, NULL, pp, cp); 567} 568 569static struct g_class * 570g_class_by_name(const char *name) 571{ 572 struct g_class *mp; 573 574 g_trace(G_T_TOPOLOGY, "g_class_by_name(%s)", name); 575 g_topology_assert(); 576 LIST_FOREACH(mp, &g_classes, class) 577 if (!strcmp(mp->name, name)) 578 return (mp); 579 return (NULL); 580} 581 582struct g_geom * 583g_insert_geom(const char *class, struct g_consumer *cp) 584{ 585 struct g_class *mp; 586 struct g_geom *gp; 587 struct g_provider *pp, *pp2; 588 struct g_consumer *cp2; 589 int error; 590 591 g_trace(G_T_TOPOLOGY, "g_insert_geomf(%s, %p)", class, cp); 592 g_topology_assert(); 593 KASSERT(cp->provider != NULL, ("g_insert_geomf but not attached")); 594 /* XXX: check for events ?? */ 595 mp = g_class_by_name(class); 596 if (mp == NULL) 597 return (NULL); 598 if (mp->config == NULL) 599 return (NULL); 600 pp = cp->provider; 601 gp = mp->taste(mp, pp, G_TF_TRANSPARENT); 602 if (gp == NULL) 603 return (NULL); 604 pp2 = LIST_FIRST(&gp->provider); 605 cp2 = LIST_FIRST(&gp->consumer); 606 cp2->acr += pp->acr; 607 cp2->acw += pp->acw; 608 cp2->ace += pp->ace; 609 pp2->acr += pp->acr; 610 pp2->acw += pp->acw; 611 pp2->ace += pp->ace; 612 LIST_REMOVE(cp, consumers); 613 LIST_INSERT_HEAD(&pp2->consumers, cp, consumers); 614 cp->provider = pp2; 615 error = redo_rank(gp); 616 KASSERT(error == 0, ("redo_rank failed in g_insert_geom")); 617 return (gp); 618} 619 620int 621g_getattr__(const char *attr, struct g_consumer *cp, void *var, int len) 622{ 623 int error, i; 624 625 i = len; 626 error = g_io_getattr(attr, cp, &i, var); 627 if (error) 628 return (error); 629 if (i != len) 630 return (EINVAL); 631 return (0); 632} 633 634/* 635 * Check if the given pointer is a live object 636 */ 637 638void 639g_sanity(void *ptr) 640{ 641 struct g_class *mp; 642 struct g_geom *gp; 643 struct g_consumer *cp; 644 struct g_provider *pp; 645 646 if (!(g_debugflags & 0x8)) 647 return; 648 LIST_FOREACH(mp, &g_classes, class) { 649 KASSERT(mp != ptr, ("Ptr is live class")); 650 KASSERT(mp->protect == 0x20016600, 651 ("corrupt class %p %x", mp, mp->protect)); 652 LIST_FOREACH(gp, &mp->geom, geom) { 653 KASSERT(gp != ptr, ("Ptr is live geom")); 654 KASSERT(gp->protect == 0x20016601, 655 ("corrupt geom, %p %x", gp, gp->protect)); 656 KASSERT(gp->name != ptr, ("Ptr is live geom's name")); 657 LIST_FOREACH(cp, &gp->consumer, consumer) { 658 KASSERT(cp != ptr, ("Ptr is live consumer")); 659 KASSERT(cp->protect == 0x20016602, 660 ("corrupt consumer %p %x", 661 cp, cp->protect)); 662 } 663 LIST_FOREACH(pp, &gp->provider, provider) { 664 KASSERT(pp != ptr, ("Ptr is live provider")); 665 KASSERT(pp->protect == 0x20016603, 666 ("corrupt provider %p %x", 667 pp, pp->protect)); 668 } 669 } 670 } 671} 672 673#ifdef _KERNEL 674struct g_class * 675g_idclass(struct geomidorname *p) 676{ 677 struct g_class *mp; 678 char *n; 679 680 if (p->len == 0) { 681 LIST_FOREACH(mp, &g_classes, class) 682 if ((uintptr_t)mp == p->u.id) 683 return (mp); 684 return (NULL); 685 } 686 n = g_malloc(p->len + 1, M_WAITOK); 687 if (copyin(p->u.name, n, p->len) == 0) { 688 n[p->len] = '\0'; 689 LIST_FOREACH(mp, &g_classes, class) 690 if (!bcmp(n, mp->name, p->len + 1)) { 691 g_free(n); 692 return (mp); 693 } 694 } 695 g_free(n); 696 return (NULL); 697} 698 699struct g_geom * 700g_idgeom(struct geomidorname *p) 701{ 702 struct g_class *mp; 703 struct g_geom *gp; 704 char *n; 705 706 if (p->len == 0) { 707 LIST_FOREACH(mp, &g_classes, class) 708 LIST_FOREACH(gp, &mp->geom, geom) 709 if ((uintptr_t)gp == p->u.id) 710 return (gp); 711 return (NULL); 712 } 713 n = g_malloc(p->len + 1, M_WAITOK); 714 if (copyin(p->u.name, n, p->len) == 0) { 715 n[p->len] = '\0'; 716 LIST_FOREACH(mp, &g_classes, class) 717 LIST_FOREACH(gp, &mp->geom, geom) 718 if (!bcmp(n, gp->name, p->len + 1)) { 719 g_free(n); 720 return (gp); 721 } 722 } 723 g_free(n); 724 return (NULL); 725} 726 727struct g_provider * 728g_idprovider(struct geomidorname *p) 729{ 730 struct g_class *mp; 731 struct g_geom *gp; 732 struct g_provider *pp; 733 char *n; 734 735 if (p->len == 0) { 736 LIST_FOREACH(mp, &g_classes, class) 737 LIST_FOREACH(gp, &mp->geom, geom) 738 LIST_FOREACH(pp, &gp->provider, provider) 739 if ((uintptr_t)pp == p->u.id) 740 return (pp); 741 return (NULL); 742 } 743 n = g_malloc(p->len + 1, M_WAITOK); 744 if (copyin(p->u.name, n, p->len) == 0) { 745 n[p->len] = '\0'; 746 LIST_FOREACH(mp, &g_classes, class) 747 LIST_FOREACH(gp, &mp->geom, geom) 748 LIST_FOREACH(pp, &gp->provider, provider) 749 if (!bcmp(n, pp->name, p->len + 1)) { 750 g_free(n); 751 return (pp); 752 } 753 } 754 g_free(n); 755 return (NULL); 756} 757#endif /* _KERNEL */ 758