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