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 continuous physical
|
---|
36 | * memory.
|
---|
37 | */
|
---|
38 |
|
---|
39 | #include <assert.h>
|
---|
40 | #include <typedefs.h>
|
---|
41 | #include <mm/as.h>
|
---|
42 | #include <mm/page.h>
|
---|
43 | #include <mm/frame.h>
|
---|
44 | #include <mm/slab.h>
|
---|
45 | #include <macros.h>
|
---|
46 | #include <arch.h>
|
---|
47 | #include <align.h>
|
---|
48 |
|
---|
49 | static bool phys_create(as_area_t *);
|
---|
50 | static void phys_share(as_area_t *);
|
---|
51 | static void phys_destroy(as_area_t *);
|
---|
52 |
|
---|
53 | static bool phys_is_resizable(as_area_t *);
|
---|
54 | static bool phys_is_shareable(as_area_t *);
|
---|
55 |
|
---|
56 | static int phys_page_fault(as_area_t *, uintptr_t, pf_access_t);
|
---|
57 |
|
---|
58 | static bool phys_create_shared_data(as_area_t *);
|
---|
59 | static void phys_destroy_shared_data(void *);
|
---|
60 |
|
---|
61 | typedef struct {
|
---|
62 | uintptr_t base;
|
---|
63 | size_t frames;
|
---|
64 | } phys_shared_data_t;
|
---|
65 |
|
---|
66 | mem_backend_t phys_backend = {
|
---|
67 | .create = phys_create,
|
---|
68 | .resize = NULL,
|
---|
69 | .share = phys_share,
|
---|
70 | .destroy = phys_destroy,
|
---|
71 |
|
---|
72 | .is_resizable = phys_is_resizable,
|
---|
73 | .is_shareable = phys_is_shareable,
|
---|
74 |
|
---|
75 | .page_fault = phys_page_fault,
|
---|
76 | .frame_free = NULL,
|
---|
77 |
|
---|
78 | .create_shared_data = phys_create_shared_data,
|
---|
79 | .destroy_shared_data = phys_destroy_shared_data
|
---|
80 | };
|
---|
81 |
|
---|
82 |
|
---|
83 | bool phys_create(as_area_t *area)
|
---|
84 | {
|
---|
85 | return true;
|
---|
86 | }
|
---|
87 |
|
---|
88 | /** Share address space area backed by physical memory.
|
---|
89 | *
|
---|
90 | * Do actually nothing as sharing of address space areas
|
---|
91 | * that are backed up by physical memory is very easy.
|
---|
92 | * Note that the function must be defined so that
|
---|
93 | * as_area_share() will succeed.
|
---|
94 | */
|
---|
95 | void phys_share(as_area_t *area)
|
---|
96 | {
|
---|
97 | assert(mutex_locked(&area->as->lock));
|
---|
98 | assert(mutex_locked(&area->lock));
|
---|
99 | }
|
---|
100 |
|
---|
101 |
|
---|
102 | void phys_destroy(as_area_t *area)
|
---|
103 | {
|
---|
104 | /*
|
---|
105 | * Nothing to do.
|
---|
106 | * The anonymous frames, if any, are released in
|
---|
107 | * phys_destroy_shared_data().
|
---|
108 | */
|
---|
109 | }
|
---|
110 |
|
---|
111 | bool phys_is_resizable(as_area_t *area)
|
---|
112 | {
|
---|
113 | return false;
|
---|
114 | }
|
---|
115 |
|
---|
116 | bool phys_is_shareable(as_area_t *area)
|
---|
117 | {
|
---|
118 | return true;
|
---|
119 | }
|
---|
120 |
|
---|
121 |
|
---|
122 | /** Service a page fault in the address space area backed by physical memory.
|
---|
123 | *
|
---|
124 | * The address space area and page tables must be already locked.
|
---|
125 | *
|
---|
126 | * @param area Pointer to the address space area.
|
---|
127 | * @param upage Faulting virtual page.
|
---|
128 | * @param access Access mode that caused the fault (i.e. read/write/exec).
|
---|
129 | *
|
---|
130 | * @return AS_PF_FAULT on failure (i.e. page fault) or AS_PF_OK on success (i.e.
|
---|
131 | * serviced).
|
---|
132 | */
|
---|
133 | int phys_page_fault(as_area_t *area, uintptr_t upage, pf_access_t access)
|
---|
134 | {
|
---|
135 | uintptr_t base = area->backend_data.base;
|
---|
136 |
|
---|
137 | assert(page_table_locked(AS));
|
---|
138 | assert(mutex_locked(&area->lock));
|
---|
139 | assert(IS_ALIGNED(upage, PAGE_SIZE));
|
---|
140 |
|
---|
141 | if (!as_area_check_access(area, access))
|
---|
142 | return AS_PF_FAULT;
|
---|
143 |
|
---|
144 | assert(upage - area->base < area->backend_data.frames * FRAME_SIZE);
|
---|
145 | page_mapping_insert(AS, upage, base + (upage - area->base),
|
---|
146 | as_area_get_flags(area));
|
---|
147 |
|
---|
148 | if (!used_space_insert(area, upage, 1))
|
---|
149 | panic("Cannot insert used space.");
|
---|
150 |
|
---|
151 | return AS_PF_OK;
|
---|
152 | }
|
---|
153 |
|
---|
154 | bool phys_create_shared_data(as_area_t *area)
|
---|
155 | {
|
---|
156 | /*
|
---|
157 | * For anonymous phys areas, create the shared data.
|
---|
158 | */
|
---|
159 | if (area->backend_data.anonymous) {
|
---|
160 | phys_shared_data_t *data;
|
---|
161 |
|
---|
162 | data = (phys_shared_data_t *) malloc(sizeof(*data), 0);
|
---|
163 |
|
---|
164 | data->base = area->backend_data.base;
|
---|
165 | data->frames = area->backend_data.frames;
|
---|
166 | area->sh_info->backend_shared_data = data;
|
---|
167 | }
|
---|
168 |
|
---|
169 | return true;
|
---|
170 | }
|
---|
171 |
|
---|
172 | void phys_destroy_shared_data(void *opaque_data)
|
---|
173 | {
|
---|
174 | phys_shared_data_t *data = (phys_shared_data_t *) opaque_data;
|
---|
175 |
|
---|
176 | if (data) {
|
---|
177 | frame_free(data->base, data->frames);
|
---|
178 | free(data);
|
---|
179 | }
|
---|
180 | }
|
---|
181 |
|
---|
182 | /** @}
|
---|
183 | */
|
---|