kern_physio.c revision 1.23 1 /* $NetBSD: kern_physio.c,v 1.23 1995/07/27 02:37:12 mycroft Exp $ */
2
3 /*-
4 * Copyright (c) 1994 Christopher G. Demetriou
5 * Copyright (c) 1982, 1986, 1990, 1993
6 * The Regents of the University of California. All rights reserved.
7 * (c) UNIX System Laboratories, Inc.
8 * All or some portions of this file are derived from material licensed
9 * to the University of California by American Telephone and Telegraph
10 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
11 * the permission of UNIX System Laboratories, Inc.
12 *
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
15 * are met:
16 * 1. Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
21 * 3. All advertising materials mentioning features or use of this software
22 * must display the following acknowledgement:
23 * This product includes software developed by the University of
24 * California, Berkeley and its contributors.
25 * 4. Neither the name of the University nor the names of its contributors
26 * may be used to endorse or promote products derived from this software
27 * without specific prior written permission.
28 *
29 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
30 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
31 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
32 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
33 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
34 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
35 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
36 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
37 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
38 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 * SUCH DAMAGE.
40 *
41 * @(#)kern_physio.c 8.1 (Berkeley) 6/10/93
42 */
43
44 #include <sys/param.h>
45 #include <sys/systm.h>
46 #include <sys/buf.h>
47 #include <sys/conf.h>
48 #include <sys/proc.h>
49
50 /*
51 * The routines implemented in this file are described in:
52 * Leffler, et al.: The Design and Implementation of the 4.3BSD
53 * UNIX Operating System (Addison Welley, 1989)
54 * on pages 231-233.
55 *
56 * The routines "getphysbuf" and "putphysbuf" steal and return a swap
57 * buffer. Leffler, et al., says that swap buffers are used to do the
58 * I/O, so raw I/O requests don't have to be single-threaded.
59 */
60
61 struct buf *getphysbuf __P((void));
62 void putphysbuf __P((struct buf *bp));
63
64 /*
65 * Do "physical I/O" on behalf of a user. "Physical I/O" is I/O directly
66 * from the raw device to user buffers, and bypasses the buffer cache.
67 *
68 * Comments in brackets are from Leffler, et al.'s pseudo-code implementation.
69 */
70 int
71 physio(strategy, bp, dev, flags, minphys, uio)
72 void (*strategy) __P((struct buf *));
73 struct buf *bp;
74 dev_t dev;
75 int flags;
76 u_int (*minphys) __P((struct buf *));
77 struct uio *uio;
78 {
79 struct iovec *iovp;
80 struct proc *p = curproc;
81 int error, done, i, nobuf, s, todo;
82
83 error = 0;
84 flags &= B_READ | B_WRITE;
85
86 /*
87 * [check user read/write access to the data buffer]
88 *
89 * Check each iov one by one. Note that we know if we're reading or
90 * writing, so we ignore the uio's rw parameter. Also note that if
91 * we're doing a read, that's a *write* to user-space.
92 */
93 for (i = 0; i < uio->uio_iovcnt; i++)
94 if (!useracc(uio->uio_iov[i].iov_base, uio->uio_iov[i].iov_len,
95 (flags == B_READ) ? B_WRITE : B_READ))
96 return (EFAULT);
97
98 /* Make sure we have a buffer, creating one if necessary. */
99 if (nobuf = (bp == NULL))
100 bp = getphysbuf();
101
102 /* [raise the processor priority level to splbio;] */
103 s = splbio();
104
105 /* [while the buffer is marked busy] */
106 while (bp->b_flags & B_BUSY) {
107 /* [mark the buffer wanted] */
108 bp->b_flags |= B_WANTED;
109 /* [wait until the buffer is available] */
110 tsleep((caddr_t)bp, PRIBIO+1, "physbuf", 0);
111 }
112
113 /* Mark it busy, so nobody else will use it. */
114 bp->b_flags |= B_BUSY;
115
116 /* [lower the priority level] */
117 splx(s);
118
119 /* [set up the fixed part of the buffer for a transfer] */
120 bp->b_dev = dev;
121 bp->b_error = 0;
122 bp->b_proc = p;
123
124 /*
125 * [while there are data to transfer and no I/O error]
126 * Note that I/O errors are handled with a 'goto' at the bottom
127 * of the 'while' loop.
128 */
129 for (i = 0; i < uio->uio_iovcnt; i++) {
130 iovp = &uio->uio_iov[i];
131 while (iovp->iov_len > 0) {
132 /*
133 * [mark the buffer busy for physical I/O]
134 * (i.e. set B_PHYS (because it's an I/O to user
135 * memory, and B_RAW, because B_RAW is to be
136 * "Set by physio for raw transfers.", in addition
137 * to the "busy" and read/write flag.)
138 */
139 bp->b_flags = B_BUSY | B_PHYS | B_RAW | flags;
140
141 /* [set up the buffer for a maximum-sized transfer] */
142 bp->b_blkno = btodb(uio->uio_offset);
143 bp->b_bcount = iovp->iov_len;
144 bp->b_data = iovp->iov_base;
145
146 /*
147 * [call minphys to bound the tranfer size]
148 * and remember the amount of data to transfer,
149 * for later comparison.
150 */
151 todo = (*minphys)(bp);
152 #ifdef DIAGNOSTIC
153 if (todo > MAXPHYS)
154 panic("todo > MAXPHYS; minphys broken");
155 #endif
156
157 /*
158 * [lock the part of the user address space involved
159 * in the transfer]
160 * Beware vmapbuf(); it clobbers b_data and
161 * saves it in b_saveaddr. However, vunmapbuf()
162 * restores it.
163 */
164 p->p_holdcnt++;
165 vslock(bp->b_data, todo);
166 vmapbuf(bp, todo);
167
168 /* [call strategy to start the transfer] */
169 (*strategy)(bp);
170
171 /*
172 * Note that the raise/wait/lower/get error
173 * steps below would be done by biowait(), but
174 * we want to unlock the address space before
175 * we lower the priority.
176 *
177 * [raise the priority level to splbio]
178 */
179 s = splbio();
180
181 /* [wait for the transfer to complete] */
182 while ((bp->b_flags & B_DONE) == 0)
183 tsleep((caddr_t) bp, PRIBIO + 1, "physio", 0);
184
185 /* Mark it busy again, so nobody else will use it. */
186 bp->b_flags |= B_BUSY;
187
188 /* [lower the priority level] */
189 splx(s);
190
191 /*
192 * [unlock the part of the address space previously
193 * locked]
194 */
195 vunmapbuf(bp, todo);
196 vsunlock(bp->b_data, todo);
197 p->p_holdcnt--;
198
199 /* remember error value (save a splbio/splx pair) */
200 if (bp->b_flags & B_ERROR)
201 error = (bp->b_error ? bp->b_error : EIO);
202
203 /*
204 * [deduct the transfer size from the total number
205 * of data to transfer]
206 */
207 done = bp->b_bcount - bp->b_resid;
208 iovp->iov_len -= done;
209 iovp->iov_base += done;
210 uio->uio_offset += done;
211 uio->uio_resid -= done;
212
213 /*
214 * Now, check for an error.
215 * Also, handle weird end-of-disk semantics.
216 */
217 if (error || done < todo)
218 goto done;
219 }
220 }
221
222 done:
223 /*
224 * [clean up the state of the buffer]
225 * Remember if somebody wants it, so we can wake them up below.
226 * Also, if we had to steal it, give it back.
227 */
228 s = splbio();
229 bp->b_flags &= ~(B_BUSY | B_PHYS | B_RAW);
230 if (nobuf)
231 putphysbuf(bp);
232 else {
233 /*
234 * [if another process is waiting for the raw I/O buffer,
235 * wake up processes waiting to do physical I/O;
236 */
237 if (bp->b_flags & B_WANTED) {
238 bp->b_flags &= ~B_WANTED;
239 wakeup(bp);
240 }
241 }
242 splx(s);
243
244 return (error);
245 }
246
247 /*
248 * Get a swap buffer structure, for use in physical I/O.
249 * Mostly taken from /sys/vm/swap_pager.c, except that it no longer
250 * records buffer list-empty conditions, and sleeps at PRIBIO + 1,
251 * rather than PSWP + 1 (and on a different wchan).
252 */
253 struct buf *
254 getphysbuf()
255 {
256 struct buf *bp;
257 int s;
258
259 s = splbio();
260 while (bswlist.b_actf == NULL) {
261 bswlist.b_flags |= B_WANTED;
262 tsleep((caddr_t)&bswlist, PRIBIO + 1, "getphys", 0);
263 }
264 bp = bswlist.b_actf;
265 bswlist.b_actf = bp->b_actf;
266 splx(s);
267 return (bp);
268 }
269
270 /*
271 * Get rid of a swap buffer structure which has been used in physical I/O.
272 * Mostly taken from /sys/vm/swap_pager.c, except that it now uses
273 * wakeup() rather than the VM-internal thread_wakeup(), and that the caller
274 * must mask disk interrupts, rather than putphysbuf() itself.
275 */
276 void
277 putphysbuf(bp)
278 struct buf *bp;
279 {
280
281 bp->b_actf = bswlist.b_actf;
282 bswlist.b_actf = bp;
283 if (bp->b_vp)
284 brelvp(bp);
285 if (bswlist.b_flags & B_WANTED) {
286 bswlist.b_flags &= ~B_WANTED;
287 wakeup(&bswlist);
288 }
289 }
290
291 /*
292 * Leffler, et al., says on p. 231:
293 * "The minphys() routine is called by physio() to adjust the
294 * size of each I/O transfer before the latter is passed to
295 * the strategy routine..."
296 *
297 * so, just adjust the buffer's count accounting to MAXPHYS here,
298 * and return the new count;
299 */
300 u_int
301 minphys(bp)
302 struct buf *bp;
303 {
304
305 bp->b_bcount = min(MAXPHYS, bp->b_bcount);
306 return bp->b_bcount;
307 }
308