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