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 |
|
---|
54 | static bool elf_create(as_area_t *);
|
---|
55 | static bool elf_resize(as_area_t *, size_t);
|
---|
56 | static void elf_share(as_area_t *);
|
---|
57 | static void elf_destroy(as_area_t *);
|
---|
58 |
|
---|
59 | static int elf_page_fault(as_area_t *area, uintptr_t addr, pf_access_t access);
|
---|
60 | static void elf_frame_free(as_area_t *area, uintptr_t page, uintptr_t frame);
|
---|
61 |
|
---|
62 | mem_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 |
|
---|
72 | bool elf_create(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 | /**
|
---|
78 | * @todo:
|
---|
79 | * Reserve only how much is necessary for anonymous pages plus the
|
---|
80 | * supporting structures allocated during the page fault.
|
---|
81 | */
|
---|
82 |
|
---|
83 | if (area->pages <= nonanon_pages)
|
---|
84 | return true;
|
---|
85 |
|
---|
86 | return reserve_try_alloc(area->pages - nonanon_pages);
|
---|
87 | }
|
---|
88 |
|
---|
89 | bool elf_resize(as_area_t *area, size_t new_pages)
|
---|
90 | {
|
---|
91 | elf_segment_header_t *entry = area->backend_data.segment;
|
---|
92 | size_t nonanon_pages = ALIGN_DOWN(entry->p_filesz, PAGE_SIZE);
|
---|
93 |
|
---|
94 | if (new_pages > area->pages) {
|
---|
95 | /* The area is growing. */
|
---|
96 | if (area->pages >= nonanon_pages)
|
---|
97 | return reserve_try_alloc(new_pages - area->pages);
|
---|
98 | else if (new_pages > nonanon_pages)
|
---|
99 | return reserve_try_alloc(new_pages - nonanon_pages);
|
---|
100 | } else if (new_pages < area->pages) {
|
---|
101 | /* The area is shrinking. */
|
---|
102 | if (new_pages >= nonanon_pages)
|
---|
103 | reserve_free(area->pages - new_pages);
|
---|
104 | else if (area->pages > nonanon_pages)
|
---|
105 | reserve_free(nonanon_pages - new_pages);
|
---|
106 | }
|
---|
107 |
|
---|
108 | return true;
|
---|
109 | }
|
---|
110 |
|
---|
111 | /** Share ELF image backed address space area.
|
---|
112 | *
|
---|
113 | * If the area is writable, then all mapped pages are duplicated in the pagemap.
|
---|
114 | * Otherwise only portions of the area that are not backed by the ELF image
|
---|
115 | * are put into the pagemap.
|
---|
116 | *
|
---|
117 | * @param area Address space area.
|
---|
118 | */
|
---|
119 | void elf_share(as_area_t *area)
|
---|
120 | {
|
---|
121 | elf_segment_header_t *entry = area->backend_data.segment;
|
---|
122 | link_t *cur;
|
---|
123 | btree_node_t *leaf, *node;
|
---|
124 | uintptr_t start_anon = entry->p_vaddr + entry->p_filesz;
|
---|
125 |
|
---|
126 | ASSERT(mutex_locked(&area->as->lock));
|
---|
127 | ASSERT(mutex_locked(&area->lock));
|
---|
128 |
|
---|
129 | /*
|
---|
130 | * Find the node in which to start linear search.
|
---|
131 | */
|
---|
132 | if (area->flags & AS_AREA_WRITE) {
|
---|
133 | node = list_get_instance(area->used_space.leaf_head.next,
|
---|
134 | btree_node_t, leaf_link);
|
---|
135 | } else {
|
---|
136 | (void) btree_search(&area->sh_info->pagemap, start_anon, &leaf);
|
---|
137 | node = btree_leaf_node_left_neighbour(&area->sh_info->pagemap,
|
---|
138 | leaf);
|
---|
139 | if (!node)
|
---|
140 | node = leaf;
|
---|
141 | }
|
---|
142 |
|
---|
143 | /*
|
---|
144 | * Copy used anonymous portions of the area to sh_info's page map.
|
---|
145 | */
|
---|
146 | mutex_lock(&area->sh_info->lock);
|
---|
147 | for (cur = &node->leaf_link; cur != &area->used_space.leaf_head;
|
---|
148 | cur = cur->next) {
|
---|
149 | unsigned int i;
|
---|
150 |
|
---|
151 | node = list_get_instance(cur, btree_node_t, leaf_link);
|
---|
152 |
|
---|
153 | for (i = 0; i < node->keys; i++) {
|
---|
154 | uintptr_t base = node->key[i];
|
---|
155 | size_t count = (size_t) node->value[i];
|
---|
156 | unsigned int j;
|
---|
157 |
|
---|
158 | /*
|
---|
159 | * Skip read-only areas of used space that are backed
|
---|
160 | * by the ELF image.
|
---|
161 | */
|
---|
162 | if (!(area->flags & AS_AREA_WRITE))
|
---|
163 | if (base >= entry->p_vaddr &&
|
---|
164 | base + count * PAGE_SIZE <= start_anon)
|
---|
165 | continue;
|
---|
166 |
|
---|
167 | for (j = 0; j < count; j++) {
|
---|
168 | pte_t *pte;
|
---|
169 |
|
---|
170 | /*
|
---|
171 | * Skip read-only pages that are backed by the
|
---|
172 | * ELF image.
|
---|
173 | */
|
---|
174 | if (!(area->flags & AS_AREA_WRITE))
|
---|
175 | if (base >= entry->p_vaddr &&
|
---|
176 | base + (j + 1) * PAGE_SIZE <=
|
---|
177 | start_anon)
|
---|
178 | continue;
|
---|
179 |
|
---|
180 | page_table_lock(area->as, false);
|
---|
181 | pte = page_mapping_find(area->as,
|
---|
182 | base + j * PAGE_SIZE);
|
---|
183 | ASSERT(pte && PTE_VALID(pte) &&
|
---|
184 | PTE_PRESENT(pte));
|
---|
185 | btree_insert(&area->sh_info->pagemap,
|
---|
186 | (base + j * PAGE_SIZE) - area->base,
|
---|
187 | (void *) PTE_GET_FRAME(pte), NULL);
|
---|
188 | page_table_unlock(area->as, false);
|
---|
189 |
|
---|
190 | pfn_t pfn = ADDR2PFN(PTE_GET_FRAME(pte));
|
---|
191 | frame_reference_add(pfn);
|
---|
192 | }
|
---|
193 |
|
---|
194 | }
|
---|
195 | }
|
---|
196 | mutex_unlock(&area->sh_info->lock);
|
---|
197 | }
|
---|
198 |
|
---|
199 | void elf_destroy(as_area_t *area)
|
---|
200 | {
|
---|
201 | elf_segment_header_t *entry = area->backend_data.segment;
|
---|
202 | size_t nonanon_pages = ALIGN_DOWN(entry->p_filesz, PAGE_SIZE);
|
---|
203 |
|
---|
204 | if (area->pages > nonanon_pages)
|
---|
205 | reserve_free(area->pages - nonanon_pages);
|
---|
206 | }
|
---|
207 |
|
---|
208 | /** Service a page fault in the ELF backend address space area.
|
---|
209 | *
|
---|
210 | * The address space area and page tables must be already locked.
|
---|
211 | *
|
---|
212 | * @param area Pointer to the address space area.
|
---|
213 | * @param addr Faulting virtual address.
|
---|
214 | * @param access Access mode that caused the fault (i.e.
|
---|
215 | * read/write/exec).
|
---|
216 | *
|
---|
217 | * @return AS_PF_FAULT on failure (i.e. page fault) or AS_PF_OK
|
---|
218 | * on success (i.e. serviced).
|
---|
219 | */
|
---|
220 | int elf_page_fault(as_area_t *area, uintptr_t addr, pf_access_t access)
|
---|
221 | {
|
---|
222 | elf_header_t *elf = area->backend_data.elf;
|
---|
223 | elf_segment_header_t *entry = area->backend_data.segment;
|
---|
224 | btree_node_t *leaf;
|
---|
225 | uintptr_t base, frame, page, start_anon;
|
---|
226 | size_t i;
|
---|
227 | bool dirty = false;
|
---|
228 |
|
---|
229 | ASSERT(page_table_locked(AS));
|
---|
230 | ASSERT(mutex_locked(&area->lock));
|
---|
231 |
|
---|
232 | if (!as_area_check_access(area, access))
|
---|
233 | return AS_PF_FAULT;
|
---|
234 |
|
---|
235 | if (addr < ALIGN_DOWN(entry->p_vaddr, PAGE_SIZE))
|
---|
236 | return AS_PF_FAULT;
|
---|
237 |
|
---|
238 | if (addr >= entry->p_vaddr + entry->p_memsz)
|
---|
239 | return AS_PF_FAULT;
|
---|
240 |
|
---|
241 | i = (addr - ALIGN_DOWN(entry->p_vaddr, PAGE_SIZE)) >> PAGE_WIDTH;
|
---|
242 | base = (uintptr_t)
|
---|
243 | (((void *) elf) + ALIGN_DOWN(entry->p_offset, PAGE_SIZE));
|
---|
244 |
|
---|
245 | /* Virtual address of faulting page*/
|
---|
246 | page = ALIGN_DOWN(addr, PAGE_SIZE);
|
---|
247 |
|
---|
248 | /* Virtual address of the end of initialized part of segment */
|
---|
249 | start_anon = entry->p_vaddr + entry->p_filesz;
|
---|
250 |
|
---|
251 | if (area->sh_info) {
|
---|
252 | bool found = false;
|
---|
253 |
|
---|
254 | /*
|
---|
255 | * The address space area is shared.
|
---|
256 | */
|
---|
257 |
|
---|
258 | mutex_lock(&area->sh_info->lock);
|
---|
259 | frame = (uintptr_t) btree_search(&area->sh_info->pagemap,
|
---|
260 | page - area->base, &leaf);
|
---|
261 | if (!frame) {
|
---|
262 | unsigned int i;
|
---|
263 |
|
---|
264 | /*
|
---|
265 | * Workaround for valid NULL address.
|
---|
266 | */
|
---|
267 |
|
---|
268 | for (i = 0; i < leaf->keys; i++) {
|
---|
269 | if (leaf->key[i] == page - area->base) {
|
---|
270 | found = true;
|
---|
271 | break;
|
---|
272 | }
|
---|
273 | }
|
---|
274 | }
|
---|
275 | if (frame || found) {
|
---|
276 | frame_reference_add(ADDR2PFN(frame));
|
---|
277 | page_mapping_insert(AS, addr, frame,
|
---|
278 | as_area_get_flags(area));
|
---|
279 | if (!used_space_insert(area, page, 1))
|
---|
280 | panic("Cannot insert used space.");
|
---|
281 | mutex_unlock(&area->sh_info->lock);
|
---|
282 | return AS_PF_OK;
|
---|
283 | }
|
---|
284 | }
|
---|
285 |
|
---|
286 | /*
|
---|
287 | * The area is either not shared or the pagemap does not contain the
|
---|
288 | * mapping.
|
---|
289 | */
|
---|
290 | if (page >= entry->p_vaddr && page + PAGE_SIZE <= start_anon) {
|
---|
291 | /*
|
---|
292 | * Initialized portion of the segment. The memory is backed
|
---|
293 | * directly by the content of the ELF image. Pages are
|
---|
294 | * only copied if the segment is writable so that there
|
---|
295 | * can be more instantions of the same memory ELF image
|
---|
296 | * used at a time. Note that this could be later done
|
---|
297 | * as COW.
|
---|
298 | */
|
---|
299 | if (entry->p_flags & PF_W) {
|
---|
300 | frame = (uintptr_t)frame_alloc_noreserve(ONE_FRAME, 0);
|
---|
301 | memcpy((void *) PA2KA(frame),
|
---|
302 | (void *) (base + i * FRAME_SIZE), FRAME_SIZE);
|
---|
303 | if (entry->p_flags & PF_X) {
|
---|
304 | smc_coherence_block((void *) PA2KA(frame),
|
---|
305 | FRAME_SIZE);
|
---|
306 | }
|
---|
307 | dirty = true;
|
---|
308 | } else {
|
---|
309 | frame = KA2PA(base + i * FRAME_SIZE);
|
---|
310 | }
|
---|
311 | } else if (page >= start_anon) {
|
---|
312 | /*
|
---|
313 | * This is the uninitialized portion of the segment.
|
---|
314 | * It is not physically present in the ELF image.
|
---|
315 | * To resolve the situation, a frame must be allocated
|
---|
316 | * and cleared.
|
---|
317 | */
|
---|
318 | frame = (uintptr_t) frame_alloc_noreserve(ONE_FRAME, 0);
|
---|
319 | memsetb((void *) PA2KA(frame), FRAME_SIZE, 0);
|
---|
320 | dirty = true;
|
---|
321 | } else {
|
---|
322 | size_t pad_lo, pad_hi;
|
---|
323 | /*
|
---|
324 | * The mixed case.
|
---|
325 | *
|
---|
326 | * The middle part is backed by the ELF image and
|
---|
327 | * the lower and upper parts are anonymous memory.
|
---|
328 | * (The segment can be and often is shorter than 1 page).
|
---|
329 | */
|
---|
330 | if (page < entry->p_vaddr)
|
---|
331 | pad_lo = entry->p_vaddr - page;
|
---|
332 | else
|
---|
333 | pad_lo = 0;
|
---|
334 |
|
---|
335 | if (start_anon < page + PAGE_SIZE)
|
---|
336 | pad_hi = page + PAGE_SIZE - start_anon;
|
---|
337 | else
|
---|
338 | pad_hi = 0;
|
---|
339 |
|
---|
340 | frame = (uintptr_t) frame_alloc_noreserve(ONE_FRAME, 0);
|
---|
341 | memcpy((void *) (PA2KA(frame) + pad_lo),
|
---|
342 | (void *) (base + i * FRAME_SIZE + pad_lo),
|
---|
343 | FRAME_SIZE - pad_lo - pad_hi);
|
---|
344 | if (entry->p_flags & PF_X) {
|
---|
345 | smc_coherence_block((void *) (PA2KA(frame) + pad_lo),
|
---|
346 | FRAME_SIZE - pad_lo - pad_hi);
|
---|
347 | }
|
---|
348 | memsetb((void *) PA2KA(frame), pad_lo, 0);
|
---|
349 | memsetb((void *) (PA2KA(frame) + FRAME_SIZE - pad_hi), pad_hi,
|
---|
350 | 0);
|
---|
351 | dirty = true;
|
---|
352 | }
|
---|
353 |
|
---|
354 | if (dirty && area->sh_info) {
|
---|
355 | frame_reference_add(ADDR2PFN(frame));
|
---|
356 | btree_insert(&area->sh_info->pagemap, page - area->base,
|
---|
357 | (void *) frame, leaf);
|
---|
358 | }
|
---|
359 |
|
---|
360 | if (area->sh_info)
|
---|
361 | mutex_unlock(&area->sh_info->lock);
|
---|
362 |
|
---|
363 | page_mapping_insert(AS, addr, frame, as_area_get_flags(area));
|
---|
364 | if (!used_space_insert(area, page, 1))
|
---|
365 | panic("Cannot insert used space.");
|
---|
366 |
|
---|
367 | return AS_PF_OK;
|
---|
368 | }
|
---|
369 |
|
---|
370 | /** Free a frame that is backed by the ELF backend.
|
---|
371 | *
|
---|
372 | * The address space area and page tables must be already locked.
|
---|
373 | *
|
---|
374 | * @param area Pointer to the address space area.
|
---|
375 | * @param page Page that is mapped to frame. Must be aligned to
|
---|
376 | * PAGE_SIZE.
|
---|
377 | * @param frame Frame to be released.
|
---|
378 | *
|
---|
379 | */
|
---|
380 | void elf_frame_free(as_area_t *area, uintptr_t page, uintptr_t frame)
|
---|
381 | {
|
---|
382 | elf_segment_header_t *entry = area->backend_data.segment;
|
---|
383 | uintptr_t start_anon;
|
---|
384 |
|
---|
385 | ASSERT(page_table_locked(area->as));
|
---|
386 | ASSERT(mutex_locked(&area->lock));
|
---|
387 |
|
---|
388 | ASSERT(page >= ALIGN_DOWN(entry->p_vaddr, PAGE_SIZE));
|
---|
389 | ASSERT(page < entry->p_vaddr + entry->p_memsz);
|
---|
390 |
|
---|
391 | start_anon = entry->p_vaddr + entry->p_filesz;
|
---|
392 |
|
---|
393 | if (page >= entry->p_vaddr && page + PAGE_SIZE <= start_anon) {
|
---|
394 | if (entry->p_flags & PF_W) {
|
---|
395 | /*
|
---|
396 | * Free the frame with the copy of writable segment
|
---|
397 | * data.
|
---|
398 | */
|
---|
399 | frame_free_noreserve(frame);
|
---|
400 | }
|
---|
401 | } else {
|
---|
402 | /*
|
---|
403 | * The frame is either anonymous memory or the mixed case (i.e.
|
---|
404 | * lower part is backed by the ELF image and the upper is
|
---|
405 | * anonymous). In any case, a frame needs to be freed.
|
---|
406 | */
|
---|
407 | frame_free_noreserve(frame);
|
---|
408 | }
|
---|
409 | }
|
---|
410 |
|
---|
411 | /** @}
|
---|
412 | */
|
---|