geom_subr.c revision 110523
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: head/sys/geom/geom_subr.c 110523 2003-02-07 23:08:24Z 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_ZERO); 103 gp->protect = 0x020016601; 104 gp->name = g_malloc(sbuf_len(sb) + 1, 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_ZERO); 146 cp->protect = 0x020016602; 147 cp->geom = gp; 148 cp->stat.id = 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_free(cp); 166} 167 168struct g_provider * 169g_new_providerf(struct g_geom *gp, const char *fmt, ...) 170{ 171 struct g_provider *pp; 172 struct sbuf *sb; 173 va_list ap; 174 175 g_topology_assert(); 176 va_start(ap, fmt); 177 sb = sbuf_new(NULL, NULL, 0, SBUF_AUTOEXTEND); 178 sbuf_vprintf(sb, fmt, ap); 179 sbuf_finish(sb); 180 pp = g_malloc(sizeof *pp + sbuf_len(sb) + 1, M_ZERO); 181 pp->protect = 0x020016603; 182 pp->name = (char *)(pp + 1); 183 strcpy(pp->name, sbuf_data(sb)); 184 sbuf_delete(sb); 185 LIST_INIT(&pp->consumers); 186 pp->error = ENXIO; 187 pp->geom = gp; 188 pp->stat.id = pp; 189 LIST_INSERT_HEAD(&gp->provider, pp, provider); 190 g_nproviders++; 191 g_post_event(EV_NEW_PROVIDER, NULL, NULL, pp, NULL); 192 return (pp); 193} 194 195void 196g_error_provider(struct g_provider *pp, int error) 197{ 198 199 pp->error = error; 200} 201 202 203void 204g_destroy_provider(struct g_provider *pp) 205{ 206 struct g_geom *gp; 207 struct g_consumer *cp; 208 209 g_topology_assert(); 210 KASSERT(pp->event == NULL, ("g_destroy_provider() with event")); 211 KASSERT(LIST_EMPTY(&pp->consumers), 212 ("g_destroy_provider but attached")); 213 KASSERT (pp->acr == 0, ("g_destroy_provider with acr")); 214 KASSERT (pp->acw == 0, ("g_destroy_provider with acw")); 215 KASSERT (pp->acw == 0, ("g_destroy_provider with ace")); 216 g_nproviders--; 217 LIST_REMOVE(pp, provider); 218 gp = pp->geom; 219 g_free(pp); 220 if (!(gp->flags & G_GEOM_WITHER)) 221 return; 222 if (!LIST_EMPTY(&gp->provider)) 223 return; 224 for (;;) { 225 cp = LIST_FIRST(&gp->consumer); 226 if (cp == NULL) 227 break; 228 g_detach(cp); 229 g_destroy_consumer(cp); 230 } 231 g_destroy_geom(gp); 232} 233 234/* 235 * We keep the "geoms" list sorted by topological order (== increasing 236 * numerical rank) at all times. 237 * When an attach is done, the attaching geoms rank is invalidated 238 * and it is moved to the tail of the list. 239 * All geoms later in the sequence has their ranks reevaluated in 240 * sequence. If we cannot assign rank to a geom because it's 241 * prerequisites do not have rank, we move that element to the tail 242 * of the sequence with invalid rank as well. 243 * At some point we encounter our original geom and if we stil fail 244 * to assign it a rank, there must be a loop and we fail back to 245 * g_attach() which detach again and calls redo_rank again 246 * to fix up the damage. 247 * It would be much simpler code wise to do it recursively, but we 248 * can't risk that on the kernel stack. 249 */ 250 251static int 252redo_rank(struct g_geom *gp) 253{ 254 struct g_consumer *cp; 255 struct g_geom *gp1, *gp2; 256 int n, m; 257 258 g_topology_assert(); 259 260 /* Invalidate this geoms rank and move it to the tail */ 261 gp1 = TAILQ_NEXT(gp, geoms); 262 if (gp1 != NULL) { 263 gp->rank = 0; 264 TAILQ_REMOVE(&geoms, gp, geoms); 265 TAILQ_INSERT_TAIL(&geoms, gp, geoms); 266 } else { 267 gp1 = gp; 268 } 269 270 /* re-rank the rest of the sequence */ 271 for (; gp1 != NULL; gp1 = gp2) { 272 gp1->rank = 0; 273 m = 1; 274 LIST_FOREACH(cp, &gp1->consumer, consumer) { 275 if (cp->provider == NULL) 276 continue; 277 n = cp->provider->geom->rank; 278 if (n == 0) { 279 m = 0; 280 break; 281 } else if (n >= m) 282 m = n + 1; 283 } 284 gp1->rank = m; 285 gp2 = TAILQ_NEXT(gp1, geoms); 286 287 /* got a rank, moving on */ 288 if (m != 0) 289 continue; 290 291 /* no rank to original geom means loop */ 292 if (gp == gp1) 293 return (ELOOP); 294 295 /* no rank, put it at the end move on */ 296 TAILQ_REMOVE(&geoms, gp1, geoms); 297 TAILQ_INSERT_TAIL(&geoms, gp1, geoms); 298 } 299 return (0); 300} 301 302int 303g_attach(struct g_consumer *cp, struct g_provider *pp) 304{ 305 int error; 306 307 g_topology_assert(); 308 KASSERT(cp->provider == NULL, ("attach but attached")); 309 cp->provider = pp; 310 LIST_INSERT_HEAD(&pp->consumers, cp, consumers); 311 error = redo_rank(cp->geom); 312 if (error) { 313 LIST_REMOVE(cp, consumers); 314 cp->provider = NULL; 315 redo_rank(cp->geom); 316 } 317 return (error); 318} 319 320void 321g_detach(struct g_consumer *cp) 322{ 323 struct g_provider *pp; 324 325 g_trace(G_T_TOPOLOGY, "g_detach(%p)", cp); 326 KASSERT(cp != (void*)0xd0d0d0d0, ("ARGH!")); 327 g_topology_assert(); 328 KASSERT(cp->provider != NULL, ("detach but not attached")); 329 KASSERT(cp->acr == 0, ("detach but nonzero acr")); 330 KASSERT(cp->acw == 0, ("detach but nonzero acw")); 331 KASSERT(cp->ace == 0, ("detach but nonzero ace")); 332 KASSERT(cp->stat.nop == cp->stat.nend, ("detach with active requests")); 333 pp = cp->provider; 334 LIST_REMOVE(cp, consumers); 335 cp->provider = NULL; 336 if (LIST_EMPTY(&pp->consumers)) { 337 if (pp->geom->flags & G_GEOM_WITHER) 338 g_destroy_provider(pp); 339 } 340 redo_rank(cp->geom); 341} 342 343 344/* 345 * g_access_abs() 346 * 347 * Access-check with absolute new values: Just fall through 348 * and use the relative version. 349 */ 350int 351g_access_abs(struct g_consumer *cp, int acr, int acw, int ace) 352{ 353 354 g_topology_assert(); 355 return(g_access_rel(cp, 356 acr - cp->acr, 357 acw - cp->acw, 358 ace - cp->ace)); 359} 360 361/* 362 * g_access_rel() 363 * 364 * Access-check with delta values. The question asked is "can provider 365 * "cp" change the access counters by the relative amounts dc[rwe] ?" 366 */ 367 368int 369g_access_rel(struct g_consumer *cp, int dcr, int dcw, int dce) 370{ 371 struct g_provider *pp; 372 int pr,pw,pe; 373 int error; 374 375 pp = cp->provider; 376 377 g_trace(G_T_ACCESS, "g_access_rel(%p(%s), %d, %d, %d)", 378 cp, pp->name, dcr, dcw, dce); 379 380 g_topology_assert(); 381 KASSERT(cp->provider != NULL, ("access but not attached")); 382 KASSERT(cp->acr + dcr >= 0, ("access resulting in negative acr")); 383 KASSERT(cp->acw + dcw >= 0, ("access resulting in negative acw")); 384 KASSERT(cp->ace + dce >= 0, ("access resulting in negative ace")); 385 KASSERT(pp->geom->access != NULL, ("NULL geom->access")); 386 387 /* 388 * If our class cares about being spoiled, and we have been, we 389 * are probably just ahead of the event telling us that. Fail 390 * now rather than having to unravel this later. 391 */ 392 if (cp->geom->spoiled != NULL && cp->spoiled) { 393 KASSERT(dcr >= 0, ("spoiled but dcr = %d", dcr)); 394 KASSERT(dcw >= 0, ("spoiled but dce = %d", dcw)); 395 KASSERT(dce >= 0, ("spoiled but dcw = %d", dce)); 396 KASSERT(cp->acr == 0, ("spoiled but cp->acr = %d", cp->acr)); 397 KASSERT(cp->acw == 0, ("spoiled but cp->acw = %d", cp->acw)); 398 KASSERT(cp->ace == 0, ("spoiled but cp->ace = %d", cp->ace)); 399 return(ENXIO); 400 } 401 402 /* 403 * Figure out what counts the provider would have had, if this 404 * consumer had (r0w0e0) at this time. 405 */ 406 pr = pp->acr - cp->acr; 407 pw = pp->acw - cp->acw; 408 pe = pp->ace - cp->ace; 409 410 g_trace(G_T_ACCESS, 411 "open delta:[r%dw%de%d] old:[r%dw%de%d] provider:[r%dw%de%d] %p(%s)", 412 dcr, dcw, dce, 413 cp->acr, cp->acw, cp->ace, 414 pp->acr, pp->acw, pp->ace, 415 pp, pp->name); 416 417 /* If we try exclusive but already write: fail */ 418 if (dce > 0 && pw > 0) 419 return (EPERM); 420 /* If we try write but already exclusive: fail */ 421 if (dcw > 0 && pe > 0) 422 return (EPERM); 423 /* If we try to open more but provider is error'ed: fail */ 424 if ((dcr > 0 || dcw > 0 || dce > 0) && pp->error != 0) 425 return (pp->error); 426 427 /* Ok then... */ 428 429 /* 430 * If we open first write, spoil any partner consumers. 431 * If we close last write, trigger re-taste. 432 */ 433 if (pp->acw == 0 && dcw != 0) 434 g_spoil(pp, cp); 435 else if (pp->acw != 0 && pp->acw == -dcw && 436 !(pp->geom->flags & G_GEOM_WITHER)) 437 g_post_event(EV_NEW_PROVIDER, NULL, NULL, pp, NULL); 438 439 error = pp->geom->access(pp, dcr, dcw, dce); 440 if (!error) { 441 pp->acr += dcr; 442 pp->acw += dcw; 443 pp->ace += dce; 444 cp->acr += dcr; 445 cp->acw += dcw; 446 cp->ace += dce; 447 } 448 return (error); 449} 450 451int 452g_handleattr_int(struct bio *bp, const char *attribute, int val) 453{ 454 455 return (g_handleattr(bp, attribute, &val, sizeof val)); 456} 457 458int 459g_handleattr_off_t(struct bio *bp, const char *attribute, off_t val) 460{ 461 462 return (g_handleattr(bp, attribute, &val, sizeof val)); 463} 464 465 466int 467g_handleattr(struct bio *bp, const char *attribute, void *val, int len) 468{ 469 int error; 470 471 if (strcmp(bp->bio_attribute, attribute)) 472 return (0); 473 if (bp->bio_length != len) { 474 printf("bio_length %jd len %d -> EFAULT\n", 475 (intmax_t)bp->bio_length, len); 476 error = EFAULT; 477 } else { 478 error = 0; 479 bcopy(val, bp->bio_data, len); 480 bp->bio_completed = len; 481 } 482 g_io_deliver(bp, error); 483 return (1); 484} 485 486int 487g_std_access(struct g_provider *pp __unused, 488 int dr __unused, int dw __unused, int de __unused) 489{ 490 491 return (0); 492} 493 494void 495g_std_done(struct bio *bp) 496{ 497 struct bio *bp2; 498 499 bp2 = bp->bio_parent; 500 if (bp2->bio_error == 0) 501 bp2->bio_error = bp->bio_error; 502 bp2->bio_completed += bp->bio_completed; 503 g_destroy_bio(bp); 504 bp2->bio_inbed++; 505 if (bp2->bio_children == bp2->bio_inbed) 506 g_io_deliver(bp2, bp2->bio_error); 507} 508 509/* XXX: maybe this is only g_slice_spoiled */ 510 511void 512g_std_spoiled(struct g_consumer *cp) 513{ 514 struct g_geom *gp; 515 struct g_provider *pp; 516 517 g_trace(G_T_TOPOLOGY, "g_std_spoiled(%p)", cp); 518 g_topology_assert(); 519 g_detach(cp); 520 gp = cp->geom; 521 LIST_FOREACH(pp, &gp->provider, provider) 522 g_orphan_provider(pp, ENXIO); 523 g_destroy_consumer(cp); 524 if (LIST_EMPTY(&gp->provider) && LIST_EMPTY(&gp->consumer)) 525 g_destroy_geom(gp); 526 else 527 gp->flags |= G_GEOM_WITHER; 528} 529 530/* 531 * Spoiling happens when a provider is opened for writing, but consumers 532 * which are configured by in-band data are attached (slicers for instance). 533 * Since the write might potentially change the in-band data, such consumers 534 * need to re-evaluate their existence after the writing session closes. 535 * We do this by (offering to) tear them down when the open for write happens 536 * in return for a re-taste when it closes again. 537 * Together with the fact that such consumers grab an 'e' bit whenever they 538 * are open, regardless of mode, this ends up DTRT. 539 */ 540 541void 542g_spoil(struct g_provider *pp, struct g_consumer *cp) 543{ 544 struct g_consumer *cp2; 545 546 g_topology_assert(); 547 548 if (!strcmp(pp->name, "geom.ctl")) 549 return; 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 563static struct g_class * 564g_class_by_name(const 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 576struct g_geom * 577g_insert_geom(const 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->config == 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 614int 615g_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 632void 633g_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 668struct g_class * 669g_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, 0); 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 693struct g_geom * 694g_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, 0); 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 721struct g_provider * 722g_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, 0); 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