2 * Copyright (c) 2002 Poul-Henning Kamp
3 * Copyright (c) 2002 Networks Associates Technology, Inc.
4 * Copyright (c) 2013 The FreeBSD Foundation
7 * This software was developed for the FreeBSD Project by Poul-Henning Kamp
8 * and NAI Labs, the Security Research Division of Network Associates, Inc.
9 * under DARPA/SPAWAR contract N66001-01-C-8035 ("CBOSS"), as part of the
10 * DARPA CHATS research program.
12 * Portions of this software were developed by Konstantin Belousov
13 * under sponsorship from the FreeBSD Foundation.
15 * Redistribution and use in source and binary forms, with or without
16 * modification, are permitted provided that the following conditions
18 * 1. Redistributions of source code must retain the above copyright
19 * notice, this list of conditions and the following disclaimer.
20 * 2. Redistributions in binary form must reproduce the above copyright
21 * notice, this list of conditions and the following disclaimer in the
22 * documentation and/or other materials provided with the distribution.
23 * 3. The names of the authors may not be used to endorse or promote
24 * products derived from this software without specific prior written
27 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
28 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
31 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
40 #include <sys/cdefs.h>
41 __FBSDID("$FreeBSD$");
43 #include <sys/param.h>
44 #include <sys/systm.h>
45 #include <sys/kernel.h>
46 #include <sys/malloc.h>
50 #include <sys/stack.h>
51 #include <sys/sysctl.h>
53 #include <sys/errno.h>
54 #include <geom/geom.h>
55 #include <geom/geom_int.h>
56 #include <sys/devicestat.h>
60 #include <vm/vm_param.h>
61 #include <vm/vm_kern.h>
62 #include <vm/vm_page.h>
63 #include <vm/vm_object.h>
64 #include <vm/vm_extern.h>
65 #include <vm/vm_map.h>
67 static struct g_bioq g_bio_run_down;
68 static struct g_bioq g_bio_run_up;
69 static struct g_bioq g_bio_run_task;
72 static uma_zone_t biozone;
75 * The head of the list of classifiers used in g_io_request.
76 * Use g_register_classifier() and g_unregister_classifier()
77 * to add/remove entries to the list.
78 * Classifiers are invoked in registration order.
80 static TAILQ_HEAD(g_classifier_tailq, g_classifier_hook)
81 g_classifier_tailq = TAILQ_HEAD_INITIALIZER(g_classifier_tailq);
83 #include <machine/atomic.h>
86 g_bioq_lock(struct g_bioq *bq)
89 mtx_lock(&bq->bio_queue_lock);
93 g_bioq_unlock(struct g_bioq *bq)
96 mtx_unlock(&bq->bio_queue_lock);
101 g_bioq_destroy(struct g_bioq *bq)
104 mtx_destroy(&bq->bio_queue_lock);
109 g_bioq_init(struct g_bioq *bq)
112 TAILQ_INIT(&bq->bio_queue);
113 mtx_init(&bq->bio_queue_lock, "bio queue", NULL, MTX_DEF);
117 g_bioq_first(struct g_bioq *bq)
121 bp = TAILQ_FIRST(&bq->bio_queue);
123 KASSERT((bp->bio_flags & BIO_ONQUEUE),
124 ("Bio not on queue bp=%p target %p", bp, bq));
125 bp->bio_flags &= ~BIO_ONQUEUE;
126 TAILQ_REMOVE(&bq->bio_queue, bp, bio_queue);
127 bq->bio_queue_length--;
137 bp = uma_zalloc(biozone, M_NOWAIT | M_ZERO);
139 if ((KTR_COMPILE & KTR_GEOM) && (ktr_mask & KTR_GEOM)) {
142 CTR1(KTR_GEOM, "g_new_bio(): %p", bp);
144 CTRSTACK(KTR_GEOM, &st, 3, 0);
155 bp = uma_zalloc(biozone, M_WAITOK | M_ZERO);
157 if ((KTR_COMPILE & KTR_GEOM) && (ktr_mask & KTR_GEOM)) {
160 CTR1(KTR_GEOM, "g_alloc_bio(): %p", bp);
162 CTRSTACK(KTR_GEOM, &st, 3, 0);
169 g_destroy_bio(struct bio *bp)
172 if ((KTR_COMPILE & KTR_GEOM) && (ktr_mask & KTR_GEOM)) {
175 CTR1(KTR_GEOM, "g_destroy_bio(): %p", bp);
177 CTRSTACK(KTR_GEOM, &st, 3, 0);
180 uma_zfree(biozone, bp);
184 g_clone_bio(struct bio *bp)
188 bp2 = uma_zalloc(biozone, M_NOWAIT | M_ZERO);
190 bp2->bio_parent = bp;
191 bp2->bio_cmd = bp->bio_cmd;
193 * BIO_ORDERED flag may be used by disk drivers to enforce
194 * ordering restrictions, so this flag needs to be cloned.
195 * BIO_UNMAPPED should be inherited, to properly indicate
196 * which way the buffer is passed.
197 * Other bio flags are not suitable for cloning.
199 bp2->bio_flags = bp->bio_flags & (BIO_ORDERED | BIO_UNMAPPED);
200 bp2->bio_length = bp->bio_length;
201 bp2->bio_offset = bp->bio_offset;
202 bp2->bio_data = bp->bio_data;
203 bp2->bio_ma = bp->bio_ma;
204 bp2->bio_ma_n = bp->bio_ma_n;
205 bp2->bio_ma_offset = bp->bio_ma_offset;
206 bp2->bio_attribute = bp->bio_attribute;
207 /* Inherit classification info from the parent */
208 bp2->bio_classifier1 = bp->bio_classifier1;
209 bp2->bio_classifier2 = bp->bio_classifier2;
213 if ((KTR_COMPILE & KTR_GEOM) && (ktr_mask & KTR_GEOM)) {
216 CTR2(KTR_GEOM, "g_clone_bio(%p): %p", bp, bp2);
218 CTRSTACK(KTR_GEOM, &st, 3, 0);
225 g_duplicate_bio(struct bio *bp)
229 bp2 = uma_zalloc(biozone, M_WAITOK | M_ZERO);
230 bp2->bio_flags = bp->bio_flags & BIO_UNMAPPED;
231 bp2->bio_parent = bp;
232 bp2->bio_cmd = bp->bio_cmd;
233 bp2->bio_length = bp->bio_length;
234 bp2->bio_offset = bp->bio_offset;
235 bp2->bio_data = bp->bio_data;
236 bp2->bio_ma = bp->bio_ma;
237 bp2->bio_ma_n = bp->bio_ma_n;
238 bp2->bio_ma_offset = bp->bio_ma_offset;
239 bp2->bio_attribute = bp->bio_attribute;
242 if ((KTR_COMPILE & KTR_GEOM) && (ktr_mask & KTR_GEOM)) {
245 CTR2(KTR_GEOM, "g_duplicate_bio(%p): %p", bp, bp2);
247 CTRSTACK(KTR_GEOM, &st, 3, 0);
257 g_bioq_init(&g_bio_run_down);
258 g_bioq_init(&g_bio_run_up);
259 g_bioq_init(&g_bio_run_task);
260 biozone = uma_zcreate("g_bio", sizeof (struct bio),
267 g_io_getattr(const char *attr, struct g_consumer *cp, int *len, void *ptr)
272 g_trace(G_T_BIO, "bio_getattr(%s)", attr);
274 bp->bio_cmd = BIO_GETATTR;
276 bp->bio_attribute = attr;
277 bp->bio_length = *len;
279 g_io_request(bp, cp);
280 error = biowait(bp, "ggetattr");
281 *len = bp->bio_completed;
287 g_io_flush(struct g_consumer *cp)
292 g_trace(G_T_BIO, "bio_flush(%s)", cp->provider->name);
294 bp->bio_cmd = BIO_FLUSH;
295 bp->bio_flags |= BIO_ORDERED;
297 bp->bio_attribute = NULL;
298 bp->bio_offset = cp->provider->mediasize;
301 g_io_request(bp, cp);
302 error = biowait(bp, "gflush");
308 g_io_check(struct bio *bp)
310 struct g_consumer *cp;
311 struct g_provider *pp;
316 /* Fail if access counters dont allow the operation */
317 switch(bp->bio_cmd) {
332 /* if provider is marked for error, don't disturb. */
335 if (cp->flags & G_CF_ORPHAN)
338 switch(bp->bio_cmd) {
342 /* Zero sectorsize or mediasize is probably a lack of media. */
343 if (pp->sectorsize == 0 || pp->mediasize == 0)
345 /* Reject I/O not on sector boundary */
346 if (bp->bio_offset % pp->sectorsize)
348 /* Reject I/O not integral sector long */
349 if (bp->bio_length % pp->sectorsize)
351 /* Reject requests before or past the end of media. */
352 if (bp->bio_offset < 0)
354 if (bp->bio_offset > pp->mediasize)
364 * bio classification support.
366 * g_register_classifier() and g_unregister_classifier()
367 * are used to add/remove a classifier from the list.
368 * The list is protected using the g_bio_run_down lock,
369 * because the classifiers are called in this path.
371 * g_io_request() passes bio's that are not already classified
372 * (i.e. those with bio_classifier1 == NULL) to g_run_classifiers().
373 * Classifiers can store their result in the two fields
374 * bio_classifier1 and bio_classifier2.
375 * A classifier that updates one of the fields should
376 * return a non-zero value.
377 * If no classifier updates the field, g_run_classifiers() sets
378 * bio_classifier1 = BIO_NOTCLASSIFIED to avoid further calls.
382 g_register_classifier(struct g_classifier_hook *hook)
385 g_bioq_lock(&g_bio_run_down);
386 TAILQ_INSERT_TAIL(&g_classifier_tailq, hook, link);
387 g_bioq_unlock(&g_bio_run_down);
393 g_unregister_classifier(struct g_classifier_hook *hook)
395 struct g_classifier_hook *entry;
397 g_bioq_lock(&g_bio_run_down);
398 TAILQ_FOREACH(entry, &g_classifier_tailq, link) {
400 TAILQ_REMOVE(&g_classifier_tailq, hook, link);
404 g_bioq_unlock(&g_bio_run_down);
408 g_run_classifiers(struct bio *bp)
410 struct g_classifier_hook *hook;
413 TAILQ_FOREACH(hook, &g_classifier_tailq, link)
414 classified |= hook->func(hook->arg, bp);
417 bp->bio_classifier1 = BIO_NOTCLASSIFIED;
421 g_io_request(struct bio *bp, struct g_consumer *cp)
423 struct g_provider *pp;
426 KASSERT(cp != NULL, ("NULL cp in g_io_request"));
427 KASSERT(bp != NULL, ("NULL bp in g_io_request"));
429 KASSERT(pp != NULL, ("consumer not attached in g_io_request"));
431 KASSERT(bp->bio_driver1 == NULL,
432 ("bio_driver1 used by the consumer (geom %s)", cp->geom->name));
433 KASSERT(bp->bio_driver2 == NULL,
434 ("bio_driver2 used by the consumer (geom %s)", cp->geom->name));
435 KASSERT(bp->bio_pflags == 0,
436 ("bio_pflags used by the consumer (geom %s)", cp->geom->name));
438 * Remember consumer's private fields, so we can detect if they were
439 * modified by the provider.
441 bp->_bio_caller1 = bp->bio_caller1;
442 bp->_bio_caller2 = bp->bio_caller2;
443 bp->_bio_cflags = bp->bio_cflags;
446 if (bp->bio_cmd & (BIO_READ|BIO_WRITE|BIO_GETATTR)) {
447 KASSERT(bp->bio_data != NULL,
448 ("NULL bp->data in g_io_request(cmd=%hhu)", bp->bio_cmd));
450 if (bp->bio_cmd & (BIO_DELETE|BIO_FLUSH)) {
451 KASSERT(bp->bio_data == NULL,
452 ("non-NULL bp->data in g_io_request(cmd=%hhu)",
455 if (bp->bio_cmd & (BIO_READ|BIO_WRITE|BIO_DELETE)) {
456 KASSERT(bp->bio_offset % cp->provider->sectorsize == 0,
457 ("wrong offset %jd for sectorsize %u",
458 bp->bio_offset, cp->provider->sectorsize));
459 KASSERT(bp->bio_length % cp->provider->sectorsize == 0,
460 ("wrong length %jd for sectorsize %u",
461 bp->bio_length, cp->provider->sectorsize));
464 g_trace(G_T_BIO, "bio_request(%p) from %p(%s) to %p(%s) cmd %d",
465 bp, cp, cp->geom->name, pp, pp->name, bp->bio_cmd);
470 bp->bio_completed = 0;
472 KASSERT(!(bp->bio_flags & BIO_ONQUEUE),
473 ("Bio already on queue bp=%p", bp));
474 bp->bio_flags |= BIO_ONQUEUE;
477 binuptime(&bp->bio_t0);
479 getbinuptime(&bp->bio_t0);
482 * The statistics collection is lockless, as such, but we
483 * can not update one instance of the statistics from more
484 * than one thread at a time, so grab the lock first.
486 * We also use the lock to protect the list of classifiers.
488 g_bioq_lock(&g_bio_run_down);
490 if (!TAILQ_EMPTY(&g_classifier_tailq) && !bp->bio_classifier1)
491 g_run_classifiers(bp);
493 if (g_collectstats & 1)
494 devstat_start_transaction(pp->stat, &bp->bio_t0);
495 if (g_collectstats & 2)
496 devstat_start_transaction(cp->stat, &bp->bio_t0);
500 first = TAILQ_EMPTY(&g_bio_run_down.bio_queue);
501 TAILQ_INSERT_TAIL(&g_bio_run_down.bio_queue, bp, bio_queue);
502 g_bio_run_down.bio_queue_length++;
503 g_bioq_unlock(&g_bio_run_down);
505 /* Pass it on down. */
507 wakeup(&g_wait_down);
511 g_io_deliver(struct bio *bp, int error)
513 struct g_consumer *cp;
514 struct g_provider *pp;
517 KASSERT(bp != NULL, ("NULL bp in g_io_deliver"));
519 KASSERT(pp != NULL, ("NULL bio_to in g_io_deliver"));
522 bp->bio_error = error;
526 KASSERT(cp != NULL, ("NULL bio_from in g_io_deliver"));
527 KASSERT(cp->geom != NULL, ("NULL bio_from->geom in g_io_deliver"));
530 * Some classes - GJournal in particular - can modify bio's
531 * private fields while the bio is in transit; G_GEOM_VOLATILE_BIO
532 * flag means it's an expected behaviour for that particular geom.
534 if ((cp->geom->flags & G_GEOM_VOLATILE_BIO) == 0) {
535 KASSERT(bp->bio_caller1 == bp->_bio_caller1,
536 ("bio_caller1 used by the provider %s", pp->name));
537 KASSERT(bp->bio_caller2 == bp->_bio_caller2,
538 ("bio_caller2 used by the provider %s", pp->name));
539 KASSERT(bp->bio_cflags == bp->_bio_cflags,
540 ("bio_cflags used by the provider %s", pp->name));
543 KASSERT(bp->bio_completed >= 0, ("bio_completed can't be less than 0"));
544 KASSERT(bp->bio_completed <= bp->bio_length,
545 ("bio_completed can't be greater than bio_length"));
548 "g_io_deliver(%p) from %p(%s) to %p(%s) cmd %d error %d off %jd len %jd",
549 bp, cp, cp->geom->name, pp, pp->name, bp->bio_cmd, error,
550 (intmax_t)bp->bio_offset, (intmax_t)bp->bio_length);
552 KASSERT(!(bp->bio_flags & BIO_ONQUEUE),
553 ("Bio already on queue bp=%p", bp));
556 * XXX: next two doesn't belong here
558 bp->bio_bcount = bp->bio_length;
559 bp->bio_resid = bp->bio_bcount - bp->bio_completed;
562 * The statistics collection is lockless, as such, but we
563 * can not update one instance of the statistics from more
564 * than one thread at a time, so grab the lock first.
566 g_bioq_lock(&g_bio_run_up);
567 if (g_collectstats & 1)
568 devstat_end_transaction_bio(pp->stat, bp);
569 if (g_collectstats & 2)
570 devstat_end_transaction_bio(cp->stat, bp);
574 if (error != ENOMEM) {
575 bp->bio_error = error;
576 first = TAILQ_EMPTY(&g_bio_run_up.bio_queue);
577 TAILQ_INSERT_TAIL(&g_bio_run_up.bio_queue, bp, bio_queue);
578 bp->bio_flags |= BIO_ONQUEUE;
579 g_bio_run_up.bio_queue_length++;
580 g_bioq_unlock(&g_bio_run_up);
585 g_bioq_unlock(&g_bio_run_up);
588 printf("ENOMEM %p on %p(%s)\n", bp, pp, pp->name);
589 bp->bio_children = 0;
591 bp->bio_driver1 = NULL;
592 bp->bio_driver2 = NULL;
594 g_io_request(bp, cp);
599 SYSCTL_DECL(_kern_geom);
601 static long transient_maps;
602 SYSCTL_LONG(_kern_geom, OID_AUTO, transient_maps, CTLFLAG_RD,
604 "Total count of the transient mapping requests");
605 u_int transient_map_retries = 10;
606 SYSCTL_UINT(_kern_geom, OID_AUTO, transient_map_retries, CTLFLAG_RW,
607 &transient_map_retries, 0,
608 "Max count of retries used before giving up on creating transient map");
609 int transient_map_hard_failures;
610 SYSCTL_INT(_kern_geom, OID_AUTO, transient_map_hard_failures, CTLFLAG_RD,
611 &transient_map_hard_failures, 0,
612 "Failures to establish the transient mapping due to retry attempts "
614 int transient_map_soft_failures;
615 SYSCTL_INT(_kern_geom, OID_AUTO, transient_map_soft_failures, CTLFLAG_RD,
616 &transient_map_soft_failures, 0,
617 "Count of retried failures to establish the transient mapping");
618 int inflight_transient_maps;
619 SYSCTL_INT(_kern_geom, OID_AUTO, inflight_transient_maps, CTLFLAG_RD,
620 &inflight_transient_maps, 0,
621 "Current count of the active transient maps");
624 g_io_transient_map_bio(struct bio *bp)
631 KASSERT(unmapped_buf_allowed, ("unmapped disabled"));
633 size = round_page(bp->bio_ma_offset + bp->bio_length);
634 KASSERT(size / PAGE_SIZE == bp->bio_ma_n, ("Bio too short %p", bp));
637 atomic_add_long(&transient_maps, 1);
639 vm_map_lock(bio_transient_map);
640 if (vm_map_findspace(bio_transient_map, vm_map_min(bio_transient_map),
642 vm_map_unlock(bio_transient_map);
643 if (transient_map_retries != 0 &&
644 retried >= transient_map_retries) {
645 g_io_deliver(bp, EDEADLK/* XXXKIB */);
646 CTR2(KTR_GEOM, "g_down cannot map bp %p provider %s",
647 bp, bp->bio_to->name);
648 atomic_add_int(&transient_map_hard_failures, 1);
652 * Naive attempt to quisce the I/O to get more
653 * in-flight requests completed and defragment
654 * the bio_transient_map.
656 CTR3(KTR_GEOM, "g_down retrymap bp %p provider %s r %d",
657 bp, bp->bio_to->name, retried);
658 pause("g_d_tra", hz / 10);
660 atomic_add_int(&transient_map_soft_failures, 1);
664 rv = vm_map_insert(bio_transient_map, NULL, 0, addr, addr + size,
665 VM_PROT_RW, VM_PROT_RW, MAP_NOFAULT);
666 KASSERT(rv == KERN_SUCCESS,
667 ("vm_map_insert(bio_transient_map) rv %d %jx %lx",
668 rv, (uintmax_t)addr, size));
669 vm_map_unlock(bio_transient_map);
670 atomic_add_int(&inflight_transient_maps, 1);
671 pmap_qenter((vm_offset_t)addr, bp->bio_ma, OFF_TO_IDX(size));
672 bp->bio_data = (caddr_t)addr + bp->bio_ma_offset;
673 bp->bio_flags |= BIO_TRANSIENT_MAPPING;
674 bp->bio_flags &= ~BIO_UNMAPPED;
679 g_io_schedule_down(struct thread *tp __unused)
686 g_bioq_lock(&g_bio_run_down);
687 bp = g_bioq_first(&g_bio_run_down);
689 CTR0(KTR_GEOM, "g_down going to sleep");
690 msleep(&g_wait_down, &g_bio_run_down.bio_queue_lock,
691 PRIBIO | PDROP, "-", 0);
694 CTR0(KTR_GEOM, "g_down has work to do");
695 g_bioq_unlock(&g_bio_run_down);
697 CTR1(KTR_GEOM, "g_down pacing self (pace %d)", pace);
698 pause("g_down", hz/10);
701 error = g_io_check(bp);
703 CTR3(KTR_GEOM, "g_down g_io_check on bp %p provider "
704 "%s returned %d", bp, bp->bio_to->name, error);
705 g_io_deliver(bp, error);
708 CTR2(KTR_GEOM, "g_down processing bp %p provider %s", bp,
710 switch (bp->bio_cmd) {
714 /* Truncate requests to the end of providers media. */
716 * XXX: What if we truncate because of offset being
719 excess = bp->bio_offset + bp->bio_length;
720 if (excess > bp->bio_to->mediasize) {
721 KASSERT((bp->bio_flags & BIO_UNMAPPED) == 0 ||
722 round_page(bp->bio_ma_offset +
723 bp->bio_length) / PAGE_SIZE == bp->bio_ma_n,
724 ("excess bio %p too short", bp));
725 excess -= bp->bio_to->mediasize;
726 bp->bio_length -= excess;
727 if ((bp->bio_flags & BIO_UNMAPPED) != 0) {
728 bp->bio_ma_n = round_page(
730 bp->bio_length) / PAGE_SIZE;
733 CTR3(KTR_GEOM, "g_down truncated bio "
734 "%p provider %s by %d", bp,
735 bp->bio_to->name, excess);
737 /* Deliver zero length transfers right here. */
738 if (bp->bio_length == 0) {
740 CTR2(KTR_GEOM, "g_down terminated 0-length "
741 "bp %p provider %s", bp, bp->bio_to->name);
748 if ((bp->bio_flags & BIO_UNMAPPED) != 0 &&
749 (bp->bio_to->flags & G_PF_ACCEPT_UNMAPPED) == 0 &&
750 (bp->bio_cmd == BIO_READ || bp->bio_cmd == BIO_WRITE)) {
751 if (g_io_transient_map_bio(bp))
754 THREAD_NO_SLEEPING();
755 CTR4(KTR_GEOM, "g_down starting bp %p provider %s off %ld "
756 "len %ld", bp, bp->bio_to->name, bp->bio_offset,
758 bp->bio_to->geom->start(bp);
759 THREAD_SLEEPING_OK();
764 bio_taskqueue(struct bio *bp, bio_task_t *func, void *arg)
767 bp->bio_task_arg = arg;
769 * The taskqueue is actually just a second queue off the "up"
770 * queue, so we use the same lock.
772 g_bioq_lock(&g_bio_run_up);
773 KASSERT(!(bp->bio_flags & BIO_ONQUEUE),
774 ("Bio already on queue bp=%p target taskq", bp));
775 bp->bio_flags |= BIO_ONQUEUE;
776 TAILQ_INSERT_TAIL(&g_bio_run_task.bio_queue, bp, bio_queue);
777 g_bio_run_task.bio_queue_length++;
779 g_bioq_unlock(&g_bio_run_up);
784 g_io_schedule_up(struct thread *tp __unused)
788 g_bioq_lock(&g_bio_run_up);
789 bp = g_bioq_first(&g_bio_run_task);
791 g_bioq_unlock(&g_bio_run_up);
792 THREAD_NO_SLEEPING();
793 CTR1(KTR_GEOM, "g_up processing task bp %p", bp);
794 bp->bio_task(bp->bio_task_arg);
795 THREAD_SLEEPING_OK();
798 bp = g_bioq_first(&g_bio_run_up);
800 g_bioq_unlock(&g_bio_run_up);
801 THREAD_NO_SLEEPING();
802 CTR4(KTR_GEOM, "g_up biodone bp %p provider %s off "
803 "%jd len %ld", bp, bp->bio_to->name,
804 bp->bio_offset, bp->bio_length);
806 THREAD_SLEEPING_OK();
809 CTR0(KTR_GEOM, "g_up going to sleep");
810 msleep(&g_wait_up, &g_bio_run_up.bio_queue_lock,
811 PRIBIO | PDROP, "-", 0);
816 g_read_data(struct g_consumer *cp, off_t offset, off_t length, int *error)
822 KASSERT(length > 0 && length >= cp->provider->sectorsize &&
823 length <= MAXPHYS, ("g_read_data(): invalid length %jd",
827 bp->bio_cmd = BIO_READ;
829 bp->bio_offset = offset;
830 bp->bio_length = length;
831 ptr = g_malloc(length, M_WAITOK);
833 g_io_request(bp, cp);
834 errorc = biowait(bp, "gread");
846 g_write_data(struct g_consumer *cp, off_t offset, void *ptr, off_t length)
851 KASSERT(length > 0 && length >= cp->provider->sectorsize &&
852 length <= MAXPHYS, ("g_write_data(): invalid length %jd",
856 bp->bio_cmd = BIO_WRITE;
858 bp->bio_offset = offset;
859 bp->bio_length = length;
861 g_io_request(bp, cp);
862 error = biowait(bp, "gwrite");
868 g_delete_data(struct g_consumer *cp, off_t offset, off_t length)
873 KASSERT(length > 0 && length >= cp->provider->sectorsize,
874 ("g_delete_data(): invalid length %jd", (intmax_t)length));
877 bp->bio_cmd = BIO_DELETE;
879 bp->bio_offset = offset;
880 bp->bio_length = length;
882 g_io_request(bp, cp);
883 error = biowait(bp, "gdelete");
889 g_print_bio(struct bio *bp)
891 const char *pname, *cmd = NULL;
893 if (bp->bio_to != NULL)
894 pname = bp->bio_to->name;
898 switch (bp->bio_cmd) {
901 printf("%s[%s(attr=%s)]", pname, cmd, bp->bio_attribute);
905 printf("%s[%s]", pname, cmd);
918 printf("%s[%s()]", pname, cmd);
921 printf("%s[%s(offset=%jd, length=%jd)]", pname, cmd,
922 (intmax_t)bp->bio_offset, (intmax_t)bp->bio_length);