geom_io.c revision 193981
1/*- 2 * Copyright (c) 2002 Poul-Henning Kamp 3 * Copyright (c) 2002 Networks Associates Technology, Inc. 4 * All rights reserved. 5 * 6 * This software was developed for the FreeBSD Project by Poul-Henning Kamp 7 * and NAI Labs, the Security Research Division of Network Associates, Inc. 8 * under DARPA/SPAWAR contract N66001-01-C-8035 ("CBOSS"), as part of the 9 * DARPA CHATS research program. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in the 18 * documentation and/or other materials provided with the distribution. 19 * 3. The names of the authors may not be used to endorse or promote 20 * products derived from this software without specific prior written 21 * permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 */ 35 36#include <sys/cdefs.h> 37__FBSDID("$FreeBSD: head/sys/geom/geom_io.c 193981 2009-06-11 09:55:26Z luigi $"); 38 39#include <sys/param.h> 40#include <sys/systm.h> 41#include <sys/kernel.h> 42#include <sys/malloc.h> 43#include <sys/bio.h> 44#include <sys/ktr.h> 45#include <sys/proc.h> 46#include <sys/stack.h> 47 48#include <sys/errno.h> 49#include <geom/geom.h> 50#include <geom/geom_int.h> 51#include <sys/devicestat.h> 52 53#include <vm/uma.h> 54 55static struct g_bioq g_bio_run_down; 56static struct g_bioq g_bio_run_up; 57static struct g_bioq g_bio_run_task; 58 59static u_int pace; 60static uma_zone_t biozone; 61 62/* 63 * The head of the list of classifiers used in g_io_request. 64 * Use g_register_classifier() and g_unregister_classifier() 65 * to add/remove entries to the list. 66 * Classifiers are invoked in registration order. 67 */ 68static TAILQ_HEAD(g_classifier_tailq, g_classifier_hook) 69 g_classifier_tailq = TAILQ_HEAD_INITIALIZER(g_classifier_tailq); 70 71#include <machine/atomic.h> 72 73static void 74g_bioq_lock(struct g_bioq *bq) 75{ 76 77 mtx_lock(&bq->bio_queue_lock); 78} 79 80static void 81g_bioq_unlock(struct g_bioq *bq) 82{ 83 84 mtx_unlock(&bq->bio_queue_lock); 85} 86 87#if 0 88static void 89g_bioq_destroy(struct g_bioq *bq) 90{ 91 92 mtx_destroy(&bq->bio_queue_lock); 93} 94#endif 95 96static void 97g_bioq_init(struct g_bioq *bq) 98{ 99 100 TAILQ_INIT(&bq->bio_queue); 101 mtx_init(&bq->bio_queue_lock, "bio queue", NULL, MTX_DEF); 102} 103 104static struct bio * 105g_bioq_first(struct g_bioq *bq) 106{ 107 struct bio *bp; 108 109 bp = TAILQ_FIRST(&bq->bio_queue); 110 if (bp != NULL) { 111 KASSERT((bp->bio_flags & BIO_ONQUEUE), 112 ("Bio not on queue bp=%p target %p", bp, bq)); 113 bp->bio_flags &= ~BIO_ONQUEUE; 114 TAILQ_REMOVE(&bq->bio_queue, bp, bio_queue); 115 bq->bio_queue_length--; 116 } 117 return (bp); 118} 119 120struct bio * 121g_new_bio(void) 122{ 123 struct bio *bp; 124 125 bp = uma_zalloc(biozone, M_NOWAIT | M_ZERO); 126#ifdef KTR 127 if ((KTR_COMPILE & KTR_GEOM) && (ktr_mask & KTR_GEOM)) { 128 struct stack st; 129 130 CTR1(KTR_GEOM, "g_new_bio(): %p", bp); 131 stack_save(&st); 132 CTRSTACK(KTR_GEOM, &st, 3, 0); 133 } 134#endif 135 return (bp); 136} 137 138struct bio * 139g_alloc_bio(void) 140{ 141 struct bio *bp; 142 143 bp = uma_zalloc(biozone, M_WAITOK | M_ZERO); 144#ifdef KTR 145 if ((KTR_COMPILE & KTR_GEOM) && (ktr_mask & KTR_GEOM)) { 146 struct stack st; 147 148 CTR1(KTR_GEOM, "g_alloc_bio(): %p", bp); 149 stack_save(&st); 150 CTRSTACK(KTR_GEOM, &st, 3, 0); 151 } 152#endif 153 return (bp); 154} 155 156void 157g_destroy_bio(struct bio *bp) 158{ 159#ifdef KTR 160 if ((KTR_COMPILE & KTR_GEOM) && (ktr_mask & KTR_GEOM)) { 161 struct stack st; 162 163 CTR1(KTR_GEOM, "g_destroy_bio(): %p", bp); 164 stack_save(&st); 165 CTRSTACK(KTR_GEOM, &st, 3, 0); 166 } 167#endif 168 uma_zfree(biozone, bp); 169} 170 171struct bio * 172g_clone_bio(struct bio *bp) 173{ 174 struct bio *bp2; 175 176 bp2 = uma_zalloc(biozone, M_NOWAIT | M_ZERO); 177 if (bp2 != NULL) { 178 bp2->bio_parent = bp; 179 bp2->bio_cmd = bp->bio_cmd; 180 bp2->bio_length = bp->bio_length; 181 bp2->bio_offset = bp->bio_offset; 182 bp2->bio_data = bp->bio_data; 183 bp2->bio_attribute = bp->bio_attribute; 184 /* Inherit classification info from the parent */ 185 bp2->bio_classifier1 = bp->bio_classifier1; 186 bp2->bio_classifier2 = bp->bio_classifier2; 187 bp->bio_children++; 188 } 189#ifdef KTR 190 if ((KTR_COMPILE & KTR_GEOM) && (ktr_mask & KTR_GEOM)) { 191 struct stack st; 192 193 CTR2(KTR_GEOM, "g_clone_bio(%p): %p", bp, bp2); 194 stack_save(&st); 195 CTRSTACK(KTR_GEOM, &st, 3, 0); 196 } 197#endif 198 return(bp2); 199} 200 201struct bio * 202g_duplicate_bio(struct bio *bp) 203{ 204 struct bio *bp2; 205 206 bp2 = uma_zalloc(biozone, M_WAITOK | M_ZERO); 207 bp2->bio_parent = bp; 208 bp2->bio_cmd = bp->bio_cmd; 209 bp2->bio_length = bp->bio_length; 210 bp2->bio_offset = bp->bio_offset; 211 bp2->bio_data = bp->bio_data; 212 bp2->bio_attribute = bp->bio_attribute; 213 bp->bio_children++; 214#ifdef KTR 215 if ((KTR_COMPILE & KTR_GEOM) && (ktr_mask & KTR_GEOM)) { 216 struct stack st; 217 218 CTR2(KTR_GEOM, "g_duplicate_bio(%p): %p", bp, bp2); 219 stack_save(&st); 220 CTRSTACK(KTR_GEOM, &st, 3, 0); 221 } 222#endif 223 return(bp2); 224} 225 226void 227g_io_init() 228{ 229 230 g_bioq_init(&g_bio_run_down); 231 g_bioq_init(&g_bio_run_up); 232 g_bioq_init(&g_bio_run_task); 233 biozone = uma_zcreate("g_bio", sizeof (struct bio), 234 NULL, NULL, 235 NULL, NULL, 236 0, 0); 237} 238 239int 240g_io_getattr(const char *attr, struct g_consumer *cp, int *len, void *ptr) 241{ 242 struct bio *bp; 243 int error; 244 245 g_trace(G_T_BIO, "bio_getattr(%s)", attr); 246 bp = g_alloc_bio(); 247 bp->bio_cmd = BIO_GETATTR; 248 bp->bio_done = NULL; 249 bp->bio_attribute = attr; 250 bp->bio_length = *len; 251 bp->bio_data = ptr; 252 g_io_request(bp, cp); 253 error = biowait(bp, "ggetattr"); 254 *len = bp->bio_completed; 255 g_destroy_bio(bp); 256 return (error); 257} 258 259int 260g_io_flush(struct g_consumer *cp) 261{ 262 struct bio *bp; 263 int error; 264 265 g_trace(G_T_BIO, "bio_flush(%s)", cp->provider->name); 266 bp = g_alloc_bio(); 267 bp->bio_cmd = BIO_FLUSH; 268 bp->bio_done = NULL; 269 bp->bio_attribute = NULL; 270 bp->bio_offset = cp->provider->mediasize; 271 bp->bio_length = 0; 272 bp->bio_data = NULL; 273 g_io_request(bp, cp); 274 error = biowait(bp, "gflush"); 275 g_destroy_bio(bp); 276 return (error); 277} 278 279static int 280g_io_check(struct bio *bp) 281{ 282 struct g_consumer *cp; 283 struct g_provider *pp; 284 285 cp = bp->bio_from; 286 pp = bp->bio_to; 287 288 /* Fail if access counters dont allow the operation */ 289 switch(bp->bio_cmd) { 290 case BIO_READ: 291 case BIO_GETATTR: 292 if (cp->acr == 0) 293 return (EPERM); 294 break; 295 case BIO_WRITE: 296 case BIO_DELETE: 297 case BIO_FLUSH: 298 if (cp->acw == 0) 299 return (EPERM); 300 break; 301 default: 302 return (EPERM); 303 } 304 /* if provider is marked for error, don't disturb. */ 305 if (pp->error) 306 return (pp->error); 307 308 switch(bp->bio_cmd) { 309 case BIO_READ: 310 case BIO_WRITE: 311 case BIO_DELETE: 312 /* Zero sectorsize is a probably lack of media */ 313 if (pp->sectorsize == 0) 314 return (ENXIO); 315 /* Reject I/O not on sector boundary */ 316 if (bp->bio_offset % pp->sectorsize) 317 return (EINVAL); 318 /* Reject I/O not integral sector long */ 319 if (bp->bio_length % pp->sectorsize) 320 return (EINVAL); 321 /* Reject requests before or past the end of media. */ 322 if (bp->bio_offset < 0) 323 return (EIO); 324 if (bp->bio_offset > pp->mediasize) 325 return (EIO); 326 break; 327 default: 328 break; 329 } 330 return (0); 331} 332 333/* 334 * bio classification support. 335 * 336 * g_register_classifier() and g_unregister_classifier() 337 * are used to add/remove a classifier from the list. 338 * The list is protected using the g_bio_run_down lock, 339 * because the classifiers are called in this path. 340 * 341 * g_io_request() passes bio's that are not already classified 342 * (i.e. those with bio_classifier1 == NULL) to g_run_classifiers(). 343 * Classifiers can store their result in the two fields 344 * bio_classifier1 and bio_classifier2. 345 * A classifier that updates one of the fields should 346 * return a non-zero value. 347 * If no classifier updates the field, g_run_classifiers() sets 348 * bio_classifier1 = BIO_NOTCLASSIFIED to avoid further calls. 349 */ 350 351int 352g_register_classifier(struct g_classifier_hook *hook) 353{ 354 355 g_bioq_lock(&g_bio_run_down); 356 TAILQ_INSERT_TAIL(&g_classifier_tailq, hook, link); 357 g_bioq_unlock(&g_bio_run_down); 358 359 return (0); 360} 361 362void 363g_unregister_classifier(struct g_classifier_hook *hook) 364{ 365 struct g_classifier_hook *entry; 366 367 g_bioq_lock(&g_bio_run_down); 368 TAILQ_FOREACH(entry, &g_classifier_tailq, link) { 369 if (entry == hook) { 370 TAILQ_REMOVE(&g_classifier_tailq, hook, link); 371 break; 372 } 373 } 374 g_bioq_unlock(&g_bio_run_down); 375} 376 377static void 378g_run_classifiers(struct bio *bp) 379{ 380 struct g_classifier_hook *hook; 381 int classified = 0; 382 383 TAILQ_FOREACH(hook, &g_classifier_tailq, link) 384 classified |= hook->func(hook->arg, bp); 385 386 if (!classified) 387 bp->bio_classifier1 = BIO_NOTCLASSIFIED; 388} 389 390void 391g_io_request(struct bio *bp, struct g_consumer *cp) 392{ 393 struct g_provider *pp; 394 395 KASSERT(cp != NULL, ("NULL cp in g_io_request")); 396 KASSERT(bp != NULL, ("NULL bp in g_io_request")); 397 pp = cp->provider; 398 KASSERT(pp != NULL, ("consumer not attached in g_io_request")); 399#ifdef DIAGNOSTIC 400 KASSERT(bp->bio_driver1 == NULL, 401 ("bio_driver1 used by the consumer (geom %s)", cp->geom->name)); 402 KASSERT(bp->bio_driver2 == NULL, 403 ("bio_driver2 used by the consumer (geom %s)", cp->geom->name)); 404 KASSERT(bp->bio_pflags == 0, 405 ("bio_pflags used by the consumer (geom %s)", cp->geom->name)); 406 /* 407 * Remember consumer's private fields, so we can detect if they were 408 * modified by the provider. 409 */ 410 bp->_bio_caller1 = bp->bio_caller1; 411 bp->_bio_caller2 = bp->bio_caller2; 412 bp->_bio_cflags = bp->bio_cflags; 413#endif 414 415 if (bp->bio_cmd & (BIO_READ|BIO_WRITE|BIO_GETATTR)) { 416 KASSERT(bp->bio_data != NULL, 417 ("NULL bp->data in g_io_request(cmd=%hhu)", bp->bio_cmd)); 418 } 419 if (bp->bio_cmd & (BIO_DELETE|BIO_FLUSH)) { 420 KASSERT(bp->bio_data == NULL, 421 ("non-NULL bp->data in g_io_request(cmd=%hhu)", 422 bp->bio_cmd)); 423 } 424 if (bp->bio_cmd & (BIO_READ|BIO_WRITE|BIO_DELETE)) { 425 KASSERT(bp->bio_offset % cp->provider->sectorsize == 0, 426 ("wrong offset %jd for sectorsize %u", 427 bp->bio_offset, cp->provider->sectorsize)); 428 KASSERT(bp->bio_length % cp->provider->sectorsize == 0, 429 ("wrong length %jd for sectorsize %u", 430 bp->bio_length, cp->provider->sectorsize)); 431 } 432 433 g_trace(G_T_BIO, "bio_request(%p) from %p(%s) to %p(%s) cmd %d", 434 bp, cp, cp->geom->name, pp, pp->name, bp->bio_cmd); 435 436 bp->bio_from = cp; 437 bp->bio_to = pp; 438 bp->bio_error = 0; 439 bp->bio_completed = 0; 440 441 KASSERT(!(bp->bio_flags & BIO_ONQUEUE), 442 ("Bio already on queue bp=%p", bp)); 443 bp->bio_flags |= BIO_ONQUEUE; 444 445 binuptime(&bp->bio_t0); 446 447 /* 448 * The statistics collection is lockless, as such, but we 449 * can not update one instance of the statistics from more 450 * than one thread at a time, so grab the lock first. 451 * 452 * We also use the lock to protect the list of classifiers. 453 */ 454 g_bioq_lock(&g_bio_run_down); 455 456 if (!TAILQ_EMPTY(&g_classifier_tailq) && !bp->bio_classifier1) 457 g_run_classifiers(bp); 458 459 if (g_collectstats & 1) 460 devstat_start_transaction(pp->stat, &bp->bio_t0); 461 if (g_collectstats & 2) 462 devstat_start_transaction(cp->stat, &bp->bio_t0); 463 464 pp->nstart++; 465 cp->nstart++; 466 TAILQ_INSERT_TAIL(&g_bio_run_down.bio_queue, bp, bio_queue); 467 g_bio_run_down.bio_queue_length++; 468 g_bioq_unlock(&g_bio_run_down); 469 470 /* Pass it on down. */ 471 wakeup(&g_wait_down); 472} 473 474void 475g_io_deliver(struct bio *bp, int error) 476{ 477 struct g_consumer *cp; 478 struct g_provider *pp; 479 480 KASSERT(bp != NULL, ("NULL bp in g_io_deliver")); 481 pp = bp->bio_to; 482 KASSERT(pp != NULL, ("NULL bio_to in g_io_deliver")); 483#ifdef DIAGNOSTIC 484 KASSERT(bp->bio_caller1 == bp->_bio_caller1, 485 ("bio_caller1 used by the provider %s", pp->name)); 486 KASSERT(bp->bio_caller2 == bp->_bio_caller2, 487 ("bio_caller2 used by the provider %s", pp->name)); 488 KASSERT(bp->bio_cflags == bp->_bio_cflags, 489 ("bio_cflags used by the provider %s", pp->name)); 490#endif 491 cp = bp->bio_from; 492 if (cp == NULL) { 493 bp->bio_error = error; 494 bp->bio_done(bp); 495 return; 496 } 497 KASSERT(cp != NULL, ("NULL bio_from in g_io_deliver")); 498 KASSERT(cp->geom != NULL, ("NULL bio_from->geom in g_io_deliver")); 499 KASSERT(bp->bio_completed >= 0, ("bio_completed can't be less than 0")); 500 KASSERT(bp->bio_completed <= bp->bio_length, 501 ("bio_completed can't be greater than bio_length")); 502 503 g_trace(G_T_BIO, 504"g_io_deliver(%p) from %p(%s) to %p(%s) cmd %d error %d off %jd len %jd", 505 bp, cp, cp->geom->name, pp, pp->name, bp->bio_cmd, error, 506 (intmax_t)bp->bio_offset, (intmax_t)bp->bio_length); 507 508 KASSERT(!(bp->bio_flags & BIO_ONQUEUE), 509 ("Bio already on queue bp=%p", bp)); 510 511 /* 512 * XXX: next two doesn't belong here 513 */ 514 bp->bio_bcount = bp->bio_length; 515 bp->bio_resid = bp->bio_bcount - bp->bio_completed; 516 517 /* 518 * The statistics collection is lockless, as such, but we 519 * can not update one instance of the statistics from more 520 * than one thread at a time, so grab the lock first. 521 */ 522 g_bioq_lock(&g_bio_run_up); 523 if (g_collectstats & 1) 524 devstat_end_transaction_bio(pp->stat, bp); 525 if (g_collectstats & 2) 526 devstat_end_transaction_bio(cp->stat, bp); 527 528 cp->nend++; 529 pp->nend++; 530 if (error != ENOMEM) { 531 bp->bio_error = error; 532 TAILQ_INSERT_TAIL(&g_bio_run_up.bio_queue, bp, bio_queue); 533 bp->bio_flags |= BIO_ONQUEUE; 534 g_bio_run_up.bio_queue_length++; 535 g_bioq_unlock(&g_bio_run_up); 536 wakeup(&g_wait_up); 537 return; 538 } 539 g_bioq_unlock(&g_bio_run_up); 540 541 if (bootverbose) 542 printf("ENOMEM %p on %p(%s)\n", bp, pp, pp->name); 543 bp->bio_children = 0; 544 bp->bio_inbed = 0; 545 g_io_request(bp, cp); 546 pace++; 547 return; 548} 549 550void 551g_io_schedule_down(struct thread *tp __unused) 552{ 553 struct bio *bp; 554 off_t excess; 555 int error; 556 557 for(;;) { 558 g_bioq_lock(&g_bio_run_down); 559 bp = g_bioq_first(&g_bio_run_down); 560 if (bp == NULL) { 561 CTR0(KTR_GEOM, "g_down going to sleep"); 562 msleep(&g_wait_down, &g_bio_run_down.bio_queue_lock, 563 PRIBIO | PDROP, "-", hz/10); 564 continue; 565 } 566 CTR0(KTR_GEOM, "g_down has work to do"); 567 g_bioq_unlock(&g_bio_run_down); 568 if (pace > 0) { 569 CTR1(KTR_GEOM, "g_down pacing self (pace %d)", pace); 570 pause("g_down", hz/10); 571 pace--; 572 } 573 error = g_io_check(bp); 574 if (error) { 575 CTR3(KTR_GEOM, "g_down g_io_check on bp %p provider " 576 "%s returned %d", bp, bp->bio_to->name, error); 577 g_io_deliver(bp, error); 578 continue; 579 } 580 CTR2(KTR_GEOM, "g_down processing bp %p provider %s", bp, 581 bp->bio_to->name); 582 switch (bp->bio_cmd) { 583 case BIO_READ: 584 case BIO_WRITE: 585 case BIO_DELETE: 586 /* Truncate requests to the end of providers media. */ 587 /* 588 * XXX: What if we truncate because of offset being 589 * bad, not length? 590 */ 591 excess = bp->bio_offset + bp->bio_length; 592 if (excess > bp->bio_to->mediasize) { 593 excess -= bp->bio_to->mediasize; 594 bp->bio_length -= excess; 595 if (excess > 0) 596 CTR3(KTR_GEOM, "g_down truncated bio " 597 "%p provider %s by %d", bp, 598 bp->bio_to->name, excess); 599 } 600 /* Deliver zero length transfers right here. */ 601 if (bp->bio_length == 0) { 602 g_io_deliver(bp, 0); 603 CTR2(KTR_GEOM, "g_down terminated 0-length " 604 "bp %p provider %s", bp, bp->bio_to->name); 605 continue; 606 } 607 break; 608 default: 609 break; 610 } 611 THREAD_NO_SLEEPING(); 612 CTR4(KTR_GEOM, "g_down starting bp %p provider %s off %ld " 613 "len %ld", bp, bp->bio_to->name, bp->bio_offset, 614 bp->bio_length); 615 bp->bio_to->geom->start(bp); 616 THREAD_SLEEPING_OK(); 617 } 618} 619 620void 621bio_taskqueue(struct bio *bp, bio_task_t *func, void *arg) 622{ 623 bp->bio_task = func; 624 bp->bio_task_arg = arg; 625 /* 626 * The taskqueue is actually just a second queue off the "up" 627 * queue, so we use the same lock. 628 */ 629 g_bioq_lock(&g_bio_run_up); 630 KASSERT(!(bp->bio_flags & BIO_ONQUEUE), 631 ("Bio already on queue bp=%p target taskq", bp)); 632 bp->bio_flags |= BIO_ONQUEUE; 633 TAILQ_INSERT_TAIL(&g_bio_run_task.bio_queue, bp, bio_queue); 634 g_bio_run_task.bio_queue_length++; 635 wakeup(&g_wait_up); 636 g_bioq_unlock(&g_bio_run_up); 637} 638 639 640void 641g_io_schedule_up(struct thread *tp __unused) 642{ 643 struct bio *bp; 644 for(;;) { 645 g_bioq_lock(&g_bio_run_up); 646 bp = g_bioq_first(&g_bio_run_task); 647 if (bp != NULL) { 648 g_bioq_unlock(&g_bio_run_up); 649 THREAD_NO_SLEEPING(); 650 CTR1(KTR_GEOM, "g_up processing task bp %p", bp); 651 bp->bio_task(bp->bio_task_arg); 652 THREAD_SLEEPING_OK(); 653 continue; 654 } 655 bp = g_bioq_first(&g_bio_run_up); 656 if (bp != NULL) { 657 g_bioq_unlock(&g_bio_run_up); 658 THREAD_NO_SLEEPING(); 659 CTR4(KTR_GEOM, "g_up biodone bp %p provider %s off " 660 "%jd len %ld", bp, bp->bio_to->name, 661 bp->bio_offset, bp->bio_length); 662 biodone(bp); 663 THREAD_SLEEPING_OK(); 664 continue; 665 } 666 CTR0(KTR_GEOM, "g_up going to sleep"); 667 msleep(&g_wait_up, &g_bio_run_up.bio_queue_lock, 668 PRIBIO | PDROP, "-", hz/10); 669 } 670} 671 672void * 673g_read_data(struct g_consumer *cp, off_t offset, off_t length, int *error) 674{ 675 struct bio *bp; 676 void *ptr; 677 int errorc; 678 679 KASSERT(length > 0 && length >= cp->provider->sectorsize && 680 length <= MAXPHYS, ("g_read_data(): invalid length %jd", 681 (intmax_t)length)); 682 683 bp = g_alloc_bio(); 684 bp->bio_cmd = BIO_READ; 685 bp->bio_done = NULL; 686 bp->bio_offset = offset; 687 bp->bio_length = length; 688 ptr = g_malloc(length, M_WAITOK); 689 bp->bio_data = ptr; 690 g_io_request(bp, cp); 691 errorc = biowait(bp, "gread"); 692 if (error != NULL) 693 *error = errorc; 694 g_destroy_bio(bp); 695 if (errorc) { 696 g_free(ptr); 697 ptr = NULL; 698 } 699 return (ptr); 700} 701 702int 703g_write_data(struct g_consumer *cp, off_t offset, void *ptr, off_t length) 704{ 705 struct bio *bp; 706 int error; 707 708 KASSERT(length > 0 && length >= cp->provider->sectorsize && 709 length <= MAXPHYS, ("g_write_data(): invalid length %jd", 710 (intmax_t)length)); 711 712 bp = g_alloc_bio(); 713 bp->bio_cmd = BIO_WRITE; 714 bp->bio_done = NULL; 715 bp->bio_offset = offset; 716 bp->bio_length = length; 717 bp->bio_data = ptr; 718 g_io_request(bp, cp); 719 error = biowait(bp, "gwrite"); 720 g_destroy_bio(bp); 721 return (error); 722} 723 724int 725g_delete_data(struct g_consumer *cp, off_t offset, off_t length) 726{ 727 struct bio *bp; 728 int error; 729 730 KASSERT(length > 0 && length >= cp->provider->sectorsize, 731 ("g_delete_data(): invalid length %jd", (intmax_t)length)); 732 733 bp = g_alloc_bio(); 734 bp->bio_cmd = BIO_DELETE; 735 bp->bio_done = NULL; 736 bp->bio_offset = offset; 737 bp->bio_length = length; 738 bp->bio_data = NULL; 739 g_io_request(bp, cp); 740 error = biowait(bp, "gdelete"); 741 g_destroy_bio(bp); 742 return (error); 743} 744 745void 746g_print_bio(struct bio *bp) 747{ 748 const char *pname, *cmd = NULL; 749 750 if (bp->bio_to != NULL) 751 pname = bp->bio_to->name; 752 else 753 pname = "[unknown]"; 754 755 switch (bp->bio_cmd) { 756 case BIO_GETATTR: 757 cmd = "GETATTR"; 758 printf("%s[%s(attr=%s)]", pname, cmd, bp->bio_attribute); 759 return; 760 case BIO_FLUSH: 761 cmd = "FLUSH"; 762 printf("%s[%s]", pname, cmd); 763 return; 764 case BIO_READ: 765 cmd = "READ"; 766 case BIO_WRITE: 767 if (cmd == NULL) 768 cmd = "WRITE"; 769 case BIO_DELETE: 770 if (cmd == NULL) 771 cmd = "DELETE"; 772 printf("%s[%s(offset=%jd, length=%jd)]", pname, cmd, 773 (intmax_t)bp->bio_offset, (intmax_t)bp->bio_length); 774 return; 775 default: 776 cmd = "UNKNOWN"; 777 printf("%s[%s()]", pname, cmd); 778 return; 779 } 780 /* NOTREACHED */ 781} 782