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