kern_physio.c revision 1.26 1 /* $NetBSD: kern_physio.c,v 1.26 1996/02/04 02:15:51 christos 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 #include <vm/vm.h>
51
52 /*
53 * The routines implemented in this file are described in:
54 * Leffler, et al.: The Design and Implementation of the 4.3BSD
55 * UNIX Operating System (Addison Welley, 1989)
56 * on pages 231-233.
57 *
58 * The routines "getphysbuf" and "putphysbuf" steal and return a swap
59 * buffer. Leffler, et al., says that swap buffers are used to do the
60 * I/O, so raw I/O requests don't have to be single-threaded.
61 */
62
63 struct buf *getphysbuf __P((void));
64 void putphysbuf __P((struct buf *bp));
65
66 /*
67 * Do "physical I/O" on behalf of a user. "Physical I/O" is I/O directly
68 * from the raw device to user buffers, and bypasses the buffer cache.
69 *
70 * Comments in brackets are from Leffler, et al.'s pseudo-code implementation.
71 */
72 int
73 physio(strategy, bp, dev, flags, minphys, uio)
74 void (*strategy) __P((struct buf *));
75 struct buf *bp;
76 dev_t dev;
77 int flags;
78 void (*minphys) __P((struct buf *));
79 struct uio *uio;
80 {
81 struct iovec *iovp;
82 struct proc *p = curproc;
83 int error, done, i, nobuf, s, todo;
84
85 error = 0;
86 flags &= B_READ | B_WRITE;
87
88 /*
89 * [check user read/write access to the data buffer]
90 *
91 * Check each iov one by one. Note that we know if we're reading or
92 * writing, so we ignore the uio's rw parameter. Also note that if
93 * we're doing a read, that's a *write* to user-space.
94 */
95 for (i = 0; i < uio->uio_iovcnt; i++)
96 if (!useracc(uio->uio_iov[i].iov_base, uio->uio_iov[i].iov_len,
97 (flags == B_READ) ? B_WRITE : B_READ))
98 return (EFAULT);
99
100 /* Make sure we have a buffer, creating one if necessary. */
101 if ((nobuf = (bp == NULL)) != 0)
102 bp = getphysbuf();
103
104 /* [raise the processor priority level to splbio;] */
105 s = splbio();
106
107 /* [while the buffer is marked busy] */
108 while (bp->b_flags & B_BUSY) {
109 /* [mark the buffer wanted] */
110 bp->b_flags |= B_WANTED;
111 /* [wait until the buffer is available] */
112 tsleep((caddr_t)bp, PRIBIO+1, "physbuf", 0);
113 }
114
115 /* Mark it busy, so nobody else will use it. */
116 bp->b_flags |= B_BUSY;
117
118 /* [lower the priority level] */
119 splx(s);
120
121 /* [set up the fixed part of the buffer for a transfer] */
122 bp->b_dev = dev;
123 bp->b_error = 0;
124 bp->b_proc = p;
125
126 /*
127 * [while there are data to transfer and no I/O error]
128 * Note that I/O errors are handled with a 'goto' at the bottom
129 * of the 'while' loop.
130 */
131 for (i = 0; i < uio->uio_iovcnt; i++) {
132 iovp = &uio->uio_iov[i];
133 while (iovp->iov_len > 0) {
134 /*
135 * [mark the buffer busy for physical I/O]
136 * (i.e. set B_PHYS (because it's an I/O to user
137 * memory, and B_RAW, because B_RAW is to be
138 * "Set by physio for raw transfers.", in addition
139 * to the "busy" and read/write flag.)
140 */
141 bp->b_flags = B_BUSY | B_PHYS | B_RAW | flags;
142
143 /* [set up the buffer for a maximum-sized transfer] */
144 bp->b_blkno = btodb(uio->uio_offset);
145 bp->b_bcount = iovp->iov_len;
146 bp->b_data = iovp->iov_base;
147
148 /*
149 * [call minphys to bound the tranfer size]
150 * and remember the amount of data to transfer,
151 * for later comparison.
152 */
153 (*minphys)(bp);
154 todo = bp->b_bcount;
155 #ifdef DIAGNOSTIC
156 if (todo < 0)
157 panic("todo < 0; minphys broken");
158 if (todo > MAXPHYS)
159 panic("todo > MAXPHYS; minphys broken");
160 #endif
161
162 /*
163 * [lock the part of the user address space involved
164 * in the transfer]
165 * Beware vmapbuf(); it clobbers b_data and
166 * saves it in b_saveaddr. However, vunmapbuf()
167 * restores it.
168 */
169 p->p_holdcnt++;
170 vslock(bp->b_data, todo);
171 vmapbuf(bp, todo);
172
173 /* [call strategy to start the transfer] */
174 (*strategy)(bp);
175
176 /*
177 * Note that the raise/wait/lower/get error
178 * steps below would be done by biowait(), but
179 * we want to unlock the address space before
180 * we lower the priority.
181 *
182 * [raise the priority level to splbio]
183 */
184 s = splbio();
185
186 /* [wait for the transfer to complete] */
187 while ((bp->b_flags & B_DONE) == 0)
188 tsleep((caddr_t) bp, PRIBIO + 1, "physio", 0);
189
190 /* Mark it busy again, so nobody else will use it. */
191 bp->b_flags |= B_BUSY;
192
193 /* [lower the priority level] */
194 splx(s);
195
196 /*
197 * [unlock the part of the address space previously
198 * locked]
199 */
200 vunmapbuf(bp, todo);
201 vsunlock(bp->b_data, todo);
202 p->p_holdcnt--;
203
204 /* remember error value (save a splbio/splx pair) */
205 if (bp->b_flags & B_ERROR)
206 error = (bp->b_error ? bp->b_error : EIO);
207
208 /*
209 * [deduct the transfer size from the total number
210 * of data to transfer]
211 */
212 done = bp->b_bcount - bp->b_resid;
213 #ifdef DIAGNOSTIC
214 if (done < 0)
215 panic("done < 0; strategy broken");
216 if (done > todo)
217 panic("done > todo; strategy broken");
218 #endif
219 iovp->iov_len -= done;
220 iovp->iov_base += done;
221 uio->uio_offset += done;
222 uio->uio_resid -= done;
223
224 /*
225 * Now, check for an error.
226 * Also, handle weird end-of-disk semantics.
227 */
228 if (error || done < todo)
229 goto done;
230 }
231 }
232
233 done:
234 /*
235 * [clean up the state of the buffer]
236 * Remember if somebody wants it, so we can wake them up below.
237 * Also, if we had to steal it, give it back.
238 */
239 s = splbio();
240 bp->b_flags &= ~(B_BUSY | B_PHYS | B_RAW);
241 if (nobuf)
242 putphysbuf(bp);
243 else {
244 /*
245 * [if another process is waiting for the raw I/O buffer,
246 * wake up processes waiting to do physical I/O;
247 */
248 if (bp->b_flags & B_WANTED) {
249 bp->b_flags &= ~B_WANTED;
250 wakeup(bp);
251 }
252 }
253 splx(s);
254
255 return (error);
256 }
257
258 /*
259 * Get a swap buffer structure, for use in physical I/O.
260 * Mostly taken from /sys/vm/swap_pager.c, except that it no longer
261 * records buffer list-empty conditions, and sleeps at PRIBIO + 1,
262 * rather than PSWP + 1 (and on a different wchan).
263 */
264 struct buf *
265 getphysbuf()
266 {
267 struct buf *bp;
268 int s;
269
270 s = splbio();
271 while (bswlist.b_actf == NULL) {
272 bswlist.b_flags |= B_WANTED;
273 tsleep((caddr_t)&bswlist, PRIBIO + 1, "getphys", 0);
274 }
275 bp = bswlist.b_actf;
276 bswlist.b_actf = bp->b_actf;
277 splx(s);
278 return (bp);
279 }
280
281 /*
282 * Get rid of a swap buffer structure which has been used in physical I/O.
283 * Mostly taken from /sys/vm/swap_pager.c, except that it now uses
284 * wakeup() rather than the VM-internal thread_wakeup(), and that the caller
285 * must mask disk interrupts, rather than putphysbuf() itself.
286 */
287 void
288 putphysbuf(bp)
289 struct buf *bp;
290 {
291
292 bp->b_actf = bswlist.b_actf;
293 bswlist.b_actf = bp;
294 if (bp->b_vp)
295 brelvp(bp);
296 if (bswlist.b_flags & B_WANTED) {
297 bswlist.b_flags &= ~B_WANTED;
298 wakeup(&bswlist);
299 }
300 }
301
302 /*
303 * Leffler, et al., says on p. 231:
304 * "The minphys() routine is called by physio() to adjust the
305 * size of each I/O transfer before the latter is passed to
306 * the strategy routine..."
307 *
308 * so, just adjust the buffer's count accounting to MAXPHYS here,
309 * and return the new count;
310 */
311 void
312 minphys(bp)
313 struct buf *bp;
314 {
315
316 if (bp->b_bcount > MAXPHYS)
317 bp->b_bcount = MAXPHYS;
318 }
319