WebSVN – HelenOS-historic – Diff – /kernel/trunk/generic/src/mm/frame.c


/*
 * Copyright (C) 2001-2005 Jakub Jermar
 * Copyright (C) 2005 Sergey Bondari
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
#include <typedefs.h>
#include <arch/types.h>
#include <mm/heap.h>
#include <mm/frame.h>
#include <mm/vm.h>
#include <panic.h>
#include <debug.h>
#include <list.h>
#include <synch/spinlock.h>
#include <arch/asm.h>
#include <arch.h>
#include <print.h>
#include <align.h>
 
SPINLOCK_INITIALIZE(zone_head_lock);    /**< this lock protects zone_head list */
LIST_INITIALIZE(zone_head);             /**< list of all zones in the system */
 
/** Blacklist containing non-available areas of memory.
 *
 * This blacklist is used to exclude frames that cannot be allocated
 * (e.g. kernel memory) from available memory map.
 */
region_t zone_blacklist[ZONE_BLACKLIST_SIZE];
count_t zone_blacklist_count = 0;
 
static struct buddy_system_operations  zone_buddy_system_operations = {
    .find_buddy = zone_buddy_find_buddy,
    .bisect = zone_buddy_bisect,
    .coalesce = zone_buddy_coalesce,
    .set_order = zone_buddy_set_order,
    .get_order = zone_buddy_get_order,
    .mark_busy = zone_buddy_mark_busy,
};
 
/** Initialize physical memory management
 *
 * Initialize physical memory managemnt.
 */
void frame_init(void)
{
    if (config.cpu_active == 1) {
        frame_region_not_free(KA2PA(config.base), config.kernel_size);
        if (config.init_size > 0)
            frame_region_not_free(KA2PA(config.init_addr), config.init_size);
    }
 
    frame_arch_init();
}
 
/** Allocate power-of-two frames of physical memory.
 *
 * @param flags Flags for host zone selection and address processing.
 * @param order Allocate exactly 2^order frames.
 *
 * @return Allocated frame.
 */
__address frame_alloc(int flags, __u8 order)
{
    ipl_t ipl;
    link_t *cur, *tmp;
    zone_t *z;
    zone_t *zone = NULL;
    frame_t *frame = NULL;
    __address v;
   
loop:
    ipl = interrupts_disable();
    spinlock_lock(&zone_head_lock);
 
    /*
     * First, find suitable frame zone.
     */
    for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {
        z = list_get_instance(cur, zone_t, link);
       
        spinlock_lock(&z->lock);
 
        /* Check if the zone has 2^order frames area available  */
        if (buddy_system_can_alloc(z->buddy_system, order)) {
            zone = z;
            break;
        }
       
        spinlock_unlock(&z->lock);
    }
   
    if (!zone) {
        if (flags & FRAME_PANIC)
            panic("Can't allocate frame.\n");
       
        /*
         * TODO: Sleep until frames are available again.
         */
        spinlock_unlock(&zone_head_lock);
        interrupts_restore(ipl);
 
        panic("Sleep not implemented.\n");
        goto loop;
    }
       
 
    /* Allocate frames from zone buddy system */
    tmp = buddy_system_alloc(zone->buddy_system, order);
   
    ASSERT(tmp);
   
    /* Update zone information. */
    zone->free_count -= (1 << order);
    zone->busy_count += (1 << order);
 
    /* Frame will be actually a first frame of the block. */
    frame = list_get_instance(tmp, frame_t, buddy_link);
   
    /* get frame address */
    v = FRAME2ADDR(zone, frame);
 
    spinlock_unlock(&zone->lock);
    spinlock_unlock(&zone_head_lock);
    interrupts_restore(ipl);
 
 
    if (flags & FRAME_KA)
        v = PA2KA(v);
   
    return v;
}
 
/** Free a frame.
 *
 * Find respective frame structrue for supplied addr.
 * Decrement frame reference count.
 * If it drops to zero, move the frame structure to free list.
 *
 * @param addr Address of the frame to be freed. It must be a multiple of FRAME_SIZE.
 */
void frame_free(__address addr)
{
    ipl_t ipl;
    link_t *cur;
    zone_t *z;
    zone_t *zone = NULL;
    frame_t *frame;
    ASSERT(addr % FRAME_SIZE == 0);
   
    ipl = interrupts_disable();
    spinlock_lock(&zone_head_lock);
   
    /*
     * First, find host frame zone for addr.
     */
    for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {
        z = list_get_instance(cur, zone_t, link);
       
        spinlock_lock(&z->lock);
       
        if (IS_KA(addr))
            addr = KA2PA(addr);
       
        /*
         * Check if addr belongs to z.
         */
        if ((addr >= z->base) && (addr <= z->base + (z->free_count + z->busy_count) * FRAME_SIZE)) {
            zone = z;
            break;
        }
        spinlock_unlock(&z->lock);
    }
   
    ASSERT(zone != NULL);
   
    frame = ADDR2FRAME(zone, addr);
 
    ASSERT(frame->refcount);
 
    if (!--frame->refcount) {
        buddy_system_free(zone->buddy_system, &frame->buddy_link);
    }
 
    /* Update zone information. */
    zone->free_count += (1 << frame->buddy_order);
    zone->busy_count -= (1 << frame->buddy_order);
   
    spinlock_unlock(&zone->lock);
    spinlock_unlock(&zone_head_lock);
    interrupts_restore(ipl);
}
 
