2 * Copyright (c) 2007 Lukas Ertl
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 AUTHOR 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
27 #include <sys/cdefs.h>
28 __FBSDID("$FreeBSD$");
30 #include <sys/param.h>
33 #include <sys/malloc.h>
34 #include <sys/systm.h>
36 #include <geom/geom.h>
37 #include <geom/vinum/geom_vinum_var.h>
38 #include <geom/vinum/geom_vinum.h>
41 gv_volume_flush(struct gv_volume *v)
46 KASSERT(v != NULL, ("NULL v"));
48 KASSERT(sc != NULL, ("NULL sc"));
50 bp = bioq_takefirst(v->wqueue);
52 gv_volume_start(sc, bp);
53 bp = bioq_takefirst(v->wqueue);
58 gv_volume_start(struct gv_softc *sc, struct bio *bp)
62 struct gv_plex *p, *lp;
66 v = bp->bio_to->private;
67 if (v == NULL || v->state != GV_VOL_UP) {
68 g_io_deliver(bp, ENXIO);
72 switch (bp->bio_cmd) {
75 * Try to find a good plex where we can send the request to,
76 * round-robin-style. The plex either has to be up, or it's a
77 * degraded RAID5 plex. Check if we have delayed requests. Put
78 * this request on the delayed queue if so. This makes sure that
79 * we don't read old values.
81 if (bioq_first(v->wqueue) != NULL) {
82 bioq_insert_tail(v->wqueue, bp);
85 lp = v->last_read_plex;
87 lp = LIST_FIRST(&v->plexes);
88 p = LIST_NEXT(lp, in_volume);
90 p = LIST_FIRST(&v->plexes);
96 if ((p->state > GV_PLEX_DEGRADED) ||
97 (p->state >= GV_PLEX_DEGRADED &&
98 p->org == GV_PLEX_RAID5))
100 p = LIST_NEXT(p, in_volume);
102 p = LIST_FIRST(&v->plexes);
106 (p->org == GV_PLEX_RAID5 && p->state < GV_PLEX_DEGRADED) ||
107 (p->org != GV_PLEX_RAID5 && p->state <= GV_PLEX_DEGRADED)) {
108 g_io_deliver(bp, ENXIO);
111 v->last_read_plex = p;
113 /* Hand it down to the plex logic. */
114 gv_plex_start(p, bp);
119 /* Delay write-requests if any plex is synchronizing. */
120 LIST_FOREACH(p, &v->plexes, in_volume) {
121 if (p->flags & GV_PLEX_SYNCING) {
122 bioq_insert_tail(v->wqueue, bp);
128 /* Give the BIO to each plex of this volume. */
129 LIST_FOREACH(p, &v->plexes, in_volume) {
130 if (p->state < GV_PLEX_DEGRADED)
132 gv_plex_start(p, bp);
136 g_io_deliver(bp, ENXIO);
142 gv_bio_done(struct gv_softc *sc, struct bio *bp)
149 KASSERT(s != NULL, ("gv_bio_done: NULL s"));
151 KASSERT(p != NULL, ("gv_bio_done: NULL p"));
153 KASSERT(v != NULL, ("gv_bio_done: NULL v"));
157 case GV_PLEX_STRIPED:
158 gv_plex_normal_done(p, bp);
161 gv_plex_raid5_done(p, bp);