| 1 | /*
|
|---|
| 2 | * Copyright (C) 2005 Jakub Jermar
|
|---|
| 3 | * Copyright (C) 2005 Sergey Bondari
|
|---|
| 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>
|
|---|
| 34 | #include <typedefs.h>
|
|---|
| 35 | #include <list.h>
|
|---|
| 36 | #include <synch/spinlock.h>
|
|---|
| 37 | #include <mm/buddy.h>
|
|---|
| 38 |
|
|---|
| 39 | #define ONE_FRAME 0
|
|---|
| 40 |
|
|---|
| 41 | #define FRAME_KA 1 /* skip frames conflicting with user address space */
|
|---|
| 42 | #define FRAME_PANIC 2 /* panic on failure */
|
|---|
| 43 |
|
|---|
| 44 | #define FRAME2ADDR(zone, frame) ((zone)->base + ((frame) - (zone)->frames) * FRAME_SIZE)
|
|---|
| 45 | #define ADDR2FRAME(zone, addr) (&((zone)->frames[((addr) - (zone)->base) / FRAME_SIZE]))
|
|---|
| 46 | #define FRAME_INDEX(zone, frame) ((index_t)((frame) - (zone)->frames))
|
|---|
| 47 | #define FRAME_INDEX_VALID(zone, index) (((index) >= 0) && ((index) < ((zone)->free_count + (zone)->busy_count)))
|
|---|
| 48 | #define IS_BUDDY_LEFT_BLOCK(zone, frame) ((FRAME_INDEX((zone), (frame)) & ~(((__native) -1)<<((frame)->buddy_order + 1))) == 0)
|
|---|
| 49 |
|
|---|
| 50 | #define ZONE_BLACKLIST_SIZE 3
|
|---|
| 51 |
|
|---|
| 52 | struct zone {
|
|---|
| 53 | link_t link; /**< link to previous and next zone */
|
|---|
| 54 |
|
|---|
| 55 | spinlock_t lock; /**< this lock protects everything below */
|
|---|
| 56 | __address base; /**< physical address of the first frame in the frames array */
|
|---|
| 57 | frame_t *frames; /**< array of frame_t structures in this zone */
|
|---|
| 58 | count_t free_count; /**< number of free frame_t structures */
|
|---|
| 59 | count_t busy_count; /**< number of busy frame_t structures */
|
|---|
| 60 |
|
|---|
| 61 | buddy_system_t * buddy_system; /**< buddy system for the zone */
|
|---|
| 62 | int flags;
|
|---|
| 63 | };
|
|---|
| 64 |
|
|---|
| 65 | struct frame {
|
|---|
| 66 | count_t refcount; /**< tracking of shared frames */
|
|---|
| 67 | __u8 buddy_order; /**< buddy system block order */
|
|---|
| 68 | link_t buddy_link; /**< link to the next free block inside one order */
|
|---|
| 69 | };
|
|---|
| 70 |
|
|---|
| 71 | struct region {
|
|---|
| 72 | __address base;
|
|---|
| 73 | size_t size;
|
|---|
| 74 | };
|
|---|
| 75 |
|
|---|
| 76 | extern region_t zone_blacklist[];
|
|---|
| 77 | extern count_t zone_blacklist_count;
|
|---|
| 78 | extern void frame_region_not_free(__address base, size_t size);
|
|---|
| 79 | extern void zone_create_in_region(__address base, size_t size);
|
|---|
| 80 |
|
|---|
| 81 | extern spinlock_t zone_head_lock; /**< this lock protects zone_head list */
|
|---|
| 82 | extern link_t zone_head; /**< list of all zones in the system */
|
|---|
| 83 |
|
|---|
| 84 | extern void zone_init(void);
|
|---|
| 85 | extern zone_t *zone_create(__address start, size_t size, int flags);
|
|---|
| 86 | extern void zone_attach(zone_t *zone);
|
|---|
| 87 |
|
|---|
| 88 | extern void frame_init(void);
|
|---|
| 89 | extern void frame_initialize(frame_t *frame, zone_t *zone);
|
|---|
| 90 | __address frame_alloc(int flags, __u8 order);
|
|---|
| 91 | extern void frame_free(__address addr);
|
|---|
| 92 | zone_t * get_zone_by_frame(frame_t * frame);
|
|---|
| 93 |
|
|---|
| 94 | /*
|
|---|
| 95 | * Buddy system operations
|
|---|
| 96 | */
|
|---|
| 97 | link_t * zone_buddy_find_buddy(buddy_system_t *b, link_t * buddy);
|
|---|
| 98 | link_t * zone_buddy_bisect(buddy_system_t *b, link_t * block);
|
|---|
| 99 | link_t * zone_buddy_coalesce(buddy_system_t *b, link_t * buddy_l, link_t * buddy_r);
|
|---|
| 100 | void zone_buddy_set_order(buddy_system_t *b, link_t * block, __u8 order);
|
|---|
| 101 | __u8 zone_buddy_get_order(buddy_system_t *b, link_t * block);
|
|---|
| 102 | void zone_buddy_mark_busy(buddy_system_t *b, link_t * block);
|
|---|
| 103 |
|
|---|
| 104 | /*
|
|---|
| 105 | * TODO: Implement the following functions.
|
|---|
| 106 | */
|
|---|
| 107 | extern frame_t *frame_reference(frame_t *frame);
|
|---|
| 108 | extern void frame_release(frame_t *frame);
|
|---|
| 109 |
|
|---|
| 110 | #endif
|
|---|