/** Mark frame region not free.
 *
 * Mark frame region not free.
 *
 * @param base Base address of non-available region.
 * @param size Size of non-available region.
 */
void frame_region_not_free(__address base, size_t size)
{
    index_t index;
    index = zone_blacklist_count++;
 
    /* Force base to the nearest lower address frame boundary. */
    base = ALIGN_DOWN(base, FRAME_SIZE);
    /* Align size to frame boundary. */
    size = ALIGN_UP(size, FRAME_SIZE);
 
    ASSERT(index < ZONE_BLACKLIST_SIZE);
    zone_blacklist[index].base = base;
    zone_blacklist[index].size = size;
}
 
/** Create frame zones in region of available memory.
 *
 * Avoid any black listed areas of non-available memory.
 * Assume that the black listed areas cannot overlap
 * one another or cross available memory region boundaries.
 *
 * @param base Base address of available memory region.
 * @param size Size of the region.
 */
void zone_create_in_region(__address base, size_t size) {
    int i;
    zone_t * z;
    __address s;
    size_t sz;
   
    ASSERT(base % FRAME_SIZE == 0);
    ASSERT(size % FRAME_SIZE == 0);
   
    if (!size)
        return;
 
    for (i = 0; i < zone_blacklist_count; i++) {
        if (zone_blacklist[i].base >= base && zone_blacklist[i].base < base + size) {
            s = base; sz = zone_blacklist[i].base - base;
            ASSERT(base != s || sz != size);
            zone_create_in_region(s, sz);
           
            s = zone_blacklist[i].base + zone_blacklist[i].size;
            sz = (base + size) - (zone_blacklist[i].base + zone_blacklist[i].size);
            ASSERT(base != s || sz != size);
            zone_create_in_region(s, sz);
            return;
       
        }
    }
   
    z = zone_create(base, size, 0);
 
    if (!z) {
        panic("Cannot allocate zone (base=%P, size=%d).\n", base, size);
    }
   
    zone_attach(z);
}
 
 
/** Create frame zone
 *
 * Create new frame zone.
 *
 * @param start Physical address of the first frame within the zone.
 * @param size Size of the zone. Must be a multiple of FRAME_SIZE.
 * @param flags Zone flags.
 *
 * @return Initialized zone.
 */
zone_t * zone_create(__address start, size_t size, int flags)
{
    zone_t *z;
    count_t cnt;
    int i;
    __u8 max_order;
 
    ASSERT(start % FRAME_SIZE == 0);
    ASSERT(size % FRAME_SIZE == 0);
   
    cnt = size / FRAME_SIZE;
   
    z = (zone_t *) early_malloc(sizeof(zone_t));
    if (z) {
        link_initialize(&z->link);
        spinlock_initialize(&z->lock, "zone_lock");
   
        z->base = start;
        z->flags = flags;
 
        z->free_count = cnt;
        z->busy_count = 0;
       
        z->frames = (frame_t *) early_malloc(cnt * sizeof(frame_t));
        if (!z->frames) {
            early_free(z);
            return NULL;
        }
       
        for (i = 0; i<cnt; i++) {
            frame_initialize(&z->frames[i], z);
        }
       
        /*
         * Create buddy system for the zone
         */
        for (max_order = 0; cnt >> max_order; max_order++)
            ;
        z->buddy_system = buddy_system_create(max_order, &zone_buddy_system_operations, (void *) z);
       
        /* Stuffing frames */
        for (i = 0; i<cnt; i++) {
            z->frames[i].refcount = 0;
            buddy_system_free(z->buddy_system, &z->frames[i].buddy_link);  
        }
    }
    return z;
}
 
/** Attach frame zone
 *
 * Attach frame zone to zone list.
 *
 * @param zone Zone to be attached.
 */
void zone_attach(zone_t *zone)
{
    ipl_t ipl;
   
    ipl = interrupts_disable();
    spinlock_lock(&zone_head_lock);
   
    list_append(&zone->link, &zone_head);
   
    spinlock_unlock(&zone_head_lock);
    interrupts_restore(ipl);
}
 
/** Initialize frame structure
 *
 * Initialize frame structure.
 *
 * @param frame Frame structure to be initialized.
 * @param zone Host frame zone.
 */
