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