Home | History | Annotate | Line # | Download | only in kern
kern_physio.c revision 1.61.4.1
      1 /*	$NetBSD: kern_physio.c,v 1.61.4.1 2005/11/02 11:58:11 yamt Exp $	*/
      2 
      3 /*-
      4  * Copyright (c) 1982, 1986, 1990, 1993
      5  *	The Regents of the University of California.  All rights reserved.
      6  * (c) UNIX System Laboratories, Inc.
      7  * All or some portions of this file are derived from material licensed
      8  * to the University of California by American Telephone and Telegraph
      9  * Co. or Unix System Laboratories, Inc. and are reproduced herein with
     10  * the permission of UNIX System Laboratories, Inc.
     11  *
     12  * Redistribution and use in source and binary forms, with or without
     13  * modification, are permitted provided that the following conditions
     14  * are met:
     15  * 1. Redistributions of source code must retain the above copyright
     16  *    notice, this list of conditions and the following disclaimer.
     17  * 2. Redistributions in binary form must reproduce the above copyright
     18  *    notice, this list of conditions and the following disclaimer in the
     19  *    documentation and/or other materials provided with the distribution.
     20  * 3. Neither the name of the University nor the names of its contributors
     21  *    may be used to endorse or promote products derived from this software
     22  *    without specific prior written permission.
     23  *
     24  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     25  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     29  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     30  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     31  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     33  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     34  * SUCH DAMAGE.
     35  *
     36  *	@(#)kern_physio.c	8.1 (Berkeley) 6/10/93
     37  */
     38 
     39 /*-
     40  * Copyright (c) 1994 Christopher G. Demetriou
     41  *
     42  * Redistribution and use in source and binary forms, with or without
     43  * modification, are permitted provided that the following conditions
     44  * are met:
     45  * 1. Redistributions of source code must retain the above copyright
     46  *    notice, this list of conditions and the following disclaimer.
     47  * 2. Redistributions in binary form must reproduce the above copyright
     48  *    notice, this list of conditions and the following disclaimer in the
     49  *    documentation and/or other materials provided with the distribution.
     50  * 3. All advertising materials mentioning features or use of this software
     51  *    must display the following acknowledgement:
     52  *	This product includes software developed by the University of
     53  *	California, Berkeley and its contributors.
     54  * 4. Neither the name of the University nor the names of its contributors
     55  *    may be used to endorse or promote products derived from this software
     56  *    without specific prior written permission.
     57  *
     58  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     59  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     60  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     61  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     62  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     63  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     64  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     65  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     66  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     67  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     68  * SUCH DAMAGE.
     69  *
     70  *	@(#)kern_physio.c	8.1 (Berkeley) 6/10/93
     71  */
     72 
     73 #include <sys/cdefs.h>
     74 __KERNEL_RCSID(0, "$NetBSD: kern_physio.c,v 1.61.4.1 2005/11/02 11:58:11 yamt Exp $");
     75 
     76 #include <sys/param.h>
     77 #include <sys/systm.h>
     78 #include <sys/buf.h>
     79 #include <sys/proc.h>
     80 #include <sys/once.h>
     81 #include <sys/workqueue.h>
     82 
     83 #include <uvm/uvm_extern.h>
     84 
     85 ONCE_DECL(physio_initialized);
     86 struct workqueue *physio_workqueue;
     87 
     88 /*
     89  * The routines implemented in this file are described in:
     90  *	Leffler, et al.: The Design and Implementation of the 4.3BSD
     91  *	    UNIX Operating System (Addison Welley, 1989)
     92  * on pages 231-233.
     93  *
     94  * The routines "getphysbuf" and "putphysbuf" steal and return a swap
     95  * buffer.  Leffler, et al., says that swap buffers are used to do the
     96  * I/O, so raw I/O requests don't have to be single-threaded.  Of course,
     97  * NetBSD doesn't use "swap buffers" -- we have our own memory pool for
     98  * buffer descriptors.
     99  */
    100 
    101 /* abuse these members/flags of struct buf */
    102 #define	b_running	b_freelistindex
    103 #define	b_eomoffset	b_lblkno
    104 #define	B_DONTFREE	B_AGE
    105 
    106 /*
    107  * allocate a buffer structure for use in physical I/O.
    108  */
    109 static struct buf *
    110 getphysbuf(void)
    111 {
    112 	struct buf *bp;
    113 	int s;
    114 
    115 	s = splbio();
    116 	bp = pool_get(&bufpool, PR_WAITOK);
    117 	splx(s);
    118 	BUF_INIT(bp);
    119 	bp->b_error = 0;
    120 	bp->b_flags = B_BUSY;
    121 	return(bp);
    122 }
    123 
    124 /*
    125  * get rid of a swap buffer structure which has been used in physical I/O.
    126  */
    127 static void
    128 putphysbuf(struct buf *bp)
    129 {
    130 	int s;
    131 
    132 	if ((bp->b_flags & B_DONTFREE) != 0) {
    133 		return;
    134 	}
    135 
    136 	if (__predict_false(bp->b_flags & B_WANTED))
    137 		panic("putphysbuf: private buf B_WANTED");
    138 	s = splbio();
    139 	pool_put(&bufpool, bp);
    140 	splx(s);
    141 }
    142 
    143 static void
    144 physio_done(struct work *wk, void *dummy)
    145 {
    146 	struct buf *bp = (void *)wk;
    147 	size_t todo = bp->b_bufsize;
    148 	struct buf *mbp = bp->b_private;
    149 
    150 	KASSERT(&bp->b_work == wk);
    151 	KASSERT(bp->b_bcount <= todo);
    152 	KASSERT(bp->b_resid <= bp->b_bcount);
    153 	KASSERT((bp->b_flags & B_PHYS) != 0);
    154 	KASSERT(dummy == NULL);
    155 
    156 	vunmapbuf(bp, todo);
    157 	uvm_vsunlock(bp->b_proc, bp->b_data, todo);
    158 
    159 	simple_lock(&mbp->b_interlock);
    160 	if ((mbp->b_flags & B_ERROR) != 0) {
    161 		goto done;
    162 	}
    163 	if ((bp->b_flags & B_ERROR) != 0) {
    164 		if (bp->b_error == 0) {
    165 			mbp->b_error = EIO; /* XXX */
    166 		} else {
    167 			mbp->b_error = bp->b_error;
    168 		}
    169 		mbp->b_flags |= B_ERROR;
    170 		goto done;
    171 	}
    172 	KASSERT(bp->b_resid == 0); /* XXX */
    173 	if (bp->b_bcount != todo) {
    174 #if defined(DIAGNOSTIC)
    175 		off_t eomoffset = dbtob(bp->b_blkno);
    176 
    177 		if ((mbp->b_flags & B_ERROR) != 0 &&
    178 		    mbp->b_eomoffset != eomoffset) {
    179 			panic("%s: eom mismatch", __func__);
    180 		}
    181 		mbp->b_eomoffset = eomoffset;
    182 #endif /* defined(DIAGNOSTIC) */
    183 		mbp->b_flags |= B_ERROR;
    184 		mbp->b_error = 0;
    185 		goto done;
    186 	}
    187 done:
    188 	mbp->b_resid -= bp->b_bcount - bp->b_resid;
    189 	mbp->b_running--;
    190 	if ((mbp->b_flags & B_WANTED) != 0) {
    191 		mbp->b_flags &= ~B_WANTED;
    192 		wakeup(mbp);
    193 	}
    194 	simple_unlock(&mbp->b_interlock);
    195 
    196 	putphysbuf(bp);
    197 }
    198 
    199 static void
    200 physio_biodone(struct buf *bp)
    201 {
    202 #if defined(DIAGNOSTIC)
    203 	struct buf *mbp = bp->b_private;
    204 	size_t todo = bp->b_bufsize;
    205 
    206 	KASSERT(mbp->b_running > 0);
    207 	KASSERT(todo <= mbp->b_resid);
    208 	KASSERT(bp->b_bcount <= todo);
    209 	KASSERT(bp->b_resid <= bp->b_bcount);
    210 #endif /* defined(DIAGNOSTIC) */
    211 
    212 	workqueue_enqueue(physio_workqueue, &bp->b_work);
    213 }
    214 
    215 static int
    216 physio_wait(struct buf *bp, int n, const char *wchan)
    217 {
    218 	int error = 0;
    219 
    220 	LOCK_ASSERT(simple_lock_held(&bp->b_interlock));
    221 
    222 	while (bp->b_running > n) {
    223 		bp->b_flags |= B_WANTED;
    224 		error = ltsleep(bp, PRIBIO + 1, wchan, 0, &bp->b_interlock);
    225 		if (error) {
    226 			break;
    227 		}
    228 	}
    229 
    230 	return error;
    231 }
    232 
    233 static void
    234 physio_init(void)
    235 {
    236 
    237 	KASSERT(physio_workqueue == NULL);
    238 
    239 	if (workqueue_create(&physio_workqueue, "physiod",
    240 	    physio_done, NULL, PRIBIO, 0/* IPL_BIO notyet */, 0)) {
    241 		panic("physiod create");
    242 	}
    243 }
    244 
    245 #define	PHYSIO_CONCURRENCY	16	/* XXX tune */
    246 
    247 /*
    248  * Do "physical I/O" on behalf of a user.  "Physical I/O" is I/O directly
    249  * from the raw device to user buffers, and bypasses the buffer cache.
    250  *
    251  * Comments in brackets are from Leffler, et al.'s pseudo-code implementation.
    252  */
    253 int
    254 physio(void (*strategy)(struct buf *), struct buf *obp, dev_t dev, int flags,
    255     void (*min_phys)(struct buf *), struct uio *uio)
    256 {
    257 	struct iovec *iovp;
    258 	struct lwp *l = curlwp;
    259 	struct proc *p = l->l_proc;
    260 	int i, s;
    261 	int error = 0;
    262 	int error2;
    263 	size_t todo;
    264 	struct buf *bp = NULL;
    265 	struct buf *mbp;
    266 	int concurrency = PHYSIO_CONCURRENCY - 1;
    267 
    268 	RUN_ONCE(&physio_initialized, physio_init);
    269 
    270 	flags &= B_READ | B_WRITE;
    271 
    272 	/* Make sure we have a buffer, creating one if necessary. */
    273 	if (obp != NULL) {
    274 		/* [raise the processor priority level to splbio;] */
    275 		s = splbio();
    276 		simple_lock(&obp->b_interlock);
    277 
    278 		/* [while the buffer is marked busy] */
    279 		while (obp->b_flags & B_BUSY) {
    280 			/* [mark the buffer wanted] */
    281 			obp->b_flags |= B_WANTED;
    282 			/* [wait until the buffer is available] */
    283 			ltsleep(obp, PRIBIO+1, "physbuf", 0, &bp->b_interlock);
    284 		}
    285 
    286 		/* Mark it busy, so nobody else will use it. */
    287 		obp->b_flags = B_BUSY | B_DONTFREE;
    288 
    289 		/* [lower the priority level] */
    290 		simple_unlock(&obp->b_interlock);
    291 		splx(s);
    292 
    293 		concurrency = 0; /* see "XXXkludge" comment below */
    294 	}
    295 
    296 	mbp = getphysbuf();
    297 	mbp->b_resid = uio->uio_resid;
    298 	mbp->b_running = 0;
    299 
    300 	PHOLD(l);
    301 
    302 	for (i = 0; i < uio->uio_iovcnt; i++) {
    303 		iovp = &uio->uio_iov[i];
    304 		while (iovp->iov_len > 0) {
    305 			simple_lock(&mbp->b_interlock);
    306 			if ((mbp->b_flags & B_ERROR) != 0) {
    307 				error = mbp->b_error;
    308 				goto done_locked;
    309 			}
    310 			error = physio_wait(mbp, concurrency, "physio1");
    311 			if (error) {
    312 				goto done_locked;
    313 			}
    314 			simple_unlock(&mbp->b_interlock);
    315 			if (obp != NULL) {
    316 				/*
    317 				 * XXXkludge
    318 				 * some drivers use "obp" as an identifier.
    319 				 */
    320 				bp = obp;
    321 			} else {
    322 				bp = getphysbuf();
    323 			}
    324 			bp->b_dev = dev;
    325 			bp->b_proc = p;
    326 			bp->b_private = mbp;
    327 			bp->b_vp = NULL;
    328 
    329 			/*
    330 			 * [mark the buffer busy for physical I/O]
    331 			 * (i.e. set B_PHYS (because it's an I/O to user
    332 			 * memory, and B_RAW, because B_RAW is to be
    333 			 * "Set by physio for raw transfers.", in addition
    334 			 * to the "busy" and read/write flag.)
    335 			 */
    336 			bp->b_flags = (bp->b_flags & B_DONTFREE) |
    337 			    B_BUSY | B_PHYS | B_RAW | B_CALL | flags;
    338 			bp->b_iodone = physio_biodone;
    339 
    340 			/* [set up the buffer for a maximum-sized transfer] */
    341 			bp->b_blkno = btodb(uio->uio_offset);
    342 			if (dbtob(bp->b_blkno) != uio->uio_offset) {
    343 				error = EINVAL;
    344 				goto done;
    345 			}
    346 			bp->b_bcount = MIN(MAXPHYS, iovp->iov_len);
    347 			bp->b_data = iovp->iov_base;
    348 
    349 			/*
    350 			 * [call minphys to bound the transfer size]
    351 			 * and remember the amount of data to transfer,
    352 			 * for later comparison.
    353 			 */
    354 			(*min_phys)(bp);
    355 			todo = bp->b_bufsize = bp->b_bcount;
    356 #if defined(DIAGNOSTIC)
    357 			if (todo > MAXPHYS)
    358 				panic("todo(%zu) > MAXPHYS; minphys broken",
    359 				    todo);
    360 #endif /* defined(DIAGNOSTIC) */
    361 
    362 			/*
    363 			 * [lock the part of the user address space involved
    364 			 *    in the transfer]
    365 			 * Beware vmapbuf(); it clobbers b_data and
    366 			 * saves it in b_saveaddr.  However, vunmapbuf()
    367 			 * restores it.
    368 			 */
    369 			error = uvm_vslock(p, bp->b_data, todo,
    370 			    (flags & B_READ) ?  VM_PROT_WRITE : VM_PROT_READ);
    371 			if (error) {
    372 				goto done;
    373 			}
    374 			vmapbuf(bp, todo);
    375 
    376 			BIO_SETPRIO(bp, BPRIO_TIMECRITICAL);
    377 
    378 			simple_lock(&mbp->b_interlock);
    379 			mbp->b_running++;
    380 			simple_unlock(&mbp->b_interlock);
    381 
    382 			/* [call strategy to start the transfer] */
    383 			(*strategy)(bp);
    384 			bp = NULL;
    385 
    386 			iovp->iov_len -= todo;
    387 			iovp->iov_base = (caddr_t)iovp->iov_base + todo;
    388 			uio->uio_offset += todo;
    389 			uio->uio_resid -= todo;
    390 		}
    391 	}
    392 
    393 done:
    394 	simple_lock(&mbp->b_interlock);
    395 done_locked:
    396 	error2 = physio_wait(mbp, 0, "physio2");
    397 	if (error == 0) {
    398 		error = error2;
    399 	}
    400 	simple_unlock(&mbp->b_interlock);
    401 	KASSERT((mbp->b_flags & B_ERROR) != 0 ||
    402 	    mbp->b_resid == uio->uio_resid);
    403 #if defined(DIAGNOSTIC)
    404 	if ((mbp->b_flags & B_ERROR) != 0 && mbp->b_error == 0 &&
    405 	    uio->uio_offset - mbp->b_resid != mbp->b_eomoffset) {
    406 		panic("%s: eom", __func__);
    407 	}
    408 #endif /* defined(DIAGNOSTIC) */
    409 	uio->uio_resid = mbp->b_resid;
    410 	if (bp != NULL) {
    411 		putphysbuf(bp);
    412 	}
    413 	if (error == 0) {
    414 		error = mbp->b_error;
    415 	}
    416 	putphysbuf(mbp);
    417 
    418 	/*
    419 	 * [clean up the state of the buffer]
    420 	 * Remember if somebody wants it, so we can wake them up below.
    421 	 * Also, if we had to steal it, give it back.
    422 	 */
    423 	if (obp != NULL) {
    424 		KASSERT((obp->b_flags & B_BUSY) != 0);
    425 		KASSERT((obp->b_flags & B_DONTFREE) != 0);
    426 
    427 		/*
    428 		 * [if another process is waiting for the raw I/O buffer,
    429 		 *    wake up processes waiting to do physical I/O;
    430 		 */
    431 		s = splbio();
    432 		simple_lock(&obp->b_interlock);
    433 		obp->b_flags &=
    434 		    ~(B_BUSY | B_PHYS | B_RAW | B_CALL | B_DONTFREE);
    435 		if ((obp->b_flags & B_WANTED) != 0) {
    436 			obp->b_flags &= ~B_WANTED;
    437 			wakeup(obp);
    438 		}
    439 		simple_unlock(&obp->b_interlock);
    440 		splx(s);
    441 	}
    442 	PRELE(l);
    443 
    444 	return error;
    445 }
    446 
    447 /*
    448  * Leffler, et al., says on p. 231:
    449  * "The minphys() routine is called by physio() to adjust the
    450  * size of each I/O transfer before the latter is passed to
    451  * the strategy routine..."
    452  *
    453  * so, just adjust the buffer's count accounting to MAXPHYS here,
    454  * and return the new count;
    455  */
    456 void
    457 minphys(struct buf *bp)
    458 {
    459 
    460 	if (bp->b_bcount > MAXPHYS)
    461 		bp->b_bcount = MAXPHYS;
    462 }
    463