void frame_initialize(frame_t *frame, zone_t *zone)
{
    frame->refcount = 1;
    frame->buddy_order = 0;
}
 
 
/** Buddy system find_buddy implementation
 *
 * @param b Buddy system.
 * @param block Block for which buddy should be found
 *
 * @return Buddy for given block if found
 */
link_t * zone_buddy_find_buddy(buddy_system_t *b, link_t * block) {
    frame_t * frame;
    zone_t * zone;
    index_t index;
    bool is_left, is_right;
 
    frame = list_get_instance(block, frame_t, buddy_link);
    zone = (zone_t *) b->data;
   
    ASSERT(IS_BUDDY_ORDER_OK(FRAME_INDEX(zone, frame), frame->buddy_order));
   
    is_left = IS_BUDDY_LEFT_BLOCK(zone, frame);
    is_right = IS_BUDDY_RIGHT_BLOCK(zone, frame);
   
    ASSERT(is_left ^ is_right);
   
    if (is_left) {
        index = (FRAME_INDEX(zone, frame)) + (1 << frame->buddy_order);
    } else { // if (is_right)
        index = (FRAME_INDEX(zone, frame)) - (1 << frame->buddy_order);
    }
   
    if (FRAME_INDEX_VALID(zone, index)) {
        if (    zone->frames[index].buddy_order == frame->buddy_order &&
            zone->frames[index].refcount == 0) {
            return &zone->frames[index].buddy_link;
        }
    }
   
    return NULL;   
}
 
/** Buddy system bisect implementation
 *
 * @param b Buddy system.
 * @param block Block to bisect
 *
 * @return right block
 */
link_t * zone_buddy_bisect(buddy_system_t *b, link_t * block) {
    frame_t * frame_l, * frame_r;
 
    frame_l = list_get_instance(block, frame_t, buddy_link);
    frame_r = (frame_l + (1 << (frame_l->buddy_order - 1)));
   
    return &frame_r->buddy_link;
}
 
/** Buddy system coalesce implementation
 *
 * @param b Buddy system.
 * @param block_1 First block
 * @param block_2 First block's buddy
 *
 * @return Coalesced block (actually block that represents lower address)
 */
link_t * zone_buddy_coalesce(buddy_system_t *b, link_t * block_1, link_t * block_2) {
    frame_t * frame1, * frame2;
   
    frame1 = list_get_instance(block_1, frame_t, buddy_link);
    frame2 = list_get_instance(block_2, frame_t, buddy_link);
   
    return frame1 < frame2 ? block_1 : block_2;
}
 
/** Buddy system set_order implementation
 *
 * @param b Buddy system.
 * @param block Buddy system block
 * @param order Order to set
 */
void zone_buddy_set_order(buddy_system_t *b, link_t * block, __u8 order) {
    frame_t * frame;
    frame = list_get_instance(block, frame_t, buddy_link);
    frame->buddy_order = order;
}
 
/** Buddy system get_order implementation
 *
 * @param b Buddy system.
 * @param block Buddy system block
 *
 * @return Order of block
 */
__u8 zone_buddy_get_order(buddy_system_t *b, link_t * block) {
    frame_t * frame;
    frame = list_get_instance(block, frame_t, buddy_link);
    return frame->buddy_order;
}
 
/** Buddy system mark_busy implementation
 *
 * @param b Buddy system
 * @param block Buddy system block
 *
 */
void zone_buddy_mark_busy(buddy_system_t *b, link_t * block) {
    frame_t * frame;
    frame = list_get_instance(block, frame_t, buddy_link);
    frame->refcount = 1;
}
 

