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