Rev 219 | Rev 368 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 219 | Rev 367 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (C) 2001-2004 Jakub Jermar |
2 | * Copyright (C) 2001-2004 Jakub Jermar |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
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 |
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. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
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 |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
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 |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
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 |
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. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
29 | #include <arch/types.h> |
29 | #include <arch/types.h> |
30 | #include <func.h> |
30 | #include <func.h> |
31 | 31 | ||
32 | #include <mm/heap.h> |
32 | #include <mm/heap.h> |
33 | #include <mm/frame.h> |
33 | #include <mm/frame.h> |
34 | #include <mm/page.h> |
34 | #include <mm/page.h> |
35 | #include <mm/vm.h> |
35 | #include <mm/vm.h> |
36 | #include <arch/mm/page.h> |
36 | #include <arch/mm/page.h> |
37 | 37 | ||
38 | #include <config.h> |
38 | #include <config.h> |
39 | #include <memstr.h> |
39 | #include <memstr.h> |
40 | 40 | ||
41 | #include <panic.h> |
41 | #include <panic.h> |
- | 42 | #include <debug.h> |
|
42 | 43 | ||
43 | #include <synch/spinlock.h> |
44 | #include <synch/spinlock.h> |
44 | 45 | ||
45 | #include <arch/asm.h> |
46 | #include <arch/asm.h> |
46 | #include <arch.h> |
47 | #include <arch.h> |
47 | 48 | ||
48 | count_t frames = 0; |
49 | count_t frames = 0; |
49 | count_t frames_free; |
50 | count_t frames_free; |
50 | 51 | ||
51 | __u8 *frame_bitmap; |
52 | __u8 *frame_bitmap; |
52 | count_t frame_bitmap_octets; |
53 | count_t frame_bitmap_octets; |
53 | 54 | ||
54 | static spinlock_t framelock; |
55 | static spinlock_t framelock; |
55 | 56 | ||
- | 57 | spinlock_t zone_head_lock; /**< this lock protects zone_head list */ |
|
- | 58 | link_t zone_head; /**< list of all zones in the system */ |
|
- | 59 | ||
- | 60 | ||
56 | void frame_init(void) |
61 | void frame_init(void) |
57 | { |
62 | { |
58 | if (config.cpu_active == 1) { |
63 | if (config.cpu_active == 1) { |
- | 64 | zone_init(); |
|
59 | 65 | ||
60 | /* |
66 | /* |
61 | * The bootstrap processor will allocate all necessary memory for frame allocation. |
67 | * The bootstrap processor will allocate all necessary memory for frame allocation. |
62 | */ |
68 | */ |
63 | 69 | ||
64 | frames = config.memory_size / FRAME_SIZE; |
70 | frames = config.memory_size / FRAME_SIZE; |
65 | frame_bitmap_octets = frames / 8 + (frames % 8 > 0); |
71 | frame_bitmap_octets = frames / 8 + (frames % 8 > 0); |
66 | frame_bitmap = (__u8 *) malloc(frame_bitmap_octets); |
72 | frame_bitmap = (__u8 *) malloc(frame_bitmap_octets); |
67 | if (!frame_bitmap) |
73 | if (!frame_bitmap) |
68 | panic("malloc/frame_bitmap\n"); |
74 | panic("malloc/frame_bitmap\n"); |
69 | 75 | ||
70 | /* |
76 | /* |
71 | * Mark all frames free. |
77 | * Mark all frames free. |
72 | */ |
78 | */ |
73 | memsetb((__address) frame_bitmap, frame_bitmap_octets, 0); |
79 | memsetb((__address) frame_bitmap, frame_bitmap_octets, 0); |
74 | frames_free = frames; |
80 | frames_free = frames; |
75 | } |
81 | } |
76 | 82 | ||
77 | /* |
83 | /* |
78 | * No frame allocations/reservations prior this point. |
84 | * No frame allocations/reservations prior this point. |
79 | */ |
85 | */ |
80 | 86 | ||
81 | frame_arch_init(); |
87 | frame_arch_init(); |
82 | 88 | ||
83 | if (config.cpu_active == 1) { |
89 | if (config.cpu_active == 1) { |
84 | /* |
90 | /* |
85 | * Create the memory address space map. Marked frames and frame |
91 | * Create the memory address space map. Marked frames and frame |
86 | * regions cannot be used for allocation. |
92 | * regions cannot be used for allocation. |
87 | */ |
93 | */ |
88 | frame_region_not_free(config.base, config.base + config.kernel_size); |
94 | frame_region_not_free(config.base, config.base + config.kernel_size); |
89 | } |
95 | } |
90 | } |
96 | } |
91 | 97 | ||
92 | /* |
98 | /* |
93 | * Allocate a frame. |
99 | * Allocate a frame. |
94 | */ |
100 | */ |
95 | __address frame_alloc(int flags) |
101 | __address frame_alloc(int flags) |
96 | { |
102 | { |
97 | int i; |
103 | int i; |
98 | pri_t pri; |
104 | pri_t pri; |
99 | 105 | ||
100 | loop: |
106 | loop: |
101 | pri = cpu_priority_high(); |
107 | pri = cpu_priority_high(); |
102 | spinlock_lock(&framelock); |
108 | spinlock_lock(&framelock); |
103 | if (frames_free) { |
109 | if (frames_free) { |
104 | for (i=0; i < frames; i++) { |
110 | for (i=0; i < frames; i++) { |
105 | int m, n; |
111 | int m, n; |
106 | 112 | ||
107 | m = i / 8; |
113 | m = i / 8; |
108 | n = i % 8; |
114 | n = i % 8; |
109 | 115 | ||
110 | if ((frame_bitmap[m] & (1<<n)) == 0) { |
116 | if ((frame_bitmap[m] & (1<<n)) == 0) { |
111 | frame_bitmap[m] |= (1<<n); |
117 | frame_bitmap[m] |= (1<<n); |
112 | frames_free--; |
118 | frames_free--; |
113 | spinlock_unlock(&framelock); |
119 | spinlock_unlock(&framelock); |
114 | cpu_priority_restore(pri); |
120 | cpu_priority_restore(pri); |
115 | if (flags & FRAME_KA) return PA2KA(i*FRAME_SIZE); |
121 | if (flags & FRAME_KA) return PA2KA(i*FRAME_SIZE); |
116 | return i*FRAME_SIZE; |
122 | return i*FRAME_SIZE; |
117 | } |
123 | } |
118 | } |
124 | } |
119 | panic("frames_free inconsistent (%d)\n", frames_free); |
125 | panic("frames_free inconsistent (%d)\n", frames_free); |
120 | } |
126 | } |
121 | spinlock_unlock(&framelock); |
127 | spinlock_unlock(&framelock); |
122 | cpu_priority_restore(pri); |
128 | cpu_priority_restore(pri); |
123 | 129 | ||
124 | if (flags & FRAME_PANIC) |
130 | if (flags & FRAME_PANIC) |
125 | panic("unable to allocate frame\n"); |
131 | panic("unable to allocate frame\n"); |
126 | 132 | ||
127 | /* TODO: implement sleeping logic here */ |
133 | /* TODO: implement sleeping logic here */ |
128 | panic("sleep not supported\n"); |
134 | panic("sleep not supported\n"); |
129 | 135 | ||
130 | goto loop; |
136 | goto loop; |
131 | } |
137 | } |
132 | 138 | ||
133 | /* |
139 | /* |
134 | * Free a frame. |
140 | * Free a frame. |
135 | */ |
141 | */ |
136 | void frame_free(__address addr) |
142 | void frame_free(__address addr) |
137 | { |
143 | { |
138 | pri_t pri; |
144 | pri_t pri; |
139 | __u32 frame; |
145 | __u32 frame; |
140 | 146 | ||
141 | pri = cpu_priority_high(); |
147 | pri = cpu_priority_high(); |
142 | spinlock_lock(&framelock); |
148 | spinlock_lock(&framelock); |
143 | 149 | ||
144 | frame = IS_KA(addr) ? KA2PA(addr) : addr; |
150 | frame = IS_KA(addr) ? KA2PA(addr) : addr; |
145 | frame /= FRAME_SIZE; |
151 | frame /= FRAME_SIZE; |
146 | if (frame < frames) { |
152 | if (frame < frames) { |
147 | int m, n; |
153 | int m, n; |
148 | 154 | ||
149 | m = frame / 8; |
155 | m = frame / 8; |
150 | n = frame % 8; |
156 | n = frame % 8; |
151 | 157 | ||
152 | if (frame_bitmap[m] & (1<<n)) { |
158 | if (frame_bitmap[m] & (1<<n)) { |
153 | frame_bitmap[m] &= ~(1<<n); |
159 | frame_bitmap[m] &= ~(1<<n); |
154 | frames_free++; |
160 | frames_free++; |
155 | } |
161 | } |
156 | else panic("frame already free\n"); |
162 | else panic("frame already free\n"); |
157 | } |
163 | } |
158 | else panic("frame number too big\n"); |
164 | else panic("frame number too big\n"); |
159 | 165 | ||
160 | spinlock_unlock(&framelock); |
166 | spinlock_unlock(&framelock); |
161 | cpu_priority_restore(pri); |
167 | cpu_priority_restore(pri); |
162 | } |
168 | } |
163 | 169 | ||
164 | /* |
170 | /* |
165 | * Don't use this function for normal allocation. Use frame_alloc() instead. |
171 | * Don't use this function for normal allocation. Use frame_alloc() instead. |
166 | * Use this function to declare that some special frame is not free. |
172 | * Use this function to declare that some special frame is not free. |
167 | */ |
173 | */ |
168 | void frame_not_free(__address addr) |
174 | void frame_not_free(__address addr) |
169 | { |
175 | { |
170 | pri_t pri; |
176 | pri_t pri; |
171 | __u32 frame; |
177 | __u32 frame; |
172 | 178 | ||
173 | pri = cpu_priority_high(); |
179 | pri = cpu_priority_high(); |
174 | spinlock_lock(&framelock); |
180 | spinlock_lock(&framelock); |
175 | frame = IS_KA(addr) ? KA2PA(addr) : addr; |
181 | frame = IS_KA(addr) ? KA2PA(addr) : addr; |
176 | frame /= FRAME_SIZE; |
182 | frame /= FRAME_SIZE; |
177 | if (frame < frames) { |
183 | if (frame < frames) { |
178 | int m, n; |
184 | int m, n; |
179 | 185 | ||
180 | m = frame / 8; |
186 | m = frame / 8; |
181 | n = frame % 8; |
187 | n = frame % 8; |
182 | 188 | ||
183 | if ((frame_bitmap[m] & (1<<n)) == 0) { |
189 | if ((frame_bitmap[m] & (1<<n)) == 0) { |
184 | frame_bitmap[m] |= (1<<n); |
190 | frame_bitmap[m] |= (1<<n); |
185 | frames_free--; |
191 | frames_free--; |
186 | } |
192 | } |
187 | } |
193 | } |
188 | spinlock_unlock(&framelock); |
194 | spinlock_unlock(&framelock); |
189 | cpu_priority_restore(pri); |
195 | cpu_priority_restore(pri); |
190 | } |
196 | } |
191 | 197 | ||
192 | void frame_region_not_free(__address start, __address stop) |
198 | void frame_region_not_free(__address start, __address stop) |
193 | { |
199 | { |
194 | __address a; |
200 | __address a; |
195 | 201 | ||
196 | start /= FRAME_SIZE; |
202 | start /= FRAME_SIZE; |
197 | stop /= FRAME_SIZE; |
203 | stop /= FRAME_SIZE; |
198 | for (a = start; a <= stop; a++) |
204 | for (a = start; a <= stop; a++) |
199 | frame_not_free(a * FRAME_SIZE); |
205 | frame_not_free(a * FRAME_SIZE); |
200 | } |
206 | } |
- | 207 | ||
- | 208 | /** Initialize zonekeeping |
|
- | 209 | * |
|
- | 210 | * Initialize zonekeeping. |
|
- | 211 | */ |
|
- | 212 | void zone_init(void) |
|
- | 213 | { |
|
- | 214 | spinlock_initialize(&zone_head_lock); |
|
- | 215 | list_initialize(&zone_head); |
|
- | 216 | } |
|
- | 217 | ||
- | 218 | /** Create frame zone |
|
- | 219 | * |
|
- | 220 | * Create new frame zone. |
|
- | 221 | * |
|
- | 222 | * @param start Physical address of the first frame within the zone. |
|
- | 223 | * @param size Size of the zone. Must be a multiple of FRAME_SIZE. |
|
- | 224 | * @param flags Zone flags. |
|
- | 225 | * |
|
- | 226 | * @return Initialized zone. |
|
- | 227 | */ |
|
- | 228 | zone_t *zone_create(__address start, size_t size, int flags) |
|
- | 229 | { |
|
- | 230 | zone_t *z; |
|
- | 231 | count_t cnt; |
|
- | 232 | int i; |
|
- | 233 | ||
- | 234 | ASSERT(start % FRAME_SIZE == 0); |
|
- | 235 | ASSERT(size % FRAME_SIZE == 0); |
|
- | 236 | ||
- | 237 | cnt = size / FRAME_SIZE; |
|
- | 238 | ||
- | 239 | z = (zone_t *) malloc(sizeof(zone_t)); |
|
- | 240 | if (z) { |
|
- | 241 | link_initialize(&z->link); |
|
- | 242 | spinlock_initialize(&z->lock); |
|
- | 243 | ||
- | 244 | z->base = start; |
|
- | 245 | z->flags = flags; |
|
- | 246 | ||
- | 247 | z->free_count = cnt; |
|
- | 248 | list_initialize(&z->free_head); |
|
- | 249 | ||
- | 250 | z->busy_count = 0; |
|
- | 251 | list_initialize(&z->busy_head); |
|
- | 252 | ||
- | 253 | z->frames = (frame_t *) malloc(cnt * sizeof(frame_t)); |
|
- | 254 | if (!z->frames) { |
|
- | 255 | free(z); |
|
- | 256 | return NULL; |
|
- | 257 | } |
|
- | 258 | ||
- | 259 | for (i = 0; i<cnt; i++) { |
|
- | 260 | frame_initialize(&z->frames[i], z); |
|
- | 261 | list_append(&z->frames[i].link, &z->free_head); |
|
- | 262 | } |
|
- | 263 | ||
- | 264 | } |
|
- | 265 | ||
- | 266 | return z; |
|
- | 267 | } |
|
- | 268 | ||
- | 269 | /** Attach frame zone |
|
- | 270 | * |
|
- | 271 | * Attach frame zone to zone list. |
|
- | 272 | * |
|
- | 273 | * @param zone Zone to be attached. |
|
- | 274 | */ |
|
- | 275 | void zone_attach(zone_t *zone) |
|
- | 276 | { |
|
- | 277 | pri_t pri; |
|
- | 278 | ||
- | 279 | pri = cpu_priority_high(); |
|
- | 280 | spinlock_lock(&zone_head_lock); |
|
- | 281 | ||
- | 282 | list_append(&zone->link, &zone_head); |
|
- | 283 | ||
- | 284 | spinlock_unlock(&zone_head_lock); |
|
- | 285 | cpu_priority_restore(pri); |
|
- | 286 | } |
|
- | 287 | ||
- | 288 | /** Initialize frame structure |
|
- | 289 | * |
|
- | 290 | * Initialize frame structure. |
|
- | 291 | * |
|
- | 292 | * @param frame Frame structure to be initialized. |
|
- | 293 | * @param zone Host frame zone. |
|
- | 294 | */ |
|
- | 295 | void frame_initialize(frame_t *frame, zone_t *zone) |
|
- | 296 | { |
|
- | 297 | frame->refcount = 0; |
|
- | 298 | link_initialize(&frame->link); |
|
- | 299 | frame->zone = zone; |
|
- | 300 | } |
|
- | 301 | ||
- | 302 | /** Get address of physical frame from its frame structure |
|
- | 303 | * |
|
- | 304 | * Get address of physical frame from its frame structure. |
|
- | 305 | * |
|
- | 306 | * @param frame Frame structure of the queried frame address. |
|
- | 307 | * |
|
- | 308 | * @return Address of frame associated with the argument. |
|
- | 309 | */ |
|
- | 310 | __address frame_get_address(frame_t *frame) |
|
- | 311 | { |
|
- | 312 | __address v; |
|
- | 313 | zone_t *z; |
|
- | 314 | pri_t pri; |
|
- | 315 | ||
- | 316 | z = frame->zone; |
|
- | 317 | ||
- | 318 | pri = cpu_priority_high(); |
|
- | 319 | spinlock_lock(&z->lock); |
|
- | 320 | ||
- | 321 | v = z->base + (frame - z->frames) * FRAME_SIZE; |
|
- | 322 | ||
- | 323 | if (z->flags & FRAME_KA) |
|
- | 324 | v = PA2KA(v); |
|
- | 325 | ||
- | 326 | spinlock_unlock(&z->lock); |
|
- | 327 | cpu_priority_restore(pri); |
|
- | 328 | ||
- | 329 | return v; |
|
- | 330 | } |
|
201 | 331 |