Rev 2170 | Rev 2556 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2170 | Rev 2183 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (c) 2001-2006 Jakub Jermar |
2 | * Copyright (c) 2001-2006 Jakub Jermar |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
13 | * documentation and/or other materials provided with the distribution. |
14 | * - The name of the author may not be used to endorse or promote products |
14 | * - The name of the author may not be used to endorse or promote products |
15 | * derived from this software without specific prior written permission. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
29 | /** @addtogroup genericmm |
29 | /** @addtogroup genericmm |
30 | * @{ |
30 | * @{ |
31 | */ |
31 | */ |
32 | 32 | ||
33 | /** |
33 | /** |
34 | * @file |
34 | * @file |
35 | * @brief Address space related functions. |
35 | * @brief Address space related functions. |
36 | * |
36 | * |
37 | * This file contains address space manipulation functions. |
37 | * This file contains address space manipulation functions. |
38 | * Roughly speaking, this is a higher-level client of |
38 | * Roughly speaking, this is a higher-level client of |
39 | * Virtual Address Translation (VAT) subsystem. |
39 | * Virtual Address Translation (VAT) subsystem. |
40 | * |
40 | * |
41 | * Functionality provided by this file allows one to |
41 | * Functionality provided by this file allows one to |
42 | * create address spaces and create, resize and share |
42 | * create address spaces and create, resize and share |
43 | * address space areas. |
43 | * address space areas. |
44 | * |
44 | * |
45 | * @see page.c |
45 | * @see page.c |
46 | * |
46 | * |
47 | */ |
47 | */ |
48 | 48 | ||
49 | #include <mm/as.h> |
49 | #include <mm/as.h> |
50 | #include <arch/mm/as.h> |
50 | #include <arch/mm/as.h> |
51 | #include <mm/page.h> |
51 | #include <mm/page.h> |
52 | #include <mm/frame.h> |
52 | #include <mm/frame.h> |
53 | #include <mm/slab.h> |
53 | #include <mm/slab.h> |
54 | #include <mm/tlb.h> |
54 | #include <mm/tlb.h> |
55 | #include <arch/mm/page.h> |
55 | #include <arch/mm/page.h> |
56 | #include <genarch/mm/page_pt.h> |
56 | #include <genarch/mm/page_pt.h> |
57 | #include <genarch/mm/page_ht.h> |
57 | #include <genarch/mm/page_ht.h> |
58 | #include <mm/asid.h> |
58 | #include <mm/asid.h> |
59 | #include <arch/mm/asid.h> |
59 | #include <arch/mm/asid.h> |
- | 60 | #include <preemption.h> |
|
60 | #include <synch/spinlock.h> |
61 | #include <synch/spinlock.h> |
61 | #include <synch/mutex.h> |
62 | #include <synch/mutex.h> |
62 | #include <adt/list.h> |
63 | #include <adt/list.h> |
63 | #include <adt/btree.h> |
64 | #include <adt/btree.h> |
64 | #include <proc/task.h> |
65 | #include <proc/task.h> |
65 | #include <proc/thread.h> |
66 | #include <proc/thread.h> |
66 | #include <arch/asm.h> |
67 | #include <arch/asm.h> |
67 | #include <panic.h> |
68 | #include <panic.h> |
68 | #include <debug.h> |
69 | #include <debug.h> |
69 | #include <print.h> |
70 | #include <print.h> |
70 | #include <memstr.h> |
71 | #include <memstr.h> |
71 | #include <macros.h> |
72 | #include <macros.h> |
72 | #include <arch.h> |
73 | #include <arch.h> |
73 | #include <errno.h> |
74 | #include <errno.h> |
74 | #include <config.h> |
75 | #include <config.h> |
75 | #include <align.h> |
76 | #include <align.h> |
76 | #include <arch/types.h> |
77 | #include <arch/types.h> |
77 | #include <syscall/copy.h> |
78 | #include <syscall/copy.h> |
78 | #include <arch/interrupt.h> |
79 | #include <arch/interrupt.h> |
79 | 80 | ||
80 | #ifdef CONFIG_VIRT_IDX_DCACHE |
81 | #ifdef CONFIG_VIRT_IDX_DCACHE |
81 | #include <arch/mm/cache.h> |
82 | #include <arch/mm/cache.h> |
82 | #endif /* CONFIG_VIRT_IDX_DCACHE */ |
83 | #endif /* CONFIG_VIRT_IDX_DCACHE */ |
83 | 84 | ||
84 | #ifndef __OBJC__ |
85 | #ifndef __OBJC__ |
85 | /** |
86 | /** |
86 | * Each architecture decides what functions will be used to carry out |
87 | * Each architecture decides what functions will be used to carry out |
87 | * address space operations such as creating or locking page tables. |
88 | * address space operations such as creating or locking page tables. |
88 | */ |
89 | */ |
89 | as_operations_t *as_operations = NULL; |
90 | as_operations_t *as_operations = NULL; |
90 | 91 | ||
91 | /** |
92 | /** |
92 | * Slab for as_t objects. |
93 | * Slab for as_t objects. |
93 | */ |
94 | */ |
94 | static slab_cache_t *as_slab; |
95 | static slab_cache_t *as_slab; |
95 | #endif |
96 | #endif |
96 | 97 | ||
97 | /** |
98 | /** |
98 | * This lock serializes access to the ASID subsystem. |
99 | * This lock serializes access to the ASID subsystem. |
99 | * It protects: |
100 | * It protects: |
100 | * - inactive_as_with_asid_head list |
101 | * - inactive_as_with_asid_head list |
101 | * - as->asid for each as of the as_t type |
102 | * - as->asid for each as of the as_t type |
102 | * - asids_allocated counter |
103 | * - asids_allocated counter |
103 | */ |
104 | */ |
104 | SPINLOCK_INITIALIZE(asidlock); |
105 | SPINLOCK_INITIALIZE(asidlock); |
105 | 106 | ||
106 | /** |
107 | /** |
107 | * This list contains address spaces that are not active on any |
108 | * This list contains address spaces that are not active on any |
108 | * processor and that have valid ASID. |
109 | * processor and that have valid ASID. |
109 | */ |
110 | */ |
110 | LIST_INITIALIZE(inactive_as_with_asid_head); |
111 | LIST_INITIALIZE(inactive_as_with_asid_head); |
111 | 112 | ||
112 | /** Kernel address space. */ |
113 | /** Kernel address space. */ |
113 | as_t *AS_KERNEL = NULL; |
114 | as_t *AS_KERNEL = NULL; |
114 | 115 | ||
115 | static int area_flags_to_page_flags(int aflags); |
116 | static int area_flags_to_page_flags(int aflags); |
116 | static as_area_t *find_area_and_lock(as_t *as, uintptr_t va); |
117 | static as_area_t *find_area_and_lock(as_t *as, uintptr_t va); |
117 | static bool check_area_conflicts(as_t *as, uintptr_t va, size_t size, |
118 | static bool check_area_conflicts(as_t *as, uintptr_t va, size_t size, |
118 | as_area_t *avoid_area); |
119 | as_area_t *avoid_area); |
119 | static void sh_info_remove_reference(share_info_t *sh_info); |
120 | static void sh_info_remove_reference(share_info_t *sh_info); |
120 | 121 | ||
121 | #ifndef __OBJC__ |
122 | #ifndef __OBJC__ |
122 | static int as_constructor(void *obj, int flags) |
123 | static int as_constructor(void *obj, int flags) |
123 | { |
124 | { |
124 | as_t *as = (as_t *) obj; |
125 | as_t *as = (as_t *) obj; |
125 | int rc; |
126 | int rc; |
126 | 127 | ||
127 | link_initialize(&as->inactive_as_with_asid_link); |
128 | link_initialize(&as->inactive_as_with_asid_link); |
128 | mutex_initialize(&as->lock); |
129 | mutex_initialize(&as->lock); |
129 | 130 | ||
130 | rc = as_constructor_arch(as, flags); |
131 | rc = as_constructor_arch(as, flags); |
131 | 132 | ||
132 | return rc; |
133 | return rc; |
133 | } |
134 | } |
134 | 135 | ||
135 | static int as_destructor(void *obj) |
136 | static int as_destructor(void *obj) |
136 | { |
137 | { |
137 | as_t *as = (as_t *) obj; |
138 | as_t *as = (as_t *) obj; |
138 | 139 | ||
139 | return as_destructor_arch(as); |
140 | return as_destructor_arch(as); |
140 | } |
141 | } |
141 | #endif |
142 | #endif |
142 | 143 | ||
143 | /** Initialize address space subsystem. */ |
144 | /** Initialize address space subsystem. */ |
144 | void as_init(void) |
145 | void as_init(void) |
145 | { |
146 | { |
146 | as_arch_init(); |
147 | as_arch_init(); |
147 | 148 | ||
148 | #ifndef __OBJC__ |
149 | #ifndef __OBJC__ |
149 | as_slab = slab_cache_create("as_slab", sizeof(as_t), 0, |
150 | as_slab = slab_cache_create("as_slab", sizeof(as_t), 0, |
150 | as_constructor, as_destructor, SLAB_CACHE_MAGDEFERRED); |
151 | as_constructor, as_destructor, SLAB_CACHE_MAGDEFERRED); |
151 | #endif |
152 | #endif |
152 | 153 | ||
153 | AS_KERNEL = as_create(FLAG_AS_KERNEL); |
154 | AS_KERNEL = as_create(FLAG_AS_KERNEL); |
154 | if (!AS_KERNEL) |
155 | if (!AS_KERNEL) |
155 | panic("can't create kernel address space\n"); |
156 | panic("can't create kernel address space\n"); |
156 | 157 | ||
157 | } |
158 | } |
158 | 159 | ||
159 | /** Create address space. |
160 | /** Create address space. |
160 | * |
161 | * |
161 | * @param flags Flags that influence way in wich the address space is created. |
162 | * @param flags Flags that influence way in wich the address space is created. |
162 | */ |
163 | */ |
163 | as_t *as_create(int flags) |
164 | as_t *as_create(int flags) |
164 | { |
165 | { |
165 | as_t *as; |
166 | as_t *as; |
166 | 167 | ||
167 | #ifdef __OBJC__ |
168 | #ifdef __OBJC__ |
168 | as = [as_t new]; |
169 | as = [as_t new]; |
169 | link_initialize(&as->inactive_as_with_asid_link); |
170 | link_initialize(&as->inactive_as_with_asid_link); |
170 | mutex_initialize(&as->lock); |
171 | mutex_initialize(&as->lock); |
171 | (void) as_constructor_arch(as, flags); |
172 | (void) as_constructor_arch(as, flags); |
172 | #else |
173 | #else |
173 | as = (as_t *) slab_alloc(as_slab, 0); |
174 | as = (as_t *) slab_alloc(as_slab, 0); |
174 | #endif |
175 | #endif |
175 | (void) as_create_arch(as, 0); |
176 | (void) as_create_arch(as, 0); |
176 | 177 | ||
177 | btree_create(&as->as_area_btree); |
178 | btree_create(&as->as_area_btree); |
178 | 179 | ||
179 | if (flags & FLAG_AS_KERNEL) |
180 | if (flags & FLAG_AS_KERNEL) |
180 | as->asid = ASID_KERNEL; |
181 | as->asid = ASID_KERNEL; |
181 | else |
182 | else |
182 | as->asid = ASID_INVALID; |
183 | as->asid = ASID_INVALID; |
183 | 184 | ||
184 | as->refcount = 0; |
185 | atomic_set(&as->refcount, 0); |
185 | as->cpu_refcount = 0; |
186 | as->cpu_refcount = 0; |
186 | #ifdef AS_PAGE_TABLE |
187 | #ifdef AS_PAGE_TABLE |
187 | as->genarch.page_table = page_table_create(flags); |
188 | as->genarch.page_table = page_table_create(flags); |
188 | #else |
189 | #else |
189 | page_table_create(flags); |
190 | page_table_create(flags); |
190 | #endif |
191 | #endif |
191 | 192 | ||
192 | return as; |
193 | return as; |
193 | } |
194 | } |
194 | 195 | ||
195 | /** Destroy adress space. |
196 | /** Destroy adress space. |
196 | * |
197 | * |
197 | * When there are no tasks referencing this address space (i.e. its refcount is |
198 | * When there are no tasks referencing this address space (i.e. its refcount is |
198 | * zero), the address space can be destroyed. |
199 | * zero), the address space can be destroyed. |
- | 200 | * |
|
- | 201 | * We know that we don't hold any spinlock. |
|
199 | */ |
202 | */ |
200 | void as_destroy(as_t *as) |
203 | void as_destroy(as_t *as) |
201 | { |
204 | { |
202 | ipl_t ipl; |
205 | ipl_t ipl; |
203 | bool cond; |
206 | bool cond; |
- | 207 | DEADLOCK_PROBE_INIT(p_asidlock); |
|
204 | 208 | ||
205 | ASSERT(as->refcount == 0); |
209 | ASSERT(atomic_get(&as->refcount) == 0); |
206 | 210 | ||
207 | /* |
211 | /* |
208 | * Since there is no reference to this area, |
212 | * Since there is no reference to this area, |
209 | * it is safe not to lock its mutex. |
213 | * it is safe not to lock its mutex. |
210 | */ |
214 | */ |
211 | 215 | ||
- | 216 | /* |
|
- | 217 | * We need to avoid deadlock between TLB shootdown and asidlock. |
|
- | 218 | * We therefore try to take asid conditionally and if we don't succeed, |
|
- | 219 | * we enable interrupts and try again. This is done while preemption is |
|
- | 220 | * disabled to prevent nested context switches. We also depend on the |
|
- | 221 | * fact that so far no spinlocks are held. |
|
- | 222 | */ |
|
- | 223 | preemption_disable(); |
|
212 | ipl = interrupts_disable(); |
224 | ipl = interrupts_read(); |
- | 225 | retry: |
|
- | 226 | interrupts_disable(); |
|
213 | spinlock_lock(&asidlock); |
227 | if (!spinlock_trylock(&asidlock)) { |
- | 228 | interrupts_enable(); |
|
- | 229 | DEADLOCK_PROBE(p_asidlock, DEADLOCK_THRESHOLD); |
|
- | 230 | goto retry; |
|
- | 231 | } |
|
- | 232 | preemption_enable(); /* Interrupts disabled, enable preemption */ |
|
214 | if (as->asid != ASID_INVALID && as != AS_KERNEL) { |
233 | if (as->asid != ASID_INVALID && as != AS_KERNEL) { |
215 | if (as != AS && as->cpu_refcount == 0) |
234 | if (as != AS && as->cpu_refcount == 0) |
216 | list_remove(&as->inactive_as_with_asid_link); |
235 | list_remove(&as->inactive_as_with_asid_link); |
217 | asid_put(as->asid); |
236 | asid_put(as->asid); |
218 | } |
237 | } |
219 | spinlock_unlock(&asidlock); |
238 | spinlock_unlock(&asidlock); |
220 | 239 | ||
221 | /* |
240 | /* |
222 | * Destroy address space areas of the address space. |
241 | * Destroy address space areas of the address space. |
223 | * The B+tree must be walked carefully because it is |
242 | * The B+tree must be walked carefully because it is |
224 | * also being destroyed. |
243 | * also being destroyed. |
225 | */ |
244 | */ |
226 | for (cond = true; cond; ) { |
245 | for (cond = true; cond; ) { |
227 | btree_node_t *node; |
246 | btree_node_t *node; |
228 | 247 | ||
229 | ASSERT(!list_empty(&as->as_area_btree.leaf_head)); |
248 | ASSERT(!list_empty(&as->as_area_btree.leaf_head)); |
230 | node = list_get_instance(as->as_area_btree.leaf_head.next, |
249 | node = list_get_instance(as->as_area_btree.leaf_head.next, |
231 | btree_node_t, leaf_link); |
250 | btree_node_t, leaf_link); |
232 | 251 | ||
233 | if ((cond = node->keys)) { |
252 | if ((cond = node->keys)) { |
234 | as_area_destroy(as, node->key[0]); |
253 | as_area_destroy(as, node->key[0]); |
235 | } |
254 | } |
236 | } |
255 | } |
237 | 256 | ||
238 | btree_destroy(&as->as_area_btree); |
257 | btree_destroy(&as->as_area_btree); |
239 | #ifdef AS_PAGE_TABLE |
258 | #ifdef AS_PAGE_TABLE |
240 | page_table_destroy(as->genarch.page_table); |
259 | page_table_destroy(as->genarch.page_table); |
241 | #else |
260 | #else |
242 | page_table_destroy(NULL); |
261 | page_table_destroy(NULL); |
243 | #endif |
262 | #endif |
244 | 263 | ||
245 | interrupts_restore(ipl); |
264 | interrupts_restore(ipl); |
246 | 265 | ||
247 | #ifdef __OBJC__ |
266 | #ifdef __OBJC__ |
248 | [as free]; |
267 | [as free]; |
249 | #else |
268 | #else |
250 | slab_free(as_slab, as); |
269 | slab_free(as_slab, as); |
251 | #endif |
270 | #endif |
252 | } |
271 | } |
253 | 272 | ||
254 | /** Create address space area of common attributes. |
273 | /** Create address space area of common attributes. |
255 | * |
274 | * |
256 | * The created address space area is added to the target address space. |
275 | * The created address space area is added to the target address space. |
257 | * |
276 | * |
258 | * @param as Target address space. |
277 | * @param as Target address space. |
259 | * @param flags Flags of the area memory. |
278 | * @param flags Flags of the area memory. |
260 | * @param size Size of area. |
279 | * @param size Size of area. |
261 | * @param base Base address of area. |
280 | * @param base Base address of area. |
262 | * @param attrs Attributes of the area. |
281 | * @param attrs Attributes of the area. |
263 | * @param backend Address space area backend. NULL if no backend is used. |
282 | * @param backend Address space area backend. NULL if no backend is used. |
264 | * @param backend_data NULL or a pointer to an array holding two void *. |
283 | * @param backend_data NULL or a pointer to an array holding two void *. |
265 | * |
284 | * |
266 | * @return Address space area on success or NULL on failure. |
285 | * @return Address space area on success or NULL on failure. |
267 | */ |
286 | */ |
268 | as_area_t * |
287 | as_area_t * |
269 | as_area_create(as_t *as, int flags, size_t size, uintptr_t base, int attrs, |
288 | as_area_create(as_t *as, int flags, size_t size, uintptr_t base, int attrs, |
270 | mem_backend_t *backend, mem_backend_data_t *backend_data) |
289 | mem_backend_t *backend, mem_backend_data_t *backend_data) |
271 | { |
290 | { |
272 | ipl_t ipl; |
291 | ipl_t ipl; |
273 | as_area_t *a; |
292 | as_area_t *a; |
274 | 293 | ||
275 | if (base % PAGE_SIZE) |
294 | if (base % PAGE_SIZE) |
276 | return NULL; |
295 | return NULL; |
277 | 296 | ||
278 | if (!size) |
297 | if (!size) |
279 | return NULL; |
298 | return NULL; |
280 | 299 | ||
281 | /* Writeable executable areas are not supported. */ |
300 | /* Writeable executable areas are not supported. */ |
282 | if ((flags & AS_AREA_EXEC) && (flags & AS_AREA_WRITE)) |
301 | if ((flags & AS_AREA_EXEC) && (flags & AS_AREA_WRITE)) |
283 | return NULL; |
302 | return NULL; |
284 | 303 | ||
285 | ipl = interrupts_disable(); |
304 | ipl = interrupts_disable(); |
286 | mutex_lock(&as->lock); |
305 | mutex_lock(&as->lock); |
287 | 306 | ||
288 | if (!check_area_conflicts(as, base, size, NULL)) { |
307 | if (!check_area_conflicts(as, base, size, NULL)) { |
289 | mutex_unlock(&as->lock); |
308 | mutex_unlock(&as->lock); |
290 | interrupts_restore(ipl); |
309 | interrupts_restore(ipl); |
291 | return NULL; |
310 | return NULL; |
292 | } |
311 | } |
293 | 312 | ||
294 | a = (as_area_t *) malloc(sizeof(as_area_t), 0); |
313 | a = (as_area_t *) malloc(sizeof(as_area_t), 0); |
295 | 314 | ||
296 | mutex_initialize(&a->lock); |
315 | mutex_initialize(&a->lock); |
297 | 316 | ||
298 | a->as = as; |
317 | a->as = as; |
299 | a->flags = flags; |
318 | a->flags = flags; |
300 | a->attributes = attrs; |
319 | a->attributes = attrs; |
301 | a->pages = SIZE2FRAMES(size); |
320 | a->pages = SIZE2FRAMES(size); |
302 | a->base = base; |
321 | a->base = base; |
303 | a->sh_info = NULL; |
322 | a->sh_info = NULL; |
304 | a->backend = backend; |
323 | a->backend = backend; |
305 | if (backend_data) |
324 | if (backend_data) |
306 | a->backend_data = *backend_data; |
325 | a->backend_data = *backend_data; |
307 | else |
326 | else |
308 | memsetb((uintptr_t) &a->backend_data, sizeof(a->backend_data), |
327 | memsetb((uintptr_t) &a->backend_data, sizeof(a->backend_data), |
309 | 0); |
328 | 0); |
310 | 329 | ||
311 | btree_create(&a->used_space); |
330 | btree_create(&a->used_space); |
312 | 331 | ||
313 | btree_insert(&as->as_area_btree, base, (void *) a, NULL); |
332 | btree_insert(&as->as_area_btree, base, (void *) a, NULL); |
314 | 333 | ||
315 | mutex_unlock(&as->lock); |
334 | mutex_unlock(&as->lock); |
316 | interrupts_restore(ipl); |
335 | interrupts_restore(ipl); |
317 | 336 | ||
318 | return a; |
337 | return a; |
319 | } |
338 | } |
320 | 339 | ||
321 | /** Find address space area and change it. |
340 | /** Find address space area and change it. |
322 | * |
341 | * |
323 | * @param as Address space. |
342 | * @param as Address space. |
324 | * @param address Virtual address belonging to the area to be changed. Must be |
343 | * @param address Virtual address belonging to the area to be changed. Must be |
325 | * page-aligned. |
344 | * page-aligned. |
326 | * @param size New size of the virtual memory block starting at address. |
345 | * @param size New size of the virtual memory block starting at address. |
327 | * @param flags Flags influencing the remap operation. Currently unused. |
346 | * @param flags Flags influencing the remap operation. Currently unused. |
328 | * |
347 | * |
329 | * @return Zero on success or a value from @ref errno.h otherwise. |
348 | * @return Zero on success or a value from @ref errno.h otherwise. |
330 | */ |
349 | */ |
331 | int as_area_resize(as_t *as, uintptr_t address, size_t size, int flags) |
350 | int as_area_resize(as_t *as, uintptr_t address, size_t size, int flags) |
332 | { |
351 | { |
333 | as_area_t *area; |
352 | as_area_t *area; |
334 | ipl_t ipl; |
353 | ipl_t ipl; |
335 | size_t pages; |
354 | size_t pages; |
336 | 355 | ||
337 | ipl = interrupts_disable(); |
356 | ipl = interrupts_disable(); |
338 | mutex_lock(&as->lock); |
357 | mutex_lock(&as->lock); |
339 | 358 | ||
340 | /* |
359 | /* |
341 | * Locate the area. |
360 | * Locate the area. |
342 | */ |
361 | */ |
343 | area = find_area_and_lock(as, address); |
362 | area = find_area_and_lock(as, address); |
344 | if (!area) { |
363 | if (!area) { |
345 | mutex_unlock(&as->lock); |
364 | mutex_unlock(&as->lock); |
346 | interrupts_restore(ipl); |
365 | interrupts_restore(ipl); |
347 | return ENOENT; |
366 | return ENOENT; |
348 | } |
367 | } |
349 | 368 | ||
350 | if (area->backend == &phys_backend) { |
369 | if (area->backend == &phys_backend) { |
351 | /* |
370 | /* |
352 | * Remapping of address space areas associated |
371 | * Remapping of address space areas associated |
353 | * with memory mapped devices is not supported. |
372 | * with memory mapped devices is not supported. |
354 | */ |
373 | */ |
355 | mutex_unlock(&area->lock); |
374 | mutex_unlock(&area->lock); |
356 | mutex_unlock(&as->lock); |
375 | mutex_unlock(&as->lock); |
357 | interrupts_restore(ipl); |
376 | interrupts_restore(ipl); |
358 | return ENOTSUP; |
377 | return ENOTSUP; |
359 | } |
378 | } |
360 | if (area->sh_info) { |
379 | if (area->sh_info) { |
361 | /* |
380 | /* |
362 | * Remapping of shared address space areas |
381 | * Remapping of shared address space areas |
363 | * is not supported. |
382 | * is not supported. |
364 | */ |
383 | */ |
365 | mutex_unlock(&area->lock); |
384 | mutex_unlock(&area->lock); |
366 | mutex_unlock(&as->lock); |
385 | mutex_unlock(&as->lock); |
367 | interrupts_restore(ipl); |
386 | interrupts_restore(ipl); |
368 | return ENOTSUP; |
387 | return ENOTSUP; |
369 | } |
388 | } |
370 | 389 | ||
371 | pages = SIZE2FRAMES((address - area->base) + size); |
390 | pages = SIZE2FRAMES((address - area->base) + size); |
372 | if (!pages) { |
391 | if (!pages) { |
373 | /* |
392 | /* |
374 | * Zero size address space areas are not allowed. |
393 | * Zero size address space areas are not allowed. |
375 | */ |
394 | */ |
376 | mutex_unlock(&area->lock); |
395 | mutex_unlock(&area->lock); |
377 | mutex_unlock(&as->lock); |
396 | mutex_unlock(&as->lock); |
378 | interrupts_restore(ipl); |
397 | interrupts_restore(ipl); |
379 | return EPERM; |
398 | return EPERM; |
380 | } |
399 | } |
381 | 400 | ||
382 | if (pages < area->pages) { |
401 | if (pages < area->pages) { |
383 | bool cond; |
402 | bool cond; |
384 | uintptr_t start_free = area->base + pages*PAGE_SIZE; |
403 | uintptr_t start_free = area->base + pages*PAGE_SIZE; |
385 | 404 | ||
386 | /* |
405 | /* |
387 | * Shrinking the area. |
406 | * Shrinking the area. |
388 | * No need to check for overlaps. |
407 | * No need to check for overlaps. |
389 | */ |
408 | */ |
390 | 409 | ||
391 | /* |
410 | /* |
392 | * Start TLB shootdown sequence. |
411 | * Start TLB shootdown sequence. |
393 | */ |
412 | */ |
394 | tlb_shootdown_start(TLB_INVL_PAGES, AS->asid, area->base + |
413 | tlb_shootdown_start(TLB_INVL_PAGES, AS->asid, area->base + |
395 | pages * PAGE_SIZE, area->pages - pages); |
414 | pages * PAGE_SIZE, area->pages - pages); |
396 | 415 | ||
397 | /* |
416 | /* |
398 | * Remove frames belonging to used space starting from |
417 | * Remove frames belonging to used space starting from |
399 | * the highest addresses downwards until an overlap with |
418 | * the highest addresses downwards until an overlap with |
400 | * the resized address space area is found. Note that this |
419 | * the resized address space area is found. Note that this |
401 | * is also the right way to remove part of the used_space |
420 | * is also the right way to remove part of the used_space |
402 | * B+tree leaf list. |
421 | * B+tree leaf list. |
403 | */ |
422 | */ |
404 | for (cond = true; cond;) { |
423 | for (cond = true; cond;) { |
405 | btree_node_t *node; |
424 | btree_node_t *node; |
406 | 425 | ||
407 | ASSERT(!list_empty(&area->used_space.leaf_head)); |
426 | ASSERT(!list_empty(&area->used_space.leaf_head)); |
408 | node = |
427 | node = |
409 | list_get_instance(area->used_space.leaf_head.prev, |
428 | list_get_instance(area->used_space.leaf_head.prev, |
410 | btree_node_t, leaf_link); |
429 | btree_node_t, leaf_link); |
411 | if ((cond = (bool) node->keys)) { |
430 | if ((cond = (bool) node->keys)) { |
412 | uintptr_t b = node->key[node->keys - 1]; |
431 | uintptr_t b = node->key[node->keys - 1]; |
413 | count_t c = |
432 | count_t c = |
414 | (count_t) node->value[node->keys - 1]; |
433 | (count_t) node->value[node->keys - 1]; |
415 | int i = 0; |
434 | int i = 0; |
416 | 435 | ||
417 | if (overlaps(b, c * PAGE_SIZE, area->base, |
436 | if (overlaps(b, c * PAGE_SIZE, area->base, |
418 | pages * PAGE_SIZE)) { |
437 | pages * PAGE_SIZE)) { |
419 | 438 | ||
420 | if (b + c * PAGE_SIZE <= start_free) { |
439 | if (b + c * PAGE_SIZE <= start_free) { |
421 | /* |
440 | /* |
422 | * The whole interval fits |
441 | * The whole interval fits |
423 | * completely in the resized |
442 | * completely in the resized |
424 | * address space area. |
443 | * address space area. |
425 | */ |
444 | */ |
426 | break; |
445 | break; |
427 | } |
446 | } |
428 | 447 | ||
429 | /* |
448 | /* |
430 | * Part of the interval corresponding |
449 | * Part of the interval corresponding |
431 | * to b and c overlaps with the resized |
450 | * to b and c overlaps with the resized |
432 | * address space area. |
451 | * address space area. |
433 | */ |
452 | */ |
434 | 453 | ||
435 | cond = false; /* we are almost done */ |
454 | cond = false; /* we are almost done */ |
436 | i = (start_free - b) >> PAGE_WIDTH; |
455 | i = (start_free - b) >> PAGE_WIDTH; |
437 | if (!used_space_remove(area, start_free, |
456 | if (!used_space_remove(area, start_free, |
438 | c - i)) |
457 | c - i)) |
439 | panic("Could not remove used " |
458 | panic("Could not remove used " |
440 | "space.\n"); |
459 | "space.\n"); |
441 | } else { |
460 | } else { |
442 | /* |
461 | /* |
443 | * The interval of used space can be |
462 | * The interval of used space can be |
444 | * completely removed. |
463 | * completely removed. |
445 | */ |
464 | */ |
446 | if (!used_space_remove(area, b, c)) |
465 | if (!used_space_remove(area, b, c)) |
447 | panic("Could not remove used " |
466 | panic("Could not remove used " |
448 | "space.\n"); |
467 | "space.\n"); |
449 | } |
468 | } |
450 | 469 | ||
451 | for (; i < c; i++) { |
470 | for (; i < c; i++) { |
452 | pte_t *pte; |
471 | pte_t *pte; |
453 | 472 | ||
454 | page_table_lock(as, false); |
473 | page_table_lock(as, false); |
455 | pte = page_mapping_find(as, b + |
474 | pte = page_mapping_find(as, b + |
456 | i * PAGE_SIZE); |
475 | i * PAGE_SIZE); |
457 | ASSERT(pte && PTE_VALID(pte) && |
476 | ASSERT(pte && PTE_VALID(pte) && |
458 | PTE_PRESENT(pte)); |
477 | PTE_PRESENT(pte)); |
459 | if (area->backend && |
478 | if (area->backend && |
460 | area->backend->frame_free) { |
479 | area->backend->frame_free) { |
461 | area->backend->frame_free(area, |
480 | area->backend->frame_free(area, |
462 | b + i * PAGE_SIZE, |
481 | b + i * PAGE_SIZE, |
463 | PTE_GET_FRAME(pte)); |
482 | PTE_GET_FRAME(pte)); |
464 | } |
483 | } |
465 | page_mapping_remove(as, b + |
484 | page_mapping_remove(as, b + |
466 | i * PAGE_SIZE); |
485 | i * PAGE_SIZE); |
467 | page_table_unlock(as, false); |
486 | page_table_unlock(as, false); |
468 | } |
487 | } |
469 | } |
488 | } |
470 | } |
489 | } |
471 | 490 | ||
472 | /* |
491 | /* |
473 | * Finish TLB shootdown sequence. |
492 | * Finish TLB shootdown sequence. |
474 | */ |
493 | */ |
- | 494 | ||
475 | tlb_invalidate_pages(as->asid, area->base + pages * PAGE_SIZE, |
495 | tlb_invalidate_pages(as->asid, area->base + pages * PAGE_SIZE, |
476 | area->pages - pages); |
496 | area->pages - pages); |
477 | tlb_shootdown_finalize(); |
- | |
478 | - | ||
479 | /* |
497 | /* |
480 | * Invalidate software translation caches (e.g. TSB on sparc64). |
498 | * Invalidate software translation caches (e.g. TSB on sparc64). |
481 | */ |
499 | */ |
482 | as_invalidate_translation_cache(as, area->base + |
500 | as_invalidate_translation_cache(as, area->base + |
483 | pages * PAGE_SIZE, area->pages - pages); |
501 | pages * PAGE_SIZE, area->pages - pages); |
- | 502 | tlb_shootdown_finalize(); |
|
- | 503 | ||
484 | } else { |
504 | } else { |
485 | /* |
505 | /* |
486 | * Growing the area. |
506 | * Growing the area. |
487 | * Check for overlaps with other address space areas. |
507 | * Check for overlaps with other address space areas. |
488 | */ |
508 | */ |
489 | if (!check_area_conflicts(as, address, pages * PAGE_SIZE, |
509 | if (!check_area_conflicts(as, address, pages * PAGE_SIZE, |
490 | area)) { |
510 | area)) { |
491 | mutex_unlock(&area->lock); |
511 | mutex_unlock(&area->lock); |
492 | mutex_unlock(&as->lock); |
512 | mutex_unlock(&as->lock); |
493 | interrupts_restore(ipl); |
513 | interrupts_restore(ipl); |
494 | return EADDRNOTAVAIL; |
514 | return EADDRNOTAVAIL; |
495 | } |
515 | } |
496 | } |
516 | } |
497 | 517 | ||
498 | area->pages = pages; |
518 | area->pages = pages; |
499 | 519 | ||
500 | mutex_unlock(&area->lock); |
520 | mutex_unlock(&area->lock); |
501 | mutex_unlock(&as->lock); |
521 | mutex_unlock(&as->lock); |
502 | interrupts_restore(ipl); |
522 | interrupts_restore(ipl); |
503 | 523 | ||
504 | return 0; |
524 | return 0; |
505 | } |
525 | } |
506 | 526 | ||
507 | /** Destroy address space area. |
527 | /** Destroy address space area. |
508 | * |
528 | * |
509 | * @param as Address space. |
529 | * @param as Address space. |
510 | * @param address Address withing the area to be deleted. |
530 | * @param address Address withing the area to be deleted. |
511 | * |
531 | * |
512 | * @return Zero on success or a value from @ref errno.h on failure. |
532 | * @return Zero on success or a value from @ref errno.h on failure. |
513 | */ |
533 | */ |
514 | int as_area_destroy(as_t *as, uintptr_t address) |
534 | int as_area_destroy(as_t *as, uintptr_t address) |
515 | { |
535 | { |
516 | as_area_t *area; |
536 | as_area_t *area; |
517 | uintptr_t base; |
537 | uintptr_t base; |
518 | link_t *cur; |
538 | link_t *cur; |
519 | ipl_t ipl; |
539 | ipl_t ipl; |
520 | 540 | ||
521 | ipl = interrupts_disable(); |
541 | ipl = interrupts_disable(); |
522 | mutex_lock(&as->lock); |
542 | mutex_lock(&as->lock); |
523 | 543 | ||
524 | area = find_area_and_lock(as, address); |
544 | area = find_area_and_lock(as, address); |
525 | if (!area) { |
545 | if (!area) { |
526 | mutex_unlock(&as->lock); |
546 | mutex_unlock(&as->lock); |
527 | interrupts_restore(ipl); |
547 | interrupts_restore(ipl); |
528 | return ENOENT; |
548 | return ENOENT; |
529 | } |
549 | } |
530 | 550 | ||
531 | base = area->base; |
551 | base = area->base; |
532 | 552 | ||
533 | /* |
553 | /* |
534 | * Start TLB shootdown sequence. |
554 | * Start TLB shootdown sequence. |
535 | */ |
555 | */ |
536 | tlb_shootdown_start(TLB_INVL_PAGES, as->asid, area->base, area->pages); |
556 | tlb_shootdown_start(TLB_INVL_PAGES, as->asid, area->base, area->pages); |
537 | 557 | ||
538 | /* |
558 | /* |
539 | * Visit only the pages mapped by used_space B+tree. |
559 | * Visit only the pages mapped by used_space B+tree. |
540 | */ |
560 | */ |
541 | for (cur = area->used_space.leaf_head.next; |
561 | for (cur = area->used_space.leaf_head.next; |
542 | cur != &area->used_space.leaf_head; cur = cur->next) { |
562 | cur != &area->used_space.leaf_head; cur = cur->next) { |
543 | btree_node_t *node; |
563 | btree_node_t *node; |
544 | int i; |
564 | int i; |
545 | 565 | ||
546 | node = list_get_instance(cur, btree_node_t, leaf_link); |
566 | node = list_get_instance(cur, btree_node_t, leaf_link); |
547 | for (i = 0; i < node->keys; i++) { |
567 | for (i = 0; i < node->keys; i++) { |
548 | uintptr_t b = node->key[i]; |
568 | uintptr_t b = node->key[i]; |
549 | count_t j; |
569 | count_t j; |
550 | pte_t *pte; |
570 | pte_t *pte; |
551 | 571 | ||
552 | for (j = 0; j < (count_t) node->value[i]; j++) { |
572 | for (j = 0; j < (count_t) node->value[i]; j++) { |
553 | page_table_lock(as, false); |
573 | page_table_lock(as, false); |
554 | pte = page_mapping_find(as, b + j * PAGE_SIZE); |
574 | pte = page_mapping_find(as, b + j * PAGE_SIZE); |
555 | ASSERT(pte && PTE_VALID(pte) && |
575 | ASSERT(pte && PTE_VALID(pte) && |
556 | PTE_PRESENT(pte)); |
576 | PTE_PRESENT(pte)); |
557 | if (area->backend && |
577 | if (area->backend && |
558 | area->backend->frame_free) { |
578 | area->backend->frame_free) { |
559 | area->backend->frame_free(area, b + |
579 | area->backend->frame_free(area, b + |
560 | j * PAGE_SIZE, PTE_GET_FRAME(pte)); |
580 | j * PAGE_SIZE, PTE_GET_FRAME(pte)); |
561 | } |
581 | } |
562 | page_mapping_remove(as, b + j * PAGE_SIZE); |
582 | page_mapping_remove(as, b + j * PAGE_SIZE); |
563 | page_table_unlock(as, false); |
583 | page_table_unlock(as, false); |
564 | } |
584 | } |
565 | } |
585 | } |
566 | } |
586 | } |
567 | 587 | ||
568 | /* |
588 | /* |
569 | * Finish TLB shootdown sequence. |
589 | * Finish TLB shootdown sequence. |
570 | */ |
590 | */ |
571 | tlb_invalidate_pages(as->asid, area->base, area->pages); |
- | |
572 | tlb_shootdown_finalize(); |
- | |
573 | 591 | ||
- | 592 | tlb_invalidate_pages(as->asid, area->base, area->pages); |
|
574 | /* |
593 | /* |
575 | * Invalidate potential software translation caches (e.g. TSB on |
594 | * Invalidate potential software translation caches (e.g. TSB on |
576 | * sparc64). |
595 | * sparc64). |
577 | */ |
596 | */ |
578 | as_invalidate_translation_cache(as, area->base, area->pages); |
597 | as_invalidate_translation_cache(as, area->base, area->pages); |
- | 598 | tlb_shootdown_finalize(); |
|
579 | 599 | ||
580 | btree_destroy(&area->used_space); |
600 | btree_destroy(&area->used_space); |
581 | 601 | ||
582 | area->attributes |= AS_AREA_ATTR_PARTIAL; |
602 | area->attributes |= AS_AREA_ATTR_PARTIAL; |
583 | 603 | ||
584 | if (area->sh_info) |
604 | if (area->sh_info) |
585 | sh_info_remove_reference(area->sh_info); |
605 | sh_info_remove_reference(area->sh_info); |
586 | 606 | ||
587 | mutex_unlock(&area->lock); |
607 | mutex_unlock(&area->lock); |
588 | 608 | ||
589 | /* |
609 | /* |
590 | * Remove the empty area from address space. |
610 | * Remove the empty area from address space. |
591 | */ |
611 | */ |
592 | btree_remove(&as->as_area_btree, base, NULL); |
612 | btree_remove(&as->as_area_btree, base, NULL); |
593 | 613 | ||
594 | free(area); |
614 | free(area); |
595 | 615 | ||
596 | mutex_unlock(&as->lock); |
616 | mutex_unlock(&as->lock); |
597 | interrupts_restore(ipl); |
617 | interrupts_restore(ipl); |
598 | return 0; |
618 | return 0; |
599 | } |
619 | } |
600 | 620 | ||
601 | /** Share address space area with another or the same address space. |
621 | /** Share address space area with another or the same address space. |
602 | * |
622 | * |
603 | * Address space area mapping is shared with a new address space area. |
623 | * Address space area mapping is shared with a new address space area. |
604 | * If the source address space area has not been shared so far, |
624 | * If the source address space area has not been shared so far, |
605 | * a new sh_info is created. The new address space area simply gets the |
625 | * a new sh_info is created. The new address space area simply gets the |
606 | * sh_info of the source area. The process of duplicating the |
626 | * sh_info of the source area. The process of duplicating the |
607 | * mapping is done through the backend share function. |
627 | * mapping is done through the backend share function. |
608 | * |
628 | * |
609 | * @param src_as Pointer to source address space. |
629 | * @param src_as Pointer to source address space. |
610 | * @param src_base Base address of the source address space area. |
630 | * @param src_base Base address of the source address space area. |
611 | * @param acc_size Expected size of the source area. |
631 | * @param acc_size Expected size of the source area. |
612 | * @param dst_as Pointer to destination address space. |
632 | * @param dst_as Pointer to destination address space. |
613 | * @param dst_base Target base address. |
633 | * @param dst_base Target base address. |
614 | * @param dst_flags_mask Destination address space area flags mask. |
634 | * @param dst_flags_mask Destination address space area flags mask. |
615 | * |
635 | * |
616 | * @return Zero on success or ENOENT if there is no such task or if there is no |
636 | * @return Zero on success or ENOENT if there is no such task or if there is no |
617 | * such address space area, EPERM if there was a problem in accepting the area |
637 | * such address space area, EPERM if there was a problem in accepting the area |
618 | * or ENOMEM if there was a problem in allocating destination address space |
638 | * or ENOMEM if there was a problem in allocating destination address space |
619 | * area. ENOTSUP is returned if the address space area backend does not support |
639 | * area. ENOTSUP is returned if the address space area backend does not support |
620 | * sharing. |
640 | * sharing. |
621 | */ |
641 | */ |
622 | int as_area_share(as_t *src_as, uintptr_t src_base, size_t acc_size, |
642 | int as_area_share(as_t *src_as, uintptr_t src_base, size_t acc_size, |
623 | as_t *dst_as, uintptr_t dst_base, int dst_flags_mask) |
643 | as_t *dst_as, uintptr_t dst_base, int dst_flags_mask) |
624 | { |
644 | { |
625 | ipl_t ipl; |
645 | ipl_t ipl; |
626 | int src_flags; |
646 | int src_flags; |
627 | size_t src_size; |
647 | size_t src_size; |
628 | as_area_t *src_area, *dst_area; |
648 | as_area_t *src_area, *dst_area; |
629 | share_info_t *sh_info; |
649 | share_info_t *sh_info; |
630 | mem_backend_t *src_backend; |
650 | mem_backend_t *src_backend; |
631 | mem_backend_data_t src_backend_data; |
651 | mem_backend_data_t src_backend_data; |
632 | 652 | ||
633 | ipl = interrupts_disable(); |
653 | ipl = interrupts_disable(); |
634 | mutex_lock(&src_as->lock); |
654 | mutex_lock(&src_as->lock); |
635 | src_area = find_area_and_lock(src_as, src_base); |
655 | src_area = find_area_and_lock(src_as, src_base); |
636 | if (!src_area) { |
656 | if (!src_area) { |
637 | /* |
657 | /* |
638 | * Could not find the source address space area. |
658 | * Could not find the source address space area. |
639 | */ |
659 | */ |
640 | mutex_unlock(&src_as->lock); |
660 | mutex_unlock(&src_as->lock); |
641 | interrupts_restore(ipl); |
661 | interrupts_restore(ipl); |
642 | return ENOENT; |
662 | return ENOENT; |
643 | } |
663 | } |
644 | 664 | ||
645 | if (!src_area->backend || !src_area->backend->share) { |
665 | if (!src_area->backend || !src_area->backend->share) { |
646 | /* |
666 | /* |
647 | * There is no backend or the backend does not |
667 | * There is no backend or the backend does not |
648 | * know how to share the area. |
668 | * know how to share the area. |
649 | */ |
669 | */ |
650 | mutex_unlock(&src_area->lock); |
670 | mutex_unlock(&src_area->lock); |
651 | mutex_unlock(&src_as->lock); |
671 | mutex_unlock(&src_as->lock); |
652 | interrupts_restore(ipl); |
672 | interrupts_restore(ipl); |
653 | return ENOTSUP; |
673 | return ENOTSUP; |
654 | } |
674 | } |
655 | 675 | ||
656 | src_size = src_area->pages * PAGE_SIZE; |
676 | src_size = src_area->pages * PAGE_SIZE; |
657 | src_flags = src_area->flags; |
677 | src_flags = src_area->flags; |
658 | src_backend = src_area->backend; |
678 | src_backend = src_area->backend; |
659 | src_backend_data = src_area->backend_data; |
679 | src_backend_data = src_area->backend_data; |
660 | 680 | ||
661 | /* Share the cacheable flag from the original mapping */ |
681 | /* Share the cacheable flag from the original mapping */ |
662 | if (src_flags & AS_AREA_CACHEABLE) |
682 | if (src_flags & AS_AREA_CACHEABLE) |
663 | dst_flags_mask |= AS_AREA_CACHEABLE; |
683 | dst_flags_mask |= AS_AREA_CACHEABLE; |
664 | 684 | ||
665 | if (src_size != acc_size || |
685 | if (src_size != acc_size || |
666 | (src_flags & dst_flags_mask) != dst_flags_mask) { |
686 | (src_flags & dst_flags_mask) != dst_flags_mask) { |
667 | mutex_unlock(&src_area->lock); |
687 | mutex_unlock(&src_area->lock); |
668 | mutex_unlock(&src_as->lock); |
688 | mutex_unlock(&src_as->lock); |
669 | interrupts_restore(ipl); |
689 | interrupts_restore(ipl); |
670 | return EPERM; |
690 | return EPERM; |
671 | } |
691 | } |
672 | 692 | ||
673 | /* |
693 | /* |
674 | * Now we are committed to sharing the area. |
694 | * Now we are committed to sharing the area. |
675 | * First, prepare the area for sharing. |
695 | * First, prepare the area for sharing. |
676 | * Then it will be safe to unlock it. |
696 | * Then it will be safe to unlock it. |
677 | */ |
697 | */ |
678 | sh_info = src_area->sh_info; |
698 | sh_info = src_area->sh_info; |
679 | if (!sh_info) { |
699 | if (!sh_info) { |
680 | sh_info = (share_info_t *) malloc(sizeof(share_info_t), 0); |
700 | sh_info = (share_info_t *) malloc(sizeof(share_info_t), 0); |
681 | mutex_initialize(&sh_info->lock); |
701 | mutex_initialize(&sh_info->lock); |
682 | sh_info->refcount = 2; |
702 | sh_info->refcount = 2; |
683 | btree_create(&sh_info->pagemap); |
703 | btree_create(&sh_info->pagemap); |
684 | src_area->sh_info = sh_info; |
704 | src_area->sh_info = sh_info; |
685 | } else { |
705 | } else { |
686 | mutex_lock(&sh_info->lock); |
706 | mutex_lock(&sh_info->lock); |
687 | sh_info->refcount++; |
707 | sh_info->refcount++; |
688 | mutex_unlock(&sh_info->lock); |
708 | mutex_unlock(&sh_info->lock); |
689 | } |
709 | } |
690 | 710 | ||
691 | src_area->backend->share(src_area); |
711 | src_area->backend->share(src_area); |
692 | 712 | ||
693 | mutex_unlock(&src_area->lock); |
713 | mutex_unlock(&src_area->lock); |
694 | mutex_unlock(&src_as->lock); |
714 | mutex_unlock(&src_as->lock); |
695 | 715 | ||
696 | /* |
716 | /* |
697 | * Create copy of the source address space area. |
717 | * Create copy of the source address space area. |
698 | * The destination area is created with AS_AREA_ATTR_PARTIAL |
718 | * The destination area is created with AS_AREA_ATTR_PARTIAL |
699 | * attribute set which prevents race condition with |
719 | * attribute set which prevents race condition with |
700 | * preliminary as_page_fault() calls. |
720 | * preliminary as_page_fault() calls. |
701 | * The flags of the source area are masked against dst_flags_mask |
721 | * The flags of the source area are masked against dst_flags_mask |
702 | * to support sharing in less privileged mode. |
722 | * to support sharing in less privileged mode. |
703 | */ |
723 | */ |
704 | dst_area = as_area_create(dst_as, dst_flags_mask, src_size, dst_base, |
724 | dst_area = as_area_create(dst_as, dst_flags_mask, src_size, dst_base, |
705 | AS_AREA_ATTR_PARTIAL, src_backend, &src_backend_data); |
725 | AS_AREA_ATTR_PARTIAL, src_backend, &src_backend_data); |
706 | if (!dst_area) { |
726 | if (!dst_area) { |
707 | /* |
727 | /* |
708 | * Destination address space area could not be created. |
728 | * Destination address space area could not be created. |
709 | */ |
729 | */ |
710 | sh_info_remove_reference(sh_info); |
730 | sh_info_remove_reference(sh_info); |
711 | 731 | ||
712 | interrupts_restore(ipl); |
732 | interrupts_restore(ipl); |
713 | return ENOMEM; |
733 | return ENOMEM; |
714 | } |
734 | } |
715 | 735 | ||
716 | /* |
736 | /* |
717 | * Now the destination address space area has been |
737 | * Now the destination address space area has been |
718 | * fully initialized. Clear the AS_AREA_ATTR_PARTIAL |
738 | * fully initialized. Clear the AS_AREA_ATTR_PARTIAL |
719 | * attribute and set the sh_info. |
739 | * attribute and set the sh_info. |
720 | */ |
740 | */ |
721 | mutex_lock(&dst_as->lock); |
741 | mutex_lock(&dst_as->lock); |
722 | mutex_lock(&dst_area->lock); |
742 | mutex_lock(&dst_area->lock); |
723 | dst_area->attributes &= ~AS_AREA_ATTR_PARTIAL; |
743 | dst_area->attributes &= ~AS_AREA_ATTR_PARTIAL; |
724 | dst_area->sh_info = sh_info; |
744 | dst_area->sh_info = sh_info; |
725 | mutex_unlock(&dst_area->lock); |
745 | mutex_unlock(&dst_area->lock); |
726 | mutex_unlock(&dst_as->lock); |
746 | mutex_unlock(&dst_as->lock); |
727 | 747 | ||
728 | interrupts_restore(ipl); |
748 | interrupts_restore(ipl); |
729 | 749 | ||
730 | return 0; |
750 | return 0; |
731 | } |
751 | } |
732 | 752 | ||
733 | /** Check access mode for address space area. |
753 | /** Check access mode for address space area. |
734 | * |
754 | * |
735 | * The address space area must be locked prior to this call. |
755 | * The address space area must be locked prior to this call. |
736 | * |
756 | * |
737 | * @param area Address space area. |
757 | * @param area Address space area. |
738 | * @param access Access mode. |
758 | * @param access Access mode. |
739 | * |
759 | * |
740 | * @return False if access violates area's permissions, true otherwise. |
760 | * @return False if access violates area's permissions, true otherwise. |
741 | */ |
761 | */ |
742 | bool as_area_check_access(as_area_t *area, pf_access_t access) |
762 | bool as_area_check_access(as_area_t *area, pf_access_t access) |
743 | { |
763 | { |
744 | int flagmap[] = { |
764 | int flagmap[] = { |
745 | [PF_ACCESS_READ] = AS_AREA_READ, |
765 | [PF_ACCESS_READ] = AS_AREA_READ, |
746 | [PF_ACCESS_WRITE] = AS_AREA_WRITE, |
766 | [PF_ACCESS_WRITE] = AS_AREA_WRITE, |
747 | [PF_ACCESS_EXEC] = AS_AREA_EXEC |
767 | [PF_ACCESS_EXEC] = AS_AREA_EXEC |
748 | }; |
768 | }; |
749 | 769 | ||
750 | if (!(area->flags & flagmap[access])) |
770 | if (!(area->flags & flagmap[access])) |
751 | return false; |
771 | return false; |
752 | 772 | ||
753 | return true; |
773 | return true; |
754 | } |
774 | } |
755 | 775 | ||
756 | /** Handle page fault within the current address space. |
776 | /** Handle page fault within the current address space. |
757 | * |
777 | * |
758 | * This is the high-level page fault handler. It decides |
778 | * This is the high-level page fault handler. It decides |
759 | * whether the page fault can be resolved by any backend |
779 | * whether the page fault can be resolved by any backend |
760 | * and if so, it invokes the backend to resolve the page |
780 | * and if so, it invokes the backend to resolve the page |
761 | * fault. |
781 | * fault. |
762 | * |
782 | * |
763 | * Interrupts are assumed disabled. |
783 | * Interrupts are assumed disabled. |
764 | * |
784 | * |
765 | * @param page Faulting page. |
785 | * @param page Faulting page. |
766 | * @param access Access mode that caused the fault (i.e. read/write/exec). |
786 | * @param access Access mode that caused the fault (i.e. read/write/exec). |
767 | * @param istate Pointer to interrupted state. |
787 | * @param istate Pointer to interrupted state. |
768 | * |
788 | * |
769 | * @return AS_PF_FAULT on page fault, AS_PF_OK on success or AS_PF_DEFER if the |
789 | * @return AS_PF_FAULT on page fault, AS_PF_OK on success or AS_PF_DEFER if the |
770 | * fault was caused by copy_to_uspace() or copy_from_uspace(). |
790 | * fault was caused by copy_to_uspace() or copy_from_uspace(). |
771 | */ |
791 | */ |
772 | int as_page_fault(uintptr_t page, pf_access_t access, istate_t *istate) |
792 | int as_page_fault(uintptr_t page, pf_access_t access, istate_t *istate) |
773 | { |
793 | { |
774 | pte_t *pte; |
794 | pte_t *pte; |
775 | as_area_t *area; |
795 | as_area_t *area; |
776 | 796 | ||
777 | if (!THREAD) |
797 | if (!THREAD) |
778 | return AS_PF_FAULT; |
798 | return AS_PF_FAULT; |
779 | 799 | ||
780 | ASSERT(AS); |
800 | ASSERT(AS); |
781 | 801 | ||
782 | mutex_lock(&AS->lock); |
802 | mutex_lock(&AS->lock); |
783 | area = find_area_and_lock(AS, page); |
803 | area = find_area_and_lock(AS, page); |
784 | if (!area) { |
804 | if (!area) { |
785 | /* |
805 | /* |
786 | * No area contained mapping for 'page'. |
806 | * No area contained mapping for 'page'. |
787 | * Signal page fault to low-level handler. |
807 | * Signal page fault to low-level handler. |
788 | */ |
808 | */ |
789 | mutex_unlock(&AS->lock); |
809 | mutex_unlock(&AS->lock); |
790 | goto page_fault; |
810 | goto page_fault; |
791 | } |
811 | } |
792 | 812 | ||
793 | if (area->attributes & AS_AREA_ATTR_PARTIAL) { |
813 | if (area->attributes & AS_AREA_ATTR_PARTIAL) { |
794 | /* |
814 | /* |
795 | * The address space area is not fully initialized. |
815 | * The address space area is not fully initialized. |
796 | * Avoid possible race by returning error. |
816 | * Avoid possible race by returning error. |
797 | */ |
817 | */ |
798 | mutex_unlock(&area->lock); |
818 | mutex_unlock(&area->lock); |
799 | mutex_unlock(&AS->lock); |
819 | mutex_unlock(&AS->lock); |
800 | goto page_fault; |
820 | goto page_fault; |
801 | } |
821 | } |
802 | 822 | ||
803 | if (!area->backend || !area->backend->page_fault) { |
823 | if (!area->backend || !area->backend->page_fault) { |
804 | /* |
824 | /* |
805 | * The address space area is not backed by any backend |
825 | * The address space area is not backed by any backend |
806 | * or the backend cannot handle page faults. |
826 | * or the backend cannot handle page faults. |
807 | */ |
827 | */ |
808 | mutex_unlock(&area->lock); |
828 | mutex_unlock(&area->lock); |
809 | mutex_unlock(&AS->lock); |
829 | mutex_unlock(&AS->lock); |
810 | goto page_fault; |
830 | goto page_fault; |
811 | } |
831 | } |
812 | 832 | ||
813 | page_table_lock(AS, false); |
833 | page_table_lock(AS, false); |
814 | 834 | ||
815 | /* |
835 | /* |
816 | * To avoid race condition between two page faults |
836 | * To avoid race condition between two page faults |
817 | * on the same address, we need to make sure |
837 | * on the same address, we need to make sure |
818 | * the mapping has not been already inserted. |
838 | * the mapping has not been already inserted. |
819 | */ |
839 | */ |
820 | if ((pte = page_mapping_find(AS, page))) { |
840 | if ((pte = page_mapping_find(AS, page))) { |
821 | if (PTE_PRESENT(pte)) { |
841 | if (PTE_PRESENT(pte)) { |
822 | if (((access == PF_ACCESS_READ) && PTE_READABLE(pte)) || |
842 | if (((access == PF_ACCESS_READ) && PTE_READABLE(pte)) || |
823 | (access == PF_ACCESS_WRITE && PTE_WRITABLE(pte)) || |
843 | (access == PF_ACCESS_WRITE && PTE_WRITABLE(pte)) || |
824 | (access == PF_ACCESS_EXEC && PTE_EXECUTABLE(pte))) { |
844 | (access == PF_ACCESS_EXEC && PTE_EXECUTABLE(pte))) { |
825 | page_table_unlock(AS, false); |
845 | page_table_unlock(AS, false); |
826 | mutex_unlock(&area->lock); |
846 | mutex_unlock(&area->lock); |
827 | mutex_unlock(&AS->lock); |
847 | mutex_unlock(&AS->lock); |
828 | return AS_PF_OK; |
848 | return AS_PF_OK; |
829 | } |
849 | } |
830 | } |
850 | } |
831 | } |
851 | } |
832 | 852 | ||
833 | /* |
853 | /* |
834 | * Resort to the backend page fault handler. |
854 | * Resort to the backend page fault handler. |
835 | */ |
855 | */ |
836 | if (area->backend->page_fault(area, page, access) != AS_PF_OK) { |
856 | if (area->backend->page_fault(area, page, access) != AS_PF_OK) { |
837 | page_table_unlock(AS, false); |
857 | page_table_unlock(AS, false); |
838 | mutex_unlock(&area->lock); |
858 | mutex_unlock(&area->lock); |
839 | mutex_unlock(&AS->lock); |
859 | mutex_unlock(&AS->lock); |
840 | goto page_fault; |
860 | goto page_fault; |
841 | } |
861 | } |
842 | 862 | ||
843 | page_table_unlock(AS, false); |
863 | page_table_unlock(AS, false); |
844 | mutex_unlock(&area->lock); |
864 | mutex_unlock(&area->lock); |
845 | mutex_unlock(&AS->lock); |
865 | mutex_unlock(&AS->lock); |
846 | return AS_PF_OK; |
866 | return AS_PF_OK; |
847 | 867 | ||
848 | page_fault: |
868 | page_fault: |
849 | if (THREAD->in_copy_from_uspace) { |
869 | if (THREAD->in_copy_from_uspace) { |
850 | THREAD->in_copy_from_uspace = false; |
870 | THREAD->in_copy_from_uspace = false; |
851 | istate_set_retaddr(istate, |
871 | istate_set_retaddr(istate, |
852 | (uintptr_t) &memcpy_from_uspace_failover_address); |
872 | (uintptr_t) &memcpy_from_uspace_failover_address); |
853 | } else if (THREAD->in_copy_to_uspace) { |
873 | } else if (THREAD->in_copy_to_uspace) { |
854 | THREAD->in_copy_to_uspace = false; |
874 | THREAD->in_copy_to_uspace = false; |
855 | istate_set_retaddr(istate, |
875 | istate_set_retaddr(istate, |
856 | (uintptr_t) &memcpy_to_uspace_failover_address); |
876 | (uintptr_t) &memcpy_to_uspace_failover_address); |
857 | } else { |
877 | } else { |
858 | return AS_PF_FAULT; |
878 | return AS_PF_FAULT; |
859 | } |
879 | } |
860 | 880 | ||
861 | return AS_PF_DEFER; |
881 | return AS_PF_DEFER; |
862 | } |
882 | } |
863 | 883 | ||
864 | /** Switch address spaces. |
884 | /** Switch address spaces. |
865 | * |
885 | * |
866 | * Note that this function cannot sleep as it is essentially a part of |
886 | * Note that this function cannot sleep as it is essentially a part of |
867 | * scheduling. Sleeping here would lead to deadlock on wakeup. Another |
887 | * scheduling. Sleeping here would lead to deadlock on wakeup. Another |
868 | * thing which is forbidden in this context is locking the address space. |
888 | * thing which is forbidden in this context is locking the address space. |
869 | * |
889 | * |
- | 890 | * When this function is enetered, no spinlocks may be held. |
|
- | 891 | * |
|
870 | * @param old Old address space or NULL. |
892 | * @param old Old address space or NULL. |
871 | * @param new New address space. |
893 | * @param new New address space. |
872 | */ |
894 | */ |
873 | void as_switch(as_t *old_as, as_t *new_as) |
895 | void as_switch(as_t *old_as, as_t *new_as) |
874 | { |
896 | { |
- | 897 | DEADLOCK_PROBE_INIT(p_asidlock); |
|
- | 898 | preemption_disable(); |
|
- | 899 | retry: |
|
- | 900 | (void) interrupts_disable(); |
|
875 | spinlock_lock(&asidlock); |
901 | if (!spinlock_trylock(&asidlock)) { |
- | 902 | /* |
|
- | 903 | * Avoid deadlock with TLB shootdown. |
|
- | 904 | * We can enable interrupts here because |
|
- | 905 | * preemption is disabled. We should not be |
|
- | 906 | * holding any other lock. |
|
- | 907 | */ |
|
- | 908 | (void) interrupts_enable(); |
|
- | 909 | DEADLOCK_PROBE(p_asidlock, DEADLOCK_THRESHOLD); |
|
- | 910 | goto retry; |
|
- | 911 | } |
|
- | 912 | preemption_enable(); |
|
876 | 913 | ||
877 | /* |
914 | /* |
878 | * First, take care of the old address space. |
915 | * First, take care of the old address space. |
879 | */ |
916 | */ |
880 | if (old_as) { |
917 | if (old_as) { |
881 | ASSERT(old_as->cpu_refcount); |
918 | ASSERT(old_as->cpu_refcount); |
882 | if((--old_as->cpu_refcount == 0) && (old_as != AS_KERNEL)) { |
919 | if((--old_as->cpu_refcount == 0) && (old_as != AS_KERNEL)) { |
883 | /* |
920 | /* |
884 | * The old address space is no longer active on |
921 | * The old address space is no longer active on |
885 | * any processor. It can be appended to the |
922 | * any processor. It can be appended to the |
886 | * list of inactive address spaces with assigned |
923 | * list of inactive address spaces with assigned |
887 | * ASID. |
924 | * ASID. |
888 | */ |
925 | */ |
889 | ASSERT(old_as->asid != ASID_INVALID); |
926 | ASSERT(old_as->asid != ASID_INVALID); |
890 | list_append(&old_as->inactive_as_with_asid_link, |
927 | list_append(&old_as->inactive_as_with_asid_link, |
891 | &inactive_as_with_asid_head); |
928 | &inactive_as_with_asid_head); |
892 | } |
929 | } |
893 | 930 | ||
894 | /* |
931 | /* |
895 | * Perform architecture-specific tasks when the address space |
932 | * Perform architecture-specific tasks when the address space |
896 | * is being removed from the CPU. |
933 | * is being removed from the CPU. |
897 | */ |
934 | */ |
898 | as_deinstall_arch(old_as); |
935 | as_deinstall_arch(old_as); |
899 | } |
936 | } |
900 | 937 | ||
901 | /* |
938 | /* |
902 | * Second, prepare the new address space. |
939 | * Second, prepare the new address space. |
903 | */ |
940 | */ |
904 | if ((new_as->cpu_refcount++ == 0) && (new_as != AS_KERNEL)) { |
941 | if ((new_as->cpu_refcount++ == 0) && (new_as != AS_KERNEL)) { |
905 | if (new_as->asid != ASID_INVALID) |
942 | if (new_as->asid != ASID_INVALID) |
906 | list_remove(&new_as->inactive_as_with_asid_link); |
943 | list_remove(&new_as->inactive_as_with_asid_link); |
907 | else |
944 | else |
908 | new_as->asid = asid_get(); |
945 | new_as->asid = asid_get(); |
909 | } |
946 | } |
910 | #ifdef AS_PAGE_TABLE |
947 | #ifdef AS_PAGE_TABLE |
911 | SET_PTL0_ADDRESS(new_as->genarch.page_table); |
948 | SET_PTL0_ADDRESS(new_as->genarch.page_table); |
912 | #endif |
949 | #endif |
913 | 950 | ||
914 | /* |
951 | /* |
915 | * Perform architecture-specific steps. |
952 | * Perform architecture-specific steps. |
916 | * (e.g. write ASID to hardware register etc.) |
953 | * (e.g. write ASID to hardware register etc.) |
917 | */ |
954 | */ |
918 | as_install_arch(new_as); |
955 | as_install_arch(new_as); |
919 | 956 | ||
920 | spinlock_unlock(&asidlock); |
957 | spinlock_unlock(&asidlock); |
921 | 958 | ||
922 | AS = new_as; |
959 | AS = new_as; |
923 | } |
960 | } |
924 | 961 | ||
925 | /** Convert address space area flags to page flags. |
962 | /** Convert address space area flags to page flags. |
926 | * |
963 | * |
927 | * @param aflags Flags of some address space area. |
964 | * @param aflags Flags of some address space area. |
928 | * |
965 | * |
929 | * @return Flags to be passed to page_mapping_insert(). |
966 | * @return Flags to be passed to page_mapping_insert(). |
930 | */ |
967 | */ |
931 | int area_flags_to_page_flags(int aflags) |
968 | int area_flags_to_page_flags(int aflags) |
932 | { |
969 | { |
933 | int flags; |
970 | int flags; |
934 | 971 | ||
935 | flags = PAGE_USER | PAGE_PRESENT; |
972 | flags = PAGE_USER | PAGE_PRESENT; |
936 | 973 | ||
937 | if (aflags & AS_AREA_READ) |
974 | if (aflags & AS_AREA_READ) |
938 | flags |= PAGE_READ; |
975 | flags |= PAGE_READ; |
939 | 976 | ||
940 | if (aflags & AS_AREA_WRITE) |
977 | if (aflags & AS_AREA_WRITE) |
941 | flags |= PAGE_WRITE; |
978 | flags |= PAGE_WRITE; |
942 | 979 | ||
943 | if (aflags & AS_AREA_EXEC) |
980 | if (aflags & AS_AREA_EXEC) |
944 | flags |= PAGE_EXEC; |
981 | flags |= PAGE_EXEC; |
945 | 982 | ||
946 | if (aflags & AS_AREA_CACHEABLE) |
983 | if (aflags & AS_AREA_CACHEABLE) |
947 | flags |= PAGE_CACHEABLE; |
984 | flags |= PAGE_CACHEABLE; |
948 | 985 | ||
949 | return flags; |
986 | return flags; |
950 | } |
987 | } |
951 | 988 | ||
952 | /** Compute flags for virtual address translation subsytem. |
989 | /** Compute flags for virtual address translation subsytem. |
953 | * |
990 | * |
954 | * The address space area must be locked. |
991 | * The address space area must be locked. |
955 | * Interrupts must be disabled. |
992 | * Interrupts must be disabled. |
956 | * |
993 | * |
957 | * @param a Address space area. |
994 | * @param a Address space area. |
958 | * |
995 | * |
959 | * @return Flags to be used in page_mapping_insert(). |
996 | * @return Flags to be used in page_mapping_insert(). |
960 | */ |
997 | */ |
961 | int as_area_get_flags(as_area_t *a) |
998 | int as_area_get_flags(as_area_t *a) |
962 | { |
999 | { |
963 | return area_flags_to_page_flags(a->flags); |
1000 | return area_flags_to_page_flags(a->flags); |
964 | } |
1001 | } |
965 | 1002 | ||
966 | /** Create page table. |
1003 | /** Create page table. |
967 | * |
1004 | * |
968 | * Depending on architecture, create either address space |
1005 | * Depending on architecture, create either address space |
969 | * private or global page table. |
1006 | * private or global page table. |
970 | * |
1007 | * |
971 | * @param flags Flags saying whether the page table is for kernel address space. |
1008 | * @param flags Flags saying whether the page table is for kernel address space. |
972 | * |
1009 | * |
973 | * @return First entry of the page table. |
1010 | * @return First entry of the page table. |
974 | */ |
1011 | */ |
975 | pte_t *page_table_create(int flags) |
1012 | pte_t *page_table_create(int flags) |
976 | { |
1013 | { |
977 | #ifdef __OBJC__ |
1014 | #ifdef __OBJC__ |
978 | return [as_t page_table_create: flags]; |
1015 | return [as_t page_table_create: flags]; |
979 | #else |
1016 | #else |
980 | ASSERT(as_operations); |
1017 | ASSERT(as_operations); |
981 | ASSERT(as_operations->page_table_create); |
1018 | ASSERT(as_operations->page_table_create); |
982 | 1019 | ||
983 | return as_operations->page_table_create(flags); |
1020 | return as_operations->page_table_create(flags); |
984 | #endif |
1021 | #endif |
985 | } |
1022 | } |
986 | 1023 | ||
987 | /** Destroy page table. |
1024 | /** Destroy page table. |
988 | * |
1025 | * |
989 | * Destroy page table in architecture specific way. |
1026 | * Destroy page table in architecture specific way. |
990 | * |
1027 | * |
991 | * @param page_table Physical address of PTL0. |
1028 | * @param page_table Physical address of PTL0. |
992 | */ |
1029 | */ |
993 | void page_table_destroy(pte_t *page_table) |
1030 | void page_table_destroy(pte_t *page_table) |
994 | { |
1031 | { |
995 | #ifdef __OBJC__ |
1032 | #ifdef __OBJC__ |
996 | return [as_t page_table_destroy: page_table]; |
1033 | return [as_t page_table_destroy: page_table]; |
997 | #else |
1034 | #else |
998 | ASSERT(as_operations); |
1035 | ASSERT(as_operations); |
999 | ASSERT(as_operations->page_table_destroy); |
1036 | ASSERT(as_operations->page_table_destroy); |
1000 | 1037 | ||
1001 | as_operations->page_table_destroy(page_table); |
1038 | as_operations->page_table_destroy(page_table); |
1002 | #endif |
1039 | #endif |
1003 | } |
1040 | } |
1004 | 1041 | ||
1005 | /** Lock page table. |
1042 | /** Lock page table. |
1006 | * |
1043 | * |
1007 | * This function should be called before any page_mapping_insert(), |
1044 | * This function should be called before any page_mapping_insert(), |
1008 | * page_mapping_remove() and page_mapping_find(). |
1045 | * page_mapping_remove() and page_mapping_find(). |
1009 | * |
1046 | * |
1010 | * Locking order is such that address space areas must be locked |
1047 | * Locking order is such that address space areas must be locked |
1011 | * prior to this call. Address space can be locked prior to this |
1048 | * prior to this call. Address space can be locked prior to this |
1012 | * call in which case the lock argument is false. |
1049 | * call in which case the lock argument is false. |
1013 | * |
1050 | * |
1014 | * @param as Address space. |
1051 | * @param as Address space. |
1015 | * @param lock If false, do not attempt to lock as->lock. |
1052 | * @param lock If false, do not attempt to lock as->lock. |
1016 | */ |
1053 | */ |
1017 | void page_table_lock(as_t *as, bool lock) |
1054 | void page_table_lock(as_t *as, bool lock) |
1018 | { |
1055 | { |
1019 | #ifdef __OBJC__ |
1056 | #ifdef __OBJC__ |
1020 | [as page_table_lock: lock]; |
1057 | [as page_table_lock: lock]; |
1021 | #else |
1058 | #else |
1022 | ASSERT(as_operations); |
1059 | ASSERT(as_operations); |
1023 | ASSERT(as_operations->page_table_lock); |
1060 | ASSERT(as_operations->page_table_lock); |
1024 | 1061 | ||
1025 | as_operations->page_table_lock(as, lock); |
1062 | as_operations->page_table_lock(as, lock); |
1026 | #endif |
1063 | #endif |
1027 | } |
1064 | } |
1028 | 1065 | ||
1029 | /** Unlock page table. |
1066 | /** Unlock page table. |
1030 | * |
1067 | * |
1031 | * @param as Address space. |
1068 | * @param as Address space. |
1032 | * @param unlock If false, do not attempt to unlock as->lock. |
1069 | * @param unlock If false, do not attempt to unlock as->lock. |
1033 | */ |
1070 | */ |
1034 | void page_table_unlock(as_t *as, bool unlock) |
1071 | void page_table_unlock(as_t *as, bool unlock) |
1035 | { |
1072 | { |
1036 | #ifdef __OBJC__ |
1073 | #ifdef __OBJC__ |
1037 | [as page_table_unlock: unlock]; |
1074 | [as page_table_unlock: unlock]; |
1038 | #else |
1075 | #else |
1039 | ASSERT(as_operations); |
1076 | ASSERT(as_operations); |
1040 | ASSERT(as_operations->page_table_unlock); |
1077 | ASSERT(as_operations->page_table_unlock); |
1041 | 1078 | ||
1042 | as_operations->page_table_unlock(as, unlock); |
1079 | as_operations->page_table_unlock(as, unlock); |
1043 | #endif |
1080 | #endif |
1044 | } |
1081 | } |
1045 | 1082 | ||
1046 | 1083 | ||
1047 | /** Find address space area and lock it. |
1084 | /** Find address space area and lock it. |
1048 | * |
1085 | * |
1049 | * The address space must be locked and interrupts must be disabled. |
1086 | * The address space must be locked and interrupts must be disabled. |
1050 | * |
1087 | * |
1051 | * @param as Address space. |
1088 | * @param as Address space. |
1052 | * @param va Virtual address. |
1089 | * @param va Virtual address. |
1053 | * |
1090 | * |
1054 | * @return Locked address space area containing va on success or NULL on |
1091 | * @return Locked address space area containing va on success or NULL on |
1055 | * failure. |
1092 | * failure. |
1056 | */ |
1093 | */ |
1057 | as_area_t *find_area_and_lock(as_t *as, uintptr_t va) |
1094 | as_area_t *find_area_and_lock(as_t *as, uintptr_t va) |
1058 | { |
1095 | { |
1059 | as_area_t *a; |
1096 | as_area_t *a; |
1060 | btree_node_t *leaf, *lnode; |
1097 | btree_node_t *leaf, *lnode; |
1061 | int i; |
1098 | int i; |
1062 | 1099 | ||
1063 | a = (as_area_t *) btree_search(&as->as_area_btree, va, &leaf); |
1100 | a = (as_area_t *) btree_search(&as->as_area_btree, va, &leaf); |
1064 | if (a) { |
1101 | if (a) { |
1065 | /* va is the base address of an address space area */ |
1102 | /* va is the base address of an address space area */ |
1066 | mutex_lock(&a->lock); |
1103 | mutex_lock(&a->lock); |
1067 | return a; |
1104 | return a; |
1068 | } |
1105 | } |
1069 | 1106 | ||
1070 | /* |
1107 | /* |
1071 | * Search the leaf node and the righmost record of its left neighbour |
1108 | * Search the leaf node and the righmost record of its left neighbour |
1072 | * to find out whether this is a miss or va belongs to an address |
1109 | * to find out whether this is a miss or va belongs to an address |
1073 | * space area found there. |
1110 | * space area found there. |
1074 | */ |
1111 | */ |
1075 | 1112 | ||
1076 | /* First, search the leaf node itself. */ |
1113 | /* First, search the leaf node itself. */ |
1077 | for (i = 0; i < leaf->keys; i++) { |
1114 | for (i = 0; i < leaf->keys; i++) { |
1078 | a = (as_area_t *) leaf->value[i]; |
1115 | a = (as_area_t *) leaf->value[i]; |
1079 | mutex_lock(&a->lock); |
1116 | mutex_lock(&a->lock); |
1080 | if ((a->base <= va) && (va < a->base + a->pages * PAGE_SIZE)) { |
1117 | if ((a->base <= va) && (va < a->base + a->pages * PAGE_SIZE)) { |
1081 | return a; |
1118 | return a; |
1082 | } |
1119 | } |
1083 | mutex_unlock(&a->lock); |
1120 | mutex_unlock(&a->lock); |
1084 | } |
1121 | } |
1085 | 1122 | ||
1086 | /* |
1123 | /* |
1087 | * Second, locate the left neighbour and test its last record. |
1124 | * Second, locate the left neighbour and test its last record. |
1088 | * Because of its position in the B+tree, it must have base < va. |
1125 | * Because of its position in the B+tree, it must have base < va. |
1089 | */ |
1126 | */ |
1090 | lnode = btree_leaf_node_left_neighbour(&as->as_area_btree, leaf); |
1127 | lnode = btree_leaf_node_left_neighbour(&as->as_area_btree, leaf); |
1091 | if (lnode) { |
1128 | if (lnode) { |
1092 | a = (as_area_t *) lnode->value[lnode->keys - 1]; |
1129 | a = (as_area_t *) lnode->value[lnode->keys - 1]; |
1093 | mutex_lock(&a->lock); |
1130 | mutex_lock(&a->lock); |
1094 | if (va < a->base + a->pages * PAGE_SIZE) { |
1131 | if (va < a->base + a->pages * PAGE_SIZE) { |
1095 | return a; |
1132 | return a; |
1096 | } |
1133 | } |
1097 | mutex_unlock(&a->lock); |
1134 | mutex_unlock(&a->lock); |
1098 | } |
1135 | } |
1099 | 1136 | ||
1100 | return NULL; |
1137 | return NULL; |
1101 | } |
1138 | } |
1102 | 1139 | ||
1103 | /** Check area conflicts with other areas. |
1140 | /** Check area conflicts with other areas. |
1104 | * |
1141 | * |
1105 | * The address space must be locked and interrupts must be disabled. |
1142 | * The address space must be locked and interrupts must be disabled. |
1106 | * |
1143 | * |
1107 | * @param as Address space. |
1144 | * @param as Address space. |
1108 | * @param va Starting virtual address of the area being tested. |
1145 | * @param va Starting virtual address of the area being tested. |
1109 | * @param size Size of the area being tested. |
1146 | * @param size Size of the area being tested. |
1110 | * @param avoid_area Do not touch this area. |
1147 | * @param avoid_area Do not touch this area. |
1111 | * |
1148 | * |
1112 | * @return True if there is no conflict, false otherwise. |
1149 | * @return True if there is no conflict, false otherwise. |
1113 | */ |
1150 | */ |
1114 | bool check_area_conflicts(as_t *as, uintptr_t va, size_t size, |
1151 | bool check_area_conflicts(as_t *as, uintptr_t va, size_t size, |
1115 | as_area_t *avoid_area) |
1152 | as_area_t *avoid_area) |
1116 | { |
1153 | { |
1117 | as_area_t *a; |
1154 | as_area_t *a; |
1118 | btree_node_t *leaf, *node; |
1155 | btree_node_t *leaf, *node; |
1119 | int i; |
1156 | int i; |
1120 | 1157 | ||
1121 | /* |
1158 | /* |
1122 | * We don't want any area to have conflicts with NULL page. |
1159 | * We don't want any area to have conflicts with NULL page. |
1123 | */ |
1160 | */ |
1124 | if (overlaps(va, size, NULL, PAGE_SIZE)) |
1161 | if (overlaps(va, size, NULL, PAGE_SIZE)) |
1125 | return false; |
1162 | return false; |
1126 | 1163 | ||
1127 | /* |
1164 | /* |
1128 | * The leaf node is found in O(log n), where n is proportional to |
1165 | * The leaf node is found in O(log n), where n is proportional to |
1129 | * the number of address space areas belonging to as. |
1166 | * the number of address space areas belonging to as. |
1130 | * The check for conflicts is then attempted on the rightmost |
1167 | * The check for conflicts is then attempted on the rightmost |
1131 | * record in the left neighbour, the leftmost record in the right |
1168 | * record in the left neighbour, the leftmost record in the right |
1132 | * neighbour and all records in the leaf node itself. |
1169 | * neighbour and all records in the leaf node itself. |
1133 | */ |
1170 | */ |
1134 | 1171 | ||
1135 | if ((a = (as_area_t *) btree_search(&as->as_area_btree, va, &leaf))) { |
1172 | if ((a = (as_area_t *) btree_search(&as->as_area_btree, va, &leaf))) { |
1136 | if (a != avoid_area) |
1173 | if (a != avoid_area) |
1137 | return false; |
1174 | return false; |
1138 | } |
1175 | } |
1139 | 1176 | ||
1140 | /* First, check the two border cases. */ |
1177 | /* First, check the two border cases. */ |
1141 | if ((node = btree_leaf_node_left_neighbour(&as->as_area_btree, leaf))) { |
1178 | if ((node = btree_leaf_node_left_neighbour(&as->as_area_btree, leaf))) { |
1142 | a = (as_area_t *) node->value[node->keys - 1]; |
1179 | a = (as_area_t *) node->value[node->keys - 1]; |
1143 | mutex_lock(&a->lock); |
1180 | mutex_lock(&a->lock); |
1144 | if (overlaps(va, size, a->base, a->pages * PAGE_SIZE)) { |
1181 | if (overlaps(va, size, a->base, a->pages * PAGE_SIZE)) { |
1145 | mutex_unlock(&a->lock); |
1182 | mutex_unlock(&a->lock); |
1146 | return false; |
1183 | return false; |
1147 | } |
1184 | } |
1148 | mutex_unlock(&a->lock); |
1185 | mutex_unlock(&a->lock); |
1149 | } |
1186 | } |
1150 | node = btree_leaf_node_right_neighbour(&as->as_area_btree, leaf); |
1187 | node = btree_leaf_node_right_neighbour(&as->as_area_btree, leaf); |
1151 | if (node) { |
1188 | if (node) { |
1152 | a = (as_area_t *) node->value[0]; |
1189 | a = (as_area_t *) node->value[0]; |
1153 | mutex_lock(&a->lock); |
1190 | mutex_lock(&a->lock); |
1154 | if (overlaps(va, size, a->base, a->pages * PAGE_SIZE)) { |
1191 | if (overlaps(va, size, a->base, a->pages * PAGE_SIZE)) { |
1155 | mutex_unlock(&a->lock); |
1192 | mutex_unlock(&a->lock); |
1156 | return false; |
1193 | return false; |
1157 | } |
1194 | } |
1158 | mutex_unlock(&a->lock); |
1195 | mutex_unlock(&a->lock); |
1159 | } |
1196 | } |
1160 | 1197 | ||
1161 | /* Second, check the leaf node. */ |
1198 | /* Second, check the leaf node. */ |
1162 | for (i = 0; i < leaf->keys; i++) { |
1199 | for (i = 0; i < leaf->keys; i++) { |
1163 | a = (as_area_t *) leaf->value[i]; |
1200 | a = (as_area_t *) leaf->value[i]; |
1164 | 1201 | ||
1165 | if (a == avoid_area) |
1202 | if (a == avoid_area) |
1166 | continue; |
1203 | continue; |
1167 | 1204 | ||
1168 | mutex_lock(&a->lock); |
1205 | mutex_lock(&a->lock); |
1169 | if (overlaps(va, size, a->base, a->pages * PAGE_SIZE)) { |
1206 | if (overlaps(va, size, a->base, a->pages * PAGE_SIZE)) { |
1170 | mutex_unlock(&a->lock); |
1207 | mutex_unlock(&a->lock); |
1171 | return false; |
1208 | return false; |
1172 | } |
1209 | } |
1173 | mutex_unlock(&a->lock); |
1210 | mutex_unlock(&a->lock); |
1174 | } |
1211 | } |
1175 | 1212 | ||
1176 | /* |
1213 | /* |
1177 | * So far, the area does not conflict with other areas. |
1214 | * So far, the area does not conflict with other areas. |
1178 | * Check if it doesn't conflict with kernel address space. |
1215 | * Check if it doesn't conflict with kernel address space. |
1179 | */ |
1216 | */ |
1180 | if (!KERNEL_ADDRESS_SPACE_SHADOWED) { |
1217 | if (!KERNEL_ADDRESS_SPACE_SHADOWED) { |
1181 | return !overlaps(va, size, |
1218 | return !overlaps(va, size, |
1182 | KERNEL_ADDRESS_SPACE_START, |
1219 | KERNEL_ADDRESS_SPACE_START, |
1183 | KERNEL_ADDRESS_SPACE_END - KERNEL_ADDRESS_SPACE_START); |
1220 | KERNEL_ADDRESS_SPACE_END - KERNEL_ADDRESS_SPACE_START); |
1184 | } |
1221 | } |
1185 | 1222 | ||
1186 | return true; |
1223 | return true; |
1187 | } |
1224 | } |
1188 | 1225 | ||
1189 | /** Return size of the address space area with given base. */ |
1226 | /** Return size of the address space area with given base. */ |
1190 | size_t as_get_size(uintptr_t base) |
1227 | size_t as_get_size(uintptr_t base) |
1191 | { |
1228 | { |
1192 | ipl_t ipl; |
1229 | ipl_t ipl; |
1193 | as_area_t *src_area; |
1230 | as_area_t *src_area; |
1194 | size_t size; |
1231 | size_t size; |
1195 | 1232 | ||
1196 | ipl = interrupts_disable(); |
1233 | ipl = interrupts_disable(); |
1197 | src_area = find_area_and_lock(AS, base); |
1234 | src_area = find_area_and_lock(AS, base); |
1198 | if (src_area){ |
1235 | if (src_area){ |
1199 | size = src_area->pages * PAGE_SIZE; |
1236 | size = src_area->pages * PAGE_SIZE; |
1200 | mutex_unlock(&src_area->lock); |
1237 | mutex_unlock(&src_area->lock); |
1201 | } else { |
1238 | } else { |
1202 | size = 0; |
1239 | size = 0; |
1203 | } |
1240 | } |
1204 | interrupts_restore(ipl); |
1241 | interrupts_restore(ipl); |
1205 | return size; |
1242 | return size; |
1206 | } |
1243 | } |
1207 | 1244 | ||
1208 | /** Mark portion of address space area as used. |
1245 | /** Mark portion of address space area as used. |
1209 | * |
1246 | * |
1210 | * The address space area must be already locked. |
1247 | * The address space area must be already locked. |
1211 | * |
1248 | * |
1212 | * @param a Address space area. |
1249 | * @param a Address space area. |
1213 | * @param page First page to be marked. |
1250 | * @param page First page to be marked. |
1214 | * @param count Number of page to be marked. |
1251 | * @param count Number of page to be marked. |
1215 | * |
1252 | * |
1216 | * @return 0 on failure and 1 on success. |
1253 | * @return 0 on failure and 1 on success. |
1217 | */ |
1254 | */ |
1218 | int used_space_insert(as_area_t *a, uintptr_t page, count_t count) |
1255 | int used_space_insert(as_area_t *a, uintptr_t page, count_t count) |
1219 | { |
1256 | { |
1220 | btree_node_t *leaf, *node; |
1257 | btree_node_t *leaf, *node; |
1221 | count_t pages; |
1258 | count_t pages; |
1222 | int i; |
1259 | int i; |
1223 | 1260 | ||
1224 | ASSERT(page == ALIGN_DOWN(page, PAGE_SIZE)); |
1261 | ASSERT(page == ALIGN_DOWN(page, PAGE_SIZE)); |
1225 | ASSERT(count); |
1262 | ASSERT(count); |
1226 | 1263 | ||
1227 | pages = (count_t) btree_search(&a->used_space, page, &leaf); |
1264 | pages = (count_t) btree_search(&a->used_space, page, &leaf); |
1228 | if (pages) { |
1265 | if (pages) { |
1229 | /* |
1266 | /* |
1230 | * We hit the beginning of some used space. |
1267 | * We hit the beginning of some used space. |
1231 | */ |
1268 | */ |
1232 | return 0; |
1269 | return 0; |
1233 | } |
1270 | } |
1234 | 1271 | ||
1235 | if (!leaf->keys) { |
1272 | if (!leaf->keys) { |
1236 | btree_insert(&a->used_space, page, (void *) count, leaf); |
1273 | btree_insert(&a->used_space, page, (void *) count, leaf); |
1237 | return 1; |
1274 | return 1; |
1238 | } |
1275 | } |
1239 | 1276 | ||
1240 | node = btree_leaf_node_left_neighbour(&a->used_space, leaf); |
1277 | node = btree_leaf_node_left_neighbour(&a->used_space, leaf); |
1241 | if (node) { |
1278 | if (node) { |
1242 | uintptr_t left_pg = node->key[node->keys - 1]; |
1279 | uintptr_t left_pg = node->key[node->keys - 1]; |
1243 | uintptr_t right_pg = leaf->key[0]; |
1280 | uintptr_t right_pg = leaf->key[0]; |
1244 | count_t left_cnt = (count_t) node->value[node->keys - 1]; |
1281 | count_t left_cnt = (count_t) node->value[node->keys - 1]; |
1245 | count_t right_cnt = (count_t) leaf->value[0]; |
1282 | count_t right_cnt = (count_t) leaf->value[0]; |
1246 | 1283 | ||
1247 | /* |
1284 | /* |
1248 | * Examine the possibility that the interval fits |
1285 | * Examine the possibility that the interval fits |
1249 | * somewhere between the rightmost interval of |
1286 | * somewhere between the rightmost interval of |
1250 | * the left neigbour and the first interval of the leaf. |
1287 | * the left neigbour and the first interval of the leaf. |
1251 | */ |
1288 | */ |
1252 | 1289 | ||
1253 | if (page >= right_pg) { |
1290 | if (page >= right_pg) { |
1254 | /* Do nothing. */ |
1291 | /* Do nothing. */ |
1255 | } else if (overlaps(page, count * PAGE_SIZE, left_pg, |
1292 | } else if (overlaps(page, count * PAGE_SIZE, left_pg, |
1256 | left_cnt * PAGE_SIZE)) { |
1293 | left_cnt * PAGE_SIZE)) { |
1257 | /* The interval intersects with the left interval. */ |
1294 | /* The interval intersects with the left interval. */ |
1258 | return 0; |
1295 | return 0; |
1259 | } else if (overlaps(page, count * PAGE_SIZE, right_pg, |
1296 | } else if (overlaps(page, count * PAGE_SIZE, right_pg, |
1260 | right_cnt * PAGE_SIZE)) { |
1297 | right_cnt * PAGE_SIZE)) { |
1261 | /* The interval intersects with the right interval. */ |
1298 | /* The interval intersects with the right interval. */ |
1262 | return 0; |
1299 | return 0; |
1263 | } else if ((page == left_pg + left_cnt * PAGE_SIZE) && |
1300 | } else if ((page == left_pg + left_cnt * PAGE_SIZE) && |
1264 | (page + count * PAGE_SIZE == right_pg)) { |
1301 | (page + count * PAGE_SIZE == right_pg)) { |
1265 | /* |
1302 | /* |
1266 | * The interval can be added by merging the two already |
1303 | * The interval can be added by merging the two already |
1267 | * present intervals. |
1304 | * present intervals. |
1268 | */ |
1305 | */ |
1269 | node->value[node->keys - 1] += count + right_cnt; |
1306 | node->value[node->keys - 1] += count + right_cnt; |
1270 | btree_remove(&a->used_space, right_pg, leaf); |
1307 | btree_remove(&a->used_space, right_pg, leaf); |
1271 | return 1; |
1308 | return 1; |
1272 | } else if (page == left_pg + left_cnt * PAGE_SIZE) { |
1309 | } else if (page == left_pg + left_cnt * PAGE_SIZE) { |
1273 | /* |
1310 | /* |
1274 | * The interval can be added by simply growing the left |
1311 | * The interval can be added by simply growing the left |
1275 | * interval. |
1312 | * interval. |
1276 | */ |
1313 | */ |
1277 | node->value[node->keys - 1] += count; |
1314 | node->value[node->keys - 1] += count; |
1278 | return 1; |
1315 | return 1; |
1279 | } else if (page + count * PAGE_SIZE == right_pg) { |
1316 | } else if (page + count * PAGE_SIZE == right_pg) { |
1280 | /* |
1317 | /* |
1281 | * The interval can be addded by simply moving base of |
1318 | * The interval can be addded by simply moving base of |
1282 | * the right interval down and increasing its size |
1319 | * the right interval down and increasing its size |
1283 | * accordingly. |
1320 | * accordingly. |
1284 | */ |
1321 | */ |
1285 | leaf->value[0] += count; |
1322 | leaf->value[0] += count; |
1286 | leaf->key[0] = page; |
1323 | leaf->key[0] = page; |
1287 | return 1; |
1324 | return 1; |
1288 | } else { |
1325 | } else { |
1289 | /* |
1326 | /* |
1290 | * The interval is between both neigbouring intervals, |
1327 | * The interval is between both neigbouring intervals, |
1291 | * but cannot be merged with any of them. |
1328 | * but cannot be merged with any of them. |
1292 | */ |
1329 | */ |
1293 | btree_insert(&a->used_space, page, (void *) count, |
1330 | btree_insert(&a->used_space, page, (void *) count, |
1294 | leaf); |
1331 | leaf); |
1295 | return 1; |
1332 | return 1; |
1296 | } |
1333 | } |
1297 | } else if (page < leaf->key[0]) { |
1334 | } else if (page < leaf->key[0]) { |
1298 | uintptr_t right_pg = leaf->key[0]; |
1335 | uintptr_t right_pg = leaf->key[0]; |
1299 | count_t right_cnt = (count_t) leaf->value[0]; |
1336 | count_t right_cnt = (count_t) leaf->value[0]; |
1300 | 1337 | ||
1301 | /* |
1338 | /* |
1302 | * Investigate the border case in which the left neighbour does |
1339 | * Investigate the border case in which the left neighbour does |
1303 | * not exist but the interval fits from the left. |
1340 | * not exist but the interval fits from the left. |
1304 | */ |
1341 | */ |
1305 | 1342 | ||
1306 | if (overlaps(page, count * PAGE_SIZE, right_pg, |
1343 | if (overlaps(page, count * PAGE_SIZE, right_pg, |
1307 | right_cnt * PAGE_SIZE)) { |
1344 | right_cnt * PAGE_SIZE)) { |
1308 | /* The interval intersects with the right interval. */ |
1345 | /* The interval intersects with the right interval. */ |
1309 | return 0; |
1346 | return 0; |
1310 | } else if (page + count * PAGE_SIZE == right_pg) { |
1347 | } else if (page + count * PAGE_SIZE == right_pg) { |
1311 | /* |
1348 | /* |
1312 | * The interval can be added by moving the base of the |
1349 | * The interval can be added by moving the base of the |
1313 | * right interval down and increasing its size |
1350 | * right interval down and increasing its size |
1314 | * accordingly. |
1351 | * accordingly. |
1315 | */ |
1352 | */ |
1316 | leaf->key[0] = page; |
1353 | leaf->key[0] = page; |
1317 | leaf->value[0] += count; |
1354 | leaf->value[0] += count; |
1318 | return 1; |
1355 | return 1; |
1319 | } else { |
1356 | } else { |
1320 | /* |
1357 | /* |
1321 | * The interval doesn't adjoin with the right interval. |
1358 | * The interval doesn't adjoin with the right interval. |
1322 | * It must be added individually. |
1359 | * It must be added individually. |
1323 | */ |
1360 | */ |
1324 | btree_insert(&a->used_space, page, (void *) count, |
1361 | btree_insert(&a->used_space, page, (void *) count, |
1325 | leaf); |
1362 | leaf); |
1326 | return 1; |
1363 | return 1; |
1327 | } |
1364 | } |
1328 | } |
1365 | } |
1329 | 1366 | ||
1330 | node = btree_leaf_node_right_neighbour(&a->used_space, leaf); |
1367 | node = btree_leaf_node_right_neighbour(&a->used_space, leaf); |
1331 | if (node) { |
1368 | if (node) { |
1332 | uintptr_t left_pg = leaf->key[leaf->keys - 1]; |
1369 | uintptr_t left_pg = leaf->key[leaf->keys - 1]; |
1333 | uintptr_t right_pg = node->key[0]; |
1370 | uintptr_t right_pg = node->key[0]; |
1334 | count_t left_cnt = (count_t) leaf->value[leaf->keys - 1]; |
1371 | count_t left_cnt = (count_t) leaf->value[leaf->keys - 1]; |
1335 | count_t right_cnt = (count_t) node->value[0]; |
1372 | count_t right_cnt = (count_t) node->value[0]; |
1336 | 1373 | ||
1337 | /* |
1374 | /* |
1338 | * Examine the possibility that the interval fits |
1375 | * Examine the possibility that the interval fits |
1339 | * somewhere between the leftmost interval of |
1376 | * somewhere between the leftmost interval of |
1340 | * the right neigbour and the last interval of the leaf. |
1377 | * the right neigbour and the last interval of the leaf. |
1341 | */ |
1378 | */ |
1342 | 1379 | ||
1343 | if (page < left_pg) { |
1380 | if (page < left_pg) { |
1344 | /* Do nothing. */ |
1381 | /* Do nothing. */ |
1345 | } else if (overlaps(page, count * PAGE_SIZE, left_pg, |
1382 | } else if (overlaps(page, count * PAGE_SIZE, left_pg, |
1346 | left_cnt * PAGE_SIZE)) { |
1383 | left_cnt * PAGE_SIZE)) { |
1347 | /* The interval intersects with the left interval. */ |
1384 | /* The interval intersects with the left interval. */ |
1348 | return 0; |
1385 | return 0; |
1349 | } else if (overlaps(page, count * PAGE_SIZE, right_pg, |
1386 | } else if (overlaps(page, count * PAGE_SIZE, right_pg, |
1350 | right_cnt * PAGE_SIZE)) { |
1387 | right_cnt * PAGE_SIZE)) { |
1351 | /* The interval intersects with the right interval. */ |
1388 | /* The interval intersects with the right interval. */ |
1352 | return 0; |
1389 | return 0; |
1353 | } else if ((page == left_pg + left_cnt * PAGE_SIZE) && |
1390 | } else if ((page == left_pg + left_cnt * PAGE_SIZE) && |
1354 | (page + count * PAGE_SIZE == right_pg)) { |
1391 | (page + count * PAGE_SIZE == right_pg)) { |
1355 | /* |
1392 | /* |
1356 | * The interval can be added by merging the two already |
1393 | * The interval can be added by merging the two already |
1357 | * present intervals. |
1394 | * present intervals. |
1358 | * */ |
1395 | * */ |
1359 | leaf->value[leaf->keys - 1] += count + right_cnt; |
1396 | leaf->value[leaf->keys - 1] += count + right_cnt; |
1360 | btree_remove(&a->used_space, right_pg, node); |
1397 | btree_remove(&a->used_space, right_pg, node); |
1361 | return 1; |
1398 | return 1; |
1362 | } else if (page == left_pg + left_cnt * PAGE_SIZE) { |
1399 | } else if (page == left_pg + left_cnt * PAGE_SIZE) { |
1363 | /* |
1400 | /* |
1364 | * The interval can be added by simply growing the left |
1401 | * The interval can be added by simply growing the left |
1365 | * interval. |
1402 | * interval. |
1366 | * */ |
1403 | * */ |
1367 | leaf->value[leaf->keys - 1] += count; |
1404 | leaf->value[leaf->keys - 1] += count; |
1368 | return 1; |
1405 | return 1; |
1369 | } else if (page + count * PAGE_SIZE == right_pg) { |
1406 | } else if (page + count * PAGE_SIZE == right_pg) { |
1370 | /* |
1407 | /* |
1371 | * The interval can be addded by simply moving base of |
1408 | * The interval can be addded by simply moving base of |
1372 | * the right interval down and increasing its size |
1409 | * the right interval down and increasing its size |
1373 | * accordingly. |
1410 | * accordingly. |
1374 | */ |
1411 | */ |
1375 | node->value[0] += count; |
1412 | node->value[0] += count; |
1376 | node->key[0] = page; |
1413 | node->key[0] = page; |
1377 | return 1; |
1414 | return 1; |
1378 | } else { |
1415 | } else { |
1379 | /* |
1416 | /* |
1380 | * The interval is between both neigbouring intervals, |
1417 | * The interval is between both neigbouring intervals, |
1381 | * but cannot be merged with any of them. |
1418 | * but cannot be merged with any of them. |
1382 | */ |
1419 | */ |
1383 | btree_insert(&a->used_space, page, (void *) count, |
1420 | btree_insert(&a->used_space, page, (void *) count, |
1384 | leaf); |
1421 | leaf); |
1385 | return 1; |
1422 | return 1; |
1386 | } |
1423 | } |
1387 | } else if (page >= leaf->key[leaf->keys - 1]) { |
1424 | } else if (page >= leaf->key[leaf->keys - 1]) { |
1388 | uintptr_t left_pg = leaf->key[leaf->keys - 1]; |
1425 | uintptr_t left_pg = leaf->key[leaf->keys - 1]; |
1389 | count_t left_cnt = (count_t) leaf->value[leaf->keys - 1]; |
1426 | count_t left_cnt = (count_t) leaf->value[leaf->keys - 1]; |
1390 | 1427 | ||
1391 | /* |
1428 | /* |
1392 | * Investigate the border case in which the right neighbour |
1429 | * Investigate the border case in which the right neighbour |
1393 | * does not exist but the interval fits from the right. |
1430 | * does not exist but the interval fits from the right. |
1394 | */ |
1431 | */ |
1395 | 1432 | ||
1396 | if (overlaps(page, count * PAGE_SIZE, left_pg, |
1433 | if (overlaps(page, count * PAGE_SIZE, left_pg, |
1397 | left_cnt * PAGE_SIZE)) { |
1434 | left_cnt * PAGE_SIZE)) { |
1398 | /* The interval intersects with the left interval. */ |
1435 | /* The interval intersects with the left interval. */ |
1399 | return 0; |
1436 | return 0; |
1400 | } else if (left_pg + left_cnt * PAGE_SIZE == page) { |
1437 | } else if (left_pg + left_cnt * PAGE_SIZE == page) { |
1401 | /* |
1438 | /* |
1402 | * The interval can be added by growing the left |
1439 | * The interval can be added by growing the left |
1403 | * interval. |
1440 | * interval. |
1404 | */ |
1441 | */ |
1405 | leaf->value[leaf->keys - 1] += count; |
1442 | leaf->value[leaf->keys - 1] += count; |
1406 | return 1; |
1443 | return 1; |
1407 | } else { |
1444 | } else { |
1408 | /* |
1445 | /* |
1409 | * The interval doesn't adjoin with the left interval. |
1446 | * The interval doesn't adjoin with the left interval. |
1410 | * It must be added individually. |
1447 | * It must be added individually. |
1411 | */ |
1448 | */ |
1412 | btree_insert(&a->used_space, page, (void *) count, |
1449 | btree_insert(&a->used_space, page, (void *) count, |
1413 | leaf); |
1450 | leaf); |
1414 | return 1; |
1451 | return 1; |
1415 | } |
1452 | } |
1416 | } |
1453 | } |
1417 | 1454 | ||
1418 | /* |
1455 | /* |
1419 | * Note that if the algorithm made it thus far, the interval can fit |
1456 | * Note that if the algorithm made it thus far, the interval can fit |
1420 | * only between two other intervals of the leaf. The two border cases |
1457 | * only between two other intervals of the leaf. The two border cases |
1421 | * were already resolved. |
1458 | * were already resolved. |
1422 | */ |
1459 | */ |
1423 | for (i = 1; i < leaf->keys; i++) { |
1460 | for (i = 1; i < leaf->keys; i++) { |
1424 | if (page < leaf->key[i]) { |
1461 | if (page < leaf->key[i]) { |
1425 | uintptr_t left_pg = leaf->key[i - 1]; |
1462 | uintptr_t left_pg = leaf->key[i - 1]; |
1426 | uintptr_t right_pg = leaf->key[i]; |
1463 | uintptr_t right_pg = leaf->key[i]; |
1427 | count_t left_cnt = (count_t) leaf->value[i - 1]; |
1464 | count_t left_cnt = (count_t) leaf->value[i - 1]; |
1428 | count_t right_cnt = (count_t) leaf->value[i]; |
1465 | count_t right_cnt = (count_t) leaf->value[i]; |
1429 | 1466 | ||
1430 | /* |
1467 | /* |
1431 | * The interval fits between left_pg and right_pg. |
1468 | * The interval fits between left_pg and right_pg. |
1432 | */ |
1469 | */ |
1433 | 1470 | ||
1434 | if (overlaps(page, count * PAGE_SIZE, left_pg, |
1471 | if (overlaps(page, count * PAGE_SIZE, left_pg, |
1435 | left_cnt * PAGE_SIZE)) { |
1472 | left_cnt * PAGE_SIZE)) { |
1436 | /* |
1473 | /* |
1437 | * The interval intersects with the left |
1474 | * The interval intersects with the left |
1438 | * interval. |
1475 | * interval. |
1439 | */ |
1476 | */ |
1440 | return 0; |
1477 | return 0; |
1441 | } else if (overlaps(page, count * PAGE_SIZE, right_pg, |
1478 | } else if (overlaps(page, count * PAGE_SIZE, right_pg, |
1442 | right_cnt * PAGE_SIZE)) { |
1479 | right_cnt * PAGE_SIZE)) { |
1443 | /* |
1480 | /* |
1444 | * The interval intersects with the right |
1481 | * The interval intersects with the right |
1445 | * interval. |
1482 | * interval. |
1446 | */ |
1483 | */ |
1447 | return 0; |
1484 | return 0; |
1448 | } else if ((page == left_pg + left_cnt * PAGE_SIZE) && |
1485 | } else if ((page == left_pg + left_cnt * PAGE_SIZE) && |
1449 | (page + count * PAGE_SIZE == right_pg)) { |
1486 | (page + count * PAGE_SIZE == right_pg)) { |
1450 | /* |
1487 | /* |
1451 | * The interval can be added by merging the two |
1488 | * The interval can be added by merging the two |
1452 | * already present intervals. |
1489 | * already present intervals. |
1453 | */ |
1490 | */ |
1454 | leaf->value[i - 1] += count + right_cnt; |
1491 | leaf->value[i - 1] += count + right_cnt; |
1455 | btree_remove(&a->used_space, right_pg, leaf); |
1492 | btree_remove(&a->used_space, right_pg, leaf); |
1456 | return 1; |
1493 | return 1; |
1457 | } else if (page == left_pg + left_cnt * PAGE_SIZE) { |
1494 | } else if (page == left_pg + left_cnt * PAGE_SIZE) { |
1458 | /* |
1495 | /* |
1459 | * The interval can be added by simply growing |
1496 | * The interval can be added by simply growing |
1460 | * the left interval. |
1497 | * the left interval. |
1461 | */ |
1498 | */ |
1462 | leaf->value[i - 1] += count; |
1499 | leaf->value[i - 1] += count; |
1463 | return 1; |
1500 | return 1; |
1464 | } else if (page + count * PAGE_SIZE == right_pg) { |
1501 | } else if (page + count * PAGE_SIZE == right_pg) { |
1465 | /* |
1502 | /* |
1466 | * The interval can be addded by simply moving |
1503 | * The interval can be addded by simply moving |
1467 | * base of the right interval down and |
1504 | * base of the right interval down and |
1468 | * increasing its size accordingly. |
1505 | * increasing its size accordingly. |
1469 | */ |
1506 | */ |
1470 | leaf->value[i] += count; |
1507 | leaf->value[i] += count; |
1471 | leaf->key[i] = page; |
1508 | leaf->key[i] = page; |
1472 | return 1; |
1509 | return 1; |
1473 | } else { |
1510 | } else { |
1474 | /* |
1511 | /* |
1475 | * The interval is between both neigbouring |
1512 | * The interval is between both neigbouring |
1476 | * intervals, but cannot be merged with any of |
1513 | * intervals, but cannot be merged with any of |
1477 | * them. |
1514 | * them. |
1478 | */ |
1515 | */ |
1479 | btree_insert(&a->used_space, page, |
1516 | btree_insert(&a->used_space, page, |
1480 | (void *) count, leaf); |
1517 | (void *) count, leaf); |
1481 | return 1; |
1518 | return 1; |
1482 | } |
1519 | } |
1483 | } |
1520 | } |
1484 | } |
1521 | } |
1485 | 1522 | ||
1486 | panic("Inconsistency detected while adding %d pages of used space at " |
1523 | panic("Inconsistency detected while adding %d pages of used space at " |
1487 | "%p.\n", count, page); |
1524 | "%p.\n", count, page); |
1488 | } |
1525 | } |
1489 | 1526 | ||
1490 | /** Mark portion of address space area as unused. |
1527 | /** Mark portion of address space area as unused. |
1491 | * |
1528 | * |
1492 | * The address space area must be already locked. |
1529 | * The address space area must be already locked. |
1493 | * |
1530 | * |
1494 | * @param a Address space area. |
1531 | * @param a Address space area. |
1495 | * @param page First page to be marked. |
1532 | * @param page First page to be marked. |
1496 | * @param count Number of page to be marked. |
1533 | * @param count Number of page to be marked. |
1497 | * |
1534 | * |
1498 | * @return 0 on failure and 1 on success. |
1535 | * @return 0 on failure and 1 on success. |
1499 | */ |
1536 | */ |
1500 | int used_space_remove(as_area_t *a, uintptr_t page, count_t count) |
1537 | int used_space_remove(as_area_t *a, uintptr_t page, count_t count) |
1501 | { |
1538 | { |
1502 | btree_node_t *leaf, *node; |
1539 | btree_node_t *leaf, *node; |
1503 | count_t pages; |
1540 | count_t pages; |
1504 | int i; |
1541 | int i; |
1505 | 1542 | ||
1506 | ASSERT(page == ALIGN_DOWN(page, PAGE_SIZE)); |
1543 | ASSERT(page == ALIGN_DOWN(page, PAGE_SIZE)); |
1507 | ASSERT(count); |
1544 | ASSERT(count); |
1508 | 1545 | ||
1509 | pages = (count_t) btree_search(&a->used_space, page, &leaf); |
1546 | pages = (count_t) btree_search(&a->used_space, page, &leaf); |
1510 | if (pages) { |
1547 | if (pages) { |
1511 | /* |
1548 | /* |
1512 | * We are lucky, page is the beginning of some interval. |
1549 | * We are lucky, page is the beginning of some interval. |
1513 | */ |
1550 | */ |
1514 | if (count > pages) { |
1551 | if (count > pages) { |
1515 | return 0; |
1552 | return 0; |
1516 | } else if (count == pages) { |
1553 | } else if (count == pages) { |
1517 | btree_remove(&a->used_space, page, leaf); |
1554 | btree_remove(&a->used_space, page, leaf); |
1518 | return 1; |
1555 | return 1; |
1519 | } else { |
1556 | } else { |
1520 | /* |
1557 | /* |
1521 | * Find the respective interval. |
1558 | * Find the respective interval. |
1522 | * Decrease its size and relocate its start address. |
1559 | * Decrease its size and relocate its start address. |
1523 | */ |
1560 | */ |
1524 | for (i = 0; i < leaf->keys; i++) { |
1561 | for (i = 0; i < leaf->keys; i++) { |
1525 | if (leaf->key[i] == page) { |
1562 | if (leaf->key[i] == page) { |
1526 | leaf->key[i] += count * PAGE_SIZE; |
1563 | leaf->key[i] += count * PAGE_SIZE; |
1527 | leaf->value[i] -= count; |
1564 | leaf->value[i] -= count; |
1528 | return 1; |
1565 | return 1; |
1529 | } |
1566 | } |
1530 | } |
1567 | } |
1531 | goto error; |
1568 | goto error; |
1532 | } |
1569 | } |
1533 | } |
1570 | } |
1534 | 1571 | ||
1535 | node = btree_leaf_node_left_neighbour(&a->used_space, leaf); |
1572 | node = btree_leaf_node_left_neighbour(&a->used_space, leaf); |
1536 | if (node && page < leaf->key[0]) { |
1573 | if (node && page < leaf->key[0]) { |
1537 | uintptr_t left_pg = node->key[node->keys - 1]; |
1574 | uintptr_t left_pg = node->key[node->keys - 1]; |
1538 | count_t left_cnt = (count_t) node->value[node->keys - 1]; |
1575 | count_t left_cnt = (count_t) node->value[node->keys - 1]; |
1539 | 1576 | ||
1540 | if (overlaps(left_pg, left_cnt * PAGE_SIZE, page, |
1577 | if (overlaps(left_pg, left_cnt * PAGE_SIZE, page, |
1541 | count * PAGE_SIZE)) { |
1578 | count * PAGE_SIZE)) { |
1542 | if (page + count * PAGE_SIZE == |
1579 | if (page + count * PAGE_SIZE == |
1543 | left_pg + left_cnt * PAGE_SIZE) { |
1580 | left_pg + left_cnt * PAGE_SIZE) { |
1544 | /* |
1581 | /* |
1545 | * The interval is contained in the rightmost |
1582 | * The interval is contained in the rightmost |
1546 | * interval of the left neighbour and can be |
1583 | * interval of the left neighbour and can be |
1547 | * removed by updating the size of the bigger |
1584 | * removed by updating the size of the bigger |
1548 | * interval. |
1585 | * interval. |
1549 | */ |
1586 | */ |
1550 | node->value[node->keys - 1] -= count; |
1587 | node->value[node->keys - 1] -= count; |
1551 | return 1; |
1588 | return 1; |
1552 | } else if (page + count * PAGE_SIZE < |
1589 | } else if (page + count * PAGE_SIZE < |
1553 | left_pg + left_cnt*PAGE_SIZE) { |
1590 | left_pg + left_cnt*PAGE_SIZE) { |
1554 | count_t new_cnt; |
1591 | count_t new_cnt; |
1555 | 1592 | ||
1556 | /* |
1593 | /* |
1557 | * The interval is contained in the rightmost |
1594 | * The interval is contained in the rightmost |
1558 | * interval of the left neighbour but its |
1595 | * interval of the left neighbour but its |
1559 | * removal requires both updating the size of |
1596 | * removal requires both updating the size of |
1560 | * the original interval and also inserting a |
1597 | * the original interval and also inserting a |
1561 | * new interval. |
1598 | * new interval. |
1562 | */ |
1599 | */ |
1563 | new_cnt = ((left_pg + left_cnt * PAGE_SIZE) - |
1600 | new_cnt = ((left_pg + left_cnt * PAGE_SIZE) - |
1564 | (page + count*PAGE_SIZE)) >> PAGE_WIDTH; |
1601 | (page + count*PAGE_SIZE)) >> PAGE_WIDTH; |
1565 | node->value[node->keys - 1] -= count + new_cnt; |
1602 | node->value[node->keys - 1] -= count + new_cnt; |
1566 | btree_insert(&a->used_space, page + |
1603 | btree_insert(&a->used_space, page + |
1567 | count * PAGE_SIZE, (void *) new_cnt, leaf); |
1604 | count * PAGE_SIZE, (void *) new_cnt, leaf); |
1568 | return 1; |
1605 | return 1; |
1569 | } |
1606 | } |
1570 | } |
1607 | } |
1571 | return 0; |
1608 | return 0; |
1572 | } else if (page < leaf->key[0]) { |
1609 | } else if (page < leaf->key[0]) { |
1573 | return 0; |
1610 | return 0; |
1574 | } |
1611 | } |
1575 | 1612 | ||
1576 | if (page > leaf->key[leaf->keys - 1]) { |
1613 | if (page > leaf->key[leaf->keys - 1]) { |
1577 | uintptr_t left_pg = leaf->key[leaf->keys - 1]; |
1614 | uintptr_t left_pg = leaf->key[leaf->keys - 1]; |
1578 | count_t left_cnt = (count_t) leaf->value[leaf->keys - 1]; |
1615 | count_t left_cnt = (count_t) leaf->value[leaf->keys - 1]; |
1579 | 1616 | ||
1580 | if (overlaps(left_pg, left_cnt * PAGE_SIZE, page, |
1617 | if (overlaps(left_pg, left_cnt * PAGE_SIZE, page, |
1581 | count * PAGE_SIZE)) { |
1618 | count * PAGE_SIZE)) { |
1582 | if (page + count * PAGE_SIZE == |
1619 | if (page + count * PAGE_SIZE == |
1583 | left_pg + left_cnt * PAGE_SIZE) { |
1620 | left_pg + left_cnt * PAGE_SIZE) { |
1584 | /* |
1621 | /* |
1585 | * The interval is contained in the rightmost |
1622 | * The interval is contained in the rightmost |
1586 | * interval of the leaf and can be removed by |
1623 | * interval of the leaf and can be removed by |
1587 | * updating the size of the bigger interval. |
1624 | * updating the size of the bigger interval. |
1588 | */ |
1625 | */ |
1589 | leaf->value[leaf->keys - 1] -= count; |
1626 | leaf->value[leaf->keys - 1] -= count; |
1590 | return 1; |
1627 | return 1; |
1591 | } else if (page + count * PAGE_SIZE < left_pg + |
1628 | } else if (page + count * PAGE_SIZE < left_pg + |
1592 | left_cnt * PAGE_SIZE) { |
1629 | left_cnt * PAGE_SIZE) { |
1593 | count_t new_cnt; |
1630 | count_t new_cnt; |
1594 | 1631 | ||
1595 | /* |
1632 | /* |
1596 | * The interval is contained in the rightmost |
1633 | * The interval is contained in the rightmost |
1597 | * interval of the leaf but its removal |
1634 | * interval of the leaf but its removal |
1598 | * requires both updating the size of the |
1635 | * requires both updating the size of the |
1599 | * original interval and also inserting a new |
1636 | * original interval and also inserting a new |
1600 | * interval. |
1637 | * interval. |
1601 | */ |
1638 | */ |
1602 | new_cnt = ((left_pg + left_cnt * PAGE_SIZE) - |
1639 | new_cnt = ((left_pg + left_cnt * PAGE_SIZE) - |
1603 | (page + count * PAGE_SIZE)) >> PAGE_WIDTH; |
1640 | (page + count * PAGE_SIZE)) >> PAGE_WIDTH; |
1604 | leaf->value[leaf->keys - 1] -= count + new_cnt; |
1641 | leaf->value[leaf->keys - 1] -= count + new_cnt; |
1605 | btree_insert(&a->used_space, page + |
1642 | btree_insert(&a->used_space, page + |
1606 | count * PAGE_SIZE, (void *) new_cnt, leaf); |
1643 | count * PAGE_SIZE, (void *) new_cnt, leaf); |
1607 | return 1; |
1644 | return 1; |
1608 | } |
1645 | } |
1609 | } |
1646 | } |
1610 | return 0; |
1647 | return 0; |
1611 | } |
1648 | } |
1612 | 1649 | ||
1613 | /* |
1650 | /* |
1614 | * The border cases have been already resolved. |
1651 | * The border cases have been already resolved. |
1615 | * Now the interval can be only between intervals of the leaf. |
1652 | * Now the interval can be only between intervals of the leaf. |
1616 | */ |
1653 | */ |
1617 | for (i = 1; i < leaf->keys - 1; i++) { |
1654 | for (i = 1; i < leaf->keys - 1; i++) { |
1618 | if (page < leaf->key[i]) { |
1655 | if (page < leaf->key[i]) { |
1619 | uintptr_t left_pg = leaf->key[i - 1]; |
1656 | uintptr_t left_pg = leaf->key[i - 1]; |
1620 | count_t left_cnt = (count_t) leaf->value[i - 1]; |
1657 | count_t left_cnt = (count_t) leaf->value[i - 1]; |
1621 | 1658 | ||
1622 | /* |
1659 | /* |
1623 | * Now the interval is between intervals corresponding |
1660 | * Now the interval is between intervals corresponding |
1624 | * to (i - 1) and i. |
1661 | * to (i - 1) and i. |
1625 | */ |
1662 | */ |
1626 | if (overlaps(left_pg, left_cnt * PAGE_SIZE, page, |
1663 | if (overlaps(left_pg, left_cnt * PAGE_SIZE, page, |
1627 | count * PAGE_SIZE)) { |
1664 | count * PAGE_SIZE)) { |
1628 | if (page + count * PAGE_SIZE == |
1665 | if (page + count * PAGE_SIZE == |
1629 | left_pg + left_cnt*PAGE_SIZE) { |
1666 | left_pg + left_cnt*PAGE_SIZE) { |
1630 | /* |
1667 | /* |
1631 | * The interval is contained in the |
1668 | * The interval is contained in the |
1632 | * interval (i - 1) of the leaf and can |
1669 | * interval (i - 1) of the leaf and can |
1633 | * be removed by updating the size of |
1670 | * be removed by updating the size of |
1634 | * the bigger interval. |
1671 | * the bigger interval. |
1635 | */ |
1672 | */ |
1636 | leaf->value[i - 1] -= count; |
1673 | leaf->value[i - 1] -= count; |
1637 | return 1; |
1674 | return 1; |
1638 | } else if (page + count * PAGE_SIZE < |
1675 | } else if (page + count * PAGE_SIZE < |
1639 | left_pg + left_cnt * PAGE_SIZE) { |
1676 | left_pg + left_cnt * PAGE_SIZE) { |
1640 | count_t new_cnt; |
1677 | count_t new_cnt; |
1641 | 1678 | ||
1642 | /* |
1679 | /* |
1643 | * The interval is contained in the |
1680 | * The interval is contained in the |
1644 | * interval (i - 1) of the leaf but its |
1681 | * interval (i - 1) of the leaf but its |
1645 | * removal requires both updating the |
1682 | * removal requires both updating the |
1646 | * size of the original interval and |
1683 | * size of the original interval and |
1647 | * also inserting a new interval. |
1684 | * also inserting a new interval. |
1648 | */ |
1685 | */ |
1649 | new_cnt = ((left_pg + |
1686 | new_cnt = ((left_pg + |
1650 | left_cnt * PAGE_SIZE) - |
1687 | left_cnt * PAGE_SIZE) - |
1651 | (page + count * PAGE_SIZE)) >> |
1688 | (page + count * PAGE_SIZE)) >> |
1652 | PAGE_WIDTH; |
1689 | PAGE_WIDTH; |
1653 | leaf->value[i - 1] -= count + new_cnt; |
1690 | leaf->value[i - 1] -= count + new_cnt; |
1654 | btree_insert(&a->used_space, page + |
1691 | btree_insert(&a->used_space, page + |
1655 | count * PAGE_SIZE, (void *) new_cnt, |
1692 | count * PAGE_SIZE, (void *) new_cnt, |
1656 | leaf); |
1693 | leaf); |
1657 | return 1; |
1694 | return 1; |
1658 | } |
1695 | } |
1659 | } |
1696 | } |
1660 | return 0; |
1697 | return 0; |
1661 | } |
1698 | } |
1662 | } |
1699 | } |
1663 | 1700 | ||
1664 | error: |
1701 | error: |
1665 | panic("Inconsistency detected while removing %d pages of used space " |
1702 | panic("Inconsistency detected while removing %d pages of used space " |
1666 | "from %p.\n", count, page); |
1703 | "from %p.\n", count, page); |
1667 | } |
1704 | } |
1668 | 1705 | ||
1669 | /** Remove reference to address space area share info. |
1706 | /** Remove reference to address space area share info. |
1670 | * |
1707 | * |
1671 | * If the reference count drops to 0, the sh_info is deallocated. |
1708 | * If the reference count drops to 0, the sh_info is deallocated. |
1672 | * |
1709 | * |
1673 | * @param sh_info Pointer to address space area share info. |
1710 | * @param sh_info Pointer to address space area share info. |
1674 | */ |
1711 | */ |
1675 | void sh_info_remove_reference(share_info_t *sh_info) |
1712 | void sh_info_remove_reference(share_info_t *sh_info) |
1676 | { |
1713 | { |
1677 | bool dealloc = false; |
1714 | bool dealloc = false; |
1678 | 1715 | ||
1679 | mutex_lock(&sh_info->lock); |
1716 | mutex_lock(&sh_info->lock); |
1680 | ASSERT(sh_info->refcount); |
1717 | ASSERT(sh_info->refcount); |
1681 | if (--sh_info->refcount == 0) { |
1718 | if (--sh_info->refcount == 0) { |
1682 | dealloc = true; |
1719 | dealloc = true; |
1683 | link_t *cur; |
1720 | link_t *cur; |
1684 | 1721 | ||
1685 | /* |
1722 | /* |
1686 | * Now walk carefully the pagemap B+tree and free/remove |
1723 | * Now walk carefully the pagemap B+tree and free/remove |
1687 | * reference from all frames found there. |
1724 | * reference from all frames found there. |
1688 | */ |
1725 | */ |
1689 | for (cur = sh_info->pagemap.leaf_head.next; |
1726 | for (cur = sh_info->pagemap.leaf_head.next; |
1690 | cur != &sh_info->pagemap.leaf_head; cur = cur->next) { |
1727 | cur != &sh_info->pagemap.leaf_head; cur = cur->next) { |
1691 | btree_node_t *node; |
1728 | btree_node_t *node; |
1692 | int i; |
1729 | int i; |
1693 | 1730 | ||
1694 | node = list_get_instance(cur, btree_node_t, leaf_link); |
1731 | node = list_get_instance(cur, btree_node_t, leaf_link); |
1695 | for (i = 0; i < node->keys; i++) |
1732 | for (i = 0; i < node->keys; i++) |
1696 | frame_free((uintptr_t) node->value[i]); |
1733 | frame_free((uintptr_t) node->value[i]); |
1697 | } |
1734 | } |
1698 | 1735 | ||
1699 | } |
1736 | } |
1700 | mutex_unlock(&sh_info->lock); |
1737 | mutex_unlock(&sh_info->lock); |
1701 | 1738 | ||
1702 | if (dealloc) { |
1739 | if (dealloc) { |
1703 | btree_destroy(&sh_info->pagemap); |
1740 | btree_destroy(&sh_info->pagemap); |
1704 | free(sh_info); |
1741 | free(sh_info); |
1705 | } |
1742 | } |
1706 | } |
1743 | } |
1707 | 1744 | ||
1708 | /* |
1745 | /* |
1709 | * Address space related syscalls. |
1746 | * Address space related syscalls. |
1710 | */ |
1747 | */ |
1711 | 1748 | ||
1712 | /** Wrapper for as_area_create(). */ |
1749 | /** Wrapper for as_area_create(). */ |
1713 | unative_t sys_as_area_create(uintptr_t address, size_t size, int flags) |
1750 | unative_t sys_as_area_create(uintptr_t address, size_t size, int flags) |
1714 | { |
1751 | { |
1715 | if (as_area_create(AS, flags | AS_AREA_CACHEABLE, size, address, |
1752 | if (as_area_create(AS, flags | AS_AREA_CACHEABLE, size, address, |
1716 | AS_AREA_ATTR_NONE, &anon_backend, NULL)) |
1753 | AS_AREA_ATTR_NONE, &anon_backend, NULL)) |
1717 | return (unative_t) address; |
1754 | return (unative_t) address; |
1718 | else |
1755 | else |
1719 | return (unative_t) -1; |
1756 | return (unative_t) -1; |
1720 | } |
1757 | } |
1721 | 1758 | ||
1722 | /** Wrapper for as_area_resize(). */ |
1759 | /** Wrapper for as_area_resize(). */ |
1723 | unative_t sys_as_area_resize(uintptr_t address, size_t size, int flags) |
1760 | unative_t sys_as_area_resize(uintptr_t address, size_t size, int flags) |
1724 | { |
1761 | { |
1725 | return (unative_t) as_area_resize(AS, address, size, 0); |
1762 | return (unative_t) as_area_resize(AS, address, size, 0); |
1726 | } |
1763 | } |
1727 | 1764 | ||
1728 | /** Wrapper for as_area_destroy(). */ |
1765 | /** Wrapper for as_area_destroy(). */ |
1729 | unative_t sys_as_area_destroy(uintptr_t address) |
1766 | unative_t sys_as_area_destroy(uintptr_t address) |
1730 | { |
1767 | { |
1731 | return (unative_t) as_area_destroy(AS, address); |
1768 | return (unative_t) as_area_destroy(AS, address); |
1732 | } |
1769 | } |
1733 | 1770 | ||
1734 | /** Print out information about address space. |
1771 | /** Print out information about address space. |
1735 | * |
1772 | * |
1736 | * @param as Address space. |
1773 | * @param as Address space. |
1737 | */ |
1774 | */ |
1738 | void as_print(as_t *as) |
1775 | void as_print(as_t *as) |
1739 | { |
1776 | { |
1740 | ipl_t ipl; |
1777 | ipl_t ipl; |
1741 | 1778 | ||
1742 | ipl = interrupts_disable(); |
1779 | ipl = interrupts_disable(); |
1743 | mutex_lock(&as->lock); |
1780 | mutex_lock(&as->lock); |
1744 | 1781 | ||
1745 | /* print out info about address space areas */ |
1782 | /* print out info about address space areas */ |
1746 | link_t *cur; |
1783 | link_t *cur; |
1747 | for (cur = as->as_area_btree.leaf_head.next; |
1784 | for (cur = as->as_area_btree.leaf_head.next; |
1748 | cur != &as->as_area_btree.leaf_head; cur = cur->next) { |
1785 | cur != &as->as_area_btree.leaf_head; cur = cur->next) { |
1749 | btree_node_t *node; |
1786 | btree_node_t *node; |
1750 | 1787 | ||
1751 | node = list_get_instance(cur, btree_node_t, leaf_link); |
1788 | node = list_get_instance(cur, btree_node_t, leaf_link); |
1752 | 1789 | ||
1753 | int i; |
1790 | int i; |
1754 | for (i = 0; i < node->keys; i++) { |
1791 | for (i = 0; i < node->keys; i++) { |
1755 | as_area_t *area = node->value[i]; |
1792 | as_area_t *area = node->value[i]; |
1756 | 1793 | ||
1757 | mutex_lock(&area->lock); |
1794 | mutex_lock(&area->lock); |
1758 | printf("as_area: %p, base=%p, pages=%d (%p - %p)\n", |
1795 | printf("as_area: %p, base=%p, pages=%d (%p - %p)\n", |
1759 | area, area->base, area->pages, area->base, |
1796 | area, area->base, area->pages, area->base, |
1760 | area->base + area->pages*PAGE_SIZE); |
1797 | area->base + area->pages*PAGE_SIZE); |
1761 | mutex_unlock(&area->lock); |
1798 | mutex_unlock(&area->lock); |
1762 | } |
1799 | } |
1763 | } |
1800 | } |
1764 | 1801 | ||
1765 | mutex_unlock(&as->lock); |
1802 | mutex_unlock(&as->lock); |
1766 | interrupts_restore(ipl); |
1803 | interrupts_restore(ipl); |
1767 | } |
1804 | } |
1768 | 1805 | ||
1769 | /** @} |
1806 | /** @} |
1770 | */ |
1807 | */ |
1771 | 1808 |