2 * SPDX-License-Identifier: (BSD-2-Clause-NetBSD AND BSD-3-Clause)
4 * Copyright (c) 2003 Poul-Henning Kamp.
5 * Copyright (c) 1996, 1997 The NetBSD Foundation, Inc.
8 * This code is derived from software contributed to The NetBSD Foundation
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
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.
20 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
21 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
22 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
23 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
24 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
25 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
26 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
27 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
29 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
30 * POSSIBILITY OF SUCH DAMAGE.
32 * $NetBSD: ccd.c,v 1.22 1995/12/08 19:13:26 thorpej Exp $
36 * Copyright (c) 1988 University of Utah.
37 * Copyright (c) 1990, 1993
38 * The Regents of the University of California. All rights reserved.
40 * This code is derived from software contributed to Berkeley by
41 * the Systems Programming Group of the University of Utah Computer
44 * Redistribution and use in source and binary forms, with or without
45 * modification, are permitted provided that the following conditions
47 * 1. Redistributions of source code must retain the above copyright
48 * notice, this list of conditions and the following disclaimer.
49 * 2. Redistributions in binary form must reproduce the above copyright
50 * notice, this list of conditions and the following disclaimer in the
51 * documentation and/or other materials provided with the distribution.
52 * 3. Neither the name of the University nor the names of its contributors
53 * may be used to endorse or promote products derived from this software
54 * without specific prior written permission.
56 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
57 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
58 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
59 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
60 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
61 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
62 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
63 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
64 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
65 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
68 * from: Utah $Hdr: cd.c 1.6 90/11/28$
70 * @(#)cd.c 8.2 (Berkeley) 11/16/93
74 * Dynamic configuration and disklabel support by:
75 * Jason R. Thorpe <thorpej@nas.nasa.gov>
76 * Numerical Aerodynamic Simulation Facility
78 * NASA Ames Research Center
79 * Moffett Field, CA 94035
82 #include <sys/cdefs.h>
83 __FBSDID("$FreeBSD$");
85 #include <sys/param.h>
86 #include <sys/systm.h>
87 #include <sys/kernel.h>
88 #include <sys/module.h>
90 #include <sys/malloc.h>
92 #include <geom/geom.h>
95 * Number of blocks to untouched in front of a component partition.
96 * This is to avoid violating its disklabel area when it starts at the
97 * beginning of the slice.
99 #if !defined(CCD_OFFSET)
100 #define CCD_OFFSET 16
104 #define CCDF_UNIFORM 0x02 /* use LCCD of sizes for uniform interleave */
105 #define CCDF_MIRROR 0x04 /* use mirroring */
106 #define CCDF_NO_OFFSET 0x08 /* do not leave space in front */
107 #define CCDF_LINUX 0x10 /* use Linux compatibility mode */
109 /* Mask of user-settable ccd flags. */
110 #define CCDF_USERMASK (CCDF_UNIFORM|CCDF_MIRROR)
113 * Interleave description table.
114 * Computed at boot time to speed irregular-interleave lookups.
115 * The idea is that we interleave in "groups". First we interleave
116 * evenly over all component disks up to the size of the smallest
117 * component (the first group), then we interleave evenly over all
118 * remaining disks up to the size of the next-smallest (second group),
121 * Each table entry describes the interleave characteristics of one
122 * of these groups. For example if a concatenated disk consisted of
123 * three components of 5, 3, and 7 DEV_BSIZE blocks interleaved at
124 * DEV_BSIZE (1), the table would have three entries:
126 * ndisk startblk startoff dev
132 * which says that the first nine blocks (0-8) are interleaved over
133 * 3 disks (0, 1, 2) starting at block offset 0 on any component disk,
134 * the next 4 blocks (9-12) are interleaved over 2 disks (0, 2) starting
135 * at component block 3, and the remaining blocks (13-14) are on disk
136 * 2 starting at offset 5.
139 int ii_ndisk; /* # of disks range is interleaved over */
140 daddr_t ii_startblk; /* starting scaled block # for range */
141 daddr_t ii_startoff; /* starting component offset (block #) */
142 int *ii_index; /* ordered list of components in range */
146 * Component info table.
147 * Describes a single component of a concatenated disk.
150 daddr_t ci_size; /* size */
151 struct g_provider *ci_provider; /* provider */
152 struct g_consumer *ci_consumer; /* consumer */
156 * A concatenated disk is described by this structure.
160 LIST_ENTRY(ccd_s) list;
162 int sc_unit; /* logical unit number */
163 int sc_flags; /* flags */
164 daddr_t sc_size; /* size of ccd */
165 int sc_ileave; /* interleave */
166 u_int sc_ndisks; /* number of components */
167 struct ccdcinfo *sc_cinfo; /* component info */
168 struct ccdiinfo *sc_itable; /* interleave table */
169 uint32_t sc_secsize; /* # bytes per sector */
170 int sc_pick; /* side of mirror picked */
171 daddr_t sc_blk[2]; /* mirror localization */
172 uint32_t sc_offset; /* actual offset used */
175 static g_start_t g_ccd_start;
176 static void ccdiodone(struct bio *bp);
177 static void ccdinterleave(struct ccd_s *);
178 static int ccdinit(struct gctl_req *req, struct ccd_s *);
179 static int ccdbuffer(struct bio **ret, struct ccd_s *,
180 struct bio *, daddr_t, caddr_t, long);
183 g_ccd_orphan(struct g_consumer *cp)
186 * XXX: We don't do anything here. It is not obvious
187 * XXX: what DTRT would be, so we do what the previous
188 * XXX: code did: ignore it and let the user cope.
193 g_ccd_access(struct g_provider *pp, int dr, int dw, int de)
196 struct g_consumer *cp1, *cp2;
204 LIST_FOREACH(cp1, &gp->consumer, consumer) {
205 error = g_access(cp1, dr, dw, de);
207 LIST_FOREACH(cp2, &gp->consumer, consumer) {
210 g_access(cp2, -dr, -dw, -de);
219 * Free the softc and its substructures.
222 g_ccd_freesc(struct ccd_s *sc)
226 g_free(sc->sc_cinfo);
227 if (sc->sc_itable != NULL) {
228 for (ii = sc->sc_itable; ii->ii_ndisk > 0; ii++)
229 g_free(ii->ii_index);
230 g_free(sc->sc_itable);
236 ccdinit(struct gctl_req *req, struct ccd_s *cs)
251 if (cs->sc_flags & CCDF_LINUX) {
254 if (cs->sc_flags & CCDF_MIRROR && cs->sc_ndisks != 2)
255 gctl_error(req, "Mirror mode for Linux raids is "
256 "only supported with 2 devices");
258 if (cs->sc_flags & CCDF_NO_OFFSET)
261 cs->sc_offset = CCD_OFFSET;
263 for (ix = 0; ix < cs->sc_ndisks; ix++) {
264 ci = &cs->sc_cinfo[ix];
266 mediasize = ci->ci_provider->mediasize;
267 sectorsize = ci->ci_provider->sectorsize;
268 if (sectorsize > maxsecsize)
269 maxsecsize = sectorsize;
270 size = mediasize / DEV_BSIZE - cs->sc_offset;
272 /* Truncate to interleave boundary */
274 if (cs->sc_ileave > 1)
275 size -= size % cs->sc_ileave;
278 gctl_error(req, "Component %s has effective size zero",
279 ci->ci_provider->name);
283 if (minsize == 0 || size < minsize)
290 * Don't allow the interleave to be smaller than
291 * the biggest component sector.
293 if ((cs->sc_ileave > 0) &&
294 (cs->sc_ileave < (maxsecsize / DEV_BSIZE))) {
295 gctl_error(req, "Interleave to small for sector size");
300 * If uniform interleave is desired set all sizes to that of
301 * the smallest component. This will guarantee that a single
302 * interleave table is generated.
304 * Lost space must be taken into account when calculating the
305 * overall size. Half the space is lost when CCDF_MIRROR is
308 if (cs->sc_flags & CCDF_UNIFORM) {
309 for (ix = 0; ix < cs->sc_ndisks; ix++) {
310 ci = &cs->sc_cinfo[ix];
311 ci->ci_size = minsize;
313 cs->sc_size = cs->sc_ndisks * minsize;
316 if (cs->sc_flags & CCDF_MIRROR) {
318 * Check to see if an even number of components
319 * have been specified. The interleave must also
320 * be non-zero in order for us to be able to
321 * guarantee the topology.
323 if (cs->sc_ndisks % 2) {
325 "Mirroring requires an even number of disks");
328 if (cs->sc_ileave == 0) {
330 "An interleave must be specified when mirroring");
333 cs->sc_size = (cs->sc_ndisks/2) * minsize;
337 * Construct the interleave table.
342 * Create pseudo-geometry based on 1MB cylinders. It's
345 cs->sc_secsize = maxsecsize;
351 ccdinterleave(struct ccd_s *cs)
353 struct ccdcinfo *ci, *smallci;
360 * Allocate an interleave table. The worst case occurs when each
361 * of N disks is of a different size, resulting in N interleave
364 * Chances are this is too big, but we don't care.
366 size = (cs->sc_ndisks + 1) * sizeof(struct ccdiinfo);
367 cs->sc_itable = g_malloc(size, M_WAITOK | M_ZERO);
370 * Trivial case: no interleave (actually interleave of disk size).
371 * Each table entry represents a single component in its entirety.
373 * An interleave of 0 may not be used with a mirror setup.
375 if (cs->sc_ileave == 0) {
379 for (ix = 0; ix < cs->sc_ndisks; ix++) {
380 /* Allocate space for ii_index. */
381 ii->ii_index = g_malloc(sizeof(int), M_WAITOK);
383 ii->ii_startblk = bn;
385 ii->ii_index[0] = ix;
386 bn += cs->sc_cinfo[ix].ci_size;
394 * The following isn't fast or pretty; it doesn't have to be.
398 for (ii = cs->sc_itable; ; ii++) {
400 * Allocate space for ii_index. We might allocate more then
403 ii->ii_index = g_malloc((sizeof(int) * cs->sc_ndisks),
407 * Locate the smallest of the remaining components
410 for (ci = cs->sc_cinfo; ci < &cs->sc_cinfo[cs->sc_ndisks];
412 if (ci->ci_size > size &&
414 ci->ci_size < smallci->ci_size)) {
420 * Nobody left, all done
422 if (smallci == NULL) {
424 g_free(ii->ii_index);
430 * Record starting logical block using an sc_ileave blocksize.
432 ii->ii_startblk = bn / cs->sc_ileave;
435 * Record starting component block using an sc_ileave
436 * blocksize. This value is relative to the beginning of
439 ii->ii_startoff = lbn;
442 * Determine how many disks take part in this interleave
443 * and record their indices.
446 for (ci = cs->sc_cinfo;
447 ci < &cs->sc_cinfo[cs->sc_ndisks]; ci++) {
448 if (ci->ci_size >= smallci->ci_size) {
449 ii->ii_index[ix++] = ci - cs->sc_cinfo;
453 bn += ix * (smallci->ci_size - size);
454 lbn = smallci->ci_size / cs->sc_ileave;
455 size = smallci->ci_size;
460 g_ccd_start(struct bio *bp)
469 cs = bp->bio_to->geom->softc;
472 * Block all GETATTR requests, we wouldn't know which of our
473 * subdevices we should ship it off to.
474 * XXX: this may not be the right policy.
476 if(bp->bio_cmd == BIO_GETATTR) {
477 g_io_deliver(bp, EINVAL);
482 * Translate the partition-relative block number to an absolute.
484 bn = bp->bio_offset / cs->sc_secsize;
487 * Allocate component buffers and fire off the requests
490 for (bcount = bp->bio_length; bcount > 0; bcount -= rcount) {
491 err = ccdbuffer(cbp, cs, bp, bn, addr, bcount);
493 bp->bio_completed += bcount;
494 if (bp->bio_error == 0)
496 if (bp->bio_completed == bp->bio_length)
497 g_io_deliver(bp, bp->bio_error);
500 rcount = cbp[0]->bio_length;
502 if (cs->sc_flags & CCDF_MIRROR) {
504 * Mirroring. Writes go to both disks, reads are
505 * taken from whichever disk seems most appropriate.
507 * We attempt to localize reads to the disk whos arm
508 * is nearest the read request. We ignore seeks due
509 * to writes when making this determination and we
510 * also try to avoid hogging.
512 if (cbp[0]->bio_cmd != BIO_READ) {
513 g_io_request(cbp[0], cbp[0]->bio_from);
514 g_io_request(cbp[1], cbp[1]->bio_from);
516 int pick = cs->sc_pick;
517 daddr_t range = cs->sc_size / 16;
519 if (bn < cs->sc_blk[pick] - range ||
520 bn > cs->sc_blk[pick] + range
522 cs->sc_pick = pick = 1 - pick;
524 cs->sc_blk[pick] = bn + btodb(rcount);
525 g_io_request(cbp[pick], cbp[pick]->bio_from);
531 g_io_request(cbp[0], cbp[0]->bio_from);
539 * Build a component buffer header.
542 ccdbuffer(struct bio **cb, struct ccd_s *cs, struct bio *bp, daddr_t bn, caddr_t addr, long bcount)
544 struct ccdcinfo *ci, *ci2 = NULL;
550 * Determine which component bn falls in.
555 if (cs->sc_ileave == 0) {
557 * Serially concatenated and neither a mirror nor a parity
558 * config. This is a special case.
563 for (ci = cs->sc_cinfo; cbn >= sblk + ci->ci_size; ci++)
571 * Calculate cbn, the logical superblock (sc_ileave chunks),
572 * and cboff, a normal block offset (DEV_BSIZE chunks) relative
575 cboff = cbn % cs->sc_ileave; /* DEV_BSIZE gran */
576 cbn = cbn / cs->sc_ileave; /* DEV_BSIZE * ileave gran */
579 * Figure out which interleave table to use.
581 for (ii = cs->sc_itable; ii->ii_ndisk; ii++) {
582 if (ii->ii_startblk > cbn)
588 * off is the logical superblock relative to the beginning
589 * of this interleave block.
591 off = cbn - ii->ii_startblk;
594 * We must calculate which disk component to use (ccdisk),
595 * and recalculate cbn to be the superblock relative to
596 * the beginning of the component. This is typically done by
597 * adding 'off' and ii->ii_startoff together. However, 'off'
598 * must typically be divided by the number of components in
599 * this interleave array to be properly convert it from a
600 * CCD-relative logical superblock number to a
601 * component-relative superblock number.
603 if (ii->ii_ndisk == 1) {
605 * When we have just one disk, it can't be a mirror
606 * or a parity config.
608 ccdisk = ii->ii_index[0];
609 cbn = ii->ii_startoff + off;
611 if (cs->sc_flags & CCDF_MIRROR) {
613 * We have forced a uniform mapping, resulting
614 * in a single interleave array. We double
615 * up on the first half of the available
616 * components and our mirror is in the second
617 * half. This only works with a single
618 * interleave array because doubling up
619 * doubles the number of sectors, so there
620 * cannot be another interleave array because
621 * the next interleave array's calculations
624 int ndisk2 = ii->ii_ndisk / 2;
625 ccdisk = ii->ii_index[off % ndisk2];
626 cbn = ii->ii_startoff + off / ndisk2;
627 ci2 = &cs->sc_cinfo[ccdisk + ndisk2];
629 ccdisk = ii->ii_index[off % ii->ii_ndisk];
630 cbn = ii->ii_startoff + off / ii->ii_ndisk;
634 ci = &cs->sc_cinfo[ccdisk];
637 * Convert cbn from a superblock to a normal block so it
638 * can be used to calculate (along with cboff) the normal
639 * block index into this particular disk.
641 cbn *= cs->sc_ileave;
645 * Fill in the component buf structure.
647 cbp = g_clone_bio(bp);
650 cbp->bio_done = g_std_done;
651 cbp->bio_offset = dbtob(cbn + cboff + cs->sc_offset);
652 cbp->bio_data = addr;
653 if (cs->sc_ileave == 0)
654 cbc = dbtob((off_t)(ci->ci_size - cbn));
656 cbc = dbtob((off_t)(cs->sc_ileave - cboff));
657 cbp->bio_length = (cbc < bcount) ? cbc : bcount;
659 cbp->bio_from = ci->ci_consumer;
662 if (cs->sc_flags & CCDF_MIRROR) {
663 cbp = g_clone_bio(bp);
666 cbp->bio_done = cb[0]->bio_done = ccdiodone;
667 cbp->bio_offset = cb[0]->bio_offset;
668 cbp->bio_data = cb[0]->bio_data;
669 cbp->bio_length = cb[0]->bio_length;
670 cbp->bio_from = ci2->ci_consumer;
671 cbp->bio_caller1 = cb[0];
672 cb[0]->bio_caller1 = cbp;
679 * Called only for mirrored operations.
682 ccdiodone(struct bio *cbp)
684 struct bio *mbp, *pbp;
686 mbp = cbp->bio_caller1;
687 pbp = cbp->bio_parent;
689 if (pbp->bio_cmd == BIO_READ) {
690 if (cbp->bio_error == 0) {
691 /* We will not be needing the partner bio */
700 /* Try partner the bio instead */
701 mbp->bio_caller1 = NULL;
704 g_io_request(mbp, mbp->bio_from);
706 * XXX: If this comes back OK, we should actually
707 * try to write the good data on the failed mirror
715 mbp->bio_caller1 = NULL;
717 if (cbp->bio_error != 0 && pbp->bio_error == 0)
718 pbp->bio_error = cbp->bio_error;
726 g_ccd_create(struct gctl_req *req, struct g_class *mp)
728 int *unit, *ileave, *nprovider;
730 struct g_consumer *cp;
731 struct g_provider *pp;
738 unit = gctl_get_paraml(req, "unit", sizeof (*unit));
740 gctl_error(req, "unit parameter not given");
743 ileave = gctl_get_paraml(req, "ileave", sizeof (*ileave));
744 if (ileave == NULL) {
745 gctl_error(req, "ileave parameter not given");
748 nprovider = gctl_get_paraml(req, "nprovider", sizeof (*nprovider));
749 if (nprovider == NULL) {
750 gctl_error(req, "nprovider parameter not given");
754 /* Check for duplicate unit */
755 LIST_FOREACH(gp, &mp->geom, geom) {
757 if (sc != NULL && sc->sc_unit == *unit) {
758 gctl_error(req, "Unit %d already configured", *unit);
763 if (*nprovider <= 0) {
764 gctl_error(req, "Bogus nprovider argument (= %d)", *nprovider);
768 /* Check all providers are valid */
769 for (i = 0; i < *nprovider; i++) {
770 snprintf(buf, sizeof(buf), "provider%d", i);
771 pp = gctl_get_provider(req, buf);
776 gp = g_new_geomf(mp, "ccd%d", *unit);
777 sc = g_malloc(sizeof *sc, M_WAITOK | M_ZERO);
779 sc->sc_ndisks = *nprovider;
781 /* Allocate space for the component info. */
782 sc->sc_cinfo = g_malloc(sc->sc_ndisks * sizeof(struct ccdcinfo),
785 /* Create consumers and attach to all providers */
786 for (i = 0; i < *nprovider; i++) {
787 snprintf(buf, sizeof(buf), "provider%d", i);
788 pp = gctl_get_provider(req, buf);
789 cp = g_new_consumer(gp);
790 error = g_attach(cp, pp);
791 KASSERT(error == 0, ("attach to %s failed", pp->name));
792 sc->sc_cinfo[i].ci_consumer = cp;
793 sc->sc_cinfo[i].ci_provider = pp;
797 sc->sc_ileave = *ileave;
799 if (gctl_get_param(req, "no_offset", NULL))
800 sc->sc_flags |= CCDF_NO_OFFSET;
801 if (gctl_get_param(req, "linux", NULL))
802 sc->sc_flags |= CCDF_LINUX;
804 if (gctl_get_param(req, "uniform", NULL))
805 sc->sc_flags |= CCDF_UNIFORM;
806 if (gctl_get_param(req, "mirror", NULL))
807 sc->sc_flags |= CCDF_MIRROR;
809 if (sc->sc_ileave == 0 && (sc->sc_flags & CCDF_MIRROR)) {
810 printf("%s: disabling mirror, interleave is 0\n", gp->name);
811 sc->sc_flags &= ~(CCDF_MIRROR);
814 if ((sc->sc_flags & CCDF_MIRROR) && !(sc->sc_flags & CCDF_UNIFORM)) {
815 printf("%s: mirror/parity forces uniform flag\n", gp->name);
816 sc->sc_flags |= CCDF_UNIFORM;
819 error = ccdinit(req, sc);
823 g_wither_geom(gp, ENXIO);
827 pp = g_new_providerf(gp, "%s", gp->name);
828 pp->mediasize = sc->sc_size * (off_t)sc->sc_secsize;
829 pp->sectorsize = sc->sc_secsize;
830 g_error_provider(pp, 0);
832 sb = sbuf_new_auto();
833 sbuf_printf(sb, "ccd%d: %d components ", sc->sc_unit, *nprovider);
834 for (i = 0; i < *nprovider; i++) {
835 sbuf_printf(sb, "%s%s",
837 sc->sc_cinfo[i].ci_provider->name);
839 sbuf_printf(sb, "), %jd blocks ", (off_t)pp->mediasize / DEV_BSIZE);
840 if (sc->sc_ileave != 0)
841 sbuf_printf(sb, "interleaved at %d blocks\n",
844 sbuf_printf(sb, "concatenated\n");
846 gctl_set_param_err(req, "output", sbuf_data(sb), sbuf_len(sb) + 1);
851 g_ccd_destroy_geom(struct gctl_req *req, struct g_class *mp, struct g_geom *gp)
853 struct g_provider *pp;
858 pp = LIST_FIRST(&gp->provider);
859 if (sc == NULL || pp == NULL)
861 if (pp->acr != 0 || pp->acw != 0 || pp->ace != 0) {
862 gctl_error(req, "%s is open(r%dw%de%d)", gp->name,
863 pp->acr, pp->acw, pp->ace);
868 g_wither_geom(gp, ENXIO);
873 g_ccd_list(struct gctl_req *req, struct g_class *mp)
880 up = gctl_get_paraml(req, "unit", sizeof (*up));
882 gctl_error(req, "unit parameter not given");
886 sb = sbuf_new_auto();
887 LIST_FOREACH(gp, &mp->geom, geom) {
889 if (cs == NULL || (unit >= 0 && unit != cs->sc_unit))
891 sbuf_printf(sb, "ccd%d\t\t%d\t%d\t",
892 cs->sc_unit, cs->sc_ileave, cs->sc_flags & CCDF_USERMASK);
894 for (i = 0; i < cs->sc_ndisks; ++i) {
895 sbuf_printf(sb, "%s/dev/%s", i == 0 ? "" : " ",
896 cs->sc_cinfo[i].ci_provider->name);
898 sbuf_printf(sb, "\n");
901 gctl_set_param_err(req, "output", sbuf_data(sb), sbuf_len(sb) + 1);
906 g_ccd_config(struct gctl_req *req, struct g_class *mp, char const *verb)
911 if (!strcmp(verb, "create geom")) {
912 g_ccd_create(req, mp);
913 } else if (!strcmp(verb, "destroy geom")) {
914 gp = gctl_get_geom(req, mp, "geom");
916 g_ccd_destroy_geom(req, mp, gp);
917 } else if (!strcmp(verb, "list")) {
920 gctl_error(req, "unknown verb");
924 static struct g_class g_ccd_class = {
926 .version = G_VERSION,
927 .ctlreq = g_ccd_config,
928 .destroy_geom = g_ccd_destroy_geom,
929 .start = g_ccd_start,
930 .orphan = g_ccd_orphan,
931 .access = g_ccd_access,
934 DECLARE_GEOM_CLASS(g_ccd_class, g_ccd);
935 MODULE_VERSION(geom_ccd, 0);