source: mainline/generic/src/mm/backend_anon.c@ 1ec1fd8

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

Support for sharing address space areas backed up by ELF image.

  • Property mode set to 100644
File size: 6.2 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_anon.c
31 * @brief Backend for anonymous memory address space areas.
32 *
33 */
34
35#include <mm/as.h>
36#include <mm/page.h>
37#include <genarch/mm/page_pt.h>
38#include <genarch/mm/page_ht.h>
39#include <mm/frame.h>
40#include <mm/slab.h>
41#include <synch/mutex.h>
42#include <adt/list.h>
43#include <adt/btree.h>
44#include <errno.h>
45#include <arch/types.h>
46#include <typedefs.h>
47#include <align.h>
48#include <arch.h>
49
50static int anon_page_fault(as_area_t *area, __address addr, pf_access_t access);
51static void anon_frame_free(as_area_t *area, __address page, __address frame);
52static void anon_share(as_area_t *area);
53
54mem_backend_t anon_backend = {
55 .page_fault = anon_page_fault,
56 .frame_free = anon_frame_free,
57 .share = anon_share
58};
59
60/** Service a page fault in the anonymous memory address space area.
61 *
62 * The address space area and page tables must be already locked.
63 *
64 * @param area Pointer to the address space area.
65 * @param addr Faulting virtual address.
66 * @param access Access mode that caused the fault (i.e. read/write/exec).
67 *
68 * @return AS_PF_FAULT on failure (i.e. page fault) or AS_PF_OK on success (i.e. serviced).
69 */
70int anon_page_fault(as_area_t *area, __address addr, pf_access_t access)
71{
72 __address frame;
73
74 if (!as_area_check_access(area, access))
75 return AS_PF_FAULT;
76
77 if (area->sh_info) {
78 btree_node_t *leaf;
79
80 /*
81 * The area is shared, chances are that the mapping can be found
82 * in the pagemap of the address space area share info structure.
83 * In the case that the pagemap does not contain the respective
84 * mapping, a new frame is allocated and the mapping is created.
85 */
86 mutex_lock(&area->sh_info->lock);
87 frame = (__address) btree_search(&area->sh_info->pagemap,
88 ALIGN_DOWN(addr, PAGE_SIZE) - area->base, &leaf);
89 if (!frame) {
90 bool allocate = true;
91 int i;
92
93 /*
94 * Zero can be returned as a valid frame address.
95 * Just a small workaround.
96 */
97 for (i = 0; i < leaf->keys; i++) {
98 if (leaf->key[i] == ALIGN_DOWN(addr, PAGE_SIZE)) {
99 allocate = false;
100 break;
101 }
102 }
103 if (allocate) {
104 frame = PFN2ADDR(frame_alloc(ONE_FRAME, 0));
105 memsetb(PA2KA(frame), FRAME_SIZE, 0);
106
107 /*
108 * Insert the address of the newly allocated frame to the pagemap.
109 */
110 btree_insert(&area->sh_info->pagemap, ALIGN_DOWN(addr, PAGE_SIZE) - area->base, (void *) frame, leaf);
111 }
112 }
113 mutex_unlock(&area->sh_info->lock);
114 } else {
115
116 /*
117 * In general, there can be several reasons that
118 * can have caused this fault.
119 *
120 * - non-existent mapping: the area is an anonymous
121 * area (e.g. heap or stack) and so far has not been
122 * allocated a frame for the faulting page
123 *
124 * - non-present mapping: another possibility,
125 * currently not implemented, would be frame
126 * reuse; when this becomes a possibility,
127 * do not forget to distinguish between
128 * the different causes
129 */
130 frame = PFN2ADDR(frame_alloc(ONE_FRAME, 0));
131 memsetb(PA2KA(frame), FRAME_SIZE, 0);
132 }
133
134 /*
135 * Map 'page' to 'frame'.
136 * Note that TLB shootdown is not attempted as only new information is being
137 * inserted into page tables.
138 */
139 page_mapping_insert(AS, addr, frame, as_area_get_flags(area));
140 if (!used_space_insert(area, ALIGN_DOWN(addr, PAGE_SIZE), 1))
141 panic("Could not insert used space.\n");
142
143 return AS_PF_OK;
144}
145
146/** Free a frame that is backed by the anonymous memory backend.
147 *
148 * The address space area and page tables must be already locked.
149 *
150 * @param area Ignored.
151 * @param page Ignored.
152 * @param frame Frame to be released.
153 */
154void anon_frame_free(as_area_t *area, __address page, __address frame)
155{
156 frame_free(ADDR2PFN(frame));
157}
158
159/** Share the anonymous address space area.
160 *
161 * Sharing of anonymous area is done by duplicating its entire mapping
162 * to the pagemap. Page faults will primarily search for frames there.
163 *
164 * The address space and address space area must be already locked.
165 *
166 * @param area Address space area to be shared.
167 */
168void anon_share(as_area_t *area)
169{
170 link_t *cur;
171
172 /*
173 * Copy used portions of the area to sh_info's page map.
174 */
175 mutex_lock(&area->sh_info->lock);
176 for (cur = area->used_space.leaf_head.next; cur != &area->used_space.leaf_head; cur = cur->next) {
177 btree_node_t *node;
178 int i;
179
180 node = list_get_instance(cur, btree_node_t, leaf_link);
181 for (i = 0; i < node->keys; i++) {
182 __address base = node->key[i];
183 count_t count = (count_t) node->value[i];
184 int j;
185
186 for (j = 0; j < count; j++) {
187 pte_t *pte;
188
189 page_table_lock(area->as, false);
190 pte = page_mapping_find(area->as, base + j*PAGE_SIZE);
191 ASSERT(pte && PTE_VALID(pte) && PTE_PRESENT(pte));
192 btree_insert(&area->sh_info->pagemap, (base + j*PAGE_SIZE) - area->base,
193 (void *) PTE_GET_FRAME(pte), NULL);
194 page_table_unlock(area->as, false);
195 }
196
197 }
198 }
199 mutex_unlock(&area->sh_info->lock);
200}
Note: See TracBrowser for help on using the repository browser.