rumpblk.c revision 1.44 1 1.44 pooka /* $NetBSD: rumpblk.c,v 1.44 2011/02/03 10:06:06 pooka Exp $ */
2 1.1 pooka
3 1.1 pooka /*
4 1.1 pooka * Copyright (c) 2009 Antti Kantee. All Rights Reserved.
5 1.1 pooka *
6 1.1 pooka * Development of this software was supported by the
7 1.1 pooka * Finnish Cultural Foundation.
8 1.1 pooka *
9 1.1 pooka * Redistribution and use in source and binary forms, with or without
10 1.1 pooka * modification, are permitted provided that the following conditions
11 1.1 pooka * are met:
12 1.1 pooka * 1. Redistributions of source code must retain the above copyright
13 1.1 pooka * notice, this list of conditions and the following disclaimer.
14 1.1 pooka * 2. Redistributions in binary form must reproduce the above copyright
15 1.1 pooka * notice, this list of conditions and the following disclaimer in the
16 1.1 pooka * documentation and/or other materials provided with the distribution.
17 1.1 pooka *
18 1.1 pooka * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
19 1.1 pooka * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
20 1.1 pooka * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
21 1.1 pooka * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
22 1.1 pooka * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23 1.1 pooka * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
24 1.1 pooka * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25 1.1 pooka * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26 1.1 pooka * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27 1.1 pooka * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 1.1 pooka * SUCH DAMAGE.
29 1.1 pooka */
30 1.1 pooka
31 1.1 pooka /*
32 1.1 pooka * Block device emulation. Presents a block device interface and
33 1.1 pooka * uses rumpuser system calls to satisfy I/O requests.
34 1.16 pooka *
35 1.16 pooka * We provide fault injection. The driver can be made to fail
36 1.16 pooka * I/O occasionally.
37 1.16 pooka *
38 1.16 pooka * The driver also provides an optimization for regular files by
39 1.16 pooka * using memory-mapped I/O. This avoids kernel access for every
40 1.16 pooka * I/O operation. It also gives finer-grained control of how to
41 1.16 pooka * flush data. Additionally, in case the rump kernel dumps core,
42 1.16 pooka * we get way less carnage.
43 1.29 pooka *
44 1.29 pooka * However, it is quite costly in writing large amounts of
45 1.29 pooka * file data, since old contents cannot merely be overwritten, but
46 1.29 pooka * must be paged in first before replacing (i.e. r/m/w). Ideally,
47 1.29 pooka * we should use directio. The problem is that directio can fail
48 1.29 pooka * silently causing improper file system semantics (i.e. unflushed
49 1.29 pooka * data). Therefore, default to mmap for now. Even so, directio
50 1.29 pooka * _should_ be safe and can be enabled by compiling this module
51 1.29 pooka * with -DHAS_DIRECTIO.
52 1.1 pooka */
53 1.1 pooka
54 1.1 pooka #include <sys/cdefs.h>
55 1.44 pooka __KERNEL_RCSID(0, "$NetBSD: rumpblk.c,v 1.44 2011/02/03 10:06:06 pooka Exp $");
56 1.1 pooka
57 1.1 pooka #include <sys/param.h>
58 1.1 pooka #include <sys/buf.h>
59 1.1 pooka #include <sys/conf.h>
60 1.16 pooka #include <sys/condvar.h>
61 1.1 pooka #include <sys/disklabel.h>
62 1.18 pooka #include <sys/evcnt.h>
63 1.1 pooka #include <sys/fcntl.h>
64 1.1 pooka #include <sys/kmem.h>
65 1.1 pooka #include <sys/malloc.h>
66 1.16 pooka #include <sys/queue.h>
67 1.1 pooka #include <sys/stat.h>
68 1.1 pooka
69 1.1 pooka #include <rump/rumpuser.h>
70 1.1 pooka
71 1.1 pooka #include "rump_private.h"
72 1.1 pooka #include "rump_vfs_private.h"
73 1.1 pooka
74 1.16 pooka #if 0
75 1.16 pooka #define DPRINTF(x) printf x
76 1.16 pooka #else
77 1.16 pooka #define DPRINTF(x)
78 1.16 pooka #endif
79 1.16 pooka
80 1.19 pooka /* Default: 16 x 1MB windows */
81 1.19 pooka unsigned memwinsize = (1<<20);
82 1.19 pooka unsigned memwincnt = 16;
83 1.19 pooka
84 1.36 pooka #define STARTWIN(off) ((off) & ~((off_t)memwinsize-1))
85 1.16 pooka #define INWIN(win,off) ((win)->win_off == STARTWIN(off))
86 1.41 pooka #define WINSIZE(rblk, win) (MIN((rblk->rblk_hostsize-win->win_off), \
87 1.41 pooka memwinsize))
88 1.16 pooka #define WINVALID(win) ((win)->win_off != (off_t)-1)
89 1.16 pooka #define WINVALIDATE(win) ((win)->win_off = (off_t)-1)
90 1.16 pooka struct blkwin {
91 1.16 pooka off_t win_off;
92 1.16 pooka void *win_mem;
93 1.16 pooka int win_refcnt;
94 1.16 pooka
95 1.16 pooka TAILQ_ENTRY(blkwin) win_lru;
96 1.16 pooka };
97 1.16 pooka
98 1.1 pooka #define RUMPBLK_SIZE 16
99 1.1 pooka static struct rblkdev {
100 1.1 pooka char *rblk_path;
101 1.1 pooka int rblk_fd;
102 1.20 pooka #ifdef HAS_ODIRECT
103 1.20 pooka int rblk_dfd;
104 1.20 pooka #endif
105 1.26 pooka uint64_t rblk_size;
106 1.27 pooka uint64_t rblk_hostoffset;
107 1.41 pooka uint64_t rblk_hostsize;
108 1.27 pooka int rblk_ftype;
109 1.16 pooka
110 1.16 pooka /* for mmap */
111 1.16 pooka int rblk_mmflags;
112 1.16 pooka kmutex_t rblk_memmtx;
113 1.16 pooka kcondvar_t rblk_memcv;
114 1.16 pooka TAILQ_HEAD(winlru, blkwin) rblk_lruq;
115 1.16 pooka bool rblk_waiting;
116 1.1 pooka
117 1.31 pooka struct disklabel rblk_label;
118 1.1 pooka } minors[RUMPBLK_SIZE];
119 1.1 pooka
120 1.20 pooka static struct evcnt ev_io_total;
121 1.20 pooka static struct evcnt ev_io_async;
122 1.20 pooka
123 1.20 pooka static struct evcnt ev_memblk_hits;
124 1.20 pooka static struct evcnt ev_memblk_busy;
125 1.20 pooka
126 1.20 pooka static struct evcnt ev_bwrite_total;
127 1.20 pooka static struct evcnt ev_bwrite_async;
128 1.20 pooka static struct evcnt ev_bread_total;
129 1.18 pooka
130 1.1 pooka dev_type_open(rumpblk_open);
131 1.1 pooka dev_type_close(rumpblk_close);
132 1.1 pooka dev_type_read(rumpblk_read);
133 1.1 pooka dev_type_write(rumpblk_write);
134 1.1 pooka dev_type_ioctl(rumpblk_ioctl);
135 1.1 pooka dev_type_strategy(rumpblk_strategy);
136 1.3 pooka dev_type_strategy(rumpblk_strategy_fail);
137 1.1 pooka dev_type_dump(rumpblk_dump);
138 1.1 pooka dev_type_size(rumpblk_size);
139 1.1 pooka
140 1.1 pooka static const struct bdevsw rumpblk_bdevsw = {
141 1.1 pooka rumpblk_open, rumpblk_close, rumpblk_strategy, rumpblk_ioctl,
142 1.1 pooka nodump, nosize, D_DISK
143 1.1 pooka };
144 1.1 pooka
145 1.3 pooka static const struct bdevsw rumpblk_bdevsw_fail = {
146 1.3 pooka rumpblk_open, rumpblk_close, rumpblk_strategy_fail, rumpblk_ioctl,
147 1.3 pooka nodump, nosize, D_DISK
148 1.3 pooka };
149 1.3 pooka
150 1.1 pooka static const struct cdevsw rumpblk_cdevsw = {
151 1.1 pooka rumpblk_open, rumpblk_close, rumpblk_read, rumpblk_write,
152 1.1 pooka rumpblk_ioctl, nostop, notty, nopoll, nommap, nokqfilter, D_DISK
153 1.1 pooka };
154 1.1 pooka
155 1.3 pooka /* fail every n out of BLKFAIL_MAX */
156 1.3 pooka #define BLKFAIL_MAX 10000
157 1.3 pooka static int blkfail;
158 1.3 pooka static unsigned randstate;
159 1.24 pooka static kmutex_t rumpblk_lock;
160 1.37 pooka static int sectshift = DEV_BSHIFT;
161 1.1 pooka
162 1.31 pooka static void
163 1.31 pooka makedefaultlabel(struct disklabel *lp, off_t size, int part)
164 1.31 pooka {
165 1.31 pooka int i;
166 1.31 pooka
167 1.31 pooka memset(lp, 0, sizeof(*lp));
168 1.31 pooka
169 1.31 pooka lp->d_secperunit = size;
170 1.37 pooka lp->d_secsize = 1 << sectshift;
171 1.37 pooka lp->d_nsectors = size >> sectshift;
172 1.31 pooka lp->d_ntracks = 1;
173 1.31 pooka lp->d_ncylinders = 1;
174 1.31 pooka lp->d_secpercyl = lp->d_nsectors;
175 1.31 pooka
176 1.31 pooka /* oh dear oh dear */
177 1.31 pooka strncpy(lp->d_typename, "rumpd", sizeof(lp->d_typename));
178 1.31 pooka strncpy(lp->d_packname, "fictitious", sizeof(lp->d_packname));
179 1.31 pooka
180 1.31 pooka lp->d_type = DTYPE_RUMPD;
181 1.31 pooka lp->d_rpm = 11;
182 1.31 pooka lp->d_interleave = 1;
183 1.31 pooka lp->d_flags = 0;
184 1.31 pooka
185 1.31 pooka /* XXX: RAW_PART handling? */
186 1.31 pooka for (i = 0; i < part; i++) {
187 1.31 pooka lp->d_partitions[i].p_fstype = FS_UNUSED;
188 1.31 pooka }
189 1.37 pooka lp->d_partitions[part].p_size = size >> sectshift;
190 1.31 pooka lp->d_npartitions = part+1;
191 1.31 pooka /* XXX: file system type? */
192 1.31 pooka
193 1.31 pooka lp->d_magic = DISKMAGIC;
194 1.31 pooka lp->d_magic2 = DISKMAGIC;
195 1.31 pooka lp->d_checksum = 0; /* XXX */
196 1.31 pooka }
197 1.31 pooka
198 1.16 pooka static struct blkwin *
199 1.16 pooka getwindow(struct rblkdev *rblk, off_t off, int *wsize, int *error)
200 1.16 pooka {
201 1.16 pooka struct blkwin *win;
202 1.16 pooka
203 1.16 pooka mutex_enter(&rblk->rblk_memmtx);
204 1.16 pooka retry:
205 1.16 pooka /* search for window */
206 1.16 pooka TAILQ_FOREACH(win, &rblk->rblk_lruq, win_lru) {
207 1.16 pooka if (INWIN(win, off) && WINVALID(win))
208 1.16 pooka break;
209 1.16 pooka }
210 1.16 pooka
211 1.16 pooka /* found? return */
212 1.16 pooka if (win) {
213 1.20 pooka ev_memblk_hits.ev_count++;
214 1.16 pooka TAILQ_REMOVE(&rblk->rblk_lruq, win, win_lru);
215 1.16 pooka goto good;
216 1.16 pooka }
217 1.16 pooka
218 1.16 pooka /*
219 1.16 pooka * Else, create new window. If the least recently used is not
220 1.16 pooka * currently in use, reuse that. Otherwise we need to wait.
221 1.16 pooka */
222 1.16 pooka win = TAILQ_LAST(&rblk->rblk_lruq, winlru);
223 1.16 pooka if (win->win_refcnt == 0) {
224 1.16 pooka TAILQ_REMOVE(&rblk->rblk_lruq, win, win_lru);
225 1.16 pooka mutex_exit(&rblk->rblk_memmtx);
226 1.16 pooka
227 1.16 pooka if (WINVALID(win)) {
228 1.16 pooka DPRINTF(("win %p, unmap mem %p, off 0x%" PRIx64 "\n",
229 1.16 pooka win, win->win_mem, win->win_off));
230 1.16 pooka rumpuser_unmap(win->win_mem, WINSIZE(rblk, win));
231 1.16 pooka WINVALIDATE(win);
232 1.16 pooka }
233 1.16 pooka
234 1.16 pooka win->win_off = STARTWIN(off);
235 1.16 pooka win->win_mem = rumpuser_filemmap(rblk->rblk_fd, win->win_off,
236 1.16 pooka WINSIZE(rblk, win), rblk->rblk_mmflags, error);
237 1.16 pooka DPRINTF(("win %p, off 0x%" PRIx64 ", mem %p\n",
238 1.16 pooka win, win->win_off, win->win_mem));
239 1.16 pooka
240 1.16 pooka mutex_enter(&rblk->rblk_memmtx);
241 1.16 pooka if (win->win_mem == NULL) {
242 1.16 pooka WINVALIDATE(win);
243 1.16 pooka TAILQ_INSERT_TAIL(&rblk->rblk_lruq, win, win_lru);
244 1.16 pooka mutex_exit(&rblk->rblk_memmtx);
245 1.16 pooka return NULL;
246 1.16 pooka }
247 1.16 pooka } else {
248 1.16 pooka DPRINTF(("memwin wait\n"));
249 1.20 pooka ev_memblk_busy.ev_count++;
250 1.18 pooka
251 1.16 pooka rblk->rblk_waiting = true;
252 1.16 pooka cv_wait(&rblk->rblk_memcv, &rblk->rblk_memmtx);
253 1.16 pooka goto retry;
254 1.16 pooka }
255 1.16 pooka
256 1.16 pooka good:
257 1.16 pooka KASSERT(win);
258 1.16 pooka win->win_refcnt++;
259 1.16 pooka TAILQ_INSERT_HEAD(&rblk->rblk_lruq, win, win_lru);
260 1.16 pooka mutex_exit(&rblk->rblk_memmtx);
261 1.19 pooka *wsize = MIN(*wsize, memwinsize - (off-win->win_off));
262 1.16 pooka KASSERT(*wsize);
263 1.16 pooka
264 1.16 pooka return win;
265 1.16 pooka }
266 1.16 pooka
267 1.16 pooka static void
268 1.16 pooka putwindow(struct rblkdev *rblk, struct blkwin *win)
269 1.16 pooka {
270 1.16 pooka
271 1.16 pooka mutex_enter(&rblk->rblk_memmtx);
272 1.16 pooka if (--win->win_refcnt == 0 && rblk->rblk_waiting) {
273 1.16 pooka rblk->rblk_waiting = false;
274 1.42 pooka cv_broadcast(&rblk->rblk_memcv);
275 1.16 pooka }
276 1.16 pooka KASSERT(win->win_refcnt >= 0);
277 1.16 pooka mutex_exit(&rblk->rblk_memmtx);
278 1.16 pooka }
279 1.16 pooka
280 1.16 pooka static void
281 1.16 pooka wincleanup(struct rblkdev *rblk)
282 1.16 pooka {
283 1.16 pooka struct blkwin *win;
284 1.16 pooka
285 1.16 pooka while ((win = TAILQ_FIRST(&rblk->rblk_lruq)) != NULL) {
286 1.16 pooka TAILQ_REMOVE(&rblk->rblk_lruq, win, win_lru);
287 1.16 pooka if (WINVALID(win)) {
288 1.16 pooka DPRINTF(("cleanup win %p addr %p\n",
289 1.16 pooka win, win->win_mem));
290 1.16 pooka rumpuser_unmap(win->win_mem, WINSIZE(rblk, win));
291 1.16 pooka }
292 1.16 pooka kmem_free(win, sizeof(*win));
293 1.16 pooka }
294 1.16 pooka rblk->rblk_mmflags = 0;
295 1.16 pooka }
296 1.16 pooka
297 1.1 pooka int
298 1.8 cegger rumpblk_init(void)
299 1.1 pooka {
300 1.3 pooka char buf[64];
301 1.38 pooka devmajor_t rumpblkmaj = RUMPBLK_DEVMAJOR;
302 1.19 pooka unsigned tmp;
303 1.16 pooka int error, i;
304 1.3 pooka
305 1.24 pooka mutex_init(&rumpblk_lock, MUTEX_DEFAULT, IPL_NONE);
306 1.24 pooka
307 1.3 pooka if (rumpuser_getenv("RUMP_BLKFAIL", buf, sizeof(buf), &error) == 0) {
308 1.3 pooka blkfail = strtoul(buf, NULL, 10);
309 1.3 pooka /* fail everything */
310 1.3 pooka if (blkfail > BLKFAIL_MAX)
311 1.3 pooka blkfail = BLKFAIL_MAX;
312 1.3 pooka if (rumpuser_getenv("RUMP_BLKFAIL_SEED", buf, sizeof(buf),
313 1.3 pooka &error) == 0) {
314 1.3 pooka randstate = strtoul(buf, NULL, 10);
315 1.3 pooka } else {
316 1.23 pooka randstate = arc4random();
317 1.3 pooka }
318 1.22 pooka printf("rumpblk: FAULT INJECTION ACTIVE! fail %d/%d. "
319 1.22 pooka "seed %u\n", blkfail, BLKFAIL_MAX, randstate);
320 1.3 pooka } else {
321 1.3 pooka blkfail = 0;
322 1.3 pooka }
323 1.1 pooka
324 1.19 pooka if (rumpuser_getenv("RUMP_BLKWINSIZE", buf, sizeof(buf), &error) == 0) {
325 1.19 pooka printf("rumpblk: ");
326 1.19 pooka tmp = strtoul(buf, NULL, 10);
327 1.19 pooka if (tmp && !(tmp & (tmp-1)))
328 1.19 pooka memwinsize = tmp;
329 1.19 pooka else
330 1.19 pooka printf("invalid RUMP_BLKWINSIZE %d, ", tmp);
331 1.19 pooka printf("using %d for memwinsize\n", memwinsize);
332 1.19 pooka }
333 1.19 pooka if (rumpuser_getenv("RUMP_BLKWINCOUNT", buf, sizeof(buf), &error) == 0){
334 1.19 pooka printf("rumpblk: ");
335 1.19 pooka tmp = strtoul(buf, NULL, 10);
336 1.19 pooka if (tmp)
337 1.19 pooka memwincnt = tmp;
338 1.19 pooka else
339 1.19 pooka printf("invalid RUMP_BLKWINCOUNT %d, ", tmp);
340 1.19 pooka printf("using %d for memwincount\n", memwincnt);
341 1.19 pooka }
342 1.37 pooka if (rumpuser_getenv("RUMP_BLKSECTSHIFT", buf, sizeof(buf), &error)==0){
343 1.37 pooka printf("rumpblk: ");
344 1.37 pooka tmp = strtoul(buf, NULL, 10);
345 1.37 pooka if (tmp >= DEV_BSHIFT)
346 1.37 pooka sectshift = tmp;
347 1.37 pooka else
348 1.37 pooka printf("RUMP_BLKSECTSHIFT must be least %d (now %d), ",
349 1.37 pooka DEV_BSHIFT, tmp);
350 1.37 pooka printf("using %d for sector shift (size %d)\n",
351 1.37 pooka sectshift, 1<<sectshift);
352 1.37 pooka }
353 1.19 pooka
354 1.16 pooka memset(minors, 0, sizeof(minors));
355 1.16 pooka for (i = 0; i < RUMPBLK_SIZE; i++) {
356 1.16 pooka mutex_init(&minors[i].rblk_memmtx, MUTEX_DEFAULT, IPL_NONE);
357 1.16 pooka cv_init(&minors[i].rblk_memcv, "rblkmcv");
358 1.16 pooka }
359 1.16 pooka
360 1.20 pooka evcnt_attach_dynamic(&ev_io_total, EVCNT_TYPE_MISC, NULL,
361 1.39 pooka "rumpblk", "I/O reqs");
362 1.20 pooka evcnt_attach_dynamic(&ev_io_async, EVCNT_TYPE_MISC, NULL,
363 1.39 pooka "rumpblk", "async I/O");
364 1.20 pooka
365 1.20 pooka evcnt_attach_dynamic(&ev_bread_total, EVCNT_TYPE_MISC, NULL,
366 1.39 pooka "rumpblk", "bytes read");
367 1.20 pooka evcnt_attach_dynamic(&ev_bwrite_total, EVCNT_TYPE_MISC, NULL,
368 1.39 pooka "rumpblk", "bytes written");
369 1.20 pooka evcnt_attach_dynamic(&ev_bwrite_async, EVCNT_TYPE_MISC, NULL,
370 1.39 pooka "rumpblk", "bytes written async");
371 1.20 pooka
372 1.20 pooka evcnt_attach_dynamic(&ev_memblk_hits, EVCNT_TYPE_MISC, NULL,
373 1.39 pooka "rumpblk", "window hits");
374 1.20 pooka evcnt_attach_dynamic(&ev_memblk_busy, EVCNT_TYPE_MISC, NULL,
375 1.39 pooka "rumpblk", "all windows busy");
376 1.18 pooka
377 1.3 pooka if (blkfail) {
378 1.38 pooka return devsw_attach("rumpblk",
379 1.38 pooka &rumpblk_bdevsw_fail, &rumpblkmaj,
380 1.38 pooka &rumpblk_cdevsw, &rumpblkmaj);
381 1.3 pooka } else {
382 1.38 pooka return devsw_attach("rumpblk",
383 1.38 pooka &rumpblk_bdevsw, &rumpblkmaj,
384 1.38 pooka &rumpblk_cdevsw, &rumpblkmaj);
385 1.3 pooka }
386 1.1 pooka }
387 1.1 pooka
388 1.1 pooka int
389 1.27 pooka rumpblk_register(const char *path, devminor_t *dmin,
390 1.27 pooka uint64_t offset, uint64_t size)
391 1.1 pooka {
392 1.27 pooka struct rblkdev *rblk;
393 1.24 pooka uint64_t flen;
394 1.1 pooka size_t len;
395 1.30 pooka int ftype, error, i;
396 1.24 pooka
397 1.27 pooka /* devices might not report correct size unless they're open */
398 1.30 pooka if (rumpuser_getfileinfo(path, &flen, &ftype, &error) == -1)
399 1.27 pooka return error;
400 1.27 pooka
401 1.24 pooka /* verify host file is of supported type */
402 1.24 pooka if (!(ftype == RUMPUSER_FT_REG
403 1.24 pooka || ftype == RUMPUSER_FT_BLK
404 1.24 pooka || ftype == RUMPUSER_FT_CHR))
405 1.24 pooka return EINVAL;
406 1.1 pooka
407 1.24 pooka mutex_enter(&rumpblk_lock);
408 1.24 pooka for (i = 0; i < RUMPBLK_SIZE; i++) {
409 1.24 pooka if (minors[i].rblk_path&&strcmp(minors[i].rblk_path, path)==0) {
410 1.24 pooka mutex_exit(&rumpblk_lock);
411 1.24 pooka *dmin = i;
412 1.24 pooka return 0;
413 1.24 pooka }
414 1.24 pooka }
415 1.1 pooka
416 1.1 pooka for (i = 0; i < RUMPBLK_SIZE; i++)
417 1.1 pooka if (minors[i].rblk_path == NULL)
418 1.1 pooka break;
419 1.24 pooka if (i == RUMPBLK_SIZE) {
420 1.24 pooka mutex_exit(&rumpblk_lock);
421 1.24 pooka return EBUSY;
422 1.24 pooka }
423 1.1 pooka
424 1.27 pooka rblk = &minors[i];
425 1.1 pooka len = strlen(path);
426 1.27 pooka rblk->rblk_path = malloc(len + 1, M_TEMP, M_WAITOK);
427 1.27 pooka strcpy(rblk->rblk_path, path);
428 1.27 pooka rblk->rblk_fd = -1;
429 1.27 pooka rblk->rblk_hostoffset = offset;
430 1.33 pooka if (size != RUMPBLK_SIZENOTSET) {
431 1.27 pooka KASSERT(size + offset <= flen);
432 1.27 pooka rblk->rblk_size = size;
433 1.27 pooka } else {
434 1.27 pooka KASSERT(offset < flen);
435 1.27 pooka rblk->rblk_size = flen - offset;
436 1.27 pooka }
437 1.41 pooka rblk->rblk_hostsize = flen;
438 1.27 pooka rblk->rblk_ftype = ftype;
439 1.31 pooka makedefaultlabel(&rblk->rblk_label, rblk->rblk_size, i);
440 1.24 pooka mutex_exit(&rumpblk_lock);
441 1.24 pooka
442 1.24 pooka *dmin = i;
443 1.24 pooka return 0;
444 1.1 pooka }
445 1.1 pooka
446 1.40 pooka /*
447 1.40 pooka * Unregister rumpblk. It's the callers responsibility to make
448 1.40 pooka * sure it's no longer in use.
449 1.40 pooka */
450 1.40 pooka int
451 1.40 pooka rumpblk_deregister(const char *path)
452 1.40 pooka {
453 1.40 pooka struct rblkdev *rblk;
454 1.40 pooka int i;
455 1.40 pooka
456 1.40 pooka mutex_enter(&rumpblk_lock);
457 1.40 pooka for (i = 0; i < RUMPBLK_SIZE; i++) {
458 1.40 pooka if (minors[i].rblk_path&&strcmp(minors[i].rblk_path, path)==0) {
459 1.40 pooka break;
460 1.40 pooka }
461 1.40 pooka }
462 1.40 pooka mutex_exit(&rumpblk_lock);
463 1.40 pooka
464 1.40 pooka if (i == RUMPBLK_SIZE)
465 1.40 pooka return ENOENT;
466 1.40 pooka
467 1.40 pooka rblk = &minors[i];
468 1.40 pooka KASSERT(rblk->rblk_fd == -1);
469 1.40 pooka
470 1.40 pooka wincleanup(rblk);
471 1.40 pooka free(rblk->rblk_path, M_TEMP);
472 1.40 pooka rblk->rblk_path = NULL;
473 1.40 pooka memset(&rblk->rblk_label, 0, sizeof(rblk->rblk_label));
474 1.40 pooka
475 1.40 pooka return 0;
476 1.40 pooka }
477 1.40 pooka
478 1.1 pooka int
479 1.1 pooka rumpblk_open(dev_t dev, int flag, int fmt, struct lwp *l)
480 1.1 pooka {
481 1.1 pooka struct rblkdev *rblk = &minors[minor(dev)];
482 1.1 pooka int error, fd;
483 1.1 pooka
484 1.27 pooka if (rblk->rblk_path == NULL)
485 1.27 pooka return ENXIO;
486 1.27 pooka
487 1.25 pooka if (rblk->rblk_fd != -1)
488 1.25 pooka return 0; /* XXX: refcount, open mode */
489 1.43 pooka flag &= ~O_TRUNC;
490 1.1 pooka fd = rumpuser_open(rblk->rblk_path, OFLAGS(flag), &error);
491 1.1 pooka if (error)
492 1.1 pooka return error;
493 1.1 pooka
494 1.20 pooka #ifdef HAS_ODIRECT
495 1.20 pooka rblk->rblk_dfd = rumpuser_open(rblk->rblk_path,
496 1.20 pooka OFLAGS(flag) | O_DIRECT, &error);
497 1.20 pooka if (error)
498 1.20 pooka return error;
499 1.20 pooka #endif
500 1.20 pooka
501 1.27 pooka if (rblk->rblk_ftype == RUMPUSER_FT_REG) {
502 1.30 pooka uint64_t fsize = rblk->rblk_size, off = rblk->rblk_hostoffset;
503 1.16 pooka struct blkwin *win;
504 1.16 pooka int i, winsize;
505 1.16 pooka
506 1.1 pooka /*
507 1.16 pooka * Use mmap to access a regular file. Allocate and
508 1.16 pooka * cache initial windows here. Failure to allocate one
509 1.16 pooka * means fallback to read/write i/o.
510 1.1 pooka */
511 1.9 pooka
512 1.16 pooka rblk->rblk_mmflags = 0;
513 1.16 pooka if (flag & FREAD)
514 1.16 pooka rblk->rblk_mmflags |= RUMPUSER_FILEMMAP_READ;
515 1.16 pooka if (flag & FWRITE) {
516 1.16 pooka rblk->rblk_mmflags |= RUMPUSER_FILEMMAP_WRITE;
517 1.16 pooka rblk->rblk_mmflags |= RUMPUSER_FILEMMAP_SHARED;
518 1.16 pooka }
519 1.16 pooka
520 1.16 pooka TAILQ_INIT(&rblk->rblk_lruq);
521 1.16 pooka rblk->rblk_fd = fd;
522 1.16 pooka
523 1.28 pooka for (i = 0; i < memwincnt && off + i*memwinsize < fsize; i++) {
524 1.16 pooka win = kmem_zalloc(sizeof(*win), KM_SLEEP);
525 1.16 pooka WINVALIDATE(win);
526 1.16 pooka TAILQ_INSERT_TAIL(&rblk->rblk_lruq, win, win_lru);
527 1.16 pooka
528 1.16 pooka /*
529 1.16 pooka * Allocate first windows. Here we just generally
530 1.16 pooka * make sure a) we can mmap at all b) we have the
531 1.16 pooka * necessary VA available
532 1.16 pooka */
533 1.29 pooka winsize = memwinsize;
534 1.28 pooka win = getwindow(rblk, off + i*memwinsize, &winsize,
535 1.28 pooka &error);
536 1.16 pooka if (win) {
537 1.16 pooka putwindow(rblk, win);
538 1.16 pooka } else {
539 1.16 pooka wincleanup(rblk);
540 1.16 pooka break;
541 1.12 pooka }
542 1.9 pooka }
543 1.35 pooka } else {
544 1.35 pooka rblk->rblk_fd = fd;
545 1.1 pooka }
546 1.1 pooka
547 1.16 pooka KASSERT(rblk->rblk_fd != -1);
548 1.1 pooka return 0;
549 1.1 pooka }
550 1.1 pooka
551 1.1 pooka int
552 1.1 pooka rumpblk_close(dev_t dev, int flag, int fmt, struct lwp *l)
553 1.1 pooka {
554 1.1 pooka struct rblkdev *rblk = &minors[minor(dev)];
555 1.1 pooka int dummy;
556 1.1 pooka
557 1.16 pooka if (rblk->rblk_mmflags)
558 1.16 pooka wincleanup(rblk);
559 1.16 pooka rumpuser_fsync(rblk->rblk_fd, &dummy);
560 1.1 pooka rumpuser_close(rblk->rblk_fd, &dummy);
561 1.1 pooka rblk->rblk_fd = -1;
562 1.1 pooka
563 1.1 pooka return 0;
564 1.1 pooka }
565 1.1 pooka
566 1.1 pooka int
567 1.1 pooka rumpblk_ioctl(dev_t dev, u_long xfer, void *addr, int flag, struct lwp *l)
568 1.1 pooka {
569 1.31 pooka devminor_t dmin = minor(dev);
570 1.31 pooka struct rblkdev *rblk = &minors[dmin];
571 1.31 pooka struct partinfo *pi;
572 1.31 pooka int error = 0;
573 1.31 pooka
574 1.31 pooka /* well, me should support a few more, but we don't for now */
575 1.31 pooka switch (xfer) {
576 1.31 pooka case DIOCGDINFO:
577 1.31 pooka *(struct disklabel *)addr = rblk->rblk_label;
578 1.31 pooka break;
579 1.31 pooka
580 1.31 pooka case DIOCGPART:
581 1.31 pooka pi = addr;
582 1.31 pooka pi->part = &rblk->rblk_label.d_partitions[DISKPART(dmin)];
583 1.31 pooka pi->disklab = &rblk->rblk_label;
584 1.31 pooka break;
585 1.32 pooka
586 1.32 pooka /* it's synced enough along the write path */
587 1.32 pooka case DIOCCACHESYNC:
588 1.32 pooka break;
589 1.32 pooka
590 1.31 pooka default:
591 1.31 pooka error = ENOTTY;
592 1.31 pooka break;
593 1.1 pooka }
594 1.1 pooka
595 1.31 pooka return error;
596 1.1 pooka }
597 1.1 pooka
598 1.25 pooka static int
599 1.25 pooka do_physio(dev_t dev, struct uio *uio, int which)
600 1.25 pooka {
601 1.25 pooka void (*strat)(struct buf *);
602 1.25 pooka
603 1.25 pooka if (blkfail)
604 1.25 pooka strat = rumpblk_strategy_fail;
605 1.25 pooka else
606 1.25 pooka strat = rumpblk_strategy;
607 1.25 pooka
608 1.25 pooka return physio(strat, NULL, dev, which, minphys, uio);
609 1.25 pooka }
610 1.25 pooka
611 1.1 pooka int
612 1.1 pooka rumpblk_read(dev_t dev, struct uio *uio, int flags)
613 1.1 pooka {
614 1.1 pooka
615 1.25 pooka return do_physio(dev, uio, B_READ);
616 1.1 pooka }
617 1.1 pooka
618 1.1 pooka int
619 1.1 pooka rumpblk_write(dev_t dev, struct uio *uio, int flags)
620 1.1 pooka {
621 1.1 pooka
622 1.25 pooka return do_physio(dev, uio, B_WRITE);
623 1.1 pooka }
624 1.1 pooka
625 1.3 pooka static void
626 1.3 pooka dostrategy(struct buf *bp)
627 1.1 pooka {
628 1.1 pooka struct rblkdev *rblk = &minors[minor(bp->b_dev)];
629 1.1 pooka off_t off;
630 1.21 pooka int async = bp->b_flags & B_ASYNC;
631 1.21 pooka int error;
632 1.1 pooka
633 1.44 pooka if (bp->b_bcount % (1<<sectshift) != 0) {
634 1.44 pooka rump_biodone(bp, 0, EINVAL);
635 1.44 pooka return;
636 1.44 pooka }
637 1.44 pooka
638 1.20 pooka /* collect statistics */
639 1.20 pooka ev_io_total.ev_count++;
640 1.20 pooka if (async)
641 1.20 pooka ev_io_async.ev_count++;
642 1.20 pooka if (BUF_ISWRITE(bp)) {
643 1.20 pooka ev_bwrite_total.ev_count += bp->b_bcount;
644 1.20 pooka if (async)
645 1.20 pooka ev_bwrite_async.ev_count += bp->b_bcount;
646 1.20 pooka } else {
647 1.20 pooka ev_bread_total.ev_count++;
648 1.20 pooka }
649 1.20 pooka
650 1.44 pooka /*
651 1.44 pooka * b_blkno is always in terms of DEV_BSIZE, and since we need
652 1.44 pooka * to translate to a byte offset for the host read, this
653 1.44 pooka * calculation does not need sectshift.
654 1.44 pooka */
655 1.44 pooka off = bp->b_blkno << DEV_BSHIFT;
656 1.44 pooka
657 1.11 pooka /*
658 1.11 pooka * Do bounds checking if we're working on a file. Otherwise
659 1.11 pooka * invalid file systems might attempt to read beyond EOF. This
660 1.11 pooka * is bad(tm) especially on mmapped images. This is essentially
661 1.11 pooka * the kernel bounds_check() routines.
662 1.11 pooka */
663 1.27 pooka if (off + bp->b_bcount > rblk->rblk_size) {
664 1.11 pooka int64_t sz = rblk->rblk_size - off;
665 1.11 pooka
666 1.11 pooka /* EOF */
667 1.11 pooka if (sz == 0) {
668 1.11 pooka rump_biodone(bp, 0, 0);
669 1.11 pooka return;
670 1.11 pooka }
671 1.11 pooka /* beyond EOF ==> error */
672 1.11 pooka if (sz < 0) {
673 1.11 pooka rump_biodone(bp, 0, EINVAL);
674 1.11 pooka return;
675 1.11 pooka }
676 1.11 pooka
677 1.11 pooka /* truncate to device size */
678 1.11 pooka bp->b_bcount = sz;
679 1.11 pooka }
680 1.11 pooka
681 1.34 pooka off += rblk->rblk_hostoffset;
682 1.1 pooka DPRINTF(("rumpblk_strategy: 0x%x bytes %s off 0x%" PRIx64
683 1.20 pooka " (0x%" PRIx64 " - 0x%" PRIx64 "), %ssync\n",
684 1.16 pooka bp->b_bcount, BUF_ISREAD(bp) ? "READ" : "WRITE",
685 1.20 pooka off, off, (off + bp->b_bcount), async ? "a" : ""));
686 1.1 pooka
687 1.16 pooka /* mmap? handle here and return */
688 1.16 pooka if (rblk->rblk_mmflags) {
689 1.16 pooka struct blkwin *win;
690 1.16 pooka int winsize, iodone;
691 1.16 pooka uint8_t *ioaddr, *bufaddr;
692 1.16 pooka
693 1.16 pooka for (iodone = 0; iodone < bp->b_bcount;
694 1.16 pooka iodone += winsize, off += winsize) {
695 1.16 pooka winsize = bp->b_bcount - iodone;
696 1.16 pooka win = getwindow(rblk, off, &winsize, &error);
697 1.16 pooka if (win == NULL) {
698 1.16 pooka rump_biodone(bp, iodone, error);
699 1.16 pooka return;
700 1.16 pooka }
701 1.16 pooka
702 1.16 pooka ioaddr = (uint8_t *)win->win_mem + (off-STARTWIN(off));
703 1.16 pooka bufaddr = (uint8_t *)bp->b_data + iodone;
704 1.11 pooka
705 1.16 pooka DPRINTF(("strat: %p off 0x%" PRIx64
706 1.16 pooka ", ioaddr %p (%p)/buf %p\n", win,
707 1.16 pooka win->win_off, ioaddr, win->win_mem, bufaddr));
708 1.16 pooka if (BUF_ISREAD(bp)) {
709 1.16 pooka memcpy(bufaddr, ioaddr, winsize);
710 1.16 pooka } else {
711 1.16 pooka memcpy(ioaddr, bufaddr, winsize);
712 1.16 pooka }
713 1.16 pooka
714 1.16 pooka /* synchronous write, sync bits back to disk */
715 1.16 pooka if (BUF_ISWRITE(bp) && !async) {
716 1.16 pooka rumpuser_memsync(ioaddr, winsize, &error);
717 1.16 pooka }
718 1.16 pooka putwindow(rblk, win);
719 1.9 pooka }
720 1.9 pooka
721 1.9 pooka rump_biodone(bp, bp->b_bcount, 0);
722 1.9 pooka return;
723 1.9 pooka }
724 1.9 pooka
725 1.1 pooka /*
726 1.1 pooka * Do I/O. We have different paths for async and sync I/O.
727 1.1 pooka * Async I/O is done by passing a request to rumpuser where
728 1.1 pooka * it is executed. The rumpuser routine then calls
729 1.1 pooka * biodone() to signal any waiters in the kernel. I/O's are
730 1.1 pooka * executed in series. Technically executing them in parallel
731 1.1 pooka * would produce better results, but then we'd need either
732 1.1 pooka * more threads or posix aio. Maybe worth investigating
733 1.1 pooka * this later.
734 1.14 pooka *
735 1.14 pooka * Using bufq here might be a good idea.
736 1.1 pooka */
737 1.20 pooka
738 1.13 pooka if (rump_threads) {
739 1.1 pooka struct rumpuser_aio *rua;
740 1.20 pooka int op, fd;
741 1.20 pooka
742 1.20 pooka fd = rblk->rblk_fd;
743 1.20 pooka if (BUF_ISREAD(bp)) {
744 1.20 pooka op = RUA_OP_READ;
745 1.20 pooka } else {
746 1.20 pooka op = RUA_OP_WRITE;
747 1.20 pooka if (!async) {
748 1.20 pooka /* O_DIRECT not fully automatic yet */
749 1.20 pooka #ifdef HAS_ODIRECT
750 1.37 pooka if ((off & ((1<<sectshift)-1)) == 0
751 1.37 pooka && ((intptr_t)bp->b_data
752 1.37 pooka & ((1<<sectshift)-1)) == 0
753 1.37 pooka && (bp->b_bcount & ((1<<sectshift)-1)) == 0)
754 1.20 pooka fd = rblk->rblk_dfd;
755 1.20 pooka else
756 1.20 pooka #endif
757 1.20 pooka op |= RUA_OP_SYNC;
758 1.20 pooka }
759 1.20 pooka }
760 1.1 pooka
761 1.1 pooka rumpuser_mutex_enter(&rumpuser_aio_mtx);
762 1.20 pooka while ((rumpuser_aio_head+1) % N_AIOS == rumpuser_aio_tail) {
763 1.13 pooka rumpuser_cv_wait(&rumpuser_aio_cv, &rumpuser_aio_mtx);
764 1.20 pooka }
765 1.1 pooka
766 1.2 pooka rua = &rumpuser_aios[rumpuser_aio_head];
767 1.2 pooka KASSERT(rua->rua_bp == NULL);
768 1.20 pooka rua->rua_fd = fd;
769 1.2 pooka rua->rua_data = bp->b_data;
770 1.2 pooka rua->rua_dlen = bp->b_bcount;
771 1.2 pooka rua->rua_off = off;
772 1.2 pooka rua->rua_bp = bp;
773 1.20 pooka rua->rua_op = op;
774 1.2 pooka
775 1.1 pooka /* insert into queue & signal */
776 1.6 pooka rumpuser_aio_head = (rumpuser_aio_head+1) % N_AIOS;
777 1.1 pooka rumpuser_cv_signal(&rumpuser_aio_cv);
778 1.1 pooka rumpuser_mutex_exit(&rumpuser_aio_mtx);
779 1.1 pooka } else {
780 1.1 pooka if (BUF_ISREAD(bp)) {
781 1.1 pooka rumpuser_read_bio(rblk->rblk_fd, bp->b_data,
782 1.1 pooka bp->b_bcount, off, rump_biodone, bp);
783 1.1 pooka } else {
784 1.1 pooka rumpuser_write_bio(rblk->rblk_fd, bp->b_data,
785 1.1 pooka bp->b_bcount, off, rump_biodone, bp);
786 1.1 pooka }
787 1.20 pooka if (BUF_ISWRITE(bp) && !async)
788 1.20 pooka rumpuser_fsync(rblk->rblk_fd, &error);
789 1.1 pooka }
790 1.1 pooka }
791 1.3 pooka
792 1.3 pooka void
793 1.3 pooka rumpblk_strategy(struct buf *bp)
794 1.3 pooka {
795 1.3 pooka
796 1.3 pooka dostrategy(bp);
797 1.3 pooka }
798 1.3 pooka
799 1.3 pooka /*
800 1.4 pooka * Simple random number generator. This is private so that we can
801 1.4 pooka * very repeatedly control which blocks will fail.
802 1.4 pooka *
803 1.3 pooka * <mlelstv> pooka, rand()
804 1.3 pooka * <mlelstv> [paste]
805 1.3 pooka */
806 1.3 pooka static unsigned
807 1.3 pooka gimmerand(void)
808 1.3 pooka {
809 1.3 pooka
810 1.3 pooka return (randstate = randstate * 1103515245 + 12345) % (0x80000000L);
811 1.3 pooka }
812 1.3 pooka
813 1.3 pooka /*
814 1.3 pooka * Block device with very simple fault injection. Fails every
815 1.3 pooka * n out of BLKFAIL_MAX I/O with EIO. n is determined by the env
816 1.3 pooka * variable RUMP_BLKFAIL.
817 1.3 pooka */
818 1.3 pooka void
819 1.3 pooka rumpblk_strategy_fail(struct buf *bp)
820 1.3 pooka {
821 1.3 pooka
822 1.3 pooka if (gimmerand() % BLKFAIL_MAX >= blkfail) {
823 1.3 pooka dostrategy(bp);
824 1.3 pooka } else {
825 1.3 pooka printf("block fault injection: failing I/O on block %lld\n",
826 1.3 pooka (long long)bp->b_blkno);
827 1.3 pooka bp->b_error = EIO;
828 1.3 pooka biodone(bp);
829 1.3 pooka }
830 1.3 pooka }
831