Rev 701 | Rev 724 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 701 | Rev 703 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (C) 2001-2005 Jakub Jermar |
2 | * Copyright (C) 2001-2005 Jakub Jermar |
3 | * Copyright (C) 2005 Sergey Bondari |
3 | * Copyright (C) 2005 Sergey Bondari |
4 | * All rights reserved. |
4 | * All rights reserved. |
5 | * |
5 | * |
6 | * Redistribution and use in source and binary forms, with or without |
6 | * Redistribution and use in source and binary forms, with or without |
7 | * modification, are permitted provided that the following conditions |
7 | * modification, are permitted provided that the following conditions |
8 | * are met: |
8 | * are met: |
9 | * |
9 | * |
10 | * - Redistributions of source code must retain the above copyright |
10 | * - Redistributions of source code must retain the above copyright |
11 | * notice, this list of conditions and the following disclaimer. |
11 | * notice, this list of conditions and the following disclaimer. |
12 | * - Redistributions in binary form must reproduce the above copyright |
12 | * - Redistributions in binary form must reproduce the above copyright |
13 | * notice, this list of conditions and the following disclaimer in the |
13 | * notice, this list of conditions and the following disclaimer in the |
14 | * documentation and/or other materials provided with the distribution. |
14 | * documentation and/or other materials provided with the distribution. |
15 | * - The name of the author may not be used to endorse or promote products |
15 | * - The name of the author may not be used to endorse or promote products |
16 | * derived from this software without specific prior written permission. |
16 | * derived from this software without specific prior written permission. |
17 | * |
17 | * |
18 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
18 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
19 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
23 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
24 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
25 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
27 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
28 | */ |
28 | */ |
29 | 29 | ||
30 | #include <typedefs.h> |
30 | #include <typedefs.h> |
31 | #include <arch/types.h> |
31 | #include <arch/types.h> |
32 | #include <mm/heap.h> |
32 | #include <mm/heap.h> |
33 | #include <mm/frame.h> |
33 | #include <mm/frame.h> |
34 | #include <mm/vm.h> |
34 | #include <mm/as.h> |
35 | #include <panic.h> |
35 | #include <panic.h> |
36 | #include <debug.h> |
36 | #include <debug.h> |
37 | #include <list.h> |
37 | #include <list.h> |
38 | #include <synch/spinlock.h> |
38 | #include <synch/spinlock.h> |
39 | #include <arch/asm.h> |
39 | #include <arch/asm.h> |
40 | #include <arch.h> |
40 | #include <arch.h> |
41 | #include <print.h> |
41 | #include <print.h> |
42 | #include <align.h> |
42 | #include <align.h> |
43 | 43 | ||
44 | SPINLOCK_INITIALIZE(zone_head_lock); /**< this lock protects zone_head list */ |
44 | SPINLOCK_INITIALIZE(zone_head_lock); /**< this lock protects zone_head list */ |
45 | LIST_INITIALIZE(zone_head); /**< list of all zones in the system */ |
45 | LIST_INITIALIZE(zone_head); /**< list of all zones in the system */ |
46 | 46 | ||
47 | /** Blacklist containing non-available areas of memory. |
47 | /** Blacklist containing non-available areas of memory. |
48 | * |
48 | * |
49 | * This blacklist is used to exclude frames that cannot be allocated |
49 | * This blacklist is used to exclude frames that cannot be allocated |
50 | * (e.g. kernel memory) from available memory map. |
50 | * (e.g. kernel memory) from available memory map. |
51 | */ |
51 | */ |
52 | region_t zone_blacklist[ZONE_BLACKLIST_SIZE]; |
52 | region_t zone_blacklist[ZONE_BLACKLIST_SIZE]; |
53 | count_t zone_blacklist_count = 0; |
53 | count_t zone_blacklist_count = 0; |
54 | 54 | ||
55 | static struct buddy_system_operations zone_buddy_system_operations = { |
55 | static struct buddy_system_operations zone_buddy_system_operations = { |
56 | .find_buddy = zone_buddy_find_buddy, |
56 | .find_buddy = zone_buddy_find_buddy, |
57 | .bisect = zone_buddy_bisect, |
57 | .bisect = zone_buddy_bisect, |
58 | .coalesce = zone_buddy_coalesce, |
58 | .coalesce = zone_buddy_coalesce, |
59 | .set_order = zone_buddy_set_order, |
59 | .set_order = zone_buddy_set_order, |
60 | .get_order = zone_buddy_get_order, |
60 | .get_order = zone_buddy_get_order, |
61 | .mark_busy = zone_buddy_mark_busy, |
61 | .mark_busy = zone_buddy_mark_busy, |
62 | }; |
62 | }; |
63 | 63 | ||
64 | /** Initialize physical memory management |
64 | /** Initialize physical memory management |
65 | * |
65 | * |
66 | * Initialize physical memory managemnt. |
66 | * Initialize physical memory managemnt. |
67 | */ |
67 | */ |
68 | void frame_init(void) |
68 | void frame_init(void) |
69 | { |
69 | { |
70 | if (config.cpu_active == 1) { |
70 | if (config.cpu_active == 1) { |
71 | frame_region_not_free(KA2PA(config.base), config.kernel_size); |
71 | frame_region_not_free(KA2PA(config.base), config.kernel_size); |
72 | if (config.init_size > 0) |
72 | if (config.init_size > 0) |
73 | frame_region_not_free(KA2PA(config.init_addr), config.init_size); |
73 | frame_region_not_free(KA2PA(config.init_addr), config.init_size); |
74 | } |
74 | } |
75 | 75 | ||
76 | frame_arch_init(); |
76 | frame_arch_init(); |
77 | } |
77 | } |
78 | 78 | ||
79 | /** Allocate power-of-two frames of physical memory. |
79 | /** Allocate power-of-two frames of physical memory. |
80 | * |
80 | * |
81 | * @param flags Flags for host zone selection and address processing. |
81 | * @param flags Flags for host zone selection and address processing. |
82 | * @param order Allocate exactly 2^order frames. |
82 | * @param order Allocate exactly 2^order frames. |
83 | * |
83 | * |
84 | * @return Allocated frame. |
84 | * @return Allocated frame. |
85 | */ |
85 | */ |
86 | __address frame_alloc(int flags, __u8 order, int * status) |
86 | __address frame_alloc(int flags, __u8 order, int * status) |
87 | { |
87 | { |
88 | ipl_t ipl; |
88 | ipl_t ipl; |
89 | link_t *cur, *tmp; |
89 | link_t *cur, *tmp; |
90 | zone_t *z; |
90 | zone_t *z; |
91 | zone_t *zone = NULL; |
91 | zone_t *zone = NULL; |
92 | frame_t *frame = NULL; |
92 | frame_t *frame = NULL; |
93 | __address v; |
93 | __address v; |
94 | 94 | ||
95 | loop: |
95 | loop: |
96 | ipl = interrupts_disable(); |
96 | ipl = interrupts_disable(); |
97 | spinlock_lock(&zone_head_lock); |
97 | spinlock_lock(&zone_head_lock); |
98 | 98 | ||
99 | /* |
99 | /* |
100 | * First, find suitable frame zone. |
100 | * First, find suitable frame zone. |
101 | */ |
101 | */ |
102 | for (cur = zone_head.next; cur != &zone_head; cur = cur->next) { |
102 | for (cur = zone_head.next; cur != &zone_head; cur = cur->next) { |
103 | z = list_get_instance(cur, zone_t, link); |
103 | z = list_get_instance(cur, zone_t, link); |
104 | 104 | ||
105 | spinlock_lock(&z->lock); |
105 | spinlock_lock(&z->lock); |
106 | 106 | ||
107 | /* Check if the zone has 2^order frames area available */ |
107 | /* Check if the zone has 2^order frames area available */ |
108 | if (buddy_system_can_alloc(z->buddy_system, order)) { |
108 | if (buddy_system_can_alloc(z->buddy_system, order)) { |
109 | zone = z; |
109 | zone = z; |
110 | break; |
110 | break; |
111 | } |
111 | } |
112 | 112 | ||
113 | spinlock_unlock(&z->lock); |
113 | spinlock_unlock(&z->lock); |
114 | } |
114 | } |
115 | 115 | ||
116 | if (!zone) { |
116 | if (!zone) { |
117 | if (flags & FRAME_PANIC) |
117 | if (flags & FRAME_PANIC) |
118 | panic("Can't allocate frame.\n"); |
118 | panic("Can't allocate frame.\n"); |
119 | 119 | ||
120 | /* |
120 | /* |
121 | * TODO: Sleep until frames are available again. |
121 | * TODO: Sleep until frames are available again. |
122 | */ |
122 | */ |
123 | spinlock_unlock(&zone_head_lock); |
123 | spinlock_unlock(&zone_head_lock); |
124 | interrupts_restore(ipl); |
124 | interrupts_restore(ipl); |
125 | 125 | ||
126 | if (flags & FRAME_NON_BLOCKING) { |
126 | if (flags & FRAME_NON_BLOCKING) { |
127 | ASSERT(status != NULL); |
127 | ASSERT(status != NULL); |
128 | *status = FRAME_NO_MEMORY; |
128 | *status = FRAME_NO_MEMORY; |
129 | return NULL; |
129 | return NULL; |
130 | } |
130 | } |
131 | 131 | ||
132 | panic("Sleep not implemented.\n"); |
132 | panic("Sleep not implemented.\n"); |
133 | goto loop; |
133 | goto loop; |
134 | } |
134 | } |
135 | 135 | ||
136 | 136 | ||
137 | /* Allocate frames from zone buddy system */ |
137 | /* Allocate frames from zone buddy system */ |
138 | tmp = buddy_system_alloc(zone->buddy_system, order); |
138 | tmp = buddy_system_alloc(zone->buddy_system, order); |
139 | 139 | ||
140 | ASSERT(tmp); |
140 | ASSERT(tmp); |
141 | 141 | ||
142 | /* Update zone information. */ |
142 | /* Update zone information. */ |
143 | zone->free_count -= (1 << order); |
143 | zone->free_count -= (1 << order); |
144 | zone->busy_count += (1 << order); |
144 | zone->busy_count += (1 << order); |
145 | 145 | ||
146 | /* Frame will be actually a first frame of the block. */ |
146 | /* Frame will be actually a first frame of the block. */ |
147 | frame = list_get_instance(tmp, frame_t, buddy_link); |
147 | frame = list_get_instance(tmp, frame_t, buddy_link); |
148 | 148 | ||
149 | /* get frame address */ |
149 | /* get frame address */ |
150 | v = FRAME2ADDR(zone, frame); |
150 | v = FRAME2ADDR(zone, frame); |
151 | 151 | ||
152 | spinlock_unlock(&zone->lock); |
152 | spinlock_unlock(&zone->lock); |
153 | spinlock_unlock(&zone_head_lock); |
153 | spinlock_unlock(&zone_head_lock); |
154 | interrupts_restore(ipl); |
154 | interrupts_restore(ipl); |
155 | 155 | ||
156 | if (flags & FRAME_KA) |
156 | if (flags & FRAME_KA) |
157 | v = PA2KA(v); |
157 | v = PA2KA(v); |
158 | 158 | ||
159 | if (flags & FRAME_NON_BLOCKING) { |
159 | if (flags & FRAME_NON_BLOCKING) { |
160 | ASSERT(status != NULL); |
160 | ASSERT(status != NULL); |
161 | *status = FRAME_OK; |
161 | *status = FRAME_OK; |
162 | } |
162 | } |
163 | 163 | ||
164 | return v; |
164 | return v; |
165 | } |
165 | } |
166 | 166 | ||
167 | /** Free a frame. |
167 | /** Free a frame. |
168 | * |
168 | * |
169 | * Find respective frame structrue for supplied addr. |
169 | * Find respective frame structrue for supplied addr. |
170 | * Decrement frame reference count. |
170 | * Decrement frame reference count. |
171 | * If it drops to zero, move the frame structure to free list. |
171 | * If it drops to zero, move the frame structure to free list. |
172 | * |
172 | * |
173 | * @param addr Address of the frame to be freed. It must be a multiple of FRAME_SIZE. |
173 | * @param addr Address of the frame to be freed. It must be a multiple of FRAME_SIZE. |
174 | */ |
174 | */ |
175 | void frame_free(__address addr) |
175 | void frame_free(__address addr) |
176 | { |
176 | { |
177 | ipl_t ipl; |
177 | ipl_t ipl; |
178 | link_t *cur; |
178 | link_t *cur; |
179 | zone_t *z; |
179 | zone_t *z; |
180 | zone_t *zone = NULL; |
180 | zone_t *zone = NULL; |
181 | frame_t *frame; |
181 | frame_t *frame; |
182 | ASSERT(addr % FRAME_SIZE == 0); |
182 | ASSERT(addr % FRAME_SIZE == 0); |
183 | 183 | ||
184 | ipl = interrupts_disable(); |
184 | ipl = interrupts_disable(); |
185 | spinlock_lock(&zone_head_lock); |
185 | spinlock_lock(&zone_head_lock); |
186 | 186 | ||
187 | /* |
187 | /* |
188 | * First, find host frame zone for addr. |
188 | * First, find host frame zone for addr. |
189 | */ |
189 | */ |
190 | for (cur = zone_head.next; cur != &zone_head; cur = cur->next) { |
190 | for (cur = zone_head.next; cur != &zone_head; cur = cur->next) { |
191 | z = list_get_instance(cur, zone_t, link); |
191 | z = list_get_instance(cur, zone_t, link); |
192 | 192 | ||
193 | spinlock_lock(&z->lock); |
193 | spinlock_lock(&z->lock); |
194 | 194 | ||
195 | if (IS_KA(addr)) |
195 | if (IS_KA(addr)) |
196 | addr = KA2PA(addr); |
196 | addr = KA2PA(addr); |
197 | 197 | ||
198 | /* |
198 | /* |
199 | * Check if addr belongs to z. |
199 | * Check if addr belongs to z. |
200 | */ |
200 | */ |
201 | if ((addr >= z->base) && (addr <= z->base + (z->free_count + z->busy_count) * FRAME_SIZE)) { |
201 | if ((addr >= z->base) && (addr <= z->base + (z->free_count + z->busy_count) * FRAME_SIZE)) { |
202 | zone = z; |
202 | zone = z; |
203 | break; |
203 | break; |
204 | } |
204 | } |
205 | 205 | ||
206 | spinlock_unlock(&z->lock); |
206 | spinlock_unlock(&z->lock); |
207 | } |
207 | } |
208 | 208 | ||
209 | ASSERT(zone != NULL); |
209 | ASSERT(zone != NULL); |
210 | 210 | ||
211 | frame = ADDR2FRAME(zone, addr); |
211 | frame = ADDR2FRAME(zone, addr); |
212 | 212 | ||
213 | ASSERT(frame->refcount); |
213 | ASSERT(frame->refcount); |
214 | 214 | ||
215 | if (!--frame->refcount) { |
215 | if (!--frame->refcount) { |
216 | buddy_system_free(zone->buddy_system, &frame->buddy_link); |
216 | buddy_system_free(zone->buddy_system, &frame->buddy_link); |
217 | } |
217 | } |
218 | 218 | ||
219 | /* Update zone information. */ |
219 | /* Update zone information. */ |
220 | zone->free_count += (1 << frame->buddy_order); |
220 | zone->free_count += (1 << frame->buddy_order); |
221 | zone->busy_count -= (1 << frame->buddy_order); |
221 | zone->busy_count -= (1 << frame->buddy_order); |
222 | 222 | ||
223 | spinlock_unlock(&zone->lock); |
223 | spinlock_unlock(&zone->lock); |
224 | spinlock_unlock(&zone_head_lock); |
224 | spinlock_unlock(&zone_head_lock); |
225 | interrupts_restore(ipl); |
225 | interrupts_restore(ipl); |
226 | } |
226 | } |
227 | 227 | ||
228 | /** Mark frame region not free. |
228 | /** Mark frame region not free. |
229 | * |
229 | * |
230 | * Mark frame region not free. |
230 | * Mark frame region not free. |
231 | * |
231 | * |
232 | * @param base Base address of non-available region. |
232 | * @param base Base address of non-available region. |
233 | * @param size Size of non-available region. |
233 | * @param size Size of non-available region. |
234 | */ |
234 | */ |
235 | void frame_region_not_free(__address base, size_t size) |
235 | void frame_region_not_free(__address base, size_t size) |
236 | { |
236 | { |
237 | index_t index; |
237 | index_t index; |
238 | index = zone_blacklist_count++; |
238 | index = zone_blacklist_count++; |
239 | 239 | ||
240 | /* Force base to the nearest lower address frame boundary. */ |
240 | /* Force base to the nearest lower address frame boundary. */ |
241 | base = ALIGN_DOWN(base, FRAME_SIZE); |
241 | base = ALIGN_DOWN(base, FRAME_SIZE); |
242 | /* Align size to frame boundary. */ |
242 | /* Align size to frame boundary. */ |
243 | size = ALIGN_UP(size, FRAME_SIZE); |
243 | size = ALIGN_UP(size, FRAME_SIZE); |
244 | 244 | ||
245 | ASSERT(index < ZONE_BLACKLIST_SIZE); |
245 | ASSERT(index < ZONE_BLACKLIST_SIZE); |
246 | zone_blacklist[index].base = base; |
246 | zone_blacklist[index].base = base; |
247 | zone_blacklist[index].size = size; |
247 | zone_blacklist[index].size = size; |
248 | } |
248 | } |
249 | 249 | ||
250 | /** Create frame zones in region of available memory. |
250 | /** Create frame zones in region of available memory. |
251 | * |
251 | * |
252 | * Avoid any black listed areas of non-available memory. |
252 | * Avoid any black listed areas of non-available memory. |
253 | * Assume that the black listed areas cannot overlap |
253 | * Assume that the black listed areas cannot overlap |
254 | * one another or cross available memory region boundaries. |
254 | * one another or cross available memory region boundaries. |
255 | * |
255 | * |
256 | * @param base Base address of available memory region. |
256 | * @param base Base address of available memory region. |
257 | * @param size Size of the region. |
257 | * @param size Size of the region. |
258 | */ |
258 | */ |
259 | void zone_create_in_region(__address base, size_t size) { |
259 | void zone_create_in_region(__address base, size_t size) { |
260 | int i; |
260 | int i; |
261 | zone_t * z; |
261 | zone_t * z; |
262 | __address s; |
262 | __address s; |
263 | size_t sz; |
263 | size_t sz; |
264 | 264 | ||
265 | ASSERT(base % FRAME_SIZE == 0); |
265 | ASSERT(base % FRAME_SIZE == 0); |
266 | ASSERT(size % FRAME_SIZE == 0); |
266 | ASSERT(size % FRAME_SIZE == 0); |
267 | 267 | ||
268 | if (!size) |
268 | if (!size) |
269 | return; |
269 | return; |
270 | 270 | ||
271 | for (i = 0; i < zone_blacklist_count; i++) { |
271 | for (i = 0; i < zone_blacklist_count; i++) { |
272 | if (zone_blacklist[i].base >= base && zone_blacklist[i].base < base + size) { |
272 | if (zone_blacklist[i].base >= base && zone_blacklist[i].base < base + size) { |
273 | s = base; sz = zone_blacklist[i].base - base; |
273 | s = base; sz = zone_blacklist[i].base - base; |
274 | ASSERT(base != s || sz != size); |
274 | ASSERT(base != s || sz != size); |
275 | zone_create_in_region(s, sz); |
275 | zone_create_in_region(s, sz); |
276 | 276 | ||
277 | s = zone_blacklist[i].base + zone_blacklist[i].size; |
277 | s = zone_blacklist[i].base + zone_blacklist[i].size; |
278 | sz = (base + size) - (zone_blacklist[i].base + zone_blacklist[i].size); |
278 | sz = (base + size) - (zone_blacklist[i].base + zone_blacklist[i].size); |
279 | ASSERT(base != s || sz != size); |
279 | ASSERT(base != s || sz != size); |
280 | zone_create_in_region(s, sz); |
280 | zone_create_in_region(s, sz); |
281 | return; |
281 | return; |
282 | 282 | ||
283 | } |
283 | } |
284 | } |
284 | } |
285 | 285 | ||
286 | z = zone_create(base, size, 0); |
286 | z = zone_create(base, size, 0); |
287 | 287 | ||
288 | if (!z) { |
288 | if (!z) { |
289 | panic("Cannot allocate zone (base=%P, size=%d).\n", base, size); |
289 | panic("Cannot allocate zone (base=%P, size=%d).\n", base, size); |
290 | } |
290 | } |
291 | 291 | ||
292 | zone_attach(z); |
292 | zone_attach(z); |
293 | } |
293 | } |
294 | 294 | ||
295 | 295 | ||
296 | /** Create frame zone |
296 | /** Create frame zone |
297 | * |
297 | * |
298 | * Create new frame zone. |
298 | * Create new frame zone. |
299 | * |
299 | * |
300 | * @param start Physical address of the first frame within the zone. |
300 | * @param start Physical address of the first frame within the zone. |
301 | * @param size Size of the zone. Must be a multiple of FRAME_SIZE. |
301 | * @param size Size of the zone. Must be a multiple of FRAME_SIZE. |
302 | * @param flags Zone flags. |
302 | * @param flags Zone flags. |
303 | * |
303 | * |
304 | * @return Initialized zone. |
304 | * @return Initialized zone. |
305 | */ |
305 | */ |
306 | zone_t * zone_create(__address start, size_t size, int flags) |
306 | zone_t * zone_create(__address start, size_t size, int flags) |
307 | { |
307 | { |
308 | zone_t *z; |
308 | zone_t *z; |
309 | count_t cnt; |
309 | count_t cnt; |
310 | int i; |
310 | int i; |
311 | __u8 max_order; |
311 | __u8 max_order; |
312 | 312 | ||
313 | ASSERT(start % FRAME_SIZE == 0); |
313 | ASSERT(start % FRAME_SIZE == 0); |
314 | ASSERT(size % FRAME_SIZE == 0); |
314 | ASSERT(size % FRAME_SIZE == 0); |
315 | 315 | ||
316 | cnt = size / FRAME_SIZE; |
316 | cnt = size / FRAME_SIZE; |
317 | 317 | ||
318 | z = (zone_t *) early_malloc(sizeof(zone_t)); |
318 | z = (zone_t *) early_malloc(sizeof(zone_t)); |
319 | if (z) { |
319 | if (z) { |
320 | link_initialize(&z->link); |
320 | link_initialize(&z->link); |
321 | spinlock_initialize(&z->lock, "zone_lock"); |
321 | spinlock_initialize(&z->lock, "zone_lock"); |
322 | 322 | ||
323 | z->base = start; |
323 | z->base = start; |
324 | z->flags = flags; |
324 | z->flags = flags; |
325 | 325 | ||
326 | z->free_count = cnt; |
326 | z->free_count = cnt; |
327 | z->busy_count = 0; |
327 | z->busy_count = 0; |
328 | 328 | ||
329 | z->frames = (frame_t *) early_malloc(cnt * sizeof(frame_t)); |
329 | z->frames = (frame_t *) early_malloc(cnt * sizeof(frame_t)); |
330 | if (!z->frames) { |
330 | if (!z->frames) { |
331 | early_free(z); |
331 | early_free(z); |
332 | return NULL; |
332 | return NULL; |
333 | } |
333 | } |
334 | 334 | ||
335 | for (i = 0; i<cnt; i++) { |
335 | for (i = 0; i<cnt; i++) { |
336 | frame_initialize(&z->frames[i], z); |
336 | frame_initialize(&z->frames[i], z); |
337 | } |
337 | } |
338 | 338 | ||
339 | /* |
339 | /* |
340 | * Create buddy system for the zone |
340 | * Create buddy system for the zone |
341 | */ |
341 | */ |
342 | for (max_order = 0; cnt >> max_order; max_order++) |
342 | for (max_order = 0; cnt >> max_order; max_order++) |
343 | ; |
343 | ; |
344 | z->buddy_system = buddy_system_create(max_order, &zone_buddy_system_operations, (void *) z); |
344 | z->buddy_system = buddy_system_create(max_order, &zone_buddy_system_operations, (void *) z); |
345 | 345 | ||
346 | /* Stuffing frames */ |
346 | /* Stuffing frames */ |
347 | for (i = 0; i<cnt; i++) { |
347 | for (i = 0; i<cnt; i++) { |
348 | z->frames[i].refcount = 0; |
348 | z->frames[i].refcount = 0; |
349 | buddy_system_free(z->buddy_system, &z->frames[i].buddy_link); |
349 | buddy_system_free(z->buddy_system, &z->frames[i].buddy_link); |
350 | } |
350 | } |
351 | } |
351 | } |
352 | return z; |
352 | return z; |
353 | } |
353 | } |
354 | 354 | ||
355 | /** Attach frame zone |
355 | /** Attach frame zone |
356 | * |
356 | * |
357 | * Attach frame zone to zone list. |
357 | * Attach frame zone to zone list. |
358 | * |
358 | * |
359 | * @param zone Zone to be attached. |
359 | * @param zone Zone to be attached. |
360 | */ |
360 | */ |
361 | void zone_attach(zone_t *zone) |
361 | void zone_attach(zone_t *zone) |
362 | { |
362 | { |
363 | ipl_t ipl; |
363 | ipl_t ipl; |
364 | 364 | ||
365 | ipl = interrupts_disable(); |
365 | ipl = interrupts_disable(); |
366 | spinlock_lock(&zone_head_lock); |
366 | spinlock_lock(&zone_head_lock); |
367 | 367 | ||
368 | list_append(&zone->link, &zone_head); |
368 | list_append(&zone->link, &zone_head); |
369 | 369 | ||
370 | spinlock_unlock(&zone_head_lock); |
370 | spinlock_unlock(&zone_head_lock); |
371 | interrupts_restore(ipl); |
371 | interrupts_restore(ipl); |
372 | } |
372 | } |
373 | 373 | ||
374 | /** Initialize frame structure |
374 | /** Initialize frame structure |
375 | * |
375 | * |
376 | * Initialize frame structure. |
376 | * Initialize frame structure. |
377 | * |
377 | * |
378 | * @param frame Frame structure to be initialized. |
378 | * @param frame Frame structure to be initialized. |
379 | * @param zone Host frame zone. |
379 | * @param zone Host frame zone. |
380 | */ |
380 | */ |
381 | void frame_initialize(frame_t *frame, zone_t *zone) |
381 | void frame_initialize(frame_t *frame, zone_t *zone) |
382 | { |
382 | { |
383 | frame->refcount = 1; |
383 | frame->refcount = 1; |
384 | frame->buddy_order = 0; |
384 | frame->buddy_order = 0; |
385 | } |
385 | } |
386 | 386 | ||
387 | 387 | ||
388 | /** Buddy system find_buddy implementation |
388 | /** Buddy system find_buddy implementation |
389 | * |
389 | * |
390 | * @param b Buddy system. |
390 | * @param b Buddy system. |
391 | * @param block Block for which buddy should be found |
391 | * @param block Block for which buddy should be found |
392 | * |
392 | * |
393 | * @return Buddy for given block if found |
393 | * @return Buddy for given block if found |
394 | */ |
394 | */ |
395 | link_t * zone_buddy_find_buddy(buddy_system_t *b, link_t * block) { |
395 | link_t * zone_buddy_find_buddy(buddy_system_t *b, link_t * block) { |
396 | frame_t * frame; |
396 | frame_t * frame; |
397 | zone_t * zone; |
397 | zone_t * zone; |
398 | index_t index; |
398 | index_t index; |
399 | bool is_left, is_right; |
399 | bool is_left, is_right; |
400 | 400 | ||
401 | frame = list_get_instance(block, frame_t, buddy_link); |
401 | frame = list_get_instance(block, frame_t, buddy_link); |
402 | zone = (zone_t *) b->data; |
402 | zone = (zone_t *) b->data; |
403 | 403 | ||
404 | ASSERT(IS_BUDDY_ORDER_OK(FRAME_INDEX(zone, frame), frame->buddy_order)); |
404 | ASSERT(IS_BUDDY_ORDER_OK(FRAME_INDEX(zone, frame), frame->buddy_order)); |
405 | 405 | ||
406 | is_left = IS_BUDDY_LEFT_BLOCK(zone, frame); |
406 | is_left = IS_BUDDY_LEFT_BLOCK(zone, frame); |
407 | is_right = IS_BUDDY_RIGHT_BLOCK(zone, frame); |
407 | is_right = IS_BUDDY_RIGHT_BLOCK(zone, frame); |
408 | 408 | ||
409 | ASSERT(is_left ^ is_right); |
409 | ASSERT(is_left ^ is_right); |
410 | 410 | ||
411 | if (is_left) { |
411 | if (is_left) { |
412 | index = (FRAME_INDEX(zone, frame)) + (1 << frame->buddy_order); |
412 | index = (FRAME_INDEX(zone, frame)) + (1 << frame->buddy_order); |
413 | } else { // if (is_right) |
413 | } else { // if (is_right) |
414 | index = (FRAME_INDEX(zone, frame)) - (1 << frame->buddy_order); |
414 | index = (FRAME_INDEX(zone, frame)) - (1 << frame->buddy_order); |
415 | } |
415 | } |
416 | 416 | ||
417 | if (FRAME_INDEX_VALID(zone, index)) { |
417 | if (FRAME_INDEX_VALID(zone, index)) { |
418 | if ( zone->frames[index].buddy_order == frame->buddy_order && |
418 | if ( zone->frames[index].buddy_order == frame->buddy_order && |
419 | zone->frames[index].refcount == 0) { |
419 | zone->frames[index].refcount == 0) { |
420 | return &zone->frames[index].buddy_link; |
420 | return &zone->frames[index].buddy_link; |
421 | } |
421 | } |
422 | } |
422 | } |
423 | 423 | ||
424 | return NULL; |
424 | return NULL; |
425 | } |
425 | } |
426 | 426 | ||
427 | /** Buddy system bisect implementation |
427 | /** Buddy system bisect implementation |
428 | * |
428 | * |
429 | * @param b Buddy system. |
429 | * @param b Buddy system. |
430 | * @param block Block to bisect |
430 | * @param block Block to bisect |
431 | * |
431 | * |
432 | * @return right block |
432 | * @return right block |
433 | */ |
433 | */ |
434 | link_t * zone_buddy_bisect(buddy_system_t *b, link_t * block) { |
434 | link_t * zone_buddy_bisect(buddy_system_t *b, link_t * block) { |
435 | frame_t * frame_l, * frame_r; |
435 | frame_t * frame_l, * frame_r; |
436 | 436 | ||
437 | frame_l = list_get_instance(block, frame_t, buddy_link); |
437 | frame_l = list_get_instance(block, frame_t, buddy_link); |
438 | frame_r = (frame_l + (1 << (frame_l->buddy_order - 1))); |
438 | frame_r = (frame_l + (1 << (frame_l->buddy_order - 1))); |
439 | 439 | ||
440 | return &frame_r->buddy_link; |
440 | return &frame_r->buddy_link; |
441 | } |
441 | } |
442 | 442 | ||
443 | /** Buddy system coalesce implementation |
443 | /** Buddy system coalesce implementation |
444 | * |
444 | * |
445 | * @param b Buddy system. |
445 | * @param b Buddy system. |
446 | * @param block_1 First block |
446 | * @param block_1 First block |
447 | * @param block_2 First block's buddy |
447 | * @param block_2 First block's buddy |
448 | * |
448 | * |
449 | * @return Coalesced block (actually block that represents lower address) |
449 | * @return Coalesced block (actually block that represents lower address) |
450 | */ |
450 | */ |
451 | link_t * zone_buddy_coalesce(buddy_system_t *b, link_t * block_1, link_t * block_2) { |
451 | link_t * zone_buddy_coalesce(buddy_system_t *b, link_t * block_1, link_t * block_2) { |
452 | frame_t * frame1, * frame2; |
452 | frame_t * frame1, * frame2; |
453 | 453 | ||
454 | frame1 = list_get_instance(block_1, frame_t, buddy_link); |
454 | frame1 = list_get_instance(block_1, frame_t, buddy_link); |
455 | frame2 = list_get_instance(block_2, frame_t, buddy_link); |
455 | frame2 = list_get_instance(block_2, frame_t, buddy_link); |
456 | 456 | ||
457 | return frame1 < frame2 ? block_1 : block_2; |
457 | return frame1 < frame2 ? block_1 : block_2; |
458 | } |
458 | } |
459 | 459 | ||
460 | /** Buddy system set_order implementation |
460 | /** Buddy system set_order implementation |
461 | * |
461 | * |
462 | * @param b Buddy system. |
462 | * @param b Buddy system. |
463 | * @param block Buddy system block |
463 | * @param block Buddy system block |
464 | * @param order Order to set |
464 | * @param order Order to set |
465 | */ |
465 | */ |
466 | void zone_buddy_set_order(buddy_system_t *b, link_t * block, __u8 order) { |
466 | void zone_buddy_set_order(buddy_system_t *b, link_t * block, __u8 order) { |
467 | frame_t * frame; |
467 | frame_t * frame; |
468 | frame = list_get_instance(block, frame_t, buddy_link); |
468 | frame = list_get_instance(block, frame_t, buddy_link); |
469 | frame->buddy_order = order; |
469 | frame->buddy_order = order; |
470 | } |
470 | } |
471 | 471 | ||
472 | /** Buddy system get_order implementation |
472 | /** Buddy system get_order implementation |
473 | * |
473 | * |
474 | * @param b Buddy system. |
474 | * @param b Buddy system. |
475 | * @param block Buddy system block |
475 | * @param block Buddy system block |
476 | * |
476 | * |
477 | * @return Order of block |
477 | * @return Order of block |
478 | */ |
478 | */ |
479 | __u8 zone_buddy_get_order(buddy_system_t *b, link_t * block) { |
479 | __u8 zone_buddy_get_order(buddy_system_t *b, link_t * block) { |
480 | frame_t * frame; |
480 | frame_t * frame; |
481 | frame = list_get_instance(block, frame_t, buddy_link); |
481 | frame = list_get_instance(block, frame_t, buddy_link); |
482 | return frame->buddy_order; |
482 | return frame->buddy_order; |
483 | } |
483 | } |
484 | 484 | ||
485 | /** Buddy system mark_busy implementation |
485 | /** Buddy system mark_busy implementation |
486 | * |
486 | * |
487 | * @param b Buddy system |
487 | * @param b Buddy system |
488 | * @param block Buddy system block |
488 | * @param block Buddy system block |
489 | * |
489 | * |
490 | */ |
490 | */ |
491 | void zone_buddy_mark_busy(buddy_system_t *b, link_t * block) { |
491 | void zone_buddy_mark_busy(buddy_system_t *b, link_t * block) { |
492 | frame_t * frame; |
492 | frame_t * frame; |
493 | frame = list_get_instance(block, frame_t, buddy_link); |
493 | frame = list_get_instance(block, frame_t, buddy_link); |
494 | frame->refcount = 1; |
494 | frame->refcount = 1; |
495 | } |
495 | } |
496 | 496 | ||
497 | /** Prints list of zones |
497 | /** Prints list of zones |
498 | * |
498 | * |
499 | */ |
499 | */ |
500 | void zone_print_list(void) { |
500 | void zone_print_list(void) { |
501 | zone_t *zone = NULL; |
501 | zone_t *zone = NULL; |
502 | link_t *cur; |
502 | link_t *cur; |
503 | ipl_t ipl; |
503 | ipl_t ipl; |
504 | 504 | ||
505 | ipl = interrupts_disable(); |
505 | ipl = interrupts_disable(); |
506 | spinlock_lock(&zone_head_lock); |
506 | spinlock_lock(&zone_head_lock); |
507 | printf("Base address\tFree Frames\tBusy Frames\n"); |
507 | printf("Base address\tFree Frames\tBusy Frames\n"); |
508 | printf("------------\t-----------\t-----------\n"); |
508 | printf("------------\t-----------\t-----------\n"); |
509 | for (cur = zone_head.next; cur != &zone_head; cur = cur->next) { |
509 | for (cur = zone_head.next; cur != &zone_head; cur = cur->next) { |
510 | zone = list_get_instance(cur, zone_t, link); |
510 | zone = list_get_instance(cur, zone_t, link); |
511 | spinlock_lock(&zone->lock); |
511 | spinlock_lock(&zone->lock); |
512 | printf("%L\t%d\t\t%d\n",zone->base, zone->free_count, zone->busy_count); |
512 | printf("%L\t%d\t\t%d\n",zone->base, zone->free_count, zone->busy_count); |
513 | spinlock_unlock(&zone->lock); |
513 | spinlock_unlock(&zone->lock); |
514 | } |
514 | } |
515 | spinlock_unlock(&zone_head_lock); |
515 | spinlock_unlock(&zone_head_lock); |
516 | interrupts_restore(ipl); |
516 | interrupts_restore(ipl); |
517 | } |
517 | } |
518 | 518 | ||
519 | /** Prints zone details |
519 | /** Prints zone details |
520 | * |
520 | * |
521 | * @param base Zone base address |
521 | * @param base Zone base address |
522 | */ |
522 | */ |
523 | void zone_print_one(__address base) { |
523 | void zone_print_one(__address base) { |
524 | zone_t *zone = NULL, *z ; |
524 | zone_t *zone = NULL, *z ; |
525 | link_t *cur; |
525 | link_t *cur; |
526 | ipl_t ipl; |
526 | ipl_t ipl; |
527 | 527 | ||
528 | ipl = interrupts_disable(); |
528 | ipl = interrupts_disable(); |
529 | spinlock_lock(&zone_head_lock); |
529 | spinlock_lock(&zone_head_lock); |
530 | 530 | ||
531 | for (cur = zone_head.next; cur != &zone_head; cur = cur->next) { |
531 | for (cur = zone_head.next; cur != &zone_head; cur = cur->next) { |
532 | z = list_get_instance(cur, zone_t, link); |
532 | z = list_get_instance(cur, zone_t, link); |
533 | if (base == z->base) { |
533 | if (base == z->base) { |
534 | zone = z; |
534 | zone = z; |
535 | break; |
535 | break; |
536 | } |
536 | } |
537 | } |
537 | } |
538 | 538 | ||
539 | if (!zone) { |
539 | if (!zone) { |
540 | spinlock_unlock(&zone_head_lock); |
540 | spinlock_unlock(&zone_head_lock); |
541 | interrupts_restore(ipl); |
541 | interrupts_restore(ipl); |
542 | printf("No zone with address %X\n", base); |
542 | printf("No zone with address %X\n", base); |
543 | return; |
543 | return; |
544 | } |
544 | } |
545 | 545 | ||
546 | spinlock_lock(&zone->lock); |
546 | spinlock_lock(&zone->lock); |
547 | printf("Memory zone information\n\n"); |
547 | printf("Memory zone information\n\n"); |
548 | printf("Zone base address: %P\n", zone->base); |
548 | printf("Zone base address: %P\n", zone->base); |
549 | printf("Zone size: %d frames (%dK)\n", zone->free_count + zone->busy_count, ((zone->free_count + zone->busy_count) * FRAME_SIZE) >> 10); |
549 | printf("Zone size: %d frames (%dK)\n", zone->free_count + zone->busy_count, ((zone->free_count + zone->busy_count) * FRAME_SIZE) >> 10); |
550 | printf("Allocated space: %d frames (%dK)\n", zone->busy_count, (zone->busy_count * FRAME_SIZE) >> 10); |
550 | printf("Allocated space: %d frames (%dK)\n", zone->busy_count, (zone->busy_count * FRAME_SIZE) >> 10); |
551 | printf("Available space: %d (%dK)\n", zone->free_count, (zone->free_count * FRAME_SIZE) >> 10); |
551 | printf("Available space: %d (%dK)\n", zone->free_count, (zone->free_count * FRAME_SIZE) >> 10); |
552 | 552 | ||
553 | printf("\nBuddy allocator structures:\n\n"); |
553 | printf("\nBuddy allocator structures:\n\n"); |
554 | buddy_system_structure_print(zone->buddy_system, FRAME_SIZE); |
554 | buddy_system_structure_print(zone->buddy_system, FRAME_SIZE); |
555 | 555 | ||
556 | spinlock_unlock(&zone->lock); |
556 | spinlock_unlock(&zone->lock); |
557 | spinlock_unlock(&zone_head_lock); |
557 | spinlock_unlock(&zone_head_lock); |
558 | interrupts_restore(ipl); |
558 | interrupts_restore(ipl); |
559 | } |
559 | } |
560 | 560 | ||
561 | 561 |