Rev 624	Rev 629
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/vm.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)
-		73	frame_region_not_free(KA2PA(config.init_addr), config.init_size);
72	}	74	}
73		75
74	frame_arch_init();	76	frame_arch_init();
75	}	77	}
76		78
77	/** Allocate power-of-two frames of physical memory.	79	/** Allocate power-of-two frames of physical memory.
78	*	80	*
79	* @param flags Flags for host zone selection and address processing.	81	* @param flags Flags for host zone selection and address processing.
80	* @param order Allocate exactly 2^order frames.	82	* @param order Allocate exactly 2^order frames.
81	*	83	*
82	* @return Allocated frame.	84	* @return Allocated frame.
83	*/	85	*/
84	__address frame_alloc(int flags, __u8 order)	86	__address frame_alloc(int flags, __u8 order)
85	{	87	{
86	ipl_t ipl;	88	ipl_t ipl;
87	link_t cur, tmp;	89	link_t cur, tmp;
88	zone_t *z;	90	zone_t *z;
89	zone_t *zone = NULL;	91	zone_t *zone = NULL;
90	frame_t *frame = NULL;	92	frame_t *frame = NULL;
91	__address v;	93	__address v;
92		94
93	loop:	95	loop:
94	ipl = interrupts_disable();	96	ipl = interrupts_disable();
95	spinlock_lock(&zone_head_lock);	97	spinlock_lock(&zone_head_lock);
96		98
97	/*	99	/*
98	* First, find suitable frame zone.	100	* First, find suitable frame zone.
99	*/	101	*/
100	for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {	102	for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {
101	z = list_get_instance(cur, zone_t, link);	103	z = list_get_instance(cur, zone_t, link);
102		104
103	spinlock_lock(&z->lock);	105	spinlock_lock(&z->lock);
104		106
105	/* Check if the zone has 2^order frames area available */	107	/* Check if the zone has 2^order frames area available */
106	if (buddy_system_can_alloc(z->buddy_system, order)) {	108	if (buddy_system_can_alloc(z->buddy_system, order)) {
107	zone = z;	109	zone = z;
108	break;	110	break;
109	}	111	}
110		112
111	spinlock_unlock(&z->lock);	113	spinlock_unlock(&z->lock);
112	}	114	}
113		115
114	if (!zone) {	116	if (!zone) {
115	if (flags & FRAME_PANIC)	117	if (flags & FRAME_PANIC)
116	panic("Can't allocate frame.\n");	118	panic("Can't allocate frame.\n");
117		119
118	/*	120	/*
119	* TODO: Sleep until frames are available again.	121	* TODO: Sleep until frames are available again.
120	*/	122	*/
121	spinlock_unlock(&zone_head_lock);	123	spinlock_unlock(&zone_head_lock);
122	interrupts_restore(ipl);	124	interrupts_restore(ipl);
123		125
124	panic("Sleep not implemented.\n");	126	panic("Sleep not implemented.\n");
125	goto loop;	127	goto loop;
126	}	128	}
127		129
128		130
129	/* Allocate frames from zone buddy system */	131	/* Allocate frames from zone buddy system */
130	tmp = buddy_system_alloc(zone->buddy_system, order);	132	tmp = buddy_system_alloc(zone->buddy_system, order);
131		133
132	ASSERT(tmp);	134	ASSERT(tmp);
133		135
134	/* Update zone information. */	136	/* Update zone information. */
135	zone->free_count -= (1 << order);	137	zone->free_count -= (1 << order);
136	zone->busy_count += (1 << order);	138	zone->busy_count += (1 << order);
137		139
138	/* Frame will be actually a first frame of the block. */	140	/* Frame will be actually a first frame of the block. */
139	frame = list_get_instance(tmp, frame_t, buddy_link);	141	frame = list_get_instance(tmp, frame_t, buddy_link);
140		142
141	/* get frame address */	143	/* get frame address */
142	v = FRAME2ADDR(zone, frame);	144	v = FRAME2ADDR(zone, frame);
143		145
144	spinlock_unlock(&zone->lock);	146	spinlock_unlock(&zone->lock);
145	spinlock_unlock(&zone_head_lock);	147	spinlock_unlock(&zone_head_lock);
146	interrupts_restore(ipl);	148	interrupts_restore(ipl);
147		149
148		150
149	if (flags & FRAME_KA)	151	if (flags & FRAME_KA)
150	v = PA2KA(v);	152	v = PA2KA(v);
151		153
152	return v;	154	return v;
153	}	155	}
154		156
155	/** Free a frame.	157	/** Free a frame.
156	*	158	*
157	* Find respective frame structrue for supplied addr.	159	* Find respective frame structrue for supplied addr.
158	* Decrement frame reference count.	160	* Decrement frame reference count.
159	* If it drops to zero, move the frame structure to free list.	161	* If it drops to zero, move the frame structure to free list.
160	*	162	*
161	* @param addr Address of the frame to be freed. It must be a multiple of FRAME_SIZE.	163	* @param addr Address of the frame to be freed. It must be a multiple of FRAME_SIZE.
162	*/	164	*/
163	void frame_free(__address addr)	165	void frame_free(__address addr)
164	{	166	{
165	ipl_t ipl;	167	ipl_t ipl;
166	link_t *cur;	168	link_t *cur;
167	zone_t *z;	169	zone_t *z;
168	zone_t *zone = NULL;	170	zone_t *zone = NULL;
169	frame_t *frame;	171	frame_t *frame;
170	ASSERT(addr % FRAME_SIZE == 0);	172	ASSERT(addr % FRAME_SIZE == 0);
171		173
172	ipl = interrupts_disable();	174	ipl = interrupts_disable();
173	spinlock_lock(&zone_head_lock);	175	spinlock_lock(&zone_head_lock);
174		176
175	/*	177	/*
176	* First, find host frame zone for addr.	178	* First, find host frame zone for addr.
177	*/	179	*/
178	for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {	180	for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {
179	z = list_get_instance(cur, zone_t, link);	181	z = list_get_instance(cur, zone_t, link);
180		182
181	spinlock_lock(&z->lock);	183	spinlock_lock(&z->lock);
182		184
183	if (IS_KA(addr))	185	if (IS_KA(addr))
184	addr = KA2PA(addr);	186	addr = KA2PA(addr);
185		187
186	/*	188	/*
187	* Check if addr belongs to z.	189	* Check if addr belongs to z.
188	*/	190	*/
189	if ((addr >= z->base) && (addr <= z->base + (z->free_count + z->busy_count) * FRAME_SIZE)) {	191	if ((addr >= z->base) && (addr <= z->base + (z->free_count + z->busy_count) * FRAME_SIZE)) {
190	zone = z;	192	zone = z;
191	break;	193	break;
192	}	194	}
193	spinlock_unlock(&z->lock);	195	spinlock_unlock(&z->lock);
194	}	196	}
195		197
196	ASSERT(zone != NULL);	198	ASSERT(zone != NULL);
197		199
198	frame = ADDR2FRAME(zone, addr);	200	frame = ADDR2FRAME(zone, addr);
199		201
200	ASSERT(frame->refcount);	202	ASSERT(frame->refcount);
201		203
202	if (!--frame->refcount) {	204	if (!--frame->refcount) {
203	buddy_system_free(zone->buddy_system, &frame->buddy_link);	205	buddy_system_free(zone->buddy_system, &frame->buddy_link);
204	}	206	}
205		207
206	/* Update zone information. */	208	/* Update zone information. */
207	zone->free_count += (1 << frame->buddy_order);	209	zone->free_count += (1 << frame->buddy_order);
208	zone->busy_count -= (1 << frame->buddy_order);	210	zone->busy_count -= (1 << frame->buddy_order);
209		211
210	spinlock_unlock(&zone->lock);	212	spinlock_unlock(&zone->lock);
211	spinlock_unlock(&zone_head_lock);	213	spinlock_unlock(&zone_head_lock);
212	interrupts_restore(ipl);	214	interrupts_restore(ipl);
213	}	215	}
214		216
215	/** Mark frame region not free.	217	/** Mark frame region not free.
216	*	218	*
217	* Mark frame region not free.	219	* Mark frame region not free.
218	*	220	*
219	* @param base Base address of non-available region.	221	* @param base Base address of non-available region.
220	* @param size Size of non-available region.	222	* @param size Size of non-available region.
221	*/	223	*/
222	void frame_region_not_free(__address base, size_t size)	224	void frame_region_not_free(__address base, size_t size)
223	{	225	{
224	index_t index;	226	index_t index;
225	index = zone_blacklist_count++;	227	index = zone_blacklist_count++;
226		228
227	/* Force base to the nearest lower address frame boundary. */	229	/* Force base to the nearest lower address frame boundary. */
228	base = ALIGN_DOWN(base, FRAME_SIZE);	230	base = ALIGN_DOWN(base, FRAME_SIZE);
229	/* Align size to frame boundary. */	231	/* Align size to frame boundary. */
230	size = ALIGN_UP(size, FRAME_SIZE);	232	size = ALIGN_UP(size, FRAME_SIZE);
231		233
232	ASSERT(index < ZONE_BLACKLIST_SIZE);	234	ASSERT(index < ZONE_BLACKLIST_SIZE);
233	zone_blacklist[index].base = base;	235	zone_blacklist[index].base = base;
234	zone_blacklist[index].size = size;	236	zone_blacklist[index].size = size;
235	}	237	}
236		238
237	/** Create frame zones in region of available memory.	239	/** Create frame zones in region of available memory.
238	*	240	*
239	* Avoid any black listed areas of non-available memory.	241	* Avoid any black listed areas of non-available memory.
240	* Assume that the black listed areas cannot overlap	242	* Assume that the black listed areas cannot overlap
241	* one another or cross available memory region boundaries.	243	* one another or cross available memory region boundaries.
242	*	244	*
243	* @param base Base address of available memory region.	245	* @param base Base address of available memory region.
244	* @param size Size of the region.	246	* @param size Size of the region.
245	*/	247	*/
246	void zone_create_in_region(__address base, size_t size) {	248	void zone_create_in_region(__address base, size_t size) {
247	int i;	249	int i;
248	zone_t * z;	250	zone_t * z;
249	__address s;	251	__address s;
250	size_t sz;	252	size_t sz;
251		253
252	ASSERT(base % FRAME_SIZE == 0);	254	ASSERT(base % FRAME_SIZE == 0);
253	ASSERT(size % FRAME_SIZE == 0);	255	ASSERT(size % FRAME_SIZE == 0);
254		256
255	if (!size)	257	if (!size)
256	return;	258	return;
257		259
258	for (i = 0; i < zone_blacklist_count; i++) {	260	for (i = 0; i < zone_blacklist_count; i++) {
259	if (zone_blacklist[i].base >= base && zone_blacklist[i].base < base + size) {	261	if (zone_blacklist[i].base >= base && zone_blacklist[i].base < base + size) {
260	s = base; sz = zone_blacklist[i].base - base;	262	s = base; sz = zone_blacklist[i].base - base;
261	ASSERT(base != s \|\| sz != size);	263	ASSERT(base != s \|\| sz != size);
262	zone_create_in_region(s, sz);	264	zone_create_in_region(s, sz);
263		265
264	s = zone_blacklist[i].base + zone_blacklist[i].size;	266	s = zone_blacklist[i].base + zone_blacklist[i].size;
265	sz = (base + size) - (zone_blacklist[i].base + zone_blacklist[i].size);	267	sz = (base + size) - (zone_blacklist[i].base + zone_blacklist[i].size);
266	ASSERT(base != s \|\| sz != size);	268	ASSERT(base != s \|\| sz != size);
267	zone_create_in_region(s, sz);	269	zone_create_in_region(s, sz);
268	return;	270	return;
269		271
270	}	272	}
271	}	273	}
272		274
273	z = zone_create(base, size, 0);	275	z = zone_create(base, size, 0);
274		276
275	if (!z) {	277	if (!z) {
276	panic("Cannot allocate zone (base=%P, size=%d).\n", base, size);	278	panic("Cannot allocate zone (base=%P, size=%d).\n", base, size);
277	}	279	}
278		280
279	zone_attach(z);	281	zone_attach(z);
280	}	282	}
281		283
282		284
283	/** Create frame zone	285	/** Create frame zone
284	*	286	*
285	* Create new frame zone.	287	* Create new frame zone.
286	*	288	*
287	* @param start Physical address of the first frame within the zone.	289	* @param start Physical address of the first frame within the zone.
288	* @param size Size of the zone. Must be a multiple of FRAME_SIZE.	290	* @param size Size of the zone. Must be a multiple of FRAME_SIZE.
289	* @param flags Zone flags.	291	* @param flags Zone flags.
290	*	292	*
291	* @return Initialized zone.	293	* @return Initialized zone.
292	*/	294	*/
293	zone_t * zone_create(__address start, size_t size, int flags)	295	zone_t * zone_create(__address start, size_t size, int flags)
294	{	296	{
295	zone_t *z;	297	zone_t *z;
296	count_t cnt;	298	count_t cnt;
297	int i;	299	int i;
298	__u8 max_order;	300	__u8 max_order;
299		301
300	ASSERT(start % FRAME_SIZE == 0);	302	ASSERT(start % FRAME_SIZE == 0);
301	ASSERT(size % FRAME_SIZE == 0);	303	ASSERT(size % FRAME_SIZE == 0);
302		304
303	cnt = size / FRAME_SIZE;	305	cnt = size / FRAME_SIZE;
304		306
305	z = (zone_t *) early_malloc(sizeof(zone_t));	307	z = (zone_t *) early_malloc(sizeof(zone_t));
306	if (z) {	308	if (z) {
307	link_initialize(&z->link);	309	link_initialize(&z->link);
308	spinlock_initialize(&z->lock, "zone_lock");	310	spinlock_initialize(&z->lock, "zone_lock");
309		311
310	z->base = start;	312	z->base = start;
311	z->flags = flags;	313	z->flags = flags;
312		314
313	z->free_count = cnt;	315	z->free_count = cnt;
314	z->busy_count = 0;	316	z->busy_count = 0;
315		317
316	z->frames = (frame_t ) early_malloc(cnt sizeof(frame_t));	318	z->frames = (frame_t ) early_malloc(cnt sizeof(frame_t));
317	if (!z->frames) {	319	if (!z->frames) {
318	early_free(z);	320	early_free(z);
319	return NULL;	321	return NULL;
320	}	322	}
321		323
322	for (i = 0; i<cnt; i++) {	324	for (i = 0; i<cnt; i++) {
323	frame_initialize(&z->frames[i], z);	325	frame_initialize(&z->frames[i], z);
324	}	326	}
325		327
326	/*	328	/*
327	* Create buddy system for the zone	329	* Create buddy system for the zone
328	*/	330	*/
329	for (max_order = 0; cnt >> max_order; max_order++)	331	for (max_order = 0; cnt >> max_order; max_order++)
330	;	332	;
331	z->buddy_system = buddy_system_create(max_order, &zone_buddy_system_operations, (void *) z);	333	z->buddy_system = buddy_system_create(max_order, &zone_buddy_system_operations, (void *) z);
332		334
333	/* Stuffing frames */	335	/* Stuffing frames */
334	for (i = 0; i<cnt; i++) {	336	for (i = 0; i<cnt; i++) {
335	z->frames[i].refcount = 0;	337	z->frames[i].refcount = 0;
336	buddy_system_free(z->buddy_system, &z->frames[i].buddy_link);	338	buddy_system_free(z->buddy_system, &z->frames[i].buddy_link);
337	}	339	}
338	}	340	}
339	return z;	341	return z;
340	}	342	}
341		343
342	/** Attach frame zone	344	/** Attach frame zone
343	*	345	*
344	* Attach frame zone to zone list.	346	* Attach frame zone to zone list.
345	*	347	*
346	* @param zone Zone to be attached.	348	* @param zone Zone to be attached.
347	*/	349	*/
348	void zone_attach(zone_t *zone)	350	void zone_attach(zone_t *zone)
349	{	351	{
350	ipl_t ipl;	352	ipl_t ipl;
351		353
352	ipl = interrupts_disable();	354	ipl = interrupts_disable();
353	spinlock_lock(&zone_head_lock);	355	spinlock_lock(&zone_head_lock);
354		356
355	list_append(&zone->link, &zone_head);	357	list_append(&zone->link, &zone_head);
356		358
357	spinlock_unlock(&zone_head_lock);	359	spinlock_unlock(&zone_head_lock);
358	interrupts_restore(ipl);	360	interrupts_restore(ipl);
359	}	361	}
360		362
361	/** Initialize frame structure	363	/** Initialize frame structure
362	*	364	*
363	* Initialize frame structure.	365	* Initialize frame structure.
364	*	366	*
365	* @param frame Frame structure to be initialized.	367	* @param frame Frame structure to be initialized.
366	* @param zone Host frame zone.	368	* @param zone Host frame zone.
367	*/	369	*/
368	void frame_initialize(frame_t frame, zone_t zone)	370	void frame_initialize(frame_t frame, zone_t zone)
369	{	371	{
370	frame->refcount = 1;	372	frame->refcount = 1;
371	frame->buddy_order = 0;	373	frame->buddy_order = 0;
372	}	374	}
373		375
374		376
375	/** Buddy system find_buddy implementation	377	/** Buddy system find_buddy implementation
376	*	378	*
377	* @param b Buddy system.	379	* @param b Buddy system.
378	* @param block Block for which buddy should be found	380	* @param block Block for which buddy should be found
379	*	381	*
380	* @return Buddy for given block if found	382	* @return Buddy for given block if found
381	*/	383	*/
382	link_t * zone_buddy_find_buddy(buddy_system_t b, link_t block) {	384	link_t * zone_buddy_find_buddy(buddy_system_t b, link_t block) {
383	frame_t * frame;	385	frame_t * frame;
384	zone_t * zone;	386	zone_t * zone;
385	index_t index;	387	index_t index;
386	bool is_left, is_right;	388	bool is_left, is_right;
387		389
388	frame = list_get_instance(block, frame_t, buddy_link);	390	frame = list_get_instance(block, frame_t, buddy_link);
389	zone = (zone_t *) b->data;	391	zone = (zone_t *) b->data;
390		392
391	ASSERT(IS_BUDDY_ORDER_OK(FRAME_INDEX(zone, frame), frame->buddy_order));	393	ASSERT(IS_BUDDY_ORDER_OK(FRAME_INDEX(zone, frame), frame->buddy_order));
392		394
393	is_left = IS_BUDDY_LEFT_BLOCK(zone, frame);	395	is_left = IS_BUDDY_LEFT_BLOCK(zone, frame);
394	is_right = IS_BUDDY_RIGHT_BLOCK(zone, frame);	396	is_right = IS_BUDDY_RIGHT_BLOCK(zone, frame);
395		397
396	ASSERT(is_left ^ is_right);	398	ASSERT(is_left ^ is_right);
397		399
398	if (is_left) {	400	if (is_left) {
399	index = (FRAME_INDEX(zone, frame)) + (1 << frame->buddy_order);	401	index = (FRAME_INDEX(zone, frame)) + (1 << frame->buddy_order);
400	} else { // if (is_right)	402	} else { // if (is_right)
401	index = (FRAME_INDEX(zone, frame)) - (1 << frame->buddy_order);	403	index = (FRAME_INDEX(zone, frame)) - (1 << frame->buddy_order);
402	}	404	}
403		405
404	if (FRAME_INDEX_VALID(zone, index)) {	406	if (FRAME_INDEX_VALID(zone, index)) {
405	if ( zone->frames[index].buddy_order == frame->buddy_order &&	407	if ( zone->frames[index].buddy_order == frame->buddy_order &&
406	zone->frames[index].refcount == 0) {	408	zone->frames[index].refcount == 0) {
407	return &zone->frames[index].buddy_link;	409	return &zone->frames[index].buddy_link;
408	}	410	}
409	}	411	}
410		412
411	return NULL;	413	return NULL;
412	}	414	}
413		415
414	/** Buddy system bisect implementation	416	/** Buddy system bisect implementation
415	*	417	*
416	* @param b Buddy system.	418	* @param b Buddy system.
417	* @param block Block to bisect	419	* @param block Block to bisect
418	*	420	*
419	* @return right block	421	* @return right block
420	*/	422	*/
421	link_t * zone_buddy_bisect(buddy_system_t b, link_t block) {	423	link_t * zone_buddy_bisect(buddy_system_t b, link_t block) {
422	frame_t * frame_l, * frame_r;	424	frame_t * frame_l, * frame_r;
423		425
424	frame_l = list_get_instance(block, frame_t, buddy_link);	426	frame_l = list_get_instance(block, frame_t, buddy_link);
425	frame_r = (frame_l + (1 << (frame_l->buddy_order - 1)));	427	frame_r = (frame_l + (1 << (frame_l->buddy_order - 1)));
426		428
427	return &frame_r->buddy_link;	429	return &frame_r->buddy_link;
428	}	430	}
429		431
430	/** Buddy system coalesce implementation	432	/** Buddy system coalesce implementation
431	*	433	*
432	* @param b Buddy system.	434	* @param b Buddy system.
433	* @param block_1 First block	435	* @param block_1 First block
434	* @param block_2 First block's buddy	436	* @param block_2 First block's buddy
435	*	437	*
436	* @return Coalesced block (actually block that represents lower address)	438	* @return Coalesced block (actually block that represents lower address)
437	*/	439	*/
438	link_t * zone_buddy_coalesce(buddy_system_t b, link_t block_1, link_t * block_2) {	440	link_t * zone_buddy_coalesce(buddy_system_t b, link_t block_1, link_t * block_2) {
439	frame_t * frame1, * frame2;	441	frame_t * frame1, * frame2;
440		442
441	frame1 = list_get_instance(block_1, frame_t, buddy_link);	443	frame1 = list_get_instance(block_1, frame_t, buddy_link);
442	frame2 = list_get_instance(block_2, frame_t, buddy_link);	444	frame2 = list_get_instance(block_2, frame_t, buddy_link);
443		445
444	return frame1 < frame2 ? block_1 : block_2;	446	return frame1 < frame2 ? block_1 : block_2;
445	}	447	}
446		448
447	/** Buddy system set_order implementation	449	/** Buddy system set_order implementation
448	*	450	*
449	* @param b Buddy system.	451	* @param b Buddy system.
450	* @param block Buddy system block	452	* @param block Buddy system block
451	* @param order Order to set	453	* @param order Order to set
452	*/	454	*/
453	void zone_buddy_set_order(buddy_system_t b, link_t block, __u8 order) {	455	void zone_buddy_set_order(buddy_system_t b, link_t block, __u8 order) {
454	frame_t * frame;	456	frame_t * frame;
455	frame = list_get_instance(block, frame_t, buddy_link);	457	frame = list_get_instance(block, frame_t, buddy_link);
456	frame->buddy_order = order;	458	frame->buddy_order = order;
457	}	459	}
458		460
459	/** Buddy system get_order implementation	461	/** Buddy system get_order implementation
460	*	462	*
461	* @param b Buddy system.	463	* @param b Buddy system.
462	* @param block Buddy system block	464	* @param block Buddy system block
463	*	465	*
464	* @return Order of block	466	* @return Order of block
465	*/	467	*/
466	__u8 zone_buddy_get_order(buddy_system_t b, link_t block) {	468	__u8 zone_buddy_get_order(buddy_system_t b, link_t block) {
467	frame_t * frame;	469	frame_t * frame;
468	frame = list_get_instance(block, frame_t, buddy_link);	470	frame = list_get_instance(block, frame_t, buddy_link);
469	return frame->buddy_order;	471	return frame->buddy_order;
470	}	472	}
471		473
472	/** Buddy system mark_busy implementation	474	/** Buddy system mark_busy implementation
473	*	475	*
474	* @param b Buddy system	476	* @param b Buddy system
475	* @param block Buddy system block	477	* @param block Buddy system block
476	*	478	*
477	*/	479	*/
478	void zone_buddy_mark_busy(buddy_system_t b, link_t block) {	480	void zone_buddy_mark_busy(buddy_system_t b, link_t block) {
479	frame_t * frame;	481	frame_t * frame;
480	frame = list_get_instance(block, frame_t, buddy_link);	482	frame = list_get_instance(block, frame_t, buddy_link);
481	frame->refcount = 1;	483	frame->refcount = 1;
482	}	484	}
483		485

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/mm/frame.c @ 624 – Rev 624 → 629