source: mainline/kernel/generic/src/mm/backend_elf.c@ 3ac69647

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 3ac69647 was 3ac69647, checked in by Jakub Jermar <jakub@…>, 14 years ago

Factor out common code to elf_nonanon_pages_get().

  • Property mode set to 100644
File size: 11.3 KB
Line 
1/*
2 * Copyright (c) 2006 Jakub Jermar
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
9 * - Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * - Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
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
15 * derived from this software without specific prior written permission.
16 *
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
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
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
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
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29/** @addtogroup genericmm
30 * @{
31 */
32
33/**
34 * @file
35 * @brief Backend for address space areas backed by an ELF image.
36 */
37
38#include <lib/elf.h>
39#include <debug.h>
40#include <typedefs.h>
41#include <mm/as.h>
42#include <mm/frame.h>
43#include <mm/slab.h>
44#include <mm/page.h>
45#include <mm/reserve.h>
46#include <genarch/mm/page_pt.h>
47#include <genarch/mm/page_ht.h>
48#include <align.h>
49#include <memstr.h>
50#include <macros.h>
51#include <arch.h>
52#include <arch/barrier.h>
53
54static bool elf_create(as_area_t *);
55static bool elf_resize(as_area_t *, size_t);
56static void elf_share(as_area_t *);
57static void elf_destroy(as_area_t *);
58
59static int elf_page_fault(as_area_t *, uintptr_t, pf_access_t);
60static void elf_frame_free(as_area_t *, uintptr_t, uintptr_t);
61
62mem_backend_t elf_backend = {
63 .create = elf_create,
64 .resize = elf_resize,
65 .share = elf_share,
66 .destroy = elf_destroy,
67
68 .page_fault = elf_page_fault,
69 .frame_free = elf_frame_free,
70};
71
72static size_t elf_nonanon_pages_get(as_area_t *area)
73{
74 elf_segment_header_t *entry = area->backend_data.segment;
75 size_t nonanon_pages = ALIGN_DOWN(entry->p_filesz, PAGE_SIZE);
76
77 if (entry->p_flags & PF_W)
78 return 0;
79
80 return nonanon_pages;
81}
82
83bool elf_create(as_area_t *area)
84{
85 size_t nonanon_pages = elf_nonanon_pages_get(area);
86
87 if (area->pages <= nonanon_pages)
88 return true;
89
90 return reserve_try_alloc(area->pages - nonanon_pages);
91}
92
93bool elf_resize(as_area_t *area, size_t new_pages)
94{
95 size_t nonanon_pages = elf_nonanon_pages_get(area);
96
97 if (new_pages > area->pages) {
98 /* The area is growing. */
99 if (area->pages >= nonanon_pages)
100 return reserve_try_alloc(new_pages - area->pages);
101 else if (new_pages > nonanon_pages)
102 return reserve_try_alloc(new_pages - nonanon_pages);
103 } else if (new_pages < area->pages) {
104 /* The area is shrinking. */
105 if (new_pages >= nonanon_pages)
106 reserve_free(area->pages - new_pages);
107 else if (area->pages > nonanon_pages)
108 reserve_free(nonanon_pages - new_pages);
109 }
110
111 return true;
112}
113
114/** Share ELF image backed address space area.
115 *
116 * If the area is writable, then all mapped pages are duplicated in the pagemap.
117 * Otherwise only portions of the area that are not backed by the ELF image
118 * are put into the pagemap.
119 *
120 * @param area Address space area.
121 */
122void elf_share(as_area_t *area)
123{
124 elf_segment_header_t *entry = area->backend_data.segment;
125 link_t *cur;
126 btree_node_t *leaf, *node;
127 uintptr_t start_anon = entry->p_vaddr + entry->p_filesz;
128
129 ASSERT(mutex_locked(&area->as->lock));
130 ASSERT(mutex_locked(&area->lock));
131
132 /*
133 * Find the node in which to start linear search.
134 */
135 if (area->flags & AS_AREA_WRITE) {
136 node = list_get_instance(area->used_space.leaf_head.next,
137 btree_node_t, leaf_link);
138 } else {
139 (void) btree_search(&area->sh_info->pagemap, start_anon, &leaf);
140 node = btree_leaf_node_left_neighbour(&area->sh_info->pagemap,
141 leaf);
142 if (!node)
143 node = leaf;
144 }
145
146 /*
147 * Copy used anonymous portions of the area to sh_info's page map.
148 */
149 mutex_lock(&area->sh_info->lock);
150 for (cur = &node->leaf_link; cur != &area->used_space.leaf_head;
151 cur = cur->next) {
152 unsigned int i;
153
154 node = list_get_instance(cur, btree_node_t, leaf_link);
155
156 for (i = 0; i < node->keys; i++) {
157 uintptr_t base = node->key[i];
158 size_t count = (size_t) node->value[i];
159 unsigned int j;
160
161 /*
162 * Skip read-only areas of used space that are backed
163 * by the ELF image.
164 */
165 if (!(area->flags & AS_AREA_WRITE))
166 if (base >= entry->p_vaddr &&
167 base + count * PAGE_SIZE <= start_anon)
168 continue;
169
170 for (j = 0; j < count; j++) {
171 pte_t *pte;
172
173 /*
174 * Skip read-only pages that are backed by the
175 * ELF image.
176 */
177 if (!(area->flags & AS_AREA_WRITE))
178 if (base >= entry->p_vaddr &&
179 base + (j + 1) * PAGE_SIZE <=
180 start_anon)
181 continue;
182
183 page_table_lock(area->as, false);
184 pte = page_mapping_find(area->as,
185 base + j * PAGE_SIZE);
186 ASSERT(pte && PTE_VALID(pte) &&
187 PTE_PRESENT(pte));
188 btree_insert(&area->sh_info->pagemap,
189 (base + j * PAGE_SIZE) - area->base,
190 (void *) PTE_GET_FRAME(pte), NULL);
191 page_table_unlock(area->as, false);
192
193 pfn_t pfn = ADDR2PFN(PTE_GET_FRAME(pte));
194 frame_reference_add(pfn);
195 }
196
197 }
198 }
199 mutex_unlock(&area->sh_info->lock);
200}
201
202void elf_destroy(as_area_t *area)
203{
204 size_t nonanon_pages = elf_nonanon_pages_get(area);
205
206 if (area->pages > nonanon_pages)
207 reserve_free(area->pages - nonanon_pages);
208}
209
210/** Service a page fault in the ELF backend address space area.
211 *
212 * The address space area and page tables must be already locked.
213 *
214 * @param area Pointer to the address space area.
215 * @param addr Faulting virtual address.
216 * @param access Access mode that caused the fault (i.e.
217 * read/write/exec).
218 *
219 * @return AS_PF_FAULT on failure (i.e. page fault) or AS_PF_OK
220 * on success (i.e. serviced).
221 */
222int elf_page_fault(as_area_t *area, uintptr_t addr, pf_access_t access)
223{
224 elf_header_t *elf = area->backend_data.elf;
225 elf_segment_header_t *entry = area->backend_data.segment;
226 btree_node_t *leaf;
227 uintptr_t base, frame, page, start_anon;
228 size_t i;
229 bool dirty = false;
230
231 ASSERT(page_table_locked(AS));
232 ASSERT(mutex_locked(&area->lock));
233
234 if (!as_area_check_access(area, access))
235 return AS_PF_FAULT;
236
237 if (addr < ALIGN_DOWN(entry->p_vaddr, PAGE_SIZE))
238 return AS_PF_FAULT;
239
240 if (addr >= entry->p_vaddr + entry->p_memsz)
241 return AS_PF_FAULT;
242
243 i = (addr - ALIGN_DOWN(entry->p_vaddr, PAGE_SIZE)) >> PAGE_WIDTH;
244 base = (uintptr_t)
245 (((void *) elf) + ALIGN_DOWN(entry->p_offset, PAGE_SIZE));
246
247 /* Virtual address of faulting page*/
248 page = ALIGN_DOWN(addr, PAGE_SIZE);
249
250 /* Virtual address of the end of initialized part of segment */
251 start_anon = entry->p_vaddr + entry->p_filesz;
252
253 if (area->sh_info) {
254 bool found = false;
255
256 /*
257 * The address space area is shared.
258 */
259
260 mutex_lock(&area->sh_info->lock);
261 frame = (uintptr_t) btree_search(&area->sh_info->pagemap,
262 page - area->base, &leaf);
263 if (!frame) {
264 unsigned int i;
265
266 /*
267 * Workaround for valid NULL address.
268 */
269
270 for (i = 0; i < leaf->keys; i++) {
271 if (leaf->key[i] == page - area->base) {
272 found = true;
273 break;
274 }
275 }
276 }
277 if (frame || found) {
278 frame_reference_add(ADDR2PFN(frame));
279 page_mapping_insert(AS, addr, frame,
280 as_area_get_flags(area));
281 if (!used_space_insert(area, page, 1))
282 panic("Cannot insert used space.");
283 mutex_unlock(&area->sh_info->lock);
284 return AS_PF_OK;
285 }
286 }
287
288 /*
289 * The area is either not shared or the pagemap does not contain the
290 * mapping.
291 */
292 if (page >= entry->p_vaddr && page + PAGE_SIZE <= start_anon) {
293 /*
294 * Initialized portion of the segment. The memory is backed
295 * directly by the content of the ELF image. Pages are
296 * only copied if the segment is writable so that there
297 * can be more instantions of the same memory ELF image
298 * used at a time. Note that this could be later done
299 * as COW.
300 */
301 if (entry->p_flags & PF_W) {
302 frame = (uintptr_t)frame_alloc_noreserve(ONE_FRAME, 0);
303 memcpy((void *) PA2KA(frame),
304 (void *) (base + i * FRAME_SIZE), FRAME_SIZE);
305 if (entry->p_flags & PF_X) {
306 smc_coherence_block((void *) PA2KA(frame),
307 FRAME_SIZE);
308 }
309 dirty = true;
310 } else {
311 frame = KA2PA(base + i * FRAME_SIZE);
312 }
313 } else if (page >= start_anon) {
314 /*
315 * This is the uninitialized portion of the segment.
316 * It is not physically present in the ELF image.
317 * To resolve the situation, a frame must be allocated
318 * and cleared.
319 */
320 frame = (uintptr_t) frame_alloc_noreserve(ONE_FRAME, 0);
321 memsetb((void *) PA2KA(frame), FRAME_SIZE, 0);
322 dirty = true;
323 } else {
324 size_t pad_lo, pad_hi;
325 /*
326 * The mixed case.
327 *
328 * The middle part is backed by the ELF image and
329 * the lower and upper parts are anonymous memory.
330 * (The segment can be and often is shorter than 1 page).
331 */
332 if (page < entry->p_vaddr)
333 pad_lo = entry->p_vaddr - page;
334 else
335 pad_lo = 0;
336
337 if (start_anon < page + PAGE_SIZE)
338 pad_hi = page + PAGE_SIZE - start_anon;
339 else
340 pad_hi = 0;
341
342 frame = (uintptr_t) frame_alloc_noreserve(ONE_FRAME, 0);
343 memcpy((void *) (PA2KA(frame) + pad_lo),
344 (void *) (base + i * FRAME_SIZE + pad_lo),
345 FRAME_SIZE - pad_lo - pad_hi);
346 if (entry->p_flags & PF_X) {
347 smc_coherence_block((void *) (PA2KA(frame) + pad_lo),
348 FRAME_SIZE - pad_lo - pad_hi);
349 }
350 memsetb((void *) PA2KA(frame), pad_lo, 0);
351 memsetb((void *) (PA2KA(frame) + FRAME_SIZE - pad_hi), pad_hi,
352 0);
353 dirty = true;
354 }
355
356 if (dirty && area->sh_info) {
357 frame_reference_add(ADDR2PFN(frame));
358 btree_insert(&area->sh_info->pagemap, page - area->base,
359 (void *) frame, leaf);
360 }
361
362 if (area->sh_info)
363 mutex_unlock(&area->sh_info->lock);
364
365 page_mapping_insert(AS, addr, frame, as_area_get_flags(area));
366 if (!used_space_insert(area, page, 1))
367 panic("Cannot insert used space.");
368
369 return AS_PF_OK;
370}
371
372/** Free a frame that is backed by the ELF backend.
373 *
374 * The address space area and page tables must be already locked.
375 *
376 * @param area Pointer to the address space area.
377 * @param page Page that is mapped to frame. Must be aligned to
378 * PAGE_SIZE.
379 * @param frame Frame to be released.
380 *
381 */
382void elf_frame_free(as_area_t *area, uintptr_t page, uintptr_t frame)
383{
384 elf_segment_header_t *entry = area->backend_data.segment;
385 uintptr_t start_anon;
386
387 ASSERT(page_table_locked(area->as));
388 ASSERT(mutex_locked(&area->lock));
389
390 ASSERT(page >= ALIGN_DOWN(entry->p_vaddr, PAGE_SIZE));
391 ASSERT(page < entry->p_vaddr + entry->p_memsz);
392
393 start_anon = entry->p_vaddr + entry->p_filesz;
394
395 if (page >= entry->p_vaddr && page + PAGE_SIZE <= start_anon) {
396 if (entry->p_flags & PF_W) {
397 /*
398 * Free the frame with the copy of writable segment
399 * data.
400 */
401 frame_free_noreserve(frame);
402 }
403 } else {
404 /*
405 * The frame is either anonymous memory or the mixed case (i.e.
406 * lower part is backed by the ELF image and the upper is
407 * anonymous). In any case, a frame needs to be freed.
408 */
409 frame_free_noreserve(frame);
410 }
411}
412
413/** @}
414 */
Note: See TracBrowser for help on using the repository browser.