Rev 2132 | Rev 2141 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2132 | Rev 2134 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (c) 2006 Jakub Jermar |
2 | * Copyright (c) 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 Backend for address space areas backed by an ELF image. |
35 | * @brief Backend for address space areas backed by an ELF image. |
36 | */ |
36 | */ |
37 | 37 | ||
38 | #include <lib/elf.h> |
38 | #include <lib/elf.h> |
39 | #include <debug.h> |
39 | #include <debug.h> |
40 | #include <arch/types.h> |
40 | #include <arch/types.h> |
41 | #include <mm/as.h> |
41 | #include <mm/as.h> |
42 | #include <mm/frame.h> |
42 | #include <mm/frame.h> |
43 | #include <mm/slab.h> |
43 | #include <mm/slab.h> |
44 | #include <mm/page.h> |
44 | #include <mm/page.h> |
45 | #include <genarch/mm/page_pt.h> |
45 | #include <genarch/mm/page_pt.h> |
46 | #include <genarch/mm/page_ht.h> |
46 | #include <genarch/mm/page_ht.h> |
47 | #include <align.h> |
47 | #include <align.h> |
48 | #include <memstr.h> |
48 | #include <memstr.h> |
49 | #include <macros.h> |
49 | #include <macros.h> |
50 | #include <arch.h> |
50 | #include <arch.h> |
51 | 51 | ||
52 | #ifdef CONFIG_VIRT_IDX_DCACHE |
52 | #ifdef CONFIG_VIRT_IDX_DCACHE |
53 | #include <arch/mm/cache.h> |
53 | #include <arch/mm/cache.h> |
54 | #endif |
54 | #endif |
55 | 55 | ||
56 | static int elf_page_fault(as_area_t *area, uintptr_t addr, pf_access_t access); |
56 | static int elf_page_fault(as_area_t *area, uintptr_t addr, pf_access_t access); |
57 | static void elf_frame_free(as_area_t *area, uintptr_t page, uintptr_t frame); |
57 | static void elf_frame_free(as_area_t *area, uintptr_t page, uintptr_t frame); |
58 | static void elf_share(as_area_t *area); |
58 | static void elf_share(as_area_t *area); |
59 | 59 | ||
60 | mem_backend_t elf_backend = { |
60 | mem_backend_t elf_backend = { |
61 | .page_fault = elf_page_fault, |
61 | .page_fault = elf_page_fault, |
62 | .frame_free = elf_frame_free, |
62 | .frame_free = elf_frame_free, |
63 | .share = elf_share |
63 | .share = elf_share |
64 | }; |
64 | }; |
65 | 65 | ||
66 | /** Service a page fault in the ELF backend address space area. |
66 | /** Service a page fault in the ELF backend address space area. |
67 | * |
67 | * |
68 | * The address space area and page tables must be already locked. |
68 | * The address space area and page tables must be already locked. |
69 | * |
69 | * |
70 | * @param area Pointer to the address space area. |
70 | * @param area Pointer to the address space area. |
71 | * @param addr Faulting virtual address. |
71 | * @param addr Faulting virtual address. |
72 | * @param access Access mode that caused the fault (i.e. read/write/exec). |
72 | * @param access Access mode that caused the fault (i.e. read/write/exec). |
73 | * |
73 | * |
74 | * @return AS_PF_FAULT on failure (i.e. page fault) or AS_PF_OK on success (i.e. |
74 | * @return AS_PF_FAULT on failure (i.e. page fault) or AS_PF_OK on success (i.e. |
75 | * serviced). |
75 | * serviced). |
76 | */ |
76 | */ |
77 | int elf_page_fault(as_area_t *area, uintptr_t addr, pf_access_t access) |
77 | int elf_page_fault(as_area_t *area, uintptr_t addr, pf_access_t access) |
78 | { |
78 | { |
79 | elf_header_t *elf = area->backend_data.elf; |
79 | elf_header_t *elf = area->backend_data.elf; |
80 | elf_segment_header_t *entry = area->backend_data.segment; |
80 | elf_segment_header_t *entry = area->backend_data.segment; |
81 | btree_node_t *leaf; |
81 | btree_node_t *leaf; |
82 | uintptr_t base, frame; |
82 | uintptr_t base, frame; |
83 | index_t i; |
83 | index_t i; |
- | 84 | bool dirty = false; |
|
84 | 85 | ||
85 | if (!as_area_check_access(area, access)) |
86 | if (!as_area_check_access(area, access)) |
86 | return AS_PF_FAULT; |
87 | return AS_PF_FAULT; |
87 | 88 | ||
88 | ASSERT((addr >= entry->p_vaddr) && |
89 | ASSERT((addr >= entry->p_vaddr) && |
89 | (addr < entry->p_vaddr + entry->p_memsz)); |
90 | (addr < entry->p_vaddr + entry->p_memsz)); |
90 | i = (addr - entry->p_vaddr) >> PAGE_WIDTH; |
91 | i = (addr - entry->p_vaddr) >> PAGE_WIDTH; |
91 | base = (uintptr_t) (((void *) elf) + entry->p_offset); |
92 | base = (uintptr_t) (((void *) elf) + entry->p_offset); |
92 | ASSERT(ALIGN_UP(base, FRAME_SIZE) == base); |
93 | ASSERT(ALIGN_UP(base, FRAME_SIZE) == base); |
93 | 94 | ||
94 | if (area->sh_info) { |
95 | if (area->sh_info) { |
95 | bool found = false; |
96 | bool found = false; |
96 | 97 | ||
97 | /* |
98 | /* |
98 | * The address space area is shared. |
99 | * The address space area is shared. |
99 | */ |
100 | */ |
100 | 101 | ||
101 | mutex_lock(&area->sh_info->lock); |
102 | mutex_lock(&area->sh_info->lock); |
102 | frame = (uintptr_t) btree_search(&area->sh_info->pagemap, |
103 | frame = (uintptr_t) btree_search(&area->sh_info->pagemap, |
103 | ALIGN_DOWN(addr, PAGE_SIZE) - area->base, &leaf); |
104 | ALIGN_DOWN(addr, PAGE_SIZE) - area->base, &leaf); |
104 | if (!frame) { |
105 | if (!frame) { |
105 | int i; |
106 | int i; |
106 | 107 | ||
107 | /* |
108 | /* |
108 | * Workaround for valid NULL address. |
109 | * Workaround for valid NULL address. |
109 | */ |
110 | */ |
110 | 111 | ||
111 | for (i = 0; i < leaf->keys; i++) { |
112 | for (i = 0; i < leaf->keys; i++) { |
112 | if (leaf->key[i] == |
113 | if (leaf->key[i] == |
113 | ALIGN_DOWN(addr, PAGE_SIZE)) { |
114 | ALIGN_DOWN(addr, PAGE_SIZE)) { |
114 | found = true; |
115 | found = true; |
115 | break; |
116 | break; |
116 | } |
117 | } |
117 | } |
118 | } |
118 | } |
119 | } |
119 | if (frame || found) { |
120 | if (frame || found) { |
120 | frame_reference_add(ADDR2PFN(frame)); |
121 | frame_reference_add(ADDR2PFN(frame)); |
121 | page_mapping_insert(AS, addr, frame, |
122 | page_mapping_insert(AS, addr, frame, |
122 | as_area_get_flags(area)); |
123 | as_area_get_flags(area)); |
123 | if (!used_space_insert(area, |
124 | if (!used_space_insert(area, |
124 | ALIGN_DOWN(addr, PAGE_SIZE), 1)) |
125 | ALIGN_DOWN(addr, PAGE_SIZE), 1)) |
125 | panic("Could not insert used space.\n"); |
126 | panic("Could not insert used space.\n"); |
126 | mutex_unlock(&area->sh_info->lock); |
127 | mutex_unlock(&area->sh_info->lock); |
127 | return AS_PF_OK; |
128 | return AS_PF_OK; |
128 | } |
129 | } |
129 | } |
130 | } |
130 | 131 | ||
131 | /* |
132 | /* |
132 | * The area is either not shared or the pagemap does not contain the |
133 | * The area is either not shared or the pagemap does not contain the |
133 | * mapping. |
134 | * mapping. |
134 | */ |
135 | */ |
135 | 136 | ||
136 | if (ALIGN_DOWN(addr, PAGE_SIZE) + PAGE_SIZE < |
137 | if (ALIGN_DOWN(addr, PAGE_SIZE) + PAGE_SIZE < |
137 | entry->p_vaddr + entry->p_filesz) { |
138 | entry->p_vaddr + entry->p_filesz) { |
138 | /* |
139 | /* |
139 | * Initialized portion of the segment. The memory is backed |
140 | * Initialized portion of the segment. The memory is backed |
140 | * directly by the content of the ELF image. Pages are |
141 | * directly by the content of the ELF image. Pages are |
141 | * only copied if the segment is writable so that there |
142 | * only copied if the segment is writable so that there |
142 | * can be more instantions of the same memory ELF image |
143 | * can be more instantions of the same memory ELF image |
143 | * used at a time. Note that this could be later done |
144 | * used at a time. Note that this could be later done |
144 | * as COW. |
145 | * as COW. |
145 | */ |
146 | */ |
146 | if (entry->p_flags & PF_W) { |
147 | if (entry->p_flags & PF_W) { |
147 | frame = (uintptr_t)frame_alloc(ONE_FRAME, 0); |
148 | frame = (uintptr_t)frame_alloc(ONE_FRAME, 0); |
148 | memcpy((void *) PA2KA(frame), |
149 | memcpy((void *) PA2KA(frame), |
149 | (void *) (base + i * FRAME_SIZE), FRAME_SIZE); |
150 | (void *) (base + i * FRAME_SIZE), FRAME_SIZE); |
- | 151 | dirty = true; |
|
150 | 152 | ||
151 | if (area->sh_info) { |
153 | if (area->sh_info) { |
152 | frame_reference_add(ADDR2PFN(frame)); |
154 | frame_reference_add(ADDR2PFN(frame)); |
153 | btree_insert(&area->sh_info->pagemap, |
155 | btree_insert(&area->sh_info->pagemap, |
154 | ALIGN_DOWN(addr, PAGE_SIZE) - area->base, |
156 | ALIGN_DOWN(addr, PAGE_SIZE) - area->base, |
155 | (void *) frame, leaf); |
157 | (void *) frame, leaf); |
156 | } |
158 | } |
157 | 159 | ||
158 | } else { |
160 | } else { |
159 | frame = KA2PA(base + i*FRAME_SIZE); |
161 | frame = KA2PA(base + i*FRAME_SIZE); |
160 | } |
162 | } |
161 | } else if (ALIGN_DOWN(addr, PAGE_SIZE) >= |
163 | } else if (ALIGN_DOWN(addr, PAGE_SIZE) >= |
162 | ALIGN_UP(entry->p_vaddr + entry->p_filesz, PAGE_SIZE)) { |
164 | ALIGN_UP(entry->p_vaddr + entry->p_filesz, PAGE_SIZE)) { |
163 | /* |
165 | /* |
164 | * This is the uninitialized portion of the segment. |
166 | * This is the uninitialized portion of the segment. |
165 | * It is not physically present in the ELF image. |
167 | * It is not physically present in the ELF image. |
166 | * To resolve the situation, a frame must be allocated |
168 | * To resolve the situation, a frame must be allocated |
167 | * and cleared. |
169 | * and cleared. |
168 | */ |
170 | */ |
169 | frame = (uintptr_t)frame_alloc(ONE_FRAME, 0); |
171 | frame = (uintptr_t)frame_alloc(ONE_FRAME, 0); |
170 | memsetb(PA2KA(frame), FRAME_SIZE, 0); |
172 | memsetb(PA2KA(frame), FRAME_SIZE, 0); |
- | 173 | dirty = true; |
|
171 | 174 | ||
172 | if (area->sh_info) { |
175 | if (area->sh_info) { |
173 | frame_reference_add(ADDR2PFN(frame)); |
176 | frame_reference_add(ADDR2PFN(frame)); |
174 | btree_insert(&area->sh_info->pagemap, |
177 | btree_insert(&area->sh_info->pagemap, |
175 | ALIGN_DOWN(addr, PAGE_SIZE) - area->base, |
178 | ALIGN_DOWN(addr, PAGE_SIZE) - area->base, |
176 | (void *) frame, leaf); |
179 | (void *) frame, leaf); |
177 | } |
180 | } |
178 | 181 | ||
179 | } else { |
182 | } else { |
180 | size_t size; |
183 | size_t size; |
181 | /* |
184 | /* |
182 | * The mixed case. |
185 | * The mixed case. |
183 | * The lower part is backed by the ELF image and |
186 | * The lower part is backed by the ELF image and |
184 | * the upper part is anonymous memory. |
187 | * the upper part is anonymous memory. |
185 | */ |
188 | */ |
186 | size = entry->p_filesz - (i<<PAGE_WIDTH); |
189 | size = entry->p_filesz - (i<<PAGE_WIDTH); |
187 | frame = (uintptr_t)frame_alloc(ONE_FRAME, 0); |
190 | frame = (uintptr_t)frame_alloc(ONE_FRAME, 0); |
188 | memsetb(PA2KA(frame) + size, FRAME_SIZE - size, 0); |
191 | memsetb(PA2KA(frame) + size, FRAME_SIZE - size, 0); |
189 | memcpy((void *) PA2KA(frame), (void *) (base + i * FRAME_SIZE), |
192 | memcpy((void *) PA2KA(frame), (void *) (base + i * FRAME_SIZE), |
190 | size); |
193 | size); |
- | 194 | dirty = true; |
|
191 | 195 | ||
192 | if (area->sh_info) { |
196 | if (area->sh_info) { |
193 | frame_reference_add(ADDR2PFN(frame)); |
197 | frame_reference_add(ADDR2PFN(frame)); |
194 | btree_insert(&area->sh_info->pagemap, |
198 | btree_insert(&area->sh_info->pagemap, |
195 | ALIGN_DOWN(addr, PAGE_SIZE) - area->base, |
199 | ALIGN_DOWN(addr, PAGE_SIZE) - area->base, |
196 | (void *) frame, leaf); |
200 | (void *) frame, leaf); |
197 | } |
201 | } |
198 | 202 | ||
199 | } |
203 | } |
200 | 204 | ||
201 | if (area->sh_info) |
205 | if (area->sh_info) |
202 | mutex_unlock(&area->sh_info->lock); |
206 | mutex_unlock(&area->sh_info->lock); |
203 | 207 | ||
204 | page_mapping_insert(AS, addr, frame, as_area_get_flags(area)); |
208 | page_mapping_insert(AS, addr, frame, as_area_get_flags(area)); |
205 | if (!used_space_insert(area, ALIGN_DOWN(addr, PAGE_SIZE), 1)) |
209 | if (!used_space_insert(area, ALIGN_DOWN(addr, PAGE_SIZE), 1)) |
206 | panic("Could not insert used space.\n"); |
210 | panic("Could not insert used space.\n"); |
207 | 211 | ||
- | 212 | #ifdef CONFIG_VIRT_IDX_DCACHE |
|
- | 213 | if (dirty && PAGE_COLOR(PA2KA(frame)) != PAGE_COLOR(addr)) { |
|
- | 214 | /* |
|
- | 215 | * By writing to the frame using kernel virtual address, |
|
- | 216 | * we have created an illegal virtual alias. We now have to |
|
- | 217 | * invalidate cachelines belonging to addr on all processors |
|
- | 218 | * so that they will be reloaded with the new content on next |
|
- | 219 | * read. |
|
- | 220 | */ |
|
- | 221 | dcache_flush_frame(addr, frame); |
|
- | 222 | dcache_shootdown_start(DCACHE_INVL_FRAME, PAGE_COLOR(addr), frame); |
|
- | 223 | dcache_shootdown_finalize(); |
|
- | 224 | } |
|
- | 225 | #endif |
|
- | 226 | ||
208 | return AS_PF_OK; |
227 | return AS_PF_OK; |
209 | } |
228 | } |
210 | 229 | ||
211 | /** Free a frame that is backed by the ELF backend. |
230 | /** Free a frame that is backed by the ELF backend. |
212 | * |
231 | * |
213 | * The address space area and page tables must be already locked. |
232 | * The address space area and page tables must be already locked. |
214 | * |
233 | * |
215 | * @param area Pointer to the address space area. |
234 | * @param area Pointer to the address space area. |
216 | * @param page Page that is mapped to frame. Must be aligned to PAGE_SIZE. |
235 | * @param page Page that is mapped to frame. Must be aligned to PAGE_SIZE. |
217 | * @param frame Frame to be released. |
236 | * @param frame Frame to be released. |
218 | * |
237 | * |
219 | */ |
238 | */ |
220 | void elf_frame_free(as_area_t *area, uintptr_t page, uintptr_t frame) |
239 | void elf_frame_free(as_area_t *area, uintptr_t page, uintptr_t frame) |
221 | { |
240 | { |
222 | elf_header_t *elf = area->backend_data.elf; |
241 | elf_header_t *elf = area->backend_data.elf; |
223 | elf_segment_header_t *entry = area->backend_data.segment; |
242 | elf_segment_header_t *entry = area->backend_data.segment; |
224 | uintptr_t base; |
243 | uintptr_t base; |
225 | index_t i; |
244 | index_t i; |
226 | 245 | ||
227 | ASSERT((page >= entry->p_vaddr) && |
246 | ASSERT((page >= entry->p_vaddr) && |
228 | (page < entry->p_vaddr + entry->p_memsz)); |
247 | (page < entry->p_vaddr + entry->p_memsz)); |
229 | i = (page - entry->p_vaddr) >> PAGE_WIDTH; |
248 | i = (page - entry->p_vaddr) >> PAGE_WIDTH; |
230 | base = (uintptr_t) (((void *) elf) + entry->p_offset); |
249 | base = (uintptr_t) (((void *) elf) + entry->p_offset); |
231 | ASSERT(ALIGN_UP(base, FRAME_SIZE) == base); |
250 | ASSERT(ALIGN_UP(base, FRAME_SIZE) == base); |
232 | 251 | ||
233 | if (page + PAGE_SIZE < |
252 | if (page + PAGE_SIZE < |
234 | ALIGN_UP(entry->p_vaddr + entry->p_filesz, PAGE_SIZE)) { |
253 | ALIGN_UP(entry->p_vaddr + entry->p_filesz, PAGE_SIZE)) { |
235 | if (entry->p_flags & PF_W) { |
254 | if (entry->p_flags & PF_W) { |
236 | /* |
255 | /* |
237 | * Free the frame with the copy of writable segment |
256 | * Free the frame with the copy of writable segment |
238 | * data. |
257 | * data. |
239 | */ |
258 | */ |
240 | frame_free(frame); |
259 | frame_free(frame); |
241 | #ifdef CONFIG_VIRT_IDX_DCACHE |
- | |
242 | dcache_flush_frame(page, frame); |
- | |
243 | #endif |
- | |
244 | } |
260 | } |
245 | } else { |
261 | } else { |
246 | /* |
262 | /* |
247 | * The frame is either anonymous memory or the mixed case (i.e. |
263 | * The frame is either anonymous memory or the mixed case (i.e. |
248 | * lower part is backed by the ELF image and the upper is |
264 | * lower part is backed by the ELF image and the upper is |
249 | * anonymous). In any case, a frame needs to be freed. |
265 | * anonymous). In any case, a frame needs to be freed. |
250 | */ |
266 | */ |
251 | frame_free(frame); |
267 | frame_free(frame); |
252 | #ifdef CONFIG_VIRT_IDX_DCACHE |
- | |
253 | dcache_flush_frame(page, frame); |
- | |
254 | #endif |
- | |
255 | } |
268 | } |
256 | } |
269 | } |
257 | 270 | ||
258 | /** Share ELF image backed address space area. |
271 | /** Share ELF image backed address space area. |
259 | * |
272 | * |
260 | * If the area is writable, then all mapped pages are duplicated in the pagemap. |
273 | * If the area is writable, then all mapped pages are duplicated in the pagemap. |
261 | * Otherwise only portions of the area that are not backed by the ELF image |
274 | * Otherwise only portions of the area that are not backed by the ELF image |
262 | * are put into the pagemap. |
275 | * are put into the pagemap. |
263 | * |
276 | * |
264 | * The address space and address space area must be locked prior to the call. |
277 | * The address space and address space area must be locked prior to the call. |
265 | * |
278 | * |
266 | * @param area Address space area. |
279 | * @param area Address space area. |
267 | */ |
280 | */ |
268 | void elf_share(as_area_t *area) |
281 | void elf_share(as_area_t *area) |
269 | { |
282 | { |
270 | elf_segment_header_t *entry = area->backend_data.segment; |
283 | elf_segment_header_t *entry = area->backend_data.segment; |
271 | link_t *cur; |
284 | link_t *cur; |
272 | btree_node_t *leaf, *node; |
285 | btree_node_t *leaf, *node; |
273 | uintptr_t start_anon = entry->p_vaddr + entry->p_filesz; |
286 | uintptr_t start_anon = entry->p_vaddr + entry->p_filesz; |
274 | 287 | ||
275 | /* |
288 | /* |
276 | * Find the node in which to start linear search. |
289 | * Find the node in which to start linear search. |
277 | */ |
290 | */ |
278 | if (area->flags & AS_AREA_WRITE) { |
291 | if (area->flags & AS_AREA_WRITE) { |
279 | node = list_get_instance(area->used_space.leaf_head.next, |
292 | node = list_get_instance(area->used_space.leaf_head.next, |
280 | btree_node_t, leaf_link); |
293 | btree_node_t, leaf_link); |
281 | } else { |
294 | } else { |
282 | (void) btree_search(&area->sh_info->pagemap, start_anon, &leaf); |
295 | (void) btree_search(&area->sh_info->pagemap, start_anon, &leaf); |
283 | node = btree_leaf_node_left_neighbour(&area->sh_info->pagemap, |
296 | node = btree_leaf_node_left_neighbour(&area->sh_info->pagemap, |
284 | leaf); |
297 | leaf); |
285 | if (!node) |
298 | if (!node) |
286 | node = leaf; |
299 | node = leaf; |
287 | } |
300 | } |
288 | 301 | ||
289 | /* |
302 | /* |
290 | * Copy used anonymous portions of the area to sh_info's page map. |
303 | * Copy used anonymous portions of the area to sh_info's page map. |
291 | */ |
304 | */ |
292 | mutex_lock(&area->sh_info->lock); |
305 | mutex_lock(&area->sh_info->lock); |
293 | for (cur = &node->leaf_link; cur != &area->used_space.leaf_head; |
306 | for (cur = &node->leaf_link; cur != &area->used_space.leaf_head; |
294 | cur = cur->next) { |
307 | cur = cur->next) { |
295 | int i; |
308 | int i; |
296 | 309 | ||
297 | node = list_get_instance(cur, btree_node_t, leaf_link); |
310 | node = list_get_instance(cur, btree_node_t, leaf_link); |
298 | 311 | ||
299 | for (i = 0; i < node->keys; i++) { |
312 | for (i = 0; i < node->keys; i++) { |
300 | uintptr_t base = node->key[i]; |
313 | uintptr_t base = node->key[i]; |
301 | count_t count = (count_t) node->value[i]; |
314 | count_t count = (count_t) node->value[i]; |
302 | int j; |
315 | int j; |
303 | 316 | ||
304 | /* |
317 | /* |
305 | * Skip read-only areas of used space that are backed |
318 | * Skip read-only areas of used space that are backed |
306 | * by the ELF image. |
319 | * by the ELF image. |
307 | */ |
320 | */ |
308 | if (!(area->flags & AS_AREA_WRITE)) |
321 | if (!(area->flags & AS_AREA_WRITE)) |
309 | if (base + count*PAGE_SIZE <= start_anon) |
322 | if (base + count*PAGE_SIZE <= start_anon) |
310 | continue; |
323 | continue; |
311 | 324 | ||
312 | for (j = 0; j < count; j++) { |
325 | for (j = 0; j < count; j++) { |
313 | pte_t *pte; |
326 | pte_t *pte; |
314 | 327 | ||
315 | /* |
328 | /* |
316 | * Skip read-only pages that are backed by the |
329 | * Skip read-only pages that are backed by the |
317 | * ELF image. |
330 | * ELF image. |
318 | */ |
331 | */ |
319 | if (!(area->flags & AS_AREA_WRITE)) |
332 | if (!(area->flags & AS_AREA_WRITE)) |
320 | if (base + (j + 1) * PAGE_SIZE <= |
333 | if (base + (j + 1) * PAGE_SIZE <= |
321 | start_anon) |
334 | start_anon) |
322 | continue; |
335 | continue; |
323 | 336 | ||
324 | page_table_lock(area->as, false); |
337 | page_table_lock(area->as, false); |
325 | pte = page_mapping_find(area->as, |
338 | pte = page_mapping_find(area->as, |
326 | base + j * PAGE_SIZE); |
339 | base + j * PAGE_SIZE); |
327 | ASSERT(pte && PTE_VALID(pte) && |
340 | ASSERT(pte && PTE_VALID(pte) && |
328 | PTE_PRESENT(pte)); |
341 | PTE_PRESENT(pte)); |
329 | btree_insert(&area->sh_info->pagemap, |
342 | btree_insert(&area->sh_info->pagemap, |
330 | (base + j * PAGE_SIZE) - area->base, |
343 | (base + j * PAGE_SIZE) - area->base, |
331 | (void *) PTE_GET_FRAME(pte), NULL); |
344 | (void *) PTE_GET_FRAME(pte), NULL); |
332 | page_table_unlock(area->as, false); |
345 | page_table_unlock(area->as, false); |
333 | 346 | ||
334 | pfn_t pfn = ADDR2PFN(PTE_GET_FRAME(pte)); |
347 | pfn_t pfn = ADDR2PFN(PTE_GET_FRAME(pte)); |
335 | frame_reference_add(pfn); |
348 | frame_reference_add(pfn); |
336 | } |
349 | } |
337 | 350 | ||
338 | } |
351 | } |
339 | } |
352 | } |
340 | mutex_unlock(&area->sh_info->lock); |
353 | mutex_unlock(&area->sh_info->lock); |
341 | } |
354 | } |
342 | 355 | ||
343 | /** @} |
356 | /** @} |
344 | */ |
357 | */ |
345 | 358 | ||
346 | 359 |