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