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 * $FreeBSD: head/sys/geom/geom_slice.c 93778 2002-04-04 09:58:20Z phk $
36 */
37
38
39#include <sys/param.h>
40#ifndef _KERNEL
41#include <stdio.h>
42#include <unistd.h>
43#include <stdlib.h>
44#include <signal.h>
45#include <err.h>
46#else
47#include <sys/systm.h>
48#include <sys/kernel.h>
49#include <sys/malloc.h>
50#include <sys/bio.h>
51#include <sys/sysctl.h>
52#include <sys/proc.h>
53#include <sys/kthread.h>
54#include <sys/lock.h>
55#include <sys/mutex.h>
56#endif
57#include <sys/errno.h>
58#include <sys/sbuf.h>
59#include <geom/geom.h>
60#include <geom/geom_slice.h>
61#include <machine/stdarg.h>
62
63static g_orphan_t g_slice_orphan;
64static g_access_t g_slice_access;
65static g_start_t g_slice_start;
66
67struct g_slicer *
68g_slice_init(unsigned nslice, unsigned scsize)
69{
70 struct g_slicer *gsp;
71
72 gsp = g_malloc(sizeof *gsp, M_WAITOK | M_ZERO);
73 gsp->softc = g_malloc(scsize, M_WAITOK | M_ZERO);
74 gsp->slices = g_malloc(nslice * sizeof(struct g_slice), M_WAITOK | M_ZERO);
75 gsp->nslice = nslice;
76 return (gsp);
77}
78
79static int
80g_slice_access(struct g_provider *pp, int dr, int dw, int de)
81{
82 int error, i;
83 struct g_geom *gp;
84 struct g_consumer *cp;
85 struct g_provider *pp2;
86 struct g_slicer *gsp;
87 struct g_slice *gsl, *gsl2;
88
89 gp = pp->geom;
90 cp = LIST_FIRST(&gp->consumer);
91 KASSERT (cp != NULL, ("g_slice_access but no consumer"));
92 gsp = gp->softc;
93 gsl = &gsp->slices[pp->index];
94 for (i = 0; i < gsp->nslice; i++) {
95 gsl2 = &gsp->slices[i];
96 if (gsl2->length == 0)
97 continue;
98 if (i == pp->index)
99 continue;
100 if (gsl->offset + gsl->length <= gsl2->offset)
101 continue;
102 if (gsl2->offset + gsl2->length <= gsl->offset)
103 continue;
104 /* overlap */
105 pp2 = gsl2->provider;
106 if ((pp->acw + dw) > 0 && pp2->ace > 0)
107 return (EPERM);
108 if ((pp->ace + de) > 0 && pp2->acw > 0)
109 return (EPERM);
110 }
111 /* On first open, grab an extra "exclusive" bit */
112 if (cp->acr == 0 && cp->acw == 0 && cp->ace == 0)
113 de++;
114 /* ... and let go of it on last close */
115 if ((cp->acr + dr) == 0 && (cp->acw + dw) == 0 && (cp->ace + de) == 1)
116 de--;
117 error = g_access_rel(cp, dr, dw, de);
118 pp->mediasize = gsp->slices[pp->index].length;
119 return (error);
120}
121
122static void
123g_slice_start(struct bio *bp)
124{
125 struct bio *bp2;
126 struct g_provider *pp;
127 struct g_geom *gp;
128 struct g_consumer *cp;
129 struct g_slicer *gsp;
130 struct g_slice *gsl;
131 int index;
132
133 pp = bp->bio_to;
134 gp = pp->geom;
135 gsp = gp->softc;
136 cp = LIST_FIRST(&gp->consumer);
137 index = pp->index;
138 switch(bp->bio_cmd) {
139 case BIO_READ:
140 case BIO_WRITE:
141 case BIO_DELETE:
142 gsl = &gsp->slices[index];
143 if (bp->bio_offset > gsl->length) {
144 bp->bio_error = EINVAL; /* XXX: EWHAT ? */
145 g_io_deliver(bp);
146 return;
147 }
148 bp2 = g_clone_bio(bp);
149 if (bp2->bio_offset + bp2->bio_length > gsl->length)
150 bp2->bio_length = gsl->length - bp2->bio_offset;
151 bp2->bio_done = g_std_done;
152 bp2->bio_offset += gsl->offset;
153 g_io_request(bp2, cp);
154 return;
155 case BIO_GETATTR:
156 case BIO_SETATTR:
157 if (g_haveattr_off_t(bp, "GEOM::mediasize",
158 gsp->slices[index].length))
159 return;
160 if (gsp->start(bp))
161 return;
162 bp2 = g_clone_bio(bp);
163 bp2->bio_done = g_std_done;
164 g_io_request(bp2, cp);
165 break;
166 default:
167 bp->bio_error = EOPNOTSUPP;
168 g_io_deliver(bp);
169 return;
170 }
171}
172
173void
174g_slice_dumpconf(struct sbuf *sb, char *indent, struct g_geom *gp, struct g_consumer *cp __unused, struct g_provider *pp)
175{
176 struct g_mbr_softc *mp;
177 struct g_slicer *gsp;
178
179 gsp = gp->softc;
180 mp = gsp->softc;
181 if (pp != NULL) {
182 sbuf_printf(sb, "%s<index>%u</index>\n", indent, pp->index);
183 sbuf_printf(sb, "%s<length>%llu</length>\n",
184 indent, (unsigned long long)gsp->slices[pp->index].length);
185 sbuf_printf(sb, "%s<seclength>%llu</seclength>\n", indent,
186 (unsigned long long)gsp->slices[pp->index].length / 512);
187 sbuf_printf(sb, "%s<offset>%llu</offset>\n", indent,
188 (unsigned long long)gsp->slices[pp->index].offset);
189 sbuf_printf(sb, "%s<secoffset>%llu</secoffset>\n", indent,
190 (unsigned long long)gsp->slices[pp->index].offset / 512);
191 }
192}
193
194struct g_provider *
195g_slice_addslice(struct g_geom *gp, int index, off_t offset, off_t length, char *fmt, ...)
196{
197 struct g_provider *pp;
198 struct g_slicer *gsp;
199 va_list ap;
200 struct sbuf *sb;
201
202 g_trace(G_T_TOPOLOGY, "g_slice_addslice()");
203 g_topology_lock();
204 gsp = gp->softc;
205 va_start(ap, fmt);
206 sb = sbuf_new(NULL, NULL, 0, SBUF_AUTOEXTEND);
207 sbuf_vprintf(sb, fmt, ap);
208 sbuf_finish(sb);
209 pp = g_new_providerf(gp, sbuf_data(sb));
210
211 pp->index = index;
212 gsp->slices[index].length = length;
213 gsp->slices[index].offset = offset;
214 gsp->slices[index].provider = pp;
215 sbuf_delete(sb);
216 g_topology_unlock();
217 return(pp);
218}
219
220struct g_geom *
221g_slice_new(struct g_class *mp, int slices, struct g_provider *pp, struct g_consumer **cpp, void *extrap, int extra, g_slice_start_t *start)
222{
223 struct g_geom *gp;
224 struct g_slicer *gsp;
225 struct g_consumer *cp;
226 void **vp;
227 int error;
228
229 g_topology_assert();
230 vp = (void **)extrap;
231 gp = g_new_geomf(mp, "%s", pp->name);
232 gsp = g_slice_init(slices, extra);
233 gsp->start = start;
234 gp->access = g_slice_access;
235 gp->orphan = g_slice_orphan;
236 gp->softc = gsp;
237 gp->start = g_slice_start;
238 gp->spoiled = g_std_spoiled;
239 gp->dumpconf = g_slice_dumpconf;
240 cp = g_new_consumer(gp);
241 g_attach(cp, pp);
242 error = g_access_rel(cp, 1, 0, 0);
243 if (error) {
244 g_dettach(cp);
245 g_destroy_consumer(cp);
246 g_free(gsp->slices);
247 g_free(gp->softc);
248 g_destroy_geom(gp);
249 return (NULL);
250 }
251 *vp = gsp->softc;
252 *cpp = cp;
253 return (gp);
254}
255
256static void
257g_slice_orphan(struct g_consumer *cp)
258{
259 struct g_geom *gp;
260 struct g_provider *pp;
261 int error;
262
263 g_trace(G_T_TOPOLOGY, "g_slice_orphan(%p/%s)", cp, cp->provider->name);
264 g_topology_assert();
265 KASSERT(cp->provider->error != 0,
266 ("g_slice_orphan with error == 0"));
267
268 gp = cp->geom;
269 gp->flags |= G_GEOM_WITHER;
270 /* First prevent any new requests */
271 error = cp->provider->error;
272 LIST_FOREACH(pp, &gp->provider, provider)
273 g_orphan_provider(pp, error);
274
275 return;
276}
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 * $FreeBSD: head/sys/geom/geom_slice.c 93778 2002-04-04 09:58:20Z phk $
36 */
37
38
39#include <sys/param.h>
40#ifndef _KERNEL
41#include <stdio.h>
42#include <unistd.h>
43#include <stdlib.h>
44#include <signal.h>
45#include <err.h>
46#else
47#include <sys/systm.h>
48#include <sys/kernel.h>
49#include <sys/malloc.h>
50#include <sys/bio.h>
51#include <sys/sysctl.h>
52#include <sys/proc.h>
53#include <sys/kthread.h>
54#include <sys/lock.h>
55#include <sys/mutex.h>
56#endif
57#include <sys/errno.h>
58#include <sys/sbuf.h>
59#include <geom/geom.h>
60#include <geom/geom_slice.h>
61#include <machine/stdarg.h>
62
63static g_orphan_t g_slice_orphan;
64static g_access_t g_slice_access;
65static g_start_t g_slice_start;
66
67struct g_slicer *
68g_slice_init(unsigned nslice, unsigned scsize)
69{
70 struct g_slicer *gsp;
71
72 gsp = g_malloc(sizeof *gsp, M_WAITOK | M_ZERO);
73 gsp->softc = g_malloc(scsize, M_WAITOK | M_ZERO);
74 gsp->slices = g_malloc(nslice * sizeof(struct g_slice), M_WAITOK | M_ZERO);
75 gsp->nslice = nslice;
76 return (gsp);
77}
78
79static int
80g_slice_access(struct g_provider *pp, int dr, int dw, int de)
81{
82 int error, i;
83 struct g_geom *gp;
84 struct g_consumer *cp;
85 struct g_provider *pp2;
86 struct g_slicer *gsp;
87 struct g_slice *gsl, *gsl2;
88
89 gp = pp->geom;
90 cp = LIST_FIRST(&gp->consumer);
91 KASSERT (cp != NULL, ("g_slice_access but no consumer"));
92 gsp = gp->softc;
93 gsl = &gsp->slices[pp->index];
94 for (i = 0; i < gsp->nslice; i++) {
95 gsl2 = &gsp->slices[i];
96 if (gsl2->length == 0)
97 continue;
98 if (i == pp->index)
99 continue;
100 if (gsl->offset + gsl->length <= gsl2->offset)
101 continue;
102 if (gsl2->offset + gsl2->length <= gsl->offset)
103 continue;
104 /* overlap */
105 pp2 = gsl2->provider;
106 if ((pp->acw + dw) > 0 && pp2->ace > 0)
107 return (EPERM);
108 if ((pp->ace + de) > 0 && pp2->acw > 0)
109 return (EPERM);
110 }
111 /* On first open, grab an extra "exclusive" bit */
112 if (cp->acr == 0 && cp->acw == 0 && cp->ace == 0)
113 de++;
114 /* ... and let go of it on last close */
115 if ((cp->acr + dr) == 0 && (cp->acw + dw) == 0 && (cp->ace + de) == 1)
116 de--;
117 error = g_access_rel(cp, dr, dw, de);
118 pp->mediasize = gsp->slices[pp->index].length;
119 return (error);
120}
121
122static void
123g_slice_start(struct bio *bp)
124{
125 struct bio *bp2;
126 struct g_provider *pp;
127 struct g_geom *gp;
128 struct g_consumer *cp;
129 struct g_slicer *gsp;
130 struct g_slice *gsl;
131 int index;
132
133 pp = bp->bio_to;
134 gp = pp->geom;
135 gsp = gp->softc;
136 cp = LIST_FIRST(&gp->consumer);
137 index = pp->index;
138 switch(bp->bio_cmd) {
139 case BIO_READ:
140 case BIO_WRITE:
141 case BIO_DELETE:
142 gsl = &gsp->slices[index];
143 if (bp->bio_offset > gsl->length) {
144 bp->bio_error = EINVAL; /* XXX: EWHAT ? */
145 g_io_deliver(bp);
146 return;
147 }
148 bp2 = g_clone_bio(bp);
149 if (bp2->bio_offset + bp2->bio_length > gsl->length)
150 bp2->bio_length = gsl->length - bp2->bio_offset;
151 bp2->bio_done = g_std_done;
152 bp2->bio_offset += gsl->offset;
153 g_io_request(bp2, cp);
154 return;
155 case BIO_GETATTR:
156 case BIO_SETATTR:
157 if (g_haveattr_off_t(bp, "GEOM::mediasize",
158 gsp->slices[index].length))
159 return;
160 if (gsp->start(bp))
161 return;
162 bp2 = g_clone_bio(bp);
163 bp2->bio_done = g_std_done;
164 g_io_request(bp2, cp);
165 break;
166 default:
167 bp->bio_error = EOPNOTSUPP;
168 g_io_deliver(bp);
169 return;
170 }
171}
172
173void
174g_slice_dumpconf(struct sbuf *sb, char *indent, struct g_geom *gp, struct g_consumer *cp __unused, struct g_provider *pp)
175{
176 struct g_mbr_softc *mp;
177 struct g_slicer *gsp;
178
179 gsp = gp->softc;
180 mp = gsp->softc;
181 if (pp != NULL) {
182 sbuf_printf(sb, "%s<index>%u</index>\n", indent, pp->index);
183 sbuf_printf(sb, "%s<length>%llu</length>\n",
184 indent, (unsigned long long)gsp->slices[pp->index].length);
185 sbuf_printf(sb, "%s<seclength>%llu</seclength>\n", indent,
186 (unsigned long long)gsp->slices[pp->index].length / 512);
187 sbuf_printf(sb, "%s<offset>%llu</offset>\n", indent,
188 (unsigned long long)gsp->slices[pp->index].offset);
189 sbuf_printf(sb, "%s<secoffset>%llu</secoffset>\n", indent,
190 (unsigned long long)gsp->slices[pp->index].offset / 512);
191 }
192}
193
194struct g_provider *
195g_slice_addslice(struct g_geom *gp, int index, off_t offset, off_t length, char *fmt, ...)
196{
197 struct g_provider *pp;
198 struct g_slicer *gsp;
199 va_list ap;
200 struct sbuf *sb;
201
202 g_trace(G_T_TOPOLOGY, "g_slice_addslice()");
203 g_topology_lock();
204 gsp = gp->softc;
205 va_start(ap, fmt);
206 sb = sbuf_new(NULL, NULL, 0, SBUF_AUTOEXTEND);
207 sbuf_vprintf(sb, fmt, ap);
208 sbuf_finish(sb);
209 pp = g_new_providerf(gp, sbuf_data(sb));
210
211 pp->index = index;
212 gsp->slices[index].length = length;
213 gsp->slices[index].offset = offset;
214 gsp->slices[index].provider = pp;
215 sbuf_delete(sb);
216 g_topology_unlock();
217 return(pp);
218}
219
220struct g_geom *
221g_slice_new(struct g_class *mp, int slices, struct g_provider *pp, struct g_consumer **cpp, void *extrap, int extra, g_slice_start_t *start)
222{
223 struct g_geom *gp;
224 struct g_slicer *gsp;
225 struct g_consumer *cp;
226 void **vp;
227 int error;
228
229 g_topology_assert();
230 vp = (void **)extrap;
231 gp = g_new_geomf(mp, "%s", pp->name);
232 gsp = g_slice_init(slices, extra);
233 gsp->start = start;
234 gp->access = g_slice_access;
235 gp->orphan = g_slice_orphan;
236 gp->softc = gsp;
237 gp->start = g_slice_start;
238 gp->spoiled = g_std_spoiled;
239 gp->dumpconf = g_slice_dumpconf;
240 cp = g_new_consumer(gp);
241 g_attach(cp, pp);
242 error = g_access_rel(cp, 1, 0, 0);
243 if (error) {
244 g_dettach(cp);
245 g_destroy_consumer(cp);
246 g_free(gsp->slices);
247 g_free(gp->softc);
248 g_destroy_geom(gp);
249 return (NULL);
250 }
251 *vp = gsp->softc;
252 *cpp = cp;
253 return (gp);
254}
255
256static void
257g_slice_orphan(struct g_consumer *cp)
258{
259 struct g_geom *gp;
260 struct g_provider *pp;
261 int error;
262
263 g_trace(G_T_TOPOLOGY, "g_slice_orphan(%p/%s)", cp, cp->provider->name);
264 g_topology_assert();
265 KASSERT(cp->provider->error != 0,
266 ("g_slice_orphan with error == 0"));
267
268 gp = cp->geom;
269 gp->flags |= G_GEOM_WITHER;
270 /* First prevent any new requests */
271 error = cp->provider->error;
272 LIST_FOREACH(pp, &gp->provider, provider)
273 g_orphan_provider(pp, error);
274
275 return;
276}