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