Rev 479 | Rev 489 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
| Rev | Author | Line No. | Line |
|---|---|---|---|
| 1 | jermar | 1 | /* |
| 2 | * Copyright (C) 2005 Jakub Jermar |
||
| 480 | bondari | 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 | |||
| 30 | #ifndef __FRAME_H__ |
||
| 31 | #define __FRAME_H__ |
||
| 32 | |||
| 33 | #include <arch/types.h> |
||
| 102 | jermar | 34 | #include <typedefs.h> |
| 354 | jermar | 35 | #include <list.h> |
| 36 | #include <synch/spinlock.h> |
||
| 479 | bondari | 37 | #include <mm/buddy.h> |
| 1 | jermar | 38 | |
| 39 | #define FRAME_KA 1 /* skip frames conflicting with user address space */ |
||
| 40 | #define FRAME_PANIC 2 /* panic on failure */ |
||
| 41 | |||
| 480 | bondari | 42 | #define FRAME2ADDR(zone, frame) ((zone)->base + ((frame) - (zone)->frames) * FRAME_SIZE) |
| 43 | #define ADDR2FRAME(zone, addr) (&((zone)->frames[((addr) - (zone)->base) / FRAME_SIZE])) |
||
| 44 | #define FRAME_INDEX(zone, frame) ((count_t)((frame) - (zone)->frames)) |
||
| 45 | #define IS_BUDDY_LEFT_BLOCK(zone, frame) ((FRAME_INDEX((zone), (frame)) % (1 >> ((frame)->buddy_order + 1))) == 0) |
||
| 46 | #define IS_BUDDY_RIGHT_BLOCK(zone, frame) ((FRAME_INDEX((zone), (frame)) % (1 >> ((frame)->buddy_order + 1))) == (1 >> (frame)->buddy_order)) |
||
| 479 | bondari | 47 | |
| 480 | bondari | 48 | |
| 49 | |||
| 366 | jermar | 50 | struct zone { |
| 51 | link_t link; /**< link to previous and next zone */ |
||
| 354 | jermar | 52 | |
| 355 | jermar | 53 | spinlock_t lock; /**< this lock protects everything below */ |
| 54 | __address base; /**< physical address of the first frame in the frames array */ |
||
| 55 | frame_t *frames; /**< array of frame_t structures in this zone */ |
||
| 56 | link_t free_head; /**< list of free frame_t structures */ |
||
| 57 | count_t free_count; /**< number of frame_t structures in free list */ |
||
| 373 | jermar | 58 | count_t busy_count; /**< number of frame_t structures not in free list */ |
| 479 | bondari | 59 | |
| 480 | bondari | 60 | buddy_system_t * buddy_system; /**< buddy system for the zone */ |
| 354 | jermar | 61 | int flags; |
| 62 | }; |
||
| 63 | |||
| 64 | struct frame { |
||
| 373 | jermar | 65 | count_t refcount; /**< when == 0, the frame is in free list */ |
| 66 | link_t link; /**< link to zone free list when refcount == 0 */ |
||
| 480 | bondari | 67 | __u8 buddy_order; /**< buddy system block order */ |
| 479 | bondari | 68 | link_t buddy_link; /**< link to the next free block inside one order*/ |
| 374 | jermar | 69 | }; |
| 354 | jermar | 70 | |
| 366 | jermar | 71 | extern spinlock_t zone_head_lock; /**< this lock protects zone_head list */ |
| 72 | extern link_t zone_head; /**< list of all zones in the system */ |
||
| 354 | jermar | 73 | |
| 368 | jermar | 74 | extern void zone_init(void); |
| 75 | extern zone_t *zone_create(__address start, size_t size, int flags); |
||
| 76 | extern void zone_attach(zone_t *zone); |
||
| 1 | jermar | 77 | |
| 78 | extern void frame_init(void); |
||
| 368 | jermar | 79 | extern void frame_initialize(frame_t *frame, zone_t *zone); |
| 1 | jermar | 80 | __address frame_alloc(int flags); |
| 81 | extern void frame_free(__address addr); |
||
| 82 | extern void frame_not_free(__address addr); |
||
| 83 | extern void frame_region_not_free(__address start, __address stop); |
||
| 480 | bondari | 84 | zone_t * get_zone_by_frame(frame_t * frame); |
| 1 | jermar | 85 | |
| 366 | jermar | 86 | /* |
| 479 | bondari | 87 | * Buddy system operations |
| 88 | */ |
||
| 89 | link_t * zone_buddy_find_buddy(link_t * buddy); |
||
| 90 | link_t * zone_buddy_bisect(link_t * block); |
||
| 91 | link_t * zone_buddy_coalesce(link_t * buddy_l, link_t * buddy_r); |
||
| 92 | void zone_buddy_set_order(link_t * block, __u8 order); |
||
| 93 | __u8 zone_buddy_get_order(link_t * block); |
||
| 94 | |||
| 95 | __address zone_buddy_frame_alloc(int flags, __u8 order); |
||
| 96 | void zone_buddy_frame_free(__address addr); |
||
| 97 | |||
| 98 | /* |
||
| 366 | jermar | 99 | * TODO: Implement the following functions. |
| 100 | */ |
||
| 101 | extern frame_t *frame_reference(frame_t *frame); |
||
| 102 | extern void frame_release(frame_t *frame); |
||
| 103 | |||
| 1 | jermar | 104 | #endif |