source: mainline/generic/src/mm/backend_elf.c@ 9f16cb0

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

Remove left over piece of code for increasing reference count in ELF backend.

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