uvm_fault_i.h revision 1.29 1 1.29 christos /* $NetBSD: uvm_fault_i.h,v 1.29 2018/04/19 21:50:10 christos Exp $ */
2 1.1 mrg
3 1.1 mrg /*
4 1.1 mrg * Copyright (c) 1997 Charles D. Cranor and Washington University.
5 1.1 mrg * All rights reserved.
6 1.1 mrg *
7 1.1 mrg * Redistribution and use in source and binary forms, with or without
8 1.1 mrg * modification, are permitted provided that the following conditions
9 1.1 mrg * are met:
10 1.1 mrg * 1. Redistributions of source code must retain the above copyright
11 1.1 mrg * notice, this list of conditions and the following disclaimer.
12 1.1 mrg * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 mrg * notice, this list of conditions and the following disclaimer in the
14 1.1 mrg * documentation and/or other materials provided with the distribution.
15 1.1 mrg *
16 1.1 mrg * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
17 1.1 mrg * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
18 1.1 mrg * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
19 1.1 mrg * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
20 1.1 mrg * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
21 1.1 mrg * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
22 1.1 mrg * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
23 1.1 mrg * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24 1.1 mrg * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
25 1.1 mrg * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26 1.3 mrg *
27 1.3 mrg * from: Id: uvm_fault_i.h,v 1.1.6.1 1997/12/08 16:07:12 chuck Exp
28 1.1 mrg */
29 1.1 mrg
30 1.4 perry #ifndef _UVM_UVM_FAULT_I_H_
31 1.4 perry #define _UVM_UVM_FAULT_I_H_
32 1.4 perry
33 1.1 mrg /*
34 1.1 mrg * uvm_fault_i.h: fault inline functions
35 1.1 mrg */
36 1.1 mrg
37 1.1 mrg /*
38 1.1 mrg * uvmfault_unlockmaps: unlock the maps
39 1.1 mrg */
40 1.1 mrg
41 1.29 christos static __inline void
42 1.22 thorpej uvmfault_unlockmaps(struct uvm_faultinfo *ufi, bool write_locked)
43 1.5 mrg {
44 1.10 chs /*
45 1.10 chs * ufi can be NULL when this isn't really a fault,
46 1.10 chs * but merely paging in anon data.
47 1.10 chs */
48 1.10 chs
49 1.10 chs if (ufi == NULL) {
50 1.10 chs return;
51 1.10 chs }
52 1.1 mrg
53 1.5 mrg if (write_locked) {
54 1.5 mrg vm_map_unlock(ufi->map);
55 1.5 mrg } else {
56 1.5 mrg vm_map_unlock_read(ufi->map);
57 1.5 mrg }
58 1.1 mrg }
59 1.1 mrg
60 1.1 mrg /*
61 1.1 mrg * uvmfault_unlockall: unlock everything passed in.
62 1.1 mrg *
63 1.1 mrg * => maps must be read-locked (not write-locked).
64 1.1 mrg */
65 1.1 mrg
66 1.29 christos static __inline void
67 1.18 thorpej uvmfault_unlockall(struct uvm_faultinfo *ufi, struct vm_amap *amap,
68 1.27 rmind struct uvm_object *uobj)
69 1.5 mrg {
70 1.1 mrg
71 1.5 mrg if (uobj)
72 1.27 rmind mutex_exit(uobj->vmobjlock);
73 1.5 mrg if (amap)
74 1.7 chuck amap_unlock(amap);
75 1.23 thorpej uvmfault_unlockmaps(ufi, false);
76 1.9 thorpej }
77 1.9 thorpej
78 1.9 thorpej /*
79 1.1 mrg * uvmfault_lookup: lookup a virtual address in a map
80 1.1 mrg *
81 1.6 chuck * => caller must provide a uvm_faultinfo structure with the IN
82 1.1 mrg * params properly filled in
83 1.6 chuck * => we will lookup the map entry (handling submaps) as we go
84 1.1 mrg * => if the lookup is a success we will return with the maps locked
85 1.23 thorpej * => if "write_lock" is true, we write_lock the map, otherwise we only
86 1.1 mrg * get a read lock.
87 1.12 chs * => note that submaps can only appear in the kernel and they are
88 1.6 chuck * required to use the same virtual addresses as the map they
89 1.6 chuck * are referenced by (thus address translation between the main
90 1.6 chuck * map and the submap is unnecessary).
91 1.1 mrg */
92 1.1 mrg
93 1.29 christos static __inline bool
94 1.22 thorpej uvmfault_lookup(struct uvm_faultinfo *ufi, bool write_lock)
95 1.1 mrg {
96 1.13 chs struct vm_map *tmpmap;
97 1.1 mrg
98 1.5 mrg /*
99 1.5 mrg * init ufi values for lookup.
100 1.5 mrg */
101 1.5 mrg
102 1.5 mrg ufi->map = ufi->orig_map;
103 1.5 mrg ufi->size = ufi->orig_size;
104 1.5 mrg
105 1.5 mrg /*
106 1.5 mrg * keep going down levels until we are done. note that there can
107 1.5 mrg * only be two levels so we won't loop very long.
108 1.5 mrg */
109 1.5 mrg
110 1.28 rmind for (;;) {
111 1.5 mrg /*
112 1.5 mrg * lock map
113 1.5 mrg */
114 1.5 mrg if (write_lock) {
115 1.5 mrg vm_map_lock(ufi->map);
116 1.5 mrg } else {
117 1.5 mrg vm_map_lock_read(ufi->map);
118 1.5 mrg }
119 1.5 mrg
120 1.5 mrg /*
121 1.5 mrg * lookup
122 1.5 mrg */
123 1.12 chs if (!uvm_map_lookup_entry(ufi->map, ufi->orig_rvaddr,
124 1.27 rmind &ufi->entry)) {
125 1.5 mrg uvmfault_unlockmaps(ufi, write_lock);
126 1.23 thorpej return(false);
127 1.5 mrg }
128 1.5 mrg
129 1.5 mrg /*
130 1.5 mrg * reduce size if necessary
131 1.5 mrg */
132 1.6 chuck if (ufi->entry->end - ufi->orig_rvaddr < ufi->size)
133 1.6 chuck ufi->size = ufi->entry->end - ufi->orig_rvaddr;
134 1.5 mrg
135 1.5 mrg /*
136 1.5 mrg * submap? replace map with the submap and lookup again.
137 1.5 mrg * note: VAs in submaps must match VAs in main map.
138 1.5 mrg */
139 1.5 mrg if (UVM_ET_ISSUBMAP(ufi->entry)) {
140 1.5 mrg tmpmap = ufi->entry->object.sub_map;
141 1.5 mrg if (write_lock) {
142 1.5 mrg vm_map_unlock(ufi->map);
143 1.5 mrg } else {
144 1.5 mrg vm_map_unlock_read(ufi->map);
145 1.5 mrg }
146 1.5 mrg ufi->map = tmpmap;
147 1.5 mrg continue;
148 1.5 mrg }
149 1.5 mrg
150 1.5 mrg /*
151 1.5 mrg * got it!
152 1.5 mrg */
153 1.1 mrg
154 1.5 mrg ufi->mapv = ufi->map->timestamp;
155 1.23 thorpej return(true);
156 1.1 mrg
157 1.5 mrg } /* while loop */
158 1.1 mrg
159 1.5 mrg /*NOTREACHED*/
160 1.1 mrg }
161 1.1 mrg
162 1.1 mrg /*
163 1.1 mrg * uvmfault_relock: attempt to relock the same version of the map
164 1.1 mrg *
165 1.1 mrg * => fault data structures should be unlocked before calling.
166 1.23 thorpej * => if a success (true) maps will be locked after call.
167 1.1 mrg */
168 1.1 mrg
169 1.29 christos static __inline bool
170 1.18 thorpej uvmfault_relock(struct uvm_faultinfo *ufi)
171 1.5 mrg {
172 1.10 chs /*
173 1.10 chs * ufi can be NULL when this isn't really a fault,
174 1.10 chs * but merely paging in anon data.
175 1.10 chs */
176 1.10 chs
177 1.10 chs if (ufi == NULL) {
178 1.23 thorpej return true;
179 1.10 chs }
180 1.1 mrg
181 1.5 mrg uvmexp.fltrelck++;
182 1.10 chs
183 1.5 mrg /*
184 1.12 chs * relock map. fail if version mismatch (in which case nothing
185 1.6 chuck * gets locked).
186 1.5 mrg */
187 1.5 mrg
188 1.5 mrg vm_map_lock_read(ufi->map);
189 1.5 mrg if (ufi->mapv != ufi->map->timestamp) {
190 1.5 mrg vm_map_unlock_read(ufi->map);
191 1.23 thorpej return(false);
192 1.5 mrg }
193 1.1 mrg
194 1.5 mrg uvmexp.fltrelckok++;
195 1.23 thorpej return(true);
196 1.1 mrg }
197 1.4 perry
198 1.4 perry #endif /* _UVM_UVM_FAULT_I_H_ */
199