source: mainline/kernel/generic/src/mm/backend_elf.c@ 2fc3b2d

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 2fc3b2d was 2fc3b2d, checked in by jxsvoboda <5887334+jxsvoboda@…>, 7 years ago

Replace B+tree with ordered dict. for used space

Replace the use of B+tree with ordered dictionary for used space,
adding a little bit more abstraction around used space tracking.
This allows performing TLB shootdown while shrinking an area
in a single sequence. A generic used_space_remove() is no longer
needed.

  • Property mode set to 100644
File size: 12.1 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 kernel_generic_mm
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 <assert.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 <mm/km.h>
47#include <genarch/mm/page_pt.h>
48#include <genarch/mm/page_ht.h>
49#include <align.h>
50#include <mem.h>
51#include <macros.h>
52#include <arch.h>
53#include <barrier.h>
54
55static bool elf_create(as_area_t *);
56static bool elf_resize(as_area_t *, size_t);
57static void elf_share(as_area_t *);
58static void elf_destroy(as_area_t *);
59
60static bool elf_is_resizable(as_area_t *);
61static bool elf_is_shareable(as_area_t *);
62
63static int elf_page_fault(as_area_t *, uintptr_t, pf_access_t);
64static void elf_frame_free(as_area_t *, uintptr_t, uintptr_t);
65
66mem_backend_t elf_backend = {
67 .create = elf_create,
68 .resize = elf_resize,
69 .share = elf_share,
70 .destroy = elf_destroy,
71
72 .is_resizable = elf_is_resizable,
73 .is_shareable = elf_is_shareable,
74
75 .page_fault = elf_page_fault,
76 .frame_free = elf_frame_free,
77
78 .create_shared_data = NULL,
79 .destroy_shared_data = NULL
80};
81
82static size_t elf_nonanon_pages_get(as_area_t *area)
83{
84 elf_segment_header_t *entry = area->backend_data.segment;
85 uintptr_t first = ALIGN_UP(entry->p_vaddr, PAGE_SIZE);
86 uintptr_t last = ALIGN_DOWN(entry->p_vaddr + entry->p_filesz,
87 PAGE_SIZE);
88
89 if (entry->p_flags & PF_W)
90 return 0;
91
92 if (last < first)
93 return 0;
94
95 return last - first;
96}
97
98/** Get page number in the task where the ELF page originates from.
99 *
100 * The ELF page can be shared to a different address than it originated from,
101 * but we need the originating address since that corresponds to the ELF's
102 * virtual addesses.
103 *
104 * @param area Area in which the page resides
105 * @param page Virtual address of the page in @a area
106 * @return Virtual address of the page in the origin address space
107 */
108static uintptr_t elf_orig_page(as_area_t *area, uintptr_t page)
109{
110 return page - area->base + area->backend_data.elf_base;
111}
112
113bool elf_create(as_area_t *area)
114{
115 size_t nonanon_pages = elf_nonanon_pages_get(area);
116
117 if (area->pages <= nonanon_pages)
118 return true;
119
120 return reserve_try_alloc(area->pages - nonanon_pages);
121}
122
123bool elf_resize(as_area_t *area, size_t new_pages)
124{
125 size_t nonanon_pages = elf_nonanon_pages_get(area);
126
127 if (new_pages > area->pages) {
128 /* The area is growing. */
129 if (area->pages >= nonanon_pages)
130 return reserve_try_alloc(new_pages - area->pages);
131 else if (new_pages > nonanon_pages)
132 return reserve_try_alloc(new_pages - nonanon_pages);
133 } else if (new_pages < area->pages) {
134 /* The area is shrinking. */
135 if (new_pages >= nonanon_pages)
136 reserve_free(area->pages - new_pages);
137 else if (area->pages > nonanon_pages)
138 reserve_free(nonanon_pages - new_pages);
139 }
140
141 return true;
142}
143
144/** Share ELF image backed address space area.
145 *
146 * If the area is writable, then all mapped pages are duplicated in the pagemap.
147 * Otherwise only portions of the area that are not backed by the ELF image
148 * are put into the pagemap.
149 *
150 * @param area Address space area.
151 */
152void elf_share(as_area_t *area)
153{
154 elf_segment_header_t *entry = area->backend_data.segment;
155 used_space_ival_t *start;
156 used_space_ival_t *cur;
157 uintptr_t start_anon = entry->p_vaddr + entry->p_filesz;
158
159 assert(mutex_locked(&area->as->lock));
160 assert(mutex_locked(&area->lock));
161
162 /*
163 * Find the node in which to start linear search.
164 */
165 if (area->flags & AS_AREA_WRITE) {
166 start = used_space_first(&area->used_space);
167 } else {
168 /* Find first interval containing addresses >= start_anon */
169 start = used_space_find_gteq(&area->used_space, start_anon);
170 }
171
172 /*
173 * Copy used anonymous portions of the area to sh_info's page map.
174 */
175 mutex_lock(&area->sh_info->lock);
176 cur = start;
177 while (cur != NULL) {
178 uintptr_t base = cur->page;
179 size_t count = cur->count;
180 unsigned int i;
181
182 /*
183 * Skip read-only areas of used space that are backed
184 * by the ELF image.
185 */
186 if (!(area->flags & AS_AREA_WRITE))
187 if (base >= entry->p_vaddr &&
188 base + P2SZ(count) <= start_anon)
189 continue;
190
191 for (i = 0; i < count; i++) {
192 pte_t pte;
193 bool found;
194
195 /*
196 * Skip read-only pages that are backed by the
197 * ELF image.
198 */
199 if (!(area->flags & AS_AREA_WRITE))
200 if (base >= entry->p_vaddr &&
201 base + P2SZ(i + 1) <= start_anon)
202 continue;
203
204 page_table_lock(area->as, false);
205 found = page_mapping_find(area->as,
206 base + P2SZ(i), false, &pte);
207
208 (void) found;
209 assert(found);
210 assert(PTE_VALID(&pte));
211 assert(PTE_PRESENT(&pte));
212
213 as_pagemap_insert(&area->sh_info->pagemap,
214 (base + P2SZ(i)) - area->base,
215 PTE_GET_FRAME(&pte));
216 page_table_unlock(area->as, false);
217
218 pfn_t pfn = ADDR2PFN(PTE_GET_FRAME(&pte));
219 frame_reference_add(pfn);
220 }
221
222 cur = used_space_next(cur);
223 }
224
225 mutex_unlock(&area->sh_info->lock);
226}
227
228void elf_destroy(as_area_t *area)
229{
230 size_t nonanon_pages = elf_nonanon_pages_get(area);
231
232 if (area->pages > nonanon_pages)
233 reserve_free(area->pages - nonanon_pages);
234}
235
236bool elf_is_resizable(as_area_t *area)
237{
238 return true;
239}
240
241bool elf_is_shareable(as_area_t *area)
242{
243 return true;
244}
245
246/** Service a page fault in the ELF backend address space area.
247 *
248 * The address space area and page tables must be already locked.
249 *
250 * @param area Pointer to the address space area.
251 * @param upage Faulting virtual page.
252 * @param access Access mode that caused the fault (i.e.
253 * read/write/exec).
254 *
255 * @return AS_PF_FAULT on failure (i.e. page fault) or AS_PF_OK
256 * on success (i.e. serviced).
257 */
258int elf_page_fault(as_area_t *area, uintptr_t upage, pf_access_t access)
259{
260 elf_header_t *elf = area->backend_data.elf;
261 elf_segment_header_t *entry = area->backend_data.segment;
262 uintptr_t base;
263 uintptr_t frame;
264 uintptr_t kpage;
265 uintptr_t start_anon;
266 uintptr_t elfpage;
267 size_t i;
268 bool dirty = false;
269
270 assert(page_table_locked(AS));
271 assert(mutex_locked(&area->lock));
272 assert(IS_ALIGNED(upage, PAGE_SIZE));
273
274 elfpage = elf_orig_page(area, upage);
275
276 if (!as_area_check_access(area, access))
277 return AS_PF_FAULT;
278
279 if (elfpage < ALIGN_DOWN(entry->p_vaddr, PAGE_SIZE))
280 return AS_PF_FAULT;
281
282 if (elfpage >= entry->p_vaddr + entry->p_memsz)
283 return AS_PF_FAULT;
284
285 i = (elfpage - ALIGN_DOWN(entry->p_vaddr, PAGE_SIZE)) >>
286 PAGE_WIDTH;
287 base = (uintptr_t)
288 (((void *) elf) + ALIGN_DOWN(entry->p_offset, PAGE_SIZE));
289
290 /* Virtual address of the end of initialized part of segment */
291 start_anon = entry->p_vaddr + entry->p_filesz;
292
293 mutex_lock(&area->sh_info->lock);
294 if (area->sh_info->shared) {
295 /*
296 * The address space area is shared.
297 */
298
299 errno_t rc = as_pagemap_find(&area->sh_info->pagemap,
300 upage - area->base, &frame);
301 if (rc == EOK) {
302 frame_reference_add(ADDR2PFN(frame));
303 page_mapping_insert(AS, upage, frame,
304 as_area_get_flags(area));
305 if (!used_space_insert(&area->used_space, upage, 1))
306 panic("Cannot insert used space.");
307 mutex_unlock(&area->sh_info->lock);
308 return AS_PF_OK;
309 }
310 }
311
312 /*
313 * The area is either not shared or the pagemap does not contain the
314 * mapping.
315 */
316 if (elfpage >= entry->p_vaddr && elfpage + PAGE_SIZE <= start_anon) {
317 /*
318 * Initialized portion of the segment. The memory is backed
319 * directly by the content of the ELF image. Pages are
320 * only copied if the segment is writable so that there
321 * can be more instances of the same memory ELF image
322 * used at a time. Note that this could be later done
323 * as COW.
324 */
325 if (entry->p_flags & PF_W) {
326 kpage = km_temporary_page_get(&frame, FRAME_NO_RESERVE);
327 memcpy((void *) kpage, (void *) (base + i * PAGE_SIZE),
328 PAGE_SIZE);
329 if (entry->p_flags & PF_X) {
330 smc_coherence((void *) kpage, PAGE_SIZE);
331 }
332 km_temporary_page_put(kpage);
333 dirty = true;
334 } else {
335 pte_t pte;
336 bool found;
337
338 found = page_mapping_find(AS_KERNEL,
339 base + i * FRAME_SIZE, true, &pte);
340
341 (void) found;
342 assert(found);
343 assert(PTE_PRESENT(&pte));
344
345 frame = PTE_GET_FRAME(&pte);
346 }
347 } else if (elfpage >= start_anon) {
348 /*
349 * This is the uninitialized portion of the segment.
350 * It is not physically present in the ELF image.
351 * To resolve the situation, a frame must be allocated
352 * and cleared.
353 */
354 kpage = km_temporary_page_get(&frame, FRAME_NO_RESERVE);
355 memsetb((void *) kpage, PAGE_SIZE, 0);
356 km_temporary_page_put(kpage);
357 dirty = true;
358 } else {
359 size_t pad_lo, pad_hi;
360 /*
361 * The mixed case.
362 *
363 * The middle part is backed by the ELF image and
364 * the lower and upper parts are anonymous memory.
365 * (The segment can be and often is shorter than 1 page).
366 */
367 if (upage < entry->p_vaddr)
368 pad_lo = entry->p_vaddr - upage;
369 else
370 pad_lo = 0;
371
372 if (start_anon < upage + PAGE_SIZE)
373 pad_hi = upage + PAGE_SIZE - start_anon;
374 else
375 pad_hi = 0;
376
377 kpage = km_temporary_page_get(&frame, FRAME_NO_RESERVE);
378 memcpy((void *) (kpage + pad_lo),
379 (void *) (base + i * PAGE_SIZE + pad_lo),
380 PAGE_SIZE - pad_lo - pad_hi);
381 if (entry->p_flags & PF_X) {
382 smc_coherence((void *) (kpage + pad_lo),
383 PAGE_SIZE - pad_lo - pad_hi);
384 }
385 memsetb((void *) kpage, pad_lo, 0);
386 memsetb((void *) (kpage + PAGE_SIZE - pad_hi), pad_hi, 0);
387 km_temporary_page_put(kpage);
388 dirty = true;
389 }
390
391 if (dirty && area->sh_info->shared) {
392 frame_reference_add(ADDR2PFN(frame));
393 as_pagemap_insert(&area->sh_info->pagemap, upage - area->base,
394 frame);
395 }
396
397 mutex_unlock(&area->sh_info->lock);
398
399 page_mapping_insert(AS, upage, frame, as_area_get_flags(area));
400 if (!used_space_insert(&area->used_space, upage, 1))
401 panic("Cannot insert used space.");
402
403 return AS_PF_OK;
404}
405
406/** Free a frame that is backed by the ELF backend.
407 *
408 * The address space area and page tables must be already locked.
409 *
410 * @param area Pointer to the address space area.
411 * @param page Page that is mapped to frame. Must be aligned to
412 * PAGE_SIZE.
413 * @param frame Frame to be released.
414 *
415 */
416void elf_frame_free(as_area_t *area, uintptr_t page, uintptr_t frame)
417{
418 elf_segment_header_t *entry = area->backend_data.segment;
419 uintptr_t start_anon;
420 uintptr_t elfpage;
421
422 assert(page_table_locked(area->as));
423 assert(mutex_locked(&area->lock));
424
425 elfpage = elf_orig_page(area, page);
426
427 assert(elfpage >= ALIGN_DOWN(entry->p_vaddr, PAGE_SIZE));
428 assert(elfpage < entry->p_vaddr + entry->p_memsz);
429
430 start_anon = entry->p_vaddr + entry->p_filesz;
431
432 if (elfpage >= entry->p_vaddr && elfpage + PAGE_SIZE <= start_anon) {
433 if (entry->p_flags & PF_W) {
434 /*
435 * Free the frame with the copy of writable segment
436 * data.
437 */
438 frame_free_noreserve(frame, 1);
439 }
440 } else {
441 /*
442 * The frame is either anonymous memory or the mixed case (i.e.
443 * lower part is backed by the ELF image and the upper is
444 * anonymous). In any case, a frame needs to be freed.
445 */
446 frame_free_noreserve(frame, 1);
447 }
448}
449
450/** @}
451 */
Note: See TracBrowser for help on using the repository browser.