Rev 1306 | Rev 1329 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1306 | Rev 1309 | ||
---|---|---|---|
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 | /** |
29 | /** |
30 | * @file as.c |
30 | * @file as.c |
31 | * @brief Address space related functions. |
31 | * @brief Address space related functions. |
32 | * |
32 | * |
33 | * This file contains address space manipulation functions. |
33 | * This file contains address space manipulation functions. |
34 | * Roughly speaking, this is a higher-level client of |
34 | * Roughly speaking, this is a higher-level client of |
35 | * Virtual Address Translation (VAT) subsystem. |
35 | * Virtual Address Translation (VAT) subsystem. |
36 | * |
36 | * |
37 | * Functionality provided by this file allows one to |
37 | * Functionality provided by this file allows one to |
38 | * create address space and create, resize and share |
38 | * create address space and create, resize and share |
39 | * address space areas. |
39 | * address space areas. |
40 | * |
40 | * |
41 | * @see page.c |
41 | * @see page.c |
42 | * |
42 | * |
43 | */ |
43 | */ |
44 | 44 | ||
45 | #include <mm/as.h> |
45 | #include <mm/as.h> |
46 | #include <arch/mm/as.h> |
46 | #include <arch/mm/as.h> |
47 | #include <mm/page.h> |
47 | #include <mm/page.h> |
48 | #include <mm/frame.h> |
48 | #include <mm/frame.h> |
49 | #include <mm/slab.h> |
49 | #include <mm/slab.h> |
50 | #include <mm/tlb.h> |
50 | #include <mm/tlb.h> |
51 | #include <arch/mm/page.h> |
51 | #include <arch/mm/page.h> |
52 | #include <genarch/mm/page_pt.h> |
52 | #include <genarch/mm/page_pt.h> |
53 | #include <genarch/mm/page_ht.h> |
53 | #include <genarch/mm/page_ht.h> |
54 | #include <mm/asid.h> |
54 | #include <mm/asid.h> |
55 | #include <arch/mm/asid.h> |
55 | #include <arch/mm/asid.h> |
56 | #include <synch/spinlock.h> |
56 | #include <synch/spinlock.h> |
57 | #include <adt/list.h> |
57 | #include <adt/list.h> |
58 | #include <adt/btree.h> |
58 | #include <adt/btree.h> |
59 | #include <proc/task.h> |
59 | #include <proc/task.h> |
60 | #include <proc/thread.h> |
60 | #include <proc/thread.h> |
61 | #include <arch/asm.h> |
61 | #include <arch/asm.h> |
62 | #include <panic.h> |
62 | #include <panic.h> |
63 | #include <debug.h> |
63 | #include <debug.h> |
64 | #include <print.h> |
64 | #include <print.h> |
65 | #include <memstr.h> |
65 | #include <memstr.h> |
66 | #include <macros.h> |
66 | #include <macros.h> |
67 | #include <arch.h> |
67 | #include <arch.h> |
68 | #include <errno.h> |
68 | #include <errno.h> |
69 | #include <config.h> |
69 | #include <config.h> |
70 | #include <arch/types.h> |
70 | #include <arch/types.h> |
71 | #include <typedefs.h> |
71 | #include <typedefs.h> |
72 | #include <syscall/copy.h> |
72 | #include <syscall/copy.h> |
73 | #include <arch/interrupt.h> |
73 | #include <arch/interrupt.h> |
74 | 74 | ||
75 | as_operations_t *as_operations = NULL; |
75 | as_operations_t *as_operations = NULL; |
76 | 76 | ||
77 | /** Address space lock. It protects inactive_as_with_asid_head. */ |
77 | /** Address space lock. It protects inactive_as_with_asid_head. */ |
78 | SPINLOCK_INITIALIZE(as_lock); |
78 | SPINLOCK_INITIALIZE(as_lock); |
79 | 79 | ||
80 | /** |
80 | /** |
81 | * This list contains address spaces that are not active on any |
81 | * This list contains address spaces that are not active on any |
82 | * processor and that have valid ASID. |
82 | * processor and that have valid ASID. |
83 | */ |
83 | */ |
84 | LIST_INITIALIZE(inactive_as_with_asid_head); |
84 | LIST_INITIALIZE(inactive_as_with_asid_head); |
85 | 85 | ||
86 | /** Kernel address space. */ |
86 | /** Kernel address space. */ |
87 | as_t *AS_KERNEL = NULL; |
87 | as_t *AS_KERNEL = NULL; |
88 | 88 | ||
89 | static int area_flags_to_page_flags(int aflags); |
89 | static int area_flags_to_page_flags(int aflags); |
90 | static int get_area_flags(as_area_t *a); |
90 | static int get_area_flags(as_area_t *a); |
91 | static as_area_t *find_area_and_lock(as_t *as, __address va); |
91 | static as_area_t *find_area_and_lock(as_t *as, __address va); |
92 | static bool check_area_conflicts(as_t *as, __address va, size_t size, as_area_t *avoid_area); |
92 | static bool check_area_conflicts(as_t *as, __address va, size_t size, as_area_t *avoid_area); |
93 | 93 | ||
94 | /** Initialize address space subsystem. */ |
94 | /** Initialize address space subsystem. */ |
95 | void as_init(void) |
95 | void as_init(void) |
96 | { |
96 | { |
97 | as_arch_init(); |
97 | as_arch_init(); |
98 | AS_KERNEL = as_create(FLAG_AS_KERNEL); |
98 | AS_KERNEL = as_create(FLAG_AS_KERNEL); |
99 | if (!AS_KERNEL) |
99 | if (!AS_KERNEL) |
100 | panic("can't create kernel address space\n"); |
100 | panic("can't create kernel address space\n"); |
101 | } |
101 | } |
102 | 102 | ||
103 | /** Create address space. |
103 | /** Create address space. |
104 | * |
104 | * |
105 | * @param flags Flags that influence way in wich the address space is created. |
105 | * @param flags Flags that influence way in wich the address space is created. |
106 | */ |
106 | */ |
107 | as_t *as_create(int flags) |
107 | as_t *as_create(int flags) |
108 | { |
108 | { |
109 | as_t *as; |
109 | as_t *as; |
110 | 110 | ||
111 | as = (as_t *) malloc(sizeof(as_t), 0); |
111 | as = (as_t *) malloc(sizeof(as_t), 0); |
112 | link_initialize(&as->inactive_as_with_asid_link); |
112 | link_initialize(&as->inactive_as_with_asid_link); |
113 | spinlock_initialize(&as->lock, "as_lock"); |
113 | spinlock_initialize(&as->lock, "as_lock"); |
114 | btree_create(&as->as_area_btree); |
114 | btree_create(&as->as_area_btree); |
115 | 115 | ||
116 | if (flags & FLAG_AS_KERNEL) |
116 | if (flags & FLAG_AS_KERNEL) |
117 | as->asid = ASID_KERNEL; |
117 | as->asid = ASID_KERNEL; |
118 | else |
118 | else |
119 | as->asid = ASID_INVALID; |
119 | as->asid = ASID_INVALID; |
120 | 120 | ||
121 | as->refcount = 0; |
121 | as->refcount = 0; |
122 | as->page_table = page_table_create(flags); |
122 | as->page_table = page_table_create(flags); |
123 | 123 | ||
124 | return as; |
124 | return as; |
125 | } |
125 | } |
126 | 126 | ||
127 | /** Free Adress space */ |
127 | /** Free Adress space */ |
128 | void as_free(as_t *as) |
128 | void as_free(as_t *as) |
129 | { |
129 | { |
130 | ASSERT(as->refcount == 0); |
130 | ASSERT(as->refcount == 0); |
131 | 131 | ||
132 | /* TODO: free as_areas and other resources held by as */ |
132 | /* TODO: free as_areas and other resources held by as */ |
133 | /* TODO: free page table */ |
133 | /* TODO: free page table */ |
134 | free(as); |
134 | free(as); |
135 | } |
135 | } |
136 | 136 | ||
137 | /** Create address space area of common attributes. |
137 | /** Create address space area of common attributes. |
138 | * |
138 | * |
139 | * The created address space area is added to the target address space. |
139 | * The created address space area is added to the target address space. |
140 | * |
140 | * |
141 | * @param as Target address space. |
141 | * @param as Target address space. |
142 | * @param flags Flags of the area memory. |
142 | * @param flags Flags of the area memory. |
143 | * @param size Size of area. |
143 | * @param size Size of area. |
144 | * @param base Base address of area. |
144 | * @param base Base address of area. |
145 | * @param attrs Attributes of the area. |
145 | * @param attrs Attributes of the area. |
146 | * |
146 | * |
147 | * @return Address space area on success or NULL on failure. |
147 | * @return Address space area on success or NULL on failure. |
148 | */ |
148 | */ |
149 | as_area_t *as_area_create(as_t *as, int flags, size_t size, __address base, int attrs) |
149 | as_area_t *as_area_create(as_t *as, int flags, size_t size, __address base, int attrs) |
150 | { |
150 | { |
151 | ipl_t ipl; |
151 | ipl_t ipl; |
152 | as_area_t *a; |
152 | as_area_t *a; |
153 | 153 | ||
154 | if (base % PAGE_SIZE) |
154 | if (base % PAGE_SIZE) |
155 | return NULL; |
155 | return NULL; |
156 | 156 | ||
157 | if (!size) |
157 | if (!size) |
158 | return NULL; |
158 | return NULL; |
159 | 159 | ||
160 | /* Writeable executable areas are not supported. */ |
160 | /* Writeable executable areas are not supported. */ |
161 | if ((flags & AS_AREA_EXEC) && (flags & AS_AREA_WRITE)) |
161 | if ((flags & AS_AREA_EXEC) && (flags & AS_AREA_WRITE)) |
162 | return NULL; |
162 | return NULL; |
163 | 163 | ||
164 | ipl = interrupts_disable(); |
164 | ipl = interrupts_disable(); |
165 | spinlock_lock(&as->lock); |
165 | spinlock_lock(&as->lock); |
166 | 166 | ||
167 | if (!check_area_conflicts(as, base, size, NULL)) { |
167 | if (!check_area_conflicts(as, base, size, NULL)) { |
168 | spinlock_unlock(&as->lock); |
168 | spinlock_unlock(&as->lock); |
169 | interrupts_restore(ipl); |
169 | interrupts_restore(ipl); |
170 | return NULL; |
170 | return NULL; |
171 | } |
171 | } |
172 | 172 | ||
173 | a = (as_area_t *) malloc(sizeof(as_area_t), 0); |
173 | a = (as_area_t *) malloc(sizeof(as_area_t), 0); |
174 | 174 | ||
175 | spinlock_initialize(&a->lock, "as_area_lock"); |
175 | spinlock_initialize(&a->lock, "as_area_lock"); |
176 | 176 | ||
177 | a->flags = flags; |
177 | a->flags = flags; |
178 | a->attributes = attrs; |
178 | a->attributes = attrs; |
179 | a->pages = SIZE2FRAMES(size); |
179 | a->pages = SIZE2FRAMES(size); |
180 | a->base = base; |
180 | a->base = base; |
181 | 181 | ||
182 | btree_insert(&as->as_area_btree, base, (void *) a, NULL); |
182 | btree_insert(&as->as_area_btree, base, (void *) a, NULL); |
183 | 183 | ||
184 | spinlock_unlock(&as->lock); |
184 | spinlock_unlock(&as->lock); |
185 | interrupts_restore(ipl); |
185 | interrupts_restore(ipl); |
186 | 186 | ||
187 | return a; |
187 | return a; |
188 | } |
188 | } |
189 | 189 | ||
190 | /** Find address space area and change it. |
190 | /** Find address space area and change it. |
191 | * |
191 | * |
192 | * @param as Address space. |
192 | * @param as Address space. |
193 | * @param address Virtual address belonging to the area to be changed. Must be page-aligned. |
193 | * @param address Virtual address belonging to the area to be changed. Must be page-aligned. |
194 | * @param size New size of the virtual memory block starting at address. |
194 | * @param size New size of the virtual memory block starting at address. |
195 | * @param flags Flags influencing the remap operation. Currently unused. |
195 | * @param flags Flags influencing the remap operation. Currently unused. |
196 | * |
196 | * |
197 | * @return Zero on success or a value from @ref errno.h otherwise. |
197 | * @return Zero on success or a value from @ref errno.h otherwise. |
198 | */ |
198 | */ |
199 | int as_area_resize(as_t *as, __address address, size_t size, int flags) |
199 | int as_area_resize(as_t *as, __address address, size_t size, int flags) |
200 | { |
200 | { |
201 | as_area_t *area; |
201 | as_area_t *area; |
202 | ipl_t ipl; |
202 | ipl_t ipl; |
203 | size_t pages; |
203 | size_t pages; |
204 | 204 | ||
205 | ipl = interrupts_disable(); |
205 | ipl = interrupts_disable(); |
206 | spinlock_lock(&as->lock); |
206 | spinlock_lock(&as->lock); |
207 | 207 | ||
208 | /* |
208 | /* |
209 | * Locate the area. |
209 | * Locate the area. |
210 | */ |
210 | */ |
211 | area = find_area_and_lock(as, address); |
211 | area = find_area_and_lock(as, address); |
212 | if (!area) { |
212 | if (!area) { |
213 | spinlock_unlock(&as->lock); |
213 | spinlock_unlock(&as->lock); |
214 | interrupts_restore(ipl); |
214 | interrupts_restore(ipl); |
215 | return ENOENT; |
215 | return ENOENT; |
216 | } |
216 | } |
217 | 217 | ||
218 | if (area->flags & AS_AREA_DEVICE) { |
218 | if (area->flags & AS_AREA_DEVICE) { |
219 | /* |
219 | /* |
220 | * Remapping of address space areas associated |
220 | * Remapping of address space areas associated |
221 | * with memory mapped devices is not supported. |
221 | * with memory mapped devices is not supported. |
222 | */ |
222 | */ |
223 | spinlock_unlock(&area->lock); |
223 | spinlock_unlock(&area->lock); |
224 | spinlock_unlock(&as->lock); |
224 | spinlock_unlock(&as->lock); |
225 | interrupts_restore(ipl); |
225 | interrupts_restore(ipl); |
226 | return ENOTSUP; |
226 | return ENOTSUP; |
227 | } |
227 | } |
228 | 228 | ||
229 | pages = SIZE2FRAMES((address - area->base) + size); |
229 | pages = SIZE2FRAMES((address - area->base) + size); |
230 | if (!pages) { |
230 | if (!pages) { |
231 | /* |
231 | /* |
232 | * Zero size address space areas are not allowed. |
232 | * Zero size address space areas are not allowed. |
233 | */ |
233 | */ |
234 | spinlock_unlock(&area->lock); |
234 | spinlock_unlock(&area->lock); |
235 | spinlock_unlock(&as->lock); |
235 | spinlock_unlock(&as->lock); |
236 | interrupts_restore(ipl); |
236 | interrupts_restore(ipl); |
237 | return EPERM; |
237 | return EPERM; |
238 | } |
238 | } |
239 | 239 | ||
240 | if (pages < area->pages) { |
240 | if (pages < area->pages) { |
241 | int i; |
241 | int i; |
242 | 242 | ||
243 | /* |
243 | /* |
244 | * Shrinking the area. |
244 | * Shrinking the area. |
245 | * No need to check for overlaps. |
245 | * No need to check for overlaps. |
246 | */ |
246 | */ |
247 | for (i = pages; i < area->pages; i++) { |
247 | for (i = pages; i < area->pages; i++) { |
248 | pte_t *pte; |
248 | pte_t *pte; |
249 | 249 | ||
250 | /* |
250 | /* |
251 | * Releasing physical memory. |
251 | * Releasing physical memory. |
252 | * This depends on the fact that the memory was allocated using frame_alloc(). |
252 | * This depends on the fact that the memory was allocated using frame_alloc(). |
253 | */ |
253 | */ |
254 | page_table_lock(as, false); |
254 | page_table_lock(as, false); |
255 | pte = page_mapping_find(as, area->base + i*PAGE_SIZE); |
255 | pte = page_mapping_find(as, area->base + i*PAGE_SIZE); |
256 | if (pte && PTE_VALID(pte)) { |
256 | if (pte && PTE_VALID(pte)) { |
257 | __address frame; |
257 | __address frame; |
258 | 258 | ||
259 | ASSERT(PTE_PRESENT(pte)); |
259 | ASSERT(PTE_PRESENT(pte)); |
260 | frame = PTE_GET_FRAME(pte); |
260 | frame = PTE_GET_FRAME(pte); |
261 | page_mapping_remove(as, area->base + i*PAGE_SIZE); |
261 | page_mapping_remove(as, area->base + i*PAGE_SIZE); |
262 | page_table_unlock(as, false); |
262 | page_table_unlock(as, false); |
263 | 263 | ||
264 | frame_free(ADDR2PFN(frame)); |
264 | frame_free(ADDR2PFN(frame)); |
265 | } else { |
265 | } else { |
266 | page_table_unlock(as, false); |
266 | page_table_unlock(as, false); |
267 | } |
267 | } |
268 | } |
268 | } |
269 | /* |
269 | /* |
270 | * Invalidate TLB's. |
270 | * Invalidate TLB's. |
271 | */ |
271 | */ |
272 | tlb_shootdown_start(TLB_INVL_PAGES, AS->asid, area->base + pages*PAGE_SIZE, area->pages - pages); |
272 | tlb_shootdown_start(TLB_INVL_PAGES, AS->asid, area->base + pages*PAGE_SIZE, area->pages - pages); |
273 | tlb_invalidate_pages(AS->asid, area->base + pages*PAGE_SIZE, area->pages - pages); |
273 | tlb_invalidate_pages(AS->asid, area->base + pages*PAGE_SIZE, area->pages - pages); |
274 | tlb_shootdown_finalize(); |
274 | tlb_shootdown_finalize(); |
275 | } else { |
275 | } else { |
276 | /* |
276 | /* |
277 | * Growing the area. |
277 | * Growing the area. |
278 | * Check for overlaps with other address space areas. |
278 | * Check for overlaps with other address space areas. |
279 | */ |
279 | */ |
280 | if (!check_area_conflicts(as, address, pages * PAGE_SIZE, area)) { |
280 | if (!check_area_conflicts(as, address, pages * PAGE_SIZE, area)) { |
281 | spinlock_unlock(&area->lock); |
281 | spinlock_unlock(&area->lock); |
282 | spinlock_unlock(&as->lock); |
282 | spinlock_unlock(&as->lock); |
283 | interrupts_restore(ipl); |
283 | interrupts_restore(ipl); |
284 | return EADDRNOTAVAIL; |
284 | return EADDRNOTAVAIL; |
285 | } |
285 | } |
286 | } |
286 | } |
287 | 287 | ||
288 | area->pages = pages; |
288 | area->pages = pages; |
289 | 289 | ||
290 | spinlock_unlock(&area->lock); |
290 | spinlock_unlock(&area->lock); |
291 | spinlock_unlock(&as->lock); |
291 | spinlock_unlock(&as->lock); |
292 | interrupts_restore(ipl); |
292 | interrupts_restore(ipl); |
293 | 293 | ||
294 | return 0; |
294 | return 0; |
295 | } |
295 | } |
296 | 296 | ||
297 | /** Destroy address space area. |
297 | /** Destroy address space area. |
298 | * |
298 | * |
299 | * @param as Address space. |
299 | * @param as Address space. |
300 | * @param address Address withing the area to be deleted. |
300 | * @param address Address withing the area to be deleted. |
301 | * |
301 | * |
302 | * @return Zero on success or a value from @ref errno.h on failure. |
302 | * @return Zero on success or a value from @ref errno.h on failure. |
303 | */ |
303 | */ |
304 | int as_area_destroy(as_t *as, __address address) |
304 | int as_area_destroy(as_t *as, __address address) |
305 | { |
305 | { |
306 | as_area_t *area; |
306 | as_area_t *area; |
307 | __address base; |
307 | __address base; |
308 | ipl_t ipl; |
308 | ipl_t ipl; |
309 | int i; |
309 | int i; |
310 | 310 | ||
311 | ipl = interrupts_disable(); |
311 | ipl = interrupts_disable(); |
312 | spinlock_lock(&as->lock); |
312 | spinlock_lock(&as->lock); |
313 | 313 | ||
314 | area = find_area_and_lock(as, address); |
314 | area = find_area_and_lock(as, address); |
315 | if (!area) { |
315 | if (!area) { |
316 | spinlock_unlock(&as->lock); |
316 | spinlock_unlock(&as->lock); |
317 | interrupts_restore(ipl); |
317 | interrupts_restore(ipl); |
318 | return ENOENT; |
318 | return ENOENT; |
319 | } |
319 | } |
320 | 320 | ||
321 | base = area->base; |
321 | base = area->base; |
322 | for (i = 0; i < area->pages; i++) { |
322 | for (i = 0; i < area->pages; i++) { |
323 | pte_t *pte; |
323 | pte_t *pte; |
324 | 324 | ||
325 | /* |
325 | /* |
326 | * Releasing physical memory. |
326 | * Releasing physical memory. |
327 | * Areas mapping memory-mapped devices are treated differently than |
327 | * Areas mapping memory-mapped devices are treated differently than |
328 | * areas backing frame_alloc()'ed memory. |
328 | * areas backing frame_alloc()'ed memory. |
329 | */ |
329 | */ |
330 | page_table_lock(as, false); |
330 | page_table_lock(as, false); |
331 | pte = page_mapping_find(as, area->base + i*PAGE_SIZE); |
331 | pte = page_mapping_find(as, area->base + i*PAGE_SIZE); |
332 | if (pte && PTE_VALID(pte)) { |
332 | if (pte && PTE_VALID(pte)) { |
333 | ASSERT(PTE_PRESENT(pte)); |
333 | ASSERT(PTE_PRESENT(pte)); |
334 | page_mapping_remove(as, area->base + i*PAGE_SIZE); |
334 | page_mapping_remove(as, area->base + i*PAGE_SIZE); |
335 | if (area->flags & AS_AREA_DEVICE) { |
335 | if (area->flags & AS_AREA_DEVICE) { |
336 | __address frame; |
336 | __address frame; |
337 | frame = PTE_GET_FRAME(pte); |
337 | frame = PTE_GET_FRAME(pte); |
338 | frame_free(ADDR2PFN(frame)); |
338 | frame_free(ADDR2PFN(frame)); |
339 | } |
339 | } |
340 | page_table_unlock(as, false); |
340 | page_table_unlock(as, false); |
341 | } else { |
341 | } else { |
342 | page_table_unlock(as, false); |
342 | page_table_unlock(as, false); |
343 | } |
343 | } |
344 | } |
344 | } |
345 | /* |
345 | /* |
346 | * Invalidate TLB's. |
346 | * Invalidate TLB's. |
347 | */ |
347 | */ |
348 | tlb_shootdown_start(TLB_INVL_PAGES, AS->asid, area->base, area->pages); |
348 | tlb_shootdown_start(TLB_INVL_PAGES, AS->asid, area->base, area->pages); |
349 | tlb_invalidate_pages(AS->asid, area->base, area->pages); |
349 | tlb_invalidate_pages(AS->asid, area->base, area->pages); |
350 | tlb_shootdown_finalize(); |
350 | tlb_shootdown_finalize(); |
351 | 351 | ||
- | 352 | area->attributes |= AS_AREA_ATTR_PARTIAL; |
|
352 | spinlock_unlock(&area->lock); |
353 | spinlock_unlock(&area->lock); |
353 | 354 | ||
354 | /* |
355 | /* |
355 | * Remove the empty area from address space. |
356 | * Remove the empty area from address space. |
356 | */ |
357 | */ |
357 | btree_remove(&AS->as_area_btree, base, NULL); |
358 | btree_remove(&AS->as_area_btree, base, NULL); |
358 | 359 | ||
- | 360 | free(area); |
|
- | 361 | ||
359 | spinlock_unlock(&AS->lock); |
362 | spinlock_unlock(&AS->lock); |
360 | interrupts_restore(ipl); |
363 | interrupts_restore(ipl); |
361 | return 0; |
364 | return 0; |
362 | } |
365 | } |
363 | 366 | ||
364 | /** Send address space area to another task. |
367 | /** Send address space area to another task. |
365 | * |
368 | * |
366 | * Address space area is sent to the specified task. |
369 | * Address space area is sent to the specified task. |
367 | * If the destination task is willing to accept the |
370 | * If the destination task is willing to accept the |
368 | * area, a new area is created according to the |
371 | * area, a new area is created according to the |
369 | * source area. Moreover, any existing mapping |
372 | * source area. Moreover, any existing mapping |
370 | * is copied as well, providing thus a mechanism |
373 | * is copied as well, providing thus a mechanism |
371 | * for sharing group of pages. The source address |
374 | * for sharing group of pages. The source address |
372 | * space area and any associated mapping is preserved. |
375 | * space area and any associated mapping is preserved. |
373 | * |
376 | * |
374 | * @param dst_id Task ID of the accepting task. |
377 | * @param dst_id Task ID of the accepting task. |
375 | * @param src_base Base address of the source address space area. |
378 | * @param src_base Base address of the source address space area. |
376 | * |
379 | * |
377 | * @return Zero on success or ENOENT if there is no such task or |
380 | * @return Zero on success or ENOENT if there is no such task or |
378 | * if there is no such address space area, |
381 | * if there is no such address space area, |
379 | * EPERM if there was a problem in accepting the area or |
382 | * EPERM if there was a problem in accepting the area or |
380 | * ENOMEM if there was a problem in allocating destination |
383 | * ENOMEM if there was a problem in allocating destination |
381 | * address space area. |
384 | * address space area. |
382 | */ |
385 | */ |
383 | int as_area_send(task_id_t dst_id, __address src_base) |
386 | int as_area_send(task_id_t dst_id, __address src_base) |
384 | { |
387 | { |
385 | ipl_t ipl; |
388 | ipl_t ipl; |
386 | task_t *t; |
389 | task_t *t; |
387 | count_t i; |
390 | count_t i; |
388 | as_t *dst_as; |
391 | as_t *dst_as; |
389 | __address dst_base; |
392 | __address dst_base; |
390 | int src_flags; |
393 | int src_flags; |
391 | size_t src_size; |
394 | size_t src_size; |
392 | as_area_t *src_area, *dst_area; |
395 | as_area_t *src_area, *dst_area; |
393 | 396 | ||
394 | ipl = interrupts_disable(); |
397 | ipl = interrupts_disable(); |
395 | spinlock_lock(&tasks_lock); |
398 | spinlock_lock(&tasks_lock); |
396 | 399 | ||
397 | t = task_find_by_id(dst_id); |
400 | t = task_find_by_id(dst_id); |
398 | if (!NULL) { |
401 | if (!NULL) { |
399 | spinlock_unlock(&tasks_lock); |
402 | spinlock_unlock(&tasks_lock); |
400 | interrupts_restore(ipl); |
403 | interrupts_restore(ipl); |
401 | return ENOENT; |
404 | return ENOENT; |
402 | } |
405 | } |
403 | 406 | ||
404 | spinlock_lock(&t->lock); |
407 | spinlock_lock(&t->lock); |
405 | spinlock_unlock(&tasks_lock); |
408 | spinlock_unlock(&tasks_lock); |
406 | 409 | ||
407 | dst_as = t->as; |
410 | dst_as = t->as; |
408 | dst_base = (__address) t->accept_arg.base; |
411 | dst_base = (__address) t->accept_arg.base; |
409 | 412 | ||
410 | if (dst_as == AS) { |
413 | if (dst_as == AS) { |
411 | /* |
414 | /* |
412 | * The two tasks share the entire address space. |
415 | * The two tasks share the entire address space. |
413 | * Return error since there is no point in continuing. |
416 | * Return error since there is no point in continuing. |
414 | */ |
417 | */ |
415 | spinlock_unlock(&t->lock); |
418 | spinlock_unlock(&t->lock); |
416 | interrupts_restore(ipl); |
419 | interrupts_restore(ipl); |
417 | return EPERM; |
420 | return EPERM; |
418 | } |
421 | } |
419 | 422 | ||
420 | spinlock_lock(&AS->lock); |
423 | spinlock_lock(&AS->lock); |
421 | src_area = find_area_and_lock(AS, src_base); |
424 | src_area = find_area_and_lock(AS, src_base); |
422 | if (!src_area) { |
425 | if (!src_area) { |
423 | /* |
426 | /* |
424 | * Could not find the source address space area. |
427 | * Could not find the source address space area. |
425 | */ |
428 | */ |
426 | spinlock_unlock(&t->lock); |
429 | spinlock_unlock(&t->lock); |
427 | spinlock_unlock(&AS->lock); |
430 | spinlock_unlock(&AS->lock); |
428 | interrupts_restore(ipl); |
431 | interrupts_restore(ipl); |
429 | return ENOENT; |
432 | return ENOENT; |
430 | } |
433 | } |
431 | src_size = src_area->pages * PAGE_SIZE; |
434 | src_size = src_area->pages * PAGE_SIZE; |
432 | src_flags = src_area->flags; |
435 | src_flags = src_area->flags; |
433 | spinlock_unlock(&src_area->lock); |
436 | spinlock_unlock(&src_area->lock); |
434 | spinlock_unlock(&AS->lock); |
437 | spinlock_unlock(&AS->lock); |
435 | 438 | ||
436 | if ((t->accept_arg.task_id != TASK->taskid) || (t->accept_arg.size != src_size) || |
439 | if ((t->accept_arg.task_id != TASK->taskid) || (t->accept_arg.size != src_size) || |
437 | (t->accept_arg.flags != src_flags)) { |
440 | (t->accept_arg.flags != src_flags)) { |
438 | /* |
441 | /* |
439 | * Discrepancy in either task ID, size or flags. |
442 | * Discrepancy in either task ID, size or flags. |
440 | */ |
443 | */ |
441 | spinlock_unlock(&t->lock); |
444 | spinlock_unlock(&t->lock); |
442 | interrupts_restore(ipl); |
445 | interrupts_restore(ipl); |
443 | return EPERM; |
446 | return EPERM; |
444 | } |
447 | } |
445 | 448 | ||
446 | /* |
449 | /* |
447 | * Create copy of the source address space area. |
450 | * Create copy of the source address space area. |
448 | * The destination area is created with AS_AREA_ATTR_PARTIAL |
451 | * The destination area is created with AS_AREA_ATTR_PARTIAL |
449 | * attribute set which prevents race condition with |
452 | * attribute set which prevents race condition with |
450 | * preliminary as_page_fault() calls. |
453 | * preliminary as_page_fault() calls. |
451 | */ |
454 | */ |
452 | dst_area = as_area_create(dst_as, src_flags, src_size, dst_base, AS_AREA_ATTR_PARTIAL); |
455 | dst_area = as_area_create(dst_as, src_flags, src_size, dst_base, AS_AREA_ATTR_PARTIAL); |
453 | if (!dst_area) { |
456 | if (!dst_area) { |
454 | /* |
457 | /* |
455 | * Destination address space area could not be created. |
458 | * Destination address space area could not be created. |
456 | */ |
459 | */ |
457 | spinlock_unlock(&t->lock); |
460 | spinlock_unlock(&t->lock); |
458 | interrupts_restore(ipl); |
461 | interrupts_restore(ipl); |
459 | return ENOMEM; |
462 | return ENOMEM; |
460 | } |
463 | } |
461 | 464 | ||
462 | memsetb((__address) &t->accept_arg, sizeof(as_area_acptsnd_arg_t), 0); |
465 | memsetb((__address) &t->accept_arg, sizeof(as_area_acptsnd_arg_t), 0); |
463 | spinlock_unlock(&t->lock); |
466 | spinlock_unlock(&t->lock); |
464 | 467 | ||
465 | /* |
468 | /* |
466 | * Avoid deadlock by first locking the address space with lower address. |
469 | * Avoid deadlock by first locking the address space with lower address. |
467 | */ |
470 | */ |
468 | if (dst_as < AS) { |
471 | if (dst_as < AS) { |
469 | spinlock_lock(&dst_as->lock); |
472 | spinlock_lock(&dst_as->lock); |
470 | spinlock_lock(&AS->lock); |
473 | spinlock_lock(&AS->lock); |
471 | } else { |
474 | } else { |
472 | spinlock_lock(&AS->lock); |
475 | spinlock_lock(&AS->lock); |
473 | spinlock_lock(&dst_as->lock); |
476 | spinlock_lock(&dst_as->lock); |
474 | } |
477 | } |
475 | 478 | ||
476 | for (i = 0; i < SIZE2FRAMES(src_size); i++) { |
479 | for (i = 0; i < SIZE2FRAMES(src_size); i++) { |
477 | pte_t *pte; |
480 | pte_t *pte; |
478 | __address frame; |
481 | __address frame; |
479 | 482 | ||
480 | page_table_lock(AS, false); |
483 | page_table_lock(AS, false); |
481 | pte = page_mapping_find(AS, src_base + i*PAGE_SIZE); |
484 | pte = page_mapping_find(AS, src_base + i*PAGE_SIZE); |
482 | if (pte && PTE_VALID(pte)) { |
485 | if (pte && PTE_VALID(pte)) { |
483 | ASSERT(PTE_PRESENT(pte)); |
486 | ASSERT(PTE_PRESENT(pte)); |
484 | frame = PTE_GET_FRAME(pte); |
487 | frame = PTE_GET_FRAME(pte); |
485 | if (!(src_flags & AS_AREA_DEVICE)) |
488 | if (!(src_flags & AS_AREA_DEVICE)) |
486 | frame_reference_add(ADDR2PFN(frame)); |
489 | frame_reference_add(ADDR2PFN(frame)); |
487 | page_table_unlock(AS, false); |
490 | page_table_unlock(AS, false); |
488 | } else { |
491 | } else { |
489 | page_table_unlock(AS, false); |
492 | page_table_unlock(AS, false); |
490 | continue; |
493 | continue; |
491 | } |
494 | } |
492 | 495 | ||
493 | page_table_lock(dst_as, false); |
496 | page_table_lock(dst_as, false); |
494 | page_mapping_insert(dst_as, dst_base + i*PAGE_SIZE, frame, area_flags_to_page_flags(src_flags)); |
497 | page_mapping_insert(dst_as, dst_base + i*PAGE_SIZE, frame, area_flags_to_page_flags(src_flags)); |
495 | page_table_unlock(dst_as, false); |
498 | page_table_unlock(dst_as, false); |
496 | } |
499 | } |
497 | 500 | ||
498 | /* |
501 | /* |
499 | * Now the destination address space area has been |
502 | * Now the destination address space area has been |
500 | * fully initialized. Clear the AS_AREA_ATTR_PARTIAL |
503 | * fully initialized. Clear the AS_AREA_ATTR_PARTIAL |
501 | * attribute. |
504 | * attribute. |
502 | */ |
505 | */ |
503 | spinlock_lock(&dst_area->lock); |
506 | spinlock_lock(&dst_area->lock); |
504 | dst_area->attributes &= ~AS_AREA_ATTR_PARTIAL; |
507 | dst_area->attributes &= ~AS_AREA_ATTR_PARTIAL; |
505 | spinlock_unlock(&dst_area->lock); |
508 | spinlock_unlock(&dst_area->lock); |
506 | 509 | ||
507 | spinlock_unlock(&AS->lock); |
510 | spinlock_unlock(&AS->lock); |
508 | spinlock_unlock(&dst_as->lock); |
511 | spinlock_unlock(&dst_as->lock); |
509 | interrupts_restore(ipl); |
512 | interrupts_restore(ipl); |
510 | 513 | ||
511 | return 0; |
514 | return 0; |
512 | } |
515 | } |
513 | 516 | ||
514 | /** Initialize mapping for one page of address space. |
517 | /** Initialize mapping for one page of address space. |
515 | * |
518 | * |
516 | * This functions maps 'page' to 'frame' according |
519 | * This functions maps 'page' to 'frame' according |
517 | * to attributes of the address space area to |
520 | * to attributes of the address space area to |
518 | * wich 'page' belongs. |
521 | * wich 'page' belongs. |
519 | * |
522 | * |
520 | * @param as Target address space. |
523 | * @param as Target address space. |
521 | * @param page Virtual page within the area. |
524 | * @param page Virtual page within the area. |
522 | * @param frame Physical frame to which page will be mapped. |
525 | * @param frame Physical frame to which page will be mapped. |
523 | */ |
526 | */ |
524 | void as_set_mapping(as_t *as, __address page, __address frame) |
527 | void as_set_mapping(as_t *as, __address page, __address frame) |
525 | { |
528 | { |
526 | as_area_t *area; |
529 | as_area_t *area; |
527 | ipl_t ipl; |
530 | ipl_t ipl; |
528 | 531 | ||
529 | ipl = interrupts_disable(); |
532 | ipl = interrupts_disable(); |
530 | page_table_lock(as, true); |
533 | page_table_lock(as, true); |
531 | 534 | ||
532 | area = find_area_and_lock(as, page); |
535 | area = find_area_and_lock(as, page); |
533 | if (!area) { |
536 | if (!area) { |
534 | panic("page not part of any as_area\n"); |
537 | panic("page not part of any as_area\n"); |
535 | } |
538 | } |
536 | 539 | ||
537 | page_mapping_insert(as, page, frame, get_area_flags(area)); |
540 | page_mapping_insert(as, page, frame, get_area_flags(area)); |
538 | 541 | ||
539 | spinlock_unlock(&area->lock); |
542 | spinlock_unlock(&area->lock); |
540 | page_table_unlock(as, true); |
543 | page_table_unlock(as, true); |
541 | interrupts_restore(ipl); |
544 | interrupts_restore(ipl); |
542 | } |
545 | } |
543 | 546 | ||
544 | /** Handle page fault within the current address space. |
547 | /** Handle page fault within the current address space. |
545 | * |
548 | * |
546 | * This is the high-level page fault handler. |
549 | * This is the high-level page fault handler. |
547 | * Interrupts are assumed disabled. |
550 | * Interrupts are assumed disabled. |
548 | * |
551 | * |
549 | * @param page Faulting page. |
552 | * @param page Faulting page. |
550 | * @param istate Pointer to interrupted state. |
553 | * @param istate Pointer to interrupted state. |
551 | * |
554 | * |
552 | * @return 0 on page fault, 1 on success or 2 if the fault was caused by copy_to_uspace() or copy_from_uspace(). |
555 | * @return 0 on page fault, 1 on success or 2 if the fault was caused by copy_to_uspace() or copy_from_uspace(). |
553 | */ |
556 | */ |
554 | int as_page_fault(__address page, istate_t *istate) |
557 | int as_page_fault(__address page, istate_t *istate) |
555 | { |
558 | { |
556 | pte_t *pte; |
559 | pte_t *pte; |
557 | as_area_t *area; |
560 | as_area_t *area; |
558 | __address frame; |
561 | __address frame; |
559 | 562 | ||
560 | ASSERT(AS); |
563 | ASSERT(AS); |
561 | 564 | ||
562 | spinlock_lock(&AS->lock); |
565 | spinlock_lock(&AS->lock); |
563 | area = find_area_and_lock(AS, page); |
566 | area = find_area_and_lock(AS, page); |
564 | if (!area) { |
567 | if (!area) { |
565 | /* |
568 | /* |
566 | * No area contained mapping for 'page'. |
569 | * No area contained mapping for 'page'. |
567 | * Signal page fault to low-level handler. |
570 | * Signal page fault to low-level handler. |
568 | */ |
571 | */ |
569 | spinlock_unlock(&AS->lock); |
572 | spinlock_unlock(&AS->lock); |
570 | goto page_fault; |
573 | goto page_fault; |
571 | } |
574 | } |
572 | 575 | ||
573 | if (area->attributes & AS_AREA_ATTR_PARTIAL) { |
576 | if (area->attributes & AS_AREA_ATTR_PARTIAL) { |
574 | /* |
577 | /* |
575 | * The address space area is not fully initialized. |
578 | * The address space area is not fully initialized. |
576 | * Avoid possible race by returning error. |
579 | * Avoid possible race by returning error. |
577 | */ |
580 | */ |
578 | spinlock_unlock(&area->lock); |
581 | spinlock_unlock(&area->lock); |
579 | spinlock_unlock(&AS->lock); |
582 | spinlock_unlock(&AS->lock); |
580 | goto page_fault; |
583 | goto page_fault; |
581 | } |
584 | } |
582 | 585 | ||
583 | ASSERT(!(area->flags & AS_AREA_DEVICE)); |
586 | ASSERT(!(area->flags & AS_AREA_DEVICE)); |
584 | 587 | ||
585 | page_table_lock(AS, false); |
588 | page_table_lock(AS, false); |
586 | 589 | ||
587 | /* |
590 | /* |
588 | * To avoid race condition between two page faults |
591 | * To avoid race condition between two page faults |
589 | * on the same address, we need to make sure |
592 | * on the same address, we need to make sure |
590 | * the mapping has not been already inserted. |
593 | * the mapping has not been already inserted. |
591 | */ |
594 | */ |
592 | if ((pte = page_mapping_find(AS, page))) { |
595 | if ((pte = page_mapping_find(AS, page))) { |
593 | if (PTE_PRESENT(pte)) { |
596 | if (PTE_PRESENT(pte)) { |
594 | page_table_unlock(AS, false); |
597 | page_table_unlock(AS, false); |
595 | spinlock_unlock(&area->lock); |
598 | spinlock_unlock(&area->lock); |
596 | spinlock_unlock(&AS->lock); |
599 | spinlock_unlock(&AS->lock); |
597 | return 1; |
600 | return 1; |
598 | } |
601 | } |
599 | } |
602 | } |
600 | 603 | ||
601 | /* |
604 | /* |
602 | * In general, there can be several reasons that |
605 | * In general, there can be several reasons that |
603 | * can have caused this fault. |
606 | * can have caused this fault. |
604 | * |
607 | * |
605 | * - non-existent mapping: the area is a scratch |
608 | * - non-existent mapping: the area is a scratch |
606 | * area (e.g. stack) and so far has not been |
609 | * area (e.g. stack) and so far has not been |
607 | * allocated a frame for the faulting page |
610 | * allocated a frame for the faulting page |
608 | * |
611 | * |
609 | * - non-present mapping: another possibility, |
612 | * - non-present mapping: another possibility, |
610 | * currently not implemented, would be frame |
613 | * currently not implemented, would be frame |
611 | * reuse; when this becomes a possibility, |
614 | * reuse; when this becomes a possibility, |
612 | * do not forget to distinguish between |
615 | * do not forget to distinguish between |
613 | * the different causes |
616 | * the different causes |
614 | */ |
617 | */ |
615 | frame = PFN2ADDR(frame_alloc(ONE_FRAME, 0)); |
618 | frame = PFN2ADDR(frame_alloc(ONE_FRAME, 0)); |
616 | memsetb(PA2KA(frame), FRAME_SIZE, 0); |
619 | memsetb(PA2KA(frame), FRAME_SIZE, 0); |
617 | 620 | ||
618 | /* |
621 | /* |
619 | * Map 'page' to 'frame'. |
622 | * Map 'page' to 'frame'. |
620 | * Note that TLB shootdown is not attempted as only new information is being |
623 | * Note that TLB shootdown is not attempted as only new information is being |
621 | * inserted into page tables. |
624 | * inserted into page tables. |
622 | */ |
625 | */ |
623 | page_mapping_insert(AS, page, frame, get_area_flags(area)); |
626 | page_mapping_insert(AS, page, frame, get_area_flags(area)); |
624 | page_table_unlock(AS, false); |
627 | page_table_unlock(AS, false); |
625 | 628 | ||
626 | spinlock_unlock(&area->lock); |
629 | spinlock_unlock(&area->lock); |
627 | spinlock_unlock(&AS->lock); |
630 | spinlock_unlock(&AS->lock); |
628 | return AS_PF_OK; |
631 | return AS_PF_OK; |
629 | 632 | ||
630 | page_fault: |
633 | page_fault: |
631 | if (!THREAD) |
634 | if (!THREAD) |
632 | return AS_PF_FAULT; |
635 | return AS_PF_FAULT; |
633 | 636 | ||
634 | if (THREAD->in_copy_from_uspace) { |
637 | if (THREAD->in_copy_from_uspace) { |
635 | THREAD->in_copy_from_uspace = false; |
638 | THREAD->in_copy_from_uspace = false; |
636 | istate_set_retaddr(istate, (__address) &memcpy_from_uspace_failover_address); |
639 | istate_set_retaddr(istate, (__address) &memcpy_from_uspace_failover_address); |
637 | } else if (THREAD->in_copy_to_uspace) { |
640 | } else if (THREAD->in_copy_to_uspace) { |
638 | THREAD->in_copy_to_uspace = false; |
641 | THREAD->in_copy_to_uspace = false; |
639 | istate_set_retaddr(istate, (__address) &memcpy_to_uspace_failover_address); |
642 | istate_set_retaddr(istate, (__address) &memcpy_to_uspace_failover_address); |
640 | } else { |
643 | } else { |
641 | return AS_PF_FAULT; |
644 | return AS_PF_FAULT; |
642 | } |
645 | } |
643 | 646 | ||
644 | return AS_PF_DEFER; |
647 | return AS_PF_DEFER; |
645 | } |
648 | } |
646 | 649 | ||
647 | /** Switch address spaces. |
650 | /** Switch address spaces. |
648 | * |
651 | * |
649 | * @param old Old address space or NULL. |
652 | * @param old Old address space or NULL. |
650 | * @param new New address space. |
653 | * @param new New address space. |
651 | */ |
654 | */ |
652 | void as_switch(as_t *old, as_t *new) |
655 | void as_switch(as_t *old, as_t *new) |
653 | { |
656 | { |
654 | ipl_t ipl; |
657 | ipl_t ipl; |
655 | bool needs_asid = false; |
658 | bool needs_asid = false; |
656 | 659 | ||
657 | ipl = interrupts_disable(); |
660 | ipl = interrupts_disable(); |
658 | spinlock_lock(&as_lock); |
661 | spinlock_lock(&as_lock); |
659 | 662 | ||
660 | /* |
663 | /* |
661 | * First, take care of the old address space. |
664 | * First, take care of the old address space. |
662 | */ |
665 | */ |
663 | if (old) { |
666 | if (old) { |
664 | spinlock_lock(&old->lock); |
667 | spinlock_lock(&old->lock); |
665 | ASSERT(old->refcount); |
668 | ASSERT(old->refcount); |
666 | if((--old->refcount == 0) && (old != AS_KERNEL)) { |
669 | if((--old->refcount == 0) && (old != AS_KERNEL)) { |
667 | /* |
670 | /* |
668 | * The old address space is no longer active on |
671 | * The old address space is no longer active on |
669 | * any processor. It can be appended to the |
672 | * any processor. It can be appended to the |
670 | * list of inactive address spaces with assigned |
673 | * list of inactive address spaces with assigned |
671 | * ASID. |
674 | * ASID. |
672 | */ |
675 | */ |
673 | ASSERT(old->asid != ASID_INVALID); |
676 | ASSERT(old->asid != ASID_INVALID); |
674 | list_append(&old->inactive_as_with_asid_link, &inactive_as_with_asid_head); |
677 | list_append(&old->inactive_as_with_asid_link, &inactive_as_with_asid_head); |
675 | } |
678 | } |
676 | spinlock_unlock(&old->lock); |
679 | spinlock_unlock(&old->lock); |
677 | } |
680 | } |
678 | 681 | ||
679 | /* |
682 | /* |
680 | * Second, prepare the new address space. |
683 | * Second, prepare the new address space. |
681 | */ |
684 | */ |
682 | spinlock_lock(&new->lock); |
685 | spinlock_lock(&new->lock); |
683 | if ((new->refcount++ == 0) && (new != AS_KERNEL)) { |
686 | if ((new->refcount++ == 0) && (new != AS_KERNEL)) { |
684 | if (new->asid != ASID_INVALID) |
687 | if (new->asid != ASID_INVALID) |
685 | list_remove(&new->inactive_as_with_asid_link); |
688 | list_remove(&new->inactive_as_with_asid_link); |
686 | else |
689 | else |
687 | needs_asid = true; /* defer call to asid_get() until new->lock is released */ |
690 | needs_asid = true; /* defer call to asid_get() until new->lock is released */ |
688 | } |
691 | } |
689 | SET_PTL0_ADDRESS(new->page_table); |
692 | SET_PTL0_ADDRESS(new->page_table); |
690 | spinlock_unlock(&new->lock); |
693 | spinlock_unlock(&new->lock); |
691 | 694 | ||
692 | if (needs_asid) { |
695 | if (needs_asid) { |
693 | /* |
696 | /* |
694 | * Allocation of new ASID was deferred |
697 | * Allocation of new ASID was deferred |
695 | * until now in order to avoid deadlock. |
698 | * until now in order to avoid deadlock. |
696 | */ |
699 | */ |
697 | asid_t asid; |
700 | asid_t asid; |
698 | 701 | ||
699 | asid = asid_get(); |
702 | asid = asid_get(); |
700 | spinlock_lock(&new->lock); |
703 | spinlock_lock(&new->lock); |
701 | new->asid = asid; |
704 | new->asid = asid; |
702 | spinlock_unlock(&new->lock); |
705 | spinlock_unlock(&new->lock); |
703 | } |
706 | } |
704 | spinlock_unlock(&as_lock); |
707 | spinlock_unlock(&as_lock); |
705 | interrupts_restore(ipl); |
708 | interrupts_restore(ipl); |
706 | 709 | ||
707 | /* |
710 | /* |
708 | * Perform architecture-specific steps. |
711 | * Perform architecture-specific steps. |
709 | * (e.g. write ASID to hardware register etc.) |
712 | * (e.g. write ASID to hardware register etc.) |
710 | */ |
713 | */ |
711 | as_install_arch(new); |
714 | as_install_arch(new); |
712 | 715 | ||
713 | AS = new; |
716 | AS = new; |
714 | } |
717 | } |
715 | 718 | ||
716 | /** Convert address space area flags to page flags. |
719 | /** Convert address space area flags to page flags. |
717 | * |
720 | * |
718 | * @param aflags Flags of some address space area. |
721 | * @param aflags Flags of some address space area. |
719 | * |
722 | * |
720 | * @return Flags to be passed to page_mapping_insert(). |
723 | * @return Flags to be passed to page_mapping_insert(). |
721 | */ |
724 | */ |
722 | int area_flags_to_page_flags(int aflags) |
725 | int area_flags_to_page_flags(int aflags) |
723 | { |
726 | { |
724 | int flags; |
727 | int flags; |
725 | 728 | ||
726 | flags = PAGE_USER | PAGE_PRESENT; |
729 | flags = PAGE_USER | PAGE_PRESENT; |
727 | 730 | ||
728 | if (aflags & AS_AREA_READ) |
731 | if (aflags & AS_AREA_READ) |
729 | flags |= PAGE_READ; |
732 | flags |= PAGE_READ; |
730 | 733 | ||
731 | if (aflags & AS_AREA_WRITE) |
734 | if (aflags & AS_AREA_WRITE) |
732 | flags |= PAGE_WRITE; |
735 | flags |= PAGE_WRITE; |
733 | 736 | ||
734 | if (aflags & AS_AREA_EXEC) |
737 | if (aflags & AS_AREA_EXEC) |
735 | flags |= PAGE_EXEC; |
738 | flags |= PAGE_EXEC; |
736 | 739 | ||
737 | if (!(aflags & AS_AREA_DEVICE)) |
740 | if (!(aflags & AS_AREA_DEVICE)) |
738 | flags |= PAGE_CACHEABLE; |
741 | flags |= PAGE_CACHEABLE; |
739 | 742 | ||
740 | return flags; |
743 | return flags; |
741 | } |
744 | } |
742 | 745 | ||
743 | /** Compute flags for virtual address translation subsytem. |
746 | /** Compute flags for virtual address translation subsytem. |
744 | * |
747 | * |
745 | * The address space area must be locked. |
748 | * The address space area must be locked. |
746 | * Interrupts must be disabled. |
749 | * Interrupts must be disabled. |
747 | * |
750 | * |
748 | * @param a Address space area. |
751 | * @param a Address space area. |
749 | * |
752 | * |
750 | * @return Flags to be used in page_mapping_insert(). |
753 | * @return Flags to be used in page_mapping_insert(). |
751 | */ |
754 | */ |
752 | int get_area_flags(as_area_t *a) |
755 | int get_area_flags(as_area_t *a) |
753 | { |
756 | { |
754 | return area_flags_to_page_flags(a->flags); |
757 | return area_flags_to_page_flags(a->flags); |
755 | } |
758 | } |
756 | 759 | ||
757 | /** Create page table. |
760 | /** Create page table. |
758 | * |
761 | * |
759 | * Depending on architecture, create either address space |
762 | * Depending on architecture, create either address space |
760 | * private or global page table. |
763 | * private or global page table. |
761 | * |
764 | * |
762 | * @param flags Flags saying whether the page table is for kernel address space. |
765 | * @param flags Flags saying whether the page table is for kernel address space. |
763 | * |
766 | * |
764 | * @return First entry of the page table. |
767 | * @return First entry of the page table. |
765 | */ |
768 | */ |
766 | pte_t *page_table_create(int flags) |
769 | pte_t *page_table_create(int flags) |
767 | { |
770 | { |
768 | ASSERT(as_operations); |
771 | ASSERT(as_operations); |
769 | ASSERT(as_operations->page_table_create); |
772 | ASSERT(as_operations->page_table_create); |
770 | 773 | ||
771 | return as_operations->page_table_create(flags); |
774 | return as_operations->page_table_create(flags); |
772 | } |
775 | } |
773 | 776 | ||
774 | /** Lock page table. |
777 | /** Lock page table. |
775 | * |
778 | * |
776 | * This function should be called before any page_mapping_insert(), |
779 | * This function should be called before any page_mapping_insert(), |
777 | * page_mapping_remove() and page_mapping_find(). |
780 | * page_mapping_remove() and page_mapping_find(). |
778 | * |
781 | * |
779 | * Locking order is such that address space areas must be locked |
782 | * Locking order is such that address space areas must be locked |
780 | * prior to this call. Address space can be locked prior to this |
783 | * prior to this call. Address space can be locked prior to this |
781 | * call in which case the lock argument is false. |
784 | * call in which case the lock argument is false. |
782 | * |
785 | * |
783 | * @param as Address space. |
786 | * @param as Address space. |
784 | * @param lock If false, do not attempt to lock as->lock. |
787 | * @param lock If false, do not attempt to lock as->lock. |
785 | */ |
788 | */ |
786 | void page_table_lock(as_t *as, bool lock) |
789 | void page_table_lock(as_t *as, bool lock) |
787 | { |
790 | { |
788 | ASSERT(as_operations); |
791 | ASSERT(as_operations); |
789 | ASSERT(as_operations->page_table_lock); |
792 | ASSERT(as_operations->page_table_lock); |
790 | 793 | ||
791 | as_operations->page_table_lock(as, lock); |
794 | as_operations->page_table_lock(as, lock); |
792 | } |
795 | } |
793 | 796 | ||
794 | /** Unlock page table. |
797 | /** Unlock page table. |
795 | * |
798 | * |
796 | * @param as Address space. |
799 | * @param as Address space. |
797 | * @param unlock If false, do not attempt to unlock as->lock. |
800 | * @param unlock If false, do not attempt to unlock as->lock. |
798 | */ |
801 | */ |
799 | void page_table_unlock(as_t *as, bool unlock) |
802 | void page_table_unlock(as_t *as, bool unlock) |
800 | { |
803 | { |
801 | ASSERT(as_operations); |
804 | ASSERT(as_operations); |
802 | ASSERT(as_operations->page_table_unlock); |
805 | ASSERT(as_operations->page_table_unlock); |
803 | 806 | ||
804 | as_operations->page_table_unlock(as, unlock); |
807 | as_operations->page_table_unlock(as, unlock); |
805 | } |
808 | } |
806 | 809 | ||
807 | 810 | ||
808 | /** Find address space area and lock it. |
811 | /** Find address space area and lock it. |
809 | * |
812 | * |
810 | * The address space must be locked and interrupts must be disabled. |
813 | * The address space must be locked and interrupts must be disabled. |
811 | * |
814 | * |
812 | * @param as Address space. |
815 | * @param as Address space. |
813 | * @param va Virtual address. |
816 | * @param va Virtual address. |
814 | * |
817 | * |
815 | * @return Locked address space area containing va on success or NULL on failure. |
818 | * @return Locked address space area containing va on success or NULL on failure. |
816 | */ |
819 | */ |
817 | as_area_t *find_area_and_lock(as_t *as, __address va) |
820 | as_area_t *find_area_and_lock(as_t *as, __address va) |
818 | { |
821 | { |
819 | as_area_t *a; |
822 | as_area_t *a; |
820 | btree_node_t *leaf, *lnode; |
823 | btree_node_t *leaf, *lnode; |
821 | int i; |
824 | int i; |
822 | 825 | ||
823 | a = (as_area_t *) btree_search(&as->as_area_btree, va, &leaf); |
826 | a = (as_area_t *) btree_search(&as->as_area_btree, va, &leaf); |
824 | if (a) { |
827 | if (a) { |
825 | /* va is the base address of an address space area */ |
828 | /* va is the base address of an address space area */ |
826 | spinlock_lock(&a->lock); |
829 | spinlock_lock(&a->lock); |
827 | return a; |
830 | return a; |
828 | } |
831 | } |
829 | 832 | ||
830 | /* |
833 | /* |
831 | * Search the leaf node and the righmost record of its left neighbour |
834 | * Search the leaf node and the righmost record of its left neighbour |
832 | * to find out whether this is a miss or va belongs to an address |
835 | * to find out whether this is a miss or va belongs to an address |
833 | * space area found there. |
836 | * space area found there. |
834 | */ |
837 | */ |
835 | 838 | ||
836 | /* First, search the leaf node itself. */ |
839 | /* First, search the leaf node itself. */ |
837 | for (i = 0; i < leaf->keys; i++) { |
840 | for (i = 0; i < leaf->keys; i++) { |
838 | a = (as_area_t *) leaf->value[i]; |
841 | a = (as_area_t *) leaf->value[i]; |
839 | spinlock_lock(&a->lock); |
842 | spinlock_lock(&a->lock); |
840 | if ((a->base <= va) && (va < a->base + a->pages * PAGE_SIZE)) { |
843 | if ((a->base <= va) && (va < a->base + a->pages * PAGE_SIZE)) { |
841 | return a; |
844 | return a; |
842 | } |
845 | } |
843 | spinlock_unlock(&a->lock); |
846 | spinlock_unlock(&a->lock); |
844 | } |
847 | } |
845 | 848 | ||
846 | /* |
849 | /* |
847 | * Second, locate the left neighbour and test its last record. |
850 | * Second, locate the left neighbour and test its last record. |
848 | * Because of its position in the B+tree, it must have base < va. |
851 | * Because of its position in the B+tree, it must have base < va. |
849 | */ |
852 | */ |
850 | if ((lnode = btree_leaf_node_left_neighbour(&as->as_area_btree, leaf))) { |
853 | if ((lnode = btree_leaf_node_left_neighbour(&as->as_area_btree, leaf))) { |
851 | a = (as_area_t *) lnode->value[lnode->keys - 1]; |
854 | a = (as_area_t *) lnode->value[lnode->keys - 1]; |
852 | spinlock_lock(&a->lock); |
855 | spinlock_lock(&a->lock); |
853 | if (va < a->base + a->pages * PAGE_SIZE) { |
856 | if (va < a->base + a->pages * PAGE_SIZE) { |
854 | return a; |
857 | return a; |
855 | } |
858 | } |
856 | spinlock_unlock(&a->lock); |
859 | spinlock_unlock(&a->lock); |
857 | } |
860 | } |
858 | 861 | ||
859 | return NULL; |
862 | return NULL; |
860 | } |
863 | } |
861 | 864 | ||
862 | /** Check area conflicts with other areas. |
865 | /** Check area conflicts with other areas. |
863 | * |
866 | * |
864 | * The address space must be locked and interrupts must be disabled. |
867 | * The address space must be locked and interrupts must be disabled. |
865 | * |
868 | * |
866 | * @param as Address space. |
869 | * @param as Address space. |
867 | * @param va Starting virtual address of the area being tested. |
870 | * @param va Starting virtual address of the area being tested. |
868 | * @param size Size of the area being tested. |
871 | * @param size Size of the area being tested. |
869 | * @param avoid_area Do not touch this area. |
872 | * @param avoid_area Do not touch this area. |
870 | * |
873 | * |
871 | * @return True if there is no conflict, false otherwise. |
874 | * @return True if there is no conflict, false otherwise. |
872 | */ |
875 | */ |
873 | bool check_area_conflicts(as_t *as, __address va, size_t size, as_area_t *avoid_area) |
876 | bool check_area_conflicts(as_t *as, __address va, size_t size, as_area_t *avoid_area) |
874 | { |
877 | { |
875 | as_area_t *a; |
878 | as_area_t *a; |
876 | btree_node_t *leaf, *node; |
879 | btree_node_t *leaf, *node; |
877 | int i; |
880 | int i; |
878 | 881 | ||
879 | /* |
882 | /* |
880 | * We don't want any area to have conflicts with NULL page. |
883 | * We don't want any area to have conflicts with NULL page. |
881 | */ |
884 | */ |
882 | if (overlaps(va, size, NULL, PAGE_SIZE)) |
885 | if (overlaps(va, size, NULL, PAGE_SIZE)) |
883 | return false; |
886 | return false; |
884 | 887 | ||
885 | /* |
888 | /* |
886 | * The leaf node is found in O(log n), where n is proportional to |
889 | * The leaf node is found in O(log n), where n is proportional to |
887 | * the number of address space areas belonging to as. |
890 | * the number of address space areas belonging to as. |
888 | * The check for conflicts is then attempted on the rightmost |
891 | * The check for conflicts is then attempted on the rightmost |
889 | * record in the left neighbour, the leftmost record in the right |
892 | * record in the left neighbour, the leftmost record in the right |
890 | * neighbour and all records in the leaf node itself. |
893 | * neighbour and all records in the leaf node itself. |
891 | */ |
894 | */ |
892 | 895 | ||
893 | if ((a = (as_area_t *) btree_search(&as->as_area_btree, va, &leaf))) { |
896 | if ((a = (as_area_t *) btree_search(&as->as_area_btree, va, &leaf))) { |
894 | if (a != avoid_area) |
897 | if (a != avoid_area) |
895 | return false; |
898 | return false; |
896 | } |
899 | } |
897 | 900 | ||
898 | /* First, check the two border cases. */ |
901 | /* First, check the two border cases. */ |
899 | if ((node = btree_leaf_node_left_neighbour(&as->as_area_btree, leaf))) { |
902 | if ((node = btree_leaf_node_left_neighbour(&as->as_area_btree, leaf))) { |
900 | a = (as_area_t *) node->value[node->keys - 1]; |
903 | a = (as_area_t *) node->value[node->keys - 1]; |
901 | spinlock_lock(&a->lock); |
904 | spinlock_lock(&a->lock); |
902 | if (overlaps(va, size, a->base, a->pages * PAGE_SIZE)) { |
905 | if (overlaps(va, size, a->base, a->pages * PAGE_SIZE)) { |
903 | spinlock_unlock(&a->lock); |
906 | spinlock_unlock(&a->lock); |
904 | return false; |
907 | return false; |
905 | } |
908 | } |
906 | spinlock_unlock(&a->lock); |
909 | spinlock_unlock(&a->lock); |
907 | } |
910 | } |
908 | if ((node = btree_leaf_node_right_neighbour(&as->as_area_btree, leaf))) { |
911 | if ((node = btree_leaf_node_right_neighbour(&as->as_area_btree, leaf))) { |
909 | a = (as_area_t *) node->value[0]; |
912 | a = (as_area_t *) node->value[0]; |
910 | spinlock_lock(&a->lock); |
913 | spinlock_lock(&a->lock); |
911 | if (overlaps(va, size, a->base, a->pages * PAGE_SIZE)) { |
914 | if (overlaps(va, size, a->base, a->pages * PAGE_SIZE)) { |
912 | spinlock_unlock(&a->lock); |
915 | spinlock_unlock(&a->lock); |
913 | return false; |
916 | return false; |
914 | } |
917 | } |
915 | spinlock_unlock(&a->lock); |
918 | spinlock_unlock(&a->lock); |
916 | } |
919 | } |
917 | 920 | ||
918 | /* Second, check the leaf node. */ |
921 | /* Second, check the leaf node. */ |
919 | for (i = 0; i < leaf->keys; i++) { |
922 | for (i = 0; i < leaf->keys; i++) { |
920 | a = (as_area_t *) leaf->value[i]; |
923 | a = (as_area_t *) leaf->value[i]; |
921 | 924 | ||
922 | if (a == avoid_area) |
925 | if (a == avoid_area) |
923 | continue; |
926 | continue; |
924 | 927 | ||
925 | spinlock_lock(&a->lock); |
928 | spinlock_lock(&a->lock); |
926 | if (overlaps(va, size, a->base, a->pages * PAGE_SIZE)) { |
929 | if (overlaps(va, size, a->base, a->pages * PAGE_SIZE)) { |
927 | spinlock_unlock(&a->lock); |
930 | spinlock_unlock(&a->lock); |
928 | return false; |
931 | return false; |
929 | } |
932 | } |
930 | spinlock_unlock(&a->lock); |
933 | spinlock_unlock(&a->lock); |
931 | } |
934 | } |
932 | 935 | ||
933 | /* |
936 | /* |
934 | * So far, the area does not conflict with other areas. |
937 | * So far, the area does not conflict with other areas. |
935 | * Check if it doesn't conflict with kernel address space. |
938 | * Check if it doesn't conflict with kernel address space. |
936 | */ |
939 | */ |
937 | if (!KERNEL_ADDRESS_SPACE_SHADOWED) { |
940 | if (!KERNEL_ADDRESS_SPACE_SHADOWED) { |
938 | return !overlaps(va, size, |
941 | return !overlaps(va, size, |
939 | KERNEL_ADDRESS_SPACE_START, KERNEL_ADDRESS_SPACE_END-KERNEL_ADDRESS_SPACE_START); |
942 | KERNEL_ADDRESS_SPACE_START, KERNEL_ADDRESS_SPACE_END-KERNEL_ADDRESS_SPACE_START); |
940 | } |
943 | } |
941 | 944 | ||
942 | return true; |
945 | return true; |
943 | } |
946 | } |
944 | 947 | ||
945 | /* |
948 | /* |
946 | * Address space related syscalls. |
949 | * Address space related syscalls. |
947 | */ |
950 | */ |
948 | 951 | ||
949 | /** Wrapper for as_area_create(). */ |
952 | /** Wrapper for as_area_create(). */ |
950 | __native sys_as_area_create(__address address, size_t size, int flags) |
953 | __native sys_as_area_create(__address address, size_t size, int flags) |
951 | { |
954 | { |
952 | if (as_area_create(AS, flags, size, address, AS_AREA_ATTR_NONE)) |
955 | if (as_area_create(AS, flags, size, address, AS_AREA_ATTR_NONE)) |
953 | return (__native) address; |
956 | return (__native) address; |
954 | else |
957 | else |
955 | return (__native) -1; |
958 | return (__native) -1; |
956 | } |
959 | } |
957 | 960 | ||
958 | /** Wrapper for as_area_resize. */ |
961 | /** Wrapper for as_area_resize. */ |
959 | __native sys_as_area_resize(__address address, size_t size, int flags) |
962 | __native sys_as_area_resize(__address address, size_t size, int flags) |
960 | { |
963 | { |
961 | return (__native) as_area_resize(AS, address, size, 0); |
964 | return (__native) as_area_resize(AS, address, size, 0); |
962 | } |
965 | } |
963 | 966 | ||
964 | /** Wrapper for as_area_destroy. */ |
967 | /** Wrapper for as_area_destroy. */ |
965 | __native sys_as_area_destroy(__address address) |
968 | __native sys_as_area_destroy(__address address) |
966 | { |
969 | { |
967 | return (__native) as_area_destroy(AS, address); |
970 | return (__native) as_area_destroy(AS, address); |
968 | } |
971 | } |
969 | 972 | ||
970 | /** Prepare task for accepting address space area from another task. |
973 | /** Prepare task for accepting address space area from another task. |
971 | * |
974 | * |
972 | * @param uspace_accept_arg Accept structure passed from userspace. |
975 | * @param uspace_accept_arg Accept structure passed from userspace. |
973 | * |
976 | * |
974 | * @return EPERM if the task ID encapsulated in @uspace_accept_arg references |
977 | * @return EPERM if the task ID encapsulated in @uspace_accept_arg references |
975 | * TASK. Otherwise zero is returned. |
978 | * TASK. Otherwise zero is returned. |
976 | */ |
979 | */ |
977 | __native sys_as_area_accept(as_area_acptsnd_arg_t *uspace_accept_arg) |
980 | __native sys_as_area_accept(as_area_acptsnd_arg_t *uspace_accept_arg) |
978 | { |
981 | { |
979 | as_area_acptsnd_arg_t arg; |
982 | as_area_acptsnd_arg_t arg; |
980 | int rc; |
983 | int rc; |
981 | 984 | ||
982 | rc = copy_from_uspace(&arg, uspace_accept_arg, sizeof(as_area_acptsnd_arg_t)); |
985 | rc = copy_from_uspace(&arg, uspace_accept_arg, sizeof(as_area_acptsnd_arg_t)); |
983 | if (rc != 0) |
986 | if (rc != 0) |
984 | return rc; |
987 | return rc; |
985 | 988 | ||
986 | if (!arg.size) |
989 | if (!arg.size) |
987 | return (__native) EPERM; |
990 | return (__native) EPERM; |
988 | 991 | ||
989 | if (arg.task_id == TASK->taskid) { |
992 | if (arg.task_id == TASK->taskid) { |
990 | /* |
993 | /* |
991 | * Accepting from itself is not allowed. |
994 | * Accepting from itself is not allowed. |
992 | */ |
995 | */ |
993 | return (__native) EPERM; |
996 | return (__native) EPERM; |
994 | } |
997 | } |
995 | 998 | ||
996 | memcpy(&TASK->accept_arg, &arg, sizeof(as_area_acptsnd_arg_t)); |
999 | memcpy(&TASK->accept_arg, &arg, sizeof(as_area_acptsnd_arg_t)); |
997 | 1000 | ||
998 | return 0; |
1001 | return 0; |
999 | } |
1002 | } |
1000 | 1003 | ||
1001 | /** Wrapper for as_area_send. */ |
1004 | /** Wrapper for as_area_send. */ |
1002 | __native sys_as_area_send(as_area_acptsnd_arg_t *uspace_send_arg) |
1005 | __native sys_as_area_send(as_area_acptsnd_arg_t *uspace_send_arg) |
1003 | { |
1006 | { |
1004 | as_area_acptsnd_arg_t arg; |
1007 | as_area_acptsnd_arg_t arg; |
1005 | int rc; |
1008 | int rc; |
1006 | 1009 | ||
1007 | rc = copy_from_uspace(&arg, uspace_send_arg, sizeof(as_area_acptsnd_arg_t)); |
1010 | rc = copy_from_uspace(&arg, uspace_send_arg, sizeof(as_area_acptsnd_arg_t)); |
1008 | if (rc != 0) |
1011 | if (rc != 0) |
1009 | return rc; |
1012 | return rc; |
1010 | 1013 | ||
1011 | if (!arg.size) |
1014 | if (!arg.size) |
1012 | return (__native) EPERM; |
1015 | return (__native) EPERM; |
1013 | 1016 | ||
1014 | if (arg.task_id == TASK->taskid) { |
1017 | if (arg.task_id == TASK->taskid) { |
1015 | /* |
1018 | /* |
1016 | * Sending to itself is not allowed. |
1019 | * Sending to itself is not allowed. |
1017 | */ |
1020 | */ |
1018 | return (__native) EPERM; |
1021 | return (__native) EPERM; |
1019 | } |
1022 | } |
1020 | 1023 | ||
1021 | return (__native) as_area_send(arg.task_id, (__address) arg.base); |
1024 | return (__native) as_area_send(arg.task_id, (__address) arg.base); |
1022 | } |
1025 | } |
1023 | 1026 |