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