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