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