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/virstor/g_virstor.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) 2006-2007 Ivan Voras <ivoras@freebsd.org> 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 14 * THIS SOFTWARE IS PROVIDED BY THE AUTHORS AND CONTRIBUTORS ``AS IS'' AND 15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE 18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24 * SUCH DAMAGE. 25 */ 26 27 /* Implementation notes: 28 * - "Components" are wrappers around providers that make up the 29 * virtual storage (i.e. a virstor has "physical" components) 30 */ 31 32 #include <sys/cdefs.h> 33 __FBSDID("$FreeBSD: releng/11.0/sys/geom/virstor/g_virstor.c 298848 2016-04-30 14:41:18Z pfg $"); 34 35 #include <sys/param.h> 36 #include <sys/systm.h> 37 #include <sys/kernel.h> 38 #include <sys/module.h> 39 #include <sys/lock.h> 40 #include <sys/mutex.h> 41 #include <sys/sx.h> 42 #include <sys/bio.h> 43 #include <sys/sbuf.h> 44 #include <sys/sysctl.h> 45 #include <sys/malloc.h> 46 #include <sys/time.h> 47 #include <sys/proc.h> 48 #include <sys/kthread.h> 49 #include <sys/mutex.h> 50 #include <vm/uma.h> 51 #include <geom/geom.h> 52 53 #include <geom/virstor/g_virstor.h> 54 #include <geom/virstor/g_virstor_md.h> 55 56 FEATURE(g_virstor, "GEOM virtual storage support"); 57 58 /* Declare malloc(9) label */ 59 static MALLOC_DEFINE(M_GVIRSTOR, "gvirstor", "GEOM_VIRSTOR Data"); 60 61 /* GEOM class methods */ 62 static g_init_t g_virstor_init; 63 static g_fini_t g_virstor_fini; 64 static g_taste_t g_virstor_taste; 65 static g_ctl_req_t g_virstor_config; 66 static g_ctl_destroy_geom_t g_virstor_destroy_geom; 67 68 /* Declare & initialize class structure ("geom class") */ 69 struct g_class g_virstor_class = { 70 .name = G_VIRSTOR_CLASS_NAME, 71 .version = G_VERSION, 72 .init = g_virstor_init, 73 .fini = g_virstor_fini, 74 .taste = g_virstor_taste, 75 .ctlreq = g_virstor_config, 76 .destroy_geom = g_virstor_destroy_geom 77 /* The .dumpconf and the rest are only usable for a geom instance, so 78 * they will be set when such instance is created. */ 79 }; 80 81 /* Declare sysctl's and loader tunables */ 82 SYSCTL_DECL(_kern_geom); 83 static SYSCTL_NODE(_kern_geom, OID_AUTO, virstor, CTLFLAG_RW, 0, 84 "GEOM_GVIRSTOR information"); 85 86 static u_int g_virstor_debug = 2; /* XXX: lower to 2 when released to public */ 87 SYSCTL_UINT(_kern_geom_virstor, OID_AUTO, debug, CTLFLAG_RWTUN, &g_virstor_debug, 88 0, "Debug level (2=production, 5=normal, 15=excessive)"); 89 90 static u_int g_virstor_chunk_watermark = 100; 91 SYSCTL_UINT(_kern_geom_virstor, OID_AUTO, chunk_watermark, CTLFLAG_RWTUN, 92 &g_virstor_chunk_watermark, 0, 93 "Minimum number of free chunks before issuing administrative warning"); 94 95 static u_int g_virstor_component_watermark = 1; 96 SYSCTL_UINT(_kern_geom_virstor, OID_AUTO, component_watermark, CTLFLAG_RWTUN, 97 &g_virstor_component_watermark, 0, 98 "Minimum number of free components before issuing administrative warning"); 99 100 static int read_metadata(struct g_consumer *, struct g_virstor_metadata *); 101 static void write_metadata(struct g_consumer *, struct g_virstor_metadata *); 102 static int clear_metadata(struct g_virstor_component *); 103 static int add_provider_to_geom(struct g_virstor_softc *, struct g_provider *, 104 struct g_virstor_metadata *); 105 static struct g_geom *create_virstor_geom(struct g_class *, 106 struct g_virstor_metadata *); 107 static void virstor_check_and_run(struct g_virstor_softc *); 108 static u_int virstor_valid_components(struct g_virstor_softc *); 109 static int virstor_geom_destroy(struct g_virstor_softc *, boolean_t, 110 boolean_t); 111 static void remove_component(struct g_virstor_softc *, 112 struct g_virstor_component *, boolean_t); 113 static void bioq_dismantle(struct bio_queue_head *); 114 static int allocate_chunk(struct g_virstor_softc *, 115 struct g_virstor_component **, u_int *, u_int *); 116 static void delay_destroy_consumer(void *, int); 117 static void dump_component(struct g_virstor_component *comp); 118 #if 0 119 static void dump_me(struct virstor_map_entry *me, unsigned int nr); 120 #endif 121 122 static void virstor_ctl_stop(struct gctl_req *, struct g_class *); 123 static void virstor_ctl_add(struct gctl_req *, struct g_class *); 124 static void virstor_ctl_remove(struct gctl_req *, struct g_class *); 125 static struct g_virstor_softc * virstor_find_geom(const struct g_class *, 126 const char *); 127 static void update_metadata(struct g_virstor_softc *); 128 static void fill_metadata(struct g_virstor_softc *, struct g_virstor_metadata *, 129 u_int, u_int); 130 131 static void g_virstor_orphan(struct g_consumer *); 132 static int g_virstor_access(struct g_provider *, int, int, int); 133 static void g_virstor_start(struct bio *); 134 static void g_virstor_dumpconf(struct sbuf *, const char *, struct g_geom *, 135 struct g_consumer *, struct g_provider *); 136 static void g_virstor_done(struct bio *); 137 138 static void invalid_call(void); 139 /* 140 * Initialise GEOM class (per-class callback) 141 */ 142 static void 143 g_virstor_init(struct g_class *mp __unused) 144 { 145 146 /* Catch map struct size mismatch at compile time; Map entries must 147 * fit into MAXPHYS exactly, with no wasted space. */ 148 CTASSERT(VIRSTOR_MAP_BLOCK_ENTRIES*VIRSTOR_MAP_ENTRY_SIZE == MAXPHYS); 149 150 /* Init UMA zones, TAILQ's, other global vars */ 151 } 152 153 /* 154 * Finalise GEOM class (per-class callback) 155 */ 156 static void 157 g_virstor_fini(struct g_class *mp __unused) 158 { 159 160 /* Deinit UMA zones & global vars */ 161 } 162 163 /* 164 * Config (per-class callback) 165 */ 166 static void 167 g_virstor_config(struct gctl_req *req, struct g_class *cp, char const *verb) 168 { 169 uint32_t *version; 170 171 g_topology_assert(); 172 173 version = gctl_get_paraml(req, "version", sizeof(*version)); 174 if (version == NULL) { 175 gctl_error(req, "Failed to get 'version' argument"); 176 return; 177 } 178 if (*version != G_VIRSTOR_VERSION) { 179 gctl_error(req, "Userland and kernel versions out of sync"); 180 return; 181 } 182 183 g_topology_unlock(); 184 if (strcmp(verb, "add") == 0) 185 virstor_ctl_add(req, cp); 186 else if (strcmp(verb, "stop") == 0 || strcmp(verb, "destroy") == 0) 187 virstor_ctl_stop(req, cp); 188 else if (strcmp(verb, "remove") == 0) 189 virstor_ctl_remove(req, cp); 190 else 191 gctl_error(req, "unknown verb: '%s'", verb); 192 g_topology_lock(); 193 } 194 195 /* 196 * "stop" verb from userland 197 */ 198 static void 199 virstor_ctl_stop(struct gctl_req *req, struct g_class *cp) 200 { 201 int *force, *nargs; 202 int i; 203 204 nargs = gctl_get_paraml(req, "nargs", sizeof *nargs); 205 if (nargs == NULL) { 206 gctl_error(req, "Error fetching argument '%s'", "nargs"); 207 return; 208 } 209 if (*nargs < 1) { 210 gctl_error(req, "Invalid number of arguments"); 211 return; 212 } 213 force = gctl_get_paraml(req, "force", sizeof *force); 214 if (force == NULL) { 215 gctl_error(req, "Error fetching argument '%s'", "force"); 216 return; 217 } 218 219 g_topology_lock(); 220 for (i = 0; i < *nargs; i++) { 221 char param[8]; 222 const char *name; 223 struct g_virstor_softc *sc; 224 int error; 225 226 sprintf(param, "arg%d", i); 227 name = gctl_get_asciiparam(req, param); 228 if (name == NULL) { 229 gctl_error(req, "No 'arg%d' argument", i); 230 g_topology_unlock(); 231 return; 232 } 233 sc = virstor_find_geom(cp, name); 234 if (sc == NULL) { 235 gctl_error(req, "Don't know anything about '%s'", name); 236 g_topology_unlock(); 237 return; 238 } 239 240 LOG_MSG(LVL_INFO, "Stopping %s by the userland command", 241 sc->geom->name); 242 update_metadata(sc); 243 if ((error = virstor_geom_destroy(sc, TRUE, TRUE)) != 0) { 244 LOG_MSG(LVL_ERROR, "Cannot destroy %s: %d", 245 sc->geom->name, error); 246 } 247 } 248 g_topology_unlock(); 249 } 250 251 /* 252 * "add" verb from userland - add new component(s) to the structure. 253 * This will be done all at once in here, without going through the 254 * .taste function for new components. 255 */ 256 static void 257 virstor_ctl_add(struct gctl_req *req, struct g_class *cp) 258 { 259 /* Note: while this is going on, I/O is being done on 260 * the g_up and g_down threads. The idea is to make changes 261 * to softc members in a way that can atomically activate 262 * them all at once. */ 263 struct g_virstor_softc *sc; 264 int *hardcode, *nargs; 265 const char *geom_name; /* geom to add a component to */ 266 struct g_consumer *fcp; 267 struct g_virstor_bio_q *bq; 268 u_int added; 269 int error; 270 int i; 271 272 nargs = gctl_get_paraml(req, "nargs", sizeof(*nargs)); 273 if (nargs == NULL) { 274 gctl_error(req, "Error fetching argument '%s'", "nargs"); 275 return; 276 } 277 if (*nargs < 2) { 278 gctl_error(req, "Invalid number of arguments"); 279 return; 280 } 281 hardcode = gctl_get_paraml(req, "hardcode", sizeof(*hardcode)); 282 if (hardcode == NULL) { 283 gctl_error(req, "Error fetching argument '%s'", "hardcode"); 284 return; 285 } 286 287 /* Find "our" geom */ 288 geom_name = gctl_get_asciiparam(req, "arg0"); 289 if (geom_name == NULL) { 290 gctl_error(req, "Error fetching argument '%s'", "geom_name (arg0)"); 291 return; 292 } 293 sc = virstor_find_geom(cp, geom_name); 294 if (sc == NULL) { 295 gctl_error(req, "Don't know anything about '%s'", geom_name); 296 return; 297 } 298 299 if (virstor_valid_components(sc) != sc->n_components) { 300 LOG_MSG(LVL_ERROR, "Cannot add components to incomplete " 301 "virstor %s", sc->geom->name); 302 gctl_error(req, "Virstor %s is incomplete", sc->geom->name); 303 return; 304 } 305 306 fcp = sc->components[0].gcons; 307 added = 0; 308 g_topology_lock(); 309 for (i = 1; i < *nargs; i++) { 310 struct g_virstor_metadata md; 311 char aname[8]; 312 const char *prov_name; 313 struct g_provider *pp; 314 struct g_consumer *cp; 315 u_int nc; 316 u_int j; 317 318 snprintf(aname, sizeof aname, "arg%d", i); 319 prov_name = gctl_get_asciiparam(req, aname); 320 if (prov_name == NULL) { 321 gctl_error(req, "Error fetching argument '%s'", aname); 322 g_topology_unlock(); 323 return; 324 } 325 if (strncmp(prov_name, _PATH_DEV, sizeof(_PATH_DEV) - 1) == 0) 326 prov_name += sizeof(_PATH_DEV) - 1; 327 328 pp = g_provider_by_name(prov_name); 329 if (pp == NULL) { 330 /* This is the most common error so be verbose about it */ 331 if (added != 0) { 332 gctl_error(req, "Invalid provider: '%s' (added" 333 " %u components)", prov_name, added); 334 update_metadata(sc); 335 } else { 336 gctl_error(req, "Invalid provider: '%s'", 337 prov_name); 338 } 339 g_topology_unlock(); 340 return; 341 } 342 cp = g_new_consumer(sc->geom); 343 if (cp == NULL) { 344 gctl_error(req, "Cannot create consumer"); 345 g_topology_unlock(); 346 return; 347 } 348 error = g_attach(cp, pp); 349 if (error != 0) { 350 gctl_error(req, "Cannot attach a consumer to %s", 351 pp->name); 352 g_destroy_consumer(cp); 353 g_topology_unlock(); 354 return; 355 } 356 if (fcp->acr != 0 || fcp->acw != 0 || fcp->ace != 0) { 357 error = g_access(cp, fcp->acr, fcp->acw, fcp->ace); 358 if (error != 0) { 359 gctl_error(req, "Access request failed for %s", 360 pp->name); 361 g_destroy_consumer(cp); 362 g_topology_unlock(); 363 return; 364 } 365 } 366 if (fcp->provider->sectorsize != pp->sectorsize) { 367 gctl_error(req, "Sector size doesn't fit for %s", 368 pp->name); 369 g_destroy_consumer(cp); 370 g_topology_unlock(); 371 return; 372 } 373 for (j = 0; j < sc->n_components; j++) { 374 if (strcmp(sc->components[j].gcons->provider->name, 375 pp->name) == 0) { 376 gctl_error(req, "Component %s already in %s", 377 pp->name, sc->geom->name); 378 g_destroy_consumer(cp); 379 g_topology_unlock(); 380 return; 381 } 382 } 383 sc->components = realloc(sc->components, 384 sizeof(*sc->components) * (sc->n_components + 1), 385 M_GVIRSTOR, M_WAITOK); 386 387 nc = sc->n_components; 388 sc->components[nc].gcons = cp; 389 sc->components[nc].sc = sc; 390 sc->components[nc].index = nc; 391 sc->components[nc].chunk_count = cp->provider->mediasize / 392 sc->chunk_size; 393 sc->components[nc].chunk_next = 0; 394 sc->components[nc].chunk_reserved = 0; 395 396 if (sc->components[nc].chunk_count < 4) { 397 gctl_error(req, "Provider too small: %s", 398 cp->provider->name); 399 g_destroy_consumer(cp); 400 g_topology_unlock(); 401 return; 402 } 403 fill_metadata(sc, &md, nc, *hardcode); 404 write_metadata(cp, &md); 405 /* The new component becomes visible when n_components is 406 * incremented */ 407 sc->n_components++; 408 added++; 409 410 } 411 /* This call to update_metadata() is critical. In case there's a 412 * power failure in the middle of it and some components are updated 413 * while others are not, there will be trouble on next .taste() iff 414 * a non-updated component is detected first */ 415 update_metadata(sc); 416 g_topology_unlock(); 417 LOG_MSG(LVL_INFO, "Added %d component(s) to %s", added, 418 sc->geom->name); 419 /* Fire off BIOs previously queued because there wasn't any 420 * physical space left. If the BIOs still can't be satisfied 421 * they will again be added to the end of the queue (during 422 * which the mutex will be recursed) */ 423 bq = malloc(sizeof(*bq), M_GVIRSTOR, M_WAITOK); 424 bq->bio = NULL; 425 mtx_lock(&sc->delayed_bio_q_mtx); 426 /* First, insert a sentinel to the queue end, so we don't 427 * end up in an infinite loop if there's still no free 428 * space available. */ 429 STAILQ_INSERT_TAIL(&sc->delayed_bio_q, bq, linkage); 430 while (!STAILQ_EMPTY(&sc->delayed_bio_q)) { 431 bq = STAILQ_FIRST(&sc->delayed_bio_q); 432 if (bq->bio != NULL) { 433 g_virstor_start(bq->bio); 434 STAILQ_REMOVE_HEAD(&sc->delayed_bio_q, linkage); 435 free(bq, M_GVIRSTOR); 436 } else { 437 STAILQ_REMOVE_HEAD(&sc->delayed_bio_q, linkage); 438 free(bq, M_GVIRSTOR); 439 break; 440 } 441 } 442 mtx_unlock(&sc->delayed_bio_q_mtx); 443 444 } 445 446 /* 447 * Find a geom handled by the class 448 */ 449 static struct g_virstor_softc * 450 virstor_find_geom(const struct g_class *cp, const char *name) 451 { 452 struct g_geom *gp; 453 454 LIST_FOREACH(gp, &cp->geom, geom) { 455 if (strcmp(name, gp->name) == 0) 456 return (gp->softc); 457 } 458 return (NULL); 459 } 460 461 /* 462 * Update metadata on all components to reflect the current state 463 * of these fields: 464 * - chunk_next 465 * - flags 466 * - md_count 467 * Expects things to be set up so write_metadata() can work, i.e. 468 * the topology lock must be held. 469 */ 470 static void 471 update_metadata(struct g_virstor_softc *sc) 472 { 473 struct g_virstor_metadata md; 474 u_int n; 475 476 if (virstor_valid_components(sc) != sc->n_components) 477 return; /* Incomplete device */ 478 LOG_MSG(LVL_DEBUG, "Updating metadata on components for %s", 479 sc->geom->name); 480 /* Update metadata on components */ 481 g_trace(G_T_TOPOLOGY, "%s(%s, %s)", __func__, 482 sc->geom->class->name, sc->geom->name); 483 g_topology_assert(); 484 for (n = 0; n < sc->n_components; n++) { 485 read_metadata(sc->components[n].gcons, &md); 486 md.chunk_next = sc->components[n].chunk_next; 487 md.flags = sc->components[n].flags; 488 md.md_count = sc->n_components; 489 write_metadata(sc->components[n].gcons, &md); 490 } 491 } 492 493 /* 494 * Fills metadata (struct md) from information stored in softc and the nc'th 495 * component of virstor 496 */ 497 static void 498 fill_metadata(struct g_virstor_softc *sc, struct g_virstor_metadata *md, 499 u_int nc, u_int hardcode) 500 { 501 struct g_virstor_component *c; 502 503 bzero(md, sizeof *md); 504 c = &sc->components[nc]; 505 506 strncpy(md->md_magic, G_VIRSTOR_MAGIC, sizeof md->md_magic); 507 md->md_version = G_VIRSTOR_VERSION; 508 strncpy(md->md_name, sc->geom->name, sizeof md->md_name); 509 md->md_id = sc->id; 510 md->md_virsize = sc->virsize; 511 md->md_chunk_size = sc->chunk_size; 512 md->md_count = sc->n_components; 513 514 if (hardcode) { 515 strncpy(md->provider, c->gcons->provider->name, 516 sizeof md->provider); 517 } 518 md->no = nc; 519 md->provsize = c->gcons->provider->mediasize; 520 md->chunk_count = c->chunk_count; 521 md->chunk_next = c->chunk_next; 522 md->chunk_reserved = c->chunk_reserved; 523 md->flags = c->flags; 524 } 525 526 /* 527 * Remove a component from virstor device. 528 * Can only be done if the component is unallocated. 529 */ 530 static void 531 virstor_ctl_remove(struct gctl_req *req, struct g_class *cp) 532 { 533 /* As this is executed in parallel to I/O, operations on virstor 534 * structures must be as atomic as possible. */ 535 struct g_virstor_softc *sc; 536 int *nargs; 537 const char *geom_name; 538 u_int removed; 539 int i; 540 541 nargs = gctl_get_paraml(req, "nargs", sizeof(*nargs)); 542 if (nargs == NULL) { 543 gctl_error(req, "Error fetching argument '%s'", "nargs"); 544 return; 545 } 546 if (*nargs < 2) { 547 gctl_error(req, "Invalid number of arguments"); 548 return; 549 } 550 /* Find "our" geom */ 551 geom_name = gctl_get_asciiparam(req, "arg0"); 552 if (geom_name == NULL) { 553 gctl_error(req, "Error fetching argument '%s'", 554 "geom_name (arg0)"); 555 return; 556 } 557 sc = virstor_find_geom(cp, geom_name); 558 if (sc == NULL) { 559 gctl_error(req, "Don't know anything about '%s'", geom_name); 560 return; 561 } 562 563 if (virstor_valid_components(sc) != sc->n_components) { 564 LOG_MSG(LVL_ERROR, "Cannot remove components from incomplete " 565 "virstor %s", sc->geom->name); 566 gctl_error(req, "Virstor %s is incomplete", sc->geom->name); 567 return; 568 } 569 570 removed = 0; 571 for (i = 1; i < *nargs; i++) { 572 char param[8]; 573 const char *prov_name; 574 int j, found; 575 struct g_virstor_component *newcomp, *compbak; 576 577 sprintf(param, "arg%d", i); 578 prov_name = gctl_get_asciiparam(req, param); 579 if (prov_name == NULL) { 580 gctl_error(req, "Error fetching argument '%s'", param); 581 return; 582 } 583 if (strncmp(prov_name, _PATH_DEV, sizeof(_PATH_DEV) - 1) == 0) 584 prov_name += sizeof(_PATH_DEV) - 1; 585 586 found = -1; 587 for (j = 0; j < sc->n_components; j++) { 588 if (strcmp(sc->components[j].gcons->provider->name, 589 prov_name) == 0) { 590 found = j; 591 break; 592 } 593 } 594 if (found == -1) { 595 LOG_MSG(LVL_ERROR, "No %s component in %s", 596 prov_name, sc->geom->name); 597 continue; 598 } 599 600 compbak = sc->components; 601 newcomp = malloc(sc->n_components * sizeof(*sc->components), 602 M_GVIRSTOR, M_WAITOK | M_ZERO); 603 bcopy(sc->components, newcomp, found * sizeof(*sc->components)); 604 bcopy(&sc->components[found + 1], newcomp + found, 605 found * sizeof(*sc->components)); 606 if ((sc->components[j].flags & VIRSTOR_PROVIDER_ALLOCATED) != 0) { 607 LOG_MSG(LVL_ERROR, "Allocated provider %s cannot be " 608 "removed from %s", 609 prov_name, sc->geom->name); 610 free(newcomp, M_GVIRSTOR); 611 /* We'll consider this non-fatal error */ 612 continue; 613 } 614 /* Renumerate unallocated components */ 615 for (j = 0; j < sc->n_components-1; j++) { 616 if ((sc->components[j].flags & 617 VIRSTOR_PROVIDER_ALLOCATED) == 0) { 618 sc->components[j].index = j; 619 } 620 } 621 /* This is the critical section. If a component allocation 622 * event happens while both variables are not yet set, 623 * there will be trouble. Something will panic on encountering 624 * NULL sc->components[x].gcomp member. 625 * Luckily, component allocation happens very rarely and 626 * removing components is an abnormal action in any case. */ 627 sc->components = newcomp; 628 sc->n_components--; 629 /* End critical section */ 630 631 g_topology_lock(); 632 if (clear_metadata(&compbak[found]) != 0) { 633 LOG_MSG(LVL_WARNING, "Trouble ahead: cannot clear " 634 "metadata on %s", prov_name); 635 } 636 g_detach(compbak[found].gcons); 637 g_destroy_consumer(compbak[found].gcons); 638 g_topology_unlock(); 639 640 free(compbak, M_GVIRSTOR); 641 642 removed++; 643 } 644 645 /* This call to update_metadata() is critical. In case there's a 646 * power failure in the middle of it and some components are updated 647 * while others are not, there will be trouble on next .taste() iff 648 * a non-updated component is detected first */ 649 g_topology_lock(); 650 update_metadata(sc); 651 g_topology_unlock(); 652 LOG_MSG(LVL_INFO, "Removed %d component(s) from %s", removed, 653 sc->geom->name); 654 } 655 656 /* 657 * Clear metadata sector on component 658 */ 659 static int 660 clear_metadata(struct g_virstor_component *comp) 661 { 662 char *buf; 663 int error; 664 665 LOG_MSG(LVL_INFO, "Clearing metadata on %s", 666 comp->gcons->provider->name); 667 g_topology_assert(); 668 error = g_access(comp->gcons, 0, 1, 0); 669 if (error != 0) 670 return (error); 671 buf = malloc(comp->gcons->provider->sectorsize, M_GVIRSTOR, 672 M_WAITOK | M_ZERO); 673 error = g_write_data(comp->gcons, 674 comp->gcons->provider->mediasize - 675 comp->gcons->provider->sectorsize, 676 buf, 677 comp->gcons->provider->sectorsize); 678 free(buf, M_GVIRSTOR); 679 g_access(comp->gcons, 0, -1, 0); 680 return (error); 681 } 682 683 /* 684 * Destroy geom forcibly. 685 */ 686 static int 687 g_virstor_destroy_geom(struct gctl_req *req __unused, struct g_class *mp, 688 struct g_geom *gp) 689 { 690 struct g_virstor_softc *sc; 691 int exitval; 692 693 sc = gp->softc; 694 KASSERT(sc != NULL, ("%s: NULL sc", __func__)); 695 696 exitval = 0; 697 LOG_MSG(LVL_DEBUG, "%s called for %s, sc=%p", __func__, gp->name, 698 gp->softc); 699 700 if (sc != NULL) { 701 #ifdef INVARIANTS 702 char *buf; 703 int error; 704 off_t off; 705 int isclean, count; 706 int n; 707 708 LOG_MSG(LVL_INFO, "INVARIANTS detected"); 709 LOG_MSG(LVL_INFO, "Verifying allocation " 710 "table for %s", sc->geom->name); 711 count = 0; 712 for (n = 0; n < sc->chunk_count; n++) { 713 if (sc->map[n].flags || VIRSTOR_MAP_ALLOCATED != 0) 714 count++; 715 } 716 LOG_MSG(LVL_INFO, "Device %s has %d allocated chunks", 717 sc->geom->name, count); 718 n = off = count = 0; 719 isclean = 1; 720 if (virstor_valid_components(sc) != sc->n_components) { 721 /* This is a incomplete virstor device (not all 722 * components have been found) */ 723 LOG_MSG(LVL_ERROR, "Device %s is incomplete", 724 sc->geom->name); 725 goto bailout; 726 } 727 error = g_access(sc->components[0].gcons, 1, 0, 0); 728 KASSERT(error == 0, ("%s: g_access failed (%d)", __func__, 729 error)); 730 /* Compare the whole on-disk allocation table with what's 731 * currently in memory */ 732 while (n < sc->chunk_count) { 733 buf = g_read_data(sc->components[0].gcons, off, 734 sc->sectorsize, &error); 735 KASSERT(buf != NULL, ("g_read_data returned NULL (%d) " 736 "for read at %jd", error, off)); 737 if (bcmp(buf, &sc->map[n], sc->sectorsize) != 0) { 738 LOG_MSG(LVL_ERROR, "ERROR in allocation table, " 739 "entry %d, offset %jd", n, off); 740 isclean = 0; 741 count++; 742 } 743 n += sc->me_per_sector; 744 off += sc->sectorsize; 745 g_free(buf); 746 } 747 error = g_access(sc->components[0].gcons, -1, 0, 0); 748 KASSERT(error == 0, ("%s: g_access failed (%d) on exit", 749 __func__, error)); 750 if (isclean != 1) { 751 LOG_MSG(LVL_ERROR, "ALLOCATION TABLE CORRUPTED FOR %s " 752 "(%d sectors don't match, max %zu allocations)", 753 sc->geom->name, count, 754 count * sc->me_per_sector); 755 } else { 756 LOG_MSG(LVL_INFO, "Allocation table ok for %s", 757 sc->geom->name); 758 } 759 bailout: 760 #endif 761 update_metadata(sc); 762 virstor_geom_destroy(sc, FALSE, FALSE); 763 exitval = EAGAIN; 764 } else 765 exitval = 0; 766 return (exitval); 767 } 768 769 /* 770 * Taste event (per-class callback) 771 * Examines a provider and creates geom instances if needed 772 */ 773 static struct g_geom * 774 g_virstor_taste(struct g_class *mp, struct g_provider *pp, int flags) 775 { 776 struct g_virstor_metadata md; 777 struct g_geom *gp; 778 struct g_consumer *cp; 779 struct g_virstor_softc *sc; 780 int error; 781 782 g_trace(G_T_TOPOLOGY, "%s(%s, %s)", __func__, mp->name, pp->name); 783 g_topology_assert(); 784 LOG_MSG(LVL_DEBUG, "Tasting %s", pp->name); 785 786 /* We need a dummy geom to attach a consumer to the given provider */ 787 gp = g_new_geomf(mp, "virstor:taste.helper"); 788 gp->start = (void *)invalid_call; /* XXX: hacked up so the */ 789 gp->access = (void *)invalid_call; /* compiler doesn't complain. */ 790 gp->orphan = (void *)invalid_call; /* I really want these to fail. */ 791 792 cp = g_new_consumer(gp); 793 g_attach(cp, pp); 794 error = read_metadata(cp, &md); 795 g_detach(cp); 796 g_destroy_consumer(cp); 797 g_destroy_geom(gp); 798 799 if (error != 0) 800 return (NULL); 801 802 if (strcmp(md.md_magic, G_VIRSTOR_MAGIC) != 0) 803 return (NULL); 804 if (md.md_version != G_VIRSTOR_VERSION) { 805 LOG_MSG(LVL_ERROR, "Kernel module version invalid " 806 "to handle %s (%s) : %d should be %d", 807 md.md_name, pp->name, md.md_version, G_VIRSTOR_VERSION); 808 return (NULL); 809 } 810 if (md.provsize != pp->mediasize) 811 return (NULL); 812 813 /* If the provider name is hardcoded, use the offered provider only 814 * if it's been offered with its proper name (the one used in 815 * the label command). */ 816 if (md.provider[0] != '\0' && 817 !g_compare_names(md.provider, pp->name)) 818 return (NULL); 819 820 /* Iterate all geoms this class already knows about to see if a new 821 * geom instance of this class needs to be created (in case the provider 822 * is first from a (possibly) multi-consumer geom) or it just needs 823 * to be added to an existing instance. */ 824 sc = NULL; 825 gp = NULL; 826 LIST_FOREACH(gp, &mp->geom, geom) { 827 sc = gp->softc; 828 if (sc == NULL) 829 continue; 830 if (strcmp(md.md_name, sc->geom->name) != 0) 831 continue; 832 if (md.md_id != sc->id) 833 continue; 834 break; 835 } 836 if (gp != NULL) { /* We found an existing geom instance; add to it */ 837 LOG_MSG(LVL_INFO, "Adding %s to %s", pp->name, md.md_name); 838 error = add_provider_to_geom(sc, pp, &md); 839 if (error != 0) { 840 LOG_MSG(LVL_ERROR, "Error adding %s to %s (error %d)", 841 pp->name, md.md_name, error); 842 return (NULL); 843 } 844 } else { /* New geom instance needs to be created */ 845 gp = create_virstor_geom(mp, &md); 846 if (gp == NULL) { 847 LOG_MSG(LVL_ERROR, "Error creating new instance of " 848 "class %s: %s", mp->name, md.md_name); 849 LOG_MSG(LVL_DEBUG, "Error creating %s at %s", 850 md.md_name, pp->name); 851 return (NULL); 852 } 853 sc = gp->softc; 854 LOG_MSG(LVL_INFO, "Adding %s to %s (first found)", pp->name, 855 md.md_name); 856 error = add_provider_to_geom(sc, pp, &md); 857 if (error != 0) { 858 LOG_MSG(LVL_ERROR, "Error adding %s to %s (error %d)", 859 pp->name, md.md_name, error); 860 virstor_geom_destroy(sc, TRUE, FALSE); 861 return (NULL); 862 } 863 } 864 865 return (gp); 866 } 867 868 /* 869 * Destroyes consumer passed to it in arguments. Used as a callback 870 * on g_event queue. 871 */ 872 static void 873 delay_destroy_consumer(void *arg, int flags __unused) 874 { 875 struct g_consumer *c = arg; 876 KASSERT(c != NULL, ("%s: invalid consumer", __func__)); 877 LOG_MSG(LVL_DEBUG, "Consumer %s destroyed with delay", 878 c->provider->name); 879 g_detach(c); 880 g_destroy_consumer(c); 881 } 882 883 /* 884 * Remove a component (consumer) from geom instance; If it's the first 885 * component being removed, orphan the provider to announce geom's being 886 * dismantled 887 */ 888 static void 889 remove_component(struct g_virstor_softc *sc, struct g_virstor_component *comp, 890 boolean_t delay) 891 { 892 struct g_consumer *c; 893 894 KASSERT(comp->gcons != NULL, ("Component with no consumer in %s", 895 sc->geom->name)); 896 c = comp->gcons; 897 898 comp->gcons = NULL; 899 KASSERT(c->provider != NULL, ("%s: no provider", __func__)); 900 LOG_MSG(LVL_DEBUG, "Component %s removed from %s", c->provider->name, 901 sc->geom->name); 902 if (sc->provider != NULL) { 903 /* Whither, GEOM? */ 904 sc->provider->flags |= G_PF_WITHER; 905 g_orphan_provider(sc->provider, ENXIO); 906 sc->provider = NULL; 907 LOG_MSG(LVL_INFO, "Removing provider %s", sc->geom->name); 908 } 909 910 if (c->acr > 0 || c->acw > 0 || c->ace > 0) 911 g_access(c, -c->acr, -c->acw, -c->ace); 912 if (delay) { 913 /* Destroy consumer after it's tasted */ 914 g_post_event(delay_destroy_consumer, c, M_WAITOK, NULL); 915 } else { 916 g_detach(c); 917 g_destroy_consumer(c); 918 } 919 } 920 921 /* 922 * Destroy geom - called internally 923 * See g_virstor_destroy_geom for the other one 924 */ 925 static int 926 virstor_geom_destroy(struct g_virstor_softc *sc, boolean_t force, 927 boolean_t delay) 928 { 929 struct g_provider *pp; 930 struct g_geom *gp; 931 u_int n; 932 933 g_topology_assert(); 934 935 if (sc == NULL) 936 return (ENXIO); 937 938 pp = sc->provider; 939 if (pp != NULL && (pp->acr != 0 || pp->acw != 0 || pp->ace != 0)) { 940 LOG_MSG(force ? LVL_WARNING : LVL_ERROR, 941 "Device %s is still open.", pp->name); 942 if (!force) 943 return (EBUSY); 944 } 945 946 for (n = 0; n < sc->n_components; n++) { 947 if (sc->components[n].gcons != NULL) 948 remove_component(sc, &sc->components[n], delay); 949 } 950 951 gp = sc->geom; 952 gp->softc = NULL; 953 954 KASSERT(sc->provider == NULL, ("Provider still exists for %s", 955 gp->name)); 956 957 /* XXX: This might or might not work, since we're called with 958 * the topology lock held. Also, it might panic the kernel if 959 * the error'd BIO is in softupdates code. */ 960 mtx_lock(&sc->delayed_bio_q_mtx); 961 while (!STAILQ_EMPTY(&sc->delayed_bio_q)) { 962 struct g_virstor_bio_q *bq; 963 bq = STAILQ_FIRST(&sc->delayed_bio_q); 964 bq->bio->bio_error = ENOSPC; 965 g_io_deliver(bq->bio, EIO); 966 STAILQ_REMOVE_HEAD(&sc->delayed_bio_q, linkage); 967 free(bq, M_GVIRSTOR); 968 } 969 mtx_unlock(&sc->delayed_bio_q_mtx); 970 mtx_destroy(&sc->delayed_bio_q_mtx); 971 972 free(sc->map, M_GVIRSTOR); 973 free(sc->components, M_GVIRSTOR); 974 bzero(sc, sizeof *sc); 975 free(sc, M_GVIRSTOR); 976 977 pp = LIST_FIRST(&gp->provider); /* We only offer one provider */ 978 if (pp == NULL || (pp->acr == 0 && pp->acw == 0 && pp->ace == 0)) 979 LOG_MSG(LVL_DEBUG, "Device %s destroyed", gp->name); 980 981 g_wither_geom(gp, ENXIO); 982 983 return (0); 984 } 985 986 /* 987 * Utility function: read metadata & decode. Wants topology lock to be 988 * held. 989 */ 990 static int 991 read_metadata(struct g_consumer *cp, struct g_virstor_metadata *md) 992 { 993 struct g_provider *pp; 994 char *buf; 995 int error; 996 997 g_topology_assert(); 998 error = g_access(cp, 1, 0, 0); 999 if (error != 0) 1000 return (error); 1001 pp = cp->provider; 1002 g_topology_unlock(); 1003 buf = g_read_data(cp, pp->mediasize - pp->sectorsize, pp->sectorsize, 1004 &error); 1005 g_topology_lock(); 1006 g_access(cp, -1, 0, 0); 1007 if (buf == NULL) 1008 return (error); 1009 1010 virstor_metadata_decode(buf, md); 1011 g_free(buf); 1012 1013 return (0); 1014 } 1015 1016 /** 1017 * Utility function: encode & write metadata. Assumes topology lock is 1018 * held. 1019 * 1020 * There is no useful way of recovering from errors in this function, 1021 * not involving panicking the kernel. If the metadata cannot be written 1022 * the most we can do is notify the operator and hope he spots it and 1023 * replaces the broken drive. 1024 */ 1025 static void 1026 write_metadata(struct g_consumer *cp, struct g_virstor_metadata *md) 1027 { 1028 struct g_provider *pp; 1029 char *buf; 1030 int error; 1031 1032 KASSERT(cp != NULL && md != NULL && cp->provider != NULL, 1033 ("Something's fishy in %s", __func__)); 1034 LOG_MSG(LVL_DEBUG, "Writing metadata on %s", cp->provider->name); 1035 g_topology_assert(); 1036 error = g_access(cp, 0, 1, 0); 1037 if (error != 0) { 1038 LOG_MSG(LVL_ERROR, "g_access(0,1,0) failed for %s: %d", 1039 cp->provider->name, error); 1040 return; 1041 } 1042 pp = cp->provider; 1043 1044 buf = malloc(pp->sectorsize, M_GVIRSTOR, M_WAITOK); 1045 virstor_metadata_encode(md, buf); 1046 g_topology_unlock(); 1047 error = g_write_data(cp, pp->mediasize - pp->sectorsize, buf, 1048 pp->sectorsize); 1049 g_topology_lock(); 1050 g_access(cp, 0, -1, 0); 1051 free(buf, M_GVIRSTOR); 1052 1053 if (error != 0) 1054 LOG_MSG(LVL_ERROR, "Error %d writing metadata to %s", 1055 error, cp->provider->name); 1056 } 1057 1058 /* 1059 * Creates a new instance of this GEOM class, initialise softc 1060 */ 1061 static struct g_geom * 1062 create_virstor_geom(struct g_class *mp, struct g_virstor_metadata *md) 1063 { 1064 struct g_geom *gp; 1065 struct g_virstor_softc *sc; 1066 1067 LOG_MSG(LVL_DEBUG, "Creating geom instance for %s (id=%u)", 1068 md->md_name, md->md_id); 1069 1070 if (md->md_count < 1 || md->md_chunk_size < 1 || 1071 md->md_virsize < md->md_chunk_size) { 1072 /* This is bogus configuration, and probably means data is 1073 * somehow corrupted. Panic, maybe? */ 1074 LOG_MSG(LVL_ERROR, "Nonsensical metadata information for %s", 1075 md->md_name); 1076 return (NULL); 1077 } 1078 1079 /* Check if it's already created */ 1080 LIST_FOREACH(gp, &mp->geom, geom) { 1081 sc = gp->softc; 1082 if (sc != NULL && strcmp(sc->geom->name, md->md_name) == 0) { 1083 LOG_MSG(LVL_WARNING, "Geom %s already exists", 1084 md->md_name); 1085 if (sc->id != md->md_id) { 1086 LOG_MSG(LVL_ERROR, 1087 "Some stale or invalid components " 1088 "exist for virstor device named %s. " 1089 "You will need to <CLEAR> all stale " 1090 "components and maybe reconfigure " 1091 "the virstor device. Tune " 1092 "kern.geom.virstor.debug sysctl up " 1093 "for more information.", 1094 sc->geom->name); 1095 } 1096 return (NULL); 1097 } 1098 } 1099 gp = g_new_geomf(mp, "%s", md->md_name); 1100 gp->softc = NULL; /* to circumevent races that test softc */ 1101 1102 gp->start = g_virstor_start; 1103 gp->spoiled = g_virstor_orphan; 1104 gp->orphan = g_virstor_orphan; 1105 gp->access = g_virstor_access; 1106 gp->dumpconf = g_virstor_dumpconf; 1107 1108 sc = malloc(sizeof(*sc), M_GVIRSTOR, M_WAITOK | M_ZERO); 1109 sc->id = md->md_id; 1110 sc->n_components = md->md_count; 1111 sc->components = malloc(sizeof(struct g_virstor_component) * md->md_count, 1112 M_GVIRSTOR, M_WAITOK | M_ZERO); 1113 sc->chunk_size = md->md_chunk_size; 1114 sc->virsize = md->md_virsize; 1115 STAILQ_INIT(&sc->delayed_bio_q); 1116 mtx_init(&sc->delayed_bio_q_mtx, "gvirstor_delayed_bio_q_mtx", 1117 "gvirstor", MTX_DEF | MTX_RECURSE); 1118 1119 sc->geom = gp; 1120 sc->provider = NULL; /* virstor_check_and_run will create it */ 1121 gp->softc = sc; 1122 1123 LOG_MSG(LVL_ANNOUNCE, "Device %s created", sc->geom->name); 1124 1125 return (gp); 1126 } 1127 1128 /* 1129 * Add provider to a GEOM class instance 1130 */ 1131 static int 1132 add_provider_to_geom(struct g_virstor_softc *sc, struct g_provider *pp, 1133 struct g_virstor_metadata *md) 1134 { 1135 struct g_virstor_component *component; 1136 struct g_consumer *cp, *fcp; 1137 struct g_geom *gp; 1138 int error; 1139 1140 if (md->no >= sc->n_components) 1141 return (EINVAL); 1142 1143 /* "Current" compontent */ 1144 component = &(sc->components[md->no]); 1145 if (component->gcons != NULL) 1146 return (EEXIST); 1147 1148 gp = sc->geom; 1149 fcp = LIST_FIRST(&gp->consumer); 1150 1151 cp = g_new_consumer(gp); 1152 error = g_attach(cp, pp); 1153 1154 if (error != 0) { 1155 g_destroy_consumer(cp); 1156 return (error); 1157 } 1158 1159 if (fcp != NULL) { 1160 if (fcp->provider->sectorsize != pp->sectorsize) { 1161 /* TODO: this can be made to work */ 1162 LOG_MSG(LVL_ERROR, "Provider %s of %s has invalid " 1163 "sector size (%d)", pp->name, sc->geom->name, 1164 pp->sectorsize); 1165 return (EINVAL); 1166 } 1167 if (fcp->acr > 0 || fcp->acw || fcp->ace > 0) { 1168 /* Replicate access permissions from first "live" consumer 1169 * to the new one */ 1170 error = g_access(cp, fcp->acr, fcp->acw, fcp->ace); 1171 if (error != 0) { 1172 g_detach(cp); 1173 g_destroy_consumer(cp); 1174 return (error); 1175 } 1176 } 1177 } 1178 1179 /* Bring up a new component */ 1180 cp->private = component; 1181 component->gcons = cp; 1182 component->sc = sc; 1183 component->index = md->no; 1184 component->chunk_count = md->chunk_count; 1185 component->chunk_next = md->chunk_next; 1186 component->chunk_reserved = md->chunk_reserved; 1187 component->flags = md->flags; 1188 1189 LOG_MSG(LVL_DEBUG, "%s attached to %s", pp->name, sc->geom->name); 1190 1191 virstor_check_and_run(sc); 1192 return (0); 1193 } 1194 1195 /* 1196 * Check if everything's ready to create the geom provider & device entry, 1197 * create and start provider. 1198 * Called ultimately by .taste, from g_event thread 1199 */ 1200 static void 1201 virstor_check_and_run(struct g_virstor_softc *sc) 1202 { 1203 off_t off; 1204 size_t n, count; 1205 int index; 1206 int error; 1207 1208 if (virstor_valid_components(sc) != sc->n_components) 1209 return; 1210 1211 if (virstor_valid_components(sc) == 0) { 1212 /* This is actually a candidate for panic() */ 1213 LOG_MSG(LVL_ERROR, "No valid components for %s?", 1214 sc->provider->name); 1215 return; 1216 } 1217 1218 sc->sectorsize = sc->components[0].gcons->provider->sectorsize; 1219 1220 /* Initialise allocation map from the first consumer */ 1221 sc->chunk_count = sc->virsize / sc->chunk_size; 1222 if (sc->chunk_count * (off_t)sc->chunk_size != sc->virsize) { 1223 LOG_MSG(LVL_WARNING, "Device %s truncated to %ju bytes", 1224 sc->provider->name, 1225 sc->chunk_count * (off_t)sc->chunk_size); 1226 } 1227 sc->map_size = sc->chunk_count * sizeof *(sc->map); 1228 /* The following allocation is in order of 4MB - 8MB */ 1229 sc->map = malloc(sc->map_size, M_GVIRSTOR, M_WAITOK); 1230 KASSERT(sc->map != NULL, ("%s: Memory allocation error (%zu bytes) for %s", 1231 __func__, sc->map_size, sc->provider->name)); 1232 sc->map_sectors = sc->map_size / sc->sectorsize; 1233 1234 count = 0; 1235 for (n = 0; n < sc->n_components; n++) 1236 count += sc->components[n].chunk_count; 1237 LOG_MSG(LVL_INFO, "Device %s has %zu physical chunks and %zu virtual " 1238 "(%zu KB chunks)", 1239 sc->geom->name, count, sc->chunk_count, sc->chunk_size / 1024); 1240 1241 error = g_access(sc->components[0].gcons, 1, 0, 0); 1242 if (error != 0) { 1243 LOG_MSG(LVL_ERROR, "Cannot acquire read access for %s to " 1244 "read allocation map for %s", 1245 sc->components[0].gcons->provider->name, 1246 sc->geom->name); 1247 return; 1248 } 1249 /* Read in the allocation map */ 1250 LOG_MSG(LVL_DEBUG, "Reading map for %s from %s", sc->geom->name, 1251 sc->components[0].gcons->provider->name); 1252 off = count = n = 0; 1253 while (count < sc->map_size) { 1254 struct g_virstor_map_entry *mapbuf; 1255 size_t bs; 1256 1257 bs = MIN(MAXPHYS, sc->map_size - count); 1258 if (bs % sc->sectorsize != 0) { 1259 /* Check for alignment errors */ 1260 bs = rounddown(bs, sc->sectorsize); 1261 if (bs == 0) 1262 break; 1263 LOG_MSG(LVL_ERROR, "Trouble: map is not sector-aligned " 1264 "for %s on %s", sc->geom->name, 1265 sc->components[0].gcons->provider->name); 1266 } 1267 mapbuf = g_read_data(sc->components[0].gcons, off, bs, &error); 1268 if (mapbuf == NULL) { 1269 free(sc->map, M_GVIRSTOR); 1270 LOG_MSG(LVL_ERROR, "Error reading allocation map " 1271 "for %s from %s (offset %ju) (error %d)", 1272 sc->geom->name, 1273 sc->components[0].gcons->provider->name, 1274 off, error); 1275 return; 1276 } 1277 1278 bcopy(mapbuf, &sc->map[n], bs); 1279 off += bs; 1280 count += bs; 1281 n += bs / sizeof *(sc->map); 1282 g_free(mapbuf); 1283 } 1284 g_access(sc->components[0].gcons, -1, 0, 0); 1285 LOG_MSG(LVL_DEBUG, "Read map for %s", sc->geom->name); 1286 1287 /* find first component with allocatable chunks */ 1288 index = -1; 1289 for (n = 0; n < sc->n_components; n++) { 1290 if (sc->components[n].chunk_next < 1291 sc->components[n].chunk_count) { 1292 index = n; 1293 break; 1294 } 1295 } 1296 if (index == -1) 1297 /* not found? set it to the last component and handle it 1298 * later */ 1299 index = sc->n_components - 1; 1300 1301 if (index >= sc->n_components - g_virstor_component_watermark - 1) { 1302 LOG_MSG(LVL_WARNING, "Device %s running out of components " 1303 "(%d/%u: %s)", sc->geom->name, 1304 index+1, 1305 sc->n_components, 1306 sc->components[index].gcons->provider->name); 1307 } 1308 sc->curr_component = index; 1309 1310 if (sc->components[index].chunk_next >= 1311 sc->components[index].chunk_count - g_virstor_chunk_watermark) { 1312 LOG_MSG(LVL_WARNING, 1313 "Component %s of %s is running out of free space " 1314 "(%u chunks left)", 1315 sc->components[index].gcons->provider->name, 1316 sc->geom->name, sc->components[index].chunk_count - 1317 sc->components[index].chunk_next); 1318 } 1319 1320 sc->me_per_sector = sc->sectorsize / sizeof *(sc->map); 1321 if (sc->sectorsize % sizeof *(sc->map) != 0) { 1322 LOG_MSG(LVL_ERROR, 1323 "%s: Map entries don't fit exactly in a sector (%s)", 1324 __func__, sc->geom->name); 1325 return; 1326 } 1327 1328 /* Recalculate allocated chunks in components & at the same time 1329 * verify map data is sane. We could trust metadata on this, but 1330 * we want to make sure. */ 1331 for (n = 0; n < sc->n_components; n++) 1332 sc->components[n].chunk_next = sc->components[n].chunk_reserved; 1333 1334 for (n = 0; n < sc->chunk_count; n++) { 1335 if (sc->map[n].provider_no >= sc->n_components || 1336 sc->map[n].provider_chunk >= 1337 sc->components[sc->map[n].provider_no].chunk_count) { 1338 LOG_MSG(LVL_ERROR, "%s: Invalid entry %u in map for %s", 1339 __func__, (u_int)n, sc->geom->name); 1340 LOG_MSG(LVL_ERROR, "%s: provider_no: %u, n_components: %u" 1341 " provider_chunk: %u, chunk_count: %u", __func__, 1342 sc->map[n].provider_no, sc->n_components, 1343 sc->map[n].provider_chunk, 1344 sc->components[sc->map[n].provider_no].chunk_count); 1345 return; 1346 } 1347 if (sc->map[n].flags & VIRSTOR_MAP_ALLOCATED) 1348 sc->components[sc->map[n].provider_no].chunk_next++; 1349 } 1350 1351 sc->provider = g_new_providerf(sc->geom, "virstor/%s", 1352 sc->geom->name); 1353 1354 sc->provider->sectorsize = sc->sectorsize; 1355 sc->provider->mediasize = sc->virsize; 1356 g_error_provider(sc->provider, 0); 1357 1358 LOG_MSG(LVL_INFO, "%s activated", sc->provider->name); 1359 LOG_MSG(LVL_DEBUG, "%s starting with current component %u, starting " 1360 "chunk %u", sc->provider->name, sc->curr_component, 1361 sc->components[sc->curr_component].chunk_next); 1362 } 1363 1364 /* 1365 * Returns count of active providers in this geom instance 1366 */ 1367 static u_int 1368 virstor_valid_components(struct g_virstor_softc *sc) 1369 { 1370 unsigned int nc, i; 1371 1372 nc = 0; 1373 KASSERT(sc != NULL, ("%s: softc is NULL", __func__)); 1374 KASSERT(sc->components != NULL, ("%s: sc->components is NULL", __func__)); 1375 for (i = 0; i < sc->n_components; i++) 1376 if (sc->components[i].gcons != NULL) 1377 nc++; 1378 return (nc); 1379 } 1380 1381 /* 1382 * Called when the consumer gets orphaned (?) 1383 */ 1384 static void 1385 g_virstor_orphan(struct g_consumer *cp) 1386 { 1387 struct g_virstor_softc *sc; 1388 struct g_virstor_component *comp; 1389 struct g_geom *gp; 1390 1391 g_topology_assert(); 1392 gp = cp->geom; 1393 sc = gp->softc; 1394 if (sc == NULL) 1395 return; 1396 1397 comp = cp->private; 1398 KASSERT(comp != NULL, ("%s: No component in private part of consumer", 1399 __func__)); 1400 remove_component(sc, comp, FALSE); 1401 if (virstor_valid_components(sc) == 0) 1402 virstor_geom_destroy(sc, TRUE, FALSE); 1403 } 1404 1405 /* 1406 * Called to notify geom when it's been opened, and for what intent 1407 */ 1408 static int 1409 g_virstor_access(struct g_provider *pp, int dr, int dw, int de) 1410 { 1411 struct g_consumer *c; 1412 struct g_virstor_softc *sc; 1413 struct g_geom *gp; 1414 int error; 1415 1416 KASSERT(pp != NULL, ("%s: NULL provider", __func__)); 1417 gp = pp->geom; 1418 KASSERT(gp != NULL, ("%s: NULL geom", __func__)); 1419 sc = gp->softc; 1420 1421 if (sc == NULL) { 1422 /* It seems that .access can be called with negative dr,dw,dx 1423 * in this case but I want to check for myself */ 1424 LOG_MSG(LVL_WARNING, "access(%d, %d, %d) for %s", 1425 dr, dw, de, pp->name); 1426 /* This should only happen when geom is withered so 1427 * allow only negative requests */ 1428 KASSERT(dr <= 0 && dw <= 0 && de <= 0, 1429 ("%s: Positive access for %s", __func__, pp->name)); 1430 if (pp->acr + dr == 0 && pp->acw + dw == 0 && pp->ace + de == 0) 1431 LOG_MSG(LVL_DEBUG, "Device %s definitely destroyed", 1432 pp->name); 1433 return (0); 1434 } 1435 1436 /* Grab an exclusive bit to propagate on our consumers on first open */ 1437 if (pp->acr == 0 && pp->acw == 0 && pp->ace == 0) 1438 de++; 1439 /* ... drop it on close */ 1440 if (pp->acr + dr == 0 && pp->acw + dw == 0 && pp->ace + de == 0) { 1441 de--; 1442 update_metadata(sc); /* Writes statistical information */ 1443 } 1444 1445 error = ENXIO; 1446 LIST_FOREACH(c, &gp->consumer, consumer) { 1447 KASSERT(c != NULL, ("%s: consumer is NULL", __func__)); 1448 error = g_access(c, dr, dw, de); 1449 if (error != 0) { 1450 struct g_consumer *c2; 1451 1452 /* Backout earlier changes */ 1453 LIST_FOREACH(c2, &gp->consumer, consumer) { 1454 if (c2 == c) /* all eariler components fixed */ 1455 return (error); 1456 g_access(c2, -dr, -dw, -de); 1457 } 1458 } 1459 } 1460 1461 return (error); 1462 } 1463 1464 /* 1465 * Generate XML dump of current state 1466 */ 1467 static void 1468 g_virstor_dumpconf(struct sbuf *sb, const char *indent, struct g_geom *gp, 1469 struct g_consumer *cp, struct g_provider *pp) 1470 { 1471 struct g_virstor_softc *sc; 1472 1473 g_topology_assert(); 1474 sc = gp->softc; 1475 1476 if (sc == NULL || pp != NULL) 1477 return; 1478 1479 if (cp != NULL) { 1480 /* For each component */ 1481 struct g_virstor_component *comp; 1482 1483 comp = cp->private; 1484 if (comp == NULL) 1485 return; 1486 sbuf_printf(sb, "%s<ComponentIndex>%u</ComponentIndex>\n", 1487 indent, comp->index); 1488 sbuf_printf(sb, "%s<ChunkCount>%u</ChunkCount>\n", 1489 indent, comp->chunk_count); 1490 sbuf_printf(sb, "%s<ChunksUsed>%u</ChunksUsed>\n", 1491 indent, comp->chunk_next); 1492 sbuf_printf(sb, "%s<ChunksReserved>%u</ChunksReserved>\n", 1493 indent, comp->chunk_reserved); 1494 sbuf_printf(sb, "%s<StorageFree>%u%%</StorageFree>\n", 1495 indent, 1496 comp->chunk_next > 0 ? 100 - 1497 ((comp->chunk_next + comp->chunk_reserved) * 100) / 1498 comp->chunk_count : 100); 1499 } else { 1500 /* For the whole thing */ 1501 u_int count, used, i; 1502 off_t size; 1503 1504 count = used = size = 0; 1505 for (i = 0; i < sc->n_components; i++) { 1506 if (sc->components[i].gcons != NULL) { 1507 count += sc->components[i].chunk_count; 1508 used += sc->components[i].chunk_next + 1509 sc->components[i].chunk_reserved; 1510 size += sc->components[i].gcons-> 1511 provider->mediasize; 1512 } 1513 } 1514 1515 sbuf_printf(sb, "%s<Status>" 1516 "Components=%u, Online=%u</Status>\n", indent, 1517 sc->n_components, virstor_valid_components(sc)); 1518 sbuf_printf(sb, "%s<State>%u%% physical free</State>\n", 1519 indent, 100-(used * 100) / count); 1520 sbuf_printf(sb, "%s<ChunkSize>%zu</ChunkSize>\n", indent, 1521 sc->chunk_size); 1522 sbuf_printf(sb, "%s<PhysicalFree>%u%%</PhysicalFree>\n", 1523 indent, used > 0 ? 100 - (used * 100) / count : 100); 1524 sbuf_printf(sb, "%s<ChunkPhysicalCount>%u</ChunkPhysicalCount>\n", 1525 indent, count); 1526 sbuf_printf(sb, "%s<ChunkVirtualCount>%zu</ChunkVirtualCount>\n", 1527 indent, sc->chunk_count); 1528 sbuf_printf(sb, "%s<PhysicalBacking>%zu%%</PhysicalBacking>\n", 1529 indent, 1530 (count * 100) / sc->chunk_count); 1531 sbuf_printf(sb, "%s<PhysicalBackingSize>%jd</PhysicalBackingSize>\n", 1532 indent, size); 1533 sbuf_printf(sb, "%s<VirtualSize>%jd</VirtualSize>\n", indent, 1534 sc->virsize); 1535 } 1536 } 1537 1538 /* 1539 * GEOM .done handler 1540 * Can't use standard handler because one requested IO may 1541 * fork into additional data IOs 1542 */ 1543 static void 1544 g_virstor_done(struct bio *b) 1545 { 1546 struct g_virstor_softc *sc; 1547 struct bio *parent_b; 1548 1549 parent_b = b->bio_parent; 1550 sc = parent_b->bio_to->geom->softc; 1551 1552 if (b->bio_error != 0) { 1553 LOG_MSG(LVL_ERROR, "Error %d for offset=%ju, length=%ju, %s", 1554 b->bio_error, b->bio_offset, b->bio_length, 1555 b->bio_to->name); 1556 if (parent_b->bio_error == 0) 1557 parent_b->bio_error = b->bio_error; 1558 } 1559 1560 parent_b->bio_inbed++; 1561 parent_b->bio_completed += b->bio_completed; 1562 1563 if (parent_b->bio_children == parent_b->bio_inbed) { 1564 parent_b->bio_completed = parent_b->bio_length; 1565 g_io_deliver(parent_b, parent_b->bio_error); 1566 } 1567 g_destroy_bio(b); 1568 } 1569 1570 /* 1571 * I/O starts here 1572 * Called in g_down thread 1573 */ 1574 static void 1575 g_virstor_start(struct bio *b) 1576 { 1577 struct g_virstor_softc *sc; 1578 struct g_virstor_component *comp; 1579 struct bio *cb; 1580 struct g_provider *pp; 1581 char *addr; 1582 off_t offset, length; 1583 struct bio_queue_head bq; 1584 size_t chunk_size; /* cached for convenience */ 1585 u_int count; 1586 1587 pp = b->bio_to; 1588 sc = pp->geom->softc; 1589 KASSERT(sc != NULL, ("%s: no softc (error=%d, device=%s)", __func__, 1590 b->bio_to->error, b->bio_to->name)); 1591 1592 LOG_REQ(LVL_MOREDEBUG, b, "%s", __func__); 1593 1594 switch (b->bio_cmd) { 1595 case BIO_READ: 1596 case BIO_WRITE: 1597 case BIO_DELETE: 1598 break; 1599 default: 1600 g_io_deliver(b, EOPNOTSUPP); 1601 return; 1602 } 1603 1604 LOG_MSG(LVL_DEBUG2, "BIO arrived, size=%ju", b->bio_length); 1605 bioq_init(&bq); 1606 1607 chunk_size = sc->chunk_size; 1608 addr = b->bio_data; 1609 offset = b->bio_offset; /* virtual offset and length */ 1610 length = b->bio_length; 1611 1612 while (length > 0) { 1613 size_t chunk_index, in_chunk_offset, in_chunk_length; 1614 struct virstor_map_entry *me; 1615 1616 chunk_index = offset / chunk_size; /* round downwards */ 1617 in_chunk_offset = offset % chunk_size; 1618 in_chunk_length = min(length, chunk_size - in_chunk_offset); 1619 LOG_MSG(LVL_DEBUG, "Mapped %s(%ju, %ju) to (%zu,%zu,%zu)", 1620 b->bio_cmd == BIO_READ ? "R" : "W", 1621 offset, length, 1622 chunk_index, in_chunk_offset, in_chunk_length); 1623 me = &sc->map[chunk_index]; 1624 1625 if (b->bio_cmd == BIO_READ || b->bio_cmd == BIO_DELETE) { 1626 if ((me->flags & VIRSTOR_MAP_ALLOCATED) == 0) { 1627 /* Reads from unallocated chunks return zeroed 1628 * buffers */ 1629 if (b->bio_cmd == BIO_READ) 1630 bzero(addr, in_chunk_length); 1631 } else { 1632 comp = &sc->components[me->provider_no]; 1633 1634 cb = g_clone_bio(b); 1635 if (cb == NULL) { 1636 bioq_dismantle(&bq); 1637 if (b->bio_error == 0) 1638 b->bio_error = ENOMEM; 1639 g_io_deliver(b, b->bio_error); 1640 return; 1641 } 1642 cb->bio_to = comp->gcons->provider; 1643 cb->bio_done = g_virstor_done; 1644 cb->bio_offset = 1645 (off_t)me->provider_chunk * (off_t)chunk_size 1646 + in_chunk_offset; 1647 cb->bio_length = in_chunk_length; 1648 cb->bio_data = addr; 1649 cb->bio_caller1 = comp; 1650 bioq_disksort(&bq, cb); 1651 } 1652 } else { /* handle BIO_WRITE */ 1653 KASSERT(b->bio_cmd == BIO_WRITE, 1654 ("%s: Unknown command %d", __func__, 1655 b->bio_cmd)); 1656 1657 if ((me->flags & VIRSTOR_MAP_ALLOCATED) == 0) { 1658 /* We have a virtual chunk, represented by 1659 * the "me" entry, but it's not yet allocated 1660 * (tied to) a physical chunk. So do it now. */ 1661 struct virstor_map_entry *data_me; 1662 u_int phys_chunk, comp_no; 1663 off_t s_offset; 1664 int error; 1665 1666 error = allocate_chunk(sc, &comp, &comp_no, 1667 &phys_chunk); 1668 if (error != 0) { 1669 /* We cannot allocate a physical chunk 1670 * to satisfy this request, so we'll 1671 * delay it to when we can... 1672 * XXX: this will prevent the fs from 1673 * being umounted! */ 1674 struct g_virstor_bio_q *biq; 1675 biq = malloc(sizeof *biq, M_GVIRSTOR, 1676 M_NOWAIT); 1677 if (biq == NULL) { 1678 bioq_dismantle(&bq); 1679 if (b->bio_error == 0) 1680 b->bio_error = ENOMEM; 1681 g_io_deliver(b, b->bio_error); 1682 return; 1683 } 1684 biq->bio = b; 1685 mtx_lock(&sc->delayed_bio_q_mtx); 1686 STAILQ_INSERT_TAIL(&sc->delayed_bio_q, 1687 biq, linkage); 1688 mtx_unlock(&sc->delayed_bio_q_mtx); 1689 LOG_MSG(LVL_WARNING, "Delaying BIO " 1690 "(size=%ju) until free physical " 1691 "space can be found on %s", 1692 b->bio_length, 1693 sc->provider->name); 1694 return; 1695 } 1696 LOG_MSG(LVL_DEBUG, "Allocated chunk %u on %s " 1697 "for %s", 1698 phys_chunk, 1699 comp->gcons->provider->name, 1700 sc->provider->name); 1701 1702 me->provider_no = comp_no; 1703 me->provider_chunk = phys_chunk; 1704 me->flags |= VIRSTOR_MAP_ALLOCATED; 1705 1706 cb = g_clone_bio(b); 1707 if (cb == NULL) { 1708 me->flags &= ~VIRSTOR_MAP_ALLOCATED; 1709 me->provider_no = 0; 1710 me->provider_chunk = 0; 1711 bioq_dismantle(&bq); 1712 if (b->bio_error == 0) 1713 b->bio_error = ENOMEM; 1714 g_io_deliver(b, b->bio_error); 1715 return; 1716 } 1717 1718 /* The allocation table is stored continuously 1719 * at the start of the drive. We need to 1720 * calculate the offset of the sector that holds 1721 * this map entry both on the drive and in the 1722 * map array. 1723 * sc_offset will end up pointing to the drive 1724 * sector. */ 1725 s_offset = chunk_index * sizeof *me; 1726 s_offset = rounddown(s_offset, sc->sectorsize); 1727 1728 /* data_me points to map entry sector 1729 * in memory (analogous to offset) */ 1730 data_me = &sc->map[rounddown(chunk_index, 1731 sc->me_per_sector)]; 1732 1733 /* Commit sector with map entry to storage */ 1734 cb->bio_to = sc->components[0].gcons->provider; 1735 cb->bio_done = g_virstor_done; 1736 cb->bio_offset = s_offset; 1737 cb->bio_data = (char *)data_me; 1738 cb->bio_length = sc->sectorsize; 1739 cb->bio_caller1 = &sc->components[0]; 1740 bioq_disksort(&bq, cb); 1741 } 1742 1743 comp = &sc->components[me->provider_no]; 1744 cb = g_clone_bio(b); 1745 if (cb == NULL) { 1746 bioq_dismantle(&bq); 1747 if (b->bio_error == 0) 1748 b->bio_error = ENOMEM; 1749 g_io_deliver(b, b->bio_error); 1750 return; 1751 } 1752 /* Finally, handle the data */ 1753 cb->bio_to = comp->gcons->provider; 1754 cb->bio_done = g_virstor_done; 1755 cb->bio_offset = (off_t)me->provider_chunk*(off_t)chunk_size + 1756 in_chunk_offset; 1757 cb->bio_length = in_chunk_length; 1758 cb->bio_data = addr; 1759 cb->bio_caller1 = comp; 1760 bioq_disksort(&bq, cb); 1761 } 1762 addr += in_chunk_length; 1763 length -= in_chunk_length; 1764 offset += in_chunk_length; 1765 } 1766 1767 /* Fire off bio's here */ 1768 count = 0; 1769 for (cb = bioq_first(&bq); cb != NULL; cb = bioq_first(&bq)) { 1770 bioq_remove(&bq, cb); 1771 LOG_REQ(LVL_MOREDEBUG, cb, "Firing request"); 1772 comp = cb->bio_caller1; 1773 cb->bio_caller1 = NULL; 1774 LOG_MSG(LVL_DEBUG, " firing bio, offset=%ju, length=%ju", 1775 cb->bio_offset, cb->bio_length); 1776 g_io_request(cb, comp->gcons); 1777 count++; 1778 } 1779 if (count == 0) { /* We handled everything locally */ 1780 b->bio_completed = b->bio_length; 1781 g_io_deliver(b, 0); 1782 } 1783 1784 } 1785 1786 /* 1787 * Allocate a chunk from a physical provider. Returns physical component, 1788 * chunk index relative to the component and the component's index. 1789 */ 1790 static int 1791 allocate_chunk(struct g_virstor_softc *sc, struct g_virstor_component **comp, 1792 u_int *comp_no_p, u_int *chunk) 1793 { 1794 u_int comp_no; 1795 1796 KASSERT(sc->curr_component < sc->n_components, 1797 ("%s: Invalid curr_component: %u", __func__, sc->curr_component)); 1798 1799 comp_no = sc->curr_component; 1800 *comp = &sc->components[comp_no]; 1801 dump_component(*comp); 1802 if ((*comp)->chunk_next >= (*comp)->chunk_count) { 1803 /* This component is full. Allocate next component */ 1804 if (comp_no >= sc->n_components-1) { 1805 LOG_MSG(LVL_ERROR, "All physical space allocated for %s", 1806 sc->geom->name); 1807 return (-1); 1808 } 1809 (*comp)->flags &= ~VIRSTOR_PROVIDER_CURRENT; 1810 sc->curr_component = ++comp_no; 1811 1812 *comp = &sc->components[comp_no]; 1813 if (comp_no >= sc->n_components - g_virstor_component_watermark-1) 1814 LOG_MSG(LVL_WARNING, "Device %s running out of components " 1815 "(switching to %u/%u: %s)", sc->geom->name, 1816 comp_no+1, sc->n_components, 1817 (*comp)->gcons->provider->name); 1818 /* Take care not to overwrite reserved chunks */ 1819 if ( (*comp)->chunk_reserved > 0 && 1820 (*comp)->chunk_next < (*comp)->chunk_reserved) 1821 (*comp)->chunk_next = (*comp)->chunk_reserved; 1822 1823 (*comp)->flags |= 1824 VIRSTOR_PROVIDER_ALLOCATED | VIRSTOR_PROVIDER_CURRENT; 1825 dump_component(*comp); 1826 *comp_no_p = comp_no; 1827 *chunk = (*comp)->chunk_next++; 1828 } else { 1829 *comp_no_p = comp_no; 1830 *chunk = (*comp)->chunk_next++; 1831 } 1832 return (0); 1833 } 1834 1835 /* Dump a component */ 1836 static void 1837 dump_component(struct g_virstor_component *comp) 1838 { 1839 1840 if (g_virstor_debug < LVL_DEBUG2) 1841 return; 1842 printf("Component %d: %s\n", comp->index, comp->gcons->provider->name); 1843 printf(" chunk_count: %u\n", comp->chunk_count); 1844 printf(" chunk_next: %u\n", comp->chunk_next); 1845 printf(" flags: %u\n", comp->flags); 1846 } 1847 1848 #if 0 1849 /* Dump a map entry */ 1850 static void 1851 dump_me(struct virstor_map_entry *me, unsigned int nr) 1852 { 1853 if (g_virstor_debug < LVL_DEBUG) 1854 return; 1855 printf("VIRT. CHUNK #%d: ", nr); 1856 if ((me->flags & VIRSTOR_MAP_ALLOCATED) == 0) 1857 printf("(unallocated)\n"); 1858 else 1859 printf("allocated at provider %u, provider_chunk %u\n", 1860 me->provider_no, me->provider_chunk); 1861 } 1862 #endif 1863 1864 /* 1865 * Dismantle bio_queue and destroy its components 1866 */ 1867 static void 1868 bioq_dismantle(struct bio_queue_head *bq) 1869 { 1870 struct bio *b; 1871 1872 for (b = bioq_first(bq); b != NULL; b = bioq_first(bq)) { 1873 bioq_remove(bq, b); 1874 g_destroy_bio(b); 1875 } 1876 } 1877 1878 /* 1879 * The function that shouldn't be called. 1880 * When this is called, the stack is already garbled because of 1881 * argument mismatch. There's nothing to do now but panic, which is 1882 * accidentally the whole purpose of this function. 1883 * Motivation: to guard from accidentally calling geom methods when 1884 * they shouldn't be called. (see g_..._taste) 1885 */ 1886 static void 1887 invalid_call(void) 1888 { 1889 panic("invalid_call() has just been called. Something's fishy here."); 1890 } 1891 1892 DECLARE_GEOM_CLASS(g_virstor_class, g_virstor); /* Let there be light */
Cache object: 8f30ccef4ceb6470a35c54a15af77863
[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]