kern_physio.c revision 1.25 1 /* $NetBSD: kern_physio.c,v 1.25 1995/10/10 02:51:45 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 void (*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 (*minphys)(bp);
152 todo = bp->b_bcount;
153 #ifdef DIAGNOSTIC
154 if (todo < 0)
155 panic("todo < 0; minphys broken");
156 if (todo > MAXPHYS)
157 panic("todo > MAXPHYS; minphys broken");
158 #endif
159
160 /*
161 * [lock the part of the user address space involved
162 * in the transfer]
163 * Beware vmapbuf(); it clobbers b_data and
164 * saves it in b_saveaddr. However, vunmapbuf()
165 * restores it.
166 */
167 p->p_holdcnt++;
168 vslock(bp->b_data, todo);
169 vmapbuf(bp, todo);
170
171 /* [call strategy to start the transfer] */
172 (*strategy)(bp);
173
174 /*
175 * Note that the raise/wait/lower/get error
176 * steps below would be done by biowait(), but
177 * we want to unlock the address space before
178 * we lower the priority.
179 *
180 * [raise the priority level to splbio]
181 */
182 s = splbio();
183
184 /* [wait for the transfer to complete] */
185 while ((bp->b_flags & B_DONE) == 0)
186 tsleep((caddr_t) bp, PRIBIO + 1, "physio", 0);
187
188 /* Mark it busy again, so nobody else will use it. */
189 bp->b_flags |= B_BUSY;
190
191 /* [lower the priority level] */
192 splx(s);
193
194 /*
195 * [unlock the part of the address space previously
196 * locked]
197 */
198 vunmapbuf(bp, todo);
199 vsunlock(bp->b_data, todo);
200 p->p_holdcnt--;
201
202 /* remember error value (save a splbio/splx pair) */
203 if (bp->b_flags & B_ERROR)
204 error = (bp->b_error ? bp->b_error : EIO);
205
206 /*
207 * [deduct the transfer size from the total number
208 * of data to transfer]
209 */
210 done = bp->b_bcount - bp->b_resid;
211 #ifdef DIAGNOSTIC
212 if (done < 0)
213 panic("done < 0; strategy broken");
214 if (done > todo)
215 panic("done > todo; strategy broken");
216 #endif
217 iovp->iov_len -= done;
218 iovp->iov_base += done;
219 uio->uio_offset += done;
220 uio->uio_resid -= done;
221
222 /*
223 * Now, check for an error.
224 * Also, handle weird end-of-disk semantics.
225 */
226 if (error || done < todo)
227 goto done;
228 }
229 }
230
231 done:
232 /*
233 * [clean up the state of the buffer]
234 * Remember if somebody wants it, so we can wake them up below.
235 * Also, if we had to steal it, give it back.
236 */
237 s = splbio();
238 bp->b_flags &= ~(B_BUSY | B_PHYS | B_RAW);
239 if (nobuf)
240 putphysbuf(bp);
241 else {
242 /*
243 * [if another process is waiting for the raw I/O buffer,
244 * wake up processes waiting to do physical I/O;
245 */
246 if (bp->b_flags & B_WANTED) {
247 bp->b_flags &= ~B_WANTED;
248 wakeup(bp);
249 }
250 }
251 splx(s);
252
253 return (error);
254 }
255
256 /*
257 * Get a swap buffer structure, for use in physical I/O.
258 * Mostly taken from /sys/vm/swap_pager.c, except that it no longer
259 * records buffer list-empty conditions, and sleeps at PRIBIO + 1,
260 * rather than PSWP + 1 (and on a different wchan).
261 */
262 struct buf *
263 getphysbuf()
264 {
265 struct buf *bp;
266 int s;
267
268 s = splbio();
269 while (bswlist.b_actf == NULL) {
270 bswlist.b_flags |= B_WANTED;
271 tsleep((caddr_t)&bswlist, PRIBIO + 1, "getphys", 0);
272 }
273 bp = bswlist.b_actf;
274 bswlist.b_actf = bp->b_actf;
275 splx(s);
276 return (bp);
277 }
278
279 /*
280 * Get rid of a swap buffer structure which has been used in physical I/O.
281 * Mostly taken from /sys/vm/swap_pager.c, except that it now uses
282 * wakeup() rather than the VM-internal thread_wakeup(), and that the caller
283 * must mask disk interrupts, rather than putphysbuf() itself.
284 */
285 void
286 putphysbuf(bp)
287 struct buf *bp;
288 {
289
290 bp->b_actf = bswlist.b_actf;
291 bswlist.b_actf = bp;
292 if (bp->b_vp)
293 brelvp(bp);
294 if (bswlist.b_flags & B_WANTED) {
295 bswlist.b_flags &= ~B_WANTED;
296 wakeup(&bswlist);
297 }
298 }
299
300 /*
301 * Leffler, et al., says on p. 231:
302 * "The minphys() routine is called by physio() to adjust the
303 * size of each I/O transfer before the latter is passed to
304 * the strategy routine..."
305 *
306 * so, just adjust the buffer's count accounting to MAXPHYS here,
307 * and return the new count;
308 */
309 void
310 minphys(bp)
311 struct buf *bp;
312 {
313
314 if (bp->b_bcount > MAXPHYS)
315 bp->b_bcount = MAXPHYS;
316 }
317