uvm_io.c revision 1.11 1 /* $NetBSD: uvm_io.c,v 1.11 2000/06/26 14:21:18 mrg Exp $ */
2
3 /*
4 *
5 * Copyright (c) 1997 Charles D. Cranor and Washington University.
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by Charles D. Cranor and
19 * Washington University.
20 * 4. The name of the author may not be used to endorse or promote products
21 * derived from this software without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
24 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
25 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
26 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
27 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
28 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
29 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
30 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
31 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
32 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 *
34 * from: Id: uvm_io.c,v 1.1.2.2 1997/12/30 12:02:00 mrg Exp
35 */
36
37 /*
38 * uvm_io.c: uvm i/o ops
39 */
40
41 #include <sys/param.h>
42 #include <sys/systm.h>
43 #include <sys/mman.h>
44 #include <sys/proc.h>
45 #include <sys/malloc.h>
46 #include <sys/uio.h>
47
48 #include <vm/vm.h>
49
50 #include <uvm/uvm.h>
51
52 /*
53 * functions
54 */
55
56 /*
57 * uvm_io: perform I/O on a map
58 *
59 * => caller must have a reference to "map" so that it doesn't go away
60 * while we are working.
61 */
62
63 int
64 uvm_io(map, uio)
65 vm_map_t map;
66 struct uio *uio;
67 {
68 vaddr_t baseva, endva, pageoffset, kva;
69 vsize_t chunksz, togo, sz;
70 vm_map_entry_t dead_entries;
71 int error;
72
73 /*
74 * step 0: sanity checks and set up for copy loop. start with a
75 * large chunk size. if we have trouble finding vm space we will
76 * reduce it.
77 */
78
79 if (uio->uio_resid == 0)
80 return(0);
81 togo = uio->uio_resid;
82
83 baseva = (vaddr_t) uio->uio_offset;
84 endva = baseva + (togo - 1);
85
86 if (endva < baseva) /* wrap around? */
87 return(EIO);
88
89 if (baseva >= VM_MAXUSER_ADDRESS)
90 return(0);
91 if (endva >= VM_MAXUSER_ADDRESS)
92 /* EOF truncate */
93 togo = togo - (endva - VM_MAXUSER_ADDRESS + 1);
94 pageoffset = baseva & PAGE_MASK;
95 baseva = trunc_page(baseva);
96 chunksz = min(round_page(togo + pageoffset), MAXBSIZE);
97 error = 0;
98
99 /*
100 * step 1: main loop... while we've got data to move
101 */
102
103 for (/*null*/; togo > 0 ; pageoffset = 0) {
104
105 /*
106 * step 2: extract mappings from the map into kernel_map
107 */
108
109 error = uvm_map_extract(map, baseva, chunksz, kernel_map, &kva,
110 UVM_EXTRACT_QREF | UVM_EXTRACT_CONTIG |
111 UVM_EXTRACT_FIXPROT);
112 if (error) {
113
114 /* retry with a smaller chunk... */
115 if (error == ENOMEM && chunksz > PAGE_SIZE) {
116 chunksz = trunc_page(chunksz / 2);
117 if (chunksz < PAGE_SIZE)
118 chunksz = PAGE_SIZE;
119 continue;
120 }
121
122 break;
123 }
124
125 /*
126 * step 3: move a chunk of data
127 */
128
129 sz = chunksz - pageoffset;
130 if (sz > togo)
131 sz = togo;
132 error = uiomove((caddr_t) (kva + pageoffset), sz, uio);
133 if (error)
134 break;
135 togo -= sz;
136 baseva += chunksz;
137
138
139 /*
140 * step 4: unmap the area of kernel memory
141 */
142
143 vm_map_lock(kernel_map);
144 (void)uvm_unmap_remove(kernel_map, kva, kva+chunksz,
145 &dead_entries);
146 vm_map_unlock(kernel_map);
147
148 if (dead_entries != NULL)
149 uvm_unmap_detach(dead_entries, AMAP_REFALL);
150 }
151
152 /*
153 * done
154 */
155
156 return (error);
157 }
158